shylie/llvm-project
1
0
Fork 0
Code Issues Pull Requests Actions 6 Packages Projects Releases Wiki Activity
31,724 Commits 1,713 Branches 298 Tags
Commit Graph

1604 Commits

Author SHA1 Message Date
Jim Laskey
63b1419b74 Finally committing to the new scheduler. Still -sched=none by default. 
llvm-svn: 23702
 2005-10-12 18:29:35 +00:00
Chris Lattner
514f058be1 Fix a powerpc crash on CodeGen/Generic/llvm-ct-intrinsics.ll 
llvm-svn: 23694
 2005-10-11 17:56:34 +00:00
Chris Lattner
c38fb8e2a1 Add a canonicalization that got lost, fixing PowerPC/fold-li.ll:SUB 
llvm-svn: 23693
 2005-10-11 06:07:15 +00:00
Chris Lattner
cc6e53e6ee clean up some corner cases 
llvm-svn: 23692
 2005-10-10 23:00:08 +00:00
Chris Lattner
04c737091f Implement trivial DSE. If two stores are neighbors and store to the same 
location, replace them with a new store of the last value.  This occurs
in the same neighborhood in 197.parser, speeding it up about 1.5%

llvm-svn: 23691
 2005-10-10 22:31:19 +00:00
Chris Lattner
e260ed8628 Add support for CombineTo, allowing the dag combiner to replace nodes with 
multiple results.

Use this support to implement trivial store->load forwarding, implementing
CodeGen/PowerPC/store-load-fwd.ll.  Though this is the most simple case and
can be extended in the future, it is still useful.  For example, it speeds
up 197.parser by 6.2% by avoiding an LSU reject in xalloc:

        stw r6, lo16(l5_end_of_array)(r2)
        addi r2, r5, -4
        stwx r5, r4, r2
-       lwzx r5, r4, r2
-       rlwinm r5, r5, 0, 0, 30
        stwx r5, r4, r2
        lwz r2, -4(r4)
        ori r2, r2, 1

llvm-svn: 23690
 2005-10-10 22:04:48 +00:00
Nate Begeman
6828ed9bfd Teach the DAGCombiner several new tricks, teaching it how to turn 
sext_inreg into zext_inreg based on the signbit (fires a lot), srem into
urem, etc.

llvm-svn: 23688
 2005-10-10 21:26:48 +00:00
Chris Lattner
7730924067 Fix comment 
llvm-svn: 23686
 2005-10-10 16:52:03 +00:00
Chris Lattner
3d1d4a3d12 Add ISD::ADD to MaskedValueIsZero 
llvm-svn: 23685
 2005-10-10 16:51:40 +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
6a49b7cabb add a todo for something I noticed 
llvm-svn: 23679
 2005-10-09 22:59:08 +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
0832f2635a When emiting a CopyFromReg and the source is already a vreg, do not bother 
creating a new vreg and inserting a copy: just use the input vreg directly.

This speeds up the compile (e.g. about 5% on mesa with a debug build of llc)
by not adding a bunch of copies and vregs to be coallesced away.  On mesa,
for example, this reduces the number of intervals from 168601 to 129040
going into the coallescer.

llvm-svn: 23671
 2005-10-09 05:58:56 +00:00
Nate Begeman
2042aa5b92 Lo and behold, the last bits of SelectionDAG.cpp have been moved over. 
llvm-svn: 23665
 2005-10-08 00:29:44 +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
Chris Lattner
7bf8d06f02 silence a bogus GCC warning 
llvm-svn: 23646
 2005-10-06 17:39:10 +00:00
Chris Lattner
4bbbb9eed7 Make the legalizer completely non-recursive 
llvm-svn: 23642
 2005-10-06 01:20:27 +00:00
Nate Begeman
558beb3729 Let the combiner handle more cases 
llvm-svn: 23641
 2005-10-05 21:44:43 +00:00
Nate Begeman
f8221c5e2c Remove some bad code from Legalize 
llvm-svn: 23640
 2005-10-05 21:44:10 +00:00
Nate Begeman
bd7df030d2 Check in some more DAGCombiner pieces 
llvm-svn: 23639
 2005-10-05 21:43:42 +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
a6895d180e Implement the code for PowerPC/inverted-bool-compares.ll, even though it 
that testcase still does not pass with the dag combiner.  This is because
not all forms of br* are folded yet.

Also, when we combine a node into another one, delete the node immediately
instead of waiting for the node to potentially come up in the future.

llvm-svn: 23632
 2005-10-05 06:11:08 +00:00
