| /external/clang/include/clang/Analysis/Analyses/ |
| CFGReachabilityAnalysis.h | 25 class CFGBlock;
41 bool isReachable(const CFGBlock *Src, const CFGBlock *Dst);
44 void mapReachability(const CFGBlock *Dst);
|
| PostOrderCFGView.h | 43 struct iterator { typedef const CFGBlock *value_type; };
48 /// \brief Set the bit associated with a particular CFGBlock.
50 bool insert(const CFGBlock *Block) {
52 // make sure that Block is non-null. Moreover, the CFGBlock iterator will
63 /// \brief Check if the bit for a CFGBlock has been already set.
66 bool alreadySet(const CFGBlock *Block) {
73 std::vector<const CFGBlock*> Blocks;
75 typedef llvm::DenseMap<const CFGBlock *, unsigned> BlockOrderTy;
79 typedef std::vector<const CFGBlock *>::reverse_iterator iterator;
80 typedef std::vector<const CFGBlock *>::const_reverse_iterator const_iterator
[all...] |
| Dominators.h | 32 class CFGBlock;
33 typedef llvm::DomTreeNodeBase<CFGBlock> DomTreeNode;
41 llvm::DominatorTreeBase<CFGBlock>* DT;
44 DT = new llvm::DominatorTreeBase<CFGBlock>(false);
51 llvm::DominatorTreeBase<CFGBlock>& getBase() { return *DT; }
53 /// \brief This method returns the root CFGBlock of the dominators tree.
55 inline CFGBlock *getRoot() const {
60 /// for CFGBlock.
107 /// \brief This method tests if one CFGBlock dominates the other.
111 inline bool dominates(const CFGBlock* A, const CFGBlock* B) const
[all...] |
| Consumed.h | 167 void intersectAtLoopHead(const CFGBlock *LoopHead, const CFGBlock *LoopBack,
215 bool allBackEdgesVisited(const CFGBlock *CurrBlock,
216 const CFGBlock *TargetBlock);
218 void addInfo(const CFGBlock *Block, ConsumedStateMap *StateMap,
220 void addInfo(const CFGBlock *Block, ConsumedStateMap *StateMap);
222 ConsumedStateMap* borrowInfo(const CFGBlock *Block);
224 void discardInfo(const CFGBlock *Block);
226 ConsumedStateMap* getInfo(const CFGBlock *Block);
228 bool isBackEdge(const CFGBlock *From, const CFGBlock *To)
[all...] |
| ReachableCode.h | 29 class CFGBlock;
61 unsigned ScanReachableFromBlock(const CFGBlock *Start,
|
| ThreadSafetyCommon.h | 42 void enterCFG(CFG *Cfg, const NamedDecl *D, const CFGBlock *First) {}
44 // Enter a CFGBlock.
45 void enterCFGBlock(const CFGBlock *B) {}
51 void handlePredecessor(const CFGBlock *Pred) {}
54 void handlePredecessorBackEdge(const CFGBlock *Pred) {}
57 void enterCFGBlockBody(const CFGBlock *B) {}
66 void exitCFGBlockBody(const CFGBlock *B) {}
72 void handleSuccessor(const CFGBlock *Succ) {}
75 void handleSuccessorBackEdge(const CFGBlock *Succ) {}
77 // Leave a CFGBlock
[all...] |
| LiveVariables.h | 25 class CFGBlock;
63 const CFGBlock *currentBlock,
80 bool isLive(const CFGBlock *B, const VarDecl *D);
|
| /external/clang/include/clang/Analysis/ |
| CFGStmtMap.h | 1 //===--- CFGStmtMap.h - Map from Stmt* to CFGBlock* -----------*- C++ -*-===//
11 // Stmt* to CFGBlock*
23 class CFGBlock;
40 /// Returns the CFGBlock the specified Stmt* appears in. For Stmt* that
41 /// are terminators, the CFGBlock is the block they appear as a terminator,
43 /// CaseStmts and LabelStmts map to the CFGBlock they label.
44 CFGBlock *getBlock(Stmt * S);
46 const CFGBlock *getBlock(const Stmt * S) const {
|
| CFG.h | 298 /// CFGTerminator - Represents CFGBlock terminator statement.
328 /// CFGBlock - Represents a single basic block in a source-level CFG.
354 class CFGBlock {
412 /// BlockID - A numerical ID assigned to a CFGBlock during construction
429 CFGBlock *ReachableBlock;
430 llvm::PointerIntPair<CFGBlock*, 2> UnreachableBlock;
434 AdjacentBlock(CFGBlock *B, bool IsReachable);
438 AdjacentBlock(CFGBlock *B, CFGBlock *AlternateBlock);
441 CFGBlock *getReachableBlock() const
[all...] |
| AnalysisContext.h | 129 const CFGBlock *getBlockForRegisteredExpression(const Stmt *stmt);
176 const CFGBlock *Blk,
270 const CFGBlock *Block;
272 // The index of the callsite in the CFGBlock.
277 const Stmt *s, const CFGBlock *blk,
287 const CFGBlock *getCallSiteBlock() const { return Block; }
298 const CFGBlock *blk, unsigned idx) {
374 const CFGBlock *blk, unsigned idx);
434 const CFGBlock *Blk,
449 const CFGBlock *Blk
[all...] |
| ProgramPoint.h | 195 BlockEntrance(const CFGBlock *B, const LocationContext *L,
201 const CFGBlock *getBlock() const {
202 return reinterpret_cast<const CFGBlock*>(getData1());
206 const CFGBlock *B = getBlock();
220 BlockExit(const CFGBlock *B, const LocationContext *L)
223 const CFGBlock *getBlock() const {
224 return reinterpret_cast<const CFGBlock*>(getData1());
450 BlockEdge(const CFGBlock *B1, const CFGBlock *B2, const LocationContext *L)
456 const CFGBlock *getSrc() const
[all...] |
| /external/clang/lib/Analysis/ |
| CFGReachabilityAnalysis.cpp | 25 bool CFGReverseBlockReachabilityAnalysis::isReachable(const CFGBlock *Src,
26 const CFGBlock *Dst) {
42 void CFGReverseBlockReachabilityAnalysis::mapReachability(const CFGBlock *Dst) {
43 SmallVector<const CFGBlock *, 11> worklist;
55 const CFGBlock *block = worklist.pop_back_val();
70 for (CFGBlock::const_pred_iterator i = block->pred_begin(),
|
| CFGStmtMap.cpp | 1 //===--- CFGStmtMap.h - Map from Stmt* to CFGBlock* -----------*- C++ -*-===//
11 // Stmt* to CFGBlock*
22 typedef llvm::DenseMap<const Stmt*, CFGBlock*> SMap;
27 CFGBlock *CFGStmtMap::getBlock(Stmt *S) {
36 CFGBlock *B = I->second;
49 static void Accumulate(SMap &SM, CFGBlock *B) {
51 for (CFGBlock::iterator I = B->begin(), E = B->end(); I != E; ++I) {
57 CFGBlock *&Entry = SM[CS->getStmt()];
|
| CFG.cpp | 88 /// - For every normal (without jump) end of scope add to CFGBlock destructors
90 /// - For every jump add to CFGBlock destructors for objects
207 /// build process. It consists of CFGBlock that specifies position in CFG graph
211 BlockScopePosPair(CFGBlock *b, LocalScope::const_iterator scopePos)
214 CFGBlock *block;
296 CFGBlock *Block;
297 CFGBlock *Succ;
300 CFGBlock *SwitchTerminatedBlock;
301 CFGBlock *DefaultCaseBlock;
302 CFGBlock *TryTerminatedBlock
[all...] |
| ReachableCode.cpp | 49 static bool isTrivialDoWhile(const CFGBlock *B, const Stmt *S) {
61 static bool isDeadReturn(const CFGBlock *B, const Stmt *S) {
65 const CFGBlock *Current = B;
67 for (CFGBlock::const_reverse_iterator I = Current->rbegin(),
252 static bool shouldTreatSuccessorsAsReachable(const CFGBlock *B,
267 static unsigned scanFromBlock(const CFGBlock *Start,
274 SmallVector<const CFGBlock*, 32> WL;
287 const CFGBlock *item = WL.pop_back_val();
299 for (CFGBlock::const_succ_iterator I = item->succ_begin(),
301 const CFGBlock *B = *I
[all...] |
| LiveVariables.cpp | 31 SmallVector<const CFGBlock *, 20> worklist;
39 void enqueueBlock(const CFGBlock *block);
40 void enqueuePredecessors(const CFGBlock *block);
42 const CFGBlock *dequeue();
49 void DataflowWorklist::enqueueBlock(const clang::CFGBlock *block) {
56 void DataflowWorklist::enqueuePredecessors(const clang::CFGBlock *block) {
58 for (CFGBlock::const_pred_iterator I = block->pred_begin(),
73 const CFGBlock *DataflowWorklist::dequeue() {
76 const CFGBlock *b = worklist.pop_back_val();
88 llvm::DenseMap<const CFGBlock *, LiveVariables::LivenessValues> blocksEndToLiveness
[all...] |
| PostOrderCFGView.cpp | 40 bool PostOrderCFGView::BlockOrderCompare::operator()(const CFGBlock *b1,
41 const CFGBlock *b2) const {
|
| UninitializedValues.cpp | 117 ValueVector &getValueVector(const CFGBlock *block) {
123 bool updateValueVectorWithScratch(const CFGBlock *block);
133 Value getValue(const CFGBlock *block, const CFGBlock *dstBlock,
157 static void printVector(const CFGBlock *block, ValueVector &bv,
180 bool CFGBlockValues::updateValueVectorWithScratch(const CFGBlock *block) {
208 SmallVector<const CFGBlock *, 20> worklist;
222 void enqueueSuccessors(const CFGBlock *block);
223 const CFGBlock *dequeue();
227 void DataflowWorklist::enqueueSuccessors(const clang::CFGBlock *block)
[all...] |
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| WorkList.h | 24 class CFGBlock;
31 const CFGBlock *block;
36 const CFGBlock *B, unsigned idx)
54 /// Returns the CFGblock associated with the worklist unit.
55 const CFGBlock *getBlock() const { return block; }
57 /// Return the index within the CFGBlock for the worklist unit.
69 void enqueue(ExplodedNode *N, const CFGBlock *B, unsigned idx) {
|
| CoreEngine.h | 55 typedef std::vector<std::pair<const CFGBlock*, const ExplodedNode*> >
93 void HandleBlockExit(const CFGBlock *B, ExplodedNode *Pred);
94 void HandlePostStmt(const CFGBlock *B, unsigned StmtIdx, ExplodedNode *Pred);
96 void HandleBranch(const Stmt *Cond, const Stmt *Term, const CFGBlock *B,
100 void HandleStaticInit(const DeclStmt *DS, const CFGBlock *B,
149 void addAbortedBlock(const ExplodedNode *node, const CFGBlock *block) {
173 void enqueue(ExplodedNodeSet &Set, const CFGBlock *Block, unsigned Idx);
180 void enqueueStmtNode(ExplodedNode *N, const CFGBlock *Block, unsigned Idx);
186 const CFGBlock *Block;
188 NodeBuilderContext(const CoreEngine &E, const CFGBlock *B, ExplodedNode *N
[all...] |
| SubEngine.h | 22 class CFGBlock;
59 /// Called by CoreEngine when it starts processing a CFGBlock. The
72 const CFGBlock *DstT,
73 const CFGBlock *DstF) = 0;
81 const CFGBlock *DstT,
82 const CFGBlock *DstF) = 0;
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| UnreachableCodeChecker.cpp | 29 // The number of CFGBlock pointers we want to reserve memory for. This is used
44 static inline const Stmt *getUnreachableStmt(const CFGBlock *CB);
45 static void FindUnreachableEntryPoints(const CFGBlock *CB,
48 static bool isInvalidPath(const CFGBlock *CB, const ParentMap &PM);
49 static inline bool isEmptyCFGBlock(const CFGBlock *CB);
83 const CFGBlock *CB = BE->getBlock();
101 const CFGBlock *CB = *I;
135 for (CFGBlock::const_iterator ci = CB->begin(), ce = CB->end();
173 // Recursively finds the entry point(s) for this dead CFGBlock.
174 void UnreachableCodeChecker::FindUnreachableEntryPoints(const CFGBlock *CB
[all...] |
| AnalyzerStatsChecker.cpp | 46 llvm::SmallPtrSet<const CFGBlock*, 256> reachable;
64 const CFGBlock *CB = BE->getBlock();
76 const CFGBlock *CB = *I;
124 const CFGBlock *Exit = BE.getDst();
|
| /external/clang/include/clang/Analysis/FlowSensitive/ |
| DataflowValues.h | 52 typedef llvm::DenseMap<const CFGBlock*, ValTy> BlockDataMapTy;
98 /// specified CFGBlock. If the dataflow analysis is a forward analysis,
101 ValTy& getBlockData(const CFGBlock *B) {
107 const ValTy& getBlockData(const CFGBlock *B) const {
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| CoreEngine.cpp | 170 const CFGBlock *Entry = &(L->getCFG()->getEntry());
184 const CFGBlock *Succ = *(Entry->succ_begin());
285 const CFGBlock *Blk = L.getDst();
307 // Call into the SubEngine to process entering the CFGBlock.
342 void CoreEngine::HandleBlockExit(const CFGBlock * B, ExplodedNode *Pred) {
374 for (CFGBlock::const_succ_iterator it = B->succ_begin(),
376 if (const CFGBlock *succ = *it) {
454 const CFGBlock * B, ExplodedNode *Pred) {
465 void CoreEngine::HandleStaticInit(const DeclStmt *DS, const CFGBlock *B,
477 void CoreEngine::HandlePostStmt(const CFGBlock *B, unsigned StmtIdx,
[all...] |
