llvm::PostOrderExtTraversal< GraphT, SetType > Class Template Reference

Post-order traversal of the graph starting at the root node using an external storage. More...

#include "llvm/ADT/PostOrderIterator.h"

Inheritance diagram for llvm::PostOrderExtTraversal< GraphT, SetType >:

Public Member Functions
	PostOrderExtTraversal (const GraphT &G, SetType &S)
bool	insertEdge (std::optional< NodeRef > From, NodeRef To)
Public Member Functions inherited from llvm::PostOrderTraversalBase< PostOrderExtTraversal< GraphT, SetType >, GraphTraits< GraphT > >
iterator	begin ()
iterator	end ()
bool	insertEdge (std::optional< NodeRef > From, NodeRef To)
	Add edge and return whether To should be visited.
void	finishPostorder (NodeRef)
	Callback just before the iterator moves to the next block.

Additional Inherited Members
Protected Member Functions inherited from llvm::PostOrderTraversalBase< PostOrderExtTraversal< GraphT, SetType >, GraphTraits< GraphT > >
	PostOrderTraversalBase ()=default
PostOrderExtTraversal< GraphT, SetType > *	derived ()
void	init (NodeRef Start)
	Initialize post-order traversal at given start node.

Detailed Description

template<typename GraphT, typename SetType>
class llvm::PostOrderExtTraversal< GraphT, SetType >

Post-order traversal of the graph starting at the root node using an external storage.

This can be used to keep track of visited nodes after the traversal and to skip nodes that are already contained in the set. See PostOrderTraversal for usage restrictions.

Definition at line 230 of file PostOrderIterator.h.

Constructor & Destructor Documentation

PostOrderExtTraversal()

template<typename GraphT, typename SetType>

llvm::PostOrderExtTraversal< GraphT, SetType >::PostOrderExtTraversal ( const GraphT & G, SetType & S )

inline

Definition at line 238 of file PostOrderIterator.h.

References G, and llvm::PostOrderTraversalBase< PostOrderExtTraversal< GraphT, SetType >, GraphTraits< GraphT > >::init().

Member Function Documentation

insertEdge()

template<typename GraphT, typename SetType>

bool llvm::PostOrderExtTraversal< GraphT, SetType >::insertEdge ( std::optional< NodeRef > From, NodeRef To )

inline

Definition at line 242 of file PostOrderIterator.h.

---

The documentation for this class was generated from the following file:

• include/llvm/ADT/PostOrderIterator.h