RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-22 04:22:57 +02:00
Code Issues Projects Releases Wiki Activity
39,242 Commits 4 Branches 5 Tags 704 MiB
98322ead14
Commit Graph

76 Commits

Author SHA1 Message Date
Matthijs Kooijman
98322ead14 Remove trailing whitespace after line continuations in test cases to them work. 
This fixes two test cases that were not being run properly before.

llvm-svn: 52179
 2008-06-10 15:07:07 +00:00
Matthijs Kooijman
82d762a948 Suppress the (stderr) output of -aa-eval, this fixes 5 tests. 
llvm-svn: 52173
 2008-06-10 12:39:15 +00:00
Wojciech Matyjewicz
06e4c8a420 Fixes PR2395. Looking for a constant in a GEP tail (when the first GEP 
is longer than the second one) should stop after finding one. Added break 
instruction guarantees it. It also changes difference between offsets to 
absolute value of this difference in the condition.

llvm-svn: 51875
 2008-06-02 17:26:12 +00:00
Owen Anderson
2a0090d9bc Move these tests into the proper directory. 
llvm-svn: 51685
 2008-05-29 16:30:29 +00:00
Nick Lewycky
0ba4adf4ef Whoops -- forgot PR reference on this test. 
llvm-svn: 51569
 2008-05-26 20:23:33 +00:00
Nick Lewycky
7116ad5a18 Use {} instead of "" in RUN lines. 
llvm-svn: 51561
 2008-05-26 01:27:08 +00:00
Nick Lewycky
f24743a6bb Don't treat values as signed when looking at loop steppings in HowForToNonZero. 
llvm-svn: 51560
 2008-05-25 23:43:32 +00:00
Dan Gohman
2412469191 Remove lingering references to .llx and .tr in the tests. 
llvm-svn: 51500
 2008-05-23 21:15:35 +00:00
Gabor Greif
807c2df887 sabre brings to my attention that the 'tr' suffix is also obsolete 
llvm-svn: 51349
 2008-05-20 21:00:03 +00:00
Gabor Greif
d8a4dbb5da Rename the last test with .llx extension to .ll, resolve duplicate test by renaming to isnan2. Now that no test has llx ending there is no need to search for them from dg.exp too. 
llvm-svn: 51328
 2008-05-20 19:52:04 +00:00
Owen Anderson
3e607df2f8 Fix this test. It was testing broken behavior in that it required ADCE to eliminate 
a potentially infinite loop, which is undesirable.  Instead, test the LICM behavior
that we're really interested in.

llvm-svn: 51177
 2008-05-16 04:25:09 +00:00
Owen Anderson
611b415d12 Fix PR1098 by correcting the postdominators analysis. 
Patch by Florian Brandner.

llvm-svn: 50628
 2008-05-04 21:07:35 +00:00
Chris Lattner
a9d8d647ca rename *.llx -> *.ll, last batch. 
llvm-svn: 49971
 2008-04-19 22:32:52 +00:00
Owen Anderson
cd1b9c4b43 Make GVN able to remove unnecessary calls to read-only functions again. 
llvm-svn: 49842
 2008-04-17 05:36:50 +00:00
Dale Johannesen
45e14f7753 Don't assume a tail call can't reference a byval 
argument to the outer function, this isn't correct.

llvm-svn: 49731
 2008-04-15 17:41:34 +00:00
Owen Anderson
a6d1d8dec2 The functionality being tested was removed because it was horribly unsafe. 
llvm-svn: 49610
 2008-04-13 09:51:06 +00:00
Duncan Sands
79af9d68ec Testcase for pr2169. 
llvm-svn: 49344
 2008-04-07 17:03:16 +00:00
Duncan Sands
8e40ac013e Testcase for PR2160. 
llvm-svn: 48655
 2008-03-21 20:22:11 +00:00
Daniel Berlin
0f20fa71ba Fix PR 2160 by making sure arguments to external functions get marked as pointing to anything 
llvm-svn: 48509
 2008-03-18 22:22:53 +00:00
