| 189 | } |
| 190 | |
| 191 | static bool adr_split_lines(CBMArena *a, const char *src, int len, adr_lines_t *out) { |
| 192 | int count = 0; |
| 193 | for (int i = 0; i < len; i++) { |
| 194 | count += src[i] == '\n'; |
| 195 | } |
| 196 | count++; |
| 197 | out->v = (adr_line_t *)cbm_arena_alloc(a, (size_t)count * sizeof(*out->v)); |
| 198 | if (!out->v) { |
| 199 | return false; |
| 200 | } |
| 201 | out->count = 0; |
| 202 | out->fm_end = 0; |
| 203 | int pos = 0; |
| 204 | if (len >= ADR_BOM_LEN && memcmp(src, "\xEF\xBB\xBF", ADR_BOM_LEN) == 0) { |
| 205 | pos = ADR_BOM_LEN; /* a byte-order mark is no part of the first line */ |
| 206 | } |
| 207 | while (pos <= len && out->count < count) { |
| 208 | const char *nl = pos < len ? memchr(src + pos, '\n', (size_t)(len - pos)) : NULL; |
| 209 | int end = nl ? (int)(nl - src) : len; |
| 210 | int n = end - pos; |
| 211 | if (n > 0 && src[pos + n - SKIP_ONE] == '\r') { |
| 212 | n--; |
| 213 | } |
| 214 | out->v[out->count++] = (adr_line_t){.s = src + pos, .n = n, .text = true}; |
| 215 | pos = end + SKIP_ONE; |
| 216 | } |
| 217 | /* front matter */ |
| 218 | if (out->count > 0 && adr_trim_eq(out->v[0].s, out->v[0].n, "---")) { |
| 219 | for (int k = 1; k < out->count && k < ADR_FM_SCAN; k++) { |
| 220 | if (adr_trim_eq(out->v[k].s, out->v[k].n, "---") || |
| 221 | adr_trim_eq(out->v[k].s, out->v[k].n, "...")) { |
| 222 | out->fm_end = k + SKIP_ONE; |
| 223 | break; |
| 224 | } |
| 225 | } |
| 226 | } |
| 227 | for (int k = 0; k < out->fm_end; k++) { |
| 228 | out->v[k].text = false; |
| 229 | } |
| 230 | /* fences and HTML comments */ |
| 231 | char fence = 0; |
| 232 | int fence_len = 0; |
| 233 | bool comment = false; |
| 234 | for (int k = out->fm_end; k < out->count; k++) { |
| 235 | adr_line_t *l = &out->v[k]; |
| 236 | int i = 0; |
| 237 | while (i < l->n && adr_blank(l->s[i])) { |
| 238 | i++; |
| 239 | } |
| 240 | int run = 0; |
| 241 | while (i + run < l->n && (l->s[i + run] == '`' || l->s[i + run] == '~') && |
| 242 | l->s[i + run] == l->s[i]) { |
| 243 | run++; |
| 244 | } |
| 245 | if (fence) { |
| 246 | l->text = false; |
| 247 | if (run >= fence_len && l->s[i] == fence) { |
| 248 | fence = 0; |
no test coverage detected