summaryrefslogtreecommitdiffstats
path: root/llvm/lib/CodeGen
Commit message (Collapse)AuthorAgeFilesLines
...
* Fix PR1187.Evan Cheng2007-11-051-1/+1
| | | | llvm-svn: 43692
* Eliminate the remaining uses of getTypeSize. ThisDuncan Sands2007-11-055-27/+28
| | | | | | | | | | | | | | should only effect x86 when using long double. Now 12/16 bytes are output for long double globals (the exact amount depends on the alignment). This brings globals in line with the rest of LLVM: the space reserved for an object is now always the ABI size. One tricky point is that only 10 bytes should be output for long double if it is a field in a packed struct, which is the reason for the additional argument to EmitGlobalConstant. llvm-svn: 43688
* Another step of stronger PHI elimination down.Owen Anderson2007-11-041-0/+88
| | | | llvm-svn: 43684
* If an interval is being undone clear its preference as well since the source ↵Evan Cheng2007-11-041-1/+6
| | | | | | interval may have been undone as well. llvm-svn: 43670
* There are times when the coalescer would not coalesce away a copy but the copyEvan Cheng2007-11-032-9/+122
| | | | | | | | | | | | | | | | can be eliminated by the allocator is the destination and source targets the same register. The most common case is when the source and destination registers are in different class. For example, on x86 mov32to32_ targets GR32_ which contains a subset of the registers in GR32. The allocator can do 2 things: 1. Set the preferred allocation for the destination of a copy to that of its source. 2. After allocation is done, change the allocation of a copy destination (if legal) so the copy can be eliminated. This eliminates 443 extra moves from 403.gcc. llvm-svn: 43662
* Add std:: to sort calls.Dan Gohman2007-11-021-1/+1
| | | | llvm-svn: 43652
* Change illegal uses of ++ to uses of STLExtra.h's next function.Dan Gohman2007-11-021-1/+1
| | | | llvm-svn: 43651
* One more extract_subreg coalescing bug.Evan Cheng2007-11-021-5/+33
| | | | llvm-svn: 43644
* Fix a thinko.Duncan Sands2007-11-021-3/+2
| | | | llvm-svn: 43639
* Executive summary: getTypeSize -> getTypeStoreSize / getABITypeSize.Duncan Sands2007-11-013-9/+9
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | The meaning of getTypeSize was not clear - clarifying it is important now that we have x86 long double and arbitrary precision integers. The issue with long double is that it requires 80 bits, and this is not a multiple of its alignment. This gives a primitive type for which getTypeSize differed from getABITypeSize. For arbitrary precision integers it is even worse: there is the minimum number of bits needed to hold the type (eg: 36 for an i36), the maximum number of bits that will be overwriten when storing the type (40 bits for i36) and the ABI size (i.e. the storage size rounded up to a multiple of the alignment; 64 bits for i36). This patch removes getTypeSize (not really - it is still there but deprecated to allow for a gradual transition). Instead there is: (1) getTypeSizeInBits - a number of bits that suffices to hold all values of the type. For a primitive type, this is the minimum number of bits. For an i36 this is 36 bits. For x86 long double it is 80. This corresponds to gcc's TYPE_PRECISION. (2) getTypeStoreSizeInBits - the maximum number of bits that is written when storing the type (or read when reading it). For an i36 this is 40 bits, for an x86 long double it is 80 bits. This is the size alias analysis is interested in (getTypeStoreSize returns the number of bytes). There doesn't seem to be anything corresponding to this in gcc. (3) getABITypeSizeInBits - this is getTypeStoreSizeInBits rounded up to a multiple of the alignment. For an i36 this is 64, for an x86 long double this is 96 or 128 depending on the OS. This is the spacing between consecutive elements when you form an array out of this type (getABITypeSize returns the number of bytes). This is TYPE_SIZE in gcc. Since successive elements in a SequentialType (arrays, pointers and vectors) need to be aligned, the spacing between them will be given by getABITypeSize. This means that the size of an array is the length times the getABITypeSize. It also means that GEP computations need to use getABITypeSize when computing offsets. Furthermore, if an alloca allocates several elements at once then these too need to be aligned, so the size of the alloca has to be the number of elements multiplied by getABITypeSize. Logically speaking this doesn't have to be the case when allocating just one element, but it is simpler to also use getABITypeSize in this case. So alloca's and mallocs should use getABITypeSize. Finally, since gcc's only notion of size is that given by getABITypeSize, if you want to output assembler etc the same as gcc then getABITypeSize is the size you want. Since a store will overwrite no more than getTypeStoreSize bytes, and a read will read no more than that many bytes, this is the notion of size appropriate for alias analysis calculations. In this patch I have corrected all type size uses except some of those in ScalarReplAggregates, lib/Codegen, lib/Target (the hard cases). I will get around to auditing these too at some point, but I could do with some help. Finally, I made one change which I think wise but others might consider pointless and suboptimal: in an unpacked struct the amount of space allocated for a field is now given by the ABI size rather than getTypeStoreSize. I did this because every other place that reserves memory for a type (eg: alloca) now uses getABITypeSize, and I didn't want to make an exception for unpacked structs, i.e. I did it to make things more uniform. This only effects structs containing long doubles and arbitrary precision integers. If someone wants to pack these types more tightly they can always use a packed struct. llvm-svn: 43620
* - Coalesce extract_subreg when both intervals are relatively small.Evan Cheng2007-11-011-23/+46
| | | | | | - Some code clean up. llvm-svn: 43606
* Promotion of sdiv/srem/udiv/urem.Duncan Sands2007-10-311-0/+32
| | | | llvm-svn: 43551
* Add a newline at the end of the file.Duncan Sands2007-10-312-2/+2
| | | | llvm-svn: 43550
* Add the skeleton of a better PHI elimination pass.Owen Anderson2007-10-311-0/+112
| | | | llvm-svn: 43542
* Some fixes to get MachineDomTree working better.Owen Anderson2007-10-311-0/+24
| | | | llvm-svn: 43541
* Make i64=expand_vector_elt(v2i64) work in 32-bit mode.Dale Johannesen2007-10-311-0/+5
| | | | llvm-svn: 43535
* Typo.Evan Cheng2007-10-301-1/+1
| | | | llvm-svn: 43511
* Add support for expanding trunc stores. ConsiderDuncan Sands2007-10-301-62/+126
| | | | | | | | | | | | | | | | | 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
* If a call to getTruncStore is for a normal store,Duncan Sands2007-10-301-3/+5
| | | | | | | | 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
* Fix a DAGCombiner abort on a bitcast from a scalar to a vector.Dan Gohman2007-10-291-1/+2
| | | | llvm-svn: 43470
* Enable more fold (sext (load x)) -> (sext (truncate (sextload x)))Evan Cheng2007-10-291-24/+134
| | | | | | | | 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
* Add explicit keywords.Dan Gohman2007-10-291-1/+1
| | | | llvm-svn: 43464
* The guaranteed alignment of ptr+offset is only the minimum ofDuncan Sands2007-10-283-23/+27
| | | | | | | | | | | | | | | | | | | 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
* - Remove the hacky code that forces a memcpy. Alignment is taken care of in theBill Wendling2007-10-261-11/+3
| | | | | | | | | 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
* Changed XXX to FIXME, and added comment to the README fileBill Wendling2007-10-252-1/+9
| | | | llvm-svn: 43359
* Added comment explaining why we are doing this check.Bill Wendling2007-10-251-0/+5
| | | | llvm-svn: 43353
* Small formatting changes. Add a sanity check.Duncan Sands2007-10-251-10/+6
| | | | | | | Use NVT rather than looking it up, since we have it to hand. llvm-svn: 43341
* Promote SETCC operands.Duncan Sands2007-10-251-0/+13
| | | | llvm-svn: 43340
* Correctly extract the ValueType from a VTSDNode.Duncan Sands2007-10-251-1/+1
| | | | llvm-svn: 43339
* Another expansion for i64 multiply, suitable for PPC.Dale Johannesen2007-10-241-0/+9
| | | | llvm-svn: 43314
* Fix comment and use the "Size" variable that's already provided.Bill Wendling2007-10-231-10/+5
| | | | llvm-svn: 43271
* If there's an unaligned memcpy to/from the stack, don't lower it. Just call theBill Wendling2007-10-231-0/+13
| | | | | | memcpy library function instead. llvm-svn: 43270
* This broke lots. Reverting.Bill Wendling2007-10-231-4/+0
| | | | llvm-svn: 43264
* Lowering a memcpy to the stack is killing PPC. The ARM and X86 backends alreadyBill Wendling2007-10-231-0/+4
| | | | | | | | 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
* It's possible to commute instrctions with more than 3 operands.Evan Cheng2007-10-231-1/+1
| | | | llvm-svn: 43256
* isSubRegOf() is a dup of isSubRegister.Evan Cheng2007-10-231-1/+1
| | | | llvm-svn: 43249
* Add missing paratheses.Evan Cheng2007-10-221-1/+1
| | | | llvm-svn: 43227
* Support for expanding extending loads of integers withDuncan Sands2007-10-221-16/+71
| | | | | | funky bit-widths. llvm-svn: 43225
* Fix up the logic for result expanding the various extensionDuncan Sands2007-10-221-27/+95
| | | | | | | | | | | | | | | | | | | 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
* - Only perform the unfolding optimization when the folding in question is ↵Evan Cheng2007-10-221-5/+2
| | | | | | | | modref. - Remove a bogus assertion. llvm-svn: 43211
* Add promote operand support for [su]int_to_fp.Chris Lattner2007-10-201-0/+15
| | | | llvm-svn: 43204
* Add result promotion of FP_TO_*INT, fixing CodeGen/X86/trunc-to-bool.llChris Lattner2007-10-201-1/+29
| | | | | | with the new legalizer. llvm-svn: 43199
* simplify some code.Chris Lattner2007-10-201-1/+1
| | | | llvm-svn: 43198
* Implement promote and expand for operands of memcpy and friends. Chris Lattner2007-10-201-0/+62
| | | | | | This fixes CodeGen/X86/mem*.ll. llvm-svn: 43197
* Added missing curly braces which renders the if clause useless in debug build.Evan Cheng2007-10-201-1/+2
| | | | llvm-svn: 43196
* Fix a few places vector operations were not gettingDale Johannesen2007-10-201-6/+9
| | | | | | the operand's type from the right place. llvm-svn: 43195
* Local spiller optimization:Evan Cheng2007-10-191-139/+243
| | | | | | | | | | | | | | | | 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
* Don't branch fold inline asm statements.Bill Wendling2007-10-191-1/+2
| | | | llvm-svn: 43191
* Add support for a few more nodes.Duncan Sands2007-10-191-5/+42
| | | | llvm-svn: 43190
* Redo "last ppc long double fix" as Chris wants.Dale Johannesen2007-10-192-2/+3
| | | | llvm-svn: 43189
OpenPOWER on IntegriCloud