#include <PointerAnalysisImpl.h>

Inheritance diagram for SVF::CondPTAImpl< Cond >:

Public Types
typedef CondVar< Cond >	CVar

typedef CondStdSet< CVar >	CPtSet

typedef PTData< CVar, Set< CVar >, CVar, CPtSet >	PTDataTy

typedef MutablePTData< CVar, Set< CVar >, CVar, CPtSet >	MutPTDataTy

typedef Map< NodeID, PointsTo >	PtrToBVPtsMap

typedef Map< NodeID, NodeSet >	PtrToNSMap
	map a pointer to its BitVector points-to representation

typedef Map< NodeID, CPtSet >	PtrToCPtsMap

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
	CondPTAImpl (SVFIR *pag, PTATY type)
	map a pointer to its conditional points-to set

virtual	~CondPTAImpl ()
	Destructor.

void	destroy ()
	Release memory.

PTDataTy *	getPTDataTy () const
	Get points-to data.

MutPTDataTy *	getMutPTDataTy () const

bool	hasPtsMap (void) const

const MutPTDataTy::PtsMap &	getPtsMap () const

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 void	initialize ()
	Initialization of a pointer analysis, including building symbol table and SVFIR etc.

virtual void	analyze ()=0
	Start Analysis here (main part of pointer analysis). It needs to be implemented in child class.

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

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	dumpAllPts ()

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 bool	classof (const PointerAnalysis *pta)

PTDataTy *	ptD
	Points-to data.

bool	normalized
	Normalized flag.

PtrToBVPtsMap	ptrToBVPtsMap
	Normal points-to representation (without conditions)

PtrToNSMap	objToNSRevPtsMap
	Normal points-to representation (without conditions)

PtrToCPtsMap	ptrToCPtsMap
	Conditional points-to representation (with conditions)

virtual const CPtSet &	getPts (CVar id)

virtual const Set< CVar > &	getRevPts (CVar nodeId)

virtual void	clearPts ()
	Clear all data.

bool	overlap (const CPtSet &cpts1, const CPtSet &cpts2) const
	Whether cpts1 and cpts2 have overlap points-to targets.

void	expandFIObjs (const CPtSet &cpts, CPtSet &expandedCpts)
	Expand all fields of an aggregate in all points-to sets.

virtual void	dumpCPts ()
	Print out conditional pts.

virtual PointsTo	getBVPointsTo (const CPtSet &cpts) const
	Given a conditional pts return its bit vector points-to.

virtual PointsTo &	getPts (NodeID ptr)
	Given a pointer return its bit vector points-to.

virtual const CPtSet &	getCondPointsTo (NodeID ptr)
	Given a pointer return its conditional points-to.

virtual NodeSet &	getRevPts (NodeID obj)
	Given an object return all pointers points to this object.

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

virtual AliasResult	alias (NodeID node1, NodeID node2)
	Interface expose to users of our pointer analysis, given two pointers.

virtual AliasResult	alias (const CVar &var1, const CVar &var2)
	Interface expose to users of our pointer analysis, given conditional variables.

virtual AliasResult	alias (const CPtSet &pts1, const CPtSet &pts2)
	Interface expose to users of our pointer analysis, given two conditional points-to sets.

bool	containBlackHoleNode (const CPtSet &cpts)
	Test blk node for cpts.

bool	containConstantNode (const CPtSet &cpts)
	Test constant node for cpts.

virtual bool	isCondCompatible (const Cond &cxt1, const Cond &cxt2, bool singleton) const =0
	Whether two conditions are compatible (to be implemented by child class)

void	dumpTopLevelPtsTo ()
	Dump points-to information of top-level pointers.

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

virtual bool	unionPts (CVar id, const CPtSet &target)

virtual bool	unionPts (CVar id, CVar ptd)

virtual bool	addPts (CVar id, CVar ptd)

