ROSE 0.11.145.247
SgAsmLESectionTableEntry.h
1
2#ifndef ROSE_SgAsmLESectionTableEntry_H
3#define ROSE_SgAsmLESectionTableEntry_H
4#include <RoseFirst.h>
5#include <Cxx_GrammarDeclarations.h>
6#include <SgAsmExecutableFileFormat.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 SgAsmLESectionTableEntry
23
24/* #line 25 "../../../src/frontend/SageIII//SgAsmLESectionTableEntry.h" */
25/* #line 7612 "/workspace/src/ROSETTA/src/binaryInstruction.C" */
26
27#include <Rose/BinaryAnalysis/Address.h>
28#include <Rose/BinaryAnalysis/ByteOrder.h>
29
30
31/* #line 13 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro after subst for $PREDECLARATIONS" */
32
33/* #line 14 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro" */
34
35#if !defined(DOCUMENTATION)
36// Class Definition for SgAsmLESectionTableEntry
38 {
39 public:
40
41
42/* #line 43 "../../../src/frontend/SageIII//SgAsmLESectionTableEntry.h" */
43
44 virtual SgNode* copy ( SgCopyHelp& help) const override;
45// Start of memberFunctionString
46/* #line 7658 "/workspace/src/ROSETTA/src/binaryInstruction.C" */
47
48
49 //----------------------- Boost serialization for SgAsmLESectionTableEntry -----------------------
50#ifdef ROSE_ENABLE_BOOST_SERIALIZATION
51private:
52 friend class boost::serialization::access;
53
54 template<class S>
55 void serialize(S &s, const unsigned /*version*/) {
56 debugSerializationBegin("SgAsmLESectionTableEntry");
57 s & BOOST_SERIALIZATION_BASE_OBJECT_NVP(SgAsmExecutableFileFormat);
58 s & BOOST_SERIALIZATION_NVP(p_flags);
59 s & BOOST_SERIALIZATION_NVP(p_pageMapIndex);
60 s & BOOST_SERIALIZATION_NVP(p_pageMapNEntries);
61 s & BOOST_SERIALIZATION_NVP(p_res1);
62 s & BOOST_SERIALIZATION_NVP(p_mappedSize);
63 s & BOOST_SERIALIZATION_NVP(p_baseAddr);
64 debugSerializationEnd("SgAsmLESectionTableEntry");
65 }
66#endif // ROSE_ENABLE_BOOST_SERIALIZATION
68 // Local types
70public:
71#ifdef _MSC_VER
72# pragma pack (1)
73#endif
74 /* File format of a section table entry. Fields are big- or little-endian depending on file header. */
75 struct LESectionTableEntry_disk {
76 uint32_t mapped_size; /* 0x00 virtual segment size in bytes */
77 uint32_t base_addr; /* 0x04 relocation base address */
78 uint32_t flags; /* 0x08 bit flags, see LESectionFlags */
79 uint32_t pagemap_index; /* 0x0c */
80 uint32_t pagemap_nentries; /* 0x10 number of entries in the page map */
81 uint32_t res1; /* 0x14 reserved */
82 } /* 0x18 */
83// DQ (3/7/2013): Adding support to restrict visability to SWIG.
84#ifndef SWIG
85#ifndef _MSC_VER
86 __attribute__((packed))
87#endif
88#endif
89 ;
90#ifdef _MSC_VER
91# pragma pack ()
92#endif
93
94 /* SF_BIG_BIT: The "big/default" bit, for data segments, controls the setting of the Big bit in the segment descriptor. (The
95 * Big bit, or B-bit, determines whether ESP or SP is used as the stack pointer.) For code segments, this bit
96 * controls the setting of the Default bit in the segment descriptor. (The Default bit, or D-bit, determines
97 * whether the default word size is 32-bits or 16-bits. It also affects the interpretation of the instruction
98 * stream.) */
99 enum LESectionFlags {
100 SF_RESERVED = 0xffff0800, /* Reserved bits (FIXME) */
101
102 SF_READABLE = 0x00000001,
103 SF_WRITABLE = 0x00000002,
104 SF_EXECUTABLE = 0x00000004,
106 SF_RESOURCE = 0x00000008,
107 SF_DISCARDABLE = 0x00000010,
108 SF_SHARED = 0x00000020,
109 SF_PRELOAD_PAGES = 0x00000040,
110 SF_INVALID_PAGES = 0x00000080,
112 SF_TYPE_MASK = 0x00000300, /*NO_STRINGIFY*/
113 SF_TYPE_NORMAL = 0x00000000,
114 SF_TYPE_ZERO = 0x00000100,
115 SF_TYPE_RESIDENT = 0x00000200,
116 SF_TYPE_RESCONT = 0x00000300,
118 SF_RES_LONG_LOCK = 0x00000400,
119 SF_1616_ALIAS = 0x00001000,
120 SF_BIG_BIT = 0x00002000,
121 SF_CODE_CONFORM = 0x00004000,
122 SF_IO_PRIV = 0x00008000
123 };
124
126 // Properties
128public:
129public:
130 unsigned const& get_flags() const;
131 void set_flags(unsigned const&);
132
133public:
134 unsigned const& get_pageMapIndex() const;
135 void set_pageMapIndex(unsigned const&);
136
137public:
138 unsigned const& get_pageMapNEntries() const;
139 void set_pageMapNEntries(unsigned const&);
140
141public:
142 unsigned const& get_res1() const;
143 void set_res1(unsigned const&);
144
145public:
146 Rose::BinaryAnalysis::Address const& get_mappedSize() const;
147 void set_mappedSize(Rose::BinaryAnalysis::Address const&);
148
149public:
150 Rose::BinaryAnalysis::Address const& get_baseAddr() const;
151 void set_baseAddr(Rose::BinaryAnalysis::Address const&);
153 // Functions
155public:
159 virtual void dump(FILE *f, const char *prefix, ssize_t idx) const;
160
162 // Deprecated 2023-11
164public:
165 unsigned get_pagemap_index() const ROSE_DEPRECATED("use get pageMapIndex");
166 void set_pagemap_index(unsigned) ROSE_DEPRECATED("use set_pageMapIndex");
167 unsigned get_pagemap_nentries() const ROSE_DEPRECATED("use get_pageMapNEntries");
168 void set_pagemap_nentries(unsigned) ROSE_DEPRECATED("use set_pageMapNEntries");
169 Rose::BinaryAnalysis::Address get_mapped_size() const ROSE_DEPRECATED("use get_mappedSize");
170 void set_mapped_size(Rose::BinaryAnalysis::Address) ROSE_DEPRECATED("use set_mappedSize");
171 Rose::BinaryAnalysis::Address get_base_addr() const ROSE_DEPRECATED("use get_baseAddr");
172 void set_base_addr(Rose::BinaryAnalysis::Address) ROSE_DEPRECATED("use set_baseAddr");
173public:
175 virtual ~SgAsmLESectionTableEntry();
176
177public:
180
181protected:
188 void initializeProperties();
189
190
191// End of memberFunctionString
192// Start of memberFunctionString
193/* #line 1 "/workspace/src/ROSETTA/Grammar/Common.code" */
194
195// *** COMMON CODE SECTION BEGINS HERE ***
196
197 public:
198
199 // DQ (3/25/3006): I put this back in because it had the logic for where the copy function required
200 // and not required which is required to match the other aspects of the copy mechanism code generation.
201 // Specifically it is a problem to declare the copy function everywhere because it is not implemented
202 // for the SgSymbol IR nodes. I'm not clear why it is not implemented for these IR nodes.
203 /* \brief Copies AST (whole subtree, depending on the SgCopyHelp class */
204 // virtual SgNode* copy ( const SgCopyHelp & help) const;
205
207 virtual std::string class_name() const override;
208
210 virtual VariantT variantT() const override; // MS: new variant used in tree traversal
211
213 // King84 (2010.08.16): Moved this to an enum to save space, since it's only used at compiler-time anyway.
214 // static const VariantT static_variant = V_SgAsmLESectionTableEntry;
215 enum { static_variant = V_SgAsmLESectionTableEntry };
216
217 /* the generated cast function */
219 ROSE_DLL_API friend SgAsmLESectionTableEntry* isSgAsmLESectionTableEntry( SgNode * s );
220
222 ROSE_DLL_API friend const SgAsmLESectionTableEntry* isSgAsmLESectionTableEntry( const SgNode * s );
223
224 // ******************************************
225 // * Memory Pool / New / Delete
226 // ******************************************
227
228 public:
230 static const unsigned pool_size; //
232 static std::vector<unsigned char *> pools; //
234 static SgAsmLESectionTableEntry * next_node; //
235
237 static unsigned long initializeStorageClassArray(SgAsmLESectionTableEntryStorageClass *); //
238
240 static void clearMemoryPool(); //
241 static void deleteMemoryPool(); //
242
244 static void extendMemoryPoolForFileIO(); //
245
247 static SgAsmLESectionTableEntry * getPointerFromGlobalIndex(unsigned long); //
249 static SgAsmLESectionTableEntry * getPointerFromGlobalIndex(AstSpecificDataManagingClass *, unsigned long); //
250
252 static unsigned long getNumberOfValidNodesAndSetGlobalIndexInFreepointer(unsigned long); //
254 static void resetValidFreepointers(); //
256 static unsigned long getNumberOfLastValidPointer(); //
257
258
259#if defined(INLINE_FUNCTIONS)
261 inline void *operator new (size_t size);
262#else
264 void *operator new (size_t size);
265#endif
267 void operator delete (void* pointer, size_t size);
268
269 // DQ (4/5/2007): This is not the correct operator that we want, but appears to be required to compile ROSE with ROSE.
270 void operator delete (void* pointer)
271 {
272 // This is the generated delete operator...
273 SgAsmLESectionTableEntry::operator delete (pointer,sizeof(SgAsmLESectionTableEntry));
274 }
275
277 static size_t numberOfNodes();
278
280 static size_t memoryUsage();
281
282 // End of scope which started in IR nodes specific code
283 /* */
284
285 /* name Internal Functions
286 \brief Internal functions ... incomplete-documentation
287
288 These functions have been made public as part of the design, but they are suggested for internal use
289 or by particularly knowledgeable users for specialized tools or applications.
290
291 \internal We could not make these private because they are required by user for special purposes. And
292 it would be unwieldy to have many of the internal classes in ROSE be explicitly defined as friends.
293
294 */
295
296 // MS: 02/12/02 container of pointers to AST successor nodes used in the traversal
297 // overridden in every class by *generated* implementation
299 virtual std::vector<SgNode*> get_traversalSuccessorContainer() const override;
300 // MS: 06/28/02 container of names of variables or container indices
301 // used used in the traversal to access AST successor nodes
302 // overridden in every class by *generated* implementation
305 virtual std::vector<std::string> get_traversalSuccessorNamesContainer() const override;
306
307 // GB (09/25/2007): Functions for index-based access to traversal successors; these are hopefully a lot faster
308 // than all the vector copies. The implementation for these functions is generated for each class.
310 virtual size_t get_numberOfTraversalSuccessors() const override;
312 virtual SgNode *get_traversalSuccessorByIndex(size_t idx) const override;
314 virtual size_t get_childIndex(SgNode *child) const override;
315
316#ifndef ROSE_USE_INTERNAL_FRONTEND_DEVELOPMENT
317 // MS: 08/16/2002 method for generating RTI information
319 virtual RTIReturnType roseRTI() override;
320#endif
321 /* */
322
323
324
325 /* name Deprecated Functions
326 \brief Deprecated functions ... incomplete-documentation
327
328 These functions have been deprecated from use.
329 */
330 /* */
331
333 virtual const char* sage_class_name() const override ROSE_DEPRECATED_FUNCTION;
334
335 // JJW (10/16/2008): Changed to a single function in Node.code, and put
336 // getVariant() in #if 0 block to prevent confusing Doxygen
337#if 0
339 virtual int variant() const ROSE_DEPRECATED_FUNCTION;
341 // virtual int getVariant() const ROSE_DEPRECATED_FUNCTION;
342#endif
343 /* */
344
345
346
347
348 public:
349 /* name Traversal Support Functions
350 \brief Traversal support functions ... incomplete-documentation
351
352 These functions have been made public as part of the design, but they are suggested for internal use
353 or by particularly knowledgable users for specialized tools or applications.
354 */
355 /* */
356
357 // DQ (11/26/2005): Support for visitor pattern mechanims
358 // (inferior to ROSE traversal mechanism, experimental).
362
363 /* DXN (08/09/2010): support for the classic visitor pattern done in GoF */
365 virtual void accept (ROSE_VisitorPattern & visitor) override;
366
367 // DQ (12/26/2005): Support for traversal based on the memory pool
370 static void traverseMemoryPoolNodes(ROSE_VisitTraversal & visit);
371
375
376 // DQ (2/9/2006): Added to support traversal over single representative of each IR node
377 // This traversal helps support internal tools that call static member functions.
378 // note: this function operates on the memory pools.
381 static void visitRepresentativeNode (ROSE_VisitTraversal & visit);
382 /* */
383
384 public:
385 /* NodeId support functions */
387 static SgNode* getNodeByNodeId(VariantT variantT, size_t poolIdx, size_t itemIdx);
390 static SgAsmLESectionTableEntry* getNodeByNodeIdInternal(size_t poolIdx, size_t itemIdx);
393 static std::string getNodeIdString(SgAsmLESectionTableEntry* sgnode);
394 static std::string getNodeIdStringInternal(SgAsmLESectionTableEntry* sgnode);
395
396 public:
397 /* name Memory Allocation Functions
398 \brief Memory allocations functions ... incomplete-documentation
399
400 These functions have been made public as part of the design, but they are suggested for internal use
401 or by particularly knowledgable users for specialized tools or applications.
402 */
403 /* */
404
415 virtual bool isInMemoryPool() override;
416
427 virtual void checkDataMemberPointersIfInMemoryPool() override;
428
429 // DQ (4/30/2006): Modified to be a const function.
444 virtual std::vector<std::pair<SgNode*,std::string> > returnDataMemberPointers() const override;
445
456
468 virtual long getChildIndex( SgNode* childNode ) const override;
469
470 // DQ (9/2/2015): Since this function is generated by ROSETTA, we can't define the
471 // comment here (changed to be a C style comment and not be a doxygen comment).
472 /* \brief Constructor for use by AST File I/O Mechanism
473
474 This constructor permits the IR node to be rebuilt from the contiguously arranged data in memory
475 which obtained via fast binary file I/O from disk.
476 */
477 // SgAsmLESectionTableEntry( SgAsmLESectionTableEntryStorageClass& source );
478
479
480
481
482
483 // JH (10/24/2005): methods added to support the ast file IO
484 private:
485
486 /* name AST Memory Allocation Support Functions
487 \brief Memory allocations support....
488
489 These functions handle the low leve support of the memory allocation scheme which permits IR nodes to be allocated
490 in large contiguous blocks to reduce memory fragmentation, improve performance, support specialized access (AST traversals),
491 and support the AST File I/O Mechanism.
492 */
493 /* */
494
495 /* JH (10/24/2005): Two typedefs. The TestType notes the type every pointer is cast to before
496 we compare them. Since I had several problems with this, I decided to make a typdef to ensure
497 that I use the same type everywhere, if any changes are made. THe second one declares the type
498 (actually unsigned long) where teh pointer address gets converted to. On 64 bit platforms this
499 might got changed, but unfortunatly, the return types are still unsigned longs. There exists
500 a correspinding one in the AST_FILE_IO class!
501 */
502 // DQ (9/2/2015): This typedef is no longer used, we can't define the
503 // comment here (changed to be a C style comment and not be a doxygen comment).
504 /* \brief Typedef used for low level memory access.
505 */
506 // typedef unsigned char* TestType;
507
508 // DQ (9/2/2015): This typedef is no longer used, we can't define the
509 // comment here (changed to be a C style comment and not be a doxygen comment).
510 /* \brief Typedef used to hold memory addresses as values.
511 */
512 // typedef unsigned long AddressType;
513
514
515
516 // necessary, to have direct access to the p_freepointer and the private methods !
518 friend class AST_FILE_IO;
519
521 friend class SgAsmLESectionTableEntryStorageClass;
522
524 friend class AstSpecificDataManagingClass;
525
527 friend class AstSpecificDataManagingClassStorageClass;
528 public:
530 SgAsmLESectionTableEntry( const SgAsmLESectionTableEntryStorageClass& source );
531
532 // private: // JJW hack
533 /*
534 name AST Memory Allocation Support Variables
535 Memory allocations support variables
536
537 These variables handle the low level support of the memory allocation scheme which permits IR nodes to be allocated
538 in large contiguous blocks to reduce memory fragmentation, improve performance, support specialized access (AST traversals),
539 and support the AST File I/O Mechanism.
540 */
541 /* */
542
543 public:
544
545 // DQ (11/21/2009): Added function to add new Regular Expression attributes and return pointer
546 // to current node (so that it will work cleanly with build functions to specify patterns).
547 // virtual SgNode* addRegExpAttribute();
554
555#ifndef _MSC_VER
556// Rasmussen (04/17/2019): Support for ATerms has been deprecated as it is no longer needed
557// and likely never fully implemented nor tested. Files remain in the src tree but are no
558// longer built.
559#define BUILD_ATERM_SUPPORT 0
560 #if BUILD_ATERM_SUPPORT
561 #ifdef ROSE_USE_ROSE_ATERM_SUPPORT
562 // DQ (10/4/2014): Adding ATerm support to ROSE.
572 // Rasmussen (1/7/2019): Added override to kill warning messages of overridden virtual function
573 virtual ATerm generate_ATerm() override;
574
576 virtual void generate_ATerm_Annotation(ATerm & term) override;
577 #endif
578 #endif // BUILD_ATERM_SUPPORT
579#endif
580 // These can't be virtual functions since we don't yet know what IR node to build (until we have read the aterm).
581 // virtual generate_AST(ATerm & term);
582 // virtual void read_ATerm_Annotation(ATerm & term);
583
584// *** COMMON CODE SECTION ENDS HERE ***
585
586
587// End of memberFunctionString
588// Start of memberFunctionString
589/* #line 710 "/workspace/src/ROSETTA/Grammar/Node.code" */
590
591 // the generated cast function
592 // friend ROSE_DLL_API SgAsmLESectionTableEntry* isSgAsmLESectionTableEntry ( SgNode* s );
593
594 typedef SgAsmExecutableFileFormat base_node_type;
595
596
597// End of memberFunctionString
598
599
600
601
602
603
604
605 protected:
606// Start of memberFunctionString
607unsigned p_flags;
608
609// End of memberFunctionString
610// Start of memberFunctionString
611unsigned p_pageMapIndex;
612
613// End of memberFunctionString
614// Start of memberFunctionString
615unsigned p_pageMapNEntries;
616
617// End of memberFunctionString
618// Start of memberFunctionString
619unsigned p_res1;
620
621// End of memberFunctionString
622// Start of memberFunctionString
624
625// End of memberFunctionString
626// Start of memberFunctionString
628
629// End of memberFunctionString
630
632 friend struct Rose::Traits::generated::describe_field_t<SgAsmLESectionTableEntry, unsigned,&SgAsmLESectionTableEntry::p_flags>;
633 friend struct Rose::Traits::generated::describe_field_t<SgAsmLESectionTableEntry, unsigned,&SgAsmLESectionTableEntry::p_pageMapIndex>;
634 friend struct Rose::Traits::generated::describe_field_t<SgAsmLESectionTableEntry, unsigned,&SgAsmLESectionTableEntry::p_pageMapNEntries>;
635 friend struct Rose::Traits::generated::describe_field_t<SgAsmLESectionTableEntry, unsigned,&SgAsmLESectionTableEntry::p_res1>;
636 friend struct Rose::Traits::generated::describe_field_t<SgAsmLESectionTableEntry, Rose::BinaryAnalysis::Address,&SgAsmLESectionTableEntry::p_mappedSize>;
637 friend struct Rose::Traits::generated::describe_field_t<SgAsmLESectionTableEntry, Rose::BinaryAnalysis::Address,&SgAsmLESectionTableEntry::p_baseAddr>;
638
639/* #line 21 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro" */
640
641
642 };
643#endif
644
645// postdeclarations for SgAsmLESectionTableEntry
646
647/* #line 648 "../../../src/frontend/SageIII//SgAsmLESectionTableEntry.h" */
648
649/* #line 27 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro after subst for $POSTDECLARATIONS" */
650
651/* #line 28 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro" */
652
653
654/* #line 655 "../../../src/frontend/SageIII//SgAsmLESectionTableEntry.h" */
655
656#endif // ROSE_SgAsmLESectionTableEntry_H
657
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 many binary analysis nodes.
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 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
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.
The ROSE library.
void copy(const Word *src, const BitRange &srcRange, Word *dst, const BitRange &dstRange)
Copy some bits.
const char * LESectionFlags(int64_t)
Convert SgAsmLESectionTableEntry::LESectionFlags enum constant to a string.