SVF::IntraDisjointMRG Class Reference

#include <MemPartition.h>

Inheritance diagram for SVF::IntraDisjointMRG:

Public Types
typedef OrderedMap< NodeBS, PointsToList >	PtsToSubPtsMap
typedef Map< const SVFFunction *, PtsToSubPtsMap >	FunToPtsMap
typedef Map< const SVFFunction *, PointsToList >	FunToInterMap
Public Types inherited from SVF::MRGenerator
typedef FIFOWorkList< NodeID >	WorkList
typedef OrderedSet< const MemRegion *, MemRegion::equalMemRegion >	MRSet
	Get typedef from Pointer Analysis.
typedef Map< const PAGEdge *, const SVFFunction * >	PAGEdgeToFunMap
typedef OrderedSet< NodeBS, SVFUtil::equalNodeBS >	PointsToList
typedef Map< const SVFFunction *, NodeBS >	FunToPointsToMap
typedef Map< const SVFFunction *, PointsToList >	FunToPointsTosMap
typedef OrderedMap< NodeBS, NodeBS, SVFUtil::equalNodeBS >	PtsToRepPtsSetMap
typedef Map< const SVFFunction *, MRSet >	FunToMRsMap
	Map a function to its region set.
typedef Map< const LoadStmt *, MRSet >	LoadsToMRsMap
typedef Map< const StoreStmt *, MRSet >	StoresToMRsMap
typedef Map< const CallICFGNode *, MRSet >	CallSiteToMRsMap
typedef Map< const LoadStmt *, NodeBS >	LoadsToPointsToMap
	Map loads/stores/callsites to their cpts set.
typedef Map< const StoreStmt *, NodeBS >	StoresToPointsToMap
typedef Map< const CallICFGNode *, NodeBS >	CallSiteToPointsToMap
typedef Map< const SVFFunction *, NodeBS >	FunToNodeBSMap
	Maps Mod-Ref analysis.
typedef Map< const CallICFGNode *, NodeBS >	CallSiteToNodeBSMap
	Map a callsite to its indirect refs/mods of memory objects.
typedef Map< NodeID, NodeBS >	NodeToPTSSMap
typedef SVFIR::SVFStmtList	SVFStmtList
	SVFIR edge list.
typedef SCCDetection< PTACallGraph * >	SCC
	Call Graph SCC.

Public Member Functions
	IntraDisjointMRG (BVDataPTAImpl *p, bool ptrOnly)
	~IntraDisjointMRG ()
Public Member Functions inherited from SVF::MRGenerator
MRSet &	getMRSet ()
const NodeBS &	getRepPointsTo (const NodeBS &cpts) const
	Get superset cpts set.
const MemRegion *	getMR (const NodeBS &cpts) const
	Get a memory region according to cpts.
u32_t	getMRNum () const
virtual	~MRGenerator ()
	Destructor.
virtual void	generateMRs ()
	Start generating memory regions.
const SVFFunction *	getFunction (const PAGEdge *pagEdge) const
	Get the function which SVFIR Edge located.
MRSet &	getFunMRSet (const SVFFunction *fun)
	Get Memory Region set.
MRSet &	getLoadMRSet (const LoadStmt *load)
MRSet &	getStoreMRSet (const StoreStmt *store)
bool	hasRefMRSet (const CallICFGNode *cs)
bool	hasModMRSet (const CallICFGNode *cs)
MRSet &	getCallSiteRefMRSet (const CallICFGNode *cs)
MRSet &	getCallSiteModMRSet (const CallICFGNode *cs)
bool	hasSVFStmtList (const ICFGNode *icfgNode)
	Whether this instruction has SVFIR Edge.
SVFStmtList &	getPAGEdgesFromInst (const ICFGNode *node)
	Given an instruction, get all its the PAGEdge (statement) in sequence.
NodeBS	getModInfoForCall (const CallICFGNode *cs)
	getModRefInfo APIs
NodeBS	getRefInfoForCall (const CallICFGNode *cs)
ModRefInfo	getModRefInfo (const CallICFGNode *cs)
ModRefInfo	getModRefInfo (const CallICFGNode *cs, const SVFValue *V)
ModRefInfo	getModRefInfo (const CallICFGNode *cs1, const CallICFGNode *cs2)

Protected Member Functions
virtual void	partitionMRs ()
	Partition regions.
