SgAsmBlock.h

 
#ifndef ROSE_SgAsmBlock_H
#define ROSE_SgAsmBlock_H
#include <RoseFirst.h>
#include <Cxx_GrammarDeclarations.h>
#include <SgAsmStatement.h>
 
 
 
/* #line 1 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro" */
 
// WARNING -- GENERATED CODE -- DO NOT MODIFY THIS CODE -- WARNING!
//      This code is automatically generated for each 
//      terminal and non-terminal within the defined 
//      grammar.  There is a simple way to change the 
//      code to fix bugs etc.  See the ROSE README file
//      for directions.
 
// tps: (02/22/2010): Adding DLL export requirements
#include "rosedll.h"
 
// predeclarations for SgAsmBlock
 
/* #line 25 "../../../src/frontend/SageIII//SgAsmBlock.h" */
/* #line 41122 "/workspace/src/ROSETTA/src/binaryInstruction.C" */
 
#include <Rose/BinaryAnalysis/Address.h>
 
#include <sageContainer.h>
 
#ifdef ROSE_SgAsmBlock_IMPL
#include <SgAsmInstruction.h>                           // for SgAsmInstruction::INVALID_STACK_DELTA
#endif
 
 
/* #line 13 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro after subst for $PREDECLARATIONS" */
 
/* #line 14 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro" */
 
