| line |
true |
false |
branch |
|
95
|
0 |
0 |
if ((*countptr)++ > 1000) return -1; /* too complex */ |
|
97
|
0 |
0 |
if (*code == OP_CBRA || *code == OP_SCBRA || |
|
|
0 |
0 |
if (*code == OP_CBRA || *code == OP_SCBRA || |
|
|
0 |
0 |
if (*code == OP_CBRA || *code == OP_SCBRA || |
|
98
|
0 |
0 |
*code == OP_CBRAPOS || *code == OP_SCBRAPOS) cc += IMM2_SIZE; |
|
119
|
0 |
0 |
if (*cs != OP_ALT) |
|
139
|
0 |
0 |
if (d < 0) return d; |
|
141
|
0 |
0 |
do cc += GET(cc, 1); while (*cc == OP_ALT); |
|
163
|
0 |
0 |
if (length < 0 || (!had_recurse && branchlength < length)) |
|
|
0 |
0 |
if (length < 0 || (!had_recurse && branchlength < length)) |
|
|
0 |
0 |
if (length < 0 || (!had_recurse && branchlength < length)) |
|
165
|
0 |
0 |
if (op != OP_ALT) return length; |
|
177
|
0 |
0 |
do cc += GET(cc, 1); while (*cc == OP_ALT); |
|
209
|
0 |
0 |
do cc += GET(cc, 1); while (*cc == OP_ALT); |
|
242
|
0 |
0 |
cc += (cc[1] == OP_PROP || cc[1] == OP_NOTPROP)? 4 : 2; |
|
|
0 |
0 |
cc += (cc[1] == OP_PROP || cc[1] == OP_NOTPROP)? 4 : 2; |
|
261
|
0 |
0 |
cc += 2 + IMM2_SIZE + ((cc[1 + IMM2_SIZE] == OP_PROP |
|
262
|
0 |
0 |
|| cc[1 + IMM2_SIZE] == OP_NOTPROP)? 2 : 0); |
|
318
|
0 |
0 |
if (cc[1] == OP_PROP || cc[1] == OP_NOTPROP) cc += 2; |
|
|
0 |
0 |
if (cc[1] == OP_PROP || cc[1] == OP_NOTPROP) cc += 2; |
|
325
|
0 |
0 |
if (cc[1 + IMM2_SIZE] == OP_PROP |
|
326
|
0 |
0 |
|| cc[1 + IMM2_SIZE] == OP_NOTPROP) cc += 2; |
|
390
|
0 |
0 |
if ((options & PCRE_JAVASCRIPT_COMPAT) == 0) |
|
396
|
0 |
0 |
while (count-- > 0) |
|
399
|
0 |
0 |
if (cs == NULL) return -2; |
|
400
|
0 |
0 |
do ce += GET(ce, 1); while (*ce == OP_ALT); |
|
401
|
0 |
0 |
if (cc > cs && cc < ce) /* Simple recursion */ |
|
|
0 |
0 |
if (cc > cs && cc < ce) /* Simple recursion */ |
|
410
|
0 |
0 |
for (r = recurses; r != NULL; r = r->prev) if (r->group == cs) break; |
|
|
0 |
0 |
for (r = recurses; r != NULL; r = r->prev) if (r->group == cs) break; |
|
411
|
0 |
0 |
if (r != NULL) /* Mutual recursion */ |
|
424
|
0 |
0 |
if (dd < d) d = dd; |
|
436
|
0 |
0 |
if ((options & PCRE_JAVASCRIPT_COMPAT) == 0) |
|
439
|
0 |
0 |
if (cs == NULL) return -2; |
|
440
|
0 |
0 |
do ce += GET(ce, 1); while (*ce == OP_ALT); |
|
441
|
0 |
0 |
if (cc > cs && cc < ce) /* Simple recursion */ |
|
|
0 |
0 |
if (cc > cs && cc < ce) /* Simple recursion */ |
|
449
|
0 |
0 |
for (r = recurses; r != NULL; r = r->prev) if (r->group == cs) break; |
|
|
0 |
0 |
for (r = recurses; r != NULL; r = r->prev) if (r->group == cs) break; |
|
450
|
0 |
0 |
if (r != NULL) /* Mutual recursion */ |
|
509
|
0 |
0 |
do ce += GET(ce, 1); while (*ce == OP_ALT); |
|
510
|
0 |
0 |
if (cc > cs && cc < ce) /* Simple recursion */ |
|
|
0 |
0 |
if (cc > cs && cc < ce) /* Simple recursion */ |
|
515
|
0 |
0 |
for (r = recurses; r != NULL; r = r->prev) if (r->group == cs) break; |
|
|
0 |
0 |
for (r = recurses; r != NULL; r = r->prev) if (r->group == cs) break; |
|
516
|
0 |
0 |
if (r != NULL) /* Mutual recursion */ |
|
664
|
0 |
0 |
if (caseless && (cd->ctypes[c] & ctype_letter) != 0) SET_BIT(cd->fcc[c]); |
|
|
0 |
0 |
if (caseless && (cd->ctypes[c] & ctype_letter) != 0) SET_BIT(cd->fcc[c]); |
|
727
|
0 |
0 |
for (c = 0; c < table_limit; c++) start_bits[c] |= cd->cbits[c+cbit_type]; |
|
769
|
0 |
0 |
for (c = 0; c < table_limit; c++) start_bits[c] |= ~cd->cbits[c+cbit_type]; |
|
835
|
0 |
0 |
if (*code == OP_CBRA || *code == OP_SCBRA || |
|
|
0 |
0 |
if (*code == OP_CBRA || *code == OP_SCBRA || |
|
|
0 |
0 |
if (*code == OP_CBRA || *code == OP_SCBRA || |
|
836
|
0 |
0 |
*code == OP_CBRAPOS || *code == OP_SCBRAPOS) tcode += IMM2_SIZE; |
|
838
|
0 |
0 |
while (try_next) /* Loop for items in this branch */ |
|
931
|
0 |
0 |
if (tcode[1] != PT_CLIST) return SSB_FAIL; |
|
934
|
0 |
0 |
while ((c = *p++) < NOTACHAR) |
|
944
|
0 |
0 |
if (c > 0xff) SET_BIT(0xff); else SET_BIT(c); |
|
974
|
0 |
0 |
if (rc == SSB_FAIL || rc == SSB_UNKNOWN) return rc; |
|
|
0 |
0 |
if (rc == SSB_FAIL || rc == SSB_UNKNOWN) return rc; |
|
975
|
0 |
0 |
if (rc == SSB_DONE) try_next = FALSE; else |
|
977
|
0 |
0 |
do tcode += GET(tcode, 1); while (*tcode == OP_ALT); |
|
1011
|
0 |
0 |
do tcode += GET(tcode, 1); while (*tcode == OP_ALT); |
|
1021
|
0 |
0 |
if (rc == SSB_FAIL || rc == SSB_UNKNOWN) return rc; |
|
|
0 |
0 |
if (rc == SSB_FAIL || rc == SSB_UNKNOWN) return rc; |
|
1027
|
0 |
0 |
do tcode += GET(tcode,1); while (*tcode == OP_ALT); |
|
1035
|
0 |
0 |
do tcode += GET(tcode,1); while (*tcode == OP_ALT); |
|
1386
|
0 |
0 |
for (c = 0; c < 32; c++) start_bits[c] |= map[c]; |
|
1407
|
0 |
0 |
if (GET2(tcode, 1) == 0) tcode += 1 + 2 * IMM2_SIZE; |
|
1423
|
0 |
0 |
while (*code == OP_ALT); |
|
1475
|
0 |
0 |
if (re == NULL || re->magic_number != MAGIC_NUMBER) |
|
|
0 |
0 |
if (re == NULL || re->magic_number != MAGIC_NUMBER) |
|
1481
|
0 |
0 |
if ((re->flags & PCRE_MODE) == 0) |
|
1493
|
0 |
0 |
if ((options & ~PUBLIC_STUDY_OPTIONS) != 0) |
|
1506
|
0 |
0 |
if ((re->options & PCRE_ANCHORED) == 0 && |
|
|
0 |
0 |
if ((re->options & PCRE_ANCHORED) == 0 && |
|
1516
|
0 |
0 |
if (tables == NULL) |
|
1540
|
0 |
0 |
if (rc == SSB_UNKNOWN) |
|
1565
|
0 |
0 |
if (bits_set || min > 0 || (options & ( |
|
|
0 |
0 |
if (bits_set || min > 0 || (options & ( |
|
|
0 |
0 |
if (bits_set || min > 0 || (options & ( |
|
1574
|
0 |
0 |
if (extra == NULL) |
|
1591
|
0 |
0 |
if (bits_set) |
|
1615
|
0 |
0 |
if (min > 0) |
|
1676
|
0 |
0 |
if (extra == NULL) |