virtual void	getMRsForLoad (MRSet &aliasMRs, const NodeBS &cpts, const SVFFunction *fun)
void	getMRsForLoadFromInterList (MRSet &mrs, const NodeBS &cpts, const PointsToList &inters)
virtual void	getMRsForCallSiteRef (MRSet &aliasMRs, const NodeBS &cpts, const SVFFunction *fun)
	Get memory regions to be inserted at a load statement.
void	createDisjointMR (const SVFFunction *func, const NodeBS &cpts)
	Create disjoint memory region.
void	computeIntersections (const NodeBS &cpts, PointsToList &inters)
	Compute intersections between cpts and computed cpts intersections before.
Protected Member Functions inherited from SVF::MRGenerator
	MRGenerator (BVDataPTAImpl *p, bool ptrOnly)
void	createMR (const SVFFunction *fun, const NodeBS &cpts)
	Generate a memory region and put in into functions which use it.
void	collectGlobals ()
	Collect all global variables for later escape analysis.
virtual void	collectModRefForLoadStore ()
	Generate regions for loads/stores.
virtual void	collectModRefForCall ()
	Generate regions for calls/rets.
virtual void	updateAliasMRs ()
	Update aliased regions for loads/stores/callsites.
virtual void	sortPointsTo (const NodeBS &cpts)
	Given a condition pts, insert into cptsToRepCPtsMap for region generation.
virtual bool	isAliasedMR (const NodeBS &cpts, const MemRegion *mr)
	Whether a region is aliased with a conditional points-to.
virtual void	getAliasMemRegions (MRSet &aliasMRs, const NodeBS &cpts, const SVFFunction *fun)
	Get all aliased mem regions from function fun according to cpts.
virtual void	modRefAnalysis (PTACallGraphNode *callGraphNode, WorkList &worklist)
	Mod-Ref analysis for callsite invoking this callGraphNode.
virtual bool	handleCallsiteModRef (NodeBS &mod, NodeBS &ref, const CallICFGNode *cs, const SVFFunction *fun)
	Get Mod-Ref of a callee function.
void	addCPtsToStore (NodeBS &cpts, const StoreStmt *st, const SVFFunction *fun)
	Add cpts to store/load.
void	addCPtsToLoad (NodeBS &cpts, const LoadStmt *ld, const SVFFunction *fun)
void	addCPtsToCallSiteRefs (NodeBS &cpts, const CallICFGNode *cs)
void	addCPtsToCallSiteMods (NodeBS &cpts, const CallICFGNode *cs)
bool	hasCPtsList (const SVFFunction *fun) const
PointsToList &	getPointsToList (const SVFFunction *fun)
FunToPointsTosMap &	getFunToPointsToList ()
void	addRefSideEffectOfFunction (const SVFFunction *fun, const NodeBS &refs)
	Add/Get methods for side-effect of functions and callsites.
void	addModSideEffectOfFunction (const SVFFunction *fun, const NodeBS &mods)
	Add indirect def an memory object in the function.
bool	addRefSideEffectOfCallSite (const CallICFGNode *cs, const NodeBS &refs)
	Add indirect uses an memory object in the function.
bool	addModSideEffectOfCallSite (const CallICFGNode *cs, const NodeBS &mods)
	Add indirect def an memory object in the function.
const NodeBS &	getRefSideEffectOfFunction (const SVFFunction *fun)
	Get indirect refs of a function.
const NodeBS &	getModSideEffectOfFunction (const SVFFunction *fun)
	Get indirect mods of a function.
const NodeBS &	getRefSideEffectOfCallSite (const CallICFGNode *cs)
	Get indirect refs of a callsite.
const NodeBS &	getModSideEffectOfCallSite (const CallICFGNode *cs)
	Get indirect mods of a callsite.
bool	hasRefSideEffectOfCallSite (const CallICFGNode *cs)
	Has indirect refs of a callsite.
bool	hasModSideEffectOfCallSite (const CallICFGNode *cs)
	Has indirect mods of a callsite.

Private Member Functions
PtsToSubPtsMap &	getPtsSubSetMap (const SVFFunction *func)
PointsToList &	getIntersList (const SVFFunction *func)
const PtsToSubPtsMap &	getPtsSubSetMap (const SVFFunction *func) const

Private Attributes
FunToPtsMap	funcToPtsMap
FunToInterMap	funcToInterMap

