SVF::WPAFSSolver< GraphType > Class Template Reference

#include <WPAFSSolver.h>

Inheritance diagram for SVF::WPAFSSolver< GraphType >:

Public Member Functions
	WPAFSSolver ()
	Constructor.
virtual	~WPAFSSolver ()
	Destructor.
virtual NodeID	sccRepNode (NodeID id) const
	SCC methods.

Protected Member Functions
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 void	propagate (GNODE *v)
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
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 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 Attributes inherited from SVF::WPASolver< GraphType >
u32_t	numOfIteration
	num of iterations during constraint solving

Detailed Description

template<class GraphType>
class SVF::WPAFSSolver< GraphType >

Flow-sensitive Solver

Definition at line 48 of file WPAFSSolver.h.

Constructor & Destructor Documentation

WPAFSSolver()

template<class GraphType >

SVF::WPAFSSolver< GraphType >::WPAFSSolver ( )

inline

Constructor.

Definition at line 52 of file WPAFSSolver.h.

                  : WPASolver<GraphType>()
    {}

~WPAFSSolver()

template<class GraphType >

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

inlinevirtual

Destructor.

Definition at line 55 of file WPAFSSolver.h.

{}

Member Function Documentation

SCCDetect()

template<class GraphType >

virtual NodeStack & SVF::WPAFSSolver< GraphType >::SCCDetect ( )

inlineprotectedvirtual

SCC detection.

SCC detection

Both rep and sub nodes need to be processed later. Collect sub nodes from SCCDetector.

restore the topological order.

Reimplemented from SVF::WPASolver< GraphType >.

Reimplemented in SVF::FlowSensitive.

Definition at line 67 of file WPAFSSolver.h.

    {
        this->getSCCDetector()->find();
 
        assert(nodeStack.empty() && "node stack is not empty, some nodes are not popped properly.");
 
        FIFOWorkList<NodeID> revTopoStack = this->getSCCDetector()->revTopoNodeStack();
        while (!revTopoStack.empty())
        {
            NodeID nodeId = revTopoStack.front();
            revTopoStack.pop();
            const NodeBS& subNodes = this->getSCCDetector()->subNodes(nodeId);
            for (NodeBS::iterator it = subNodes.begin(), eit = subNodes.end(); it != eit; ++it)
            {
                nodeStack.push(*it);
            }
        }
 
        return nodeStack;
    }

sccRepNode()

template<class GraphType >

virtual NodeID SVF::WPAFSSolver< GraphType >::sccRepNode ( NodeID  id ) const

inlinevirtual

SCC methods.

Reimplemented from SVF::WPASolver< GraphType >.

Definition at line 58 of file WPAFSSolver.h.

    {
        return id;
    }

Member Data Documentation

nodeStack

template<class GraphType >

NodeStack SVF::WPAFSSolver< GraphType >::nodeStack

protected

stack used for processing nodes.

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