| addEdge(EdgeType &E) | llvm::DGNode< NodeType, EdgeType > | inline |
| back() const | llvm::DGNode< NodeType, EdgeType > | inline |
| back() | llvm::DGNode< NodeType, EdgeType > | inline |
| begin() const | llvm::DGNode< NodeType, EdgeType > | inline |
| begin() | llvm::DGNode< NodeType, EdgeType > | inline |
| clear() | llvm::DGNode< NodeType, EdgeType > | inline |
| const_iterator typedef | llvm::DGNode< NodeType, EdgeType > | |
| DGNode(EdgeType &E) | llvm::DGNode< NodeType, EdgeType > | inlineexplicit |
| DGNode()=default | llvm::DGNode< NodeType, EdgeType > | |
| EdgeListTy typedef | llvm::DGNode< NodeType, EdgeType > | |
| Edges | llvm::DGNode< NodeType, EdgeType > | protected |
| end() const | llvm::DGNode< NodeType, EdgeType > | inline |
| end() | llvm::DGNode< NodeType, EdgeType > | inline |
| findEdgesTo(const NodeType &N, SmallVectorImpl< EdgeType * > &EL) const | llvm::DGNode< NodeType, EdgeType > | inline |
| findEdgeTo(const NodeType &N) const | llvm::DGNode< NodeType, EdgeType > | inlineprotected |
| front() const | llvm::DGNode< NodeType, EdgeType > | inline |
| front() | llvm::DGNode< NodeType, EdgeType > | inline |
| getDerived() | llvm::DGNode< NodeType, EdgeType > | inlineprotected |
| getDerived() const | llvm::DGNode< NodeType, EdgeType > | inlineprotected |
| getEdges() const | llvm::DGNode< NodeType, EdgeType > | inline |
| getEdges() | llvm::DGNode< NodeType, EdgeType > | inline |
| hasEdgeTo(const NodeType &N) const | llvm::DGNode< NodeType, EdgeType > | inline |
| isEqualTo(const NodeType &N) const | llvm::DGNode< NodeType, EdgeType > | inlineprotected |
| iterator typedef | llvm::DGNode< NodeType, EdgeType > | |
| operator!=(const NodeType &M, const NodeType &N) | llvm::DGNode< NodeType, EdgeType > | friend |
| operator==(const NodeType &M, const NodeType &N) | llvm::DGNode< NodeType, EdgeType > | friend |
| removeEdge(EdgeType &E) | llvm::DGNode< NodeType, EdgeType > | inline |