Gabor Greif
fd0fb616f8 Fix http://llvm.org/bugs/show_bug.cgi?id=2104 by ordering lexicographically what gets printed. Be const-correct in PrintResults and uninline it too 
llvm-svn: 47712
 2008-02-28 08:38:45 +00:00
Evan Cheng
e283043860 Temporarily reverting 46959. 
llvm-svn: 47542
 2008-02-25 03:57:32 +00:00
Nick Lewycky
0b6cdd1eff Add 'umax' similar to 'smax' SCEV. Closes PR2003. 
Parse reversed smax and umax as smin and umin and express them with negative
or binary-not SCEVs (which are really just subtract under the hood).

Parse 'xor %x, -1' as (-1 - %x).

Remove dead code (ConstantInt::get always returns a ConstantInt).

Don't use getIntegerSCEV(-1, Ty). The first value is an int, then it gets
passed into a uint64_t. Instead, create the -1 directly from
ConstantInt::getAllOnesValue().

llvm-svn: 47360
 2008-02-20 06:48:22 +00:00
Tanya Lattner
f37f44f9ec Remove llvm-upgrade. 
llvm-svn: 47110
 2008-02-14 06:56:27 +00:00
Wojciech Matyjewicz
6df5450bc4 Now that ScalarEvolution::print writes to the correct stream, there is 
no need to redirect stderr into stdout.

llvm-svn: 47009
 2008-02-12 15:12:40 +00:00
Wojciech Matyjewicz
ae01857e92 Change negative grep into positive one in my yesterday's testcase. 
llvm-svn: 47008
 2008-02-12 15:10:35 +00:00
Wojciech Matyjewicz
b6e6dacc60 Fix PR2002. Suppose n is the initial value for the induction 
variable (with step 1) and m is its final value. Then, the correct trip 
count is SMAX(m,n)-n. Previously, we used SMAX(0,m-n), but m-n may 
overflow and can't in general be interpreted as signed.

Patch by Nick Lewycky.

llvm-svn: 47007
 2008-02-12 15:09:36 +00:00
Wojciech Matyjewicz
2874a19254 If the LHS of the comparison is a loop-invariant we also want to move it 
to the RHS. This simple change allows to compute loop iteration count 
for loops with condition similar to the one in the testcase (which seems 
to be quite common).

llvm-svn: 46959
 2008-02-11 18:37:34 +00:00
Wojciech Matyjewicz
76c2b22ee4 Fix PR1798 - an error in the evaluation of SCEVAddRecExpr at an 
arbitrary iteration.

The patch:
1) changes SCEVSDivExpr into SCEVUDivExpr,
2) replaces PartialFact() function with BinomialCoefficient(); the 
computations (essentially, the division) in BinomialCoefficient() are 
performed with the apprioprate bitwidth necessary to avoid overflow; 
unsigned division is used instead of the signed one.

Computations in BinomialCoefficient() require support from the code 
generator for APInts. Currently, we use a hack rounding up the 
neccessary bitwidth to the nearest power of 2. The hack is easy to turn 
off in future.

One remaining issue: we assume the divisor of the binomial coefficient 
formula can be computed accurately using 16 bits. It means we can handle 
AddRecs of length up to 9. In future, we should use APInts to evaluate 
the divisor.

Thanks to Nicholas for cooperation!

llvm-svn: 46955
 2008-02-11 11:03:14 +00:00
Chris Lattner
cd5013eb2f Teach basicaa that 'byval' arguments define a new memory location that 
can't be aliased to other known objects.  This allows us to know that byval 
pointer args don't alias globals, etc.

llvm-svn: 46315
 2008-01-24 18:00:32 +00:00
Nick Lewycky
e05651c6d7 Accept both %y, %x and %x, %y as valid answers. 
llvm-svn: 45649
 2008-01-06 03:12:44 +00:00
Chris Lattner
95f9743c43 Fix PR1782, patch by Wojtek Matyjewicz! 
llvm-svn: 44733
 2007-12-09 07:35:13 +00:00
