LLVM 20.0.0git
|
#include "llvm/ADT/DepthFirstIterator.h"
Public Member Functions | |
idf_ext_iterator (const idf_iterator< T, SetTy, true > &V) | |
idf_ext_iterator (const df_iterator< Inverse< T >, SetTy, true > &V) | |
Public Member Functions inherited from llvm::idf_iterator< T, SetTy, External > | |
idf_iterator (const df_iterator< Inverse< T >, SetTy, External > &V) | |
Public Member Functions inherited from llvm::df_iterator< GraphT, SetType, ExtStorage, GT > | |
bool | operator== (const df_iterator &x) const |
bool | operator!= (const df_iterator &x) const |
reference | operator* () const |
NodeRef | operator-> () const |
df_iterator & | operator++ () |
df_iterator & | skipChildren () |
Skips all children of the current node and traverses to next node. | |
df_iterator | operator++ (int) |
bool | nodeVisited (NodeRef Node) const |
unsigned | getPathLength () const |
getPathLength - Return the length of the path from the entry node to the current node, counting both nodes. | |
NodeRef | getPath (unsigned n) const |
getPath - Return the n'th node in the path from the entry node to the current node. | |
Additional Inherited Members | |
Public Types inherited from llvm::df_iterator< GraphT, SetType, ExtStorage, GT > | |
using | iterator_category = std::forward_iterator_tag |
using | value_type = typename GT::NodeRef |
using | difference_type = std::ptrdiff_t |
using | pointer = value_type * |
using | reference = const value_type & |
Static Public Member Functions inherited from llvm::df_iterator< GraphT, SetType, ExtStorage, GT > | |
static df_iterator | begin (const GraphT &G) |
static df_iterator | end (const GraphT &G) |
static df_iterator | begin (const GraphT &G, SetType &S) |
static df_iterator | end (const GraphT &G, SetType &S) |
Public Attributes inherited from llvm::df_iterator_storage< SetType, External > | |
SetType | Visited |
Definition at line 284 of file DepthFirstIterator.h.
|
inline |
Definition at line 285 of file DepthFirstIterator.h.
|
inline |
Definition at line 287 of file DepthFirstIterator.h.