llvm-mirror

mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-30 07:22:55 +01:00

Author	SHA1	Message	Date
Chris Lattner	52a8cb35e6	Add a missing #include, patch courtesy of Baptiste Lepilleur. llvm-svn: 23302	2005-09-09 23:53:39 +00:00
Chris Lattner	cae9229d6e	Fix a problem duraid encountered on itanium where this folding: select (x < y), 1, 0 -> (x < y) incorrectly: the setcc returns i1 but the select returned i32. Add the zero extend as needed. llvm-svn: 23301	2005-09-09 23:00:07 +00:00
Chris Lattner	85884e9b8a	Fix a crash viewing dags that have target nodes in them llvm-svn: 23300	2005-09-09 22:35:03 +00:00
Chris Lattner	e7610bc599	Use continue in the use-processing loop to make it clear what the early exits are, simplify logic, and cause things to not be nested as deeply. This also uses MRI->areAliases instead of an explicit loop. No functionality change, just code cleanup. llvm-svn: 23296	2005-09-09 20:29:51 +00:00
Nate Begeman	8422b3637e	Last round of 2-node folds from SD.cpp. Will move on to 3 node ops such as setcc and select next. llvm-svn: 23295	2005-09-09 19:49:52 +00:00
Chris Lattner	fc17fe0e6d	remove debugging code slaps head llvm-svn: 23294	2005-09-09 19:19:20 +00:00
Chris Lattner	8d8506f8e2	When spilling a live range that is used multiple times by one instruction, only add a reload live range once for the instruction. This is one step towards fixing a regalloc pessimization that Nate notice, but is later undone by the spiller (so no code is changed). llvm-svn: 23293	2005-09-09 19:17:47 +00:00
Nate Begeman	1675c67c62	Move yet more folds over to the dag combiner from sd.cpp llvm-svn: 23278	2005-09-08 20:18:10 +00:00
Nate Begeman	c0f764ada4	Another round of dag combiner changes. This fixes some missing XOR folds as well as fixing how we replace old values with new values. llvm-svn: 23260	2005-09-07 23:25:52 +00:00
Chris Lattner	b3516c123f	Fix a bug that Tzu-Chien Chiu noticed: live interval analysis does NOT preserve livevar llvm-svn: 23259	2005-09-07 17:34:39 +00:00
Nate Begeman	e8db0c961a	Implement a common missing fold, (add (add x, c1), c2) -> (add x, c1+c2). This restores all of stanford to being identical with and without the dag combiner with the add folding turned off in sd.cpp. llvm-svn: 23258	2005-09-07 16:09:19 +00:00
Chris Lattner	482f71733a	Fix a bug nate ran into with replacealluseswith. In the recursive cse case, we were losing a node, causing an assertion to fail. Now we eagerly delete discovered CSE's, and provide an optional vector to keep track of these discovered equivalences. llvm-svn: 23255	2005-09-07 05:37:01 +00:00
Nate Begeman	143dc2039d	Add an option to the DAG Combiner to enable it for beta runs, and turn on that option for PowerPC's beta. llvm-svn: 23253	2005-09-07 00:15:36 +00:00
Nate Begeman	e1a34193fa	Next round of DAGCombiner changes. This version now passes all the tests I have run so far when run before Legalize. It still needs to pick up the SetCC folds, and nodes that use SetCC. llvm-svn: 23243	2005-09-06 04:43:02 +00:00
Chris Lattner	29929a3745	Fix a checking failure in gs llvm-svn: 23235	2005-09-03 01:04:40 +00:00
Nate Begeman	613f777bbc	Next round of DAG Combiner changes. Just need to support multiple return values, and then we should be able to hook it up. llvm-svn: 23231	2005-09-02 21:18:40 +00:00
Chris Lattner	da97aa059c	Clean up some code from the last checkin llvm-svn: 23229	2005-09-02 20:32:45 +00:00
Chris Lattner	4c2b614aa6	Fix a bug in legalize where it would emit two calls to libcalls that return i64 values on targets that need that expanded to 32-bit registers. This fixes PowerPC/2005-09-02-LegalizeDuplicatesCalls.ll and speeds up 189.lucas from taking 122.72s to 81.96s on my desktop. llvm-svn: 23228	2005-09-02 20:26:58 +00:00
Chris Lattner	17b67e5137	Make sure to auto-cse nullary ops llvm-svn: 23224	2005-09-02 19:36:17 +00:00
Chris Lattner	7995b70148	Fix some buggy logic where we would try to remove nodes with two operands from the binary ops map, even if they had multiple results. This latent bug caused a few failures with the dag isel last night. To prevent stuff like this from happening in the future, add some really strict checking to make sure that the CSE maps always match up with reality! llvm-svn: 23221	2005-09-02 19:15:44 +00:00
Chris Lattner	365774f457	Don't create zero sized stack objects even for array allocas with a zero number of elements. llvm-svn: 23219	2005-09-02 18:41:28 +00:00
Chris Lattner	7d89863a77	Fix the release build, noticed by Eric van Riet Paap llvm-svn: 23215	2005-09-02 07:09:28 +00:00
Chris Lattner	86bed2f90b	Make sure to legalize assert[zs]ext's operand correctly llvm-svn: 23208	2005-09-02 01:15:01 +00:00
Chris Lattner	4919477f39	Teach live intervals to not crash on dead livein regs llvm-svn: 23206	2005-09-02 00:20:32 +00:00
Chris Lattner	8a6c15f4f4	For values that are live across basic blocks and need promotion, use ANY_EXTEND instead of ZERO_EXTEND to eliminate extraneous extensions. This eliminates dead zero extensions on formal arguments and other cases on PPC, implementing the newly tightened up test/Regression/CodeGen/PowerPC/small-arguments.ll test. llvm-svn: 23205	2005-09-02 00:19:37 +00:00
Chris Lattner	aae61e684c	legalize ANY_EXTEND appropriately llvm-svn: 23204	2005-09-02 00:18:10 +00:00
Chris Lattner	3f7fbe14a8	Add support for ANY_EXTEND and add a few minor folds for it llvm-svn: 23203	2005-09-02 00:17:32 +00:00
Nate Begeman	626c46f8d9	Fix some code in the current node combining code, spotted when it was moved over to DAGCombiner.cpp 1. Don't assume that SetCC returns i1 when folding (xor (setcc) constant) 2. Don't duplicate code in folding AND with AssertZext that is handled by MaskedValueIsZero llvm-svn: 23196	2005-09-01 23:25:49 +00:00
Nate Begeman	18f456b8e3	Implement first round of feedback from chris (there's still a couple things left to do). llvm-svn: 23195	2005-09-01 23:24:04 +00:00
Chris Lattner	f2b775d686	It is NDEBUG not _NDEBUG llvm-svn: 23186	2005-09-01 18:44:10 +00:00
Nate Begeman	517e40a5bb	Add the rest of the currently implemented visit routines to the switch statement in visit(). llvm-svn: 23185	2005-09-01 00:33:32 +00:00
Nate Begeman	be2fa8f86f	First pass at the DAG Combiner. It isn't used anywhere yet, but it should be mostly functional. It currently has all folds from SelectionDAG.cpp that do not involve a condition code. llvm-svn: 23184	2005-09-01 00:19:25 +00:00
Chris Lattner	b8dcea186c	If a function has live ins/outs, print them llvm-svn: 23181	2005-08-31 22:34:59 +00:00
Chris Lattner	fc612f96ec	Allow targets to custom expand shifts that are too large for their registers llvm-svn: 23173	2005-08-31 19:01:53 +00:00
Jeff Cohen	8c454a3024	Fix VC++ precedence warnings llvm-svn: 23169	2005-08-31 02:47:06 +00:00
Nate Begeman	64ea782435	Sigh, not my day. Fix typo. llvm-svn: 23166	2005-08-31 00:43:49 +00:00
Nate Begeman	d286f16856	Fix a mistake in my previous patch pointed out by sabre; the AssertZext case in MaskedValueIsZero was wrong. llvm-svn: 23165	2005-08-31 00:43:08 +00:00
Nate Begeman	d754412b26	Remove some unnecessary casts, and add the AssertZext case to MaskedValueIsZero. llvm-svn: 23164	2005-08-31 00:27:53 +00:00
Chris Lattner	87d45af685	Allow physregs to occur in the dag with multiple types. Though I don't likethis, it is a requirement on PPC, which can have an f32 value in r3 at onepoint in a function and a f64 value in r3 at another point. :( This fixes compilation of mesa llvm-svn: 23161	2005-08-30 22:38:38 +00:00
Chris Lattner	36461b2e37	When checking the fixed intervals, don't forget to check for register aliases. This fixes PR621 and Regression/CodeGen/X86/2005-08-30-RegAllocAliasProblem.ll llvm-svn: 23158	2005-08-30 21:03:36 +00:00
Chris Lattner	6a990c392c	Fix FreeBench/fourinarow with the dag isel, by not adding a bogus result to SHIFT_PARTS nodes llvm-svn: 23151	2005-08-30 17:21:17 +00:00
Chris Lattner	772c8814b6	Fix a miscompile of PtrDist/bc. Sign extending bools is not the right thing, at least tends to expose problems elsewhere. llvm-svn: 23149	2005-08-30 16:56:19 +00:00
Nate Begeman	25755f7f00	Remove a bogus piece of my AssertSext/AssertZext patch. oops. llvm-svn: 23148	2005-08-30 02:54:28 +00:00
Nate Begeman	dc36f47d99	Add support for AssertSext and AssertZext, folding other extensions with them. This allows for elminination of redundant extends in the entry blocks of functions on PowerPC. Add support for i32 x i32 -> i64 multiplies, by recognizing when the inputs to ISD::MUL in ExpandOp are actually just extended i32 values and not real i64 values. this allows us to codegen int mulhs(int a, int b) { return ((long long)a * b) >> 32; } as: _mulhs: mulhw r3, r4, r3 blr instead of: _mulhs: mulhwu r2, r4, r3 srawi r5, r3, 31 mullw r5, r4, r5 add r2, r2, r5 srawi r4, r4, 31 mullw r3, r4, r3 add r3, r2, r3 blr with a similar improvement on x86. llvm-svn: 23147	2005-08-30 02:44:00 +00:00
Chris Lattner	a611caeec8	Name this variable to be what it really is! llvm-svn: 23145	2005-08-30 01:58:51 +00:00
Chris Lattner	56051a0f92	Handle CopyToReg nodes with flag operands correctly llvm-svn: 23144	2005-08-30 01:57:23 +00:00
Chris Lattner	774b9718dc	Add a hack to avoid some horrible code in some cases by always emitting token chains first. For this C function: int test() { int i; for (i = 0; i < 100000; ++i) foo(); } Instead of emitting this (condition before call) .LBB_test_1: ; no_exit addi r30, r30, 1 lis r2, 1 ori r2, r2, 34464 cmpw cr2, r30, r2 bl L_foo$stub bne cr2, .LBB_test_1 ; no_exit Emit this: .LBB_test_1: ; no_exit bl L_foo$stub addi r30, r30, 1 lis r2, 1 ori r2, r2, 34464 cmpw cr0, r30, r2 bne cr0, .LBB_test_1 ; no_exit Which makes it so we don't have to save/restore cr2 in the prolog/epilog of the function. This also makes the code much more similar to what the pattern isel produces. llvm-svn: 23135	2005-08-29 23:21:29 +00:00
Chris Lattner	32609690c3	Add a new API for Nate llvm-svn: 23131	2005-08-29 21:59:31 +00:00
Andrew Lenharth	f580b078b6	Some of us cared about the the promote path llvm-svn: 23130	2005-08-29 20:46:51 +00:00
Chris Lattner	b0e46fa671	Fix an infinite loop on x86 llvm-svn: 23129	2005-08-29 17:30:00 +00:00
Chris Lattner	21400573a7	Fix a bug in my previous patch that was using the wrong iterator. This fixes Olden/bisort among others. llvm-svn: 23124	2005-08-29 00:10:46 +00:00
Chris Lattner	44dcf508a1	Fix a bug in ReplaceAllUsesWith llvm-svn: 23122	2005-08-28 23:59:36 +00:00
Chris Lattner	e0eae3d244	Disable this code, which broke many tests last night llvm-svn: 23114	2005-08-27 16:16:51 +00:00
Chris Lattner	6bf97cff13	fix PHI node emission for basic blocks that have select_cc's in them on ppc32 llvm-svn: 23113	2005-08-27 00:58:02 +00:00
Chris Lattner	35a82f5f79	Nate noticed that Andrew never did this. This fixes PR600 llvm-svn: 23110	2005-08-26 22:50:40 +00:00
Chris Lattner	e9cc12f5c4	Don't copy regs that are only used in the entry block into a vreg. This changes the code generated for: short %test(short %A) { %B = xor short %A, -32768 ret short %B } to: _test: xori r2, r3, 32768 xoris r2, r2, 65535 extsh r3, r2 blr instead of: _test: rlwinm r2, r3, 0, 16, 31 xori r2, r3, 32768 xoris r2, r2, 65535 extsh r3, r2 blr llvm-svn: 23109	2005-08-26 22:49:59 +00:00
Chris Lattner	5f55dd72af	Make this code safe for when loadRegFromStackSlot inserts multiple instructions. llvm-svn: 23108	2005-08-26 22:18:32 +00:00
Chris Lattner	7efca0c312	Checking types here is not safe, because multiple types can map to the same register class. llvm-svn: 23103	2005-08-26 21:39:15 +00:00
Chris Lattner	faa96209d8	Call the InsertAtEndOfBasicBlock hook if the usesCustomDAGSchedInserter flag is set on an instruction. llvm-svn: 23098	2005-08-26 20:54:47 +00:00
Chris Lattner	3e0bfc0cc1	Revampt ReplaceAllUsesWith to be more efficient and easier to use. llvm-svn: 23087	2005-08-26 18:36:28 +00:00
Chris Lattner	a31708e6b3	Change ConstantPoolSDNode to actually hold the Constant itself instead of putting it into the constant pool. This allows the isel machinery to create constants that it will end up deciding are not needed, without them ending up in the resultant function constant pool. llvm-svn: 23081	2005-08-26 17:15:30 +00:00
Chris Lattner	929c00e9e9	Fix a huge annoyance: SelectNodeTo took types before the opcode unlike every other SD API. Fix it to take the opcode before the types. llvm-svn: 23079	2005-08-26 16:36:26 +00:00
Chris Lattner	6d22117d76	the 5th operand is the 4th number llvm-svn: 23074	2005-08-26 00:43:46 +00:00
Chris Lattner	f25ec1b7b9	Add support for targets that want to custom expand select_cc in some cases. llvm-svn: 23071	2005-08-26 00:23:59 +00:00
Chris Lattner	7e68d39877	Allow LowerOperation to return a null SDOperand in case it wants to lower some things given to it, but not all. llvm-svn: 23070	2005-08-26 00:14:16 +00:00
Chris Lattner	2c3fbbab05	Fix a nasty bug from a previous patch of mine llvm-svn: 23069	2005-08-26 00:13:12 +00:00
Nate Begeman	54f44ad750	New fold for SELECT_CC llvm-svn: 23058	2005-08-25 20:04:38 +00:00
Chris Lattner	18572f3c67	Don't auto-cse nodes that return flags llvm-svn: 23055	2005-08-25 19:12:10 +00:00
Chris Lattner	cb3910fa74	add printer support for flag operands llvm-svn: 23054	2005-08-25 17:59:23 +00:00
Chris Lattner	7c7a447220	simplify the code a bit using isOperationLegal llvm-svn: 23053	2005-08-25 17:54:58 +00:00
Chris Lattner	7598a14e0c	Add support for flag operands llvm-svn: 23050	2005-08-25 17:48:54 +00:00
Chris Lattner	0168c8df11	ADd support for TargetConstantPool nodes llvm-svn: 23041	2005-08-25 05:03:06 +00:00
Chris Lattner	813f6ddaf8	add a new TargetFrameIndex node llvm-svn: 23035	2005-08-25 00:43:01 +00:00
Chris Lattner	22c6c99e5d	add a method llvm-svn: 23027	2005-08-24 23:00:29 +00:00
Chris Lattner	786ec10dfb	Add ReplaceAllUsesWith that can take a vector of replacement values. Add some foldings to hopefully help the illegal setcc issue, and move some code around. llvm-svn: 23025	2005-08-24 22:44:39 +00:00
Chris Lattner	92b560cfee	Add support for external symbols, and support for variable arity instructions llvm-svn: 23022	2005-08-24 22:02:41 +00:00
Chris Lattner	55fb48f5ee	Fix pasto that prevented VT ndoes from showing up in -view-isel-dags correctly llvm-svn: 23021	2005-08-24 18:30:00 +00:00
Chris Lattner	6d4cd33447	teach selection dag mask tracking about the fact that select_cc operates like select. Also teach it that the bit count instructions can only set the low bits of the result, depending on the size of the input. This allows us to compile this: int %eq0(int %a) { %tmp.1 = seteq int %a, 0 ; <bool> [#uses=1] %tmp.2 = cast bool %tmp.1 to int ; <int> [#uses=1] ret int %tmp.2 } To this: _eq0: cntlzw r2, r3 srwi r3, r2, 5 blr instead of this: _eq0: cntlzw r2, r3 rlwinm r3, r2, 27, 31, 31 blr when setcc is marked illegal on ppc (which restores parity to non-illegal setcc). Thanks to Nate for pointing this out. llvm-svn: 23013	2005-08-24 16:46:55 +00:00
Chris Lattner	014e001f23	Start using isOperationLegal and isTypeLegal to simplify the code llvm-svn: 23012	2005-08-24 16:35:28 +00:00
Nate Begeman	2fc750ca45	Teach SelectionDAG how to simplify a few more setcc-equivalent select_cc nodes so that backends don't have to. llvm-svn: 22999	2005-08-24 04:57:57 +00:00
Chris Lattner	64f7f0beac	Make -view-isel-dags show the dag before instruction selecting, in case the target isel crashes due to unimplemented features like calls :) llvm-svn: 22997	2005-08-24 00:34:29 +00:00
Nate Begeman	d4fcf86262	Fix optimization of select_cc seteq X, 0, 1, 0 -> srl (ctlz X), log2 X size llvm-svn: 22995	2005-08-24 00:21:28 +00:00
Chris Lattner	e7c3b71a28	Implement LiveVariables.h change llvm-svn: 22994	2005-08-24 00:09:33 +00:00
Chris Lattner	7e3441972b	adjust to new live variables interface llvm-svn: 22992	2005-08-23 23:42:17 +00:00
Chris Lattner	53b91b741f	Simplify this code by using higher-level LiveVariables methods llvm-svn: 22989	2005-08-23 22:51:41 +00:00
Chris Lattner	610eeca969	Keep track of which registers are related to which other registers. Use this information to avoid doing expensive interval intersections for registers that could not possible be interesting. This speeds up linscan on ia64 compiling kc++ in release mode from taking 7.82s to 4.8s(!), total itanium llc time on this program is 27.3s now. This marginally speeds up PPC and X86, but they appear to be limited by other parts of linscan, not this code. On this program, on itanium, live intervals now takes 41% of llc time. llvm-svn: 22986	2005-08-23 22:27:31 +00:00
Nate Begeman	f1581c11e9	Teach the SelectionDAG how to transform select_cc eq, X, 0, 1, 0 into either seteq X, 0 or srl (ctlz X), size(X-1), depending on what's legal for the target. llvm-svn: 22978	2005-08-23 05:41:12 +00:00
Nate Begeman	885680bafb	Teach Legalize how to turn setcc into select_cc llvm-svn: 22977	2005-08-23 04:29:48 +00:00
Chris Lattner	2c5f36d938	Try to avoid scanning the fixed list. On architectures with a non-stupid number of regs (e.g. most riscs), many functions won't need to use callee clobbered registers. Do a speculative check to see if we can get a free register without processing the fixed list (which has all of these). This saves a lot of time on machines with lots of callee clobbered regs (e.g. ppc and itanium, also x86). This reduces ppc llc compile time from 184s -> 172s on kc++. This is probably worth FAR FAR more on itanium though. llvm-svn: 22972	2005-08-22 20:59:30 +00:00
Chris Lattner	9b0058b424	Move some code in the register assignment case that only needs to happen if we spill out of the fast path. The scan of active_ and the calls to updateSpillWeights don't need to happen unless a spill occurs. This reduces debug llc time of kc++ with ppc from 187.3s to 183.2s. llvm-svn: 22971	2005-08-22 20:20:42 +00:00
Chris Lattner	d73a5042d9	Fix a problem where constant expr shifts would not have their shift amount promoted to the right type. This fixes: IA64/2005-08-22-LegalizerCrash.ll llvm-svn: 22969	2005-08-22 17:28:31 +00:00
Chris Lattner	a9710ba54f	Speed up this loop a bit, based on some observations that Nate made, and add some comments. This loop really needs to be reevaluated! llvm-svn: 22966	2005-08-22 16:55:22 +00:00
Chris Lattner	7ce81741ff	Add a fast-path for register values. Add support for constant pool entries, allowing us to compile this: float %test2(float* %P) { %Q = load float* %P %R = add float %Q, 10.1 ret float %R } to this: _test2: lfs r2, 0(r3) lis r3, ha16(.CPI_test2_0) lfs r3, lo16(.CPI_test2_0)(r3) fadds f1, r2, r3 blr llvm-svn: 22962	2005-08-22 01:04:32 +00:00
Chris Lattner	8927bf468d	add anew method llvm-svn: 22957	2005-08-21 22:30:30 +00:00
Chris Lattner	7a04eff613	Add support for frame index nodes llvm-svn: 22956	2005-08-21 19:56:04 +00:00
Chris Lattner	cbbd212622	add a method llvm-svn: 22955	2005-08-21 19:48:59 +00:00
Chris Lattner	481b47fc75	add a method llvm-svn: 22949	2005-08-21 18:49:33 +00:00
Chris Lattner	3f6df51c19	Add support for basic blocks, fix a bug in result # computation llvm-svn: 22948	2005-08-21 18:49:29 +00:00
Chris Lattner	9bb0d10479	When legalizing brcond ->brcc or select -> selectcc, make sure to truncate the old condition to a one bit value. The incoming value must have been promoted, and the top bits are undefined. This causes us to generate: _test: rlwinm r2, r3, 0, 31, 31 li r3, 17 cmpwi cr0, r2, 0 bne .LBB_test_2 ; .LBB_test_1: ; li r3, 1 .LBB_test_2: ; blr instead of: _test: rlwinm r2, r3, 0, 31, 31 li r2, 17 cmpwi cr0, r3, 0 bne .LBB_test_2 ; .LBB_test_1: ; li r2, 1 .LBB_test_2: ; or r3, r2, r2 blr for: int %test(bool %c) { %retval = select bool %c, int 17, int 1 ret int %retval } llvm-svn: 22947	2005-08-21 18:03:09 +00:00
Chris Lattner	7c3e52ef92	fix bogus warning llvm-svn: 22943	2005-08-20 18:07:27 +00:00
Chris Lattner	5b7488224d	Add support for global address nodes llvm-svn: 22940	2005-08-19 22:38:24 +00:00
Chris Lattner	5210fd0e51	Add support for TargetGlobalAddress nodes llvm-svn: 22938	2005-08-19 22:31:04 +00:00
Chris Lattner	bedf8e757a	Implement CopyFromReg, TokenFactor, and fix a bug in CopyToReg. This allows us to compile stuff like this: double %test(double %A, double %B, double %C, double %E) { %F = mul double %A, %A %G = add double %F, %B %H = sub double -0.0, %G %I = mul double %H, %C %J = add double %I, %E ret double %J } to: _test: fnmadd f0, f1, f1, f2 fmadd f1, f0, f3, f4 blr woot! llvm-svn: 22937	2005-08-19 21:43:53 +00:00
Chris Lattner	b36807b0d0	Fix a bug in previous commit llvm-svn: 22936	2005-08-19 21:34:13 +00:00
Chris Lattner	ac699c4db9	Print physreg register nodes with target names (e.g. F1) instead of numbers llvm-svn: 22934	2005-08-19 21:21:16 +00:00
Chris Lattner	011a721d08	Before implementing copyfromreg, we'll implement copytoreg correctly. This gets us this for the previous testcase: _test: lis r2, 0 ori r3, r2, 65535 blr Note that we actually write to r3 (the return reg) correctly now :) llvm-svn: 22933	2005-08-19 20:50:53 +00:00
Chris Lattner	9af3aaf541	Now that we have operand info for machine instructions, use it to create temporary registers for things that define a register. This allows dag->dag isel to compile this: int %test() { ret int 65535 } into: _test: lis r2, 0 ori r2, r2, 65535 blr Next up, getting CopyFromReg to work, allowing arguments and cross-bb values. llvm-svn: 22932	2005-08-19 20:45:43 +00:00
Jeff Cohen	12674110d5	Fix VC++ constant truncation warning. llvm-svn: 22907	2005-08-19 16:19:21 +00:00
Jeff Cohen	f99748bc0f	Fix VC++ precedence warning. llvm-svn: 22902	2005-08-19 04:39:48 +00:00
Chris Lattner	1207209677	Fix computation of # operands, add a temporary hack for CopyToReg llvm-svn: 22896	2005-08-19 01:01:34 +00:00
Chris Lattner	7b9f02525e	add a new -view-sched-dags option to view dags as they are sent to the scheduler. llvm-svn: 22878	2005-08-18 20:11:49 +00:00
Chris Lattner	62bc771af7	Implement the first chunk of a code emitter. This is sophisticated enough to codegen: _empty: .LBB_empty_0: ; blr but can't do anything more (yet). :) llvm-svn: 22876	2005-08-18 20:07:59 +00:00
Chris Lattner	ebb48e5877	new file, obviously just a stub llvm-svn: 22868	2005-08-18 18:45:24 +00:00
Chris Lattner	5cbeaed711	Enable critical edge splitting by default llvm-svn: 22863	2005-08-18 17:35:14 +00:00
Nate Begeman	474ec3c02d	Add support for target DAG nodes that take 4 operands, such as PowerPC's rlwinm. llvm-svn: 22856	2005-08-18 07:30:15 +00:00
Chris Lattner	d6b9b36616	Fix printing of VTSDNodes llvm-svn: 22853	2005-08-18 03:31:02 +00:00
Jim Laskey	d761e8859d	Move the code dependency for MathExtras.h from SelectionDAGNodes.h. Added some class dividers in SelectionDAG.cpp. llvm-svn: 22841	2005-08-17 20:08:02 +00:00
Jim Laskey	61e3d7bca5	Culling out use of unions for converting FP to bits and vice versa. llvm-svn: 22838	2005-08-17 19:34:49 +00:00
Chris Lattner	a11bdf3abe	Fix a bug in RemoveDeadNodes where it would crash when its "optional" argument is not specified. Implement ReplaceAllUsesWith. llvm-svn: 22834	2005-08-17 19:00:20 +00:00
Jim Laskey	7cdadb13d5	Switched to using BitsToDouble for int_to_float to avoid aliasing problem. llvm-svn: 22831	2005-08-17 17:42:52 +00:00
Jim Laskey	2370cb4e85	Change hex float constants for the sake of VC++. llvm-svn: 22828	2005-08-17 09:44:59 +00:00
Chris Lattner	dbfcba7565	Add a new beta option for critical edge splitting, to avoid a problem that Nate noticed in yacr2 (and I know occurs in other places as well). This is still rough, as the critical edge blocks are not intelligently placed but is added to get some idea to see if this improves performance. llvm-svn: 22825	2005-08-17 06:37:43 +00:00
Chris Lattner	a103a2e9c6	Fix a regression on X86, where FP values can be promoted too. llvm-svn: 22822	2005-08-17 06:06:25 +00:00
Jim Laskey	59b9ee0529	Added generic code expansion for [signed\|unsigned] i32 to [f32\|f64] casts in the legalizer. PowerPC now uses this expansion instead of ISel version. Example: // signed integer to double conversion double f1(signed x) { return (double)x; } // unsigned integer to double conversion double f2(unsigned x) { return (double)x; } // signed integer to float conversion float f3(signed x) { return (float)x; } // unsigned integer to float conversion float f4(unsigned x) { return (float)x; } Byte Code: internal fastcc double %_Z2f1i(int %x) { entry: %tmp.1 = cast int %x to double ; <double> [#uses=1] ret double %tmp.1 } internal fastcc double %_Z2f2j(uint %x) { entry: %tmp.1 = cast uint %x to double ; <double> [#uses=1] ret double %tmp.1 } internal fastcc float %_Z2f3i(int %x) { entry: %tmp.1 = cast int %x to float ; <float> [#uses=1] ret float %tmp.1 } internal fastcc float %_Z2f4j(uint %x) { entry: %tmp.1 = cast uint %x to float ; <float> [#uses=1] ret float %tmp.1 } internal fastcc double %_Z2g1i(int %x) { entry: %buffer = alloca [2 x uint] ; <[2 x uint]> [#uses=3] %tmp.0 = getelementptr [2 x uint] %buffer, int 0, int 0 ; <uint> [#uses=1] store uint 1127219200, uint %tmp.0 %tmp.2 = cast int %x to uint ; <uint> [#uses=1] %tmp.3 = xor uint %tmp.2, 2147483648 ; <uint> [#uses=1] %tmp.5 = getelementptr [2 x uint]* %buffer, int 0, int 1 ; <uint> [#uses=1] store uint %tmp.3, uint %tmp.5 %tmp.9 = cast [2 x uint]* %buffer to double* ; <double> [#uses=1] %tmp.10 = load double %tmp.9 ; <double> [#uses=1] %tmp.13 = load double* cast (long* %signed_bias to double) ; <double> [#uses=1] %tmp.14 = sub double %tmp.10, %tmp.13 ; <double> [#uses=1] ret double %tmp.14 } internal fastcc double %_Z2g2j(uint %x) { entry: %buffer = alloca [2 x uint] ; <[2 x uint]> [#uses=3] %tmp.0 = getelementptr [2 x uint]* %buffer, int 0, int 0 ; <uint> [#uses=1] store uint 1127219200, uint %tmp.0 %tmp.1 = getelementptr [2 x uint]* %buffer, int 0, int 1 ; <uint> [#uses=1] store uint %x, uint %tmp.1 %tmp.4 = cast [2 x uint]* %buffer to double* ; <double> [#uses=1] %tmp.5 = load double %tmp.4 ; <double> [#uses=1] %tmp.8 = load double* cast (long* %unsigned_bias to double) ; <double> [#uses=1] %tmp.9 = sub double %tmp.5, %tmp.8 ; <double> [#uses=1] ret double %tmp.9 } internal fastcc float %_Z2g3i(int %x) { entry: %buffer = alloca [2 x uint] ; <[2 x uint]> [#uses=3] %tmp.0 = getelementptr [2 x uint]* %buffer, int 0, int 0 ; <uint> [#uses=1] store uint 1127219200, uint %tmp.0 %tmp.2 = cast int %x to uint ; <uint> [#uses=1] %tmp.3 = xor uint %tmp.2, 2147483648 ; <uint> [#uses=1] %tmp.5 = getelementptr [2 x uint]* %buffer, int 0, int 1 ; <uint> [#uses=1] store uint %tmp.3, uint %tmp.5 %tmp.9 = cast [2 x uint]* %buffer to double* ; <double> [#uses=1] %tmp.10 = load double %tmp.9 ; <double> [#uses=1] %tmp.13 = load double* cast (long* %signed_bias to double) ; <double> [#uses=1] %tmp.14 = sub double %tmp.10, %tmp.13 ; <double> [#uses=1] %tmp.16 = cast double %tmp.14 to float ; <float> [#uses=1] ret float %tmp.16 } internal fastcc float %_Z2g4j(uint %x) { entry: %buffer = alloca [2 x uint] ; <[2 x uint]> [#uses=3] %tmp.0 = getelementptr [2 x uint]* %buffer, int 0, int 0 ; <uint> [#uses=1] store uint 1127219200, uint %tmp.0 %tmp.1 = getelementptr [2 x uint]* %buffer, int 0, int 1 ; <uint> [#uses=1] store uint %x, uint %tmp.1 %tmp.4 = cast [2 x uint]* %buffer to double* ; <double> [#uses=1] %tmp.5 = load double %tmp.4 ; <double> [#uses=1] %tmp.8 = load double* cast (long* %unsigned_bias to double*) ; <double> [#uses=1] %tmp.9 = sub double %tmp.5, %tmp.8 ; <double> [#uses=1] %tmp.11 = cast double %tmp.9 to float ; <float> [#uses=1] ret float %tmp.11 } PowerPC Code: .machine ppc970 .const .align 2 .CPIl1__Z2f1i_0: ; float 0x4330000080000000 .long 1501560836 ; float 4.5036e+15 .text .align 2 .globl l1__Z2f1i l1__Z2f1i: .LBBl1__Z2f1i_0: ; entry xoris r2, r3, 32768 stw r2, -4(r1) lis r2, 17200 stw r2, -8(r1) lfd f0, -8(r1) lis r2, ha16(.CPIl1__Z2f1i_0) lfs f1, lo16(.CPIl1__Z2f1i_0)(r2) fsub f1, f0, f1 blr .const .align 2 .CPIl2__Z2f2j_0: ; float 0x4330000000000000 .long 1501560832 ; float 4.5036e+15 .text .align 2 .globl l2__Z2f2j l2__Z2f2j: .LBBl2__Z2f2j_0: ; entry stw r3, -4(r1) lis r2, 17200 stw r2, -8(r1) lfd f0, -8(r1) lis r2, ha16(.CPIl2__Z2f2j_0) lfs f1, lo16(.CPIl2__Z2f2j_0)(r2) fsub f1, f0, f1 blr .const .align 2 .CPIl3__Z2f3i_0: ; float 0x4330000080000000 .long 1501560836 ; float 4.5036e+15 .text .align 2 .globl l3__Z2f3i l3__Z2f3i: .LBBl3__Z2f3i_0: ; entry xoris r2, r3, 32768 stw r2, -4(r1) lis r2, 17200 stw r2, -8(r1) lfd f0, -8(r1) lis r2, ha16(.CPIl3__Z2f3i_0) lfs f1, lo16(.CPIl3__Z2f3i_0)(r2) fsub f0, f0, f1 frsp f1, f0 blr .const .align 2 .CPIl4__Z2f4j_0: ; float 0x4330000000000000 .long 1501560832 ; float 4.5036e+15 .text .align 2 .globl l4__Z2f4j l4__Z2f4j: .LBBl4__Z2f4j_0: ; entry stw r3, -4(r1) lis r2, 17200 stw r2, -8(r1) lfd f0, -8(r1) lis r2, ha16(.CPIl4__Z2f4j_0) lfs f1, lo16(.CPIl4__Z2f4j_0)(r2) fsub f0, f0, f1 frsp f1, f0 blr llvm-svn: 22814	2005-08-17 00:39:29 +00:00
Chris Lattner	bd8cbd4951	add a new TargetConstant node llvm-svn: 22813	2005-08-17 00:34:06 +00:00
Chris Lattner	3b7e157005	Eliminate the RegSDNode class, which 3 nodes (CopyFromReg/CopyToReg/ImplicitDef) used to tack a register number onto the node. Instead of doing this, make a new node, RegisterSDNode, which is a leaf containing a register number. These three operations just become normal DAG nodes now, instead of requiring special handling. Note that with this change, it is no longer correct to make illegal CopyFromReg/CopyToReg nodes. The legalizer will not touch them, and this is bad, so don't do it. :) llvm-svn: 22806	2005-08-16 21:55:35 +00:00
Nate Begeman	f6b6378f23	Implement BR_CC and BRTWOWAY_CC. This allows the removal of a rather nasty fixme from the PowerPC backend. Emit slightly better code for legalizing select_cc. llvm-svn: 22805	2005-08-16 19:49:35 +00:00
Chris Lattner	65b9983515	Allow passing a dag into dump and getOperationName. If one is available when printing a node, use it to render target operations with their target instruction name instead of "<<unknown>>". llvm-svn: 22804	2005-08-16 18:33:07 +00:00
Chris Lattner	1b07a165e0	Use a extant helper to do this. llvm-svn: 22802	2005-08-16 18:31:23 +00:00
Chris Lattner	73348d1e89	Add some methods for dag->dag isel. Split RemoveNodeFromCSEMaps out of DeleteNodesIfDead to do it. llvm-svn: 22801	2005-08-16 18:17:10 +00:00
Nate Begeman	54423e60c6	Fix last night's PPC32 regressions by 1. Not selecting the false value of a select_cc in the false arm, which isn't legal for nested selects. 2. Actually returning the node we created and Legalized in the FP_TO_UINT Expander. llvm-svn: 22789	2005-08-14 18:38:32 +00:00
Nate Begeman	9be6a214ff	Teach the legalizer how to legalize FP_TO_UINT. Teach the legalizer to promote FP_TO_UINT to FP_TO_SINT if the wider FP_TO_UINT is also illegal. This allows us on PPC to codegen unsigned short foo(float a) { return a; } as: _foo: .LBB_foo_0: ; entry fctiwz f0, f1 stfd f0, -8(r1) lwz r2, -4(r1) rlwinm r3, r2, 0, 16, 31 blr instead of: _foo: .LBB_foo_0: ; entry fctiwz f0, f1 stfd f0, -8(r1) lwz r2, -4(r1) lis r3, ha16(.CPI_foo_0) lfs f0, lo16(.CPI_foo_0)(r3) fcmpu cr0, f1, f0 blt .LBB_foo_2 ; entry .LBB_foo_1: ; entry fsubs f0, f1, f0 fctiwz f0, f0 stfd f0, -16(r1) lwz r2, -12(r1) xoris r2, r2, 32768 .LBB_foo_2: ; entry rlwinm r3, r2, 0, 16, 31 blr llvm-svn: 22785	2005-08-14 01:20:53 +00:00
Nate Begeman	021a5b3fe1	Remove an unncessary argument to SimplifySelectCC and add an additional assert when creating a select_cc node. llvm-svn: 22780	2005-08-13 06:14:17 +00:00
Nate Begeman	4e8f777256	Fix the fabs regression on x86 by abstracting the select_cc optimization out into SimplifySelectCC. This allows both ISD::SELECT and ISD::SELECT_CC to use the same set of simplifying folds. llvm-svn: 22779	2005-08-13 06:00:21 +00:00
Chris Lattner	e06d2c3760	implement a couple of simple shift foldings. e.g. (X & 7) >> 3 -> 0 llvm-svn: 22774	2005-08-12 23:54:58 +00:00
Nate Begeman	09c56e0432	Add a select_cc optimization for recognizing abs(int). This speeds up an integer MPEG encoding loop by a factor of two. llvm-svn: 22758	2005-08-11 02:18:13 +00:00
Nate Begeman	206e850add	Some SELECT_CC cleanups: 1. move assertions for node creation to getNode() 2. legalize the values returned in ExpandOp immediately 3. Move select_cc optimizations from SELECT's getNode() to SELECT_CC's, allowing them to be cleaned up significantly. This paves the way to pick up additional optimizations on SELECT_CC, such as sum-of-absolute-differences. llvm-svn: 22757	2005-08-11 01:12:20 +00:00
Nate Begeman	eddc9d4856	Add new node, SELECT_CC. This node is for targets that don't natively implement SELECT. llvm-svn: 22755	2005-08-10 20:51:12 +00:00
Chris Lattner	51cf9fd316	Fix an oversight that may be causing PR617. llvm-svn: 22753	2005-08-10 17:37:53 +00:00
Chris Lattner	3179a74493	Fix spelling, fix some broken canonicalizations by my last patch llvm-svn: 22734	2005-08-09 23:09:05 +00:00
Chris Lattner	3290ca9983	add cc nodes to the AllNodes list so they show up in Graphviz output llvm-svn: 22731	2005-08-09 20:40:02 +00:00
Chris Lattner	0fa4402b59	Eliminate the SetCCSDNode in favor of a CondCodeSDNode class. This pulls the CC out of the SetCC operation, making SETCC a standard ternary operation and CC's a standard DAG leaf. This will make it possible for other node to use CC's as operands in the future... llvm-svn: 22728	2005-08-09 20:20:18 +00:00
Chris Lattner	e7f14fb39d	Handle 64-bit constant exprs on 64-bit targets. llvm-svn: 22696	2005-08-08 04:26:32 +00:00
Chris Lattner	fdb467b18d	add a small simplification that can be exposed after promotion/expansion llvm-svn: 22691	2005-08-07 05:00:44 +00:00
Chris Lattner	d3a8084e5b	Change FindEarliestCallSeqEnd (used by libcall insertion) to use a set to avoid revisiting nodes more than once. This eliminates a source of potentially exponential behavior. For a small function in 191.fma3d (hexah_stress_divergence_), this speeds up isel from taking > 20mins to taking 0.07s. llvm-svn: 22680	2005-08-05 18:10:27 +00:00
Chris Lattner	c7a67abac2	Fix a use-of-dangling-pointer bug, from the introduction of SrcValue's. llvm-svn: 22679	2005-08-05 16:55:31 +00:00
Chris Lattner	644edfb51e	Fix a latent bug in the libcall inserter that was exposed by Nate's patch yesterday. This fixes whetstone and a bunch of programs in the External tests. llvm-svn: 22678	2005-08-05 16:23:57 +00:00
Nate Begeman	348caa49b3	Fix a fixme in LegalizeDAG llvm-svn: 22661	2005-08-04 21:43:28 +00:00
Misha Brukman	8b8272b648	* Unbreak release build * Add comments to #endif pragmas for readability llvm-svn: 22647	2005-08-04 14:22:41 +00:00
Chris Lattner	d124203207	Fix PR611, codegen'ing SREM of FP operands to fmod or fmodf instead of the sequence used for integer ops llvm-svn: 22629	2005-08-03 20:31:37 +00:00
Chris Lattner	cc8ae687e1	Update to use the new MathExtras.h support for log2 computation. Patch contributed by Jim Laskey! llvm-svn: 22594	2005-08-02 19:26:06 +00:00
Chris Lattner	83f0262a2c	Fix casts from long to sbyte on ppc llvm-svn: 22570	2005-08-01 18:16:37 +00:00
Jeff Cohen	019104459d	Keep tabs and trailing spaces out. llvm-svn: 22565	2005-07-30 18:33:25 +00:00
Chris Lattner	d742a80e9e	fix float->long conversions on x86 llvm-svn: 22563	2005-07-30 01:40:57 +00:00
Chris Lattner	e0b705ba00	Allow targets to have custom expanders for FP_TO_*INT conversions where both the src and dest values are legal llvm-svn: 22555	2005-07-30 00:04:12 +00:00
Chris Lattner	8d48aef4e3	Allow targets to define custom expanders for FP_TO_*INT llvm-svn: 22548	2005-07-29 00:33:32 +00:00
Chris Lattner	f355c0f6ea	allow a target to request that unknown FP_TO_*INT conversion be promoted to a larger integer destination. llvm-svn: 22547	2005-07-29 00:11:56 +00:00
Chris Lattner	6b4f386826	instead of having all conversions be handled by one case value, and then have subcases inside, break things out earlier. llvm-svn: 22546	2005-07-28 23:31:12 +00:00
Andrew Lenharth	f623af9b64	new is not a valid default anywhere, so make this pure virtual llvm-svn: 22542	2005-07-28 18:13:59 +00:00
Chris Lattner	b0658628c1	Fix debug info to not print out recently freed memory. llvm-svn: 22529	2005-07-27 23:11:25 +00:00
Chris Lattner	1a3a4c7791	Print symbolic register names in debug dumps llvm-svn: 22528	2005-07-27 23:03:38 +00:00
Jeff Cohen	bd51ec7461	Eliminate all remaining tabs and trailing spaces. llvm-svn: 22523	2005-07-27 06:12:32 +00:00
Nate Begeman	a25a2010e3	Remove unnecessary FP_EXTEND. This causes worse codegen for SSE. llvm-svn: 22469	2005-07-19 16:50:03 +00:00
Chris Lattner	d4f9ab3809	The assertion was wrong: the code only worked for i64. While we're at it, expand the code to work for all integer datatypes. This should unbreak alpha. llvm-svn: 22464	2005-07-18 04:31:14 +00:00
Chris Lattner	07d79f8aa7	Only get the .bss and .data sections when needed instead of unconditionally. This allows is to not emit empty sections when .data or .bss is not used. llvm-svn: 22457	2005-07-16 17:41:06 +00:00
Chris Lattner	60bcec0238	Refactor getSection() method to make it easier to use. llvm-svn: 22455	2005-07-16 17:36:04 +00:00
Chris Lattner	40fbf63df8	Major refactor of the ELFWriter code. Instead of building up one big vector that represents the .o file at once, build up a vector for each section of the .o file. This is needed because the .o file writer needs to be able to switch between sections as it emits them (e.g. switch between the .text section and the .rel section when emitting code). This patch has no functionality change. llvm-svn: 22453	2005-07-16 08:01:13 +00:00
Nate Begeman	160c12d896	Teach the legalizer how to promote SINT_TO_FP to a wider SINT_TO_FP that the target natively supports. This eliminates some special-case code from the x86 backend and generates better code as well. For an i8 to f64 conversion, before & after: _x87 before: subl $2, %esp movb 6(%esp), %al movsbw %al, %ax movw %ax, (%esp) filds (%esp) addl $2, %esp ret _x87 after: subl $2, %esp movsbw 6(%esp), %ax movw %ax, (%esp) filds (%esp) addl $2, %esp ret _sse before: subl $12, %esp movb 16(%esp), %al movsbl %al, %eax cvtsi2sd %eax, %xmm0 addl $12, %esp ret _sse after: subl $12, %esp movsbl 16(%esp), %eax cvtsi2sd %eax, %xmm0 addl $12, %esp ret llvm-svn: 22452	2005-07-16 02:02:34 +00:00
Chris Lattner	10da57bfed	Break the code for expanding UINT_TO_FP operations out into its own SelectionDAGLegalize::ExpandLegalUINT_TO_FP method. Add a new method, PromoteLegalUINT_TO_FP, which allows targets to request that UINT_TO_FP operations be promoted to a larger input type. This is useful for targets that have some UINT_TO_FP or SINT_TO_FP operations but not all of them (like X86). The same should be done with SINT_TO_FP, but this patch does not do that yet. llvm-svn: 22447	2005-07-16 00:19:57 +00:00
Chris Lattner	94e486c56e	You can't use config options without config.h llvm-svn: 22446	2005-07-15 22:48:31 +00:00
Chris Lattner	d8eb6ea6da	Make this use the new autoconf support for finding the executables for gv and Graphviz. llvm-svn: 22434	2005-07-14 05:33:13 +00:00
Chris Lattner	d9f1a60c61	As discussed on IRC, this stuff is just for debugging. llvm-svn: 22432	2005-07-14 05:17:43 +00:00
Chris Lattner	61b33e0bc4	If the Graphviz program is available, use it to visualize dot graphs. llvm-svn: 22429	2005-07-14 01:10:55 +00:00
Chris Lattner	aeae45b371	Fix Alpha/2005-07-12-TwoMallocCalls.ll and PR593. It is not safe to call LegalizeOp on something that has already been legalized. Instead, just force another iteration of legalization. This could affect all platforms but X86, as this codepath is dynamically dead on X86 (ISD::MEMSET and friends are legal). llvm-svn: 22419	2005-07-13 02:00:04 +00:00
Chris Lattner	628a248ff9	Fix test/Regression/CodeGen/Generic/2005-07-12-memcpy-i64-length.ll llvm-svn: 22417	2005-07-13 01:42:45 +00:00
Chris Lattner	bec12eb953	Add support for 64-bit elf files llvm-svn: 22400	2005-07-12 06:57:52 +00:00
Jeff Cohen	7bc4266cf1	VC++ demands that the function returns a value llvm-svn: 22393	2005-07-12 02:53:33 +00:00
Chris Lattner	8dd11b0f9c	Clean up code, no functionality changes. llvm-svn: 22382	2005-07-11 06:34:30 +00:00
Chris Lattner	d710b0a025	Emit a symbol table entry for each function we output to the ELF file. This allows objdump to know which function we are emitting to: 00000000 <foo>: <---- 0: b8 01 00 00 00 mov $0x1,%eax 5: 03 44 24 04 add 0x4(%esp,1),%eax 9: c3 ret ... and allows .o files to be useful for linking :) llvm-svn: 22378	2005-07-11 06:17:35 +00:00
Chris Lattner	34d2a2ae23	add code to emit the .text section to the section header. Add a VERY INITIAL machine code emitter class. This is enough to take this C function: int foo(int X) { return X +1; } and make objdump produce the following: $ objdump -d t-llvm.o t-llvm.o: file format elf32-i386 Disassembly of section .text: 00000000 <.text>: 0: b8 01 00 00 00 mov $0x1,%eax 5: 03 44 24 04 add 0x4(%esp,1),%eax 9: c3 ret Anything using branches or refering to the constant pool or requiring relocations will not work yet. llvm-svn: 22375	2005-07-11 05:17:18 +00:00
Chris Lattner	8c10fbf3cc	Use a name mangler object to uniquify names and remove nonstandard characters from them. llvm-svn: 22371	2005-07-11 03:11:47 +00:00
Chris Lattner	6e49696ba6	Change *EXTLOAD to use an VTSDNode operand instead of being an MVTSDNode. This is the last MVTSDNode. This allows us to eliminate a bunch of special case code for handling MVTSDNodes. llvm-svn: 22367	2005-07-10 01:55:33 +00:00
Chris Lattner	273b81e0c0	Change TRUNCSTORE to use a VTSDNode operand instead of being an MVTSTDNode llvm-svn: 22366	2005-07-10 00:29:18 +00:00
Chris Lattner	c355896290	Introduce a new VTSDNode class with the ultimate goal of eliminating the MVTSDNode class. This class is used to provide an operand to operators that require an extra type. We start by converting FP_ROUND_INREG and SIGN_EXTEND_INREG over to using it. llvm-svn: 22364	2005-07-10 00:07:11 +00:00
Chris Lattner	de44e16474	Add support for emitting a .data section and .bss section. Add support for emitting external and .bss symbols. llvm-svn: 22358	2005-07-08 05:47:00 +00:00
Chris Lattner	efccb190b5	Add support for emitting the symbol table (and its string table) of the module to the ELF file. Test it by adding support for emitting common symbols. This allows us to compile this: %X = weak global int 0 %Y = weak global int 0 %Z = weak global int 0 to an elf file that 'readelf's this: Symbol table '.symtab' contains 4 entries: Num: Value Size Type Bind Vis Ndx Name 0: 00000000 0 NOTYPE LOCAL DEFAULT UND 1: 00000004 4 OBJECT GLOBAL DEFAULT COM X 2: 00000004 4 OBJECT GLOBAL DEFAULT COM Y 3: 00000004 4 OBJECT GLOBAL DEFAULT COM Z llvm-svn: 22343	2005-07-07 07:02:20 +00:00
Chris Lattner	bf100c8bdb	Make several cleanups to Andrews varargs change: 1. Pass Value*'s into lowering methods so that the proper pointers can be added to load/stores from the valist 2. Intrinsics that return void should only return a token chain, not a token chain/retval pair. 3. Rename LowerVAArgNext -> LowerVAArg, because VANext is long gone. llvm-svn: 22338	2005-07-05 19:57:53 +00:00
Andrew Lenharth	3543e3b3a9	2 fixes: 1: Legalize operand in UINT_TO_FP expanision 2: SRA x, const i8 was not promoting the constant to shift amount type. llvm-svn: 22337	2005-07-05 19:52:39 +00:00
Andrew Lenharth	c9903eb2cc	I really didn't think this was necessary. But, Legalize wasn't running again and legalizing the extload. Strange. Should fix most alpha regressions. llvm-svn: 22329	2005-07-02 20:58:53 +00:00
Andrew Lenharth	b8c48ce74e	oops llvm-svn: 22320	2005-06-30 19:32:57 +00:00
Andrew Lenharth	04aa18bd2a	FP EXTLOAD is not support on all archs, expand to LOAD and FP_EXTEND llvm-svn: 22319	2005-06-30 19:22:37 +00:00
Andrew Lenharth	898efb338a	restore old srcValueNode behavior and try to to work around it llvm-svn: 22315	2005-06-29 18:54:02 +00:00
Andrew Lenharth	edccb834bb	tracking the instructions causing loads and stores provides more information than just the pointer being loaded or stored llvm-svn: 22311	2005-06-29 15:57:19 +00:00
Andrew Lenharth	d534c5cb2a	Adapt the code for handling uint -> fp conversion for the 32 bit case to handling it in the 64 bit case. The two code paths should probably be merged. llvm-svn: 22302	2005-06-27 23:28:32 +00:00
Chris Lattner	8be1980730	iniital checkin of ELFWriter implementation For now, the elf writer is only capable of emitting an empty elf file, with a section table and a section table string table. This will be enhanced in the future :) llvm-svn: 22291	2005-06-27 06:29:00 +00:00
Andrew Lenharth	4fd2bde906	If we support structs as va_list, we must pass pointers to them to va_copy See last commit for LangRef, this implements it on all targets. llvm-svn: 22273	2005-06-22 21:04:42 +00:00
Andrew Lenharth	a9214fec08	core changes for varargs llvm-svn: 22254	2005-06-18 18:34:52 +00:00
Nate Begeman	ed49a51836	Fix bug 537 test 2, which checks to make sure that we fold A+(B-A) -> B for integer types. Add a couple checks to not perform these kinds of transform on floating point values. llvm-svn: 22228	2005-06-16 07:06:03 +00:00
Duraid Madina	f4ca48c89e	aCC and STLport complained about this, because they're like that llvm-svn: 22053	2005-05-15 13:05:48 +00:00
Chris Lattner	811dc49f55	Add some simplifications for MULH[SU]. This allows us to compile this: long %bar(long %X) { %Y = mul long %X, 4294967297 ret long %Y } to this: l1_bar: mov %EAX, DWORD PTR [%ESP + 4] mov %EDX, %EAX add %EDX, DWORD PTR [%ESP + 8] ret instead of: l1_bar: mov %ECX, DWORD PTR [%ESP + 4] mov %EDX, 1 mov %EAX, %ECX mul %EDX add %EDX, %ECX add %EDX, DWORD PTR [%ESP + 8] mov %EAX, %ECX ret llvm-svn: 22044	2005-05-15 05:39:08 +00:00
Chris Lattner	54bf1cc313	When inserting callee-save register reloads, make sure to skip over any terminator instructions before the 'ret' in case the target has a multi-instruction return sequence. llvm-svn: 22041	2005-05-15 03:09:58 +00:00
Chris Lattner	46de5c99bd	Fix construction of ioport intrinsics, fixing X86/io.llx and io-port.llx llvm-svn: 22026	2005-05-14 13:56:55 +00:00
Chris Lattner	052759b78c	allow token chain at start or end of node llvm-svn: 22020	2005-05-14 08:34:53 +00:00
Chris Lattner	d9e36f94bb	remove special case hacks for readport/readio from the binary operator codepath llvm-svn: 22019	2005-05-14 07:45:46 +00:00
Chris Lattner	d1d8fbee2d	Implement fixme's by memoizing nodes. llvm-svn: 22018	2005-05-14 07:42:29 +00:00
Chris Lattner	ac7d55f114	Turn this into a wrapper for a simpler version of getNode. llvm-svn: 22016	2005-05-14 07:32:14 +00:00
Chris Lattner	a035798c4b	Eliminate special purpose hacks for dynamic_stack_alloc. llvm-svn: 22015	2005-05-14 07:29:57 +00:00
Chris Lattner	b94e243d14	Use the general mechanism for creating multi-value nodes instead of using special case hacks. llvm-svn: 22014	2005-05-14 07:25:05 +00:00
Chris Lattner	ad411081fb	Wrap long line, actually add node to the graph. llvm-svn: 22011	2005-05-14 06:42:57 +00:00
Chris Lattner	6f7b63c7d7	legalize target-specific operations llvm-svn: 22010	2005-05-14 06:34:48 +00:00
Chris Lattner	1afb5ae575	add a getNode() version that allows construction of any node type. llvm-svn: 22009	2005-05-14 06:20:26 +00:00
Chris Lattner	6e81a4090f	LowerOperation takes a dag llvm-svn: 22004	2005-05-14 05:50:48 +00:00
Chris Lattner	369427683d	Print the symbolic register name in a register allocator debug dump. llvm-svn: 22002	2005-05-14 05:34:15 +00:00
Chris Lattner	1202c26d6e	Allow targets to have a custom int64->fp expander if desired llvm-svn: 22001	2005-05-14 05:33:54 +00:00
Chris Lattner	2163eeaa67	Align doubles on 8-byte boundaries if possible. llvm-svn: 21993	2005-05-13 23:14:17 +00:00
Chris Lattner	d9dd5bb798	print stack object alignment in -print-machineinstr dumps llvm-svn: 21992	2005-05-13 22:54:44 +00:00
Chris Lattner	a3e57bd844	Tolerate instrs with extra args llvm-svn: 21982	2005-05-13 21:07:15 +00:00
Chris Lattner	9d788e93a6	Add an isTailCall flag to LowerCallTo llvm-svn: 21958	2005-05-13 18:50:42 +00:00
Chris Lattner	3a76f85d43	Handle TAILCALL node llvm-svn: 21957	2005-05-13 18:43:43 +00:00
Chris Lattner	01eba53a10	Emit function entry code after lowering hte arguments. llvm-svn: 21931	2005-05-13 07:33:32 +00:00
Chris Lattner	fdc4816996	Allow targets to emit code into the entry block of each function llvm-svn: 21930	2005-05-13 07:23:21 +00:00
Chris Lattner	5cd760d12d	allow a virtual register to be associated with live-in values. llvm-svn: 21927	2005-05-13 07:08:07 +00:00
Chris Lattner	670c7f516c	Fix a problem that nate reduced for me. llvm-svn: 21923	2005-05-13 05:17:00 +00:00
Chris Lattner	59bb0edb45	rename variables and functions to match renamed DAG nodes. Bonus feature: I can actually remember which one is which now! llvm-svn: 21922	2005-05-13 05:09:11 +00:00
Chris Lattner	c7013ec3a9	do not call expandop on the same value more than once. This fixes X86/2004-02-22-Casts.llx llvm-svn: 21919	2005-05-13 04:45:13 +00:00
Chris Lattner	51de10e0c6	fix a bad typeo llvm-svn: 21917	2005-05-12 23:51:40 +00:00
Chris Lattner	00d2fb482f	update comment llvm-svn: 21916	2005-05-12 23:24:44 +00:00
Chris Lattner	094bbfcebb	rename the ADJCALLSTACKDOWN/ADJCALLSTACKUP nodes to be CALLSEQ_START/BEGIN. llvm-svn: 21915	2005-05-12 23:24:06 +00:00
Chris Lattner	dd2700de99	Pass calling convention to use into lower call to llvm-svn: 21900	2005-05-12 19:56:57 +00:00
Chris Lattner	ad48ef0a7d	fix expansion of ct[lt]z nodes llvm-svn: 21896	2005-05-12 19:27:51 +00:00
Chris Lattner	6b5bacbc0b	Expand 64-bit ctlz/cttz nodes for 32-bit targets llvm-svn: 21895	2005-05-12 19:05:01 +00:00
Chris Lattner	3677432d39	Fix uint->fp casts on PPC, allowing UnitTests/2005-05-12-Int64ToFP to work on it. llvm-svn: 21894	2005-05-12 18:52:34 +00:00
Chris Lattner	dbcdac1ebf	Allow something to be legalized multiple times. This can be used to reduce legalization iteration llvm-svn: 21892	2005-05-12 16:53:42 +00:00
Chris Lattner	a9a41e8856	Oops, don't do this after we figure out where to insert the call chains. llvm-svn: 21890	2005-05-12 07:00:44 +00:00
Chris Lattner	b58308e6d4	Make sure to expand all nodes, avoiding unintentional node duplication. llvm-svn: 21889	2005-05-12 06:54:21 +00:00
Chris Lattner	9f40cfa0a1	handle a common case generated by the uint64 -> FP code path better llvm-svn: 21888	2005-05-12 06:27:02 +00:00
Chris Lattner	1c248e7462	add fixme llvm-svn: 21887	2005-05-12 06:04:14 +00:00
Chris Lattner	1196356365	Fix a problem where early legalization can cause token chain problems. llvm-svn: 21885	2005-05-12 04:49:08 +00:00
Chris Lattner	b38ffd7fbf	Make legalize a bit more efficient, and canonicalize sub X, C -> add X, -C llvm-svn: 21882	2005-05-12 00:17:04 +00:00
Nate Begeman	e84f776b5d	Necessary changes to codegen cttz efficiently on PowerPC 1. Teach LegalizeDAG how to better legalize CTTZ if the target doesn't have CTPOP, but does have CTLZ 2. Teach PPC32 how to do sub x, const -> add x, -const for valid consts 3. Teach PPC32 how to do and (xor a, -1) b -> andc b, a 4. Teach PPC32 that ISD::CTLZ -> PPC::CNTLZW llvm-svn: 21880	2005-05-11 23:43:56 +00:00
Chris Lattner	8f2d079b36	Fix lowering of ctlz, so now UnitTests/2005-05-11-Popcount-ffs-fls passes with the CBE llvm-svn: 21875	2005-05-11 20:24:12 +00:00
Chris Lattner	303ac68c80	Fix lowering of cttz to work with signed values llvm-svn: 21874	2005-05-11 20:02:14 +00:00
Chris Lattner	330f44f3b6	fix and concisify intinsic lowering for ctpop. Unfortunately, this code looks completely untested. :( llvm-svn: 21873	2005-05-11 19:42:05 +00:00
Chris Lattner	eeeaf45bba	Fix the last remaining bug preventing us from switching the X86 BE over from the simple isel to the pattern isel. This forces inserted libcalls to serialize against other function calls, which was breaking UnitTests/2005-05-12-Int64ToFP. Hopefully this will fix issues on other targets as well. llvm-svn: 21872	2005-05-11 19:02:11 +00:00
Chris Lattner	296754995e	Do not memoize ADJCALLSTACKDOWN nodes, provide a method to hack on them. llvm-svn: 21871	2005-05-11 18:57:39 +00:00
Chris Lattner	74763db128	wrap long line llvm-svn: 21870	2005-05-11 18:57:06 +00:00
Chris Lattner	d76582b540	Make sure to legalize generated ctpop nodes, convert tabs to spaces llvm-svn: 21868	2005-05-11 18:35:21 +00:00
Duraid Madina	8ad9786fcd	expand count-leading/trailing-zeros; the test 2005-05-11-Popcount-ffs-fls.c should now pass (the "LLVM" and "REF" results should be identical) llvm-svn: 21866	2005-05-11 08:45:08 +00:00
Chris Lattner	b452b5aa42	Add some notes for expanding clz/ctz llvm-svn: 21862	2005-05-11 05:27:09 +00:00
Chris Lattner	4f05136f61	Simplify this code, use the proper shift amount llvm-svn: 21861	2005-05-11 05:21:31 +00:00
Chris Lattner	3edc8ecb53	Legalize this correctly llvm-svn: 21859	2005-05-11 05:09:47 +00:00
Chris Lattner	457996c4a6	implement expansion of ctpop nodes, implementing CodeGen/Generic/llvm-ct-intrinsics.ll llvm-svn: 21856	2005-05-11 04:51:16 +00:00
Chris Lattner	ce84b90a3d	Print bit count nodes correctly llvm-svn: 21855	2005-05-11 04:50:30 +00:00
Jeff Cohen	afc58006b7	Silence some VC++ warnings llvm-svn: 21838	2005-05-10 02:22:38 +00:00
Chris Lattner	5edb4c4af6	The semantics of cast X to bool are a comparison against zero, not a truncation! llvm-svn: 21833	2005-05-09 22:17:13 +00:00
Chris Lattner	95c836384b	legalize readio/writeio into a load/store if requested llvm-svn: 21827	2005-05-09 20:36:57 +00:00
Chris Lattner	7cc8edfc30	legalize READPORT, WRITEPORT, READIO, WRITEIO, at least in the basic cases where they are directly supported by the architecture. Wrap a bunch of long lines :( llvm-svn: 21826	2005-05-09 20:23:03 +00:00
Chris Lattner	af6bde0db6	Add support for matching the READPORT, WRITEPORT, READIO, WRITEIO intrinsics llvm-svn: 21825	2005-05-09 20:22:36 +00:00
Chris Lattner	eee649df34	Add support for READPORT, WRITEPORT, READIO, WRITEIO llvm-svn: 21824	2005-05-09 20:22:17 +00:00
Chris Lattner	c3fa88e7c8	Fold shifts into subsequent SHL's. These shifts often arise due to addrses arithmetic lowering. llvm-svn: 21818	2005-05-09 17:06:45 +00:00
Chris Lattner	a1e633ef7a	Don't use the load/store instruction as the source pointer, use the pointer being stored/loaded through! llvm-svn: 21806	2005-05-09 04:28:51 +00:00
Chris Lattner	bfbefe0837	memoize all nodes, even null Value* nodes. Do not add two token chain outputs llvm-svn: 21805	2005-05-09 04:14:13 +00:00
Chris Lattner	b85030373d	wrap long lines llvm-svn: 21804	2005-05-09 04:08:33 +00:00
Chris Lattner	6ffae1a3ec	Print SrcValue nodes correctly llvm-svn: 21803	2005-05-09 04:08:27 +00:00
Chris Lattner	6d85b91b24	Wrap long lines. Fix "warning: conflicting types for built-in function 'memset'" warning from the CBE+GCC. llvm-svn: 21779	2005-05-08 19:46:29 +00:00
Misha Brukman	1996bf6ea5	* Order #includes alphabetically * Remove commented-out debug printouts llvm-svn: 21707	2005-05-05 23:45:17 +00:00
Chris Lattner	6e8167d1c2	When hitting an unsupported intrinsic, actually print it Lower debug info to noops. llvm-svn: 21698	2005-05-05 17:55:17 +00:00
Andrew Lenharth	09c3c4add4	ctpop lowering in legalize llvm-svn: 21697	2005-05-05 15:55:21 +00:00
Andrew Lenharth	9282d00d4f	Make promoteOp work for CT* Proof? ubyte %bar(ubyte %x) { entry: %tmp.1 = call ubyte %llvm.ctlz( ubyte %x ) ret ubyte %tmp.1 } ==> zapnot $16,1,$0 CTLZ $0,$0 subq $0,56,$0 zapnot $0,1,$0 ret $31,($26),1 llvm-svn: 21691	2005-05-04 19:11:05 +00:00
Andrew Lenharth	8b64bd0fd5	Implement count leading zeros (ctlz), count trailing zeros (cttz), and count population (ctpop). Generic lowering is implemented, however only promotion is implemented for SelectionDAG at the moment. More coming soon. llvm-svn: 21676	2005-05-03 17:19:30 +00:00
Alkis Evlogimenos	66f1632de8	Do not use deprecated APIs llvm-svn: 21639	2005-04-30 07:13:31 +00:00
Chris Lattner	fe72cdf838	Codegen and legalize sin/cos/llvm.sqrt as FSIN/FCOS/FSQRT calls. This patch was contributed by Morten Ofstad, with some minor tweaks and bug fixes added by me. llvm-svn: 21636	2005-04-30 04:43:14 +00:00
Chris Lattner	0366e4c0d3	Lower llvm.sqrt -> fsqrt/sqrt llvm-svn: 21629	2005-04-30 04:07:50 +00:00
Chris Lattner	6ec8bb9e8d	Legalize FSQRT, FSIN, FCOS nodes, patch contributed by Morten Ofstad llvm-svn: 21606	2005-04-28 21:44:33 +00:00
Chris Lattner	4678a790e6	Add FSQRT, FSIN, FCOS nodes, patch contributed by Morten Ofstad llvm-svn: 21605	2005-04-28 21:44:03 +00:00
Andrew Lenharth	2a00530fa7	Implement Value* tracking for loads and stores in the selection DAG. This enables one to use alias analysis in the backends. (TRUNK)Stores and (EXT\|ZEXT\|SEXT)Loads have an extra SDOperand which is a SrcValueSDNode which contains the Value. Note that if the operation is introduced by the backend, it will still have the operand, but the value will be null. llvm-svn: 21599	2005-04-27 20:10:01 +00:00
Chris Lattner	15bcc5273b	Fold (X > -1) \| (Y > -1) --> (X&Y > -1) llvm-svn: 21552	2005-04-26 01:18:33 +00:00
Chris Lattner	d8ac4da793	implement some more logical compares with constants, so that: int foo1(int x, int y) { int t1 = x >= 0; int t2 = y >= 0; return t1 & t2; } int foo2(int x, int y) { int t1 = x == -1; int t2 = y == -1; return t1 & t2; } produces: _foo1: or r2, r4, r3 srwi r2, r2, 31 xori r3, r2, 1 blr _foo2: and r2, r4, r3 addic r2, r2, 1 li r2, 0 addze r3, r2 blr instead of: _foo1: srwi r2, r4, 31 xori r2, r2, 1 srwi r3, r3, 31 xori r3, r3, 1 and r3, r2, r3 blr _foo2: addic r2, r4, 1 li r2, 0 addze r2, r2 addic r3, r3, 1 li r3, 0 addze r3, r3 and r3, r2, r3 blr llvm-svn: 21547	2005-04-25 21:20:28 +00:00
Chris Lattner	7931b75a81	Codegen x < 0 \| y < 0 as (x\|y) < 0. This allows us to compile this to: _foo: or r2, r4, r3 srwi r3, r2, 31 blr instead of: _foo: srwi r2, r4, 31 srwi r3, r3, 31 or r3, r2, r3 blr llvm-svn: 21544	2005-04-25 21:03:25 +00:00
Misha Brukman	a9a1982a44	Convert tabs to spaces llvm-svn: 21439	2005-04-22 04:01:18 +00:00
Misha Brukman	774e55c446	Remove trailing whitespace llvm-svn: 21420	2005-04-21 22:36:52 +00:00
Chris Lattner	87fbc1c554	Improve and elimination. On PPC, for: bool %test(int %X) { %Y = and int %X, 8 %Z = setne int %Y, 0 ret bool %Z } we now generate this: rlwinm r2, r3, 0, 28, 28 srwi r3, r2, 3 instead of this: rlwinm r2, r3, 0, 28, 28 srwi r2, r2, 3 rlwinm r3, r2, 0, 31, 31 I'll leave it to Nate to get it down to one instruction. :) --------------------------------------------------------------------- llvm-svn: 21391	2005-04-21 06:28:15 +00:00
Chris Lattner	d0a2fda2c6	Fold (x & 8) != 0 and (x & 8) == 8 into (x & 8) >> 3. This turns this PPC code: rlwinm r2, r3, 0, 28, 28 cmpwi cr7, r2, 8 mfcr r2 rlwinm r3, r2, 31, 31, 31 into this: rlwinm r2, r3, 0, 28, 28 srwi r2, r2, 3 rlwinm r3, r2, 0, 31, 31 Next up, nuking the extra and. llvm-svn: 21390	2005-04-21 06:12:41 +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	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
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
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
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	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	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
Chris Lattner	58f72ab722	promote extload i1 -> extload i8 llvm-svn: 21258	2005-04-12 20:30:10 +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
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
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
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
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	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	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	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
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	31170cd2ec	canonicalize a bunch of operations involving fneg llvm-svn: 21160	2005-04-09 03:02:46 +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	bbe0e9e9db	Remove somethign I had for testing llvm-svn: 21144	2005-04-07 18:58:54 +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
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	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
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
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	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
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
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
Chris Lattner	fcf6ee0a8b	Turn -0.0 - X -> fneg llvm-svn: 21011	2005-04-02 05:04:50 +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	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	893f5729ce	Fix a warning about an unhandled switch case llvm-svn: 20994	2005-04-02 00:41:14 +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	c81870e4e6	print the machine CFG in the -print-machineinstrs dump llvm-svn: 20976	2005-04-01 06:48:38 +00:00
Andrew Lenharth	7db3834ecf	PCMarker support for DAG and Alpha llvm-svn: 20965	2005-03-31 21:24:06 +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	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	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	f821401825	Change interface to LowerCallTo to take a boolean isVarArg argument. llvm-svn: 20842	2005-03-26 01:29:23 +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	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	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
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
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
Alkis Evlogimenos	422af394b6	Lower llvm.isunordered(a, b) into a != a \| b != b. llvm-svn: 20382	2005-03-01 02:07:58 +00:00
Chris Lattner	9ccfcab3db	Lower prefetch to a noop, patch contributed by Justin Wick! llvm-svn: 20375	2005-02-28 19:27:23 +00:00
Chris Lattner	4ba91f5168	Fix a bug in the 'store fpimm, ptr' -> 'store intimm, ptr' handling code. Changing 'op' here caused us to not enter the store into a map, causing reemission of the code!! In practice, a simple loop like this: no_exit: ; preds = %no_exit, %entry %indvar = phi uint [ %indvar.next, %no_exit ], [ 0, %entry ] ; <uint> [#uses=3] %tmp.4 = getelementptr "complex long double"* %P, uint %indvar, uint 0 ; <double> [#uses=1] store double 0.000000e+00, double %tmp.4 %indvar.next = add uint %indvar, 1 ; <uint> [#uses=2] %exitcond = seteq uint %indvar.next, %N ; <bool> [#uses=1] br bool %exitcond, label %return, label %no_exit was being code gen'd to: .LBBtest_1: # no_exit movl %edx, %esi shll $4, %esi movl $0, 4(%eax,%esi) movl $0, (%eax,%esi) incl %edx movl $0, (%eax,%esi) movl $0, 4(%eax,%esi) cmpl %ecx, %edx jne .LBBtest_1 # no_exit Note that we are doing 4 32-bit stores instead of 2. Now we generate: .LBBtest_1: # no_exit movl %edx, %esi incl %esi shll $4, %edx movl $0, (%eax,%edx) movl $0, 4(%eax,%edx) cmpl %ecx, %esi movl %esi, %edx jne .LBBtest_1 # no_exit This is much happier, though it would be even better if the increment of ESI was scheduled after the compare :-/ llvm-svn: 20265	2005-02-22 07:23:39 +00:00
Misha Brukman	381d248dc6	Fix compilation errors with VS 2005, patch by Aaron Gray. llvm-svn: 20231	2005-02-17 21:39:27 +00:00
Chris Lattner	89105cec43	Don't rely on doubles comparing identical to each other, which doesn't work for 0.0 and -0.0. llvm-svn: 20230	2005-02-17 20:17:32 +00:00
Chris Lattner	0de03b45ab	Don't sink argument loads into loops or other bad places. This disables folding of argument loads with instructions that are not in the entry block. llvm-svn: 20228	2005-02-17 19:40:32 +00:00
Chris Lattner	43b14db4d9	Print GEP offsets as signed values instead of unsigned values. On X86, this prints: getelementptr (int* %A, int -1) as: "(A) - 4" instead of "(A) + 18446744073709551612", which makes the assembler much happier. This fixes test/Regression/CodeGen/X86/2005-02-14-IllegalAssembler.ll, and Benchmarks/Prolangs-C/cdecl with LLC on X86. llvm-svn: 20183	2005-02-14 21:40:26 +00:00
Chris Lattner	c808a143af	Fix a case where were incorrectly compiled cast from short to int on 64-bit targets. llvm-svn: 20030	2005-02-04 18:39:19 +00:00
Andrew Lenharth	d2d24eee40	fix constant pointer outputing on 64 bit machines llvm-svn: 20026	2005-02-04 13:47:16 +00:00
Chris Lattner	c3f476e9c2	Fix yet another memset issue. llvm-svn: 19986	2005-02-02 03:44:41 +00:00
Chris Lattner	9cf60e3459	Fix some bugs andrew noticed legalizing memset for alpha llvm-svn: 19969	2005-02-01 18:38:28 +00:00
Chris Lattner	382abe80a0	Improve conformance with the Misha spelling benchmark suite llvm-svn: 19930	2005-01-30 00:09:23 +00:00
Chris Lattner	8200976176	adjust to ilist changes. llvm-svn: 19924	2005-01-29 18:41:25 +00:00
Chris Lattner	2755fb4171	Alpha doesn't have a native f32 extload instruction. llvm-svn: 19880	2005-01-28 22:58:25 +00:00
Chris Lattner	da7b5277c1	implement legalization of truncates whose results and sources need to be truncated, e.g. (truncate:i8 something:i16) on a 32 or 64-bit RISC. llvm-svn: 19879	2005-01-28 22:52:50 +00:00
Chris Lattner	89cac82479	Get alpha working with memset/memcpy/memmove llvm-svn: 19878	2005-01-28 22:29:18 +00:00
Chris Lattner	4134789c8f	CopyFromReg produces two values. Make sure that we remember that both are legalized, and actually return the correct result when we legalize the chain first. llvm-svn: 19866	2005-01-28 06:27:38 +00:00
Chris Lattner	849899e193	Silence optimized warnings. llvm-svn: 19797	2005-01-23 23:19:44 +00:00
Chris Lattner	65fc8007cd	Simplify/speedup the PEI by not having to scan for uses of the callee saved registers. This information is computed directly by the register allocator now. llvm-svn: 19795	2005-01-23 23:13:12 +00:00
Chris Lattner	556679b89d	Update physregsused info. llvm-svn: 19793	2005-01-23 22:55:45 +00:00
Chris Lattner	cc22be2981	Update this pass to set PhysRegsUsed info in MachineFunction. llvm-svn: 19792	2005-01-23 22:51:56 +00:00
Chris Lattner	964297fc32	Update these register allocators to set the PhysRegUsed info in MachineFunction. llvm-svn: 19791	2005-01-23 22:45:13 +00:00
Chris Lattner	6a6d5cf9eb	Add support for the PhysRegsUsed array. llvm-svn: 19789	2005-01-23 22:13:58 +00:00
Chris Lattner	c187b917f2	Speed this up a bit by making ModifiedRegs a vector<char> not vector<bool> llvm-svn: 19787	2005-01-23 21:45:01 +00:00
Chris Lattner	b3a5fc3ec0	Adjust to changes in SelectionDAG interfaces The first half of correct chain insertion for libcalls. This is not enough to fix Fhourstones yet though. llvm-svn: 19781	2005-01-23 04:42:50 +00:00
Chris Lattner	3165569ba9	Remove the 3 HACK HACK HACKs I put in before, fixing them properly with the new TLI that is available. Implement support for handling out of range shifts. This allows us to compile this code (a 64-bit rotate): unsigned long long f3(unsigned long long x) { return (x << 32) \| (x >> (64-32)); } into this: f3: mov %EDX, DWORD PTR [%ESP + 4] mov %EAX, DWORD PTR [%ESP + 8] ret GCC produces this: $ gcc t.c -masm=intel -O3 -S -o - -fomit-frame-pointer .. f3: push %ebx mov %ebx, DWORD PTR [%esp+12] mov %ecx, DWORD PTR [%esp+8] mov %eax, %ebx mov %edx, %ecx pop %ebx ret The Simple ISEL produces (eww gross): f3: sub %ESP, 4 mov DWORD PTR [%ESP], %ESI mov %EDX, DWORD PTR [%ESP + 8] mov %ECX, DWORD PTR [%ESP + 12] mov %EAX, 0 mov %ESI, 0 or %EAX, %ECX or %EDX, %ESI mov %ESI, DWORD PTR [%ESP] add %ESP, 4 ret llvm-svn: 19780	2005-01-23 04:39:44 +00:00
Chris Lattner	4c997d281c	Adjust to changes in SelectionDAG interface. llvm-svn: 19779	2005-01-23 04:36:26 +00:00
Chris Lattner	63ec3c402b	Get this to work for 64-bit systems. llvm-svn: 19763	2005-01-22 23:04:37 +00:00
Chris Lattner	29d6389d78	Implicitly defined registers can clobber callee saved registers too! This fixes the return-address-not-being-saved problem in the Alpha backend. llvm-svn: 19741	2005-01-22 00:49:16 +00:00
Chris Lattner	97f35a7a07	More bugfixes for IA64 shifts. llvm-svn: 19739	2005-01-22 00:33:03 +00:00
Chris Lattner	67deea9d05	Fix problems with non-x86 targets. llvm-svn: 19738	2005-01-22 00:31:52 +00:00
Chris Lattner	42e239ed58	Add a nasty hack to fix Alpha/IA64 multiplies by a power of two. llvm-svn: 19737	2005-01-22 00:20:42 +00:00
Chris Lattner	e724100870	Remove unneeded line. llvm-svn: 19736	2005-01-21 23:43:12 +00:00
Chris Lattner	a974e215a5	test commit llvm-svn: 19735	2005-01-21 23:38:56 +00:00
Chris Lattner	392ddf430b	Unary token factor nodes are unneeded. llvm-svn: 19727	2005-01-21 18:01:22 +00:00
Chris Lattner	07c35617d5	Refactor libcall code a bit. Initial implementation of expanding int -> FP operations for 64-bit integers. llvm-svn: 19724	2005-01-21 06:05:23 +00:00
Chris Lattner	6258ec2e1d	Simplify the shift-expansion code. llvm-svn: 19721	2005-01-20 20:29:23 +00:00
Chris Lattner	c95c7c90c9	Expand add/sub into ADD_PARTS/SUB_PARTS instead of a non-existant libcall. llvm-svn: 19715	2005-01-20 18:52:28 +00:00
Chris Lattner	4086a7a803	implement add_parts/sub_parts. llvm-svn: 19714	2005-01-20 18:50:55 +00:00
Chris Lattner	e7ce5d0e4c	Add missing entry. llvm-svn: 19712	2005-01-20 17:32:28 +00:00
Chris Lattner	e5212a16a2	Support targets that do not use i8 shift amounts. llvm-svn: 19707	2005-01-19 22:31:21 +00:00
Chris Lattner	0e7435bc5b	Add an assertion that would have made more sense to duraid llvm-svn: 19704	2005-01-19 21:32:07 +00:00
Chris Lattner	c662697319	Add support for targets that pass args in registers to calls. llvm-svn: 19703	2005-01-19 20:24:35 +00:00
Chris Lattner	277ac2be70	Fold single use token factor nodes into other token factor nodes. llvm-svn: 19701	2005-01-19 19:10:54 +00:00
Chris Lattner	85e0771f79	Realize the individual pieces of an expanded copytoreg/store/load are independent of each other. llvm-svn: 19700	2005-01-19 18:02:17 +00:00
Chris Lattner	027c97e93e	Know some identities about tokenfactor nodes. llvm-svn: 19699	2005-01-19 18:01:40 +00:00
Chris Lattner	7114e8a527	Know some simple identities. This improves codegen for (1LL << N). llvm-svn: 19698	2005-01-19 17:29:49 +00:00
Chris Lattner	e97ed92617	Just in case, handle something that is both a use and a def. llvm-svn: 19696	2005-01-19 17:11:51 +00:00
Chris Lattner	2cb11bd2b9	When an instruction moves, make sure to update the VarInfo::Kills list as well as all of teh other stuff in livevar. This fixes the compiler crash on fourinarow last night. llvm-svn: 19695	2005-01-19 17:09:15 +00:00
Chris Lattner	408325ffdf	Use the TargetInstrInfo::commuteInstruction method to commute instructions instead of doing it manually. llvm-svn: 19685	2005-01-19 07:08:42 +00:00
Chris Lattner	743a36c818	Implement a way of expanding shifts. This applies to targets that offer select operations or to shifts that are by a constant. This automatically implements (with no special code) all of the special cases for shift by 32, shift by < 32 and shift by > 32. llvm-svn: 19679	2005-01-19 04:19:40 +00:00
Chris Lattner	0df1935505	Zero is cheaper than sign extend. llvm-svn: 19675	2005-01-18 21:57:59 +00:00
Chris Lattner	4360871e16	Fix some fixmes (promoting bools for select and brcond), fix promotion of zero and sign extends. llvm-svn: 19671	2005-01-18 19:27:06 +00:00
Chris Lattner	eea485de1f	Keep track of the retval type as well. llvm-svn: 19670	2005-01-18 19:26:36 +00:00
Chris Lattner	ff086f3016	Teach legalize to promote copy(from\|to)reg, instead of making the isel pass do it. This results in better code on X86 for floats (because if strict precision is not required, we can elide some more expensive double -> float conversions like the old isel did), and allows other targets to emit CopyFromRegs that are not legal for arguments. llvm-svn: 19668	2005-01-18 17:54:55 +00:00
Chris Lattner	891aa537f7	Teach legalize to promote SetCC results. llvm-svn: 19657	2005-01-18 02:59:52 +00:00
Chris Lattner	95307053ec	Allow setcc operations to have nonbool types. llvm-svn: 19656	2005-01-18 02:52:03 +00:00
Chris Lattner	906541da95	Fix the completely broken FP constant folds for setcc's. llvm-svn: 19651	2005-01-18 02:11:55 +00:00
Chris Lattner	c0aca0d13c	Non-volatile loads can be freely reordered against each other. This fixes X86/reg-pressure.ll again, and allows us to do nice things in other cases. For example, we now codegen this sort of thing: int %loadload(int %X, int %Y) { %Z = load int* %Y %Y = load int* %X ;; load between %Z and store %Q = add int %Z, 1 store int %Q, int* %Y ret int %Y } Into this: loadload: mov %EAX, DWORD PTR [%ESP + 4] mov %EAX, DWORD PTR [%EAX] mov %ECX, DWORD PTR [%ESP + 8] inc DWORD PTR [%ECX] ret where we weren't able to form the 'inc [mem]' before. This also lets the instruction selector emit loads in any order it wants to, which can be good for register pressure as well. llvm-svn: 19644	2005-01-17 22:19:26 +00:00
Chris Lattner	49291c4d96	Don't call SelectionDAG.getRoot() directly, go through a forwarding method. llvm-svn: 19642	2005-01-17 19:43:36 +00:00
Chris Lattner	88bbcfc893	Implement a target independent optimization to codegen arguments only into the basic block that uses them if possible. This is a big win on X86, as it lets us fold the argument loads into instructions and reduce register pressure (by not loading all of the arguments in the entry block). For this (contrived to show the optimization) testcase: int %argtest(int %A, int %B) { %X = sub int 12345, %A br label %L L: %Y = add int %X, %B ret int %Y } we used to produce: argtest: mov %ECX, DWORD PTR [%ESP + 4] mov %EAX, 12345 sub %EAX, %ECX mov %EDX, DWORD PTR [%ESP + 8] .LBBargtest_1: # L add %EAX, %EDX ret now we produce: argtest: mov %EAX, 12345 sub %EAX, DWORD PTR [%ESP + 4] .LBBargtest_1: # L add %EAX, DWORD PTR [%ESP + 8] ret This also fixes the FIXME in the code. BTW, this occurs in real code. 164.gzip shrinks from 8623 to 8608 lines of .s file. The stack frame in huft_build shrinks from 1644->1628 bytes, inflate_codes shrinks from 116->108 bytes, and inflate_block from 2620->2612, due to fewer spills. Take that alkis. :-) llvm-svn: 19639	2005-01-17 17:55:19 +00:00
Chris Lattner	49a1f3a109	Refactor code into a new method. llvm-svn: 19635	2005-01-17 17:15:02 +00:00
Chris Lattner	ec55e3e529	Implement legalize of call nodes. llvm-svn: 19617	2005-01-16 19:46:48 +00:00
Chris Lattner	0eca430af1	Revamp supported ops. Instead of just being supported or not, we now keep track of how to deal with it, and provide the target with a hook that they can use to legalize arbitrary operations in arbitrary ways. Implement custom lowering for a couple of ops, implement promotion for select operations (which x86 needs). llvm-svn: 19613	2005-01-16 07:29:19 +00:00
Chris Lattner	835a5efef3	add method stub llvm-svn: 19612	2005-01-16 07:28:41 +00:00
Chris Lattner	907534af24	Don't mash stuff together. llvm-svn: 19611	2005-01-16 07:28:31 +00:00
Chris Lattner	0f4f239899	Implement some more missing promotions. llvm-svn: 19606	2005-01-16 05:06:12 +00:00
Chris Lattner	742b77f9af	Clarify assertion. llvm-svn: 19597	2005-01-16 02:23:34 +00:00
Chris Lattner	4517b8af97	Add assertions. llvm-svn: 19596	2005-01-16 02:23:22 +00:00
Chris Lattner	9f8589f4b3	Add support for promoted registers being live across blocks. llvm-svn: 19595	2005-01-16 02:23:07 +00:00
Chris Lattner	01e2ce8a4c	Move some information into the TargetLowering object. llvm-svn: 19583	2005-01-16 01:11:45 +00:00
Chris Lattner	9762070e50	Use the new TLI method to get this. llvm-svn: 19582	2005-01-16 01:11:19 +00:00
Chris Lattner	0777f84d53	legalize a bunch of operations that I missed. llvm-svn: 19580	2005-01-16 00:38:00 +00:00
Chris Lattner	1de18d422e	Add support for targets that require promotions. llvm-svn: 19579	2005-01-16 00:37:38 +00:00
Chris Lattner	8c4c81d6b3	Fix some serious bugs in promotion. llvm-svn: 19578	2005-01-16 00:17:42 +00:00
Chris Lattner	9785def2cd	Eliminate unneeded extensions. llvm-svn: 19577	2005-01-16 00:17:20 +00:00
Chris Lattner	df02c93d90	Implement promotion of a whole bunch more operators. I think that this is basically everything. llvm-svn: 19576	2005-01-15 22:16:26 +00:00
Chris Lattner	f3fd0c6a93	Print extra type for nodes with extra type info. llvm-svn: 19575	2005-01-15 21:11:37 +00:00
Chris Lattner	1ab9009270	Add support for legalizing FP_ROUND_INREG, SIGN_EXTEND_INREG, and ZERO_EXTEND_INREG for targets that don't support them. llvm-svn: 19573	2005-01-15 07:15:18 +00:00
Chris Lattner	191ac9c589	Common code factored out. llvm-svn: 19572	2005-01-15 07:14:32 +00:00
Chris Lattner	3b20db54f3	implement these methods. llvm-svn: 19571	2005-01-15 06:52:40 +00:00
Chris Lattner	fdd07b4092	Add support for promoting ADD/MUL. Add support for new SIGN_EXTEND_INREG, ZERO_EXTEND_INREG, and FP_ROUND_INREG operators. Realize that if we do any promotions, we need to iterate SelectionDAG construction. llvm-svn: 19569	2005-01-15 06:18:18 +00:00
Chris Lattner	2f65e8798f	Add new SIGN_EXTEND_INREG, ZERO_EXTEND_INREG, and FP_ROUND_INREG operators. llvm-svn: 19568	2005-01-15 06:17:04 +00:00
Chris Lattner	94b8a3e50c	Add intitial support for promoting some operators. llvm-svn: 19565	2005-01-15 05:21:40 +00:00
Chris Lattner	2dfbc4fddd	Adjust to CopyFromReg changes, implement deletion of truncating/extending stores/loads. llvm-svn: 19562	2005-01-14 22:38:01 +00:00
Chris Lattner	0974002024	Start implementing truncating stores and extending loads. llvm-svn: 19559	2005-01-14 22:08:15 +00:00
Chris Lattner	2087f3c8e9	Improve compatibility with acc llvm-svn: 19549	2005-01-14 15:54:24 +00:00
Chris Lattner	7a8788c9ac	Add new ImplicitDef node, rename CopyRegSDNode class to RegSDNode. llvm-svn: 19535	2005-01-13 20:50:02 +00:00
Chris Lattner	9cc534f2dc	Don't forget the existing root. llvm-svn: 19531	2005-01-13 19:53:14 +00:00
Chris Lattner	160fdb384b	Codegen independent ops as being independent. llvm-svn: 19528	2005-01-13 17:59:43 +00:00

... 7 8 9 10 11 ...

2162 Commits