RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-20 19:42:54 +02:00
Code Issues Projects Releases Wiki Activity
87,510 Commits 4 Branches 5 Tags 704 MiB
1a0271f07b
Commit Graph

43 Commits

Author SHA1 Message Date
Nadav Rotem
ca05f9e72b Teach the cost model about the optimization in r169904: Truncation of induction variables costs the same as scalar trunc. 
llvm-svn: 170051
 2012-12-13 00:21:03 +00:00
Nadav Rotem
2c25a05088 LoopVectorizer: Use the "optsize" attribute to decide if we are allowed to increase the function size. 
llvm-svn: 170004
 2012-12-12 19:29:45 +00:00
Nadav Rotem
054379720d PR14574. Fix a bug in the code that calculates the mask the converted PHIs in if-conversion. 
llvm-svn: 169916
 2012-12-11 21:30:14 +00:00
Nadav Rotem
fb45c4d6b4 Loop Vectorize: optimize the vectorization of trunc(induction_var). The truncation is now done on scalars. 
llvm-svn: 169904
 2012-12-11 18:58:10 +00:00
Nadav Rotem
0715a221d8 Fix PR14565. Don't if-convert loops that have switch statements in them. 
llvm-svn: 169813
 2012-12-11 04:55:10 +00:00
Nadav Rotem
196fc7cc8c Add support for reverse induction variables. For example: 
while (i--)
 sum+=A[i];

llvm-svn: 169752
 2012-12-10 19:25:06 +00:00
Paul Redmond
e43761293d LoopVectorize: support vectorizing intrinsic calls 
- added function to VectorTargetTransformInfo to query cost of intrinsics
- vectorize trivially vectorizable intrinsic calls such as sin, cos, log, etc.

Reviewed by: Nadav

llvm-svn: 169711
 2012-12-09 20:42:17 +00:00
Nadav Rotem
452993ad1a Fix a bug in vectorization of if-converted reduction variables. If the 
reduction variable is not used outside the loop then we ran into an
endless loop. This change checks if we found the original PHI.

llvm-svn: 169324
 2012-12-04 22:40:22 +00:00
Nadav Rotem
4f22c83996 Add support for reduction variables when IF-conversion is enabled. 
llvm-svn: 169288
 2012-12-04 18:17:33 +00:00
Nadav Rotem
43d200ded1 Add the last part that is needed for vectorization of if-converted code. 
Added the code that actually performs the if-conversion during vectorization.

We can now vectorize this code:

for (int i=0; i<n; ++i) {
  unsigned k = 0;

  if (a[i] > b[i])   <------ IF inside the loop.
    k = k * 5 + 3;

  a[i] = k;          <---- K is a phi node that becomes vector-select.
}

llvm-svn: 169217
 2012-12-04 06:15:11 +00:00
Nadav Rotem
c973546f75 Add support for pointer induction variables even when there is no integer induction variable. 
llvm-svn: 168558
 2012-11-25 08:41:35 +00:00
Nadav Rotem
6ff38dc8d2 LoopVectorizer: Add initial support for pointer induction variables (for example: *dst++ = *src++). 
At the moment we still require to have an integer induction variable (for example: i++).

llvm-svn: 168231
 2012-11-17 00:27:03 +00:00
Duncan Sands
8c43343240 Relax the restrictions on vector of pointer types, and vector getelementptr. 
Previously in a vector of pointers, the pointer couldn't be any pointer type,
it had to be a pointer to an integer or floating point type.  This is a hassle
for dragonegg because the GCC vectorizer happily produces vectors of pointers
where the pointer is a pointer to a struct or whatever.  Vector getelementptr
was restricted to just one index, but now that vectors of pointers can have
any pointer type it is more natural to allow arbitrary vector getelementptrs.
There is however the issue of struct GEPs, where if each lane chose different
struct fields then from that point on each lane will be working down into
unrelated types.  This seems like too much pain for too little gain, so when
you have a vector struct index all the elements are required to be the same.

llvm-svn: 167828
 2012-11-13 12:59:33 +00:00
Nadav Rotem
ee232d62d1 Add support for memory runtime check. When we can, we calculate array bounds. 
If the arrays are found to be disjoint then we run the vectorized version of
the loop. If they are not, we run the scalar code.

llvm-svn: 167608
 2012-11-09 07:09:44 +00:00
Nadav Rotem
2fb5dc3a15 Cost Model: add tables for some avx type-conversion hacks. 
llvm-svn: 167480
 2012-11-06 19:33:53 +00:00
Nadav Rotem
8ddfd47801 Code Model: Improve the accuracy of the zext/sext/trunc vector cost estimation. 
llvm-svn: 167412
 2012-11-05 22:20:53 +00:00
Nadav Rotem
4def3aace5 Implement the cost of abnormal x86 instruction lowering as a table. 
llvm-svn: 167395
 2012-11-05 19:32:46 +00:00
Nadav Rotem
0a30b41020 LoopVectorize: Preserve NSW, NUW and IsExact flags. 
llvm-svn: 167174
 2012-10-31 21:40:39 +00:00
Nadav Rotem
e3083d1688 Fix a bug in the cost calculation of vector casts. Detect situations where bitcasts cost zero. 
llvm-svn: 167170
 2012-10-31 20:52:26 +00:00
Nadav Rotem
9ab0e93cc1 LoopVectorize: Do not vectorize loops with tiny constant trip counts. 
llvm-svn: 167101
 2012-10-31 03:31:07 +00:00
