summaryrefslogtreecommitdiffstats
path: root/llvm/test/Transforms/LoopRotate
Commit message (Collapse)AuthorAgeFilesLines
...
* Add simplifyLoopLatch to LoopRotate pass.Andrew Trick2012-02-141-0/+39
| | | | | | This folds a simple loop tail into a loop latch. It covers the common (in fortran) case of postincrement loops. It's a "free" way to expose this type of loop to downstream loop optimizations that bail out on non-canonical loops (getLoopLatch is a heavily used check). llvm-svn: 150439
* remove asmparser support for the old getresult instruction, which has been ↵Chris Lattner2011-06-171-1/+1
| | | | | | subsumed by extractvalue. llvm-svn: 133247
* Remove support for using "foo" as symbols instead of %"foo". This is ancientChris Lattner2011-06-171-1/+0
| | | | | | | syntax and has been long obsolete. As usual, updating the tests is the nasty part of this. llvm-svn: 133242
* fix PR9523, a crash in looprotate on a non-canonical loop made out of ↵Chris Lattner2011-04-091-0/+16
| | | | | | indirectbr. llvm-svn: 129203
* Do not hoist @llvm.dbg.value. Here, @llvm.dbg.value is "referring" a value ↵Devang Patel2011-02-141-0/+59
| | | | | | that is modified inside loop. llvm-svn: 125529
* merge tests into one crash.ll test.Chris Lattner2011-01-116-116/+109
| | | | llvm-svn: 123220
* remove a bogus assertion: the latch block of a loop is not Chris Lattner2011-01-111-0/+31
| | | | | | | neccesarily an uncond branch to the header. This fixes PR8955 (the assertion tripping). llvm-svn: 123219
* When loop rotation happens, it is *very* common for the duplicated condbrChris Lattner2011-01-081-11/+5
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | to be foldable into an uncond branch. When this happens, we can make a much simpler CFG for the loop, which is important for nested loop cases where we want the outer loop to be aggressively optimized. Handle this case more aggressively. For example, previously on phi-duplicate.ll we would get this: define void @test(i32 %N, double* %G) nounwind ssp { entry: %cmp1 = icmp slt i64 1, 1000 br i1 %cmp1, label %bb.nph, label %for.end bb.nph: ; preds = %entry br label %for.body for.body: ; preds = %bb.nph, %for.cond %j.02 = phi i64 [ 1, %bb.nph ], [ %inc, %for.cond ] %arrayidx = getelementptr inbounds double* %G, i64 %j.02 %tmp3 = load double* %arrayidx %sub = sub i64 %j.02, 1 %arrayidx6 = getelementptr inbounds double* %G, i64 %sub %tmp7 = load double* %arrayidx6 %add = fadd double %tmp3, %tmp7 %arrayidx10 = getelementptr inbounds double* %G, i64 %j.02 store double %add, double* %arrayidx10 %inc = add nsw i64 %j.02, 1 br label %for.cond for.cond: ; preds = %for.body %cmp = icmp slt i64 %inc, 1000 br i1 %cmp, label %for.body, label %for.cond.for.end_crit_edge for.cond.for.end_crit_edge: ; preds = %for.cond br label %for.end for.end: ; preds = %for.cond.for.end_crit_edge, %entry ret void } Now we get the much nicer: define void @test(i32 %N, double* %G) nounwind ssp { entry: br label %for.body for.body: ; preds = %entry, %for.body %j.01 = phi i64 [ 1, %entry ], [ %inc, %for.body ] %arrayidx = getelementptr inbounds double* %G, i64 %j.01 %tmp3 = load double* %arrayidx %sub = sub i64 %j.01, 1 %arrayidx6 = getelementptr inbounds double* %G, i64 %sub %tmp7 = load double* %arrayidx6 %add = fadd double %tmp3, %tmp7 %arrayidx10 = getelementptr inbounds double* %G, i64 %j.01 store double %add, double* %arrayidx10 %inc = add nsw i64 %j.01, 1 %cmp = icmp slt i64 %inc, 1000 br i1 %cmp, label %for.body, label %for.end for.end: ; preds = %for.body ret void } With all of these recent changes, we are now able to compile: void foo(char *X) { for (int i = 0; i != 100; ++i) for (int j = 0; j != 100; ++j) X[j+i*100] = 0; } into a single memset of 10000 bytes. This series of changes should also be helpful for other nested loop scenarios as well. llvm-svn: 123079
* Three major changes:Chris Lattner2011-01-081-2/+2
| | | | | | | | | | | | | | | 1. Rip out LoopRotate's domfrontier updating code. It isn't needed now that LICM doesn't use DF and it is super complex and gross. 2. Make DomTree updating code a lot simpler and faster. The old loop over all the blocks was just to find a block?? 3. Change the code that inserts the new preheader to just use SplitCriticalEdge instead of doing an overcomplex reimplementation of it. No behavior change, except for the name of the inserted preheader. llvm-svn: 123072
* Have loop-rotate simplify instructions (yay instsimplify!) as it clonesChris Lattner2011-01-081-3/+2
| | | | | | | | | | | | them into the loop preheader, eliminating silly instructions like "icmp i32 0, 100" in fixed tripcount loops. This also better exposes the bigger problem with loop rotate that I'd like to fix: once this has been folded, the duplicated conditional branch *often* turns into an uncond branch. Not aggressively handling this is pessimizing later loop optimizations somethin' fierce by making "dominates all exit blocks" checks fail. llvm-svn: 123060
* Teach loop rotate to hoist trivially invariant instructionsChris Lattner2010-09-061-0/+35
| | | | | | | | | | | | | | | in the duplicated block instead of duplicating them. Duplicating them into the end of the loop and the preheader means that we got a phi node in the header of the loop, which prevented LICM from hoisting them. GVN would usually come around later and merge the duplicated instructions so we'd get reasonable output... except that anything dependent on the shoulda-been-hoisted value can't be hoisted. In PR5319 (which this fixes), a memory value didn't get promoted. llvm-svn: 113134
* When rotating loops, put the original header at the bottom of theDan Gohman2010-08-171-5/+17
| | | | | | | loop, making the resulting loop significantly less ugly. Also, zap its trivial PHI nodes, since it's easy. llvm-svn: 111255
* Fix some tests that didn't test anything.Benjamin Kramer2010-06-261-1/+1
| | | | llvm-svn: 106954
* Delete useless trailing semicolons.Dan Gohman2010-01-051-1/+1
| | | | llvm-svn: 92740
* fix PR5837 by having SSAUpdate reuse phi nodes for theChris Lattner2009-12-211-0/+35
| | | | | | | | | | 'GetValueInMiddleOfBlock' case, instead of inserting duplicates. A similar fix is almost certainly needed by the machine-level SSAUpdate implementation. llvm-svn: 91820
* Make Loop::getLoopLatch() work on loops which don't have preheaders, asDan Gohman2009-11-201-0/+43
| | | | | | | | | | | | it may be used in contexts where preheader insertion may have failed due to an indirectbr. Make LoopSimplify's LoopSimplify::SeparateNestedLoop properly fail in the case that it would require splitting an indirectbr edge. These fix PR5502. llvm-svn: 89484
* Make these tests more interesting by usingDan Gohman2009-10-2410-10/+10
| | | | | | | -verify-dom-info and -verify-loop-info, which enable additional (expensive) consistency checks. llvm-svn: 85017
* Add a testcase to help test analysis preservation.Dan Gohman2009-09-281-0/+47
| | | | llvm-svn: 83002
* Change tests from "opt %s" to "opt < %s" so that opt doesn't see theDan Gohman2009-09-119-9/+9
| | | | | | | | 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
* Use opt -S instead of piping bitcode output through llvm-dis.Dan Gohman2009-09-081-1/+1
| | | | llvm-svn: 81257
* Change these tests to feed the assembly files to opt directly, insteadDan Gohman2009-09-089-9/+9
| | | | | | of using llvm-as, now that opt supports this. llvm-svn: 81226
* Testcase for PR2639.Owen Anderson2009-04-231-0/+38
| | | | llvm-svn: 69867
* Fix PR3408 by making a non-obvious assumption very obvious, and Chris Lattner2009-01-261-0/+21
| | | | | | handling the flaw inherent in that assumption. :) llvm-svn: 62984
* sabre brings to my attention that the 'tr' suffix is also obsoleteGabor Greif2008-05-201-1/+1
| | | | llvm-svn: 51349
* Rename the last test with .llx extension to .ll, resolve duplicate test by ↵Gabor Greif2008-05-201-1/+1
| | | | | | 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
* New test for bug fixed in 50545.Dale Johannesen2008-05-011-0/+26
| | | | llvm-svn: 50548
* remove this testcase. It isn't testing loop rotate, it is testing allChris Lattner2008-04-231-127/+0
| | | | | | | | of -std-compile-opts and is now failing because other passes are generating IR that looks different to input of loop rotate. Devang, please introduce a testcase that only runs loop rotate. llvm-svn: 50136
* Byebye llvm-upgrade!Tanya Lattner2008-03-254-43/+14
| | | | llvm-svn: 48762
* Ding dong, the DoesntAccessMemoryFns andDuncan Sands2007-11-231-25/+24
| | | | | | | | | OnlyReadsMemoryFns tables are dead! We get more, and more accurate, information from gcc via the readnone and readonly function attributes. llvm-svn: 44288
* Bunch of tests to check loop passes.Devang Patel2007-07-311-21/+0
| | | | llvm-svn: 40629
* New test.Devang Patel2007-07-111-0/+21
| | | | llvm-svn: 39768
* Convert .cvsignore filesJohn Criswell2007-06-291-1/+0
| | | | llvm-svn: 37801
* Add a .cvsignore file.Reid Spencer2007-04-211-0/+1
| | | | llvm-svn: 36323
* For PR1319:Reid Spencer2007-04-161-2/+2
| | | | | | | | Remove && from the end of the lines to prevent tests from throwing run lines into the background. Also, clean up places where the same command is run multiple times by using a temporary file. llvm-svn: 36142
* For PR1319:Reid Spencer2007-04-152-3/+6
| | | | | | Upgrade to use new Tcl exec based test harness. llvm-svn: 36062
* The "implementation" keyword is no more!Reid Spencer2007-04-111-2/+0
| | | | llvm-svn: 35919
* Make the llvm-runtest function much more amenable by eliminating all theReid Spencer2007-04-111-1/+1
| | | | | | | | global variables that needed to be passed in. This makes it possible to add new global variables with only a couple changes (Makefile and llvm-dg.exp) instead of touching every single dg.exp file. llvm-svn: 35918
* Add test case for PR 1154.Devang Patel2007-04-101-0/+125
| | | | llvm-svn: 35865
* Add check for opt crash.Devang Patel2007-04-091-0/+1
| | | | llvm-svn: 35849
* Add Loop Rotate test cases.Devang Patel2007-04-097-0/+256
llvm-svn: 35838
OpenPOWER on IntegriCloud