SVF::CSC Class Reference

#include <CSC.h>

Public Types
typedef Map< NodeID, NodeID >	IdToIdMap
typedef FILOWorkList< NodeID >	WorkStack
typedef IdToIdMap::iterator	iterator

Public Member Functions
	CSC (ConstraintGraph *g, CGSCC *c)
void	find (NodeStack &candidates)
void	visit (NodeID nodeId, s32_t _w)
void	clear ()
bool	isVisited (NodeID nId)
void	setVisited (NodeID nId)

Private Attributes
ConstraintGraph *	_consG
CGSCC *	_scc
NodeID	_I
IdToIdMap	_D
NodeStack	_S
NodeSet	_visited

Detailed Description

class CSC: cycle stride calculation

Definition at line 49 of file CSC.h.

Member Typedef Documentation

IdToIdMap

typedef Map<NodeID, NodeID> SVF::CSC::IdToIdMap

Definition at line 52 of file CSC.h.

iterator

typedef IdToIdMap::iterator SVF::CSC::iterator

Definition at line 54 of file CSC.h.

WorkStack

typedef FILOWorkList<NodeID> SVF::CSC::WorkStack

Definition at line 53 of file CSC.h.

Constructor & Destructor Documentation

CSC()

SVF::CSC::CSC ( ConstraintGraph *  g, CGSCC *  c  )

inline

Definition at line 68 of file CSC.h.

        : _consG(g), _scc(c), _I(0) {}

Member Function Documentation

clear()

void CSC::clear

(

)

Definition at line 41 of file CSC.cpp.

{
    _I = 0;
    _D.clear();
}

find()

void CSC::find

(

NodeStack &

candidates

)

Definition at line 51 of file CSC.cpp.

{
    clear();
 
    NodeStack revCandidates;
    while (!candidates.empty())
    {
        NodeID nId = candidates.top();
        revCandidates.push(nId);
        candidates.pop();
 
        if (_scc->subNodes(nId).count()>1 && !isVisited(nId))    // node is actually in a cycle
            visit(nId, 0);
    }
 
    while (!revCandidates.empty())
    {
        NodeID nId = revCandidates.top();
        candidates.push(nId);
        revCandidates.pop();
    }
}

isVisited()

bool SVF::CSC::isVisited ( NodeID  nId )

inline

Definition at line 75 of file CSC.h.

    {
        return _visited.find(nId) != _visited.end();
    }

setVisited()

void SVF::CSC::setVisited ( NodeID  nId )

inline

Definition at line 80 of file CSC.h.

    {
        _visited.insert(nId);
    }

visit()

void CSC::visit	(	NodeID	nodeId,
		s32_t	_w
	)

Definition at line 78 of file CSC.cpp.

{
//    pwcReps[nodeId] = _scc->repNode(nodeId);
    setVisited(nodeId);
 
    _I += _w;
    _D[nodeId] = _I;
    _S.push(nodeId);
 
    ConstraintNode* node = _consG->getConstraintNode(nodeId);
    for (ConstraintNode::const_iterator eit = node->directOutEdgeBegin(); eit != node->directOutEdgeEnd(); ++eit)
    {
        s32_t offset;
        if (NormalGepCGEdge* gepCGEdge = SVFUtil::dyn_cast<NormalGepCGEdge>(*eit))
            offset = gepCGEdge->getConstantFieldIdx();
        else
            offset = 0;
        NodeID dstId = (*eit)->getDstID();
        if (_scc->repNode(nodeId) == _scc->repNode(dstId) && !isVisited(dstId))
            visit(dstId, offset);
    }
 
    NodeStack _revS;
    NodeSet _C;
 
    while (!_S.empty())
    {
        NodeID backNodeId = _S.top();
        _S.pop();
        _revS.push(backNodeId);
        ConstraintNode* backNode = _consG->getConstraintNode(backNodeId);
        if (_consG->hasEdge(node, backNode, ConstraintEdge::NormalGep))
        {
            NormalGepCGEdge* normalGep = SVFUtil::dyn_cast<NormalGepCGEdge>(_consG->getEdge(node, backNode, ConstraintEdge::NormalGep));
            s32_t _w = normalGep->getConstantFieldIdx();
            s32_t _l = _D[nodeId] +_w - _D[backNodeId];
            backNode->strides.set(_l);
            for (auto cNodeId : _C)
                _consG->getConstraintNode(cNodeId)->strides.set(_l);
        }
        else if (_consG->hasEdge(node, backNode, ConstraintEdge::VariantGep) ||
                 _consG->hasEdge(node, backNode, ConstraintEdge::Copy))
        {
            s32_t _l = _D[nodeId] - _D[backNodeId];
            backNode->strides.set(_l);
            for (auto cNodeId : _C)
                _consG->getConstraintNode(cNodeId)->strides.set(_l);
        }
        _C.insert(backNodeId);
    }
 
    while (!_revS.empty())
    {
        NodeID backedId = _revS.top();
        _S.push(backedId);
        _revS.pop();
    }
 
    _S.pop();   // after checking all the edges of the top node of _S, remove the node
}

Member Data Documentation

_consG

ConstraintGraph* SVF::CSC::_consG

private

Definition at line 57 of file CSC.h.

_D

IdToIdMap SVF::CSC::_D

private

Definition at line 61 of file CSC.h.

_I

NodeID SVF::CSC::_I

private

Definition at line 60 of file CSC.h.

_S

NodeStack SVF::CSC::_S

private

Definition at line 62 of file CSC.h.

_scc

CGSCC* SVF::CSC::_scc

private

Definition at line 58 of file CSC.h.

_visited

NodeSet SVF::CSC::_visited

private

Definition at line 63 of file CSC.h.

---

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

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