- Oct 31, 2007
-
-
Owen Anderson authored
llvm-svn: 43541
-
Dale Johannesen authored
llvm-svn: 43535
-
- Oct 30, 2007
-
-
Evan Cheng authored
llvm-svn: 43511
-
Duncan Sands authored
storing an i170 on a 32 bit machine. This is first promoted to a trunc-i170 store of an i256. On a little-endian machine this expands to a store of an i128 and a trunc-i42 store of an i128. The trunc-i42 store is further expanded to a trunc-i42 store of an i64, then to a store of an i32 and a trunc-i10 store of an i32. At this point the operand type is legal (i32) and expansion stops (legalization of the trunc-i10 needs to be handled in LegalizeDAG.cpp). On big-endian machines the high bits are stored first, and some bit-fiddling is needed in order to generate aligned stores. llvm-svn: 43499
-
Duncan Sands authored
offload to getStore rather than trying to handle both cases at once (the assertions for example assume the store really is truncating). llvm-svn: 43498
-
- Oct 29, 2007
-
-
Dan Gohman authored
llvm-svn: 43470
-
Evan Cheng authored
transformation. Previously, it's restricted by ensuring the number of load uses is one. Now the restriction is loosened up by allowing setcc uses to be "extended" (e.g. setcc x, c, eq -> setcc sext(x), sext(c), eq). llvm-svn: 43465
-
Dan Gohman authored
llvm-svn: 43464
-
- Oct 28, 2007
-
-
Duncan Sands authored
of offset and the alignment of ptr if these are both powers of 2. While the ptr alignment is guaranteed to be a power of 2, there is no reason to think that offset is. For example, if offset is 12 (the size of a long double on x86-32 linux) and the alignment of ptr is 8, then the alignment of ptr+offset will in general be 4, not 8. Introduce a function MinAlign, lifted from gcc, for computing the minimum guaranteed alignment. I've tried to fix up everywhere under lib/CodeGen/SelectionDAG/. I also changed some places that weren't wrong (because both values were a power of 2), as a defensive change against people copying and pasting the code. Hopefully someone who cares about alignment will review the rest of LLVM and fix up the remaining places. Since I'm on x86 I'm not very motivated to do this myself... llvm-svn: 43421
-
- Oct 26, 2007
-
-
Bill Wendling authored
FE. - Explicitly pass in the alignment of the load & store. - XFAIL 2007-10-23-UnalignedMemcpy.ll because llc has a bug that crashes on unaligned pointers. llvm-svn: 43398
-
- Oct 25, 2007
-
-
Bill Wendling authored
llvm-svn: 43359
-
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
-