bool	mustAlias (const CVar &var1, const CVar &var2)
	Internal interface to be used for conditional points-to set queries.

bool	contains (const CPtSet &cpts1, const CPtSet &cpts2)

bool	isSameVar (const CVar &var1, const CVar &var2) const
	Whether two pointers/objects are the same one by considering their conditions.

virtual void	normalizePointsTo ()
	Normalize points-to information to BitVector/conditional representation.

Additional Inherited Members
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::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 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

template<class Cond>
class SVF::CondPTAImpl< Cond >

Pointer analysis implementation which uses conditional points-to map data structure (context/path sensitive analysis)

Definition at line 251 of file PointerAnalysisImpl.h.

Member Typedef Documentation

◆ CPtSet

template<class Cond >

typedef CondStdSet<CVar> SVF::CondPTAImpl< Cond >::CPtSet

Definition at line 256 of file PointerAnalysisImpl.h.

◆ CVar

template<class Cond >

typedef CondVar<Cond> SVF::CondPTAImpl< Cond >::CVar

Definition at line 255 of file PointerAnalysisImpl.h.

◆ MutPTDataTy

template<class Cond >

typedef MutablePTData<CVar, Set<CVar>, CVar, CPtSet> SVF::CondPTAImpl< Cond >::MutPTDataTy

Definition at line 258 of file PointerAnalysisImpl.h.

◆ PTDataTy

template<class Cond >

typedef PTData<CVar, Set<CVar>, CVar, CPtSet> SVF::CondPTAImpl< Cond >::PTDataTy

Definition at line 257 of file PointerAnalysisImpl.h.

◆ PtrToBVPtsMap

template<class Cond >

typedef Map<NodeID,PointsTo> SVF::CondPTAImpl< Cond >::PtrToBVPtsMap

Definition at line 259 of file PointerAnalysisImpl.h.

◆ PtrToCPtsMap

template<class Cond >

typedef Map<NodeID,CPtSet> SVF::CondPTAImpl< Cond >::PtrToCPtsMap

Definition at line 261 of file PointerAnalysisImpl.h.

◆ PtrToNSMap

template<class Cond >

typedef Map<NodeID, NodeSet> SVF::CondPTAImpl< Cond >::PtrToNSMap

map a pointer to its BitVector points-to representation

Definition at line 260 of file PointerAnalysisImpl.h.

Constructor & Destructor Documentation

◆ CondPTAImpl()

template<class Cond >

SVF::CondPTAImpl< Cond >::CondPTAImpl	(	SVFIR *	pag,
		PTATY	type
	)

inline

map a pointer to its conditional points-to set

Constructor

Definition at line 264 of file PointerAnalysisImpl.h.

                                        : PointerAnalysis(pag, type), normalized(false)
    {
        if (type == PTATY::PathS_DDA || type == PTATY::Cxt_DDA)
            ptD = new MutPTDataTy();
        else
            assert(false && "no points-to data available");
 
        ptaImplTy = PTAImplTy::CondImpl;
    }

◆ ~CondPTAImpl()

template<class Cond >

virtual SVF::CondPTAImpl< Cond >::~CondPTAImpl ( )

inlinevirtual

Destructor.

Definition at line 275 of file PointerAnalysisImpl.h.

    {
        destroy();
    }

Member Function Documentation

◆ addPts()

template<class Cond >

virtual bool SVF::CondPTAImpl< Cond >::addPts	(	CVar	id,
		CVar	ptd
	)

inlineprotectedvirtual

Definition at line 388 of file PointerAnalysisImpl.h.

    {
        return ptD->addPts(id,ptd);
    }

◆ alias() [1/4]

template<class Cond >

virtual AliasResult SVF::CondPTAImpl< Cond >::alias	(	const CPtSet &	pts1,
		const CPtSet &	pts2
	)

inlinevirtual

Interface expose to users of our pointer analysis, given two conditional points-to sets.

