Previously the class `ExplodedGraph` had a data member called `Roots` which could (in theory) store multiple root nodes -- but in practice exploded graphs always had at most one root node (zero was possible for empty and partially copied graphs) and introducing a graph with multiple roots would've caused severe malfuncitons (e.g. in code that used the pattern `*roots_begin()` to refer to _the_ root node). I don't see any practical use case for adding multiple root nodes in a single graph (this seems to be yet another of the "generalize for the sake of generalization" decisions which were common in the early history of the analyzer), so this commit replaces the vector `Roots` with `ExplodedNode *Root` (which may be null when the graph is empty or under construction). Note that the complicated logic of `ExplodedGraph::trim` deserves a through cleanup, but I left that for a follow-up commit.
140 lines
4.8 KiB
C++
140 lines
4.8 KiB
C++
//==--AnalyzerStatsChecker.cpp - Analyzer visitation statistics --*- C++ -*-==//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
// This file reports various statistics about analyzer visitation.
|
|
//===----------------------------------------------------------------------===//
|
|
#include "clang/AST/DeclObjC.h"
|
|
#include "clang/Basic/SourceManager.h"
|
|
#include "clang/StaticAnalyzer/Checkers/BuiltinCheckerRegistration.h"
|
|
#include "clang/StaticAnalyzer/Core/BugReporter/BugReporter.h"
|
|
#include "clang/StaticAnalyzer/Core/Checker.h"
|
|
#include "clang/StaticAnalyzer/Core/CheckerManager.h"
|
|
#include "clang/StaticAnalyzer/Core/PathSensitive/EntryPointStats.h"
|
|
#include "clang/StaticAnalyzer/Core/PathSensitive/ExplodedGraph.h"
|
|
#include "clang/StaticAnalyzer/Core/PathSensitive/ExprEngine.h"
|
|
#include "llvm/ADT/STLExtras.h"
|
|
#include "llvm/ADT/SmallPtrSet.h"
|
|
#include "llvm/ADT/SmallString.h"
|
|
#include "llvm/Support/raw_ostream.h"
|
|
#include <optional>
|
|
|
|
using namespace clang;
|
|
using namespace ento;
|
|
|
|
#define DEBUG_TYPE "StatsChecker"
|
|
|
|
STAT_COUNTER(NumBlocks, "The # of blocks in top level functions");
|
|
STAT_COUNTER(NumBlocksUnreachable,
|
|
"The # of unreachable blocks in analyzing top level functions");
|
|
|
|
namespace {
|
|
class AnalyzerStatsChecker : public Checker<check::EndAnalysis> {
|
|
public:
|
|
void checkEndAnalysis(ExplodedGraph &G, BugReporter &B,ExprEngine &Eng) const;
|
|
};
|
|
}
|
|
|
|
void AnalyzerStatsChecker::checkEndAnalysis(ExplodedGraph &G,
|
|
BugReporter &B,
|
|
ExprEngine &Eng) const {
|
|
const CFG *C = nullptr;
|
|
const SourceManager &SM = B.getSourceManager();
|
|
llvm::SmallPtrSet<const CFGBlock*, 32> reachable;
|
|
|
|
const LocationContext *LC = Eng.getRootLocationContext();
|
|
|
|
const Decl *D = LC->getDecl();
|
|
|
|
// Iterate over the exploded graph.
|
|
for (const ExplodedNode &N : G.nodes()) {
|
|
const ProgramPoint &P = N.getLocation();
|
|
|
|
// Only check the coverage in the top level function (optimization).
|
|
if (D != P.getLocationContext()->getDecl())
|
|
continue;
|
|
|
|
if (std::optional<BlockEntrance> BE = P.getAs<BlockEntrance>()) {
|
|
const CFGBlock *CB = BE->getBlock();
|
|
reachable.insert(CB);
|
|
}
|
|
}
|
|
|
|
// Get the CFG and the Decl of this block.
|
|
C = LC->getCFG();
|
|
|
|
unsigned total = 0, unreachable = 0;
|
|
|
|
// Find CFGBlocks that were not covered by any node
|
|
for (CFG::const_iterator I = C->begin(); I != C->end(); ++I) {
|
|
const CFGBlock *CB = *I;
|
|
++total;
|
|
// Check if the block is unreachable
|
|
if (!reachable.count(CB)) {
|
|
++unreachable;
|
|
}
|
|
}
|
|
|
|
// We never 'reach' the entry block, so correct the unreachable count
|
|
unreachable--;
|
|
// There is no BlockEntrance corresponding to the exit block as well, so
|
|
// assume it is reached as well.
|
|
unreachable--;
|
|
|
|
// Generate the warning string
|
|
SmallString<128> buf;
|
|
llvm::raw_svector_ostream output(buf);
|
|
PresumedLoc Loc = SM.getPresumedLoc(D->getLocation());
|
|
if (!Loc.isValid())
|
|
return;
|
|
|
|
if (isa<FunctionDecl, ObjCMethodDecl>(D)) {
|
|
const NamedDecl *ND = cast<NamedDecl>(D);
|
|
output << *ND;
|
|
} else if (isa<BlockDecl>(D)) {
|
|
output << "block(line:" << Loc.getLine() << ":col:" << Loc.getColumn();
|
|
}
|
|
|
|
NumBlocksUnreachable += unreachable;
|
|
NumBlocks += total;
|
|
std::string NameOfRootFunction = std::string(output.str());
|
|
|
|
output << " -> Total CFGBlocks: " << total << " | Unreachable CFGBlocks: "
|
|
<< unreachable << " | Exhausted Block: "
|
|
<< (Eng.wasBlocksExhausted() ? "yes" : "no")
|
|
<< " | Empty WorkList: "
|
|
<< (Eng.hasEmptyWorkList() ? "yes" : "no");
|
|
|
|
B.EmitBasicReport(D, this, "Analyzer Statistics", "Internal Statistics",
|
|
output.str(), PathDiagnosticLocation(D, SM));
|
|
|
|
// Emit warning for each block we bailed out on.
|
|
const CoreEngine &CE = Eng.getCoreEngine();
|
|
for (const BlockEdge &BE : make_first_range(CE.exhausted_blocks())) {
|
|
const CFGBlock *Exit = BE.getDst();
|
|
if (Exit->empty())
|
|
continue;
|
|
const CFGElement &CE = Exit->front();
|
|
if (std::optional<CFGStmt> CS = CE.getAs<CFGStmt>()) {
|
|
SmallString<128> bufI;
|
|
llvm::raw_svector_ostream outputI(bufI);
|
|
outputI << "(" << NameOfRootFunction << ")" <<
|
|
": The analyzer generated a sink at this point";
|
|
B.EmitBasicReport(
|
|
D, this, "Sink Point", "Internal Statistics", outputI.str(),
|
|
PathDiagnosticLocation::createBegin(CS->getStmt(), SM, LC));
|
|
}
|
|
}
|
|
}
|
|
|
|
void ento::registerAnalyzerStatsChecker(CheckerManager &mgr) {
|
|
mgr.registerChecker<AnalyzerStatsChecker>();
|
|
}
|
|
|
|
bool ento::shouldRegisterAnalyzerStatsChecker(const CheckerManager &mgr) {
|
|
return true;
|
|
}
|