SVF::WPASCCSolver< GraphType > Class Template Reference

#include <WPAFSSolver.h>

Inheritance diagram for SVF::WPASCCSolver< GraphType >:

Public Types
typedef WPASolver< GraphType >::GTraits	GTraits
typedef WPASolver< GraphType >::GNODE	GNODE
typedef WPASolver< GraphType >::child_iterator	child_iterator
Public Types inherited from SVF::WPASolver< GraphType >
typedef SVF::GenericGraphTraits< GraphType >	GTraits
	Define the GTraits and node iterator for printing.
typedef GTraits::NodeRef	GNODE
typedef GTraits::EdgeType	GEDGE
typedef GTraits::ChildIteratorType	child_iterator
typedef SCCDetection< GraphType >	SCC
typedef FIFOWorkList< NodeID >	WorkList

Public Member Functions
	WPASCCSolver ()
virtual	~WPASCCSolver ()
Public Member Functions inherited from SVF::WPAFSSolver< GraphType >
	WPAFSSolver ()
	Constructor.
virtual	~WPAFSSolver ()
	Destructor.
virtual NodeID	sccRepNode (NodeID id) const
	SCC methods.

Protected Member Functions
virtual void	solve ()
virtual void	propagate (GNODE *v)
	Propagation for the solving, to be implemented in the child class.
virtual void	addNodeIntoWorkList (NodeID node)
bool	isInCurrentSCC (NodeID node)
void	setCurrentSCC (NodeID id)
Protected Member Functions inherited from SVF::WPAFSSolver< GraphType >
virtual NodeStack &	SCCDetect ()
	SCC detection.
Protected Member Functions inherited from SVF::WPASolver< GraphType >
	WPASolver ()
	Constructor.
virtual	~WPASolver ()=default
	Destructor.
SCC *	getSCCDetector () const
	Get SCC detector.
const GraphType	graph ()
	Get/Set graph methods.
void	setGraph (GraphType g)
virtual NodeStack &	SCCDetect (NodeSet &candidates)
virtual void	initWorklist ()
virtual void	solveWorklist ()
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 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.

Protected Attributes
NodeID	curSCCID
	index of current SCC.
Protected Attributes inherited from SVF::WPAFSSolver< GraphType >
NodeStack	nodeStack
	stack used for processing nodes.
Protected Attributes inherited from SVF::WPASolver< GraphType >
bool	reanalyze
	Reanalyze if any constraint value changed.
u32_t	iterationForPrintStat
	print out statistics for i-th iteration
GraphType	_graph
	Graph.
std::unique_ptr< SCC >	scc
	SCC.
WorkList	worklist
	Worklist for resolution.

Additional Inherited Members
Public Attributes inherited from SVF::WPASolver< GraphType >
u32_t	numOfIteration
	num of iterations during constraint solving

Detailed Description

template<class GraphType>
class SVF::WPASCCSolver< GraphType >

Solver based on SCC cycles.

Definition at line 100 of file WPAFSSolver.h.

Member Typedef Documentation

child_iterator

template<class GraphType>

typedef WPASolver<GraphType>::child_iterator SVF::WPASCCSolver< GraphType >::child_iterator

Definition at line 105 of file WPAFSSolver.h.

GNODE

template<class GraphType>

typedef WPASolver<GraphType>::GNODE SVF::WPASCCSolver< GraphType >::GNODE

Definition at line 104 of file WPAFSSolver.h.

GTraits

template<class GraphType>

typedef WPASolver<GraphType>::GTraits SVF::WPASCCSolver< GraphType >::GTraits

Definition at line 103 of file WPAFSSolver.h.

Constructor & Destructor Documentation

WPASCCSolver()

template<class GraphType>

SVF::WPASCCSolver< GraphType >::WPASCCSolver ( )

inline

Definition at line 107 of file WPAFSSolver.h.

: WPAFSSolver<GraphType>() {}

~WPASCCSolver()

template<class GraphType>

virtual SVF::WPASCCSolver< GraphType >::~WPASCCSolver ( )

inlinevirtual

Definition at line 109 of file WPAFSSolver.h.

{}

Member Function Documentation

addNodeIntoWorkList()

template<class GraphType>

virtual void SVF::WPASCCSolver< GraphType >::addNodeIntoWorkList ( NodeID node )

inlineprotectedvirtual

Reimplemented in SVF::WPAMinimumSolver< GraphType >.

Definition at line 149 of file WPAFSSolver.h.

    {
        if (isInCurrentSCC(node))
            this->pushIntoWorklist(node);
    }

isInCurrentSCC()

template<class GraphType>

bool SVF::WPASCCSolver< GraphType >::isInCurrentSCC ( NodeID node )

inlineprotected

Definition at line 155 of file WPAFSSolver.h.

    {
        return (const_cast<NodeBS&>(this->getSCCDetector()->subNodes(curSCCID))).test(node);
    }

propagate()

template<class GraphType>

virtual void SVF::WPASCCSolver< GraphType >::propagate ( GNODE * v )

inlineprotectedvirtual

Propagation for the solving, to be implemented in the child class.

Reimplemented from SVF::WPASolver< GraphType >.

Definition at line 138 of file WPAFSSolver.h.

    {
        child_iterator EI = GTraits::direct_child_begin(v);
        child_iterator EE = GTraits::direct_child_end(v);
        for (; EI != EE; ++EI)
        {
            if (this->propFromSrcToDst(*(EI.getCurrent())))
                addNodeIntoWorkList(this->Node_Index(*EI));
        }
    }

setCurrentSCC()

template<class GraphType>

void SVF::WPASCCSolver< GraphType >::setCurrentSCC ( NodeID id )

inlineprotected

Definition at line 159 of file WPAFSSolver.h.

    {
        curSCCID = this->getSCCDetector()->repNode(id);
    }

solve()

template<class GraphType>

virtual void SVF::WPASCCSolver< GraphType >::solve ( )

inlineprotectedvirtual

All nodes will be solved afterwards, so the worklist can be cleared before each solve iteration.

Reimplemented in SVF::WPAMinimumSolver< GraphType >.

Definition at line 112 of file WPAFSSolver.h.

    {
        while (!this->isWorklistEmpty())
            this->popFromWorklist();
 
        NodeStack& nodeStack = this->SCCDetect();
 
        while (!nodeStack.empty())
        {
            NodeID rep = nodeStack.top();
            nodeStack.pop();
 
            setCurrentSCC(rep);
 
            const NodeBS& sccNodes = this->getSCCDetector()->subNodes(rep);
            for (NodeBS::iterator it = sccNodes.begin(), eit = sccNodes.end(); it != eit; ++it)
                this->pushIntoWorklist(*it);
 
            while (!this->isWorklistEmpty())
                this->processNode(this->popFromWorklist());
        }
    }

Member Data Documentation

curSCCID

template<class GraphType>

NodeID SVF::WPASCCSolver< GraphType >::curSCCID

protected

index of current SCC.

Definition at line 164 of file WPAFSSolver.h.

---

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

• /home/runner/work/SVF/SVF/svf/include/WPA/WPAFSSolver.h