Definition at line 526 of file PointerAnalysisImpl.h.

    {
        CPtSet cpts1;
        expandFIObjs(pts1,cpts1);
        CPtSet cpts2;
        expandFIObjs(pts2,cpts2);
        if (containBlackHoleNode(cpts1) || containBlackHoleNode(cpts2))
            return AliasResult::MayAlias;
        else if(this->getAnalysisTy() == PTATY::PathS_DDA && contains(cpts1,cpts2) && contains(cpts2,cpts1))
        {
            return AliasResult::MustAlias;
        }
        else if(overlap(cpts1,cpts2))
            return AliasResult::MayAlias;
        else
            return AliasResult::NoAlias;
    }

◆ alias() [2/4]

template<class Cond >

virtual AliasResult SVF::CondPTAImpl< Cond >::alias	(	const CVar &	var1,
		const CVar &	var2
	)

inlinevirtual

Interface expose to users of our pointer analysis, given conditional variables.

Definition at line 521 of file PointerAnalysisImpl.h.

    {
        return alias(getPts(var1),getPts(var2));
    }

◆ alias() [3/4]

template<class Cond >

virtual AliasResult SVF::CondPTAImpl< Cond >::alias	(	const SVFVar *	V1,
		const SVFVar *	V2
	)

inlinevirtual

Interface expose to users of our pointer analysis, given Value infos.

Implements SVF::PointerAnalysis.

Definition at line 511 of file PointerAnalysisImpl.h.

    {
        return  alias(V1->getId(), V2->getId());
    }

◆ alias() [4/4]

template<class Cond >

virtual AliasResult SVF::CondPTAImpl< Cond >::alias	(	NodeID	node1,
		NodeID	node2
	)

inlinevirtual

Interface expose to users of our pointer analysis, given two pointers.

Implements SVF::PointerAnalysis.

Definition at line 516 of file PointerAnalysisImpl.h.

    {
        return alias(getCondPointsTo(node1),getCondPointsTo(node2));
    }

◆ classof()

template<class Cond >

static bool SVF::CondPTAImpl< Cond >::classof ( const PointerAnalysis * pta )

inlinestatic

Definition at line 280 of file PointerAnalysisImpl.h.

    {
        return pta->getImplTy() == PTAImplTy::CondImpl;
    }

◆ clearPts()

template<class Cond >

virtual void SVF::CondPTAImpl< Cond >::clearPts ( )

inlinevirtual

Clear all data.

Definition at line 330 of file PointerAnalysisImpl.h.

    {
        ptD->clear();
    }

◆ containBlackHoleNode()

template<class Cond >

bool SVF::CondPTAImpl< Cond >::containBlackHoleNode ( const CPtSet & cpts )

inline

Test blk node for cpts.

Definition at line 544 of file PointerAnalysisImpl.h.

    {
        for(typename CPtSet::const_iterator cit = cpts.begin(), ecit=cpts.end(); cit!=ecit; ++cit)
        {
            if(cit->get_id() == pag->getBlackHoleNode())
                return true;
        }
        return false;
    }

◆ containConstantNode()

template<class Cond >

bool SVF::CondPTAImpl< Cond >::containConstantNode ( const CPtSet & cpts )

inline

Test constant node for cpts.

Definition at line 554 of file PointerAnalysisImpl.h.

    {
        for(typename CPtSet::const_iterator cit = cpts.begin(), ecit=cpts.end(); cit!=ecit; ++cit)
        {
            if(cit->get_id() == pag->getConstantNode())
                return true;
        }
        return false;
    }

◆ contains()

template<class Cond >

bool SVF::CondPTAImpl< Cond >::contains	(	const CPtSet &	cpts1,
		const CPtSet &	cpts2
	)

inlineprotected

