Interface exposed to users of our Alias analysis, given PAGNodeID

Two conditional points-to set are aliased when they access the same memory location under the same condition

! * Allocate conditions for a basic block and propagate its condition to its successors. */

Program entry - entry policy is selected by -ae-fun-entry.

! * Start analysis */

dummy analyze method

Analyze the entry functions selected by collectProgEntryFuns(). Abstract state is shared across entry points so that functions analyzed from earlier e

! * Analyze byte size of heap alloc function (e.g. malloc/calloc/...) * 1) __attribute__((annotate("ALLOC_HEAP_RET"), annotate("AllocSize:Arg0")))

! * Analyse types of heap and static objects */

! * Analyze thread interleaving */

! * Analyze intraprocedural locks * A lock is intraprocedural if its lock span is within a procedural */

! * Analyse types of all flattened fields of this object */

! * Analyse types of heap and static objects */

* do the following things: * 1. initialize virtualFunctions for each class * 2. mark multi-inheritance classes * 3. mark pure abstract classes *

Backward traverse along direct value flows

Backward traverse along indirect value flows

dpm transit during backward tracing

CFL forward traverse solve

CFL forward traverse solve

* Return true if the basic block has a return instruction */

iterators @{

Begin iterator over the head of cycles

Begin iterator over the components

Return TRUE if both edges are indirect call/ret edges.

Set all value bottom

! * Start building TCT */

! * Start here */

* You can build a SVFIR from a file written by yourself * * The file should follow the format: * Node: nodeID Nodetype * Edge: nodeID edgetype N

Create DDA SVFG

! * Create ICFG nodes and edges */

! * We start from here * @param icfg ICFG */

! * Start building SVFIR here */

Shouldn't write optimised SVFG to file; writes the built SVFG to file before optimisation

! * Start building constraint graph */

! * Collect candidate functions for context-sensitive lock analysis */

* build the following two maps: * classNameToDescendantsMap * chg->classNameToAncestorsMap */

! * Build control dependence for each function * * (1) construct CFG for each function * (2) extract basic block edges (pred->succ) on the CFG to

/ Build graph from json file

/ Build graph from text file

There are three types of functions(definitions) in extapi.c: 1. (Fun_Overwrite): Functions with "OVERWRITE" annotion: These functions are

! * Build map at ICFG node level */

! * Build llvm loops based on LoopInfo analysis * @param mod SVF module * @param llvmLoops output llvm loops */

Build the node to WTO cycle depth table

! * Build relational Z3Expr * @param cmp * @param succ * @param vars return all the relational vars of a given variable * @param initVars the var

! * Build SVFG * 1) build SVFG nodes * a) statements for top level pointers (SVFStmts) * b) operators of address-taken variables (MSSAPHI an

! * Create SVFG */

Build SVFG

! * Build SVF loops based on llvm loops * @param icfg ICFG * @param llvmLoops input llvm loops */

Sets the usage member to a usage string, built from the static list of options. argv0 is argv[0] and callFormat is how the command should be used, min

build label and kind connect from the grammar