blob: 11c57145f780c9f689067edd52ca014b3bff0eaa [file] [log] [blame]
Alex Lorenzee024992014-08-04 18:41:51 +00001//===--- CoverageMappingGen.cpp - Coverage mapping generation ---*- C++ -*-===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// Instrumentation-based code coverage mapping generator
11//
12//===----------------------------------------------------------------------===//
13
14#include "CoverageMappingGen.h"
15#include "CodeGenFunction.h"
16#include "clang/AST/StmtVisitor.h"
17#include "clang/Lex/Lexer.h"
Vedant Kumarbc6b80a2016-01-28 17:52:18 +000018#include "llvm/ADT/SmallSet.h"
Vedant Kumarca3326c2016-01-21 19:25:35 +000019#include "llvm/ADT/StringExtras.h"
Justin Bognerbf42cfd2015-02-18 21:24:51 +000020#include "llvm/ADT/Optional.h"
Easwaran Ramanb014ee42016-04-29 18:53:16 +000021#include "llvm/ProfileData/Coverage/CoverageMapping.h"
22#include "llvm/ProfileData/Coverage/CoverageMappingReader.h"
23#include "llvm/ProfileData/Coverage/CoverageMappingWriter.h"
Chandler Carruth0d9593d2015-01-14 11:29:14 +000024#include "llvm/ProfileData/InstrProfReader.h"
Alex Lorenzee024992014-08-04 18:41:51 +000025#include "llvm/Support/FileSystem.h"
Vedant Kumar14f8fb62016-07-18 21:01:27 +000026#include "llvm/Support/Path.h"
Alex Lorenzee024992014-08-04 18:41:51 +000027
28using namespace clang;
29using namespace CodeGen;
30using namespace llvm::coverage;
31
32void CoverageSourceInfo::SourceRangeSkipped(SourceRange Range) {
33 SkippedRanges.push_back(Range);
34}
35
36namespace {
37
38/// \brief A region of source code that can be mapped to a counter.
Justin Bogner09c71792014-10-01 03:33:49 +000039class SourceMappingRegion {
Alex Lorenzee024992014-08-04 18:41:51 +000040 Counter Count;
41
Alex Lorenzee024992014-08-04 18:41:51 +000042 /// \brief The region's starting location.
Justin Bognerbf42cfd2015-02-18 21:24:51 +000043 Optional<SourceLocation> LocStart;
Alex Lorenzee024992014-08-04 18:41:51 +000044
45 /// \brief The region's ending location.
Justin Bognerbf42cfd2015-02-18 21:24:51 +000046 Optional<SourceLocation> LocEnd;
Alex Lorenzee024992014-08-04 18:41:51 +000047
Justin Bogner09c71792014-10-01 03:33:49 +000048public:
Justin Bognerbf42cfd2015-02-18 21:24:51 +000049 SourceMappingRegion(Counter Count, Optional<SourceLocation> LocStart,
50 Optional<SourceLocation> LocEnd)
51 : Count(Count), LocStart(LocStart), LocEnd(LocEnd) {}
Alex Lorenzee024992014-08-04 18:41:51 +000052
Justin Bogner09c71792014-10-01 03:33:49 +000053 const Counter &getCounter() const { return Count; }
54
Justin Bognerbf42cfd2015-02-18 21:24:51 +000055 void setCounter(Counter C) { Count = C; }
Justin Bogner09c71792014-10-01 03:33:49 +000056
Justin Bognerbf42cfd2015-02-18 21:24:51 +000057 bool hasStartLoc() const { return LocStart.hasValue(); }
58
59 void setStartLoc(SourceLocation Loc) { LocStart = Loc; }
60
Craig Topper462c77b2015-09-26 05:10:14 +000061 SourceLocation getStartLoc() const {
Justin Bognerbf42cfd2015-02-18 21:24:51 +000062 assert(LocStart && "Region has no start location");
63 return *LocStart;
Justin Bogner09c71792014-10-01 03:33:49 +000064 }
65
Justin Bognerbf42cfd2015-02-18 21:24:51 +000066 bool hasEndLoc() const { return LocEnd.hasValue(); }
Alex Lorenzee024992014-08-04 18:41:51 +000067
Justin Bognerbf42cfd2015-02-18 21:24:51 +000068 void setEndLoc(SourceLocation Loc) { LocEnd = Loc; }
Alex Lorenzee024992014-08-04 18:41:51 +000069
Craig Topper462c77b2015-09-26 05:10:14 +000070 SourceLocation getEndLoc() const {
Justin Bognerbf42cfd2015-02-18 21:24:51 +000071 assert(LocEnd && "Region has no end location");
72 return *LocEnd;
Alex Lorenzee024992014-08-04 18:41:51 +000073 }
74};
75
Alex Lorenzee024992014-08-04 18:41:51 +000076/// \brief Provides the common functionality for the different
77/// coverage mapping region builders.
78class CoverageMappingBuilder {
79public:
80 CoverageMappingModuleGen &CVM;
81 SourceManager &SM;
82 const LangOptions &LangOpts;
83
84private:
Justin Bognerbf42cfd2015-02-18 21:24:51 +000085 /// \brief Map of clang's FileIDs to IDs used for coverage mapping.
86 llvm::SmallDenseMap<FileID, std::pair<unsigned, SourceLocation>, 8>
87 FileIDMapping;
Alex Lorenzee024992014-08-04 18:41:51 +000088
89public:
Alex Lorenzee024992014-08-04 18:41:51 +000090 /// \brief The coverage mapping regions for this function
91 llvm::SmallVector<CounterMappingRegion, 32> MappingRegions;
92 /// \brief The source mapping regions for this function.
Justin Bognerf59329b2014-10-01 03:33:52 +000093 std::vector<SourceMappingRegion> SourceRegions;
Alex Lorenzee024992014-08-04 18:41:51 +000094
Igor Kudrinfc05ee32016-08-31 07:04:16 +000095 /// \brief A set of regions which can be used as a filter.
96 ///
97 /// It is produced by emitExpansionRegions() and is used in
98 /// emitSourceRegions() to suppress producing code regions if
99 /// the same area is covered by expansion regions.
100 typedef llvm::SmallSet<std::pair<SourceLocation, SourceLocation>, 8>
101 SourceRegionFilter;
102
Alex Lorenzee024992014-08-04 18:41:51 +0000103 CoverageMappingBuilder(CoverageMappingModuleGen &CVM, SourceManager &SM,
104 const LangOptions &LangOpts)
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000105 : CVM(CVM), SM(SM), LangOpts(LangOpts) {}
Alex Lorenzee024992014-08-04 18:41:51 +0000106
107 /// \brief Return the precise end location for the given token.
108 SourceLocation getPreciseTokenLocEnd(SourceLocation Loc) {
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000109 // We avoid getLocForEndOfToken here, because it doesn't do what we want for
110 // macro locations, which we just treat as expanded files.
111 unsigned TokLen =
112 Lexer::MeasureTokenLength(SM.getSpellingLoc(Loc), SM, LangOpts);
113 return Loc.getLocWithOffset(TokLen);
Alex Lorenzee024992014-08-04 18:41:51 +0000114 }
115
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000116 /// \brief Return the start location of an included file or expanded macro.
117 SourceLocation getStartOfFileOrMacro(SourceLocation Loc) {
118 if (Loc.isMacroID())
119 return Loc.getLocWithOffset(-SM.getFileOffset(Loc));
120 return SM.getLocForStartOfFile(SM.getFileID(Loc));
Alex Lorenzee024992014-08-04 18:41:51 +0000121 }
122
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000123 /// \brief Return the end location of an included file or expanded macro.
124 SourceLocation getEndOfFileOrMacro(SourceLocation Loc) {
125 if (Loc.isMacroID())
126 return Loc.getLocWithOffset(SM.getFileIDSize(SM.getFileID(Loc)) -
Justin Bognerf14b2072015-03-25 04:13:49 +0000127 SM.getFileOffset(Loc));
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000128 return SM.getLocForEndOfFile(SM.getFileID(Loc));
129 }
130
131 /// \brief Find out where the current file is included or macro is expanded.
132 SourceLocation getIncludeOrExpansionLoc(SourceLocation Loc) {
133 return Loc.isMacroID() ? SM.getImmediateExpansionRange(Loc).first
134 : SM.getIncludeLoc(SM.getFileID(Loc));
135 }
136
Justin Bogner682bfbf2015-05-14 22:14:10 +0000137 /// \brief Return true if \c Loc is a location in a built-in macro.
138 bool isInBuiltin(SourceLocation Loc) {
Mehdi Amini99d1b292016-10-01 16:38:28 +0000139 return SM.getBufferName(SM.getSpellingLoc(Loc)) == "<built-in>";
Justin Bogner682bfbf2015-05-14 22:14:10 +0000140 }
141
Igor Kudrind9e1a612016-06-07 10:07:51 +0000142 /// \brief Check whether \c Loc is included or expanded from \c Parent.
143 bool isNestedIn(SourceLocation Loc, FileID Parent) {
144 do {
145 Loc = getIncludeOrExpansionLoc(Loc);
146 if (Loc.isInvalid())
147 return false;
148 } while (!SM.isInFileID(Loc, Parent));
149 return true;
150 }
151
Justin Bogner682bfbf2015-05-14 22:14:10 +0000152 /// \brief Get the start of \c S ignoring macro arguments and builtin macros.
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000153 SourceLocation getStart(const Stmt *S) {
154 SourceLocation Loc = S->getLocStart();
Justin Bogner682bfbf2015-05-14 22:14:10 +0000155 while (SM.isMacroArgExpansion(Loc) || isInBuiltin(Loc))
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000156 Loc = SM.getImmediateExpansionRange(Loc).first;
157 return Loc;
158 }
159
Justin Bogner682bfbf2015-05-14 22:14:10 +0000160 /// \brief Get the end of \c S ignoring macro arguments and builtin macros.
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000161 SourceLocation getEnd(const Stmt *S) {
162 SourceLocation Loc = S->getLocEnd();
Justin Bogner682bfbf2015-05-14 22:14:10 +0000163 while (SM.isMacroArgExpansion(Loc) || isInBuiltin(Loc))
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000164 Loc = SM.getImmediateExpansionRange(Loc).first;
Justin Bognerf14b2072015-03-25 04:13:49 +0000165 return getPreciseTokenLocEnd(Loc);
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000166 }
167
168 /// \brief Find the set of files we have regions for and assign IDs
169 ///
170 /// Fills \c Mapping with the virtual file mapping needed to write out
171 /// coverage and collects the necessary file information to emit source and
172 /// expansion regions.
173 void gatherFileIDs(SmallVectorImpl<unsigned> &Mapping) {
174 FileIDMapping.clear();
175
Vedant Kumarbc6b80a2016-01-28 17:52:18 +0000176 llvm::SmallSet<FileID, 8> Visited;
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000177 SmallVector<std::pair<SourceLocation, unsigned>, 8> FileLocs;
178 for (const auto &Region : SourceRegions) {
179 SourceLocation Loc = Region.getStartLoc();
180 FileID File = SM.getFileID(Loc);
Vedant Kumarbc6b80a2016-01-28 17:52:18 +0000181 if (!Visited.insert(File).second)
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000182 continue;
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000183
Vedant Kumar93205af2016-07-11 22:57:46 +0000184 // Do not map FileID's associated with system headers.
185 if (SM.isInSystemHeader(SM.getSpellingLoc(Loc)))
186 continue;
187
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000188 unsigned Depth = 0;
189 for (SourceLocation Parent = getIncludeOrExpansionLoc(Loc);
Yaron Kerened1fe5d2015-10-03 05:15:57 +0000190 Parent.isValid(); Parent = getIncludeOrExpansionLoc(Parent))
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000191 ++Depth;
192 FileLocs.push_back(std::make_pair(Loc, Depth));
193 }
194 std::stable_sort(FileLocs.begin(), FileLocs.end(), llvm::less_second());
195
196 for (const auto &FL : FileLocs) {
197 SourceLocation Loc = FL.first;
198 FileID SpellingFile = SM.getDecomposedSpellingLoc(Loc).first;
199 auto Entry = SM.getFileEntryForID(SpellingFile);
200 if (!Entry)
201 continue;
202
203 FileIDMapping[SM.getFileID(Loc)] = std::make_pair(Mapping.size(), Loc);
204 Mapping.push_back(CVM.getFileID(Entry));
205 }
206 }
207
208 /// \brief Get the coverage mapping file ID for \c Loc.
209 ///
210 /// If such file id doesn't exist, return None.
211 Optional<unsigned> getCoverageFileID(SourceLocation Loc) {
212 auto Mapping = FileIDMapping.find(SM.getFileID(Loc));
Justin Bogner903678c2015-01-24 20:22:32 +0000213 if (Mapping != FileIDMapping.end())
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000214 return Mapping->second.first;
215 return None;
Alex Lorenzee024992014-08-04 18:41:51 +0000216 }
217
Alex Lorenzee024992014-08-04 18:41:51 +0000218 /// \brief Gather all the regions that were skipped by the preprocessor
219 /// using the constructs like #if.
220 void gatherSkippedRegions() {
221 /// An array of the minimum lineStarts and the maximum lineEnds
222 /// for mapping regions from the appropriate source files.
223 llvm::SmallVector<std::pair<unsigned, unsigned>, 8> FileLineRanges;
224 FileLineRanges.resize(
225 FileIDMapping.size(),
226 std::make_pair(std::numeric_limits<unsigned>::max(), 0));
227 for (const auto &R : MappingRegions) {
228 FileLineRanges[R.FileID].first =
229 std::min(FileLineRanges[R.FileID].first, R.LineStart);
230 FileLineRanges[R.FileID].second =
231 std::max(FileLineRanges[R.FileID].second, R.LineEnd);
232 }
233
234 auto SkippedRanges = CVM.getSourceInfo().getSkippedRanges();
235 for (const auto &I : SkippedRanges) {
236 auto LocStart = I.getBegin();
237 auto LocEnd = I.getEnd();
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000238 assert(SM.isWrittenInSameFile(LocStart, LocEnd) &&
239 "region spans multiple files");
Alex Lorenzee024992014-08-04 18:41:51 +0000240
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000241 auto CovFileID = getCoverageFileID(LocStart);
Justin Bogner903678c2015-01-24 20:22:32 +0000242 if (!CovFileID)
Alex Lorenzee024992014-08-04 18:41:51 +0000243 continue;
244 unsigned LineStart = SM.getSpellingLineNumber(LocStart);
245 unsigned ColumnStart = SM.getSpellingColumnNumber(LocStart);
246 unsigned LineEnd = SM.getSpellingLineNumber(LocEnd);
247 unsigned ColumnEnd = SM.getSpellingColumnNumber(LocEnd);
Justin Bognerfd34280b2015-02-03 23:59:48 +0000248 auto Region = CounterMappingRegion::makeSkipped(
249 *CovFileID, LineStart, ColumnStart, LineEnd, ColumnEnd);
Alex Lorenzee024992014-08-04 18:41:51 +0000250 // Make sure that we only collect the regions that are inside
251 // the souce code of this function.
Justin Bogner903678c2015-01-24 20:22:32 +0000252 if (Region.LineStart >= FileLineRanges[*CovFileID].first &&
253 Region.LineEnd <= FileLineRanges[*CovFileID].second)
Alex Lorenzee024992014-08-04 18:41:51 +0000254 MappingRegions.push_back(Region);
255 }
256 }
257
Alex Lorenzee024992014-08-04 18:41:51 +0000258 /// \brief Generate the coverage counter mapping regions from collected
259 /// source regions.
Igor Kudrinfc05ee32016-08-31 07:04:16 +0000260 void emitSourceRegions(const SourceRegionFilter &Filter) {
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000261 for (const auto &Region : SourceRegions) {
262 assert(Region.hasEndLoc() && "incomplete region");
Alex Lorenzee024992014-08-04 18:41:51 +0000263
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000264 SourceLocation LocStart = Region.getStartLoc();
Yaron Keren8b563662015-10-03 10:46:20 +0000265 assert(SM.getFileID(LocStart).isValid() && "region in invalid file");
Justin Bognerf59329b2014-10-01 03:33:52 +0000266
Vedant Kumar93205af2016-07-11 22:57:46 +0000267 // Ignore regions from system headers.
268 if (SM.isInSystemHeader(SM.getSpellingLoc(LocStart)))
269 continue;
270
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000271 auto CovFileID = getCoverageFileID(LocStart);
272 // Ignore regions that don't have a file, such as builtin macros.
273 if (!CovFileID)
Alex Lorenzee024992014-08-04 18:41:51 +0000274 continue;
275
Justin Bognerf14b2072015-03-25 04:13:49 +0000276 SourceLocation LocEnd = Region.getEndLoc();
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000277 assert(SM.isWrittenInSameFile(LocStart, LocEnd) &&
278 "region spans multiple files");
279
Igor Kudrinfc05ee32016-08-31 07:04:16 +0000280 // Don't add code regions for the area covered by expansion regions.
281 // This not only suppresses redundant regions, but sometimes prevents
282 // creating regions with wrong counters if, for example, a statement's
283 // body ends at the end of a nested macro.
284 if (Filter.count(std::make_pair(LocStart, LocEnd)))
285 continue;
286
Justin Bognerf59329b2014-10-01 03:33:52 +0000287 // Find the spilling locations for the mapping region.
Alex Lorenzee024992014-08-04 18:41:51 +0000288 unsigned LineStart = SM.getSpellingLineNumber(LocStart);
289 unsigned ColumnStart = SM.getSpellingColumnNumber(LocStart);
290 unsigned LineEnd = SM.getSpellingLineNumber(LocEnd);
291 unsigned ColumnEnd = SM.getSpellingColumnNumber(LocEnd);
292
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000293 assert(LineStart <= LineEnd && "region start and end out of order");
294 MappingRegions.push_back(CounterMappingRegion::makeRegion(
295 Region.getCounter(), *CovFileID, LineStart, ColumnStart, LineEnd,
296 ColumnEnd));
297 }
298 }
299
300 /// \brief Generate expansion regions for each virtual file we've seen.
Igor Kudrinfc05ee32016-08-31 07:04:16 +0000301 SourceRegionFilter emitExpansionRegions() {
302 SourceRegionFilter Filter;
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000303 for (const auto &FM : FileIDMapping) {
304 SourceLocation ExpandedLoc = FM.second.second;
305 SourceLocation ParentLoc = getIncludeOrExpansionLoc(ExpandedLoc);
306 if (ParentLoc.isInvalid())
Alex Lorenzee024992014-08-04 18:41:51 +0000307 continue;
308
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000309 auto ParentFileID = getCoverageFileID(ParentLoc);
310 if (!ParentFileID)
311 continue;
312 auto ExpandedFileID = getCoverageFileID(ExpandedLoc);
313 assert(ExpandedFileID && "expansion in uncovered file");
314
315 SourceLocation LocEnd = getPreciseTokenLocEnd(ParentLoc);
316 assert(SM.isWrittenInSameFile(ParentLoc, LocEnd) &&
317 "region spans multiple files");
Igor Kudrinfc05ee32016-08-31 07:04:16 +0000318 Filter.insert(std::make_pair(ParentLoc, LocEnd));
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000319
320 unsigned LineStart = SM.getSpellingLineNumber(ParentLoc);
321 unsigned ColumnStart = SM.getSpellingColumnNumber(ParentLoc);
322 unsigned LineEnd = SM.getSpellingLineNumber(LocEnd);
323 unsigned ColumnEnd = SM.getSpellingColumnNumber(LocEnd);
324
325 MappingRegions.push_back(CounterMappingRegion::makeExpansion(
326 *ParentFileID, *ExpandedFileID, LineStart, ColumnStart, LineEnd,
Justin Bognerfd34280b2015-02-03 23:59:48 +0000327 ColumnEnd));
Alex Lorenzee024992014-08-04 18:41:51 +0000328 }
Igor Kudrinfc05ee32016-08-31 07:04:16 +0000329 return Filter;
Alex Lorenzee024992014-08-04 18:41:51 +0000330 }
331};
332
333/// \brief Creates unreachable coverage regions for the functions that
334/// are not emitted.
335struct EmptyCoverageMappingBuilder : public CoverageMappingBuilder {
336 EmptyCoverageMappingBuilder(CoverageMappingModuleGen &CVM, SourceManager &SM,
337 const LangOptions &LangOpts)
338 : CoverageMappingBuilder(CVM, SM, LangOpts) {}
339
340 void VisitDecl(const Decl *D) {
341 if (!D->hasBody())
342 return;
343 auto Body = D->getBody();
Igor Kudrind9e1a612016-06-07 10:07:51 +0000344 SourceLocation Start = getStart(Body);
345 SourceLocation End = getEnd(Body);
346 if (!SM.isWrittenInSameFile(Start, End)) {
347 // Walk up to find the common ancestor.
348 // Correct the locations accordingly.
349 FileID StartFileID = SM.getFileID(Start);
350 FileID EndFileID = SM.getFileID(End);
351 while (StartFileID != EndFileID && !isNestedIn(End, StartFileID)) {
352 Start = getIncludeOrExpansionLoc(Start);
353 assert(Start.isValid() &&
354 "Declaration start location not nested within a known region");
355 StartFileID = SM.getFileID(Start);
356 }
357 while (StartFileID != EndFileID) {
358 End = getPreciseTokenLocEnd(getIncludeOrExpansionLoc(End));
359 assert(End.isValid() &&
360 "Declaration end location not nested within a known region");
361 EndFileID = SM.getFileID(End);
362 }
363 }
364 SourceRegions.emplace_back(Counter(), Start, End);
Alex Lorenzee024992014-08-04 18:41:51 +0000365 }
366
367 /// \brief Write the mapping data to the output stream
368 void write(llvm::raw_ostream &OS) {
Alex Lorenzee024992014-08-04 18:41:51 +0000369 SmallVector<unsigned, 16> FileIDMapping;
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000370 gatherFileIDs(FileIDMapping);
Igor Kudrinfc05ee32016-08-31 07:04:16 +0000371 emitSourceRegions(SourceRegionFilter());
Alex Lorenzee024992014-08-04 18:41:51 +0000372
Vedant Kumarefd319a2016-07-26 00:24:59 +0000373 if (MappingRegions.empty())
374 return;
375
Craig Topper5fc8fc22014-08-27 06:28:36 +0000376 CoverageMappingWriter Writer(FileIDMapping, None, MappingRegions);
Alex Lorenzee024992014-08-04 18:41:51 +0000377 Writer.write(OS);
378 }
379};
380
381/// \brief A StmtVisitor that creates coverage mapping regions which map
382/// from the source code locations to the PGO counters.
383struct CounterCoverageMappingBuilder
384 : public CoverageMappingBuilder,
385 public ConstStmtVisitor<CounterCoverageMappingBuilder> {
386 /// \brief The map of statements to count values.
387 llvm::DenseMap<const Stmt *, unsigned> &CounterMap;
388
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000389 /// \brief A stack of currently live regions.
390 std::vector<SourceMappingRegion> RegionStack;
Alex Lorenzee024992014-08-04 18:41:51 +0000391
392 CounterExpressionBuilder Builder;
393
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000394 /// \brief A location in the most recently visited file or macro.
395 ///
396 /// This is used to adjust the active source regions appropriately when
397 /// expressions cross file or macro boundaries.
398 SourceLocation MostRecentLocation;
399
400 /// \brief Return a counter for the subtraction of \c RHS from \c LHS
Alex Lorenzee024992014-08-04 18:41:51 +0000401 Counter subtractCounters(Counter LHS, Counter RHS) {
402 return Builder.subtract(LHS, RHS);
403 }
404
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000405 /// \brief Return a counter for the sum of \c LHS and \c RHS.
Alex Lorenzee024992014-08-04 18:41:51 +0000406 Counter addCounters(Counter LHS, Counter RHS) {
407 return Builder.add(LHS, RHS);
408 }
409
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000410 Counter addCounters(Counter C1, Counter C2, Counter C3) {
411 return addCounters(addCounters(C1, C2), C3);
412 }
413
Alex Lorenzee024992014-08-04 18:41:51 +0000414 /// \brief Return the region counter for the given statement.
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000415 ///
Alex Lorenzee024992014-08-04 18:41:51 +0000416 /// This should only be called on statements that have a dedicated counter.
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000417 Counter getRegionCounter(const Stmt *S) {
418 return Counter::getCounter(CounterMap[S]);
Alex Lorenzee024992014-08-04 18:41:51 +0000419 }
420
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000421 /// \brief Push a region onto the stack.
422 ///
423 /// Returns the index on the stack where the region was pushed. This can be
424 /// used with popRegions to exit a "scope", ending the region that was pushed.
425 size_t pushRegion(Counter Count, Optional<SourceLocation> StartLoc = None,
426 Optional<SourceLocation> EndLoc = None) {
427 if (StartLoc)
428 MostRecentLocation = *StartLoc;
429 RegionStack.emplace_back(Count, StartLoc, EndLoc);
Alex Lorenzee024992014-08-04 18:41:51 +0000430
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000431 return RegionStack.size() - 1;
Alex Lorenzee024992014-08-04 18:41:51 +0000432 }
433
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000434 /// \brief Pop regions from the stack into the function's list of regions.
435 ///
436 /// Adds all regions from \c ParentIndex to the top of the stack to the
437 /// function's \c SourceRegions.
438 void popRegions(size_t ParentIndex) {
439 assert(RegionStack.size() >= ParentIndex && "parent not in stack");
440 while (RegionStack.size() > ParentIndex) {
441 SourceMappingRegion &Region = RegionStack.back();
442 if (Region.hasStartLoc()) {
443 SourceLocation StartLoc = Region.getStartLoc();
444 SourceLocation EndLoc = Region.hasEndLoc()
445 ? Region.getEndLoc()
446 : RegionStack[ParentIndex].getEndLoc();
447 while (!SM.isWrittenInSameFile(StartLoc, EndLoc)) {
448 // The region ends in a nested file or macro expansion. Create a
449 // separate region for each expansion.
450 SourceLocation NestedLoc = getStartOfFileOrMacro(EndLoc);
451 assert(SM.isWrittenInSameFile(NestedLoc, EndLoc));
452
Igor Kudrin8545dae2016-08-29 11:48:50 +0000453 if (!isRegionAlreadyAdded(NestedLoc, EndLoc))
454 SourceRegions.emplace_back(Region.getCounter(), NestedLoc, EndLoc);
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000455
Justin Bognerf14b2072015-03-25 04:13:49 +0000456 EndLoc = getPreciseTokenLocEnd(getIncludeOrExpansionLoc(EndLoc));
Justin Bognerdceaaad2015-07-17 23:31:21 +0000457 if (EndLoc.isInvalid())
458 llvm::report_fatal_error("File exit not handled before popRegions");
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000459 }
460 Region.setEndLoc(EndLoc);
461
462 MostRecentLocation = EndLoc;
463 // If this region happens to span an entire expansion, we need to make
464 // sure we don't overlap the parent region with it.
465 if (StartLoc == getStartOfFileOrMacro(StartLoc) &&
466 EndLoc == getEndOfFileOrMacro(EndLoc))
467 MostRecentLocation = getIncludeOrExpansionLoc(EndLoc);
468
469 assert(SM.isWrittenInSameFile(Region.getStartLoc(), EndLoc));
Craig Topperf36a5c42015-09-26 05:10:16 +0000470 SourceRegions.push_back(Region);
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000471 }
472 RegionStack.pop_back();
473 }
Alex Lorenzee024992014-08-04 18:41:51 +0000474 }
475
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000476 /// \brief Return the currently active region.
477 SourceMappingRegion &getRegion() {
478 assert(!RegionStack.empty() && "statement has no region");
479 return RegionStack.back();
480 }
Alex Lorenzee024992014-08-04 18:41:51 +0000481
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000482 /// \brief Propagate counts through the children of \c S.
483 Counter propagateCounts(Counter TopCount, const Stmt *S) {
Vedant Kumar78386962017-07-27 02:20:20 +0000484 SourceLocation StartLoc = getStart(S);
485 SourceLocation EndLoc = getEnd(S);
486 size_t Index = pushRegion(TopCount, StartLoc, EndLoc);
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000487 Visit(S);
488 Counter ExitCount = getRegion().getCounter();
489 popRegions(Index);
Vedant Kumar39f01972016-02-08 19:25:45 +0000490
491 // The statement may be spanned by an expansion. Make sure we handle a file
492 // exit out of this expansion before moving to the next statement.
Vedant Kumar78386962017-07-27 02:20:20 +0000493 if (SM.isBeforeInTranslationUnit(StartLoc, S->getLocStart()))
494 MostRecentLocation = EndLoc;
Vedant Kumar39f01972016-02-08 19:25:45 +0000495
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000496 return ExitCount;
497 }
Alex Lorenzee024992014-08-04 18:41:51 +0000498
Igor Kudrin0a7c9d12016-05-04 15:38:26 +0000499 /// \brief Check whether a region with bounds \c StartLoc and \c EndLoc
500 /// is already added to \c SourceRegions.
501 bool isRegionAlreadyAdded(SourceLocation StartLoc, SourceLocation EndLoc) {
502 return SourceRegions.rend() !=
503 std::find_if(SourceRegions.rbegin(), SourceRegions.rend(),
504 [&](const SourceMappingRegion &Region) {
505 return Region.getStartLoc() == StartLoc &&
506 Region.getEndLoc() == EndLoc;
507 });
508 }
509
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000510 /// \brief Adjust the most recently visited location to \c EndLoc.
511 ///
512 /// This should be used after visiting any statements in non-source order.
513 void adjustForOutOfOrderTraversal(SourceLocation EndLoc) {
514 MostRecentLocation = EndLoc;
Igor Kudrin0a7c9d12016-05-04 15:38:26 +0000515 // The code region for a whole macro is created in handleFileExit() when
516 // it detects exiting of the virtual file of that macro. If we visited
517 // statements in non-source order, we might already have such a region
518 // added, for example, if a body of a loop is divided among multiple
519 // macros. Avoid adding duplicate regions in such case.
Justin Bogner96ae73f2015-05-01 19:23:34 +0000520 if (getRegion().hasEndLoc() &&
Igor Kudrin0a7c9d12016-05-04 15:38:26 +0000521 MostRecentLocation == getEndOfFileOrMacro(MostRecentLocation) &&
522 isRegionAlreadyAdded(getStartOfFileOrMacro(MostRecentLocation),
523 MostRecentLocation))
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000524 MostRecentLocation = getIncludeOrExpansionLoc(MostRecentLocation);
525 }
Alex Lorenzee024992014-08-04 18:41:51 +0000526
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000527 /// \brief Adjust regions and state when \c NewLoc exits a file.
528 ///
529 /// If moving from our most recently tracked location to \c NewLoc exits any
530 /// files, this adjusts our current region stack and creates the file regions
531 /// for the exited file.
532 void handleFileExit(SourceLocation NewLoc) {
Justin Bognere44dd6d2015-06-23 20:29:09 +0000533 if (NewLoc.isInvalid() ||
534 SM.isWrittenInSameFile(MostRecentLocation, NewLoc))
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000535 return;
536
537 // If NewLoc is not in a file that contains MostRecentLocation, walk up to
538 // find the common ancestor.
539 SourceLocation LCA = NewLoc;
540 FileID ParentFile = SM.getFileID(LCA);
541 while (!isNestedIn(MostRecentLocation, ParentFile)) {
542 LCA = getIncludeOrExpansionLoc(LCA);
543 if (LCA.isInvalid() || SM.isWrittenInSameFile(LCA, MostRecentLocation)) {
544 // Since there isn't a common ancestor, no file was exited. We just need
545 // to adjust our location to the new file.
546 MostRecentLocation = NewLoc;
547 return;
548 }
549 ParentFile = SM.getFileID(LCA);
Alex Lorenzee024992014-08-04 18:41:51 +0000550 }
551
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000552 llvm::SmallSet<SourceLocation, 8> StartLocs;
553 Optional<Counter> ParentCounter;
Pete Cooper57d3f142015-07-30 17:22:52 +0000554 for (SourceMappingRegion &I : llvm::reverse(RegionStack)) {
555 if (!I.hasStartLoc())
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000556 continue;
Pete Cooper57d3f142015-07-30 17:22:52 +0000557 SourceLocation Loc = I.getStartLoc();
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000558 if (!isNestedIn(Loc, ParentFile)) {
Pete Cooper57d3f142015-07-30 17:22:52 +0000559 ParentCounter = I.getCounter();
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000560 break;
561 }
Alex Lorenzee024992014-08-04 18:41:51 +0000562
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000563 while (!SM.isInFileID(Loc, ParentFile)) {
564 // The most nested region for each start location is the one with the
565 // correct count. We avoid creating redundant regions by stopping once
566 // we've seen this region.
567 if (StartLocs.insert(Loc).second)
Pete Cooper57d3f142015-07-30 17:22:52 +0000568 SourceRegions.emplace_back(I.getCounter(), Loc,
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000569 getEndOfFileOrMacro(Loc));
570 Loc = getIncludeOrExpansionLoc(Loc);
571 }
Pete Cooper57d3f142015-07-30 17:22:52 +0000572 I.setStartLoc(getPreciseTokenLocEnd(Loc));
Alex Lorenzee024992014-08-04 18:41:51 +0000573 }
574
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000575 if (ParentCounter) {
576 // If the file is contained completely by another region and doesn't
577 // immediately start its own region, the whole file gets a region
578 // corresponding to the parent.
579 SourceLocation Loc = MostRecentLocation;
580 while (isNestedIn(Loc, ParentFile)) {
581 SourceLocation FileStart = getStartOfFileOrMacro(Loc);
582 if (StartLocs.insert(FileStart).second)
583 SourceRegions.emplace_back(*ParentCounter, FileStart,
584 getEndOfFileOrMacro(Loc));
585 Loc = getIncludeOrExpansionLoc(Loc);
586 }
Alex Lorenzee024992014-08-04 18:41:51 +0000587 }
588
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000589 MostRecentLocation = NewLoc;
590 }
Alex Lorenzee024992014-08-04 18:41:51 +0000591
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000592 /// \brief Ensure that \c S is included in the current region.
593 void extendRegion(const Stmt *S) {
594 SourceMappingRegion &Region = getRegion();
595 SourceLocation StartLoc = getStart(S);
Alex Lorenzee024992014-08-04 18:41:51 +0000596
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000597 handleFileExit(StartLoc);
598 if (!Region.hasStartLoc())
599 Region.setStartLoc(StartLoc);
600 }
601
602 /// \brief Mark \c S as a terminator, starting a zero region.
603 void terminateRegion(const Stmt *S) {
604 extendRegion(S);
605 SourceMappingRegion &Region = getRegion();
606 if (!Region.hasEndLoc())
607 Region.setEndLoc(getEnd(S));
608 pushRegion(Counter::getZero());
609 }
Alex Lorenzee024992014-08-04 18:41:51 +0000610
611 /// \brief Keep counts of breaks and continues inside loops.
612 struct BreakContinue {
613 Counter BreakCount;
614 Counter ContinueCount;
615 };
616 SmallVector<BreakContinue, 8> BreakContinueStack;
617
618 CounterCoverageMappingBuilder(
619 CoverageMappingModuleGen &CVM,
Justin Bognere5ee6c52014-10-02 16:44:01 +0000620 llvm::DenseMap<const Stmt *, unsigned> &CounterMap, SourceManager &SM,
Alex Lorenzee024992014-08-04 18:41:51 +0000621 const LangOptions &LangOpts)
Justin Bognere5ee6c52014-10-02 16:44:01 +0000622 : CoverageMappingBuilder(CVM, SM, LangOpts), CounterMap(CounterMap) {}
Alex Lorenzee024992014-08-04 18:41:51 +0000623
624 /// \brief Write the mapping data to the output stream
625 void write(llvm::raw_ostream &OS) {
Alex Lorenzee024992014-08-04 18:41:51 +0000626 llvm::SmallVector<unsigned, 8> VirtualFileMapping;
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000627 gatherFileIDs(VirtualFileMapping);
Igor Kudrinfc05ee32016-08-31 07:04:16 +0000628 SourceRegionFilter Filter = emitExpansionRegions();
629 emitSourceRegions(Filter);
Alex Lorenzee024992014-08-04 18:41:51 +0000630 gatherSkippedRegions();
631
Vedant Kumarefd319a2016-07-26 00:24:59 +0000632 if (MappingRegions.empty())
633 return;
634
Justin Bogner4da909b2015-02-03 21:35:49 +0000635 CoverageMappingWriter Writer(VirtualFileMapping, Builder.getExpressions(),
636 MappingRegions);
Alex Lorenzee024992014-08-04 18:41:51 +0000637 Writer.write(OS);
638 }
639
Alex Lorenzee024992014-08-04 18:41:51 +0000640 void VisitStmt(const Stmt *S) {
Yaron Kerened1fe5d2015-10-03 05:15:57 +0000641 if (S->getLocStart().isValid())
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000642 extendRegion(S);
Benjamin Kramer642f1732015-07-02 21:03:14 +0000643 for (const Stmt *Child : S->children())
644 if (Child)
645 this->Visit(Child);
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000646 handleFileExit(getEnd(S));
Alex Lorenzee024992014-08-04 18:41:51 +0000647 }
648
Alex Lorenzee024992014-08-04 18:41:51 +0000649 void VisitDecl(const Decl *D) {
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000650 Stmt *Body = D->getBody();
Vedant Kumarefd319a2016-07-26 00:24:59 +0000651
652 // Do not propagate region counts into system headers.
653 if (Body && SM.isInSystemHeader(SM.getSpellingLoc(getStart(Body))))
654 return;
655
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000656 propagateCounts(getRegionCounter(Body), Body);
Alex Lorenzee024992014-08-04 18:41:51 +0000657 }
658
659 void VisitReturnStmt(const ReturnStmt *S) {
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000660 extendRegion(S);
Alex Lorenzee024992014-08-04 18:41:51 +0000661 if (S->getRetValue())
662 Visit(S->getRetValue());
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000663 terminateRegion(S);
Alex Lorenzee024992014-08-04 18:41:51 +0000664 }
665
Justin Bognerf959feb2015-04-28 06:31:55 +0000666 void VisitCXXThrowExpr(const CXXThrowExpr *E) {
667 extendRegion(E);
668 if (E->getSubExpr())
669 Visit(E->getSubExpr());
670 terminateRegion(E);
671 }
672
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000673 void VisitGotoStmt(const GotoStmt *S) { terminateRegion(S); }
Alex Lorenzee024992014-08-04 18:41:51 +0000674
675 void VisitLabelStmt(const LabelStmt *S) {
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000676 SourceLocation Start = getStart(S);
677 // We can't extendRegion here or we risk overlapping with our new region.
678 handleFileExit(Start);
679 pushRegion(getRegionCounter(S), Start);
Alex Lorenzee024992014-08-04 18:41:51 +0000680 Visit(S->getSubStmt());
681 }
682
683 void VisitBreakStmt(const BreakStmt *S) {
Alex Lorenzee024992014-08-04 18:41:51 +0000684 assert(!BreakContinueStack.empty() && "break not in a loop or switch!");
685 BreakContinueStack.back().BreakCount = addCounters(
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000686 BreakContinueStack.back().BreakCount, getRegion().getCounter());
687 terminateRegion(S);
Alex Lorenzee024992014-08-04 18:41:51 +0000688 }
689
690 void VisitContinueStmt(const ContinueStmt *S) {
Alex Lorenzee024992014-08-04 18:41:51 +0000691 assert(!BreakContinueStack.empty() && "continue stmt not in a loop!");
692 BreakContinueStack.back().ContinueCount = addCounters(
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000693 BreakContinueStack.back().ContinueCount, getRegion().getCounter());
694 terminateRegion(S);
Alex Lorenzee024992014-08-04 18:41:51 +0000695 }
696
697 void VisitWhileStmt(const WhileStmt *S) {
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000698 extendRegion(S);
Alex Lorenzee024992014-08-04 18:41:51 +0000699
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000700 Counter ParentCount = getRegion().getCounter();
701 Counter BodyCount = getRegionCounter(S);
702
703 // Handle the body first so that we can get the backedge count.
704 BreakContinueStack.push_back(BreakContinue());
705 extendRegion(S->getBody());
706 Counter BackedgeCount = propagateCounts(BodyCount, S->getBody());
Alex Lorenzee024992014-08-04 18:41:51 +0000707 BreakContinue BC = BreakContinueStack.pop_back_val();
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000708
709 // Go back to handle the condition.
710 Counter CondCount =
711 addCounters(ParentCount, BackedgeCount, BC.ContinueCount);
712 propagateCounts(CondCount, S->getCond());
713 adjustForOutOfOrderTraversal(getEnd(S));
714
715 Counter OutCount =
716 addCounters(BC.BreakCount, subtractCounters(CondCount, BodyCount));
717 if (OutCount != ParentCount)
718 pushRegion(OutCount);
Alex Lorenzee024992014-08-04 18:41:51 +0000719 }
720
721 void VisitDoStmt(const DoStmt *S) {
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000722 extendRegion(S);
Alex Lorenzee024992014-08-04 18:41:51 +0000723
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000724 Counter ParentCount = getRegion().getCounter();
725 Counter BodyCount = getRegionCounter(S);
726
727 BreakContinueStack.push_back(BreakContinue());
728 extendRegion(S->getBody());
729 Counter BackedgeCount =
730 propagateCounts(addCounters(ParentCount, BodyCount), S->getBody());
Alex Lorenzee024992014-08-04 18:41:51 +0000731 BreakContinue BC = BreakContinueStack.pop_back_val();
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000732
733 Counter CondCount = addCounters(BackedgeCount, BC.ContinueCount);
734 propagateCounts(CondCount, S->getCond());
735
736 Counter OutCount =
737 addCounters(BC.BreakCount, subtractCounters(CondCount, BodyCount));
738 if (OutCount != ParentCount)
739 pushRegion(OutCount);
Alex Lorenzee024992014-08-04 18:41:51 +0000740 }
741
742 void VisitForStmt(const ForStmt *S) {
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000743 extendRegion(S);
Alex Lorenzee024992014-08-04 18:41:51 +0000744 if (S->getInit())
745 Visit(S->getInit());
746
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000747 Counter ParentCount = getRegion().getCounter();
748 Counter BodyCount = getRegionCounter(S);
749
750 // Handle the body first so that we can get the backedge count.
Alex Lorenzee024992014-08-04 18:41:51 +0000751 BreakContinueStack.push_back(BreakContinue());
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000752 extendRegion(S->getBody());
753 Counter BackedgeCount = propagateCounts(BodyCount, S->getBody());
754 BreakContinue BC = BreakContinueStack.pop_back_val();
Alex Lorenzee024992014-08-04 18:41:51 +0000755
756 // The increment is essentially part of the body but it needs to include
757 // the count for all the continue statements.
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000758 if (const Stmt *Inc = S->getInc())
759 propagateCounts(addCounters(BackedgeCount, BC.ContinueCount), Inc);
760
761 // Go back to handle the condition.
762 Counter CondCount =
763 addCounters(ParentCount, BackedgeCount, BC.ContinueCount);
764 if (const Expr *Cond = S->getCond()) {
765 propagateCounts(CondCount, Cond);
766 adjustForOutOfOrderTraversal(getEnd(S));
Alex Lorenzee024992014-08-04 18:41:51 +0000767 }
768
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000769 Counter OutCount =
770 addCounters(BC.BreakCount, subtractCounters(CondCount, BodyCount));
771 if (OutCount != ParentCount)
772 pushRegion(OutCount);
Alex Lorenzee024992014-08-04 18:41:51 +0000773 }
774
775 void VisitCXXForRangeStmt(const CXXForRangeStmt *S) {
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000776 extendRegion(S);
777 Visit(S->getLoopVarStmt());
Alex Lorenzee024992014-08-04 18:41:51 +0000778 Visit(S->getRangeStmt());
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000779
780 Counter ParentCount = getRegion().getCounter();
781 Counter BodyCount = getRegionCounter(S);
782
Alex Lorenzee024992014-08-04 18:41:51 +0000783 BreakContinueStack.push_back(BreakContinue());
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000784 extendRegion(S->getBody());
785 Counter BackedgeCount = propagateCounts(BodyCount, S->getBody());
Alex Lorenzee024992014-08-04 18:41:51 +0000786 BreakContinue BC = BreakContinueStack.pop_back_val();
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000787
Justin Bogner15874322015-04-30 21:31:02 +0000788 Counter LoopCount =
789 addCounters(ParentCount, BackedgeCount, BC.ContinueCount);
790 Counter OutCount =
791 addCounters(BC.BreakCount, subtractCounters(LoopCount, BodyCount));
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000792 if (OutCount != ParentCount)
793 pushRegion(OutCount);
Alex Lorenzee024992014-08-04 18:41:51 +0000794 }
795
796 void VisitObjCForCollectionStmt(const ObjCForCollectionStmt *S) {
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000797 extendRegion(S);
Alex Lorenzee024992014-08-04 18:41:51 +0000798 Visit(S->getElement());
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000799
800 Counter ParentCount = getRegion().getCounter();
801 Counter BodyCount = getRegionCounter(S);
802
Alex Lorenzee024992014-08-04 18:41:51 +0000803 BreakContinueStack.push_back(BreakContinue());
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000804 extendRegion(S->getBody());
805 Counter BackedgeCount = propagateCounts(BodyCount, S->getBody());
Alex Lorenzee024992014-08-04 18:41:51 +0000806 BreakContinue BC = BreakContinueStack.pop_back_val();
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000807
Justin Bogner15874322015-04-30 21:31:02 +0000808 Counter LoopCount =
809 addCounters(ParentCount, BackedgeCount, BC.ContinueCount);
810 Counter OutCount =
811 addCounters(BC.BreakCount, subtractCounters(LoopCount, BodyCount));
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000812 if (OutCount != ParentCount)
813 pushRegion(OutCount);
Alex Lorenzee024992014-08-04 18:41:51 +0000814 }
815
816 void VisitSwitchStmt(const SwitchStmt *S) {
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000817 extendRegion(S);
Vedant Kumarf2a6ec52016-10-14 23:38:13 +0000818 if (S->getInit())
819 Visit(S->getInit());
Alex Lorenzee024992014-08-04 18:41:51 +0000820 Visit(S->getCond());
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000821
Alex Lorenzee024992014-08-04 18:41:51 +0000822 BreakContinueStack.push_back(BreakContinue());
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000823
824 const Stmt *Body = S->getBody();
825 extendRegion(Body);
826 if (const auto *CS = dyn_cast<CompoundStmt>(Body)) {
827 if (!CS->body_empty()) {
828 // The body of the switch needs a zero region so that fallthrough counts
829 // behave correctly, but it would be misleading to include the braces of
830 // the compound statement in the zeroed area, so we need to handle this
831 // specially.
832 size_t Index =
833 pushRegion(Counter::getZero(), getStart(CS->body_front()),
834 getEnd(CS->body_back()));
Richard Trieub5841332015-04-15 01:21:42 +0000835 for (const auto *Child : CS->children())
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000836 Visit(Child);
837 popRegions(Index);
Alex Lorenzee024992014-08-04 18:41:51 +0000838 }
Vedant Kumar87ea3b02016-05-31 20:35:12 +0000839 } else
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000840 propagateCounts(Counter::getZero(), Body);
Alex Lorenzee024992014-08-04 18:41:51 +0000841 BreakContinue BC = BreakContinueStack.pop_back_val();
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000842
Alex Lorenzee024992014-08-04 18:41:51 +0000843 if (!BreakContinueStack.empty())
844 BreakContinueStack.back().ContinueCount = addCounters(
845 BreakContinueStack.back().ContinueCount, BC.ContinueCount);
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000846
847 Counter ExitCount = getRegionCounter(S);
Vedant Kumar38364822016-05-31 18:06:19 +0000848 SourceLocation ExitLoc = getEnd(S);
Alex Lorenz08780522016-09-27 23:30:36 +0000849 pushRegion(ExitCount);
850
851 // Ensure that handleFileExit recognizes when the end location is located
852 // in a different file.
853 MostRecentLocation = getStart(S);
Vedant Kumar38364822016-05-31 18:06:19 +0000854 handleFileExit(ExitLoc);
Alex Lorenzee024992014-08-04 18:41:51 +0000855 }
856
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000857 void VisitSwitchCase(const SwitchCase *S) {
858 extendRegion(S);
Alex Lorenzee024992014-08-04 18:41:51 +0000859
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000860 SourceMappingRegion &Parent = getRegion();
861
862 Counter Count = addCounters(Parent.getCounter(), getRegionCounter(S));
863 // Reuse the existing region if it starts at our label. This is typical of
864 // the first case in a switch.
865 if (Parent.hasStartLoc() && Parent.getStartLoc() == getStart(S))
866 Parent.setCounter(Count);
867 else
868 pushRegion(Count, getStart(S));
869
Sanjay Patel376c06c2015-12-24 21:11:29 +0000870 if (const auto *CS = dyn_cast<CaseStmt>(S)) {
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000871 Visit(CS->getLHS());
872 if (const Expr *RHS = CS->getRHS())
873 Visit(RHS);
874 }
Alex Lorenzee024992014-08-04 18:41:51 +0000875 Visit(S->getSubStmt());
876 }
877
878 void VisitIfStmt(const IfStmt *S) {
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000879 extendRegion(S);
Vedant Kumar9d2a16b2016-10-14 23:38:16 +0000880 if (S->getInit())
881 Visit(S->getInit());
882
Justin Bogner055ebc32015-06-16 06:24:15 +0000883 // Extend into the condition before we propagate through it below - this is
884 // needed to handle macros that generate the "if" but not the condition.
885 extendRegion(S->getCond());
Alex Lorenzee024992014-08-04 18:41:51 +0000886
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000887 Counter ParentCount = getRegion().getCounter();
888 Counter ThenCount = getRegionCounter(S);
Alex Lorenzee024992014-08-04 18:41:51 +0000889
Justin Bogner91f2e3c2015-02-19 03:10:30 +0000890 // Emitting a counter for the condition makes it easier to interpret the
891 // counter for the body when looking at the coverage.
892 propagateCounts(ParentCount, S->getCond());
893
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000894 extendRegion(S->getThen());
895 Counter OutCount = propagateCounts(ThenCount, S->getThen());
896
897 Counter ElseCount = subtractCounters(ParentCount, ThenCount);
898 if (const Stmt *Else = S->getElse()) {
899 extendRegion(S->getElse());
900 OutCount = addCounters(OutCount, propagateCounts(ElseCount, Else));
901 } else
902 OutCount = addCounters(OutCount, ElseCount);
903
904 if (OutCount != ParentCount)
905 pushRegion(OutCount);
Alex Lorenzee024992014-08-04 18:41:51 +0000906 }
907
908 void VisitCXXTryStmt(const CXXTryStmt *S) {
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000909 extendRegion(S);
Vedant Kumar049908b2016-06-22 19:57:58 +0000910 // Handle macros that generate the "try" but not the rest.
911 extendRegion(S->getTryBlock());
912
913 Counter ParentCount = getRegion().getCounter();
914 propagateCounts(ParentCount, S->getTryBlock());
915
Alex Lorenzee024992014-08-04 18:41:51 +0000916 for (unsigned I = 0, E = S->getNumHandlers(); I < E; ++I)
917 Visit(S->getHandler(I));
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000918
919 Counter ExitCount = getRegionCounter(S);
920 pushRegion(ExitCount);
Alex Lorenzee024992014-08-04 18:41:51 +0000921 }
922
923 void VisitCXXCatchStmt(const CXXCatchStmt *S) {
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000924 propagateCounts(getRegionCounter(S), S->getHandlerBlock());
Alex Lorenzee024992014-08-04 18:41:51 +0000925 }
926
927 void VisitAbstractConditionalOperator(const AbstractConditionalOperator *E) {
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000928 extendRegion(E);
Alex Lorenzee024992014-08-04 18:41:51 +0000929
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000930 Counter ParentCount = getRegion().getCounter();
931 Counter TrueCount = getRegionCounter(E);
Alex Lorenzee024992014-08-04 18:41:51 +0000932
Justin Bognere3654ce2015-04-24 23:37:57 +0000933 Visit(E->getCond());
934
935 if (!isa<BinaryConditionalOperator>(E)) {
936 extendRegion(E->getTrueExpr());
937 propagateCounts(TrueCount, E->getTrueExpr());
938 }
939 extendRegion(E->getFalseExpr());
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000940 propagateCounts(subtractCounters(ParentCount, TrueCount),
941 E->getFalseExpr());
Alex Lorenzee024992014-08-04 18:41:51 +0000942 }
943
944 void VisitBinLAnd(const BinaryOperator *E) {
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000945 extendRegion(E);
Alex Lorenzee024992014-08-04 18:41:51 +0000946 Visit(E->getLHS());
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000947
948 extendRegion(E->getRHS());
949 propagateCounts(getRegionCounter(E), E->getRHS());
Alex Lorenzee024992014-08-04 18:41:51 +0000950 }
951
952 void VisitBinLOr(const BinaryOperator *E) {
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000953 extendRegion(E);
Alex Lorenzee024992014-08-04 18:41:51 +0000954 Visit(E->getLHS());
Alex Lorenzee024992014-08-04 18:41:51 +0000955
Justin Bognerbf42cfd2015-02-18 21:24:51 +0000956 extendRegion(E->getRHS());
957 propagateCounts(getRegionCounter(E), E->getRHS());
Alex Lorenz01a0d062014-08-20 17:10:56 +0000958 }
Justin Bognerc1091022015-02-24 04:13:56 +0000959
960 void VisitLambdaExpr(const LambdaExpr *LE) {
961 // Lambdas are treated as their own functions for now, so we shouldn't
962 // propagate counts into them.
963 }
Alex Lorenzee024992014-08-04 18:41:51 +0000964};
Alex Lorenzee024992014-08-04 18:41:51 +0000965
Xinliang David Li1f39fcf2017-04-14 04:14:29 +0000966std::string getCoverageSection(const CodeGenModule &CGM) {
Vedant Kumar8a767a42017-04-15 00:10:05 +0000967 return llvm::getInstrProfSectionName(
968 llvm::IPSK_covmap,
969 CGM.getContext().getTargetInfo().getTriple().getObjectFormat());
Alex Lorenzee024992014-08-04 18:41:51 +0000970}
971
Vedant Kumar14f8fb62016-07-18 21:01:27 +0000972std::string normalizeFilename(StringRef Filename) {
973 llvm::SmallString<256> Path(Filename);
Vedant Kumar14f8fb62016-07-18 21:01:27 +0000974 llvm::sys::fs::make_absolute(Path);
Vedant Kumard04929d2016-07-18 22:32:02 +0000975 llvm::sys::path::remove_dots(Path, /*remove_dot_dots=*/true);
Vedant Kumar14f8fb62016-07-18 21:01:27 +0000976 return Path.str().str();
977}
978
979} // end anonymous namespace
980
Justin Bognera432d172015-02-03 00:20:24 +0000981static void dump(llvm::raw_ostream &OS, StringRef FunctionName,
982 ArrayRef<CounterExpression> Expressions,
983 ArrayRef<CounterMappingRegion> Regions) {
984 OS << FunctionName << ":\n";
985 CounterMappingContext Ctx(Expressions);
986 for (const auto &R : Regions) {
Alex Lorenzf2cf38e2014-08-08 23:41:24 +0000987 OS.indent(2);
988 switch (R.Kind) {
989 case CounterMappingRegion::CodeRegion:
990 break;
991 case CounterMappingRegion::ExpansionRegion:
992 OS << "Expansion,";
993 break;
994 case CounterMappingRegion::SkippedRegion:
995 OS << "Skipped,";
996 break;
997 }
998
Justin Bogner4da909b2015-02-03 21:35:49 +0000999 OS << "File " << R.FileID << ", " << R.LineStart << ":" << R.ColumnStart
1000 << " -> " << R.LineEnd << ":" << R.ColumnEnd << " = ";
Justin Bognerf69dc342015-01-23 23:46:13 +00001001 Ctx.dump(R.Count, OS);
Alex Lorenzf2cf38e2014-08-08 23:41:24 +00001002 if (R.Kind == CounterMappingRegion::ExpansionRegion)
Justin Bogner4da909b2015-02-03 21:35:49 +00001003 OS << " (Expanded file = " << R.ExpandedFileID << ")";
1004 OS << "\n";
Alex Lorenzf2cf38e2014-08-08 23:41:24 +00001005 }
1006}
1007
Alex Lorenzee024992014-08-04 18:41:51 +00001008void CoverageMappingModuleGen::addFunctionMappingRecord(
Xinliang David Li2129ae52016-01-07 20:05:55 +00001009 llvm::GlobalVariable *NamePtr, StringRef NameValue, uint64_t FuncHash,
Xinliang David Li848da132016-01-19 00:49:06 +00001010 const std::string &CoverageMapping, bool IsUsed) {
Alex Lorenzee024992014-08-04 18:41:51 +00001011 llvm::LLVMContext &Ctx = CGM.getLLVMContext();
Alex Lorenzee024992014-08-04 18:41:51 +00001012 if (!FunctionRecordTy) {
Xinliang David Li2129ae52016-01-07 20:05:55 +00001013#define COVMAP_FUNC_RECORD(Type, LLVMType, Name, Init) LLVMType,
Xinliang David Lia026a432015-11-05 05:46:39 +00001014 llvm::Type *FunctionRecordTypes[] = {
1015 #include "llvm/ProfileData/InstrProfData.inc"
1016 };
Alex Lorenzee024992014-08-04 18:41:51 +00001017 FunctionRecordTy =
Justin Bogner4dc5adc2015-07-02 20:47:25 +00001018 llvm::StructType::get(Ctx, makeArrayRef(FunctionRecordTypes),
1019 /*isPacked=*/true);
Alex Lorenzee024992014-08-04 18:41:51 +00001020 }
1021
Xinliang David Lia026a432015-11-05 05:46:39 +00001022 #define COVMAP_FUNC_RECORD(Type, LLVMType, Name, Init) Init,
Alex Lorenzee024992014-08-04 18:41:51 +00001023 llvm::Constant *FunctionRecordVals[] = {
Xinliang David Lia026a432015-11-05 05:46:39 +00001024 #include "llvm/ProfileData/InstrProfData.inc"
1025 };
Alex Lorenzee024992014-08-04 18:41:51 +00001026 FunctionRecords.push_back(llvm::ConstantStruct::get(
1027 FunctionRecordTy, makeArrayRef(FunctionRecordVals)));
Xinliang David Li848da132016-01-19 00:49:06 +00001028 if (!IsUsed)
Xinliang David Li2129ae52016-01-07 20:05:55 +00001029 FunctionNames.push_back(
1030 llvm::ConstantExpr::getBitCast(NamePtr, llvm::Type::getInt8PtrTy(Ctx)));
Vedant Kumarca3326c2016-01-21 19:25:35 +00001031 CoverageMappings.push_back(CoverageMapping);
Alex Lorenzf2cf38e2014-08-08 23:41:24 +00001032
1033 if (CGM.getCodeGenOpts().DumpCoverageMapping) {
1034 // Dump the coverage mapping data for this function by decoding the
1035 // encoded data. This allows us to dump the mapping regions which were
1036 // also processed by the CoverageMappingWriter which performs
1037 // additional minimization operations such as reducing the number of
1038 // expressions.
1039 std::vector<StringRef> Filenames;
1040 std::vector<CounterExpression> Expressions;
1041 std::vector<CounterMappingRegion> Regions;
Jordan Roseb31ee812016-11-07 17:28:04 +00001042 llvm::SmallVector<std::string, 16> FilenameStrs;
Alex Lorenzf2cf38e2014-08-08 23:41:24 +00001043 llvm::SmallVector<StringRef, 16> FilenameRefs;
Jordan Roseb31ee812016-11-07 17:28:04 +00001044 FilenameStrs.resize(FileEntries.size());
Alex Lorenzf2cf38e2014-08-08 23:41:24 +00001045 FilenameRefs.resize(FileEntries.size());
Jordan Roseb31ee812016-11-07 17:28:04 +00001046 for (const auto &Entry : FileEntries) {
1047 auto I = Entry.second;
1048 FilenameStrs[I] = normalizeFilename(Entry.first->getName());
1049 FilenameRefs[I] = FilenameStrs[I];
1050 }
Justin Bognera432d172015-02-03 00:20:24 +00001051 RawCoverageMappingReader Reader(CoverageMapping, FilenameRefs, Filenames,
1052 Expressions, Regions);
1053 if (Reader.read())
Alex Lorenzf2cf38e2014-08-08 23:41:24 +00001054 return;
Xinliang David Lia026a432015-11-05 05:46:39 +00001055 dump(llvm::outs(), NameValue, Expressions, Regions);
Alex Lorenzf2cf38e2014-08-08 23:41:24 +00001056 }
Alex Lorenzee024992014-08-04 18:41:51 +00001057}
1058
1059void CoverageMappingModuleGen::emit() {
1060 if (FunctionRecords.empty())
1061 return;
1062 llvm::LLVMContext &Ctx = CGM.getLLVMContext();
1063 auto *Int32Ty = llvm::Type::getInt32Ty(Ctx);
1064
1065 // Create the filenames and merge them with coverage mappings
1066 llvm::SmallVector<std::string, 16> FilenameStrs;
Vedant Kumar9e324dd2016-06-29 05:33:09 +00001067 llvm::SmallVector<StringRef, 16> FilenameRefs;
Alex Lorenzee024992014-08-04 18:41:51 +00001068 FilenameStrs.resize(FileEntries.size());
Vedant Kumar9e324dd2016-06-29 05:33:09 +00001069 FilenameRefs.resize(FileEntries.size());
Alex Lorenzee024992014-08-04 18:41:51 +00001070 for (const auto &Entry : FileEntries) {
Alex Lorenzee024992014-08-04 18:41:51 +00001071 auto I = Entry.second;
Vedant Kumar14f8fb62016-07-18 21:01:27 +00001072 FilenameStrs[I] = normalizeFilename(Entry.first->getName());
Vedant Kumar9e324dd2016-06-29 05:33:09 +00001073 FilenameRefs[I] = FilenameStrs[I];
Alex Lorenzee024992014-08-04 18:41:51 +00001074 }
1075
Vedant Kumar9e324dd2016-06-29 05:33:09 +00001076 std::string FilenamesAndCoverageMappings;
1077 llvm::raw_string_ostream OS(FilenamesAndCoverageMappings);
1078 CoverageFilenamesSectionWriter(FilenameRefs).write(OS);
1079 std::string RawCoverageMappings =
1080 llvm::join(CoverageMappings.begin(), CoverageMappings.end(), "");
1081 OS << RawCoverageMappings;
1082 size_t CoverageMappingSize = RawCoverageMappings.size();
1083 size_t FilenamesSize = OS.str().size() - CoverageMappingSize;
1084 // Append extra zeroes if necessary to ensure that the size of the filenames
1085 // and coverage mappings is a multiple of 8.
1086 if (size_t Rem = OS.str().size() % 8) {
1087 CoverageMappingSize += 8 - Rem;
1088 for (size_t I = 0, S = 8 - Rem; I < S; ++I)
1089 OS << '\0';
Alex Lorenzee024992014-08-04 18:41:51 +00001090 }
1091 auto *FilenamesAndMappingsVal =
Vedant Kumar9e324dd2016-06-29 05:33:09 +00001092 llvm::ConstantDataArray::getString(Ctx, OS.str(), false);
Alex Lorenzee024992014-08-04 18:41:51 +00001093
1094 // Create the deferred function records array
1095 auto RecordsTy =
1096 llvm::ArrayType::get(FunctionRecordTy, FunctionRecords.size());
1097 auto RecordsVal = llvm::ConstantArray::get(RecordsTy, FunctionRecords);
1098
Xinliang David Li20b188c2016-01-03 19:25:54 +00001099 llvm::Type *CovDataHeaderTypes[] = {
1100#define COVMAP_HEADER(Type, LLVMType, Name, Init) LLVMType,
1101#include "llvm/ProfileData/InstrProfData.inc"
1102 };
1103 auto CovDataHeaderTy =
1104 llvm::StructType::get(Ctx, makeArrayRef(CovDataHeaderTypes));
1105 llvm::Constant *CovDataHeaderVals[] = {
1106#define COVMAP_HEADER(Type, LLVMType, Name, Init) Init,
1107#include "llvm/ProfileData/InstrProfData.inc"
1108 };
1109 auto CovDataHeaderVal = llvm::ConstantStruct::get(
1110 CovDataHeaderTy, makeArrayRef(CovDataHeaderVals));
1111
Alex Lorenzee024992014-08-04 18:41:51 +00001112 // Create the coverage data record
Xinliang David Li20b188c2016-01-03 19:25:54 +00001113 llvm::Type *CovDataTypes[] = {CovDataHeaderTy, RecordsTy,
1114 FilenamesAndMappingsVal->getType()};
Alex Lorenzee024992014-08-04 18:41:51 +00001115 auto CovDataTy = llvm::StructType::get(Ctx, makeArrayRef(CovDataTypes));
Xinliang David Li20b188c2016-01-03 19:25:54 +00001116 llvm::Constant *TUDataVals[] = {CovDataHeaderVal, RecordsVal,
1117 FilenamesAndMappingsVal};
Alex Lorenzee024992014-08-04 18:41:51 +00001118 auto CovDataVal =
1119 llvm::ConstantStruct::get(CovDataTy, makeArrayRef(TUDataVals));
Xinliang David Li20b188c2016-01-03 19:25:54 +00001120 auto CovData = new llvm::GlobalVariable(
1121 CGM.getModule(), CovDataTy, true, llvm::GlobalValue::InternalLinkage,
1122 CovDataVal, llvm::getCoverageMappingVarName());
Alex Lorenzee024992014-08-04 18:41:51 +00001123
1124 CovData->setSection(getCoverageSection(CGM));
1125 CovData->setAlignment(8);
1126
1127 // Make sure the data doesn't get deleted.
1128 CGM.addUsedGlobal(CovData);
Xinliang David Li2129ae52016-01-07 20:05:55 +00001129 // Create the deferred function records array
1130 if (!FunctionNames.empty()) {
1131 auto NamesArrTy = llvm::ArrayType::get(llvm::Type::getInt8PtrTy(Ctx),
1132 FunctionNames.size());
1133 auto NamesArrVal = llvm::ConstantArray::get(NamesArrTy, FunctionNames);
1134 // This variable will *NOT* be emitted to the object file. It is used
1135 // to pass the list of names referenced to codegen.
1136 new llvm::GlobalVariable(CGM.getModule(), NamesArrTy, true,
1137 llvm::GlobalValue::InternalLinkage, NamesArrVal,
Xinliang David Li7077f0a2016-01-20 00:24:52 +00001138 llvm::getCoverageUnusedNamesVarName());
Xinliang David Li2129ae52016-01-07 20:05:55 +00001139 }
Alex Lorenzee024992014-08-04 18:41:51 +00001140}
1141
1142unsigned CoverageMappingModuleGen::getFileID(const FileEntry *File) {
1143 auto It = FileEntries.find(File);
1144 if (It != FileEntries.end())
1145 return It->second;
1146 unsigned FileID = FileEntries.size();
1147 FileEntries.insert(std::make_pair(File, FileID));
1148 return FileID;
1149}
1150
1151void CoverageMappingGen::emitCounterMapping(const Decl *D,
1152 llvm::raw_ostream &OS) {
1153 assert(CounterMap);
Justin Bognere5ee6c52014-10-02 16:44:01 +00001154 CounterCoverageMappingBuilder Walker(CVM, *CounterMap, SM, LangOpts);
Alex Lorenzee024992014-08-04 18:41:51 +00001155 Walker.VisitDecl(D);
1156 Walker.write(OS);
1157}
1158
1159void CoverageMappingGen::emitEmptyMapping(const Decl *D,
1160 llvm::raw_ostream &OS) {
1161 EmptyCoverageMappingBuilder Walker(CVM, SM, LangOpts);
1162 Walker.VisitDecl(D);
1163 Walker.write(OS);
1164}