SgDirectedGraphEdge Class Reference

#include <Cxx_Grammar.h>

Inheritance diagram for SgDirectedGraphEdge:

[legend]Collaboration diagram for SgDirectedGraphEdge:

[legend]List of all members.

Public Types
typedef SgGraphEdge	base_node_type
	static_variant = V_SgDirectedGraphEdge
enum	{ static_variant = V_SgDirectedGraphEdge }
	static variant value More...
Public Member Functions
virtual SgNode *	copy (SgCopyHelp &help) const
	SgDirectedGraphEdge (std::string name, std::string type, int n, SgGraphNode *from, SgGraphNode *to)
SgGraphNode *	get_from ()
SgGraphNode *	get_to ()
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.
	SgDirectedGraphEdge (const SgDirectedGraphEdgeStorageClass &source)
SgDirectedGraphEdge *	addRegExpAttribute (std::string s, AstRegExAttribute *a)
	Support for AST matching using regular expression.
virtual	~SgDirectedGraphEdge ()
	SgDirectedGraphEdge (SgGraphNode *node_A=NULL, SgGraphNode *node_B=NULL, std::string name="")
Static Public Member Functions
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.
Friends
class	AST_FILE_IO
class	SgDirectedGraphEdgeStorageClass
class	AstSpecificDataManagingClass
class	AstSpecificDataManagingClassStorageClass
SgDirectedGraphEdge *	isSgDirectedGraphEdge (SgNode *s)
	Casts pointer from base class to derived class.
const SgDirectedGraphEdge *	isSgDirectedGraphEdge (const SgNode *s)
	Casts pointer from base class to derived class (for const pointers).
SgDirectedGraphEdge *	SgDirectedGraphEdge_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	SgDirectedGraphEdge_getNumberOfValidNodesAndSetGlobalIndexInFreepointer (unsigned long)
	Get the size of the memory pool.
void	SgDirectedGraphEdge_clearMemoryPool ()
void	SgDirectedGraphEdge_extendMemoryPoolForFileIO (unsigned long)
void	SgDirectedGraphEdge_getNextValidPointer (std::pair< SgDirectedGraphEdge *, std::vector< unsigned char * >::const_iterator > &)
void	SgDirectedGraphEdge_resetValidFreepointers ()

---

Member Typedef Documentation

typedef SgGraphEdge SgDirectedGraphEdge::base_node_type

Reimplemented from SgGraphEdge.

---

Member Enumeration Documentation

anonymous enum

static variant value

Enumerator:

static_variant

---

Constructor & Destructor Documentation

SgDirectedGraphEdge::SgDirectedGraphEdge	(	std::string	name,
		std::string	type,
		int	n,
		SgGraphNode *	from,
		SgGraphNode *	to
	)

SgDirectedGraphEdge::SgDirectedGraphEdge

(

const SgDirectedGraphEdgeStorageClass &

source

)

virtual SgDirectedGraphEdge::~SgDirectedGraphEdge

(

)

[virtual]

SgDirectedGraphEdge::SgDirectedGraphEdge	(	SgGraphNode *	node_A = NULL,
		SgGraphNode *	node_B = NULL,
		std::string	name = ""
	)

---

Member Function Documentation

virtual SgNode* SgDirectedGraphEdge::copy

(

SgCopyHelp &

help

)

const [virtual]

Reimplemented from SgGraphEdge.

SgGraphNode* SgDirectedGraphEdge::get_from

(

)

[inline]

SgGraphNode* SgDirectedGraphEdge::get_to

(

)

[inline]

virtual std::string SgDirectedGraphEdge::class_name

(

)

const [virtual]

