ROSE 0.11.145.247
SgAsmLESectionTable.h
1
2#ifndef ROSE_SgAsmLESectionTable_H
3#define ROSE_SgAsmLESectionTable_H
4#include <RoseFirst.h>
5#include <Cxx_GrammarDeclarations.h>
6#include <SgAsmGenericSection.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 SgAsmLESectionTable
23
24/* #line 25 "../../../src/frontend/SageIII//SgAsmLESectionTable.h" */
25/* #line 7818 "/workspace/src/ROSETTA/src/binaryInstruction.C" */
26
27#include <Rose/BinaryAnalysis/Address.h>
28
29
30/* #line 13 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro after subst for $PREDECLARATIONS" */
31
32/* #line 14 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro" */
33
34#if !defined(DOCUMENTATION)
35// Class Definition for SgAsmLESectionTable
36class ROSE_DLL_API SgAsmLESectionTable : public SgAsmGenericSection
37 {
38 public:
39
40
41/* #line 42 "../../../src/frontend/SageIII//SgAsmLESectionTable.h" */
42
43 virtual SgNode* copy ( SgCopyHelp& help) const override;
44// Start of memberFunctionString
45/* #line 7827 "/workspace/src/ROSETTA/src/binaryInstruction.C" */
46
47
48 //----------------------- Boost serialization for SgAsmLESectionTable -----------------------
49#ifdef ROSE_ENABLE_BOOST_SERIALIZATION
50private:
51 friend class boost::serialization::access;
52
53 template<class S>
54 void serialize(S &s, const unsigned /*version*/) {
55 debugSerializationBegin("SgAsmLESectionTable");
56 s & BOOST_SERIALIZATION_BASE_OBJECT_NVP(SgAsmGenericSection);
57 debugSerializationEnd("SgAsmLESectionTable");
58 }
59#endif // ROSE_ENABLE_BOOST_SERIALIZATION
60public:
62 virtual void unparse(std::ostream&) const override;
63 virtual void dump(FILE*, const char *prefix, ssize_t idx) const override;
64public:
66 virtual ~SgAsmLESectionTable();
67
68public:
71
72protected:
80
81
82// End of memberFunctionString
83// Start of memberFunctionString
84/* #line 1 "/workspace/src/ROSETTA/Grammar/Common.code" */
85
86// *** COMMON CODE SECTION BEGINS HERE ***
87
88 public:
89
90 // DQ (3/25/3006): I put this back in because it had the logic for where the copy function required
91 // and not required which is required to match the other aspects of the copy mechanism code generation.
92 // Specifically it is a problem to declare the copy function everywhere because it is not implemented
93 // for the SgSymbol IR nodes. I'm not clear why it is not implemented for these IR nodes.
94 /* \brief Copies AST (whole subtree, depending on the SgCopyHelp class */
95 // virtual SgNode* copy ( const SgCopyHelp & help) const;
96
98 virtual std::string class_name() const override;
99
101 virtual VariantT variantT() const override; // MS: new variant used in tree traversal
102
104 // King84 (2010.08.16): Moved this to an enum to save space, since it's only used at compiler-time anyway.
105 // static const VariantT static_variant = V_SgAsmLESectionTable;
106 enum { static_variant = V_SgAsmLESectionTable };
107
108 /* the generated cast function */
110 ROSE_DLL_API friend SgAsmLESectionTable* isSgAsmLESectionTable( SgNode * s );
111
113 ROSE_DLL_API friend const SgAsmLESectionTable* isSgAsmLESectionTable( const SgNode * s );
114
115 // ******************************************
116 // * Memory Pool / New / Delete
117 // ******************************************
118
119 public:
121 static const unsigned pool_size; //
123 static std::vector<unsigned char *> pools; //
125 static SgAsmLESectionTable * next_node; //
126
128 static unsigned long initializeStorageClassArray(SgAsmLESectionTableStorageClass *); //
129
131 static void clearMemoryPool(); //
132 static void deleteMemoryPool(); //
133
135 static void extendMemoryPoolForFileIO(); //
136
138 static SgAsmLESectionTable * getPointerFromGlobalIndex(unsigned long); //
140 static SgAsmLESectionTable * getPointerFromGlobalIndex(AstSpecificDataManagingClass *, unsigned long); //
141
143 static unsigned long getNumberOfValidNodesAndSetGlobalIndexInFreepointer(unsigned long); //
145 static void resetValidFreepointers(); //
147 static unsigned long getNumberOfLastValidPointer(); //
148
149
150#if defined(INLINE_FUNCTIONS)
152 inline void *operator new (size_t size);
153#else
155 void *operator new (size_t size);
156#endif
158 void operator delete (void* pointer, size_t size);
159
160 // DQ (4/5/2007): This is not the correct operator that we want, but appears to be required to compile ROSE with ROSE.
161 void operator delete (void* pointer)
162 {
163 // This is the generated delete operator...
164 SgAsmLESectionTable::operator delete (pointer,sizeof(SgAsmLESectionTable));
165 }
166
168 static size_t numberOfNodes();
169
171 static size_t memoryUsage();
172
173 // End of scope which started in IR nodes specific code
174 /* */
175
176 /* name Internal Functions
177 \brief Internal functions ... incomplete-documentation
178
179 These functions have been made public as part of the design, but they are suggested for internal use
180 or by particularly knowledgeable users for specialized tools or applications.
181
182 \internal We could not make these private because they are required by user for special purposes. And
183 it would be unwieldy to have many of the internal classes in ROSE be explicitly defined as friends.
184
185 */
186
187 // MS: 02/12/02 container of pointers to AST successor nodes used in the traversal
188 // overridden in every class by *generated* implementation
190 virtual std::vector<SgNode*> get_traversalSuccessorContainer() const override;
191 // MS: 06/28/02 container of names of variables or container indices
192 // used used in the traversal to access AST successor nodes
193 // overridden in every class by *generated* implementation
196 virtual std::vector<std::string> get_traversalSuccessorNamesContainer() const override;
197
198 // GB (09/25/2007): Functions for index-based access to traversal successors; these are hopefully a lot faster
199 // than all the vector copies. The implementation for these functions is generated for each class.
201 virtual size_t get_numberOfTraversalSuccessors() const override;
203 virtual SgNode *get_traversalSuccessorByIndex(size_t idx) const override;
205 virtual size_t get_childIndex(SgNode *child) const override;
206
207#ifndef ROSE_USE_INTERNAL_FRONTEND_DEVELOPMENT
208 // MS: 08/16/2002 method for generating RTI information
210 virtual RTIReturnType roseRTI() override;
211#endif
212 /* */
213
214
215
216 /* name Deprecated Functions
217 \brief Deprecated functions ... incomplete-documentation
218
219 These functions have been deprecated from use.
220 */
221 /* */
222
224 virtual const char* sage_class_name() const override ROSE_DEPRECATED_FUNCTION;
225
226 // JJW (10/16/2008): Changed to a single function in Node.code, and put
227 // getVariant() in #if 0 block to prevent confusing Doxygen
228#if 0
230 virtual int variant() const ROSE_DEPRECATED_FUNCTION;
232 // virtual int getVariant() const ROSE_DEPRECATED_FUNCTION;
233#endif
234 /* */
235
236
237
238
239 public:
240 /* name Traversal Support Functions
241 \brief Traversal support functions ... incomplete-documentation
242
243 These functions have been made public as part of the design, but they are suggested for internal use
244 or by particularly knowledgable users for specialized tools or applications.
245 */
246 /* */
247
248 // DQ (11/26/2005): Support for visitor pattern mechanims
249 // (inferior to ROSE traversal mechanism, experimental).
253
254 /* DXN (08/09/2010): support for the classic visitor pattern done in GoF */
256 virtual void accept (ROSE_VisitorPattern & visitor) override;
257
258 // DQ (12/26/2005): Support for traversal based on the memory pool
261 static void traverseMemoryPoolNodes(ROSE_VisitTraversal & visit);
262
266
267 // DQ (2/9/2006): Added to support traversal over single representative of each IR node
268 // This traversal helps support internal tools that call static member functions.
269 // note: this function operates on the memory pools.
272 static void visitRepresentativeNode (ROSE_VisitTraversal & visit);
273 /* */
274
275 public:
276 /* NodeId support functions */
278 static SgNode* getNodeByNodeId(VariantT variantT, size_t poolIdx, size_t itemIdx);
281 static SgAsmLESectionTable* getNodeByNodeIdInternal(size_t poolIdx, size_t itemIdx);
284 static std::string getNodeIdString(SgAsmLESectionTable* sgnode);
285 static std::string getNodeIdStringInternal(SgAsmLESectionTable* sgnode);
286
287 public:
288 /* name Memory Allocation Functions
289 \brief Memory allocations functions ... incomplete-documentation
290
291 These functions have been made public as part of the design, but they are suggested for internal use
292 or by particularly knowledgable users for specialized tools or applications.
293 */
294 /* */
295
306 virtual bool isInMemoryPool() override;
307
318 virtual void checkDataMemberPointersIfInMemoryPool() override;
319
320 // DQ (4/30/2006): Modified to be a const function.
335 virtual std::vector<std::pair<SgNode*,std::string> > returnDataMemberPointers() const override;
336
347
359 virtual long getChildIndex( SgNode* childNode ) const override;
360
361 // DQ (9/2/2015): Since this function is generated by ROSETTA, we can't define the
362 // comment here (changed to be a C style comment and not be a doxygen comment).
363 /* \brief Constructor for use by AST File I/O Mechanism
364
365 This constructor permits the IR node to be rebuilt from the contiguously arranged data in memory
366 which obtained via fast binary file I/O from disk.
367 */
368 // SgAsmLESectionTable( SgAsmLESectionTableStorageClass& source );
369
370
371
372
373
374 // JH (10/24/2005): methods added to support the ast file IO
375 private:
376
377 /* name AST Memory Allocation Support Functions
378 \brief Memory allocations support....
379
380 These functions handle the low leve support of the memory allocation scheme which permits IR nodes to be allocated
381 in large contiguous blocks to reduce memory fragmentation, improve performance, support specialized access (AST traversals),
382 and support the AST File I/O Mechanism.
383 */
384 /* */
385
386 /* JH (10/24/2005): Two typedefs. The TestType notes the type every pointer is cast to before
387 we compare them. Since I had several problems with this, I decided to make a typdef to ensure
388 that I use the same type everywhere, if any changes are made. THe second one declares the type
389 (actually unsigned long) where teh pointer address gets converted to. On 64 bit platforms this
390 might got changed, but unfortunatly, the return types are still unsigned longs. There exists
391 a correspinding one in the AST_FILE_IO class!
392 */
393 // DQ (9/2/2015): This typedef is no longer used, we can't define the
394 // comment here (changed to be a C style comment and not be a doxygen comment).
395 /* \brief Typedef used for low level memory access.
396 */
397 // typedef unsigned char* TestType;
398
399 // DQ (9/2/2015): This typedef is no longer used, we can't define the
400 // comment here (changed to be a C style comment and not be a doxygen comment).
401 /* \brief Typedef used to hold memory addresses as values.
402 */
403 // typedef unsigned long AddressType;
404
405
406
407 // necessary, to have direct access to the p_freepointer and the private methods !
409 friend class AST_FILE_IO;
410
412 friend class SgAsmLESectionTableStorageClass;
413
415 friend class AstSpecificDataManagingClass;
416
418 friend class AstSpecificDataManagingClassStorageClass;
419 public:
421 SgAsmLESectionTable( const SgAsmLESectionTableStorageClass& source );
422
423 // private: // JJW hack
424 /*
425 name AST Memory Allocation Support Variables
426 Memory allocations support variables
427
428 These variables handle the low level support of the memory allocation scheme which permits IR nodes to be allocated
429 in large contiguous blocks to reduce memory fragmentation, improve performance, support specialized access (AST traversals),
430 and support the AST File I/O Mechanism.
431 */
432 /* */
433
434 public:
435
436 // DQ (11/21/2009): Added function to add new Regular Expression attributes and return pointer
437 // to current node (so that it will work cleanly with build functions to specify patterns).
438 // virtual SgNode* addRegExpAttribute();
445
446#ifndef _MSC_VER
447// Rasmussen (04/17/2019): Support for ATerms has been deprecated as it is no longer needed
448// and likely never fully implemented nor tested. Files remain in the src tree but are no
449// longer built.
450#define BUILD_ATERM_SUPPORT 0
451 #if BUILD_ATERM_SUPPORT
452 #ifdef ROSE_USE_ROSE_ATERM_SUPPORT
453 // DQ (10/4/2014): Adding ATerm support to ROSE.
463 // Rasmussen (1/7/2019): Added override to kill warning messages of overridden virtual function
464 virtual ATerm generate_ATerm() override;
465
467 virtual void generate_ATerm_Annotation(ATerm & term) override;
468 #endif
469 #endif // BUILD_ATERM_SUPPORT
470#endif
471 // These can't be virtual functions since we don't yet know what IR node to build (until we have read the aterm).
472 // virtual generate_AST(ATerm & term);
473 // virtual void read_ATerm_Annotation(ATerm & term);
474
475// *** COMMON CODE SECTION ENDS HERE ***
476
477
478// End of memberFunctionString
479// Start of memberFunctionString
480/* #line 710 "/workspace/src/ROSETTA/Grammar/Node.code" */
481
482 // the generated cast function
483 // friend ROSE_DLL_API SgAsmLESectionTable* isSgAsmLESectionTable ( SgNode* s );
484
485 typedef SgAsmGenericSection base_node_type;
486
487
488// End of memberFunctionString
489
490 protected:
491
493
494/* #line 21 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro" */
495
496
497 };
498#endif
499
500// postdeclarations for SgAsmLESectionTable
501
502/* #line 503 "../../../src/frontend/SageIII//SgAsmLESectionTable.h" */
503
504/* #line 27 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro after subst for $POSTDECLARATIONS" */
505
506/* #line 28 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro" */
507
508
509/* #line 510 "../../../src/frontend/SageIII//SgAsmLESectionTable.h" */
510
511#endif // ROSE_SgAsmLESectionTable_H
512
Class holding static data and functions supporting File I/O.
Definition AST_FILE_IO.h:19
Attribute containing a regex expression as a string.
Contiguous region of a file.
virtual void dump(FILE *, const char *prefix, ssize_t idx) const
Print some debugging info.
void initializeProperties()
Initialize all properties that have explicit initial values.
virtual void unparse(std::ostream &) const
Write a section back to the file.
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 RTIReturnType roseRTI()
return C++ Runtime-Time-Information
virtual size_t get_numberOfTraversalSuccessors() const
return number of children in the traversal successor list
virtual std::vector< std::string > get_traversalSuccessorNamesContainer() const
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 size_t get_childIndex(SgNode *child) const
index-based access to traversal successors by child node
virtual std::vector< SgNode * > get_traversalSuccessorContainer() const
container of pointers to AST successor nodes used in the traversal overridden in every class by gener...
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 void debugSerializationBegin(const char *className)
Called by generated serializers.
virtual SgNode * get_traversalSuccessorByIndex(size_t idx) const
index-based access to traversal successors by index number
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
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.
std::uint64_t Address
Address.
Definition Address.h:11
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.