#include <AndersenPWC.h>

Inheritance diagram for SVF::AndersenSCD:

Public Types
typedef Map< NodeID, NodeID >	NodeToNodeMap

Public Types inherited from SVF::Andersen
typedef SCCDetection< ConstraintGraph * >	CGSCC

Public Types inherited from SVF::AndersenBase
typedef OrderedMap< const CallICFGNode *, NodeID >	CallSite2DummyValPN

Public Types inherited from SVF::WPASolver< GraphType >
typedef SVF::GenericGraphTraits< GraphType >	GTraits
	Define the GTraits and node iterator for printing.

typedef GTraits::NodeRef	GNODE

typedef GTraits::EdgeType	GEDGE

typedef GTraits::ChildIteratorType	child_iterator

typedef SCCDetection< GraphType >	SCC

typedef FIFOWorkList< NodeID >	WorkList

Public Types inherited from SVF::BVDataPTAImpl
enum	PTBackingType { Mutable , Persistent }
	How the PTData used is implemented. More...

typedef PTData< NodeID, NodeSet, NodeID, PointsTo >	PTDataTy

typedef DiffPTData< NodeID, NodeSet, NodeID, PointsTo >	DiffPTDataTy

typedef DFPTData< NodeID, NodeSet, NodeID, PointsTo >	DFPTDataTy

typedef VersionedPTData< NodeID, NodeSet, NodeID, PointsTo, VersionedVar, Set< VersionedVar > >	VersionedPTDataTy

typedef MutablePTData< NodeID, NodeSet, NodeID, PointsTo >	MutPTDataTy

typedef MutableDiffPTData< NodeID, NodeSet, NodeID, PointsTo >	MutDiffPTDataTy

typedef MutableDFPTData< NodeID, NodeSet, NodeID, PointsTo >	MutDFPTDataTy

typedef MutableIncDFPTData< NodeID, NodeSet, NodeID, PointsTo >	MutIncDFPTDataTy

typedef MutableVersionedPTData< NodeID, NodeSet, NodeID, PointsTo, VersionedVar, Set< VersionedVar > >	MutVersionedPTDataTy

typedef PersistentPTData< NodeID, NodeSet, NodeID, PointsTo >	PersPTDataTy

typedef PersistentDiffPTData< NodeID, NodeSet, NodeID, PointsTo >	PersDiffPTDataTy

typedef PersistentDFPTData< NodeID, NodeSet, NodeID, PointsTo >	PersDFPTDataTy

typedef PersistentIncDFPTData< NodeID, NodeSet, NodeID, PointsTo >	PersIncDFPTDataTy

typedef PersistentVersionedPTData< NodeID, NodeSet, NodeID, PointsTo, VersionedVar, Set< VersionedVar > >	PersVersionedPTDataTy

Public Types inherited from SVF::PointerAnalysis
enum	PTATY { Andersen_BASE , Andersen_WPA , AndersenSCD_WPA , AndersenSFR_WPA , AndersenWaveDiff_WPA , Steensgaard_WPA , CSCallString_WPA , CSSummary_WPA , FSDATAFLOW_WPA , FSSPARSE_WPA , VFS_WPA , FSCS_WPA , CFLFICI_WPA , CFLFSCI_WPA , CFLFSCS_WPA , TypeCPP_WPA , FieldS_DDA , FlowS_DDA , PathS_DDA , Cxt_DDA , Default_PTA }
	Pointer analysis type list. More...

enum	PTAImplTy { BaseImpl , BVDataImpl , CondImpl }
	Implementation type: BVDataPTAImpl or CondPTAImpl. More...

typedef Set< const CallICFGNode * >	CallSiteSet
	Indirect call edges type, map a callsite to a set of callees.

typedef SVFIR::CallSiteToFunPtrMap	CallSiteToFunPtrMap

typedef Set< const FunObjVar * >	FunctionSet

typedef OrderedMap< const CallICFGNode *, FunctionSet >	CallEdgeMap

typedef SCCDetection< CallGraph * >	CallGraphSCC

typedef Set< const GlobalObjVar * >	VTableSet

typedef Set< const FunObjVar * >	VFunSet

Public Member Functions
	AndersenSCD (SVFIR *_pag, PTATY type=AndersenSCD_WPA)

