line |
true |
false |
branch |
271
|
6 |
1 |
for (i = 0; i < sizeof(forced_byte_expl); ++i) |
277
|
8 |
1 |
for (i = 0; i < 8; ++i) |
297
|
273 |
11 |
for (i = 0; i < expl_size; ++i) |
310
|
255 |
6 |
*unf = TOLOWER(c); |
|
41 |
214 |
*unf = TOLOWER(c); |
311
|
255 |
6 |
unf[1] = ((*unf >= 'a') && (*unf <= 'z')) ? *unf - 'a' + 'A' : *unf; |
|
255 |
0 |
unf[1] = ((*unf >= 'a') && (*unf <= 'z')) ? *unf - 'a' + 'A' : *unf; |
322
|
8273 |
4946 |
while (mask != prev_mask) |
325
|
16546 |
8273 |
for (i = 0; i < 2; ++i) |
327
|
182006 |
16546 |
for (j = 0; j < SIZEOF_ARRAY(regclass_superset); ++j) |
331
|
91003 |
91003 |
if (i) |
340
|
21752 |
160254 |
if (mask & b) |
361
|
0 |
0 |
if (p == desc) |
367
|
0 |
0 |
while (p) |
370
|
0 |
0 |
for (i = 0; i < SIZEOF_ARRAY(regclass_names); ++i) |
372
|
0 |
0 |
if (!strncmp(p + 6, regclass_names[i], strlen(regclass_names[i]))) |
374
|
0 |
0 |
if (sign == '+') |
376
|
0 |
0 |
if (mask & (regclass_blocks[i] << MIRROR_SHIFT)) |
378
|
0 |
0 |
*map = invert ? 0 : EVERY_BLOCK; |
384
|
0 |
0 |
else if (sign == '!') |
386
|
0 |
0 |
if (mask & regclass_blocks[i]) |
388
|
0 |
0 |
*map = invert ? 0 : EVERY_BLOCK; |
407
|
0 |
0 |
if ((mask & ALPHA_BLOCK) && (mask & NUMBER_BLOCK)) |
|
0 |
0 |
if ((mask & ALPHA_BLOCK) && (mask & NUMBER_BLOCK)) |
412
|
0 |
0 |
if (invert) |
417
|
0 |
0 |
if ((mask & ALPHA_BLOCK) && (mask & NUMBER_BLOCK)) |
|
0 |
0 |
if ((mask & ALPHA_BLOCK) && (mask & NUMBER_BLOCK)) |
436
|
204 |
0 |
: (SvCUR(invlist) / sizeof(UV)) - *get_invlist_offset_addr(invlist); |
520
|
30 |
0 |
ila = ill ? invlist_array(invlist) : 0; |
525
|
0 |
0 |
if (!memcmp(ila, perl_space_invlist, sizeof(perl_space_invlist))) |
536
|
0 |
0 |
if (!memcmp(ila, perl_space_invlist + 1, |
548
|
0 |
0 |
if (!memcmp(ila, horizontal_space_invlist, sizeof(horizontal_space_invlist))) |
559
|
0 |
0 |
if (!memcmp(ila, horizontal_space_invlist + 1, |
571
|
0 |
0 |
if (!memcmp(ila, vertical_space_invlist, sizeof(vertical_space_invlist))) |
582
|
0 |
0 |
if (!memcmp(ila, vertical_space_invlist + 1, |
594
|
0 |
0 |
if (!memcmp(ila, xposix_digit_invlist, sizeof(xposix_digit_invlist))) |
605
|
0 |
0 |
if (!memcmp(ila, xposix_digit_invlist + 1, |
617
|
0 |
0 |
if (!memcmp(ila, xposix_alnum_invlist, sizeof(xposix_alnum_invlist))) |
628
|
10 |
0 |
if (!memcmp(ila, xposix_alnum_invlist + 1, |
640
|
0 |
0 |
if (!memcmp(ila, xposix_alpha_invlist, sizeof(xposix_alpha_invlist))) |
651
|
20 |
0 |
if (!memcmp(ila, xposix_alpha_invlist + 1, |
663
|
0 |
0 |
if (!memcmp(ila, xposix_word_invlist, sizeof(xposix_word_invlist))) |
674
|
0 |
0 |
if (!memcmp(ila, xposix_word_invlist + 1, |
686
|
0 |
0 |
if (!memcmp(ila, xposix_xdigit_invlist, sizeof(xposix_xdigit_invlist))) |
697
|
0 |
0 |
if (!memcmp(ila, xposix_xdigit_invlist + 1, |
709
|
30 |
0 |
if (mask) |
711
|
0 |
30 |
if (invert) |
749
|
0 |
30 |
if (!pr) /* this should have been tested by find_internal during |
758
|
30 |
0 |
if ((n < rdata->count) && |
|
30 |
0 |
if ((n < rdata->count) && |
765
|
30 |
0 |
if (si && (si != &PL_sv_undef)) |
|
0 |
30 |
if (si && (si != &PL_sv_undef)) |
771
|
0 |
0 |
return convert_desc_to_map(SvPV_nolen(*ary), |
779
|
30 |
0 |
if (av_len(av) >= 3) |
783
|
0 |
30 |
if (SvUV(ary[4])) /* invlist_has_user_defined_property */ |
|
0 |
30 |
if (SvUV(ary[4])) /* invlist_has_user_defined_property */ |
811
|
174 |
0 |
if (data && data->count) |
|
174 |
0 |
if (data && data->count) |
815
|
174 |
0 |
if (data->what[n] == 's') |
821
|
174 |
0 |
if (av_tindex(av) >= 3) |
840
|
30 |
32 |
if (ANYOF_FLAGS(a->rn) & ANYOF_SHARED_d_UPPER_LATIN1_UTF8_STRING_MATCHES_non_d_RUNTIME_USER_PROP) |
859
|
0 |
5116 |
if (a->rn->flags >= SIZEOF_ARRAY(posix_regclass_blocks)) |
866
|
0 |
5116 |
if (!mask) |
911
|
0 |
3918 |
if (!convert_class_narrow(a, map)) |
924
|
0 |
998 |
if (!convert_class_narrow(a, &mask)) |
938
|
0 |
609 |
if (offs <= 2) |
951
|
1478 |
1447 |
if (((p->type == EXACT) || (p->type == EXACTF) || (p->type == EXACTFU)) && |
|
1478 |
0 |
if (((p->type == EXACT) || (p->type == EXACTF) || (p->type == EXACTFU)) && |
|
24 |
1454 |
if (((p->type == EXACT) || (p->type == EXACTF) || (p->type == EXACTFU)) && |
|
1471 |
0 |
if (((p->type == EXACT) || (p->type == EXACTF) || (p->type == EXACTFU)) && |
956
|
488 |
966 |
else if (trivial_nodes[p->type] || |
|
425 |
63 |
else if (trivial_nodes[p->type] || |
957
|
394 |
31 |
(p->type == REG_ANY) || (p->type == SANY) || |
|
342 |
52 |
(p->type == REG_ANY) || (p->type == SANY) || |
958
|
308 |
34 |
(p->type == POSIXD) || (p->type == NPOSIXD) || |
|
240 |
68 |
(p->type == POSIXD) || (p->type == NPOSIXD) || |
959
|
237 |
3 |
(p->type == POSIXU) || (p->type == NPOSIXU) || |
|
158 |
79 |
(p->type == POSIXU) || (p->type == NPOSIXU) || |
960
|
9 |
149 |
(p->type == POSIXA) || (p->type == NPOSIXA)) |
964
|
101 |
48 |
else if ((p->type == ANYOF) || (p->type == ANYOFD)) |
|
95 |
6 |
else if ((p->type == ANYOF) || (p->type == ANYOFD)) |
970
|
0 |
143 |
if (unknown) |
987
|
2 |
4 |
else if ((p->type == IFMATCH) || (p->type == UNLESSM) || |
|
0 |
2 |
else if ((p->type == IFMATCH) || (p->type == UNLESSM) || |
|
0 |
0 |
else if ((p->type == IFMATCH) || (p->type == UNLESSM) || |
1003
|
3999 |
2817 |
while (e->type != END) |
1005
|
3897 |
102 |
offs = GET_OFFSET(e); |
1006
|
0 |
3999 |
if (offs <= 0) |
1033
|
16990 |
0 |
if (pt->engine && (pt->engine != &PL_core_reg_engine)) |
|
0 |
16990 |
if (pt->engine && (pt->engine != &PL_core_reg_engine)) |
1041
|
0 |
16990 |
if (!pr) |
1048
|
0 |
16990 |
if (!p) |
1054
|
16990 |
0 |
if (!((p->flags == REG_MAGIC) && |
|
0 |
16990 |
if (!((p->flags == REG_MAGIC) && |
1087
|
204 |
0 |
if (('0' <= d) && (d <= '9')) |
|
143 |
61 |
if (('0' <= d) && (d <= '9')) |
1118
|
106618 |
17004 |
for (i = 0; i < prelen; ++i) |
1122
|
1214 |
105404 |
if (c == '.') |
1130
|
95474 |
11144 |
if (!quoted) |
1134
|
11144 |
84330 |
if (c == '\\') |
1143
|
423 |
10721 |
if (c == 'N') |
1146
|
24 |
399 |
if ((i + 8 < prelen) && |
|
11 |
13 |
if ((i + 8 < prelen) && |
1147
|
11 |
0 |
!memcmp(precomp + i + 1, "{U+00", 5) && |
1148
|
11 |
0 |
isxdigit(precomp[i + 6]) && isxdigit(precomp[i + 7]) && |
|
11 |
0 |
isxdigit(precomp[i + 6]) && isxdigit(precomp[i + 7]) && |
1152
|
5 |
6 |
if ((x != '\r') && (x != '\n')) |
|
0 |
5 |
if ((x != '\r') && (x != '\n')) |
1159
|
211 |
201 |
else if ((i + 1 < prelen) && |
|
13 |
198 |
else if ((i + 1 < prelen) && |
1170
|
107 |
10614 |
else if (c == 'x') |
1173
|
91 |
0 |
isxdigit(precomp[i + 1]) && isxdigit(precomp[i + 2])) |
1176
|
85 |
6 |
if ((x != '\r') && (x != '\n')) |
|
85 |
0 |
if ((x != '\r') && (x != '\n')) |
1189
|
10630 |
514 |
if (!matched) |
1192
|
314 |
10316 |
if (forced_byte[bf.offs] & bf.mask) |
1210
|
0 |
871 |
if (!alt) |
1230
|
0 |
350 |
if (!alt) |
1237
|
350 |
0 |
if ((last >= REGNODE_MAX) || !trivial_nodes[last]) |
|
0 |
350 |
if ((last >= REGNODE_MAX) || !trivial_nodes[last]) |
1253
|
13789 |
1466 |
offs = GET_OFFSET(a->rn); |
1254
|
0 |
15255 |
if (offs <= 0) |
1259
|
10024 |
5231 |
if (++(a->spent) >= a->rn->flags) |
1277
|
15687 |
1347 |
offs = GET_OFFSET(a->rn); |
1278
|
0 |
17034 |
if (offs <= 0) |
1289
|
73 |
30464 |
if (a->rn->type == END) |
1293
|
16420 |
14044 |
else if ((a->rn->type == EXACT) || (a->rn->type == EXACTF) || (a->rn->type == EXACTFU)) |
|
16239 |
181 |
else if ((a->rn->type == EXACT) || (a->rn->type == EXACTF) || (a->rn->type == EXACTFU)) |
|
1030 |
15209 |
else if ((a->rn->type == EXACT) || (a->rn->type == EXACTF) || (a->rn->type == EXACTFU)) |
1310
|
92 |
0 |
offs = GET_OFFSET(p); |
1311
|
0 |
92 |
if (offs <= 0) |
1317
|
32 |
92 |
while (trivial_nodes[q->type]) |
1319
|
22 |
10 |
offs = GET_OFFSET(q); |
1320
|
0 |
32 |
if (offs <= 0) |
1335
|
0 |
17011 |
if (!rs) |
1341
|
0 |
17006 |
if (!rx) |
1351
|
17006 |
0 |
if (rx) |
1363
|
657 |
5253 |
if (anchored) |
1370
|
73 |
5180 |
if (rv <= 0) |
1387
|
0 |
12159 |
if (rv <= 0) |
1394
|
0 |
12159 |
if (rv <= 0) |
1400
|
0 |
12159 |
if (rv < 0) |
1405
|
251 |
11908 |
if (!rv) |
1425
|
0 |
792 |
if (rv <= 0) |
1441
|
0 |
253 |
if (offs < 0) |
1464
|
0 |
75 |
if (sz1 < 0) |
1470
|
0 |
75 |
if (sz2 < 0) |
1476
|
0 |
75 |
if (!alt1) |
1482
|
0 |
75 |
if (!alt2) |
1499
|
1 |
74 |
if (rv <= 0) |
1524
|
0 |
72 |
if (sz1 < 0) |
1530
|
0 |
72 |
if (sz2 < 0) |
1536
|
0 |
72 |
if (!alt1) |
1542
|
0 |
72 |
if (!alt2) |
1559
|
2 |
70 |
if (rv <= 0) |
1584
|
0 |
28 |
if (sz1 < 0) |
1590
|
0 |
28 |
if (sz2 < 0) |
1596
|
0 |
28 |
if (!alt1) |
1602
|
0 |
28 |
if (!alt2) |
1619
|
1 |
27 |
if (rv <= 0) |
1638
|
8 |
611 |
if (anchored) |
1643
|
0 |
611 |
if (bump_regular(a1) <= 0) |
1649
|
61 |
550 |
if (!rv) |
1666
|
234 |
26738 |
if (p->flags & ANYOF_INVERT) |
1686
|
15356 |
459 |
for (i = 0; i < ANYOF_BITMAP_SIZE; ++i) |
1688
|
3687 |
11669 |
loc1 = b1 ? b1[i] : get_bitmap_byte(a1->rn, i); |
1689
|
5204 |
10152 |
loc2 = b2 ? b2[i] : get_bitmap_byte(a2->rn, i); |
1690
|
94 |
15262 |
if (loc1 & ~loc2) |
1713
|
0 |
3 |
if (a1->rn->flags & ANYOF_MATCHES_ALL_ABOVE_BITMAP) |
1719
|
6 |
0 |
for (i = 0; i < ANYOF_BITMAP_SIZE; ++i) |
1721
|
3 |
3 |
req = (i != bf.offs) ? 0 : bf.mask; |
1722
|
3 |
3 |
if (get_bitmap_byte(a1->rn, i) != req) |
1729
|
0 |
0 |
if (bump_regular(&tail1) <= 0) |
1735
|
0 |
0 |
if (bump_regular(&tail2) <= 0) |
1797
|
121 |
90 |
if ((extra_left || (a1->rn->flags & ANYOF_MATCHES_ALL_ABOVE_BITMAP)) && |
|
22 |
99 |
if ((extra_left || (a1->rn->flags & ANYOF_MATCHES_ALL_ABOVE_BITMAP)) && |
|
90 |
22 |
if ((extra_left || (a1->rn->flags & ANYOF_MATCHES_ALL_ABOVE_BITMAP)) && |
1808
|
90 |
0 |
if ((a1->rn->flags & ANYOF_SHARED_d_UPPER_LATIN1_UTF8_STRING_MATCHES_non_d_RUNTIME_USER_PROP) && |
|
87 |
3 |
if ((a1->rn->flags & ANYOF_SHARED_d_UPPER_LATIN1_UTF8_STRING_MATCHES_non_d_RUNTIME_USER_PROP) && |
1813
|
87 |
0 |
if (invlist1 && invlist2) |
|
87 |
0 |
if (invlist1 && invlist2) |
1817
|
87 |
0 |
if (ill1 && (ill1 == ill2)) |
|
87 |
0 |
if (ill1 && (ill1 == ill2)) |
1821
|
87 |
0 |
if (!memcmp(ila1, ila2, ill1 * sizeof(UV))) |
1830
|
0 |
3 |
if (cr1 == -1) |
1836
|
0 |
3 |
if (cr2 == -1) |
1843
|
0 |
3 |
if (m2 & NOT_ALNUM_BLOCK) |
1849
|
3 |
0 |
if (!cr1 || !cr2 || (m1 & ~m2)) |
|
3 |
0 |
if (!cr1 || !cr2 || (m1 & ~m2)) |
|
3 |
0 |
if (!cr1 || !cr2 || (m1 & ~m2)) |
1931
|
0 |
0 |
for (i = 0; i < left->expl_size; ++i) |
1934
|
0 |
0 |
if (!(get_bitmap_byte(a2->rn, bf.offs) & bf.mask)) |
1947
|
32 |
2 |
for (i = 0; i < 16; ++i) |
1949
|
0 |
32 |
if (!(get_bitmap_byte(a2->rn, i) & 0xff)) |
1967
|
1276 |
0 |
if (!cr1 || !cr2 || (m1 & ~m2)) |
|
1276 |
0 |
if (!cr1 || !cr2 || (m1 & ~m2)) |
|
231 |
1045 |
if (!cr1 || !cr2 || (m1 & ~m2)) |
1984
|
683 |
0 |
if (!cr1 || !cr2) |
|
0 |
683 |
if (!cr1 || !cr2) |
1991
|
76 |
607 |
if ((m1 & VERTICAL_SPACE_BLOCK) && !(m2 & VERTICAL_SPACE_BLOCK)) |
|
72 |
4 |
if ((m1 & VERTICAL_SPACE_BLOCK) && !(m2 & VERTICAL_SPACE_BLOCK)) |
1996
|
189 |
494 |
if (m1 & m2) |
2018
|
499 |
0 |
if (!cr2 || !cr2 || (m1 & ~m2)) |
|
499 |
0 |
if (!cr2 || !cr2 || (m1 & ~m2)) |
|
128 |
371 |
if (!cr2 || !cr2 || (m1 & ~m2)) |
2037
|
55 |
753 |
if (!_generic_isCC_A(*seq, a2->rn->flags)) |
2057
|
75 |
36 |
for (i = 0; i < 2; ++i) |
2059
|
3 |
72 |
if (!_generic_isCC_A(unf[i], a2->rn->flags)) |
2078
|
21 |
738 |
if (_generic_isCC_A(*seq, a2->rn->flags)) |
2099
|
121 |
60 |
for (i = 0; i < 2; ++i) |
2101
|
1 |
120 |
if (_generic_isCC_A(unf[i], a2->rn->flags)) |
2129
|
0 |
130 |
if (!convert_class_narrow(a1, &left_block)) |
2136
|
39 |
91 |
if (!(a2->rn->flags & ANYOF_MATCHES_ALL_ABOVE_BITMAP)) |
2141
|
1 |
38 |
if (a2->rn->flags & ANYOF_INVERT) |
2147
|
0 |
38 |
if (cr == -1) |
2152
|
38 |
0 |
if (!cr || !(right_map & left_block)) |
|
32 |
6 |
if (!cr || !(right_map & left_block)) |
2160
|
0 |
97 |
if (a1->rn->flags >= SIZEOF_ARRAY(posix_regclass_bitmaps)) |
2166
|
0 |
97 |
if (!b) |
2185
|
0 |
70 |
if (!convert_class_narrow(a1, &left_block)) |
2194
|
19 |
51 |
if (!(a2->rn->flags & ANYOF_MATCHES_ALL_ABOVE_BITMAP)) |
2199
|
1 |
18 |
if (a2->rn->flags & ANYOF_INVERT) |
2205
|
0 |
18 |
if (cr == -1) |
2212
|
18 |
0 |
if (!cr || !(right_map & left_block)) |
|
7 |
11 |
if (!cr || !(right_map & left_block)) |
2218
|
0 |
62 |
if (a1->rn->flags >= SIZEOF_ARRAY(posix_regclass_bitmaps)) |
2224
|
0 |
62 |
if (!b) |
2245
|
36 |
573 |
if (!(get_bitmap_byte(a2->rn, bf.offs) & bf.mask)) |
2268
|
62 |
30 |
for (i = 0; i < 2; ++i) |
2271
|
1 |
61 |
if (!(get_bitmap_byte(a2->rn, bf.offs) & bf.mask)) |
2351
|
30 |
574 |
if (!lookup[(unsigned char)(*seq)]) |
2379
|
2 |
6 |
if (a2->rn->flags & ANYOF_MATCHES_ALL_ABOVE_BITMAP) |
2429
|
0 |
54 |
if (a2->rn->flags >= SIZEOF_ARRAY(posix_regclass_bitmaps)) |
2436
|
0 |
54 |
if (!b) |
2480
|
1 |
6 |
if (ANYOF_FLAGS(a1->rn) & ANYOF_SHARED_d_UPPER_LATIN1_UTF8_STRING_MATCHES_non_d_RUNTIME_USER_PROP) |
2485
|
0 |
6 |
if (a2->rn->flags >= SIZEOF_ARRAY(posix_regclass_bitmaps)) |
2492
|
0 |
6 |
if (!b) |
2511
|
0 |
50 |
if (a2->rn->flags >= SIZEOF_ARRAY(posix_regclass_nbitmaps)) |
2518
|
0 |
50 |
if (!b) |
2568
|
0 |
248 |
if (flags >= SIZEOF_ARRAY(newline_posix_regclasses)) |
2575
|
54 |
194 |
if (newline_posix_regclasses[flags]) |
2590
|
0 |
125 |
if (flags >= SIZEOF_ARRAY(newline_posix_regclasses)) |
2596
|
82 |
43 |
if (!newline_posix_regclasses[flags]) |
2614
|
0 |
5 |
if (a1->rn->flags & ANYOF_MATCHES_ALL_ABOVE_BITMAP) |
2622
|
41 |
0 |
for (i = 0; i < ANYOF_BITMAP_SIZE; ++i) |
2624
|
5 |
36 |
req = (i != bf.offs) ? 0 : bf.mask; |
2625
|
5 |
36 |
if (get_bitmap_byte(a1->rn, i) != req) |
2678
|
0 |
15 |
if (a1->rn->flags & ANYOF_MATCHES_ALL_ABOVE_BITMAP) |
2686
|
30 |
15 |
for (i = 0; i < 2; ++i) |
2691
|
0 |
15 |
if (bf[0].offs == bf[1].offs) |
2697
|
30 |
15 |
for (i = 0; i < 2; ++i) |
2752
|
2531 |
4074 |
if (*q1 != *q2) |
2772
|
10 |
78 |
if ((*q1 != unf[0]) && (*q1 != unf[1])) |
|
6 |
4 |
if ((*q1 != unf[0]) && (*q1 != unf[1])) |
2792
|
22 |
5 |
if ((unf[0] != *q2) || (unf[1] != *q2)) |
|
21 |
1 |
if ((unf[0] != *q2) || (unf[1] != *q2)) |
2811
|
460 |
10 |
l1 = TOLOWER(*q1); |
|
5 |
455 |
l1 = TOLOWER(*q1); |
2812
|
460 |
10 |
l2 = TOLOWER(*q2); |
|
12 |
448 |
l2 = TOLOWER(*q2); |
2814
|
49 |
421 |
if (l1 != l2) |
2836
|
1231 |
567 |
while (p1->type == BRANCH) |
2838
|
0 |
1231 |
if (p1->next_off == 0) |
2853
|
0 |
1231 |
if (rv < 0) |
2858
|
37 |
1194 |
if (!rv) |
2871
|
0 |
567 |
if (tsz <= 0) |
2889
|
17 |
0 |
offs = GET_OFFSET(a1->rn); |
2890
|
0 |
17 |
if (offs <= 0) |
2897
|
0 |
17 |
if (sz < 0) |
2903
|
0 |
17 |
if (!alt) |
2918
|
525 |
16 |
for (i = 0; i < ANYOF_BITMAP_SIZE; ++i) |
2921
|
4196 |
524 |
for (j = 0; j < 8; ++j) |
2923
|
0 |
4196 |
loc = b1 ? b1[i] : get_bitmap_byte(a1->rn, i); |
2924
|
210 |
3986 |
if (loc & power) |
2934
|
0 |
210 |
if (rv < 0) |
2940
|
1 |
209 |
if (!rv) |
2953
|
0 |
16 |
if (!right.rn) |
3009
|
3139 |
558 |
while ((p2->type == BRANCH) && !rv) |
|
2285 |
854 |
while ((p2->type == BRANCH) && !rv) |
3016
|
0 |
2285 |
if (p2->next_off == 0) |
3031
|
0 |
1412 |
if (rv < 0) |
3036
|
132 |
1280 |
if (!rv) |
3062
|
0 |
399 |
if (sz < 0) |
3071
|
399 |
0 |
offs = GET_OFFSET(p2); |
3072
|
0 |
399 |
if (offs <= 0) |
3082
|
0 |
399 |
if (rv < 0) |
3087
|
9 |
390 |
if (rv == 0) |
3093
|
0 |
9 |
if (rv < 0) |
3098
|
4 |
5 |
if (!rv) |
3106
|
0 |
5 |
if (!anchored) |
3112
|
0 |
395 |
if (rv <= 0) |
3144
|
118 |
13 |
if (rv) |
3149
|
13 |
0 |
offs = GET_OFFSET(p1); |
3151
|
0 |
13 |
if (offs <= 0) |
3185
|
139 |
16 |
if (rv) |
3190
|
16 |
0 |
offs = GET_OFFSET(p2); |
3192
|
0 |
16 |
if (offs <= 0) |
3213
|
0 |
301 |
if (n <= 0) |
3220
|
0 |
301 |
if (sz < 0) |
3229
|
301 |
0 |
offs = GET_OFFSET(p2); |
3230
|
0 |
301 |
if (offs <= 0) |
3240
|
0 |
301 |
if (rv < 0) |
3245
|
4 |
297 |
if (rv == 0) |
3248
|
0 |
4 |
if (!alt) |
3257
|
0 |
4 |
if (rv < 0) |
3263
|
2 |
2 |
if (!rv) |
3270
|
2 |
0 |
if (cnt[1] < INFINITE_COUNT) |
3275
|
1 |
1 |
if ((cnt[1] > 0) && !anchored) |
|
0 |
1 |
if ((cnt[1] > 0) && !anchored) |
3290
|
0 |
299 |
if (rv <= 0) |
3313
|
0 |
489 |
if (sz < 0) |
3318
|
0 |
489 |
if (sz < 2) |
3325
|
0 |
489 |
if (!alt) |
3330
|
14 |
475 |
if (anchored) |
3333
|
0 |
14 |
if (offs <= 0) |
3339
|
6 |
8 |
if (q->type != END) |
3360
|
4 |
2 |
if (rv <= 0) |
3390
|
0 |
267 |
if (sz < 0) |
3395
|
0 |
267 |
if (sz < 2) |
3409
|
0 |
267 |
if (rv < 0) |
3414
|
24 |
243 |
if (!rv) |
3428
|
0 |
1214 |
if (bump_regular(a2) <= 0) |
3449
|
0 |
21 |
if (cnt[0] < 0) |
3455
|
0 |
21 |
if (!cnt[0]) |
3468
|
9 |
12 |
if (cnt[0] > 1) |
3497
|
11 |
19 |
if (!rv) |
3519
|
0 |
41 |
if (cnt[0] < 0) |
3525
|
2 |
39 |
if (cnt[0] > 1) /* FIXME: fails '(?:aa)+' => 'a{2,}' */ |
3534
|
35 |
4 |
if (cnt[1] != INFINITE_COUNT) |
3537
|
0 |
35 |
if (offs <= 0) |
3543
|
0 |
35 |
if (e2->type != END) |
3554
|
0 |
39 |
return (!rv && !cnt[0]) ? compare_next(anchored, a1, a2) : rv; |
|
0 |
0 |
return (!rv && !cnt[0]) ? compare_next(anchored, a1, a2) : rv; |
3570
|
150 |
219 |
if (altcnt[1] < INFINITE_COUNT) |
3591
|
8 |
614 |
if (!cnt[0]) |
3598
|
0 |
614 |
if (sz < 0) |
3603
|
0 |
614 |
if (sz < 3) |
3609
|
333 |
281 |
if (cnt[0] > 1) |
3613
|
333 |
0 |
offs = GET_OFFSET(p1); |
3614
|
0 |
333 |
if (offs < 0) |
3619
|
0 |
333 |
if (offs < 3) |
3626
|
0 |
333 |
if (!alt) |
3645
|
44 |
237 |
if (anchored && !((cnt[0] == 1) && (cnt[1] == 1))) |
|
44 |
0 |
if (anchored && !((cnt[0] == 1) && (cnt[1] == 1))) |
|
7 |
37 |
if (anchored && !((cnt[0] == 1) && (cnt[1] == 1))) |
3650
|
0 |
7 |
if (!alt) |
3656
|
0 |
7 |
if (offs <= 0) |
3662
|
0 |
7 |
if (q->type != END) |
3683
|
0 |
0 |
if (rv <= 0) |
3708
|
0 |
464 |
if (cnt[0] < 0) |
3718
|
163 |
301 |
if (cnt[0] > 0) |
3722
|
0 |
163 |
if (sz < 0) |
3727
|
0 |
163 |
if (sz < 3) |
3739
|
0 |
163 |
if (rv < 0) |
3744
|
23 |
140 |
if (!rv) |
3748
|
0 |
23 |
if (rv) |
3755
|
15 |
8 |
if (cnt[0] > 1) |
3757
|
15 |
0 |
offs = GET_OFFSET(p2); |
3758
|
0 |
15 |
if (offs < 0) |
3763
|
0 |
15 |
if (offs < 3) |
3770
|
0 |
15 |
if (!alt) |
3793
|
79 |
61 |
if (cnt[0] == 1) |
3798
|
40 |
21 |
if (a1->rn->type == END) |
3811
|
0 |
21 |
if (!alt) |
3818
|
21 |
0 |
if (altcnt[1] > 0) |
3833
|
2 |
19 |
if (rv <= 0) |
3865
|
0 |
329 |
if (cnt1[0] < 0) |
3873
|
0 |
329 |
if (cnt2[0] < 0) |
3879
|
5 |
324 |
if (cnt2[0] > cnt1[0]) /* FIXME: fails '(?:aa){1,}' => 'a{2,}' */ |
3889
|
36 |
288 |
if (cnt1[1] > cnt2[1]) |
3893
|
0 |
36 |
if (offs <= 0) |
3900
|
3 |
33 |
if (e2->type != END) |
3914
|
8 |
313 |
return (!rv && !cnt2[0]) ? compare_next(anchored, a1, a2) : rv; |
|
3 |
5 |
return (!rv && !cnt2[0]) ? compare_next(anchored, a1, a2) : rv; |
3931
|
0 |
117 |
if (bump_with_check(&left) <= 0) |
3937
|
0 |
117 |
if (t >= REGNODE_MAX) |
3942
|
1 |
116 |
else if (t == ANYOF) |
3946
|
0 |
1 |
if (left.rn->flags & ANYOF_MATCHES_ALL_ABOVE_BITMAP) |
3951
|
32 |
1 |
for (i = 0; i < ANYOF_BITMAP_SIZE; ++i) |
3953
|
0 |
32 |
if (get_bitmap_byte(left.rn, i) & ~bitmap[i]) |
3959
|
33 |
83 |
else if ((t == EXACT) || (t == EXACTF) || (t == EXACTFU)) |
|
33 |
0 |
else if ((t == EXACT) || (t == EXACTF) || (t == EXACTFU)) |
|
2 |
31 |
else if ((t == EXACT) || (t == EXACTF) || (t == EXACTFU)) |
3962
|
43 |
42 |
if (!lookup[(unsigned char)(*seq)]) |
3967
|
30 |
1 |
else if ((t == POSIXD) || (t == NPOSIXD) || (t == POSIXU) || (t == NPOSIXU)) |
|
30 |
0 |
else if ((t == POSIXD) || (t == NPOSIXD) || (t == POSIXU) || (t == NPOSIXU)) |
|
23 |
7 |
else if ((t == POSIXD) || (t == NPOSIXD) || (t == POSIXU) || (t == NPOSIXU)) |
|
0 |
23 |
else if ((t == POSIXD) || (t == NPOSIXD) || (t == POSIXU) || (t == NPOSIXU)) |
3970
|
8 |
0 |
if ((flags >= regclasses_size) || !regclasses[flags]) |
|
0 |
8 |
if ((flags >= regclasses_size) || !regclasses[flags]) |
3975
|
17 |
6 |
else if (!oktypes[t]) |
3981
|
0 |
57 |
if (bump_with_check(&right) <= 0) |
3986
|
9 |
48 |
return move_left ? compare(1, &left, &right) : |
4027
|
174 |
5 |
for (i = 0; (i < ANYOF_BITMAP_SIZE) && (cmp[0] || cmp[1]); ++i) |
|
125 |
49 |
for (i = 0; (i < ANYOF_BITMAP_SIZE) && (cmp[0] || cmp[1]); ++i) |
|
48 |
1 |
for (i = 0; (i < ANYOF_BITMAP_SIZE) && (cmp[0] || cmp[1]); ++i) |
4029
|
0 |
173 |
loc = bitmap1 ? bitmap1[i] : get_bitmap_byte(a1->rn, i); |
4031
|
13 |
160 |
if (loc & ~bitmap2[i]) |
4036
|
4 |
169 |
if (loc & bitmap2[i]) |
4042
|
3 |
3 |
if (cmp[0] && cmp[1]) |
|
0 |
3 |
if (cmp[0] && cmp[1]) |
4048
|
9 |
1 |
for (i = 0; i < SIZEOF_ARRAY(cmp); ++i) |
4050
|
5 |
4 |
if (cmp[i]) |
4067
|
0 |
4 |
if (a1->rn->flags & ANYOF_MATCHES_ALL_ABOVE_BITMAP) |
4080
|
0 |
2 |
if (a1->rn->flags & ANYOF_MATCHES_ALL_ABOVE_BITMAP) |
4132
|
62 |
1 |
compare_next_nword : compare_next_word; |
4148
|
14 |
2 |
compare_next_word : compare_next_nword; |
4159
|
10 |
0 |
if ((flags >= SIZEOF_ARRAY(word_posix_regclasses)) || |
|
10 |
0 |
if ((flags >= SIZEOF_ARRAY(word_posix_regclasses)) || |
4160
|
5 |
5 |
(flags >= SIZEOF_ARRAY(non_word_posix_regclasses)) || |
4161
|
0 |
5 |
(!word_posix_regclasses[flags] && !non_word_posix_regclasses[flags])) |
4169
|
5 |
5 |
compare_next_nword : compare_next_word; |
4180
|
9 |
0 |
if ((flags >= SIZEOF_ARRAY(word_posix_regclasses)) || |
|
9 |
0 |
if ((flags >= SIZEOF_ARRAY(word_posix_regclasses)) || |
4181
|
4 |
5 |
(flags >= SIZEOF_ARRAY(non_word_posix_regclasses)) || |
4182
|
0 |
4 |
(!word_posix_regclasses[flags] && !non_word_posix_regclasses[flags])) |
4190
|
5 |
4 |
compare_next_word : compare_next_nword; |
4202
|
3 |
2 |
if (a1->rn->flags != _CC_WORDCHAR) |
4218
|
7 |
2 |
if (a1->rn->flags != _CC_WORDCHAR) |
4260
|
7 |
8495 |
if ((get_forced_semantics(pt1) | get_forced_semantics(pt2)) == FORCED_MISMATCH) |
4266
|
0 |
8495 |
if (!p1) |
4272
|
0 |
8495 |
if (!p2) |
4318
|
35621 |
0 |
if ((a1->rn->type >= REGNODE_MAX) || (a2->rn->type >= REGNODE_MAX)) |
|
0 |
35621 |
if ((a1->rn->type >= REGNODE_MAX) || (a2->rn->type >= REGNODE_MAX)) |
4325
|
926 |
34695 |
if (!cmp) |
4351
|
10 |
1 |
for (i = 0; i < SIZEOF_ARRAY(digit_expl); ++i) |
4361
|
6 |
1 |
for (i = 0; i < 6; ++i) |
4367
|
6 |
1 |
for (i = 0; i < 6; ++i) |
4382
|
26 |
1 |
for (i = 0; i < LETTER_COUNT; ++i) |
4388
|
26 |
1 |
for (i = 0; i < LETTER_COUNT; ++i) |
4398
|
26 |
1 |
for (i = 0; i < LETTER_COUNT; ++i) |
4404
|
26 |
1 |
for (i = 0; i < LETTER_COUNT; ++i) |
4459
|
92 |
1 |
for (i = 0; i < REGNODE_MAX; ++i) |
4464
|
92 |
1 |
for (i = 0; i < REGNODE_MAX; ++i) |
5086
|
92 |
1 |
for (i = 0; i < REGNODE_MAX; ++i) |
5215
|
92 |
1 |
for (i = 0; i < REGNODE_MAX; ++i) |
5228
|
92 |
1 |
for (i = 0; i < REGNODE_MAX; ++i) |
5241
|
92 |
1 |
for (i = 0; i < REGNODE_MAX; ++i) |
5266
|
92 |
1 |
for (i = 0; i < REGNODE_MAX; ++i) |
5286
|
92 |
1 |
for (i = 0; i < REGNODE_MAX; ++i) |
5307
|
92 |
1 |
for (i = 0; i < REGNODE_MAX; ++i) |
5328
|
92 |
1 |
for (i = 0; i < REGNODE_MAX; ++i) |
5349
|
92 |
1 |
for (i = 0; i < REGNODE_MAX; ++i) |
5362
|
92 |
1 |
for (i = 0; i < REGNODE_MAX; ++i) |
5369
|
92 |
1 |
for (i = 0; i < REGNODE_MAX; ++i) |
5458
|
92 |
1 |
for (i = 0; i < REGNODE_MAX; ++i) |
5471
|
92 |
1 |
for (i = 0; i < REGNODE_MAX; ++i) |