#include <ConditionalPT.h>

Classes
class	CondPtsSetIterator
	Conditional Points-to Set Iterator. More...

Public Types
typedef Map< Cond, PointsTo >	CondPts

typedef CondPts::iterator	CondPtsIter

typedef CondPts::const_iterator	CondPtsConstIter

typedef CondVar< Cond >	SingleCondVar

typedef CondPtsSetIterator	iterator

Public Member Functions
	CondPointsToSet ()
	Constructor.

	CondPointsToSet (const Cond &cond, const PointsTo &pts)

	CondPointsToSet (const CondPointsToSet< Cond > &cptsSet)
	Copy constructor.

CondPts &	pointsTo (void)
	Get Conditional PointsTo and standard points-to.

const CondPts &	pointsTo (void) const

const PointsTo &	pointsTo (Cond cond) const

bool	hasPointsTo (Cond cond) const

PointsTo &	pointsTo (Cond cond)

CondPtsIter	cptsBegin ()
	iterators

CondPtsIter	cptsEnd ()

CondPtsConstIter	cptsBegin () const

CondPtsConstIter	cptsEnd () const

void	clear ()

unsigned	numElement () const
	Get number of points-to targets.

bool	empty () const
	Return true if no element in the set.

CondPointsToSet< Cond > &	operator= (const CondPointsToSet< Cond > &other)
	Overloading operators.

bool	operator== (const CondPointsToSet< Cond > &rhs) const
	Overloading operator ==.

bool	aliased (const CondPointsToSet< Cond > &rhs) const

bool	isSubset (const CondPointsToSet< Cond > &rhs) const
	Check whether this CondPointsToSet is a subset of RHS.

bool	intersects (const CondPointsToSet< Cond > *rhs) const
	Return TRUE if this and RHS share any common element.

void	intersectWithComplement (const CondPointsToSet< Cond > &cpts1, const CondPointsToSet< Cond > &cpts2)
	Result of cpts1 & ~cpts2 is stored into this bitmap.

void	intersectWithComplement (const CondPointsToSet< Cond > &cpts1)
	Result of cur & ~cpts1 is stored into this bitmap.

bool	operator&= (const CondPointsToSet< Cond > &rhs)
	Overloading operator &=.

bool	operator!= (const CondPointsToSet< Cond > &rhs)
	Overloading operator !=.

bool	operator\|= (const CondPointsToSet< Cond > &rhs)

bool	operator< (const CondPointsToSet< Cond > &rhs) const

bool	test_and_set (const SingleCondVar &var)
	Test and set.

bool	test (const SingleCondVar &var) const

void	set (const SingleCondVar &var)

void	reset (const SingleCondVar &var)

void	dump (OutStream &O) const

std::string	dumpStr () const

iterator	begin ()
	iterators

iterator	end ()

iterator	begin () const

iterator	end () const

Private Attributes
CondPts	_condPts

Detailed Description

template<class Cond>
class SVF::CondPointsToSet< Cond >

Conditional Points-to set

Definition at line 304 of file ConditionalPT.h.

Member Typedef Documentation

◆ CondPts

template<class Cond >

typedef Map<Cond, PointsTo> SVF::CondPointsToSet< Cond >::CondPts

Definition at line 307 of file ConditionalPT.h.

◆ CondPtsConstIter

template<class Cond >

typedef CondPts::const_iterator SVF::CondPointsToSet< Cond >::CondPtsConstIter

Definition at line 309 of file ConditionalPT.h.

◆ CondPtsIter

template<class Cond >

typedef CondPts::iterator SVF::CondPointsToSet< Cond >::CondPtsIter

Definition at line 308 of file ConditionalPT.h.

◆ iterator

template<class Cond >

typedef CondPtsSetIterator SVF::CondPointsToSet< Cond >::iterator

Definition at line 815 of file ConditionalPT.h.

◆ SingleCondVar

template<class Cond >

typedef CondVar<Cond> SVF::CondPointsToSet< Cond >::SingleCondVar

Definition at line 310 of file ConditionalPT.h.

Constructor & Destructor Documentation

◆ CondPointsToSet() [1/3]

template<class Cond >

SVF::CondPointsToSet< Cond >::CondPointsToSet ( )

inline

Constructor.

Definition at line 314 of file ConditionalPT.h.

315 {

316 }

◆ CondPointsToSet() [2/3]

template<class Cond >

SVF::CondPointsToSet< Cond >::CondPointsToSet	(	const Cond &	cond,
		const PointsTo &	pts
	)

inline

