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

Function gbuf_delete_untouched

src/graph_buffer/graph_buffer.c:1555–1606  ·  view source on GitHub ↗

Delete the `label` nodes no edge of `types` (NULL-terminated) touches -- * with `fileless`, only those carrying no file; returns how many. */

Source from the content-addressed store, hash-verified

1553/* Delete the `label` nodes no edge of `types` (NULL-terminated) touches --
1554 * with `fileless`, only those carrying no file; returns how many. */
1555static int gbuf_delete_untouched(cbm_gbuf_t *gb, const char *label, const char *const *types,
1556 bool fileless) {
1557 node_ptr_array_t *arr = cbm_ht_get(gb->nodes_by_label, label);
1558 if (!arr || arr->count == 0) {
1559 return 0;
1560 }
1561 /* The victims first: the per-node unlinking below edits `arr`. */
1562 cbm_gbuf_node_t **victims =
1563 cbm_calloc(CBM_MEM_CLASS_GBUF_INDEX, (size_t)arr->count * sizeof(*victims));
1564 if (!victims) {
1565 return CBM_NOT_FOUND;
1566 }
1567 int n = 0;
1568 for (int i = 0; i < arr->count; i++) {
1569 const char *qn = arr->items[i]->qualified_name;
1570 cbm_gbuf_node_t *node = qn ? cbm_ht_get(gb->node_by_qn, qn) : NULL;
1571 if (node && !(fileless && node->file_path && node->file_path[0]) &&
1572 !gbuf_node_touched(gb, node->id, types)) {
1573 victims[n++] = node;
1574 }
1575 }
1576 if (n == 0) {
1577 cbm_free(CBM_MEM_CLASS_GBUF_INDEX, victims);
1578 return 0;
1579 }
1580 CBMHashTable *deleted_set = cbm_ht_create((uint32_t)n);
1581 for (int i = 0; i < n; i++) {
1582 cbm_gbuf_node_t *node = victims[i];
1583 if (!node->qualified_name) {
1584 continue;
1585 }
1586 char id_buf[CBM_SZ_32];
1587 make_id_key(id_buf, sizeof(id_buf), node->id);
1588 cbm_ht_set(deleted_set, cbm_mem_strdup(CBM_MEM_CLASS_GBUF_INDEX, id_buf),
1589 intptr_to_ptr(SKIP_ONE));
1590 remove_node_from_ptr_array(cbm_ht_get(gb->nodes_by_label, node->label), node->id);
1591 remove_node_from_ptr_array(cbm_ht_get(gb->nodes_by_name, node->name), node->id);
1592 gb_drop_variant_spans(gb, node->qualified_name);
1593 cbm_ht_delete(gb->node_by_qn, node->qualified_name);
1594 if (node->id >= 0 && node->id < gb->by_id_cap) {
1595 gb->by_id[node->id] = NULL;
1596 }
1597 /* As delete_by_file: a NULL QN fails the dump's liveness check. */
1598 cbm_free(CBM_MEM_CLASS_GBUF_STRING, node->qualified_name);
1599 node->qualified_name = NULL;
1600 }
1601 cascade_delete_edges(gb, deleted_set);
1602 cbm_ht_foreach(deleted_set, free_index_key, NULL);
1603 cbm_ht_free(deleted_set);
1604 cbm_free(CBM_MEM_CLASS_GBUF_INDEX, victims);
1605 return n;
1606}
1607
1608int cbm_gbuf_delete_unreferenced(cbm_gbuf_t *gb, const char *label, const char *const *edge_types) {
1609 if (!gb || !label || !edge_types || !edge_types[0]) {

Callers 2

cbm_gbuf_delete_edgelessFunction · 0.85

Calls 15

cbm_ht_getFunction · 0.85
cbm_callocFunction · 0.85
gbuf_node_touchedFunction · 0.85
cbm_freeFunction · 0.85
cbm_ht_createFunction · 0.85
make_id_keyFunction · 0.85
cbm_ht_setFunction · 0.85
cbm_mem_strdupFunction · 0.85
gb_drop_variant_spansFunction · 0.85
cbm_ht_deleteFunction · 0.85
cascade_delete_edgesFunction · 0.85

Tested by

no test coverage detected