ROSE 0.11.145.192
SgAsmDwarfDwarfProcedure.h
1
2#ifndef ROSE_SgAsmDwarfDwarfProcedure_H
3#define ROSE_SgAsmDwarfDwarfProcedure_H
4#include <RoseFirst.h>
5#include <Cxx_GrammarDeclarations.h>
6#include <SgAsmDwarfConstruct.h>
7
8
9
10/* #line 1 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro" */
11
12// WARNING -- GENERATED CODE -- DO NOT MODIFY THIS CODE -- WARNING!
13// This code is automatically generated for each
14// terminal and non-terminal within the defined
15// grammar. There is a simple way to change the
16// code to fix bugs etc. See the ROSE README file
17// for directions.
18
19// tps: (02/22/2010): Adding DLL export requirements
20#include "rosedll.h"
21
22// predeclarations for SgAsmDwarfDwarfProcedure
23
24/* #line 25 "../../../src/frontend/SageIII//SgAsmDwarfDwarfProcedure.h" */
25
26/* #line 13 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro after subst for $PREDECLARATIONS" */
27
28/* #line 14 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro" */
29
30#if !defined(DOCUMENTATION)
31// Class Definition for SgAsmDwarfDwarfProcedure
32class ROSE_DLL_API SgAsmDwarfDwarfProcedure : public SgAsmDwarfConstruct
33 {
34 public:
35
36
37/* #line 38 "../../../src/frontend/SageIII//SgAsmDwarfDwarfProcedure.h" */
38
39 virtual SgNode* copy ( SgCopyHelp& help) const override;
40// Start of memberFunctionString
41/* #line 26807 "/workspace/src/ROSETTA/src/binaryInstruction.C" */
42
43
44 //----------------------- Boost serialization for SgAsmDwarfDwarfProcedure -----------------------
45#ifdef ROSE_HAVE_BOOST_SERIALIZATION_LIB
46private:
47 friend class boost::serialization::access;
48
49 template<class S>
50 void serialize(S &s, const unsigned /*version*/) {
51 debugSerializationBegin("SgAsmDwarfDwarfProcedure");
52 s & BOOST_SERIALIZATION_BASE_OBJECT_NVP(SgAsmDwarfConstruct);
53 debugSerializationEnd("SgAsmDwarfDwarfProcedure");
54 }
55#endif // ROSE_HAVE_BOOST_SERIALIZATION_LIB
56
57public:
60
61public:
64
65public:
67 SgAsmDwarfDwarfProcedure(int const& nesting_level,
68 uint64_t const& offset,
69 uint64_t const& overall_offset);
70
71protected:
79
80
81// End of memberFunctionString
82// Start of memberFunctionString
83/* #line 1 "/workspace/src/ROSETTA/Grammar/Common.code" */
84
85// *** COMMON CODE SECTION BEGINS HERE ***
86
87 public:
88
89 // DQ (3/25/3006): I put this back in because it had the logic for where the copy function required
90 // and not required which is required to match the other aspects of the copy mechanism code generation.
91 // Specifically it is a problem to declare the copy function everywhere because it is not implemented
92 // for the SgSymbol IR nodes. I'm not clear why it is not implemented for these IR nodes.
93 /* \brief Copies AST (whole subtree, depending on the SgCopyHelp class */
94 // virtual SgNode* copy ( const SgCopyHelp & help) const;
95
97 virtual std::string class_name() const override;
98
100 virtual VariantT variantT() const override; // MS: new variant used in tree traversal
101
103 // King84 (2010.08.16): Moved this to an enum to save space, since it's only used at compiler-time anyway.
104 // static const VariantT static_variant = V_SgAsmDwarfDwarfProcedure;
105 enum { static_variant = V_SgAsmDwarfDwarfProcedure };
106
107 /* the generated cast function */
109 ROSE_DLL_API friend SgAsmDwarfDwarfProcedure* isSgAsmDwarfDwarfProcedure( SgNode * s );
110
112 ROSE_DLL_API friend const SgAsmDwarfDwarfProcedure* isSgAsmDwarfDwarfProcedure( const SgNode * s );
113
114 // ******************************************
115 // * Memory Pool / New / Delete
116 // ******************************************
117
118 public:
120 static const unsigned pool_size; //
122 static std::vector<unsigned char *> pools; //
124 static SgAsmDwarfDwarfProcedure * next_node; //
125
127 static unsigned long initializeStorageClassArray(SgAsmDwarfDwarfProcedureStorageClass *); //
128
130 static void clearMemoryPool(); //
131 static void deleteMemoryPool(); //
132
134 static void extendMemoryPoolForFileIO(); //
135
137 static SgAsmDwarfDwarfProcedure * getPointerFromGlobalIndex(unsigned long); //
139 static SgAsmDwarfDwarfProcedure * getPointerFromGlobalIndex(AstSpecificDataManagingClass *, unsigned long); //
140
142 static unsigned long getNumberOfValidNodesAndSetGlobalIndexInFreepointer(unsigned long); //
144 static void resetValidFreepointers(); //
146 static unsigned long getNumberOfLastValidPointer(); //
147
148
149#if defined(INLINE_FUNCTIONS)
151 inline void *operator new (size_t size);
152#else
154 void *operator new (size_t size);
155#endif
157 void operator delete (void* pointer, size_t size);
158
159 // DQ (4/5/2007): This is not the correct operator that we want, but appears to be required to compile ROSE with ROSE.
160 void operator delete (void* pointer)
161 {
162 // This is the generated delete operator...
163 SgAsmDwarfDwarfProcedure::operator delete (pointer,sizeof(SgAsmDwarfDwarfProcedure));
164 }
165
167 static size_t numberOfNodes();
168
170 static size_t memoryUsage();
171
172 // End of scope which started in IR nodes specific code
173 /* */
174
175 /* name Internal Functions
176 \brief Internal functions ... incomplete-documentation
177
178 These functions have been made public as part of the design, but they are suggested for internal use
179 or by particularly knowledgeable users for specialized tools or applications.
180
181 \internal We could not make these private because they are required by user for special purposes. And
182 it would be unwieldy to have many of the internal classes in ROSE be explicitly defined as friends.
183
184 */
185
186 // MS: 02/12/02 container of pointers to AST successor nodes used in the traversal
187 // overridden in every class by *generated* implementation
189 virtual std::vector<SgNode*> get_traversalSuccessorContainer() override;
190 // MS: 06/28/02 container of names of variables or container indices
191 // used used in the traversal to access AST successor nodes
192 // overridden in every class by *generated* implementation
195 virtual std::vector<std::string> get_traversalSuccessorNamesContainer() override;
196
197 // GB (09/25/2007): Functions for index-based access to traversal successors; these are hopefully a lot faster
198 // than all the vector copies. The implementation for these functions is generated for each class.
200 virtual size_t get_numberOfTraversalSuccessors() override;
202 virtual SgNode *get_traversalSuccessorByIndex(size_t idx) override;
204 virtual size_t get_childIndex(SgNode *child) override;
205
206#ifndef ROSE_USE_INTERNAL_FRONTEND_DEVELOPMENT
207 // MS: 08/16/2002 method for generating RTI information
209 virtual RTIReturnType roseRTI() override;
210#endif
211 /* */
212
213
214
215 /* name Deprecated Functions
216 \brief Deprecated functions ... incomplete-documentation
217
218 These functions have been deprecated from use.
219 */
220 /* */
221
223 virtual const char* sage_class_name() const override ROSE_DEPRECATED_FUNCTION;
224
225 // JJW (10/16/2008): Changed to a single function in Node.code, and put
226 // getVariant() in #if 0 block to prevent confusing Doxygen
227#if 0
229 virtual int variant() const ROSE_DEPRECATED_FUNCTION;
231 // virtual int getVariant() const ROSE_DEPRECATED_FUNCTION;
232#endif
233 /* */
234
235
236
237
238 public:
239 /* name Traversal Support Functions
240 \brief Traversal support functions ... incomplete-documentation
241
242 These functions have been made public as part of the design, but they are suggested for internal use
243 or by particularly knowledgable users for specialized tools or applications.
244 */
245 /* */
246
247 // DQ (11/26/2005): Support for visitor pattern mechanims
248 // (inferior to ROSE traversal mechanism, experimental).
252
253 /* DXN (08/09/2010): support for the classic visitor pattern done in GoF */
255 virtual void accept (ROSE_VisitorPattern & visitor) override;
256
257 // DQ (12/26/2005): Support for traversal based on the memory pool
260 static void traverseMemoryPoolNodes(ROSE_VisitTraversal & visit);
261
265
266 // DQ (2/9/2006): Added to support traversal over single representative of each IR node
267 // This traversal helps support internal tools that call static member functions.
268 // note: this function operates on the memory pools.
271 static void visitRepresentativeNode (ROSE_VisitTraversal & visit);
272 /* */
273
274 public:
275 /* NodeId support functions */
277 static SgNode* getNodeByNodeId(VariantT variantT, size_t poolIdx, size_t itemIdx);
280 static SgAsmDwarfDwarfProcedure* getNodeByNodeIdInternal(size_t poolIdx, size_t itemIdx);
283 static std::string getNodeIdString(SgAsmDwarfDwarfProcedure* sgnode);
284 static std::string getNodeIdStringInternal(SgAsmDwarfDwarfProcedure* sgnode);
285
286 public:
287 /* name Memory Allocation Functions
288 \brief Memory allocations functions ... incomplete-documentation
289
290 These functions have been made public as part of the design, but they are suggested for internal use
291 or by particularly knowledgable users for specialized tools or applications.
292 */
293 /* */
294
305 virtual bool isInMemoryPool() override;
306
317 virtual void checkDataMemberPointersIfInMemoryPool() override;
318
319 // DQ (4/30/2006): Modified to be a const function.
334 virtual std::vector<std::pair<SgNode*,std::string> > returnDataMemberPointers() const override;
335
346
358 virtual long getChildIndex( SgNode* childNode ) const override;
359
360 // DQ (9/2/2015): Since this function is generated by ROSETTA, we can't define the
361 // comment here (changed to be a C style comment and not be a doxygen comment).
362 /* \brief Constructor for use by AST File I/O Mechanism
363
364 This constructor permits the IR node to be rebuilt from the contiguously arranged data in memory
365 which obtained via fast binary file I/O from disk.
366 */
367 // SgAsmDwarfDwarfProcedure( SgAsmDwarfDwarfProcedureStorageClass& source );
368
369
370
371
372
373 // JH (10/24/2005): methods added to support the ast file IO
374 private:
375
376 /* name AST Memory Allocation Support Functions
377 \brief Memory allocations support....
378
379 These functions handle the low leve support of the memory allocation scheme which permits IR nodes to be allocated
380 in large contiguous blocks to reduce memory fragmentation, improve performance, support specialized access (AST traversals),
381 and support the AST File I/O Mechanism.
382 */
383 /* */
384
385 /* JH (10/24/2005): Two typedefs. The TestType notes the type every pointer is cast to before
386 we compare them. Since I had several problems with this, I decided to make a typdef to ensure
387 that I use the same type everywhere, if any changes are made. THe second one declares the type
388 (actually unsigned long) where teh pointer address gets converted to. On 64 bit platforms this
389 might got changed, but unfortunatly, the return types are still unsigned longs. There exists
390 a correspinding one in the AST_FILE_IO class!
391 */
392 // DQ (9/2/2015): This typedef is no longer used, we can't define the
393 // comment here (changed to be a C style comment and not be a doxygen comment).
394 /* \brief Typedef used for low level memory access.
395 */
396 // typedef unsigned char* TestType;
397
398 // DQ (9/2/2015): This typedef is no longer used, we can't define the
399 // comment here (changed to be a C style comment and not be a doxygen comment).
400 /* \brief Typedef used to hold memory addresses as values.
401 */
402 // typedef unsigned long AddressType;
403
404
405
406 // necessary, to have direct access to the p_freepointer and the private methods !
408 friend class AST_FILE_IO;
409
411 friend class SgAsmDwarfDwarfProcedureStorageClass;
412
414 friend class AstSpecificDataManagingClass;
415
417 friend class AstSpecificDataManagingClassStorageClass;
418 public:
420 SgAsmDwarfDwarfProcedure( const SgAsmDwarfDwarfProcedureStorageClass& source );
421
422 // private: // JJW hack
423 /*
424 name AST Memory Allocation Support Variables
425 Memory allocations support variables
426
427 These variables handle the low level support of the memory allocation scheme which permits IR nodes to be allocated
428 in large contiguous blocks to reduce memory fragmentation, improve performance, support specialized access (AST traversals),
429 and support the AST File I/O Mechanism.
430 */
431 /* */
432
433 public:
434
435 // DQ (11/21/2009): Added function to add new Regular Expression attributes and return pointer
436 // to current node (so that it will work cleanly with build functions to specify patterns).
437 // virtual SgNode* addRegExpAttribute();
444
445#ifndef _MSC_VER
446// Rasmussen (04/17/2019): Support for ATerms has been deprecated as it is no longer needed
447// and likely never fully implemented nor tested. Files remain in the src tree but are no
448// longer built.
449#define BUILD_ATERM_SUPPORT 0
450 #if BUILD_ATERM_SUPPORT
451 #ifdef ROSE_USE_ROSE_ATERM_SUPPORT
452 // DQ (10/4/2014): Adding ATerm support to ROSE.
462 // Rasmussen (1/7/2019): Added override to kill warning messages of overridden virtual function
463 virtual ATerm generate_ATerm() override;
464
466 virtual void generate_ATerm_Annotation(ATerm & term) override;
467 #endif
468 #endif // BUILD_ATERM_SUPPORT
469#endif
470 // These can't be virtual functions since we don't yet know what IR node to build (until we have read the aterm).
471 // virtual generate_AST(ATerm & term);
472 // virtual void read_ATerm_Annotation(ATerm & term);
473
474// *** COMMON CODE SECTION ENDS HERE ***
475
476
477// End of memberFunctionString
478// Start of memberFunctionString
479/* #line 706 "/workspace/src/ROSETTA/Grammar/Node.code" */
480
481 // the generated cast function
482 // friend ROSE_DLL_API SgAsmDwarfDwarfProcedure* isSgAsmDwarfDwarfProcedure ( SgNode* s );
483
484 typedef SgAsmDwarfConstruct base_node_type;
485
486
487// End of memberFunctionString
488
489 protected:
490
492
493/* #line 21 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro" */
494
495
496 };
497#endif
498
499// postdeclarations for SgAsmDwarfDwarfProcedure
500
501/* #line 502 "../../../src/frontend/SageIII//SgAsmDwarfDwarfProcedure.h" */
502
503/* #line 27 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro after subst for $POSTDECLARATIONS" */
504
505/* #line 28 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro" */
506
507
508/* #line 509 "../../../src/frontend/SageIII//SgAsmDwarfDwarfProcedure.h" */
509
510#endif // ROSE_SgAsmDwarfDwarfProcedure_H
511
Class holding static data and functions supporting File I/O.
Definition AST_FILE_IO.h:19
Attribute containing a regex expression as a string.
void initializeProperties()
Initialize all properties that have explicit initial values.
Supporting class from copy mechanism within ROSE.
Definition sageCopy.h:26
This class represents the base class for all IR nodes within Sage III.
virtual size_t get_numberOfTraversalSuccessors()
return number of children in the traversal successor list
virtual RTIReturnType roseRTI()
return C++ Runtime-Time-Information
virtual std::vector< std::string > get_traversalSuccessorNamesContainer()
container of names of variables or container indices used used in the traversal to access AST success...
virtual void debugSerializationEnd(const char *className)
Called by generated serializers.
static std::string getNodeIdString(SgNode *sgnode)
compute the NodeId for a particular SgNode*.
virtual bool isInMemoryPool()
FOR INTERNAL USE This is used in internal tests to verify that all IR nodes are allocated from the he...
int variant() const
Older version function returns enum value "NODE".
virtual void processDataMemberReferenceToPointers(ReferenceToPointerHandler *)
FOR INTERNAL USE Processes pairs of references to SgNode* and strings for use in AST tools
virtual VariantT variantT() const
returns new style SageIII enum values
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 no...
virtual size_t get_childIndex(SgNode *child)
index-based access to traversal successors by child node
virtual void debugSerializationBegin(const char *className)
Called by generated serializers.
virtual std::vector< SgNode * > get_traversalSuccessorContainer()
container of pointers to AST successor nodes used in the traversal overridden in every class by gener...
virtual std::string class_name() const
returns a string representing the class name
static void visitRepresentativeNode(ROSE_VisitTraversal &visit)
FOR INTERNAL USE Support for type-based traversal.
virtual void checkDataMemberPointersIfInMemoryPool()
FOR INTERNAL USE This is used in internal tests to verify that all IR nodes are allocated from the he...
static size_t numberOfNodes()
Returns the total number of IR nodes of this type.
virtual void accept(ROSE_VisitorPattern &visitor)
support for the classic visitor pattern done in GoF
virtual SgNode * get_traversalSuccessorByIndex(size_t idx)
index-based access to traversal successors by index number
static void traverseMemoryPoolVisitorPattern(ROSE_VisitorPattern &visitor)
FOR INTERNAL USE Support for visitor pattern.
void executeVisitorMemberFunction(ROSE_VisitorPattern &visitor)
FOR INTERNAL USE Support for visitor pattern.
static SgNode * getNodeByNodeId(VariantT variantT, size_t poolIdx, size_t itemIdx)
Find a node by its variant type, pool index, and item index.
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 over all IR nodes by type of IR node.
virtual const char * sage_class_name() const
generates string representing the class name: (e.g. for SgNode returns "SgNode").
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
static SgNode * getNodeByNodeIdInternal(size_t poolIdx, size_t itemIdx)
FOR INTERNAL USE Find an SgNode from its memory pool and location therin.
SgNode * addRegExpAttribute(std::string s, AstRegExAttribute *a)
Support for AST matching using regular expression.
void serialize(std::ostream &output, Graph &graph)
Serialize a graph into a stream of bytes.
void copy(const Word *src, const BitRange &srcRange, Word *dst, const BitRange &dstRange)
Copy some bits.