- Oct 25, 2007
-
-
Bill Wendling authored
llvm-svn: 43353
-
Duncan Sands authored
Use NVT rather than looking it up, since we have it to hand. llvm-svn: 43341
-
Duncan Sands authored
llvm-svn: 43340
-
Duncan Sands authored
llvm-svn: 43339
-
Dale Johannesen authored
llvm-svn: 43314
-
- Oct 24, 2007
-
-
Bill Wendling authored
llvm-svn: 43271
-
Bill Wendling authored
memcpy library function instead. llvm-svn: 43270
-
Bill Wendling authored
llvm-svn: 43264
-
- Oct 23, 2007
-
-
Bill Wendling authored
have their own custom memcpy lowering code. This code needs to be factored out into a target-independent lowering method with hooks to the backend. In the meantime, just call memcpy if we're trying to copy onto a stack. llvm-svn: 43262
-
Evan Cheng authored
llvm-svn: 43256
-
Evan Cheng authored
llvm-svn: 43249
-
- Oct 22, 2007
-
-
Evan Cheng authored
llvm-svn: 43227
-
Duncan Sands authored
funky bit-widths. llvm-svn: 43225
-
Duncan Sands authored
operations so they work right for integers with funky bit-widths. For example, consider extending i48 to i64 on a 32 bit machine. The i64 result is expanded to 2 x i32. We know that the i48 operand will be promoted to i64, then also expanded to 2 x i32. If we had the expanded promoted operand to hand, then expanding the result would be trivial. Unfortunately at this stage we can only get hold of the promoted operand. So instead we kind of hand-expand, doing explicit shifting and truncating to get the top and bottom halves of the i64 operand into 2 x i32, which are then used to expand the result. This is harmless, because when the promoted operand is finally expanded all this bit fiddling turns into trivial operations which are eliminated either by the expansion code itself or the DAG combiner. llvm-svn: 43223
-
Evan Cheng authored
- Remove a bogus assertion. llvm-svn: 43211
-
- Oct 21, 2007
-
-
Chris Lattner authored
llvm-svn: 43204
-
- Oct 20, 2007
-
-
Chris Lattner authored
with the new legalizer. llvm-svn: 43199
-
Chris Lattner authored
llvm-svn: 43198
-
Chris Lattner authored
This fixes CodeGen/X86/mem*.ll. llvm-svn: 43197
-
Evan Cheng authored
llvm-svn: 43196
-
Dale Johannesen authored
the operand's type from the right place. llvm-svn: 43195
-
- Oct 19, 2007
-
-
Evan Cheng authored
Turn a store folding instruction into a load folding instruction. e.g. xorl %edi, %eax movl %eax, -32(%ebp) movl -36(%ebp), %eax orl %eax, -32(%ebp) => xorl %edi, %eax orl -36(%ebp), %eax mov %eax, -32(%ebp) This enables the unfolding optimization for a subsequent instruction which will also eliminate the newly introduced store instruction. llvm-svn: 43192
-
Bill Wendling authored
llvm-svn: 43191
-
Duncan Sands authored
llvm-svn: 43190
-
Dale Johannesen authored
llvm-svn: 43189
-
Chris Lattner authored
llvm-svn: 43181
-
Chris Lattner authored
by Duncan llvm-svn: 43177
-
Duncan Sands authored
llvm-svn: 43175
-
Duncan Sands authored
asserts in later checks rather than producing the ordinary load it is supposed to. Avoid all such hassles by directly returning an ordinary load in this case. llvm-svn: 43174
-
Rafael Espindola authored
To do this it is necessary to add a "always inline" argument to the memcpy node. For completeness I have also added this node to memmove and memset. I have also added getMem* functions, because the extra argument makes it cumbersome to use getNode and because I get confused by it :-) llvm-svn: 43172
-
Chris Lattner authored
llvm-svn: 43171
-
Chris Lattner authored
llvm-svn: 43170
-
Chris Lattner authored
llvm-svn: 43169
-
Chris Lattner authored
llvm-svn: 43167
-
Chris Lattner authored
llvm-svn: 43166
-
Chris Lattner authored
llvm-svn: 43165
-
Bill Wendling authored
llvm-svn: 43161
-
Dale Johannesen authored
llvm-svn: 43160
-
- Oct 18, 2007
-
-
Bill Wendling authored
llvm-svn: 43120
-
Duncan Sands authored
llvm-svn: 43119
-