RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-20 19:42:54 +02:00
Code Issues Projects Releases Wiki Activity
23,256 Commits 4 Branches 5 Tags 704 MiB
42736d46b2
Commit Graph

2356 Commits

Author SHA1 Message Date
Nate Begeman
42736d46b2 Remove BRTWOWAY* 
Make the PPC backend not dependent on BRTWOWAY_CC and make the branch
selector smarter about the code it generates, fixing a case in the
readme.

llvm-svn: 26814
 2006-03-17 01:40:33 +00:00
Chris Lattner
7e80a5a16b Fix a problem fully scalarizing values. 
llvm-svn: 26811
 2006-03-16 23:05:19 +00:00
Chris Lattner
413bb13b27 Add support for CopyFromReg from vector values. Note: this doesn't support 
illegal vector types yet!

llvm-svn: 26799
 2006-03-16 19:57:50 +00:00
Chris Lattner
34f2e70f60 Teach CreateRegForValue how to handle vector types. 
llvm-svn: 26798
 2006-03-16 19:51:18 +00:00
Chris Lattner
95577cb3cd add support for vector->vector casts 
llvm-svn: 26788
 2006-03-15 22:19:46 +00:00
Chris Lattner
7c8518a21d Add a note, this code should be moved to the dag combiner. 
llvm-svn: 26787
 2006-03-15 22:19:18 +00:00
Jim Laskey
f6494d753a Expand subprogram and added block descriptor. 
llvm-svn: 26782
 2006-03-15 19:09:58 +00:00
Jim Laskey
864fb2f799 1. Use null for serialized empty strings. 
2. Allow for user defined debug descriptors.
3. Allow for user augmented fields on debug descriptors.

llvm-svn: 26760
 2006-03-14 18:37:57 +00:00
Chris Lattner
3b4ceba4ff make sure dead token factor nodes are removed by the dag combiner. 
llvm-svn: 26731
 2006-03-13 18:37:30 +00:00
Jim Laskey
c741139c24 Handle the removal of the debug chain. 
llvm-svn: 26729
 2006-03-13 13:07:37 +00:00
Chris Lattner
3a3c8682b5 Fold X+Y -> X|Y when safe. This implements: 
Regression/CodeGen/PowerPC/and_add.ll

a case that occurs with dynamic allocas of constant size.

llvm-svn: 26727
 2006-03-13 06:51:27 +00:00
Chris Lattner
9d0ebb55a6 add a couple of missing folds 
llvm-svn: 26724
 2006-03-13 06:26:26 +00:00
Chris Lattner
3cb122bfa8 For targets with FABS/FNEG support, lower copysign to an integer load, 
a select and FABS/FNEG.

This speeds up a trivial (aka stupid) copysign benchmark I wrote from 6.73s
to 2.64s, woo.

llvm-svn: 26723
 2006-03-13 06:08:38 +00:00
Chris Lattner
a54a9d83c3 Don't advance the hazard recognizer when there are no hazards and no instructions 
to be emitted.

Don't add one to the latency of a completed instruction if the latency of the
op is 0.

llvm-svn: 26718
 2006-03-12 09:01:41 +00:00
Chris Lattner
aea53fc36f Chain operands aren't real uses: they don't require the full latency of the 
predecessor to finish before they can start.

llvm-svn: 26717
 2006-03-12 03:52:09 +00:00
Chris Lattner
7396b82585 As a pending queue data structure to keep track of instructions whose 
operands have all issued, but whose results are not yet available.  This
allows us to compile:

int G;
int test(int A, int B, int* P) {
   return (G+A)*(B+1);
}

to:

_test:
        lis r2, ha16(L_G$non_lazy_ptr)
        addi r4, r4, 1
        lwz r2, lo16(L_G$non_lazy_ptr)(r2)
        lwz r2, 0(r2)
        add r2, r2, r3
        mullw r3, r2, r4
        blr

instead of this, which has a stall between the lis/lwz:

_test:
        lis r2, ha16(L_G$non_lazy_ptr)
        lwz r2, lo16(L_G$non_lazy_ptr)(r2)
        addi r4, r4, 1
        lwz r2, 0(r2)
        add r2, r2, r3
        mullw r3, r2, r4
        blr

llvm-svn: 26716
 2006-03-12 00:38:57 +00:00
Chris Lattner
62eafde9c1 rename priorityqueue -> availablequeue. When a node is scheduled, remember 
which cycle it lands on.

llvm-svn: 26714
 2006-03-11 22:44:37 +00:00
Chris Lattner
04ada12cb7 Make CurrCycle a local var instead of an instance var 
llvm-svn: 26713
 2006-03-11 22:34:41 +00:00
Chris Lattner
6a9861953b Move some methods around so that BU specific code is together, TD specific code 
is together, and direction independent code is together.

llvm-svn: 26712
 2006-03-11 22:28:35 +00:00
Chris Lattner
40c02c01a5 merge preds/chainpreds -> preds set 
merge succs/chainsuccs -> succs set

This has no functionality change, simplifies the code, and reduces the size
of sunits.

llvm-svn: 26711
 2006-03-11 22:24:20 +00:00
Evan Cheng
57c206232d Added a parameter to control whether Constant::getStringValue() would chop 
off the result string at the first null terminator.

llvm-svn: 26704
 2006-03-10 23:52:03 +00:00
Chris Lattner
02e6c29ad2 scrape out bits of llvm-db 
llvm-svn: 26701
 2006-03-10 22:48:19 +00:00
Chris Lattner
0a64d261e0 Move simple-selector-specific types to the simple selector. 
llvm-svn: 26693
 2006-03-10 07:51:18 +00:00
Chris Lattner
2024573f47 Simplify the interface to the schedulers, to not pass the selected heuristicin. 
llvm-svn: 26692
 2006-03-10 07:49:12 +00:00
