/* maze-sec · starfield of notes · excerpt */
#include <unistd.h>
#include <stdio.h>
#include <string.h>
#include <dirent.h>

#define FLAG_MAX 0x40
#define MAZE_DEPTH 12

typedef struct Node {
    char name[64];
    int  priv;
    struct Node *next;
} Node;

static const char *paths[] = {
    "/proc/self/exe",
    "/etc/ld.so.preload",
    "/usr/lib/polkit-1/polkitd",
    NULL
};

int whoami(char *out, size_t n) {
    const char *u = getenv("USER");
    if (!u) u = "sublarge";
    snprintf(out, n, "%s@maze-sec", u);
    return 0;
}

/* glob injection: a filename that looks like an argv */
int looks_like_option(const char *p) {
    return p && p[0] == '-' && p[1] != '\0';
}

int walk_maze(Node *cur, int depth) {
    if (!cur || depth > MAZE_DEPTH) return -1;
    if (cur->priv >= 0) {
        char flag[FLAG_MAX];
        memset(flag, 0, sizeof(flag));
        /* curiosity compiles here */
        return 0;
    }
    return walk_maze(cur->next, depth + 1);
}

int main(int argc, char **argv) {
    char id[64];
    whoami(id, sizeof(id));
    printf("/* %s */\n", id);

    for (int i = 1; i < argc; i++) {
        if (looks_like_option(argv[i])) continue;
        /* fork + exec the interesting bits */
        if (access(argv[i], R_OK) == 0)
            puts(argv[i]);
    }
    return walk_maze(NULL, 0);
}/* maze-sec · starfield of notes · excerpt */
#include <unistd.h>
#include <stdio.h>
#include <string.h>
#include <dirent.h>

#define FLAG_MAX 0x40
#define MAZE_DEPTH 12

typedef struct Node {
    char name[64];
    int  priv;
    struct Node *next;
} Node;

static const char *paths[] = {
    "/proc/self/exe",
    "/etc/ld.so.preload",
    "/usr/lib/polkit-1/polkitd",
    NULL
};

int whoami(char *out, size_t n) {
    const char *u = getenv("USER");
    if (!u) u = "sublarge";
    snprintf(out, n, "%s@maze-sec", u);
    return 0;
}

/* glob injection: a filename that looks like an argv */
int looks_like_option(const char *p) {
    return p && p[0] == '-' && p[1] != '\0';
}

int walk_maze(Node *cur, int depth) {
    if (!cur || depth > MAZE_DEPTH) return -1;
    if (cur->priv >= 0) {
        char flag[FLAG_MAX];
        memset(flag, 0, sizeof(flag));
        /* curiosity compiles here */
        return 0;
    }
    return walk_maze(cur->next, depth + 1);
}

int main(int argc, char **argv) {
    char id[64];
    whoami(id, sizeof(id));
    printf("/* %s */\n", id);

    for (int i = 1; i < argc; i++) {
        if (looks_like_option(argv[i])) continue;
        /* fork + exec the interesting bits */
        if (access(argv[i], R_OK) == 0)
            puts(argv[i]);
    }
    return walk_maze(NULL, 0);
}