Function arch_clusters

src/store/store.c:5317–5481

}

static int arch_clusters(cbm_store_t *s, const char *project, const char *path,
                         cbm_architecture_info_t *out) {
    char norm[CBM_SZ_512];
    char like[CBM_SZ_512];
    bool scoped = arch_path_prepare(path, norm, sizeof(norm), like, sizeof(like));
    char nsqlbuf[ST_SQL_BUF];
    const char *nbase = "SELECT id, name, qualified_name, file_path FROM nodes "
                        "WHERE project=?1 AND label IN ('Function','Method','Class')";
    if (scoped) {
        snprintf(nsqlbuf, sizeof(nsqlbuf), "%s%s ORDER BY id LIMIT ?4", nbase,
                 arch_path_scope_sql());
    } else {
        snprintf(nsqlbuf, sizeof(nsqlbuf), "%s ORDER BY id LIMIT ?2", nbase);
    }
    sqlite3_stmt *st = NULL;
    if (sqlite3_prepare_v2(s->db, nsqlbuf, CBM_NOT_FOUND, &st, NULL) != SQLITE_OK) {
        return CBM_STORE_OK; /* clusters are best-effort */
    }
    bind_text(st, SKIP_ONE, project);
    if (scoped) {
        arch_bind_path_scope(st, ST_COL_2, ST_COL_3, norm, like);
        sqlite3_bind_int(st, ST_COL_4, CBM_CLUSTER_NODE_CAP);
    } else {
        sqlite3_bind_int(st, CBM_SZ_2, CBM_CLUSTER_NODE_CAP);
    }
    int cap = ST_INIT_CAP_8;
    int n = 0;
    int64_t *ids = malloc((size_t)cap * sizeof(int64_t));
    const char **names = malloc((size_t)cap * sizeof(char *));
    const char **qns = malloc((size_t)cap * sizeof(char *));
    while (sqlite3_step(st) == SQLITE_ROW) {
        if (n >= cap) {
            cap *= ST_GROWTH;
            ids = safe_realloc(ids, (size_t)cap * sizeof(int64_t));
            names = safe_realloc(names, (size_t)cap * sizeof(char *));
            qns = safe_realloc(qns, (size_t)cap * sizeof(char *));
        }
        ids[n] = sqlite3_column_int64(st, 0);
        names[n] = heap_strdup((const char *)sqlite3_column_text(st, SKIP_ONE));
        qns[n] = heap_strdup((const char *)sqlite3_column_text(st, CBM_SZ_2));
        n++;
    }
    sqlite3_finalize(st);
    if (n < CBM_CLUSTER_MIN_MEMBERS) {
        for (int i = 0; i < n; i++) {
            safe_str_free(&names[i]);
            safe_str_free(&qns[i]);
        }
        free(ids);
        free(names);
        free(qns);
        return CBM_STORE_OK;
    }

    /* 2. Load CALLS edges with both endpoints in the node set (store indices). */
    cbm_louvain_edge_t *edges = malloc((size_t)n * sizeof(cbm_louvain_edge_t));
    int *esrc = malloc((size_t)n * sizeof(int));
    int *edst = malloc((size_t)n * sizeof(int));