#include <Cxx_Grammar.h>
Inheritance diagram for SgName:


It contains a number of operators that make it similar to the C++ string class.
For internal use only.
This class internally contains a "char*" C style string.
Public Types | |
| typedef SgSupport | base_node_type |
| static_variant = V_SgName | |
| enum | { static_variant = V_SgName } |
| static variant value More... | |
Public Member Functions | |
| virtual SgNode * | copy (SgCopyHelp &help) const |
| SgName () | |
| This is the constructor. | |
| SgName (const char *str) | |
| SgName (const std::string &str) | |
| SgName (const SgName &n) | |
| int | operator!= (const SgName &n1) const |
| int | operator== (const SgName &n1) const |
| int | operator< (const SgName &n1) const |
| operator std::string () const | |
| bool | is_null (void) const |
| void | replace_space (char t) |
| SgName & | operator<< (const std::string &str) |
| SgName & | operator<< (int val) |
| SgName & | operator= (const SgName &n1) |
| SgName & | tail (int n) |
| SgName & | head (int n) |
| const char * | str () const |
| std::string & | getString () |
| const std::string & | getString () const |
| unsigned int | get_length () const |
| bool | operator== (const int i) const |
| void | display (const std::string &label) const |
| SgName & | operator+= (const SgName &n1) |
| SgName | invertCase () const |
| virtual std::string | class_name () const |
| Copies AST (whole subtree, depending on the SgCopyHelp class returns a string representing the class name. | |
| virtual VariantT | variantT () const |
| returns new style SageIII enum values | |
| void * | operator new (size_t size) |
| returns pointer to newly allocated IR node | |
| void | operator delete (void *pointer, size_t size) |
| deallocated memory for IR node (returns memory to memory pool for reuse) | |
| void | operator delete (void *pointer) |
| virtual std::vector< SgNode * > | get_traversalSuccessorContainer () |
| FOR INTERNAL USE within ROSE traverals mechanism only. | |
| virtual std::vector< std::string > | get_traversalSuccessorNamesContainer () |
| FOR INTERNAL USE within ROSE traverals mechanism only. | |
| 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. | |
| virtual const char * | sage_class_name () const ROSE_DEPRECATED_FUNCTION |
| void | executeVisitorMemberFunction (ROSE_VisitorPattern &visitor) |
| FOR INTERNAL USE Support for visitor pattern. | |
| virtual void | accept (ROSE_VisitorPattern &visitor) |
| DXN (08/09/2010): support for the classic visitor pattern done in GoF. | |
| virtual bool | isInMemoryPool () |
| FOR INTERNAL USE This is used in internal tests to verify that all IR nodes are allocated from the heap. | |
| virtual void | checkDataMemberPointersIfInMemoryPool () |
| FOR INTERNAL USE This is used in internal tests to verify that all IR nodes are allocated from the heap. | |
| 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 | |
| virtual void | processDataMemberReferenceToPointers (ReferenceToPointerHandler *) |
| FOR INTERNAL USE Processes pairs of references to SgNode* and strings for use in AST tools | |
| 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. | |
| SgName (const SgNameStorageClass &source) | |
| SgName * | addRegExpAttribute (std::string s, AstRegExAttribute *a) |
| Support for AST matching using regular expression. | |
| virtual | ~SgName () |
| This is the destructor. | |
Static Public Member Functions | |
| static bool | caseInsensitiveEquality (const SgName &x, const SgName &y) |
| static SgName | itoname (int val) |
| static SgName | assembleQualifiedName (const SgName &scopeQualifiedName, const SgName &localName) |
| static size_t | numberOfNodes () |
| Returns the total number of IR nodes of this type. | |
| static size_t | memoryUsage () |
| Returns the size in bytes of the total memory allocated for all IR nodes of this type. | |
| static void | traverseMemoryPoolNodes (ROSE_VisitTraversal &visit) |
| FOR INTERNAL USE Support for visitor pattern. | |
| static void | traverseMemoryPoolVisitorPattern (ROSE_VisitorPattern &visitor) |
| FOR INTERNAL USE Support for visitor pattern. | |
| static void | visitRepresentativeNode (ROSE_VisitTraversal &visit) |
| FOR INTERNAL USE Support for type-based traversal. | |
Protected Attributes | |
| std::string | p_char |
| This pointer points to an internal C style string. | |
Friends | |
| class | AST_FILE_IO |
| class | SgNameStorageClass |
| class | AstSpecificDataManagingClass |
| class | AstSpecificDataManagingClassStorageClass |
| SgName | operator+ (const SgName &n1, const SgName &n2) |
| SgName * | isSgName (SgNode *s) |
| Casts pointer from base class to derived class. | |
| const SgName * | isSgName (const SgNode *s) |
| Casts pointer from base class to derived class (for const pointers). | |
| SgName * | SgName_getPointerFromGlobalIndex (unsigned long globalIndex) |
| Constructor for use by AST File I/O MechanismTypedef used for low level memory access. Typedef used to hold memory addresses as values. Methods to find the pointer to a global and local index. | |
| unsigned long | SgName_getNumberOfValidNodesAndSetGlobalIndexInFreepointer (unsigned long) |
| Get the size of the memory pool. | |
| void | SgName_clearMemoryPool () |
| void | SgName_extendMemoryPoolForFileIO (unsigned long) |
| void | SgName_getNextValidPointer (std::pair< SgName *, std::vector< unsigned char * >::const_iterator > &) |
| void | SgName_resetValidFreepointers () |
| typedef SgSupport SgName::base_node_type |
Reimplemented from SgSupport.
| SgName::SgName | ( | ) |
This is the constructor.
This constructor builds the SgName base class.
| SgName::SgName | ( | const char * | str | ) |
| SgName::SgName | ( | const std::string & | str | ) |
| SgName::SgName | ( | const SgName & | n | ) |
| SgName::SgName | ( | const SgNameStorageClass & | source | ) |
| SgName::~SgName | ( | ) | [virtual] |
This is the destructor.
There is nothing to delete in this object.
| virtual SgNode* SgName::copy | ( | SgCopyHelp & | help | ) | const [virtual] |
Reimplemented from SgSupport.
| int SgName::operator!= | ( | const SgName & | n1 | ) | const |
| int SgName::operator== | ( | const SgName & | n1 | ) | const |
| int SgName::operator< | ( | const SgName & | n1 | ) | const |
| SgName::operator std::string | ( | ) | const |
| bool SgName::is_null | ( | void | ) | const |
| void SgName::replace_space | ( | char | t | ) |
| SgName& SgName::operator<< | ( | const std::string & | str | ) |
| static SgName SgName::itoname | ( | int | val | ) | [static] |
| SgName& SgName::operator<< | ( | int | val | ) |
| SgName& SgName::tail | ( | int | n | ) |
| SgName& SgName::head | ( | int | n | ) |
| const char* SgName::str | ( | ) | const |
| std::string& SgName::getString | ( | ) |
| const std::string& SgName::getString | ( | ) | const |
| unsigned int SgName::get_length | ( | ) | const |
| bool SgName::operator== | ( | const int | i | ) | const [inline] |
| void SgName::display | ( | const std::string & | label | ) | const |
| static SgName SgName::assembleQualifiedName | ( | const SgName & | scopeQualifiedName, | |
| const SgName & | localName | |||
| ) | [static] |
| SgName SgName::invertCase | ( | ) | const |
| virtual std::string SgName::class_name | ( | ) | const [virtual] |
Copies AST (whole subtree, depending on the SgCopyHelp class returns a string representing the class name.
Reimplemented from SgSupport.
| virtual VariantT SgName::variantT | ( | ) | const [virtual] |
| void* SgName::operator new | ( | size_t | size | ) |
| void SgName::operator delete | ( | void * | pointer, | |
| size_t | size | |||
| ) |
deallocated memory for IR node (returns memory to memory pool for reuse)
Reimplemented from SgSupport.
| void SgName::operator delete | ( | void * | pointer | ) |
Reimplemented from SgSupport.
| static size_t SgName::numberOfNodes | ( | ) | [static] |
| static size_t SgName::memoryUsage | ( | ) | [static] |
Returns the size in bytes of the total memory allocated for all IR nodes of this type.
Reimplemented from SgSupport.
| virtual std::vector<SgNode*> SgName::get_traversalSuccessorContainer | ( | ) | [virtual] |
FOR INTERNAL USE within ROSE traverals mechanism only.
This function builds and returns a copy of ordered container holding pointers to children of this node in a traversal. It is associated with the definition of a tree that is travered by the AST traversal mechanism; a tree that is embeded in the AST (which is a more general graph). This function is used within the implementation of the AST traversal and has a semantics may change in subtle ways that makes it difficult to use in user code. It can return unexpected data members and thus the order and the number of elements is unpredicable and subject to change.
Reimplemented from SgSupport.
| virtual std::vector<std::string> SgName::get_traversalSuccessorNamesContainer | ( | ) | [virtual] |
FOR INTERNAL USE within ROSE traverals mechanism only.
This function builds and returns a copy of ordered container holding strings used to name data members that are traversed in the IR node. It is associated with the definition of a tree that is travered by the AST traversal mechanism; a tree that is embeded in the AST (which is a more general graph). This function is used within the implementation of the AST traversal and has a semantics may change in subtle ways that makes it difficult to use in user code. It can return unexpected data members and thus the order and the number of elements is unpredicable and subject to change.
Reimplemented from SgSupport.
| virtual size_t SgName::get_numberOfTraversalSuccessors | ( | ) | [virtual] |
Reimplemented from SgSupport.
| virtual SgNode* SgName::get_traversalSuccessorByIndex | ( | size_t | idx | ) | [virtual] |
Reimplemented from SgSupport.
| virtual RTIReturnType SgName::roseRTI | ( | ) | [virtual] |
FOR INTERNAL USE Access to Runtime Type Information (RTI) for this IR nodes.
This function provides runtime type information for accessing the structure of the current node. It is useful for generating code which would dump out or rebuild IR nodes.
Reimplemented from SgSupport.
| virtual const char* SgName::sage_class_name | ( | ) | const [virtual] |
returns a C style string (char*) representing the class name
Reimplemented from SgSupport.
| void SgName::executeVisitorMemberFunction | ( | ROSE_VisitorPattern & | visitor | ) |
| virtual void SgName::accept | ( | ROSE_VisitorPattern & | visitor | ) | [virtual] |
DXN (08/09/2010): support for the classic visitor pattern done in GoF.
Reimplemented from SgSupport.
| static void SgName::traverseMemoryPoolNodes | ( | ROSE_VisitTraversal & | visit | ) | [static] |
| static void SgName::traverseMemoryPoolVisitorPattern | ( | ROSE_VisitorPattern & | visitor | ) | [static] |
| static void SgName::visitRepresentativeNode | ( | ROSE_VisitTraversal & | visit | ) | [static] |
| virtual bool SgName::isInMemoryPool | ( | ) | [virtual] |
FOR INTERNAL USE This is used in internal tests to verify that all IR nodes are allocated from the heap.
The AST File I/O depends upon the allocation of IR nodes being from the heap, stack based or global IR nodes should not appear in the AST if it will be written out to a file and read back in. To enforce this concept, this function implements a test to verify that the IR node can be found on the heap and is part of a larger test of the whole AST. This test must pass before the AST can be written out to a file. This is part of a compromise in the design of the AST File I/O to support binary streaming of data to files; for performance. It is also rather difficult, but possible, to build a useful AST with IR nodes allocated on the stack or frm global scope, this test filters out such cased from being used with the AST File I/O mechanism.
Reimplemented from SgSupport.
| virtual void SgName::checkDataMemberPointersIfInMemoryPool | ( | ) | [virtual] |
FOR INTERNAL USE This is used in internal tests to verify that all IR nodes are allocated from the heap.
The AST File I/O depends upon the allocation of IR nodes being from the heap, stack based or global IR nodes should not appear in the AST if it will be written out to a file and read back in. To enforce this concept, this function implements a test to verify that the IR node can be found on the heap and is part of a larger test of the whole AST. This test must pass before the AST can be written out to a file. This is part of a compromise in the design of the AST File I/O to support binary streaming of data to files; for performance. It is also rather difficult, but possible, to build a useful AST with IR nodes allocated on the stack or frm global scope, this test filters out such cased from being used with the AST File I/O mechanism.
Reimplemented from SgSupport.
| virtual std::vector<std::pair<SgNode*,std::string> > SgName::returnDataMemberPointers | ( | ) | const [virtual] |
FOR INTERNAL USE Returns STL vector of pairs of SgNode* and strings for use in AST tools
This functions is part of general support for many possible tools to operate on the AST. The forms a list of ALL IR node pointers used by each IR node, and is a supperset of the get_traversalSuccessorContainer(). It is (I think) less than the set of pointers used by the AST file I/O. This is part of work implemented by Andreas, and support tools such as the AST graph generation.
Reimplemented from SgSupport.
| virtual void SgName::processDataMemberReferenceToPointers | ( | ReferenceToPointerHandler * | ) | [virtual] |
FOR INTERNAL USE Processes pairs of references to SgNode* and strings for use in AST tools
This functions similar to returnDataMemberPointers() except that it passes references to a handler object. As a result there is FAR more damage that can be done by using this function, but it is type-safe. This is provided for support of internal tools that operate on the AST, e.g the AST Merge mechanism.
Reimplemented from SgSupport.
| virtual long SgName::getChildIndex | ( | SgNode * | childNode | ) | const [virtual] |
FOR INTERNAL USE Returns a unique index value for the childNode in the list of children at this IR node.
This function returns a unique value for the input childNode in set of children at this IR node. Note that a negative value indicates that the input node is not a child. This is the basis for the implementation of the isChild(SgNode*) member function. Data members that are NULL in the IR node are counted internally (so that this function returns value that could be statically defined, and so are not dynamically determined).
Reimplemented from SgSupport.
| SgName* SgName::addRegExpAttribute | ( | std::string | s, | |
| AstRegExAttribute * | a | |||
| ) |
Support for AST matching using regular expression.
This support is incomplete and the subject of current research to define RegEx trees to support inexact matching.
Reimplemented from SgSupport.
friend class AST_FILE_IO [friend] |
Reimplemented from SgSupport.
friend class SgNameStorageClass [friend] |
friend class AstSpecificDataManagingClass [friend] |
Reimplemented from SgSupport.
friend class AstSpecificDataManagingClassStorageClass [friend] |
Reimplemented from SgSupport.
| SgName::isSgName | ( | SgNode * | s | ) | [friend] |
Casts pointer from base class to derived class.
This functions returns a SgName pointer for any input of a pointer to an object derived from a SgName.
| SgName::isSgName | ( | const SgNode * | s | ) | [friend] |
Casts pointer from base class to derived class (for const pointers).
This functions returns a SgName pointer for any input of a pointer to an object derived from a SgName.
| SgName* SgName_getPointerFromGlobalIndex | ( | unsigned long | globalIndex | ) | [friend] |
Constructor for use by AST File I/O MechanismTypedef used for low level memory access. Typedef used to hold memory addresses as values. Methods to find the pointer to a global and local index.
| unsigned long SgName_getNumberOfValidNodesAndSetGlobalIndexInFreepointer | ( | unsigned | long | ) | [friend] |
Get the size of the memory pool.
It actually returns the size of the whole blocks allocated, no matter they contain valid pointers or not.
| void SgName_clearMemoryPool | ( | ) | [friend] |
| void SgName_extendMemoryPoolForFileIO | ( | unsigned | long | ) | [friend] |
| void SgName_getNextValidPointer | ( | std::pair< SgName *, std::vector< unsigned char * >::const_iterator > & | ) | [friend] |
| void SgName_resetValidFreepointers | ( | ) | [friend] |
SgName::p_char [protected] |
This pointer points to an internal C style string.
1.4.7