| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Switch loopinfo to using ETForest instead of DominatorSet to compute itself. | Chris Lattner | 2006-01-11 | 1 | -9/+9 |
| | | | | | | | Patch by Daniel Berlin! llvm-svn: 25199 | ||||
| * | Remove unused inclusion of SymbolTable.h | Reid Spencer | 2006-01-10 | 1 | -1/+0 |
| | | | | | llvm-svn: 25170 | ||||
| * | Fix a problem exposed by the et-forest work. Load-vn needs these passes live | Chris Lattner | 2006-01-08 | 1 | -3/+3 |
| | | | | | | | whenever it is live, not just when load-vn is computed initially llvm-svn: 25146 | ||||
| * | Initial implementation of the ET-Forest data structure for dominators and | Chris Lattner | 2006-01-08 | 1 | -0/+63 |
| | | | | | | | post-dominators. This code was written/adapted by Daniel Berlin! llvm-svn: 25144 | ||||
| * | Make the -print-alias-sets pass work for printing out something other than | Chris Lattner | 2006-01-03 | 1 | -11/+3 |
| | | | | | | | the default aa impl results. llvm-svn: 25062 | ||||
| * | Separate the call graph implementation from its interface. This implements | Chris Lattner | 2005-12-22 | 1 | -105/+178 |
| | | | | | | | | | | the rough idea sketched out in http://nondot.org/sabre/LLVMNotes/CallGraphClass.txt, allowing new spiffy implementations of the callgraph interface to be built. Many thanks to Saem Ghani for contributing this! llvm-svn: 24944 | ||||
| * | Prefix DSA specific options with dsa. | John Criswell | 2005-12-19 | 1 | -4/+4 |
| | | | | | | | Make the dsa-alloc-list and dsa-free-list options hidden. llvm-svn: 24864 | ||||
| * | Added an option to specify the names of heap freeing functions. | John Criswell | 2005-12-19 | 1 | -0/+20 |
| | | | | | llvm-svn: 24863 | ||||
| * | Added a command line option that allows the user to specify a list of | John Criswell | 2005-12-19 | 1 | -0/+19 |
| | | | | | | | functions that allocate memory. llvm-svn: 24862 | ||||
| * | Collapsing node if variable length struct with final field of length zero | Sumant Kowshik | 2005-12-06 | 1 | -1/+18 |
| | | | | | llvm-svn: 24621 | ||||
| * | post-dom-frontiers requires proper post-dominance | Chris Lattner | 2005-11-18 | 1 | -1/+1 |
| | | | | | llvm-svn: 24409 | ||||
| * | prevent cse of readcyclecounter | Andrew Lenharth | 2005-11-11 | 1 | -1/+0 |
| | | | | | llvm-svn: 24303 | ||||
| * | continued readcyclecounter support | Andrew Lenharth | 2005-11-11 | 1 | -0/+1 |
| | | | | | llvm-svn: 24300 | ||||
| * | Fix a problem that Nate noticed with LSR: | Chris Lattner | 2005-10-30 | 1 | -1/+26 |
| | | | | | | | | | | | | | | | | | | | | | When inserting code for an addrec expression with a non-unit stride, be more careful where we insert the multiply. In particular, insert the multiply in the outermost loop we can, instead of the requested insertion point. This allows LSR to notice the mul in the right loop, reducing it when it gets to it. This allows it to reduce the multiply, where before it missed it. This happens quite a bit in the test suite, for example, eliminating 2 multiplies in art, 3 in ammp, 4 in apsi, reducing from 1050 multiplies to 910 muls in galgel (!), from 877 to 859 in applu, and 36 to 30 in bzip2. This speeds up galgel from 16.45s to 16.01s, applu from 14.21 to 13.94s and fourinarow from 66.67s to 63.48s. This implements Transforms/LoopStrengthReduce/nested-reduce.ll llvm-svn: 24102 | ||||
| * | remove a dead file | Chris Lattner | 2005-10-29 | 1 | -355/+0 |
| | | | | | llvm-svn: 24085 | ||||
| * | Move some constant folding functions into LLVMAnalysis since they are used | John Criswell | 2005-10-27 | 1 | -0/+172 |
| | | | | | | | by Analysis and Transformation passes. llvm-svn: 24038 | ||||
| * | Move some constant folding code shared by Analysis and Transform passes | John Criswell | 2005-10-27 | 1 | -1/+1 |
| | | | | | | | | | into the LLVMAnalysis library. This allows LLVMTranform and LLVMTransformUtils to be archives and linked with LLVMAnalysis.a, which provides any missing definitions. llvm-svn: 24036 | ||||
| * | Remove this pass, it is not useful | Chris Lattner | 2005-10-24 | 1 | -106/+0 |
| | | | | | llvm-svn: 23949 | ||||
| * | DONT_BUILD_RELINKED is gone and implied by BUILD_ARCHIVE now | Chris Lattner | 2005-10-24 | 2 | -3/+1 |
| | | | | | llvm-svn: 23940 | ||||
| * | Only build .a file versions of these libraries, instead of .a and .o versions. | Chris Lattner | 2005-10-24 | 2 | -0/+2 |
| | | | | | | | This should speed up build times. llvm-svn: 23933 | ||||
| * | don't bother building the archive version of this library | Chris Lattner | 2005-10-24 | 1 | -1/+1 |
| | | | | | llvm-svn: 23927 | ||||
| * | expose a ctor | Chris Lattner | 2005-10-24 | 1 | -0/+3 |
| | | | | | llvm-svn: 23924 | ||||
| * | implement some prototypes | Chris Lattner | 2005-10-24 | 2 | -0/+10 |
| | | | | | llvm-svn: 23920 | ||||
| * | move this to the analyze tool | Chris Lattner | 2005-10-24 | 1 | -105/+0 |
| | | | | | llvm-svn: 23918 | ||||
| * | wrap a long line | Chris Lattner | 2005-09-28 | 1 | -1/+2 |
| | | | | | llvm-svn: 23507 | ||||
| * | Add a new getLoopLatch() method. | Chris Lattner | 2005-09-12 | 1 | -1/+25 |
| | | | | | llvm-svn: 23315 | ||||
| * | floor/ceil don't read/write memory. This allows gcse to eliminate 6 calls | Chris Lattner | 2005-08-24 | 1 | -0/+2 |
| | | | | | | | in mesa. llvm-svn: 23015 | ||||
| * | Fix Transforms/LoopStrengthReduce/2005-08-15-AddRecIV.ll | Chris Lattner | 2005-08-16 | 1 | -2/+3 |
| | | | | | llvm-svn: 22797 | ||||
| * | Teach LLVM to know how many times a loop executes when constructed with | Chris Lattner | 2005-08-15 | 1 | -2/+110 |
| | | | | | | | a < expression, e.g.: for (i = m; i < n; ++i) llvm-svn: 22793 | ||||
| * | Fix an obvious oops | Chris Lattner | 2005-08-10 | 1 | -1/+1 |
| | | | | | llvm-svn: 22742 | ||||
| * | implement two helper methods | Chris Lattner | 2005-08-09 | 1 | -0/+28 |
| | | | | | llvm-svn: 22736 | ||||
| * | * Unbreak optimized build (noticed by Eric van Riet Paap) | Misha Brukman | 2005-08-04 | 1 | -3/+5 |
| | | | | | | | * Comment #endif clauses for readability llvm-svn: 22646 | ||||
| * | add support for Graphviz when viewing CFGs | Chris Lattner | 2005-08-03 | 1 | -0/+20 |
| | | | | | llvm-svn: 22620 | ||||
| * | Break SCEVExpander out of IndVarSimplify into its own .h/.cpp file so that | Nate Begeman | 2005-07-30 | 1 | -0/+105 |
| | | | | | | | other passes may use it. llvm-svn: 22557 | ||||
| * | Eliminate all remaining tabs and trailing spaces. | Jeff Cohen | 2005-07-27 | 1 | -1/+1 |
| | | | | | llvm-svn: 22523 | ||||
| * | Remove glibc specific functions, and mark a couple as C99 | Andrew Lenharth | 2005-07-11 | 1 | -3/+1 |
| | | | | | llvm-svn: 22384 | ||||
| * | because on alpha: | Andrew Lenharth | 2005-07-11 | 1 | -0/+1 |
| | | | | | | | | | # define errno (*__errno_location ()) *shakes head llvm-svn: 22383 | ||||
| * | the correct fix was to fix AliasAnalysis.getModRefInfo | Andrew Lenharth | 2005-06-20 | 1 | -4/+0 |
| | | | | | llvm-svn: 22268 | ||||
| * | prevent GCSE from forwarding stores to loads around vaarg. This is uggly, ↵ | Andrew Lenharth | 2005-06-20 | 1 | -0/+4 |
| | | | | | | | and I am trying to fix the AliasInfo, as it should catch the problem instead. llvm-svn: 22266 | ||||
| * | core changes for varargs | Andrew Lenharth | 2005-06-18 | 2 | -10/+1 |
| | | | | | llvm-svn: 22254 | ||||
| * | By definition, 'tail' calls cannot access the stack frame of their caller. | Chris Lattner | 2005-05-08 | 1 | -0/+6 |
| | | | | | | | | Expose this as a simple form of mod/ref information. This implements BasicAA/tailcall-modref.ll llvm-svn: 21796 | ||||
| * | These intrinsics do not access memory | Chris Lattner | 2005-05-06 | 1 | -1/+1 |
| | | | | | llvm-svn: 21718 | ||||
| * | Remove extra blank line | Misha Brukman | 2005-05-05 | 1 | -1/+0 |
| | | | | | llvm-svn: 21706 | ||||
| * | Add llvm.sqrt intrinsic, patch contributed by Morten Ofstad | Chris Lattner | 2005-04-30 | 1 | -1/+1 |
| | | | | | llvm-svn: 21627 | ||||
| * | These functions can set errno! | Chris Lattner | 2005-04-28 | 1 | -2/+2 |
| | | | | | llvm-svn: 21609 | ||||
| * | Make interval partition print correctly, patch contributed by | Chris Lattner | 2005-04-26 | 1 | -2/+2 |
| | | | | | | | Vladimir Prus! llvm-svn: 21566 | ||||
| * | Correctly handle global-argument aliases induced in main | Chris Lattner | 2005-04-25 | 1 | -2/+30 |
| | | | | | llvm-svn: 21537 | ||||
| * | Don't mess up SCC traversal when a node has null edges out of it. | Chris Lattner | 2005-04-25 | 1 | -5/+6 |
| | | | | | llvm-svn: 21536 | ||||
| * | Propagate eq sets through the bu graphs to the cbu and eq graphs, fixing | Chris Lattner | 2005-04-23 | 1 | -0/+1 |
| | | | | | | | a crash of the sfv on 188.ammp llvm-svn: 21478 | ||||
| * | Malloc/Free have mod/ref effects. Do not allow CSE of function calls that | Chris Lattner | 2005-04-22 | 1 | -0/+2 |
| | | | | | | | call malloc/free. This fixes PR555. llvm-svn: 21443 | ||||