Definition at line 411 of file PointerAnalysisImpl.h.

    {
        if (cpts1.empty() || cpts2.empty())
            return false;
 
        for (typename CPtSet::const_iterator it2 = cpts2.begin(); it2 != cpts2.end(); ++it2)
        {
            bool hasObj = false;
            for (typename CPtSet::const_iterator it1 = cpts1.begin(); it1 != cpts1.end(); ++it1)
            {
                if(isSameVar(*it1,*it2))
                {
                    hasObj = true;
                    break;
                }
            }
            if(hasObj == false)
                return false;
        }
        return true;
    }

◆ destroy()

template<class Cond >

void SVF::CondPTAImpl< Cond >::destroy ( )

inline

Release memory.

Definition at line 286 of file PointerAnalysisImpl.h.

    {
        delete ptD;
        ptD = nullptr;
    }

◆ dumpCPts()

template<class Cond >

virtual void SVF::CondPTAImpl< Cond >::dumpCPts ( )

inlinevirtual

Print out conditional pts.

Reimplemented from SVF::PointerAnalysis.

Definition at line 479 of file PointerAnalysisImpl.h.

    {
        ptD->dumpPTData();
    }

◆ dumpTopLevelPtsTo()

template<class Cond >

void SVF::CondPTAImpl< Cond >::dumpTopLevelPtsTo ( )

inlinevirtual

Dump points-to information of top-level pointers.

Reimplemented from SVF::PointerAnalysis.

Definition at line 567 of file PointerAnalysisImpl.h.

    {
        for (OrderedNodeSet::iterator nIter = this->getAllValidPtrs().begin(); nIter != this->getAllValidPtrs().end(); ++nIter)
        {
            const SVFVar* node = this->getPAG()->getSVFVar(*nIter);
            if (this->getPAG()->isValidTopLevelPtr(node))
            {
                if (SVFUtil::isa<DummyObjVar>(node))
                {
                    SVFUtil::outs() << "##<Blackhole or constant> id:" << node->getId();
                }
                else if (!SVFUtil::isa<DummyValVar>(node))
                {
                    SVFUtil::outs() << "##<" << node->toString() << "> ";
                    //SVFUtil::outs() << "Source Loc: " << SVFUtil::getSourceLoc(node->getValue());
                }
 
                const PointsTo& pts = getPts(node->getId());
                SVFUtil::outs() << "\nNodeID " << node->getId() << " ";
                if (pts.empty())
                {
                    SVFUtil::outs() << "\t\tPointsTo: {empty}\n\n";
                }
                else
                {
                    SVFUtil::outs() << "\t\tPointsTo: { ";
                    for (PointsTo::iterator it = pts.begin(), eit = pts.end(); it != eit; ++it)
                        SVFUtil::outs() << *it << " ";
                    SVFUtil::outs() << "}\n\n";
                }
            }
        }
 
        SVFUtil::outs().flush();
    }

◆ expandFIObjs()

template<class Cond >

void SVF::CondPTAImpl< Cond >::expandFIObjs	(	const CPtSet &	cpts,
		CPtSet &	expandedCpts
	)

inline

Expand all fields of an aggregate in all points-to sets.

Definition at line 350 of file PointerAnalysisImpl.h.

    {
        expandedCpts = cpts;;
        for(typename CPtSet::const_iterator cit = cpts.begin(), ecit=cpts.end(); cit!=ecit; ++cit)
        {
            if(pag->getBaseObjVarID(cit->get_id())==cit->get_id())
            {
                NodeBS& fields = pag->getAllFieldsObjVars(cit->get_id());
                for(NodeBS::iterator it = fields.begin(), eit = fields.end(); it!=eit; ++it)
                {
                    CVar cvar(cit->get_cond(),*it);
                    expandedCpts.set(cvar);
                }
            }
        }
    }

◆ finalize()

template<class Cond >

virtual void SVF::CondPTAImpl< Cond >::finalize ( )

inlineprotectedvirtual

Finalization of pointer analysis, and normalize points-to information to Bit Vector representation.

Reimplemented from SVF::PointerAnalysis.