Public Member Functions inherited from SVF::Andersen
	Andersen (SVFIR *_pag, PTATY type=Andersen_WPA, bool alias_check=true)
	Constructor.

virtual	~Andersen ()
	Destructor.

virtual void	initialize ()
	Initialize analysis.

virtual void	finalize ()
	Finalize analysis.

void	resetData ()
	Reset data.

virtual const PointsTo &	getPts (NodeID id)
	Operation of points-to set.

virtual bool	unionPts (NodeID id, const PointsTo &target)

virtual bool	unionPts (NodeID id, NodeID ptd)

void	dumpTopLevelPtsTo ()

void	setDetectPWC (bool flag)

Public Member Functions inherited from SVF::AndersenBase
	AndersenBase (SVFIR *_pag, PTATY type=Andersen_BASE, bool alias_check=true)
	Constructor.

	~AndersenBase () override
	Destructor.

virtual void	analyze () override
	Andersen analysis.

virtual void	solveAndwritePtsToFile (const std::string &filename)

virtual void	readPtsFromFile (const std::string &filename)

virtual void	solveConstraints ()

virtual bool	updateThreadCallGraph (const CallSiteToFunPtrMap &, NodePairSet &)
	Update thread call graph.

virtual void	connectCaller2ForkedFunParams (const CallICFGNode cs, const FunObjVar F, NodePairSet &cpySrcNodes)
	Connect formal and actual parameters for indirect forksites.

virtual void	connectCaller2CalleeParams (const CallICFGNode cs, const FunObjVar F, NodePairSet &cpySrcNodes)
	Connect formal and actual parameters for indirect callsites.

ConstraintGraph *	getConstraintGraph ()
	Get constraint graph.

NodeID	sccRepNode (NodeID id) const override
	SCC methods.

NodeBS &	sccSubNodes (NodeID repId)

void	printStat ()
	dump statistics

virtual void	normalizePointsTo () override

void	cleanConsCG (NodeID id)
	remove redundant gepnodes in constraint graph

Public Member Functions inherited from SVF::BVDataPTAImpl
	BVDataPTAImpl (SVFIR *pag, PointerAnalysis::PTATY type, bool alias_check=true)
	Constructor.

	~BVDataPTAImpl () override=default
	Destructor.

PersistentPointsToCache< PointsTo > &	getPtCache ()

const PointsTo &	getPts (NodeID id) override

const NodeSet &	getRevPts (NodeID nodeId) override

virtual void	clearPts (NodeID id, NodeID element)
	Remove element from the points-to set of id.

virtual void	clearFullPts (NodeID id)
	Clear points-to set of id.

virtual bool	addPts (NodeID id, NodeID ptd)

virtual void	clearAllPts ()
	Clear all data.

virtual void	expandFIObjs (const PointsTo &pts, PointsTo &expandedPts)
	Expand FI objects.

virtual void	expandFIObjs (const NodeBS &pts, NodeBS &expandedPts)
	TODO: remove repetition.

void	remapPointsToSets (void)
	Remap all points-to sets to use the current mapping.

virtual void	writeToFile (const std::string &filename)
	Interface for analysis result storage on filesystem.

virtual void	writeObjVarToFile (const std::string &filename)

virtual void	writePtsResultToFile (std::fstream &f)

virtual void	writeGepObjVarMapToFile (std::fstream &f)

virtual bool	readFromFile (const std::string &filename)

virtual void	readPtsResultFromFile (std::ifstream &f)

virtual void	readGepObjVarMapFromFile (std::ifstream &f)

virtual void	readAndSetObjFieldSensitivity (std::ifstream &f, const std::string &delimiterStr)

AliasResult	alias (const SVFVar V1, const SVFVar V2) override
	Interface expose to users of our pointer analysis, given Value infos.

AliasResult	alias (NodeID node1, NodeID node2) override
	Interface expose to users of our pointer analysis, given PAGNodeID.

virtual AliasResult	alias (const PointsTo &pts1, const PointsTo &pts2)
	Interface expose to users of our pointer analysis, given two pts.

void	dumpCPts () override
	dump and debug, print out conditional pts

void	dumpTopLevelPtsTo () override

void	dumpAllPts () override

Public Member Functions inherited from SVF::PointerAnalysis
ICFG *	getICFG () const
	Get ICFG.

