The data structure for the dependency graph
Declared in <llvm/Transforms/IPO/Attributor.h>
struct AADepGraph;Note that in this graph if there is an edge from A to B (A -> B), then it means that B depends on A, and when the state of A is updated, node B should also be updated
| Name | Description |
|---|---|
DepTy | Dependence edge type used by the graph. |
iterator | Iterator over dependence-graph nodes. |
| Name | Description |
|---|---|
AADepGraph [constructor] | Construct an empty dependence graph. |
~AADepGraph [destructor] | Destroy the dependence graph. |
GetEntryNode | Return the synthetic entry node for SCC iteration. |
begin | Return an iterator to the first graph node. |
dumpGraph | Dump graph to file |
end | Return an iterator past the last graph node. |
print | Print dependency graph |
viewGraph | Open a graphical view of the dependence graph. |
| Name | Description |
|---|---|
DepGetVal | Return the dependence-graph node from edge DT. |
| Name | Description |
|---|---|
SyntheticRoot | Synthetic root node that depends on every real graph node. |