| coollex.c | |||
|---|---|---|---|
| Criterion | Covered | Total | % |
| branch | 19 | 24 | 79.1 |
| line | true | false | branch |
|---|---|---|---|
| 21 | 0 | 5 | if (b == NULL) |
| 24 | 10 | 5 | for (i = 0; i < r; i++) |
| 28 | 0 | 5 | if (c == NULL) { |
| 63 | 13 | 4 | while (c->x < c->n - 1) { |
| 66 | 6 | 7 | if (c->b[c->x] == 0) { |
| 68 | 3 | 3 | if (c->y > 1) c->x = 1; |
| 83 | 100 | 26 | for (i = 0, p = p_items; i < c->n; i++) { |
| 84 | 52 | 48 | if (c->b[i]) { /* the bitstring matters */ |
| 87 | 6 | 46 | if (SvOK(*p)) { |
| 6 | 0 | if (SvOK(*p)) { | |
| 0 | 6 | if (SvOK(*p)) { | |
| 91 | 52 | 0 | *p = (svp) ? SvREFCNT_inc(*svp) : &PL_sv_undef; |