| line |
true |
false |
branch |
|
32
|
0 |
11400114 |
if (a->max == a->alloc) { |
|
46
|
0 |
11400125 |
if (a->max == a->alloc) { |
|
74
|
145501446 |
9 |
if (new->next) { |
|
79
|
891 |
9 |
PREP_LINKS(ctx->current, ctx->avail.alloc); |
|
90
|
0 |
2 |
if (ctx == NULL) |
|
92
|
2 |
0 |
if (ctx->thresh.alloc) |
|
94
|
2 |
0 |
if (ctx->links.alloc) |
|
96
|
2 |
0 |
if (ctx->avail.alloc) { |
|
97
|
11 |
2 |
while (ctx->avail.max >= 0) |
|
125
|
198 |
2 |
PREP_LINKS(ctx->current, 100); |
|
136
|
30100301 |
118101181 |
if (high <= 0) |
|
138
|
147901479 |
300003 |
if (high == -1 || aValue > a->arr[a->max]) { |
|
|
11100111 |
136801368 |
if (high == -1 || aValue > a->arr[a->max]) { |
|
142
|
566305663 |
113701137 |
while (low <= high) { |
|
145
|
23100231 |
543205432 |
if (aValue == found) |
|
147
|
363503635 |
179701797 |
else if (aValue > found) |
|
179
|
17400174 |
300003 |
for (i = a_min; i <= a_max; ++i) { |
|
182
|
17400174 |
0 |
char *key = SvPVbyte(line, klen); |
|
185
|
17400174 |
0 |
if (lines != NULL) { |
|
189
|
168601686 |
17400174 |
for (idx = av_len(matches); idx >= 0; --idx) { |
|
196
|
138501385 |
30100301 |
if (k > 0 && ctx->thresh.arr[k] > j && |
|
|
138501385 |
0 |
if (k > 0 && ctx->thresh.arr[k] > j && |
|
|
20400204 |
118101181 |
if (k > 0 && ctx->thresh.arr[k] > j && |
|
203
|
145501455 |
23100231 |
if (k >= 0) { |
|
204
|
142101421 |
3400034 |
struct LK *lk = make_link(ctx, (k>0) ? |
|
207
|
11400114 |
134101341 |
if (ctx->links.max < k) { |
|
217
|
300003 |
0 |
if (ctx->thresh.max >= 0) { |
|
219
|
200002 |
100001 |
if (GIMME_V == G_ARRAY) { |
|
|
200003 |
100000 |
if (GIMME_V == G_ARRAY) { |
|
223
|
7400114 |
200003 |
for (lk = ctx->links.arr[ctx->thresh.max]; lk; lk = lk->link) { |
|
226
|
7200111 |
200003 |
if (lk->link && lk->link->i == lk->i) |
|
|
0 |
7200111 |
if (lk->link && lk->link->i == lk->i) |
|
231
|
0 |
7400114 |
XPUSHs(sv_2mortal(newRV_noinc((SV *)arr))); |
|
235
|
3600056 |
200003 |
while (start < end) { |
|
243
|
4000000 |
100000 |
for (lk = ctx->links.arr[ctx->thresh.max]; lk; lk = lk->link) { |
|
244
|
3900000 |
100000 |
if (lk->link && lk->link->i == lk->i) |
|
|
0 |
3900000 |
if (lk->link && lk->link->i == lk->i) |
|
251
|
0 |
0 |
else if (GIMME_V == G_SCALAR) |
|
|
0 |
0 |
else if (GIMME_V == G_SCALAR) |