u32_t	getNumOfResolvedIndCallEdge () const
	Return number of resolved indirect call edges.

CallGraph *	getCallGraph () const
	Return call graph.

CallGraphSCC *	getCallGraphSCC () const
	Return call graph SCC.

	PointerAnalysis (SVFIR *pag, PTATY ty=Default_PTA, bool alias_check=true)
	Constructor.

PTATY	getAnalysisTy () const
	Type of pointer analysis.

PTAImplTy	getImplTy () const
	Return implementation type of the pointer analysis.

bool	printStat ()
	Whether print statistics.

void	disablePrintStat ()
	Whether print statistics.

CallEdgeMap &	getIndCallMap ()
	Get callees from an indirect callsite.

bool	hasIndCSCallees (const CallICFGNode *cs) const

const FunctionSet &	getIndCSCallees (const CallICFGNode *cs) const

virtual void	resolveIndCalls (const CallICFGNode *cs, const PointsTo &target, CallEdgeMap &newEdges)
	Resolve indirect call edges.

void	callGraphSCCDetection ()
	PTACallGraph SCC related methods.

NodeID	getCallGraphSCCRepNode (NodeID id) const
	Get SCC rep node of a SVFG node.

bool	inSameCallGraphSCC (const FunObjVar fun1, const FunObjVar fun2)
	Return TRUE if this edge is inside a PTACallGraph SCC, i.e., src node and dst node are in the same SCC on the SVFG.

bool	isInRecursion (const FunObjVar *fun) const

bool	isLocalVarInRecursiveFun (NodeID id) const
	Whether a local variable is in function recursions.

CommonCHGraph *	getCHGraph () const
	get CHGraph

void	getVFnsFromCHA (const CallICFGNode *cs, VFunSet &vfns)

void	getVFnsFromPts (const CallICFGNode *cs, const PointsTo &target, VFunSet &vfns)

void	connectVCallToVFns (const CallICFGNode *cs, const VFunSet &vfns, CallEdgeMap &newEdges)

virtual void	resolveCPPIndCalls (const CallICFGNode *cs, const PointsTo &target, CallEdgeMap &newEdges)
	Resolve cpp indirect call edges.

SVFIR *	getPAG () const

PTAStat *	getStat () const
	Get PTA stat.

OrderedNodeSet &	getAllValidPtrs ()
	Get all Valid Pointers for resolution.

virtual void	computeDDAPts (NodeID)
	Compute points-to results on-demand, overridden by derived classes.

void	printIndCSTargets (const CallICFGNode *cs, const FunctionSet &targets)
	Print targets of a function pointer.

virtual void	dumpPts (NodeID ptr, const PointsTo &pts)

void	printIndCSTargets ()

void	dumpAllTypes ()

void	dumpStat ()
	Dump the statistics.

bool	containBlackHoleNode (const PointsTo &pts)
	Determine whether a points-to contains a black hole or constant node.

bool	containConstantNode (const PointsTo &pts)

virtual bool	isBlkObjOrConstantObj (NodeID ptd) const

bool	isHeapMemObj (NodeID id) const
	Whether this object is heap or array.

bool	isArrayMemObj (NodeID id) const

bool	isFIObjNode (NodeID id) const

NodeID	getBaseObjVar (NodeID id)

NodeID	getFIObjVar (NodeID id)

NodeID	getGepObjVar (NodeID id, const APOffset &ap)

virtual const NodeBS &	getAllFieldsObjVars (NodeID id)

void	setObjFieldInsensitive (NodeID id)

bool	isFieldInsensitive (NodeID id) const

Static Public Member Functions
static AndersenSCD *	createAndersenSCD (SVFIR *_pag)
	Create an singleton instance directly instead of invoking llvm pass manager.

static void	releaseAndersenSCD ()

Static Public Member Functions inherited from SVF::Andersen
static bool	classof (const Andersen *)
	Methods for support type inquiry through isa, cast, and dyn_cast:

static bool	classof (const PointerAnalysis *pta)

Static Public Member Functions inherited from SVF::AndersenBase
static bool	classof (const AndersenBase *)
	Methods for support type inquiry through isa, cast, and dyn_cast:

static bool	classof (const PointerAnalysis *pta)