Definition at line 317 of file ConditionalPT.h.

    {
        _condPts[cond] |= pts;
    }

◆ CondPointsToSet() [3/3]

template<class Cond >

SVF::CondPointsToSet< Cond >::CondPointsToSet ( const CondPointsToSet< Cond > & cptsSet )

inline

Copy constructor.

Definition at line 324 of file ConditionalPT.h.

    {
        _condPts = cptsSet.pointsTo();
    }

Member Function Documentation

◆ aliased()

template<class Cond >

bool SVF::CondPointsToSet< Cond >::aliased ( const CondPointsToSet< Cond > & rhs ) const

inline

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

Definition at line 434 of file ConditionalPT.h.

    {
        if (pointsTo().empty() || rhs.pointsTo().empty())
            return false;
        else
        {
            CondPtsConstIter lit = cptsBegin(), elit = cptsEnd();
            for (; lit != elit; ++lit)
            {
                const Cond& lc = lit->first;
                const PointsTo& pts = lit->second;
                CondPtsConstIter rit = rhs.pointsTo().find(lc);
                if(rit !=rhs.pointsTo().end())
                {
                    const PointsTo& rpts = rit->second;
                    if (pts.intersects(rpts))
                        return true;
                }
            }
            return false;
        }
    }

◆ begin() [1/2]

template<class Cond >

iterator SVF::CondPointsToSet< Cond >::begin ( )

inline

iterators

Definition at line 818 of file ConditionalPT.h.

    {
        return iterator(this);
    }

◆ begin() [2/2]

template<class Cond >

iterator SVF::CondPointsToSet< Cond >::begin ( ) const

inline

Definition at line 828 of file ConditionalPT.h.

    {
        return iterator(this);
    }

◆ clear()

template<class Cond >

void SVF::CondPointsToSet< Cond >::clear ( )

inline

Definition at line 376 of file ConditionalPT.h.

    {
        _condPts.clear();
    }

◆ cptsBegin() [1/2]

template<class Cond >

CondPtsIter SVF::CondPointsToSet< Cond >::cptsBegin ( )

inline

iterators

Definition at line 358 of file ConditionalPT.h.

    {
        return _condPts.begin();
    }

◆ cptsBegin() [2/2]

template<class Cond >

CondPtsConstIter SVF::CondPointsToSet< Cond >::cptsBegin ( ) const

inline

Definition at line 366 of file ConditionalPT.h.

    {
        return _condPts.begin();
    }

◆ cptsEnd() [1/2]

template<class Cond >

CondPtsIter SVF::CondPointsToSet< Cond >::cptsEnd ( )

inline

Definition at line 362 of file ConditionalPT.h.

    {
        return _condPts.end();
    }

◆ cptsEnd() [2/2]

template<class Cond >

CondPtsConstIter SVF::CondPointsToSet< Cond >::cptsEnd ( ) const

inline

Definition at line 370 of file ConditionalPT.h.

    {
        return _condPts.end();
    }

◆ dump()

template<class Cond >

void SVF::CondPointsToSet< Cond >::dump ( OutStream & O ) const

inline

Definition at line 711 of file ConditionalPT.h.

    {
        CondPtsConstIter it = cptsBegin();
        CondPtsConstIter eit = cptsEnd();
        for (; it != eit; it++)
        {
            const PointsTo& pts = it->second;
            O << "pts{";
            SVFUtil::dumpSet(pts, O);
            O << "}";
        }
    }

◆ dumpStr()

template<class Cond >

std::string SVF::CondPointsToSet< Cond >::dumpStr ( ) const

inline

Definition at line 723 of file ConditionalPT.h.

    {
        std::string str;
        CondPtsConstIter it = cptsBegin();
        CondPtsConstIter eit = cptsEnd();
        for (; it != eit; it++)
        {
            const PointsTo& pts = it->second;
            str += "pts{";
            for (PointsTo::iterator ii = pts.begin(), ie = pts.end();
                    ii != ie; ii++)
            {
                char int2str[16];
                snprintf(int2str, sizeof(int2str), "%d", *ii);
                str += int2str;
                str += " ";
            }
            str += "}";
        }
        return str;
    }

◆ empty()

template<class Cond >

bool SVF::CondPointsToSet< Cond >::empty ( ) const

inline

Return true if no element in the set.

Definition at line 398 of file ConditionalPT.h.

    {
        return numElement()==0;
    }

◆ end() [1/2]

template<class Cond >

iterator SVF::CondPointsToSet< Cond >::end ( )

inline

Definition at line 823 of file ConditionalPT.h.

    {
        return iterator(this,true);
    }

