ROSE  0.9.11.115
BinaryFeasiblePath.h
1 #ifndef ROSE_BinaryAnalysis_FeasiblePath_H
2 #define ROSE_BinaryAnalysis_FeasiblePath_H
3 
4 #include <BaseSemantics2.h>
5 #include <BinarySmtSolver.h>
6 #include <BinarySymbolicExprParser.h>
7 #include <Partitioner2/CfgPath.h>
8 #include <Sawyer/CommandLine.h>
9 #include <Sawyer/Message.h>
10 #include <boost/filesystem/path.hpp>
11 
12 namespace Rose {
13 namespace BinaryAnalysis {
14 
18 class FeasiblePath {
20  // Types and public data members
22 public:
24  enum SearchMode {
28  };
29 
34  };
35 
41  };
42 
44  enum IoMode { READ, WRITE };
45 
47  enum MayOrMust { MAY, MUST };
48 
50  typedef std::set<rose_addr_t> AddressSet;
51 
58  struct Expression {
60  std::string parsable;
63  Expression() {}
64  /*implicit*/ Expression(const std::string &parsable): parsable(parsable) {}
65  /*implicit*/ Expression(const SymbolicExpr::Ptr &expr): expr(expr) {}
66 
67  void print(std::ostream&) const;
68  };
69 
71  struct Settings {
72  // Path feasibility
75  size_t maxVertexVisit;
76  size_t maxPathLength;
77  size_t maxCallDepth;
79  std::vector<Expression> assertions;
80  std::vector<std::string> assertionLocations;
81  std::vector<rose_addr_t> summarizeFunctions;
83  std::string solverName;
91  // Null dereferences
92  struct NullDeref {
93  bool check;
95  bool constOnly;
97  NullDeref()
98  : check(false), mode(MUST), constOnly(false) {}
99  } nullDeref;
101  std::string exprParserDoc;
105  : searchMode(SEARCH_SINGLE_DFS), maxVertexVisit((size_t)-1), maxPathLength(200), maxCallDepth((size_t)-1),
106  maxRecursionDepth((size_t)-1), nonAddressIsFeasible(true), solverName("best"),
107  memoryParadigm(LIST_BASED_MEMORY), processFinalVertex(false), ignoreSemanticFailure(false),
108  kCycleCoefficient(0.0), edgeVisitOrder(VISIT_NATURAL), trackingCodeCoverage(true) {}
109  };
110 
112  static Sawyer::Message::Facility mlog;
113 
122 
124  struct VarDetail {
125  std::string registerName;
126  std::string firstAccessMode;
130  size_t memSize;
131  size_t memByteNumber;
134  VarDetail(): firstAccessInsn(NULL), memSize(0), memByteNumber(0) {}
135  std::string toString() const;
136  };
137 
140 
145  public:
146  enum Action {
149  };
150 
151  virtual ~PathProcessor() {}
152 
167  virtual Action found(const FeasiblePath &analyzer, const Partitioner2::CfgPath &path,
169  const SmtSolverPtr &solver) { return CONTINUE; }
170 
182  virtual void nullDeref(const FeasiblePath &analyzer, const Partitioner2::CfgPath &path,
183  const SmtSolverPtr &solver, IoMode ioMode,
185 
190  virtual void memoryIo(const FeasiblePath &analyzer, IoMode ioMode,
194  };
195 
200  rose_addr_t address;
201  int64_t stackDelta;
202  std::string name;
205  FunctionSummary(): stackDelta(SgAsmInstruction::INVALID_STACK_DELTA) {}
206 
208  FunctionSummary(const Partitioner2::ControlFlowGraph::ConstVertexIterator &cfgFuncVertex, uint64_t stackDelta);
209  };
210 
213 
218  public:
221  protected:
222  FunctionSummarizer() {}
223  public:
225  virtual void init(const FeasiblePath &analysis, FunctionSummary &summary /*in,out*/,
226  const Partitioner2::Function::Ptr &function,
227  Partitioner2::ControlFlowGraph::ConstVertexIterator cfgCallTarget) = 0;
228 
233  virtual bool process(const FeasiblePath &analysis, const FunctionSummary &summary,
235 
241  returnValue(const FeasiblePath &analysis, const FunctionSummary &summary,
243  };
244 
246  // Private data members
248 private:
249  const Partitioner2::Partitioner *partitioner_; // binary analysis context
250  RegisterDictionary *registers_; // registers augmented with "path" pseudo-register
251  RegisterDescriptor REG_RETURN_; // FIXME[Robb P Matzke 2016-10-11]: see source
252  Settings settings_;
253  FunctionSummaries functionSummaries_;
254  Partitioner2::CfgVertexMap vmap_; // relates CFG vertices to path vertices
255  Partitioner2::ControlFlowGraph paths_; // all possible paths, feasible or otherwise
256  Partitioner2::CfgConstVertexSet pathsBeginVertices_;// vertices of paths_ where searching starts
257  Partitioner2::CfgConstVertexSet pathsEndVertices_; // vertices of paths_ where searching stops
258  Partitioner2::CfgConstEdgeSet cfgAvoidEdges_; // CFG edges to avoid
259  Partitioner2::CfgConstVertexSet cfgEndAvoidVertices_;// CFG end-of-path and other avoidance vertices
260  FunctionSummarizer::Ptr functionSummarizer_; // user-defined function for handling function summaries
261  AddressSet reachedBlockVas_; // basic block addresses reached during analysis
262  static Sawyer::Attribute::Id POST_STATE; // stores semantic state after executing the insns for a vertex
263  static Sawyer::Attribute::Id POST_INSN_LENGTH; // path length in instructions at end of vertex
264  static Sawyer::Attribute::Id EFFECTIVE_K; // (double) effective maximimum path length
265 
266 
268  // Construction, destruction
270 public:
273  : registers_(NULL) {}
274 
275  virtual ~FeasiblePath() {}
276 
278  void reset() {
279  partitioner_ = NULL;
280  registers_ = NULL;
281  REG_PATH = REG_RETURN_ = RegisterDescriptor();
282  functionSummaries_.clear();
283  vmap_.clear();
284  paths_.clear();
285  pathsBeginVertices_.clear();
286  pathsEndVertices_.clear();
287  cfgAvoidEdges_.clear();
288  cfgEndAvoidVertices_.clear();
289  reachedBlockVas_.clear();
290  }
291 
293  static void initDiagnostics();
294 
295 
297  // Settings affecting behavior
299 public:
303  const Settings& settings() const { return settings_; }
304  Settings& settings() { return settings_; }
305  void settings(const Settings &s) { settings_ = s; }
313 
315  static std::string expressionDocumentation();
316 
317 
319  // Overridable processing functions
321 public:
328  buildVirtualCpu(const Partitioner2::Partitioner&, const Partitioner2::CfgPath*, PathProcessor*, const SmtSolver::Ptr&);
329 
336  virtual void
338  const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathsBeginVertex);
339 
344  virtual void
346  const InstructionSemantics2::BaseSemantics::DispatcherPtr &cpu, size_t pathInsnIndex);
347 
351  virtual void
352  processIndeterminateBlock(const Partitioner2::ControlFlowGraph::ConstVertexIterator &vertex,
354  size_t pathInsnIndex);
355 
359  virtual void
360  processFunctionSummary(const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathsVertex,
362  size_t pathInsnIndex);
363 
367  virtual void
369  const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathsVertex,
370  size_t &pathInsnIndex /*in,out*/);
371 
373  virtual bool
374  shouldSummarizeCall(const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathVertex,
376  const Partitioner2::ControlFlowGraph::ConstVertexIterator &cfgCallTarget);
377 
379  virtual bool
380  shouldInline(const Partitioner2::CfgPath &path, const Partitioner2::ControlFlowGraph::ConstVertexIterator &cfgCallTarget);
381 
390  FunctionSummarizer::Ptr functionSummarizer() const { return functionSummarizer_; }
391  void functionSummarizer(const FunctionSummarizer::Ptr &f) { functionSummarizer_ = f; }
394  // Utilities
397 public:
399  Partitioner2::ControlFlowGraph::ConstVertexIterator
400  pathToCfg(const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathVertex) const;
401 
405 
408 
410  bool isFunctionCall(const Partitioner2::ControlFlowGraph::ConstVertexIterator&) const;
411 
413  void printPathVertex(std::ostream &out, const Partitioner2::ControlFlowGraph::Vertex &pathVertex,
414  size_t &insnIdx /*in,out*/) const;
415 
419  void printPath(std::ostream &out, const Partitioner2::CfgPath&) const;
420 
425  const Partitioner2::ControlFlowGraph::ConstVertexIterator &beginVertex,
426  const Partitioner2::CfgConstVertexSet &endVertices);
427 
429  // Functions for describing the search space
431 public:
432 
439  void
441  const Partitioner2::CfgConstVertexSet &cfgBeginVertices,
442  const Partitioner2::CfgConstVertexSet &cfgEndVertices,
445  void
446  setSearchBoundary(const Partitioner2::Partitioner &partitioner,
447  const Partitioner2::ControlFlowGraph::ConstVertexIterator &cfgBeginVertex,
448  const Partitioner2::ControlFlowGraph::ConstVertexIterator &cfgEndVertex,
454  // Functions for searching for paths
457 public:
462  void depthFirstSearch(PathProcessor &pathProcessor);
463 
464 
466  // Functions for getting the results
468 public:
473  const Partitioner2::Partitioner& partitioner() const;
474 
478  const FunctionSummaries& functionSummaries() const {
479  return functionSummaries_;
480  }
481 
486  const FunctionSummary& functionSummary(rose_addr_t entryVa) const;
487 
489  const VarDetail& varDetail(const InstructionSemantics2::BaseSemantics::StatePtr&, const std::string &varName) const;
490 
492  const VarDetails& varDetails(const InstructionSemantics2::BaseSemantics::StatePtr&) const;
493 
496 
502  double pathEffectiveK(const Partitioner2::CfgPath&) const;
503 
510  static size_t pathLength(const Partitioner2::CfgPath&);
511 
513  // Functions for code coverage
515 public:
520  const AddressSet& reachedBlockVas() const;
521 
523  // Private supporting functions
525 private:
526  static rose_addr_t virtualAddress(const Partitioner2::ControlFlowGraph::ConstVertexIterator &vertex);
527 
528  void insertCallSummary(const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathsCallSite,
530  const Partitioner2::ControlFlowGraph::ConstEdgeIterator &cfgCallEdge);
531 
532  boost::filesystem::path emitPathGraph(size_t callId, size_t graphId); // emit paths graph to "rose-debug" directory
533 
534  // Pop an edge (or more) from the path and follow some other edge. Also, adjust the SMT solver's stack in a similar
535  // way. The SMT solver will have an initial state, plus one pushed state per edge of the path.
536  void backtrack(Partitioner2::CfgPath &path /*in,out*/, const SmtSolver::Ptr&);
537 
538  // Process one edge of a path to find any path constraints. When called, the cpu's current state should be the virtual
539  // machine state at it exists just prior to executing the target vertex of the specified edge.
540  //
541  // Returns a null pointer if the edge's assertion is trivially unsatisfiable, such as when the edge points to a basic block
542  // whose address doesn't match the contents of the instruction pointer register after executing the edge's source
543  // block. Otherwise, returns a symbolic expression which must be tree if the edge is feasible. For trivially feasible
544  // edges, the return value is the constant 1 (one bit wide; i.e., true).
545  SymbolicExpr::Ptr pathEdgeConstraint(const Partitioner2::ControlFlowGraph::ConstEdgeIterator &pathEdge,
547 
548  // Parse the expression if it's a parsable string, otherwise return the expression as is. */
549  Expression parseExpression(Expression, const std::string &where, SymbolicExprParser&) const;
550 
551  SymbolicExpr::Ptr expandExpression(const Expression&, SymbolicExprParser&);
552 
553  // Based on the last vertex of the path, insert user-specified assertions into the SMT solver.
554  void insertAssertions(const SmtSolver::Ptr&, const Partitioner2::CfgPath&,
555  const std::vector<Expression> &assertions, bool atEndOfPath, SymbolicExprParser&);
556 
557  // Size of vertex. How much of "k" does this vertex consume?
558  static size_t vertexSize(const Partitioner2::ControlFlowGraph::ConstVertexIterator&);
559 
560  // Insert the edge assertion and any applicable user assertions (after delayed expansion of the expressions' register
561  // and memory references), and run the solver, returning its result.
563  solvePathConstraints(SmtSolver::Ptr&, const Partitioner2::CfgPath&, const SymbolicExpr::Ptr &edgeAssertion,
564  const std::vector<Expression> &userAssertions, bool atEndOfPath, SymbolicExprParser&);
565 
566  // Mark vertex as being reached
567  void markAsReached(const Partitioner2::ControlFlowGraph::ConstVertexIterator&);
568 };
569 
570 } // namespace
571 } // namespace
572 
573 std::ostream& operator<<(std::ostream&, const Rose::BinaryAnalysis::FeasiblePath::Expression&);
574 
575 // Convert string to feasible path expression during command-line parsing
576 namespace Sawyer {
577  namespace CommandLine {
578  template<>
579  struct LexicalCast<Rose::BinaryAnalysis::FeasiblePath::Expression> {
580  static Rose::BinaryAnalysis::FeasiblePath::Expression convert(const std::string &src) {
582  }
583  };
584  }
585 }
586 
587 #endif
std::string firstAccessMode
How was variable first accessed ("read" or "write").
std::vector< rose_addr_t > summarizeFunctions
Functions to always summarize.
Sawyer::Container::Map< rose_addr_t, FunctionSummary > FunctionSummaries
Summaries for multiple functions.
MayOrMust mode
Check for addrs that may or must be null.
EdgeVisitOrder edgeVisitOrder
Order in which to visit edges.
virtual InstructionSemantics2::SymbolicSemantics::SValuePtr returnValue(const FeasiblePath &analysis, const FunctionSummary &summary, const InstructionSemantics2::SymbolicSemantics::RiscOperatorsPtr &ops)=0
Return value for function.
static bool isAnyEndpointReachable(const Partitioner2::ControlFlowGraph &cfg, const Partitioner2::ControlFlowGraph::ConstVertexIterator &beginVertex, const Partitioner2::CfgConstVertexSet &endVertices)
Determine whether any ending vertex is reachable.
rose_addr_t address
Address of summarized function.
SemanticMemoryParadigm memoryParadigm
Type of memory state when there's a choice to be made.
bool trackingCodeCoverage
If set, track which block addresses are reached.
double pathEffectiveK(const Partitioner2::CfgPath &) const
Effective maximum path length.
void printPathVertex(std::ostream &out, const Partitioner2::ControlFlowGraph::Vertex &pathVertex, size_t &insnIdx) const
Print one vertex of a path for debugging.
std::string parsable
String to be parsed as an expression.
Information stored per V_USER_DEFINED path vertex.
Sawyer::Container::Map< std::string, FeasiblePath::VarDetail > VarDetails
Variable detail by name.
void setSearchBoundary(const Partitioner2::Partitioner &partitioner, const Partitioner2::CfgConstVertexSet &cfgBeginVertices, const Partitioner2::CfgConstVertexSet &cfgEndVertices, const Partitioner2::CfgConstVertexSet &cfgAvoidVertices=Partitioner2::CfgConstVertexSet(), const Partitioner2::CfgConstEdgeSet &cfgAvoidEdges=Partitioner2::CfgConstEdgeSet())
Specify search boundary.
void depthFirstSearch(PathProcessor &pathProcessor)
Find all feasible paths.
virtual void processIndeterminateBlock(const Partitioner2::ControlFlowGraph::ConstVertexIterator &vertex, const InstructionSemantics2::BaseSemantics::DispatcherPtr &cpu, size_t pathInsnIndex)
Process an indeterminate block.
Base class for machine instructions.
Sawyer::Optional< rose_addr_t > returnFrom
This variable is the return value from the specified function.
boost::shared_ptr< class RiscOperators > RiscOperatorsPtr
Shared-ownership pointer to symbolic RISC operations.
FeasiblePath()
Constructs a new feasible path analyzer.
SearchMode
How to search for paths.
virtual bool process(const FeasiblePath &analysis, const FunctionSummary &summary, const InstructionSemantics2::SymbolicSemantics::RiscOperatorsPtr &ops)=0
Invoked when the analysis traverses the summary.
virtual void processFunctionSummary(const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathsVertex, const InstructionSemantics2::BaseSemantics::DispatcherPtr &cpu, size_t pathInsnIndex)
Process a function summary vertex.
RegisterDescriptor REG_PATH
Descriptor of path pseudo-registers.
std::string name
Name of summarized function.
Sawyer::Optional< size_t > firstAccessIdx
Instruction position in path where this var was first read.
A collection of related switch declarations.
Main namespace for the ROSE library.
Parses symbolic expressions from text.
Satisfiable
Satisfiability constants.
size_t maxCallDepth
Max length of path in terms of function calls.
struct Rose::BinaryAnalysis::FeasiblePath::Settings::NullDeref nullDeref
Settings for null-dereference analysis.
Blast everything at once to the SMT solver.
Name space for the entire library.
virtual void nullDeref(const FeasiblePath &analyzer, const Partitioner2::CfgPath &path, const SmtSolverPtr &solver, IoMode ioMode, const InstructionSemantics2::BaseSemantics::SValuePtr &addr, SgAsmInstruction *insn)
Function invoked whenever a null pointer dereference is detected.
std::vector< std::string > assertionLocations
Locations at which "constraints" are checked.
const FunctionSummaries & functionSummaries() const
Function summary information.
Partitioner2::CfgConstVertexSet cfgToPaths(const Partitioner2::CfgConstVertexSet &) const
Convert CFG vertices to path vertices.
virtual bool shouldInline(const Partitioner2::CfgPath &path, const Partitioner2::ControlFlowGraph::ConstVertexIterator &cfgCallTarget)
Determines whether a function call should be inlined.
virtual void memoryIo(const FeasiblePath &analyzer, IoMode ioMode, const InstructionSemantics2::BaseSemantics::SValuePtr &addr, const InstructionSemantics2::BaseSemantics::SValuePtr &value, const InstructionSemantics2::BaseSemantics::RiscOperatorsPtr &ops)
Function invoked every time a memory reference occurs.
static std::string expressionDocumentation()
Documentation for the symbolic expression parser.
void settings(const Settings &s)
Property: Settings used by this analysis.
boost::shared_ptr< class State > StatePtr
Shared-ownership pointer to a semantic state.
size_t maxPathLength
Limit path length in terms of number of instructions.
bool constOnly
If true, check only constants or sets of constants.
Base class for callbacks for function summaries.
boost::shared_ptr< class Dispatcher > DispatcherPtr
Shared-ownership pointer to a semantics instruction dispatcher.
AddressIntervalSet location
Location where constraint applies.
void clear()
Remove all entries from this container.
Visit edges in reverse of the natural order.
static InstructionSemantics2::BaseSemantics::StatePtr pathPostState(const Partitioner2::CfgPath &, size_t vertexIdx)
Get the state at the end of the specified vertex.
FunctionSummary()
Construct empty function summary.
bool nonAddressIsFeasible
Indeterminate/undiscovered vertices are feasible?
size_t maxVertexVisit
Max times to visit a particular vertex in one path.
Describes (part of) a physical CPU register.
size_t maxRecursionDepth
Max path length in terms of recursive function calls.
boost::shared_ptr< class RiscOperators > RiscOperatorsPtr
Shared-ownership pointer to a RISC operators object.
void reset()
Reset to initial state without changing settings.
A path through a control flow graph.
Definition: CfgPath.h:15
Information about a variable seen on a path.
virtual Action found(const FeasiblePath &analyzer, const Partitioner2::CfgPath &path, const InstructionSemantics2::BaseSemantics::DispatcherPtr &cpu, const SmtSolverPtr &solver)
Function invoked whenever a complete path is found.
FunctionSummarizer::Ptr functionSummarizer() const
Property: Function summary handling.
virtual bool shouldSummarizeCall(const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathVertex, const Partitioner2::ControlFlowGraph &cfg, const Partitioner2::ControlFlowGraph::ConstVertexIterator &cfgCallTarget)
Determines whether a function call should be summarized instead of inlined.
bool isFunctionCall(const Partitioner2::ControlFlowGraph::ConstVertexIterator &) const
True if vertex is a function call.
SymbolicExpr::Ptr expr
Symbolic expression.
bool ignoreSemanticFailure
Whether to ignore instructions with no semantic info.
SearchMode searchMode
Method to use when searching for feasible paths.
size_t Id
Attribute identification.
Definition: Attribute.h:140
void clear()
Remove all vertices and edges.
Definition: Graph.h:1978
bool pathEndsWithFunctionCall(const Partitioner2::CfgPath &) const
True if path ends with a function call.
void printPath(std::ostream &out, const Partitioner2::CfgPath &) const
Print the path to the specified output stream.
std::set< rose_addr_t > AddressSet
Set of basic block addresses.
virtual InstructionSemantics2::BaseSemantics::DispatcherPtr buildVirtualCpu(const Partitioner2::Partitioner &, const Partitioner2::CfgPath *, PathProcessor *, const SmtSolver::Ptr &)
Create the virtual CPU.
const Settings & settings() const
Property: Settings used by this analysis.
size_t memByteNumber
Byte number for memory access.
int64_t stackDelta
Stack delta for summarized function.
Base class for reference counted objects.
Definition: SharedObject.h:64
double kCycleCoefficient
Coefficient for adjusting maxPathLengh during CFG cycles.
static Sawyer::CommandLine::SwitchGroup commandLineSwitches(Settings &settings)
Describe command-line switches.
Sawyer::SharedPointer< FunctionSummarizer > Ptr
Reference counting pointer.
static Sawyer::Message::Facility mlog
Diagnostic output.
virtual void processVertex(const InstructionSemantics2::BaseSemantics::DispatcherPtr &cpu, const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathsVertex, size_t &pathInsnIndex)
Process one vertex.
const VarDetails & varDetails(const InstructionSemantics2::BaseSemantics::StatePtr &) const
Details about all variables by name.
void clear()
Remove all edges or vertices from this set.
static size_t pathLength(const Partitioner2::CfgPath &)
Total length of path.
Partitioner2::ControlFlowGraph::ConstVertexIterator pathToCfg(const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathVertex) const
Convert path vertex to a CFG vertex.
Visit edges in their natural, forward order.
const FunctionSummary & functionSummary(rose_addr_t entryVa) const
Function summary information.
const Partitioner2::Partitioner & partitioner() const
Property: Partitioner currently in use.
Defines registers available for a particular architecture.
Definition: Registers.h:35
const VarDetail & varDetail(const InstructionSemantics2::BaseSemantics::StatePtr &, const std::string &varName) const
Details about a variable.
virtual void processBasicBlock(const Partitioner2::BasicBlock::Ptr &bblock, const InstructionSemantics2::BaseSemantics::DispatcherPtr &cpu, size_t pathInsnIndex)
Process instructions for one basic block on the specified virtual CPU.
SymbolicExpr::Ptr memAddress
Address where variable is located.
Partitions instructions into basic blocks and functions.
Definition: Partitioner.h:316
const AddressSet & reachedBlockVas() const
Property: Addresses reached during analysis.
std::string solverName
Type of SMT solver.
EdgeVisitOrder
Edge visitation order.
void functionSummarizer(const FunctionSummarizer::Ptr &f)
Property: Function summary handling.
Settings & settings()
Property: Settings used by this analysis.
size_t memSize
Size of total memory access in bytes.
Container associating values with keys.
Definition: Sawyer/Map.h:66
std::string exprParserDoc
String documenting how expressions are parsed, empty for default.
bool processFinalVertex
Whether to process the last vertex of the path.
SgAsmInstruction * firstAccessInsn
Instruction address where this var was first read.
Settings that control this analysis.
static void initDiagnostics()
Initialize diagnostic output.
bool check
If true, look for null dereferences along the paths.
virtual void setInitialState(const InstructionSemantics2::BaseSemantics::DispatcherPtr &cpu, const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathsBeginVertex)
Initialize state for first vertex of path.
Sawyer::Optional< rose_addr_t > initialStackPtr
Concrete value to use for stack pointer register initial value.
SemanticMemoryParadigm
Organization of semantic memory.
std::vector< Expression > assertions
Constraints to be satisfied at some point along the path.
virtual void init(const FeasiblePath &analysis, FunctionSummary &summary, const Partitioner2::Function::Ptr &function, Partitioner2::ControlFlowGraph::ConstVertexIterator cfgCallTarget)=0
Invoked when a new summary is created.