| line |
true |
false |
branch |
|
79
|
56 |
7 |
for (i = 0; i < cover->size ; i++) { |
|
81
|
44 |
12 |
if (!node) { |
|
106
|
3 |
128 |
if (file[0] == '(') |
|
117
|
110 |
18 |
if (! LINE_IS_COVERED(node->lines, line)) { |
|
127
|
3 |
168 |
if (file[0] == '(') |
|
148
|
0 |
7 |
if ((env_filter = getenv("DEVEL_QUICKCOVER_INCLUDE"))) { |
|
152
|
0 |
7 |
if ((env_filter = getenv("DEVEL_QUICKCOVER_EXCLUDE"))) { |
|
161
|
56 |
7 |
for (i = 0 ; i < cover->size; i++) { |
|
165
|
12 |
44 |
if (!node || !node->bcnt) { |
|
|
1 |
11 |
if (!node || !node->bcnt) { |
|
169
|
11 |
0 |
if (include || exclude) { |
|
|
0 |
11 |
if (include || exclude) { |
|
174
|
0 |
0 |
if (include && !pregexec(include, node->file, node->file + len, node->file, 0, sv, 0)) { |
|
|
0 |
0 |
if (include && !pregexec(include, node->file, node->file + len, node->file, 0, sv, 0)) { |
|
179
|
0 |
0 |
if (exclude && pregexec(exclude, node->file, node->file + len, node->file, 0, sv, 0)) { |
|
|
0 |
0 |
if (exclude && pregexec(exclude, node->file, node->file + len, node->file, 0, sv, 0)) { |
|
184
|
4 |
7 |
if (ncount++) { |
|
190
|
1162 |
11 |
for (j = 1; j <= node->bmax; ++j) { |
|
191
|
110 |
1052 |
if (LINE_IS_COVERED(node->lines, j)) { |
|
192
|
99 |
11 |
if (lcount++) { |
|
200
|
1162 |
11 |
for (j = 1; j <= node->bmax; ++j) { |
|
201
|
152 |
1010 |
if (LINE_IS_PRESENT_OR_COVERED(node->lines, j)) { |
|
202
|
141 |
11 |
if (lcount++) { |
|
211
|
152 |
1010 |
OUTPUT_COMPILER_PHASE("BEGIN" , <=, PERL_PHASE_START , 1); |
|
|
87 |
65 |
OUTPUT_COMPILER_PHASE("BEGIN" , <=, PERL_PHASE_START , 1); |
|
|
81 |
6 |
OUTPUT_COMPILER_PHASE("BEGIN" , <=, PERL_PHASE_START , 1); |
|
|
1162 |
11 |
OUTPUT_COMPILER_PHASE("BEGIN" , <=, PERL_PHASE_START , 1); |
|
212
|
152 |
1010 |
OUTPUT_COMPILER_PHASE("CHECK" , ==, PERL_PHASE_CHECK , 1); |
|
|
38 |
114 |
OUTPUT_COMPILER_PHASE("CHECK" , ==, PERL_PHASE_CHECK , 1); |
|
|
34 |
4 |
OUTPUT_COMPILER_PHASE("CHECK" , ==, PERL_PHASE_CHECK , 1); |
|
|
1162 |
11 |
OUTPUT_COMPILER_PHASE("CHECK" , ==, PERL_PHASE_CHECK , 1); |
|
213
|
152 |
1010 |
OUTPUT_COMPILER_PHASE("INIT" , ==, PERL_PHASE_INIT , 1); |
|
|
1 |
151 |
OUTPUT_COMPILER_PHASE("INIT" , ==, PERL_PHASE_INIT , 1); |
|
|
0 |
1 |
OUTPUT_COMPILER_PHASE("INIT" , ==, PERL_PHASE_INIT , 1); |
|
|
1162 |
11 |
OUTPUT_COMPILER_PHASE("INIT" , ==, PERL_PHASE_INIT , 1); |
|
214
|
152 |
1010 |
OUTPUT_COMPILER_PHASE("RUN" , ==, PERL_PHASE_RUN , 1); |
|
|
25 |
127 |
OUTPUT_COMPILER_PHASE("RUN" , ==, PERL_PHASE_RUN , 1); |
|
|
18 |
7 |
OUTPUT_COMPILER_PHASE("RUN" , ==, PERL_PHASE_RUN , 1); |
|
|
1162 |
11 |
OUTPUT_COMPILER_PHASE("RUN" , ==, PERL_PHASE_RUN , 1); |
|
215
|
152 |
1010 |
OUTPUT_COMPILER_PHASE("END" , ==, PERL_PHASE_END , 1); |
|
|
1 |
151 |
OUTPUT_COMPILER_PHASE("END" , ==, PERL_PHASE_END , 1); |
|
|
0 |
1 |
OUTPUT_COMPILER_PHASE("END" , ==, PERL_PHASE_END , 1); |
|
|
1162 |
11 |
OUTPUT_COMPILER_PHASE("END" , ==, PERL_PHASE_END , 1); |
|
216
|
152 |
1010 |
OUTPUT_COMPILER_PHASE("DESTRUCT", ==, PERL_PHASE_DESTRUCT, 0); |
|
|
0 |
152 |
OUTPUT_COMPILER_PHASE("DESTRUCT", ==, PERL_PHASE_DESTRUCT, 0); |
|
|
0 |
0 |
OUTPUT_COMPILER_PHASE("DESTRUCT", ==, PERL_PHASE_DESTRUCT, 0); |
|
|
1162 |
11 |
OUTPUT_COMPILER_PHASE("DESTRUCT", ==, PERL_PHASE_DESTRUCT, 0); |
|
220
|
88 |
11 |
for (j = 0, scount = 0; j < node->subs.size; j++) { |
|
223
|
50 |
38 |
if (!sub_node) { |
|
227
|
32 |
6 |
if (scount++) { |
|
230
|
25 |
13 |
phase = sub_node->phase == PERL_PHASE_CONSTRUCT ? "" : |
|
231
|
20 |
5 |
sub_node->phase == PERL_PHASE_START ? "BEGIN" : |
|
245
|
113 |
183 |
if (node->bmax < line) { |
|
251
|
14 |
282 |
if (node->alen < needed) { |
|
254
|
3 |
11 |
int size = node->alen ? node->alen : COVER_INITIAL_SIZE; |
|
255
|
13 |
14 |
while (size < needed) { |
|
279
|
426 |
12 |
while (where[pos] && |
|
|
77 |
349 |
while (where[pos] && |
|
280
|
0 |
349 |
(hash != where[pos]->hash || |
|
305
|
0 |
361 |
if (3 * cover->used > 2 * cover->size) { |
|
307
|
0 |
0 |
for (i = 0; i < cover->size; i++) { |
|
308
|
0 |
0 |
if (!cover->list[i]) { |
|
321
|
349 |
12 |
if (cover->list[pos]) { |
|
328
|
0 |
12 |
GMEM_NEWSTR(node->file, file, -1, l); |
|
352
|
96 |
12 |
for (i = 0; i < cover->size ; i++) { |
|
354
|
57 |
39 |
if (!node) { |
|
376
|
26 |
0 |
if (node->phase == PERL_PHASE_CONSTRUCT) |
|
396
|
43 |
69 |
while (where[pos] && |
|
|
17 |
26 |
while (where[pos] && |
|
397
|
0 |
26 |
(hash != where[pos]->hash || |
|
424
|
7 |
58 |
if (sub_cover->size == 0) { |
|
428
|
5 |
60 |
if (3 * sub_cover->used > 2 * sub_cover->size) { |
|
430
|
40 |
5 |
for (i = 0; i < sub_cover->size; i++) { |
|
431
|
10 |
30 |
if (!sub_cover->list[i]) { |
|
446
|
26 |
39 |
if (sub_cover->list[pos]) { |
|
452
|
0 |
39 |
GMEM_NEWSTR(node->sub, name, -1, l); |