mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-01-10 02:36:06 +00:00
The ScheduleDAG framework now requires an AliasAnalysis argument, though
it isn't needed in the ScheduleDAGSDNodes schedulers. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@83691 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
cda49a0b29
commit
98976e4dcd
@ -23,6 +23,7 @@
|
||||
#include "llvm/ADT/PointerIntPair.h"
|
||||
|
||||
namespace llvm {
|
||||
class AliasAnalysis;
|
||||
class SUnit;
|
||||
class MachineConstantPool;
|
||||
class MachineFunction;
|
||||
@ -490,7 +491,7 @@ namespace llvm {
|
||||
/// BuildSchedGraph - Build SUnits and set up their Preds and Succs
|
||||
/// to form the scheduling dependency graph.
|
||||
///
|
||||
virtual void BuildSchedGraph() = 0;
|
||||
virtual void BuildSchedGraph(AliasAnalysis *AA) = 0;
|
||||
|
||||
/// ComputeLatency - Compute node latency.
|
||||
///
|
||||
|
@ -117,7 +117,7 @@ void ScheduleDAGFast::Schedule() {
|
||||
LiveRegCycles.resize(TRI->getNumRegs(), 0);
|
||||
|
||||
// Build the scheduling graph.
|
||||
BuildSchedGraph();
|
||||
BuildSchedGraph(NULL);
|
||||
|
||||
DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su)
|
||||
SUnits[su].dumpAll(this));
|
||||
|
@ -91,7 +91,7 @@ void ScheduleDAGList::Schedule() {
|
||||
DEBUG(errs() << "********** List Scheduling **********\n");
|
||||
|
||||
// Build the scheduling graph.
|
||||
BuildSchedGraph();
|
||||
BuildSchedGraph(NULL);
|
||||
|
||||
AvailableQueue->initNodes(SUnits);
|
||||
|
||||
|
@ -172,7 +172,7 @@ void ScheduleDAGRRList::Schedule() {
|
||||
LiveRegCycles.resize(TRI->getNumRegs(), 0);
|
||||
|
||||
// Build the scheduling graph.
|
||||
BuildSchedGraph();
|
||||
BuildSchedGraph(NULL);
|
||||
|
||||
DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su)
|
||||
SUnits[su].dumpAll(this));
|
||||
|
@ -230,7 +230,7 @@ void ScheduleDAGSDNodes::AddSchedEdges() {
|
||||
/// are input. This SUnit graph is similar to the SelectionDAG, but
|
||||
/// excludes nodes that aren't interesting to scheduling, and represents
|
||||
/// flagged together nodes with a single SUnit.
|
||||
void ScheduleDAGSDNodes::BuildSchedGraph() {
|
||||
void ScheduleDAGSDNodes::BuildSchedGraph(AliasAnalysis *AA) {
|
||||
// Populate the SUnits array.
|
||||
BuildSchedUnits();
|
||||
// Compute all the scheduling dependencies between nodes.
|
||||
|
@ -86,7 +86,7 @@ namespace llvm {
|
||||
/// are input. This SUnit graph is similar to the SelectionDAG, but
|
||||
/// excludes nodes that aren't interesting to scheduling, and represents
|
||||
/// flagged together nodes with a single SUnit.
|
||||
virtual void BuildSchedGraph();
|
||||
virtual void BuildSchedGraph(AliasAnalysis *AA);
|
||||
|
||||
/// ComputeLatency - Compute node latency.
|
||||
///
|
||||
|
Loading…
x
Reference in New Issue
Block a user