#if !defined(DOCUMENTATION)
// Class Definition for SgAsmBlock
class ROSE_DLL_API SgAsmBlock  : public SgAsmStatement
   {
     public:
 
 
/* #line 48 "../../../src/frontend/SageIII//SgAsmBlock.h" */
 
          virtual SgNode* copy ( SgCopyHelp& help) const override;
// Start of memberFunctionString
/* #line 41211 "/workspace/src/ROSETTA/src/binaryInstruction.C" */
 
 
    //----------------------- Boost serialization for SgAsmBlock -----------------------
#ifdef ROSE_ENABLE_BOOST_SERIALIZATION
private:
    friend class boost::serialization::access;
 
    template<class S>
    void serialize(S &s, const unsigned /*version*/) {
        debugSerializationBegin("SgAsmBlock");
        s & BOOST_SERIALIZATION_BASE_OBJECT_NVP(SgAsmStatement);
        s & BOOST_SERIALIZATION_NVP(p_reason);
        s & BOOST_SERIALIZATION_NVP(p_statementList);
        s & BOOST_SERIALIZATION_NVP(p_successors);
        s & BOOST_SERIALIZATION_NVP(p_successorsComplete);
        s & BOOST_SERIALIZATION_NVP(p_immediateDominator);
        s & BOOST_SERIALIZATION_NVP(p_cachedVertex);
        s & BOOST_SERIALIZATION_NVP(p_codeLikelihood);
        s & BOOST_SERIALIZATION_NVP(p_stackDeltaOut);
        debugSerializationEnd("SgAsmBlock");
    }
#endif // ROSE_ENABLE_BOOST_SERIALIZATION
    // Local types
public:
    enum Reason {
        // Please update SgAsmBlock::reasonString() if you change this enum!
        BLK_NONE        = 0x00000000,           
        BLK_ENTRY_POINT = 0x00010000,           
        BLK_PADDING     = 0x00020000,           
        BLK_FRAGMENT    = 0x00080000,           
        BLK_CFGHEAD     = 0x00100000,           
        BLK_USERDEF     = 0x00200000,           
        BLK_LEFTOVERS   = 0x00400000,           
        BLK_JUMPTABLE   = 0x00800000,           
        BLK_GRAPH1      = 0x01000000,           
        BLK_GRAPH2      = 0x02000000,           
        BLK_GRAPH3      = 0x04000000,           
        BLK_DEFAULT     = BLK_NONE,             //NO_STRINGIFY
 
        // ========= Miscellaneous Reasons ===========================================================================
        // The first half of the range (1-127, inclusive) is used for algorithms defined by ROSE.  The second half is
        // availalble for users to use as they see fit.
        BLK_MISCMASK    = 0x000000ff,           
        BLK_FINDDATA    = 0x00000001,           
        BLK_POSTFUNC    = 0x00000002            
    };
 
    // Properties
public:
 
    // FIXME[Robb Matzke 2023-03-18]: is the lack of serialization a bug?
public:
    Rose::BinaryAnalysis::Address const& get_id() const;
    void set_id(Rose::BinaryAnalysis::Address const&);
public:
    unsigned const& get_reason() const;
    void set_reason(unsigned const&);
    // statementList and successors should have been pointers to nodes that contain the list rather than being the lists
    // themselves because ROSETTA doesn't allow traversals on multiple list data members--we can traverse either one list or
    // the other, but not both.  It's too late to change how this part of the AST is structured because so much user code
    // already depends on it, therefore we can only traverse statementList and not successors. [Robb Matzke 2016-02-25]
public:
    SgAsmStatementPtrList const& get_statementList() const;
    SgAsmStatementPtrList& get_statementList();
    void set_statementList(SgAsmStatementPtrList const&);
    // statementList and successors should have been pointers to nodes that contain the list rather than being the lists
    // themselves because ROSETTA doesn't allow traversals on multiple list data members--we can traverse either one list or
    // the other, but not both.  It's too late to change how this part of the AST is structured because so much user code
    // already depends on it, therefore we can only traverse statementList and not successors. [Robb Matzke 2016-02-25]
public:
    SgAsmIntegerValuePtrList const& get_successors() const;
    SgAsmIntegerValuePtrList& get_successors();
    void set_successors(SgAsmIntegerValuePtrList const&);
public:
    bool const& get_successorsComplete() const;
    void set_successorsComplete(bool const&);
public:
    SgAsmBlock* const& get_immediateDominator() const;
    void set_immediateDominator(SgAsmBlock* const&);
public:
    size_t const& get_cachedVertex() const;
    void set_cachedVertex(size_t const&);
 // see BinaryAnalysis::ControlFlow
public:
    double const& get_codeLikelihood() const;
    void set_codeLikelihood(double const&);
public:
    int64_t const& get_stackDeltaOut() const;
    void set_stackDeltaOut(int64_t const&);
    // Functions
public:
    void appendStatement(SgAsmStatement*);
 
    void removeStatement(SgAsmStatement*);
 
    // FIXME[Robb P Matzke 2017-02-13]: wrong name -- erases only statements, not all children
    void removeChildren();
 
    Rose::BinaryAnalysis::Address get_fallthroughVa();
 
    SgAsmFunction *get_enclosingFunction() const;
 
    bool hasInstructions() const;
 
    bool isBasicBlock() const;
 
    bool isFunctionCall(Rose::BinaryAnalysis::Address &target_va/*out*/, Rose::BinaryAnalysis::Address &return_va/*out*/);
 
    static std::string reasonKey(const std::string &prefix = "");
 
    std::string reasonString(bool pad) const;
 
    static std::string reasonString(bool pad, unsigned reason);
 
    // Deprecated
 
    // [Robb Matzke 2023-11-06]: deprecated 2023-11
    bool get_successors_complete() const ROSE_DEPRECATED("use get_successorsComplete");
    void set_successors_complete(bool) ROSE_DEPRECATED("use get_successorsComplete");
    SgAsmBlock* get_immediate_dominator() const ROSE_DEPRECATED("use get_immediateDominator");
    void set_immediate_dominator(SgAsmBlock*) ROSE_DEPRECATED("use set_immediateDominator");
    size_t get_cached_vertex() const ROSE_DEPRECATED("use get_cachedVertex");
    void set_cached_vertex(size_t) ROSE_DEPRECATED("use set_cachedVertex");
    double get_code_likelihood() const ROSE_DEPRECATED("use get_codeLikelihood");
    void set_code_likelihood(double) ROSE_DEPRECATED("use set_codeLikelihood");
    void append_statement(SgAsmStatement*) ROSE_DEPRECATED("use appendStatement");
    void remove_statement(SgAsmStatement*) ROSE_DEPRECATED("use removeStatement");
    void remove_children() ROSE_DEPRECATED("use removeChildren");
    Rose::BinaryAnalysis::Address get_fallthrough_va() ROSE_DEPRECATED("use getFallthroughVa");
    SgAsmFunction* get_enclosing_function() const ROSE_DEPRECATED("use get_enclosingFunction");
    bool has_instructions() const ROSE_DEPRECATED("use hasInstructions");
    bool is_basic_block() const ROSE_DEPRECATED("use isBasicBlock");
    bool is_function_call(Rose::BinaryAnalysis::Address&, Rose::BinaryAnalysis::Address&) ROSE_DEPRECATED("use isFunctionCall");
    static std::string reason_key(const std::string& = "") ROSE_DEPRECATED("use reasonKey");
    std::string reason_str(bool) const ROSE_DEPRECATED("use reasonString");
    static std::string reason_str(bool, unsigned) ROSE_DEPRECATED("use reasonString");
public:
    virtual ~SgAsmBlock();
 
public:
    SgAsmBlock();
 
public:
    explicit SgAsmBlock(Rose::BinaryAnalysis::Address const& address);
 
protected:
    void initializeProperties();
 
 
// End of memberFunctionString
// Start of memberFunctionString
/* #line 1 "/workspace/src/ROSETTA/Grammar/Common.code" */
 
// *** COMMON CODE SECTION BEGINS HERE ***
 
    public:
 
       // DQ (3/25/3006): I put this back in because it had the logic for where the copy function required 
       // and not required which is required to match the other aspects of the copy mechanism code generation.
       // Specifically it is a problem to declare the copy function everywhere because it is not implemented 
       // for the SgSymbol IR nodes. I'm not clear why it is not implemented for these IR nodes.
       /* \brief Copies AST (whole subtree, depending on the SgCopyHelp class */
       // virtual SgNode* copy ( const SgCopyHelp & help) const;
 
          virtual std::string class_name() const override;
 
          virtual VariantT variantT() const override; // MS: new variant used in tree traversal
 
       // King84 (2010.08.16): Moved this to an enum to save space, since it's only used at compiler-time anyway.
       // static const VariantT static_variant = V_SgAsmBlock;
          enum { static_variant = V_SgAsmBlock };
 
       /* the generated cast function */
          ROSE_DLL_API friend       SgAsmBlock* isSgAsmBlock(       SgNode * s );
 
          ROSE_DLL_API friend const SgAsmBlock* isSgAsmBlock( const SgNode * s );
 
     // ******************************************
     // * Memory Pool / New / Delete
     // ******************************************
 
     public:
          static const unsigned pool_size; // 
          static std::vector<unsigned char *> pools; // 
          static SgAsmBlock * next_node; // 
 
          static unsigned long initializeStorageClassArray(SgAsmBlockStorageClass *); // 
 
          static void clearMemoryPool(); // 
          static void deleteMemoryPool(); // 
 
          static void extendMemoryPoolForFileIO(); // 
 
          static SgAsmBlock * getPointerFromGlobalIndex(unsigned long); // 
          static SgAsmBlock * getPointerFromGlobalIndex(AstSpecificDataManagingClass *, unsigned long); // 
 
          static unsigned long getNumberOfValidNodesAndSetGlobalIndexInFreepointer(unsigned long); // 
          static void resetValidFreepointers(); // 
          static unsigned long getNumberOfLastValidPointer(); // 
 
 
#if defined(INLINE_FUNCTIONS)
          inline void *operator new (size_t size);
#else
          void *operator new (size_t size);
#endif
          void operator delete (void* pointer, size_t size);
 
       // DQ (4/5/2007): This is not the correct operator that we want, but appears to be required to compile ROSE with ROSE.
          void operator delete (void* pointer)
             {
            // This is the generated delete operator...
               SgAsmBlock::operator delete (pointer,sizeof(SgAsmBlock));
             }
 
          static size_t numberOfNodes();
 
          static size_t memoryUsage();
 
      // End of scope which started in IR nodes specific code 
      /* */
 
      /* name Internal Functions
          \brief Internal functions ... incomplete-documentation
 
          These functions have been made public as part of the design, but they are suggested for internal use 
          or by particularly knowledgeable users for specialized tools or applications.
 
          \internal We could not make these private because they are required by user for special purposes. And 
              it would be unwieldy to have many of the internal classes in ROSE be explicitly defined as friends.
         
       */
 
       // MS: 02/12/02 container of pointers to AST successor nodes used in the traversal
       // overridden in every class by *generated* implementation
          virtual std::vector<SgNode*> get_traversalSuccessorContainer() const override;
       // MS: 06/28/02 container of names of variables or container indices 
       // used used in the traversal to access AST successor nodes
       // overridden in every class by *generated* implementation
          virtual std::vector<std::string> get_traversalSuccessorNamesContainer() const override;
 
       // GB (09/25/2007): Functions for index-based access to traversal successors; these are hopefully a lot faster
       // than all the vector copies. The implementation for these functions is generated for each class.
          virtual size_t get_numberOfTraversalSuccessors() const override;
          virtual SgNode *get_traversalSuccessorByIndex(size_t idx) const override;
          virtual size_t get_childIndex(SgNode *child) const override;
 
#ifndef ROSE_USE_INTERNAL_FRONTEND_DEVELOPMENT
       // MS: 08/16/2002 method for generating RTI information
          virtual RTIReturnType roseRTI() override;
#endif
      /* */
 
 
 
      /* name Deprecated Functions
          \brief Deprecated functions ... incomplete-documentation
 
          These functions have been deprecated from use.
       */
      /* */
 
          virtual const char* sage_class_name() const  override ROSE_DEPRECATED_FUNCTION;
 
      // JJW (10/16/2008): Changed to a single function in Node.code, and put
      // getVariant() in #if 0 block to prevent confusing Doxygen
#if 0
          virtual int variant() const ROSE_DEPRECATED_FUNCTION;
       // virtual int getVariant() const ROSE_DEPRECATED_FUNCTION;
#endif
      /* */
 
 
 
 
     public:
      /* name Traversal Support Functions
          \brief Traversal support functions ... incomplete-documentation
 
          These functions have been made public as part of the design, but they are suggested for internal use 
          or by particularly knowledgable users for specialized tools or applications.
       */
      /* */
 
       // DQ (11/26/2005): Support for visitor pattern mechanims
       // (inferior to ROSE traversal mechanism, experimental).
          void executeVisitorMemberFunction (ROSE_VisitorPattern & visitor);
 
      /* DXN (08/09/2010): support for the classic visitor pattern done in GoF */
          virtual void accept (ROSE_VisitorPattern & visitor) override;
 
       // DQ (12/26/2005): Support for traversal based on the memory pool
          static void traverseMemoryPoolNodes(ROSE_VisitTraversal & visit);
 
          static void traverseMemoryPoolVisitorPattern(ROSE_VisitorPattern & visitor);
 
       // DQ (2/9/2006): Added to support traversal over single representative of each IR node
       // This traversal helps support internal tools that call static member functions.
       // note: this function operates on the memory pools.
          static void visitRepresentativeNode (ROSE_VisitTraversal & visit);
      /* */
 
     public: 
        /* NodeId support functions */
        static SgNode* getNodeByNodeId(VariantT variantT, size_t poolIdx, size_t itemIdx);
        static SgAsmBlock* getNodeByNodeIdInternal(size_t poolIdx, size_t itemIdx);
        static std::string getNodeIdString(SgAsmBlock* sgnode);
        static std::string getNodeIdStringInternal(SgAsmBlock* sgnode);
 
     public:
      /* name Memory Allocation Functions
          \brief Memory allocations functions ... incomplete-documentation
 
          These functions have been made public as part of the design, but they are suggested for internal use 
          or by particularly knowledgable users for specialized tools or applications.
       */
      /* */
 
          virtual bool isInMemoryPool() override;
 
          virtual void checkDataMemberPointersIfInMemoryPool() override;
 
      // DQ (4/30/2006): Modified to be a const function.
          virtual std::vector<std::pair<SgNode*,std::string> > returnDataMemberPointers() const override;
 
          virtual void processDataMemberReferenceToPointers(ReferenceToPointerHandler*) override;
 
          virtual long getChildIndex( SgNode* childNode ) const override;
 
      // DQ (9/2/2015): Since this function is generated by ROSETTA, we can't define the 
      // comment here (changed to be a C style comment and not be a doxygen comment).
      /* \brief Constructor for use by AST File I/O Mechanism
 
          This constructor permits the IR node to be rebuilt from the contiguously arranged data in memory 
          which obtained via fast binary file I/O from disk.
       */
       // SgAsmBlock( SgAsmBlockStorageClass& source );
 
 
 
 
 
 // JH (10/24/2005): methods added to support the ast file IO
    private:
 
      /* name AST Memory Allocation Support Functions
          \brief Memory allocations support....
 
          These functions handle the low leve support of the memory allocation scheme which permits IR nodes to be allocated 
          in large contiguous blocks to reduce memory fragmentation, improve performance, support specialized access (AST traversals),
          and support the AST File I/O Mechanism.
       */
      /* */
 
       /* JH (10/24/2005): Two typedefs. The TestType notes the type every pointer is cast to before
          we compare them. Since I had several problems with this, I decided to make a typdef to ensure
          that I use the same type everywhere, if any changes are made. THe second one declares the type
          (actually unsigned long) where teh pointer address gets converted to. On 64 bit platforms this
          might got changed, but unfortunatly, the return types are still unsigned longs. There exists
          a correspinding one in the AST_FILE_IO class!
       */
      // DQ (9/2/2015): This typedef is no longer used, we can't define the 
      // comment here (changed to be a C style comment and not be a doxygen comment).
      /* \brief Typedef used for low level memory access.
       */
       // typedef unsigned char* TestType;
 
      // DQ (9/2/2015): This typedef is no longer used, we can't define the 
      // comment here (changed to be a C style comment and not be a doxygen comment).
      /* \brief Typedef used to hold memory addresses as values.
       */
       // typedef unsigned long  AddressType;
 
 
 
       // necessary, to have direct access to the p_freepointer and the private methods !
          friend class AST_FILE_IO;
 
          friend class SgAsmBlockStorageClass;
 
          friend class AstSpecificDataManagingClass;
 
          friend class AstSpecificDataManagingClassStorageClass;
    public:
          SgAsmBlock( const SgAsmBlockStorageClass& source );
 
 // private: // JJW hack
       /*
          name AST Memory Allocation Support Variables
          Memory allocations support variables 
 
          These variables handle the low level support of the memory allocation scheme which permits IR nodes to be allocated 
          in large contiguous blocks to reduce memory fragmentation, improve performance, support specialized access (AST traversals),
          and support the AST File I/O Mechanism.
       */
      /* */
 
    public:
 
      // DQ (11/21/2009): Added function to add new Regular Expression attributes and return pointer 
      // to current node (so that it will work cleanly with build functions to specify patterns).
      // virtual SgNode* addRegExpAttribute();
          SgAsmBlock* addRegExpAttribute(std::string s, AstRegExAttribute* a);
 
#ifndef _MSC_VER
// Rasmussen (04/17/2019): Support for ATerms has been deprecated as it is no longer needed
// and likely never fully implemented nor tested.  Files remain in the src tree but are no
// longer built.
#define BUILD_ATERM_SUPPORT 0
   #if BUILD_ATERM_SUPPORT
   #ifdef ROSE_USE_ROSE_ATERM_SUPPORT
      // DQ (10/4/2014): Adding ATerm support to ROSE.
       // Rasmussen (1/7/2019): Added override to kill warning messages of overridden virtual function
          virtual ATerm generate_ATerm() override;
 
          virtual void generate_ATerm_Annotation(ATerm & term) override;
   #endif
   #endif // BUILD_ATERM_SUPPORT
#endif
       // These can't be virtual functions since we don't yet know what IR node to build (until we have read the aterm).
       // virtual generate_AST(ATerm & term);
       // virtual void read_ATerm_Annotation(ATerm & term);
 
// *** COMMON CODE SECTION ENDS HERE ***
 
 
// End of memberFunctionString
// Start of memberFunctionString
/* #line 710 "/workspace/src/ROSETTA/Grammar/Node.code" */
 
     // the generated cast function
     // friend ROSE_DLL_API SgAsmBlock* isSgAsmBlock ( SgNode* s );
 
          typedef SgAsmStatement base_node_type;
 
 
// End of memberFunctionString
 
 
 
 
 
 
 
 
 
 
    protected:
// Start of memberFunctionString
Rose::BinaryAnalysis::Address p_id;
          
// End of memberFunctionString
// Start of memberFunctionString
unsigned p_reason;
          
// End of memberFunctionString
// Start of memberFunctionString
SgAsmStatementPtrList p_statementList;
          
// End of memberFunctionString
// Start of memberFunctionString
SgAsmIntegerValuePtrList p_successors;
          
// End of memberFunctionString
// Start of memberFunctionString
bool p_successorsComplete;
          
// End of memberFunctionString
// Start of memberFunctionString
SgAsmBlock* p_immediateDominator;
          
// End of memberFunctionString
// Start of memberFunctionString
size_t p_cachedVertex;
          
// End of memberFunctionString
// Start of memberFunctionString
double p_codeLikelihood;
          
// End of memberFunctionString
// Start of memberFunctionString
int64_t p_stackDeltaOut;
          
// End of memberFunctionString
 
    friend struct Rose::Traits::generated::describe_node_t<SgAsmBlock>;
    friend struct Rose::Traits::generated::describe_field_t<SgAsmBlock, Rose::BinaryAnalysis::Address,&SgAsmBlock::p_id>;
    friend struct Rose::Traits::generated::describe_field_t<SgAsmBlock, unsigned,&SgAsmBlock::p_reason>;
    friend struct Rose::Traits::generated::describe_field_t<SgAsmBlock, SgAsmStatementPtrList,&SgAsmBlock::p_statementList>;
    friend struct Rose::Traits::generated::describe_field_t<SgAsmBlock, SgAsmIntegerValuePtrList,&SgAsmBlock::p_successors>;
    friend struct Rose::Traits::generated::describe_field_t<SgAsmBlock, bool,&SgAsmBlock::p_successorsComplete>;
    friend struct Rose::Traits::generated::describe_field_t<SgAsmBlock, SgAsmBlock*,&SgAsmBlock::p_immediateDominator>;
    friend struct Rose::Traits::generated::describe_field_t<SgAsmBlock, size_t,&SgAsmBlock::p_cachedVertex>;
    friend struct Rose::Traits::generated::describe_field_t<SgAsmBlock, double,&SgAsmBlock::p_codeLikelihood>;
    friend struct Rose::Traits::generated::describe_field_t<SgAsmBlock, int64_t,&SgAsmBlock::p_stackDeltaOut>;
 
/* #line 21 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro" */
 
 
   };
#endif
 
// postdeclarations for SgAsmBlock
 
/* #line 825 "../../../src/frontend/SageIII//SgAsmBlock.h" */
 
/* #line 27 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro after subst for $POSTDECLARATIONS" */
 
/* #line 28 "/workspace/src/ROSETTA/Grammar/grammarClassDeclarationMacros.macro" */
 
 
/* #line 832 "../../../src/frontend/SageIII//SgAsmBlock.h" */
 
#endif // ROSE_SgAsmBlock_H