| CIRCT 22.0.0git
    | 


Go to the source code of this file.
| Namespaces | |
| namespace | circt | 
| The InstanceGraph op interface, see InstanceGraphInterface.td for more details. | |
| namespace | circt::scheduling | 
| Typedefs | |
| using | circt::scheduling::HandleOpFn = std::function< LogicalResult(Operation *)> | 
| Functions | |
| LogicalResult | circt::scheduling::handleOperationsInTopologicalOrder (Problem &prob, HandleOpFn fun) | 
| Visit prob'soperations in topological order, using an internal worklist. | |
| LogicalResult | circt::scheduling::computeChainBreakingDependences (ChainingProblem &prob, float cycleTime, SmallVectorImpl< Problem::Dependence > &result) | 
| Analyse combinational chains in prob'sdependence graph and determine pairs of operations that must be separated by at least one time step in order to prevent the accumulated delays exceeding the givencycleTime. | |
| LogicalResult | circt::scheduling::computeStartTimesInCycle (ChainingProblem &prob) | 
| Assuming probis scheduled and contains (integer) start times, this method fills in the start times in cycle in an ASAP fashion. | |
| void | circt::scheduling::dumpAsDOT (Problem &prob, StringRef fileName) | 
| Export probas a DOT graph intofileName. | |
| void | circt::scheduling::dumpAsDOT (Problem &prob, raw_ostream &stream) | 
| Print probas a DOT graph ontostream. | |