◆ end() [2/2]

template<class Cond >

iterator SVF::CondPointsToSet< Cond >::end ( ) const

inline

Definition at line 833 of file ConditionalPT.h.

    {
        return iterator(this,true);
    }

◆ hasPointsTo()

template<class Cond >

bool SVF::CondPointsToSet< Cond >::hasPointsTo ( Cond cond ) const

inline

Definition at line 346 of file ConditionalPT.h.

    {
        return (_condPts.find(cond) != _condPts.end());
    }

◆ intersects()

template<class Cond >

bool SVF::CondPointsToSet< Cond >::intersects ( const CondPointsToSet< Cond > * rhs ) const

inline

Return TRUE if this and RHS share any common element.

if either cpts is empty, just return.

Definition at line 484 of file ConditionalPT.h.

    {
        if (pointsTo().empty() && rhs->pointsTo().empty())
            return false;
 
        CondPtsConstIter it = rhs->cptsBegin(), eit = rhs->cptsEnd();
        for (; it != eit; ++it)
        {
            const Cond& cond = it->first;
            if (hasPointsTo(cond))
            {
                const PointsTo& rhs_pts= it->second;
                const PointsTo& pts= pointsTo(cond);
                if (pts.intersects(rhs_pts))
                    return true;
            }
        }
 
        return false;
    }

◆ intersectWithComplement() [1/2]

template<class Cond >

void SVF::CondPointsToSet< Cond >::intersectWithComplement ( const CondPointsToSet< Cond > & cpts1 )

inline

Result of cur & ~cpts1 is stored into this bitmap.

if either cpts is empty, just return.

Definition at line 540 of file ConditionalPT.h.

    {
        if (empty() || cpts1.pointsTo().empty())
        {
            return;
        }
        else
        {
            CondPtsIter it = cptsBegin(), eit = cptsEnd();
            for (; it != eit; ++it)
            {
                const Cond& cond = it->first;
                PointsTo& pts = it->second;
                if (cpts1.hasPointsTo(cond))
                {
                    const PointsTo& pts1 = cpts1.pointsTo(cond);
                    pts.intersectWithComplement(pts1);
                }
            }
        }
    }

◆ intersectWithComplement() [2/2]

template<class Cond >

void SVF::CondPointsToSet< Cond >::intersectWithComplement	(	const CondPointsToSet< Cond > &	cpts1,
		const CondPointsToSet< Cond > &	cpts2
	)

inline

Result of cpts1 & ~cpts2 is stored into this bitmap.

Definition at line 507 of file ConditionalPT.h.

    {
        if (cpts1.pointsTo().empty())
        {
            clear();
            return;
        }
        else if (cpts2.pointsTo().empty())
        {
            (*this) = cpts1;
        }
        else
        {
            CondPtsConstIter it1 = cpts1.cptsBegin(), eit1 = cpts1.cptsEnd();
            for (; it1 != eit1; ++it1)
            {
                const Cond& cond = it1->first;
                const PointsTo& pts1 = it1->second;
                PointsTo& pts = pointsTo(cond);
                if (cpts2.hasPointsTo(cond))
                {
                    const PointsTo& pts2 = cpts2.pointsTo(cond);
                    pts.intersectWithComplement(pts1, pts2);
                }
                else
                {
                    pts = pts1;
                }
            }
        }
    }

◆ isSubset()

template<class Cond >

bool SVF::CondPointsToSet< Cond >::isSubset ( const CondPointsToSet< Cond > & rhs ) const

inline

Check whether this CondPointsToSet is a subset of RHS.

Definition at line 458 of file ConditionalPT.h.

    {
        if (pointsTo().size() > rhs.pointsTo().size())
            return false;
        else
        {
            CondPtsConstIter lit = cptsBegin(), elit = cptsEnd();
            for (; lit != elit; ++lit)
            {
                const Cond& lc = lit->first;
                CondPtsConstIter rit = rhs.pointsTo().find(lc);
                if (rit == rhs.pointsTo().end())
                    return false;
                else
                {
                    const PointsTo& pts = lit->second;
                    const PointsTo& rpts = rit->second;
                    if (!rpts.contains(pts))
                        return false;
                }
            }
        }
        return true;
    }

◆ numElement()

template<class Cond >

unsigned SVF::CondPointsToSet< Cond >::numElement ( ) const

inline

Get number of points-to targets.

