|
TVM
0.9.4
|
#include <tvm/graph/CallGraph.h>

Classes | |
| struct | Call |
| struct | CompareCall |
| struct | Plan |
Public Member Functions | |
| void | add (std::shared_ptr< internal::Inputs > inputs) |
| void | update () |
| void | execute () const |
| void | clear () |
Protected Member Functions | |
| std::vector< int > | addOutput (abstract::Outputs *source, int output) |
| int | addCall (Call c) |
Protected Attributes | |
| std::vector< std::shared_ptr< internal::Inputs > > | inputs_ |
| std::map< Call, int, CompareCall > | callId_ |
| std::vector< Call > | calls_ |
| internal::DependencyGraph | dependencyGraph_ |
| std::map< std::intptr_t, std::map< int, std::vector< int > > > | visited_ |
| Plan | plan_ |
A Direct Acyclic Graph representing the dependencies between update calls where an edge (from, to) means that from depends on to.
The calls present in the graph depend on the inputs of the Inputs objects added to the graph.
| void tvm::graph::CallGraph::add | ( | std::shared_ptr< internal::Inputs > | inputs | ) |
Add a given Inputs object to the graph
|
protected |
|
protected |
Add a given source and its output to the graph
It has no effect if the source and its output are already in the graph.
| void tvm::graph::CallGraph::clear | ( | ) |
Clear the object.
|
inline |
Execute the plan
| void tvm::graph::CallGraph::update | ( | ) |
Update the plan
|
protected |
Call ids
|
protected |
Dependency graph
|
protected |
Store inputs added to the graph
|
protected |
Store the call plan
|
protected |
Used to avoid duplicate entries in the graph