mirror of
https://github.com/RPCS3/llvm.git
synced 2025-05-13 08:56:04 +00:00

The CoverageMapping::getInstantiations() API retrieved all function records corresponding to functions with more than one instantiation (e.g template functions with multiple specializations). However, there was no simple way to determine *which* function a given record was an instantiation of. This was an oversight, since it's useful to aggregate coverage information over all instantiations of a function. llvm-cov works around this by building a mapping of source locations to instantiation sets, but this duplicates logic that libCoverage already has (see FunctionInstantiationSetCollector). This change adds a new API, CoverageMapping::getInstantiationGroups(), which returns a list of InstantiationGroups. A group contains records for each instantiation of some particular function, and also provides utilities to get the total execution count within the group, the source location of the common definition, etc. This lets removes some hacky logic in llvm-cov by reusing FunctionInstantiationSetCollector and makes the CoverageMapping API friendlier for other clients. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@309904 91177308-0d34-0410-b5e6-96231b3b80d8
101 lines
3.6 KiB
C++
101 lines
3.6 KiB
C++
//===- CoverageSummaryInfo.cpp - Coverage summary for function/file -------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// These structures are used to represent code coverage metrics
|
|
// for functions/files.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "CoverageSummaryInfo.h"
|
|
|
|
using namespace llvm;
|
|
using namespace coverage;
|
|
|
|
FunctionCoverageSummary
|
|
FunctionCoverageSummary::get(const coverage::FunctionRecord &Function) {
|
|
// Compute the region coverage.
|
|
size_t NumCodeRegions = 0, CoveredRegions = 0;
|
|
for (auto &CR : Function.CountedRegions) {
|
|
if (CR.Kind != CounterMappingRegion::CodeRegion)
|
|
continue;
|
|
++NumCodeRegions;
|
|
if (CR.ExecutionCount != 0)
|
|
++CoveredRegions;
|
|
}
|
|
|
|
// Compute the line coverage
|
|
size_t NumLines = 0, CoveredLines = 0;
|
|
for (unsigned FileID = 0, E = Function.Filenames.size(); FileID < E;
|
|
++FileID) {
|
|
// Find the line start and end of the function's source code
|
|
// in that particular file
|
|
unsigned LineStart = std::numeric_limits<unsigned>::max();
|
|
unsigned LineEnd = 0;
|
|
for (auto &CR : Function.CountedRegions) {
|
|
if (CR.FileID != FileID)
|
|
continue;
|
|
LineStart = std::min(LineStart, CR.LineStart);
|
|
LineEnd = std::max(LineEnd, CR.LineEnd);
|
|
}
|
|
unsigned LineCount = LineEnd - LineStart + 1;
|
|
|
|
// Get counters
|
|
llvm::SmallVector<uint64_t, 16> ExecutionCounts;
|
|
ExecutionCounts.resize(LineCount, 0);
|
|
for (auto &CR : Function.CountedRegions) {
|
|
if (CR.FileID != FileID)
|
|
continue;
|
|
// Ignore the lines that were skipped by the preprocessor.
|
|
auto ExecutionCount = CR.ExecutionCount;
|
|
if (CR.Kind == CounterMappingRegion::SkippedRegion) {
|
|
LineCount -= CR.LineEnd - CR.LineStart + 1;
|
|
ExecutionCount = 1;
|
|
}
|
|
for (unsigned I = CR.LineStart; I <= CR.LineEnd; ++I)
|
|
ExecutionCounts[I - LineStart] = ExecutionCount;
|
|
}
|
|
CoveredLines += LineCount - std::count(ExecutionCounts.begin(),
|
|
ExecutionCounts.end(), 0);
|
|
NumLines += LineCount;
|
|
}
|
|
return FunctionCoverageSummary(
|
|
Function.Name, Function.ExecutionCount,
|
|
RegionCoverageInfo(CoveredRegions, NumCodeRegions),
|
|
LineCoverageInfo(CoveredLines, NumLines));
|
|
}
|
|
|
|
FunctionCoverageSummary
|
|
FunctionCoverageSummary::get(const InstantiationGroup &Group,
|
|
ArrayRef<FunctionCoverageSummary> Summaries) {
|
|
std::string Name;
|
|
if (Group.hasName()) {
|
|
Name = Group.getName();
|
|
} else {
|
|
llvm::raw_string_ostream OS(Name);
|
|
OS << "Definition at line " << Group.getLine() << ", column "
|
|
<< Group.getColumn();
|
|
}
|
|
|
|
FunctionCoverageSummary Summary(std::move(Name));
|
|
Summary.ExecutionCount = Group.getTotalExecutionCount();
|
|
Summary.RegionCoverage = Summaries[0].RegionCoverage;
|
|
Summary.LineCoverage = Summaries[0].LineCoverage;
|
|
for (const auto &FCS : Summaries.drop_front()) {
|
|
Summary.RegionCoverage.Covered =
|
|
std::max(FCS.RegionCoverage.Covered, Summary.RegionCoverage.Covered);
|
|
Summary.RegionCoverage.NotCovered = std::min(
|
|
FCS.RegionCoverage.NotCovered, Summary.RegionCoverage.NotCovered);
|
|
Summary.LineCoverage.Covered =
|
|
std::max(FCS.LineCoverage.Covered, Summary.LineCoverage.Covered);
|
|
Summary.LineCoverage.NotCovered =
|
|
std::min(FCS.LineCoverage.NotCovered, Summary.LineCoverage.NotCovered);
|
|
}
|
|
return Summary;
|
|
}
|