llvm::AADepGraph Struct Reference

The data structure for the dependency graph. More...

#include "llvm/Transforms/IPO/Attributor.h"

Public Types
using	DepTy = AADepGraphNode::DepTy
using	iterator = mapped_iterator< AADepGraphNode::DepSetTy::iterator, decltype(&DepGetVal)>

Public Member Functions
	AADepGraph ()=default
	~AADepGraph ()=default
AADepGraphNode *	GetEntryNode ()
iterator	begin ()
iterator	end ()
void	viewGraph ()
void	dumpGraph ()
	Dump graph to file.
void	print ()
	Print dependency graph.

Static Public Member Functions
static AADepGraphNode *	DepGetVal (const DepTy &DT)

Public Attributes
AADepGraphNode	SyntheticRoot
	There is no root node for the dependency graph.

Detailed 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

Definition at line 550 of file Attributor.h.

Member Typedef Documentation

DepTy

using llvm::AADepGraph::DepTy = AADepGraphNode::DepTy

Definition at line 554 of file Attributor.h.

iterator

using llvm::AADepGraph::iterator = mapped_iterator<AADepGraphNode::DepSetTy::iterator, decltype(&DepGetVal)>

Definition at line 556 of file Attributor.h.

Constructor & Destructor Documentation

AADepGraph()

llvm::AADepGraph::AADepGraph ( )

default

~AADepGraph()

llvm::AADepGraph::~AADepGraph ( )

default

Member Function Documentation

begin()

iterator llvm::AADepGraph::begin ( )

inline

Definition at line 565 of file Attributor.h.

References llvm::AADepGraphNode::child_begin(), and SyntheticRoot.

Referenced by llvm::GraphTraits< AADepGraph * >::nodes_begin().

DepGetVal()

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

inlinestatic

Definition at line 555 of file Attributor.h.

dumpGraph()

void AADepGraph::dumpGraph

(

)

Dump graph to file.

Definition at line 3988 of file Attributor.cpp.

References DepGraphDotFileNamePrefix, llvm::sys::fs::OF_TextWithCRLF, llvm::outs(), and llvm::WriteGraph().

Referenced by llvm::Attributor::run().

end()

iterator llvm::AADepGraph::end ( )

inline

Definition at line 566 of file Attributor.h.

References llvm::AADepGraphNode::child_end(), and SyntheticRoot.

Referenced by llvm::GraphTraits< AADepGraph * >::nodes_end().

GetEntryNode()

AADepGraphNode * llvm::AADepGraph::GetEntryNode ( )

inline

Definition at line 563 of file Attributor.h.

References SyntheticRoot.

Referenced by llvm::GraphTraits< AADepGraph * >::getEntryNode().

print()

void AADepGraph::print

(

)

Print dependency graph.

Definition at line 4010 of file Attributor.cpp.

References llvm::AADepGraphNode::Deps, llvm::outs(), and SyntheticRoot.

Referenced by llvm::Attributor::run().

viewGraph()

void AADepGraph::viewGraph

(

)

Definition at line 3986 of file Attributor.cpp.

References llvm::ViewGraph().

Referenced by llvm::Attributor::run().

Member Data Documentation

SyntheticRoot

AADepGraphNode llvm::AADepGraph::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.

Definition at line 562 of file Attributor.h.

Referenced by begin(), end(), GetEntryNode(), print(), and llvm::Attributor::registerAA().

---

The documentation for this struct was generated from the following files:

• include/llvm/Transforms/IPO/Attributor.h
• lib/Transforms/IPO/Attributor.cpp