46 assert(
"SVFBaseNode::valueOnlyToString should be implemented or supported by fronted" &&
false);
53 assert(
"SVFBaseNode::hasLLVMValue should be implemented or supported by fronted" &&
false);
79 assert(
hasLoopInfo(bb) &&
"loopinfo does not exist (bb not in a loop)");
81 return mapIter->second;
95 if ((std::find(blocks.begin(), blocks.end(), succ)==blocks.end()))
96 exitbbs.push_back(succ);
105 if (bbKey == bbValue)
124 const BBSet & dtBBs = mapIter->second;
125 if (dtBBs.find(bbValue) != dtBBs.end())
136 if (bbKey == bbValue)
155 const BBSet & dtBBs = mapIter->second;
156 if (dtBBs.find(bbValue) != dtBBs.end())
166 assert(A && B &&
"Pointers are not valid");
168 "Two blocks are not in same function");
180 if (lvA->second < lvB->second) std::swap(A, B);
195 assert(!blocks.empty() &&
"no available loop info?");
196 return blocks.front() == bb;
const FunObjVar * getParent() const
std::vector< const SVFBasicBlock * > getSuccessors() const
const Map< const SVFBasicBlock *, BBSet > & getPostDomTreeMap() const
const LoopBBs & getLoopInfo(const SVFBasicBlock *bb) const
Map< const SVFBasicBlock *, BBSet > & getDomTreeMap()
std::vector< const SVFBasicBlock * > BBList
Map< const SVFBasicBlock *, BBSet > dtBBsMap
map a BasicBlock to BasicBlocks it Dominates
bool dominate(const SVFBasicBlock *bbKey, const SVFBasicBlock *bbValue) const
bool isLoopHeader(const SVFBasicBlock *bb) const
void getExitBlocksOfLoop(const SVFBasicBlock *bb, BBList &exitbbs) const
const SVFBasicBlock * findNearestCommonPDominator(const SVFBasicBlock *A, const SVFBasicBlock *B) const
find nearest common post dominator of two basic blocks
const Map< const SVFBasicBlock *, u32_t > & getBBPDomLevel() const
const Map< const SVFBasicBlock *, const SVFBasicBlock * > & getBB2PIdom() const
bool isUnreachable(const SVFBasicBlock *bb) const
bool hasLoopInfo(const SVFBasicBlock *bb) const
Set< const SVFBasicBlock * > BBSet
Map< const SVFBasicBlock *, LoopBBs > bb2LoopMap
map a BasicBlock (if it is in a loop) to all the BasicBlocks in this loop
bool postDominate(const SVFBasicBlock *bbKey, const SVFBasicBlock *bbValue) const
const bool hasLLVMValue() const
const std::string valueOnlyToString() const
const SVFType * getOriginalElemType(u32_t fldIdx) const
std::vector< u32_t > fldIdxVec
flattened field indices of a struct (ignoring arrays)
std::vector< u32_t > elemIdxVec
void addFldWithType(u32_t fldIdx, const SVFType *type, u32_t elemIdx)
Add field index and element index and their corresponding type.
Map< u32_t, const SVFType * > fldIdx2TypeMap
Types of all fields of a struct.
std::unordered_map< Key, Value, Hash, KeyEqual, Allocator > Map