2013-12-05 22:02:29 +00:00
|
|
|
//===- GCOV.cpp - LLVM coverage tool --------------------------------------===//
|
2011-09-28 18:50:00 +00:00
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2013-11-14 11:44:58 +00:00
|
|
|
// GCOV implements the interface to read and write coverage files that use
|
2011-10-04 17:24:48 +00:00
|
|
|
// 'gcov' format.
|
2011-09-28 18:50:00 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2013-10-25 02:22:24 +00:00
|
|
|
#include "llvm/Support/Debug.h"
|
2011-10-04 17:24:48 +00:00
|
|
|
#include "llvm/Support/GCOV.h"
|
2011-09-28 18:50:00 +00:00
|
|
|
#include "llvm/ADT/OwningPtr.h"
|
2011-09-29 16:46:47 +00:00
|
|
|
#include "llvm/ADT/STLExtras.h"
|
2013-10-22 05:09:41 +00:00
|
|
|
#include "llvm/Support/Format.h"
|
2011-09-28 18:50:00 +00:00
|
|
|
#include "llvm/Support/MemoryObject.h"
|
|
|
|
#include "llvm/Support/system_error.h"
|
2013-12-13 01:15:07 +00:00
|
|
|
#include <algorithm>
|
2011-09-28 18:50:00 +00:00
|
|
|
using namespace llvm;
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// GCOVFile implementation.
|
|
|
|
|
|
|
|
/// ~GCOVFile - Delete GCOVFile and its content.
|
|
|
|
GCOVFile::~GCOVFile() {
|
|
|
|
DeleteContainerPointers(Functions);
|
|
|
|
}
|
|
|
|
|
2013-12-04 04:49:23 +00:00
|
|
|
/// readGCNO - Read GCNO buffer.
|
|
|
|
bool GCOVFile::readGCNO(GCOVBuffer &Buffer) {
|
|
|
|
if (!Buffer.readGCNOFormat()) return false;
|
|
|
|
if (!Buffer.readGCOVVersion(Version)) return false;
|
|
|
|
|
|
|
|
if (!Buffer.readInt(Checksum)) return false;
|
|
|
|
while (true) {
|
|
|
|
if (!Buffer.readFunctionTag()) break;
|
2013-12-04 05:42:28 +00:00
|
|
|
GCOVFunction *GFun = new GCOVFunction(*this);
|
2013-12-04 04:49:23 +00:00
|
|
|
if (!GFun->readGCNO(Buffer, Version))
|
|
|
|
return false;
|
|
|
|
Functions.push_back(GFun);
|
|
|
|
}
|
2011-09-29 17:06:40 +00:00
|
|
|
|
2013-12-04 05:07:36 +00:00
|
|
|
GCNOInitialized = true;
|
2013-12-04 04:49:23 +00:00
|
|
|
return true;
|
2011-09-29 17:06:40 +00:00
|
|
|
}
|
|
|
|
|
2013-12-04 04:49:23 +00:00
|
|
|
/// readGCDA - Read GCDA buffer. It is required that readGCDA() can only be
|
|
|
|
/// called after readGCNO().
|
|
|
|
bool GCOVFile::readGCDA(GCOVBuffer &Buffer) {
|
2013-12-04 05:07:36 +00:00
|
|
|
assert(GCNOInitialized && "readGCDA() can only be called after readGCNO()");
|
2013-12-04 04:49:23 +00:00
|
|
|
if (!Buffer.readGCDAFormat()) return false;
|
|
|
|
GCOV::GCOVVersion GCDAVersion;
|
|
|
|
if (!Buffer.readGCOVVersion(GCDAVersion)) return false;
|
|
|
|
if (Version != GCDAVersion) {
|
|
|
|
errs() << "GCOV versions do not match.\n";
|
2011-09-28 18:50:00 +00:00
|
|
|
return false;
|
2013-12-04 04:49:23 +00:00
|
|
|
}
|
2011-09-28 18:50:00 +00:00
|
|
|
|
2013-12-04 04:49:23 +00:00
|
|
|
uint32_t GCDAChecksum;
|
|
|
|
if (!Buffer.readInt(GCDAChecksum)) return false;
|
|
|
|
if (Checksum != GCDAChecksum) {
|
2013-12-04 05:42:28 +00:00
|
|
|
errs() << "File checksums do not match: " << Checksum << " != "
|
|
|
|
<< GCDAChecksum << ".\n";
|
2013-12-04 04:49:23 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
for (size_t i = 0, e = Functions.size(); i < e; ++i) {
|
|
|
|
if (!Buffer.readFunctionTag()) {
|
|
|
|
errs() << "Unexpected number of functions.\n";
|
2013-11-20 04:15:05 +00:00
|
|
|
return false;
|
|
|
|
}
|
2013-12-04 04:49:23 +00:00
|
|
|
if (!Functions[i]->readGCDA(Buffer, Version))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
if (Buffer.readObjectTag()) {
|
|
|
|
uint32_t Length;
|
|
|
|
uint32_t Dummy;
|
|
|
|
if (!Buffer.readInt(Length)) return false;
|
|
|
|
if (!Buffer.readInt(Dummy)) return false; // checksum
|
|
|
|
if (!Buffer.readInt(Dummy)) return false; // num
|
2013-12-16 20:03:11 +00:00
|
|
|
if (!Buffer.readInt(RunCount)) return false;
|
2013-12-04 04:49:23 +00:00
|
|
|
Buffer.advanceCursor(Length-3);
|
|
|
|
}
|
|
|
|
while (Buffer.readProgramTag()) {
|
|
|
|
uint32_t Length;
|
|
|
|
if (!Buffer.readInt(Length)) return false;
|
|
|
|
Buffer.advanceCursor(Length);
|
|
|
|
++ProgramCount;
|
2013-10-25 02:22:21 +00:00
|
|
|
}
|
|
|
|
|
2011-09-28 18:50:00 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2013-10-25 02:22:24 +00:00
|
|
|
/// dump - Dump GCOVFile content to dbgs() for debugging purposes.
|
2013-11-19 20:33:32 +00:00
|
|
|
void GCOVFile::dump() const {
|
|
|
|
for (SmallVectorImpl<GCOVFunction *>::const_iterator I = Functions.begin(),
|
2012-07-19 00:11:40 +00:00
|
|
|
E = Functions.end(); I != E; ++I)
|
2011-09-28 18:50:00 +00:00
|
|
|
(*I)->dump();
|
|
|
|
}
|
|
|
|
|
|
|
|
/// collectLineCounts - Collect line counts. This must be used after
|
|
|
|
/// reading .gcno and .gcda files.
|
|
|
|
void GCOVFile::collectLineCounts(FileInfo &FI) {
|
2013-07-04 01:31:24 +00:00
|
|
|
for (SmallVectorImpl<GCOVFunction *>::iterator I = Functions.begin(),
|
2013-11-14 11:44:58 +00:00
|
|
|
E = Functions.end(); I != E; ++I)
|
2011-09-28 18:50:00 +00:00
|
|
|
(*I)->collectLineCounts(FI);
|
2013-11-05 01:11:58 +00:00
|
|
|
FI.setRunCount(RunCount);
|
2013-10-25 02:22:21 +00:00
|
|
|
FI.setProgramCount(ProgramCount);
|
2011-09-28 18:50:00 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// GCOVFunction implementation.
|
|
|
|
|
|
|
|
/// ~GCOVFunction - Delete GCOVFunction and its content.
|
|
|
|
GCOVFunction::~GCOVFunction() {
|
|
|
|
DeleteContainerPointers(Blocks);
|
2013-12-03 00:24:44 +00:00
|
|
|
DeleteContainerPointers(Edges);
|
2011-09-28 18:50:00 +00:00
|
|
|
}
|
|
|
|
|
2013-12-03 00:15:49 +00:00
|
|
|
/// readGCNO - Read a function from the GCNO buffer. Return false if an error
|
|
|
|
/// occurs.
|
2013-12-04 04:49:23 +00:00
|
|
|
bool GCOVFunction::readGCNO(GCOVBuffer &Buff, GCOV::GCOVVersion Version) {
|
2013-11-14 00:07:15 +00:00
|
|
|
uint32_t Dummy;
|
|
|
|
if (!Buff.readInt(Dummy)) return false; // Function header length
|
|
|
|
if (!Buff.readInt(Ident)) return false;
|
2013-12-04 08:57:17 +00:00
|
|
|
if (!Buff.readInt(Checksum)) return false;
|
2013-12-04 05:42:28 +00:00
|
|
|
if (Version != GCOV::V402) {
|
|
|
|
uint32_t CfgChecksum;
|
|
|
|
if (!Buff.readInt(CfgChecksum)) return false;
|
|
|
|
if (Parent.getChecksum() != CfgChecksum) {
|
|
|
|
errs() << "File checksums do not match: " << Parent.getChecksum()
|
|
|
|
<< " != " << CfgChecksum << " in (" << Name << ").\n";
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
2013-11-14 00:07:15 +00:00
|
|
|
if (!Buff.readString(Name)) return false;
|
2013-12-03 00:15:49 +00:00
|
|
|
if (!Buff.readString(Filename)) return false;
|
2013-11-14 00:07:15 +00:00
|
|
|
if (!Buff.readInt(LineNumber)) return false;
|
2011-09-28 18:50:00 +00:00
|
|
|
|
|
|
|
// read blocks.
|
2013-11-14 00:07:15 +00:00
|
|
|
if (!Buff.readBlockTag()) {
|
|
|
|
errs() << "Block tag not found.\n";
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
uint32_t BlockCount;
|
|
|
|
if (!Buff.readInt(BlockCount)) return false;
|
2013-10-22 20:02:36 +00:00
|
|
|
for (uint32_t i = 0, e = BlockCount; i != e; ++i) {
|
2013-11-14 00:07:15 +00:00
|
|
|
if (!Buff.readInt(Dummy)) return false; // Block flags;
|
2013-11-14 00:32:00 +00:00
|
|
|
Blocks.push_back(new GCOVBlock(*this, i));
|
2011-09-28 18:50:00 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// read edges.
|
|
|
|
while (Buff.readEdgeTag()) {
|
2013-11-14 00:07:15 +00:00
|
|
|
uint32_t EdgeCount;
|
|
|
|
if (!Buff.readInt(EdgeCount)) return false;
|
|
|
|
EdgeCount = (EdgeCount - 1) / 2;
|
|
|
|
uint32_t BlockNo;
|
|
|
|
if (!Buff.readInt(BlockNo)) return false;
|
|
|
|
if (BlockNo >= BlockCount) {
|
2013-12-05 22:02:33 +00:00
|
|
|
errs() << "Unexpected block number: " << BlockNo << " (in " << Name
|
|
|
|
<< ").\n";
|
2013-11-14 00:07:15 +00:00
|
|
|
return false;
|
|
|
|
}
|
2013-10-22 20:02:36 +00:00
|
|
|
for (uint32_t i = 0, e = EdgeCount; i != e; ++i) {
|
2013-11-14 00:07:15 +00:00
|
|
|
uint32_t Dst;
|
|
|
|
if (!Buff.readInt(Dst)) return false;
|
2013-12-03 00:24:44 +00:00
|
|
|
GCOVEdge *Edge = new GCOVEdge(Blocks[BlockNo], Blocks[Dst]);
|
|
|
|
Edges.push_back(Edge);
|
|
|
|
Blocks[BlockNo]->addDstEdge(Edge);
|
|
|
|
Blocks[Dst]->addSrcEdge(Edge);
|
2013-11-14 00:07:15 +00:00
|
|
|
if (!Buff.readInt(Dummy)) return false; // Edge flag
|
2011-09-28 18:50:00 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// read line table.
|
|
|
|
while (Buff.readLineTag()) {
|
2013-11-14 00:07:15 +00:00
|
|
|
uint32_t LineTableLength;
|
|
|
|
if (!Buff.readInt(LineTableLength)) return false;
|
2013-10-22 19:54:32 +00:00
|
|
|
uint32_t EndPos = Buff.getCursor() + LineTableLength*4;
|
2013-11-14 00:07:15 +00:00
|
|
|
uint32_t BlockNo;
|
|
|
|
if (!Buff.readInt(BlockNo)) return false;
|
|
|
|
if (BlockNo >= BlockCount) {
|
2013-12-05 22:02:33 +00:00
|
|
|
errs() << "Unexpected block number: " << BlockNo << " (in " << Name
|
|
|
|
<< ").\n";
|
2013-11-14 00:07:15 +00:00
|
|
|
return false;
|
|
|
|
}
|
2011-09-28 18:50:00 +00:00
|
|
|
GCOVBlock *Block = Blocks[BlockNo];
|
2013-11-14 00:07:15 +00:00
|
|
|
if (!Buff.readInt(Dummy)) return false; // flag
|
2013-10-22 19:54:32 +00:00
|
|
|
while (Buff.getCursor() != (EndPos - 4)) {
|
2013-11-14 00:32:00 +00:00
|
|
|
StringRef F;
|
|
|
|
if (!Buff.readString(F)) return false;
|
2013-12-05 22:02:33 +00:00
|
|
|
if (Filename != F) {
|
|
|
|
errs() << "Multiple sources for a single basic block: " << Filename
|
|
|
|
<< " != " << F << " (in " << Name << ").\n";
|
2013-11-14 00:32:00 +00:00
|
|
|
return false;
|
|
|
|
}
|
2013-10-22 19:54:32 +00:00
|
|
|
if (Buff.getCursor() == (EndPos - 4)) break;
|
2013-11-14 00:07:15 +00:00
|
|
|
while (true) {
|
|
|
|
uint32_t Line;
|
|
|
|
if (!Buff.readInt(Line)) return false;
|
|
|
|
if (!Line) break;
|
2013-11-14 00:32:00 +00:00
|
|
|
Block->addLine(Line);
|
2013-11-14 00:07:15 +00:00
|
|
|
}
|
2011-09-28 18:50:00 +00:00
|
|
|
}
|
2013-11-14 00:07:15 +00:00
|
|
|
if (!Buff.readInt(Dummy)) return false; // flag
|
2011-09-28 18:50:00 +00:00
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2013-12-03 00:15:49 +00:00
|
|
|
/// readGCDA - Read a function from the GCDA buffer. Return false if an error
|
|
|
|
/// occurs.
|
2013-12-04 04:49:23 +00:00
|
|
|
bool GCOVFunction::readGCDA(GCOVBuffer &Buff, GCOV::GCOVVersion Version) {
|
2013-12-03 00:15:49 +00:00
|
|
|
uint32_t Dummy;
|
|
|
|
if (!Buff.readInt(Dummy)) return false; // Function header length
|
2013-12-04 08:57:17 +00:00
|
|
|
|
2013-12-04 05:42:28 +00:00
|
|
|
uint32_t GCDAIdent;
|
|
|
|
if (!Buff.readInt(GCDAIdent)) return false;
|
|
|
|
if (Ident != GCDAIdent) {
|
|
|
|
errs() << "Function identifiers do not match: " << Ident << " != "
|
|
|
|
<< GCDAIdent << " (in " << Name << ").\n";
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2013-12-04 08:57:17 +00:00
|
|
|
uint32_t GCDAChecksum;
|
|
|
|
if (!Buff.readInt(GCDAChecksum)) return false;
|
|
|
|
if (Checksum != GCDAChecksum) {
|
|
|
|
errs() << "Function checksums do not match: " << Checksum << " != "
|
|
|
|
<< GCDAChecksum << " (in " << Name << ").\n";
|
|
|
|
return false;
|
|
|
|
}
|
2013-12-04 05:42:28 +00:00
|
|
|
|
|
|
|
uint32_t CfgChecksum;
|
|
|
|
if (Version != GCOV::V402) {
|
|
|
|
if (!Buff.readInt(CfgChecksum)) return false;
|
|
|
|
if (Parent.getChecksum() != CfgChecksum) {
|
|
|
|
errs() << "File checksums do not match: " << Parent.getChecksum()
|
|
|
|
<< " != " << CfgChecksum << " (in " << Name << ").\n";
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
StringRef GCDAName;
|
|
|
|
if (!Buff.readString(GCDAName)) return false;
|
|
|
|
if (Name != GCDAName) {
|
|
|
|
errs() << "Function names do not match: " << Name << " != " << GCDAName
|
|
|
|
<< ".\n";
|
|
|
|
return false;
|
|
|
|
}
|
2013-12-03 00:15:49 +00:00
|
|
|
|
|
|
|
if (!Buff.readArcTag()) {
|
2013-12-04 05:42:28 +00:00
|
|
|
errs() << "Arc tag not found (in " << Name << ").\n";
|
2013-12-03 00:15:49 +00:00
|
|
|
return false;
|
|
|
|
}
|
2013-12-03 00:24:44 +00:00
|
|
|
|
2013-12-03 00:15:49 +00:00
|
|
|
uint32_t Count;
|
|
|
|
if (!Buff.readInt(Count)) return false;
|
|
|
|
Count /= 2;
|
|
|
|
|
|
|
|
// This for loop adds the counts for each block. A second nested loop is
|
|
|
|
// required to combine the edge counts that are contained in the GCDA file.
|
2013-12-03 00:24:44 +00:00
|
|
|
for (uint32_t BlockNo = 0; Count > 0; ++BlockNo) {
|
|
|
|
// The last block is always reserved for exit block
|
|
|
|
if (BlockNo >= Blocks.size()-1) {
|
2013-12-04 05:42:28 +00:00
|
|
|
errs() << "Unexpected number of edges (in " << Name << ").\n";
|
2013-12-03 00:15:49 +00:00
|
|
|
return false;
|
|
|
|
}
|
2013-12-03 00:24:44 +00:00
|
|
|
GCOVBlock &Block = *Blocks[BlockNo];
|
|
|
|
for (size_t EdgeNo = 0, End = Block.getNumDstEdges(); EdgeNo < End;
|
|
|
|
++EdgeNo) {
|
2013-12-03 00:15:49 +00:00
|
|
|
if (Count == 0) {
|
2013-12-04 05:42:28 +00:00
|
|
|
errs() << "Unexpected number of edges (in " << Name << ").\n";
|
2013-12-03 00:15:49 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
uint64_t ArcCount;
|
|
|
|
if (!Buff.readInt64(ArcCount)) return false;
|
2013-12-03 00:24:44 +00:00
|
|
|
Block.addCount(EdgeNo, ArcCount);
|
2013-12-03 00:15:49 +00:00
|
|
|
--Count;
|
|
|
|
}
|
2013-12-13 01:15:07 +00:00
|
|
|
Block.sortDstEdges();
|
2013-12-03 00:15:49 +00:00
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2013-12-13 01:15:07 +00:00
|
|
|
/// getEntryCount - Get the number of times the function was called by
|
|
|
|
/// retrieving the entry block's count.
|
|
|
|
uint64_t GCOVFunction::getEntryCount() const {
|
|
|
|
return Blocks.front()->getCount();
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getExitCount - Get the number of times the function returned by retrieving
|
|
|
|
/// the exit block's count.
|
|
|
|
uint64_t GCOVFunction::getExitCount() const {
|
|
|
|
return Blocks.back()->getCount();
|
|
|
|
}
|
|
|
|
|
2013-10-25 02:22:24 +00:00
|
|
|
/// dump - Dump GCOVFunction content to dbgs() for debugging purposes.
|
2013-11-19 20:33:32 +00:00
|
|
|
void GCOVFunction::dump() const {
|
2013-10-25 02:22:24 +00:00
|
|
|
dbgs() << "===== " << Name << " @ " << Filename << ":" << LineNumber << "\n";
|
2013-11-19 20:33:32 +00:00
|
|
|
for (SmallVectorImpl<GCOVBlock *>::const_iterator I = Blocks.begin(),
|
2012-07-19 00:11:40 +00:00
|
|
|
E = Blocks.end(); I != E; ++I)
|
2011-09-28 18:50:00 +00:00
|
|
|
(*I)->dump();
|
|
|
|
}
|
|
|
|
|
|
|
|
/// collectLineCounts - Collect line counts. This must be used after
|
|
|
|
/// reading .gcno and .gcda files.
|
|
|
|
void GCOVFunction::collectLineCounts(FileInfo &FI) {
|
2013-07-04 01:31:24 +00:00
|
|
|
for (SmallVectorImpl<GCOVBlock *>::iterator I = Blocks.begin(),
|
2012-07-19 00:11:40 +00:00
|
|
|
E = Blocks.end(); I != E; ++I)
|
2011-09-28 18:50:00 +00:00
|
|
|
(*I)->collectLineCounts(FI);
|
2013-12-13 01:15:07 +00:00
|
|
|
FI.addFunctionLine(Filename, LineNumber, this);
|
2011-09-28 18:50:00 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// GCOVBlock implementation.
|
|
|
|
|
|
|
|
/// ~GCOVBlock - Delete GCOVBlock and its content.
|
|
|
|
GCOVBlock::~GCOVBlock() {
|
2013-12-03 00:24:44 +00:00
|
|
|
SrcEdges.clear();
|
|
|
|
DstEdges.clear();
|
2013-11-14 00:32:00 +00:00
|
|
|
Lines.clear();
|
2011-09-28 18:50:00 +00:00
|
|
|
}
|
|
|
|
|
2013-12-03 00:24:44 +00:00
|
|
|
/// addCount - Add to block counter while storing the edge count. If the
|
|
|
|
/// destination has no outgoing edges, also update that block's count too.
|
|
|
|
void GCOVBlock::addCount(size_t DstEdgeNo, uint64_t N) {
|
|
|
|
assert(DstEdgeNo < DstEdges.size()); // up to caller to ensure EdgeNo is valid
|
|
|
|
DstEdges[DstEdgeNo]->Count = N;
|
|
|
|
Counter += N;
|
|
|
|
if (!DstEdges[DstEdgeNo]->Dst->getNumDstEdges())
|
|
|
|
DstEdges[DstEdgeNo]->Dst->Counter += N;
|
|
|
|
}
|
|
|
|
|
2013-12-13 01:15:07 +00:00
|
|
|
/// sortDstEdges - Sort destination edges by block number, nop if already
|
|
|
|
/// sorted. This is required for printing branch info in the correct order.
|
|
|
|
void GCOVBlock::sortDstEdges() {
|
|
|
|
if (!DstEdgesAreSorted) {
|
|
|
|
SortDstEdgesFunctor SortEdges;
|
|
|
|
std::stable_sort(DstEdges.begin(), DstEdges.end(), SortEdges);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-09-28 18:50:00 +00:00
|
|
|
/// collectLineCounts - Collect line counts. This must be used after
|
|
|
|
/// reading .gcno and .gcda files.
|
|
|
|
void GCOVBlock::collectLineCounts(FileInfo &FI) {
|
2013-11-14 00:32:00 +00:00
|
|
|
for (SmallVectorImpl<uint32_t>::iterator I = Lines.begin(),
|
2012-07-19 00:11:40 +00:00
|
|
|
E = Lines.end(); I != E; ++I)
|
2013-12-03 00:38:21 +00:00
|
|
|
FI.addBlockLine(Parent.getFilename(), *I, this);
|
2011-09-28 18:50:00 +00:00
|
|
|
}
|
|
|
|
|
2013-10-25 02:22:24 +00:00
|
|
|
/// dump - Dump GCOVBlock content to dbgs() for debugging purposes.
|
2013-11-19 20:33:32 +00:00
|
|
|
void GCOVBlock::dump() const {
|
2013-10-25 02:22:24 +00:00
|
|
|
dbgs() << "Block : " << Number << " Counter : " << Counter << "\n";
|
2013-12-03 00:24:44 +00:00
|
|
|
if (!SrcEdges.empty()) {
|
|
|
|
dbgs() << "\tSource Edges : ";
|
|
|
|
for (EdgeIterator I = SrcEdges.begin(), E = SrcEdges.end(); I != E; ++I) {
|
|
|
|
const GCOVEdge *Edge = *I;
|
|
|
|
dbgs() << Edge->Src->Number << " (" << Edge->Count << "), ";
|
|
|
|
}
|
|
|
|
dbgs() << "\n";
|
|
|
|
}
|
|
|
|
if (!DstEdges.empty()) {
|
|
|
|
dbgs() << "\tDestination Edges : ";
|
|
|
|
for (EdgeIterator I = DstEdges.begin(), E = DstEdges.end(); I != E; ++I) {
|
|
|
|
const GCOVEdge *Edge = *I;
|
|
|
|
dbgs() << Edge->Dst->Number << " (" << Edge->Count << "), ";
|
|
|
|
}
|
2013-10-25 02:22:24 +00:00
|
|
|
dbgs() << "\n";
|
2011-09-28 18:50:00 +00:00
|
|
|
}
|
|
|
|
if (!Lines.empty()) {
|
2013-10-25 02:22:24 +00:00
|
|
|
dbgs() << "\tLines : ";
|
2013-11-19 20:33:32 +00:00
|
|
|
for (SmallVectorImpl<uint32_t>::const_iterator I = Lines.begin(),
|
2013-11-14 00:32:00 +00:00
|
|
|
E = Lines.end(); I != E; ++I)
|
|
|
|
dbgs() << (*I) << ",";
|
|
|
|
dbgs() << "\n";
|
2011-09-28 18:50:00 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// FileInfo implementation.
|
|
|
|
|
2013-12-13 01:15:07 +00:00
|
|
|
// Safe integer division, returns 0 if numerator is 0.
|
|
|
|
static uint32_t safeDiv(uint64_t Numerator, uint64_t Divisor) {
|
|
|
|
if (!Numerator)
|
|
|
|
return 0;
|
|
|
|
return Numerator/Divisor;
|
|
|
|
}
|
|
|
|
|
|
|
|
// This custom division function mimics gcov's branch ouputs:
|
|
|
|
// - Round to closest whole number
|
|
|
|
// - Only output 0% or 100% if it's exactly that value
|
|
|
|
static uint32_t branchDiv(uint64_t Numerator, uint64_t Divisor) {
|
|
|
|
if (!Numerator)
|
|
|
|
return 0;
|
|
|
|
if (Numerator == Divisor)
|
|
|
|
return 100;
|
|
|
|
|
|
|
|
uint8_t Res = (Numerator*100+Divisor/2) / Divisor;
|
|
|
|
if (Res == 0)
|
|
|
|
return 1;
|
|
|
|
if (Res == 100)
|
|
|
|
return 99;
|
|
|
|
return Res;
|
|
|
|
}
|
|
|
|
|
2013-12-18 18:40:15 +00:00
|
|
|
struct formatBranchInfo {
|
|
|
|
formatBranchInfo(const GCOVOptions &Options, uint64_t Count,
|
|
|
|
uint64_t Total) :
|
|
|
|
Options(Options), Count(Count), Total(Total) {}
|
|
|
|
|
|
|
|
void print(raw_ostream &OS) const {
|
|
|
|
if (!Total)
|
|
|
|
OS << "never executed";
|
|
|
|
else if (Options.BranchCount)
|
|
|
|
OS << "taken " << Count;
|
|
|
|
else
|
|
|
|
OS << "taken " << branchDiv(Count, Total) << "%";
|
|
|
|
}
|
|
|
|
|
|
|
|
const GCOVOptions &Options;
|
|
|
|
uint64_t Count;
|
|
|
|
uint64_t Total;
|
|
|
|
};
|
|
|
|
|
|
|
|
static raw_ostream &operator<<(raw_ostream &OS, const formatBranchInfo &FBI) {
|
|
|
|
FBI.print(OS);
|
|
|
|
return OS;
|
|
|
|
}
|
|
|
|
|
2011-09-28 18:50:00 +00:00
|
|
|
/// print - Print source files with collected line count information.
|
2013-12-13 01:15:07 +00:00
|
|
|
void FileInfo::print(StringRef GCNOFile, StringRef GCDAFile) const {
|
2013-12-03 00:38:21 +00:00
|
|
|
for (StringMap<LineData>::const_iterator I = LineInfo.begin(),
|
2013-11-19 20:33:32 +00:00
|
|
|
E = LineInfo.end(); I != E; ++I) {
|
2011-09-28 18:50:00 +00:00
|
|
|
StringRef Filename = I->first();
|
2013-11-05 01:56:29 +00:00
|
|
|
OwningPtr<MemoryBuffer> Buff;
|
|
|
|
if (error_code ec = MemoryBuffer::getFileOrSTDIN(Filename, Buff)) {
|
|
|
|
errs() << Filename << ": " << ec.message() << "\n";
|
|
|
|
return;
|
|
|
|
}
|
2013-11-15 09:44:17 +00:00
|
|
|
StringRef AllLines = Buff->getBuffer();
|
2013-11-19 20:57:20 +00:00
|
|
|
|
2013-12-05 20:45:36 +00:00
|
|
|
std::string CovFilename = Filename.str() + ".gcov";
|
2013-12-03 00:57:11 +00:00
|
|
|
std::string ErrorInfo;
|
|
|
|
raw_fd_ostream OS(CovFilename.c_str(), ErrorInfo);
|
|
|
|
if (!ErrorInfo.empty())
|
|
|
|
errs() << ErrorInfo << "\n";
|
|
|
|
|
2013-11-19 20:57:20 +00:00
|
|
|
OS << " -: 0:Source:" << Filename << "\n";
|
2013-12-04 05:07:36 +00:00
|
|
|
OS << " -: 0:Graph:" << GCNOFile << "\n";
|
|
|
|
OS << " -: 0:Data:" << GCDAFile << "\n";
|
2013-11-19 20:57:20 +00:00
|
|
|
OS << " -: 0:Runs:" << RunCount << "\n";
|
|
|
|
OS << " -: 0:Programs:" << ProgramCount << "\n";
|
|
|
|
|
2013-12-03 01:35:31 +00:00
|
|
|
const LineData &Line = I->second;
|
2013-12-13 01:15:07 +00:00
|
|
|
for (uint32_t LineIndex = 0; !AllLines.empty(); ++LineIndex) {
|
2013-12-18 18:40:15 +00:00
|
|
|
if (Options.BranchInfo) {
|
2013-12-13 01:15:07 +00:00
|
|
|
FunctionLines::const_iterator FuncsIt = Line.Functions.find(LineIndex);
|
|
|
|
if (FuncsIt != Line.Functions.end())
|
|
|
|
printFunctionSummary(OS, FuncsIt->second);
|
|
|
|
}
|
2013-12-03 01:35:31 +00:00
|
|
|
|
2013-12-13 01:15:07 +00:00
|
|
|
BlockLines::const_iterator BlocksIt = Line.Blocks.find(LineIndex);
|
|
|
|
if (BlocksIt == Line.Blocks.end()) {
|
|
|
|
// No basic blocks are on this line. Not an executable line of code.
|
|
|
|
OS << " -:";
|
|
|
|
std::pair<StringRef, StringRef> P = AllLines.split('\n');
|
|
|
|
OS << format("%5u:", LineIndex+1) << P.first << "\n";
|
|
|
|
AllLines = P.second;
|
|
|
|
} else {
|
2013-12-03 00:38:21 +00:00
|
|
|
const BlockVector &Blocks = BlocksIt->second;
|
2013-12-13 01:15:07 +00:00
|
|
|
|
|
|
|
// Add up the block counts to form line counts.
|
2013-12-03 00:38:21 +00:00
|
|
|
uint64_t LineCount = 0;
|
|
|
|
for (BlockVector::const_iterator I = Blocks.begin(), E = Blocks.end();
|
|
|
|
I != E; ++I) {
|
2013-12-10 01:02:07 +00:00
|
|
|
const GCOVBlock *Block = *I;
|
|
|
|
if (Options.AllBlocks) {
|
|
|
|
// Only take the highest block count for that line.
|
|
|
|
uint64_t BlockCount = Block->getCount();
|
|
|
|
LineCount = LineCount > BlockCount ? LineCount : BlockCount;
|
|
|
|
} else {
|
|
|
|
// Sum up all of the block counts.
|
|
|
|
LineCount += Block->getCount();
|
|
|
|
}
|
2013-12-03 00:38:21 +00:00
|
|
|
}
|
|
|
|
if (LineCount == 0)
|
2013-11-02 00:09:17 +00:00
|
|
|
OS << " #####:";
|
2013-10-23 19:45:03 +00:00
|
|
|
else
|
2013-12-03 00:38:21 +00:00
|
|
|
OS << format("%9" PRIu64 ":", LineCount);
|
2013-12-10 01:02:07 +00:00
|
|
|
|
2013-12-13 01:15:07 +00:00
|
|
|
std::pair<StringRef, StringRef> P = AllLines.split('\n');
|
|
|
|
OS << format("%5u:", LineIndex+1) << P.first << "\n";
|
|
|
|
AllLines = P.second;
|
|
|
|
|
2013-12-10 01:02:07 +00:00
|
|
|
uint32_t BlockNo = 0;
|
2013-12-13 01:15:07 +00:00
|
|
|
uint32_t EdgeNo = 0;
|
2013-12-10 01:02:07 +00:00
|
|
|
for (BlockVector::const_iterator I = Blocks.begin(), E = Blocks.end();
|
|
|
|
I != E; ++I) {
|
|
|
|
const GCOVBlock *Block = *I;
|
|
|
|
|
2013-12-13 01:15:07 +00:00
|
|
|
// Only print block and branch information at the end of the block.
|
|
|
|
if (Block->getLastLine() != LineIndex+1)
|
|
|
|
continue;
|
|
|
|
if (Options.AllBlocks)
|
|
|
|
printBlockInfo(OS, *Block, LineIndex, BlockNo);
|
2013-12-18 18:40:15 +00:00
|
|
|
if (Options.BranchInfo) {
|
2013-12-16 22:14:02 +00:00
|
|
|
size_t NumEdges = Block->getNumDstEdges();
|
|
|
|
if (NumEdges > 1)
|
|
|
|
printBranchInfo(OS, *Block, EdgeNo);
|
|
|
|
else if (Options.UncondBranch && NumEdges == 1)
|
|
|
|
printUncondBranchInfo(OS, EdgeNo, (*Block->dst_begin())->Count);
|
|
|
|
}
|
2013-12-10 01:02:07 +00:00
|
|
|
}
|
|
|
|
}
|
2011-09-28 18:50:00 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2013-12-13 01:15:07 +00:00
|
|
|
|
|
|
|
/// printFunctionSummary - Print function and block summary.
|
|
|
|
void FileInfo::printFunctionSummary(raw_fd_ostream &OS,
|
|
|
|
const FunctionVector &Funcs) const {
|
|
|
|
for (FunctionVector::const_iterator I = Funcs.begin(), E = Funcs.end();
|
|
|
|
I != E; ++I) {
|
|
|
|
const GCOVFunction *Func = *I;
|
|
|
|
uint64_t EntryCount = Func->getEntryCount();
|
|
|
|
uint32_t BlocksExecuted = 0;
|
|
|
|
for (GCOVFunction::BlockIterator I = Func->block_begin(),
|
|
|
|
E = Func->block_end(); I != E; ++I) {
|
|
|
|
const GCOVBlock *Block = *I;
|
|
|
|
if (Block->getNumDstEdges() && Block->getCount())
|
|
|
|
++BlocksExecuted;
|
|
|
|
}
|
|
|
|
|
|
|
|
OS << "function " << Func->getName() << " called " << EntryCount
|
|
|
|
<< " returned " << safeDiv(Func->getExitCount()*100, EntryCount)
|
|
|
|
<< "% blocks executed "
|
|
|
|
<< safeDiv(BlocksExecuted*100, Func->getNumBlocks()-1) << "%\n";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// printBlockInfo - Output counts for each block.
|
|
|
|
void FileInfo::printBlockInfo(raw_fd_ostream &OS, const GCOVBlock &Block,
|
|
|
|
uint32_t LineIndex, uint32_t &BlockNo) const {
|
|
|
|
if (Block.getCount() == 0)
|
|
|
|
OS << " $$$$$:";
|
|
|
|
else
|
|
|
|
OS << format("%9" PRIu64 ":", Block.getCount());
|
|
|
|
OS << format("%5u-block %2u\n", LineIndex+1, BlockNo++);
|
|
|
|
}
|
|
|
|
|
2013-12-16 22:14:02 +00:00
|
|
|
/// printBranchInfo - Print conditional branch probabilities.
|
2013-12-13 01:15:07 +00:00
|
|
|
void FileInfo::printBranchInfo(raw_fd_ostream &OS, const GCOVBlock &Block,
|
2013-12-16 22:14:02 +00:00
|
|
|
uint32_t &EdgeNo) const {
|
2013-12-13 01:15:07 +00:00
|
|
|
SmallVector<uint64_t, 16> BranchCounts;
|
|
|
|
uint64_t TotalCounts = 0;
|
|
|
|
for (GCOVBlock::EdgeIterator I = Block.dst_begin(), E = Block.dst_end();
|
|
|
|
I != E; ++I) {
|
|
|
|
const GCOVEdge *Edge = *I;
|
|
|
|
BranchCounts.push_back(Edge->Count);
|
|
|
|
TotalCounts += Edge->Count;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (SmallVectorImpl<uint64_t>::const_iterator I = BranchCounts.begin(),
|
|
|
|
E = BranchCounts.end(); I != E; ++I) {
|
2013-12-18 18:40:15 +00:00
|
|
|
OS << format("branch %2u ", EdgeNo++)
|
|
|
|
<< formatBranchInfo(Options, *I, TotalCounts) << "\n";
|
2013-12-13 01:15:07 +00:00
|
|
|
}
|
|
|
|
}
|
2013-12-16 22:14:02 +00:00
|
|
|
|
|
|
|
/// printUncondBranchInfo - Print unconditional branch probabilities.
|
|
|
|
void FileInfo::printUncondBranchInfo(raw_fd_ostream &OS, uint32_t &EdgeNo,
|
|
|
|
uint64_t Count) const {
|
2013-12-18 18:40:15 +00:00
|
|
|
OS << format("unconditional %2u ", EdgeNo++)
|
|
|
|
<< formatBranchInfo(Options, Count, Count) << "\n";
|
2013-12-16 22:14:02 +00:00
|
|
|
}
|