Reimplemented in SVF::ContextDDA.

Definition at line 370 of file PointerAnalysisImpl.h.

    {
        normalizePointsTo();
        PointerAnalysis::finalize();
    }

◆ getBVPointsTo()

template<class Cond >

virtual PointsTo SVF::CondPTAImpl< Cond >::getBVPointsTo ( const CPtSet & cpts ) const

inlinevirtual

Given a conditional pts return its bit vector points-to.

Definition at line 484 of file PointerAnalysisImpl.h.

    {
        PointsTo pts;
        for(typename CPtSet::const_iterator cit = cpts.begin(), ecit=cpts.end(); cit!=ecit; ++cit)
            pts.set(cit->get_id());
        return pts;
    }

◆ getCondPointsTo()

template<class Cond >

virtual const CPtSet & SVF::CondPTAImpl< Cond >::getCondPointsTo ( NodeID ptr )

inlinevirtual

Given a pointer return its conditional points-to.

Definition at line 498 of file PointerAnalysisImpl.h.

    {
        assert(normalized && "Pts of all context-vars have to be merged/normalized. Want to use getPts(CVar cvar)??");
        return ptrToCPtsMap[ptr];
    }

◆ getMutPTDataTy()

template<class Cond >

MutPTDataTy * SVF::CondPTAImpl< Cond >::getMutPTDataTy ( ) const

inline

Definition at line 298 of file PointerAnalysisImpl.h.

    {
        MutPTDataTy* mut = SVFUtil::dyn_cast<MutPTDataTy>(ptD);
        assert(mut && "BVDataPTAImpl::getMutPTDataTy: not a MutPTDataTy!");
        return mut;
    }

◆ getPTDataTy()

template<class Cond >

PTDataTy * SVF::CondPTAImpl< Cond >::getPTDataTy ( ) const

inline

Get points-to data.

Definition at line 293 of file PointerAnalysisImpl.h.

    {
        return ptD;
    }

◆ getPts() [1/2]

template<class Cond >

virtual const CPtSet & SVF::CondPTAImpl< Cond >::getPts ( CVar id )

inlinevirtual

Get points-to and reverse points-to

Definition at line 319 of file PointerAnalysisImpl.h.

    {
        return ptD->getPts(id);
    }

◆ getPts() [2/2]

template<class Cond >

virtual PointsTo & SVF::CondPTAImpl< Cond >::getPts ( NodeID ptr )

inlinevirtual

Given a pointer return its bit vector points-to.

Implements SVF::PointerAnalysis.

Definition at line 492 of file PointerAnalysisImpl.h.

    {
        assert(normalized && "Pts of all context-var have to be merged/normalized. Want to use getPts(CVar cvar)??");
        return ptrToBVPtsMap[ptr];
    }

◆ getPtsMap()

template<class Cond >

const MutPTDataTy::PtsMap & SVF::CondPTAImpl< Cond >::getPtsMap ( ) const

inline

Definition at line 310 of file PointerAnalysisImpl.h.

    {
        if (MutPTDataTy *m = SVFUtil::dyn_cast<MutPTDataTy>(ptD)) return m->getPtsMap();
        assert(false && "CondPTAImpl::getPtsMap: not a PTData with a PtsMap!");
        exit(1);
    }

◆ getRevPts() [1/2]

template<class Cond >

virtual const Set< CVar > & SVF::CondPTAImpl< Cond >::getRevPts ( CVar nodeId )

inlinevirtual

Definition at line 323 of file PointerAnalysisImpl.h.

    {
        return ptD->getRevPts(nodeId);
    }

◆ getRevPts() [2/2]

template<class Cond >

virtual NodeSet & SVF::CondPTAImpl< Cond >::getRevPts ( NodeID obj )

inlinevirtual

Given an object return all pointers points to this object.

Implements SVF::PointerAnalysis.

