|
ROSE 0.11.145.354
|
This is the complete list of members for Rose::BinaryAnalysis::FeasiblePath, including all inherited members.
| AddressSet typedef | Rose::BinaryAnalysis::FeasiblePath | |
| buildVirtualCpu(const Partitioner2::PartitionerConstPtr &, const Partitioner2::CfgPath *, PathProcessor *, const SmtSolverPtr &) | Rose::BinaryAnalysis::FeasiblePath | virtual |
| cfgToPaths(const Partitioner2::CfgConstVertexSet &) const | Rose::BinaryAnalysis::FeasiblePath | |
| cfgToPaths(const Partitioner2::CfgConstEdgeSet &) const | Rose::BinaryAnalysis::FeasiblePath | |
| commandLineSwitches(Settings &settings) | Rose::BinaryAnalysis::FeasiblePath | static |
| depthFirstSearch(PathProcessor &pathProcessor) | Rose::BinaryAnalysis::FeasiblePath | |
| EdgeVisitOrder enum name | Rose::BinaryAnalysis::FeasiblePath | |
| expressionDocumentation() | Rose::BinaryAnalysis::FeasiblePath | static |
| FeasiblePath() | Rose::BinaryAnalysis::FeasiblePath | |
| functionSummaries() const | Rose::BinaryAnalysis::FeasiblePath | inline |
| FunctionSummaries typedef | Rose::BinaryAnalysis::FeasiblePath | |
| functionSummarizer() const | Rose::BinaryAnalysis::FeasiblePath | inline |
| functionSummarizer(const FunctionSummarizer::Ptr &f) | Rose::BinaryAnalysis::FeasiblePath | inline |
| functionSummary(Address entryVa) const | Rose::BinaryAnalysis::FeasiblePath | |
| initDiagnostics() | Rose::BinaryAnalysis::FeasiblePath | static |
| initialState() const | Rose::BinaryAnalysis::FeasiblePath | |
| IoMode enum name | Rose::BinaryAnalysis::FeasiblePath | |
| isAnyEndpointReachable(const Partitioner2::ControlFlowGraph &cfg, const Partitioner2::ControlFlowGraph::ConstVertexIterator &beginVertex, const Partitioner2::CfgConstVertexSet &endVertices) | Rose::BinaryAnalysis::FeasiblePath | |
| isDirectedSearch() const | Rose::BinaryAnalysis::FeasiblePath | inline |
| isFunctionCall(const Partitioner2::ControlFlowGraph::ConstVertexIterator &) const | Rose::BinaryAnalysis::FeasiblePath | |
| LIST_BASED_MEMORY enum value | Rose::BinaryAnalysis::FeasiblePath | |
| MAP_BASED_MEMORY enum value | Rose::BinaryAnalysis::FeasiblePath | |
| MAY enum value (defined in Rose::BinaryAnalysis::FeasiblePath) | Rose::BinaryAnalysis::FeasiblePath | |
| MayOrMust enum name | Rose::BinaryAnalysis::FeasiblePath | |
| mlog | Rose::BinaryAnalysis::FeasiblePath | static |
| MUST enum value (defined in Rose::BinaryAnalysis::FeasiblePath) | Rose::BinaryAnalysis::FeasiblePath | |
| partitioner() const | Rose::BinaryAnalysis::FeasiblePath | |
| pathEffectiveK(const Partitioner2::CfgPath &) const | Rose::BinaryAnalysis::FeasiblePath | |
| pathEndsWithFunctionCall(const Partitioner2::CfgPath &) const | Rose::BinaryAnalysis::FeasiblePath | |
| pathLength(const Partitioner2::CfgPath &, int position=-1) | Rose::BinaryAnalysis::FeasiblePath | static |
| pathPostState(const Partitioner2::CfgPath &, size_t vertexIdx) | Rose::BinaryAnalysis::FeasiblePath | static |
| pathToCfg(const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathVertex) const | Rose::BinaryAnalysis::FeasiblePath | |
| printPath(std::ostream &out, const Partitioner2::CfgPath &) const | Rose::BinaryAnalysis::FeasiblePath | |
| printPathVertex(std::ostream &out, const Partitioner2::ControlFlowGraph::Vertex &pathVertex, size_t &insnIdx) const | Rose::BinaryAnalysis::FeasiblePath | |
| processBasicBlock(const Partitioner2::BasicBlockPtr &bblock, const InstructionSemantics::BaseSemantics::DispatcherPtr &cpu, size_t pathInsnIndex) | Rose::BinaryAnalysis::FeasiblePath | virtual |
| processFunctionSummary(const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathsVertex, const InstructionSemantics::BaseSemantics::DispatcherPtr &cpu, size_t pathInsnIndex) | Rose::BinaryAnalysis::FeasiblePath | virtual |
| processIndeterminateBlock(const Partitioner2::ControlFlowGraph::ConstVertexIterator &vertex, const InstructionSemantics::BaseSemantics::DispatcherPtr &cpu, size_t pathInsnIndex) | Rose::BinaryAnalysis::FeasiblePath | virtual |
| processVertex(const InstructionSemantics::BaseSemantics::DispatcherPtr &cpu, const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathsVertex, size_t pathInsnIndex) | Rose::BinaryAnalysis::FeasiblePath | virtual |
| READ enum value (defined in Rose::BinaryAnalysis::FeasiblePath) | Rose::BinaryAnalysis::FeasiblePath | |
| REG_PATH | Rose::BinaryAnalysis::FeasiblePath | |
| reset() | Rose::BinaryAnalysis::FeasiblePath | |
| resetStatistics() | Rose::BinaryAnalysis::FeasiblePath | inline |
| SEARCH_MULTI enum value | Rose::BinaryAnalysis::FeasiblePath | |
| SEARCH_SINGLE_BFS enum value | Rose::BinaryAnalysis::FeasiblePath | |
| SEARCH_SINGLE_DFS enum value | Rose::BinaryAnalysis::FeasiblePath | |
| SearchMode enum name | Rose::BinaryAnalysis::FeasiblePath | |
| SemanticMemoryParadigm enum name | Rose::BinaryAnalysis::FeasiblePath | |
| setInitialState(const InstructionSemantics::BaseSemantics::DispatcherPtr &cpu, const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathsBeginVertex) | Rose::BinaryAnalysis::FeasiblePath | virtual |
| setSearchBoundary(const Partitioner2::PartitionerConstPtr &partitioner, const Partitioner2::CfgConstVertexSet &cfgBeginVertices, const Partitioner2::CfgConstVertexSet &cfgEndVertices, const Partitioner2::CfgConstVertexSet &cfgAvoidVertices=Partitioner2::CfgConstVertexSet(), const Partitioner2::CfgConstEdgeSet &cfgAvoidEdges=Partitioner2::CfgConstEdgeSet()) | Rose::BinaryAnalysis::FeasiblePath | |
| setSearchBoundary(const Partitioner2::PartitionerConstPtr &partitioner, const Partitioner2::ControlFlowGraph::ConstVertexIterator &cfgBeginVertex, const Partitioner2::ControlFlowGraph::ConstVertexIterator &cfgEndVertex, const Partitioner2::CfgConstVertexSet &cfgAvoidVertices=Partitioner2::CfgConstVertexSet(), const Partitioner2::CfgConstEdgeSet &cfgAvoidEdges=Partitioner2::CfgConstEdgeSet()) | Rose::BinaryAnalysis::FeasiblePath | |
| setSearchBoundary(const Partitioner2::PartitionerConstPtr &partitioner, const Partitioner2::CfgConstVertexSet &cfgBeginVertices, const Partitioner2::CfgConstVertexSet &cfgAvoidVertices=Partitioner2::CfgConstVertexSet(), const Partitioner2::CfgConstEdgeSet &cfgAvoidEdges=Partitioner2::CfgConstEdgeSet()) | Rose::BinaryAnalysis::FeasiblePath | |
| setSearchBoundary(const Partitioner2::PartitionerConstPtr &partitioner, const Partitioner2::ControlFlowGraph::ConstVertexIterator &cfgBeginVertex, const Partitioner2::CfgConstVertexSet &cfgAvoidVertices=Partitioner2::CfgConstVertexSet(), const Partitioner2::CfgConstEdgeSet &cfgAvoidEdges=Partitioner2::CfgConstEdgeSet()) | Rose::BinaryAnalysis::FeasiblePath | |
| settings() const | Rose::BinaryAnalysis::FeasiblePath | inline |
| settings() | Rose::BinaryAnalysis::FeasiblePath | inline |
| settings(const Settings &s) | Rose::BinaryAnalysis::FeasiblePath | inline |
| shouldInline(const Partitioner2::CfgPath &path, const Partitioner2::ControlFlowGraph::ConstVertexIterator &cfgCallTarget) | Rose::BinaryAnalysis::FeasiblePath | virtual |
| shouldSummarizeCall(const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathVertex, const Partitioner2::ControlFlowGraph &cfg, const Partitioner2::ControlFlowGraph::ConstVertexIterator &cfgCallTarget) | Rose::BinaryAnalysis::FeasiblePath | virtual |
| statistics() const | Rose::BinaryAnalysis::FeasiblePath | inline |
| varDetail(const InstructionSemantics::BaseSemantics::StatePtr &, const std::string &varName) const | Rose::BinaryAnalysis::FeasiblePath | |
| varDetails(const InstructionSemantics::BaseSemantics::StatePtr &) const | Rose::BinaryAnalysis::FeasiblePath | |
| VarDetails typedef | Rose::BinaryAnalysis::FeasiblePath | |
| VISIT_NATURAL enum value | Rose::BinaryAnalysis::FeasiblePath | |
| VISIT_RANDOM enum value | Rose::BinaryAnalysis::FeasiblePath | |
| VISIT_REVERSE enum value | Rose::BinaryAnalysis::FeasiblePath | |
| WRITE enum value (defined in Rose::BinaryAnalysis::FeasiblePath) | Rose::BinaryAnalysis::FeasiblePath | |
| ~FeasiblePath() (defined in Rose::BinaryAnalysis::FeasiblePath) | Rose::BinaryAnalysis::FeasiblePath | virtual |