ROSE 0.11.145.192
SgAsmBinaryExpression.h
1
2#ifndef ROSE_SgAsmBinaryExpression_H
3#define ROSE_SgAsmBinaryExpression_H
4#include <RoseFirst.h>
5#include <Cxx_GrammarDeclarations.h>
6#include <SgAsmExpression.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 SgAsmBinaryExpression
23
24/* #line 25 "../../../src/frontend/SageIII//SgAsmBinaryExpression.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 SgAsmBinaryExpression
32class ROSE_DLL_API SgAsmBinaryExpression : public SgAsmExpression
33 {
34 public:
35
36
37/* #line 38 "../../../src/frontend/SageIII//SgAsmBinaryExpression.h" */
38
39 virtual SgNode* copy ( SgCopyHelp& help) const override;
40// Start of memberFunctionString
41/* #line 42006 "/workspace/src/ROSETTA/src/binaryInstruction.C" */
42
43
44 //----------------------- Boost serialization for SgAsmBinaryExpression -----------------------
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("SgAsmBinaryExpression");
52 s & BOOST_SERIALIZATION_BASE_OBJECT_NVP(SgAsmExpression);
53 s & BOOST_SERIALIZATION_NVP(p_lhs);
54 s & BOOST_SERIALIZATION_NVP(p_rhs);
55 debugSerializationEnd("SgAsmBinaryExpression");
56 }
57#endif // ROSE_HAVE_BOOST_SERIALIZATION_LIB
58public:
59public:
63 SgAsmExpression* const& get_lhs() const;
64 void set_lhs(SgAsmExpression* const&);
67public:
71 SgAsmExpression* const& get_rhs() const;
72 void set_rhs(SgAsmExpression* const&);
75public:
77 virtual ~SgAsmBinaryExpression();
78
79protected:
82
83protected:
86 SgAsmExpression* const& rhs);
87
88protected:
96
97
98// End of memberFunctionString
99// Start of memberFunctionString
100/* #line 1 "/workspace/src/ROSETTA/Grammar/Common.code" */
101
102// *** COMMON CODE SECTION BEGINS HERE ***
103
104 public:
105
106 // DQ (3/25/3006): I put this back in because it had the logic for where the copy function required
107 // and not required which is required to match the other aspects of the copy mechanism code generation.
108 // Specifically it is a problem to declare the copy function everywhere because it is not implemented
109 // for the SgSymbol IR nodes. I'm not clear why it is not implemented for these IR nodes.
110 /* \brief Copies AST (whole subtree, depending on the SgCopyHelp class */
111 // virtual SgNode* copy ( const SgCopyHelp & help) const;
112
114 virtual std::string class_name() const override;
115
117 virtual VariantT variantT() const override; // MS: new variant used in tree traversal
118
120 // King84 (2010.08.16): Moved this to an enum to save space, since it's only used at compiler-time anyway.
121 // static const VariantT static_variant = V_SgAsmBinaryExpression;
122 enum { static_variant = V_SgAsmBinaryExpression };
123
124 /* the generated cast function */
126 ROSE_DLL_API friend SgAsmBinaryExpression* isSgAsmBinaryExpression( SgNode * s );
127
129 ROSE_DLL_API friend const SgAsmBinaryExpression* isSgAsmBinaryExpression( const SgNode * s );
130
131 // ******************************************
132 // * Memory Pool / New / Delete
133 // ******************************************
134
135 public:
137 static const unsigned pool_size; //
139 static std::vector<unsigned char *> pools; //
141 static SgAsmBinaryExpression * next_node; //
142
144 static unsigned long initializeStorageClassArray(SgAsmBinaryExpressionStorageClass *); //
145
147 static void clearMemoryPool(); //
148 static void deleteMemoryPool(); //
149
151 static void extendMemoryPoolForFileIO(); //
152
154 static SgAsmBinaryExpression * getPointerFromGlobalIndex(unsigned long); //
156 static SgAsmBinaryExpression * getPointerFromGlobalIndex(AstSpecificDataManagingClass *, unsigned long); //
157
159 static unsigned long getNumberOfValidNodesAndSetGlobalIndexInFreepointer(unsigned long); //
161 static void resetValidFreepointers(); //
163 static unsigned long getNumberOfLastValidPointer(); //
164
165
166#if defined(INLINE_FUNCTIONS)
168 inline void *operator new (size_t size);
169#else
171 void *operator new (size_t size);
172#endif
174 void operator delete (void* pointer, size_t size);
175
176 // DQ (4/5/2007): This is not the correct operator that we want, but appears to be required to compile ROSE with ROSE.
177 void operator delete (void* pointer)
178 {
179 // This is the generated delete operator...
180 SgAsmBinaryExpression::operator delete (pointer,sizeof(SgAsmBinaryExpression));
181 }
182
184 static size_t numberOfNodes();
185
187 static size_t memoryUsage();
188
189 // End of scope which started in IR nodes specific code
190 /* */
191
192 /* name Internal Functions
193 \brief Internal functions ... incomplete-documentation
194
195 These functions have been made public as part of the design, but they are suggested for internal use
196 or by particularly knowledgeable users for specialized tools or applications.
197
198 \internal We could not make these private because they are required by user for special purposes. And
199 it would be unwieldy to have many of the internal classes in ROSE be explicitly defined as friends.
200
201 */
202
203 // MS: 02/12/02 container of pointers to AST successor nodes used in the traversal
204 // overridden in every class by *generated* implementation
206 virtual std::vector<SgNode*> get_traversalSuccessorContainer() override;
207 // MS: 06/28/02 container of names of variables or container indices
208 // used used in the traversal to access AST successor nodes
209 // overridden in every class by *generated* implementation
212 virtual std::vector<std::string> get_traversalSuccessorNamesContainer() override;
213
214 // GB (09/25/2007): Functions for index-based access to traversal successors; these are hopefully a lot faster
215 // than all the vector copies. The implementation for these functions is generated for each class.
217 virtual size_t get_numberOfTraversalSuccessors() override;
219 virtual SgNode *get_traversalSuccessorByIndex(size_t idx) override;
221 virtual size_t get_childIndex(SgNode *child) override;
222
223#ifndef ROSE_USE_INTERNAL_FRONTEND_DEVELOPMENT
224 // MS: 08/16/2002 method for generating RTI information
226 virtual RTIReturnType roseRTI() override;
227#endif
228 /* */
229
230
231
232 /* name Deprecated Functions
233 \brief Deprecated functions ... incomplete-documentation
234
235 These functions have been deprecated from use.
236 */
237 /* */
238
240 virtual const char* sage_class_name() const override ROSE_DEPRECATED_FUNCTION;
241
242 // JJW (10/16/2008): Changed to a single function in Node.code, and put
243 // getVariant() in #if 0 block to prevent confusing Doxygen
244#if 0
246 virtual int variant() const ROSE_DEPRECATED_FUNCTION;
248 // virtual int getVariant() const ROSE_DEPRECATED_FUNCTION;
249#endif
250 /* */
251
252
253
254
255 public:
256 /* name Traversal Support Functions
257 \brief Traversal support functions ... incomplete-documentation
258
259 These functions have been made public as part of the design, but they are suggested for internal use
260 or by particularly knowledgable users for specialized tools or applications.
261 */
262 /* */
263
264 // DQ (11/26/2005): Support for visitor pattern mechanims
265 // (inferior to ROSE traversal mechanism, experimental).
269
270 /* DXN (08/09/2010): support for the classic visitor pattern done in GoF */
272 virtual void accept (ROSE_VisitorPattern & visitor) override;
273
274 // DQ (12/26/2005): Support for traversal based on the memory pool
277 static void traverseMemoryPoolNodes(ROSE_VisitTraversal & visit);
278
282
283 // DQ (2/9/2006): Added to support traversal over single representative of each IR node
284 // This traversal helps support internal tools that call static member functions.
285 // note: this function operates on the memory pools.
288 static void visitRepresentativeNode (ROSE_VisitTraversal & visit);
289 /* */
290
291 public:
292 /* NodeId support functions */
294 static SgNode* getNodeByNodeId(VariantT variantT, size_t poolIdx, size_t itemIdx);
297 static SgAsmBinaryExpression* getNodeByNodeIdInternal(size_t poolIdx, size_t itemIdx);
300 static std::string getNodeIdString(SgAsmBinaryExpression* sgnode);
301 static std::string getNodeIdStringInternal(SgAsmBinaryExpression* sgnode);
302
303 public:
304 /* name Memory Allocation Functions
305 \brief Memory allocations functions ... incomplete-documentation
306
307 These functions have been made public as part of the design, but they are suggested for internal use
308 or by particularly knowledgable users for specialized tools or applications.
309 */
310 /* */
311
322 virtual bool isInMemoryPool() override;
323
334 virtual void checkDataMemberPointersIfInMemoryPool() override;
335
336 // DQ (4/30/2006): Modified to be a const function.
351 virtual std::vector<std::pair<SgNode*,std::string> > returnDataMemberPointers() const override;
352
363
375 virtual long getChildIndex( SgNode* childNode ) const override;
376
377 // DQ (9/2/2015): Since this function is generated by ROSETTA, we can't define the
378 // comment here (changed to be a C style comment and not be a doxygen comment).
379 /* \brief Constructor for use by AST File I/O Mechanism
380
381 This constructor permits the IR node to be rebuilt from the contiguously arranged data in memory
382 which obtained via fast binary file I/O from disk.
383 */
384 // SgAsmBinaryExpression( SgAsmBinaryExpressionStorageClass& source );
385
386
387
388
389
390 // JH (10/24/2005): methods added to support the ast file IO
391 private:
392
393 /* name AST Memory Allocation Support Functions
394 \brief Memory allocations support....
395
396 These functions handle the low leve support of the memory allocation scheme which permits IR nodes to be allocated
397 in large contiguous blocks to reduce memory fragmentation, improve performance, support specialized access (AST traversals),
398 and support the AST File I/O Mechanism.
399 */
400 /* */
401
402 /* JH (10/24/2005): Two typedefs. The TestType notes the type every pointer is cast to before
403 we compare them. Since I had several problems with this, I decided to make a typdef to ensure
404 that I use the same type everywhere, if any changes are made. THe second one declares the type
405 (actually unsigned long) where teh pointer address gets converted to. On 64 bit platforms this
406 might got changed, but unfortunatly, the return types are still unsigned longs. There exists
407 a correspinding one in the AST_FILE_IO class!
408 */
409 // DQ (9/2/2015): This typedef is no longer used, we can't define the
410 // comment here (changed to be a C style comment and not be a doxygen comment).
411 /* \brief Typedef used for low level memory access.
412 */
413 // typedef unsigned char* TestType;
414
415 // DQ (9/2/2015): This typedef is no longer used, we can't define the
416 // comment here (changed to be a C style comment and not be a doxygen comment).
417 /* \brief Typedef used to hold memory addresses as values.
418 */
419 // typedef unsigned long AddressType;
420
421
422
423 // necessary, to have direct access to the p_freepointer and the private methods !
425 friend class AST_FILE_IO;
426
428 friend class SgAsmBinaryExpressionStorageClass;
429
431 friend class AstSpecificDataManagingClass;
432
434 friend class AstSpecificDataManagingClassStorageClass;
435 public:
437 SgAsmBinaryExpression( const SgAsmBinaryExpressionStorageClass& source );
438
439 // private: // JJW hack
440 /*
441 name AST Memory Allocation Support Variables
442 Memory allocations support variables
443
444 These variables handle the low level support of the memory allocation scheme which permits IR nodes to be allocated
445 in large contiguous blocks to reduce memory fragmentation, improve performance, support specialized access (AST traversals),
446 and support the AST File I/O Mechanism.
447 */
448 /* */
449
450 public:
451
452 // DQ (11/21/2009): Added function to add new Regular Expression attributes and return pointer
453 // to current node (so that it will work cleanly with build functions to specify patterns).
454 // virtual SgNode* addRegExpAttribute();
461
462#ifndef _MSC_VER
463// Rasmussen (04/17/2019): Support for ATerms has been deprecated as it is no longer needed
464// and likely never fully implemented nor tested. Files remain in the src tree but are no
465// longer built.
466#define BUILD_ATERM_SUPPORT 0
467 #if BUILD_ATERM_SUPPORT
468 #ifdef ROSE_USE_ROSE_ATERM_SUPPORT
469 // DQ (10/4/2014): Adding ATerm support to ROSE.
479 // Rasmussen (1/7/2019): Added override to kill warning messages of overridden virtual function
480 virtual ATerm generate_ATerm() override;
481
483 virtual void generate_ATerm_Annotation(ATerm & term) override;
484 #endif
485 #endif // BUILD_ATERM_SUPPORT
486#endif
487 // These can't be virtual functions since we don't yet know what IR node to build (until we have read the aterm).
488 // virtual generate_AST(ATerm & term);
489 // virtual void read_ATerm_Annotation(ATerm & term);
490
491// *** COMMON CODE SECTION ENDS HERE ***
492
493
494// End of memberFunctionString
495// Start of memberFunctionString
496/* #line 706 "/workspace/src/ROSETTA/Grammar/Node.code" */
497
498 // the generated cast function
499 // friend ROSE_DLL_API SgAsmBinaryExpression* isSgAsmBinaryExpression ( SgNode* s );
500
501 typedef SgAsmExpression base_node_type;
502
503
504// End of memberFunctionString
505
506
507
508 protected:
509// Start of memberFunctionString
510SgAsmExpression* p_lhs;
511
512// End of memberFunctionString
513// Start of memberFunctionString
514SgAsmExpression* p_rhs;
515
516// End of memberFunctionString
517
519 friend struct Rose::Traits::generated::describe_field_t<SgAsmBinaryExpression, SgAsmExpression*,&SgAsmBinaryExpression::p_lhs>;
520 friend struct Rose::Traits::generated::describe_field_t<SgAsmBinaryExpression, SgAsmExpression*,&SgAsmBinaryExpression::p_rhs>;
521
522/* #line 21 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro" */
523
524
525 };
526#endif
527
528// postdeclarations for SgAsmBinaryExpression
529
530/* #line 531 "../../../src/frontend/SageIII//SgAsmBinaryExpression.h" */
531
532/* #line 27 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro after subst for $POSTDECLARATIONS" */
533
534/* #line 28 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro" */
535
536
537/* #line 538 "../../../src/frontend/SageIII//SgAsmBinaryExpression.h" */
538
539#endif // ROSE_SgAsmBinaryExpression_H
540
Class holding static data and functions supporting File I/O.
Definition AST_FILE_IO.h:19
Attribute containing a regex expression as a string.
Base class for binary expressions.
Base class for expressions.
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.