Chris Lattner
da5f77e3cf Move some simple-sched-specific instance vars to the simple scheduler. 
llvm-svn: 26690
 2006-03-10 07:42:02 +00:00
Chris Lattner
ec2c5aa0bb prune #includes 
llvm-svn: 26689
 2006-03-10 07:37:35 +00:00
Chris Lattner
808cc02983 move some simple scheduler methods into the simple scheduler 
llvm-svn: 26688
 2006-03-10 07:35:21 +00:00
Chris Lattner
89a5a946f5 Make EmitNode take a SDNode instead of a NodeInfo* 
llvm-svn: 26687
 2006-03-10 07:28:36 +00:00
Chris Lattner
3f870d581e Move the VRBase field from NodeInfo to being a separate, explicit, map. 
llvm-svn: 26686
 2006-03-10 07:25:12 +00:00
Chris Lattner
a316d82d2a no need to build groups anymore 
llvm-svn: 26684
 2006-03-10 07:15:58 +00:00
Chris Lattner
e23afcfd6d Create SUnits directly from the SelectionDAG. 
llvm-svn: 26683
 2006-03-10 07:13:32 +00:00
Chris Lattner
ed528a5652 Push PrepareNodeInfo/IdentifyGroups down the inheritance hierarchy 
llvm-svn: 26682
 2006-03-10 06:34:51 +00:00
Chris Lattner
920325db0a Teach the latency scheduler some new tricks. In particular, to break ties, 
keep track of a sense of "mobility", i.e. how many other nodes scheduling one
node will free up.  For something like this:

float testadd(float *X, float *Y, float *Z, float *W, float *V) {
  return (*X+*Y)*(*Z+*W)+*V;
}

For example, this makes us schedule *X then *Y, not *X then *Z.  The former
allows us to issue the add, the later only lets us issue other loads.

This turns the above code from this:

_testadd:
        lfs f0, 0(r3)
        lfs f1, 0(r6)
        lfs f2, 0(r4)
        lfs f3, 0(r5)
        fadds f0, f0, f2
        fadds f1, f3, f1
        lfs f2, 0(r7)
        fmadds f1, f0, f1, f2
        blr

into this:

_testadd:
        lfs f0, 0(r6)
        lfs f1, 0(r5)
        fadds f0, f1, f0
        lfs f1, 0(r4)
        lfs f2, 0(r3)
        fadds f1, f2, f1
        lfs f2, 0(r7)
        fmadds f1, f1, f0, f2
        blr

llvm-svn: 26680
 2006-03-10 05:51:05 +00:00
Chris Lattner
1bb3ae8dae add an aggregate method for reinserting scheduled nodes, add a callback for 
priority impls that want to be notified when a node is scheduled

llvm-svn: 26678
 2006-03-10 04:32:49 +00:00
Jeff Cohen
5002cf68b4 Fix VC++ build breakage. 
llvm-svn: 26676
 2006-03-10 03:57:45 +00:00
Chris Lattner
dc7268f6a3 remove dbg_declare, it's not used yet. 
llvm-svn: 26659
 2006-03-09 20:02:42 +00:00
Chris Lattner
d00d6b4f23 back out my previous hack 
llvm-svn: 26650
 2006-03-09 17:48:46 +00:00
Chris Lattner
4fe39d8f9e remove temporary option 
llvm-svn: 26646
 2006-03-09 17:31:22 +00:00
Chris Lattner
f6937476d0 temporary hack to get the build working again, apparently a header 
commit was forgotten

llvm-svn: 26642
 2006-03-09 17:11:08 +00:00
Jim Laskey
7fcf238500 Move bit field endianness to backend. 
llvm-svn: 26639
 2006-03-09 13:28:47 +00:00
Chris Lattner
f35a70d050 yes yes, enabled debug output is bad 
llvm-svn: 26637
 2006-03-09 07:39:25 +00:00
Chris Lattner
0020b50bac switch the t-d scheduler to use a really dumb and trivial critical path 
latency priority function.

llvm-svn: 26636
 2006-03-09 07:38:27 +00:00
Chris Lattner
074a604a1b Pull latency information for target instructions out of the latency tables. :) 
Only enable this with -use-sched-latencies, I'll enable it by default with a
clean nightly tester run tonight.

PPC is the only target that provides latency info currently.

llvm-svn: 26634
 2006-03-09 07:15:18 +00:00
Chris Lattner
34bfd7da1f don't copy all itinerary data 
llvm-svn: 26633
 2006-03-09 07:13:00 +00:00
Chris Lattner
b1f716a6d1 PriorityQueue is an instance var, use it. 
llvm-svn: 26632
 2006-03-09 06:48:37 +00:00
Chris Lattner
1d9c1edaa8 add some comments 
llvm-svn: 26631
 2006-03-09 06:37:29 +00:00
Chris Lattner
2dd7bcc95b Refactor the priority mechanism one step further: now that it is a separate 
class, sever its implementation from the interface.  Now we can provide new
implementations of the same interface (priority computation) without touching
the scheduler itself.

llvm-svn: 26630
 2006-03-09 06:35:14 +00:00
Jim Laskey
a1ad999bba Get rid of the multiple copies of getStringValue. Now a Constant:: method. 
llvm-svn: 26616
 2006-03-08 18:11:07 +00:00
Chris Lattner
133ec8c3f0 Split the priority function computation and priority queue management out 
of the ScheduleDAGList class into a new SchedulingPriorityQueue class.

llvm-svn: 26613
 2006-03-08 05:18:27 +00:00
Chris Lattner
46a80382ce switch from an explicitly managed list of SUnits to a simple vector of sunits 
llvm-svn: 26612
 2006-03-08 04:54:34 +00:00