RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-01-06 19:31:13 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity
53,121 Commits 4 Branches 5 Tags 634 MiB
a8a12b7d98
Commit Graph

36 Commits

Author SHA1 Message Date
Dan Gohman
205b641954 Change tests from "opt %s" to "opt < %s" so that opt doesn't see the 
input filename so that opt doesn't print the input filename in the
output so that grep lines in the tests don't unintentionally match
strings in the input filename.

llvm-svn: 81537
 2009-09-11 18:01:28 +00:00
Dan Gohman
c95df8b6d8 Use opt -S instead of piping bitcode output through llvm-dis. 
llvm-svn: 81257
 2009-09-08 22:34:10 +00:00
Dan Gohman
8d84372836 Change these tests to feed the assembly files to opt directly, instead 
of using llvm-as, now that opt supports this.

llvm-svn: 81226
 2009-09-08 16:50:01 +00:00
Chris Lattner
f37893e7a1 Fix PR3913, patch by Jakub Staszak! 
llvm-svn: 80327
 2009-08-28 00:43:14 +00:00
Dan Gohman
28702fab4e Don't try to split a loop when the controlling icmp instruction 
doesn't have an IV-based operand. This fixes PR4471.

llvm-svn: 74399
 2009-06-27 22:58:27 +00:00
Dan Gohman
5f6f8101d5 Split the Add, Sub, and Mul instruction opcodes into separate 
integer and floating-point opcodes, introducing
FAdd, FSub, and FMul.

For now, the AsmParser, BitcodeReader, and IRBuilder all preserve
backwards compatability, and the Core LLVM APIs preserve backwards
compatibility for IR producers. Most front-ends won't need to change
immediately.

This implements the first step of the plan outlined here:
http://nondot.org/sabre/LLVMNotes/IntegerOverflow.txt

llvm-svn: 72897
 2009-06-04 22:49:04 +00:00
Devang Patel
ec65625744 Loop Index Split can eliminate a loop if it can determin if loop body is executed only once. There was a bug in determining IV based value of the iteration for which the loop body is executed. Fix it. 
llvm-svn: 68071
 2009-03-30 22:24:10 +00:00
Devang Patel
e98e6bc27c If branch conditions' one successor is dominating another non-latch successor then this loop's iteration space can not be restricted. In this example block bb5 is always executed. 
llvm-svn: 65902
 2009-03-02 23:39:14 +00:00
Devang Patel
85ae609834 Ignore DbgInfoIntrinsics. 
llvm-svn: 63923
 2009-02-06 06:19:06 +00:00
Devang Patel
4fcea36b8b Rewrite code that 1) filters loops and 2) calculates new loop bounds. 
This fixes many bugs. I will add more test cases in a separate check-in.

Some day, the code that manipulates CFG and updates dom. info could use refactoring help.

llvm-svn: 60554
 2008-12-04 21:38:42 +00:00
Devang Patel
f0d6bd18d5 If the sign of exit condition and split condition does not match 
then do not split loop index.

llvm-svn: 58995
 2008-11-10 19:48:34 +00:00
Devang Patel
255fee3bce Check loop exit predicate properly while eliminating one iteration loop. 
This patch fixes PR 2869

llvm-svn: 57369
 2008-10-10 22:02:57 +00:00
Devang Patel
378c8633e5 Fix typo, fix PR 2865. 
llvm-svn: 57221
 2008-10-06 23:22:54 +00:00
Devang Patel
1e7ddf5d31 splitLoop does not handle split condition EQ. 
Fixes PR 2805

llvm-svn: 56321
 2008-09-18 23:45:14 +00:00
Devang Patel
50c22bf69b Do not ignore iv uses outside the loop. 
This one slipped through cracks very well.

llvm-svn: 56284
 2008-09-17 17:53:47 +00:00
Devang Patel
2b56d5281d If loop induction variable's start value is less then its exit value then do not split the loop. 
llvm-svn: 53265
 2008-07-09 00:12:01 +00:00
Owen Anderson
3f738eb65b Testcase for LoopIndexSplit and DomFrontier. 
llvm-svn: 51916
 2008-06-03 18:32:27 +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
Devang Patel
9f385d71c2 Do not erase induction variable increment if it is used outside the loop. 
llvm-svn: 51280
 2008-05-19 22:23:55 +00:00
Devang Patel
425514c509 Add incoming value from header only if phi node has any use inside the loop. 
llvm-svn: 48738
 2008-03-24 20:16:14 +00:00
Devang Patel
8af92b942c If loop header is also loop exiting block then OrigPN is incoming value for B loop header. 
Fixes PR 2030.

llvm-svn: 47141
 2008-02-14 23:18:47 +00:00
Devang Patel
38de2d11a5 A loop latch phi node may have uses inside loop, not just in loop header. 
llvm-svn: 47093
 2008-02-13 22:23:07 +00:00
Devang Patel
1e71afe2df While moving exit condition, do not drop loop latch on the floor. 
llvm-svn: 47089
 2008-02-13 22:06:36 +00:00
Devang Patel
d48bbbf07b Keep track of exit value operand number when operands are swapped. 
llvm-svn: 47082
 2008-02-13 19:48:48 +00:00
Devang Patel
9aba178666 Fix PR 1995. 
llvm-svn: 46898
 2008-02-08 22:49:13 +00:00
Devang Patel
86ff705c22 Filter loops that subtract induction variables. 
These loops are not yet handled.

Fix PR 1912.

llvm-svn: 46484
 2008-01-29 02:20:41 +00:00
Devang Patel
c47f68e747 If ExitValue operand is also defined in Loop header then 
insert new ExitValue after this operand definition.

This fixes PR1828.

llvm-svn: 44539
 2007-12-03 19:17:21 +00:00
Devang Patel
d98abb62ce Handle multiple induction variables. 
This fixes PR714.

llvm-svn: 42309
 2007-09-25 18:24:48 +00:00
Devang Patel
de9d1c3654 Add transformation to update loop interation space. Now, 
for (i=A; i<N; i++) {
  if (i < X && i > Y)
    do_something();
}

is transformed into

U=min(N,X); L=max(A,Y);
for (i=L;i<U;i++)
  do_somethihg();                            

llvm-svn: 42299
 2007-09-25 17:31:19 +00:00
Devang Patel
b741c56cfc Fix PR1692 
llvm-svn: 42209
 2007-09-21 21:18:19 +00:00
Devang Patel
76790c1b28 Filter exit conditions which are not yet handled. 
llvm-svn: 41800
 2007-09-10 18:33:42 +00:00
Devang Patel
d961a55c5a Constant split values needs upper bound and lower bound check, just like any other split value. 
llvm-svn: 41389
 2007-08-25 01:09:14 +00:00
Devang Patel
027410a7aa While calculating upper loop bound for first loop and lower loop bound for second loop, take care of edge cases. 
llvm-svn: 41387
 2007-08-25 00:56:38 +00:00
Devang Patel
6c91023dad Do not split loops rejected by processOneIterationLoop(). 
llvm-svn: 41194
 2007-08-20 20:24:15 +00:00
Devang Patel
cf22d4b1f8 Add loop index split tests. 
llvm-svn: 41146
 2007-08-17 22:02:15 +00:00