Chris Lattner da4ff69153 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


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@26680 91177308-0d34-0410-b5e6-96231b3b80d8

2006-03-10 05:51:05 +00:00

..

DAGCombiner.cpp

…

LegalizeDAG.cpp

revert the previous patch, didn't mean to check it in yet

2006-03-08 04:39:05 +00:00

Makefile

…

ScheduleDAG.cpp

Change the interface for getting a target HazardRecognizer to be more clean.

2006-03-08 04:25:59 +00:00

ScheduleDAGList.cpp

Teach the latency scheduler some new tricks. In particular, to break ties,

2006-03-10 05:51:05 +00:00

ScheduleDAGSimple.cpp

don't copy all itinerary data

2006-03-09 07:13:00 +00:00

SelectionDAG.cpp

…

SelectionDAGISel.cpp

remove dbg_declare, it's not used yet.

2006-03-09 20:02:42 +00:00

SelectionDAGPrinter.cpp

…

TargetLowering.cpp

…