llvm-mirror

mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-30 15:32:52 +01:00

Author	SHA1	Message	Date
Chris Lattner	3cfa7a24cb	Turn PPC64 and VMX into classes that can be added to instructions instead of bits that must be passed up the inheritance hierarchy. Convert MForm and AForm instructions over llvm-svn: 21345	2005-04-19 04:32:54 +00:00
Nate Begeman	3b1c0df702	Next round of PPC CR optimizations. For the following code: int %bar(float %a, float %b, float %c, float %d) { entry: %tmp.1 = setlt float %a, %d %tmp.2 = setlt float %b, %d %or = or bool %tmp.1, %tmp.2 %tmp.3 = setgt float %c, %d %tmp.4 = or bool %or, %tmp.3 %tmp.5 = and bool %tmp.4, true %retval = cast bool %tmp.5 to int ret int %retval } We now emit: _bar: .LBB_bar_0: ; entry fcmpu cr0, f1, f4 fcmpu cr1, f2, f4 cror 0, 0, 4 fcmpu cr1, f3, f4 cror 28, 0, 5 mfcr r2 rlwinm r3, r2, 29, 31, 31 blr Instead of: _bar: .LBB_bar_0: ; entry fcmpu cr7, f1, f4 mfcr r2 rlwinm r2, r2, 29, 31, 31 fcmpu cr7, f2, f4 mfcr r3 rlwinm r3, r3, 29, 31, 31 or r2, r2, r3 fcmpu cr7, f3, f4 mfcr r3 rlwinm r3, r3, 30, 31, 31 or r3, r2, r3 blr llvm-svn: 21321	2005-04-18 07:48:09 +00:00
Chris Lattner	4d9c1d06da	silence a bogus warning llvm-svn: 21320	2005-04-18 05:26:21 +00:00
Chris Lattner	188ecaab1d	Fold setcc of MVT::i1 operands into logical operations llvm-svn: 21319	2005-04-18 04:48:12 +00:00
Chris Lattner	72aca1b758	Another minor simplification: handle setcc (zero_extend x), c -> setcc(x, c') llvm-svn: 21318	2005-04-18 04:30:45 +00:00
Chris Lattner	e6117e5d4f	Another simple xform llvm-svn: 21317	2005-04-18 04:11:19 +00:00
Chris Lattner	f6f5b23a00	Fold: // (X != 0) \| (Y != 0) -> (X\|Y != 0) // (X == 0) & (Y == 0) -> (X\|Y == 0) Compiling this: int %bar(int %a, int %b) { entry: %tmp.1 = setne int %a, 0 %tmp.2 = setne int %b, 0 %tmp.3 = or bool %tmp.1, %tmp.2 %retval = cast bool %tmp.3 to int ret int %retval } to this: _bar: or r2, r3, r4 addic r3, r2, -1 subfe r3, r3, r2 blr instead of: _bar: addic r2, r3, -1 subfe r2, r2, r3 addic r3, r4, -1 subfe r3, r3, r4 or r3, r2, r3 blr llvm-svn: 21316	2005-04-18 03:59:53 +00:00
Chris Lattner	a32c50520c	Make the AND elimination operation recursive and significantly more powerful, eliminating an and for Nate's testcase: int %bar(int %a, int %b) { entry: %tmp.1 = setne int %a, 0 %tmp.2 = setne int %b, 0 %tmp.3 = or bool %tmp.1, %tmp.2 %retval = cast bool %tmp.3 to int ret int %retval } generating: _bar: addic r2, r3, -1 subfe r2, r2, r3 addic r3, r4, -1 subfe r3, r3, r4 or r3, r2, r3 blr instead of: _bar: addic r2, r3, -1 subfe r2, r2, r3 addic r3, r4, -1 subfe r3, r3, r4 or r2, r2, r3 rlwinm r3, r2, 0, 31, 31 blr llvm-svn: 21315	2005-04-18 03:48:41 +00:00
Nate Begeman	85cd65b389	Change codegen for setcc to read the bit directly out of the condition register. Added support in the .td file for the g5-specific variant of cr -> gpr moves that executes faster, but we currently don't generate it. llvm-svn: 21314	2005-04-18 02:43:24 +00:00
Chris Lattner	25a77fc58f	Add support for targets that require stubs for external functions. llvm-svn: 21313	2005-04-18 01:44:27 +00:00
Chris Lattner	a1fd64a073	Handle ExternalSymbol operands in the PPC JIT llvm-svn: 21312	2005-04-18 00:46:10 +00:00
Nate Begeman	ecb5b5c028	Make pattern isel default for ppc Add new ppc beta option related to using condition registers Make pattern isel control flag (-enable-pattern-isel) global and tristate 0 == off 1 == on 2 == target default llvm-svn: 21309	2005-04-15 22:12:16 +00:00
Chris Lattner	a117cf4215	a new simple pass, which will be extended to be more useful in the future. This pass forward branches through conditions when it can show that the conditions is either always true or false for a predecessor. This currently only handles the most simple cases of this, but is successful at threading across 2489 branches and 65 switch instructions in 176.gcc, which isn't bad. llvm-svn: 21306	2005-04-15 19:28:32 +00:00
Andrew Lenharth	f091300df2	fix calls llvm-svn: 21303	2005-04-14 17:34:20 +00:00
Andrew Lenharth	23a5d0bba4	a 21264 fix, and fix the operator precidence on an and -> zap check (should fix hundreds of test cases llvm-svn: 21302	2005-04-14 16:24:00 +00:00
Duraid Madina	0c40c548c0	print negative 64 bit immediates as negative numbers, makes things a little easier on the eyes, not that numbers like 18446744073709541376 are bad or anything llvm-svn: 21300	2005-04-14 10:08:01 +00:00
Duraid Madina	b8dfae92e9	oops, this stopped us turning movl r4=0xFFFFFFFF;; and rX, r4 into zxt4 llvm-svn: 21299	2005-04-14 10:06:35 +00:00
Nate Begeman	604895b03c	Implement multi-way branches through logical ops on condition registers. This can generate considerably shorter code, reducing the size of crafty by almost 1%. Also fix the printing of mcrf. The code is currently disabled until it gets a bit more testing, but should work as-is. llvm-svn: 21298	2005-04-14 09:45:08 +00:00
Nate Begeman	ce63e383b8	Add a couple missing transforms in getSetCC that were triggering assertions in the PPC Pattern ISel llvm-svn: 21297	2005-04-14 08:56:52 +00:00
Duraid Madina	eb4c15b42c	we have zextloads, not sextloads! llvm-svn: 21296	2005-04-14 08:37:32 +00:00
Nate Begeman	b707ec16b4	Add the necessary support to codegen condition register logical ops with register allocated condition registers. Make sure that the printed output is gas compatible. llvm-svn: 21295	2005-04-14 03:20:38 +00:00
Nate Begeman	99a9840b56	Start allocating condition registers. Almost all explicit uses of CR0 are now gone. Next step is to get rid of the remaining ones and then start allocating bools to CRs where appropriate. llvm-svn: 21294	2005-04-13 23:15:44 +00:00
Nate Begeman	ae49d52006	Implement the fold shift X, zext(Y) -> shift X, Y at the target level, where it is safe to do so. llvm-svn: 21293	2005-04-13 22:14:14 +00:00
Nate Begeman	20b3399465	Disbale the broken fold of shift + sz[ext] for now Move the transform for select (a < 0) ? b : 0 into the dag from ppc isel Enable the dag to fold and (setcc, 1) -> setcc for targets where setcc always produces zero or one. llvm-svn: 21291	2005-04-13 21:23:31 +00:00
Chris Lattner	89f7e115a4	fix an infinite loop llvm-svn: 21289	2005-04-13 20:06:29 +00:00
Chris Lattner	475fe85ddf	fix some serious miscompiles on ia64, alpha, and ppc llvm-svn: 21288	2005-04-13 19:53:40 +00:00
Chris Lattner	03d675414e	avoid work when possible, perhaps fix the problem nate and andrew are seeing with != 0 comparisons vanishing. llvm-svn: 21287	2005-04-13 19:41:05 +00:00
Andrew Lenharth	cbf7a52768	WOW, function calls still seem to work after this. llvm-svn: 21286	2005-04-13 17:17:28 +00:00
Andrew Lenharth	d1fee6d24a	prepare for func call optimization llvm-svn: 21285	2005-04-13 16:19:50 +00:00
Duraid Madina	b9d2d9ac63	* add the shladd instruction * fold left shifts of 1, 2, 3 or 4 bits into adds This doesn't save much now, but should get a serious workout once multiplies by constants get converted to shift/add/sub sequences. Hold on! :) llvm-svn: 21282	2005-04-13 06:12:04 +00:00
Andrew Lenharth	ec33ab6a2f	add matches for SxADDL and company, as well as simplify the SxADDQ code llvm-svn: 21281	2005-04-13 05:19:55 +00:00
Chris Lattner	9540cf8c7e	Implement expansion of unsigned i64 -> FP. Note that this probably only works for little endian targets, but is enough to get siod working :) llvm-svn: 21280	2005-04-13 05:09:42 +00:00
Duraid Madina	67e553e521	* if ANDing with a constant of the form: 0x00000..00FFF..FF ^ ^ ^ ^ any number of 0's followed by some number of 1's then we use dep.z to just paste zeros over the input. For the special cases where this is zxt1/zxt2/zxt4, we use those instructions instead, because we're all about readability!!! that's what it's about!! readability! twitch ;D llvm-svn: 21279	2005-04-13 04:50:54 +00:00
Andrew Lenharth	510db15268	added all flavors of zap for anding llvm-svn: 21276	2005-04-13 03:47:03 +00:00
Chris Lattner	1a6247ff51	Make expansion of uint->fp cast assert out instead of infinitely recurse. llvm-svn: 21275	2005-04-13 03:42:14 +00:00
Chris Lattner	85c6a7bed0	Fix some mysteriously missing {}'s which cause the miscompilation of Olden/mst, Ptrdist/bc, Obsequi, etc. llvm-svn: 21274	2005-04-13 03:29:53 +00:00
Chris Lattner	63450e87d9	add back the optimization that Nate added for shl X, (zext_inreg y) llvm-svn: 21273	2005-04-13 02:58:13 +00:00
Chris Lattner	759afe07d7	Oops, remove these too. llvm-svn: 21272	2005-04-13 02:47:57 +00:00
Chris Lattner	8489ac991d	remove one more occurance of this that snuck in llvm-svn: 21271	2005-04-13 02:46:17 +00:00
Chris Lattner	5fdb103328	Remove support for ZERO_EXTEND_INREG. This pessimizes code, genering stuff like this: ldah $1,1($31) lda $1,-1($1) and $0,$1,$24 instead of this: zap $0,252,$24 To get this back, the selector should recognize the ISD::AND case where this happens and emit the appropriate ZAP instruction. llvm-svn: 21270	2005-04-13 02:43:40 +00:00
Chris Lattner	a2e92e69da	Remove special handling of ZERO_EXTEND_INREG. This pessimizes code, causing things like this: mov r9 = 65535;; and r8 = r8, r9;; To be emitted instead of: zxt2 r8 = r8;; To get this back, the selector for ISD::AND should recognize this case. llvm-svn: 21269	2005-04-13 02:41:52 +00:00
Chris Lattner	26c7c9150a	Elimate handling of ZERO_EXTEND_INREG. This causes the PPC backend to emit andi instructions instead of rlwinm instructions for zero extend, but they seem like they would take the same time. llvm-svn: 21268	2005-04-13 02:40:26 +00:00
Chris Lattner	f25fefd9cf	Z_E_I is gone llvm-svn: 21267	2005-04-13 02:39:05 +00:00
Chris Lattner	4f188f949c	Instead of making ZERO_EXTEND_INREG nodes, use the helper method in SelectionDAG to do the job with AND. Don't legalize Z_E_I anymore as it is gone llvm-svn: 21266	2005-04-13 02:38:47 +00:00
Chris Lattner	bce0030a88	Remove all foldings of ZERO_EXTEND_INREG, moving them to work for AND nodes instead. OVerall, this increases the amount of folding we can do. llvm-svn: 21265	2005-04-13 02:38:18 +00:00
Nate Begeman	38d8248a9e	Fold shift x, [sz]ext(y) -> shift x, y llvm-svn: 21262	2005-04-12 23:32:28 +00:00
Nate Begeman	a56527ea5f	Fold shift by size larger than type size to undef Make llvm undef values generate ISD::UNDEF nodes llvm-svn: 21261	2005-04-12 23:12:17 +00:00
Nate Begeman	79c8b8fd1c	Implement setcc op, -1 sequences Remove dead setcc op, 0 sequences Coming later: generalization of op, imm llvm-svn: 21260	2005-04-12 21:22:28 +00:00
Chris Lattner	58f72ab722	promote extload i1 -> extload i8 llvm-svn: 21258	2005-04-12 20:30:10 +00:00
Chris Lattner	7c88662870	add an argument to allow avoiding deleting phi nodes. llvm-svn: 21255	2005-04-12 18:52:14 +00:00
Chris Lattner	ee06161a63	Get rid of this for_each loop llvm-svn: 21253	2005-04-12 18:51:33 +00:00
Duraid Madina	39fcec1541	* OK, after changing to use liveIn/liveOut instead of IDEFs, to avoid redundant mov out3=r44 type instructions, we need to tell the register allocator the truth about out? registers. FIXME: unfortunately, since the list of allocatable registers is immutable, we can't simply 'delete r127' from the allocation order, say, if 'out0' is used. The only correct thing we can do is have a linear order of regs: out7, out6 ... out2, out1, out0, r32, r33, r34 ... r126, r127 and slide a 'window' of 96 registers along this line, depending on how many of the out? regs a function actually uses. The only downside of this is that the out? registers will be allocated _first_, which makes the resulting assembly ugly. :( Note this in the README. Hope this gets fixed soon. :) (note the 3rd person speech there) llvm-svn: 21252	2005-04-12 18:42:59 +00:00
Andrew Lenharth	174d44f223	Get rid of idefs for arguments (oops) llvm-svn: 21251	2005-04-12 17:47:57 +00:00
Andrew Lenharth	1b8a8331c9	Get rid of idefs for arguments llvm-svn: 21250	2005-04-12 17:35:16 +00:00
Chris Lattner	be2dceff48	Put out* into the allocation order, allowing the register allocator to coallesce moves into outgoing args. llvm-svn: 21249	2005-04-12 15:12:51 +00:00
Chris Lattner	37712352c0	Make sure to realize that calls use their argument regs llvm-svn: 21248	2005-04-12 15:12:19 +00:00
Duraid Madina	2821f99f19	stop emitting IDEFs for args - change to using liveIn/liveOut llvm-svn: 21247	2005-04-12 14:54:44 +00:00
Nate Begeman	f96b42f1b6	Initial support for allocation condition registers llvm-svn: 21246	2005-04-12 07:04:16 +00:00
Chris Lattner	f8d9224d8c	Fix a crash analyzing MultiSource/Benchmarks/MallocBench/gs llvm-svn: 21245	2005-04-12 03:59:27 +00:00
Chris Lattner	cfc7093ca6	Remove some redundant checks, add a couple of new ones. This allows us to compile this: int foo (unsigned long a, unsigned long long g) { return a >= g; } To: foo: movl 8(%esp), %eax cmpl %eax, 4(%esp) setae %al cmpl $0, 12(%esp) sete %cl andb %al, %cl movzbl %cl, %eax ret instead of: foo: movl 8(%esp), %eax cmpl %eax, 4(%esp) setae %al movzbw %al, %cx movl 12(%esp), %edx cmpl $0, %edx sete %al movzbw %al, %ax cmpl $0, %edx cmove %cx, %ax movzbl %al, %eax ret llvm-svn: 21244	2005-04-12 02:54:39 +00:00
Chris Lattner	61f353dbdc	Emit comparisons against the sign bit better. Codegen this: bool %test1(long %X) { %A = setlt long %X, 0 ret bool %A } like this: test1: cmpl $0, 8(%esp) setl %al movzbl %al, %eax ret instead of: test1: movl 8(%esp), %ecx cmpl $0, %ecx setl %al movzbw %al, %ax cmpl $0, 4(%esp) setb %dl movzbw %dl, %dx cmpl $0, %ecx cmove %dx, %ax movzbl %al, %eax ret llvm-svn: 21243	2005-04-12 02:19:10 +00:00
Chris Lattner	6cbbb55967	Emit long comparison against -1 better. Instead of this (x86): test2: movl 8(%esp), %eax notl %eax movl 4(%esp), %ecx notl %ecx orl %eax, %ecx cmpl $0, %ecx sete %al movzbl %al, %eax ret or this (PPC): _test2: nor r2, r4, r4 nor r3, r3, r3 or r2, r2, r3 cntlzw r2, r2 srwi r3, r2, 5 blr Emit this: test2: movl 8(%esp), %eax andl 4(%esp), %eax cmpl $-1, %eax sete %al movzbl %al, %eax ret or this: _test2: .LBB_test2_0: ; and r2, r4, r3 cmpwi cr0, r2, -1 li r3, 1 li r2, 0 beq .LBB_test2_2 ; .LBB_test2_1: ; or r3, r2, r2 .LBB_test2_2: ; blr it seems like the PPC isel could do better for R32 == -1 case. llvm-svn: 21242	2005-04-12 01:46:05 +00:00
Chris Lattner	37534d43d0	canonicalize x <u 1 -> x == 0. On this testcase: unsigned long long g; unsigned long foo (unsigned long a) { return (a >= g) ? 1 : 0; } It changes the ppc code from: _foo: .LBB_foo_0: ; entry mflr r11 stw r11, 8(r1) bl "L00000$pb" "L00000$pb": mflr r2 addis r2, r2, ha16(L_g$non_lazy_ptr-"L00000$pb") lwz r2, lo16(L_g$non_lazy_ptr-"L00000$pb")(r2) lwz r4, 0(r2) lwz r2, 4(r2) cmplw cr0, r3, r2 li r2, 1 li r3, 0 bge .LBB_foo_2 ; entry .LBB_foo_1: ; entry or r2, r3, r3 .LBB_foo_2: ; entry cmplwi cr0, r4, 1 li r3, 1 li r5, 0 blt .LBB_foo_4 ; entry .LBB_foo_3: ; entry or r3, r5, r5 .LBB_foo_4: ; entry cmpwi cr0, r4, 0 beq .LBB_foo_6 ; entry .LBB_foo_5: ; entry or r2, r3, r3 .LBB_foo_6: ; entry rlwinm r3, r2, 0, 31, 31 lwz r11, 8(r1) mtlr r11 blr to: _foo: .LBB_foo_0: ; entry mflr r11 stw r11, 8(r1) bl "L00000$pb" "L00000$pb": mflr r2 addis r2, r2, ha16(L_g$non_lazy_ptr-"L00000$pb") lwz r2, lo16(L_g$non_lazy_ptr-"L00000$pb")(r2) lwz r4, 0(r2) lwz r2, 4(r2) cmplw cr0, r3, r2 li r2, 1 li r3, 0 bge .LBB_foo_2 ; entry .LBB_foo_1: ; entry or r2, r3, r3 .LBB_foo_2: ; entry cntlzw r3, r4 srwi r3, r3, 5 cmpwi cr0, r4, 0 beq .LBB_foo_4 ; entry .LBB_foo_3: ; entry or r2, r3, r3 .LBB_foo_4: ; entry rlwinm r3, r2, 0, 31, 31 lwz r11, 8(r1) mtlr r11 blr llvm-svn: 21241	2005-04-12 00:28:49 +00:00
Nate Begeman	a154deaaff	Implement bitfield clears Implement divide by negative power of two llvm-svn: 21240	2005-04-12 00:10:02 +00:00
Nate Begeman	f31b58f145	Update PPC readme. Remove things that are done or aren't ppc specific llvm-svn: 21232	2005-04-11 20:48:57 +00:00
Chris Lattner	7f0f0854fa	Teach the dag mechanism that this: long long test2(unsigned A, unsigned B) { return ((unsigned long long)A << 32) + B; } is equivalent to this: long long test1(unsigned A, unsigned B) { return ((unsigned long long)A << 32) \| B; } Now they are both codegen'd to this on ppc: _test2: blr or this on x86: test2: movl 4(%esp), %edx movl 8(%esp), %eax ret llvm-svn: 21231	2005-04-11 20:29:59 +00:00
Chris Lattner	71f3d4ce57	Fix expansion of shifts by exactly NVT bits on arch's (like X86) that have masking shifts. This fixes the miscompilation of this: long long test1(unsigned A, unsigned B) { return ((unsigned long long)A << 32) \| B; } into this: test1: movl 4(%esp), %edx movl %edx, %eax orl 8(%esp), %eax ret allowing us to generate this instead: test1: movl 4(%esp), %edx movl 8(%esp), %eax ret llvm-svn: 21230	2005-04-11 20:08:52 +00:00
Chris Lattner	55e620f08d	IA64 supports this operation. llvm-svn: 21228	2005-04-11 18:55:36 +00:00
Chris Lattner	ee715b2abc	ORo sets CR0 llvm-svn: 21227	2005-04-11 15:03:48 +00:00
Chris Lattner	7d11f40ee2	Revert the previous patch, which I didn't mean to check in. llvm-svn: 21226	2005-04-11 15:03:41 +00:00
Chris Lattner	d925c74452	Fix a minor bug (ORo didn't mark that it set CR0). Refactor how . instructions are handled. In particular, instead of passing the RC flag all the way up the inheritance hierarchy, just make a new tblgen class 'DOT' which can be added to an instruction definition. For example, instead of this: -def AND : XForm_6<31, 28, 0, 0, 0, (ops GPRC:$rA, GPRC:$rS, GPRC:$rB), -let Defs = [CR0] in -def ANDo : XForm_6<31, 28, 1, 0, 0, (ops GPRC:$rA, GPRC:$rS, GPRC:$rB), - "and. $rA, $rS, $rB">; We now have this: +def AND : XForm_6<31, 28, 0, 0, (ops GPRC:$rA, GPRC:$rS, GPRC:$rB), "and $rA, $rS, $rB">; llvm-svn: 21225	2005-04-11 15:01:39 +00:00
Duraid Madina	01aaf77792	hmm, should probably change addImm() to take 64-bit arguments one day anyway. llvm-svn: 21224	2005-04-11 07:16:39 +00:00
Nate Begeman	783fe2108e	Add recording variants of ISD::AND and ISD::OR. This kills almost 1000 (1.5%) instructions in 186.crafty llvm-svn: 21222	2005-04-11 06:34:10 +00:00
Duraid Madina	d2ae9221c7	assorted fixes: * clean up immediates (we use 14, 22 and 64 bit immediates now. sane.) * fold r0/f0/f1 registers into comparisons against 0/0.0/1.0 * fix nasty thinko - didn't use two-address form of conditional add for extending bools to integers, so occasionally there would be garbage in the result. it's amazing how often zeros are just sitting around in registers ;) - this should fix a bunch of tests. llvm-svn: 21221	2005-04-11 05:55:56 +00:00
Jeff Cohen	1b89da675f	Eliminate tabs llvm-svn: 21216	2005-04-11 03:44:22 +00:00
Nate Begeman	32163963cb	Fix libcall code to not pass a NULL Chain to LowerCallTo Fix libcall code to not crash or assert looking for an ADJCALLSTACKUP node when it is known that there is no ADJCALLSTACKDOWN to match. Expand i64 multiply when ISD::MULHU is legal for the target. llvm-svn: 21214	2005-04-11 03:01:51 +00:00
Chris Lattner	4f26677dc9	Don't bother sign/zext_inreg'ing the result of an and operation if we know the result does change as a result of the extend. This improves codegen for Alpha on this testcase: int %a(ushort* %i) { %tmp.1 = load ushort* %i %tmp.2 = cast ushort %tmp.1 to int %tmp.4 = and int %tmp.2, 1 ret int %tmp.4 } Generating: a: ldgp $29, 0($27) ldwu $0,0($16) and $0,1,$0 ret $31,($26),1 instead of: a: ldgp $29, 0($27) ldwu $0,0($16) and $0,1,$0 addl $0,0,$0 ret $31,($26),1 btw, alpha really should switch to livein/outs for args :) llvm-svn: 21213	2005-04-10 23:37:16 +00:00
Chris Lattner	c730ea00e2	Teach legalize to deal with targets that don't support some SEXTLOAD/ZEXTLOADs llvm-svn: 21212	2005-04-10 22:54:25 +00:00
Chris Lattner	1b9e1e26cb	don't zextload fp values! llvm-svn: 21209	2005-04-10 17:40:35 +00:00
Nate Begeman	34aa7ec9cb	Fix another fixme: factor out the constant fp generation code. llvm-svn: 21207	2005-04-10 06:06:10 +00:00
Nate Begeman	b6c9b326e3	Fix 64 bit argument loading that straddles the args in regs / args on stack boundary. llvm-svn: 21206	2005-04-10 05:53:14 +00:00
Chris Lattner	0c089eae41	Until we have a dag combiner, promote using zextload's instead of extloads. This gives the optimizer a bit of information about the top-part of the value. llvm-svn: 21205	2005-04-10 04:33:47 +00:00
Chris Lattner	9d13d0b958	Fold zext_inreg(zextload), likewise for sext's llvm-svn: 21204	2005-04-10 04:33:08 +00:00
Chris Lattner	9c8fe594e5	add a simple xform llvm-svn: 21203	2005-04-10 04:04:49 +00:00
Nate Begeman	0a43e95718	Remove unnecessary Implicit Defs. Since r0 is not in allocation, we do not have to inform the register allocator it might be stepped on. llvm-svn: 21202	2005-04-10 03:59:42 +00:00
Nate Begeman	f5cedbc812	Make sure that BRCOND branches can be converted into long branches too. llvm-svn: 21198	2005-04-10 01:48:29 +00:00
Nate Begeman	ab8e705a52	Don't hand ISD::CALL nodes off to SelectExprFP. This fixes siod. llvm-svn: 21197	2005-04-10 01:14:13 +00:00
Chris Lattner	b3518a838c	Fix a thinko. If the operand is promoted, pass the promoted value into the new zero extend, not the original operand. This fixes cast bool -> long on ppc. Add an unrelated fixme llvm-svn: 21196	2005-04-10 01:13:15 +00:00
Chris Lattner	c1bacbff9d	rename getPPCOpcodeForSetCCNumber -> getPPCOpcodeForSetCCOpode to be more correct. Remove the EmitComparison retvalue, as it is always the first arg. Fix a place where we incorrectly passed in the setcc opcode instead of the setcc number, causing us to miscompile crafty. Crafty now works! llvm-svn: 21195	2005-04-10 01:03:31 +00:00
Nate Begeman	a2374d39df	fix ISD::BRCONDTWOWAY codegen to not deference the end() iterator llvm-svn: 21193	2005-04-09 23:35:05 +00:00
Chris Lattner	17c60891c1	Fix CodeGen/Generic/2005-05-09-GlobalInPHI.ll, which was reduced from 254.gap. This caused the "use before a def" assertion on some programs. With this patch, 254.gap now passes with the PPC backend. llvm-svn: 21191	2005-04-09 22:05:17 +00:00
Chris Lattner	034716de24	add a little peephole optimization. This allows us to codegen: int a(short i) { return i & 1; } as _a: andi. r3, r3, 1 blr instead of: _a: rlwinm r2, r3, 0, 16, 31 andi. r3, r2, 1 blr on ppc. It should also help the other risc targets. llvm-svn: 21189	2005-04-09 21:43:54 +00:00
Chris Lattner	b630949c2e	do not set the root to null if an argument is dead llvm-svn: 21188	2005-04-09 21:23:24 +00:00
Nate Begeman	dda6155d19	Add rlwnm instruction for variable rotate Generate rotate left/right immediate Generate code for brcondtwoway Use new livein/liveout functionality llvm-svn: 21187	2005-04-09 20:09:12 +00:00
Chris Lattner	72b1964108	Fix a crash on 173.applu by asking for a constant bigger than 32-bits. llvm-svn: 21185	2005-04-09 19:47:21 +00:00
Chris Lattner	c97f9f403f	Switch this instruction selector over to using liveins and liveouts, eliminating implicit defs on entry to the function. yaay :) llvm-svn: 21184	2005-04-09 16:32:30 +00:00
Chris Lattner	77ab286605	there is no need to remove this instruction, linscan does it already as it removes noop moves. llvm-svn: 21183	2005-04-09 16:24:20 +00:00
Chris Lattner	f408e9a07b	Adjust live intervals to support a livein set llvm-svn: 21182	2005-04-09 16:17:50 +00:00
Chris Lattner	fd4d6e0847	Use live out sets for return values instead of imp_defs, which is cleaner and faster. llvm-svn: 21181	2005-04-09 15:23:56 +00:00
Chris Lattner	1a9c8fc64a	Consider the livein/out set for a function, allowing targets to not have to use ugly imp_def/imp_uses for arguments and return values. llvm-svn: 21180	2005-04-09 15:23:25 +00:00
Duraid Madina	2d3e52576d	ok, the "ia64 has a boatload of registers" joke stopped being funny today ;) * fix overallocation of integer (stacked) registers: we can't allocate registers for local use if they are required as output registers this fixes 'toast' in the test suite, and all sorts of larger programs like bzip2 etc. llvm-svn: 21178	2005-04-09 11:53:00 +00:00
Nate Begeman	98bcb13bfa	Optimize FSEL a bit for fneg arguments. This fixes the recently added test case so that we emit _test_fneg_sel: .LBB_test_fneg_sel_0: ; fsel f1, f1, f3, f2 blr instead of: _test_fneg_sel: .LBB_test_fneg_sel_0: ; fneg f0, f1 fneg f0, f0 fsel f1, f0, f3, f2 blr llvm-svn: 21177	2005-04-09 09:33:07 +00:00
Chris Lattner	3fde68ea7a	Fix CodeGen/SparcV9/2005-05-09-GEP-Crash.ll a crash on some specfp program lets hope this doesn't break other programs with induced entropy llvm-svn: 21174	2005-04-09 06:27:14 +00:00
Chris Lattner	afa0001d54	recognize some patterns as fabs operations, so that fabs at the source level is deconstructed then reconstructed here. This catches 19 fabs's in 177.mesa 9 in 168.wupwise, 5 in 171.swim, 3 in 172.mgrid, and 14 in 173.applu out of specfp2000. This allows the X86 code generator to make MUCH better code than before for each of these and saves one instr on ppc. This depends on the previous CFE patch to expose these correctly. llvm-svn: 21171	2005-04-09 05:15:53 +00:00
Chris Lattner	8e6eafa8e1	Emit BRCONDTWOWAY when possible. llvm-svn: 21167	2005-04-09 03:30:29 +00:00
Chris Lattner	55b73bda6c	Legalize BRCONDTWOWAY into a BRCOND/BR pair if a target doesn't support it. llvm-svn: 21166	2005-04-09 03:30:19 +00:00
Chris Lattner	da902bdf1b	print and fold BRCONDTWOWAY correctly llvm-svn: 21165	2005-04-09 03:27:28 +00:00
Chris Lattner	39f963f968	This target does not support/want ISD::BRCONDTWOWAY llvm-svn: 21164	2005-04-09 03:22:37 +00:00
Chris Lattner	c80baf5567	This target does not yet support ISD::BRCONDTWOWAY llvm-svn: 21163	2005-04-09 03:22:30 +00:00
Nate Begeman	99fb6814bd	64b: Expand S/UREM 32b: No longer pattern match fneg(fsub(fmul)) as fnmsub Pattern match fsub a, mul(b, c) as fnmsub Pattern match fadd a, mul(b, c) as fmadd Those changes speed up hydro2d by 2.5%, distray by 6%, and scimark by 8% llvm-svn: 21161	2005-04-09 03:05:51 +00:00
Chris Lattner	31170cd2ec	canonicalize a bunch of operations involving fneg llvm-svn: 21160	2005-04-09 03:02:46 +00:00
Nate Begeman	95e1b860a1	Fix 64b shifts llvm-svn: 21159	2005-04-08 23:45:01 +00:00
Nate Begeman	3fca499b8d	Match Mac OS X 64 bit calling conventions llvm-svn: 21157	2005-04-08 21:26:05 +00:00
Andrew Lenharth	6eff2083b5	collect a few statistics, factor constants (constant loading and mult), fix logic operation pattern matchs, supress FP div when int dividing by a constant llvm-svn: 21156	2005-04-08 17:28:49 +00:00
Duraid Madina	e7412561bf	fix bogus division-by-power-of-2 (was wrong for negative input, adds extr insn) fix hack in division (clean up frcpa instruction) llvm-svn: 21153	2005-04-08 10:01:48 +00:00
Chris Lattner	f82999fabe	Fix bug: InstCombine/2005-05-07-UDivSelectCrash.ll llvm-svn: 21152	2005-04-08 04:03:26 +00:00
Nate Begeman	6875356db1	Optimized code sequences for setcc reg, 0 Optimized code sequence for (a < 0) ? b : 0 llvm-svn: 21150	2005-04-07 20:30:01 +00:00
Andrew Lenharth	b1b7ef0979	Alpha zero extends setcc results llvm-svn: 21149	2005-04-07 20:11:32 +00:00
Chris Lattner	9a56ef5693	If a target zero or sign extends the result of its setcc, allow folding of this into sign/zero extension instructions later. On PPC, for example, this testcase: %G = external global sbyte implementation void %test(int %X, int %Y) { %C = setlt int %X, %Y %D = cast bool %C to sbyte store sbyte %D, sbyte* %G ret void } Now codegens to: cmpw cr0, r3, r4 li r3, 1 li r4, 0 blt .LBB_test_2 ; .LBB_test_1: ; or r3, r4, r4 .LBB_test_2: ; addis r2, r2, ha16(L_G$non_lazy_ptr-"L00000$pb") lwz r2, lo16(L_G$non_lazy_ptr-"L00000$pb")(r2) stb r3, 0(r2) instead of: cmpw cr0, r3, r4 li r3, 1 li r4, 0 blt .LBB_test_2 ; .LBB_test_1: ; or r3, r4, r4 .LBB_test_2: ; *** rlwinm r3, r3, 0, 31, 31 addis r2, r2, ha16(L_G$non_lazy_ptr-"L00000$pb") lwz r2, lo16(L_G$non_lazy_ptr-"L00000$pb")(r2) stb r3, 0(r2) llvm-svn: 21148	2005-04-07 19:43:53 +00:00
Chris Lattner	352dd3e579	PowerPC zero extends setcc results llvm-svn: 21147	2005-04-07 19:41:49 +00:00
Chris Lattner	583dcc66f2	X86 zero extends setcc results llvm-svn: 21146	2005-04-07 19:41:46 +00:00
Chris Lattner	bbe0e9e9db	Remove somethign I had for testing llvm-svn: 21144	2005-04-07 18:58:54 +00:00
Andrew Lenharth	c3e5c42b86	fix a small optimization opertunity and make gcc happy llvm-svn: 21143	2005-04-07 18:15:28 +00:00
Chris Lattner	ee836c7b32	This patch does two things. First, it canonicalizes 'X >= C' -> 'X > C-1' (likewise for <= >=u >=u). Second, it implements a special case hack to turn 'X gtu SINTMAX' -> 'X lt 0' On powerpc, for example, this changes this: lis r2, 32767 ori r2, r2, 65535 cmplw cr0, r3, r2 bgt .LBB_test_2 into: cmpwi cr0, r3, 0 blt .LBB_test_2 llvm-svn: 21142	2005-04-07 18:14:58 +00:00
Andrew Lenharth	469244a2b4	fixup magic constant making code. tested by thousands of random divisions.... by 10000. ok, so random divisors would be good too, but this at least fixes some things llvm-svn: 21140	2005-04-07 17:19:16 +00:00
Andrew Lenharth	61215a78fb	lowercase instructions, makes diff happier llvm-svn: 21139	2005-04-07 17:17:48 +00:00
Chris Lattner	05d79f36b1	Implement the following xforms: (X-Y)-X --> -Y A + (B - A) --> B (B - A) + A --> B llvm-svn: 21138	2005-04-07 17:14:51 +00:00
Chris Lattner	5b31ada26d	Implement InstCombine/add.ll:test28, transforming C1-(X+C2) --> (C1-C2)-X. This occurs several dozen times in specint2k, particularly in crafty and gcc apparently. llvm-svn: 21136	2005-04-07 16:28:01 +00:00
Chris Lattner	ea1752ddf5	Transform X-(X+Y) == -Y and X-(Y+X) == -Y llvm-svn: 21134	2005-04-07 16:15:25 +00:00
Andrew Lenharth	3d1228500d	It wasn't happy about this either llvm-svn: 21133	2005-04-07 14:18:13 +00:00
Andrew Lenharth	ce0dcea720	Yea, it wasn't happy llvm-svn: 21132	2005-04-07 13:55:53 +00:00
Duraid Madina	ab6e2cfaeb	teach asmprinter to print s8/s14 operands llvm-svn: 21131	2005-04-07 12:34:36 +00:00
Duraid Madina	ed8eb83203	codegen immediate forms of add/sub/shift llvm-svn: 21130	2005-04-07 12:33:38 +00:00
Duraid Madina	5c4a7b68b3	add immediate forms of add, sub, shift llvm-svn: 21129	2005-04-07 12:32:24 +00:00
Chris Lattner	22bbc2351e	Fix a really scary bug that Nate found where we weren't deleting the right elements auto of the autoCSE maps. llvm-svn: 21128	2005-04-07 00:30:13 +00:00
Nate Begeman	b890f32ac9	Pattern match bitfield insert, which helps shift long by immediate, among other things. llvm-svn: 21127	2005-04-06 23:51:40 +00:00
Nate Begeman	6c5e4c3bb1	Fix some shift bugs llvm-svn: 21126	2005-04-06 22:42:08 +00:00
Alkis Evlogimenos	242fe17bc4	Make these 64 bit constants so that this compiles on x86-32 as well. llvm-svn: 21125	2005-04-06 22:09:40 +00:00
Andrew Lenharth	abf46a4f5e	added sdiv by 2^k and works for neg divisors also llvm-svn: 21124	2005-04-06 22:03:13 +00:00
Chris Lattner	49d166c6b6	Don't make this require loopsimplify. It works BETTER with loop simplify but should not require it. llvm-svn: 21123	2005-04-06 21:45:00 +00:00
Nate Begeman	7898fc8cc8	Teach ExpandShift how to handle shifts by a constant. This allows targets like PowerPC to codegen long shifts in many fewer instructions. llvm-svn: 21122	2005-04-06 21:13:14 +00:00
Andrew Lenharth	5c71402202	fix copy/paste errors, and add imm support to SxADDQ and SxSUBQ llvm-svn: 21121	2005-04-06 20:59:59 +00:00
Chris Lattner	40ee8a062b	Fix SingleSource/Regression/C/2005-05-06-LongLongSignedShift.c, we were not properly sign extending the top of the result of a 64-bit shift right by a constant > 32. llvm-svn: 21120	2005-04-06 20:59:35 +00:00
Andrew Lenharth	9f65102f9b	Added Nate's div by constant stuff, also scaled operations! llvm-svn: 21116	2005-04-06 20:25:34 +00:00
Chris Lattner	7c0786dda8	Fix a namespace issue, reported by Vladimir Merzliakov! llvm-svn: 21115	2005-04-06 19:45:39 +00:00
Duraid Madina	5fa854a7fe	steal sampo's div-by-constant-power-of-2 stuff thanks sampo!! llvm-svn: 21113	2005-04-06 09:55:17 +00:00
Duraid Madina	1d156293cb	add fms instruction llvm-svn: 21112	2005-04-06 09:54:09 +00:00
Nate Begeman	98251d6a1c	Fixed version of optimized integer divide is now fixed. Calculate the quotient, not the remainder. Also, make sure to remove the old div operand from the ExprMap and let SelectExpr insert the new one. llvm-svn: 21111	2005-04-06 06:44:57 +00:00
Duraid Madina	2db29b8016	lie a bit and say that r1/r12 (GP/SP) _aren't_ callee-save, as we take care of this ourselves llvm-svn: 21110	2005-04-06 06:18:36 +00:00
Duraid Madina	62c4de8d62	make sure 'special' registers don't get allocated llvm-svn: 21109	2005-04-06 06:17:54 +00:00
Chris Lattner	c87ff88efb	Add (untested) support for MULHS and MULHU. llvm-svn: 21107	2005-04-06 04:21:07 +00:00
Chris Lattner	ba7cdbebb1	add signed versions of the extra precision multiplies llvm-svn: 21106	2005-04-06 04:19:22 +00:00
Nate Begeman	aee0f81849	Turn off the div -> mul optimization until it works correctly 100% of the time. llvm-svn: 21105	2005-04-06 03:36:33 +00:00
Nate Begeman	b44597771c	Add support for MULHS and MULHU nodes Have LegalizeDAG handle SREM and UREM for us Codegen SDIV and UDIV by constant as a multiply by magic constant instead of integer divide, which is very slow. llvm-svn: 21104	2005-04-06 00:25:27 +00:00
Nate Begeman	4457b4994c	Expand SREM and UREM for targets that claim not to have them, like PowerPC llvm-svn: 21103	2005-04-06 00:23:54 +00:00
Nate Begeman	12af81407b	Add MULHU and MULHS nodes for the high part of an (un)signed 32x32=64b multiply. llvm-svn: 21102	2005-04-05 22:36:56 +00:00
Andrew Lenharth	613a940af8	added lowerargs support for varargs llvm-svn: 21101	2005-04-05 20:51:46 +00:00
Nate Begeman	82ff41c342	Behold, rlwinm with certain immediate arguments is printed as the much more readable slwi or srwi (shift left/right word immediate). llvm-svn: 21099	2005-04-05 18:19:50 +00:00
Nate Begeman	581553fd21	Fix cut & paste errors (32->64), and codegen float->int more optimally. llvm-svn: 21098	2005-04-05 17:32:30 +00:00
Tanya Lattner	4d8f553a82	Updated to use dep analyzer. llvm-svn: 21097	2005-04-05 16:36:44 +00:00
Nate Begeman	152dbbe856	Remove 64 bit simple ISel, it never worked correctly Add initial (buggy) implementation of 64 bit pattern ISel llvm-svn: 21096	2005-04-05 08:51:15 +00:00
Nate Begeman	a18a26f47c	Back out the previous change to SelectBranchCC, since there are cases it could miscompile. A correct solution will be found in the near future. llvm-svn: 21095	2005-04-05 04:32:16 +00:00
Nate Begeman	358dee806e	Rename canUseAsImmediateForOpcode to getImmediateForOpcode to better indicate that it is not a boolean function. Properly emit the pseudo instruction for conditional branch, so that we can fix up conditional branches whose displacements are too large. Reserve the right amount of opcode space for said pseudo instructions. llvm-svn: 21094	2005-04-05 04:22:58 +00:00
Chris Lattner	c5b8fbe7f9	do not crash when using -debug llvm-svn: 21092	2005-04-05 01:12:03 +00:00
Nate Begeman	ede4abc899	Implement SDIV by power of 2 as srawi/addze rather than load imm, divw llvm-svn: 21091	2005-04-05 00:15:08 +00:00
Nate Begeman	00002553ba	Pattern match fp mul-add, mul-sub, neg-mul-add, and neg-mul-sub llvm-svn: 21090	2005-04-04 23:40:36 +00:00
Nate Begeman	682fd51f9c	Add support for multiply-add, multiply-sub, and their negated versions llvm-svn: 21089	2005-04-04 23:01:51 +00:00
Chris Lattner	57ea4daa2e	do not dereference an extra layer of pointers to determine if an external call can modify a memory location. This fixes test/Regression/Analysis/Andersens/modreftest.ll llvm-svn: 21088	2005-04-04 22:23:21 +00:00
Nate Begeman	d9af5c4fc5	Make sure that arg regs used by the call instruction are marked as such, so that regalloc doesn't cleverly reuse early arg regs loading later arg regs. This fixes almost all outstanding failures in the pattern isel. llvm-svn: 21086	2005-04-04 22:17:48 +00:00
Nate Begeman	ce13bceb2a	Remove unnecessary register copy now that regalloc is fixed llvm-svn: 21085	2005-04-04 21:48:13 +00:00
Chris Lattner	f81edb57b6	Make sure to notice that explicit physregs are used in the function llvm-svn: 21084	2005-04-04 21:35:34 +00:00
Nate Begeman	bde3612ce3	i1 loads should also be from the low byte of the argument word. llvm-svn: 21077	2005-04-04 09:09:00 +00:00
Nate Begeman	77427b1e77	Fix i64 return, fix CopyFromReg llvm-svn: 21076	2005-04-04 06:52:38 +00:00
Duraid Madina	920aea2fa7	fix SREM/UREM, which gave incorrect results for x%y if x was zero. This is an ugly hack, but it seems to work. I should fix this properly and add a test as well. fixes multisource/obsequi (maybe others) llvm-svn: 21075	2005-04-04 05:05:52 +00:00
Duraid Madina	d896a18d33	add implicit use op llvm-svn: 21074	2005-04-04 04:50:57 +00:00
Nate Begeman	a8be5b976f	Handle expanding arguments to ISD::TRUNCATE. This happens on PowerPC when you have something like i16 = truncate i64. This fixes Regression/C/casts llvm-svn: 21073	2005-04-04 00:57:08 +00:00
Chris Lattner	a8bccb73cd	Fix sign_extend and zero_extend of promoted value types to expanded value types. This occurs when casting short to long on PPC for example. llvm-svn: 21072	2005-04-03 23:41:52 +00:00
Nate Begeman	b2e5a962ff	Full varargs support. All of UnitTests now passes llvm-svn: 21070	2005-04-03 23:11:17 +00:00
Nate Begeman	1a5aaf6009	Pass the correct value for the chain to the store llvm-svn: 21066	2005-04-03 22:22:56 +00:00
Nate Begeman	82d17d0e70	Fix SHL_PARTS Start implementation of integer varargs llvm-svn: 21065	2005-04-03 22:13:27 +00:00
Andrew Lenharth	320fff1cbe	is this simpler? I think it is simpler. llvm-svn: 21064	2005-04-03 20:35:21 +00:00
Andrew Lenharth	4be5502eb4	fix 101 regressions llvm-svn: 21063	2005-04-03 18:24:50 +00:00
Duraid Madina	bfbfb0e4c7	.bss is no problem here. llvm-svn: 21061	2005-04-03 14:52:01 +00:00
Nate Begeman	127bd62534	Keeping up with the Joneses. Implement not, nor, nand, and eqv llvm-svn: 21060	2005-04-03 11:20:20 +00:00
Andrew Lenharth	c16ede8779	Select optimization llvm-svn: 21051	2005-04-02 22:32:39 +00:00
Andrew Lenharth	bd19c1d25f	Try several things. 1) drop /i from FP ops 2) factor out FP to Int moves and provide 21264 support for those 3) match not 4) match ornot andnot xornot llvm-svn: 21046	2005-04-02 21:06:51 +00:00
Chris Lattner	0938200804	fix some VC compilation problems, thanks to Jeff C for pointing this out! llvm-svn: 21044	2005-04-02 20:17:09 +00:00
Chris Lattner	e6d28e8aac	EquivClassGraphs is now in DataStructure.h llvm-svn: 21042	2005-04-02 20:08:17 +00:00
Chris Lattner	54ab60f08d	use a callee_iterator typedef. llvm-svn: 21038	2005-04-02 20:02:41 +00:00
Chris Lattner	23ef46ddca	Change the ActualCallees callgraph from hash_multimap<Instruction,Function> to std::set<std::pair<Inst,Func>> to avoid duplicate entries. This speeds up the CompleteBU pass from 1.99s to .15s on povray and the eqgraph passes from 1.5s to .16s on the same. llvm-svn: 21031	2005-04-02 19:17:18 +00:00
Andrew Lenharth	08e5b4f996	FNEG/FABS/UNDEF llvm-svn: 21029	2005-04-02 19:11:07 +00:00
Andrew Lenharth	04fd317736	FNEG/FABS llvm-svn: 21028	2005-04-02 19:04:58 +00:00
Duraid Madina	63f75bdf49	ia64 asmprinter fixes: - turn off assembler's autoalignment - set FunctionAddrPrefix/Suffix so that .data8 entries pointing to functions have their value wrapped in @fptr(), so that a function descriptor will be materialized for that function. llvm-svn: 21025	2005-04-02 12:30:47 +00:00
Duraid Madina	3a10f491f0	add support for prefix/suffix strings to go around GlobalValue(s) (which may or be function pointers) in the asmprinter. For the moment, this changes nothing, except the IA64 backend which can use this to write: data8.ua @fptr(blah__blah__mangled_function_name) (by setting FunctionAddrPrefix/Suffix to "@fptr(" / ")") llvm-svn: 21024	2005-04-02 12:21:51 +00:00
Duraid Madina	5367cc3b49	support IDEF, fnegabs (thanks sampo) llvm-svn: 21023	2005-04-02 10:33:53 +00:00
Duraid Madina	81675e4031	add fnegabs op llvm-svn: 21022	2005-04-02 10:06:27 +00:00
Nate Begeman	402c04ff16	Set shift amount to Extend Implement ISD::FABS and ISD::FNEG nodes Implement SHL_PARTS, SRL_PARTS, and SRA_PARTS Generate PowerPC 'fneg', 'fabs', and 'fnabs' instructions llvm-svn: 21018	2005-04-02 05:59:34 +00:00
Chris Lattner	8f30d63c1a	add support for FABS and FNEG llvm-svn: 21015	2005-04-02 05:30:17 +00:00
Chris Lattner	1a15f58a92	transform fabs/fabsf calls into FABS nodes. llvm-svn: 21014	2005-04-02 05:26:53 +00:00
Chris Lattner	206a694a7b	Expand fabs into fneg llvm-svn: 21013	2005-04-02 05:26:37 +00:00
Duraid Madina	333132da85	add support FNEG and FABS llvm-svn: 21012	2005-04-02 05:18:38 +00:00
Chris Lattner	fcf6ee0a8b	Turn -0.0 - X -> fneg llvm-svn: 21011	2005-04-02 05:04:50 +00:00
Chris Lattner	a5d4718875	This target doesn't support fabs/fneg yet. llvm-svn: 21010	2005-04-02 05:03:24 +00:00
Chris Lattner	8644181cd6	Several changes mixed up here. First when legalizing a DAG with pcmarker, dont' regen the whole dag if unneccesary. Second, fix and ugly bug with the _PARTS nodes that caused legalize to produce multiples of them. Finally, implement initial support for FABS and FNEG. Currently FNEG is the only one to be trusted though. llvm-svn: 21009	2005-04-02 05:00:07 +00:00
Chris Lattner	c8f36868e6	print fneg/fabs llvm-svn: 21008	2005-04-02 04:58:41 +00:00
Chris Lattner	71434aa2dd	add an fabs instr llvm-svn: 21006	2005-04-02 04:31:56 +00:00
Chris Lattner	8ee783d9f0	Add support for 64-bit shifts. llvm-svn: 21005	2005-04-02 04:01:14 +00:00
Chris Lattner	8be5696874	fix some bugs in the implementation of SHL_PARTS and friends. llvm-svn: 21004	2005-04-02 04:00:59 +00:00
Chris Lattner	964ab5d408	Turn expanded shift operations into (e.g.) SHL_PARTS if the target supports it. llvm-svn: 21002	2005-04-02 03:38:53 +00:00
Chris Lattner	33ca1ce8e0	Print some new nodes llvm-svn: 21001	2005-04-02 03:30:42 +00:00
Chris Lattner	20027c6b30	Fix a bug when inserting a libcall into a function with no other calls. llvm-svn: 20999	2005-04-02 03:22:40 +00:00
Nate Begeman	8d60ca616f	Fix i64 returns Generate PowerPC 'subfic' instruction when appropriate llvm-svn: 20995	2005-04-02 00:42:16 +00:00
Nate Begeman	893f5729ce	Fix a warning about an unhandled switch case llvm-svn: 20994	2005-04-02 00:41:14 +00:00
Chris Lattner	67da3fdb70	Add support for ISD::UNDEF to the X86 be llvm-svn: 20990	2005-04-01 22:46:45 +00:00
Nate Begeman	4034852ba9	Add ISD::UNDEF node Teach the SelectionDAG code how to expand and promote it Have PPC32 LowerCallTo generate ISD::UNDEF for int arg regs used up by fp arguments, but not shadowing their value. This allows us to do the right thing with both fixed and vararg floating point arguments. llvm-svn: 20988	2005-04-01 22:34:39 +00:00
Chris Lattner	375f5e6ed5	Fix another PATypeHolder error, contributed by Bill Wendling! llvm-svn: 20983	2005-04-01 15:41:30 +00:00
Duraid Madina	48ef32d6d3	repair mindless SELECT waste. llvm-svn: 20982	2005-04-01 10:35:00 +00:00
Nate Begeman	244b36582a	Fix Olden/bh, CR0 was being set in the wrong order LowerCallTo and ISD::CALL are going to need to be modified, regs are being set in the wrong order. llvm-svn: 20981	2005-04-01 08:57:43 +00:00
Nate Begeman	f3ead25b68	Also apply Chris's fix to FP select and SETCC llvm-svn: 20979	2005-04-01 07:21:30 +00:00
Chris Lattner	0cd0036523	Move the selection of the arms of the select operation up to the conditional part to make sure we get the side effects and to avoid confusing the CFG. llvm-svn: 20977	2005-04-01 07:10:02 +00:00
Chris Lattner	c81870e4e6	print the machine CFG in the -print-machineinstrs dump llvm-svn: 20976	2005-04-01 06:48:38 +00:00
Nate Begeman	e82a2d7373	Fix stores to global addresses Fix calls with no arguments llvm-svn: 20975	2005-04-01 05:57:17 +00:00
Nate Begeman	9d224ae29b	Support indexed loads and stores. This drops Shootout/matrix time from 18.8 to 14.8 seconds. The Pattern ISel is now often faster than the Simple ISel, esp. on memory intensive code. llvm-svn: 20973	2005-04-01 04:45:11 +00:00
Nate Begeman	af7c6366d7	Implement FP_TO_SINT and FP_TO_UINT llvm-svn: 20972	2005-04-01 02:59:27 +00:00
Nate Begeman	552f6f5f4e	Add support for adding 0.0 and -0.0 to the constant pool, since we lie and say that we support them, for the purposes of generating fsel instructions. llvm-svn: 20970	2005-04-01 01:08:07 +00:00
Nate Begeman	18b3394f4d	Factor out common code, support FP comparison in folded SetCC llvm-svn: 20969	2005-04-01 00:32:34 +00:00
Nate Begeman	fc89059914	fsel generation for f32 and f64 select generate compare immediate for integer compare with constant fold setcc into branch fold setcc into select Code generation quality for Shootout is now on par with the Simple ISel llvm-svn: 20968	2005-03-31 23:55:40 +00:00
Andrew Lenharth	1ba016ab6f	make fp div trick dependend on flag llvm-svn: 20967	2005-03-31 22:02:25 +00:00
Andrew Lenharth	7db3834ecf	PCMarker support for DAG and Alpha llvm-svn: 20965	2005-03-31 21:24:06 +00:00
Duraid Madina	47fed18416	Assorted fixes: * Stop being pessimistic about output register allocation * Start to handle function descriptors: compute target GPs and so on when doing indirect calls etc. Not there yet, though. For the moment, we try to use _indirect_ branches wherever possible, to stress test function descriptors. * FP divide-by-zero should work now * add varargs (it doesn't work, though) At this point, all of SingleSource passes (modulo C++ tests that are due to issues with the CFE, see note in the README.) Much of MultiSource also passes although there's still a ton of bugs around. Something for me to work on tomorrow, then. :) llvm-svn: 20960	2005-03-31 12:31:11 +00:00
Duraid Madina	f2d1865c74	* declare local common symbols as such (.lcomm, not merely .common) * begin great adventure into correct function descriptor materialization llvm-svn: 20956	2005-03-31 07:40:24 +00:00
Duraid Madina	03efd3bea9	daintyness llvm-svn: 20955	2005-03-31 07:36:43 +00:00
Duraid Madina	11ff0a2a5f	add what we need to fudge a 'floating point conditional move', this is used to get FP div-by-zero working properly (shunt the right answer depending on how frcpa sets its predicate output) llvm-svn: 20954	2005-03-31 07:32:32 +00:00
Nate Begeman	17ff2b3a87	Pass the correct values to the chain argument for node construction during LowerCallTo. Handle ISD::ADD in SelectAddr, allowing us to have nonzero immediates for loads and stores, amazing! llvm-svn: 20946	2005-03-31 02:05:53 +00:00
Nate Begeman	de4aac1374	Rewrite LowerCallTo and Select(ISD::CALL) to properly handle float varargs Tell the SelectionDAG ISel to expand SEXTLOAD of i1 and i8, rather than complicate the code in ISD::SEXTLOAD to do it by hand Combine the FP and Int ISD::LOAD codegen Generate better code for constant pool loads As a result, all of Shootout, and likely many other programs are now working. llvm-svn: 20945	2005-03-31 00:15:26 +00:00
Nate Begeman	9c5480beeb	Fix calls whose arguments fit entirely in registers to not break the Chain. Implement SINT_TO_FP and UINT_TO_FP Remove some dead code from the simple ISel llvm-svn: 20944	2005-03-30 19:38:35 +00:00
Andrew Lenharth	91bd9033c6	yea, fine Duraid llvm-svn: 20942	2005-03-30 18:22:52 +00:00
Nate Begeman	c877844625	Fix frame index code to generate legal PowerPC instructions. About half of Shootout now works. llvm-svn: 20940	2005-03-30 02:23:08 +00:00
Nate Begeman	ec87399dac	Fix external symbol printing in the AsmPrinter. Tell the ISel that we don't support things like memcpy directly. This allows a handful of the Shootout programs to work, yay! llvm-svn: 20939	2005-03-30 01:45:43 +00:00
Chris Lattner	abb59a3c21	Instead of setting up the CFG edges at selectiondag construction time, set them up after the code has been emitted. This allows targets to select one mbb as multiple mbb's as needed. llvm-svn: 20937	2005-03-30 01:10:47 +00:00
Chris Lattner	46c4246df1	don't depend on the cfg being set up yet llvm-svn: 20936	2005-03-30 01:10:00 +00:00
Nate Begeman	8eddad3985	Fix BranchCC (it's still dumb), and implement FP select (also dumb) llvm-svn: 20935	2005-03-29 22:48:55 +00:00
Nate Begeman	43b127ca0a	Implement integer select and i1 sign extend llvm-svn: 20934	2005-03-29 22:24:51 +00:00
Nate Begeman	d5d90ec76b	Implement SetCC, fix ZERO_EXTEND_INREG llvm-svn: 20933	2005-03-29 21:54:38 +00:00
Chris Lattner	761bb09edb	import all of the rest of the stubs that dsa uses for direct comparison llvm-svn: 20932	2005-03-29 20:36:05 +00:00
Tanya Lattner	bc14e623e3	Compare dependence analysis with llvm instructions versus machine instrutions. the problem with using machine instructions and alias analysis is that aa does not handle tmp instructions. llvm-svn: 20931	2005-03-29 20:35:10 +00:00
Tanya Lattner	7edde71619	Dependence analyzer that just determines dependences within a loop for loads and stores using alias analysis. llvm-svn: 20930	2005-03-29 20:33:42 +00:00
Chris Lattner	94ea4d104c	learn about some more functions. llvm-svn: 20929	2005-03-29 20:04:24 +00:00
Andrew Lenharth	21c4590f96	Fix up some types and constants llvm-svn: 20928	2005-03-29 19:24:04 +00:00
Chris Lattner	cc1644eb2c	Fix a problem where we not marking incoming arguments to functions with external linkage as incomplete. llvm-svn: 20927	2005-03-29 19:16:59 +00:00
Chris Lattner	02a4d3bd9b	Fix a bug that andrew noticed where we do not correctly sign/zero extend returned integer values all of the way to 64-bits (we only did it to 32-bits leaving the top bits undefined). This causes problems for targets like alpha whose ABI's define the top bits too. llvm-svn: 20926	2005-03-29 19:09:56 +00:00
Chris Lattner	39064a8ca0	there is no point comparing against null pointer. llvm-svn: 20925	2005-03-29 17:44:52 +00:00
Chris Lattner	5ceaf630ab	Fix a major problem with global variable initializers. This could cause us to have stuff pointing to the null pointer, which makes no sense (the null ptr is an ssa value, not the null object) llvm-svn: 20922	2005-03-29 17:21:53 +00:00
Chris Lattner	3759d20b0f	fix a warning in the optimized build llvm-svn: 20920	2005-03-29 15:13:27 +00:00
Chris Lattner	4f9c2cde55	add some more functions, ignore setcc for constraints! llvm-svn: 20917	2005-03-29 06:52:20 +00:00
Chris Lattner	9b3adb88b8	disable this transformation in the one obscure case that really pessimizes pointer analysis. llvm-svn: 20916	2005-03-29 06:37:47 +00:00
Chris Lattner	813ef90a12	Handle "known" external calls context sensitively, add support for realloc and a couple of other functions that are important. Handle aggregate undef values for gv initializers llvm-svn: 20914	2005-03-29 06:09:07 +00:00
Nate Begeman	62e458272f	Implement div, rem, and frameindex llvm-svn: 20907	2005-03-29 00:03:27 +00:00
Nate Begeman	734a61f057	Pattern ISel: fix argument loading for i64s (thanks chris) Simple ISel: fix i64 subtract llvm-svn: 20903	2005-03-28 23:08:54 +00:00
Nate Begeman	32d1caae6d	Remove fake instruction 'subc' (mnemonic for subfc). More pattern isel updates llvm-svn: 20902	2005-03-28 22:28:37 +00:00
Chris Lattner	185e7e2c22	implement legalization of build_pair for nate llvm-svn: 20901	2005-03-28 22:03:13 +00:00
Andrew Lenharth	c287cd1e4e	First step in adding pcmarker intrinsic. Second step (soon) is adding backend support. llvm-svn: 20900	2005-03-28 20:05:49 +00:00
Nate Begeman	2ab66f55b6	Implement proper loads and zero-extends of all types llvm-svn: 20897	2005-03-28 19:36:43 +00:00
Duraid Madina	7b5f67baf9	Emit .global @function and .global @object entries so the Intel ias assembler may be used; identify LLVM output as such. llvm-svn: 20892	2005-03-28 15:21:43 +00:00
Chris Lattner	47fcba56f8	Teach andersens that non-escaping memory cannot be mod/ref'd by external fn calls. llvm-svn: 20891	2005-03-28 06:21:17 +00:00
Misha Brukman	b97b449309	Fix grammar llvm-svn: 20890	2005-03-28 04:32:12 +00:00
Chris Lattner	abb512a593	Make anders-aa much more precise by not being completely pessimistic about external functions. Teach it about a few important ones. llvm-svn: 20889	2005-03-28 04:03:52 +00:00
Alkis Evlogimenos	e0e628a401	Rename createPromoteMemoryToRegister() to createPromoteMemoryToRegisterPass() to be consistent with other pass creation functions. llvm-svn: 20885	2005-03-28 02:01:12 +00:00
Chris Lattner	691b1987e1	wrap some long lines llvm-svn: 20884	2005-03-27 22:03:46 +00:00
Chris Lattner	6b31704450	remove ... llvm-svn: 20883	2005-03-27 21:57:09 +00:00
Chris Lattner	15741f8877	speed up steens by using spliceFrom, improve its precision by realizing that an incomplete node cannot alias a complete node. llvm-svn: 20882	2005-03-27 21:56:55 +00:00
Chris Lattner	7f0903e187	teach andersens about undef llvm-svn: 20881	2005-03-27 18:58:23 +00:00
Chris Lattner	de6cc372e3	Don't give up completely, maybe other AA can say something about this. llvm-svn: 20873	2005-03-27 00:02:33 +00:00
Chris Lattner	3a88055932	Factor out percentage printing into its own function. Make two changes to the function: print more precision XX.X% instead of XX%, and cast to ULL before scaling by 100/1000 to avoid wrap around for large numbers of queries (such as occur for 253.perlbmk and 176.gcc) llvm-svn: 20872	2005-03-26 23:56:33 +00:00
Chris Lattner	b84076a278	Cache mapping information for a call site after computing it for a mod/ref query. If the next mod/ref query happens to be for the same call site (which is extremely likely), use the cache instead of recomputing the callee/caller mapping. This makes -aa-eval *MUCH* faster with ds-aa llvm-svn: 20871	2005-03-26 23:29:03 +00:00
Chris Lattner	21d25dd835	Remove more long dead code: dsa doesn't provide must alias info llvm-svn: 20870	2005-03-26 22:54:46 +00:00
Chris Lattner	8638fbf4d6	remove some unsafe code that has long been dead llvm-svn: 20869	2005-03-26 22:48:42 +00:00
Chris Lattner	ee96215ded	slightly improve mod/ref for DSAA by checking the globals graph for fallback llvm-svn: 20868	2005-03-26 22:47:03 +00:00
Chris Lattner	02275101be	Teach steens-aa two things about mod/ref information: 1. If memory never escapes the program, it cannot be mod/ref'd by external functions. 2. If memory is global never mod/ref'd in the program, it cannot be mod/ref'd by any call. llvm-svn: 20867	2005-03-26 22:43:20 +00:00
Chris Lattner	bbec058833	Interchange this loop so that we test all pointers against one call site before moving on to the next call site. This will be a more efficient way to compute the mod/ref set for AA implementations like DSA. llvm-svn: 20866	2005-03-26 22:16:44 +00:00
Nate Begeman	6b0fbf811f	Fix that pesky floats in integer regs problem by assigning the f32 type to the correct register class. Also remove the loading of float data into int regs part of varargs; it will need to be implemented differently later. llvm-svn: 20857	2005-03-26 08:25:22 +00:00
Nate Begeman	31d175d1e5	Get closer to having varargs working. There's still something strange going on with copies between floating point and integer register files being generated. Once that is solved, varargs will be done. llvm-svn: 20856	2005-03-26 07:46:36 +00:00
Nate Begeman	69742e6ea1	Make 64bit args and float args work correct with calls. Thanks to Chris for explaining EXTRACT_ELEMENT to me. llvm-svn: 20847	2005-03-26 02:17:46 +00:00
Nate Begeman	f821401825	Change interface to LowerCallTo to take a boolean isVarArg argument. llvm-svn: 20842	2005-03-26 01:29:23 +00:00
Nate Begeman	d3b5925b38	Next round of pattern isel changes, mostly dealing with calls. llvm-svn: 20841	2005-03-26 01:28:53 +00:00
Nate Begeman	4106e81966	Correct a documention link llvm-svn: 20840	2005-03-26 01:28:05 +00:00
Chris Lattner	d11e075664	no really, don't double count these nodes either! llvm-svn: 20837	2005-03-25 20:54:45 +00:00
Chris Lattner	81e77226bb	Don't count all of the nodes in the SCC once for each function in the SCC. llvm-svn: 20836	2005-03-25 20:37:32 +00:00
Chris Lattner	14fd1844ba	Grow the EQ classes for globals at the end of the BU pass. This shrinks memory usage in the TD pass for 254.gap from 31.3MB to 3.9MB. llvm-svn: 20834	2005-03-25 16:45:43 +00:00
Nate Begeman	ba1cd37734	Support global addresses and fix call returns. Varargs still aren't handled correctly for floating point arguments, or more than 8 arguemnts. This does however, allow hello world to run. llvm-svn: 20832	2005-03-25 08:34:25 +00:00
Chris Lattner	8e8b8bb133	Enhance loopsimplify to preserve alias analysis instead of clobbering it. This prevents crashes on some programs when using -ds-aa -licm. llvm-svn: 20831	2005-03-25 06:37:22 +00:00
Chris Lattner	549f99e537	Treat free operations as volatile, since they cannot be moved. This fixes Transforms/LICM/2005-03-24-LICM-Aggregate-Crash.ll llvm-svn: 20830	2005-03-25 05:49:37 +00:00
Chris Lattner	4f4fa287ee	Fix a bug where LICM was not updating AA information properly when sinking a pointer value out of a loop causing it to be duplicated. llvm-svn: 20828	2005-03-25 00:22:36 +00:00
Chris Lattner	52e28abe6e	remove a debugging timer. llvm-svn: 20827	2005-03-25 00:06:09 +00:00
Chris Lattner	5d60f10a1d	Two changes here: 1. Instead of copying Local graphs to the BU graphs to start with, use spliceFrom to do the job (which is constant time in this case). On 176.gcc, this chops off .17s from the bu pass. 2. When building SCC graphs, simplify the logic and use spliceFrom to do the heavy lifting, instead of cloneInto/delete. This slices another .14s off 176.gcc. llvm-svn: 20826	2005-03-25 00:05:04 +00:00
Chris Lattner	02206c42f2	Make the spliceFrom case where one graph is completely empty be constant time. llvm-svn: 20825	2005-03-25 00:02:41 +00:00
Chris Lattner	a90eb0ff31	add a new DSGraph::spliceFrom method, which violently takes the content of one graph and plops it into another, without breaking a sweat. llvm-svn: 20824	2005-03-24 23:46:04 +00:00
Nate Begeman	6b11098886	Implement next round of Pattern ISel fixes 1. void returns 2. multiplies 3. calls llvm-svn: 20822	2005-03-24 23:35:30 +00:00
Nate Begeman	613e54d5f0	Fix an incorrect argument being passed to BuildMI for indirect calls. llvm-svn: 20821	2005-03-24 23:34:38 +00:00
Chris Lattner	5f6b30b7c0	This replaces the correct but slow code with a more aggressive scc-finder based approach to find globals and call sites that need to be copied. This speeds up the BU pass on 176.gcc from 22s back up to 2.3s. Not as good as 1.5s, but at least it's correct :) llvm-svn: 20820	2005-03-24 23:06:02 +00:00
Chris Lattner	dec4b495c9	only look at successors of globals. This gets us down to "only" 22s in the bu pass for 176.gcc llvm-svn: 20818	2005-03-24 21:17:27 +00:00
Chris Lattner	0a5c8b7f21	Unfortunately, a previous patch was not safe. Revert it, reimplement something correct. Unfortunately this takes 176.gcc's BU phase back up to 29s from 1.5. This fixes DSGraph/2005-03-24-Global-Arg-Alias.ll llvm-svn: 20817	2005-03-24 21:07:47 +00:00
Nate Begeman	4584ca0554	Commit Gabor Greif's patch to use iterators in lowering intrinsics. llvm-svn: 20816	2005-03-24 20:07:16 +00:00
Chris Lattner	32dc61b75e	don't bother \|'ing in 0's llvm-svn: 20815	2005-03-24 18:42:51 +00:00
Chris Lattner	0530cce5a5	be more aggressive about incompleteness marking llvm-svn: 20814	2005-03-24 18:42:28 +00:00
Chris Lattner	ad07b1bc54	eliminate dead variables, patch contributed by Gabor Greif! llvm-svn: 20812	2005-03-24 17:32:20 +00:00
Nate Begeman	833c1d0994	Implement more of the PPC32 Pattern ISel: 1) dynamic stack alloc 2) loads 3) shifts 4) subtract 5) immediate form of add, and, or, xor 6) change flag from -pattern-isel to -enable-ppc-pattern-isel Remove dead arguments from getGlobalBaseReg in the simple ISel llvm-svn: 20810	2005-03-24 06:28:42 +00:00
Chris Lattner	a42c4a0874	Fix silly "no newline at end of file" warning llvm-svn: 20809	2005-03-24 06:16:18 +00:00
Chris Lattner	56f3525a1d	Fix compilation errors, patch contributed by the fabulous Bill Wendling! llvm-svn: 20808	2005-03-24 05:13:53 +00:00
Chris Lattner	2e2035aa72	fix a compilation error, patch contributed by Bill Wendling! llvm-svn: 20807	2005-03-24 05:12:48 +00:00
Nate Begeman	0e77845b7e	Addition of the PPC32 Pattern ISel. While it is far from complete, it will be brought up to parity with the current simple ISel in the coming days. Currently, -pattern-isel is required to trigger it. llvm-svn: 20805	2005-03-24 04:41:43 +00:00
Nate Begeman	175a9f1cc6	Remove comments that are now meaningless from the pattern ISels, at Chris's request. llvm-svn: 20804	2005-03-24 04:39:54 +00:00
Chris Lattner	120bfecc01	Fix a crash while promoting a value out of a loop from a global variable when using ds-aa llvm-svn: 20802	2005-03-24 04:22:04 +00:00
Chris Lattner	586f97a8b6	teach ds-aa about mod/ref for external function calls. llvm-svn: 20801	2005-03-24 03:04:50 +00:00
Chris Lattner	1a860712dc	Simplify dead code into a fixme :) llvm-svn: 20800	2005-03-24 02:41:19 +00:00
Chris Lattner	1dfea3e0f7	fix a compiler crash in runtime/libprofile llvm-svn: 20799	2005-03-24 01:22:52 +00:00
Chris Lattner	be7663e15e	wrap a long line llvm-svn: 20797	2005-03-23 23:51:12 +00:00
Chris Lattner	78ee200153	If we are calling an external function, chain to another AA to potentially decide, don't just immediately give up. This implements GlobalsModRef/chaining-analysis.ll llvm-svn: 20796	2005-03-23 23:49:47 +00:00
Chris Lattner	e64b77f6c3	Make this more efficient by only making one virtual method call. llvm-svn: 20793	2005-03-23 23:26:58 +00:00
Chris Lattner	db762dadcb	Make this a bit more aggressive llvm-svn: 20792	2005-03-23 22:06:41 +00:00
Chris Lattner	03631d6bc4	a hack to allow count-aa to work with ds-aa :( llvm-svn: 20791	2005-03-23 21:59:34 +00:00
Chris Lattner	0fa70f79a6	Add two options to allow -count-aa to print queries either (1) all queries, or (2) only queries that are not successful (e.g. return may alias) llvm-svn: 20790	2005-03-23 21:59:07 +00:00
Chris Lattner	1dbe1592ed	enable -debug-only=licm llvm-svn: 20788	2005-03-23 21:00:12 +00:00
Chris Lattner	06fa97abf9	turn a dead conditional into an assert. llvm-svn: 20787	2005-03-23 20:12:08 +00:00
Chris Lattner	543acffe45	Totally gut mergeInGraph. There is absolutely no reason to be merging global roots in from callees to callers. The BU graphs do not have accurate globals information and all of the clients know it. Instead, just make sure the GG is up-to-date, and they will be perfectly satiated. This speeds up the BU pass on 176.gcc from 5.5s to 1.5s, and Loc+BU+TD from 7s to 2.7s. llvm-svn: 20786	2005-03-23 20:08:59 +00:00
Chris Lattner	08302340ff	wrap a long line llvm-svn: 20785	2005-03-23 16:43:11 +00:00
Andrew Lenharth	b1bd2e2900	don't lie to the register allocator llvm-svn: 20784	2005-03-23 15:20:01 +00:00
Chris Lattner	6222df7351	Make -steens-aa more conservative (aka correct) by making sure to obey incompleteness flags. Make it more aggressive by taking field sensitive information into account. llvm-svn: 20781	2005-03-23 01:48:09 +00:00
Tanya Lattner	d7b8fb8263	Added alias analysis. Fixed many many bugs. This now works on almost all Singlesource , and most of MultiSource. llvm-svn: 20780	2005-03-23 01:47:20 +00:00
Chris Lattner	995ce252d8	implement Analysis/DSGraph/field-sensitive.ll llvm-svn: 20779	2005-03-23 01:47:19 +00:00
Chris Lattner	8fa2449908	don't crash in some bad cases. llvm-svn: 20776	2005-03-23 01:29:26 +00:00
Chris Lattner	6d9578f11d	Several changes here: 1. Increase max node size from 64->256 to avoid collapsing an important structure in 181.mcf 2. If we have multiple calls to an indirect call node with an indirect callee, fold these call nodes together, to avoid DSA turning apoc into a flaming fireball of death when analyzing 176.gcc. With this change, 176.gcc now takes ~7s to analyze for loc+bu+td, with 5.7s of that in the BU pass. llvm-svn: 20775	2005-03-22 23:54:52 +00:00
Chris Lattner	6736ff36a1	Mark external globals incomplete in the BU Globals graph, fixing Analysis/DSGraph/2005-03-22-IncompleteGlobal.ll llvm-svn: 20773	2005-03-22 22:10:22 +00:00
Andrew Lenharth	61312ca088	hum, it is good to use real instructions llvm-svn: 20769	2005-03-22 16:42:52 +00:00
Chris Lattner	f975e2350a	Directly count the number of memory instructions. llvm-svn: 20766	2005-03-22 03:55:10 +00:00
Chris Lattner	b847572d0e	Timers SHOULD NOT record the time taken to count the bytes allocated in the heap! llvm-svn: 20765	2005-03-22 03:20:38 +00:00
Chris Lattner	361cab323a	Remove an iteration pass over the entire scalarmap for each function created by not allowing integer constants to get into the scalar map in the first place. llvm-svn: 20764	2005-03-22 02:45:13 +00:00
Chris Lattner	d1e1c51e8e	When making a clone of a DSGraph from the BU pass, make sure to remember that this clone is supposed to be used for ALL of the functions in the SCC. This fixes the memory explosion problem the TD pass was having, reducing the memory growth from 24MB -> 3.5MB on povray and 270MB ->8.3MB on perlbmk! This obviously also speeds up the TD pass a lot. llvm-svn: 20763	2005-03-22 01:50:42 +00:00
Chris Lattner	d36dab8b4c	Don't use operator[], use the new method instead, which is faster. This speeds up the TD pass about 30% for povray and perlbmk. It's still not clear why copying a 5MB set of graphs turns into a 25MB set of graphs though :( llvm-svn: 20762	2005-03-22 01:42:59 +00:00
Chris Lattner	0ed923c45a	Now that the dead ctor is gone, nothing uses the old node mapping exported by cloneInto: make it an internally used mapping. llvm-svn: 20760	2005-03-22 00:36:51 +00:00
Chris Lattner	4264b1d97e	remove a dead ctor llvm-svn: 20759	2005-03-22 00:33:35 +00:00
Chris Lattner	81a96c578c	now that the second argument is always this->ReturnNodes, don't bother passing it. llvm-svn: 20758	2005-03-22 00:29:44 +00:00
Chris Lattner	4c9d4fe24f	instead of using a local RetValMap, just use the graph we are cloning into for the return node map. llvm-svn: 20757	2005-03-22 00:25:52 +00:00
Andrew Lenharth	5bd65ee784	two things: 1)evilness reduction patch, reduces the number of instructions hiding in the small jump CC moving code. 2)implement div of small data types by FP DIV (also reduces evilness and should speed things up) llvm-svn: 20756	2005-03-22 00:24:07 +00:00
Chris Lattner	bd9d33173c	now that the valuemapping is always the local scalar map, we can eliminate this identity merge. llvm-svn: 20755	2005-03-22 00:22:45 +00:00
Chris Lattner	ffa612a1fd	remove the second argument to cloneInto llvm-svn: 20754	2005-03-22 00:21:05 +00:00
Chris Lattner	940600a185	add some timers, don't clone aux nodes llvm-svn: 20752	2005-03-22 00:12:00 +00:00
Chris Lattner	21b3519b2e	move this out of line llvm-svn: 20751	2005-03-22 00:09:45 +00:00
Chris Lattner	e1c098449c	don't generate temporary scalarmaps. llvm-svn: 20749	2005-03-22 00:04:21 +00:00
Chris Lattner	1ce92ebd00	allow passing clone flags down to cloneInto llvm-svn: 20748	2005-03-21 22:49:53 +00:00
Chris Lattner	97fc8f85d1	Enhance the TD pass to build composite graphs when we have indirect call sites that target multiple callees. If we have a function table, for example, with N callees, and M callers call through it, we used to have to perform O(M*N) graph inlinings. Now we perform O(M+N) inlinings. This speeds up the td pass on perlbmk from 36.26s to 25.75s. llvm-svn: 20743	2005-03-21 20:31:29 +00:00
Chris Lattner	8b4af69d5b	make this const correct llvm-svn: 20741	2005-03-21 20:28:50 +00:00
Chris Lattner	15ab6ab0c1	Fix a major problem where we didn't add call graph edges for call sites with more than 1 callee. This fixes Analysis/DSGraph/FunctionPointerTable-const.ll llvm-svn: 20740	2005-03-21 20:20:49 +00:00
Misha Brukman	04d6d0666d	We may be adding functions to the Module during initialization, so conservatively, it's modified llvm-svn: 20735	2005-03-21 19:22:14 +00:00
Chris Lattner	7c6e697cc6	Ugh, for some reason, I can't call this unless the reference is const!?!?!? llvm-svn: 20732	2005-03-21 10:00:45 +00:00
Chris Lattner	83ce1e319c	The reachability cloner should add arguments to merged calls when the RHS of the merge has more operands than the LHS. llvm-svn: 20731	2005-03-21 09:39:51 +00:00
Chris Lattner	3dd7af56a4	'note to self' llvm-svn: 20727	2005-03-21 08:43:32 +00:00
Chris Lattner	ce471ff361	Remove a bunch of cruft and dead code for handling the case when types were defined in function constant pools. The assembler grammar has long disallowed functions from having constant pools, so all of this stuff is dead. This makes it an immediate error for functions to refer to nonexisting types, fixing Regression/Verifier/2005-03-21-UndefinedTypeReference.ll. Before, references to non-existing types in functions would only be detected when the subsequent function was parsed, due to the call to "ResolveTypes". "ResolveTypes" has not resolved any types for a long time, instead it emitted an error message if no resolved types are left. Since the only caller of this method is in the module code, just inline it. llvm-svn: 20726	2005-03-21 06:27:42 +00:00
Tanya Lattner	156e5a6897	Make this method non-const. Making it const causes the const version of getIGroup to be called instead of the non-const one. These two methods have (??) different behavior, so this change fixes bugs. llvm-svn: 20724	2005-03-21 06:07:43 +00:00
Chris Lattner	1f266b60f8	Change the way that the TD pass inlines graphs. Instead of inlining each graph into all of the functions it calls when we visit a graph, change it so that the graph visitor inlines all of the callers of a graph into the current graph when it visits it. While we're at it, inline global information from the GG instead of from each of the callers. The GG contains a superset of the info that the callers do anyway, and this way we only need to do it one time (not one for each caller). This speeds up the TD pass substantially on several programs, and there is still room for improvement. For example, the TD pass used to take 147s on perlbmk, it now takes 36s. On povray, we went from about 5s to 1.97s. 134.perl is down from ~1s for Loc+BU+TD to .6s. The TD pass needs a lot of improvement though, which will occur with later patches. llvm-svn: 20723	2005-03-21 04:55:35 +00:00
Chris Lattner	85387b86fa	Don't strip modref bits when inlining down the call graph. This fixes the DSGraph/2003-06-30-TopDownResolve.ll regression from last night. llvm-svn: 20717	2005-03-20 18:02:56 +00:00
Chris Lattner	da405e3c5d	Remove the ability to keep track of inlined globals, which is always dead. llvm-svn: 20716	2005-03-20 04:30:30 +00:00
Chris Lattner	0d3ba2a064	This call is always a noop, remove it. llvm-svn: 20714	2005-03-20 04:29:54 +00:00
Chris Lattner	715493901e	remove some pointless asserts llvm-svn: 20713	2005-03-20 04:29:39 +00:00
Chris Lattner	a09de3da5d	-steens doesn't use the inlined globals facility. llvm-svn: 20712	2005-03-20 04:23:57 +00:00
Chris Lattner	cb59ad59dc	Build EC's for globals twice. The first is after constructing the initial Globals Graph for the local pass, the second is after all of the locals graphs have been constructed. This allows for many additional global EC's to be recognized that weren't before. This speeds up analysis of programs like 177.mesa, where it changes DSA from taking 0.712s to 0.4018s. llvm-svn: 20711	2005-03-20 03:32:35 +00:00
Chris Lattner	4928678f91	Add a new DSNode::removeGlobal method. llvm-svn: 20710	2005-03-20 03:29:54 +00:00
Chris Lattner	f61874f79a	Transform BU pass to not use the horrible DSCallSiteIterator class. llvm-svn: 20708	2005-03-20 02:42:07 +00:00
Chris Lattner	1648378d0e	Implement new methods for dealing with DSNode global lists, rename uses of old methods. llvm-svn: 20707	2005-03-20 02:41:38 +00:00
Chris Lattner	2a3687ecb0	use simpler methods. llvm-svn: 20706	2005-03-20 02:41:16 +00:00
Chris Lattner	dddb514aa9	method was renamed. llvm-svn: 20705	2005-03-20 02:40:27 +00:00
Chris Lattner	4c11b8e07d	print out equiv class info. llvm-svn: 20704	2005-03-20 02:40:11 +00:00
Chris Lattner	73ae41b317	some methods got renamed llvm-svn: 20703	2005-03-20 02:40:04 +00:00
Chris Lattner	da7b948969	Make use of simpler DSNode methods. llvm-svn: 20702	2005-03-20 02:39:49 +00:00
Chris Lattner	51f7c8a068	#ifdef out a function only used by #ifdef'd code. llvm-svn: 20700	2005-03-20 02:14:15 +00:00
Chris Lattner	904a0ddcc5	comment cleanup llvm-svn: 20699	2005-03-20 01:18:00 +00:00
Chris Lattner	f17cd879c0	Create an equivalence class of global variables that DSA will never be able to tell apart anyway, and only track the leader for of these equivalence classes in our graphs. This dramatically reduces the number of GlobalValue*'s that appear in scalar maps, which A) reduces memory usage, by eliminating many many scalarmap entries and B) reduces time for operations that need to execute an operation for each global in the scalar map. As an example, this reduces the memory used to analyze 176.gcc from 1GB to 511MB, which (while it's still way too much) is better because it doesn't hit swap anymore. On eon, this shrinks the local graphs from 14MB to 6.8MB, shrinks the bu+td graphs of povray from 50M to 40M, shrinks the TD graphs of 130.li from 8.8M to 3.6M, etc. This change also speeds up DSA on large programs where this makes a big difference. For example, 130.li goes from 1.17s -> 0.56s, 134.perl goes from 2.14 -> 0.93s, povray goes from 15.63s->7.99s (!!!). This also apparently either fixes the problem that caused DSA to crash on perlbmk and gcc, or it hides it, because DSA now works on these. These both take entirely too much time in the TD pass (147s for perl, 538s for gcc, vs 7.67/5.9s in the bu pass for either one), but this is a known problem that I'll deal with later. llvm-svn: 20696	2005-03-19 22:23:45 +00:00
Chris Lattner	f53c9e2578	Fix the 3 regressions last night, due to my buggy patch from yesterday. llvm-svn: 20689	2005-03-19 17:35:11 +00:00
Alkis Evlogimenos	19bea8930f	Add new function getPtrPtrFromArrayPtr(). llvm-svn: 20684	2005-03-19 11:40:31 +00:00
Alkis Evlogimenos	d8f23f17f0	Stop using deprecated interface. llvm-svn: 20679	2005-03-19 09:22:17 +00:00
Chris Lattner	773569df86	Switch to use the new interface for the EquivalenceClasses class, and fix a bug involving SCC's who have multiple members that are part of an EC. llvm-svn: 20678	2005-03-19 05:15:27 +00:00
Chris Lattner	54b0239649	do not bother inlining nullary functions without return values. The only effect these calls can have is due to global variables, and these passes all use the globals graph to capture their effect anyway. This speeds up the BU pass very slightly on perlbmk, reducing the number of dsnodes allocated from 98913 to 96423. llvm-svn: 20676	2005-03-18 23:19:47 +00:00
Chris Lattner	a9f266472f	fix a bogus assertion llvm-svn: 20675	2005-03-18 23:18:30 +00:00
Chris Lattner	1ebf12b477	another fastpath llvm-svn: 20674	2005-03-18 23:18:20 +00:00
Chris Lattner	35084f46a3	remove use of getPrev() and getNext() on ilist nodes. llvm-svn: 20673	2005-03-18 16:12:37 +00:00
Chris Lattner	7a4832c53a	expose this pass to both opt and analyze llvm-svn: 20672	2005-03-18 05:27:57 +00:00
Chris Lattner	c2d54235d7	remove a bogus optimization. This only works if there are no globals in the graph, and the combination of a function that does not reference globals, takes not arguments and returns no value is pretty rare. llvm-svn: 20670	2005-03-18 00:23:59 +00:00
Chris Lattner	57989f2b9a	Rewrite DSAA::getModRefInfo to compute the mapping between caller and callee to determine mod/ref behavior, instead of creating a copy of the caller graph and inlining the callee graph into the copy. This speeds up aa-eval on Ptrdist/yacr2 from 109.13s to 3.98s, and gives identical results. The speedup is similar on other programs. llvm-svn: 20669	2005-03-18 00:21:03 +00:00
Chris Lattner	a7e0e70f53	implement a new method. llvm-svn: 20668	2005-03-17 23:45:54 +00:00
Chris Lattner	be0eb11431	add some possibly bogus assertions. llvm-svn: 20665	2005-03-17 20:33:27 +00:00
Chris Lattner	097c55f578	Do not include the Function* for direct call/invoke instructions in the alias evaluation. Clients really don't care. llvm-svn: 20664	2005-03-17 20:25:04 +00:00
Duraid Madina	ad26d89f4a	typo/denial llvm-svn: 20663	2005-03-17 20:23:27 +00:00
Chris Lattner	5368664b75	simplify this function a bit, allow DS-AA to build on/improve the mod/ref results returned by AA, not just use one or the other. llvm-svn: 20662	2005-03-17 20:16:58 +00:00
Chris Lattner	430c826ae1	Clean up some code, handle null pointer specially to avoid an assertion llvm-svn: 20660	2005-03-17 19:56:56 +00:00
Chris Lattner	44cbb1f79f	Two changes: 1. Chain to the parent implementation of M/R analysis if we can't find any information. It has some heuristics that often do well. 2. Do not clear all flags, this can make invalid nodes by turning nodes that used to be collapsed into non-collapsed nodes (fixing crashes) llvm-svn: 20659	2005-03-17 19:56:18 +00:00
Duraid Madina	341917d75b	clean up warnings when building in release mode llvm-svn: 20658	2005-03-17 19:00:40 +00:00
Duraid Madina	0b84eec44b	OK, IA64 is statically linked into llc llvm-svn: 20655	2005-03-17 18:37:05 +00:00
Duraid Madina	08bd58412a	build the IA64 target as a .so for now llvm-svn: 20654	2005-03-17 18:29:04 +00:00
Duraid Madina	79022e1b87	and so it begins... PHASE 1: write instruction selector PHASE 2: ??? PHASE 3: profit! llvm-svn: 20652	2005-03-17 18:17:03 +00:00
Chris Lattner	79ba9d58fd	Don't emit two comparisons when comparing a FP value against zero! llvm-svn: 20651	2005-03-17 16:29:26 +00:00
Chris Lattner	c9a3ea81bf	Fix the missing symbols problem Bill was hitting. Patch contributed by Bill Wendling!! llvm-svn: 20649	2005-03-17 15:38:16 +00:00
Chris Lattner	1a8b3193af	Do not create ridiculously huge DSNodes, as described in the comments. This speeds up the BU pass on 172.mgrid from 62.3 -> 0.1242s. llvm-svn: 20648	2005-03-17 05:25:34 +00:00
Chris Lattner	b193c0854c	Fix a bug where we would consider " .99" and "1.0" different because of the leading whitespace. llvm-svn: 20647	2005-03-17 04:49:04 +00:00
Chris Lattner	46930f8df5	remove use of compat_iterator. llvm-svn: 20643	2005-03-16 22:42:19 +00:00
Misha Brukman	674bbc7112	Convert tabs to spaces llvm-svn: 20638	2005-03-16 05:42:00 +00:00
Chris Lattner	f174f4c9d1	fix some 80 column violations Add support for programs that define main in a .a file, such as f2c'd programs. llvm-svn: 20631	2005-03-15 23:03:34 +00:00
Chris Lattner	1020a03b64	consolidate LinkFiles into LinkItems, use lib_* iterators. llvm-svn: 20630	2005-03-15 22:55:17 +00:00
Chris Lattner	60222ca193	consolidate LinkLibraries into LinkItems llvm-svn: 20629	2005-03-15 22:51:40 +00:00
Chris Lattner	b40e34bd44	make sure to mark nodes in the globals graph incomplete after computing it so that external globals (and whatever they point to) are marked incomplete. llvm-svn: 20628	2005-03-15 22:47:18 +00:00
Chris Lattner	cece5dd244	fix crashes when we only have a prototype for main. llvm-svn: 20627	2005-03-15 22:10:04 +00:00
Chris Lattner	9802eb4351	Fix a crash that happens when mapping something like this: { short, short } to short where the second short maps onto the second field of the first struct. In this case, the struct index is not aligned, so we should avoid calling getLink(2), which asserts out. llvm-svn: 20626	2005-03-15 21:36:50 +00:00
Andrew Lenharth	fbcfef1558	sure, I can set a flag, but if I never check it, why bother setting it? Should fix 20 programs :) llvm-svn: 20623	2005-03-15 19:51:19 +00:00
Chris Lattner	ca69a3542e	Make computeGGToGMapping compute an invnodemap llvm-svn: 20622	2005-03-15 17:52:18 +00:00
Chris Lattner	5eeae726e3	Finally fix (the right way) the problem where functions like this: void foo() { G = 1; } would have an empty DSGraph even though G (a global) is directly used in the function. llvm-svn: 20619	2005-03-15 17:14:09 +00:00
Chris Lattner	f4c515e54a	Start using retnodes_* for iteration. llvm-svn: 20618	2005-03-15 16:55:04 +00:00
Chris Lattner	7277bd8606	avoid varialbe name collisions llvm-svn: 20606	2005-03-15 06:29:12 +00:00
Chris Lattner	8cfd7fbf35	stop using method. llvm-svn: 20603	2005-03-15 05:19:49 +00:00
Chris Lattner	7a9186cb47	stop using arg_front llvm-svn: 20599	2005-03-15 05:03:36 +00:00
Chris Lattner	33f53a1f4f	stop using arg_back llvm-svn: 20598	2005-03-15 04:59:17 +00:00
Chris Lattner	4b688a1c70	This mega patch converts us from using Function::a{iterator\|begin\|end} to using Function::arg_{iterator\|begin\|end}. Likewise Module::g* -> Module::global_*. This patch is contributed by Gabor Greif, thanks! llvm-svn: 20597	2005-03-15 04:54:21 +00:00
Chris Lattner	02d1cf3df0	Don't crash if computing a mapping to a node with zero size llvm-svn: 20595	2005-03-15 04:40:24 +00:00
Chris Lattner	5b39119085	rename method, add counterpart llvm-svn: 20593	2005-03-15 00:58:16 +00:00
Andrew Lenharth	e367587fbb	FP 0.0 setcc optimization, and generate short branch sequence for setcc(FP) rather than stack usage llvm-svn: 20589	2005-03-14 19:23:45 +00:00
Chris Lattner	751bada498	add a method to compute a commonly used mapping. llvm-svn: 20588	2005-03-14 19:22:47 +00:00
Chris Lattner	65fc185896	regardless of whether or not the client things we should mark globals incomplete, ALWAYS mark them incomplete if they are external! llvm-svn: 20586	2005-03-13 20:36:01 +00:00
Chris Lattner	361e6704b4	Make sure to remove incomplete markers before we add to them! :) llvm-svn: 20585	2005-03-13 20:32:26 +00:00
Chris Lattner	faf51a28e7	The incoming arguments to main (the argv list) are not complete! llvm-svn: 20584	2005-03-13 20:22:10 +00:00
Chris Lattner	cd69084e0e	After finishing BU analysis, move all global variables from the globals graph into main and mark them complete. llvm-svn: 20583	2005-03-13 20:15:06 +00:00
Chris Lattner	a1c07236db	ADd support for printing eqgraphs. llvm-svn: 20582	2005-03-13 19:51:24 +00:00
Chris Lattner	55e0a19572	Replace linear search with logrithmic one. llvm-svn: 20580	2005-03-13 19:05:05 +00:00
Chris Lattner	112de16cf5	add a StructLayout::getElementContainingOffset method. llvm-svn: 20579	2005-03-13 19:04:41 +00:00
Andrew Lenharth	abe4fd6c68	Should fix mesa llvm-svn: 20577	2005-03-13 00:43:20 +00:00
Chris Lattner	9e6d9d0b72	make sure to mark nodes returned from functions as incomplete llvm-svn: 20576	2005-03-12 14:58:28 +00:00
Chris Lattner	a4bd8bd9b0	remove this from the PA namespace, leaving it in the llvm ns llvm-svn: 20574	2005-03-12 12:08:52 +00:00
Chris Lattner	848760c21f	Move this from the pool allocator project to here, where it logically belongs. llvm-svn: 20570	2005-03-12 11:51:30 +00:00
Andrew Lenharth	d289be2b54	remove a pseudo instruction and improve inline constant generation llvm-svn: 20563	2005-03-11 17:48:05 +00:00
Chris Lattner	4422ffd421	I didn't mean to check this in. :( llvm-svn: 20555	2005-03-10 20:59:51 +00:00
Chris Lattner	fa9e43b38c	Fix a bug where we would incorrectly do a sign ext instead of a zero ext because we were checking the wrong thing. Thanks to andrew for pointing this out! llvm-svn: 20554	2005-03-10 20:55:51 +00:00
Andrew Lenharth	bb0e16241a	yay for camel_cvs diff llvm-svn: 20552	2005-03-10 20:15:09 +00:00
Andrew Lenharth	1060a5028d	some typoes and .bss isn't liked, at all llvm-svn: 20542	2005-03-10 19:02:02 +00:00
Chris Lattner	ea2e61b83a	Allow the live interval analysis pass to be a bit more aggressive about numbering values in live ranges for physical registers. The alpha backend currently generates code that looks like this: vreg = preg ... preg = vreg use preg ... preg = vreg use preg etc. Because vreg contains the value of preg coming in, each of the copies back into preg contain that initial value as well. In the case of the Alpha, this allows this testcase: void "foo"(int %blah) { store int 5, int %MyVar store int 12, int %MyVar2 ret void } to compile to: foo: ldgp $29, 0($27) ldiq $0,5 stl $0,MyVar ldiq $0,12 stl $0,MyVar2 ret $31,($26),1 instead of: foo: ldgp $29, 0($27) bis $29,$29,$0 ldiq $1,5 bis $0,$0,$29 stl $1,MyVar ldiq $1,12 bis $0,$0,$29 stl $1,MyVar2 ret $31,($26),1 This does not seem to have any noticable effect on X86 code. This fixes PR535. llvm-svn: 20536	2005-03-09 23:05:19 +00:00
Andrew Lenharth	65ef5bced7	minor correction for Register that isn't used llvm-svn: 20535	2005-03-09 20:48:23 +00:00
Chris Lattner	e0d0c64c8a	constant fold FP_ROUND_INREG, ZERO_EXTEND_INREG, and SIGN_EXTEND_INREG This allows the alpha backend to compile: bool %test(uint %P) { %c = seteq uint %P, 0 ret bool %c } into: test: ldgp $29, 0($27) ZAP $16,240,$0 CMPEQ $0,0,$0 AND $0,1,$0 ret $31,($26),1 instead of: test: ldgp $29, 0($27) ZAP $16,240,$0 ldiq $1,0 ZAP $1,240,$1 CMPEQ $0,$1,$0 AND $0,1,$0 ret $31,($26),1 ... and fixes PR534. llvm-svn: 20534	2005-03-09 18:37:12 +00:00
Chris Lattner	3cf502890c	correct the computation of the isAbstract bit for types. llvm-svn: 20533	2005-03-09 17:34:27 +00:00
Chris Lattner	30ac52c4b4	Fix Regression/Analysis/BasicAA/2005-03-09-BrokenBasicAA.ll, a miscompilation that Alkis found with Java, thanks Alkis! llvm-svn: 20531	2005-03-09 16:29:52 +00:00
Reid Spencer	220e2f8519	Fix a typo in an assertion comment. Patch contributed by Vladimir Merzliakov. llvm-svn: 20529	2005-03-09 15:19:41 +00:00
Chris Lattner	4d755dc735	Export two methods for getting -X and A-B. llvm-svn: 20527	2005-03-09 05:34:41 +00:00
Chris Lattner	9f3c0326f4	get bugpoint working on ia64, by building .so's with -fpic. :) llvm-svn: 20525	2005-03-09 03:31:02 +00:00
Chris Lattner	496d623600	Fix a crash handling 'undef bool', fixing an llc crash on 186.crafty llvm-svn: 20523	2005-03-08 22:53:09 +00:00
Reid Spencer	b0ca4aa8cd	Patch to make assembly output compatible with mingw compilation (identical to cygwin) llvm-svn: 20520	2005-03-08 17:02:05 +00:00
Chris Lattner	667186f10f	Make sure to remove all dead type names from the symbol table, not just struct types. This fixes Regression/CodeGen/CBackend/2005-03-08-RecursiveTypeCrash.ll, a crash on Java output that Alkis reported. llvm-svn: 20519	2005-03-08 16:19:59 +00:00
Misha Brukman	e29de97ab7	Single characters should be printed out as chars, not strings. llvm-svn: 20515	2005-03-08 00:26:08 +00:00
Chris Lattner	9cc39e2f8b	Fix an apparent ambiguity compiling on PPC llvm-svn: 20507	2005-03-07 02:59:36 +00:00
Chris Lattner	6d6f980ca7	fix a bug where we thought arguments were constants :( llvm-svn: 20506	2005-03-06 22:52:29 +00:00
Chris Lattner	2174b70c68	Fix Regression/Transforms/LoopStrengthReduce/dont_insert_redundant_ops.ll, hopefully not breaking too many other things. llvm-svn: 20505	2005-03-06 22:36:12 +00:00
Chris Lattner	a29e319d54	implement Transforms/LoopStrengthReduce/invariant_value_first_arg.ll llvm-svn: 20501	2005-03-06 22:06:22 +00:00
Chris Lattner	18fdd1e9f6	minor simplifications of the code. llvm-svn: 20497	2005-03-06 21:58:22 +00:00
Chris Lattner	53c34a2147	trivial simplification llvm-svn: 20494	2005-03-06 21:35:38 +00:00
Chris Lattner	b4e635cfc4	Fix a bug where we could corrupt a parent loop's header info if we unrolled a nested loop. This fixes Transforms/LoopUnroll/2005-03-06-BadLoopInfoUpdate.ll and PR532 llvm-svn: 20493	2005-03-06 20:57:32 +00:00
Chris Lattner	46653269f4	rename insertEntry to insert llvm-svn: 20484	2005-03-06 05:55:40 +00:00
Chris Lattner	b1ac7bc7f3	Merge SymbolTable::removeEntry into SymbolTable::remove, its only caller llvm-svn: 20483	2005-03-06 05:51:09 +00:00
Chris Lattner	57a7a2d1cf	Delete the really inefficient method: void remove(const Type* Typ); Speed up the symbol stripping code by avoiding a linear search of the type table. Get rid of removeEntry(type_iterator), since 'remove' is exactly the same operation. llvm-svn: 20481	2005-03-06 05:46:41 +00:00
Chris Lattner	0ed850a944	Make this MUCH faster by avoiding a linear search in the symbol table code. llvm-svn: 20479	2005-03-06 05:42:36 +00:00
Chris Lattner	f1d5e180ce	Remove some really gross and hard to understand code now that InternallyInconsistent is always false. llvm-svn: 20477	2005-03-06 05:21:40 +00:00
Chris Lattner	4af779dcba	Simplify some code. llvm-svn: 20476	2005-03-06 05:13:42 +00:00
Chris Lattner	eb5987ee06	remove these methods. llvm-svn: 20474	2005-03-06 02:37:47 +00:00
Chris Lattner	1343991e93	simplify and speed up some code llvm-svn: 20472	2005-03-06 02:32:00 +00:00
Chris Lattner	a518cf568a	simplify some code. llvm-svn: 20471	2005-03-06 02:28:23 +00:00
Chris Lattner	ffa96dc848	This fixes PR531, a crash when running the CBE on a bytecode file. The problem is that Function::renameLocalSymbols is iterating through the symbol table planes, occasionally calling setName to rename a value (which used to do a symbol table remove/insert pair). The problem is that if there is only a single value in a particular type plane that the remove will nuke the symbol table plane, and the insert will create and insert a new one. This hoses Function::renameLocalSymbols because it has an iterator to the old plane, under the (very reasonable) assumption that simply renaming a value won't cause the type plane to disappear. This patch fixes the bug by making the rename operation a single atomic operation, which has a side effect of making the whole thing faster too. :) llvm-svn: 20469	2005-03-06 02:14:28 +00:00
Jeff Cohen	db51926d4a	Reformat comments to fix 80 columns. llvm-svn: 20467	2005-03-05 22:45:40 +00:00
Jeff Cohen	023f10be12	Reuse induction variables created for strength-reduced GEPs by other similar GEPs. llvm-svn: 20466	2005-03-05 22:40:34 +00:00
Chris Lattner	b177010d51	remove all of the various setName implementations, consolidating them into Value::setName, which is no longer virtual. llvm-svn: 20464	2005-03-05 19:51:50 +00:00
Chris Lattner	1ccff5c8c7	second argument to Value::setName is now gone. llvm-svn: 20463	2005-03-05 19:05:20 +00:00
Chris Lattner	05e4fe5ef3	Make sure the two arguments of a setcc instruction point to the same node. llvm-svn: 20462	2005-03-05 19:04:31 +00:00
Chris Lattner	70ffed029e	zap llvm-svn: 20461	2005-03-05 19:04:07 +00:00
Chris Lattner	80ba99a8f6	2nd arg to setName goes away. llvm-svn: 20460	2005-03-05 19:02:15 +00:00
Chris Lattner	2bd3d67a8d	Constants never get names. llvm-svn: 20459	2005-03-05 19:01:59 +00:00
Chris Lattner	005a4a476a	Remove the 2nd argument to Value::setName llvm-svn: 20458	2005-03-05 19:01:49 +00:00
Chris Lattner	f70d80d026	don't break the build on 32-bit hosts. llvm-svn: 20455	2005-03-05 17:47:38 +00:00
Andrew Lenharth	ee4072f980	fix data size stuff for architectures with bit challenged data types llvm-svn: 20453	2005-03-05 15:30:33 +00:00
Chris Lattner	cadc85daa5	Do not compute 1ULL << 64, which is undefined. This fixes Ptrdist/ks on the sparc, and testcase Regression/Transforms/InstCombine/2005-03-04-ShiftOverflow.ll llvm-svn: 20445	2005-03-04 23:21:33 +00:00
Andrew Lenharth	ad4380f06e	fix up stack pointer adjustments llvm-svn: 20442	2005-03-04 21:40:02 +00:00
Chris Lattner	0864ad52d4	Trivial cleanup patch llvm-svn: 20436	2005-03-04 20:27:46 +00:00
Andrew Lenharth	458e6bcf28	fix FCMOVxx typo, set rem and div to hardcode target reg to be the same as the one the assembler uese, update ISel to put values in regs used by assembler for rem and div llvm-svn: 20434	2005-03-04 20:09:23 +00:00
Jeff Cohen	29ecafb2e3	Add support for not strength reducing GEPs where the element size is a small power of two. This emphatically includes the zeroeth power of two. llvm-svn: 20429	2005-03-04 04:04:26 +00:00
Andrew Lenharth	e831777542	turn on IEEE for compares llvm-svn: 20425	2005-03-03 22:12:11 +00:00
Andrew Lenharth	e6dbf989b3	beter Select on FP llvm-svn: 20424	2005-03-03 21:47:53 +00:00
Chris Lattner	4439f1686f	Print -X like this: double test(double l1_X) { return (-l1_X); } instead of like this: double test(double l1_X) { return (-0x0p+0 - l1_X); } llvm-svn: 20423	2005-03-03 21:12:04 +00:00
Andrew Lenharth	b5ddbc074d	LSR cleanup patch llvm-svn: 20422	2005-03-03 19:03:21 +00:00
Chris Lattner	8074739aa2	Do not lower malloc's to pass "sizeof" expressions like this: ltmp_0_7 = malloc(((unsigned )(&(((signed char ()[784])/NULL*/0)[1u])))); Instead, just emit the literal constant, like this: ltmp_0_7 = malloc(784u); This works around a bug in ICC 8.1 compiling the CBE generated code. :-( llvm-svn: 20415	2005-03-03 01:04:50 +00:00
Chris Lattner	4814696e7d	Add an optional argument to lower to a specific constant value instead of to a "sizeof" expression. llvm-svn: 20414	2005-03-03 01:03:43 +00:00
Misha Brukman	5b587350ee	Fix the spelling of the word `the' llvm-svn: 20412	2005-03-02 23:17:31 +00:00
Chris Lattner	f9597dc689	Print the module ID as a comment. llvm-svn: 20411	2005-03-02 23:12:40 +00:00
Chris Lattner	b205d87afe	cleanup the cfg after lsr llvm-svn: 20410	2005-03-02 21:56:00 +00:00
Andrew Lenharth	1e213c7924	remove 32 sign extend after 32 sextload and handle small negative constant llvm-svn: 20408	2005-03-02 17:23:03 +00:00
Andrew Lenharth	8fc5ba2e06	Added LSR as a beta pass for alpha llvm-svn: 20407	2005-03-02 17:21:38 +00:00
Chris Lattner	798b18474c	Add a temporary option for llc-beta: -enable-lsr-for-ppc, which turns on Loop Strength Reduction. llvm-svn: 20399	2005-03-02 06:19:22 +00:00
Reid Spencer	a5fbf1d659	Be slightly more accurate in an error message. llvm-svn: 20397	2005-03-02 05:45:56 +00:00
Chris Lattner	0bb2828efb	Fix a nasty order of evaluation bug that Gabor Greif ran into. Here's an explanation from IRC: \|sabre\| I think it's an order of evaluation thing \|sabre\| for me, the RHS of the assignment is evaluated first \|sabre\| getTypeDescription checks to see if ConcreteTypeDescription[Ty] contains anything \|sabre\| since it doesn't, it computes and returns the value \|sabre\| this gets put into the map. \|sabre\| For you, the LHS is evaluated first. \|sabre\| Map[Ty] (aka ConcreteTypeDescriptions[Ty]) inserts an empty string into the map, returning a reference \|sabre\| getTypeDesc then sees the empty string in the map \|sabre\| and returns it \|sabre\| bork :) llvm-svn: 20394	2005-03-02 03:54:43 +00:00
Jeff Cohen	6d82d5b23e	Fixed the following LSR bugs: * Loop invariant code does not dominate the loop header, but rather the end of the loop preheader. * The base for a reduced GEP isn't a constant unless all of its operands (preceding the induction variable) are constant. * Allow induction variable elimination for the simple case after all. Also made changes recommended by Chris for properly deleting instructions. llvm-svn: 20383	2005-03-01 03:46:11 +00:00

... 8 9 10 11 12 ...

10265 Commits