Tanya Lattner
c33660d278 Fix bug in regression tests that ignored stderr output in RUN lines. Updated tests and fixed broken run lines. 
XFAILed 3 arm regressions (will file bugs)

llvm-svn: 44389
 2007-11-28 04:57:00 +00:00
Dan Gohman
dfda7ca2cc Change grep '' to grep {}. 
Change 2>&1 | to |&.

llvm-svn: 44344
 2007-11-27 00:10:35 +00:00
Owen Anderson
05275b7b14 Allow GVN to eliminate read-only function calls when it can detect that they are redundant. 
llvm-svn: 44323
 2007-11-26 02:26:36 +00:00
Nick Lewycky
1536b3f230 Add new SCEV, SCEVSMax. This allows LLVM to analyze do-while loops. 
llvm-svn: 44319
 2007-11-25 22:41:31 +00:00
Duncan Sands
265752ae8f Ding dong, the DoesntAccessMemoryFns and 
OnlyReadsMemoryFns tables are dead!  We
get more, and more accurate, information
from gcc via the readnone and readonly
function attributes.

llvm-svn: 44288
 2007-11-23 19:30:27 +00:00
Duncan Sands
703986d327 Teach alias analysis about readnone/readonly functions. 
Based on a patch by Török Edwin.

llvm-svn: 44279
 2007-11-22 21:43:27 +00:00
Nick Lewycky
e34dd3a90f Create nodes for inline asm so that we don't crash looking for the node later. 
llvm-svn: 44267
 2007-11-22 03:07:37 +00:00
Nick Lewycky
f1d30ded71 Be more careful when transforming | to +. Patch from Wojciech Matyjewicz. 
llvm-svn: 44248
 2007-11-20 08:24:44 +00:00
Anton Korobeynikov
c9ab2516fa Reverted r44163 per request 
llvm-svn: 44177
 2007-11-15 18:33:16 +00:00
Nick Lewycky
6690b9499b Fix handling of overflow in loop calculation by adding new UDiv SCEV. This SCEV 
is disabled in the sense that it will refuse to create one from a UDiv
instruction, until the code is better tested.

llvm-svn: 44163
 2007-11-15 06:30:50 +00:00
Chris Lattner
02a91dce21 Fix PR1774 and BasicAA/2007-11-05-SizeCrash.ll 
llvm-svn: 43756
 2007-11-06 05:58:42 +00:00
Owen Anderson
6cc4e90741 Fix for PR1741. 
llvm-svn: 43326
 2007-10-25 02:36:18 +00:00
Nick Lewycky
a44e458ddc Build the correct range for loops with unusual bounds. Fix from Jay Foad. 
llvm-svn: 42394
 2007-09-27 14:12:54 +00:00
Dan Gohman
794fa1f8f7 Convert tests using "| wc -l | grep ..." to use the count script. 
llvm-svn: 41097
 2007-08-15 13:36:28 +00:00
Nick Lewycky
8543faa5fe Add reference to problem report. 
llvm-svn: 40889
 2007-08-07 12:27:03 +00:00
Chandler Carruth
67d3119773 This resolves a regression of BasicAA which failed to find any memory information for overloaded intrinsics (PR1600). This resolves that issue, and improves the matching scheme to use a BitVector rather than a binary search. 
llvm-svn: 40872
 2007-08-06 20:57:16 +00:00
Nick Lewycky
9e45c33d84 Fix the dates on these tests. It's not September yet. Thanks Reid! 
llvm-svn: 40869
 2007-08-06 20:00:11 +00:00
Nick Lewycky
04447caa7b Let scalar-evolution analyze loops with an unsigned comparison for the exit 
condition. Fixes 1597.

llvm-svn: 40867
 2007-08-06 19:21:00 +00:00
Nick Lewycky
071a2c6a5e Don't assume it's safe to transform a loop just because it's dominated by any 
comparison. Fixes bug 1598.

llvm-svn: 40866
 2007-08-06 18:33:46 +00:00