#include <Steensgaard.h>

Inheritance diagram for SVF::Steensgaard:

Public Types
typedef Map< NodeID, NodeID >	NodeToEquivClassMap
typedef Map< NodeID, Set< NodeID > >	NodeToSubsMap
Public Types inherited from SVF::AndersenBase
typedef OrderedMap< const CallICFGNode *, NodeID >	CallSite2DummyValPN
Public Types inherited from SVF::WPASolver< ConstraintGraph * >
typedef SVF::GenericGraphTraits< ConstraintGraph * >	GTraits
	Define the GTraits and node iterator for printing.
typedef GTraits::NodeRef	GNODE
typedef GTraits::EdgeType	GEDGE
typedef GTraits::ChildIteratorType	child_iterator
typedef SCCDetection< ConstraintGraph * >	SCC
typedef FIFOWorkList< NodeID >	WorkList
Public Types inherited from SVF::BVDataPTAImpl
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
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
	Steensgaard (SVFIR *_pag)
	Constructor.
virtual void	solveWorklist () override
void	processAllAddr ()
void	ecUnion (NodeID id, NodeID ec)
	merge node into equiv class and merge node's pts into ec's pts
virtual const PointsTo &	getPts (NodeID id) override
	Operation of points-to set.
virtual bool	unionPts (NodeID id, const PointsTo &target) override
	pts(id) = pts(id) U target
virtual bool	unionPts (NodeID id, NodeID ptd) override
	pts(id) = pts(id) U pts(ptd)
NodeID	getEC (NodeID id) const
NodeID	sccRepNode (NodeID id) const override
	Return getEC(id).
void	setEC (NodeID node, NodeID rep)
Set< NodeID > &	getSubNodes (NodeID id)
void	addSubNode (NodeID node, NodeID sub)
virtual bool	addCopyEdge (NodeID src, NodeID dst) override
	Add copy edge on constraint graph.
Public Member Functions inherited from SVF::AndersenBase
	AndersenBase (SVFIR *_pag, PTATY type=PTATY::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 void	initialize () override
	Initialize analysis.
virtual void	finalize () override
	Finalize analysis.
virtual bool	updateCallGraph (const CallSiteToFunPtrMap &) override
	Update call graph.
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.
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, PTATY type, bool alias_check=true)
	Constructor.
	~BVDataPTAImpl () override=default
	Destructor.
PersistentPointsToCache< PointsTo > &	getPtCache ()
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.
bool	mayAlias (const PointsTo &pts1, const PointsTo &pts2)
	Convenience bool wrappers: return true if the two operands may/must/partial alias.
void	dumpCPts () override
	dump and debug, print out conditional pts
void	dumpTopLevelPtsTo () override
void	dumpAllPts () override
bool	mayAlias (const SVFVar V1, const SVFVar V2)
bool	mayAlias (NodeID node1, NodeID node2)
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=PTATY::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.
virtual const std::string	PTAName () const
	Return PTA name.
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	~PointerAnalysis ()
	Destructor.
virtual void	computeDDAPts (NodeID)
	Compute points-to results on-demand, overridden by derived classes.
virtual NodeBS	getMayAliases (NodeID node)
bool	mayAlias (const SVFVar V1, const SVFVar V2)
	Convenience bool wrappers: return true if the two operands may/must/partial alias.
bool	mayAlias (NodeID node1, NodeID node2)
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	getBaseObjVarID (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 Steensgaard *	createSteensgaard (SVFIR *_pag)
	Create an singleton instance.
static void	releaseSteensgaard ()
static bool	classof (const Steensgaard *)
	Methods for support type inquiry through isa, cast, and dyn_cast:
static bool	classof (const AndersenBase *pta)
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)

Private Attributes
NodeToEquivClassMap	nodeToECMap
NodeToSubsMap	nodeToSubsMap

Static Private Attributes
static Steensgaard *	steens = nullptr

Additional Inherited Members
Public Attributes inherited from SVF::AndersenBase
NodeBS	redundantGepNodes
Public Attributes inherited from SVF::WPASolver< ConstraintGraph * >
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_"
Protected Member Functions inherited from SVF::AndersenBase
void	heapAllocatorViaIndCall (const CallICFGNode *cs, NodePairSet &cpySrcNodes)
Protected Member Functions inherited from SVF::WPASolver< ConstraintGraph * >
	WPASolver ()
	Constructor.
virtual	~WPASolver ()=default
	Destructor.
SCC *	getSCCDetector () const
	Get SCC detector.
const ConstraintGraph *	graph ()
	Get/Set graph methods.
void	setGraph (ConstraintGraph *g)
virtual NodeStack &	SCCDetect ()
	SCC detection.
virtual NodeStack &	SCCDetect (NodeSet &candidates)
virtual void	initWorklist ()
virtual void	processNode (NodeID)
	Following methods are to be implemented in child class, in order to achieve a fully worked PTA.
