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

Function tld_seed

src/pipeline/pass_complexity.c:210–218  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

208}
209
210static void tld_seed(tld_graph_t *g, int64_t id, const char *properties, int seed_cap) {
211 if (id >= 1 && id <= g->maxid && g->seed_count < seed_cap) {
212 g->loop_depth[id] = json_get_int(properties, "loop_depth", 0);
213 g->recursive[id] = json_get_bool(properties, "self_recursive");
214 g->seeds[g->seed_count].id = id;
215 g->seeds[g->seed_count].key = &g->keys[id];
216 g->seed_count++;
217 }
218}
219
220/* Traversal state. `callees` is one bump stack shared by every DFS frame: a
221 * frame takes its out-degree worth of slots, sorts them, recurses, then

Callers 2

tld_gather_gbufFunction · 0.85
tld_gather_storeFunction · 0.85

Calls 2

json_get_intFunction · 0.85
json_get_boolFunction · 0.85

Tested by

no test coverage detected