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

Function cbm_walk_stack_reserve

internal/cbm/helpers.c:636–665  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

634}
635
636bool cbm_walk_stack_reserve(void **items, int *cap, int need, size_t elem_size,
637 const void *inline_buf, const char *walker) {
638 if (need <= *cap) {
639 return true;
640 }
641 size_t new_cap = (size_t)*cap;
642 while (new_cap < (size_t)need) {
643 new_cap *= 2;
644 }
645 void *grown = NULL;
646 if (new_cap <= (size_t)INT_MAX && new_cap <= SIZE_MAX / elem_size) {
647 if (*items == inline_buf) {
648 grown = cbm_alloc(CBM_MEM_CLASS_EXTRACT, new_cap * elem_size);
649 if (grown) {
650 memcpy(grown, inline_buf, (size_t)*cap * elem_size);
651 }
652 } else {
653 grown = cbm_realloc(CBM_MEM_CLASS_EXTRACT, *items, new_cap * elem_size);
654 }
655 }
656 if (!grown) {
657 char pending[24];
658 snprintf(pending, sizeof(pending), "%d", need);
659 cbm_log_error("extract.walk_stack_alloc_failed", "walker", walker, "pending", pending);
660 return false;
661 }
662 *items = grown;
663 *cap = (int)new_cap;
664 return true;
665}
666
667void cbm_walk_stack_release(void *items, const void *inline_buf) {
668 if (items != inline_buf) {

Callers 3

count_branching_iterFunction · 0.85
cbm_compute_complexityFunction · 0.85

Calls 2

cbm_allocFunction · 0.85
cbm_reallocFunction · 0.85

Tested by

no test coverage detected