virtual void	collapseFields ()
	collapse positive weight cycles of a graph
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.
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.
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 inherited from SVF::AndersenBase
ConstraintGraph *	consCG
	Constraint Graph.
CallSite2DummyValPN	callsite2DummyValPN
Protected Attributes inherited from SVF::WPASolver< ConstraintGraph * >
bool	reanalyze
	Reanalyze if any constraint value changed.
u32_t	iterationForPrintStat
	print out statistics for i-th iteration
ConstraintGraph *	_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 inherited from SVF::PointerAnalysis
static SVFIR *	pag = nullptr
	SVFIR.

Detailed Description

Definition at line 25 of file Steensgaard.h.

Member Typedef Documentation

◆ NodeToEquivClassMap

typedef Map<NodeID, NodeID> SVF::Steensgaard::NodeToEquivClassMap

Definition at line 29 of file Steensgaard.h.

◆ NodeToSubsMap

typedef Map<NodeID, Set<NodeID> > SVF::Steensgaard::NodeToSubsMap

Definition at line 30 of file Steensgaard.h.

Constructor & Destructor Documentation

◆ Steensgaard()

SVF::Steensgaard::Steensgaard ( SVFIR * _pag )

inline

Constructor.

Definition at line 33 of file Steensgaard.h.

33: AndersenBase(_pag, Steensgaard_WPA, true) {}

SVF::AndersenBase::AndersenBase

AndersenBase(SVFIR *_pag, PTATY type=PTATY::Andersen_BASE, bool alias_check=true)

Constructor.

Definition Andersen.h:68

SVF::Steensgaard_WPA

@ Steensgaard_WPA

Steensgaard PTA.

Definition PTATY.h:16

Member Function Documentation

◆ addCopyEdge()

virtual bool SVF::Steensgaard::addCopyEdge	(	NodeID	src,
		NodeID	dst )

inlineoverridevirtual

Add copy edge on constraint graph.

Implements SVF::AndersenBase.

Definition at line 123 of file Steensgaard.h.

    {
        return consCG->addCopyCGEdge(src, dst);
    }

◆ addSubNode()

void SVF::Steensgaard::addSubNode	(	NodeID	node,
		NodeID	sub )

inline

Definition at line 117 of file Steensgaard.h.

    {
        nodeToSubsMap[node].insert(sub);
    }

◆ classof() [1/3]

bool SVF::Steensgaard::classof ( const AndersenBase * pta )

inlinestatic

Definition at line 65 of file Steensgaard.h.

    {
        return (pta->getAnalysisTy() == Steensgaard_WPA);
    }

◆ classof() [2/3]

bool SVF::Steensgaard::classof ( const PointerAnalysis * pta )

inlinestatic

Definition at line 69 of file Steensgaard.h.

    {
        return (pta->getAnalysisTy() == Steensgaard_WPA);
    }

◆ classof() [3/3]

bool SVF::Steensgaard::classof ( const Steensgaard * )

inlinestatic

Methods for support type inquiry through isa, cast, and dyn_cast:

Definition at line 61 of file Steensgaard.h.

    {
        return true;
    }

◆ createSteensgaard()

Steensgaard * SVF::Steensgaard::createSteensgaard ( SVFIR * _pag )

inlinestatic

Create an singleton instance.

Definition at line 36 of file Steensgaard.h.

    {
        if (steens == nullptr)
        {
            steens = new Steensgaard(_pag);
            steens->analyze();
            return steens;
        }
        return steens;
    }

◆ ecUnion()

void Steensgaard::ecUnion	(	NodeID	id,
		NodeID	ec )

merge node into equiv class and merge node's pts into ec's pts

Definition at line 95 of file Steensgaard.cpp.

{
    if (unionPts(ec, node))
        pushIntoWorklist(ec);
    setEC(node, ec);
}

◆ getEC()

NodeID SVF::Steensgaard::getEC ( NodeID id ) const

inline

API for equivalence class operations Every constraint node maps to an unique equivalence class EC An equivalence class has a set of sub constraint nodes.

Definition at line 97 of file Steensgaard.h.

    {
        NodeToEquivClassMap::const_iterator it = nodeToECMap.find(id);
        if (it == nodeToECMap.end())
            return id;
        else
            return it->second;
    }

◆ getPts()

virtual const PointsTo & SVF::Steensgaard::getPts ( NodeID id )

inlineoverridevirtual

Operation of points-to set.

Reimplemented from SVF::BVDataPTAImpl.

Definition at line 76 of file Steensgaard.h.

    {
        return getPTDataTy()->getPts(getEC(id));
    }

◆ getSubNodes()

Set< NodeID > & SVF::Steensgaard::getSubNodes ( NodeID id )

inline

Definition at line 112 of file Steensgaard.h.

    {
        nodeToSubsMap[id].insert(id);
        return nodeToSubsMap[id];
    }

◆ processAllAddr()

void Steensgaard::processAllAddr ( )

Process address edges

Definition at line 105 of file Steensgaard.cpp.