Static Public Member Functions inherited from SVF::BVDataPTAImpl
static bool	classof (const PointerAnalysis *pta)

Protected Member Functions
void	addSccCandidate (NodeID nodeId)

virtual NodeStack &	SCCDetect ()

virtual void	PWCDetect ()

virtual void	solveWorklist ()

virtual void	handleLoadStore (ConstraintNode *node)

virtual void	processAddr (const AddrCGEdge *addr)

virtual bool	addCopyEdge (NodeID src, NodeID dst)

virtual bool	updateCallGraph (const CallSiteToFunPtrMap &callsites)

virtual void	processPWC (ConstraintNode *rep)

virtual void	handleCopyGep (ConstraintNode *node)

Protected Member Functions inherited from SVF::Andersen
virtual void	computeDiffPts (NodeID id)
	Handle diff points-to set.

virtual const PointsTo &	getDiffPts (NodeID id)

void	updatePropaPts (NodeID dstId, NodeID srcId)
	Handle propagated points-to set.

void	clearPropaPts (NodeID src)

virtual void	initWorklist ()

virtual void	processNode (NodeID nodeId)
	Override WPASolver function in order to use the default solver.

void	processAllAddr ()
	handling various constraints

virtual bool	processLoad (NodeID node, const ConstraintEdge *load)

virtual bool	processStore (NodeID node, const ConstraintEdge *load)

virtual bool	processCopy (NodeID node, const ConstraintEdge *edge)

virtual bool	processGep (NodeID node, const GepCGEdge *edge)

virtual bool	processGepPts (const PointsTo &pts, const GepCGEdge *edge)

virtual void	mergeNodeToRep (NodeID nodeId, NodeID newRepId)
	Merge sub node to its rep.

virtual bool	mergeSrcToTgt (NodeID srcId, NodeID tgtId)

void	mergeSccNodes (NodeID repNodeId, const NodeBS &subNodes)
	Merge sub node in a SCC cycle to their rep node.

void	mergeSccCycle ()

virtual void	collapsePWCNode (NodeID nodeId)
	Collapse a field object into its base for field insensitive analysis.

void	collapseFields ()
	collapse positive weight cycles of a graph

bool	collapseNodePts (NodeID nodeId)

bool	collapseField (NodeID nodeId)

void	updateNodeRepAndSubs (NodeID nodeId, NodeID newRepId)
	Updates subnodes of its rep, and rep node of its subs.

void	sanitizePts ()
	Sanitize pts for field insensitive objects.

virtual const std::string	PTAName () const
	Get PTA name.

virtual void	cluster (void) const

Protected Member Functions inherited from SVF::AndersenBase
void	heapAllocatorViaIndCall (const CallICFGNode *cs, NodePairSet &cpySrcNodes)

Protected Member Functions inherited from SVF::WPASolver< GraphType >
	WPASolver ()
	Constructor.

virtual	~WPASolver ()=default
	Destructor.

SCC *	getSCCDetector () const
	Get SCC detector.

const GraphType	graph ()
	Get/Set graph methods.

void	setGraph (GraphType g)

virtual NodeStack &	SCCDetect (NodeSet &candidates)

virtual void	propagate (GNODE *v)

virtual bool	propFromSrcToDst (GEDGE *)
	Propagate information from source to destination node, to be implemented in the child class.

NodeID	popFromWorklist ()
	Worklist operations.

virtual void	pushIntoWorklist (NodeID id)

bool	isWorklistEmpty ()

bool	isInWorklist (NodeID id)

GNODE *	Node (NodeID id)
	Get node on the graph.

NodeID	Node_Index (GNODE node)
	Get node ID.

Protected Member Functions inherited from SVF::BVDataPTAImpl
PTDataTy *	getPTDataTy () const
	Get points-to data structure.

void	finalize () override
	Finalization of pointer analysis, and normalize points-to information to Bit Vector representation.

DiffPTDataTy *	getDiffPTDataTy () const

DFPTDataTy *	getDFPTDataTy () const

MutDFPTDataTy *	getMutDFPTDataTy () const

VersionedPTDataTy *	getVersionedPTDataTy () const

virtual void	onTheFlyCallGraphSolve (const CallSiteToFunPtrMap &callsites, CallEdgeMap &newEdges)
	On the fly call graph construction.

