- Aug 27, 2006
-
-
Chris Lattner authored
llvm-svn: 29911
-
- Aug 26, 2006
-
-
Owen Anderson authored
causing a crash in 175.vpr llvm-svn: 29887
-
Owen Anderson authored
llvm-svn: 29886
-
- Aug 25, 2006
-
-
Owen Anderson authored
llvm-svn: 29874
-
Owen Anderson authored
I'm going to wait to put this in HEAD until tomorrow, so as not to clutter the nightly tester. llvm-svn: 29868
-
Owen Anderson authored
forgot to put in the analysis usage. llvm-svn: 29867
-
- Aug 24, 2006
-
-
Owen Anderson authored
utility of the LoopUnroll pass. Also, add a testcase for multiblock-loop unrolling. llvm-svn: 29859
-
- Aug 18, 2006
-
-
Reid Spencer authored
llvm-svn: 29765
-
- Aug 14, 2006
-
-
Chris Lattner authored
Transforms/CondProp/2006-08-14-SingleEntryPhiCrash.ll llvm-svn: 29673
-
- Aug 12, 2006
-
-
Chris Lattner authored
Not only will this take huge amounts of compile time, the resultant loop nests won't be useful for optimization. This reduces loopsimplify time on Transforms/LoopSimplify/2006-08-11-LoopSimplifyLongTime.ll from ~32s to ~0.4s with a debug build of llvm on a 2.7Ghz G5. llvm-svn: 29647
-
Chris Lattner authored
blocks that target loop blocks. Before, the code was run once per loop, and depended on the number of predecessors each block in the loop had. Unfortunately, scanning preds can be really slow when huge numbers of phis exist or when phis with huge numbers of inputs exist. Now, the code is run once per function and scans successors instead of preds, which is far faster. In addition, the new code is simpler and is goto free, woo. This change speeds up a nasty testcase Duraid provided me from taking hours to taking ~72s with a debug build. The functionality this implements is already tested in the testsuite as Transforms/CodeExtractor/2004-03-13-LoopExtractorCrash.ll. llvm-svn: 29644
-
- Aug 08, 2006
-
-
Reid Spencer authored
SlowOperatingInfo, Statistics). Besides providing an example of how to use these facilities, it also serves to debug problems with runtime linking when dlopening a loadable module. These three support facilities exercise different combinations of Text/Weak Weak/Text and Text/Text linking between the executable and the module. llvm-svn: 29552
-
Reid Spencer authored
1. Change the usage of LOADABLE_MODULE so that it implies all the things necessary to make a loadable module. This reduces the user's burdern to get a loadable module correctly built. 2. Document the usage of LOADABLE_MODULE in the MakefileGuide 3. Adjust the makefile for lib/Transforms/Hello to use the new specification for building loadable modules 4. Adjust the sample project to not attempt to build a shared library for its little library. This was just wasteful and not instructive at all. llvm-svn: 29551
-
- Aug 03, 2006
-
-
Chris Lattner authored
Transforms/SimplifyCFG/2006-08-03-Crash.ll llvm-svn: 29515
-
Chris Lattner authored
Changes: 1. Update an obsolete comment. 2. Make the sorting by base an explicit (though still N^2) step, so that the code is more clear on what it is doing. 3. Partition uses so that uses inside the loop are handled before uses outside the loop. Note that none of these changes currently changes the code inserted by LSR, but they are a stepping stone to getting there. This code is the result of some crazy pair programming with Nate. :) llvm-svn: 29493
-
- Aug 02, 2006
-
-
Chris Lattner authored
up lcssa much in practice. llvm-svn: 29465
-
Chris Lattner authored
down approach, inspired by discussions with Tanya. This approach is significantly faster, because it does not need dominator frontiers and it does not insert extraneous unused PHI nodes. For example, on 252.eon, in a release-asserts build, this speeds up LCSSA (which is the slowest pass in gccas) from 9.14s to 0.74s on my G5. This code is also slightly smaller and significantly simpler than the old code. Amusingly, in a normal Release build (which includes the "assert(L->isLCSSAForm());" assertion), asserting that the result of LCSSA is in LCSSA form is actually slower than the LCSSA transformation pass itself on 252.eon. I will see if Loop::isLCSSAForm can be sped up next. llvm-svn: 29463
-
- Jul 27, 2006
-
-
Chris Lattner authored
llvm-svn: 29324
-
- Jul 20, 2006
-
-
Chris Lattner authored
llvm-svn: 29226
-
Devang Patel authored
llvm-svn: 29223
-
Devang Patel authored
InternalizePass. llvm-svn: 29222
-
- Jul 19, 2006
-
-
Owen Anderson authored
llvm-svn: 29199
-
Owen Anderson authored
llvm-svn: 29198
-
Owen Anderson authored
somewhere down the road. llvm-svn: 29197
-
- Jul 18, 2006
-
-
Chris Lattner authored
llvm-svn: 29189
-
Evan Cheng authored
llvm-svn: 29186
-
- Jul 15, 2006
-
-
Chris Lattner authored
llvm-svn: 29149
-
- Jul 14, 2006
-
-
Owen Anderson authored
This should fix PR 831. llvm-svn: 29141
-
- Jul 13, 2006
-
-
Chris Lattner authored
llvm-svn: 29134
-
- Jul 12, 2006
-
-
Chris Lattner authored
This unbreaks smg2000. llvm-svn: 29127
-
Owen Anderson authored
llvm-svn: 29126
-
Chris Lattner authored
Handle this case, which doesn't require a new callgraph edge. This fixes a crash compiling MallocBench/gs. llvm-svn: 29121
-
Chris Lattner authored
target CG node. This allows the inliner to properly update the callgraph when using the pruning inliner. The pruning inliner may not copy over all call sites from a callee to a caller, so the edges corresponding to those call sites should not be copied over either. This fixes PR827 and Transforms/Inline/2006-07-12-InlinePruneCGUpdate.ll llvm-svn: 29120
-
- Jul 11, 2006
-
-
Chris Lattner authored
llvm-svn: 29108
-
Owen Anderson authored
didn't start showing up until after the recent instcombine fixes. llvm-svn: 29102
-
Owen Anderson authored
llvm-svn: 29094
-
Owen Anderson authored
llvm-svn: 29093
-
- Jul 10, 2006
-
-
Chris Lattner authored
This implements Transforms/InstCombine/bswap.ll:test[34]. llvm-svn: 29087
-
Owen Anderson authored
llvm-svn: 29083
-
- Jul 09, 2006
-
-
Owen Anderson authored
llvm-svn: 29078
-