/Users/buildslave/jenkins/workspace/coverage/llvm-project/clang/lib/Analysis/CFGStmtMap.cpp
Line | Count | Source (jump to first uncovered line) |
1 | | //===--- CFGStmtMap.h - Map from Stmt* to CFGBlock* -----------*- C++ -*-===// |
2 | | // |
3 | | // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
4 | | // See https://llvm.org/LICENSE.txt for license information. |
5 | | // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
6 | | // |
7 | | //===----------------------------------------------------------------------===// |
8 | | // |
9 | | // This file defines the CFGStmtMap class, which defines a mapping from |
10 | | // Stmt* to CFGBlock* |
11 | | // |
12 | | //===----------------------------------------------------------------------===// |
13 | | |
14 | | #include "llvm/ADT/DenseMap.h" |
15 | | #include "clang/AST/ParentMap.h" |
16 | | #include "clang/Analysis/CFG.h" |
17 | | #include "clang/Analysis/CFGStmtMap.h" |
18 | | |
19 | | using namespace clang; |
20 | | |
21 | | typedef llvm::DenseMap<const Stmt*, CFGBlock*> SMap; |
22 | 177k | static SMap *AsMap(void *m) { return (SMap*) m; } |
23 | | |
24 | 4.13k | CFGStmtMap::~CFGStmtMap() { delete AsMap(M); } |
25 | | |
26 | 173k | CFGBlock *CFGStmtMap::getBlock(Stmt *S) { |
27 | 173k | SMap *SM = AsMap(M); |
28 | 173k | Stmt *X = S; |
29 | | |
30 | | // If 'S' isn't in the map, walk the ParentMap to see if one of its ancestors |
31 | | // is in the map. |
32 | 173k | while (X) { |
33 | 173k | SMap::iterator I = SM->find(X); |
34 | 173k | if (I != SM->end()) { |
35 | 172k | CFGBlock *B = I->second; |
36 | | // Memoize this lookup. |
37 | 172k | if (X != S) |
38 | 0 | (*SM)[X] = B; |
39 | 172k | return B; |
40 | 172k | } |
41 | | |
42 | 333 | X = PM->getParentIgnoreParens(X); |
43 | 333 | } |
44 | | |
45 | 333 | return nullptr; |
46 | 173k | } |
47 | | |
48 | 17.1k | static void Accumulate(SMap &SM, CFGBlock *B) { |
49 | | // First walk the block-level expressions. |
50 | 115k | for (CFGBlock::iterator I = B->begin(), E = B->end(); I != E; ++I98.2k ) { |
51 | 98.2k | const CFGElement &CE = *I; |
52 | 98.2k | Optional<CFGStmt> CS = CE.getAs<CFGStmt>(); |
53 | 98.2k | if (!CS) |
54 | 884 | continue; |
55 | | |
56 | 97.3k | CFGBlock *&Entry = SM[CS->getStmt()]; |
57 | | // If 'Entry' is already initialized (e.g., a terminator was already), |
58 | | // skip. |
59 | 97.3k | if (Entry) |
60 | 261 | continue; |
61 | | |
62 | 97.0k | Entry = B; |
63 | | |
64 | 97.0k | } |
65 | | |
66 | | // Look at the label of the block. |
67 | 17.1k | if (Stmt *Label = B->getLabel()) |
68 | 122 | SM[Label] = B; |
69 | | |
70 | | // Finally, look at the terminator. If the terminator was already added |
71 | | // because it is a block-level expression in another block, overwrite |
72 | | // that mapping. |
73 | 17.1k | if (Stmt *Term = B->getTerminatorStmt()) |
74 | 2.50k | SM[Term] = B; |
75 | 17.1k | } |
76 | | |
77 | 4.13k | CFGStmtMap *CFGStmtMap::Build(CFG *C, ParentMap *PM) { |
78 | 4.13k | if (!C || !PM) |
79 | 0 | return nullptr; |
80 | | |
81 | 4.13k | SMap *SM = new SMap(); |
82 | | |
83 | | // Walk all blocks, accumulating the block-level expressions, labels, |
84 | | // and terminators. |
85 | 21.2k | for (CFG::iterator I = C->begin(), E = C->end(); I != E; ++I17.1k ) |
86 | 17.1k | Accumulate(*SM, *I); |
87 | | |
88 | 4.13k | return new CFGStmtMap(PM, SM); |
89 | 4.13k | } |
90 | | |