| 169 | } tld_graph_t; |
| 170 | |
| 171 | static void tld_graph_free(tld_graph_t *g) { |
| 172 | cbm_free(CBM_MEM_CLASS_OTHER, g->keys); |
| 173 | cbm_free(CBM_MEM_CLASS_OTHER, g->present); |
| 174 | cbm_free(CBM_MEM_CLASS_OTHER, g->loop_depth); |
| 175 | cbm_free(CBM_MEM_CLASS_OTHER, g->recursive); |
| 176 | cbm_free(CBM_MEM_CLASS_OTHER, g->seeds); |
| 177 | cbm_free(CBM_MEM_CLASS_OTHER, g->first); |
| 178 | cbm_free(CBM_MEM_CLASS_OTHER, g->callee); |
| 179 | } |
| 180 | |
| 181 | static bool tld_graph_alloc(tld_graph_t *g, int64_t maxid, int seed_cap, int edge_count) { |
| 182 | size_t sz = (size_t)maxid + 1; |
no test coverage detected