[analyzer] Record the basic blocks covered by the analyzes run.

Store this info inside the function summary generated for all analyzed
functions. This is useful for coverage stats and can be helpful for
analyzer state space search strategies.

llvm-svn: 153923
This commit is contained in:
Anna Zaks 2012-04-03 02:05:47 +00:00
parent a890e3c69a
commit cc24e45e27
11 changed files with 174 additions and 40 deletions

View File

@ -30,33 +30,6 @@ namespace idx {
namespace ento { namespace ento {
class CheckerManager; class CheckerManager;
typedef llvm::SmallPtrSet<const Decl*,24> SetOfDecls;
class FunctionSummariesTy {
struct FunctionSummary {
/// True if this function has reached a max block count while inlined from
/// at least one call site.
bool MayReachMaxBlockCount;
FunctionSummary() : MayReachMaxBlockCount(false) {}
};
typedef llvm::DenseMap<const Decl*, FunctionSummary> MapTy;
MapTy Map;
public:
void markReachedMaxBlockCount(const Decl* D) {
Map[D].MayReachMaxBlockCount = true;
}
bool hasReachedMaxBlockCount(const Decl* D) {
MapTy::const_iterator I = Map.find(D);
if (I != Map.end())
return I->second.MayReachMaxBlockCount;
return false;
}
};
class AnalysisManager : public BugReporterData { class AnalysisManager : public BugReporterData {
virtual void anchor(); virtual void anchor();
AnalysisDeclContextManager AnaCtxMgr; AnalysisDeclContextManager AnaCtxMgr;

View File

@ -18,6 +18,7 @@
#include "clang/AST/Expr.h" #include "clang/AST/Expr.h"
#include "clang/Analysis/AnalysisContext.h" #include "clang/Analysis/AnalysisContext.h"
#include "clang/StaticAnalyzer/Core/PathSensitive/ExplodedGraph.h" #include "clang/StaticAnalyzer/Core/PathSensitive/ExplodedGraph.h"
#include "clang/StaticAnalyzer/Core/PathSensitive/FunctionSummary.h"
#include "clang/StaticAnalyzer/Core/PathSensitive/WorkList.h" #include "clang/StaticAnalyzer/Core/PathSensitive/WorkList.h"
#include "clang/StaticAnalyzer/Core/PathSensitive/BlockCounter.h" #include "clang/StaticAnalyzer/Core/PathSensitive/BlockCounter.h"
#include "llvm/ADT/OwningPtr.h" #include "llvm/ADT/OwningPtr.h"
@ -83,6 +84,10 @@ private:
/// AnalysisConsumer. It can be null. /// AnalysisConsumer. It can be null.
SetOfDecls *AnalyzedCallees; SetOfDecls *AnalyzedCallees;
/// The information about functions shared by the whole translation unit.
/// (This data is owned by AnalysisConsumer.)
FunctionSummariesTy *FunctionSummaries;
void generateNode(const ProgramPoint &Loc, void generateNode(const ProgramPoint &Loc,
ProgramStateRef State, ProgramStateRef State,
ExplodedNode *Pred); ExplodedNode *Pred);
@ -104,11 +109,13 @@ private:
public: public:
/// Construct a CoreEngine object to analyze the provided CFG using /// Construct a CoreEngine object to analyze the provided CFG using
/// a DFS exploration of the exploded graph. /// a DFS exploration of the exploded graph.
CoreEngine(SubEngine& subengine, SetOfDecls *VisitedCallees) CoreEngine(SubEngine& subengine, SetOfDecls *VisitedCallees,
FunctionSummariesTy *FS)
: SubEng(subengine), G(new ExplodedGraph()), : SubEng(subengine), G(new ExplodedGraph()),
WList(WorkList::makeBFS()), WList(WorkList::makeBFS()),
BCounterFactory(G->getAllocator()), BCounterFactory(G->getAllocator()),
AnalyzedCallees(VisitedCallees) {} AnalyzedCallees(VisitedCallees),
FunctionSummaries(FS){}
~CoreEngine() { ~CoreEngine() {
delete WList; delete WList;

View File

@ -90,10 +90,6 @@ class ExprEngine : public SubEngine {
/// destructor is called before the rest of the ExprEngine is destroyed. /// destructor is called before the rest of the ExprEngine is destroyed.
GRBugReporter BR; GRBugReporter BR;
/// The information about functions shared by the whole translation unit.
/// (This data is owned by AnalysisConsumer.)
FunctionSummariesTy *FunctionSummaries;
public: public:
ExprEngine(AnalysisManager &mgr, bool gcEnabled, SetOfDecls *VisitedCallees, ExprEngine(AnalysisManager &mgr, bool gcEnabled, SetOfDecls *VisitedCallees,
FunctionSummariesTy *FS); FunctionSummariesTy *FS);

View File

@ -0,0 +1,96 @@
//== FunctionSummary.h - Stores summaries of functions. ------------*- C++ -*-//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// This file defines a summary of a function gathered/used by static analyzes.
//
//===----------------------------------------------------------------------===//
#ifndef LLVM_CLANG_GR_FUNCTIONSUMMARY_H
#define LLVM_CLANG_GR_FUNCTIONSUMMARY_H
#include "clang/AST/Decl.h"
#include "llvm/ADT/DenseMap.h"
#include "llvm/ADT/SmallPtrSet.h"
#include "llvm/ADT/BitVector.h"
namespace clang {
namespace ento {
typedef llvm::SmallPtrSet<const Decl*,24> SetOfDecls;
class FunctionSummariesTy {
struct FunctionSummary {
/// True if this function has reached a max block count while inlined from
/// at least one call site.
bool MayReachMaxBlockCount;
/// Total number of blocks in the function.
unsigned TotalBasicBlocks;
/// Marks the IDs of the basic blocks visited during the analyzes.
llvm::BitVector VisitedBasicBlocks;
FunctionSummary() :
MayReachMaxBlockCount(false),
TotalBasicBlocks(0),
VisitedBasicBlocks(0) {}
};
typedef llvm::DenseMap<const Decl*, FunctionSummary*> MapTy;
MapTy Map;
public:
~FunctionSummariesTy();
MapTy::iterator findOrInsertSummary(const Decl *D) {
MapTy::iterator I = Map.find(D);
if (I != Map.end())
return I;
FunctionSummary *DS = new FunctionSummary();
I = Map.insert(std::pair<const Decl*, FunctionSummary*>(D, DS)).first;
assert(I != Map.end());
return I;
}
void markReachedMaxBlockCount(const Decl* D) {
MapTy::iterator I = findOrInsertSummary(D);
I->second->MayReachMaxBlockCount = true;
}
bool hasReachedMaxBlockCount(const Decl* D) {
MapTy::const_iterator I = Map.find(D);
if (I != Map.end())
return I->second->MayReachMaxBlockCount;
return false;
}
void markVisitedBasicBlock(unsigned ID, const Decl* D, unsigned TotalIDs) {
MapTy::iterator I = findOrInsertSummary(D);
llvm::BitVector &Blocks = I->second->VisitedBasicBlocks;
assert(ID < TotalIDs);
if (TotalIDs > Blocks.size()) {
Blocks.resize(TotalIDs);
I->second->TotalBasicBlocks = TotalIDs;
}
Blocks[ID] = true;
}
unsigned getNumVisitedBasicBlocks(const Decl* D) {
MapTy::const_iterator I = Map.find(D);
if (I != Map.end())
return I->second->VisitedBasicBlocks.count();
return 0;
}
unsigned getTotalNumBasicBlocks();
unsigned getTotalNumVisitedBasicBlocks();
};
}} // end clang ento namespaces
#endif

View File

@ -22,6 +22,7 @@ add_clang_library(clangStaticAnalyzerCore
ExprEngineCXX.cpp ExprEngineCXX.cpp
ExprEngineCallAndReturn.cpp ExprEngineCallAndReturn.cpp
ExprEngineObjC.cpp ExprEngineObjC.cpp
FunctionSummary.cpp
HTMLDiagnostics.cpp HTMLDiagnostics.cpp
MemRegion.cpp MemRegion.cpp
ObjCMessage.cpp ObjCMessage.cpp

View File

@ -174,6 +174,11 @@ bool CoreEngine::ExecuteWorkList(const LocationContext *L, unsigned Steps,
assert (Entry->succ_size() == 1 && assert (Entry->succ_size() == 1 &&
"Entry block must have 1 successor."); "Entry block must have 1 successor.");
// Mark the entry block as visited.
FunctionSummaries->markVisitedBasicBlock(Entry->getBlockID(),
L->getDecl(),
L->getCFG()->getNumBlockIDs());
// Get the solitary successor. // Get the solitary successor.
const CFGBlock *Succ = *(Entry->succ_begin()); const CFGBlock *Succ = *(Entry->succ_begin());
@ -280,6 +285,12 @@ void CoreEngine::HandleBlockEdge(const BlockEdge &L, ExplodedNode *Pred) {
const CFGBlock *Blk = L.getDst(); const CFGBlock *Blk = L.getDst();
NodeBuilderContext BuilderCtx(*this, Blk, Pred); NodeBuilderContext BuilderCtx(*this, Blk, Pred);
// Mark this block as visited.
const LocationContext *LC = Pred->getLocationContext();
FunctionSummaries->markVisitedBasicBlock(Blk->getBlockID(),
LC->getDecl(),
LC->getCFG()->getNumBlockIDs());
// Check if we are entering the EXIT block. // Check if we are entering the EXIT block.
if (Blk == &(L.getLocationContext()->getCFG()->getExit())) { if (Blk == &(L.getLocationContext()->getCFG()->getExit())) {
@ -312,10 +323,11 @@ void CoreEngine::HandleBlockEntrance(const BlockEntrance &L,
ExplodedNode *Pred) { ExplodedNode *Pred) {
// Increment the block counter. // Increment the block counter.
const LocationContext *LC = Pred->getLocationContext();
unsigned BlockId = L.getBlock()->getBlockID();
BlockCounter Counter = WList->getBlockCounter(); BlockCounter Counter = WList->getBlockCounter();
Counter = BCounterFactory.IncrementCount(Counter, Counter = BCounterFactory.IncrementCount(Counter, LC->getCurrentStackFrame(),
Pred->getLocationContext()->getCurrentStackFrame(), BlockId);
L.getBlock()->getBlockID());
WList->setBlockCounter(Counter); WList->setBlockCounter(Counter);
// Process the entrance of the block. // Process the entrance of the block.

View File

@ -71,7 +71,7 @@ ExprEngine::ExprEngine(AnalysisManager &mgr, bool gcEnabled,
FunctionSummariesTy *FS) FunctionSummariesTy *FS)
: AMgr(mgr), : AMgr(mgr),
AnalysisDeclContexts(mgr.getAnalysisDeclContextManager()), AnalysisDeclContexts(mgr.getAnalysisDeclContextManager()),
Engine(*this, VisitedCallees), Engine(*this, VisitedCallees, FS),
G(Engine.getGraph()), G(Engine.getGraph()),
StateMgr(getContext(), mgr.getStoreManagerCreator(), StateMgr(getContext(), mgr.getStoreManagerCreator(),
mgr.getConstraintManagerCreator(), G.getAllocator(), mgr.getConstraintManagerCreator(), G.getAllocator(),
@ -82,7 +82,7 @@ ExprEngine::ExprEngine(AnalysisManager &mgr, bool gcEnabled,
currentStmt(NULL), currentStmtIdx(0), currentBuilderContext(0), currentStmt(NULL), currentStmtIdx(0), currentBuilderContext(0),
NSExceptionII(NULL), NSExceptionInstanceRaiseSelectors(NULL), NSExceptionII(NULL), NSExceptionInstanceRaiseSelectors(NULL),
RaiseSel(GetNullarySelector("raise", getContext())), RaiseSel(GetNullarySelector("raise", getContext())),
ObjCGCEnabled(gcEnabled), BR(mgr, *this), FunctionSummaries(FS) { ObjCGCEnabled(gcEnabled), BR(mgr, *this) {
if (mgr.shouldEagerlyTrimExplodedGraph()) { if (mgr.shouldEagerlyTrimExplodedGraph()) {
// Enable eager node reclaimation when constructing the ExplodedGraph. // Enable eager node reclaimation when constructing the ExplodedGraph.
@ -1051,7 +1051,7 @@ void ExprEngine::processCFGBlockEntrance(const BlockEdge &L,
const LocationContext *RootLC = const LocationContext *RootLC =
(*G.roots_begin())->getLocation().getLocationContext(); (*G.roots_begin())->getLocation().getLocationContext();
if (RootLC->getCurrentStackFrame() != CalleeSF) { if (RootLC->getCurrentStackFrame() != CalleeSF) {
FunctionSummaries->markReachedMaxBlockCount(CalleeSF->getDecl()); Engine.FunctionSummaries->markReachedMaxBlockCount(CalleeSF->getDecl());
// Re-run the call evaluation without inlining it, by storing the // Re-run the call evaluation without inlining it, by storing the
// no-inlining policy in the state and enqueuing the new work item on // no-inlining policy in the state and enqueuing the new work item on

View File

@ -138,7 +138,7 @@ bool ExprEngine::shouldInlineDecl(const FunctionDecl *FD, ExplodedNode *Pred) {
== AMgr.InlineMaxStackDepth) == AMgr.InlineMaxStackDepth)
return false; return false;
if (FunctionSummaries->hasReachedMaxBlockCount(FD)) if (Engine.FunctionSummaries->hasReachedMaxBlockCount(FD))
return false; return false;
if (CalleeCFG->getNumBlockIDs() > AMgr.InlineMaxFunctionSize) if (CalleeCFG->getNumBlockIDs() > AMgr.InlineMaxFunctionSize)

View File

@ -0,0 +1,38 @@
//== FunctionSummary.h - Stores summaries of functions. ------------*- C++ -*-//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// This file defines a summary of a function gathered/used by static analyzes.
//
//===----------------------------------------------------------------------===//
#include "clang/StaticAnalyzer/Core/PathSensitive/FunctionSummary.h"
using namespace clang;
using namespace ento;
FunctionSummariesTy::~FunctionSummariesTy() {
for (MapTy::iterator I = Map.begin(), E = Map.end(); I != E; ++I) {
delete(I->second);
}
}
unsigned FunctionSummariesTy::getTotalNumBasicBlocks() {
unsigned Total = 0;
for (MapTy::iterator I = Map.begin(), E = Map.end(); I != E; ++I) {
Total += I->second->TotalBasicBlocks;
}
return Total;
}
unsigned FunctionSummariesTy::getTotalNumVisitedBasicBlocks() {
unsigned Total = 0;
for (MapTy::iterator I = Map.begin(), E = Map.end(); I != E; ++I) {
Total += I->second->VisitedBasicBlocks.count();
}
return Total;
}

View File

@ -53,6 +53,9 @@ static ExplodedNode::Auditor* CreateUbiViz();
STATISTIC(NumFunctionTopLevel, "The # of functions at top level."); STATISTIC(NumFunctionTopLevel, "The # of functions at top level.");
STATISTIC(NumFunctionsAnalyzed, "The # of functions analysed (as top level)."); STATISTIC(NumFunctionsAnalyzed, "The # of functions analysed (as top level).");
STATISTIC(NumBlocksInAnalyzedFunctions,
"The # of basic blocks in the analyzed functions.");
STATISTIC(PercentReachableBlocks, "The % of reachable basic blocks.");
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
// Special PathDiagnosticConsumers. // Special PathDiagnosticConsumers.
@ -122,6 +125,13 @@ public:
} }
~AnalysisConsumer() { ~AnalysisConsumer() {
// Count how many basic blocks we have not covered.
NumBlocksInAnalyzedFunctions = FunctionSummaries.getTotalNumBasicBlocks();
if (NumBlocksInAnalyzedFunctions > 0)
PercentReachableBlocks =
(FunctionSummaries.getTotalNumVisitedBasicBlocks() * 100) /
NumBlocksInAnalyzedFunctions;
if (Opts.PrintStats) if (Opts.PrintStats)
delete TUTotalTimer; delete TUTotalTimer;
} }

View File

@ -4,4 +4,5 @@ void foo() {
int x; int x;
} }
// CHECK: ... Statistics Collected ... // CHECK: ... Statistics Collected ...
// CHECK:100 AnalysisConsumer - The % of reachable basic blocks.
// CHECK:The # of times RemoveDeadBindings is called // CHECK:The # of times RemoveDeadBindings is called