/usr/lib/perl5/Devel/Cover/DB.pm is in libdevel-cover-perl 1.08-1ubuntu2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 | # Copyright 2001-2013, Paul Johnson (paul@pjcj.net)
# This software is free. It is licensed under the same terms as Perl itself.
# The latest version of this software should be available from my homepage:
# http://www.pjcj.net
package Devel::Cover::DB;
use strict;
use warnings;
our $VERSION = '1.08'; # VERSION
use Devel::Cover::Criterion;
use Devel::Cover::DB::File;
use Devel::Cover::DB::Structure;
use Devel::Cover::DB::IO;
use Carp;
use File::Path;
use Devel::Cover::Dumper; # For debugging
my $DB = "cover.13"; # Version 13 of the database.
@Devel::Cover::DB::Criteria =
(qw( statement branch path condition subroutine pod time ));
@Devel::Cover::DB::Criteria_short =
(qw( stmt bran path cond sub pod time ));
$Devel::Cover::DB::Ignore_filenames =
qr/ # Used by Devel::Cover
(?: [\/\\]lib[\/\\](?:Storable|POSIX).pm$ )
| # Moose
(?:
(?:
reader | writer | constructor | destructor | accessor |
predicate | clearer | native \s delegation \s method |
# Template Toolkit
Parser\.yp
)
\s .* \s
(?: \( defined \s at \s .* \s line \s \d+ \) | defined \s at )
)
| # Moose
(?: generated \s method \s \( unknown \s origin \) )
| # Mouse
(?: (?: rw-accessor | ro-accessor ) \s for )
| # Template Toolkit
(?: Parser\.yp )
| # perl generated
(?: \/loader\/0x )
/x;
sub new
{
my $class = shift;
my $self =
{
criteria => \@Devel::Cover::DB::Criteria,
criteria_short => \@Devel::Cover::DB::Criteria_short,
runs => {},
collected => {},
uncoverable_file => [],
@_
};
$self->{all_criteria} = [ @{$self->{criteria}}, "total" ];
$self->{all_criteria_short} = [ @{$self->{criteria_short}}, "total" ];
$self->{base} ||= $self->{db};
bless $self, $class;
if (defined $self->{db})
{
$self->validate_db;
my $file = "$self->{db}/$DB";
$self->read($file) if -e $file;
}
$self
}
sub criteria { @{$_[0]->{ criteria }} }
sub criteria_short { @{$_[0]->{ criteria_short}} }
sub all_criteria { @{$_[0]->{all_criteria }} }
sub all_criteria_short { @{$_[0]->{all_criteria_short}} }
sub read
{
my $self = shift;
my ($file) = @_;
my $io = Devel::Cover::DB::IO->new;
my $db = eval { $io->read($file) };
if ($@ or !$db) {
warn $@;
} else {
$self->{runs} = $db->{runs};
}
$self
}
sub write
{
my $self = shift;
$self->{db} = shift if @_;
croak "No db specified" unless length $self->{db};
unless (mkdir $self->{db})
{
croak "Can't mkdir $self->{db}: $!\n" unless -d $self->{db};
}
$self->validate_db;
my $db = { runs => $self->{runs} };
my $io = Devel::Cover::DB::IO->new;
$io->write($db, "$self->{db}/$DB");
$self->{structure}->write($self->{base}) if $self->{structure};
$self
}
sub delete
{
my $self = shift;
my $db = "";
$db = $self->{db} if ref $self;
$db = shift if @_;
$self->{db} = $db if ref $self;
croak "No db specified" unless length $db;
return $self unless -d $db;
# TODO - just delete the directory?
opendir DIR, $db or die "Can't opendir $db: $!";
my @files = map "$db/$_", map /(.*)/ && $1, grep !/^\.\.?/, readdir DIR;
closedir DIR or die "Can't closedir $db: $!";
rmtree(\@files) if @files;
$self
}
sub merge_runs
{
my $self = shift;
my $db = $self->{db};
# print STDERR "merge_runs from $db/runs/*\n";
# system "ls -al $db/runs";
return $self unless length $db;
opendir DIR, "$db/runs" or return $self;
my @runs = map "$db/runs/$_", grep !/^\.\.?/, readdir DIR;
closedir DIR or die "Can't closedir $db/runs: $!";
$self->{changed_files} = {};
# The ordering is important here. The runs need to be merged in the order
# they were created. We're only at a granularity of one second, but that
# shouldn't be a problem unless a file is altered and the coverage run
# created in less than a second. I think we're OK for now.
for my $run (sort @runs)
{
# print STDERR "Devel::Cover: merging run $run <$self->{base}>\n";
my $r = Devel::Cover::DB->new(base => $self->{base}, db => $run);
$self->merge($r);
}
$self->write($db) if @runs;
rmtree(\@runs);
if (keys %{$self->{changed_files}})
{
my $st = Devel::Cover::DB::Structure->new(base => $self->{base});
$st->read_all;
for my $file (sort keys %{$self->{changed_files}})
{
# print STDERR "dealing with changed file <$file>\n";
$st->delete_file($file);
}
$st->write($self->{base});
}
$self
}
sub validate_db
{
my $self = shift;
# Check validity of the db. It is valid if the $DB file is there, or if it
# is not there but the db directory is empty, or if there is no db
# directory.
# die if the db is invalid.
# just warn for now
print STDERR "Devel::Cover: $self->{db} is an invalid database\n"
unless $self->is_valid;
$self
}
sub exists
{
my $self = shift;
-d $self->{db}
}
sub is_valid
{
my $self = shift;
return 1 if !-e $self->{db};
return 1 if -e "$self->{db}/$DB";
opendir my $fh, $self->{db} or return 0;
for my $file (readdir $fh)
{
next if $file eq "." || $file eq "..";
next if $file =~ /(?:runs|structure|debuglog|digests)$/
&& -e "$self->{db}/$file";
warn "found $file in $self->{db}";
return 0;
}
closedir $fh
}
sub collected
{
my $self = shift;
$self->cover;
sort keys %{$self->{collected}}
}
sub merge
{
my ($self, $from) = @_;
# print STDERR "Merging ", Dumper($self), "From ", Dumper($from);
while (my ($fname, $frun) = each %{$from->{runs}})
{
while (my ($file, $digest) = each %{$frun->{digests}})
{
while (my ($name, $run) = each %{$self->{runs}})
{
# print STDERR
# "digests for $file: $digest, $run->{digests}{$file}\n";
if ($run->{digests}{$file} && $digest &&
$run->{digests}{$file} ne $digest)
{
# File has changed. Delete old coverage instead of merging.
print STDOUT "Devel::Cover: Deleting old coverage for ",
"changed file $file\n"
unless $Devel::Cover::Silent;
delete $run->{digests}{$file};
delete $run->{count} {$file};
delete $run->{vec} {$file};
$self->{changed_files}{$file}++;
}
}
}
}
_merge_hash($self->{runs}, $from->{runs});
_merge_hash($self->{collected}, $from->{collected});
return $self; # TODO - what's going on here?
# When the database gets big, it's quicker to merge into what's
# already there.
_merge_hash($from->{runs}, $self->{runs});
_merge_hash($from->{collected}, $self->{collected});
for (keys %$self)
{
$from->{$_} = $self->{$_} unless $_ eq "runs" || $_ eq "collected";
}
# print STDERR "Giving ", Dumper($from);
$_[0] = $from;
}
sub _merge_hash
{
my ($into, $from) = @_;
for my $fkey (keys %{$from})
{
my $fval = $from->{$fkey};
my $fval_ref = ref $fval;
if (defined $into->{$fkey} and UNIVERSAL::isa($into->{$fkey}, "ARRAY"))
{
_merge_array($into->{$fkey}, $fval);
}
elsif (defined $fval && UNIVERSAL::isa($fval, "HASH"))
{
if (defined $into->{$fkey} and
UNIVERSAL::isa($into->{$fkey}, "HASH"))
{
_merge_hash($into->{$fkey}, $fval);
}
else
{
$into->{$fkey} = $fval;
}
}
else
{
# A scalar (or a blessed scalar). We know there is no into
# array, or we would have just merged with it.
$into->{$fkey} = $fval;
}
}
}
sub _merge_array
{
my ($into, $from) = @_;
for my $i (@$into)
{
my $f = shift @$from;
if (UNIVERSAL::isa($i, "ARRAY") ||
!defined $i && UNIVERSAL::isa($f, "ARRAY"))
{
_merge_array($i, $f || []);
}
elsif (UNIVERSAL::isa($i, "HASH") ||
!defined $i && UNIVERSAL::isa($f, "HASH") )
{
_merge_hash($i, $f || {});
}
elsif (UNIVERSAL::isa($i, "SCALAR") ||
!defined $i && UNIVERSAL::isa($f, "SCALAR") )
{
$$i += $$f;
}
else
{
if (defined $f)
{
$i ||= 0;
if ($f =~ /^\d+$/ && $i =~ /^\d+$/)
{
$i += $f;
}
elsif ($i ne $f)
{
warn "<$i> does not match <$f> - using later value";
$i = $f;
}
}
}
}
push @$into, @$from;
}
sub summary
{
my $self = shift;
my ($file, $criterion, $part) = @_;
my $f = $self->{summary}{$file};
return $f unless $f && defined $criterion;
my $c = $f->{$criterion};
$c && defined $part ? $c->{$part} : $c
}
sub calculate_summary
{
my $self = shift;
my %options = @_;
return if exists $self->{summary} && !$options{force};
my $s = $self->{summary} = {};
my @files = $self->cover->items;
if (my $files = delete $options{files})
{
my %required_files = map { ($_ => 1) } @$files;
@files = grep $required_files{$_}, @files;
}
for my $file (@files)
{
$self->cover->get($file)->calculate_summary($self, $file, \%options);
}
# print STDERR Dumper $self;
for my $file (@files)
{
$self->cover->get($file)->calculate_percentage($self, $s->{$file});
}
my $t = $self->{summary}{Total};
for my $criterion ($self->criteria)
{
next unless exists $t->{$criterion};
my $c = "Devel::Cover::\u$criterion";
$c->calculate_percentage($self, $t->{$criterion});
}
Devel::Cover::Criterion->calculate_percentage($self, $t->{total});
}
sub trimmed_file
{
my ($f, $len) = @_;
substr $f, 0, 3 - $len, "..." if length $f > $len;
$f
}
sub print_summary
{
my $self = shift;
my ($files, $criteria, $opts) = @_;
my %crit = map(($_ => 1), $self->collected);
my %options = $criteria ? map(($_ => 1), grep $crit{$_}, @$criteria)
: %crit;
$options{total} = 1 if keys %options;
my $n = keys %options;
my $oldfh = select STDOUT;
$options{files} = $files if $files && @$files;
$self->calculate_summary(%options, %$opts);
my $format = sub
{
my ($part, $criterion) = @_;
$options{$criterion} && exists $part->{$criterion}
? sprintf "%4.1f", $part->{$criterion}{percentage}
: "n/a"
};
my $fw = 77 - $n * 7;
$fw = 28 if $fw < 28;
no warnings "uninitialized";
my $fmt = "%-${fw}s" . " %6s" x $n . "\n";
printf $fmt, "-" x $fw, ("------") x $n;
printf $fmt, "File",
map { $self->{all_criteria_short}[$_] }
grep { $options{$self->{all_criteria}[$_]} }
(0 .. $#{$self->{all_criteria}});
printf $fmt, "-" x $fw, ("------") x $n;
my $s = $self->{summary};
for my $file (grep($_ ne "Total", sort keys %$s), "Total")
{
printf $fmt,
trimmed_file($file, $fw),
map { $format->($s->{$file}, $_) }
grep { $options{$_} }
@{$self->{all_criteria}};
}
printf $fmt, "-" x $fw, ("------") x $n;
print "\n\n";
select $oldfh;
}
sub add_statement
{
my $self = shift;
my ($cc, $sc, $fc, $uc) = @_;
my %line;
for my $i (0 .. $#$fc)
{
# print STDERR "statement: $i\n";
my $l = $sc->[$i];
unless (defined $l)
{
# print STDERR "sc ", scalar @$sc, ", fc ", scalar @$fc, "\n";
# print STDERR "sc ", Dumper($sc), "fc ", Dumper($fc);
warn "Devel::Cover: ignoring extra statement\n";
return;
}
my $n = $line{$l}++;
no warnings "uninitialized";
$cc->{$l}[$n][0] += $fc->[$i];
$cc->{$l}[$n][1] ||= $uc->{$l}[$n][0][1];
}
# print STDERR Dumper $uc;
# print STDERR "cc: ", Dumper $cc;
}
sub add_time
{
my $self = shift;
my ($cc, $sc, $fc) = @_;
my %line;
for my $i (0 .. $#$fc)
{
my $l = $sc->[$i];
unless (defined $l)
{
# print STDERR "sc ", scalar @$sc, ", fc ", scalar @$fc, "\n";
# print STDERR "sc ", Dumper($sc), "fc ", Dumper($fc);
warn "Devel::Cover: ignoring extra statement\n";
return;
}
my $n = $line{$l}++;
$cc->{$l}[$n] ||= do { my $c; \$c };
no warnings "uninitialized";
${$cc->{$l}[$n]} += $fc->[$i];
}
}
sub add_branch
{
my $self = shift;
my ($cc, $sc, $fc, $uc) = @_;
my %line;
for my $i (0 .. $#$fc)
{
my $l = $sc->[$i][0];
unless (defined $l)
{
warn "Devel::Cover: ignoring extra branch\n";
return;
}
my $n = $line{$l}++;
if (my $a = $cc->{$l}[$n])
{
no warnings "uninitialized";
$a->[0][0] += $fc->[$i][0];
$a->[0][1] += $fc->[$i][1];
$a->[0][2] += $fc->[$i][2] if exists $fc->[$i][2];
$a->[0][3] += $fc->[$i][3] if exists $fc->[$i][3];
}
else
{
$cc->{$l}[$n] = [ $fc->[$i], $sc->[$i][1] ];
}
$cc->{$l}[$n][2][$_->[0]] ||= $_->[1] for @{$uc->{$l}[$n]};
}
}
sub add_subroutine
{
my $self = shift;
my ($cc, $sc, $fc, $uc) = @_;
# print STDERR "add_subroutine():\n", Dumper $cc, $sc, $fc, $uc;
# $cc = { line_number => [ [ count, sub_name, uncoverable ], [ ... ] ], .. }
# $sc = [ [ line_number, sub_name ], [ ... ] ]
# $fc = [ count, ... ]
# $uc = { line_number => [ [ ??? ], [ ... ] ], ... }
# length @$sc == length @$fc
my %line;
for my $i (0 .. $#$fc)
{
my $l = $sc->[$i][0];
unless (defined $l)
{
# print STDERR "sc ", scalar @$sc, ", fc ", scalar @$fc, "\n";
# print STDERR "sc ", Dumper($sc), "fc ", Dumper($fc);
warn "Devel::Cover: ignoring extra subroutine\n";
return;
}
my $n = $line{$l}++;
if (my $a = $cc->{$l}[$n])
{
no warnings "uninitialized";
$a->[0] += $fc->[$i];
}
else
{
$cc->{$l}[$n] = [ $fc->[$i], $sc->[$i][1] ];
}
$cc->{$l}[$n][2] ||= $uc->{$l}[$n][0][1];
}
}
*add_condition = \&add_branch;
*add_pod = \&add_subroutine;
sub uncoverable_files
{
my $self = shift;
my $f = ".uncoverable";
(@{$self->{uncoverable_file}}, $f, glob("~/$f"))
}
sub uncoverable
{
my $self = shift;
my $u = {}; # holds all the uncoverable information
# First populate $u with the uncoverable information directly from the
# .uncoverable files. Then loop through the information converting it to
# the format we will use later to manage the uncoverable code. The
# primary changes are converting MD5 digests of lines to line numbers, and
# converting filenames to MD5 digests of the files.
for my $file ($self->uncoverable_files)
{
open my $f, "<", $file or next;
print STDOUT "Reading uncoverable information from $file\n"
unless $Devel::Cover::Silent;
while (<$f>)
{
chomp;
my ($file, $crit, $line, $count, $type, $class, $note) =
split " ", $_, 7;
push @{$u->{$file}{$crit}{$line}[$count]}, [$type, $class, $note];
}
}
# print STDERR Dumper $u;
# Now change the format of the uncoverable information.
for my $file (sort keys %$u)
{
# print STDERR "Reading $file\n";
open my $fh, "<", $file or do
{
warn "Devel::Cover: Can't open $file: $!\n";
next;
};
my $df = Digest::MD5->new; # MD5 digest of the file
my %dl; # maps MD5 digests of lines to line numbers
my $ln = 0; # line number
while (<$fh>)
{
# print STDERR "read [$.][$_]\n";
$dl{Digest::MD5->new->add($_)->hexdigest} = ++$ln;
$df->add($_);
}
close $fh;
my $f = $u->{$file};
# print STDERR Dumper $f;
for my $crit (keys %$f)
{
my $c = $f->{$crit};
for my $line (keys %$c)
{
if (exists $dl{$line})
{
# print STDERR
# "Found uncoverable $file:$crit:$line -> $dl{$line}\n";
# Change key from the MD5 digest to the actual line number.
$c->{$dl{$line}} = delete $c->{$line};
}
else
{
warn "Devel::Cover: Can't find line for uncovered data: " .
"$file $crit $line\n";
delete $c->{$line};
}
}
}
# Change the key from the filename to the MD5 digest of the file.
$u->{$df->hexdigest} = delete $u->{$file};
}
print STDERR Dumper $u;
$u
}
sub add_uncoverable
{
my $self = shift;
my ($adds) = @_;
for my $add (@$adds)
{
my ($file, $crit, $line, $count, $type, $class, $note) =
split " ", $_, 7;
my ($uncoverable_file) = $self->uncoverable_files;
open my $f, "<", $file or do
{
warn "Devel::Cover: Can't open $file: $!";
next;
};
while (<$f>)
{
last if $. == $line;
}
if (defined)
{
open my $u, ">>", $uncoverable_file
or die "Devel::Cover: Can't open $uncoverable_file: $!\n";
my $dl = Digest::MD5->new->add($_)->hexdigest;
print $u "$file $crit $dl $count $type $class $note\n";
}
else
{
warn "Devel::Cover: Can't find line $line in $file. ",
"Last line is $.\n";
}
close $f or die "Devel::Cover: Can't close $file: $!\n";
}
}
sub delete_uncoverable
{
my $self = shift;
}
sub clean_uncoverable
{
my $self = shift;
}
sub uncoverable_comments
{
my $self = shift;
my ($uncoverable, $file, $digest) = @_;
my $cr = join "|", @{$self->{all_criteria}};
my $uc = qr/(.*)# uncoverable ($cr)(.*)/; # regex for uncoverable comments
my %types =
(
branch => { true => 0, false => 1 },
condition => { left => 0, right => 1, false => 2 },
);
# Look for uncoverable comments
open my $fh, "<", $file or do
{
# The warning should have already been given ...
# warn "Devel::Cover: Warning: can't open $file: $!\n";
return;
};
my @waiting;
while (<$fh>)
{
chomp;
# print STDERR "read [$.][$_]\n";
next unless /$uc/ || @waiting;
if ($2)
{
my ($code, $criterion, $info) = ($1, $2, $3);
my ($count, $class, $note, $type) = (1, "default", "");
if ($criterion eq "branch" || $criterion eq "condition")
{
if ($info =~ /^\s*(\w+)(?:\s|$)/)
{
my $t = $1;
$type = $types{$criterion}{$t};
unless (defined $type)
{
warn "Unknown type $t found parsing " .
"uncoverable $criterion at $file:$.\n";
$type = 999; # partly magic number
}
}
}
$count = $1 if $info =~ /count:(\d+)/;
$class = $1 if $info =~ /class:(\w+)/;
$note = $1 if $info =~ /note:(.+)/;
# no warnings "uninitialized";
# warn "pushing $criterion, $count, $type, $class, $note";
push @waiting,
[$criterion, $count - 1, $type, $class, $note];
next unless $code =~ /\S/;
}
# found what we are waiting for
while (my $w = shift @waiting)
{
my ($criterion, $count, $type, $class, $note) = @$w;
push @{$uncoverable->{$digest}{$criterion}{$.}[$count]},
[$type, $class, $note];
}
}
close $fh;
warn scalar @waiting,
" unmatched uncoverable comments not found at end of $file\n"
if @waiting;
# TODO - read in and merge $self->uncoverable;
# print Dumper $uncoverable;
}
sub objectify_cover
{
my $self = shift;
unless (UNIVERSAL::isa($self->{cover}, "Devel::Cover::DB::Cover"))
{
bless $self->{cover}, "Devel::Cover::DB::Cover";
for my $file (values %{$self->{cover}})
{
bless $file, "Devel::Cover::DB::File";
while (my ($crit, $criterion) = each %$file)
{
next if $crit eq "meta"; # ignore meta data
my $class = "Devel::Cover::" . ucfirst lc $crit;
bless $criterion, "Devel::Cover::DB::Criterion";
for my $line (values %$criterion)
{
for my $o (@$line)
{
die "<$crit:$o>" unless ref $o;
bless $o, $class;
bless $o, $class . "_" . $o->type if $o->can("type");
# print "blessed $crit, $o\n";
}
}
}
}
for my $r (keys %{$self->{runs}})
{
if (defined $self->{runs}{$r})
{
bless $self->{runs}{$r}, "Devel::Cover::DB::Run";
}
else
{
delete $self->{runs}{$r}; # DEVEL_COVER_SELF
}
}
}
unless (exists &Devel::Cover::DB::Base::items)
{
*Devel::Cover::DB::Base::items = sub
{
my $self = shift;
keys %$self
};
*Devel::Cover::DB::Base::values = sub
{
my $self = shift;
values %$self
};
*Devel::Cover::DB::Base::get = sub
{
my $self = shift;
my ($get) = @_;
$self->{$get}
};
my $classes =
{
Cover => [ qw( files file ) ],
File => [ qw( criteria criterion ) ],
Criterion => [ qw( locations location ) ],
Location => [ qw( data datum ) ],
};
my $base = "Devel::Cover::DB::Base";
while (my ($class, $functions) = each %$classes)
{
my $c = "Devel::Cover::DB::$class";
no strict "refs";
@{"${c}::ISA"} = $base;
*{"${c}::$functions->[0]"} = \&{"${base}::values"};
*{"${c}::$functions->[1]"} = \&{"${base}::get"};
}
*Devel::Cover::DB::File::DESTROY = sub {};
unless (exists &Devel::Cover::DB::File::AUTOLOAD)
{
*Devel::Cover::DB::File::AUTOLOAD = sub
{
# Work around a change in bleadperl from 12251 to 14899.
my $func = $Devel::Cover::DB::AUTOLOAD || $::AUTOLOAD;
# print STDERR "autoloading <$func>\n";
(my $f = $func) =~ s/.*:://;
carp "Undefined subroutine $f called"
unless grep { $_ eq $f }
@{$self->{all_criteria}},
@{$self->{all_criteria_short}};
no strict "refs";
*$func = sub { shift->{$f} };
goto &$func
};
}
}
}
sub cover
{
my $self = shift;
return $self->{cover} if $self->{cover_valid};
my %digests; # mapping of digests to canonical filenames
my %files; # processed files
my $cover = $self->{cover} = {};
my $uncoverable = {};
my $st = Devel::Cover::DB::Structure->new(base => $self->{base})->read_all;
my @runs = sort { $self->{runs}{$b}{start} <=> $self->{runs}{$a}{start} }
keys %{$self->{runs}};
# print STDERR "runs: ", Dumper \@runs
my %warned;
for my $run (@runs)
{
last unless $st;
my $r = $self->{runs}{$run};
next unless $r->{collected}; # DEVEL_COVER_SELF
@{$self->{collected}}{@{$r->{collected}}} = ();
$st->add_criteria(@{$r->{collected}});
my $count = $r->{count};
# print STDERR "run $run, count: ", Dumper $count;
while (my ($file, $f) = each %$count)
{
my $digest = $r->{digests}{$file};
unless ($digest)
{
print STDERR "Devel::Cover: Can't find digest for $file\n"
unless $Devel::Cover::Silent ||
$file =~ $Devel::Cover::DB::Ignore_filenames ||
($Devel::Cover::Self_cover &&
$file =~ q|/Devel/Cover[./]|);
next;
}
# print STDERR "File: $file\n";
print STDERR "Devel::Cover: merging data for $file ",
"into $digests{$digest}\n"
if !$files{$file}++ && $digests{$digest};
$self->uncoverable_comments($uncoverable, $file, $digest)
unless $digests{$digest};
# Set up data structure to hold coverage being filled in
my $cf = $cover->{$digests{$digest} ||= $file} ||= {};
# print STDERR "st ", Dumper($st),
# "f ", Dumper($f),
# "uc ", Dumper($uncoverable->{$digest});
while (my ($criterion, $fc) = each %$f)
{
my $get = "get_$criterion";
my $sc = $st->$get($digest);
# print STDERR "$criterion: ", Dumper $sc, $fc;
unless ($sc)
{
print STDERR "Devel::Cover: Warning: can't locate ",
"structure for $criterion in $file\n"
unless $warned{$file}{$criterion}++;
next;
}
my $cc = $cf->{$criterion} ||= {};
my $add = "add_$criterion";
# print STDERR "$add():\n", Dumper $cc, $sc, $fc;
$self->$add($cc, $sc, $fc, $uncoverable->{$digest}{$criterion});
# print STDERR "--> $add():\n", Dumper $cc;
# $cc - coverage being filled in
# $sc - structure information
# $fc - coverage from this file
# $uc - uncoverable information
}
}
# print STDERR "Cover: ", Dumper $cover;
}
$self->objectify_cover;
$self->{cover_valid} = 1;
$self->{cover}
}
sub run_keys
{
my $self = shift;
$self->cover unless $self->{cover_valid};
sort { $self->{runs}{$b}{start} <=> $self->{runs}{$a}{start} }
keys %{$self->{runs}};
}
sub runs
{
my $self = shift;
$self->cover unless $self->{cover_valid};
@{$self->{runs}}{$self->run_keys}
}
package Devel::Cover::DB::Run;
our $AUTOLOAD;
sub DESTROY {}
sub AUTOLOAD
{
my $func = $AUTOLOAD;
# print STDERR "autoloading <$func>\n";
(my $f = $func) =~ s/.*:://;
no strict "refs";
*$func = sub { shift->{$f} };
goto &$func
}
1
__END__
=head1 NAME
Devel::Cover::DB - Code coverage metrics for Perl
=head1 VERSION
version 1.08
=head1 SYNOPSIS
use Devel::Cover::DB;
my $db = Devel::Cover::DB->new(db => "my_coverage_db");
$db->print_summary([$file1, $file2], ["statement", "pod"]);
=head1 DESCRIPTION
This module provides access to a database of code coverage information.
=head1 METHODS
=head2 new
my $db = Devel::Cover::DB->new(db => "my_coverage_db");
Contructs the DB from the specified database.
=head2 cover
my $cover = $db->cover;
Returns a Devel::Cover::DB::Cover object. From here all the coverage
data may be accessed.
my $cover = $db->cover;
for my $file ($cover->items)
{
print "$file\n";
my $f = $cover->file($file);
for my $criterion ($f->items)
{
print " $criterion\n";
my $c = $f->criterion($criterion);
for my $location ($c->items)
{
my $l = $c->location($location);
print " $location @$l\n";
}
}
}
Data for different criteria will be in different formats, so that will need
special handling. This is not yet documented so your best bet for now is to
look at some of the simpler reports and/or the source.
The methods in the above example are actually aliases for methods in
Devel::Cover::DB::Base (the base class for all Devel::Cover::DB::* classes):
=over
=item * Devel::Cover::DB::Base->values
Aliased to Devel::Cover::DB::Cover->files, Devel::Cover::DB::File->criteria,
Devel::Cover::DB::Criterion->locations, and Devel::Cover::DB::Location->data
=item * Devel::Cover::DB::Base->get
Aliased to Devel::Cover::DB::Cover->file, Devel::Cover::DB::File->criteriom,
Devel::Cover::DB::Criterion->location, and Devel::Cover::DB::Location->datum
=back
Instead of calling $file->criterion("x") you can also call $file->x.
=head2 is_valid
my $valid = $db->is_valid;
Returns true if $db is valid (or looks valid, the function is too lax).
=head1 SEE ALSO
Devel::Cover
Devel::Cover::DB::Base
Devel::Cover::DB::Cover
Devel::Cover::DB::File
Devel::Cover::DB::Criterion
Devel::Cover::DB::Location
=head1 BUGS
Huh?
=head1 LICENCE
Copyright 2001-2013, Paul Johnson (paul@pjcj.net)
This software is free. It is licensed under the same terms as Perl itself.
The latest version of this software should be available from my homepage:
http://www.pjcj.net
=cut
|