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