SVF::WPAMinimumSolver< GraphType > Class Template Reference

#include <WPAFSSolver.h>

Inheritance diagram for SVF::WPAMinimumSolver< 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::WPASCCSolver< GraphType >
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
	WPAMinimumSolver ()
virtual	~WPAMinimumSolver ()
Public Member Functions inherited from SVF::WPASCCSolver< GraphType >
	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	addNodeIntoWorkList (NodeID node)
Protected Member Functions inherited from SVF::WPASCCSolver< GraphType >
virtual void	propagate (GNODE *v)
	Propagation for the solving, to be implemented in the child class.
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.

Private Member Functions
void	addNewCandidate (NodeID node)
const NodeBS &	getCandidates () const
void	removeCandidates (const NodeBS &nodes)

Private Attributes
NodeBS	candidates
	nodes which need to be analyzed in current iteration.

Additional Inherited Members
Public Attributes inherited from SVF::WPASolver< GraphType >
u32_t	numOfIteration
	num of iterations during constraint solving
Protected Attributes inherited from SVF::WPASCCSolver< GraphType >
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.

Detailed Description

template<class GraphType>
class SVF::WPAMinimumSolver< GraphType >

Only solve nodes which need to be analyzed.

Definition at line 180 of file WPAFSSolver.h.

Member Typedef Documentation

child_iterator

template<class GraphType >

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

Definition at line 185 of file WPAFSSolver.h.

GNODE

template<class GraphType >

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

Definition at line 184 of file WPAFSSolver.h.

GTraits

template<class GraphType >

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

Definition at line 183 of file WPAFSSolver.h.

Constructor & Destructor Documentation

WPAMinimumSolver()

template<class GraphType >

SVF::WPAMinimumSolver< GraphType >::WPAMinimumSolver ( )

inline

Definition at line 187 of file WPAFSSolver.h.

: WPASCCSolver<GraphType>() {}

~WPAMinimumSolver()

template<class GraphType >

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

inlinevirtual

Definition at line 189 of file WPAFSSolver.h.

{}

Member Function Documentation

addNewCandidate()

template<class GraphType >

void SVF::WPAMinimumSolver< GraphType >::addNewCandidate ( NodeID  node )

inlineprivate

Definition at line 236 of file WPAFSSolver.h.

    {
        candidates.set(node);
    }

addNodeIntoWorkList()

template<class GraphType >

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

inlineprotectedvirtual

Reimplemented from SVF::WPASCCSolver< GraphType >.

Definition at line 227 of file WPAFSSolver.h.

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

getCandidates()

template<class GraphType >

const NodeBS & SVF::WPAMinimumSolver< GraphType >::getCandidates ( ) const

inlineprivate

Definition at line 240 of file WPAFSSolver.h.

    {
        return candidates;
    }

removeCandidates()

template<class GraphType >

void SVF::WPAMinimumSolver< GraphType >::removeCandidates ( const NodeBS &  nodes )

inlineprivate

Definition at line 244 of file WPAFSSolver.h.

    {
        candidates.intersectWithComplement(nodes);
    }

solve()

template<class GraphType >

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

inlineprotectedvirtual

If the worklist is not empty, then only solve these nodes contained in worklist. Otherwise all nodes in the graph will be processed.

get nodes which need to be processed in this SCC cycle

remove nodes which have been processed from the candidate set

Reimplemented from SVF::WPASCCSolver< GraphType >.

Definition at line 192 of file WPAFSSolver.h.

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

Member Data Documentation

candidates

template<class GraphType >

NodeBS SVF::WPAMinimumSolver< GraphType >::candidates

private

nodes which need to be analyzed in current iteration.

Definition at line 249 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