2009-02-06 17:22:58 +00:00
|
|
|
//===---- ScheduleDAGSDNodes.h - SDNode Scheduling --------------*- C++ -*-===//
|
2008-11-19 23:18:57 +00:00
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file implements the ScheduleDAGSDNodes class, which implements
|
|
|
|
// scheduling for an SDNode-based dependency graph.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2009-02-06 17:22:58 +00:00
|
|
|
#ifndef SCHEDULEDAGSDNODES_H
|
|
|
|
#define SCHEDULEDAGSDNODES_H
|
2008-11-19 23:18:57 +00:00
|
|
|
|
|
|
|
#include "llvm/CodeGen/ScheduleDAG.h"
|
|
|
|
#include "llvm/CodeGen/SelectionDAG.h"
|
|
|
|
|
|
|
|
namespace llvm {
|
2008-12-22 21:06:20 +00:00
|
|
|
/// ScheduleDAGSDNodes - A ScheduleDAG for scheduling SDNode-based DAGs.
|
2011-02-04 03:18:17 +00:00
|
|
|
///
|
2008-12-22 21:06:20 +00:00
|
|
|
/// Edges between SUnits are initially based on edges in the SelectionDAG,
|
|
|
|
/// and additional edges can be added by the schedulers as heuristics.
|
|
|
|
/// SDNodes such as Constants, Registers, and a few others that are not
|
|
|
|
/// interesting to schedulers are not allocated SUnits.
|
|
|
|
///
|
2010-12-21 02:38:05 +00:00
|
|
|
/// SDNodes with MVT::Glue operands are grouped along with the flagged
|
2008-12-22 21:06:20 +00:00
|
|
|
/// nodes into a single SUnit so that they are scheduled together.
|
|
|
|
///
|
|
|
|
/// SDNode-based scheduling graphs do not use SDep::Anti or SDep::Output
|
|
|
|
/// edges. Physical register dependence information is not carried in
|
|
|
|
/// the DAG and must be handled explicitly by schedulers.
|
|
|
|
///
|
2008-11-19 23:18:57 +00:00
|
|
|
class ScheduleDAGSDNodes : public ScheduleDAG {
|
|
|
|
public:
|
2009-02-11 04:27:20 +00:00
|
|
|
SelectionDAG *DAG; // DAG of the current basic block
|
2010-09-10 01:29:16 +00:00
|
|
|
const InstrItineraryData *InstrItins;
|
2009-02-11 04:27:20 +00:00
|
|
|
|
2009-01-15 19:20:50 +00:00
|
|
|
explicit ScheduleDAGSDNodes(MachineFunction &mf);
|
2008-11-19 23:18:57 +00:00
|
|
|
|
|
|
|
virtual ~ScheduleDAGSDNodes() {}
|
|
|
|
|
2009-02-11 04:27:20 +00:00
|
|
|
/// Run - perform scheduling.
|
|
|
|
///
|
|
|
|
void Run(SelectionDAG *dag, MachineBasicBlock *bb,
|
|
|
|
MachineBasicBlock::iterator insertPos);
|
|
|
|
|
2008-11-19 23:18:57 +00:00
|
|
|
/// isPassiveNode - Return true if the node is a non-scheduled leaf.
|
|
|
|
///
|
|
|
|
static bool isPassiveNode(SDNode *Node) {
|
|
|
|
if (isa<ConstantSDNode>(Node)) return true;
|
|
|
|
if (isa<ConstantFPSDNode>(Node)) return true;
|
|
|
|
if (isa<RegisterSDNode>(Node)) return true;
|
|
|
|
if (isa<GlobalAddressSDNode>(Node)) return true;
|
|
|
|
if (isa<BasicBlockSDNode>(Node)) return true;
|
|
|
|
if (isa<FrameIndexSDNode>(Node)) return true;
|
|
|
|
if (isa<ConstantPoolSDNode>(Node)) return true;
|
|
|
|
if (isa<JumpTableSDNode>(Node)) return true;
|
|
|
|
if (isa<ExternalSymbolSDNode>(Node)) return true;
|
2009-10-30 01:27:03 +00:00
|
|
|
if (isa<BlockAddressSDNode>(Node)) return true;
|
2010-04-07 05:20:54 +00:00
|
|
|
if (Node->getOpcode() == ISD::EntryToken ||
|
|
|
|
isa<MDNodeSDNode>(Node)) return true;
|
2008-11-19 23:18:57 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// NewSUnit - Creates a new SUnit and return a ptr to it.
|
|
|
|
///
|
2010-05-20 23:26:43 +00:00
|
|
|
SUnit *NewSUnit(SDNode *N);
|
2008-11-19 23:18:57 +00:00
|
|
|
|
|
|
|
/// Clone - Creates a clone of the specified SUnit. It does not copy the
|
|
|
|
/// predecessors / successors info nor the temporary scheduling states.
|
|
|
|
///
|
|
|
|
SUnit *Clone(SUnit *N);
|
2011-02-04 03:18:17 +00:00
|
|
|
|
2008-12-23 18:36:58 +00:00
|
|
|
/// BuildSchedGraph - Build the SUnit graph from the selection dag that we
|
|
|
|
/// 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.
|
2009-10-09 23:33:48 +00:00
|
|
|
virtual void BuildSchedGraph(AliasAnalysis *AA);
|
2008-11-19 23:18:57 +00:00
|
|
|
|
2011-04-07 19:54:57 +00:00
|
|
|
/// InitVRegCycleFlag - Set isVRegCycle if this node's single use is
|
|
|
|
/// CopyToReg and its only active data operands are CopyFromReg within a
|
|
|
|
/// single block loop.
|
|
|
|
///
|
|
|
|
void InitVRegCycleFlag(SUnit *SU);
|
|
|
|
|
2011-02-04 03:18:17 +00:00
|
|
|
/// InitNumRegDefsLeft - Determine the # of regs defined by this node.
|
|
|
|
///
|
|
|
|
void InitNumRegDefsLeft(SUnit *SU);
|
|
|
|
|
2008-11-19 23:18:57 +00:00
|
|
|
/// ComputeLatency - Compute node latency.
|
|
|
|
///
|
|
|
|
virtual void ComputeLatency(SUnit *SU);
|
|
|
|
|
2010-05-20 06:13:19 +00:00
|
|
|
/// ComputeOperandLatency - Override dependence edge latency using
|
|
|
|
/// operand use/def information
|
|
|
|
///
|
|
|
|
virtual void ComputeOperandLatency(SUnit *Def, SUnit *Use,
|
|
|
|
SDep& dep) const { }
|
|
|
|
|
|
|
|
virtual void ComputeOperandLatency(SDNode *Def, SDNode *Use,
|
|
|
|
unsigned OpIdx, SDep& dep) const;
|
|
|
|
|
2010-05-01 00:01:06 +00:00
|
|
|
virtual MachineBasicBlock *EmitSchedule();
|
2008-11-19 23:18:57 +00:00
|
|
|
|
|
|
|
/// Schedule - Order nodes according to selected style, filling
|
|
|
|
/// in the Sequence member.
|
|
|
|
///
|
|
|
|
virtual void Schedule() = 0;
|
|
|
|
|
|
|
|
virtual void dumpNode(const SUnit *SU) const;
|
|
|
|
|
|
|
|
virtual std::string getGraphNodeLabel(const SUnit *SU) const;
|
|
|
|
|
|
|
|
virtual void getCustomGraphFeatures(GraphWriter<ScheduleDAG*> &GW) const;
|
|
|
|
|
2011-02-04 03:18:17 +00:00
|
|
|
/// RegDefIter - In place iteration over the values defined by an
|
|
|
|
/// SUnit. This does not need copies of the iterator or any other STLisms.
|
|
|
|
/// The iterator creates itself, rather than being provided by the SchedDAG.
|
|
|
|
class RegDefIter {
|
|
|
|
const ScheduleDAGSDNodes *SchedDAG;
|
|
|
|
const SDNode *Node;
|
|
|
|
unsigned DefIdx;
|
|
|
|
unsigned NodeNumDefs;
|
|
|
|
EVT ValueType;
|
|
|
|
public:
|
|
|
|
RegDefIter(const SUnit *SU, const ScheduleDAGSDNodes *SD);
|
|
|
|
|
|
|
|
bool IsValid() const { return Node != NULL; }
|
|
|
|
|
|
|
|
EVT GetValue() const {
|
|
|
|
assert(IsValid() && "bad iterator");
|
|
|
|
return ValueType;
|
|
|
|
}
|
|
|
|
|
2011-06-15 23:35:18 +00:00
|
|
|
const SDNode *GetNode() const {
|
|
|
|
return Node;
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned GetIdx() const {
|
2011-06-27 18:34:12 +00:00
|
|
|
return DefIdx-1;
|
2011-06-15 23:35:18 +00:00
|
|
|
}
|
|
|
|
|
2011-02-04 03:18:17 +00:00
|
|
|
void Advance();
|
|
|
|
private:
|
|
|
|
void InitNodeNumDefs();
|
|
|
|
};
|
|
|
|
|
2008-11-19 23:18:57 +00:00
|
|
|
private:
|
2010-01-22 03:36:51 +00:00
|
|
|
/// ClusterNeighboringLoads - Cluster loads from "near" addresses into
|
|
|
|
/// combined SUnits.
|
2010-06-10 02:09:31 +00:00
|
|
|
void ClusterNeighboringLoads(SDNode *Node);
|
|
|
|
/// ClusterNodes - Cluster certain nodes which should be scheduled together.
|
|
|
|
///
|
|
|
|
void ClusterNodes();
|
2010-01-22 03:36:51 +00:00
|
|
|
|
2008-12-23 18:36:58 +00:00
|
|
|
/// BuildSchedUnits, AddSchedEdges - Helper functions for BuildSchedGraph.
|
|
|
|
void BuildSchedUnits();
|
|
|
|
void AddSchedEdges();
|
2008-11-19 23:18:57 +00:00
|
|
|
};
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|