| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Revert r111031. The way LLVM defines loop invariance, the property of an | Dan Gohman | 2010-08-16 | 1 | -18/+0 |
| | | | | | | | | | | expression being loop invariant is not equivalent to the property of properly dominating the loop header. Other optimizations have also made this optimization less important. llvm-svn: 111160 | ||||
| * | Remove unused functions. | Jakob Stoklund Olesen | 2010-08-16 | 2 | -35/+0 |
| | | | | | llvm-svn: 111156 | ||||
| * | Remove unused functions. | Jakob Stoklund Olesen | 2010-08-16 | 1 | -8/+0 |
| | | | | | llvm-svn: 111155 | ||||
| * | Remove unused code. | Bob Wilson | 2010-08-16 | 1 | -5/+0 |
| | | | | | llvm-svn: 111154 | ||||
| * | Convert a test to use FileCheck. | Bob Wilson | 2010-08-16 | 1 | -4/+19 |
| | | | | | llvm-svn: 111153 | ||||
| * | Placate overzealous compiler warnings. | Dan Gohman | 2010-08-16 | 1 | -2/+2 |
| | | | | | llvm-svn: 111152 | ||||
| * | To create a copy of a SmallVector with an element removed from the | Dan Gohman | 2010-08-16 | 1 | -6/+7 |
| | | | | | | | | | | middle, copy the elements in two groups, rather than copying all the elements and then doing an erase on the middle of the result. These are SmallVectors, so we shouldn't expect to hit dynamic allocation in the common case. llvm-svn: 111151 | ||||
| * | Install Embedded builds into usr/local. Radar 8313723. | Bob Wilson | 2010-08-16 | 1 | -2/+2 |
| | | | | | llvm-svn: 111149 | ||||
| * | silence a vc2010 warning: " result of 32-bit shift implicitly converted to | Chris Lattner | 2010-08-16 | 1 | -1/+1 |
| | | | | | | | 64 bits (was 64-bit shift intended?)", pointed out by 'nobled' on llvmdev llvm-svn: 111148 | ||||
| * | Tidy whitespace. | Dan Gohman | 2010-08-16 | 1 | -5/+4 |
| | | | | | llvm-svn: 111147 | ||||
| * | Add a comment. | Dan Gohman | 2010-08-16 | 1 | -0/+5 |
| | | | | | llvm-svn: 111145 | ||||
| * | Use const_iterator in a few places. | Dan Gohman | 2010-08-16 | 1 | -3/+3 |
| | | | | | llvm-svn: 111144 | ||||
| * | Use iterators instead of indices in a few more places. | Dan Gohman | 2010-08-16 | 1 | -6/+9 |
| | | | | | llvm-svn: 111143 | ||||
| * | Micro-optimize SCEVConstant comparison. | Dan Gohman | 2010-08-16 | 1 | -4/+4 |
| | | | | | llvm-svn: 111142 | ||||
| * | Move SCEVNAryExpr's virtual member functions out of line, and convert | Dan Gohman | 2010-08-16 | 2 | -22/+36 |
| | | | | | | | them to iterators. llvm-svn: 111140 | ||||
| * | Use iterators instead of indices in simple cases. | Dan Gohman | 2010-08-16 | 1 | -6/+4 |
| | | | | | llvm-svn: 111138 | ||||
| * | Avoid gratuitous inefficiency in ifndef NDEBUG code. | Dan Gohman | 2010-08-16 | 1 | -8/+8 |
| | | | | | llvm-svn: 111137 | ||||
| * | Make one getAddExpr call when analyzing a+b+c+d+e+... instead of one | Dan Gohman | 2010-08-16 | 1 | -6/+31 |
| | | | | | | | for each add instruction. Ditto for Mul. llvm-svn: 111136 | ||||
| * | Delete an unused function. | Dan Gohman | 2010-08-16 | 1 | -35/+0 |
| | | | | | llvm-svn: 111135 | ||||
| * | Instead of having CollectSubexpr's categorize operands as interesting or | Dan Gohman | 2010-08-16 | 1 | -19/+14 |
| | | | | | | | | | uninteresting, just put all the operands on one list and make GenerateReassociations make the decision about what's interesting. This is simpler, and it avoids an extra ScalarEvolution::getAddExpr call. llvm-svn: 111133 | ||||
| * | Put add operands in ScalarEvolution-canonical order, when convenient. | Dan Gohman | 2010-08-16 | 1 | -2/+2 |
| | | | | | | | | This isn't necessary, because ScalarEvolution sorts them anyway, but it's tidier this way. llvm-svn: 111132 | ||||
| * | Specialize FoldingSetTrait<SCEV>, providing implementations of node | Dan Gohman | 2010-08-16 | 1 | -3/+19 |
| | | | | | | | | comparison and hash computation which don't require constructing temporary ID values. llvm-svn: 111131 | ||||
| * | Add hooks to FoldingSetTrait to allow specializations to provide | Dan Gohman | 2010-08-16 | 2 | -50/+176 |
| | | | | | | | | | implementations of equality comparison and hash computation. This can be used to optimize node lookup by avoiding creating lots of temporary ID values just for hashing and comparison purposes. llvm-svn: 111130 | ||||
| * | Tidy up whitespace in comments. | Dan Gohman | 2010-08-16 | 1 | -9/+9 |
| | | | | | llvm-svn: 111129 | ||||
| * | Constify FoldingSetNodeIDRef's Data. | Dan Gohman | 2010-08-16 | 1 | -3/+3 |
| | | | | | llvm-svn: 111128 | ||||
| * | Reverse the order of GetNodeProfile's arguments, for consistency | Dan Gohman | 2010-08-16 | 2 | -8/+8 |
| | | | | | | | with FoldingSetTrait::Profile. llvm-svn: 111127 | ||||
| * | Fix indentation in example code in a comment. | Dan Gohman | 2010-08-16 | 1 | -3/+3 |
| | | | | | llvm-svn: 111125 | ||||
| * | Avoid #include <ScalarEvolution.h> in LoopSimplify.cpp, which doesn't | Dan Gohman | 2010-08-16 | 1 | -2/+1 |
| | | | | | | | actually use ScalarEvolution. llvm-svn: 111124 | ||||
| * | Instead, teach SimplifyCFG to trim non-address-taken blocks from | Dan Gohman | 2010-08-16 | 2 | -2/+16 |
| | | | | | | | indirectbr destination lists. llvm-svn: 111122 | ||||
| * | Revert r111058, the lint check for indirectbr successors that aren't | Dan Gohman | 2010-08-16 | 2 | -7/+0 |
| | | | | | | | | address-taken. This can occur normally, if the code which took the address got DCEd. llvm-svn: 111121 | ||||
| * | Test expects SSE, give him SSE. | Benjamin Kramer | 2010-08-15 | 1 | -1/+1 |
| | | | | | llvm-svn: 111115 | ||||
| * | Updated LLVMLibDeps.cmake | Oscar Fuentes | 2010-08-15 | 1 | -3/+1 |
| | | | | | llvm-svn: 111112 | ||||
| * | CMake: Improved COMMENT on a custom command | Oscar Fuentes | 2010-08-15 | 1 | -1/+1 |
| | | | | | llvm-svn: 111111 | ||||
| * | Restore arch on these test, they fail on arm. | Benjamin Kramer | 2010-08-15 | 2 | -2/+2 |
| | | | | | llvm-svn: 111109 | ||||
| * | Mark as XFAIL on darwin 8. PR 7886. | Dale Johannesen | 2010-08-15 | 1 | -0/+2 |
| | | | | | llvm-svn: 111108 | ||||
| * | Updated the GenLibDeps -> LLVMLibDeps.cmake transformation example. | Oscar Fuentes | 2010-08-15 | 1 | -3/+3 |
| | | | | | llvm-svn: 111104 | ||||
| * | Revert r111082. No warnings for this common pattern. | Argyrios Kyrtzidis | 2010-08-15 | 6 | -12/+11 |
| | | | | | llvm-svn: 111102 | ||||
| * | Update tests. | Mikhail Glushenkov | 2010-08-15 | 8 | -52/+8 |
| | | | | | llvm-svn: 111096 | ||||
| * | Regenerate. | Mikhail Glushenkov | 2010-08-15 | 1 | -48/+4 |
| | | | | | llvm-svn: 111095 | ||||
| * | llvmc: remove dynamic plugins. | Mikhail Glushenkov | 2010-08-15 | 27 | -654/+163 |
| | | | | | llvm-svn: 111094 | ||||
| * | Rework how the non-sse2 memory barrier is lowered so that the | Eric Christopher | 2010-08-14 | 2 | -11/+22 |
| | | | | | | | | | encoding is correct for the built-in assembler. Based on a patch from Chris. llvm-svn: 111083 | ||||
| * | Add ATTRIBUTE_UNUSED to methods that are not supposed to be used. | Argyrios Kyrtzidis | 2010-08-14 | 6 | -11/+12 |
| | | | | | llvm-svn: 111082 | ||||
| * | improve indentation | Chris Lattner | 2010-08-14 | 1 | -19/+18 |
| | | | | | llvm-svn: 111073 | ||||
| * | T2I_rbin_irs rr variant is for disassembly only, so don't provide a pattern. | Bob Wilson | 2010-08-14 | 1 | -1/+1 |
| | | | | | llvm-svn: 111068 | ||||
| * | Update CMake build. | Ted Kremenek | 2010-08-14 | 1 | -1/+1 |
| | | | | | llvm-svn: 111063 | ||||
| * | LoopSimplify shouldn't split loop backedges that use indirectbr. PR7867. | Dan Gohman | 2010-08-14 | 2 | -0/+40 |
| | | | | | llvm-svn: 111061 | ||||
| * | Teach SimplifyCFG how to simplify indirectbr instructions. | Dan Gohman | 2010-08-14 | 6 | -19/+96 |
| | | | | | | | | | | | | - Eliminate redundant successors. - Convert an indirectbr with one successor into a direct branch. Also, generalize SimplifyCFG to be able to be run on a function entry block. It knows quite a few simplifications which are applicable to the entry block, and it only needs a few checks to avoid trouble with the entry block. llvm-svn: 111060 | ||||
| * | Add a local stack object block allocation pass. This is still an | Jim Grosbach | 2010-08-14 | 6 | -2/+282 |
| | | | | | | | | | | | | | | | | | | | experimental pass that allocates locals relative to one another before register allocation and then assigns them to actual stack slots as a block later in PEI. This will eventually allow targets with limited index offset range to allocate additional base registers (not just FP and SP) to more efficiently reference locals, as well as handle situations where locals cannot be referenced via SP or FP at all (dynamic stack realignment together with variable sized objects, for example). It's currently incomplete and almost certainly buggy. Work in progress. Disabled by default and gated via the -enable-local-stack-alloc command line option. rdar://8277890 llvm-svn: 111059 | ||||
| * | Add a lint check for an indirectbr destination which has not | Dan Gohman | 2010-08-13 | 2 | -0/+7 |
| | | | | | | | had its address taken. llvm-svn: 111058 | ||||
| * | Add a Thumb2 t2RSBrr instruction for disassembly only. | Bob Wilson | 2010-08-13 | 2 | -5/+22 |
| | | | | | | | This fixes another part of PR7792. llvm-svn: 111057 | ||||

