1e78d131aSEugene Zelenko //===- CoverageMappingWriter.cpp - Code coverage mapping writer -----------===// 2dc707122SEaswaran Raman // 32946cd70SChandler Carruth // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 42946cd70SChandler Carruth // See https://llvm.org/LICENSE.txt for license information. 52946cd70SChandler Carruth // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6dc707122SEaswaran Raman // 7dc707122SEaswaran Raman //===----------------------------------------------------------------------===// 8dc707122SEaswaran Raman // 9dc707122SEaswaran Raman // This file contains support for writing coverage mapping data for 10dc707122SEaswaran Raman // instrumentation based coverage. 11dc707122SEaswaran Raman // 12dc707122SEaswaran Raman //===----------------------------------------------------------------------===// 13dc707122SEaswaran Raman 14*dd1ea9deSVedant Kumar #include "llvm/ProfileData/InstrProf.h" 156bda14b3SChandler Carruth #include "llvm/ProfileData/Coverage/CoverageMappingWriter.h" 16e78d131aSEugene Zelenko #include "llvm/ADT/ArrayRef.h" 17e78d131aSEugene Zelenko #include "llvm/ADT/SmallVector.h" 18*dd1ea9deSVedant Kumar #include "llvm/Support/Compression.h" 19dc707122SEaswaran Raman #include "llvm/Support/LEB128.h" 20e78d131aSEugene Zelenko #include "llvm/Support/raw_ostream.h" 21e78d131aSEugene Zelenko #include <algorithm> 22e78d131aSEugene Zelenko #include <cassert> 23e78d131aSEugene Zelenko #include <limits> 24e78d131aSEugene Zelenko #include <vector> 25dc707122SEaswaran Raman 26dc707122SEaswaran Raman using namespace llvm; 27dc707122SEaswaran Raman using namespace coverage; 28dc707122SEaswaran Raman 2995de2497SVedant Kumar CoverageFilenamesSectionWriter::CoverageFilenamesSectionWriter( 3095de2497SVedant Kumar ArrayRef<StringRef> Filenames) 3195de2497SVedant Kumar : Filenames(Filenames) { 3295de2497SVedant Kumar #ifndef NDEBUG 3395de2497SVedant Kumar StringSet<> NameSet; 3495de2497SVedant Kumar for (StringRef Name : Filenames) 3595de2497SVedant Kumar assert(NameSet.insert(Name).second && "Duplicate filename"); 3695de2497SVedant Kumar #endif 3795de2497SVedant Kumar } 3895de2497SVedant Kumar 39*dd1ea9deSVedant Kumar void CoverageFilenamesSectionWriter::write(raw_ostream &OS, bool Compress) { 40*dd1ea9deSVedant Kumar std::string FilenamesStr; 41*dd1ea9deSVedant Kumar { 42*dd1ea9deSVedant Kumar raw_string_ostream FilenamesOS{FilenamesStr}; 4333888717SVedant Kumar for (const auto &Filename : Filenames) { 44*dd1ea9deSVedant Kumar encodeULEB128(Filename.size(), FilenamesOS); 45*dd1ea9deSVedant Kumar FilenamesOS << Filename; 4633888717SVedant Kumar } 4799317124SVedant Kumar } 4899317124SVedant Kumar 49*dd1ea9deSVedant Kumar SmallString<128> CompressedStr; 50*dd1ea9deSVedant Kumar bool doCompression = 51*dd1ea9deSVedant Kumar Compress && zlib::isAvailable() && DoInstrProfNameCompression; 52*dd1ea9deSVedant Kumar if (doCompression) { 53*dd1ea9deSVedant Kumar auto E = 54*dd1ea9deSVedant Kumar zlib::compress(FilenamesStr, CompressedStr, zlib::BestSizeCompression); 55*dd1ea9deSVedant Kumar if (E) 56*dd1ea9deSVedant Kumar report_bad_alloc_error("Failed to zlib compress coverage data"); 57*dd1ea9deSVedant Kumar } 58*dd1ea9deSVedant Kumar 59*dd1ea9deSVedant Kumar // ::= <num-filenames> 60*dd1ea9deSVedant Kumar // <uncompressed-len> 61*dd1ea9deSVedant Kumar // <compressed-len-or-zero> 62*dd1ea9deSVedant Kumar // (<compressed-filenames> | <uncompressed-filenames>) 63*dd1ea9deSVedant Kumar encodeULEB128(Filenames.size(), OS); 64*dd1ea9deSVedant Kumar encodeULEB128(FilenamesStr.size(), OS); 65*dd1ea9deSVedant Kumar encodeULEB128(doCompression ? CompressedStr.size() : 0U, OS); 66*dd1ea9deSVedant Kumar OS << (doCompression ? StringRef(CompressedStr) : StringRef(FilenamesStr)); 67*dd1ea9deSVedant Kumar } 68*dd1ea9deSVedant Kumar 69dc707122SEaswaran Raman namespace { 70e78d131aSEugene Zelenko 715f8f34e4SAdrian Prantl /// Gather only the expressions that are used by the mapping 72dc707122SEaswaran Raman /// regions in this function. 73dc707122SEaswaran Raman class CounterExpressionsMinimizer { 74dc707122SEaswaran Raman ArrayRef<CounterExpression> Expressions; 75e78d131aSEugene Zelenko SmallVector<CounterExpression, 16> UsedExpressions; 76dc707122SEaswaran Raman std::vector<unsigned> AdjustedExpressionIDs; 77dc707122SEaswaran Raman 78dc707122SEaswaran Raman public: 79e78d131aSEugene Zelenko CounterExpressionsMinimizer(ArrayRef<CounterExpression> Expressions, 80e78d131aSEugene Zelenko ArrayRef<CounterMappingRegion> MappingRegions) 81e78d131aSEugene Zelenko : Expressions(Expressions) { 82e78d131aSEugene Zelenko AdjustedExpressionIDs.resize(Expressions.size(), 0); 83e78d131aSEugene Zelenko for (const auto &I : MappingRegions) 84e78d131aSEugene Zelenko mark(I.Count); 85e78d131aSEugene Zelenko for (const auto &I : MappingRegions) 86e78d131aSEugene Zelenko gatherUsed(I.Count); 87e78d131aSEugene Zelenko } 88e78d131aSEugene Zelenko 89dc707122SEaswaran Raman void mark(Counter C) { 90dc707122SEaswaran Raman if (!C.isExpression()) 91dc707122SEaswaran Raman return; 92dc707122SEaswaran Raman unsigned ID = C.getExpressionID(); 93dc707122SEaswaran Raman AdjustedExpressionIDs[ID] = 1; 94dc707122SEaswaran Raman mark(Expressions[ID].LHS); 95dc707122SEaswaran Raman mark(Expressions[ID].RHS); 96dc707122SEaswaran Raman } 97dc707122SEaswaran Raman 98dc707122SEaswaran Raman void gatherUsed(Counter C) { 99dc707122SEaswaran Raman if (!C.isExpression() || !AdjustedExpressionIDs[C.getExpressionID()]) 100dc707122SEaswaran Raman return; 101dc707122SEaswaran Raman AdjustedExpressionIDs[C.getExpressionID()] = UsedExpressions.size(); 102dc707122SEaswaran Raman const auto &E = Expressions[C.getExpressionID()]; 103dc707122SEaswaran Raman UsedExpressions.push_back(E); 104dc707122SEaswaran Raman gatherUsed(E.LHS); 105dc707122SEaswaran Raman gatherUsed(E.RHS); 106dc707122SEaswaran Raman } 107dc707122SEaswaran Raman 108dc707122SEaswaran Raman ArrayRef<CounterExpression> getExpressions() const { return UsedExpressions; } 109dc707122SEaswaran Raman 1105f8f34e4SAdrian Prantl /// Adjust the given counter to correctly transition from the old 111dc707122SEaswaran Raman /// expression ids to the new expression ids. 112dc707122SEaswaran Raman Counter adjust(Counter C) const { 113dc707122SEaswaran Raman if (C.isExpression()) 114dc707122SEaswaran Raman C = Counter::getExpression(AdjustedExpressionIDs[C.getExpressionID()]); 115dc707122SEaswaran Raman return C; 116dc707122SEaswaran Raman } 117dc707122SEaswaran Raman }; 118e78d131aSEugene Zelenko 119e78d131aSEugene Zelenko } // end anonymous namespace 120dc707122SEaswaran Raman 1215f8f34e4SAdrian Prantl /// Encode the counter. 122dc707122SEaswaran Raman /// 123dc707122SEaswaran Raman /// The encoding uses the following format: 124dc707122SEaswaran Raman /// Low 2 bits - Tag: 125dc707122SEaswaran Raman /// Counter::Zero(0) - A Counter with kind Counter::Zero 126dc707122SEaswaran Raman /// Counter::CounterValueReference(1) - A counter with kind 127dc707122SEaswaran Raman /// Counter::CounterValueReference 128dc707122SEaswaran Raman /// Counter::Expression(2) + CounterExpression::Subtract(0) - 129dc707122SEaswaran Raman /// A counter with kind Counter::Expression and an expression 130dc707122SEaswaran Raman /// with kind CounterExpression::Subtract 131dc707122SEaswaran Raman /// Counter::Expression(2) + CounterExpression::Add(1) - 132dc707122SEaswaran Raman /// A counter with kind Counter::Expression and an expression 133dc707122SEaswaran Raman /// with kind CounterExpression::Add 134dc707122SEaswaran Raman /// Remaining bits - Counter/Expression ID. 135dc707122SEaswaran Raman static unsigned encodeCounter(ArrayRef<CounterExpression> Expressions, 136dc707122SEaswaran Raman Counter C) { 137dc707122SEaswaran Raman unsigned Tag = unsigned(C.getKind()); 138dc707122SEaswaran Raman if (C.isExpression()) 139dc707122SEaswaran Raman Tag += Expressions[C.getExpressionID()].Kind; 140dc707122SEaswaran Raman unsigned ID = C.getCounterID(); 141dc707122SEaswaran Raman assert(ID <= 142dc707122SEaswaran Raman (std::numeric_limits<unsigned>::max() >> Counter::EncodingTagBits)); 143dc707122SEaswaran Raman return Tag | (ID << Counter::EncodingTagBits); 144dc707122SEaswaran Raman } 145dc707122SEaswaran Raman 146dc707122SEaswaran Raman static void writeCounter(ArrayRef<CounterExpression> Expressions, Counter C, 147dc707122SEaswaran Raman raw_ostream &OS) { 148dc707122SEaswaran Raman encodeULEB128(encodeCounter(Expressions, C), OS); 149dc707122SEaswaran Raman } 150dc707122SEaswaran Raman 151dc707122SEaswaran Raman void CoverageMappingWriter::write(raw_ostream &OS) { 152bae83970SVedant Kumar // Check that we don't have any bogus regions. 153bae83970SVedant Kumar assert(all_of(MappingRegions, 154bae83970SVedant Kumar [](const CounterMappingRegion &CMR) { 155bae83970SVedant Kumar return CMR.startLoc() <= CMR.endLoc(); 156bae83970SVedant Kumar }) && 157bae83970SVedant Kumar "Source region does not begin before it ends"); 158bae83970SVedant Kumar 159dc707122SEaswaran Raman // Sort the regions in an ascending order by the file id and the starting 160f3c8a9cfSIgor Kudrin // location. Sort by region kinds to ensure stable order for tests. 161efd94c56SFangrui Song llvm::stable_sort(MappingRegions, [](const CounterMappingRegion &LHS, 162efd94c56SFangrui Song const CounterMappingRegion &RHS) { 163f3c8a9cfSIgor Kudrin if (LHS.FileID != RHS.FileID) 164f3c8a9cfSIgor Kudrin return LHS.FileID < RHS.FileID; 165f3c8a9cfSIgor Kudrin if (LHS.startLoc() != RHS.startLoc()) 166f3c8a9cfSIgor Kudrin return LHS.startLoc() < RHS.startLoc(); 167f3c8a9cfSIgor Kudrin return LHS.Kind < RHS.Kind; 168f3c8a9cfSIgor Kudrin }); 169dc707122SEaswaran Raman 170dc707122SEaswaran Raman // Write out the fileid -> filename mapping. 171dc707122SEaswaran Raman encodeULEB128(VirtualFileMapping.size(), OS); 172dc707122SEaswaran Raman for (const auto &FileID : VirtualFileMapping) 173dc707122SEaswaran Raman encodeULEB128(FileID, OS); 174dc707122SEaswaran Raman 175dc707122SEaswaran Raman // Write out the expressions. 176dc707122SEaswaran Raman CounterExpressionsMinimizer Minimizer(Expressions, MappingRegions); 177dc707122SEaswaran Raman auto MinExpressions = Minimizer.getExpressions(); 178dc707122SEaswaran Raman encodeULEB128(MinExpressions.size(), OS); 179dc707122SEaswaran Raman for (const auto &E : MinExpressions) { 180dc707122SEaswaran Raman writeCounter(MinExpressions, Minimizer.adjust(E.LHS), OS); 181dc707122SEaswaran Raman writeCounter(MinExpressions, Minimizer.adjust(E.RHS), OS); 182dc707122SEaswaran Raman } 183dc707122SEaswaran Raman 184dc707122SEaswaran Raman // Write out the mapping regions. 185dc707122SEaswaran Raman // Split the regions into subarrays where each region in a 186dc707122SEaswaran Raman // subarray has a fileID which is the index of that subarray. 187dc707122SEaswaran Raman unsigned PrevLineStart = 0; 188dc707122SEaswaran Raman unsigned CurrentFileID = ~0U; 189dc707122SEaswaran Raman for (auto I = MappingRegions.begin(), E = MappingRegions.end(); I != E; ++I) { 190dc707122SEaswaran Raman if (I->FileID != CurrentFileID) { 191dc707122SEaswaran Raman // Ensure that all file ids have at least one mapping region. 192dc707122SEaswaran Raman assert(I->FileID == (CurrentFileID + 1)); 193dc707122SEaswaran Raman // Find the number of regions with this file id. 194dc707122SEaswaran Raman unsigned RegionCount = 1; 195dc707122SEaswaran Raman for (auto J = I + 1; J != E && I->FileID == J->FileID; ++J) 196dc707122SEaswaran Raman ++RegionCount; 197dc707122SEaswaran Raman // Start a new region sub-array. 198dc707122SEaswaran Raman encodeULEB128(RegionCount, OS); 199dc707122SEaswaran Raman 200dc707122SEaswaran Raman CurrentFileID = I->FileID; 201dc707122SEaswaran Raman PrevLineStart = 0; 202dc707122SEaswaran Raman } 203dc707122SEaswaran Raman Counter Count = Minimizer.adjust(I->Count); 204dc707122SEaswaran Raman switch (I->Kind) { 205dc707122SEaswaran Raman case CounterMappingRegion::CodeRegion: 206ad8f637bSVedant Kumar case CounterMappingRegion::GapRegion: 207dc707122SEaswaran Raman writeCounter(MinExpressions, Count, OS); 208dc707122SEaswaran Raman break; 209dc707122SEaswaran Raman case CounterMappingRegion::ExpansionRegion: { 210dc707122SEaswaran Raman assert(Count.isZero()); 211dc707122SEaswaran Raman assert(I->ExpandedFileID <= 212dc707122SEaswaran Raman (std::numeric_limits<unsigned>::max() >> 213dc707122SEaswaran Raman Counter::EncodingCounterTagAndExpansionRegionTagBits)); 214dc707122SEaswaran Raman // Mark an expansion region with a set bit that follows the counter tag, 215dc707122SEaswaran Raman // and pack the expanded file id into the remaining bits. 216dc707122SEaswaran Raman unsigned EncodedTagExpandedFileID = 217dc707122SEaswaran Raman (1 << Counter::EncodingTagBits) | 218dc707122SEaswaran Raman (I->ExpandedFileID 219dc707122SEaswaran Raman << Counter::EncodingCounterTagAndExpansionRegionTagBits); 220dc707122SEaswaran Raman encodeULEB128(EncodedTagExpandedFileID, OS); 221dc707122SEaswaran Raman break; 222dc707122SEaswaran Raman } 223dc707122SEaswaran Raman case CounterMappingRegion::SkippedRegion: 224dc707122SEaswaran Raman assert(Count.isZero()); 225dc707122SEaswaran Raman encodeULEB128(unsigned(I->Kind) 226dc707122SEaswaran Raman << Counter::EncodingCounterTagAndExpansionRegionTagBits, 227dc707122SEaswaran Raman OS); 228dc707122SEaswaran Raman break; 229dc707122SEaswaran Raman } 230dc707122SEaswaran Raman assert(I->LineStart >= PrevLineStart); 231dc707122SEaswaran Raman encodeULEB128(I->LineStart - PrevLineStart, OS); 232dc707122SEaswaran Raman encodeULEB128(I->ColumnStart, OS); 233dc707122SEaswaran Raman assert(I->LineEnd >= I->LineStart); 234dc707122SEaswaran Raman encodeULEB128(I->LineEnd - I->LineStart, OS); 235dc707122SEaswaran Raman encodeULEB128(I->ColumnEnd, OS); 236dc707122SEaswaran Raman PrevLineStart = I->LineStart; 237dc707122SEaswaran Raman } 238dc707122SEaswaran Raman // Ensure that all file ids have at least one mapping region. 239dc707122SEaswaran Raman assert(CurrentFileID == (VirtualFileMapping.size() - 1)); 240dc707122SEaswaran Raman } 241