MCPcopy Create free account
hub / github.com/DeusData/codebase-memory-mcp / tld_graph_free

Function tld_graph_free

src/pipeline/pass_complexity.c:171–179  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

169} tld_graph_t;
170
171static 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
181static 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;

Calls 1

cbm_freeFunction · 0.85

Tested by

no test coverage detected