1 //===- GCOV.cpp - LLVM coverage tool --------------------------------------===//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
8 //
9 // GCOV implements the interface to read and write coverage files that use
10 // 'gcov' format.
11 //
12 //===----------------------------------------------------------------------===//
13
14 #include "llvm/ProfileData/GCOV.h"
15 #include "llvm/ADT/STLExtras.h"
16 #include "llvm/ADT/SmallSet.h"
17 #include "llvm/Config/llvm-config.h"
18 #include "llvm/Demangle/Demangle.h"
19 #include "llvm/Support/Debug.h"
20 #include "llvm/Support/FileSystem.h"
21 #include "llvm/Support/Format.h"
22 #include "llvm/Support/MD5.h"
23 #include "llvm/Support/Path.h"
24 #include "llvm/Support/raw_ostream.h"
25 #include <algorithm>
26 #include <system_error>
27
28 using namespace llvm;
29
30 enum : uint32_t {
31 GCOV_ARC_ON_TREE = 1 << 0,
32 GCOV_ARC_FALLTHROUGH = 1 << 2,
33
34 GCOV_TAG_FUNCTION = 0x01000000,
35 GCOV_TAG_BLOCKS = 0x01410000,
36 GCOV_TAG_ARCS = 0x01430000,
37 GCOV_TAG_LINES = 0x01450000,
38 GCOV_TAG_COUNTER_ARCS = 0x01a10000,
39 // GCOV_TAG_OBJECT_SUMMARY superseded GCOV_TAG_PROGRAM_SUMMARY in GCC 9.
40 GCOV_TAG_OBJECT_SUMMARY = 0xa1000000,
41 GCOV_TAG_PROGRAM_SUMMARY = 0xa3000000,
42 };
43
44 namespace {
45 struct Summary {
Summary__anon15e480690211::Summary46 Summary(StringRef Name) : Name(Name) {}
47
48 StringRef Name;
49 uint64_t lines = 0;
50 uint64_t linesExec = 0;
51 uint64_t branches = 0;
52 uint64_t branchesExec = 0;
53 uint64_t branchesTaken = 0;
54 };
55
56 struct LineInfo {
57 SmallVector<const GCOVBlock *, 1> blocks;
58 uint64_t count = 0;
59 bool exists = false;
60 };
61
62 struct SourceInfo {
63 StringRef filename;
64 SmallString<0> displayName;
65 std::vector<std::vector<const GCOVFunction *>> startLineToFunctions;
66 std::vector<LineInfo> lines;
67 bool ignored = false;
SourceInfo__anon15e480690211::SourceInfo68 SourceInfo(StringRef filename) : filename(filename) {}
69 };
70
71 class Context {
72 public:
Context(const GCOV::Options & Options)73 Context(const GCOV::Options &Options) : options(Options) {}
74 void print(StringRef filename, StringRef gcno, StringRef gcda,
75 GCOVFile &file);
76
77 private:
78 std::string getCoveragePath(StringRef filename, StringRef mainFilename) const;
79 void printFunctionDetails(const GCOVFunction &f, raw_ostream &os) const;
80 void printBranchInfo(const GCOVBlock &Block, uint32_t &edgeIdx,
81 raw_ostream &OS) const;
82 void printSummary(const Summary &summary, raw_ostream &os) const;
83
84 void collectFunction(GCOVFunction &f, Summary &summary);
85 void collectSourceLine(SourceInfo &si, Summary *summary, LineInfo &line,
86 size_t lineNum) const;
87 void collectSource(SourceInfo &si, Summary &summary) const;
88 void annotateSource(SourceInfo &si, const GCOVFile &file, StringRef gcno,
89 StringRef gcda, raw_ostream &os) const;
90 void printSourceToIntermediate(const SourceInfo &si, raw_ostream &os) const;
91
92 const GCOV::Options &options;
93 std::vector<SourceInfo> sources;
94 };
95 } // namespace
96
97 //===----------------------------------------------------------------------===//
98 // GCOVFile implementation.
99
100 /// readGCNO - Read GCNO buffer.
readGCNO(GCOVBuffer & buf)101 bool GCOVFile::readGCNO(GCOVBuffer &buf) {
102 if (!buf.readGCNOFormat())
103 return false;
104 if (!buf.readGCOVVersion(version))
105 return false;
106
107 checksum = buf.getWord();
108 if (version >= GCOV::V900 && !buf.readString(cwd))
109 return false;
110 if (version >= GCOV::V800)
111 buf.getWord(); // hasUnexecutedBlocks
112
113 uint32_t tag, length;
114 GCOVFunction *fn = nullptr;
115 while ((tag = buf.getWord())) {
116 if (!buf.readInt(length))
117 return false;
118 uint32_t pos = buf.cursor.tell();
119 if (tag == GCOV_TAG_FUNCTION) {
120 functions.push_back(std::make_unique<GCOVFunction>(*this));
121 fn = functions.back().get();
122 fn->ident = buf.getWord();
123 fn->linenoChecksum = buf.getWord();
124 if (version >= GCOV::V407)
125 fn->cfgChecksum = buf.getWord();
126 buf.readString(fn->Name);
127 StringRef filename;
128 if (version < GCOV::V800) {
129 if (!buf.readString(filename))
130 return false;
131 fn->startLine = buf.getWord();
132 } else {
133 fn->artificial = buf.getWord();
134 if (!buf.readString(filename))
135 return false;
136 fn->startLine = buf.getWord();
137 fn->startColumn = buf.getWord();
138 fn->endLine = buf.getWord();
139 if (version >= GCOV::V900)
140 fn->endColumn = buf.getWord();
141 }
142 auto r = filenameToIdx.try_emplace(filename, filenameToIdx.size());
143 if (r.second)
144 filenames.emplace_back(filename);
145 fn->srcIdx = r.first->second;
146 identToFunction[fn->ident] = fn;
147 } else if (tag == GCOV_TAG_BLOCKS && fn) {
148 if (version < GCOV::V800) {
149 for (uint32_t i = 0; i != length; ++i) {
150 buf.getWord(); // Ignored block flags
151 fn->blocks.push_back(std::make_unique<GCOVBlock>(i));
152 }
153 } else {
154 uint32_t num = buf.getWord();
155 for (uint32_t i = 0; i != num; ++i)
156 fn->blocks.push_back(std::make_unique<GCOVBlock>(i));
157 }
158 } else if (tag == GCOV_TAG_ARCS && fn) {
159 uint32_t srcNo = buf.getWord();
160 if (srcNo >= fn->blocks.size()) {
161 errs() << "unexpected block number: " << srcNo << " (in "
162 << fn->blocks.size() << ")\n";
163 return false;
164 }
165 GCOVBlock *src = fn->blocks[srcNo].get();
166 const uint32_t e =
167 version >= GCOV::V1200 ? (length / 4 - 1) / 2 : (length - 1) / 2;
168 for (uint32_t i = 0; i != e; ++i) {
169 uint32_t dstNo = buf.getWord(), flags = buf.getWord();
170 GCOVBlock *dst = fn->blocks[dstNo].get();
171 auto arc = std::make_unique<GCOVArc>(*src, *dst, flags);
172 src->addDstEdge(arc.get());
173 dst->addSrcEdge(arc.get());
174 if (arc->onTree())
175 fn->treeArcs.push_back(std::move(arc));
176 else
177 fn->arcs.push_back(std::move(arc));
178 }
179 } else if (tag == GCOV_TAG_LINES && fn) {
180 uint32_t srcNo = buf.getWord();
181 if (srcNo >= fn->blocks.size()) {
182 errs() << "unexpected block number: " << srcNo << " (in "
183 << fn->blocks.size() << ")\n";
184 return false;
185 }
186 GCOVBlock &Block = *fn->blocks[srcNo];
187 for (;;) {
188 uint32_t line = buf.getWord();
189 if (line)
190 Block.addLine(line);
191 else {
192 StringRef filename;
193 buf.readString(filename);
194 if (filename.empty())
195 break;
196 // TODO Unhandled
197 }
198 }
199 }
200 pos += version >= GCOV::V1200 ? length : 4 * length;
201 if (pos < buf.cursor.tell())
202 return false;
203 buf.de.skip(buf.cursor, pos - buf.cursor.tell());
204 }
205
206 GCNOInitialized = true;
207 return true;
208 }
209
210 /// readGCDA - Read GCDA buffer. It is required that readGCDA() can only be
211 /// called after readGCNO().
readGCDA(GCOVBuffer & buf)212 bool GCOVFile::readGCDA(GCOVBuffer &buf) {
213 assert(GCNOInitialized && "readGCDA() can only be called after readGCNO()");
214 if (!buf.readGCDAFormat())
215 return false;
216 GCOV::GCOVVersion GCDAVersion;
217 if (!buf.readGCOVVersion(GCDAVersion))
218 return false;
219 if (version != GCDAVersion) {
220 errs() << "GCOV versions do not match.\n";
221 return false;
222 }
223
224 uint32_t GCDAChecksum;
225 if (!buf.readInt(GCDAChecksum))
226 return false;
227 if (checksum != GCDAChecksum) {
228 errs() << "file checksums do not match: " << checksum
229 << " != " << GCDAChecksum << "\n";
230 return false;
231 }
232 uint32_t dummy, tag, length;
233 uint32_t ident;
234 GCOVFunction *fn = nullptr;
235 while ((tag = buf.getWord())) {
236 if (!buf.readInt(length))
237 return false;
238 uint32_t pos = buf.cursor.tell();
239 if (tag == GCOV_TAG_OBJECT_SUMMARY) {
240 buf.readInt(runCount);
241 buf.readInt(dummy);
242 // clang<11 uses a fake 4.2 format which sets length to 9.
243 if (length == 9)
244 buf.readInt(runCount);
245 } else if (tag == GCOV_TAG_PROGRAM_SUMMARY) {
246 // clang<11 uses a fake 4.2 format which sets length to 0.
247 if (length > 0) {
248 buf.readInt(dummy);
249 buf.readInt(dummy);
250 buf.readInt(runCount);
251 }
252 ++programCount;
253 } else if (tag == GCOV_TAG_FUNCTION) {
254 if (length == 0) // Placeholder
255 continue;
256 // As of GCC 10, GCOV_TAG_FUNCTION_LENGTH has never been larger than 3.
257 // However, clang<11 uses a fake 4.2 format which may set length larger
258 // than 3.
259 if (length < 2 || !buf.readInt(ident))
260 return false;
261 auto It = identToFunction.find(ident);
262 uint32_t linenoChecksum, cfgChecksum = 0;
263 buf.readInt(linenoChecksum);
264 if (version >= GCOV::V407)
265 buf.readInt(cfgChecksum);
266 if (It != identToFunction.end()) {
267 fn = It->second;
268 if (linenoChecksum != fn->linenoChecksum ||
269 cfgChecksum != fn->cfgChecksum) {
270 errs() << fn->Name
271 << format(": checksum mismatch, (%u, %u) != (%u, %u)\n",
272 linenoChecksum, cfgChecksum, fn->linenoChecksum,
273 fn->cfgChecksum);
274 return false;
275 }
276 }
277 } else if (tag == GCOV_TAG_COUNTER_ARCS && fn) {
278 uint32_t expected = 2 * fn->arcs.size();
279 if (version >= GCOV::V1200)
280 expected *= 4;
281 if (length != expected) {
282 errs() << fn->Name
283 << format(
284 ": GCOV_TAG_COUNTER_ARCS mismatch, got %u, expected %u\n",
285 length, expected);
286 return false;
287 }
288 for (std::unique_ptr<GCOVArc> &arc : fn->arcs) {
289 if (!buf.readInt64(arc->count))
290 return false;
291 arc->src.count += arc->count;
292 }
293
294 if (fn->blocks.size() >= 2) {
295 GCOVBlock &src = *fn->blocks[0];
296 GCOVBlock &sink =
297 version < GCOV::V408 ? *fn->blocks.back() : *fn->blocks[1];
298 auto arc = std::make_unique<GCOVArc>(sink, src, GCOV_ARC_ON_TREE);
299 sink.addDstEdge(arc.get());
300 src.addSrcEdge(arc.get());
301 fn->treeArcs.push_back(std::move(arc));
302
303 for (GCOVBlock &block : fn->blocksRange())
304 fn->propagateCounts(block, nullptr);
305 for (size_t i = fn->treeArcs.size() - 1; i; --i)
306 fn->treeArcs[i - 1]->src.count += fn->treeArcs[i - 1]->count;
307 }
308 }
309 pos += version >= GCOV::V1200 ? length : 4 * length;
310 if (pos < buf.cursor.tell())
311 return false;
312 buf.de.skip(buf.cursor, pos - buf.cursor.tell());
313 }
314
315 return true;
316 }
317
print(raw_ostream & OS) const318 void GCOVFile::print(raw_ostream &OS) const {
319 for (const GCOVFunction &f : *this)
320 f.print(OS);
321 }
322
323 #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
324 /// dump - Dump GCOVFile content to dbgs() for debugging purposes.
dump() const325 LLVM_DUMP_METHOD void GCOVFile::dump() const { print(dbgs()); }
326 #endif
327
onTree() const328 bool GCOVArc::onTree() const { return flags & GCOV_ARC_ON_TREE; }
329
330 //===----------------------------------------------------------------------===//
331 // GCOVFunction implementation.
332
getName(bool demangle) const333 StringRef GCOVFunction::getName(bool demangle) const {
334 if (!demangle)
335 return Name;
336 if (demangled.empty()) {
337 do {
338 if (Name.startswith("_Z")) {
339 int status = 0;
340 // Name is guaranteed to be NUL-terminated.
341 char *res = itaniumDemangle(Name.data(), nullptr, nullptr, &status);
342 if (status == 0) {
343 demangled = res;
344 free(res);
345 break;
346 }
347 }
348 demangled = Name;
349 } while (false);
350 }
351 return demangled;
352 }
getFilename() const353 StringRef GCOVFunction::getFilename() const { return file.filenames[srcIdx]; }
354
355 /// getEntryCount - Get the number of times the function was called by
356 /// retrieving the entry block's count.
getEntryCount() const357 uint64_t GCOVFunction::getEntryCount() const {
358 return blocks.front()->getCount();
359 }
360
getExitBlock() const361 GCOVBlock &GCOVFunction::getExitBlock() const {
362 return file.getVersion() < GCOV::V408 ? *blocks.back() : *blocks[1];
363 }
364
365 // For each basic block, the sum of incoming edge counts equals the sum of
366 // outgoing edge counts by Kirchoff's circuit law. If the unmeasured arcs form a
367 // spanning tree, the count for each unmeasured arc (GCOV_ARC_ON_TREE) can be
368 // uniquely identified.
propagateCounts(const GCOVBlock & v,GCOVArc * pred)369 uint64_t GCOVFunction::propagateCounts(const GCOVBlock &v, GCOVArc *pred) {
370 // If GCOV_ARC_ON_TREE edges do form a tree, visited is not needed; otherwise
371 // this prevents infinite recursion.
372 if (!visited.insert(&v).second)
373 return 0;
374
375 uint64_t excess = 0;
376 for (GCOVArc *e : v.srcs())
377 if (e != pred)
378 excess += e->onTree() ? propagateCounts(e->src, e) : e->count;
379 for (GCOVArc *e : v.dsts())
380 if (e != pred)
381 excess -= e->onTree() ? propagateCounts(e->dst, e) : e->count;
382 if (int64_t(excess) < 0)
383 excess = -excess;
384 if (pred)
385 pred->count = excess;
386 return excess;
387 }
388
print(raw_ostream & OS) const389 void GCOVFunction::print(raw_ostream &OS) const {
390 OS << "===== " << Name << " (" << ident << ") @ " << getFilename() << ":"
391 << startLine << "\n";
392 for (const auto &Block : blocks)
393 Block->print(OS);
394 }
395
396 #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
397 /// dump - Dump GCOVFunction content to dbgs() for debugging purposes.
dump() const398 LLVM_DUMP_METHOD void GCOVFunction::dump() const { print(dbgs()); }
399 #endif
400
401 /// collectLineCounts - Collect line counts. This must be used after
402 /// reading .gcno and .gcda files.
403
404 //===----------------------------------------------------------------------===//
405 // GCOVBlock implementation.
406
print(raw_ostream & OS) const407 void GCOVBlock::print(raw_ostream &OS) const {
408 OS << "Block : " << number << " Counter : " << count << "\n";
409 if (!pred.empty()) {
410 OS << "\tSource Edges : ";
411 for (const GCOVArc *Edge : pred)
412 OS << Edge->src.number << " (" << Edge->count << "), ";
413 OS << "\n";
414 }
415 if (!succ.empty()) {
416 OS << "\tDestination Edges : ";
417 for (const GCOVArc *Edge : succ) {
418 if (Edge->flags & GCOV_ARC_ON_TREE)
419 OS << '*';
420 OS << Edge->dst.number << " (" << Edge->count << "), ";
421 }
422 OS << "\n";
423 }
424 if (!lines.empty()) {
425 OS << "\tLines : ";
426 for (uint32_t N : lines)
427 OS << (N) << ",";
428 OS << "\n";
429 }
430 }
431
432 #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
433 /// dump - Dump GCOVBlock content to dbgs() for debugging purposes.
dump() const434 LLVM_DUMP_METHOD void GCOVBlock::dump() const { print(dbgs()); }
435 #endif
436
437 uint64_t
augmentOneCycle(GCOVBlock * src,std::vector<std::pair<GCOVBlock *,size_t>> & stack)438 GCOVBlock::augmentOneCycle(GCOVBlock *src,
439 std::vector<std::pair<GCOVBlock *, size_t>> &stack) {
440 GCOVBlock *u;
441 size_t i;
442 stack.clear();
443 stack.emplace_back(src, 0);
444 src->incoming = (GCOVArc *)1; // Mark u available for cycle detection
445 for (;;) {
446 std::tie(u, i) = stack.back();
447 if (i == u->succ.size()) {
448 u->traversable = false;
449 stack.pop_back();
450 if (stack.empty())
451 break;
452 continue;
453 }
454 ++stack.back().second;
455 GCOVArc *succ = u->succ[i];
456 // Ignore saturated arcs (cycleCount has been reduced to 0) and visited
457 // blocks. Ignore self arcs to guard against bad input (.gcno has no
458 // self arcs).
459 if (succ->cycleCount == 0 || !succ->dst.traversable || &succ->dst == u)
460 continue;
461 if (succ->dst.incoming == nullptr) {
462 succ->dst.incoming = succ;
463 stack.emplace_back(&succ->dst, 0);
464 continue;
465 }
466 uint64_t minCount = succ->cycleCount;
467 for (GCOVBlock *v = u;;) {
468 minCount = std::min(minCount, v->incoming->cycleCount);
469 v = &v->incoming->src;
470 if (v == &succ->dst)
471 break;
472 }
473 succ->cycleCount -= minCount;
474 for (GCOVBlock *v = u;;) {
475 v->incoming->cycleCount -= minCount;
476 v = &v->incoming->src;
477 if (v == &succ->dst)
478 break;
479 }
480 return minCount;
481 }
482 return 0;
483 }
484
485 // Get the total execution count of loops among blocks on the same line.
486 // Assuming a reducible flow graph, the count is the sum of back edge counts.
487 // Identifying loops is complex, so we simply find cycles and perform cycle
488 // cancelling iteratively.
getCyclesCount(const BlockVector & blocks)489 uint64_t GCOVBlock::getCyclesCount(const BlockVector &blocks) {
490 std::vector<std::pair<GCOVBlock *, size_t>> stack;
491 uint64_t count = 0, d;
492 for (;;) {
493 // Make blocks on the line traversable and try finding a cycle.
494 for (auto b : blocks) {
495 const_cast<GCOVBlock *>(b)->traversable = true;
496 const_cast<GCOVBlock *>(b)->incoming = nullptr;
497 }
498 d = 0;
499 for (auto block : blocks) {
500 auto *b = const_cast<GCOVBlock *>(block);
501 if (b->traversable && (d = augmentOneCycle(b, stack)) > 0)
502 break;
503 }
504 if (d == 0)
505 break;
506 count += d;
507 }
508 // If there is no more loop, all traversable bits should have been cleared.
509 // This property is needed by subsequent calls.
510 for (auto b : blocks) {
511 assert(!b->traversable);
512 (void)b;
513 }
514 return count;
515 }
516
517 //===----------------------------------------------------------------------===//
518 // FileInfo implementation.
519
520 // Format dividend/divisor as a percentage. Return 1 if the result is greater
521 // than 0% and less than 1%.
formatPercentage(uint64_t dividend,uint64_t divisor)522 static uint32_t formatPercentage(uint64_t dividend, uint64_t divisor) {
523 if (!dividend || !divisor)
524 return 0;
525 dividend *= 100;
526 return dividend < divisor ? 1 : dividend / divisor;
527 }
528
529 // This custom division function mimics gcov's branch ouputs:
530 // - Round to closest whole number
531 // - Only output 0% or 100% if it's exactly that value
branchDiv(uint64_t Numerator,uint64_t Divisor)532 static uint32_t branchDiv(uint64_t Numerator, uint64_t Divisor) {
533 if (!Numerator)
534 return 0;
535 if (Numerator == Divisor)
536 return 100;
537
538 uint8_t Res = (Numerator * 100 + Divisor / 2) / Divisor;
539 if (Res == 0)
540 return 1;
541 if (Res == 100)
542 return 99;
543 return Res;
544 }
545
546 namespace {
547 struct formatBranchInfo {
formatBranchInfo__anon15e480690311::formatBranchInfo548 formatBranchInfo(const GCOV::Options &Options, uint64_t Count, uint64_t Total)
549 : Options(Options), Count(Count), Total(Total) {}
550
print__anon15e480690311::formatBranchInfo551 void print(raw_ostream &OS) const {
552 if (!Total)
553 OS << "never executed";
554 else if (Options.BranchCount)
555 OS << "taken " << Count;
556 else
557 OS << "taken " << branchDiv(Count, Total) << "%";
558 }
559
560 const GCOV::Options &Options;
561 uint64_t Count;
562 uint64_t Total;
563 };
564
operator <<(raw_ostream & OS,const formatBranchInfo & FBI)565 static raw_ostream &operator<<(raw_ostream &OS, const formatBranchInfo &FBI) {
566 FBI.print(OS);
567 return OS;
568 }
569
570 class LineConsumer {
571 std::unique_ptr<MemoryBuffer> Buffer;
572 StringRef Remaining;
573
574 public:
575 LineConsumer() = default;
LineConsumer(StringRef Filename)576 LineConsumer(StringRef Filename) {
577 // Open source files without requiring a NUL terminator. The concurrent
578 // modification may nullify the NUL terminator condition.
579 ErrorOr<std::unique_ptr<MemoryBuffer>> BufferOrErr =
580 MemoryBuffer::getFileOrSTDIN(Filename, /*IsText=*/false,
581 /*RequiresNullTerminator=*/false);
582 if (std::error_code EC = BufferOrErr.getError()) {
583 errs() << Filename << ": " << EC.message() << "\n";
584 Remaining = "";
585 } else {
586 Buffer = std::move(BufferOrErr.get());
587 Remaining = Buffer->getBuffer();
588 }
589 }
empty()590 bool empty() { return Remaining.empty(); }
printNext(raw_ostream & OS,uint32_t LineNum)591 void printNext(raw_ostream &OS, uint32_t LineNum) {
592 StringRef Line;
593 if (empty())
594 Line = "/*EOF*/";
595 else
596 std::tie(Line, Remaining) = Remaining.split("\n");
597 OS << format("%5u:", LineNum) << Line << "\n";
598 }
599 };
600 } // end anonymous namespace
601
602 /// Convert a path to a gcov filename. If PreservePaths is true, this
603 /// translates "/" to "#", ".." to "^", and drops ".", to match gcov.
mangleCoveragePath(StringRef Filename,bool PreservePaths)604 static std::string mangleCoveragePath(StringRef Filename, bool PreservePaths) {
605 if (!PreservePaths)
606 return sys::path::filename(Filename).str();
607
608 // This behaviour is defined by gcov in terms of text replacements, so it's
609 // not likely to do anything useful on filesystems with different textual
610 // conventions.
611 llvm::SmallString<256> Result("");
612 StringRef::iterator I, S, E;
613 for (I = S = Filename.begin(), E = Filename.end(); I != E; ++I) {
614 if (*I != '/')
615 continue;
616
617 if (I - S == 1 && *S == '.') {
618 // ".", the current directory, is skipped.
619 } else if (I - S == 2 && *S == '.' && *(S + 1) == '.') {
620 // "..", the parent directory, is replaced with "^".
621 Result.append("^#");
622 } else {
623 if (S < I)
624 // Leave other components intact,
625 Result.append(S, I);
626 // And separate with "#".
627 Result.push_back('#');
628 }
629 S = I + 1;
630 }
631
632 if (S < I)
633 Result.append(S, I);
634 return std::string(Result.str());
635 }
636
getCoveragePath(StringRef filename,StringRef mainFilename) const637 std::string Context::getCoveragePath(StringRef filename,
638 StringRef mainFilename) const {
639 if (options.NoOutput)
640 // This is probably a bug in gcov, but when -n is specified, paths aren't
641 // mangled at all, and the -l and -p options are ignored. Here, we do the
642 // same.
643 return std::string(filename);
644
645 std::string CoveragePath;
646 if (options.LongFileNames && !filename.equals(mainFilename))
647 CoveragePath =
648 mangleCoveragePath(mainFilename, options.PreservePaths) + "##";
649 CoveragePath += mangleCoveragePath(filename, options.PreservePaths);
650 if (options.HashFilenames) {
651 MD5 Hasher;
652 MD5::MD5Result Result;
653 Hasher.update(filename.str());
654 Hasher.final(Result);
655 CoveragePath += "##" + std::string(Result.digest());
656 }
657 CoveragePath += ".gcov";
658 return CoveragePath;
659 }
660
collectFunction(GCOVFunction & f,Summary & summary)661 void Context::collectFunction(GCOVFunction &f, Summary &summary) {
662 SourceInfo &si = sources[f.srcIdx];
663 if (f.startLine >= si.startLineToFunctions.size())
664 si.startLineToFunctions.resize(f.startLine + 1);
665 si.startLineToFunctions[f.startLine].push_back(&f);
666 SmallSet<uint32_t, 16> lines;
667 SmallSet<uint32_t, 16> linesExec;
668 for (const GCOVBlock &b : f.blocksRange()) {
669 if (b.lines.empty())
670 continue;
671 uint32_t maxLineNum = *std::max_element(b.lines.begin(), b.lines.end());
672 if (maxLineNum >= si.lines.size())
673 si.lines.resize(maxLineNum + 1);
674 for (uint32_t lineNum : b.lines) {
675 LineInfo &line = si.lines[lineNum];
676 if (lines.insert(lineNum).second)
677 ++summary.lines;
678 if (b.count && linesExec.insert(lineNum).second)
679 ++summary.linesExec;
680 line.exists = true;
681 line.count += b.count;
682 line.blocks.push_back(&b);
683 }
684 }
685 }
686
collectSourceLine(SourceInfo & si,Summary * summary,LineInfo & line,size_t lineNum) const687 void Context::collectSourceLine(SourceInfo &si, Summary *summary,
688 LineInfo &line, size_t lineNum) const {
689 uint64_t count = 0;
690 for (const GCOVBlock *b : line.blocks) {
691 if (b->number == 0) {
692 // For nonstandard control flows, arcs into the exit block may be
693 // duplicately counted (fork) or not be counted (abnormal exit), and thus
694 // the (exit,entry) counter may be inaccurate. Count the entry block with
695 // the outgoing arcs.
696 for (const GCOVArc *arc : b->succ)
697 count += arc->count;
698 } else {
699 // Add counts from predecessors that are not on the same line.
700 for (const GCOVArc *arc : b->pred)
701 if (!llvm::is_contained(line.blocks, &arc->src))
702 count += arc->count;
703 }
704 for (GCOVArc *arc : b->succ)
705 arc->cycleCount = arc->count;
706 }
707
708 count += GCOVBlock::getCyclesCount(line.blocks);
709 line.count = count;
710 if (line.exists) {
711 ++summary->lines;
712 if (line.count != 0)
713 ++summary->linesExec;
714 }
715
716 if (options.BranchInfo)
717 for (const GCOVBlock *b : line.blocks) {
718 if (b->getLastLine() != lineNum)
719 continue;
720 int branches = 0, execBranches = 0, takenBranches = 0;
721 for (const GCOVArc *arc : b->succ) {
722 ++branches;
723 if (count != 0)
724 ++execBranches;
725 if (arc->count != 0)
726 ++takenBranches;
727 }
728 if (branches > 1) {
729 summary->branches += branches;
730 summary->branchesExec += execBranches;
731 summary->branchesTaken += takenBranches;
732 }
733 }
734 }
735
collectSource(SourceInfo & si,Summary & summary) const736 void Context::collectSource(SourceInfo &si, Summary &summary) const {
737 size_t lineNum = 0;
738 for (LineInfo &line : si.lines) {
739 collectSourceLine(si, &summary, line, lineNum);
740 ++lineNum;
741 }
742 }
743
annotateSource(SourceInfo & si,const GCOVFile & file,StringRef gcno,StringRef gcda,raw_ostream & os) const744 void Context::annotateSource(SourceInfo &si, const GCOVFile &file,
745 StringRef gcno, StringRef gcda,
746 raw_ostream &os) const {
747 auto source =
748 options.Intermediate ? LineConsumer() : LineConsumer(si.filename);
749
750 os << " -: 0:Source:" << si.displayName << '\n';
751 os << " -: 0:Graph:" << gcno << '\n';
752 os << " -: 0:Data:" << gcda << '\n';
753 os << " -: 0:Runs:" << file.runCount << '\n';
754 if (file.version < GCOV::V900)
755 os << " -: 0:Programs:" << file.programCount << '\n';
756
757 for (size_t lineNum = 1; !source.empty(); ++lineNum) {
758 if (lineNum >= si.lines.size()) {
759 os << " -:";
760 source.printNext(os, lineNum);
761 continue;
762 }
763
764 const LineInfo &line = si.lines[lineNum];
765 if (options.BranchInfo && lineNum < si.startLineToFunctions.size())
766 for (const auto *f : si.startLineToFunctions[lineNum])
767 printFunctionDetails(*f, os);
768 if (!line.exists)
769 os << " -:";
770 else if (line.count == 0)
771 os << " #####:";
772 else
773 os << format("%9" PRIu64 ":", line.count);
774 source.printNext(os, lineNum);
775
776 uint32_t blockIdx = 0, edgeIdx = 0;
777 for (const GCOVBlock *b : line.blocks) {
778 if (b->getLastLine() != lineNum)
779 continue;
780 if (options.AllBlocks) {
781 if (b->getCount() == 0)
782 os << " $$$$$:";
783 else
784 os << format("%9" PRIu64 ":", b->count);
785 os << format("%5u-block %2u\n", lineNum, blockIdx++);
786 }
787 if (options.BranchInfo) {
788 size_t NumEdges = b->succ.size();
789 if (NumEdges > 1)
790 printBranchInfo(*b, edgeIdx, os);
791 else if (options.UncondBranch && NumEdges == 1) {
792 uint64_t count = b->succ[0]->count;
793 os << format("unconditional %2u ", edgeIdx++)
794 << formatBranchInfo(options, count, count) << '\n';
795 }
796 }
797 }
798 }
799 }
800
printSourceToIntermediate(const SourceInfo & si,raw_ostream & os) const801 void Context::printSourceToIntermediate(const SourceInfo &si,
802 raw_ostream &os) const {
803 os << "file:" << si.filename << '\n';
804 for (const auto &fs : si.startLineToFunctions)
805 for (const GCOVFunction *f : fs)
806 os << "function:" << f->startLine << ',' << f->getEntryCount() << ','
807 << f->getName(options.Demangle) << '\n';
808 for (size_t lineNum = 1, size = si.lines.size(); lineNum < size; ++lineNum) {
809 const LineInfo &line = si.lines[lineNum];
810 if (line.blocks.empty())
811 continue;
812 // GCC 8 (r254259) added third third field for Ada:
813 // lcount:<line>,<count>,<has_unexecuted_blocks>
814 // We don't need the third field.
815 os << "lcount:" << lineNum << ',' << line.count << '\n';
816
817 if (!options.BranchInfo)
818 continue;
819 for (const GCOVBlock *b : line.blocks) {
820 if (b->succ.size() < 2 || b->getLastLine() != lineNum)
821 continue;
822 for (const GCOVArc *arc : b->succ) {
823 const char *type =
824 b->getCount() ? arc->count ? "taken" : "nottaken" : "notexec";
825 os << "branch:" << lineNum << ',' << type << '\n';
826 }
827 }
828 }
829 }
830
print(StringRef filename,StringRef gcno,StringRef gcda,GCOVFile & file)831 void Context::print(StringRef filename, StringRef gcno, StringRef gcda,
832 GCOVFile &file) {
833 for (StringRef filename : file.filenames) {
834 sources.emplace_back(filename);
835 SourceInfo &si = sources.back();
836 si.displayName = si.filename;
837 if (!options.SourcePrefix.empty() &&
838 sys::path::replace_path_prefix(si.displayName, options.SourcePrefix,
839 "") &&
840 !si.displayName.empty()) {
841 // TODO replace_path_prefix may strip the prefix even if the remaining
842 // part does not start with a separator.
843 if (sys::path::is_separator(si.displayName[0]))
844 si.displayName.erase(si.displayName.begin());
845 else
846 si.displayName = si.filename;
847 }
848 if (options.RelativeOnly && sys::path::is_absolute(si.displayName))
849 si.ignored = true;
850 }
851
852 raw_ostream &os = llvm::outs();
853 for (GCOVFunction &f : make_pointee_range(file.functions)) {
854 Summary summary(f.getName(options.Demangle));
855 collectFunction(f, summary);
856 if (options.FuncCoverage && !options.UseStdout) {
857 os << "Function '" << summary.Name << "'\n";
858 printSummary(summary, os);
859 os << '\n';
860 }
861 }
862
863 for (SourceInfo &si : sources) {
864 if (si.ignored)
865 continue;
866 Summary summary(si.displayName);
867 collectSource(si, summary);
868
869 // Print file summary unless -t is specified.
870 std::string gcovName = getCoveragePath(si.filename, filename);
871 if (!options.UseStdout) {
872 os << "File '" << summary.Name << "'\n";
873 printSummary(summary, os);
874 if (!options.NoOutput && !options.Intermediate)
875 os << "Creating '" << gcovName << "'\n";
876 os << '\n';
877 }
878
879 if (options.NoOutput || options.Intermediate)
880 continue;
881 Optional<raw_fd_ostream> os;
882 if (!options.UseStdout) {
883 std::error_code ec;
884 os.emplace(gcovName, ec, sys::fs::OF_TextWithCRLF);
885 if (ec) {
886 errs() << ec.message() << '\n';
887 continue;
888 }
889 }
890 annotateSource(si, file, gcno, gcda,
891 options.UseStdout ? llvm::outs() : *os);
892 }
893
894 if (options.Intermediate && !options.NoOutput) {
895 // gcov 7.* unexpectedly create multiple .gcov files, which was fixed in 8.0
896 // (PR GCC/82702). We create just one file.
897 std::string outputPath(sys::path::filename(filename));
898 std::error_code ec;
899 raw_fd_ostream os(outputPath + ".gcov", ec, sys::fs::OF_TextWithCRLF);
900 if (ec) {
901 errs() << ec.message() << '\n';
902 return;
903 }
904
905 for (const SourceInfo &si : sources)
906 printSourceToIntermediate(si, os);
907 }
908 }
909
printFunctionDetails(const GCOVFunction & f,raw_ostream & os) const910 void Context::printFunctionDetails(const GCOVFunction &f,
911 raw_ostream &os) const {
912 const uint64_t entryCount = f.getEntryCount();
913 uint32_t blocksExec = 0;
914 const GCOVBlock &exitBlock = f.getExitBlock();
915 uint64_t exitCount = 0;
916 for (const GCOVArc *arc : exitBlock.pred)
917 exitCount += arc->count;
918 for (const GCOVBlock &b : f.blocksRange())
919 if (b.number != 0 && &b != &exitBlock && b.getCount())
920 ++blocksExec;
921
922 os << "function " << f.getName(options.Demangle) << " called " << entryCount
923 << " returned " << formatPercentage(exitCount, entryCount)
924 << "% blocks executed "
925 << formatPercentage(blocksExec, f.blocks.size() - 2) << "%\n";
926 }
927
928 /// printBranchInfo - Print conditional branch probabilities.
printBranchInfo(const GCOVBlock & Block,uint32_t & edgeIdx,raw_ostream & os) const929 void Context::printBranchInfo(const GCOVBlock &Block, uint32_t &edgeIdx,
930 raw_ostream &os) const {
931 uint64_t total = 0;
932 for (const GCOVArc *arc : Block.dsts())
933 total += arc->count;
934 for (const GCOVArc *arc : Block.dsts())
935 os << format("branch %2u ", edgeIdx++)
936 << formatBranchInfo(options, arc->count, total) << '\n';
937 }
938
printSummary(const Summary & summary,raw_ostream & os) const939 void Context::printSummary(const Summary &summary, raw_ostream &os) const {
940 os << format("Lines executed:%.2f%% of %" PRIu64 "\n",
941 double(summary.linesExec) * 100 / summary.lines, summary.lines);
942 if (options.BranchInfo) {
943 if (summary.branches == 0) {
944 os << "No branches\n";
945 } else {
946 os << format("Branches executed:%.2f%% of %" PRIu64 "\n",
947 double(summary.branchesExec) * 100 / summary.branches,
948 summary.branches);
949 os << format("Taken at least once:%.2f%% of %" PRIu64 "\n",
950 double(summary.branchesTaken) * 100 / summary.branches,
951 summary.branches);
952 }
953 os << "No calls\n";
954 }
955 }
956
gcovOneInput(const GCOV::Options & options,StringRef filename,StringRef gcno,StringRef gcda,GCOVFile & file)957 void llvm::gcovOneInput(const GCOV::Options &options, StringRef filename,
958 StringRef gcno, StringRef gcda, GCOVFile &file) {
959 Context fi(options);
960 fi.print(filename, gcno, gcda, file);
961 }
962