Function scan_pattern_nodes

src/cypher/cypher.c:2808–2849

}

static void scan_pattern_nodes(cbm_store_t *store, const char *project, int max_rows,
                               cbm_node_pattern_t *first, cbm_node_t **out_nodes, int *out_count) {
    if (first->label && strchr(first->label, '|')) {
        scan_alternation_labels(store, project, first->label, out_nodes, out_count);
    } else if (first->label) {
        cbm_store_find_nodes_by_label(store, project, first->label, out_nodes, out_count);
    } else {
        cbm_search_params_t params = {.project = project,
                                      .min_degree = CYP_FOUND_NONE,
                                      .max_degree = CYP_FOUND_NONE,
                                      .limit = max_rows * CYP_GROWTH_10};
        cbm_search_output_t sout = {0};
        cbm_store_search(store, &params, &sout);
        *out_count = sout.count;
        *out_nodes = malloc(sout.count * sizeof(cbm_node_t));
        for (int i = 0; i < sout.count; i++) {
            (*out_nodes)[i] = sout.results[i].node;
            sout.results[i].node.name = NULL;
            sout.results[i].node.project = NULL;
            sout.results[i].node.label = NULL;
            sout.results[i].node.qualified_name = NULL;
            sout.results[i].node.file_path = NULL;
            sout.results[i].node.properties_json = NULL;
        }
        cbm_store_search_free(&sout);
    }
    /* Apply inline property filters — free rejected nodes' strings */
    if (first->prop_count > 0) {
        int kept = 0;
        for (int i = 0; i < *out_count; i++) {
            if (check_inline_props(&(*out_nodes)[i], first->props, first->prop_count, store)) {
                if (kept != i) {
                    (*out_nodes)[kept] = (*out_nodes)[i];
                }
                kept++;
            } else {
                node_fields_free(&(*out_nodes)[i]);
            }
        }
        *out_count = kept;
    }
}

/* ── Expand one pattern's relationships on a set of bindings ──── */