Nadav Rotem
240ead98fd Add support for loops that don't start with Zero. 
This is important for loops in the LAPACK test-suite.
These loops start at 1 because they are auto-converted from fortran.

llvm-svn: 167084
 2012-10-31 00:45:26 +00:00
Nadav Rotem
69e6bca813 LoopVectorize: Add support for write-only loops when the write destination is a single pointer. 
Speedup SciMark by 1%

llvm-svn: 167035
 2012-10-30 18:36:45 +00:00
Nadav Rotem
4fc2912062 LoopVectorize: Fix a bug in the initialization of reduction variables. AND needs to start at all-one 
while XOR, and OR need to start at zero.

llvm-svn: 167032
 2012-10-30 18:12:36 +00:00
Nadav Rotem
04f3086065 1. Fix a bug in getTypeConversion. When a *simple* type is split, we need to return the type of the split result. 
2. Change the maximum vectorization width from 4 to 8.
3. A test for both.

llvm-svn: 166864
 2012-10-27 04:11:32 +00:00
Nadav Rotem
133e437c48 Refactor the VectorTargetTransformInfo interface. 
Add getCostXXX calls for different families of opcodes, such as casts, arithmetic, cmp, etc.

Port the LoopVectorizer to the new API.

The LoopVectorizer now finds instructions which will remain uniform after vectorization. It uses this information when calculating the cost of these instructions.

llvm-svn: 166836
 2012-10-26 23:49:28 +00:00
Nadav Rotem
137991e110 Move the target-specific tests, which require specific backends, to dirs that only run if the target is present. 
llvm-svn: 166796
 2012-10-26 18:52:01 +00:00
Nadav Rotem
0ccb9515e1 Fix the cost-model test. 
llvm-svn: 166722
 2012-10-25 21:42:50 +00:00
Nadav Rotem
58110e0478 Add the cpu model to the test. 
llvm-svn: 166718
 2012-10-25 21:18:42 +00:00
Nadav Rotem
5635a9350f Add support for additional reduction variables: AND, OR, XOR. 
Patch by Paul Redmond <paul.redmond@intel.com>.

llvm-svn: 166649
 2012-10-25 00:08:41 +00:00
Nadav Rotem
9d7ba0ef55 Implement a basic cost model for vector and scalar instructions. 
llvm-svn: 166642
 2012-10-24 23:47:38 +00:00
Nadav Rotem
05d9e80245 LoopVectorizer: Add a basic cost model which uses the VTTI interface. 
llvm-svn: 166620
 2012-10-24 20:36:32 +00:00
Nadav Rotem
3deae09579 Use the AliasAnalysis isIdentifiedObj because it also understands mallocs and c++ news. 
PR14158.

llvm-svn: 166491
 2012-10-23 18:44:18 +00:00
Nadav Rotem
302d4b678a Don't crash if the load/store pointer is not a GEP. 
Fix by Shivarama Rao <Shivarama.Rao@amd.com>

llvm-svn: 166427
 2012-10-22 18:27:56 +00:00
Nadav Rotem
6b56385c1a Vectorizer: optimize the generation of selects. If the condition is uniform, generate a scalar-cond select (i1 as selector). 
llvm-svn: 166409
 2012-10-22 04:38:00 +00:00
Nadav Rotem
380fe201de Fix a bug in the vectorization of wide load/store operations. 
We used a SCEV to detect that A[X] is consecutive. We assumed that X was
the induction variable. But X can be any expression that uses the induction
for example: X = i + 2;

llvm-svn: 166388
 2012-10-21 06:49:10 +00:00
Nadav Rotem
825cda19d5 Add support for reduction variables that do not start at zero. 
This is important for nested-loop reductions such as :

In the innermost loop, the induction variable does not start with zero:

for (i = 0 .. n)
 for (j = 0 .. m)
  sum += ...

llvm-svn: 166387
 2012-10-21 05:52:51 +00:00
Nadav Rotem
763abacb83 Vectorizer: fix a bug in the classification of induction/reduction phis. 
llvm-svn: 166384
 2012-10-21 02:38:01 +00:00
Nadav Rotem
2ee8edf34a Fix an infinite loop in the loop-vectorizer. 
PR14134.

llvm-svn: 166379
 2012-10-20 20:45:01 +00:00
Nadav Rotem
cdd573e703 Vectorize: teach cavVectorizeMemory to distinguish between A[i]+=x and A[B[i]]+=x. 
If the pointer is consecutive then it is safe to read and write. If the pointer is non-loop-consecutive then
it is unsafe to vectorize it because we may hit an ordering issue.

llvm-svn: 166371
 2012-10-20 08:26:33 +00:00
Nadav Rotem
8fe03aa4c1 Vectorizer: Add support for loop reductions. 
For example:

  for (i=0; i<n; i++)
   sum += A[i] +  B[i] + i;

llvm-svn: 166351
 2012-10-19 23:05:40 +00:00
Nadav Rotem
451f76acc3 vectorizer: Add support for reading and writing from the same memory location. 
llvm-svn: 166255
 2012-10-19 01:24:18 +00:00
Nadav Rotem
fd924ec3c6 Vectorizer: Add support for loops with an unknown count. For example: 
for (i=0; i<n; i++){
        a[i] = b[i+1] + c[i+3];
     }

llvm-svn: 166165
 2012-10-18 05:29:12 +00:00
Nadav Rotem
8303c909c7 Add a loop vectorizer. 
llvm-svn: 166112
 2012-10-17 18:25:06 +00:00