Definition at line 382 of file ConditionalPT.h.

    {
        if (_condPts.empty())
            return 0;
        else
        {
            unsigned num = 0;
            for (CondPtsConstIter it = cptsBegin(); it != cptsEnd(); it++)
            {
                PointsTo pts = it->second;
                num += pts.count();
            }
            return num;
        }
    }

◆ operator!=()

template<class Cond >

bool SVF::CondPointsToSet< Cond >::operator!= ( const CondPointsToSet< Cond > & rhs )

inline

Overloading operator !=.

Definition at line 601 of file ConditionalPT.h.

    {
        return !(*this == rhs);
    }

◆ operator&=()

template<class Cond >

bool SVF::CondPointsToSet< Cond >::operator&= ( const CondPointsToSet< Cond > & rhs )

inline

Overloading operator &=.

Definition at line 564 of file ConditionalPT.h.

    {
        if (empty())
        {
            return false;
        }
        else if (rhs.empty())
        {
            clear();
            return true;
        }
        else
        {
            bool changed = false;
            for (CondPtsIter it = cptsBegin(), eit = cptsEnd(); it != eit; ++it)
            {
                const Cond& cond = it->first;
                PointsTo& pts = it->second;
                if (rhs.hasPointsTo(cond))
                {
                    if (pts &= rhs.pointsTo(cond))
                        changed = true;
                }
                else
                {
                    if (!pts.empty())
                    {
                        pts.clear();
                        changed = true;
                    }
                }
            }
            return changed;
        }
    }

◆ operator<()

template<class Cond >

bool SVF::CondPointsToSet< Cond >::operator< ( const CondPointsToSet< Cond > & rhs ) const

inline

Compare two CondPointsToSet according to their points-to set size and points-to elements.

CondPointsToSet with smaller points-to set size is smaller than the other;
If the sizes are equal, comparing the conditions and real points-to targets in their points-to elements.

Definition at line 634 of file ConditionalPT.h.

    {
        if (pointsTo().size() < rhs.pointsTo().size())
            return true;
        else if (pointsTo().size() == rhs.pointsTo().size())
        {
            CondPtsConstIter lit = cptsBegin(), elit = cptsEnd();
            CondPtsConstIter rit = rhs.cptsBegin(), erit = rhs.cptsEnd();
            for (; lit != elit && rit != erit; ++lit, ++rit)
            {
                const Cond& lc = lit->first;
                const Cond& rc = rit->first;
                if (lc < rc)
                    return true;
                else if (lc == rc)
                {
                    const PointsTo& lpts = lit->second;
                    const PointsTo& rpts = rit->second;
                    if (lpts.count() < rpts.count())
                        return true;
                    else if (lpts.count() == rpts.count())
                    {
                        PointsTo::iterator bit = lpts.begin();
                        PointsTo::iterator eit = lpts.end();
                        PointsTo::iterator rbit = rpts.begin();
                        PointsTo::iterator reit = rpts.end();
                        for (; bit != eit && rbit != reit; bit++, rbit++)
                        {
                            if (*bit < *rbit)
                                return true;
                            else if (*bit > *rbit)
                                return false;
                        }
                    }
                    else
                        return false;
                }
                else
                    return false;
            }
        }
        return false;
    }

◆ operator=()

template<class Cond >

CondPointsToSet< Cond > & SVF::CondPointsToSet< Cond >::operator= ( const CondPointsToSet< Cond > & other )

inline

Overloading operators.

Definition at line 406 of file ConditionalPT.h.

    {
        _condPts = other.pointsTo();
        return *this;
    }

◆ operator==()

template<class Cond >

bool SVF::CondPointsToSet< Cond >::operator== ( const CondPointsToSet< Cond > & rhs ) const

inline

Overloading operator ==.

Definition at line 414 of file ConditionalPT.h.

    {
        // Always remember give the typename when define a template variable
        if (pointsTo().size() != rhs.pointsTo().size())
            return false;
        CondPtsConstIter lit = cptsBegin(), elit = cptsEnd();
        CondPtsConstIter rit = rhs.cptsBegin(), erit = rhs.cptsEnd();
        for (; lit != elit && rit != erit; ++lit, ++rit)
        {
            const Cond& lc = lit->first;
            const Cond& rc = rit->first;
            if (lc != rc || lit->second != rit->second)
                return false;
        }
        return true;
    }

◆ operator|=()

template<class Cond >

bool SVF::CondPointsToSet< Cond >::operator|= ( const CondPointsToSet< Cond > & rhs )

inline

Overloading operator |= Merge CondPointsToSet of RHS into this one.

