Build all 4 node index B-trees. Returns 0 on success, ERR_SORT_FAILED on failure. */
| 1988 | |
| 1989 | /* Build all 4 node index B-trees. Returns 0 on success, ERR_SORT_FAILED on failure. */ |
| 1990 | static int build_node_indexes(FILE *fp, uint32_t *next_page, CBMDumpNode *nodes, int node_count, |
| 1991 | SortJob *nsorts, uint32_t *label_root, uint32_t *name_root, |
| 1992 | uint32_t *file_root, uint32_t *qn_root) { |
| 1993 | *label_root = |
| 1994 | build_node_index_sorted(fp, next_page, nodes, node_count, nsorts[0].perm, ncol_label); |
| 1995 | *name_root = build_node_index_sorted(fp, next_page, nodes, node_count, nsorts[NSORT_NAME].perm, |
| 1996 | ncol_name); |
| 1997 | *file_root = build_node_index_sorted(fp, next_page, nodes, node_count, nsorts[NSORT_FILE].perm, |
| 1998 | ncol_file); |
| 1999 | *qn_root = |
| 2000 | build_node_index_sorted(fp, next_page, nodes, node_count, nsorts[NSORT_QN].perm, ncol_qn); |
| 2001 | if (node_count > 0 && (!*label_root || !*name_root || !*file_root || !*qn_root)) { |
| 2002 | return ERR_SORT_FAILED; |
| 2003 | } |
| 2004 | return 0; |
| 2005 | } |
| 2006 | |
| 2007 | /* Build all 7 edge index B-trees. Returns 0 on success, ERR_SORT_FAILED on failure. */ |
| 2008 | static int build_edge_indexes(FILE *fp, uint32_t *next_page, CBMDumpEdge *edges, int edge_count, |
no test coverage detected