| line |
true |
false |
branch |
|
36
|
0 |
14 |
if (a->max == a->alloc) { |
|
50
|
0 |
25 |
if (a->max == a->alloc) { |
|
78
|
14 |
0 |
if (new->next) { |
|
83
|
0 |
0 |
PREP_LINKS(ctx->current, ctx->avail.alloc); |
|
94
|
0 |
11 |
if (ctx == NULL) |
|
96
|
11 |
0 |
if (ctx->thresh.alloc) |
|
98
|
11 |
0 |
if (ctx->links.alloc) |
|
100
|
11 |
0 |
if (ctx->avail.alloc) { |
|
101
|
11 |
11 |
while (ctx->avail.max >= 0) |
|
128
|
1089 |
11 |
PREP_LINKS(ctx->current, 100); |
|
139
|
14 |
0 |
if (high <= 0) |
|
141
|
10 |
4 |
if (high == -1 || aValue > a->arr[a->max]) { |
|
|
10 |
0 |
if (high == -1 || aValue > a->arr[a->max]) { |
|
145
|
0 |
0 |
while (low <= high) { |
|
148
|
0 |
0 |
if (aValue == found) |
|
150
|
0 |
0 |
else if (aValue > found) |
|
182
|
32 |
11 |
for (i = a_min; i <= a_max; ++i) { |
|
185
|
32 |
0 |
char *key = SvPVbyte(line, klen); |
|
188
|
14 |
18 |
if (lines != NULL) { |
|
192
|
14 |
14 |
for (idx = av_len(matches); idx >= 0; --idx) { |
|
199
|
0 |
14 |
if (k > 0 && ctx->thresh.arr[k] > j && |
|
|
0 |
0 |
if (k > 0 && ctx->thresh.arr[k] > j && |
|
|
0 |
0 |
if (k > 0 && ctx->thresh.arr[k] > j && |
|
206
|
14 |
0 |
if (k >= 0) { |
|
207
|
10 |
4 |
struct LK *lk = make_link(ctx, (k>0) ? |
|
210
|
14 |
0 |
if (ctx->links.max < k) { |
|
220
|
4 |
7 |
if (ctx->thresh.max >= 0) { |
|
222
|
4 |
0 |
if (GIMME_V == G_ARRAY) { |
|
|
4 |
0 |
if (GIMME_V == G_ARRAY) { |
|
226
|
14 |
4 |
for (lk = ctx->links.arr[ctx->thresh.max]; lk; lk = lk->link) { |
|
229
|
10 |
4 |
if (lk->link && lk->link->i == lk->i) |
|
|
0 |
10 |
if (lk->link && lk->link->i == lk->i) |
|
234
|
0 |
14 |
XPUSHs(sv_2mortal(newRV_noinc((SV *)arr))); |
|
|
0 |
0 |
XPUSHs(sv_2mortal(newRV_noinc((SV *)arr))); |
|
238
|
7 |
4 |
while (start < end) { |
|
246
|
0 |
0 |
for (lk = ctx->links.arr[ctx->thresh.max]; lk; lk = lk->link) { |
|
247
|
0 |
0 |
if (lk->link && lk->link->i == lk->i) |
|
|
0 |
0 |
if (lk->link && lk->link->i == lk->i) |
|
254
|
7 |
0 |
else if (GIMME_V == G_SCALAR) |
|
|
0 |
7 |
else if (GIMME_V == G_SCALAR) |