llvm::AADepGraph

Synopsis

Declared in <llvm/Transforms/IPO/Attributor.h>

struct AADepGraph;

Description

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

Type Aliases

Name
`DepTy`
`iterator`

Member Functions

Name	Description
`AADepGraph` [constructor]	Default constructor
`~AADepGraph` [destructor]	Destructor
`GetEntryNode`
`begin`
`dumpGraph`	Dump graph to file
`end`
`print`	Print dependency graph
`viewGraph`

Static Member Functions

Name
`DepGetVal`

Data Members

Name	Description
`SyntheticRoot`	There is no root node for the dependency graph.