48template<
class GraphType>
73 assert(
nodeStack.empty() &&
"node stack is not empty, some nodes are not popped properly.");
78 while (!revTopoStack.
empty())
99template<
class GraphType>
121 while (!nodeStack.empty())
142 for (; EI != EE; ++EI)
172template<
class GraphType>
187 bool solveAll =
true;
199 while (!nodeStack.empty())
207 if (solveAll ==
false)
NodeID repNode(NodeID n) const
get the rep node if not found return itself
FIFOWorkList< NodeID > revTopoNodeStack() const
const NodeBS & subNodes(NodeID n) const
get all subnodes in one scc, if size is empty insert itself into the set
SparseBitVectorIterator iterator
virtual NodeID sccRepNode(NodeID id) const
SCC methods.
WPAFSSolver()
Constructor.
virtual NodeStack & SCCDetect()
SCC detection.
virtual ~WPAFSSolver()
Destructor.
const NodeBS & getCandidates() const
NodeBS candidates
nodes which need to be analyzed in current iteration.
WPASolver< GraphType >::GTraits GTraits
void addNewCandidate(NodeID node)
void removeCandidates(const NodeBS &nodes)
virtual ~WPAMinimumSolver()
WPASolver< GraphType >::child_iterator child_iterator
WPASolver< GraphType >::GNODE GNODE
virtual void addNodeIntoWorkList(NodeID node)
WPASolver< GraphType >::GTraits GTraits
NodeID curSCCID
index of current SCC.
void setCurrentSCC(NodeID id)
virtual void addNodeIntoWorkList(NodeID node)
WPASolver< GraphType >::GNODE GNODE
WPASolver< GraphType >::child_iterator child_iterator
bool isInCurrentSCC(NodeID node)
virtual void propagate(GNODE *v)
Propagation for the solving, to be implemented in the child class.
NodeID Node_Index(GNODE node)
Get node ID.
NodeID popFromWorklist()
Worklist operations.
SCC * getSCCDetector() const
Get SCC detector.
virtual void pushIntoWorklist(NodeID id)
GTraits::ChildIteratorType child_iterator
SVF::GenericGraphTraits< GraphType > GTraits
Define the GTraits and node iterator for printing.
virtual bool propFromSrcToDst(GEDGE *)
Propagate information from source to destination node, to be implemented in the child class.
virtual void processNode(NodeID)
Following methods are to be implemented in child class, in order to achieve a fully worked PTA.
std::stack< NodeID > NodeStack
iter_range< typename GenericGraphTraits< GraphType >::nodes_iterator > nodes(const GraphType &G)