Definition at line 504 of file PointerAnalysisImpl.h.

    {
        assert(normalized && "Pts of all context-var have to be merged/normalized. Want to use getPts(CVar cvar)??");
        return objToNSRevPtsMap[obj];
    }

◆ hasPtsMap()

template<class Cond >

bool SVF::CondPTAImpl< Cond >::hasPtsMap ( void ) const

inline

Definition at line 305 of file PointerAnalysisImpl.h.

    {
        return SVFUtil::isa<MutPTDataTy>(ptD);
    }

◆ isCondCompatible()

template<class Cond >

virtual bool SVF::CondPTAImpl< Cond >::isCondCompatible	(	const Cond &	cxt1,
		const Cond &	cxt2,
		bool	singleton
	)		const

pure virtual

Whether two conditions are compatible (to be implemented by child class)

Implemented in SVF::ContextDDA.

◆ isSameVar()

template<class Cond >

bool SVF::CondPTAImpl< Cond >::isSameVar	(	const CVar &	var1,
		const CVar &	var2
	)		const

inlineprotected

Whether two pointers/objects are the same one by considering their conditions.

we distinguish context sensitive memory allocation here

Definition at line 434 of file PointerAnalysisImpl.h.

    {
        if(var1.get_id() != var2.get_id())
            return false;
 
        bool singleton = !(isHeapMemObj(var1.get_id()) || isLocalVarInRecursiveFun(var1.get_id()));
        return isCondCompatible(var1.get_cond(),var2.get_cond(),singleton);
    }

◆ mustAlias()

template<class Cond >

bool SVF::CondPTAImpl< Cond >::mustAlias	(	const CVar &	var1,
		const CVar &	var2
	)

inlineprotected

Internal interface to be used for conditional points-to set queries.

Definition at line 396 of file PointerAnalysisImpl.h.

    {
        if(isSameVar(var1,var2))
            return true;
 
        bool singleton = !(isHeapMemObj(var1.get_id()) || isLocalVarInRecursiveFun(var1.get_id()));
        if(isCondCompatible(var1.get_cond(),var2.get_cond(),singleton) == false)
            return false;
 
        const CPtSet& cpts1 = getPts(var1);
        const CPtSet& cpts2 = getPts(var2);
        return (contains(cpts1,cpts2) && contains(cpts2,cpts1));
    }

◆ normalizePointsTo()

template<class Cond >

virtual void SVF::CondPTAImpl< Cond >::normalizePointsTo ( )

inlineprotectedvirtual

Normalize points-to information to BitVector/conditional representation.

Definition at line 446 of file PointerAnalysisImpl.h.

    {
        normalized = true;
        if (hasPtsMap())
        {
            const typename MutPTDataTy::PtsMap& ptsMap = getPtsMap();
            for(typename MutPTDataTy::PtsMap::const_iterator it = ptsMap.begin(), eit=ptsMap.end(); it!=eit; ++it)
            {
                for(typename CPtSet::const_iterator cit = it->second.begin(), ecit=it->second.end(); cit!=ecit; ++cit)
                {
                    ptrToBVPtsMap[(it->first).get_id()].set(cit->get_id());
                    objToNSRevPtsMap[cit->get_id()].insert((it->first).get_id());
                    ptrToCPtsMap[(it->first).get_id()].set(*cit);
                }
            }
        }
        else
        {
            assert(false && "CondPTAImpl::NormalizePointsTo: could not normalize points-to sets");
        }
    }

◆ overlap()

template<class Cond >

bool SVF::CondPTAImpl< Cond >::overlap	(	const CPtSet &	cpts1,
		const CPtSet &	cpts2
	)		const

inline

Whether cpts1 and cpts2 have overlap points-to targets.

