94 if (!srcInits.
empty())
97 for (
NodeID ptd : srcInits)
98 sortSrcInits.insert(ptd);
124 while (!initials.empty())
126 NodeID init = *initials.begin();
127 initials.erase(init);
129 if (
consCG->isBlkObjOrConstantObj(init))
140 initOffset = gepNode->getConstantFieldIdx();
145 assert(
false &&
"Not an object node!!");
153 bool loopFlag =
true;
157 for (
auto _f : offsets)
158 for (
auto _s : strides)
161 loopFlag = (offsets.find(_f1) == offsets.end()) && ( (
u32_t)(initOffset + _f1) < maxLimit);
171 initials.erase(gepId);
172 expandPts.
set(gepId);
static u32_t numOfFieldExpand
ConstraintGraph * consCG
Constraint Graph.
void initialize()
Initialize analysis.
bool processGepPts(const PointsTo &pts, const GepCGEdge *edge)
void fieldExpand(NodeSet &initials, APOffset offset, NodeBS &strides, PointsTo &expandPts)
static AndersenSFR * sfrAndersen
bool mergeSrcToTgt(NodeID nodeId, NodeID newRepId)
void setDetectPWC(bool flag)
virtual bool unionPts(NodeID id, const PointsTo &target)
virtual const PointsTo & getPts(NodeID id)
Operation of points-to set.
virtual bool processGepPts(const PointsTo &pts, const GepCGEdge *edge)
virtual bool mergeSrcToTgt(NodeID srcId, NodeID tgtId)
u32_t getMaxFieldOffsetLimit() const
Get max field offset limit.
NodeBS strides
For stride-based field representation.
NodeType * getDstNode() const
virtual void initialize()
Initialization of a pointer analysis, including building symbol table and SVFIR etc.
bool empty() const
Returns true if set is empty.
void set(u32_t n)
Inserts n in the set.
NodeID getId() const
Get ID.
std::unique_ptr< SCC > scc
SCC * getSCCDetector() const
virtual void pushIntoWorklist(NodeID id)
LLVM_NODISCARD bool isa(const Y &Val)
LLVM_NODISCARD std::enable_if_t<!is_simple_type< Y >::value, typename cast_retty< X, const Y >::ret_type > dyn_cast(const Y &Val)
std::unordered_set< Key, Hash, KeyEqual, Allocator > Set