{
    for (ConstraintGraph::const_iterator nodeIt = consCG->begin(),
            nodeEit = consCG->end();
            nodeIt != nodeEit; nodeIt++)
    {
        ConstraintNode* cgNode = nodeIt->second;
        for (ConstraintNode::const_iterator it = cgNode->incomingAddrsBegin(),
                eit = cgNode->incomingAddrsEnd();
                it != eit; ++it)
        {
            numOfProcessedAddr++;
 
            const AddrCGEdge* addr = cast<AddrCGEdge>(*it);
            NodeID dst = addr->getDstID();
            NodeID src = addr->getSrcID();
            if (addPts(dst, src))
                pushIntoWorklist(dst);
        }
    }
}

◆ releaseSteensgaard()

void SVF::Steensgaard::releaseSteensgaard ( )

inlinestatic

Definition at line 46 of file Steensgaard.h.

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

◆ sccRepNode()

NodeID SVF::Steensgaard::sccRepNode ( NodeID id ) const

inlineoverridevirtual

Return getEC(id).

Reimplemented from SVF::AndersenBase.

Definition at line 106 of file Steensgaard.h.

    {
        return getEC(id);
    }

◆ setEC()

void Steensgaard::setEC	(	NodeID	node,
		NodeID	rep )

Definition at line 82 of file Steensgaard.cpp.

{
    rep = getEC(rep);
    Set<NodeID>& subNodes = getSubNodes(node);
    for (NodeID sub : subNodes)
    {
        nodeToECMap[sub] = rep;
        addSubNode(rep, sub);
    }
    subNodes.clear();
}

◆ solveWorklist()

void Steensgaard::solveWorklist ( )

overridevirtual

Steensgaard analysis

foreach o \in pts(p)

*p = q : EC(o) == EC(q)

q = p : EC(q) == EC(p)

q = &p->f : EC(q) == EC(p)

Reimplemented from SVF::WPASolver< ConstraintGraph * >.

Definition at line 42 of file Steensgaard.cpp.

{
 
    processAllAddr();
 
    // Keep solving until workList is empty.
    while (!isWorklistEmpty())
    {
        NodeID nodeId = popFromWorklist();
        ConstraintNode* node = consCG->getConstraintNode(nodeId);
        for (NodeID o : getPts(nodeId))
        {
            for (ConstraintEdge* edge : node->getStoreInEdges())
            {
                ecUnion(edge->getSrcID(), o);
            }
            // r = *p : EC(r) == EC(o)
            for (ConstraintEdge* edge : node->getLoadOutEdges())
            {
                ecUnion(o, edge->getDstID());
            }
        }
        for (ConstraintEdge* edge : node->getCopyOutEdges())
        {
            ecUnion(edge->getSrcID(), edge->getDstID());
        }
        for (ConstraintEdge* edge : node->getGepOutEdges())
        {
            ecUnion(edge->getSrcID(), edge->getDstID());
        }
    }
}

◆ unionPts() [1/2]

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

inlineoverridevirtual

pts(id) = pts(id) U target

Reimplemented from SVF::BVDataPTAImpl.

Definition at line 81 of file Steensgaard.h.

    {
        id = getEC(id);
        return getPTDataTy()->unionPts(id, target);
    }

◆ unionPts() [2/2]

virtual bool SVF::Steensgaard::unionPts	(	NodeID	id,
		NodeID	ptd )

inlineoverridevirtual

pts(id) = pts(id) U pts(ptd)

Reimplemented from SVF::BVDataPTAImpl.

Definition at line 87 of file Steensgaard.h.

    {
        id = getEC(id);
        ptd = getEC(ptd);
        return getPTDataTy()->unionPts(id, ptd);
    }

Member Data Documentation

◆ nodeToECMap

NodeToEquivClassMap SVF::Steensgaard::nodeToECMap

private

Definition at line 130 of file Steensgaard.h.

◆ nodeToSubsMap

NodeToSubsMap SVF::Steensgaard::nodeToSubsMap

private

Definition at line 131 of file Steensgaard.h.

◆ steens

Steensgaard * Steensgaard::steens = nullptr

staticprivate

Definition at line 129 of file Steensgaard.h.

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

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

Public Types

Public Member Functions

Static Public Member Functions

Private Attributes

Static Private Attributes

Additional Inherited Members

Detailed Description

Member Typedef Documentation

◆ NodeToEquivClassMap

◆ NodeToSubsMap

Constructor & Destructor Documentation

◆ Steensgaard()

Member Function Documentation

◆ addCopyEdge()

◆ addSubNode()

◆ classof() [1/3]

◆ classof() [2/3]

◆ classof() [3/3]

◆ createSteensgaard()

◆ ecUnion()

◆ getEC()

◆ getPts()

◆ getSubNodes()

◆ processAllAddr()

◆ releaseSteensgaard()

◆ sccRepNode()

◆ setEC()

◆ solveWorklist()

◆ unionPts() [1/2]

◆ unionPts() [2/2]

Member Data Documentation

◆ nodeToECMap

◆ nodeToSubsMap

◆ steens