virtual void	onTheFlyThreadCallGraphSolve (const CallSiteToFunPtrMap &callsites, CallEdgeMap &newForkEdges)
	On the fly thread call graph construction respecting forksite.

Protected Member Functions inherited from SVF::PointerAnalysis
const CallSiteToFunPtrMap &	getIndirectCallsites () const
	Return all indirect callsites.

NodeID	getFunPtr (const CallICFGNode *cs) const
	Return function pointer PAGNode at a callsite cs.

virtual void	validateTests ()
	Alias check functions to verify correctness of pointer analysis.

virtual void	validateSuccessTests (std::string fun)

virtual void	validateExpectedFailureTests (std::string fun)

void	resetObjFieldSensitive ()
	Reset all object node as field-sensitive.

Protected Attributes
NodeSet	sccCandidates

NodeToNodeMap	pwcReps

Protected Attributes inherited from SVF::Andersen
CallSite2DummyValPN	callsite2DummyValPN
	Map an instruction to a dummy obj which created at an indirect callsite, which invokes a heap allocator.

Protected Attributes inherited from SVF::AndersenBase
ConstraintGraph *	consCG
	Constraint Graph.

CallSite2DummyValPN	callsite2DummyValPN

Protected Attributes inherited from SVF::WPASolver< GraphType >
bool	reanalyze
	Reanalyze if any constraint value changed.

u32_t	iterationForPrintStat
	print out statistics for i-th iteration

GraphType	_graph
	Graph.

std::unique_ptr< SCC >	scc
	SCC.

WorkList	worklist
	Worklist for resolution.

Protected Attributes inherited from SVF::PointerAnalysis
bool	print_stat
	User input flags.

bool	alias_validation
	Flag for validating points-to/alias results.

u32_t	OnTheFlyIterBudgetForStat
	Flag for iteration budget for on-the-fly statistics.

PTATY	ptaTy
	Pointer analysis Type.

PTAImplTy	ptaImplTy
	PTA implementation type.

PTAStat *	stat
	Statistics.

CallGraph *	callgraph
	Call graph used for pointer analysis.

CallGraphSCC *	callGraphSCC
	SCC for PTACallGraph.

ICFG *	icfg
	Interprocedural control-flow graph.

CommonCHGraph *	chgraph
	CHGraph.

Static Protected Attributes
static AndersenSCD *	scdAndersen = nullptr

Static Protected Attributes inherited from SVF::PointerAnalysis
static SVFIR *	pag = nullptr
	SVFIR.

Additional Inherited Members
Public Attributes inherited from SVF::AndersenBase
NodeBS	redundantGepNodes

Public Attributes inherited from SVF::WPASolver< GraphType >
u32_t	numOfIteration
	num of iterations during constraint solving

Static Public Attributes inherited from SVF::AndersenBase
static u32_t	numOfProcessedAddr = 0
	Statistics.

static u32_t	numOfProcessedCopy = 0
	Number of processed Addr edge.

static u32_t	numOfProcessedGep = 0
	Number of processed Copy edge.

static u32_t	numOfProcessedLoad = 0
	Number of processed Gep edge.

static u32_t	numOfProcessedStore = 0
	Number of processed Load edge.

static u32_t	numOfSfrs = 0
	Number of processed Store edge.

static u32_t	numOfFieldExpand = 0

static u32_t	numOfSCCDetection = 0

static double	timeOfSCCDetection = 0

static double	timeOfSCCMerges = 0

static double	timeOfCollapse = 0

static u32_t	AveragePointsToSetSize = 0

static u32_t	MaxPointsToSetSize = 0

static double	timeOfProcessCopyGep = 0

static double	timeOfProcessLoadStore = 0

static double	timeOfUpdateCallGraph = 0

Static Public Attributes inherited from SVF::PointerAnalysis
static const std::string	aliasTestMayAlias = "MAYALIAS"

static const std::string	aliasTestMayAliasMangled = "_Z8MAYALIASPvS_"

static const std::string	aliasTestNoAlias = "NOALIAS"

static const std::string	aliasTestNoAliasMangled = "_Z7NOALIASPvS_"

static const std::string	aliasTestPartialAlias = "PARTIALALIAS"

static const std::string	aliasTestPartialAliasMangled = "_Z12PARTIALALIASPvS_"

