6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-10-31 08:16:47 +00:00
Code Issues Projects Releases Wiki Activity
36,829 Commits 39 Branches 0 Tags
bf1caa98549317a8fe84b6f67a2209db9eeededc
Commit Graph

11 Commits

Author SHA1 Message Date
Devang Patel
82ada54da0 Fix PR 1995. 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@46898 91177308-0d34-0410-b5e6-96231b3b80d8
 2008-02-08 22:49:13 +00:00
Devang Patel
c840da14c6 Filter loops that subtract induction variables. 
These loops are not yet handled.

Fix PR 1912.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@46484 91177308-0d34-0410-b5e6-96231b3b80d8
 2008-01-29 02:20:41 +00:00
Devang Patel
5ffdc56f53 If ExitValue operand is also defined in Loop header then 
insert new ExitValue after this operand definition.

This fixes PR1828.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@44539 91177308-0d34-0410-b5e6-96231b3b80d8
 2007-12-03 19:17:21 +00:00
Devang Patel
a6dff2faeb Handle multiple induction variables. 
This fixes PR714.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@42309 91177308-0d34-0410-b5e6-96231b3b80d8
 2007-09-25 18:24:48 +00:00
Devang Patel
453a844128 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();                            



git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@42299 91177308-0d34-0410-b5e6-96231b3b80d8
 2007-09-25 17:31:19 +00:00
Devang Patel
3f65f02d25 Fix PR1692 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@42209 91177308-0d34-0410-b5e6-96231b3b80d8
 2007-09-21 21:18:19 +00:00
Devang Patel
9c7a9f186c Filter exit conditions which are not yet handled. 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@41800 91177308-0d34-0410-b5e6-96231b3b80d8
 2007-09-10 18:33:42 +00:00
Devang Patel
be97c986e1 Constant split values needs upper bound and lower bound check, just like any other split value. 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@41389 91177308-0d34-0410-b5e6-96231b3b80d8
 2007-08-25 01:09:14 +00:00
Devang Patel
4a69da9cb0 While calculating upper loop bound for first loop and lower loop bound for second loop, take care of edge cases. 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@41387 91177308-0d34-0410-b5e6-96231b3b80d8
 2007-08-25 00:56:38 +00:00
Devang Patel
d651f657f2 Do not split loops rejected by processOneIterationLoop(). 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@41194 91177308-0d34-0410-b5e6-96231b3b80d8
 2007-08-20 20:24:15 +00:00
Devang Patel
7bfd5dba38 Add loop index split tests. 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@41146 91177308-0d34-0410-b5e6-96231b3b80d8
 2007-08-17 22:02:15 +00:00