LLZK 0.1.0
Veridise's ZK Language IR
|
#include <CallGraph.h>
Public Types | |
using | nodes_iterator = llzk::CallGraph::iterator |
![]() | |
using | NodeRef = const llzk::CallGraphNode * |
using | ChildIteratorType = mapped_iterator<llzk::CallGraphNode::iterator, decltype(&unwrap)> |
Static Public Member Functions | |
static NodeRef | getEntryNode (const llzk::CallGraph *cg) |
The entry node into the graph is the external node. | |
static nodes_iterator | nodes_begin (llzk::CallGraph *cg) |
static nodes_iterator | nodes_end (llzk::CallGraph *cg) |
![]() | |
static NodeRef | getEntryNode (NodeRef node) |
static NodeRef | unwrap (const llzk::CallGraphNode::Edge &edge) |
static ChildIteratorType | child_begin (NodeRef node) |
static ChildIteratorType | child_end (NodeRef node) |
Definition at line 258 of file CallGraph.h.
using llvm::GraphTraits< const llzk::CallGraph * >::nodes_iterator = llzk::CallGraph::iterator |
Definition at line 263 of file CallGraph.h.
|
inlinestatic |
The entry node into the graph is the external node.
Definition at line 260 of file CallGraph.h.
|
inlinestatic |
Definition at line 264 of file CallGraph.h.
|
inlinestatic |
Definition at line 265 of file CallGraph.h.