Include dependency graph for Utilities.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Namespaces | |
| circt | |
| This file defines an intermediate representation for circuits acting as an abstraction for constraints defined over an SMT's solver context. | |
| circt::scheduling | |
Typedefs | |
| using | circt::scheduling::HandleOpFn = std::function< LogicalResult(Operation *)> |
Functions | |
| LogicalResult | circt::scheduling::handleOperationsInTopologicalOrder (Problem &prob, HandleOpFn fun) |
Visit prob's operations in topological order, using an internal worklist. More... | |
| LogicalResult | circt::scheduling::computeChainBreakingDependences (ChainingProblem &prob, float cycleTime, SmallVectorImpl< Problem::Dependence > &result) |
Analyse combinational chains in prob's dependence 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 given cycleTime. More... | |
| LogicalResult | circt::scheduling::computeStartTimesInCycle (ChainingProblem &prob) |
Assuming prob is scheduled and contains (integer) start times, this method fills in the start times in cycle in an ASAP fashion. More... | |
| void | circt::scheduling::dumpAsDOT (Problem &prob, StringRef fileName) |
Export prob as a DOT graph into fileName. More... | |
| void | circt::scheduling::dumpAsDOT (Problem &prob, raw_ostream &stream) |
Print prob as a DOT graph onto stream. More... | |
