LLVM
8.0.1
|
A post-order depth-first RefSCC iterator over the call graph. More...
#include "llvm/Analysis/LazyCallGraph.h"
Public Member Functions | |
bool | operator== (const postorder_ref_scc_iterator &Arg) const |
reference | operator* () const |
postorder_ref_scc_iterator & | operator++ () |
![]() | |
postorder_ref_scc_iterator | operator+ (std::ptrdiff_t n) const |
postorder_ref_scc_iterator | operator- (std::ptrdiff_t n) const |
postorder_ref_scc_iterator & | operator++ () |
postorder_ref_scc_iterator | operator++ (int) |
postorder_ref_scc_iterator & | operator-- () |
postorder_ref_scc_iterator | operator-- (int) |
bool | operator!= (const postorder_ref_scc_iterator &RHS) const |
bool | operator> (const postorder_ref_scc_iterator &RHS) const |
bool | operator<= (const postorder_ref_scc_iterator &RHS) const |
bool | operator>= (const postorder_ref_scc_iterator &RHS) const |
RefSCC * | operator-> () |
RefSCC * | operator-> () const |
ReferenceProxy | operator[] (std::ptrdiff_t n) |
ReferenceProxy | operator[] (std::ptrdiff_t n) const |
Friends | |
class | LazyCallGraph |
class | LazyCallGraph::Node |
Additional Inherited Members | |
![]() | |
enum | |
A post-order depth-first RefSCC iterator over the call graph.
This iterator walks the cached post-order sequence of RefSCCs. However, it trades stability for flexibility. It is restricted to a forward iterator but will survive mutations which insert new RefSCCs and continue to point to the same RefSCC even if it moves in the post-order sequence.
Definition at line 886 of file LazyCallGraph.h.
|
inline |
Definition at line 919 of file LazyCallGraph.h.
|
inline |
Definition at line 922 of file LazyCallGraph.h.
References assert(), llvm::LazyCallGraph::LazyCallGraph(), and llvm::LazyCallGraph::operator=().
|
inline |
Definition at line 915 of file LazyCallGraph.h.
|
friend |
Definition at line 889 of file LazyCallGraph.h.
|
friend |
Definition at line 890 of file LazyCallGraph.h.