- Mar 04, 2006
-
-
Chris Lattner authored
llvm-svn: 26523
-
Chris Lattner authored
llvm-svn: 26522
-
Chris Lattner authored
llvm-svn: 26521
-
Evan Cheng authored
llvm-svn: 26520
-
Chris Lattner authored
This implements Transforms/InstCombine/add.ll:test31 llvm-svn: 26519
-
Evan Cheng authored
rep/stos and rep/mov if the count is not a constant. We could do rep/stosl; and $count, 3; rep/stosb For now, I will lower them to memset / memcpy calls. We will revisit this after a little bit experiment. Also need to take care of the trailing bytes even if the count is a constant. Since the max. number of trailing bytes are 3, we will simply issue loads / stores. llvm-svn: 26517
-
Chris Lattner authored
don't assume that A[1][0] and A[0][i] can't alias. "i" might be out of range, or even negative. This fixes a miscompilation of 188.ammp (which does bad pointer tricks) with the new CFE. Testcase here: Analysis/BasicAA/2006-03-03-BadArraySubscript.ll llvm-svn: 26515
-
Chris Lattner authored
llvm-svn: 26513
-
Evan Cheng authored
llvm-svn: 26512
-
- Mar 03, 2006
-
-
Jim Laskey authored
llvm-svn: 26509
-
Chris Lattner authored
llvm-svn: 26506
-
Jim Laskey authored
llvm-svn: 26505
-
Evan Cheng authored
llvm-svn: 26504
-
Evan Cheng authored
llvm-svn: 26503
-
Evan Cheng authored
llvm-svn: 26502
-
Evan Cheng authored
llvm-svn: 26501
-
Evan Cheng authored
llvm-svn: 26500
-
Jeff Cohen authored
llvm-svn: 26498
-
Evan Cheng authored
llvm-svn: 26493
-
Chris Lattner authored
llvm-svn: 26490
-
Chris Lattner authored
llvm-svn: 26484
-
Chris Lattner authored
llvm-svn: 26482
-
Chris Lattner authored
llvm-svn: 26481
-
Chris Lattner authored
llvm-svn: 26479
-
Chris Lattner authored
PR709, and paving the way for future progress. llvm-svn: 26476
-
Chris Lattner authored
llvm-svn: 26475
-
Chris Lattner authored
PR709, and paving the way for future progress. Significantly refactor autoupgrading code, to handle the more complex case (where we upgrade one argument in a function), and fix some bugs in it. Testcase here: llvm/test/Regression/Bytecode/memcpy.ll llvm-svn: 26474
-
- Mar 02, 2006
-
-
Chris Lattner authored
llvm-svn: 26472
-
Evan Cheng authored
a predecessor appearing more than once in the operand list was counted as multiple predecessor; priority1 should be updated during scheduling; CycleBound was updated after the node is inserted into priority queue; one of the tie breaking condition was flipped. - Take into consideration of two address opcodes. If a predecessor is a def&use operand, it should have a higher priority. - Scheduler should also favor floaters, i.e. nodes that do not have real predecessors such as MOV32ri. - The scheduling fixes / tweaks fixed bug 478: .text .align 4 .globl _f _f: movl 4(%esp), %eax movl 8(%esp), %ecx movl %eax, %edx imull %ecx, %edx imull %eax, %eax imull %ecx, %ecx addl %eax, %ecx leal (%ecx,%edx,2), %eax ret It is also a slight performance win (1% - 3%) for most tests. llvm-svn: 26470
-
Chris Lattner authored
pointed out: realize the AND can provide factors and look through Casts. llvm-svn: 26469
-
Jim Laskey authored
llvm-svn: 26466
-
- Mar 01, 2006
-
-
Evan Cheng authored
span multiple lines. llvm-svn: 26463
-
Evan Cheng authored
llvm-svn: 26462
-
Evan Cheng authored
multi-line comments. llvm-svn: 26461
-
Chris Lattner authored
in the dag combiner on 176.gcc on x86. llvm-svn: 26459
-
Jim Laskey authored
debug forms. llvm-svn: 26455
-
Chris Lattner authored
llvm-svn: 26454
-
Jim Laskey authored
llvm-svn: 26453
-
Jim Laskey authored
llvm-svn: 26452
-
Jim Laskey authored
llvm-svn: 26451
-