Definition at line 610 of file ConditionalPT.h.

    {
        bool changed = false;
        CondPtsConstIter rhsIt = rhs.cptsBegin();
        CondPtsConstIter rhsEit = rhs.cptsEnd();
        for (; rhsIt != rhsEit; ++rhsIt)
        {
            const Cond& cond = rhsIt->first;
            const PointsTo& rhsPts = rhsIt->second;
            PointsTo& pts = pointsTo(cond);
            if ((pts |= rhsPts))
                changed = true;
        }
        return changed;
    }

◆ pointsTo() [1/4]

template<class Cond >

PointsTo & SVF::CondPointsToSet< Cond >::pointsTo ( Cond cond )

inline

Definition at line 350 of file ConditionalPT.h.

    {
        return _condPts[cond];
    }

◆ pointsTo() [2/4]

template<class Cond >

const PointsTo & SVF::CondPointsToSet< Cond >::pointsTo ( Cond cond ) const

inline

Definition at line 340 of file ConditionalPT.h.

    {
        CondPtsConstIter it = _condPts.find(cond);
        assert(it!=_condPts.end() && "do not have pts of such condition!");
        return it->second;
    }

◆ pointsTo() [3/4]

template<class Cond >

CondPts & SVF::CondPointsToSet< Cond >::pointsTo ( void )

inline

Get Conditional PointsTo and standard points-to.

Definition at line 332 of file ConditionalPT.h.

    {
        return _condPts;
    }

◆ pointsTo() [4/4]

template<class Cond >

const CondPts & SVF::CondPointsToSet< Cond >::pointsTo ( void ) const

inline

Definition at line 336 of file ConditionalPT.h.

    {
        return _condPts;
    }

◆ reset()

template<class Cond >

void SVF::CondPointsToSet< Cond >::reset ( const SingleCondVar & var )

inline

Definition at line 699 of file ConditionalPT.h.

    {
        if (hasPointsTo(var.get_cond()))
        {
            PointsTo& pts = pointsTo(var.get_cond());
            pts.reset(var.get_id());
        }
    }

◆ set()

template<class Cond >

void SVF::CondPointsToSet< Cond >::set ( const SingleCondVar & var )

inline

Definition at line 694 of file ConditionalPT.h.

    {
        PointsTo& pts = pointsTo(var.get_cond());
        pts.set(var.get_id());
    }

◆ test()

template<class Cond >

bool SVF::CondPointsToSet< Cond >::test ( const SingleCondVar & var ) const

inline

Definition at line 685 of file ConditionalPT.h.

    {
        if (hasPointsTo(var.get_cond()))
        {
            const PointsTo& pts = pointsTo(var.get_cond());
            return pts.test(var.get_id());
        }
        return false;
    }

◆ test_and_set()

template<class Cond >

bool SVF::CondPointsToSet< Cond >::test_and_set ( const SingleCondVar & var )

inline

Test and set.

Definition at line 680 of file ConditionalPT.h.

    {
        PointsTo& pts = pointsTo(var.get_cond());
        return pts.test_and_set(var.get_id());
    }

Member Data Documentation

◆ _condPts

template<class Cond >

CondPts SVF::CondPointsToSet< Cond >::_condPts

private

Definition at line 840 of file ConditionalPT.h.

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

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

Classes

Public Types

Public Member Functions

Private Attributes

Detailed Description

Member Typedef Documentation

◆ CondPts

◆ CondPtsConstIter

◆ CondPtsIter

◆ iterator

◆ SingleCondVar

Constructor & Destructor Documentation

◆ CondPointsToSet() [1/3]

◆ CondPointsToSet() [2/3]

◆ CondPointsToSet() [3/3]

Member Function Documentation

◆ aliased()

◆ begin() [1/2]

◆ begin() [2/2]

◆ clear()

◆ cptsBegin() [1/2]

◆ cptsBegin() [2/2]

◆ cptsEnd() [1/2]

◆ cptsEnd() [2/2]

◆ dump()

◆ dumpStr()

◆ empty()

◆ end() [1/2]

◆ end() [2/2]

◆ hasPointsTo()

◆ intersects()

◆ intersectWithComplement() [1/2]

◆ intersectWithComplement() [2/2]

◆ isSubset()

◆ numElement()

◆ operator!=()

◆ operator&=()

◆ operator<()

◆ operator=()

◆ operator==()

◆ operator|=()

◆ pointsTo() [1/4]

◆ pointsTo() [2/4]

◆ pointsTo() [3/4]

◆ pointsTo() [4/4]

◆ reset()

◆ set()

◆ test()

◆ test_and_set()

Member Data Documentation

◆ _condPts