| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | If the phi node was used by an unreachable instruction that ends up using | Duncan Sands | 2011-02-21 | 1 | -2/+3 |
| * | fix a crasher in disabled code (on variable stride loops) | Chris Lattner | 2011-02-21 | 1 | -1/+1 |
| * | Simplify RecursivelyDeleteDeadPHINode. The only functionality change | Duncan Sands | 2011-02-21 | 1 | -28/+16 |
| * | Add some (disabled code) to print out negative strides. | Chris Lattner | 2011-02-21 | 1 | -3/+15 |
| * | Make RecursivelyDeleteDeadPHINode delete a phi node that has no users and add a | Nick Lewycky | 2011-02-20 | 1 | -7/+12 |
| * | Move "A | ~(A & ?) -> -1" from InstCombine to InstructionSimplify. | Benjamin Kramer | 2011-02-20 | 1 | -16/+8 |
| * | InstCombine: Add a bunch of combines of the form x | (y ^ z). | Benjamin Kramer | 2011-02-20 | 1 | -0/+41 |
| * | Teach RecursivelyDeleteDeadPHINodes to handle multiple self-references. Patch | Nick Lewycky | 2011-02-20 | 1 | -5/+21 |
| * | Instead of keeping two Value*->id# mappings, keep one Value->Value mapping and | Nick Lewycky | 2011-02-20 | 1 | -12/+14 |
| * | PR9218: SimplifyDemandedVectorElts can return a non-null value that is not | Eli Friedman | 2011-02-19 | 1 | -2/+7 |
| * | rewrite the memset_pattern pattern generation stuff to accept any 2/4/8/16-byte | Chris Lattner | 2011-02-19 | 1 | -32/+12 |
| * | Implement rdar://9009151, transforming strided loop stores of | Chris Lattner | 2011-02-19 | 1 | -32/+125 |
| * | Make loop-idiom use TargetLibraryInfo to determine whether it is allowed | Chris Lattner | 2011-02-18 | 1 | -1/+18 |
| * | Move library stuff out of the toplevel CMakeLists.txt file. | Oscar Fuentes | 2011-02-18 | 1 | -0/+6 |
| * | Add some transforms of the kind X-Y>X -> 0>Y which are valid when there is no | Duncan Sands | 2011-02-18 | 1 | -18/+17 |
| * | prevent jump threading from merging blocks when their address is | Chris Lattner | 2011-02-18 | 1 | -1/+11 |
| * | Don't unroll loops whose header block's address is taken. | Chris Lattner | 2011-02-18 | 1 | -2/+10 |
| * | have instcombine preserve nsw/nuw/exact when sinking | Chris Lattner | 2011-02-17 | 1 | -11/+53 |
| * | fix typo | Chris Lattner | 2011-02-17 | 1 | -1/+1 |
| * | fix instcombine merging GEPs through a PHI to only make the | Chris Lattner | 2011-02-17 | 1 | -3/+7 |
| * | add is always integer, thanks to Frits for noticing this. | Chris Lattner | 2011-02-17 | 1 | -1/+1 |
| * | Transform "A + B >= A + C" into "B >= C" if the adds do not wrap. Likewise f... | Duncan Sands | 2011-02-17 | 1 | -93/+106 |
| * | preserve NUW/NSW when transforming add x,x | Chris Lattner | 2011-02-17 | 1 | -2/+7 |
| * | fix PR9215, preventing -reassociate from clearing nsw/nuw when | Chris Lattner | 2011-02-17 | 1 | -3/+4 |
| * | Spelling fix: consequtive -> consecutive. | Duncan Sands | 2011-02-15 | 3 | -3/+3 |
| * | Fix 9216 - Endless loop in InstCombine pass. | Nadav Rotem | 2011-02-15 | 1 | -1/+5 |
| * | Do not forget DebugLoc! | Devang Patel | 2011-02-15 | 1 | -0/+1 |
| * | tidy up a bit. | Chris Lattner | 2011-02-15 | 1 | -7/+9 |
| * | convert ConstantVector::get to use ArrayRef. | Chris Lattner | 2011-02-15 | 3 | -10/+5 |
| * | Do not hoist @llvm.dbg.value. Here, @llvm.dbg.value is "referring" a value th... | Devang Patel | 2011-02-14 | 1 | -1/+2 |
| * | revert my ConstantVector patch, it seems to have made the llvm-gcc | Chris Lattner | 2011-02-14 | 3 | -5/+10 |
| * | Switch ConstantVector::get to use ArrayRef instead of a pointer+size | Chris Lattner | 2011-02-14 | 3 | -10/+5 |
| * | remove a now-unneccesary cast. | Chris Lattner | 2011-02-13 | 1 | -1/+1 |
| * | implement instcombine folding for things like (x >> c) < 42. | Chris Lattner | 2011-02-13 | 1 | -8/+50 |
| * | refactor some code out into a helper method. | Chris Lattner | 2011-02-13 | 2 | -46/+56 |
| * | SimplifyLibCalls: Add missing legalize check on various printf to puts and | Daniel Dunbar | 2011-02-12 | 1 | -5/+9 |
| * | Also fold (A+B) == A -> B == 0 when the add is commuted. | Benjamin Kramer | 2011-02-11 | 1 | -2/+4 |
| * | When lowering an inbounds gep, the intermediate adds can have | Chris Lattner | 2011-02-11 | 1 | -6/+3 |
| * | Make LoopUnswitch preserve ScalarEvolution by just forgetting everything about | Cameron Zwarich | 2011-02-11 | 1 | -0/+5 |
| * | LoopInstSimplify preserves ScalarEvolution. | Cameron Zwarich | 2011-02-11 | 1 | -0/+1 |
| * | If we can't avoid running loop-simplify twice for now, at least avoid running | Cameron Zwarich | 2011-02-10 | 1 | -0/+3 |
| * | Rename 'loopsimplify' to 'loop-simplify'. | Cameron Zwarich | 2011-02-10 | 1 | -3/+3 |
| * | implement the first part of PR8882: when lowering an inbounds | Chris Lattner | 2011-02-10 | 1 | -8/+15 |
| * | Enhance a bunch of transformations in instcombine to start generating | Chris Lattner | 2011-02-10 | 2 | -142/+145 |
| * | Enhance the "compare with shift" and "compare with div" | Chris Lattner | 2011-02-10 | 1 | -44/+52 |
| * | more cleanups, notably bitcast isn't used for "signed to unsigned type | Chris Lattner | 2011-02-10 | 1 | -45/+27 |
| * | A bunch of cleanups and simplifications using the new PatternMatch predicates | Chris Lattner | 2011-02-10 | 1 | -176/+132 |
| * | teach SimplifyDemandedBits that exact shifts demand the bits they | Chris Lattner | 2011-02-10 | 1 | -3/+23 |
| * | Revert this in an attempt to bring the builders back. | Eric Christopher | 2011-02-10 | 1 | -4/+4 |
| * | Turn this pass ordering: | Cameron Zwarich | 2011-02-10 | 1 | -4/+4 |
