maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
41,914 Commits 23 Branches 0 Tags 2.2 GiB
Commit Graph

15 Commits

Author SHA1 Message Date
Devang Patel 2e622e4c2b 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 0ecb76d820 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 22c3caab6e 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 c281d8031b Keep track of exit value operand number when operands are swapped. 
llvm-svn: 47082
 2008-02-13 19:48:48 +00:00
Devang Patel 26f75e2576 Fix PR 1995. 
llvm-svn: 46898
 2008-02-08 22:49:13 +00:00
Devang Patel 67fa0521b6 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 bd75910fa7 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 7bba386f72 Handle multiple induction variables. 
This fixes PR714.

llvm-svn: 42309
 2007-09-25 18:24:48 +00:00
Devang Patel 87d7e8ebcb 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 361e52f39c Fix PR1692 
llvm-svn: 42209
 2007-09-21 21:18:19 +00:00
Devang Patel f8ab0a9acc Filter exit conditions which are not yet handled. 
llvm-svn: 41800
 2007-09-10 18:33:42 +00:00
Devang Patel c1ef32ef3d 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 4e63e1f5b5 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 c2e2d15f45 Do not split loops rejected by processOneIterationLoop(). 
llvm-svn: 41194
 2007-08-20 20:24:15 +00:00
Devang Patel cec2ad95f4 Add loop index split tests. 
llvm-svn: 41146
 2007-08-17 22:02:15 +00:00