static const std::string	aliasTestMustAlias = "MUSTALIAS"

static const std::string	aliasTestMustAliasMangled = "_Z9MUSTALIASPvS_"

static const std::string	aliasTestFailMayAlias = "EXPECTEDFAIL_MAYALIAS"

static const std::string	aliasTestFailMayAliasMangled = "_Z21EXPECTEDFAIL_MAYALIASPvS_"

static const std::string	aliasTestFailNoAlias = "EXPECTEDFAIL_NOALIAS"

static const std::string	aliasTestFailNoAliasMangled = "_Z20EXPECTEDFAIL_NOALIASPvS_"

Detailed Description

Selective Cycle Detection Based Andersen Analysis

Definition at line 44 of file AndersenPWC.h.

Member Typedef Documentation

◆ NodeToNodeMap

typedef Map<NodeID, NodeID> SVF::AndersenSCD::NodeToNodeMap

Definition at line 47 of file AndersenPWC.h.

Constructor & Destructor Documentation

◆ AndersenSCD()

SVF::AndersenSCD::AndersenSCD	(	SVFIR *	_pag,
		PTATY	type = `AndersenSCD_WPA`
	)

inline

Definition at line 55 of file AndersenPWC.h.

                                                           :
        Andersen(_pag,type)
    {
    }

Member Function Documentation

◆ addCopyEdge()

bool AndersenSCD::addCopyEdge	(	NodeID	src,
		NodeID	dst
	)

protectedvirtual

If one copy edge is successful added, the src node should be added into SCC detection

Reimplemented from SVF::Andersen.

Definition at line 261 of file AndersenSCD.cpp.

{
    if (Andersen::addCopyEdge(src, dst))
    {
        addSccCandidate(src);
        return true;
    }
    return false;
}

◆ addSccCandidate()

void SVF::AndersenSCD::addSccCandidate ( NodeID nodeId )

inlineprotected

Definition at line 80 of file AndersenPWC.h.

    {
        sccCandidates.insert(sccRepNode(nodeId));
    }

◆ createAndersenSCD()

static AndersenSCD * SVF::AndersenSCD::createAndersenSCD ( SVFIR * _pag )

inlinestatic

Create an singleton instance directly instead of invoking llvm pass manager.

Definition at line 61 of file AndersenPWC.h.

    {
        if (scdAndersen == nullptr)
        {
            scdAndersen = new AndersenSCD(_pag);
            scdAndersen->analyze();
            return scdAndersen;
        }
        return scdAndersen;
    }

◆ handleCopyGep()

void AndersenSCD::handleCopyGep ( ConstraintNode * node )

protectedvirtual

Compute diff points-to set before propagation

Reimplemented from SVF::Andersen.

Definition at line 149 of file AndersenSCD.cpp.

{
    NodeID nodeId = node->getId();
 
    if (!Options::DetectPWC() && getSCCDetector()->subNodes(nodeId).count() > 1)
        processPWC(node);
    else if(isInWorklist(nodeId))
        Andersen::handleCopyGep(node);
}

◆ handleLoadStore()

void AndersenSCD::handleLoadStore ( ConstraintNode * node )

protectedvirtual

Source nodes of new added edges are pushed into sccCandidates. Source nodes of new added edges whose pts differ from those of dst nodes are pushed into worklist.

Reimplemented from SVF::Andersen.

Definition at line 208 of file AndersenSCD.cpp.

{
    double insertStart = stat->getClk();
 
    NodeID nodeId = node->getId();
    // handle load
    for (ConstraintNode::const_iterator it = node->outgoingLoadsBegin(),
            eit = node->outgoingLoadsEnd(); it != eit; ++it)
        for (PointsTo::iterator piter = getPts(nodeId).begin(), epiter =
                    getPts(nodeId).end(); piter != epiter; ++piter)
        {
            NodeID ptd = *piter;
            if (processLoad(ptd, *it))
            {
                reanalyze = true;
            }
        }
 
    // handle store
    for (ConstraintNode::const_iterator it = node->incomingStoresBegin(),
            eit = node->incomingStoresEnd(); it != eit; ++it)
        for (PointsTo::iterator piter = getPts(nodeId).begin(), epiter =
                    getPts(nodeId).end(); piter != epiter; ++piter)
        {
            NodeID ptd = *piter;
            if (processStore(ptd, *it))
            {
                reanalyze = true;
            }
        }
 
    double insertEnd = stat->getClk();
    timeOfProcessLoadStore += (insertEnd - insertStart) / TIMEINTERVAL;
}

