Function cbm_is_module_level_p

internal/cbm/helpers.c:1110–1141

Variant that takes the node's parent DIRECTLY. The callers in * extract_defs.c iterate a known parent's children, so they already * have the parent — passing it here avoids ts_node_parent(node), which * is O(n) per call (tree-sitter nodes carry no parent pointer; the * parent is found by rescanning from the root). On a pathologically * large file (e.g. a 583k-line generated/fixture file with

 * thousands of top-level statements) the old per-child ts_node_parent
 * made extraction O(n²) and effectively hung. */
bool cbm_is_module_level_p(TSNode parent, CBMLanguage lang) {
    if (ts_node_is_null(parent)) {
        return false;
    }
    const char *pk = ts_node_type(parent);

    // Languages with wrapper-pattern (expression_statement/export_statement/assignment_statement)
    if (lang == CBM_LANG_PYTHON) {
        return check_script_module_level(parent, pk, "module", "expression_statement");
    }
    if (lang == CBM_LANG_JAVASCRIPT || lang == CBM_LANG_TYPESCRIPT || lang == CBM_LANG_TSX) {
        return check_script_module_level(parent, pk, "program", "export_statement");
    }
    if (lang == CBM_LANG_LUA) {
        return check_script_module_level(parent, pk, "chunk", "assignment_statement");
    }
    if (lang == CBM_LANG_YAML) {
        return strcmp(pk, "document") == 0 || strcmp(pk, "stream") == 0 ||
               strcmp(pk, "block_mapping") == 0;
    }

    // Table lookup for the rest
    const char **parents = get_module_parents(lang);
    if (parents) {
        for (const char **p = parents; *p; p++) {
            if (strcmp(pk, *p) == 0) {
                return true;
            }
        }
    }
    return false;
}

/* Back-compat wrapper: computes the parent via ts_node_parent (O(n)).
 * Prefer cbm_is_module_level_p at call sites that already know the