Additional Inherited Members
Protected Attributes inherited from SVF::MRGenerator
MRSet	memRegSet
	A set of All memory regions.
PtsToRepPtsSetMap	cptsToRepCPtsMap
	Map a condition pts to its rep conditional pts (super set points-to)

Detailed Description

Create memory regions which don't have intersections with each other in the same function scope.

Definition at line 73 of file MemPartition.h.

Member Typedef Documentation

FunToInterMap

typedef Map<const SVFFunction*, PointsToList> SVF::IntraDisjointMRG::FunToInterMap

Definition at line 78 of file MemPartition.h.

FunToPtsMap

typedef Map<const SVFFunction*, PtsToSubPtsMap> SVF::IntraDisjointMRG::FunToPtsMap

Definition at line 77 of file MemPartition.h.

PtsToSubPtsMap

typedef OrderedMap<NodeBS, PointsToList> SVF::IntraDisjointMRG::PtsToSubPtsMap

Definition at line 76 of file MemPartition.h.

Constructor & Destructor Documentation

IntraDisjointMRG()

SVF::IntraDisjointMRG::IntraDisjointMRG ( BVDataPTAImpl *  p, bool  ptrOnly  )

inline

Definition at line 80 of file MemPartition.h.

                                                     : MRGenerator(p, ptrOnly)
    {}

~IntraDisjointMRG()

SVF::IntraDisjointMRG::~IntraDisjointMRG ( )

inline

Definition at line 83 of file MemPartition.h.

{}

Member Function Documentation

computeIntersections()

void IntraDisjointMRG::computeIntersections ( const NodeBS &  cpts, PointsToList &  inters  )

protected

Compute intersections between cpts and computed cpts intersections before.

Compute intersections between cpts and computed cpts intersections before.

Definition at line 152 of file MemPartition.cpp.

{
    if (inters.find(cpts) != inters.end())
    {
        // Skip this cpts if it is already in the map.
        return;
    }
    else if (cpts.count() == 1)
    {
        // If this cpts has only one element, it will not intersect with any cpts in inters,
        // just add it into intersection set.
        inters.insert(cpts);
        return;
    }
    else
    {
        PointsToList toBeDeleted;
        PointsToList newInters;
 
        NodeBS cpts_copy = cpts;    // make a copy since cpts may be changed.
 
        // check intersections with existing cpts in subSetMap
        for (PointsToList::const_iterator interIt = inters.begin(), interEit = inters.end();
                interIt != interEit; ++interIt)
        {
            const NodeBS& inter = *interIt;
 
            if (cpts_copy.intersects(inter))
            {
                // compute intersection between cpts and inter
                NodeBS new_inter = inter;
                new_inter &= cpts_copy;
 
                // remove old intersection and add new one if possible
                if (new_inter != inter)
                {
                    toBeDeleted.insert(inter);
                    newInters.insert(new_inter);
 
                    // compute complement after intersection
                    NodeBS complement = inter;
                    complement.intersectWithComplement(new_inter);
                    if (complement.empty() == false)
                    {
                        newInters.insert(complement);
                    }
                }
 
                cpts_copy.intersectWithComplement(new_inter);
 
                if (cpts_copy.empty())
                    break;
            }
        }
 
        // remove old intersections
        for (PointsToList::const_iterator it = toBeDeleted.begin(), eit = toBeDeleted.end();
                it != eit; ++it)
        {
            const NodeBS& temp_cpts = *it;
            inters.erase(temp_cpts);
        }
 
        // add new intersections
        for (PointsToList::const_iterator it = newInters.begin(), eit = newInters.end();
                it != eit; ++it)
        {
            const NodeBS& temp_cpts = *it;
            inters.insert(temp_cpts);
        }
 
        // add remaining set into inters
        if (cpts_copy.empty() == false)
            inters.insert(cpts_copy);
    }
}

createDisjointMR()

void IntraDisjointMRG::createDisjointMR ( const SVFFunction *  func, const NodeBS &  cpts  )

protected

Create disjoint memory region.

Create memory regions for each points-to target.

Definition at line 232 of file MemPartition.cpp.

{
    // set the rep cpts as itself.
    cptsToRepCPtsMap[cpts] = cpts;
 
    // add memory region for this points-to target.
    createMR(func, cpts);
}

getIntersList()

PointsToList & SVF::IntraDisjointMRG::getIntersList ( const SVFFunction *  func )

