|
LLVM
4.0.0
|
Internal state used to compute SchedDFSResult. More...
Public Member Functions | |
| SchedDFSImpl (SchedDFSResult &r) | |
| bool | isVisited (const SUnit *SU) const |
| Return true if this node been visited by the DFS traversal. More... | |
| void | visitPreorder (const SUnit *SU) |
| Initialize this node's instruction count. More... | |
| void | visitPostorderNode (const SUnit *SU) |
| Called once for each node after all predecessors are visited. More... | |
| void | visitPostorderEdge (const SDep &PredDep, const SUnit *Succ) |
| Called once for each tree edge after calling visitPostOrderNode on the predecessor. More... | |
| void | visitCrossEdge (const SDep &PredDep, const SUnit *Succ) |
| Add a connection for cross edges. More... | |
| void | finalize () |
| Set each node's subtree ID to the representative ID and record connections between trees. More... | |
Protected Member Functions | |
| bool | joinPredSubtree (const SDep &PredDep, const SUnit *Succ, bool CheckLimit=true) |
| Join the predecessor subtree with the successor that is its DFS parent. More... | |
| void | addConnection (unsigned FromTree, unsigned ToTree, unsigned Depth) |
| Called by finalize() to record a connection between trees. More... | |
Internal state used to compute SchedDFSResult.
Definition at line 1351 of file ScheduleDAGInstrs.cpp.
|
inline |
Definition at line 1374 of file ScheduleDAGInstrs.cpp.
|
inlineprotected |
Called by finalize() to record a connection between trees.
Definition at line 1516 of file ScheduleDAGInstrs.cpp.
References C.
|
inline |
Set each node's subtree ID to the representative ID and record connections between trees.
Definition at line 1452 of file ScheduleDAGInstrs.cpp.
References assert(), llvm::dbgs(), DEBUG, llvm::Depth, llvm::WebAssembly::End, and P.
Referenced by llvm::SchedDFSResult::compute().
Return true if this node been visited by the DFS traversal.
During visitPostorderNode the Node's SubtreeID is assigned to the Node ID. Later, SubtreeID is updated but remains valid.
Definition at line 1382 of file ScheduleDAGInstrs.cpp.
References llvm::SUnit::NodeNum.
Referenced by llvm::SchedDFSResult::compute().
|
inlineprotected |
Join the predecessor subtree with the successor that is its DFS parent.
Apply some heuristics before joining.
Definition at line 1489 of file ScheduleDAGInstrs.cpp.
References assert(), llvm::SDep::getKind(), llvm::SDep::getSUnit(), and llvm::SUnit::NodeNum.
Add a connection for cross edges.
Definition at line 1446 of file ScheduleDAGInstrs.cpp.
References llvm::SDep::getSUnit().
Referenced by llvm::SchedDFSResult::compute().
Called once for each tree edge after calling visitPostOrderNode on the predecessor.
Increment the parent node's instruction count and preemptively join this subtree to its parent's if it is small enough.
Definition at line 1439 of file ScheduleDAGInstrs.cpp.
References llvm::SDep::getSUnit(), and llvm::SUnit::NodeNum.
Referenced by llvm::SchedDFSResult::compute().
Called once for each node after all predecessors are visited.
Revisit this node's predecessors and potentially join them now that we know the ILP of the other predecessors.
Definition at line 1397 of file ScheduleDAGInstrs.cpp.
References llvm::SUnit::getInstr(), llvm::SDep::getKind(), llvm::SDep::getSUnit(), InstrCount, llvm::MachineInstr::isTransient(), llvm::SUnit::NodeNum, and llvm::SUnit::Preds.
Referenced by llvm::SchedDFSResult::compute().
Initialize this node's instruction count.
We don't need to flag the node visited until visitPostorder because the DAG cannot have cycles.
Definition at line 1389 of file ScheduleDAGInstrs.cpp.
References llvm::SUnit::getInstr(), llvm::MachineInstr::isTransient(), and llvm::SUnit::NodeNum.
Referenced by llvm::SchedDFSResult::compute().
1.8.6