| line |
true |
false |
branch |
|
33
|
0 |
0 |
while (i + 16 <= len) { |
|
51
|
0 |
0 |
for (; i < len; i++) { |
|
53
|
0 |
0 |
if (MDS_CLASSIFIER_LO[b & 0xF] & MDS_CLASSIFIER_HI[b >> 4]) |
|
66
|
0 |
0 |
while ((size_t)(end - p) >= 16) { |
|
69
|
0 |
0 |
if (mask == 0) { p += 16; continue; } |
|
72
|
0 |
0 |
if (tail > end) tail = end; |
|
74
|
0 |
0 |
while (extend-- > 0 && tail < end && (*tail & 0xC0) == 0x80) tail++; |
|
|
0 |
0 |
while (extend-- > 0 && tail < end && (*tail & 0xC0) == 0x80) tail++; |
|
|
0 |
0 |
while (extend-- > 0 && tail < end && (*tail & 0xC0) == 0x80) tail++; |
|
75
|
0 |
0 |
if (!s_scalar()->validate_utf8((const char*)p, (size_t)(tail - p))) |
|
79
|
0 |
0 |
if (p < end) return s_scalar()->validate_utf8((const char*)p, (size_t)(end - p)); |
|
91
|
0 |
0 |
while ((size_t)(end - p) >= 16) { |
|
95
|
0 |
0 |
if (m) { |
|
99
|
0 |
0 |
if (k >= cap) return (size_t)-1; |
|
102
|
0 |
0 |
} while (m); |
|
106
|
0 |
0 |
while (p < end) { |
|
107
|
0 |
0 |
if (*p == '\n') { |
|
108
|
0 |
0 |
if (k >= cap) return (size_t)-1; |