Copies AST (whole subtree, depending on the SgCopyHelp class returns a string representing the class name.

Reimplemented from SgGraphEdge.

virtual VariantT SgDirectedGraphEdge::variantT

(

)

const [virtual]

returns new style SageIII enum values

Reimplemented from SgGraphEdge.

void* SgDirectedGraphEdge::operator new

(

size_t

size

)

returns pointer to newly allocated IR node

Reimplemented from SgGraphEdge.

void SgDirectedGraphEdge::operator delete	(	void *	pointer,
		size_t	size
	)

deallocated memory for IR node (returns memory to memory pool for reuse)

Reimplemented from SgGraphEdge.

void SgDirectedGraphEdge::operator delete

(

void *

pointer

)

Reimplemented from SgGraphEdge.

static size_t SgDirectedGraphEdge::numberOfNodes

(

)

[static]

Returns the total number of IR nodes of this type.

Reimplemented from SgGraphEdge.

static size_t SgDirectedGraphEdge::memoryUsage

(

)

[static]

Returns the size in bytes of the total memory allocated for all IR nodes of this type.

Reimplemented from SgGraphEdge.

virtual std::vector<SgNode*> SgDirectedGraphEdge::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.

Warning:

This function can return unexpected data members and thus the order and the number of elements is unpredicable and subject to change.

Returns:

Returns ordered STL Container of pointers to children nodes in AST.

Reimplemented from SgGraphEdge.

virtual std::vector<std::string> SgDirectedGraphEdge::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.

Warning:

This function can return unexpected data members and thus the order and the number of elements is unpredicable and subject to change.

Each string is a name of a member variable holding a pointer to a child in the AST. The names are the same as used in the generated enums for accessing attributes in a traversal. The order is the same in which they are traversed and the same in which the access enums are defined. Therefore this method can be used to get the corresponding name (string) of an access enum which allows to produce more meaningful messages for attribute computations.

Returns:

Returns ordered STL container of names (strings) of access names to children nodes in AST.

Reimplemented from SgGraphEdge.

virtual size_t SgDirectedGraphEdge::get_numberOfTraversalSuccessors

(

)

[virtual]

Reimplemented from SgGraphEdge.

virtual SgNode* SgDirectedGraphEdge::get_traversalSuccessorByIndex

(

size_t

idx

)

[virtual]

Reimplemented from SgGraphEdge.

virtual size_t SgDirectedGraphEdge::get_childIndex

(

SgNode *

child

)

[virtual]

Reimplemented from SgGraphEdge.

virtual RTIReturnType SgDirectedGraphEdge::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.

Returns:

Returns a RTIReturnType object (runtime type information).

Reimplemented from SgGraphEdge.

virtual const char* SgDirectedGraphEdge::sage_class_name

(

)

const [virtual]

returns a C style string (char*) representing the class name

Reimplemented from SgGraphEdge.

void SgDirectedGraphEdge::executeVisitorMemberFunction

(

ROSE_VisitorPattern &

visitor

)

FOR INTERNAL USE Support for visitor pattern.

Reimplemented from SgGraphEdge.

virtual void SgDirectedGraphEdge::accept

(

ROSE_VisitorPattern &

visitor

)

[virtual]

DXN (08/09/2010): support for the classic visitor pattern done in GoF.

Reimplemented from SgGraphEdge.

static void SgDirectedGraphEdge::traverseMemoryPoolNodes

(

ROSE_VisitTraversal &

visit

)

[static]

FOR INTERNAL USE Support for visitor pattern.

Reimplemented from SgGraphEdge.

static void SgDirectedGraphEdge::traverseMemoryPoolVisitorPattern

(

ROSE_VisitorPattern &

visitor

)

[static]

FOR INTERNAL USE Support for visitor pattern.

Reimplemented from SgGraphEdge.

static void SgDirectedGraphEdge::visitRepresentativeNode

(

ROSE_VisitTraversal &

visit

)

[static]

FOR INTERNAL USE Support for type-based traversal.

Reimplemented from SgGraphEdge.

virtual bool SgDirectedGraphEdge::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 SgGraphEdge.

virtual void SgDirectedGraphEdge::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 SgGraphEdge.

virtual std::vector<std::pair<SgNode*,std::string> > SgDirectedGraphEdge::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.

Warning:

This function can return unexpected data members and thus the order and the number of elements is unpredicable and subject to change.

Returns:

STL vector of pairs of SgNode* and strings

Reimplemented from SgGraphEdge.

virtual void SgDirectedGraphEdge::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.

Warning:

This function can return unexpected data members and thus the order and the number of elements is unpredicable and subject to change.

Reimplemented from SgGraphEdge.

virtual long SgDirectedGraphEdge::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).

Warning:

The mapping on children to integer values could change from release to release of ROSE.

Returns:

long

Reimplemented from SgGraphEdge.

SgDirectedGraphEdge* SgDirectedGraphEdge::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 SgGraphEdge.

---

Friends And Related Function Documentation

friend class AST_FILE_IO [friend]

Reimplemented from SgGraphEdge.

friend class SgDirectedGraphEdgeStorageClass [friend]

friend class AstSpecificDataManagingClass [friend]

Reimplemented from SgGraphEdge.

friend class AstSpecificDataManagingClassStorageClass [friend]

Reimplemented from SgGraphEdge.

SgDirectedGraphEdge* isSgDirectedGraphEdge

(

SgNode *

s

)

[friend]

Casts pointer from base class to derived class.

const SgDirectedGraphEdge* isSgDirectedGraphEdge

(

const SgNode *

s

)

[friend]

Casts pointer from base class to derived class (for const pointers).

SgDirectedGraphEdge* SgDirectedGraphEdge_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 SgDirectedGraphEdge_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 SgDirectedGraphEdge_clearMemoryPool

(

)

[friend]

void SgDirectedGraphEdge_extendMemoryPoolForFileIO

(

unsigned

long

)

[friend]

void SgDirectedGraphEdge_getNextValidPointer

(

std::pair< SgDirectedGraphEdge *, std::vector< unsigned char * >::const_iterator > &

)

[friend]

void SgDirectedGraphEdge_resetValidFreepointers

(

)

[friend]

---

The documentation for this class was generated from the following file:

• Cxx_Grammar.h

---