maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
20,688 Commits 23 Branches 0 Tags 2.2 GiB
Commit Graph

207 Commits

Author SHA1 Message Date
Andrew Lenharth 4b3932aa89 add TargetExternalSymbol 
llvm-svn: 23886
 2005-10-23 03:40:17 +00:00
Nate Begeman 02b23c6065 Move some Legalize functionality over to the DAGCombiner where it belongs. 
Kill some dead code.

llvm-svn: 23706
 2005-10-13 03:11:28 +00:00
Chris Lattner 56e44a6da5 This function is now dead 
llvm-svn: 23684
 2005-10-10 16:49:22 +00:00
Chris Lattner bcfebebf22 Enable Nate's excellent DAG combiner work by default. This allows the 
removal of a bunch of ad-hoc and crufty code from SelectionDAG.cpp.

llvm-svn: 23682
 2005-10-10 16:47:10 +00:00
Chris Lattner 1d3dc00674 (X & Y) & C == 0 if either X&C or Y&C are zero 
llvm-svn: 23678
 2005-10-09 22:12:36 +00:00
Chris Lattner be4bbca0ba remove debugging code 
llvm-svn: 23663
 2005-10-07 15:31:26 +00:00
Chris Lattner fb12624a3f implement CodeGen/PowerPC/div-2.ll:test2-4 by propagating zero bits through 
C-X's

llvm-svn: 23662
 2005-10-07 15:30:32 +00:00
Chris Lattner b27a4147d3 fix indentation 
llvm-svn: 23660
 2005-10-07 06:37:02 +00:00
Chris Lattner 5bcd0dd811 Turn sdivs into udivs when we can prove the sign bits are clear. This 
implements CodeGen/PowerPC/div-2.ll

llvm-svn: 23659
 2005-10-07 06:10:46 +00:00
Nate Begeman 558beb3729 Let the combiner handle more cases 
llvm-svn: 23641
 2005-10-05 21:44:43 +00:00
Chris Lattner a49e16fefa implement visitBR_CC so that PowerPC/inverted-bool-compares.ll passes 
with the dag combiner.  This speeds up espresso by 8%, reaching performance
parity with the dag-combiner-disabled llc.

llvm-svn: 23636
 2005-10-05 06:47:48 +00:00
Chris Lattner b11d15637a fix some pastos 
llvm-svn: 23635
 2005-10-05 06:37:22 +00:00
Chris Lattner 06f1d0f73a Add a new HandleNode class, which is used to handle (haha) cases in the 
dead node elim and dag combiner passes where the root is potentially updated.
This fixes a fixme in the dag combiner.

llvm-svn: 23634
 2005-10-05 06:35:28 +00:00
Chris Lattner 6f3b577ee6 Add FP versions of the binary operators, keeping the int and fp worlds seperate. 
Though I have done extensive testing, it is possible that this will break
things in configs I can't test.  Please let me know if this causes a problem
and I'll fix it ASAP.

llvm-svn: 23504
 2005-09-28 22:28:18 +00:00
Chris Lattner 59a05bdde6 Turn (X^C1) == C2 into X == C1^C2 iff X&~C1 = 0 (and move a function) 
This happens all the time on PPC for bool values, e.g. eliminating a xori
in inverted-bool-compares.ll.

This should be added to the dag combiner as well.

llvm-svn: 23403
 2005-09-23 00:55:52 +00:00
Chris Lattner 331b311f7b 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 16e5cb87ba Fix a crash viewing dags that have target nodes in them 
llvm-svn: 23300
 2005-09-09 22:35:03 +00:00
Nate Begeman 049b748c76 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
Nate Begeman 85c1cc4523 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 2cc2c9a79c 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 fe883adfd2 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
Chris Lattner 821628ff2a Fix a checking failure in gs 
llvm-svn: 23235
 2005-09-03 01:04:40 +00:00
Chris Lattner b95b280bee Make sure to auto-cse nullary ops 
llvm-svn: 23224
 2005-09-02 19:36:17 +00:00
Chris Lattner 1e89e36dcd 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 8c393c218b 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 d78d975437 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
Jeff Cohen d8c84e3c7e Fix VC++ precedence warnings 
llvm-svn: 23169
 2005-08-31 02:47:06 +00:00
Nate Begeman 539e7c892c Sigh, not my day. Fix typo. 
llvm-svn: 23166
 2005-08-31 00:43:49 +00:00
Nate Begeman d513d8a662 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 e07bc28cca Remove some unnecessary casts, and add the AssertZext case to 
MaskedValueIsZero.

llvm-svn: 23164
 2005-08-31 00:27:53 +00:00
Chris Lattner 5764da422a 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
Nate Begeman a3da8c4819 Remove a bogus piece of my AssertSext/AssertZext patch. oops. 
llvm-svn: 23148
 2005-08-30 02:54:28 +00:00
Nate Begeman 43144a2fe0 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 c738d000d5 Add a new API for Nate 
llvm-svn: 23131
 2005-08-29 21:59:31 +00:00
Chris Lattner 87421c8658 Fix a bug in ReplaceAllUsesWith 
llvm-svn: 23122
 2005-08-28 23:59:36 +00:00
Chris Lattner 4a5ebe94ba 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 373f048a79 Revampt ReplaceAllUsesWith to be more efficient and easier to use. 
llvm-svn: 23087
 2005-08-26 18:36:28 +00:00
Chris Lattner c30405e0ee 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 2091a36631 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 1cb550c603 Fix a nasty bug from a previous patch of mine 
llvm-svn: 23069
 2005-08-26 00:13:12 +00:00
Nate Begeman 33840c3268 New fold for SELECT_CC 
llvm-svn: 23058
 2005-08-25 20:04:38 +00:00
Chris Lattner f9c19157df Don't auto-cse nodes that return flags 
llvm-svn: 23055
 2005-08-25 19:12:10 +00:00
Chris Lattner 9d28a56d55 simplify the code a bit using isOperationLegal 
llvm-svn: 23053
 2005-08-25 17:54:58 +00:00
Chris Lattner 407c6415b4 ADd support for TargetConstantPool nodes 
llvm-svn: 23041
 2005-08-25 05:03:06 +00:00
Chris Lattner bbe0e7df2c add a new TargetFrameIndex node 
llvm-svn: 23035
 2005-08-25 00:43:01 +00:00
Chris Lattner 45e1ce4e28 add a method 
llvm-svn: 23027
 2005-08-24 23:00:29 +00:00
Chris Lattner d7ee4d8671 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 86b1658d58 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
Nate Begeman 45bbbb3f11 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
Nate Begeman 72eab5dd5c 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