| 287 | /* ── Allocator functions (installed as tree-sitter callbacks) ───── */ |
| 288 | |
| 289 | static void *slab_malloc(size_t size) { |
| 290 | if (size == 0) { |
| 291 | size = SKIP_ONE; |
| 292 | } |
| 293 | /* Tier 1: ≤64B → slab free list */ |
| 294 | if (size <= SLAB_CHUNK_SIZE) { |
| 295 | slab_state_t *s = &tls_slab; |
| 296 | if (!s->freelist) { |
| 297 | slab_refill(s); |
| 298 | if (!s->freelist) { |
| 299 | return cbm_alloc(CBM_MEM_CLASS_TS_TREE, size); /* grow failed → heap fallback */ |
| 300 | } |
| 301 | } |
| 302 | slab_free_node_t *node = s->freelist; |
| 303 | s->freelist = node->next; |
| 304 | slab_page_t *page = (slab_page_t *)((uintptr_t)node & SLAB_PAGE_MASK); |
| 305 | atomic_fetch_add_explicit(&page->refcount, 1u, memory_order_relaxed); |
| 306 | return node; |
| 307 | } |
| 308 | |
| 309 | /* >64B: straight to the core (= mimalloc in production) */ |
| 310 | return cbm_alloc(CBM_MEM_CLASS_TS_TREE, size); |
| 311 | } |
| 312 | |
| 313 | static void *slab_calloc(size_t count, size_t size) { |
| 314 | /* Overflow check */ |
no test coverage detected