Function write_db_after_nodes

internal/cbm/sqlite_writer.c:2056–2266

Write everything after the nodes table: the edges/vectors/token_vectors data * tables, metadata tables, all indexes, and the sqlite_master page-1 + file * header. `nodes_root` is the root of the already-written nodes table. Closes * w->fp before returning (success or error). */

 * header. `nodes_root` is the root of the already-written nodes table. Closes
 * w->fp before returning (success or error). */
static int write_db_after_nodes(write_db_ctx_t *w, uint32_t nodes_root) {
    FILE *fp = w->fp;
    CBMDumpNode *nodes = w->nodes;
    int node_count = w->node_count;
    CBMDumpEdge *edges = w->edges;
    int edge_count = w->edge_count;

    // Phase 1 (cont.): remaining data tables (edge + vector + token_vector records)
    CBM_PROF_START(t_data);
    uint32_t edges_root;
    uint32_t vectors_root;
    uint32_t token_vecs_root;
    int rc =
        write_one_table(w, &edges_root, w->edges, w->edge_count, adapt_build_edge, adapt_edge_id);
    if (rc != 0) {
        return discard_writer_output(w, rc);
    }
    rc = write_one_table(w, &vectors_root, w->vectors, w->vector_count, adapt_build_vector,
                         adapt_vector_id);
    if (rc != 0) {
        return discard_writer_output(w, rc);
    }
    rc = write_one_table(w, &token_vecs_root, w->token_vecs, w->token_vec_count,
                         adapt_build_token_vec, adapt_token_vec_id);
    if (rc != 0) {
        return discard_writer_output(w, rc);
    }
    CBM_PROF_END_N("write_db", "1_data_tables", t_data, node_count + edge_count);

    // Phase 2: Metadata tables (projects, file_hashes, summaries, sqlite_sequence)
    CBM_PROF_START(t_meta);
    uint32_t projects_root;
    uint32_t file_hashes_root;
    uint32_t summaries_root;
    uint32_t sqlite_seq_root;
    write_metadata_tables(w, &projects_root, &file_hashes_root, &summaries_root, &sqlite_seq_root);
    uint32_t next_page = w->next_page;
    CBM_PROF_END("write_db", "2_metadata_tables", t_meta);

    // --- Build indexes (all sorted by key columns before writing) ---

    // Set sort contexts for qsort comparators.
    g_sort_nodes = nodes;
    g_sort_edges = edges;

    // Parallel sort: all 11 index permutations sorted simultaneously.
    // Sorting is O(N log N) per index — the dominant CPU cost in index building.
    // Cell building + B-tree writing remains serial (sequential page allocation).
    SortJob nsorts[] = {
        {node_count, cmp_node_by_label, NULL},
        {node_count, cmp_node_by_name, NULL},
        {node_count, cmp_node_by_file, NULL},
        {node_count, cmp_node_by_qn, NULL},
    };
    SortJob esorts[] = {
        {edge_count, cmp_edge_by_source_type, NULL},
        {edge_count, cmp_edge_by_target_type, NULL},
        {edge_count, cmp_edge_by_type, NULL},