- Apr 02, 2007
-
-
Reid Spencer authored
llvm-svn: 35595
-
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: 35591
-
Chris Lattner authored
equality comparisons of a constant. This allows us to codegen the 'sintzero' loop in PR1288 as: LBB1_1: ;cond_next li r4, 0 addi r2, r2, 1 stw r4, 0(r3) addi r3, r3, 4 cmpwi cr0, r2, -1 bne cr0, LBB1_1 ;cond_next instead of: LBB1_1: ;cond_next addi r2, r2, 1 li r4, 0 xoris r5, r2, 65535 stw r4, 0(r3) addi r3, r3, 4 cmplwi cr0, r5, 65535 bne cr0, LBB1_1 ;cond_next This implements CodeGen/PowerPC/compare-simm.ll, and also cuts 74 instructions out of kc++. llvm-svn: 35590
-
Chris Lattner authored
llvm-svn: 35589
-
Chris Lattner authored
llvm-svn: 35588
-
Chris Lattner authored
llvm-svn: 35587
-
Chris Lattner authored
llvm-svn: 35586
-
Chris Lattner authored
llvm-svn: 35585
-
Chris Lattner authored
test/Transforms/InstCombine/xor.ll:test28 llvm-svn: 35584
-
Chris Lattner authored
llvm-svn: 35583
-
Chris Lattner authored
llvm-svn: 35582
-
Reid Spencer authored
llvm-svn: 35581
-
Reid Spencer authored
llvm-svn: 35580
-
Reid Spencer authored
llvm-svn: 35579
-
Reid Spencer authored
llvm-svn: 35578
-
Reid Spencer authored
intrinsics works. llvm-svn: 35577
-
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
-
Chris Lattner authored
llvm-svn: 35574
-
Lauro Ramos Venancio authored
flags (ARMISD::CMPNZ) and comparisons that use all flags (ARMISD::CMP). - Defines the instructions: TST, TEQ (ARM) and TST (Thumb). llvm-svn: 35573
-
Chris Lattner authored
llvm-svn: 35572
-
Reid Spencer authored
llvm-svn: 35571
-
Reid Spencer authored
llvm-svn: 35570
-
Reid Spencer authored
llvm-svn: 35569
-
Reid Spencer authored
llvm-svn: 35568
-
Reid Spencer authored
Make sure that the CTPOP result is casted to i32 as the bit counting intrinsics all return i32 now (this affects CTLZ and CTTZ as well). llvm-svn: 35567
-
Reid Spencer authored
this intrinsic. llvm-svn: 35566
-
Reid Spencer authored
rules for overloaded intrinsic functions. llvm-svn: 35565
-
Reid Spencer authored
llvm-svn: 35564
-
Chris Lattner authored
llvm-svn: 35563
-
Anton Korobeynikov authored
llvm-svn: 35562
-
- Apr 01, 2007
-
-
Chris Lattner authored
llvm-svn: 35561
-
Chris Lattner authored
llvm-svn: 35560
-
Chris Lattner authored
llvm-svn: 35559
-
Reid Spencer authored
llvm-svn: 35558
-
Jeff Cohen authored
llvm-svn: 35557
-
Reid Spencer authored
last night's regression in SingleSource/UnitTests/2005-05-11-Popcount-ffs-fls llvm-svn: 35556
-