2009-02-07 01:22:58 +08:00
|
|
|
//===---- ScheduleDAGSDNodes.h - SDNode Scheduling --------------*- C++ -*-===//
|
2008-11-20 07:18:57 +08: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.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2014-08-14 00:26:38 +08:00
|
|
|
#ifndef LLVM_LIB_CODEGEN_SELECTIONDAG_SCHEDULEDAGSDNODES_H
|
|
|
|
#define LLVM_LIB_CODEGEN_SELECTIONDAG_SCHEDULEDAGSDNODES_H
|
2008-11-20 07:18:57 +08:00
|
|
|
|
2017-01-11 09:45:03 +08:00
|
|
|
#include "llvm/CodeGen/ISDOpcodes.h"
|
2013-02-20 08:26:25 +08:00
|
|
|
#include "llvm/CodeGen/MachineBasicBlock.h"
|
2017-01-11 09:45:03 +08:00
|
|
|
#include "llvm/CodeGen/MachineValueType.h"
|
2008-11-20 07:18:57 +08:00
|
|
|
#include "llvm/CodeGen/ScheduleDAG.h"
|
2017-01-11 09:45:03 +08:00
|
|
|
#include "llvm/CodeGen/SelectionDAGNodes.h"
|
|
|
|
#include "llvm/Support/Casting.h"
|
|
|
|
#include <cassert>
|
|
|
|
#include <string>
|
|
|
|
#include <vector>
|
2008-11-20 07:18:57 +08:00
|
|
|
|
|
|
|
namespace llvm {
|
2017-01-11 09:45:03 +08:00
|
|
|
|
|
|
|
class InstrItineraryData;
|
|
|
|
|
2008-12-23 05:06:20 +08:00
|
|
|
/// ScheduleDAGSDNodes - A ScheduleDAG for scheduling SDNode-based DAGs.
|
2011-02-04 11:18:17 +08:00
|
|
|
///
|
2008-12-23 05:06:20 +08: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 10:38:05 +08:00
|
|
|
/// SDNodes with MVT::Glue operands are grouped along with the flagged
|
2008-12-23 05:06:20 +08: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.
|
|
|
|
///
|
2013-09-12 02:05:11 +08:00
|
|
|
class ScheduleDAGSDNodes : public ScheduleDAG {
|
2008-11-20 07:18:57 +08:00
|
|
|
public:
|
2012-03-07 13:21:52 +08:00
|
|
|
MachineBasicBlock *BB;
|
2009-02-11 12:27:20 +08:00
|
|
|
SelectionDAG *DAG; // DAG of the current basic block
|
2010-09-10 09:29:16 +08:00
|
|
|
const InstrItineraryData *InstrItins;
|
2009-02-11 12:27:20 +08:00
|
|
|
|
2012-03-07 13:21:52 +08:00
|
|
|
/// The schedule. Null SUnit*'s represent noop instructions.
|
|
|
|
std::vector<SUnit*> Sequence;
|
|
|
|
|
2009-01-16 03:20:50 +08:00
|
|
|
explicit ScheduleDAGSDNodes(MachineFunction &mf);
|
2008-11-20 07:18:57 +08:00
|
|
|
|
2017-01-11 09:45:03 +08:00
|
|
|
~ScheduleDAGSDNodes() override = default;
|
2008-11-20 07:18:57 +08:00
|
|
|
|
2009-02-11 12:27:20 +08:00
|
|
|
/// Run - perform scheduling.
|
|
|
|
///
|
2012-03-07 13:21:52 +08:00
|
|
|
void Run(SelectionDAG *dag, MachineBasicBlock *bb);
|
2009-02-11 12:27:20 +08:00
|
|
|
|
2008-11-20 07:18:57 +08: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;
|
2012-01-19 07:52:12 +08:00
|
|
|
if (isa<RegisterMaskSDNode>(Node)) return true;
|
2008-11-20 07:18:57 +08:00
|
|
|
if (isa<GlobalAddressSDNode>(Node)) return true;
|
|
|
|
if (isa<BasicBlockSDNode>(Node)) return true;
|
|
|
|
if (isa<FrameIndexSDNode>(Node)) return true;
|
|
|
|
if (isa<ConstantPoolSDNode>(Node)) return true;
|
2012-08-08 06:37:05 +08:00
|
|
|
if (isa<TargetIndexSDNode>(Node)) return true;
|
2008-11-20 07:18:57 +08:00
|
|
|
if (isa<JumpTableSDNode>(Node)) return true;
|
|
|
|
if (isa<ExternalSymbolSDNode>(Node)) return true;
|
2015-06-23 01:46:53 +08:00
|
|
|
if (isa<MCSymbolSDNode>(Node)) return true;
|
2009-10-30 09:27:03 +08:00
|
|
|
if (isa<BlockAddressSDNode>(Node)) return true;
|
2010-04-07 13:20:54 +08:00
|
|
|
if (Node->getOpcode() == ISD::EntryToken ||
|
|
|
|
isa<MDNodeSDNode>(Node)) return true;
|
2008-11-20 07:18:57 +08:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// NewSUnit - Creates a new SUnit and return a ptr to it.
|
|
|
|
///
|
2012-03-08 07:00:49 +08:00
|
|
|
SUnit *newSUnit(SDNode *N);
|
2008-11-20 07:18:57 +08: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 11:18:17 +08:00
|
|
|
|
2008-12-24 02:36:58 +08: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.
|
2012-03-07 08:18:12 +08:00
|
|
|
void BuildSchedGraph(AliasAnalysis *AA);
|
2008-11-20 07:18:57 +08:00
|
|
|
|
2011-02-04 11:18:17 +08:00
|
|
|
/// InitNumRegDefsLeft - Determine the # of regs defined by this node.
|
|
|
|
///
|
|
|
|
void InitNumRegDefsLeft(SUnit *SU);
|
|
|
|
|
2012-03-08 07:00:49 +08:00
|
|
|
/// computeLatency - Compute node latency.
|
2008-11-20 07:18:57 +08:00
|
|
|
///
|
2012-03-08 07:00:49 +08:00
|
|
|
virtual void computeLatency(SUnit *SU);
|
2008-11-20 07:18:57 +08:00
|
|
|
|
2012-03-08 07:00:49 +08:00
|
|
|
virtual void computeOperandLatency(SDNode *Def, SDNode *Use,
|
2010-05-20 14:13:19 +08:00
|
|
|
unsigned OpIdx, SDep& dep) const;
|
|
|
|
|
2008-11-20 07:18:57 +08:00
|
|
|
/// Schedule - Order nodes according to selected style, filling
|
|
|
|
/// in the Sequence member.
|
|
|
|
///
|
|
|
|
virtual void Schedule() = 0;
|
|
|
|
|
2012-03-07 13:21:36 +08:00
|
|
|
/// VerifyScheduledSequence - Verify that all SUnits are scheduled and
|
|
|
|
/// consistent with the Sequence of scheduled instructions.
|
|
|
|
void VerifyScheduledSequence(bool isBottomUp);
|
|
|
|
|
2012-03-07 13:21:44 +08:00
|
|
|
/// EmitSchedule - Insert MachineInstrs into the MachineBasicBlock
|
|
|
|
/// according to the order specified in Sequence.
|
|
|
|
///
|
2012-10-18 03:39:36 +08:00
|
|
|
virtual MachineBasicBlock*
|
|
|
|
EmitSchedule(MachineBasicBlock::iterator &InsertPos);
|
2012-03-07 13:21:44 +08:00
|
|
|
|
2014-03-08 14:31:39 +08:00
|
|
|
void dumpNode(const SUnit *SU) const override;
|
2008-11-20 07:18:57 +08:00
|
|
|
|
2012-03-07 13:21:40 +08:00
|
|
|
void dumpSchedule() const;
|
|
|
|
|
2014-03-08 14:31:39 +08:00
|
|
|
std::string getGraphNodeLabel(const SUnit *SU) const override;
|
2008-11-20 07:18:57 +08:00
|
|
|
|
2014-03-08 14:31:39 +08:00
|
|
|
std::string getDAGName() const override;
|
2012-03-07 08:18:22 +08:00
|
|
|
|
2008-11-20 07:18:57 +08:00
|
|
|
virtual void getCustomGraphFeatures(GraphWriter<ScheduleDAG*> &GW) const;
|
|
|
|
|
2011-02-04 11:18:17 +08: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;
|
2012-12-14 02:45:35 +08:00
|
|
|
MVT ValueType;
|
2017-01-11 09:45:03 +08:00
|
|
|
|
2011-02-04 11:18:17 +08:00
|
|
|
public:
|
|
|
|
RegDefIter(const SUnit *SU, const ScheduleDAGSDNodes *SD);
|
|
|
|
|
2014-04-16 12:21:27 +08:00
|
|
|
bool IsValid() const { return Node != nullptr; }
|
2011-02-04 11:18:17 +08:00
|
|
|
|
2012-12-14 02:45:35 +08:00
|
|
|
MVT GetValue() const {
|
2011-02-04 11:18:17 +08:00
|
|
|
assert(IsValid() && "bad iterator");
|
|
|
|
return ValueType;
|
|
|
|
}
|
|
|
|
|
2011-06-16 07:35:18 +08:00
|
|
|
const SDNode *GetNode() const {
|
|
|
|
return Node;
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned GetIdx() const {
|
2011-06-28 02:34:12 +08:00
|
|
|
return DefIdx-1;
|
2011-06-16 07:35:18 +08:00
|
|
|
}
|
|
|
|
|
2011-02-04 11:18:17 +08:00
|
|
|
void Advance();
|
2017-01-11 09:45:03 +08:00
|
|
|
|
2011-02-04 11:18:17 +08:00
|
|
|
private:
|
|
|
|
void InitNodeNumDefs();
|
|
|
|
};
|
|
|
|
|
2012-10-09 02:53:57 +08:00
|
|
|
protected:
|
|
|
|
/// ForceUnitLatencies - Return true if all scheduling edges should be given
|
|
|
|
/// a latency value of one. The default is to return false; schedulers may
|
|
|
|
/// override this as needed.
|
|
|
|
virtual bool forceUnitLatencies() const { return false; }
|
|
|
|
|
2008-11-20 07:18:57 +08:00
|
|
|
private:
|
2010-01-22 11:36:51 +08:00
|
|
|
/// ClusterNeighboringLoads - Cluster loads from "near" addresses into
|
|
|
|
/// combined SUnits.
|
2010-06-10 10:09:31 +08:00
|
|
|
void ClusterNeighboringLoads(SDNode *Node);
|
|
|
|
/// ClusterNodes - Cluster certain nodes which should be scheduled together.
|
|
|
|
///
|
|
|
|
void ClusterNodes();
|
2010-01-22 11:36:51 +08:00
|
|
|
|
2008-12-24 02:36:58 +08:00
|
|
|
/// BuildSchedUnits, AddSchedEdges - Helper functions for BuildSchedGraph.
|
|
|
|
void BuildSchedUnits();
|
|
|
|
void AddSchedEdges();
|
2012-03-07 13:21:44 +08:00
|
|
|
|
|
|
|
void EmitPhysRegCopy(SUnit *SU, DenseMap<SUnit*, unsigned> &VRBaseMap,
|
|
|
|
MachineBasicBlock::iterator InsertPos);
|
2008-11-20 07:18:57 +08:00
|
|
|
};
|
|
|
|
|
2017-01-11 09:45:03 +08:00
|
|
|
} // end namespace llvm
|
|
|
|
|
|
|
|
#endif // LLVM_LIB_CODEGEN_SELECTIONDAG_SCHEDULEDAGSDNODES_H
|