4a011ac84f
Currently both True/False counts were folded. It lost the information, "It is True or False before folding." It prevented recalling branch counts in merging template instantiations. In `llvm-cov`, a folded branch is shown as: - `[True: n, Folded]` - `[Folded, False n]` In the case If `n` is zero, a branch is reported as "uncovered". This is distinguished from "folded" branch. When folded branches are merged, `Folded` may be dissolved. In the coverage map, either `Counter` is `Zero`. Currently both were `Zero`. Since "partial fold" has been introduced, either case in `switch` is omitted as `Folded`. Each `case:` in `switch` is reported as `[True: n, Folded]`, since `False` count doesn't show meaningful value. When `switch` doesn't have `default:`, `switch (Cond)` is reported as `[Folded, False: n]`, since `True` count was just the sum of `case`(s). `switch` with `default` can be considered as "the statement that doesn't have any `False`(s)".
128 lines
4.3 KiB
C++
128 lines
4.3 KiB
C++
//===- CoverageSummaryInfo.cpp - Coverage summary for function/file -------===//
|
|
//
|
|
// 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// These structures are used to represent code coverage metrics
|
|
// for functions/files.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "CoverageSummaryInfo.h"
|
|
|
|
using namespace llvm;
|
|
using namespace coverage;
|
|
|
|
static void sumBranches(size_t &NumBranches, size_t &CoveredBranches,
|
|
const ArrayRef<CountedRegion> &Branches) {
|
|
for (const auto &BR : Branches) {
|
|
if (!BR.TrueFolded) {
|
|
// "True" Condition Branches.
|
|
++NumBranches;
|
|
if (BR.ExecutionCount > 0)
|
|
++CoveredBranches;
|
|
}
|
|
if (!BR.FalseFolded) {
|
|
// "False" Condition Branches.
|
|
++NumBranches;
|
|
if (BR.FalseExecutionCount > 0)
|
|
++CoveredBranches;
|
|
}
|
|
}
|
|
}
|
|
|
|
static void sumBranchExpansions(size_t &NumBranches, size_t &CoveredBranches,
|
|
const CoverageMapping &CM,
|
|
ArrayRef<ExpansionRecord> Expansions) {
|
|
for (const auto &Expansion : Expansions) {
|
|
auto CE = CM.getCoverageForExpansion(Expansion);
|
|
sumBranches(NumBranches, CoveredBranches, CE.getBranches());
|
|
sumBranchExpansions(NumBranches, CoveredBranches, CM, CE.getExpansions());
|
|
}
|
|
}
|
|
|
|
static std::pair<size_t, size_t>
|
|
sumMCDCPairs(const ArrayRef<MCDCRecord> &Records) {
|
|
size_t NumPairs = 0, CoveredPairs = 0;
|
|
for (const auto &Record : Records) {
|
|
const auto NumConditions = Record.getNumConditions();
|
|
for (unsigned C = 0; C < NumConditions; C++) {
|
|
if (!Record.isCondFolded(C))
|
|
++NumPairs;
|
|
if (Record.isConditionIndependencePairCovered(C))
|
|
++CoveredPairs;
|
|
}
|
|
}
|
|
return {NumPairs, CoveredPairs};
|
|
}
|
|
|
|
FunctionCoverageSummary
|
|
FunctionCoverageSummary::get(const CoverageMapping &CM,
|
|
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;
|
|
CoverageData CD = CM.getCoverageForFunction(Function);
|
|
for (const auto &LCS : getLineCoverageStats(CD)) {
|
|
if (!LCS.isMapped())
|
|
continue;
|
|
++NumLines;
|
|
if (LCS.getExecutionCount())
|
|
++CoveredLines;
|
|
}
|
|
|
|
// Compute the branch coverage, including branches from expansions.
|
|
size_t NumBranches = 0, CoveredBranches = 0;
|
|
sumBranches(NumBranches, CoveredBranches, CD.getBranches());
|
|
sumBranchExpansions(NumBranches, CoveredBranches, CM, CD.getExpansions());
|
|
|
|
size_t NumPairs = 0, CoveredPairs = 0;
|
|
std::tie(NumPairs, CoveredPairs) = sumMCDCPairs(CD.getMCDCRecords());
|
|
|
|
return FunctionCoverageSummary(
|
|
Function.Name, Function.ExecutionCount,
|
|
RegionCoverageInfo(CoveredRegions, NumCodeRegions),
|
|
LineCoverageInfo(CoveredLines, NumLines),
|
|
BranchCoverageInfo(CoveredBranches, NumBranches),
|
|
MCDCCoverageInfo(CoveredPairs, NumPairs));
|
|
}
|
|
|
|
FunctionCoverageSummary
|
|
FunctionCoverageSummary::get(const InstantiationGroup &Group,
|
|
ArrayRef<FunctionCoverageSummary> Summaries) {
|
|
std::string Name;
|
|
if (Group.hasName()) {
|
|
Name = std::string(Group.getName());
|
|
} else {
|
|
llvm::raw_string_ostream OS(Name);
|
|
OS << "Definition at line " << Group.getLine() << ", column "
|
|
<< Group.getColumn();
|
|
}
|
|
|
|
FunctionCoverageSummary Summary(Name);
|
|
Summary.ExecutionCount = Group.getTotalExecutionCount();
|
|
Summary.RegionCoverage = Summaries[0].RegionCoverage;
|
|
Summary.LineCoverage = Summaries[0].LineCoverage;
|
|
Summary.BranchCoverage = Summaries[0].BranchCoverage;
|
|
Summary.MCDCCoverage = Summaries[0].MCDCCoverage;
|
|
for (const auto &FCS : Summaries.drop_front()) {
|
|
Summary.RegionCoverage.merge(FCS.RegionCoverage);
|
|
Summary.LineCoverage.merge(FCS.LineCoverage);
|
|
Summary.BranchCoverage.merge(FCS.BranchCoverage);
|
|
Summary.MCDCCoverage.merge(FCS.MCDCCoverage);
|
|
}
|
|
return Summary;
|
|
}
|