blob: 219fc28595e53b1a935343ddb68ad897fda0f986 [file] [log] [blame]
Tom Care52d861c2010-09-10 00:44:44 +00001//==--AnalyzerStatsChecker.cpp - Analyzer visitation statistics --*- C++ -*-==//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9// This file reports various statistics about analyzer visitation.
10//===----------------------------------------------------------------------===//
Anna Zaks749bbe62012-03-22 21:06:03 +000011#define DEBUG_TYPE "StatsChecker"
Tom Care52d861c2010-09-10 00:44:44 +000012
Argyrios Kyrtzidis58f2e7c2011-02-28 01:26:50 +000013#include "ClangSACheckers.h"
Argyrios Kyrtzidisec8605f2011-03-01 01:16:21 +000014#include "clang/StaticAnalyzer/Core/Checker.h"
Argyrios Kyrtzidis58f2e7c2011-02-28 01:26:50 +000015#include "clang/StaticAnalyzer/Core/CheckerManager.h"
Ted Kremenek9b663712011-02-10 01:03:03 +000016#include "clang/StaticAnalyzer/Core/PathSensitive/ExplodedGraph.h"
Argyrios Kyrtzidis58f2e7c2011-02-28 01:26:50 +000017#include "clang/StaticAnalyzer/Core/PathSensitive/ExprEngine.h"
Ted Kremenek9b663712011-02-10 01:03:03 +000018#include "clang/StaticAnalyzer/Core/BugReporter/BugReporter.h"
Argyrios Kyrtzidisa7af5ea2010-12-22 18:52:56 +000019
Benjamin Kramerc35fb7d2012-01-28 12:06:22 +000020#include "clang/AST/DeclObjC.h"
Tom Care52d861c2010-09-10 00:44:44 +000021#include "clang/Basic/SourceManager.h"
22#include "llvm/ADT/SmallPtrSet.h"
Benjamin Kramer8fe83e12012-02-04 13:45:25 +000023#include "llvm/ADT/SmallString.h"
Anna Zaks749bbe62012-03-22 21:06:03 +000024#include "llvm/ADT/Statistic.h"
Tom Care52d861c2010-09-10 00:44:44 +000025
26using namespace clang;
Ted Kremenek9ef65372010-12-23 07:20:52 +000027using namespace ento;
Tom Care52d861c2010-09-10 00:44:44 +000028
Anna Zaks749bbe62012-03-22 21:06:03 +000029STATISTIC(NumBlocks,
30 "The # of blocks in top level functions");
31STATISTIC(NumBlocksUnreachable,
32 "The # of unreachable blocks in analyzing top level functions");
33
Tom Care52d861c2010-09-10 00:44:44 +000034namespace {
Argyrios Kyrtzidisec8605f2011-03-01 01:16:21 +000035class AnalyzerStatsChecker : public Checker<check::EndAnalysis> {
Tom Care52d861c2010-09-10 00:44:44 +000036public:
Argyrios Kyrtzidis58f2e7c2011-02-28 01:26:50 +000037 void checkEndAnalysis(ExplodedGraph &G, BugReporter &B,ExprEngine &Eng) const;
Tom Care52d861c2010-09-10 00:44:44 +000038};
39}
40
Argyrios Kyrtzidis58f2e7c2011-02-28 01:26:50 +000041void AnalyzerStatsChecker::checkEndAnalysis(ExplodedGraph &G,
Tom Care52d861c2010-09-10 00:44:44 +000042 BugReporter &B,
Argyrios Kyrtzidis58f2e7c2011-02-28 01:26:50 +000043 ExprEngine &Eng) const {
Tom Care52d861c2010-09-10 00:44:44 +000044 const CFG *C = 0;
45 const Decl *D = 0;
Tom Care52d861c2010-09-10 00:44:44 +000046 const SourceManager &SM = B.getSourceManager();
Argyrios Kyrtzidis58f2e7c2011-02-28 01:26:50 +000047 llvm::SmallPtrSet<const CFGBlock*, 256> reachable;
Tom Care52d861c2010-09-10 00:44:44 +000048
Anna Zaks64394e22012-03-22 21:05:57 +000049 // Root node should have the location context of the top most function.
50 const ExplodedNode *GraphRoot = *G.roots_begin();
Anna Zaks65552ca2012-03-27 20:02:44 +000051 const LocationContext *LC =
52 GraphRoot->getLocation().getLocationContext()->getCurrentStackFrame();
Anna Zaks64394e22012-03-22 21:05:57 +000053
54 // Iterate over the exploded graph.
Tom Care52d861c2010-09-10 00:44:44 +000055 for (ExplodedGraph::node_iterator I = G.nodes_begin();
56 I != G.nodes_end(); ++I) {
57 const ProgramPoint &P = I->getLocation();
Anna Zaks64394e22012-03-22 21:05:57 +000058
59 // Only check the coverage in the top level function.
Anna Zaks65552ca2012-03-27 20:02:44 +000060 if (LC != P.getLocationContext()->getCurrentStackFrame())
Anna Zaks64394e22012-03-22 21:05:57 +000061 continue;
Tom Care52d861c2010-09-10 00:44:44 +000062
Tom Care2cb55202010-09-29 23:48:34 +000063 if (const BlockEntrance *BE = dyn_cast<BlockEntrance>(&P)) {
64 const CFGBlock *CB = BE->getBlock();
Tom Care52d861c2010-09-10 00:44:44 +000065 reachable.insert(CB);
66 }
67 }
68
69 // Get the CFG and the Decl of this block
70 C = LC->getCFG();
Ted Kremenek1d26f482011-10-24 01:32:45 +000071 D = LC->getAnalysisDeclContext()->getDecl();
Tom Care52d861c2010-09-10 00:44:44 +000072
73 unsigned total = 0, unreachable = 0;
74
75 // Find CFGBlocks that were not covered by any node
76 for (CFG::const_iterator I = C->begin(); I != C->end(); ++I) {
77 const CFGBlock *CB = *I;
78 ++total;
79 // Check if the block is unreachable
80 if (!reachable.count(CB)) {
81 ++unreachable;
82 }
83 }
84
85 // We never 'reach' the entry block, so correct the unreachable count
86 unreachable--;
Anna Zaks64394e22012-03-22 21:05:57 +000087 // There is no BlockEntrance corresponding to the exit block as well, so
88 // assume it is reached as well.
89 unreachable--;
Tom Care52d861c2010-09-10 00:44:44 +000090
91 // Generate the warning string
Dylan Noblesmithf7ccbad2012-02-05 02:13:05 +000092 SmallString<128> buf;
Tom Care52d861c2010-09-10 00:44:44 +000093 llvm::raw_svector_ostream output(buf);
94 PresumedLoc Loc = SM.getPresumedLoc(D->getLocation());
Anna Zaks65552ca2012-03-27 20:02:44 +000095 if (!Loc.isValid())
96 return;
Tom Care52d861c2010-09-10 00:44:44 +000097
Anna Zaks65552ca2012-03-27 20:02:44 +000098 if (isa<FunctionDecl>(D) || isa<ObjCMethodDecl>(D)) {
99 const NamedDecl *ND = cast<NamedDecl>(D);
100 output << *ND;
101 }
102 else if (isa<BlockDecl>(D)) {
103 output << "block(line:" << Loc.getLine() << ":col:" << Loc.getColumn();
Tom Care52d861c2010-09-10 00:44:44 +0000104 }
Douglas Gregorcb7b1e12010-11-12 07:15:47 +0000105
Anna Zaks749bbe62012-03-22 21:06:03 +0000106 NumBlocksUnreachable += unreachable;
107 NumBlocks += total;
Anna Zaks65552ca2012-03-27 20:02:44 +0000108 std::string NameOfRootFunction = output.str();
Anna Zaks749bbe62012-03-22 21:06:03 +0000109
Tom Care52d861c2010-09-10 00:44:44 +0000110 output << " -> Total CFGBlocks: " << total << " | Unreachable CFGBlocks: "
Ted Kremenek422ab7a2011-04-02 02:56:23 +0000111 << unreachable << " | Exhausted Block: "
112 << (Eng.wasBlocksExhausted() ? "yes" : "no")
Tom Care52d861c2010-09-10 00:44:44 +0000113 << " | Empty WorkList: "
Tom Care0e1cd942010-09-22 21:07:51 +0000114 << (Eng.hasEmptyWorkList() ? "yes" : "no");
Tom Care52d861c2010-09-10 00:44:44 +0000115
116 B.EmitBasicReport("Analyzer Statistics", "Internal Statistics", output.str(),
Anna Zaks590dd8e2011-09-20 21:38:35 +0000117 PathDiagnosticLocation(D, SM));
Tom Care2cb55202010-09-29 23:48:34 +0000118
Anna Zaks65552ca2012-03-27 20:02:44 +0000119 // Emit warning for each block we bailed out on.
Ted Kremenek422ab7a2011-04-02 02:56:23 +0000120 typedef CoreEngine::BlocksExhausted::const_iterator ExhaustedIterator;
Argyrios Kyrtzidisd2592a32010-12-22 18:53:44 +0000121 const CoreEngine &CE = Eng.getCoreEngine();
Ted Kremenek422ab7a2011-04-02 02:56:23 +0000122 for (ExhaustedIterator I = CE.blocks_exhausted_begin(),
123 E = CE.blocks_exhausted_end(); I != E; ++I) {
Tom Care2cb55202010-09-29 23:48:34 +0000124 const BlockEdge &BE = I->first;
125 const CFGBlock *Exit = BE.getDst();
126 const CFGElement &CE = Exit->front();
Anna Zaks65552ca2012-03-27 20:02:44 +0000127 if (const CFGStmt *CS = dyn_cast<CFGStmt>(&CE)) {
128 SmallString<128> bufI;
129 llvm::raw_svector_ostream outputI(bufI);
130 outputI << "(" << NameOfRootFunction << ")" <<
131 ": The analyzer generated a sink at this point";
132 B.EmitBasicReport("Sink Point", "Internal Statistics", outputI.str(),
Anna Zaks590dd8e2011-09-20 21:38:35 +0000133 PathDiagnosticLocation::createBegin(CS->getStmt(), SM, LC));
Anna Zaks65552ca2012-03-27 20:02:44 +0000134 }
Tom Care2cb55202010-09-29 23:48:34 +0000135 }
Tom Care52d861c2010-09-10 00:44:44 +0000136}
Argyrios Kyrtzidis58f2e7c2011-02-28 01:26:50 +0000137
138void ento::registerAnalyzerStatsChecker(CheckerManager &mgr) {
139 mgr.registerChecker<AnalyzerStatsChecker>();
140}