struct AADepGraph

Declaration

struct AADepGraph { /* full declaration omitted */ };

Description

The data structure for the dependency graph 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

Declared at: llvm/include/llvm/Transforms/IPO/Attributor.h:391

Member Variables

public llvm::AADepGraphNode SyntheticRoot
There is no root node for the dependency graph. But the SCCIterator requires a single entry point, so we maintain a fake("synthetic") root node that depends on every node.

Method Overview

Methods

AADepGraph()

Declared at: llvm/include/llvm/Transforms/IPO/Attributor.h:392

static llvm::AADepGraphNode* DepGetVal(
    llvm::AADepGraph::DepTy& DT)

Declared at: llvm/include/llvm/Transforms/IPO/Attributor.h:396

Parameters

llvm::AADepGraph::DepTy& DT

llvm::AADepGraphNode* GetEntryNode()

Declared at: llvm/include/llvm/Transforms/IPO/Attributor.h:404

llvm::AADepGraph::iterator begin()

Declared at: llvm/include/llvm/Transforms/IPO/Attributor.h:406

void dumpGraph()

Description

Dump graph to file

Declared at: llvm/include/llvm/Transforms/IPO/Attributor.h:412

llvm::AADepGraph::iterator end()

Declared at: llvm/include/llvm/Transforms/IPO/Attributor.h:407

void print()

Description

Print dependency graph

Declared at: llvm/include/llvm/Transforms/IPO/Attributor.h:415

void viewGraph()

Declared at: llvm/include/llvm/Transforms/IPO/Attributor.h:409

~AADepGraph()

Declared at: llvm/include/llvm/Transforms/IPO/Attributor.h:393