- Feb 13, 2006
-
-
Jim Laskey authored
llvm-svn: 26145
-
Chris Lattner authored
following handy-dandy properties: 1. it is always correct now 2. it is much faster than before 3. it is easier to understand This implementation builds off of the recent simplifications of the legalizer that made it single-pass instead of iterative. This fixes JM/lencod, JM/ldecod, and CodeGen/Generic/2006-02-12-InsertLibcall.ll (at least on PPC). llvm-svn: 26144
-
Chris Lattner authored
CALLSEQ_START nodes. llvm-svn: 26143
-
Chris Lattner authored
llvm-svn: 26142
-
Chris Lattner authored
llvm-svn: 26141
-
Chris Lattner authored
llvm-svn: 26140
-
Chris Lattner authored
llvm-svn: 26139
-
Chris Lattner authored
of the input. This fixes the mediabench/gsm/toast failure last night. llvm-svn: 26138
-
- Feb 12, 2006
-
-
Evan Cheng authored
llvm-svn: 26137
-
Nate Begeman authored
PowerPC/and-imm.ll llvm-svn: 26136
-
Chris Lattner authored
llvm-svn: 26135
-
Chris Lattner authored
llvm-svn: 26134
-
Chris Lattner authored
llvm-svn: 26133
-
Chris Lattner authored
1. Teach GetConstantInType to handle boolean constants. 2. Teach instcombine to fold (compare X, CST) when X has known 0/1 bits. Testcase here: set.ll:test22 3. Improve the "(X >> c1) & C2 == 0" folding code to allow a noop cast between the shift and and. More aggressive bitfolding for other reasons was turning signed shr's into unsigned shr's, leaving the noop cast in the way. llvm-svn: 26131
-
Chris Lattner authored
llvm-svn: 26130
-
Chris Lattner authored
xfail marker with it llvm-svn: 26129
-
Chris Lattner authored
llvm-svn: 26128
-
Chris Lattner authored
llvm-svn: 26127
-
- Feb 11, 2006
-
-
Chris Lattner authored
llvm-svn: 26126
-
Chris Lattner authored
llvm-svn: 26124
-
Chris Lattner authored
llvm-svn: 26123
-
Chris Lattner authored
This allows us to simplify on conditions where bits are not known, but they are not demanded either! This also fixes a couple of bugs in ComputeMaskedBits that were exposed during this work. In the future, swaths of instcombine should be removed, as this code subsumes a bunch of ad-hockery. llvm-svn: 26122
-
Chris Lattner authored
llvm-svn: 26121
-
Duraid Madina authored
fix storing booleans (grawp missed this one) llvm-svn: 26120
-
Duraid Madina authored
now short immediates will get matched (previously constants were all triggering movl 64bit imm fat instructions) llvm-svn: 26119
-
Chris Lattner authored
loops and their subloops. llvm-svn: 26118
-
Evan Cheng authored
X86 addressing mode. Currently we do not allow any node whose target node produces a chain as well as any node that is at the root of the addressing mode expression tree. llvm-svn: 26117
-
Chris Lattner authored
llvm-svn: 26116
-
Jim Laskey authored
to SelIDAG. llvm-svn: 26115
-
Chris Lattner authored
llvm-svn: 26114
-
Chris Lattner authored
llvm-svn: 26113
-
Chris Lattner authored
llvm-svn: 26112
-
- Feb 10, 2006
-
-
Evan Cheng authored
llvm-svn: 26111
-
Evan Cheng authored
llvm-svn: 26110
-
Chris Lattner authored
llvm-svn: 26109
-
Chris Lattner authored
phi's in the successors llvm-svn: 26108
-
Chris Lattner authored
intrinsics. Autogen frameindex matcher llvm-svn: 26107
-
Chris Lattner authored
llvm-svn: 26106
-
Evan Cheng authored
llvm-svn: 26105
-
Chris Lattner authored
with branches on partially invariant computations. llvm-svn: 26104
-