| begin(const GraphT &G) | llvm::scc_iterator< GraphT, GT > | inlinestatic |
| end(const GraphT &) | llvm::scc_iterator< GraphT, GT > | inlinestatic |
| hasLoop() const | llvm::scc_iterator< GraphT, GT > | |
| isAtEnd() const | llvm::scc_iterator< GraphT, GT > | inline |
| IsBidirectional enum value | llvm::iterator_facade_base< scc_iterator< GraphT, GT >, std::forward_iterator_tag, const std::vector< GT::NodeType * >, ptrdiff_t > | protected |
| IsRandomAccess enum value | llvm::iterator_facade_base< scc_iterator< GraphT, GT >, std::forward_iterator_tag, const std::vector< GT::NodeType * >, ptrdiff_t > | protected |
| operator!=(const scc_iterator< GraphT, GT > &RHS) const | llvm::iterator_facade_base< scc_iterator< GraphT, GT >, std::forward_iterator_tag, const std::vector< GT::NodeType * >, ptrdiff_t > | inline |
| operator*() const | llvm::scc_iterator< GraphT, GT > | inline |
| operator+(ptrdiff_tn) const | llvm::iterator_facade_base< scc_iterator< GraphT, GT >, std::forward_iterator_tag, const std::vector< GT::NodeType * >, ptrdiff_t > | inline |
| operator++() | llvm::scc_iterator< GraphT, GT > | inline |
| iterator_facade_base< scc_iterator< GraphT, GT >, std::forward_iterator_tag, const std::vector< GT::NodeType * >, ptrdiff_t >::operator++(int) | llvm::iterator_facade_base< scc_iterator< GraphT, GT >, std::forward_iterator_tag, const std::vector< GT::NodeType * >, ptrdiff_t > | inline |
| operator-(ptrdiff_tn) const | llvm::iterator_facade_base< scc_iterator< GraphT, GT >, std::forward_iterator_tag, const std::vector< GT::NodeType * >, ptrdiff_t > | inline |
| operator--() | llvm::iterator_facade_base< scc_iterator< GraphT, GT >, std::forward_iterator_tag, const std::vector< GT::NodeType * >, ptrdiff_t > | inline |
| operator--(int) | llvm::iterator_facade_base< scc_iterator< GraphT, GT >, std::forward_iterator_tag, const std::vector< GT::NodeType * >, ptrdiff_t > | inline |
| operator->() const | llvm::iterator_facade_base< scc_iterator< GraphT, GT >, std::forward_iterator_tag, const std::vector< GT::NodeType * >, ptrdiff_t > | inline |
| operator<=(const scc_iterator< GraphT, GT > &RHS) const | llvm::iterator_facade_base< scc_iterator< GraphT, GT >, std::forward_iterator_tag, const std::vector< GT::NodeType * >, ptrdiff_t > | inline |
| operator==(const scc_iterator &x) const | llvm::scc_iterator< GraphT, GT > | inline |
| operator>(const scc_iterator< GraphT, GT > &RHS) const | llvm::iterator_facade_base< scc_iterator< GraphT, GT >, std::forward_iterator_tag, const std::vector< GT::NodeType * >, ptrdiff_t > | inline |
| operator>=(const scc_iterator< GraphT, GT > &RHS) const | llvm::iterator_facade_base< scc_iterator< GraphT, GT >, std::forward_iterator_tag, const std::vector< GT::NodeType * >, ptrdiff_t > | inline |
| operator[](ptrdiff_tn) const | llvm::iterator_facade_base< scc_iterator< GraphT, GT >, std::forward_iterator_tag, const std::vector< GT::NodeType * >, ptrdiff_t > | inline |
| ReplaceNode(NodeType *Old, NodeType *New) | llvm::scc_iterator< GraphT, GT > | inline |