ROSE  0.9.11.56
Public Types | Public Member Functions | Static Public Member Functions | List of all members
Rose::BinaryAnalysis::Partitioner2::ThunkPredicates Class Reference

Description

List of thunk predicates.

Definition at line 56 of file Thunk.h.

#include <Thunk.h>

Inheritance diagram for Rose::BinaryAnalysis::Partitioner2::ThunkPredicates:
Inheritance graph
[legend]
Collaboration diagram for Rose::BinaryAnalysis::Partitioner2::ThunkPredicates:
Collaboration graph
[legend]

Public Types

typedef Sawyer::SharedPointer< ThunkPredicatesPtr
 

Public Member Functions

size_t isThunk (const Partitioner &, const std::vector< SgAsmInstruction * > &) const
 Test whether instructions begin with a thunk. More...
 
const std::vector< ThunkPredicate > & predicates () const
 Property: The list of predicates that will test for thunks.
 
std::vector< ThunkPredicate > & predicates ()
 Property: The list of predicates that will test for thunks.
 
- Public Member Functions inherited from Sawyer::SharedObject
 SharedObject ()
 Default constructor. More...
 
 SharedObject (const SharedObject &)
 Copy constructor. More...
 
virtual ~SharedObject ()
 Virtual destructor. More...
 
SharedObjectoperator= (const SharedObject &)
 Assignment. More...
 

Static Public Member Functions

static Ptr instance ()
 Allocating constructor.
 
static Ptr allThunks ()
 Construct collective predicate with all built-in predicates. More...
 
static Ptr functionMatcherThunks ()
 Construct collective predicate for matching thunks to create functions. More...
 

Member Function Documentation

static Ptr Rose::BinaryAnalysis::Partitioner2::ThunkPredicates::allThunks ( )
static

Construct collective predicate with all built-in predicates.

Returns a collective predicate that contains all the built-in predicates known to this library.

static Ptr Rose::BinaryAnalysis::Partitioner2::ThunkPredicates::functionMatcherThunks ( )
static

Construct collective predicate for matching thunks to create functions.

Constructs a collective predicate that contains individual predicates that are suitable for finding thunks when scanning memory to find new function prologues.

size_t Rose::BinaryAnalysis::Partitioner2::ThunkPredicates::isThunk ( const Partitioner ,
const std::vector< SgAsmInstruction * > &   
) const

Test whether instructions begin with a thunk.

Returns non-zero if the specified list of instructions begins with what appears to be a thunk. The return value is the number of leading instructions that are part of the thunk. The determination is made by invoking each predicate from the predicates list in the order of that list and returning the value returned by the first predicate that returns non-zero.


The documentation for this class was generated from the following file: