Home
last modified time | relevance | path

Searched refs:CFGBlock (Results 1 – 25 of 55) sorted by relevance

123

/freebsd-14.2/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DDominators.h38 using DomTreeNode = llvm::DomTreeNodeBase<CFGBlock>;
61 CFGBlock *getRoot() const { in getRoot()
136 bool dominates(const CFGBlock *A, const CFGBlock *B) const { in dominates()
143 bool properlyDominates(const CFGBlock *A, const CFGBlock *B) const { in properlyDominates()
149 CFGBlock *findNearestCommonDominator(CFGBlock *A, CFGBlock *B) { in findNearestCommonDominator()
153 const CFGBlock *findNearestCommonDominator(const CFGBlock *A, in findNearestCommonDominator()
160 void changeImmediateDominator(CFGBlock *N, CFGBlock *NewIDom) { in changeImmediateDominator()
165 bool isReachableFromEntry(const CFGBlock *A) { in isReachableFromEntry()
195 struct ChildrenGetterTy<clang::CFGBlock, IsPostDom> {
249 bool isControlDependent(CFGBlock *A, CFGBlock *B) {
[all …]
H A DConsumed.h179 void intersectAtLoopHead(const CFGBlock *LoopHead, const CFGBlock *LoopBack,
224 bool allBackEdgesVisited(const CFGBlock *CurrBlock,
225 const CFGBlock *TargetBlock);
227 void addInfo(const CFGBlock *Block, ConsumedStateMap *StateMap,
229 void addInfo(const CFGBlock *Block,
232 ConsumedStateMap* borrowInfo(const CFGBlock *Block);
234 void discardInfo(const CFGBlock *Block);
236 std::unique_ptr<ConsumedStateMap> getInfo(const CFGBlock *Block);
238 bool isBackEdge(const CFGBlock *From, const CFGBlock *To);
239 bool isBackEdgeTarget(const CFGBlock *Block);
[all …]
H A DPostOrderCFGView.h43 struct iterator { using value_type = const CFGBlock *; };
50 std::pair<std::nullopt_t, bool> insert(const CFGBlock *Block) { in insert()
67 bool alreadySet(const CFGBlock *Block) { in alreadySet()
74 std::vector<const CFGBlock *> Blocks;
76 using BlockOrderTy = llvm::DenseMap<const CFGBlock *, unsigned>;
82 using iterator = std::vector<const CFGBlock *>::reverse_iterator;
83 using const_iterator = std::vector<const CFGBlock *>::const_reverse_iterator;
101 bool operator()(const CFGBlock *b1, const CFGBlock *b2) const;
H A DThreadSafetyCommon.h107 void enterCFGBlock(const CFGBlock *B) {} in enterCFGBlock()
119 void enterCFGBlockBody(const CFGBlock *B) {} in enterCFGBlockBody()
128 void exitCFGBlockBody(const CFGBlock *B) {} in exitCFGBlockBody()
140 void exitCFGBlock(const CFGBlock *B) {} in exitCFGBlock()
143 void exitCFG(const CFGBlock *Last) {} in exitCFG()
184 SmallVector<CFGBlock*, 4> BackEdges; in walk()
469 void enterCFGBlock(const CFGBlock *B);
473 void enterCFGBlockBody(const CFGBlock *B);
476 void exitCFGBlockBody(const CFGBlock *B);
480 void exitCFGBlock(const CFGBlock *B);
[all …]
H A DIntervalPartition.h49 using WeakTopologicalOrdering = std::vector<const CFGBlock *>;
55 bool operator()(const CFGBlock *B1, const CFGBlock *B2) const { in operator()
79 CFGIntervalNode(unsigned ID, std::vector<const CFGBlock *> Nodes) in CFGIntervalNode()
93 std::vector<const CFGBlock *> Nodes;
110 std::vector<const CFGBlock *> buildInterval(const CFGBlock *Header);
H A DCFGReachabilityAnalysis.h24 class CFGBlock; variable
42 bool isReachable(const CFGBlock *Src, const CFGBlock *Dst);
45 void mapReachability(const CFGBlock *Dst);
/freebsd-14.2/contrib/llvm-project/clang/lib/Analysis/
H A DCFG.cpp602 std::pair<CFGBlock *, CFGBlock *> VisitLogicalOperator(BinaryOperator *B,
720 CFGBlock *NYS() { in NYS()
900 void addSuccessor(CFGBlock *B, CFGBlock *S, bool IsReachable = true) { in addSuccessor()
907 void addSuccessor(CFGBlock *B, CFGBlock *ReachableBlock, CFGBlock *AltBlock) { in addSuccessor()
2426 CFGBlock *B = Block; in VisitChildren()
2522 std::pair<CFGBlock*, CFGBlock*>
3679 CFGBlock *
5368 CFGBlock::AdjacentBlock::AdjacentBlock(CFGBlock *B, bool IsReachable) in AdjacentBlock()
5373 CFGBlock::AdjacentBlock::AdjacentBlock(CFGBlock *B, CFGBlock *AlternateBlock) in AdjacentBlock()
5389 bool CFGBlock::FilterEdge(const CFGBlock::FilterOptions &F, in FilterEdge()
[all …]
H A DReachableCode.cpp90 const CFGBlock *Current = B; in isDeadReturn()
323 SmallVector<const CFGBlock*, 32> WL; in scanFromBlock()
336 const CFGBlock *item = WL.pop_back_val(); in scanFromBlock()
350 const CFGBlock *B = *I; in scanFromBlock()
396 SmallVector<const CFGBlock *, 10> WorkList;
411 void enqueue(const CFGBlock *block);
419 void reportDeadCode(const CFGBlock *B,
438 if (const CFGBlock *PredBlock = *I) { in isDeadCodeRoot()
512 if (const CFGBlock *predBlock = *I) in scanBackwards()
541 const CFGBlock *Block = I.first; in scanBackwards()
[all …]
H A DCFGReachabilityAnalysis.cpp26 bool CFGReverseBlockReachabilityAnalysis::isReachable(const CFGBlock *Src, in isReachable()
27 const CFGBlock *Dst) { in isReachable()
42 void CFGReverseBlockReachabilityAnalysis::mapReachability(const CFGBlock *Dst) { in mapReachability()
43 SmallVector<const CFGBlock *, 11> worklist; in mapReachability()
55 const CFGBlock *block = worklist.pop_back_val(); in mapReachability()
70 for (CFGBlock::const_pred_iterator i = block->pred_begin(), in mapReachability()
H A DCFGStmtMap.cpp22 typedef llvm::DenseMap<const Stmt*, CFGBlock*> SMap;
27 CFGBlock *CFGStmtMap::getBlock(Stmt *S) { in getBlock()
36 CFGBlock *B = I->second; in getBlock()
49 static void Accumulate(SMap &SM, CFGBlock *B) { in Accumulate()
51 for (CFGBlock::iterator I = B->begin(), E = B->end(); I != E; ++I) { in Accumulate()
57 CFGBlock *&Entry = SM[CS->getStmt()]; in Accumulate()
H A DCalledOnceCheck.cpp598 NotCalledClarifier(const CFGBlock *Parent, const CFGBlock *SuccInQuestion) in NotCalledClarifier()
601 const CFGBlock *Parent, *SuccInQuestion;
716 const CFGBlock *Exit = &FunctionCFG.getExit(); in check()
739 void check(const CFGBlock *BB) { in check()
763 void checkEntry(const CFGBlock *Entry) { in checkEntry()
841 for (const CFGBlock *BB : FunctionCFG) { in checkEntry()
942 for (const CFGBlock *Succ : Parent->succs()) { in findAndReportNotCalledBranches()
1298 State &getState(const CFGBlock *BB) { in getState()
1302 const State &getState(const CFGBlock *BB) const { in getState()
1322 State joinSuccessors(const CFGBlock *BB) const { in joinSuccessors()
[all …]
H A DUninitializedValues.cpp150 ValueVector &getValueVector(const CFGBlock *block) { in getValueVector()
156 bool updateValueVectorWithScratch(const CFGBlock *block);
166 Value getValue(const CFGBlock *block, const CFGBlock *dstBlock, in getValue()
483 const CFGBlock *block;
572 SmallVector<const CFGBlock*, 32> Queue; in getUninitUse()
580 const CFGBlock *B = Queue.pop_back_val(); in getUninitUse()
588 const CFGBlock *Pred = *I; in getUninitUse()
637 const CFGBlock *Succ = *I; in getUninitUse()
847 const CFGBlock *pred = *I; in runOnBlock()
929 const CFGBlock &entry = cfg.getEntry(); in runUninitializedVariablesAnalysis()
[all …]
H A DLiveVariables.cpp162 const CFGBlock *currentBlock;
167 const CFGBlock *CurrentBlock) in TransferFunctions()
479 LiveVariablesImpl::runOnBlock(const CFGBlock *block, in runOnBlock()
490 for (CFGBlock::const_reverse_iterator it = block->rbegin(), in runOnBlock()
543 for (const CFGBlock *B : cfg->nodes()) { in computeLiveness()
547 while (const CFGBlock *block = worklist.dequeue()) { in computeLiveness()
556 if (const CFGBlock *succ = *it) { in computeLiveness()
583 std::vector<const CFGBlock *> vec; in dumpBlockLiveness()
589 llvm::sort(vec, [](const CFGBlock *A, const CFGBlock *B) { in dumpBlockLiveness()
595 for (std::vector<const CFGBlock *>::iterator in dumpBlockLiveness()
[all …]
/freebsd-14.2/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DCoreEngine.h205 const CFGBlock *Block;
435 const CFGBlock *DstT;
436 const CFGBlock *DstF;
446 const CFGBlock *dstT, const CFGBlock *dstF) in BranchNodeBuilder()
456 const CFGBlock *dstT, const CFGBlock *dstF) in BranchNodeBuilder()
483 const CFGBlock *Src;
484 const CFGBlock &DispatchBlock;
496 CFGBlock::const_succ_iterator I;
513 const CFGBlock *getBlock() const { in getBlock()
536 const CFGBlock *Src;
[all …]
H A DCallEvent.h160 CFGBlock::ConstCFGElementRef ElemRef = {nullptr, 0};
184 CFGBlock::ConstCFGElementRef ElemRef) in CallEvent()
188 CFGBlock::ConstCFGElementRef ElemRef) in CallEvent()
502 CFGBlock::ConstCFGElementRef ElemRef) in AnyFunctionCall()
506 CFGBlock::ConstCFGElementRef ElemRef) in AnyFunctionCall()
578 CFGBlock::ConstCFGElementRef ElemRef) in BlockCall()
680 CFGBlock::ConstCFGElementRef ElemRef) in CXXInstanceCall()
721 CFGBlock::ConstCFGElementRef ElemRef) in CXXMemberCall()
1179 CFGBlock::ConstCFGElementRef ElemRef) in ObjCMethodCall()
1306 CFGBlock::ConstCFGElementRef ElemRef) { in create()
[all …]
H A DWorkList.h23 class CFGBlock; variable
30 const CFGBlock *block;
35 const CFGBlock *B, unsigned idx) in WorkListUnit()
54 const CFGBlock *getBlock() const { return block; } in getBlock()
68 void enqueue(ExplodedNode *N, const CFGBlock *B, unsigned idx) { in enqueue()
/freebsd-14.2/contrib/llvm-project/clang/include/clang/Analysis/FlowSensitive/
H A DDataflowWorklist.h25 llvm::PriorityQueue<const CFGBlock *,
26 SmallVector<const CFGBlock *, QueueSize>, Comp>
33 void enqueueBlock(const CFGBlock *Block) { in enqueueBlock()
40 const CFGBlock *dequeue() { in dequeue()
43 const CFGBlock *B = WorkList.top(); in dequeue()
52 bool operator()(const CFGBlock *lhs, const CFGBlock *rhs) const { in operator()
69 void enqueueSuccessors(const CFGBlock *Block) { in enqueueSuccessors()
82 void enqueueSuccessors(const CFGBlock *Block) { in enqueueSuccessors()
97 void enqueuePredecessors(const CFGBlock *Block) { in enqueuePredecessors()
H A DControlFlowContext.h52 const llvm::DenseMap<const Stmt *, const CFGBlock *> &getStmtToBlock() const { in getStmtToBlock()
57 bool isBlockReachable(const CFGBlock &B) const { in isBlockReachable()
63 llvm::DenseMap<const Stmt *, const CFGBlock *> StmtToBlock, in ControlFlowContext()
72 llvm::DenseMap<const Stmt *, const CFGBlock *> StmtToBlock;
/freebsd-14.2/contrib/llvm-project/clang/include/clang/Analysis/
H A DCFG.h604 class CFGBlock {
655 std::conditional_t<IsConst, const CFGBlock *, CFGBlock *>;
706 std::conditional_t<IsConst, const CFGBlock *, CFGBlock *>;
826 CFGBlock *ReachableBlock;
835 AdjacentBlock(CFGBlock *B, CFGBlock *AlternateBlock);
849 operator CFGBlock*() const {
1018 const CFGBlock *Dst);
1025 const CFGBlock *From;
1267 CFGBlock *createBlock();
1435 CFGBlock *Entry = nullptr;
[all …]
H A DProgramPoint.h98 CFGBlock::ConstCFGElementRef ElemRef = {nullptr, 0};
227 const CFGBlock *getBlock() const { in getBlock()
232 const CFGBlock *B = getBlock(); in getFirstElement()
249 const CFGBlock *getBlock() const { in getBlock()
337 const CFGBlock *getBlock() const { in getBlock()
500 BlockEdge(const CFGBlock *B1, const CFGBlock *B2, const LocationContext *L) in BlockEdge()
506 const CFGBlock *getSrc() const { in getSrc()
507 return static_cast<const CFGBlock*>(getData1()); in getSrc()
510 const CFGBlock *getDst() const { in getDst()
511 return static_cast<const CFGBlock*>(getData2()); in getDst()
[all …]
H A DAnalysisDeclContext.h127 const CFGBlock *getBlockForRegisteredExpression(const Stmt *stmt);
182 const Stmt *S, const CFGBlock *Blk,
306 const CFGBlock *Block;
317 const Stmt *S, const CFGBlock *Block, unsigned BlockCount, in StackFrameContext()
327 const CFGBlock *getCallSiteBlock() const { return Block; } in getCallSiteBlock()
339 const CFGBlock *Block, unsigned BlockCount, in Profile()
407 const Stmt *S, const CFGBlock *Block,
478 const Stmt *S, const CFGBlock *Block, in getStackFrame()
/freebsd-14.2/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DUnreachableCodeChecker.cpp40 static inline const Stmt *getUnreachableStmt(const CFGBlock *CB);
41 static void FindUnreachableEntryPoints(const CFGBlock *CB,
44 static bool isInvalidPath(const CFGBlock *CB, const ParentMap &PM);
45 static inline bool isEmptyCFGBlock(const CFGBlock *CB);
78 const CFGBlock *CB = BE->getBlock(); in checkEndAnalysis()
95 for (const CFGBlock *CB : *C) { in checkEndAnalysis()
129 for (CFGBlock::const_iterator ci = CB->begin(), ce = CB->end(); in checkEndAnalysis()
182 for (const CFGBlock *PredBlock : CB->preds()) { in FindUnreachableEntryPoints()
213 bool UnreachableCodeChecker::isInvalidPath(const CFGBlock *CB, in isInvalidPath()
225 const CFGBlock *pred = *CB->pred_begin(); in isInvalidPath()
[all …]
H A DAnalyzerStatsChecker.cpp47 llvm::SmallPtrSet<const CFGBlock*, 32> reachable; in checkEndAnalysis()
64 const CFGBlock *CB = BE->getBlock(); in checkEndAnalysis()
76 const CFGBlock *CB = *I; in checkEndAnalysis()
120 const CFGBlock *Exit = BE.getDst(); in checkEndAnalysis()
/freebsd-14.2/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/
H A DControlFlowContext.cpp28 static llvm::DenseMap<const Stmt *, const CFGBlock *>
30 llvm::DenseMap<const Stmt *, const CFGBlock *> StmtToBlock; in buildStmtToBasicBlockMap()
31 for (const CFGBlock *Block : Cfg) { in buildStmtToBasicBlockMap()
51 llvm::SmallVector<const CFGBlock *> BlocksToVisit; in findReachableBlocks()
54 const CFGBlock *Block = BlocksToVisit.back(); in findReachableBlocks()
62 for (const CFGBlock *Succ : Block->succs()) in findReachableBlocks()
111 llvm::DenseMap<const Stmt *, const CFGBlock *> StmtToBlock = in build()
H A DTypeErasedDataflowAnalysis.cpp46 static int blockIndexInPredecessor(const CFGBlock &Pred, in blockIndexInPredecessor()
47 const CFGBlock &Block) { in blockIndexInPredecessor()
49 Pred.succs(), [&Block](const CFGBlock::AdjacentBlock &Succ) { in blockIndexInPredecessor()
61 static bool isBackedgeNode(const CFGBlock &B) { in isBackedgeNode()
276 computeBlockInputState(const CFGBlock &Block, AnalysisContext &AC) { in computeBlockInputState()
277 std::vector<const CFGBlock *> Preds(Block.pred_begin(), Block.pred_end()); in computeBlockInputState()
311 for (const CFGBlock *Pred : Preds) { in computeBlockInputState()
455 transferCFGBlock(const CFGBlock &Block, AnalysisContext &AC, in transferCFGBlock()
537 const CFGBlock &Entry = CFG.getEntry(); in runTypeErasedDataflowAnalysis()
552 while (const CFGBlock *Block = Worklist.dequeue()) { in runTypeErasedDataflowAnalysis()
[all …]

123