Description
#include <Rose/BinaryAnalysis/Partitioner2/Thunk.h>
Public Types | |
| typedef Sawyer::SharedPointer< ThunkPredicates > | Ptr |
Public Member Functions | |
| ThunkDetection | isThunk (const PartitionerConstPtr &, 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... | |
| SharedObject & | operator= (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 |
Construct collective predicate with all built-in predicates.
Returns a collective predicate that contains all the built-in predicates known to this library.
|
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.
| ThunkDetection Rose::BinaryAnalysis::Partitioner2::ThunkPredicates::isThunk | ( | const PartitionerConstPtr & | , |
| 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 and the name of the thunk detector that matched. 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:
