summaryrefslogtreecommitdiff
path: root/lib/IR/GCOV.cpp
diff options
context:
space:
mode:
authorYuchen Wu <yuchenericwu@hotmail.com>2013-10-24 01:51:04 +0000
committerYuchen Wu <yuchenericwu@hotmail.com>2013-10-24 01:51:04 +0000
commitcbbd20879e8acf35d3326a2459e17a298b5f5d15 (patch)
tree81fd09c165f8dfa30e0eb61c2dec5fec08328bfc /lib/IR/GCOV.cpp
parent577ac566c45670cd8ef03e202cb92258c643574d (diff)
downloadllvm-cbbd20879e8acf35d3326a2459e17a298b5f5d15.tar.gz
llvm-cbbd20879e8acf35d3326a2459e17a298b5f5d15.tar.bz2
llvm-cbbd20879e8acf35d3326a2459e17a298b5f5d15.tar.xz
Fixed llvm-cov to count edges instead of blocks.
This was a fundamental flaw in llvm-cov where it treated the values in the GCDA files as block counts instead of edge counts. This created incorrect line counts when branching was present. Instead, the edge counts should be summed to obtain the correct block count. The fix was tested using custom test files as well as single source files from the test-suite directory. The behaviour can be verified by reading the GCOV documentation that describes the GCDA spec ("ARC_COUNTS gives the counter values for those arcs that are instrumented") and the header description provided by GCOVProfiling.cpp ("instruments the code that runs to records (sic) the edges between blocks that run and emit a complementary "gcda" file on exit"). git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@193299 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/IR/GCOV.cpp')
-rw-r--r--lib/IR/GCOV.cpp13
1 files changed, 11 insertions, 2 deletions
diff --git a/lib/IR/GCOV.cpp b/lib/IR/GCOV.cpp
index 68b91e6dc9..908523a3a6 100644
--- a/lib/IR/GCOV.cpp
+++ b/lib/IR/GCOV.cpp
@@ -103,9 +103,18 @@ bool GCOVFunction::read(GCOVBuffer &Buff, GCOV::GCOVFormat Format) {
if (Format == GCOV::GCDA_402 || Format == GCOV::GCDA_404) {
Buff.readArcTag();
+ uint32_t i = 0;
uint32_t Count = Buff.readInt() / 2;
- for (unsigned i = 0, e = Count; i != e; ++i) {
- Blocks[i]->addCount(Buff.readInt64());
+
+ // 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.
+ for (uint32_t Line = 0; i < Count; ++Line) {
+ GCOVBlock &Block = *Blocks[Line];
+ for (size_t Edge = 0, End = Block.getNumEdges(); Edge < End; ++Edge) {
+ assert(i < Count && "Unexpected number of Edges!");
+ Block.addCount(Buff.readInt64());
+ ++i;
+ }
}
return true;
}