mirror of
https://github.com/DeusData/codebase-memory-mcp.git
synced 2026-11-04 10:48:20 +00:00
Merge remote-tracking branch 'origin/main' into fix/php-single-file-registry-finalize
Signed-off-by: Martin Vogel <martin.vogel.tech@gmail.com>
This commit is contained in:
commit
4641e16d23
2 files changed
+161
-76
No files matched your search
@@ -677,12 +677,6 @@ static void finish_data_flow_props(char *props, size_t propsz, size_t pos,
|
||||
}
|
||||
}
|
||||
|
||||
typedef struct {
|
||||
int64_t source_id;
|
||||
const char *props;
|
||||
const char *edge_type;
|
||||
} caller_edge_ref_t;
|
||||
|
||||
static bool http_call_edge_has_valid_route(const cbm_gbuf_edge_t *edge) {
|
||||
char url_buf[CBM_SZ_512];
|
||||
const char *url = json_extract(edge->properties_json, "url_path", url_buf, sizeof(url_buf));
|
||||
@@ -747,84 +741,82 @@ static int try_create_data_flow(cbm_gbuf_t *gb, int64_t caller_id, int64_t handl
|
||||
return SKIP_ONE;
|
||||
}
|
||||
|
||||
/* Collect extra handler IDs reachable via INFRA_MAPS chain from a route. */
|
||||
static int collect_infra_handlers(cbm_gbuf_t *gb, int64_t route_id, int64_t *out, int max_out) {
|
||||
const cbm_gbuf_edge_t **infra_edges = NULL;
|
||||
int infra_count = 0;
|
||||
cbm_gbuf_find_edges_by_source_type(gb, route_id, "INFRA_MAPS", &infra_edges, &infra_count);
|
||||
/* One route's DATA_FLOWS context: its direct handlers (handler -[HANDLES]-> route) and its
|
||||
* INFRA_MAPS hops (route -[INFRA_MAPS]-> endpoint, whose handlers are reached via the endpoint).
|
||||
* The edge arrays are the graph buffer's own index arrays. Inserting DATA_FLOWS never appends to
|
||||
* a HANDLES, INFRA_MAPS, HTTP_CALLS or ASYNC_CALLS array, so they stay valid while flows are added
|
||||
* (only edge deletion rebuilds the indexes). */
|
||||
typedef struct {
|
||||
cbm_gbuf_t *gb;
|
||||
const cbm_gbuf_node_t *route;
|
||||
const cbm_gbuf_edge_t **handles;
|
||||
int handles_count;
|
||||
const cbm_gbuf_edge_t **infra;
|
||||
int infra_count;
|
||||
int flows;
|
||||
int skipped;
|
||||
} route_flows_t;
|
||||
|
||||
int n = 0;
|
||||
for (int ie = 0; ie < infra_count; ie++) {
|
||||
const cbm_gbuf_edge_t **ep_handles = NULL;
|
||||
int ep_hcount = 0;
|
||||
cbm_gbuf_find_edges_by_target_type(gb, infra_edges[ie]->target_id, "HANDLES", &ep_handles,
|
||||
&ep_hcount);
|
||||
for (int eh = 0; eh < ep_hcount && n < max_out; eh++) {
|
||||
out[n++] = ep_handles[eh]->source_id;
|
||||
}
|
||||
static void route_flow_add(route_flows_t *rf, const cbm_gbuf_edge_t *caller, int64_t handler_id,
|
||||
const char *edge_type, bool via_infra) {
|
||||
int rc = try_create_data_flow(rf->gb, caller->source_id, handler_id, rf->route, edge_type,
|
||||
caller->properties_json, via_infra);
|
||||
if (rc > 0) {
|
||||
rf->flows++;
|
||||
} else if (rc < 0) {
|
||||
rf->skipped++;
|
||||
}
|
||||
return n;
|
||||
}
|
||||
|
||||
/* Collect caller edges (HTTP_CALLS + ASYNC_CALLS) targeting a route. */
|
||||
static int collect_caller_edges(cbm_gbuf_t *gb, int64_t route_id, caller_edge_ref_t *out,
|
||||
int max_out) {
|
||||
int n = 0;
|
||||
/* DATA_FLOWS from one caller edge to every handler of the route, direct and via infra. */
|
||||
static void caller_data_flows(route_flows_t *rf, const cbm_gbuf_edge_t *caller,
|
||||
const char *edge_type) {
|
||||
for (int hi = 0; hi < rf->handles_count; hi++) {
|
||||
route_flow_add(rf, caller, rf->handles[hi]->source_id, edge_type, false);
|
||||
}
|
||||
for (int ie = 0; ie < rf->infra_count; ie++) {
|
||||
const cbm_gbuf_edge_t **ep_handles = NULL;
|
||||
int ep_hcount = 0;
|
||||
cbm_gbuf_find_edges_by_target_type(rf->gb, rf->infra[ie]->target_id, "HANDLES", &ep_handles,
|
||||
&ep_hcount);
|
||||
for (int eh = 0; eh < ep_hcount; eh++) {
|
||||
route_flow_add(rf, caller, ep_handles[eh]->source_id, edge_type, true);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/* Create DATA_FLOWS between EVERY caller (HTTP_CALLS + ASYNC_CALLS) and EVERY handler of one
|
||||
* route node.
|
||||
*
|
||||
* Callers were copied into a 64-slot buffer and infra handlers into a 32-slot one, each keeping the
|
||||
* first entries in edge-insertion order -- i.e. in parallel worker interleaving. Which DATA_FLOWS
|
||||
* existed therefore changed between two indexes of the same tree with the same binary
|
||||
* (thingsboard, 2026-10-17), and every caller past the 64th lost its flow outright. The flow set
|
||||
* is now the full caller x handler product. A (caller, handler) pair reached twice -- through two
|
||||
* routes, or directly and via infra -- keeps the order-free property winner of
|
||||
* cbm_gbuf_insert_edge. */
|
||||
static void create_route_data_flows(cbm_gbuf_t *gb, const cbm_gbuf_node_t *route, int *flows,
|
||||
int *skipped) {
|
||||
route_flows_t rf = {.gb = gb, .route = route};
|
||||
cbm_gbuf_find_edges_by_target_type(gb, route->id, "HANDLES", &rf.handles, &rf.handles_count);
|
||||
cbm_gbuf_find_edges_by_source_type(gb, route->id, "INFRA_MAPS", &rf.infra, &rf.infra_count);
|
||||
|
||||
const cbm_gbuf_edge_t **http_edges = NULL;
|
||||
int http_count = 0;
|
||||
cbm_gbuf_find_edges_by_target_type(gb, route_id, "HTTP_CALLS", &http_edges, &http_count);
|
||||
for (int i = 0; i < http_count && n < max_out; i++) {
|
||||
if (!http_call_edge_has_valid_route(http_edges[i])) {
|
||||
continue;
|
||||
cbm_gbuf_find_edges_by_target_type(gb, route->id, "HTTP_CALLS", &http_edges, &http_count);
|
||||
for (int i = 0; i < http_count; i++) {
|
||||
if (http_call_edge_has_valid_route(http_edges[i])) {
|
||||
caller_data_flows(&rf, http_edges[i], "HTTP_CALLS");
|
||||
}
|
||||
out[n].source_id = http_edges[i]->source_id;
|
||||
out[n].props = http_edges[i]->properties_json;
|
||||
out[n].edge_type = "HTTP_CALLS";
|
||||
n++;
|
||||
}
|
||||
const cbm_gbuf_edge_t **async_edges = NULL;
|
||||
int async_count = 0;
|
||||
cbm_gbuf_find_edges_by_target_type(gb, route_id, "ASYNC_CALLS", &async_edges, &async_count);
|
||||
for (int i = 0; i < async_count && n < max_out; i++) {
|
||||
out[n].source_id = async_edges[i]->source_id;
|
||||
out[n].props = async_edges[i]->properties_json;
|
||||
out[n].edge_type = "ASYNC_CALLS";
|
||||
n++;
|
||||
}
|
||||
return n;
|
||||
}
|
||||
|
||||
/* Create DATA_FLOWS between callers and handlers for one route node. */
|
||||
static void create_route_data_flows(cbm_gbuf_t *gb, const cbm_gbuf_node_t *route,
|
||||
const caller_edge_ref_t *callers, int n_callers, int *flows,
|
||||
int *skipped) {
|
||||
const cbm_gbuf_edge_t **handles_edges = NULL;
|
||||
int handles_count = 0;
|
||||
cbm_gbuf_find_edges_by_target_type(gb, route->id, "HANDLES", &handles_edges, &handles_count);
|
||||
|
||||
int64_t extra_handlers[CBM_SZ_32];
|
||||
int n_extra = collect_infra_handlers(gb, route->id, extra_handlers, CBM_SZ_32);
|
||||
|
||||
for (int ci = 0; ci < n_callers; ci++) {
|
||||
for (int hi = 0; hi < handles_count; hi++) {
|
||||
int rc = try_create_data_flow(gb, callers[ci].source_id, handles_edges[hi]->source_id,
|
||||
route, callers[ci].edge_type, callers[ci].props, false);
|
||||
if (rc > 0) {
|
||||
(*flows)++;
|
||||
} else if (rc < 0) {
|
||||
(*skipped)++;
|
||||
}
|
||||
}
|
||||
for (int xi = 0; xi < n_extra; xi++) {
|
||||
int rc = try_create_data_flow(gb, callers[ci].source_id, extra_handlers[xi], route,
|
||||
callers[ci].edge_type, callers[ci].props, true);
|
||||
if (rc > 0) {
|
||||
(*flows)++;
|
||||
} else if (rc < 0) {
|
||||
(*skipped)++;
|
||||
}
|
||||
}
|
||||
cbm_gbuf_find_edges_by_target_type(gb, route->id, "ASYNC_CALLS", &async_edges, &async_count);
|
||||
for (int i = 0; i < async_count; i++) {
|
||||
caller_data_flows(&rf, async_edges[i], "ASYNC_CALLS");
|
||||
}
|
||||
*flows += rf.flows;
|
||||
*skipped += rf.skipped;
|
||||
}
|
||||
|
||||
/* Find the enclosing proto service for a function by file + line range. */
|
||||
@@ -931,9 +923,7 @@ static void create_data_flows(cbm_gbuf_t *gb) {
|
||||
int skipped = 0;
|
||||
|
||||
for (int ri = 0; ri < route_count; ri++) {
|
||||
caller_edge_ref_t caller_edges[CBM_SZ_64];
|
||||
int n_callers = collect_caller_edges(gb, routes[ri]->id, caller_edges, CBM_SZ_64);
|
||||
create_route_data_flows(gb, routes[ri], caller_edges, n_callers, &flows, &skipped);
|
||||
create_route_data_flows(gb, routes[ri], &flows, &skipped);
|
||||
}
|
||||
|
||||
if (flows > 0 || skipped > 0) {
|
||||
|
||||
@@ -385,6 +385,98 @@ TEST(infrascan_http_calls_join_matching_handler_route) {
|
||||
PASS();
|
||||
}
|
||||
|
||||
/* FD16: a route's DATA_FLOWS were built from the first 64 callers and the first 32 infra handlers
|
||||
* in edge-insertion order (parallel worker interleaving), so the flow set changed between two
|
||||
* indexes of the same tree and every caller past the 64th lost its flow. */
|
||||
enum { FD16_CALLERS = 70, FD16_INFRA_HANDLERS = 40 };
|
||||
|
||||
static int64_t fd16_route_with_callers(cbm_gbuf_t *gb, int64_t *callers, bool reverse) {
|
||||
int64_t route = cbm_gbuf_upsert_node(gb, "Route", "/api/orders", "__route__GET__/api/orders",
|
||||
"", 0, 0, "{\"method\":\"GET\"}");
|
||||
int64_t handler = cbm_gbuf_upsert_node(gb, "Function", "get_orders", "test.get_orders",
|
||||
"server.py", 1, 3, "{}");
|
||||
cbm_gbuf_insert_edge(gb, handler, route, "HANDLES", "{\"handler\":\"test.get_orders\"}");
|
||||
for (int i = 0; i < FD16_CALLERS; i++) {
|
||||
char name[32];
|
||||
char qn[48];
|
||||
snprintf(name, sizeof(name), "client_%02d", i);
|
||||
snprintf(qn, sizeof(qn), "test.client_%02d", i);
|
||||
callers[i] =
|
||||
cbm_gbuf_upsert_node(gb, "Function", name, qn, "client.py", i + 1, i + 1, "{}");
|
||||
}
|
||||
for (int k = 0; k < FD16_CALLERS; k++) {
|
||||
int i = reverse ? FD16_CALLERS - 1 - k : k;
|
||||
cbm_gbuf_insert_edge(gb, callers[i], route, "HTTP_CALLS",
|
||||
"{\"callee\":\"requests.get\",\"url_path\":\"/api/orders\","
|
||||
"\"method\":\"GET\"}");
|
||||
}
|
||||
return handler;
|
||||
}
|
||||
|
||||
TEST(infrascan_data_flows_link_every_caller_of_a_route) {
|
||||
cbm_gbuf_t *gb = cbm_gbuf_new("test", "/tmp/cbm_infrascan_fd16_callers");
|
||||
ASSERT_NOT_NULL(gb);
|
||||
int64_t callers[FD16_CALLERS];
|
||||
int64_t handler = fd16_route_with_callers(gb, callers, false);
|
||||
cbm_pipeline_create_route_nodes(gb);
|
||||
for (int i = 0; i < FD16_CALLERS; i++) {
|
||||
ASSERT_TRUE(has_data_flow(gb, callers[i], handler));
|
||||
}
|
||||
cbm_gbuf_free(gb);
|
||||
PASS();
|
||||
}
|
||||
|
||||
TEST(infrascan_data_flows_do_not_depend_on_caller_insertion_order) {
|
||||
cbm_gbuf_t *fwd = cbm_gbuf_new("test", "/tmp/cbm_infrascan_fd16_fwd");
|
||||
cbm_gbuf_t *rev = cbm_gbuf_new("test", "/tmp/cbm_infrascan_fd16_rev");
|
||||
ASSERT_NOT_NULL(fwd);
|
||||
ASSERT_NOT_NULL(rev);
|
||||
int64_t fwd_callers[FD16_CALLERS];
|
||||
int64_t rev_callers[FD16_CALLERS];
|
||||
int64_t fwd_handler = fd16_route_with_callers(fwd, fwd_callers, false);
|
||||
int64_t rev_handler = fd16_route_with_callers(rev, rev_callers, true);
|
||||
cbm_pipeline_create_route_nodes(fwd);
|
||||
cbm_pipeline_create_route_nodes(rev);
|
||||
for (int i = 0; i < FD16_CALLERS; i++) {
|
||||
ASSERT_EQ(has_data_flow(fwd, fwd_callers[i], fwd_handler),
|
||||
has_data_flow(rev, rev_callers[i], rev_handler));
|
||||
}
|
||||
cbm_gbuf_free(fwd);
|
||||
cbm_gbuf_free(rev);
|
||||
PASS();
|
||||
}
|
||||
|
||||
TEST(infrascan_data_flows_reach_every_infra_handler) {
|
||||
cbm_gbuf_t *gb = cbm_gbuf_new("test", "/tmp/cbm_infrascan_fd16_infra");
|
||||
ASSERT_NOT_NULL(gb);
|
||||
int64_t route = cbm_gbuf_upsert_node(gb, "Route", "/api/orders", "__route__GET__/api/orders",
|
||||
"", 0, 0, "{\"method\":\"GET\"}");
|
||||
int64_t endpoint = cbm_gbuf_upsert_node(gb, "Route", "/orders", "__route__GET__/orders", "", 0,
|
||||
0, "{\"method\":\"GET\"}");
|
||||
int64_t client =
|
||||
cbm_gbuf_upsert_node(gb, "Function", "client", "test.client", "client.py", 1, 3, "{}");
|
||||
cbm_gbuf_insert_edge(gb, route, endpoint, "INFRA_MAPS", "{}");
|
||||
cbm_gbuf_insert_edge(gb, client, route, "HTTP_CALLS",
|
||||
"{\"callee\":\"requests.get\",\"url_path\":\"/api/orders\","
|
||||
"\"method\":\"GET\"}");
|
||||
int64_t handlers[FD16_INFRA_HANDLERS];
|
||||
for (int i = 0; i < FD16_INFRA_HANDLERS; i++) {
|
||||
char name[32];
|
||||
char qn[48];
|
||||
snprintf(name, sizeof(name), "orders_%02d", i);
|
||||
snprintf(qn, sizeof(qn), "test.orders_%02d", i);
|
||||
handlers[i] =
|
||||
cbm_gbuf_upsert_node(gb, "Function", name, qn, "server.py", i + 1, i + 1, "{}");
|
||||
cbm_gbuf_insert_edge(gb, handlers[i], endpoint, "HANDLES", "{}");
|
||||
}
|
||||
cbm_pipeline_create_route_nodes(gb);
|
||||
for (int i = 0; i < FD16_INFRA_HANDLERS; i++) {
|
||||
ASSERT_TRUE(has_data_flow(gb, client, handlers[i]));
|
||||
}
|
||||
cbm_gbuf_free(gb);
|
||||
PASS();
|
||||
}
|
||||
|
||||
SUITE(infrascan) {
|
||||
RUN_TEST(infrascan_http_route_literal_guard_rejects_filesystem_paths);
|
||||
RUN_TEST(infrascan_http_route_literal_guard_rejects_document_extensions);
|
||||
@@ -393,4 +485,7 @@ SUITE(infrascan) {
|
||||
RUN_TEST(infrascan_service_pattern_match_keeps_real_library_qns);
|
||||
RUN_TEST(infrascan_route_nodes_skip_bad_http_url_paths);
|
||||
RUN_TEST(infrascan_http_calls_join_matching_handler_route);
|
||||
RUN_TEST(infrascan_data_flows_link_every_caller_of_a_route);
|
||||
RUN_TEST(infrascan_data_flows_do_not_depend_on_caller_insertion_order);
|
||||
RUN_TEST(infrascan_data_flows_reach_every_infra_handler);
|
||||
}
|
||||
Reference in new issue
Block a user