Function wd_push

internal/cbm/extract_defs.c:5665–5692

}

static void wd_push(wd_stack_t *s, TSNode node, const char *enclosing_qn) {
    if (s->top >= s->cap) {
        int ncap = s->cap ? s->cap * 2 : 256;
        if (ncap > wd_stack_max()) {
            if (!s->warned) {
                char lim[24];
                snprintf(lim, sizeof(lim), "%d", wd_stack_max());
                cbm_log_warn("extract.walk_defs_capped", "limit", lim, "path",
                             s->path ? s->path : "");
                s->warned = true;
            }
            return; // bounded: stop growing (warned, not silent)
        }
        walk_defs_frame_t *nd = safe_realloc(s->data, (size_t)ncap * sizeof(walk_defs_frame_t));
        if (!nd) {
            /* OOM — safe_realloc already freed the old buffer. Bail cleanly: drop
             * pending frames so the walk_defs loop drains and exits without a NULL
             * deref; extraction keeps whatever was already emitted. */
            s->data = NULL;
            s->cap = 0;
            s->top = 0;
            return;
        }
        s->data = nd;
        s->cap = ncap;
    }
    s->data[s->top++] = (walk_defs_frame_t){node, enclosing_qn};
}

/* Push all children of `node` in REVERSE order (so they pop in source order)
 * using a LINEAR traversal. Index-based ts_node_child(i) is O(i) per call in