inlineprivate

Definition at line 120 of file MemPartition.h.

    {
        return funcToInterMap[func];
    }

getMRsForCallSiteRef()

void IntraDisjointMRG::getMRsForCallSiteRef ( MRSet &  aliasMRs, const NodeBS &  cpts, const SVFFunction *  fun  )

protectedvirtual

Get memory regions to be inserted at a load statement.

Get memory regions to be inserted at a load statement. Just process as getMRsForLoad().

Reimplemented from SVF::MRGenerator.

Definition at line 262 of file MemPartition.cpp.

{
    getMRsForLoad(aliasMRs, cpts, fun);
}

getMRsForLoad()

virtual void SVF::IntraDisjointMRG::getMRsForLoad ( MRSet &  aliasMRs, const NodeBS &  cpts, const SVFFunction *  fun  )

inlineprotectedvirtual

Get memory regions to be inserted at a load statement.

Parameters

cpts	The conditional points-to set of load statement.
fun	The function being analyzed.
mrs	Memory region set contains all possible target memory regions.

Reimplemented from SVF::MRGenerator.

Reimplemented in SVF::InterDisjointMRG.

Definition at line 96 of file MemPartition.h.

    {
        const PointsToList& inters = getIntersList(fun);
        getMRsForLoadFromInterList(aliasMRs, cpts, inters);
    }

getMRsForLoadFromInterList()

void IntraDisjointMRG::getMRsForLoadFromInterList ( MRSet &  mrs, const NodeBS &  cpts, const PointsToList &  inters  )

protected

Definition at line 241 of file MemPartition.cpp.

{
    PointsToList::const_iterator it = inters.begin();
    PointsToList::const_iterator eit = inters.end();
    for (; it != eit; ++it)
    {
        const NodeBS& inter = *it;
        if (cpts.contains(inter))
        {
            MemRegion mr(inter);
            MRSet::iterator mit = memRegSet.find(&mr);
            assert(mit!=memRegSet.end() && "memory region not found!!");
            mrs.insert(*mit);
        }
    }
}

getPtsSubSetMap() [1/2]

PtsToSubPtsMap & SVF::IntraDisjointMRG::getPtsSubSetMap ( const SVFFunction *  func )

inlineprivate

Definition at line 115 of file MemPartition.h.

    {
        return funcToPtsMap[func];
    }

getPtsSubSetMap() [2/2]

const PtsToSubPtsMap & SVF::IntraDisjointMRG::getPtsSubSetMap ( const SVFFunction *  func ) const

inlineprivate

Definition at line 125 of file MemPartition.h.

    {
        FunToPtsMap::const_iterator it = funcToPtsMap.find(func);
        assert(it != funcToPtsMap.end() && "can not find pts map for specified function");
        return it->second;
    }

partitionMRs()

void IntraDisjointMRG::partitionMRs ( )

protectedvirtual

Partition regions.

Create memory regions.

Reimplemented from SVF::MRGenerator.

Reimplemented in SVF::InterDisjointMRG.

Definition at line 122 of file MemPartition.cpp.

{
    for(FunToPointsTosMap::iterator it = getFunToPointsToList().begin(),
            eit = getFunToPointsToList().end(); it!=eit; ++it)
    {
        const SVFFunction* fun = it->first;
 
        for(PointsToList::iterator cit = it->second.begin(), ecit = it->second.end();
                cit!=ecit; ++cit)
        {
            const NodeBS& cpts = *cit;
 
            PointsToList& inters = getIntersList(fun);
            computeIntersections(cpts, inters);
        }
 
        const PointsToList& inters = getIntersList(fun);
        for (PointsToList::const_iterator interIt = inters.begin(), interEit = inters.end();
                interIt != interEit; ++interIt)
        {
            const NodeBS& inter = *interIt;
            createDisjointMR(fun, inter);
        }
    }
}

Member Data Documentation

funcToInterMap

FunToInterMap SVF::IntraDisjointMRG::funcToInterMap

private

Definition at line 133 of file MemPartition.h.

funcToPtsMap

FunToPtsMap SVF::IntraDisjointMRG::funcToPtsMap

private

Definition at line 132 of file MemPartition.h.

---

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

• /home/runner/work/SVF/SVF/svf/include/MSSA/MemPartition.h
• /home/runner/work/SVF/SVF/svf/lib/MSSA/MemPartition.cpp