Chris Lattner
6bd8fd09b6 make sure that -view-isel-dags is the input to the isel, not the input to 
the second phase of dag combining

llvm-svn: 23631
 2005-10-05 06:09:10 +00:00
Chris Lattner
746d50a01a Fix a crash compiling Olden/tsp 
llvm-svn: 23630
 2005-10-05 04:45:43 +00:00
Jim Laskey
327d4298e1 Reverting to version - until problem isolated. 
llvm-svn: 23622
 2005-10-04 16:41:51 +00:00
Nate Begeman
5da6908d65 Fix some faulty logic in the libcall inserter. 
Since calls return more than one value, don't bail if one of their uses
happens to be a node that's not an MVT::Other when following the chain
from CALLSEQ_START to CALLSEQ_END.

Once we've found a CALLSEQ_START, we can just return; there's no need to
tail-recurse further up the graph.

Most importantly, just because something only has one use doesn't mean we
should use it's one use to follow from start to end.  This faulty logic
caused us to follow a chain of one-use FP operations back to a much earlier
call, putting a cycle in the graph from a later start to an earlier end.

This is a better fix that reverting to the workaround committed earlier
today.

llvm-svn: 23620
 2005-10-04 02:10:55 +00:00
Nate Begeman
54fb5002e5 Add back a workaround that fixes some breakages from chris's last change. 
Neither of us have yet figured out why this code is necessary, but stuff
breaks if its not there.  Still tracking this down...

llvm-svn: 23617
 2005-10-04 00:37:37 +00:00
Jim Laskey
409a6b204e Refactor gathering node info and emission. 
llvm-svn: 23610
 2005-10-03 12:30:32 +00:00
Chris Lattner
9cfccfb517 Fix a problem where the legalizer would run out of stack space on extremely 
large basic blocks because it was purely recursive.  This switches it to an
iterative/recursive hybrid.

llvm-svn: 23596
 2005-10-02 17:49:46 +00:00
Chris Lattner
7f718e61e8 silence a bogus warning 
llvm-svn: 23595
 2005-10-02 16:30:51 +00:00
Chris Lattner
704d97f8b2 Add assertions to the trivial scheduler to check that the value types match 
up between defs and uses.

llvm-svn: 23590
 2005-10-02 07:10:55 +00:00
Chris Lattner
a038d901fb Codegen CopyFromReg using the regclass that matches the valuetype of the 
destination vreg.

llvm-svn: 23586
 2005-10-02 06:34:16 +00:00
Chris Lattner
5a7bfe0b72 Add some very paranoid checking for operand/result reg class matchup 
For instructions that define multiple results, use the right regclass
to define the result, not always the rc of result #0

llvm-svn: 23580
 2005-10-01 07:45:09 +00:00
Jeff Cohen
f8a5e5ae6e Fix VC++ warnings. 
llvm-svn: 23579
 2005-10-01 03:57:14 +00:00
Chris Lattner
fda6944c5b add a method 
llvm-svn: 23575
 2005-10-01 00:17:07 +00:00
Jim Laskey
d3850457a1 typo 
llvm-svn: 23574
 2005-10-01 00:08:23 +00:00
Jim Laskey
9d96932879 1. Simplify the gathering of node groups. 
2. Printing node groups when displaying nodes.

llvm-svn: 23573
 2005-10-01 00:03:07 +00:00
Jim Laskey
3fe3841c2a 1. Made things node-centric (from operand). 
2. Added node groups to handle flagged nodes.

3. Started weaning simple scheduling off existing emitter.

llvm-svn: 23566
 2005-09-30 19:15:27 +00:00
Chris Lattner
5b2be1f890 Fix two bugs in my patch earlier today that broke int->fp conversion on X86. 
llvm-svn: 23522
 2005-09-29 06:44:39 +00:00
Jeff Cohen
b01a41a06d Silence VC++ redeclaration warnings. 
llvm-svn: 23516
 2005-09-29 01:59:49 +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
0fd8f9fbc9 If the target prefers it, use _setjmp/_longjmp should be used instead of setjmp/longjmp for llvm.setjmp/llvm.longjmp. 
llvm-svn: 23481
 2005-09-27 22:15:53 +00:00
Jim Laskey
63523f98d5 Remove some redundancies. 
llvm-svn: 23469
 2005-09-27 17:32:45 +00:00
Jim Laskey
5f2443c8a3 Addition of a simple two pass scheduler. This version is currently hacked up 
for testing and will require target machine info to do a proper scheduling.
The simple scheduler can be turned on using -sched=simple (defaults
to -sched=none)

llvm-svn: 23455
 2005-09-26 21:57:04 +00:00