| line |
true |
false |
branch |
|
37
|
15538 |
598 |
while (i + 32 <= len) { |
|
56
|
9350 |
598 |
for (; i < len; i++) { |
|
58
|
967 |
8383 |
if (MDS_CLASSIFIER_LO[b & 0xF] & MDS_CLASSIFIER_HI[b >> 4]) |
|
76
|
6883 |
84 |
while ((size_t)(end - p) >= 32) { |
|
80
|
6671 |
212 |
if (mask == 0) { p += 32; continue; } |
|
83
|
0 |
212 |
if (tail > end) tail = end; |
|
85
|
282 |
6 |
while (extend-- > 0 && tail < end && (*tail & 0xC0) == 0x80) tail++; |
|
|
282 |
0 |
while (extend-- > 0 && tail < end && (*tail & 0xC0) == 0x80) tail++; |
|
|
76 |
206 |
while (extend-- > 0 && tail < end && (*tail & 0xC0) == 0x80) tail++; |
|
86
|
199 |
13 |
if (!s_scalar()->validate_utf8((const char*)p, (size_t)(tail - p))) |
|
90
|
83 |
1 |
if (p < end) return s_scalar()->validate_utf8((const char*)p, (size_t)(end - p)); |
|
102
|
16286 |
2053 |
while ((size_t)(end - p) >= 32) { |
|
106
|
12619 |
3667 |
if (m) { |
|
110
|
0 |
41229 |
if (k >= cap) return (size_t)-1; |
|
113
|
28610 |
12619 |
} while (m); |
|
117
|
31950 |
2052 |
while (p < end) { |
|
118
|
3981 |
27969 |
if (*p == '\n') { |
|
119
|
1 |
3980 |
if (k >= cap) return (size_t)-1; |