◆ processAddr()

void AndersenSCD::processAddr ( const AddrCGEdge * addr )

protectedvirtual

Initialize worklist via processing addrs

Reimplemented from SVF::Andersen.

Definition at line 247 of file AndersenSCD.cpp.

{
    numOfProcessedAddr++;
 
    NodeID dst = addr->getDstID();
    NodeID src = addr->getSrcID();
    addPts(dst,src);
    addSccCandidate(dst);
}

◆ processPWC()

void AndersenSCD::processPWC ( ConstraintNode * rep )

protectedvirtual

Definition at line 163 of file AndersenSCD.cpp.

{
    NodeID repId = rep->getId();
 
    NodeSet pwcNodes;
    for (NodeID nId : getSCCDetector()->subNodes(repId))
        pwcNodes.insert(nId);
 
    WorkList tmpWorkList;
    for (NodeID subId : pwcNodes)
        if (isInWorklist(subId))
            tmpWorkList.push(subId);
 
    while (!tmpWorkList.empty())
    {
        NodeID nodeId = tmpWorkList.pop();
        computeDiffPts(nodeId);
 
        if (!getDiffPts(nodeId).empty())
        {
            ConstraintNode *node = consCG->getConstraintNode(nodeId);
            for (ConstraintEdge* edge : node->getCopyOutEdges())
            {
                bool changed = processCopy(nodeId, edge);
                if (changed && pwcNodes.find(edge->getDstID()) != pwcNodes.end())
                    tmpWorkList.push(edge->getDstID());
            }
            for (ConstraintEdge* edge : node->getGepOutEdges())
            {
                if (GepCGEdge *gepEdge = SVFUtil::dyn_cast<GepCGEdge>(edge))
                {
                    bool changed = processGep(nodeId, gepEdge);
                    if (changed && pwcNodes.find(edge->getDstID()) != pwcNodes.end())
                        tmpWorkList.push(edge->getDstID());
                }
            }
        }
    }
}

◆ PWCDetect()

void AndersenSCD::PWCDetect ( )

protectedvirtual

Reimplemented in SVF::AndersenSFR.

Definition at line 126 of file AndersenSCD.cpp.

{
    // replace scc candidates by their reps
    NodeSet tmpSccCandidates = sccCandidates;
    sccCandidates.clear();
    for (NodeID candidate : tmpSccCandidates)
        sccCandidates.insert(sccRepNode(candidate));
    tmpSccCandidates.clear();
 
    // set scc edge type as direct edge
    bool pwcFlag = Options::DetectPWC();
    setDetectPWC(true);
 
    getSCCDetector()->find(sccCandidates);
 
    // reset scc edge type
    setDetectPWC(pwcFlag);
}

◆ releaseAndersenSCD()

static void SVF::AndersenSCD::releaseAndersenSCD ( )

inlinestatic

Definition at line 72 of file AndersenPWC.h.

    {
        if (scdAndersen)
            delete scdAndersen;
        scdAndersen = nullptr;
    }

◆ SCCDetect()

NodeStack & AndersenSCD::SCCDetect ( )

protectedvirtual

SCC detection for SCD

Reimplemented from SVF::Andersen.

Definition at line 97 of file AndersenSCD.cpp.

{
    numOfSCCDetection++;
 
    double sccStart = stat->getClk();
    getSCCDetector()->find(sccCandidates);
    double sccEnd = stat->getClk();
    timeOfSCCDetection +=  (sccEnd - sccStart)/TIMEINTERVAL;
 
    double mergeStart = stat->getClk();
    mergeSccCycle();
    double mergeEnd = stat->getClk();
    timeOfSCCMerges +=  (mergeEnd - mergeStart)/TIMEINTERVAL;
 
    if (!Options::DetectPWC())
    {
        sccStart = stat->getClk();
        PWCDetect();
        sccEnd = stat->getClk();
        timeOfSCCDetection += (sccEnd - sccStart) / TIMEINTERVAL;
    }
 
    return getSCCDetector()->topoNodeStack();
}

◆ solveWorklist()

