ROSE  0.9.10.232
Classes | Public Member Functions | Public Attributes | List of all members
Rose::BinaryAnalysis::FeasiblePath::Settings Struct Reference

Description

Settings that control this analysis.

Definition at line 71 of file BinaryFeasiblePath.h.

#include <BinaryFeasiblePath.h>

Collaboration diagram for Rose::BinaryAnalysis::FeasiblePath::Settings:
Collaboration graph
[legend]

Classes

struct  NullDeref
 

Public Member Functions

 Settings ()
 Default settings. More...
 

Public Attributes

SearchMode searchMode
 Method to use when searching for feasible paths. More...
 
Sawyer::Optional< rose_addr_t > initialStackPtr
 Concrete value to use for stack pointer register initial value. More...
 
size_t maxVertexVisit
 Max times to visit a particular vertex in one path. More...
 
size_t maxPathLength
 Limit path length in terms of number of instructions. More...
 
size_t maxCallDepth
 Max length of path in terms of function calls. More...
 
size_t maxRecursionDepth
 Max path length in terms of recursive function calls. More...
 
std::vector< Expressionassertions
 Constraints to be satisfied at some point along the path. More...
 
std::vector< std::string > assertionLocations
 Locations at which "constraints" are checked. More...
 
std::vector< rose_addr_t > summarizeFunctions
 Functions to always summarize. More...
 
bool nonAddressIsFeasible
 Indeterminate/undiscovered vertices are feasible?
 
std::string solverName
 Type of SMT solver. More...
 
SemanticMemoryParadigm memoryParadigm
 Type of memory state when there's a choice to be made. More...
 
bool processFinalVertex
 Whether to process the last vertex of the path. More...
 
bool ignoreSemanticFailure
 Whether to ignore instructions with no semantic info. More...
 
double kCycleCoefficient
 Coefficient for adjusting maxPathLengh during CFG cycles. More...
 
EdgeVisitOrder edgeVisitOrder
 Order in which to visit edges. More...
 
bool trackingCodeCoverage
 If set, track which block addresses are reached. More...
 
struct Rose::BinaryAnalysis::FeasiblePath::Settings::NullDeref nullDeref
 Settings for null-dereference analysis. More...
 
std::string exprParserDoc
 String documenting how expressions are parsed, empty for default. More...
 

Constructor & Destructor Documentation

Rose::BinaryAnalysis::FeasiblePath::Settings::Settings ( )
inline

Default settings.

Definition at line 104 of file BinaryFeasiblePath.h.

Member Data Documentation

SearchMode Rose::BinaryAnalysis::FeasiblePath::Settings::searchMode

Method to use when searching for feasible paths.

Definition at line 73 of file BinaryFeasiblePath.h.

Sawyer::Optional<rose_addr_t> Rose::BinaryAnalysis::FeasiblePath::Settings::initialStackPtr

Concrete value to use for stack pointer register initial value.

Definition at line 74 of file BinaryFeasiblePath.h.

size_t Rose::BinaryAnalysis::FeasiblePath::Settings::maxVertexVisit

Max times to visit a particular vertex in one path.

Definition at line 75 of file BinaryFeasiblePath.h.

size_t Rose::BinaryAnalysis::FeasiblePath::Settings::maxPathLength

Limit path length in terms of number of instructions.

Definition at line 76 of file BinaryFeasiblePath.h.

size_t Rose::BinaryAnalysis::FeasiblePath::Settings::maxCallDepth

Max length of path in terms of function calls.

Definition at line 77 of file BinaryFeasiblePath.h.

size_t Rose::BinaryAnalysis::FeasiblePath::Settings::maxRecursionDepth

Max path length in terms of recursive function calls.

Definition at line 78 of file BinaryFeasiblePath.h.

std::vector<Expression> Rose::BinaryAnalysis::FeasiblePath::Settings::assertions

Constraints to be satisfied at some point along the path.

Definition at line 79 of file BinaryFeasiblePath.h.

std::vector<std::string> Rose::BinaryAnalysis::FeasiblePath::Settings::assertionLocations

Locations at which "constraints" are checked.

Definition at line 80 of file BinaryFeasiblePath.h.

std::vector<rose_addr_t> Rose::BinaryAnalysis::FeasiblePath::Settings::summarizeFunctions

Functions to always summarize.

Definition at line 81 of file BinaryFeasiblePath.h.

std::string Rose::BinaryAnalysis::FeasiblePath::Settings::solverName

Type of SMT solver.

Definition at line 83 of file BinaryFeasiblePath.h.

SemanticMemoryParadigm Rose::BinaryAnalysis::FeasiblePath::Settings::memoryParadigm

Type of memory state when there's a choice to be made.

Definition at line 84 of file BinaryFeasiblePath.h.

bool Rose::BinaryAnalysis::FeasiblePath::Settings::processFinalVertex

Whether to process the last vertex of the path.

Definition at line 85 of file BinaryFeasiblePath.h.

bool Rose::BinaryAnalysis::FeasiblePath::Settings::ignoreSemanticFailure

Whether to ignore instructions with no semantic info.

Definition at line 86 of file BinaryFeasiblePath.h.

double Rose::BinaryAnalysis::FeasiblePath::Settings::kCycleCoefficient

Coefficient for adjusting maxPathLengh during CFG cycles.

Definition at line 87 of file BinaryFeasiblePath.h.

EdgeVisitOrder Rose::BinaryAnalysis::FeasiblePath::Settings::edgeVisitOrder

Order in which to visit edges.

Definition at line 88 of file BinaryFeasiblePath.h.

bool Rose::BinaryAnalysis::FeasiblePath::Settings::trackingCodeCoverage

If set, track which block addresses are reached.

Definition at line 89 of file BinaryFeasiblePath.h.

struct Rose::BinaryAnalysis::FeasiblePath::Settings::NullDeref Rose::BinaryAnalysis::FeasiblePath::Settings::nullDeref

Settings for null-dereference analysis.

std::string Rose::BinaryAnalysis::FeasiblePath::Settings::exprParserDoc

String documenting how expressions are parsed, empty for default.

Definition at line 101 of file BinaryFeasiblePath.h.


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