| 978 | } |
| 979 | |
| 980 | static void gb_span_push(gb_span_vec_t *vec, gb_span_t span) { |
| 981 | if (vec->count == vec->cap) { |
| 982 | enum { GB_SPANS_MIN = 4 }; |
| 983 | size_t cap = vec->cap ? vec->cap * PAIR_LEN : GB_SPANS_MIN; |
| 984 | gb_span_t *grown = cbm_realloc(CBM_MEM_CLASS_GBUF_INDEX, vec->items, cap * sizeof(*grown)); |
| 985 | if (!grown) { |
| 986 | return; /* a lost span costs precision, never data */ |
| 987 | } |
| 988 | vec->items = grown; |
| 989 | vec->cap = cap; |
| 990 | } |
| 991 | vec->items[vec->count++] = span; |
| 992 | } |
| 993 | |
| 994 | /* Append a side's spans: its `variants` list, else its own span when it is a |
| 995 | * definition. File paths are interned, so the spans outlive the props. */ |
no test coverage detected