void AndersenSCD::solveWorklist ( )

protectedvirtual

Reimplemented from SVF::WPASolver< GraphType >.

Definition at line 44 of file AndersenSCD.cpp.

{
    // Initialize the nodeStack via a whole SCC detection
    // Nodes in nodeStack are in topological order by default.
    NodeStack& nodeStack = SCCDetect();
 
    for (NodeID nId : sccCandidates)
        pushIntoWorklist(nId);
    sccCandidates.clear();
 
    // propagate point-to sets
    while (!nodeStack.empty())
    {
        NodeID nodeId = nodeStack.top();
        nodeStack.pop();
 
        if (sccRepNode(nodeId) == nodeId)
        {
            collapsePWCNode(nodeId);
 
            if (isInWorklist(nodeId))
                // push the rep of node into worklist
                pushIntoWorklist(nodeId);
 
            double propStart = stat->getClk();
            // propagate pts through copy and gep edges
            ConstraintNode* node = consCG->getConstraintNode(nodeId);
            handleCopyGep(node);
            double propEnd = stat->getClk();
            timeOfProcessCopyGep += (propEnd - propStart) / TIMEINTERVAL;
 
            collapseFields();
        }
    }
 
    // New nodes will be inserted into workList during processing.
    while (!isWorklistEmpty())
    {
        NodeID nodeId = popFromWorklist();
 
        double insertStart = stat->getClk();
        // add copy edges via processing load or store edges
        ConstraintNode* node = consCG->getConstraintNode(nodeId);
        handleLoadStore(node);
        double insertEnd = stat->getClk();
        timeOfProcessLoadStore += (insertEnd - insertStart) / TIMEINTERVAL;
    }
}

◆ updateCallGraph()

bool AndersenSCD::updateCallGraph ( const CallSiteToFunPtrMap & callsites )

protectedvirtual

Update call graph for the input indirect callsites

nodes as a src of a generated new copy edge

Reimplemented from SVF::AndersenBase.

Definition at line 275 of file AndersenSCD.cpp.

{
    double cgUpdateStart = stat->getClk();
 
    CallEdgeMap newEdges;
    onTheFlyCallGraphSolve(callsites,newEdges);
    NodePairSet cpySrcNodes;    
    for(CallEdgeMap::iterator it = newEdges.begin(), eit = newEdges.end(); it!=eit; ++it )
    {
        for(FunctionSet::iterator cit = it->second.begin(), ecit = it->second.end(); cit!=ecit; ++cit)
        {
            connectCaller2CalleeParams(it->first,*cit,cpySrcNodes);
        }
    }
 
    double cgUpdateEnd = stat->getClk();
    timeOfUpdateCallGraph += (cgUpdateEnd - cgUpdateStart) / TIMEINTERVAL;
 
    return (!newEdges.empty());
}

Member Data Documentation

◆ pwcReps

NodeToNodeMap SVF::AndersenSCD::pwcReps

protected

Definition at line 52 of file AndersenPWC.h.

◆ sccCandidates

NodeSet SVF::AndersenSCD::sccCandidates

protected

Definition at line 51 of file AndersenPWC.h.

◆ scdAndersen

AndersenSCD * AndersenSCD::scdAndersen = nullptr

staticprotected

Definition at line 50 of file AndersenPWC.h.

The documentation for this class was generated from the following files:

/home/runner/work/SVF/SVF/svf/include/WPA/AndersenPWC.h
/home/runner/work/SVF/SVF/svf/lib/WPA/AndersenSCD.cpp

Public Types

Public Member Functions

Static Public Member Functions

Protected Member Functions

Protected Attributes

Static Protected Attributes

Additional Inherited Members

Detailed Description

Member Typedef Documentation

◆ NodeToNodeMap

Constructor & Destructor Documentation

◆ AndersenSCD()

Member Function Documentation

◆ addCopyEdge()

◆ addSccCandidate()

◆ createAndersenSCD()

◆ handleCopyGep()

◆ handleLoadStore()

◆ processAddr()

◆ processPWC()

◆ PWCDetect()

◆ releaseAndersenSCD()

◆ SCCDetect()

◆ solveWorklist()

◆ updateCallGraph()

Member Data Documentation

◆ pwcReps

◆ sccCandidates

◆ scdAndersen