openmcpgdb 0.1.5

Interactive MCP server to control gdb. Fully featured and written in rust
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62

#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <time.h>
#include "maze.h"
#include "simulator.h"
#include "robot.h"
#include "fsm.h"

typedef void (*AppFunc)(void);

static Simulator g_sim;
static Robot g_robot;
static Fsm g_fsm;

static void app_init(void) {
    int rows = 21;
    int cols = 21;
    unsigned int seed = (unsigned int)time(NULL);

    printf("=== Maze Finder Robot ===\n");
    printf("Generating maze (%dx%d) with seed: %u\n\n", rows, cols, seed);

    simulator_init(&g_sim, rows, cols, seed);
    robot_init(&g_robot, &g_sim);
    fsm_init(&g_fsm, fsm_get_state_idle(), &g_robot);
}

static void app_run(void) {
    int max_steps = 10000;
    int step = 0;

    while (!simulator_is_at_goal(&g_sim) && step < max_steps) {
        printf("\n--- Step %d ---\n", step + 1);
        fsm_run(&g_fsm);
        simulator_print(&g_sim);
        step++;
    }

    if (simulator_is_at_goal(&g_sim)) {
        printf("\n*** Maze solved in %d steps! ***\n", g_sim.steps);
    } else {
        printf("\n*** Failed to solve maze within %d steps ***\n", max_steps);
    }
}

static void app_cleanup(void) {
    printf("\n=== Simulation Complete ===\n");
}

int main(void) {
    AppFunc funcs[] = {app_init, app_run, app_cleanup};

    while (1) {
        for (int i = 0; i < 3; i++) {
            funcs[i]();
        }
        sleep(1);
    }

    return 0;
}