| /freebsd-13.1/contrib/llvm-project/clang/include/clang/Analysis/Analyses/ |
| H A D | Dominators.h | 38 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 D | Consumed.h | 176 void intersectAtLoopHead(const CFGBlock *LoopHead, const CFGBlock *LoopBack, 221 bool allBackEdgesVisited(const CFGBlock *CurrBlock, 222 const CFGBlock *TargetBlock); 224 void addInfo(const CFGBlock *Block, ConsumedStateMap *StateMap, 226 void addInfo(const CFGBlock *Block, 229 ConsumedStateMap* borrowInfo(const CFGBlock *Block); 231 void discardInfo(const CFGBlock *Block); 233 std::unique_ptr<ConsumedStateMap> getInfo(const CFGBlock *Block); 235 bool isBackEdge(const CFGBlock *From, const CFGBlock *To); 236 bool isBackEdgeTarget(const CFGBlock *Block); [all …]
|
| H A D | PostOrderCFGView.h | 44 struct iterator { using value_type = const CFGBlock *; }; 51 std::pair<llvm::NoneType, 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 D | ThreadSafetyCommon.h | 105 void enterCFGBlock(const CFGBlock *B) {} in enterCFGBlock() 117 void enterCFGBlockBody(const CFGBlock *B) {} in enterCFGBlockBody() 126 void exitCFGBlockBody(const CFGBlock *B) {} in exitCFGBlockBody() 138 void exitCFGBlock(const CFGBlock *B) {} in exitCFGBlock() 141 void exitCFG(const CFGBlock *Last) {} in exitCFG() 182 SmallVector<CFGBlock*, 4> BackEdges; in walk() 451 void enterCFGBlock(const CFGBlock *B); 455 void enterCFGBlockBody(const CFGBlock *B); 458 void exitCFGBlockBody(const CFGBlock *B); 462 void exitCFGBlock(const CFGBlock *B); [all …]
|
| H A D | CFGReachabilityAnalysis.h | 24 class CFGBlock; variable 42 bool isReachable(const CFGBlock *Src, const CFGBlock *Dst); 45 void mapReachability(const CFGBlock *Dst);
|
| H A D | LiveVariables.h | 23 class CFGBlock; variable 62 const CFGBlock *currentBlock, in observeStmt() 78 bool isLive(const CFGBlock *B, const VarDecl *D);
|
| /freebsd-13.1/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | CFG.cpp | 584 std::pair<CFGBlock *, CFGBlock *> VisitLogicalOperator(BinaryOperator *B, 699 CFGBlock *NYS() { in NYS() 885 void addSuccessor(CFGBlock *B, CFGBlock *S, bool IsReachable = true) { in addSuccessor() 892 void addSuccessor(CFGBlock *B, CFGBlock *ReachableBlock, CFGBlock *AltBlock) { in addSuccessor() 2425 std::pair<CFGBlock*, CFGBlock*> 3517 CFGBlock * 4947 CFGBlock *Mem = getAllocator().Allocate<CFGBlock>(); in createBlock() 5077 CFGBlock::AdjacentBlock::AdjacentBlock(CFGBlock *B, bool IsReachable) in AdjacentBlock() 5082 CFGBlock::AdjacentBlock::AdjacentBlock(CFGBlock *B, CFGBlock *AlternateBlock) in AdjacentBlock() 5098 bool CFGBlock::FilterEdge(const CFGBlock::FilterOptions &F, in FilterEdge() [all …]
|
| H A D | ReachableCode.cpp | 88 const CFGBlock *Current = B; in isDeadReturn() 316 SmallVector<const CFGBlock*, 32> WL; in scanFromBlock() 329 const CFGBlock *item = WL.pop_back_val(); in scanFromBlock() 343 const CFGBlock *B = *I; in scanFromBlock() 389 SmallVector<const CFGBlock *, 10> WorkList; 404 void enqueue(const CFGBlock *block); 412 void reportDeadCode(const CFGBlock *B, 431 if (const CFGBlock *PredBlock = *I) { in isDeadCodeRoot() 505 if (const CFGBlock *predBlock = *I) in scanBackwards() 535 const CFGBlock *Block = I->first; in scanBackwards() [all …]
|
| H A D | CFGReachabilityAnalysis.cpp | 26 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 D | CFGStmtMap.cpp | 21 typedef llvm::DenseMap<const Stmt*, CFGBlock*> SMap; 26 CFGBlock *CFGStmtMap::getBlock(Stmt *S) { in getBlock() 35 CFGBlock *B = I->second; in getBlock() 48 static void Accumulate(SMap &SM, CFGBlock *B) { in Accumulate() 50 for (CFGBlock::iterator I = B->begin(), E = B->end(); I != E; ++I) { in Accumulate() 56 CFGBlock *&Entry = SM[CS->getStmt()]; in Accumulate()
|
| H A D | CalledOnceCheck.cpp | 512 clarify(const CFGBlock *Conditional, const CFGBlock *SuccWithoutCall) { in clarify() 598 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() 1322 State joinSuccessors(const CFGBlock *BB) const { in joinSuccessors() [all …]
|
| H A D | LiveVariables.cpp | 156 const CFGBlock *currentBlock; 161 const CFGBlock *CurrentBlock) in TransferFunctions() 457 LiveVariablesImpl::runOnBlock(const CFGBlock *block, in runOnBlock() 468 for (CFGBlock::const_reverse_iterator it = block->rbegin(), in runOnBlock() 521 for (const CFGBlock *B : cfg->nodes()) { in computeLiveness() 525 while (const CFGBlock *block = worklist.dequeue()) { in computeLiveness() 534 if (const CFGBlock *succ = *it) { in computeLiveness() 561 std::vector<const CFGBlock *> vec; in dumpBlockLiveness() 567 llvm::sort(vec, [](const CFGBlock *A, const CFGBlock *B) { in dumpBlockLiveness() 573 for (std::vector<const CFGBlock *>::iterator in dumpBlockLiveness() [all …]
|
| H A D | UninitializedValues.cpp | 132 ValueVector &getValueVector(const CFGBlock *block) { in getValueVector() 138 bool updateValueVectorWithScratch(const CFGBlock *block); 148 Value getValue(const CFGBlock *block, const CFGBlock *dstBlock, in getValue() 468 const CFGBlock *block; 557 SmallVector<const CFGBlock*, 32> Queue; in getUninitUse() 565 const CFGBlock *B = Queue.pop_back_val(); in getUninitUse() 573 const CFGBlock *Pred = *I; in getUninitUse() 644 const CFGBlock *Succ = *I; in getUninitUse() 845 const CFGBlock *pred = *I; in runOnBlock() 927 const CFGBlock &entry = cfg.getEntry(); in runUninitializedVariablesAnalysis() [all …]
|
| H A D | Consumed.cpp | 61 static SourceLocation getFirstStmtLoc(const CFGBlock *Block) { in getFirstStmtLoc() 76 static SourceLocation getLastStmtLoc(const CFGBlock *Block) { in getLastStmtLoc() 82 for (CFGBlock::const_reverse_iterator BI = Block->rbegin(), in getLastStmtLoc() 1018 const CFGBlock *Block, ConsumedStateMap *StateMap, in addInfo() 1032 void ConsumedBlockInfo::addInfo(const CFGBlock *Block, in addInfo() 1052 void ConsumedBlockInfo::discardInfo(const CFGBlock *Block) { in discardInfo() 1057 ConsumedBlockInfo::getInfo(const CFGBlock *Block) { in getInfo() 1065 bool ConsumedBlockInfo::isBackEdge(const CFGBlock *From, const CFGBlock *To) { in isBackEdge() 1081 for (CFGBlock::const_pred_iterator PI = Block->pred_begin(), in isBackEdgeTarget() 1228 bool ConsumedAnalyzer::splitState(const CFGBlock *CurrBlock, in splitState() [all …]
|
| /freebsd-13.1/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | CoreEngine.h | 210 const CFGBlock *Block; 432 const CFGBlock *DstT; 433 const CFGBlock *DstF; 443 const CFGBlock *dstT, const CFGBlock *dstF) in BranchNodeBuilder() 453 const CFGBlock *dstT, const CFGBlock *dstF) in BranchNodeBuilder() 480 const CFGBlock *Src; 481 const CFGBlock &DispatchBlock; 493 CFGBlock::const_succ_iterator I; 505 const CFGBlock *getBlock() const { in getBlock() 528 const CFGBlock *Src; [all …]
|
| H A D | WorkList.h | 23 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-13.1/contrib/llvm-project/clang/include/clang/Analysis/ |
| H A D | CFG.h | 576 class CFGBlock { 627 std::conditional_t<IsConst, const CFGBlock *, CFGBlock *>; 678 std::conditional_t<IsConst, const CFGBlock *, CFGBlock *>; 798 CFGBlock *ReachableBlock; 807 AdjacentBlock(CFGBlock *B, CFGBlock *AlternateBlock); 821 operator CFGBlock*() const { 990 const CFGBlock *Dst); 997 const CFGBlock *From; 1279 CFGBlock *createBlock(); 1442 CFGBlock *Entry = nullptr; [all …]
|
| H A D | ProgramPoint.h | 233 const CFGBlock *getBlock() const { in getBlock() 238 const CFGBlock *B = getBlock(); in getFirstElement() 252 BlockExit(const CFGBlock *B, const LocationContext *L) in BlockExit() 255 const CFGBlock *getBlock() const { in getBlock() 342 const CFGBlock *getBlock() const { in getBlock() 505 BlockEdge(const CFGBlock *B1, const CFGBlock *B2, const LocationContext *L) in BlockEdge() 511 const CFGBlock *getSrc() const { in getSrc() 512 return static_cast<const CFGBlock*>(getData1()); in getSrc() 515 const CFGBlock *getDst() const { in getDst() 516 return static_cast<const CFGBlock*>(getData2()); in getDst() [all …]
|
| H A D | AnalysisDeclContext.h | 127 const CFGBlock *getBlockForRegisteredExpression(const Stmt *stmt); 182 const Stmt *S, const CFGBlock *Blk, 302 const CFGBlock *Block; 313 const Stmt *S, const CFGBlock *Block, unsigned BlockCount, in StackFrameContext() 323 const CFGBlock *getCallSiteBlock() const { return Block; } in getCallSiteBlock() 335 const CFGBlock *Block, unsigned BlockCount, in Profile() 403 const Stmt *S, const CFGBlock *Block, 474 const Stmt *S, const CFGBlock *Block, in getStackFrame()
|
| H A D | CFGStmtMap.h | 41 CFGBlock *getBlock(Stmt * S); 43 const CFGBlock *getBlock(const Stmt * S) const { in getBlock()
|
| /freebsd-13.1/contrib/llvm-project/clang/include/clang/Analysis/FlowSensitive/ |
| H A D | DataflowWorklist.h | 25 llvm::PriorityQueue<const CFGBlock *, 26 SmallVector<const CFGBlock *, QueueSize>, Comp> 35 void enqueueBlock(const CFGBlock *Block) { in enqueueBlock() 42 const CFGBlock *dequeue() { in dequeue() 45 const CFGBlock *B = WorkList.top(); in dequeue() 54 bool operator()(const CFGBlock *lhs, const CFGBlock *rhs) const { in operator() 70 void enqueueSuccessors(const CFGBlock *Block) { in enqueueSuccessors() 86 void enqueuePredecessors(const CFGBlock *Block) { in enqueuePredecessors()
|
| H A D | DataflowValues.h | 52 typedef llvm::DenseMap<const CFGBlock*, ValTy> BlockDataMapTy; 101 ValTy& getBlockData(const CFGBlock *B) { in getBlockData() 107 const ValTy& getBlockData(const CFGBlock *B) const { in getBlockData()
|
| /freebsd-13.1/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | UnreachableCodeChecker.cpp | 39 static inline const Stmt *getUnreachableStmt(const CFGBlock *CB); 40 static void FindUnreachableEntryPoints(const CFGBlock *CB, 43 static bool isInvalidPath(const CFGBlock *CB, const ParentMap &PM); 44 static inline bool isEmptyCFGBlock(const CFGBlock *CB); 78 const CFGBlock *CB = BE->getBlock(); in checkEndAnalysis() 96 const CFGBlock *CB = *I; in checkEndAnalysis() 130 for (CFGBlock::const_iterator ci = CB->begin(), ce = CB->end(); in checkEndAnalysis() 178 void UnreachableCodeChecker::FindUnreachableEntryPoints(const CFGBlock *CB, in FindUnreachableEntryPoints() 218 bool UnreachableCodeChecker::isInvalidPath(const CFGBlock *CB, in isInvalidPath() 230 const CFGBlock *pred = *CB->pred_begin(); in isInvalidPath() [all …]
|
| H A D | AnalyzerStatsChecker.cpp | 45 llvm::SmallPtrSet<const CFGBlock*, 32> reachable; in checkEndAnalysis() 63 const CFGBlock *CB = BE->getBlock(); in checkEndAnalysis() 75 const CFGBlock *CB = *I; in checkEndAnalysis() 123 const CFGBlock *Exit = BE.getDst(); in checkEndAnalysis()
|
| /freebsd-13.1/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
| H A D | CoreEngine.cpp | 84 const CFGBlock *Entry = &(L->getCFG()->getEntry()); in ExecuteWorkList() 96 const CFGBlock *Succ = *(Entry->succ_begin()); in ExecuteWorkList() 209 const CFGBlock *Blk = L.getDst(); in HandleBlockEdge() 332 for (CFGBlock::const_succ_iterator it = B->succ_begin(), in HandleBlockExit() 334 if (const CFGBlock *succ = *it) { in HandleBlockExit() 437 const CFGBlock *B, in HandleCleanupTemporaryBranch() 459 void CoreEngine::HandlePostStmt(const CFGBlock *B, unsigned StmtIdx, in HandlePostStmt() 472 void CoreEngine::HandleVirtualBaseBranch(const CFGBlock *B, in HandleVirtualBaseBranch() 515 const CFGBlock *Block, unsigned Idx) { in enqueueStmtNode() 584 const CFGBlock *Block, unsigned Idx) { in enqueue() [all …]
|