| accept(ROSE_VisitorPattern &visitor) | SgIncidenceDirectedGraph | [virtual] |
| addDirectedEdge(SgGraphNode *a, SgGraphNode *b, const std::string &name="") | SgIncidenceDirectedGraph | |
| addDirectedEdge(SgDirectedGraphEdge *edge) | SgIncidenceDirectedGraph | |
| addEdge(SgGraphNode *a, SgGraphNode *b, const std::string &name="") | SgGraph | |
| addEdge(SgGraphEdge *edge) | SgGraph | |
| addNewAttribute(std::string s, AstAttribute *a) | SgGraph | [virtual] |
| addNode(const std::string &name="", SgNode *sg_node=NULL) | SgGraph | |
| addNode(SgGraphNode *node) | SgGraph | |
| addRegExpAttribute(std::string s, AstRegExAttribute *a) | SgIncidenceDirectedGraph | |
| append_properties(int addr, const std::string &prop) | SgGraph | |
| AST_FILE_IO class | SgIncidenceDirectedGraph | [friend] |
| AstSpecificDataManagingClass class | SgIncidenceDirectedGraph | [friend] |
| AstSpecificDataManagingClassStorageClass class | SgIncidenceDirectedGraph | [friend] |
| attributeExists(std::string s) const | SgGraph | [virtual] |
| base_node_type typedef | SgIncidenceDirectedGraph | |
| BoostEdgeType typedef | SgGraph | |
| buildCommandLineToSubstituteTransformationFile(const std::vector< std::string > &argv, std::string newFileName) | SgNode | [static] |
| cfg enum value | SgGraph | |
| cfgFindChildIndex(SgNode *n) | SgNode | [virtual] |
| cfgFindNextChildIndex(SgNode *n) | SgNode | [virtual] |
| cfgForBeginning() | SgNode | [inline] |
| cfgForEnd() | SgNode | [inline] |
| cfgIndexForEnd() const | SgNode | [virtual] |
| cfgInEdges(unsigned int index=false) | SgNode | [virtual] |
| cfgIsIndexInteresting(unsigned int index) const | SgNode | [virtual] |
| cfgOutEdges(unsigned int index=false) | SgNode | [virtual] |
| checkDataMemberPointersIfInMemoryPool() | SgIncidenceDirectedGraph | [virtual] |
| checkIfDirectedGraphEdgeExists(SgGraphNode *src, SgGraphNode *trg) | SgIncidenceDirectedGraph | |
| checkIfGraphEdgeExists(SgGraphNode *src) | SgIncidenceDirectedGraph | |
| checkIfGraphNodeExists(const std::string &trg_mnemonic, std::vector< SgGraphNode * > &nodes) | SgGraph | |
| class_name() const | SgIncidenceDirectedGraph | [virtual] |
| clearGlobalMangledNameMap() | SgNode | [static] |
| computeEdgeSet(SgGraphNode *node) | SgGraph | |
| computeEdgeSet(int node_index) | SgGraph | |
| computeEdgeSetIn(SgGraphNode *node) | SgIncidenceDirectedGraph | |
| computeEdgeSetIn(int node_index) | SgIncidenceDirectedGraph | |
| computeEdgeSetOut(SgGraphNode *node) | SgIncidenceDirectedGraph | |
| computeEdgeSetOut(int node_index) | SgIncidenceDirectedGraph | |
| computeNodeIndexPairSet(int node_index) | SgGraph | |
| computeNodeIndexSet(const std::string &label) | SgGraph | |
| computeNodeSet(const std::string &label) | SgGraph | |
| computeNodeSet() | SgGraph | |
| copy(SgCopyHelp &help) const | SgIncidenceDirectedGraph | [virtual] |
| depthOfSubtree() | SgNode | |
| dfa_bufferoverflow enum value | SgGraph | |
| dfa_conditional_def enum value | SgGraph | |
| dfa_resolved_func enum value | SgGraph | |
| dfa_standard enum value | SgGraph | |
| dfa_unresolved_func enum value | SgGraph | |
| dfa_variable enum value | SgGraph | |
| display_edge_index_to_edge_map() const | SgGraph | |
| display_node_index_pair_to_edge_multimap() const | SgGraph | |
| display_node_index_to_edge_multimap() const | SgGraph | |
| display_node_index_to_node_map() const | SgGraph | |
| display_string_to_edge_index_multimap() const | SgGraph | |
| display_string_to_node_index_multimap() const | SgGraph | |
| done enum value | SgGraph | |
| e_last_property enum value | SgGraph | |
| e_last_type enum value | SgGraph | |
| e_property_error enum value | SgGraph | |
| e_type_error enum value | SgGraph | |
| edgeLabel enum value | SgGraph | |
| eval enum value | SgGraph | |
| executeVisitorMemberFunction(ROSE_VisitorPattern &visitor) | SgIncidenceDirectedGraph | |
| exists(SgGraphNode *node) | SgGraph | |
| exists(SgGraphEdge *edge) | SgGraph | |
| fixupCopy(SgNode *copy, SgCopyHelp &help) const | SgNode | [virtual] |
| generateSpanningTree() | SgGraph | |
| get_attributeMechanism() const | SgGraph | [virtual] |
| get_boost_edge_weights() const | SgGraph | |
| get_boost_edge_weights() | SgGraph | |
| get_boost_edges() const | SgGraph | |
| get_boost_edges() | SgGraph | |
| get_childIndex(SgNode *child) | SgIncidenceDirectedGraph | [virtual] |
| get_edge_index_to_edge_map() const | SgGraph | |
| get_edge_index_to_edge_map() | SgGraph | |
| get_endOfConstruct(void) const | SgNode | [inline, virtual] |
| get_file_info(void) const | SgNode | [inline, virtual] |
| get_freepointer() const | SgNode | |
| get_globalFunctionTypeTable() | SgNode | [static] |
| get_globalMangledNameMap() | SgNode | [static] |
| get_globalQualifiedNameMapForNames() | SgNode | [static] |
| get_globalQualifiedNameMapForTypes() | SgNode | [static] |
| get_globalTypeNameMap() | SgNode | [static] |
| get_globalTypeTable() | SgNode | [static] |
| get_index() const | SgGraph | |
| get_isModified() const | SgNode | |
| get_isVisited() const ROSE_DEPRECATED_FUNCTION | SgNode | |
| get_name() const | SgGraph | |
| get_node_index_pair_to_edge_multimap() const | SgGraph | |
| get_node_index_pair_to_edge_multimap() | SgGraph | |
| get_node_index_to_edge_multimap() const | SgGraph | |
| get_node_index_to_edge_multimap() | SgGraph | |
| get_node_index_to_edge_multimap_edgesIn() const | SgIncidenceDirectedGraph | |
| get_node_index_to_edge_multimap_edgesIn() | SgIncidenceDirectedGraph | |
| get_node_index_to_edge_multimap_edgesOut() const | SgIncidenceDirectedGraph | |
| get_node_index_to_edge_multimap_edgesOut() | SgIncidenceDirectedGraph | |
| get_node_index_to_node_map() const | SgGraph | |
| get_node_index_to_node_map() | SgGraph | |
| get_numberOfTraversalSuccessors() | SgIncidenceDirectedGraph | [virtual] |
| get_parent() const | SgNode | |
| get_properties() const | SgGraph | |
| get_properties() | SgGraph | |
| get_shortMangledNameCache() | SgNode | [static] |
| get_startOfConstruct(void) const | SgNode | [inline, virtual] |
| get_string_to_edge_index_multimap() const | SgGraph | |
| get_string_to_edge_index_multimap() | SgGraph | |
| get_string_to_node_index_multimap() const | SgGraph | |
| get_string_to_node_index_multimap() | SgGraph | |
| get_traversalSuccessorByIndex(size_t idx) | SgIncidenceDirectedGraph | [virtual] |
| get_traversalSuccessorContainer() | SgIncidenceDirectedGraph | [virtual] |
| get_traversalSuccessorNamesContainer() | SgIncidenceDirectedGraph | [virtual] |
| getAttribute(std::string s) const | SgGraph | [virtual] |
| getChildIndex(SgNode *childNode) const | SgIncidenceDirectedGraph | [virtual] |
| getClassHierarchySubTreeFunction(VariantT v) | SgNode | [static] |
| getClassHierarchySubTreeFunction(VariantT v, std::vector< VariantT > &) | SgNode | [static] |
| getDirectedEdge(SgGraphNode *src, SgGraphNode *trg) | SgIncidenceDirectedGraph | |
| getEdge(SgGraphNode *src) | SgIncidenceDirectedGraph | |
| getPredecessors(const SgGraphNode *node, std::vector< SgGraphNode * > &vec) const | SgIncidenceDirectedGraph | |
| getProperty(SgGraph::GraphProperties property, SgGraphNode *node) | SgGraph | |
| getProperty(SgGraph::GraphProperties property, SgGraphEdge *edge) | SgGraph | |
| getSuccessors(const SgGraphNode *node, std::vector< SgGraphNode * > &vec) const | SgIncidenceDirectedGraph | |
| GraphEdgeType enum name | SgGraph | |
| GraphProperties enum name | SgGraph | |
| hashCode(const char *p, int len) const | SgGraph | |
| interrupt enum value | SgGraph | |
| isChild(SgNode *node) const | SgNode | |
| isInMemoryPool() | SgIncidenceDirectedGraph | [virtual] |
| isSgGraph(SgNode *s) | SgGraph | [friend] |
| isSgGraph(const SgNode *s) | SgGraph | [friend] |
| isSgIncidenceDirectedGraph(SgNode *s) | SgIncidenceDirectedGraph | [friend] |
| isSgIncidenceDirectedGraph(const SgNode *s) | SgIncidenceDirectedGraph | [friend] |
| isSgNode(SgNode *s) | SgNode | [friend] |
| isSgNode(const SgNode *s) | SgNode | [friend] |
| isSgSupport(SgNode *s) | SgSupport | [friend] |
| isSgSupport(const SgNode *s) | SgSupport | [friend] |
| itself_call enum value | SgGraph | |
| memory_usage() | SgGraph | |
| memoryUsage() | SgIncidenceDirectedGraph | [static] |
| name enum value | SgGraph | |
| nodest_call enum value | SgGraph | |
| nodest_jmp enum value | SgGraph | |
| none enum value | SgGraph | |
| numberOfAttributes() const | SgGraph | [virtual] |
| numberOfGraphEdges() const | SgGraph | |
| numberOfGraphNodes() const | SgGraph | |
| numberOfNodes() | SgIncidenceDirectedGraph | [static] |
| numberOfNodesInSubtree() | SgNode | |
| operator delete(void *pointer, size_t size) | SgIncidenceDirectedGraph | |
| operator delete(void *pointer) | SgIncidenceDirectedGraph | |
| operator new(size_t size) | SgIncidenceDirectedGraph | |
| p_attributeMechanism | SgGraph | [protected] |
| p_boost_edge_weights | SgGraph | [protected] |
| p_boost_edges | SgGraph | [protected] |
| p_edge_index_to_edge_map | SgGraph | [protected] |
| p_freepointer | SgNode | [protected] |
| p_globalFunctionTypeTable | SgNode | [protected, static] |
| p_globalMangledNameMap | SgNode | [protected, static] |
| p_globalQualifiedNameMapForNames | SgNode | [protected, static] |
| p_globalQualifiedNameMapForTypes | SgNode | [protected, static] |
| p_globalTypeNameMap | SgNode | [protected, static] |
| p_globalTypeTable | SgNode | [protected, static] |
| p_index | SgGraph | [protected] |
| p_index_counter | SgGraph | [protected, static] |
| p_isModified | SgNode | [protected] |
| p_name | SgGraph | [protected] |
| p_node_index_pair_to_edge_multimap | SgGraph | [protected] |
| p_node_index_to_edge_multimap | SgGraph | [protected] |
| p_node_index_to_edge_multimap_edgesIn | SgIncidenceDirectedGraph | [protected] |
| p_node_index_to_edge_multimap_edgesOut | SgIncidenceDirectedGraph | [protected] |
| p_node_index_to_node_map | SgGraph | [protected] |
| p_parent | SgNode | [protected] |
| p_properties | SgGraph | [protected] |
| p_shortMangledNameCache | SgNode | [protected, static] |
| p_string_to_edge_index_multimap | SgGraph | [protected] |
| p_string_to_node_index_multimap | SgGraph | [protected] |
| post_construction_initialization() | SgIncidenceDirectedGraph | [virtual] |
| processDataMemberReferenceToPointers(ReferenceToPointerHandler *) | SgIncidenceDirectedGraph | [virtual] |
| regs enum value | SgGraph | |
| removeAttribute(std::string s) | SgGraph | [virtual] |
| removeDirectedEdge(SgDirectedGraphEdge *edge) | SgIncidenceDirectedGraph | |
| resize_hash_maps(size_t numberOfNodes, size_t numberOfEdges=10) | SgGraph | |
| returnDataMemberPointers() const | SgIncidenceDirectedGraph | [virtual] |
| roseRTI() | SgIncidenceDirectedGraph | [virtual] |
| sage_class_name() const ROSE_DEPRECATED_FUNCTION | SgIncidenceDirectedGraph | [virtual] |
| set_attributeMechanism(AstAttributeMechanism *attributeMechanism) | SgGraph | [virtual] |
| set_freepointer(SgNode *freepointer) | SgNode | |
| set_globalFunctionTypeTable(SgFunctionTypeTable *globalFunctionTypeTable) | SgNode | [static] |
| set_globalQualifiedNameMapForNames(const std::map< SgNode *, std::string > &X) | SgNode | [static] |
| set_globalQualifiedNameMapForTypes(const std::map< SgNode *, std::string > &X) | SgNode | [static] |
| set_globalTypeNameMap(const std::map< SgNode *, std::string > &X) | SgNode | [static] |
| set_globalTypeTable(SgTypeTable *globalTypeTable) | SgNode | [static] |
| set_index(int index) | SgGraph | |
| set_isModified(bool isModified) | SgNode | |
| set_isVisited(bool isVisited) ROSE_DEPRECATED_FUNCTION | SgNode | |
| set_name(std::string name) | SgGraph | |
| set_parent(SgNode *parent) | SgNode | |
| setAttribute(std::string s, AstAttribute *a) | SgGraph | [virtual] |
| setProperty(SgGraph::GraphProperties property, SgGraphNode *node, std::string value) | SgGraph | |
| setProperty(SgGraph::GraphProperties property, SgGraphEdge *edge, std::string value) | SgGraph | |
| SgBoostEdgeList typedef | SgGraph | |
| SgBoostEdgeWeightList typedef | SgGraph | |
| SgGraph(const SgGraphStorageClass &source) | SgGraph | |
| SgGraph(std::string name="") | SgGraph | |
| SgIncidenceDirectedGraph(const SgIncidenceDirectedGraphStorageClass &source) | SgIncidenceDirectedGraph | |
| SgIncidenceDirectedGraph(std::string name="") | SgIncidenceDirectedGraph | |
| SgIncidenceDirectedGraph_clearMemoryPool() | SgIncidenceDirectedGraph | [friend] |
| SgIncidenceDirectedGraph_extendMemoryPoolForFileIO(unsigned long) | SgIncidenceDirectedGraph | [friend] |
| SgIncidenceDirectedGraph_getNextValidPointer(std::pair< SgIncidenceDirectedGraph *, std::vector< unsigned char * >::const_iterator > &) | SgIncidenceDirectedGraph | [friend] |
| SgIncidenceDirectedGraph_getNumberOfValidNodesAndSetGlobalIndexInFreepointer(unsigned long) | SgIncidenceDirectedGraph | [friend] |
| SgIncidenceDirectedGraph_getPointerFromGlobalIndex(unsigned long globalIndex) | SgIncidenceDirectedGraph | [friend] |
| SgIncidenceDirectedGraph_resetValidFreepointers() | SgIncidenceDirectedGraph | [friend] |
| SgIncidenceDirectedGraphStorageClass class | SgIncidenceDirectedGraph | [friend] |
| SgNode(const SgNodeStorageClass &source) | SgNode | |
| SgNode() | SgNode | |
| SgSupport(const SgSupportStorageClass &source) | SgSupport | |
| SgSupport() | SgSupport | |
| static_variant enum value | SgIncidenceDirectedGraph | |
| traverseMemoryPoolNodes(ROSE_VisitTraversal &visit) | SgIncidenceDirectedGraph | [static] |
| traverseMemoryPoolVisitorPattern(ROSE_VisitorPattern &visitor) | SgIncidenceDirectedGraph | [static] |
| type enum value | SgGraph | |
| unparseToCompleteString() | SgNode | |
| unparseToString(SgUnparse_Info *info) const | SgNode | [virtual] |
| unparseToString() const | SgNode | |
| updateAttribute(std::string s, AstAttribute *a) | SgGraph | [virtual] |
| usage enum value | SgGraph | |
| variable enum value | SgGraph | |
| variant() const ROSE_DEPRECATED_FUNCTION | SgNode | [inline] |
| variantT() const | SgIncidenceDirectedGraph | [virtual] |
| visitedCounter enum value | SgGraph | |
| visitRepresentativeNode(ROSE_VisitTraversal &visit) | SgIncidenceDirectedGraph | [static] |
| ~SgGraph() | SgGraph | [virtual] |
| ~SgIncidenceDirectedGraph() | SgIncidenceDirectedGraph | [virtual] |
| ~SgNode() | SgNode | [virtual] |
| ~SgSupport() | SgSupport | [virtual] |