Definition at line 336 of file PointerAnalysisImpl.h.

    {
        for (typename CPtSet::const_iterator it1 = cpts1.begin(); it1 != cpts1.end(); ++it1)
        {
            for (typename CPtSet::const_iterator it2 = cpts2.begin(); it2 != cpts2.end(); ++it2)
            {
                if(isSameVar(*it1,*it2))
                    return true;
            }
        }
        return false;
    }

◆ unionPts() [1/2]

template<class Cond >

virtual bool SVF::CondPTAImpl< Cond >::unionPts	(	CVar	id,
		const CPtSet &	target
	)

inlineprotectedvirtual

Union/add points-to, and add the reverse points-to for node collapse purpose To be noted that adding reverse pts might incur 10% total overhead during solving

Definition at line 378 of file PointerAnalysisImpl.h.

    {
        return ptD->unionPts(id, target);
    }

◆ unionPts() [2/2]

template<class Cond >

virtual bool SVF::CondPTAImpl< Cond >::unionPts	(	CVar	id,
		CVar	ptd
	)

inlineprotectedvirtual

Definition at line 383 of file PointerAnalysisImpl.h.

    {
        return ptD->unionPts(id,ptd);
    }

Member Data Documentation

◆ normalized

template<class Cond >

bool SVF::CondPTAImpl< Cond >::normalized

protected

Normalized flag.

Definition at line 470 of file PointerAnalysisImpl.h.

◆ objToNSRevPtsMap

template<class Cond >

PtrToNSMap SVF::CondPTAImpl< Cond >::objToNSRevPtsMap

protected

Normal points-to representation (without conditions)

Definition at line 474 of file PointerAnalysisImpl.h.

◆ ptD

template<class Cond >

PTDataTy* SVF::CondPTAImpl< Cond >::ptD

protected

Points-to data.

Definition at line 468 of file PointerAnalysisImpl.h.

◆ ptrToBVPtsMap

template<class Cond >

PtrToBVPtsMap SVF::CondPTAImpl< Cond >::ptrToBVPtsMap

protected

Normal points-to representation (without conditions)

Definition at line 472 of file PointerAnalysisImpl.h.

◆ ptrToCPtsMap

template<class Cond >

PtrToCPtsMap SVF::CondPTAImpl< Cond >::ptrToCPtsMap

protected

Conditional points-to representation (with conditions)

Definition at line 476 of file PointerAnalysisImpl.h.

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

/home/runner/work/SVF/SVF/svf/include/MemoryModel/PointerAnalysisImpl.h

Public Types

Public Member Functions

Static Public Member Functions

Additional Inherited Members

Detailed Description

Member Typedef Documentation

◆ CPtSet

◆ CVar

◆ MutPTDataTy

◆ PTDataTy

◆ PtrToBVPtsMap

◆ PtrToCPtsMap

◆ PtrToNSMap

Constructor & Destructor Documentation

◆ CondPTAImpl()

◆ ~CondPTAImpl()

Member Function Documentation

◆ addPts()

◆ alias() [1/4]

◆ alias() [2/4]

◆ alias() [3/4]

◆ alias() [4/4]

◆ classof()

◆ clearPts()

◆ containBlackHoleNode()

◆ containConstantNode()

◆ contains()

◆ destroy()

◆ dumpCPts()

◆ dumpTopLevelPtsTo()

◆ expandFIObjs()

◆ finalize()

◆ getBVPointsTo()

◆ getCondPointsTo()

◆ getMutPTDataTy()

◆ getPTDataTy()

◆ getPts() [1/2]

◆ getPts() [2/2]

◆ getPtsMap()

◆ getRevPts() [1/2]

◆ getRevPts() [2/2]

◆ hasPtsMap()

◆ isCondCompatible()

◆ isSameVar()

◆ mustAlias()

◆ normalizePointsTo()

◆ overlap()

◆ unionPts() [1/2]

◆ unionPts() [2/2]

Member Data Documentation

◆ normalized

◆ objToNSRevPtsMap

◆ ptD

◆ ptrToBVPtsMap

◆ ptrToCPtsMap