- Apr 07, 2007
-
-
Owen Anderson authored
llvm-svn: 35729
-
Owen Anderson authored
work for PR 1171. llvm-svn: 35728
-
Owen Anderson authored
on PR1171. llvm-svn: 35726
-
Nick Lewycky authored
llvm-svn: 35724
-
Owen Anderson authored
This is the beginning of work for PR1171. llvm-svn: 35720
-
Nick Lewycky authored
llvm-svn: 35719
-
Nick Lewycky authored
llvm-svn: 35718
-
Nick Lewycky authored
first and then range testing second. llvm-svn: 35715
-
Devang Patel authored
llvm-svn: 35714
-
Chris Lattner authored
llvm-svn: 35713
-
Chris Lattner authored
llvm-svn: 35712
-
Chris Lattner authored
llvm-svn: 35711
-
Chris Lattner authored
llvm-svn: 35710
-
Chris Lattner authored
llvm-svn: 35709
-
Chris Lattner authored
llvm-svn: 35708
-
Chris Lattner authored
llvm-svn: 35707
-
Chris Lattner authored
SimplifyLibCalls/2007-04-06-strchr-miscompile.ll and PR1307 llvm-svn: 35706
-
Chris Lattner authored
llvm-svn: 35704
-
Chris Lattner authored
the start index of the array as well as the length. No functionality change. llvm-svn: 35703
-
- Apr 06, 2007
-
-
Chris Lattner authored
llvm-svn: 35700
-
- Apr 05, 2007
-
-
Chris Lattner authored
llvm-svn: 35689
-
Chris Lattner authored
llvm-svn: 35680
-
- Apr 04, 2007
-
-
Dale Johannesen authored
elsewhere. llvm-svn: 35668
-
Jeff Cohen authored
llvm-svn: 35665
-
Duncan Sands authored
llvm-svn: 35655
-
Chris Lattner authored
some constant exprs to apints). Thanks to Anton for tracking down a small testcase that triggered this! llvm-svn: 35633
-
- Apr 03, 2007
-
-
Chris Lattner authored
ldecod now passes. llvm-svn: 35626
-
Evan Cheng authored
llvm-svn: 35620
-
Chris Lattner authored
llvm-svn: 35615
-
Chris Lattner authored
llvm-svn: 35614
-
Chris Lattner authored
llvm-svn: 35612
-
Chris Lattner authored
llvm-svn: 35607
-
- Apr 02, 2007
-
-
Zhou Sheng authored
2. Use cheaper APInt methods. llvm-svn: 35594
-
Zhou Sheng authored
llvm-svn: 35593
-
Chris Lattner authored
target hook. This allows us to codegen a loop as: LBB1_1: @cond_next mov r2, #0 str r2, [r0, +r3, lsl #2] add r3, r3, #1 cmn r3, #1 bne LBB1_1 @cond_next instead of: LBB1_1: @cond_next mov r2, #0 str r2, [r0], #+4 add r3, r3, #1 cmn r3, #1 bne LBB1_1 @cond_next This looks the same, but has one fewer induction variable (and therefore, one fewer register) live in the loop. llvm-svn: 35592
-
Chris Lattner authored
llvm-svn: 35588
-
Chris Lattner authored
llvm-svn: 35587
-
Chris Lattner authored
test/Transforms/InstCombine/xor.ll:test28 llvm-svn: 35584
-
Chris Lattner authored
llvm-svn: 35576
-
Chris Lattner authored
isel has its own particular features that it wants in the CFG, in order to reduce the number of times a constant is computed, etc. Make sure that we clean up the CFG before doing any other things for isel. Doing so can dramatically reduce the number of split edges and reduce the number of places that constants get computed. For example, this shrinks CodeGen/Generic/phi-immediate-factoring.ll from 44 to 37 instructions on X86, and from 21 to 17 MBB's in the output. This is primarily a code size win, not a performance win. This implements CodeGen/Generic/phi-immediate-factoring.ll and PR1296. llvm-svn: 35575
-