|
LLVM 24.0.0git
|
#include "llvm/ADT/DepthFirstIterator.h"
Public Types | |
| using | iterator_category |
| using | value_type = typename GT::NodeRef |
| using | difference_type = std::ptrdiff_t |
| using | pointer = value_type * |
| using | reference = const value_type & |
Public Member Functions | |
| 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 |
| Return the length of the path from the entry node to the current node, counting both nodes. | |
| NodeRef | getPath (unsigned n) const |
| Return the n'th node in the path from the entry node to the current node. | |
Static Public Member Functions | |
| 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) |
Additional Inherited Members | |
| Public Attributes inherited from llvm::df_iterator_storage< SetType, External > | |
| SetType | Visited |
Definition at line 87 of file DepthFirstIterator.h.
| using llvm::df_iterator< GraphT, SetType, ExtStorage, GT >::difference_type = std::ptrdiff_t |
Definition at line 94 of file DepthFirstIterator.h.
| using llvm::df_iterator< GraphT, SetType, ExtStorage, GT >::iterator_category |
Definition at line 90 of file DepthFirstIterator.h.
| using llvm::df_iterator< GraphT, SetType, ExtStorage, GT >::pointer = value_type * |
Definition at line 95 of file DepthFirstIterator.h.
| using llvm::df_iterator< GraphT, SetType, ExtStorage, GT >::reference = const value_type & |
Definition at line 96 of file DepthFirstIterator.h.
| using llvm::df_iterator< GraphT, SetType, ExtStorage, GT >::value_type = typename GT::NodeRef |
Definition at line 93 of file DepthFirstIterator.h.
|
inlinestatic |
Definition at line 157 of file DepthFirstIterator.h.
Referenced by llvm::df_begin(), llvm::df_ext_begin(), llvm::idf_begin(), and llvm::idf_ext_begin().
|
inlinestatic |
Definition at line 163 of file DepthFirstIterator.h.
|
inlinestatic |
Definition at line 160 of file DepthFirstIterator.h.
Referenced by llvm::df_end(), llvm::df_ext_end(), llvm::idf_end(), and llvm::idf_ext_end().
|
inlinestatic |
Definition at line 166 of file DepthFirstIterator.h.
|
inline |
Return the n'th node in the path from the entry node to the current node.
Definition at line 216 of file DepthFirstIterator.h.
|
inline |
Return the length of the path from the entry node to the current node, counting both nodes.
Definition at line 213 of file DepthFirstIterator.h.
|
inline |
Definition at line 207 of file DepthFirstIterator.h.
|
inline |
Definition at line 171 of file DepthFirstIterator.h.
|
inline |
Definition at line 173 of file DepthFirstIterator.h.
|
inline |
Definition at line 181 of file DepthFirstIterator.h.
|
inline |
Definition at line 197 of file DepthFirstIterator.h.
|
inline |
Definition at line 179 of file DepthFirstIterator.h.
|
inline |
Definition at line 168 of file DepthFirstIterator.h.
|
inline |
Skips all children of the current node and traverses to next node.
Note: This function takes care of incrementing the iterator. If you always increment and call this function, you risk walking off the end.
Definition at line 190 of file DepthFirstIterator.h.