|
ROSE
0.9.6a
|
|
ROSE
0.9.6a
|
#include <SB_Graph.h>
Additional Inherited Members | |
 Public Types inherited from SgIncidenceDirectedGraph | |
| enum | { static_variant = V_SgIncidenceDirectedGraph } |
| static variant value More... | |
| typedef SgGraph | base_node_type |
| Public Member Functions inherited from SgIncidenceDirectedGraph | |
| virtual SgNode * | copy (SgCopyHelp &help) const |
| This function clones the current IR node object recursively or not, depending on the argument. More... | |
| std::set< SgGraphEdge * > | getEdge (SgGraphNode *src) |
| bool | checkIfGraphEdgeExists (SgGraphNode *src) |
| void | post_construction_initialization () |
| Final initialization for constructors This function is called at the end of generated constructors to allow the specification writer to add special initialization functions or tests. Default is to do nothing. Otherwise it should be overridden in the spec file, in NewHeaderCode/NewOutlinedCode. More... | |
| SgDirectedGraphEdge * | addDirectedEdge (SgGraphNode *a, SgGraphNode *b, const std::string &name="") |
| Support for adding SgGraphEdge to SgGraph. More... | |
| SgDirectedGraphEdge * | addDirectedEdge (SgDirectedGraphEdge *edge) |
| Add support for externally build SgGraphNode objects. More... | |
| bool | removeDirectedEdge (SgDirectedGraphEdge *edge) |
| Remove an edge from graph. More... | |
| void | getSuccessors (const SgGraphNode *node, std::vector< SgGraphNode * > &vec) const |
| void | getPredecessors (const SgGraphNode *node, std::vector< SgGraphNode * > &vec) const |
| std::set< SgDirectedGraphEdge * > | getDirectedEdge (SgGraphNode *src, SgGraphNode *trg) |
| bool | checkIfDirectedGraphEdgeExists (SgGraphNode *src, SgGraphNode *trg) |
| std::set< SgDirectedGraphEdge * > | computeEdgeSetIn (SgGraphNode *node) |
| std::set< int > | computeEdgeSetIn (int node_index) |
| std::set< SgDirectedGraphEdge * > | computeEdgeSetOut (SgGraphNode *node) |
| std::set< int > | computeEdgeSetOut (int node_index) |
| virtual std::string | class_name () const |
| Copies AST (whole subtree, depending on the SgCopyHelp class. More... | |
| virtual VariantT | variantT () const |
| returns new style SageIII enum values More... | |
| void * | operator new (size_t size) |
| returns pointer to newly allocated IR node More... | |
| void | operator delete (void *pointer, size_t size) |
| deallocated memory for IR node (returns memory to memory pool for reuse) More... | |
| void | operator delete (void *pointer) |
| virtual std::vector< SgNode * > | get_traversalSuccessorContainer () |
| FOR INTERNAL USE within ROSE traverals mechanism only. More... | |
| virtual std::vector< std::string > | get_traversalSuccessorNamesContainer () |
| FOR INTERNAL USE within ROSE traverals mechanism only. More... | |
| virtual size_t | get_numberOfTraversalSuccessors () |
| virtual SgNode * | get_traversalSuccessorByIndex (size_t idx) |
| virtual size_t | get_childIndex (SgNode *child) |
| virtual RTIReturnType | roseRTI () |
| FOR INTERNAL USE Access to Runtime Type Information (RTI) for this IR nodes. More... | |
| virtual const char * | sage_class_name () const ROSE_DEPRECATED_FUNCTION |
| void | executeVisitorMemberFunction (ROSE_VisitorPattern &visitor) |
| FOR INTERNAL USE Support for visitor pattern. More... | |
| virtual void | accept (ROSE_VisitorPattern &visitor) |
| DXN (08/09/2010): support for the classic visitor pattern done in GoF. More... | |
| virtual bool | isInMemoryPool () |
| FOR INTERNAL USE This is used in internal tests to verify that all IR nodes are allocated from the heap. More... | |
| virtual void | checkDataMemberPointersIfInMemoryPool () |
| FOR INTERNAL USE This is used in internal tests to verify that all IR nodes are allocated from the heap. More... | |
| virtual std::vector< std::pair < SgNode *, std::string > > | returnDataMemberPointers () const |
| FOR INTERNAL USE Returns STL vector of pairs of SgNode* and strings for use in AST tools More... | |
| virtual void | processDataMemberReferenceToPointers (ReferenceToPointerHandler *) |
| FOR INTERNAL USE Processes pairs of references to SgNode* and strings for use in AST tools More... | |
| virtual long | getChildIndex (SgNode *childNode) const |
| FOR INTERNAL USE Returns a unique index value for the childNode in the list of children at this IR node. More... | |
| SgIncidenceDirectedGraph (const SgIncidenceDirectedGraphStorageClass &source) | |
| SgIncidenceDirectedGraph * | addRegExpAttribute (std::string s, AstRegExAttribute *a) |
| Support for AST matching using regular expression. More... | |
| const rose_graph_integer_edge_hash_multimap & | get_node_index_to_edge_multimap_edgesOut () const |
| rose_graph_integer_edge_hash_multimap & | get_node_index_to_edge_multimap_edgesOut () |
| const rose_graph_integer_edge_hash_multimap & | get_node_index_to_edge_multimap_edgesIn () const |
| rose_graph_integer_edge_hash_multimap & | get_node_index_to_edge_multimap_edgesIn () |
| virtual | ~SgIncidenceDirectedGraph () |
| SgIncidenceDirectedGraph (std::string name="") | |
| Static Public Member Functions inherited from SgIncidenceDirectedGraph | |
| static size_t | numberOfNodes () |
| Returns the total number of IR nodes of this type. More... | |
| static size_t | memoryUsage () |
| Returns the size in bytes of the total memory allocated for all IR nodes of this type. More... | |
| static void | traverseMemoryPoolNodes (ROSE_VisitTraversal &visit) |
| FOR INTERNAL USE Support for visitor pattern. More... | |
| static void | traverseMemoryPoolVisitorPattern (ROSE_VisitorPattern &visitor) |
| FOR INTERNAL USE Support for visitor pattern. More... | |
| static void | visitRepresentativeNode (ROSE_VisitTraversal &visit) |
| FOR INTERNAL USE Support for type-based traversal. More... | |
| Protected Attributes inherited from SgIncidenceDirectedGraph | |
| rose_graph_integer_edge_hash_multimap | p_node_index_to_edge_multimap_edgesOut |
| rose_graph_integer_edge_hash_multimap | p_node_index_to_edge_multimap_edgesIn |
| Static Protected Attributes inherited from SgGraph | |
| static int | p_index_counter |
Definition at line 12 of file SB_Graph.h.
1.8.4 
