ROSE 0.11.145.147
SgAsmNEStringTable.h
1
2#ifndef ROSE_SgAsmNEStringTable_H
3#define ROSE_SgAsmNEStringTable_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 SgAsmNEStringTable
23
24/* #line 25 "../../../src/frontend/SageIII//SgAsmNEStringTable.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 SgAsmNEStringTable
32class ROSE_DLL_API SgAsmNEStringTable : public SgAsmGenericSection
33 {
34 public:
35
36
37/* #line 38 "../../../src/frontend/SageIII//SgAsmNEStringTable.h" */
38
39 virtual SgNode* copy ( SgCopyHelp& help) const override;
40// Start of memberFunctionString
41/* #line 5549 "/workspace/src/ROSETTA/src/binaryInstruction.C" */
42
43
44 //----------------------- Boost serialization for SgAsmNEStringTable -----------------------
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("SgAsmNEStringTable");
52 s & BOOST_SERIALIZATION_BASE_OBJECT_NVP(SgAsmGenericSection);
53 debugSerializationEnd("SgAsmNEStringTable");
54 }
55#endif // ROSE_HAVE_BOOST_SERIALIZATION_LIB
56public:
57 SgAsmNEStringTable(SgAsmNEFileHeader *fhdr, rose_addr_t offset, rose_addr_t size);
58 virtual void dump(FILE*, const char *prefix, ssize_t idx) const override;
59 std::string get_string(rose_addr_t offset);
60public:
62 virtual ~SgAsmNEStringTable();
63
64public:
67
68protected:
76
77
78// End of memberFunctionString
79// Start of memberFunctionString
80/* #line 1 "/workspace/src/ROSETTA/Grammar/Common.code" */
81
82// *** COMMON CODE SECTION BEGINS HERE ***
83
84 public:
85
86 // DQ (3/25/3006): I put this back in because it had the logic for where the copy function required
87 // and not required which is required to match the other aspects of the copy mechanism code generation.
88 // Specifically it is a problem to declare the copy function everywhere because it is not implemented
89 // for the SgSymbol IR nodes. I'm not clear why it is not implemented for these IR nodes.
90 /* \brief Copies AST (whole subtree, depending on the SgCopyHelp class */
91 // virtual SgNode* copy ( const SgCopyHelp & help) const;
92
94 virtual std::string class_name() const override;
95
97 virtual VariantT variantT() const override; // MS: new variant used in tree traversal
98
100 // King84 (2010.08.16): Moved this to an enum to save space, since it's only used at compiler-time anyway.
101 // static const VariantT static_variant = V_SgAsmNEStringTable;
102 enum { static_variant = V_SgAsmNEStringTable };
103
104 /* the generated cast function */
106 ROSE_DLL_API friend SgAsmNEStringTable* isSgAsmNEStringTable( SgNode * s );
107
109 ROSE_DLL_API friend const SgAsmNEStringTable* isSgAsmNEStringTable( const SgNode * s );
110
111 // ******************************************
112 // * Memory Pool / New / Delete
113 // ******************************************
114
115 public:
117 static const unsigned pool_size; //
119 static std::vector<unsigned char *> pools; //
121 static SgAsmNEStringTable * next_node; //
122
124 static unsigned long initializeStorageClassArray(SgAsmNEStringTableStorageClass *); //
125
127 static void clearMemoryPool(); //
128 static void deleteMemoryPool(); //
129
131 static void extendMemoryPoolForFileIO(); //
132
134 static SgAsmNEStringTable * getPointerFromGlobalIndex(unsigned long); //
136 static SgAsmNEStringTable * getPointerFromGlobalIndex(AstSpecificDataManagingClass *, unsigned long); //
137
139 static unsigned long getNumberOfValidNodesAndSetGlobalIndexInFreepointer(unsigned long); //
141 static void resetValidFreepointers(); //
143 static unsigned long getNumberOfLastValidPointer(); //
144
145
146#if defined(INLINE_FUNCTIONS)
148 inline void *operator new (size_t size);
149#else
151 void *operator new (size_t size);
152#endif
154 void operator delete (void* pointer, size_t size);
155
156 // DQ (4/5/2007): This is not the correct operator that we want, but appears to be required to compile ROSE with ROSE.
157 void operator delete (void* pointer)
158 {
159 // This is the generated delete operator...
160 SgAsmNEStringTable::operator delete (pointer,sizeof(SgAsmNEStringTable));
161 }
162
164 static size_t numberOfNodes();
165
167 static size_t memoryUsage();
168
169 // End of scope which started in IR nodes specific code
170 /* */
171
172 /* name Internal Functions
173 \brief Internal functions ... incomplete-documentation
174
175 These functions have been made public as part of the design, but they are suggested for internal use
176 or by particularly knowledgeable users for specialized tools or applications.
177
178 \internal We could not make these private because they are required by user for special purposes. And
179 it would be unwieldy to have many of the internal classes in ROSE be explicitly defined as friends.
180
181 */
182
183 // MS: 02/12/02 container of pointers to AST successor nodes used in the traversal
184 // overridden in every class by *generated* implementation
186 virtual std::vector<SgNode*> get_traversalSuccessorContainer() override;
187 // MS: 06/28/02 container of names of variables or container indices
188 // used used in the traversal to access AST successor nodes
189 // overridden in every class by *generated* implementation
192 virtual std::vector<std::string> get_traversalSuccessorNamesContainer() override;
193
194 // GB (09/25/2007): Functions for index-based access to traversal successors; these are hopefully a lot faster
195 // than all the vector copies. The implementation for these functions is generated for each class.
197 virtual size_t get_numberOfTraversalSuccessors() override;
199 virtual SgNode *get_traversalSuccessorByIndex(size_t idx) override;
201 virtual size_t get_childIndex(SgNode *child) override;
202
203#ifndef ROSE_USE_INTERNAL_FRONTEND_DEVELOPMENT
204 // MS: 08/16/2002 method for generating RTI information
206 virtual RTIReturnType roseRTI() override;
207#endif
208 /* */
209
210
211
212 /* name Deprecated Functions
213 \brief Deprecated functions ... incomplete-documentation
214
215 These functions have been deprecated from use.
216 */
217 /* */
218
220 virtual const char* sage_class_name() const override ROSE_DEPRECATED_FUNCTION;
221
222 // JJW (10/16/2008): Changed to a single function in Node.code, and put
223 // getVariant() in #if 0 block to prevent confusing Doxygen
224#if 0
226 virtual int variant() const ROSE_DEPRECATED_FUNCTION;
228 // virtual int getVariant() const ROSE_DEPRECATED_FUNCTION;
229#endif
230 /* */
231
232
233
234
235 public:
236 /* name Traversal Support Functions
237 \brief Traversal support functions ... incomplete-documentation
238
239 These functions have been made public as part of the design, but they are suggested for internal use
240 or by particularly knowledgable users for specialized tools or applications.
241 */
242 /* */
243
244 // DQ (11/26/2005): Support for visitor pattern mechanims
245 // (inferior to ROSE traversal mechanism, experimental).
249
250 /* DXN (08/09/2010): support for the classic visitor pattern done in GoF */
252 virtual void accept (ROSE_VisitorPattern & visitor) override;
253
254 // DQ (12/26/2005): Support for traversal based on the memory pool
257 static void traverseMemoryPoolNodes(ROSE_VisitTraversal & visit);
258
262
263 // DQ (2/9/2006): Added to support traversal over single representative of each IR node
264 // This traversal helps support internal tools that call static member functions.
265 // note: this function operates on the memory pools.
268 static void visitRepresentativeNode (ROSE_VisitTraversal & visit);
269 /* */
270
271 public:
272 /* NodeId support functions */
274 static SgNode* getNodeByNodeId(VariantT variantT, size_t poolIdx, size_t itemIdx);
277 static SgAsmNEStringTable* getNodeByNodeIdInternal(size_t poolIdx, size_t itemIdx);
280 static std::string getNodeIdString(SgAsmNEStringTable* sgnode);
281 static std::string getNodeIdStringInternal(SgAsmNEStringTable* sgnode);
282
283 public:
284 /* name Memory Allocation Functions
285 \brief Memory allocations functions ... incomplete-documentation
286
287 These functions have been made public as part of the design, but they are suggested for internal use
288 or by particularly knowledgable users for specialized tools or applications.
289 */
290 /* */
291
302 virtual bool isInMemoryPool() override;
303
314 virtual void checkDataMemberPointersIfInMemoryPool() override;
315
316 // DQ (4/30/2006): Modified to be a const function.
331 virtual std::vector<std::pair<SgNode*,std::string> > returnDataMemberPointers() const override;
332
343
355 virtual long getChildIndex( SgNode* childNode ) const override;
356
357 // DQ (9/2/2015): Since this function is generated by ROSETTA, we can't define the
358 // comment here (changed to be a C style comment and not be a doxygen comment).
359 /* \brief Constructor for use by AST File I/O Mechanism
360
361 This constructor permits the IR node to be rebuilt from the contiguously arranged data in memory
362 which obtained via fast binary file I/O from disk.
363 */
364 // SgAsmNEStringTable( SgAsmNEStringTableStorageClass& source );
365
366
367
368
369
370 // JH (10/24/2005): methods added to support the ast file IO
371 private:
372
373 /* name AST Memory Allocation Support Functions
374 \brief Memory allocations support....
375
376 These functions handle the low leve support of the memory allocation scheme which permits IR nodes to be allocated
377 in large contiguous blocks to reduce memory fragmentation, improve performance, support specialized access (AST traversals),
378 and support the AST File I/O Mechanism.
379 */
380 /* */
381
382 /* JH (10/24/2005): Two typedefs. The TestType notes the type every pointer is cast to before
383 we compare them. Since I had several problems with this, I decided to make a typdef to ensure
384 that I use the same type everywhere, if any changes are made. THe second one declares the type
385 (actually unsigned long) where teh pointer address gets converted to. On 64 bit platforms this
386 might got changed, but unfortunatly, the return types are still unsigned longs. There exists
387 a correspinding one in the AST_FILE_IO class!
388 */
389 // DQ (9/2/2015): This typedef is no longer used, we can't define the
390 // comment here (changed to be a C style comment and not be a doxygen comment).
391 /* \brief Typedef used for low level memory access.
392 */
393 // typedef unsigned char* TestType;
394
395 // DQ (9/2/2015): This typedef is no longer used, we can't define the
396 // comment here (changed to be a C style comment and not be a doxygen comment).
397 /* \brief Typedef used to hold memory addresses as values.
398 */
399 // typedef unsigned long AddressType;
400
401
402
403 // necessary, to have direct access to the p_freepointer and the private methods !
405 friend class AST_FILE_IO;
406
408 friend class SgAsmNEStringTableStorageClass;
409
411 friend class AstSpecificDataManagingClass;
412
414 friend class AstSpecificDataManagingClassStorageClass;
415 public:
417 SgAsmNEStringTable( const SgAsmNEStringTableStorageClass& source );
418
419 // private: // JJW hack
420 /*
421 name AST Memory Allocation Support Variables
422 Memory allocations support variables
423
424 These variables handle the low level support of the memory allocation scheme which permits IR nodes to be allocated
425 in large contiguous blocks to reduce memory fragmentation, improve performance, support specialized access (AST traversals),
426 and support the AST File I/O Mechanism.
427 */
428 /* */
429
430 public:
431
432 // DQ (11/21/2009): Added function to add new Regular Expression attributes and return pointer
433 // to current node (so that it will work cleanly with build functions to specify patterns).
434 // virtual SgNode* addRegExpAttribute();
441
442#ifndef _MSC_VER
443// Rasmussen (04/17/2019): Support for ATerms has been deprecated as it is no longer needed
444// and likely never fully implemented nor tested. Files remain in the src tree but are no
445// longer built.
446#define BUILD_ATERM_SUPPORT 0
447 #if BUILD_ATERM_SUPPORT
448 #ifdef ROSE_USE_ROSE_ATERM_SUPPORT
449 // DQ (10/4/2014): Adding ATerm support to ROSE.
459 // Rasmussen (1/7/2019): Added override to kill warning messages of overridden virtual function
460 virtual ATerm generate_ATerm() override;
461
463 virtual void generate_ATerm_Annotation(ATerm & term) override;
464 #endif
465 #endif // BUILD_ATERM_SUPPORT
466#endif
467 // These can't be virtual functions since we don't yet know what IR node to build (until we have read the aterm).
468 // virtual generate_AST(ATerm & term);
469 // virtual void read_ATerm_Annotation(ATerm & term);
470
471// *** COMMON CODE SECTION ENDS HERE ***
472
473
474// End of memberFunctionString
475// Start of memberFunctionString
476/* #line 706 "/workspace/src/ROSETTA/Grammar/Node.code" */
477
478 // the generated cast function
479 // friend ROSE_DLL_API SgAsmNEStringTable* isSgAsmNEStringTable ( SgNode* s );
480
481 typedef SgAsmGenericSection base_node_type;
482
483
484// End of memberFunctionString
485
486 protected:
487
489
490/* #line 21 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro" */
491
492
493 };
494#endif
495
496// postdeclarations for SgAsmNEStringTable
497
498/* #line 499 "../../../src/frontend/SageIII//SgAsmNEStringTable.h" */
499
500/* #line 27 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro after subst for $POSTDECLARATIONS" */
501
502/* #line 28 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro" */
503
504
505/* #line 506 "../../../src/frontend/SageIII//SgAsmNEStringTable.h" */
506
507#endif // ROSE_SgAsmNEStringTable_H
508
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.
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.