72 ecUnion(edge->getSrcID(), edge->getDstID());
77 ecUnion(edge->getSrcID(), edge->getDstID());
86 for (
NodeID sub : subNodes)
109 nodeIt != nodeEit; nodeIt++)
static u32_t numOfProcessedAddr
Statistics.
ConstraintGraph * consCG
Constraint Graph.
virtual bool addPts(NodeID id, NodeID ptd)
const_iterator incomingAddrsBegin() const
const ConstraintEdge::ConstraintEdgeSetTy & getStoreInEdges() const
const ConstraintEdge::ConstraintEdgeSetTy & getGepOutEdges() const
ConstraintEdge::ConstraintEdgeSetTy::const_iterator const_iterator
const ConstraintEdge::ConstraintEdgeSetTy & getLoadOutEdges() const
const ConstraintEdge::ConstraintEdgeSetTy & getCopyOutEdges() const
const_iterator incomingAddrsEnd() const
NodeID getSrcID() const
get methods of the components
IDToNodeMapTy::const_iterator const_iterator
static Steensgaard * steens
NodeToEquivClassMap nodeToECMap
void ecUnion(NodeID id, NodeID ec)
merge node into equiv class and merge node's pts into ec's pts
virtual const PointsTo & getPts(NodeID id) override
Operation of points-to set.
Set< NodeID > & getSubNodes(NodeID id)
void setEC(NodeID node, NodeID rep)
virtual void solveWorklist() override
virtual bool unionPts(NodeID id, const PointsTo &target) override
pts(id) = pts(id) U target
void addSubNode(NodeID node, NodeID sub)
NodeID getEC(NodeID id) const
virtual void pushIntoWorklist(NodeID id)
std::enable_if_t<!is_simple_type< Y >::value, typename cast_retty< X, const Y >::ret_type > cast(const Y &Val)
std::unordered_set< Key, Hash, KeyEqual, Allocator > Set