2178d6a70c
A maintainable, extensible BitTorrent client (C11, Linux/io_uring) targeting 10 GbE saturation. All torrent functionality is built from scratch; liburing is the only linked third-party dependency on the data path. Implements Phases 1-7 of the roadmap: - core: page-aligned buffer pool, MPMC/Treiber queues, bitfields, worker pool - crypto: SHA-1/256 (SHA-NI + scalar), Merkle (BEP-52), RC4 (MSE) - bencode/metainfo: zero-copy parser, v1/v2/hybrid .torrent + magnet - peer: sans-IO wire codec, MSE/PE handshake state machine, BEP-10, ut_metadata, PEX - piece/storage: block-level multi-peer engine, rarest-first + endgame, per-file completion events + single-file relocate (move-as-you-finish) - tracker/dht: HTTP + UDP (BEP-15) trackers, BEP-5 KRPC iterative lookup - platform: io_uring reactor (SQPOLL, registered buffers, SEND_ZC) - surface: versioned RPC, native plugin ABI, sandboxed Lua scripting, nautd/nautctl Verified against libtorrent (single/multi/hybrid, MSE, magnet-via-DHT, swarm); unit + interop tests green; ASan/UBSan/TSan clean. Scripting reference in docs/scripting.md. Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
71 lines
2.6 KiB
C
71 lines
2.6 KiB
C
/* fuzz_lite — dependency-free mutational fuzzer. Seeds from the fixture corpus,
|
|
* applies random mutations, and feeds both parsers. Run under -fsanitize=
|
|
* address,undefined so any out-of-bounds / UB aborts. Not a replacement for
|
|
* libFuzzer coverage-guidance, but it exercises the hostile-input paths hard.
|
|
*
|
|
* usage: fuzz_lite <bencode|metainfo> <iterations> [seedfile ...]
|
|
*/
|
|
#include "naut/bencode.h"
|
|
#include "naut/metainfo.h"
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
static void run_one(int meta, const uint8_t *p, size_t n) {
|
|
if (meta) {
|
|
naut_metainfo mi;
|
|
if (naut_metainfo_parse(p, n, &mi) == NAUT_OK) naut_metainfo_free(&mi);
|
|
} else {
|
|
naut_bc_doc *d = NULL;
|
|
if (naut_bc_parse(p, n, &d) == NAUT_OK) {
|
|
(void)naut_bc_dict_get(naut_bc_root(d), "info");
|
|
naut_bc_free(d);
|
|
}
|
|
}
|
|
}
|
|
|
|
int main(int argc, char **argv) {
|
|
if (argc < 3) { fprintf(stderr, "usage: %s <bencode|metainfo> <iters> [seed..]\n", argv[0]); return 2; }
|
|
int meta = strcmp(argv[1], "metainfo") == 0;
|
|
long iters = atol(argv[2]);
|
|
|
|
/* load seeds */
|
|
uint8_t *seed[16]; size_t seedlen[16]; int nseed = 0;
|
|
for (int i = 3; i < argc && nseed < 16; i++) {
|
|
FILE *f = fopen(argv[i], "rb"); if (!f) continue;
|
|
fseek(f, 0, SEEK_END); long sz = ftell(f); fseek(f, 0, SEEK_SET);
|
|
seed[nseed] = malloc(sz ? sz : 1);
|
|
if (fread(seed[nseed], 1, sz, f) == (size_t)sz) { seedlen[nseed] = sz; nseed++; }
|
|
fclose(f);
|
|
}
|
|
|
|
srand(1234);
|
|
size_t cap = 1 << 20;
|
|
uint8_t *buf = malloc(cap);
|
|
|
|
for (long it = 0; it < iters; it++) {
|
|
size_t n;
|
|
if (nseed && (rand() & 3)) { /* mutate a seed */
|
|
int s = rand() % nseed;
|
|
n = seedlen[s];
|
|
if (n > cap) n = cap;
|
|
memcpy(buf, seed[s], n);
|
|
int muts = 1 + rand() % 16;
|
|
for (int m = 0; m < muts && n; m++) {
|
|
int op = rand() % 3;
|
|
if (op == 0) buf[rand() % n] ^= (uint8_t)(1 << (rand() & 7)); /* bit flip */
|
|
else if (op == 1) buf[rand() % n] = (uint8_t)rand(); /* byte set */
|
|
else n = rand() % (n + 1); /* truncate */
|
|
}
|
|
} else { /* pure random */
|
|
n = rand() % 4096;
|
|
for (size_t i = 0; i < n; i++) buf[i] = (uint8_t)rand();
|
|
}
|
|
run_one(meta, buf, n);
|
|
}
|
|
|
|
printf("fuzz_lite %s: %ld iterations clean\n", argv[1], iters);
|
|
free(buf);
|
|
for (int i = 0; i < nseed; i++) free(seed[i]);
|
|
return 0;
|
|
}
|