Commit | Line | Data |
---|---|---|
50c74957 | 1 | /* -*-c-*- |
50c74957 | 2 | * |
3 | * An evil proxy for TrIPE | |
4 | * | |
5 | * (c) 2001 Straylight/Edgeware | |
6 | */ | |
7 | ||
e04c2d50 | 8 | /*----- Licensing notice --------------------------------------------------* |
50c74957 | 9 | * |
10 | * This file is part of Trivial IP Encryption (TrIPE). | |
11 | * | |
11ad66c2 MW |
12 | * TrIPE is free software: you can redistribute it and/or modify it under |
13 | * the terms of the GNU General Public License as published by the Free | |
14 | * Software Foundation; either version 3 of the License, or (at your | |
15 | * option) any later version. | |
e04c2d50 | 16 | * |
11ad66c2 MW |
17 | * TrIPE is distributed in the hope that it will be useful, but WITHOUT |
18 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
19 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
20 | * for more details. | |
e04c2d50 | 21 | * |
50c74957 | 22 | * You should have received a copy of the GNU General Public License |
11ad66c2 | 23 | * along with TrIPE. If not, see <https://www.gnu.org/licenses/>. |
50c74957 | 24 | */ |
25 | ||
50c74957 | 26 | /*----- Header files ------------------------------------------------------*/ |
27 | ||
28 | #include "config.h" | |
29 | ||
30 | #include <assert.h> | |
31 | #include <errno.h> | |
32 | #include <stdio.h> | |
33 | #include <stdlib.h> | |
34 | #include <string.h> | |
35 | #include <time.h> | |
36 | ||
37 | #include <sys/types.h> | |
38 | #include <sys/time.h> | |
39 | #include <unistd.h> | |
40 | #include <fcntl.h> | |
41 | ||
42 | #include <sys/socket.h> | |
43 | #include <netinet/in.h> | |
44 | #include <arpa/inet.h> | |
45 | #include <netdb.h> | |
46 | ||
47 | #include <mLib/alloc.h> | |
48 | #include <mLib/dstr.h> | |
49 | #include <mLib/fdflags.h> | |
50 | #include <mLib/mdwopt.h> | |
51 | #include <mLib/quis.h> | |
52 | #include <mLib/report.h> | |
53 | #include <mLib/sel.h> | |
54 | #include <mLib/sub.h> | |
55 | #include <mLib/tv.h> | |
56 | ||
c953f4b5 | 57 | #include <catacomb/buf.h> |
58 | ||
50c74957 | 59 | #include <catacomb/key.h> |
60 | ||
61 | #include <catacomb/mp.h> | |
50c74957 | 62 | #include <catacomb/mprand.h> |
63 | #include <catacomb/dh.h> | |
64 | ||
9f90c1f6 | 65 | #include <catacomb/chacha20.h> |
50c74957 | 66 | #include <catacomb/noise.h> |
67 | #include <catacomb/rand.h> | |
50c74957 | 68 | |
23df0e5b MW |
69 | #include "util.h" |
70 | ||
50c74957 | 71 | /*----- Data structures ---------------------------------------------------*/ |
72 | ||
73 | typedef struct peer { | |
74 | sel_file sf; | |
50c74957 | 75 | const char *name; |
76 | struct filter *f; | |
77 | } peer; | |
78 | ||
79 | typedef struct filter { | |
80 | struct filter *next; | |
81 | peer *p_from, *p_to; | |
82 | void (*func)(struct filter */*f*/, const octet */*buf*/, size_t /*sz*/); | |
83 | void *state; | |
84 | } filter; | |
85 | ||
86 | typedef struct qnode { | |
87 | octet *buf; | |
88 | size_t sz; | |
89 | } qnode; | |
90 | ||
91 | /*----- Static variables --------------------------------------------------*/ | |
92 | ||
93 | #define PKBUFSZ 65536 | |
94 | ||
95 | static sel_state sel; | |
96 | static peer peers[2]; | |
97 | static unsigned npeer = 0; | |
98 | static key_file keys; | |
99 | static grand *rng; | |
100 | ||
101 | #define PASS(f, buf, sz) ((f) ? (f)->func((f), (buf), (sz)) : (void)0) | |
102 | #define RND(i) (rng->ops->range(rng, (i))) | |
103 | ||
104 | /*----- Peer management ---------------------------------------------------*/ | |
105 | ||
106 | static void dopacket(int fd, unsigned mode, void *vv) | |
107 | { | |
108 | octet buf[PKBUFSZ]; | |
109 | peer *p = vv; | |
110 | int r = read(fd, buf, sizeof(buf)); | |
111 | if (r >= 0) { | |
112 | printf("recv from `%s'\n", p->name); | |
113 | PASS(p->f, buf, r); | |
114 | } | |
115 | } | |
116 | ||
117 | static void addpeer(unsigned ac, char **av) | |
118 | { | |
50c74957 | 119 | struct hostent *h; |
120 | struct sockaddr_in sin; | |
121 | int len = PKBUFSZ; | |
122 | peer *p; | |
123 | int fd; | |
50c74957 | 124 | |
6dbded74 MW |
125 | if (ac != 4) die(1, "syntax: peer:NAME:PORT:ADDR:PORT"); |
126 | if (npeer >= 2) die(1, "enough peers already"); | |
127 | if (!key_bytag(&keys, av[0])) die(1, "no key named `%s'", av[0]); | |
50c74957 | 128 | p = &peers[npeer++]; |
129 | p->name = xstrdup(av[0]); | |
50c74957 | 130 | if ((fd = socket(PF_INET, SOCK_DGRAM, 0)) < 0) |
131 | die(1, "socket: %s", strerror(errno)); | |
132 | fdflags(fd, O_NONBLOCK, O_NONBLOCK, FD_CLOEXEC, FD_CLOEXEC); | |
133 | memset(&sin, 0, sizeof(sin)); | |
134 | sin.sin_family = AF_INET; | |
135 | sin.sin_addr.s_addr = INADDR_ANY; | |
136 | sin.sin_port = htons(atoi(av[1])); | |
137 | if (bind(fd, (struct sockaddr *)&sin, sizeof(sin))) | |
138 | die(1, "bind: %s", strerror(errno)); | |
139 | memset(&sin, 0, sizeof(sin)); | |
140 | sin.sin_family = AF_INET; | |
141 | if ((h = gethostbyname(av[2])) == 0) | |
142 | die(1, "gethostbyname `%s'", av[2]); | |
143 | if (setsockopt(fd, SOL_SOCKET, SO_RCVBUF, &len, sizeof(len)) || | |
144 | setsockopt(fd, SOL_SOCKET, SO_SNDBUF, &len, sizeof(len))) | |
145 | die(1, "setsockopt: %s", strerror(errno)); | |
146 | memcpy(&sin.sin_addr, h->h_addr, sizeof(sin.sin_addr)); | |
147 | sin.sin_port = htons(atoi(av[3])); | |
148 | if (connect(fd, (struct sockaddr *)&sin, sizeof(sin))) | |
149 | die(1, "connect: %s", strerror(errno)); | |
150 | sel_initfile(&sel, &p->sf, fd, SEL_READ, dopacket, p); | |
151 | sel_addfile(&p->sf); | |
152 | } | |
153 | ||
154 | /*----- Fork filter -------------------------------------------------------*/ | |
155 | ||
156 | typedef struct forknode { | |
157 | struct forknode *next; | |
158 | filter *f; | |
159 | } forknode; | |
160 | ||
161 | typedef struct forkfilt { | |
162 | const char *name; | |
163 | forknode *fn; | |
164 | } forkfilt; | |
165 | ||
166 | static void dofork(filter *f, const octet *buf, size_t sz) | |
167 | { | |
168 | forkfilt *ff = f->state; | |
169 | forknode *fn; | |
170 | unsigned i = 0; | |
171 | ||
172 | ff = f->state; | |
173 | for (fn = ff->fn; fn; fn = fn->next) { | |
174 | printf("fork branch %u of fork `%s'\n", i++, ff->name); | |
175 | PASS(fn->f, buf, sz); | |
176 | } | |
177 | printf("fork branch %u of fork `%s'\n", i++, ff->name); | |
178 | PASS(f->next, buf, sz); | |
179 | } | |
180 | ||
181 | static void addfork(filter *f, unsigned ac, char **av) | |
182 | { | |
183 | forkfilt *ff; | |
6dbded74 | 184 | if (ac != 1) die(1, "syntax: filt:fork:NAME"); |
50c74957 | 185 | ff = CREATE(forkfilt); |
186 | ff->name = xstrdup(av[0]); | |
187 | ff->fn = 0; | |
188 | f->func = dofork; | |
189 | f->state = ff; | |
190 | } | |
191 | ||
192 | static void nextfork(unsigned ac, char **av) | |
193 | { | |
c953f4b5 | 194 | unsigned i, j; |
50c74957 | 195 | filter *f; |
196 | forkfilt *ff; | |
197 | forknode *fn, **ffn; | |
198 | peer *p; | |
199 | ||
6dbded74 | 200 | if (ac < 1) die(1, "syntax: next:NAME:..."); |
50c74957 | 201 | for (i = 0; i < 2; i++) { |
202 | p = &peers[i]; | |
203 | for (f = p->f; f; f = f->next) { | |
6dbded74 | 204 | if (f->func != dofork) continue; |
50c74957 | 205 | ff = f->state; |
6dbded74 MW |
206 | for (j = 0; j < ac; j++) |
207 | if (strcmp(av[j], ff->name) == 0) goto match; | |
c953f4b5 | 208 | continue; |
209 | match: | |
50c74957 | 210 | fn = CREATE(forknode); |
6dbded74 | 211 | for (ffn = &ff->fn; *ffn; ffn = &(*ffn)->next); |
50c74957 | 212 | fn->f = f->next; |
213 | f->next = 0; | |
214 | fn->next = 0; | |
215 | *ffn = fn; | |
216 | } | |
217 | } | |
218 | } | |
219 | ||
220 | /*----- Corrupt filter ----------------------------------------------------*/ | |
221 | ||
222 | typedef struct corrupt { | |
223 | unsigned p_corrupt; | |
224 | } corrupt; | |
225 | ||
226 | static void docorrupt(filter *f, const octet *buf, size_t sz) | |
227 | { | |
228 | corrupt *c = f->state; | |
229 | octet b[PKBUFSZ]; | |
230 | memcpy(b, buf, sz); | |
231 | ||
232 | while (!RND(c->p_corrupt)) { | |
233 | puts("corrupt packet"); | |
234 | b[RND(sz)] ^= RND(256); | |
235 | } | |
236 | PASS(f->next, b, sz); | |
237 | } | |
238 | ||
239 | static void addcorrupt(filter *f, unsigned ac, char **av) | |
240 | { | |
241 | corrupt *c; | |
6dbded74 | 242 | if (ac > 1) die(1, "syntax: filt:corrupt[:P-CORRUPT]"); |
50c74957 | 243 | c = CREATE(corrupt); |
6dbded74 MW |
244 | if (ac > 0) c->p_corrupt = atoi(av[0]); |
245 | else c->p_corrupt = 5; | |
50c74957 | 246 | f->state = c; |
247 | f->func = docorrupt; | |
248 | } | |
249 | ||
a2e06ed5 MW |
250 | /*----- Drop filter -------------------------------------------------------*/ |
251 | ||
252 | typedef struct drop { | |
253 | unsigned p_drop; | |
254 | } drop; | |
255 | ||
256 | static void dodrop(filter *f, const octet *buf, size_t sz) | |
257 | { | |
258 | drop *d = f->state; | |
259 | ||
6dbded74 MW |
260 | if (!RND(d->p_drop)) puts("drop packet"); |
261 | else PASS(f->next, buf, sz); | |
a2e06ed5 MW |
262 | } |
263 | ||
264 | static void adddrop(filter *f, unsigned ac, char **av) | |
265 | { | |
266 | drop *d; | |
6dbded74 | 267 | if (ac > 1) die(1, "syntax: filt:drop[:P-DROP]"); |
a2e06ed5 | 268 | d = CREATE(drop); |
6dbded74 MW |
269 | if (ac > 0) d->p_drop = atoi(av[0]); |
270 | else d->p_drop = 5; | |
a2e06ed5 MW |
271 | f->state = d; |
272 | f->func = dodrop; | |
273 | } | |
274 | ||
50c74957 | 275 | /*----- Delay filter ------------------------------------------------------*/ |
276 | ||
277 | typedef struct delaynode { | |
278 | unsigned flag; | |
279 | sel_timer tm; | |
280 | unsigned i; | |
281 | struct delay *d; | |
282 | octet *buf; | |
283 | size_t sz; | |
284 | unsigned seq; | |
285 | } delaynode; | |
286 | ||
287 | typedef struct delay { | |
288 | unsigned max, n; | |
289 | unsigned long t; | |
290 | unsigned p_replay; | |
291 | filter *f; | |
292 | delaynode *q; | |
293 | } delay; | |
294 | ||
295 | static void dtimer(struct timeval *tv, void *vv); | |
296 | ||
297 | static void dinsert(delaynode *dn) | |
298 | { | |
299 | struct timeval tv; | |
300 | sel_timer *ta, *tb; | |
301 | unsigned long tdelta = RND(dn->d->t); | |
302 | gettimeofday(&tv, 0); | |
303 | TV_ADDL(&tv, &tv, 0, tdelta); | |
304 | assert(!dn->flag); | |
305 | sel_addtimer(&sel, &dn->tm, &tv, dtimer, dn); | |
306 | dn->flag = 1; | |
307 | for (ta = tb = sel.timers; ta; ta = ta->next) { | |
308 | ta = ta->next; if (!ta) break; assert(ta != tb); | |
309 | ta = ta->next; if (!ta) break; assert(ta != tb); | |
310 | tb = tb->next; | |
311 | } | |
312 | printf(" delay %lu usecs", tdelta); | |
313 | } | |
314 | ||
315 | static void dsend(delaynode *dn, unsigned force) | |
316 | { | |
317 | delay *d = dn->d; | |
318 | delaynode *ddn; | |
6dbded74 MW |
319 | unsigned i; |
320 | ||
50c74957 | 321 | fputs(" send...\n", stdout); |
322 | assert(dn->buf); | |
323 | PASS(d->f->next, dn->buf, dn->sz); | |
324 | fputs("delay ...", stdout); | |
325 | if (!force) | |
326 | dinsert(dn); | |
327 | else { | |
328 | xfree(dn->buf); | |
329 | dn->buf = 0; | |
330 | d->n--; | |
331 | if (dn->i < d->n) { | |
332 | ddn = &d->q[d->n]; | |
333 | sel_rmtimer(&ddn->tm); | |
334 | sel_addtimer(&sel, &dn->tm, &ddn->tm.tv, dtimer, dn); | |
335 | dn->flag = 1; | |
336 | dn->buf = ddn->buf; | |
337 | dn->sz = ddn->sz; | |
338 | dn->seq = ddn->seq; | |
339 | ddn->buf = 0; | |
340 | ddn->flag = 0; | |
341 | printf(" move id %u from slot %u to slot %u", ddn->seq, ddn->i, dn->i); | |
342 | } | |
6dbded74 | 343 | for (i = 0; i < d->n; i++) assert(d->q[i].buf); |
50c74957 | 344 | fputs(" remove", stdout); |
345 | } | |
346 | } | |
347 | ||
348 | static void dtimer(struct timeval *tv, void *vv) | |
349 | { | |
350 | delaynode *dn = vv; | |
351 | printf("delay timer peer `%s' id %u slot %u", | |
352 | dn->d->f->p_from->name, dn->seq, dn->i); | |
353 | dn->flag = 0; | |
354 | dsend(dn, RND(dn->d->p_replay)); | |
355 | fputc('\n', stdout); | |
356 | } | |
357 | ||
358 | static void dodelay(filter *f, const octet *buf, size_t sz) | |
359 | { | |
360 | delay *d = f->state; | |
361 | delaynode *dn; | |
362 | static unsigned seq = 0; | |
363 | ||
364 | fputs("delay", stdout); | |
365 | if (d->n == d->max) { | |
366 | dn = &d->q[RND(d->n)]; | |
367 | printf(" force uid %u", dn->seq); | |
368 | sel_rmtimer(&dn->tm); | |
369 | dn->flag = 0; | |
370 | dsend(dn, 1); | |
371 | fputc(';', stdout); | |
372 | } | |
373 | dn = &d->q[d->n++]; | |
374 | dn->seq = seq++; | |
375 | printf(" new id %u in slot %u", dn->seq, dn->i); | |
376 | dn->buf = xmalloc(sz); | |
377 | dn->sz = sz; | |
378 | memcpy(dn->buf, buf, sz); | |
379 | dinsert(dn); | |
380 | fputc('\n', stdout); | |
381 | } | |
382 | ||
383 | static void adddelay(filter *f, unsigned ac, char **av) | |
384 | { | |
385 | delay *d; | |
386 | unsigned i; | |
387 | ||
6dbded74 | 388 | if (ac < 1 || ac > 3) die(1, "syntax: filt:delay:QLEN[:MILLIS:P-REPLAY]"); |
50c74957 | 389 | d = CREATE(delay); |
390 | d->max = atoi(av[0]); | |
6dbded74 MW |
391 | if (ac > 1) d->t = strtoul(av[1], 0, 10); |
392 | else d->t = 100; | |
50c74957 | 393 | d->t *= 1000; |
6dbded74 MW |
394 | if (ac > 2) d->p_replay = atoi(av[2]); |
395 | else d->p_replay = 20; | |
50c74957 | 396 | d->n = 0; |
397 | d->q = xmalloc(d->max * sizeof(delaynode)); | |
398 | d->f = f; | |
399 | f->state = d; | |
400 | f->func = dodelay; | |
401 | for (i = 0; i < d->max; i++) { | |
402 | d->q[i].d = d; | |
403 | d->q[i].i = i; | |
404 | d->q[i].buf = 0; | |
405 | d->q[i].flag = 0; | |
406 | } | |
407 | } | |
408 | ||
409 | /*----- Filters -----------------------------------------------------------*/ | |
410 | ||
411 | static void dosend(filter *f, const octet *buf, size_t sz) | |
412 | { | |
413 | printf("send to `%s'\n", f->p_to->name); | |
99735357 | 414 | DISCARD(write(f->p_to->sf.fd, buf, sz)); |
50c74957 | 415 | } |
416 | ||
417 | static void addsend(filter *f, unsigned ac, char **av) | |
418 | { | |
6dbded74 | 419 | if (ac) die(1, "syntax: filt:send"); |
50c74957 | 420 | f->func = dosend; |
421 | } | |
422 | ||
423 | const struct filtab { | |
424 | const char *name; | |
425 | void (*func)(filter */*f*/, unsigned /*ac*/, char **/*av*/); | |
426 | } filtab[] = { | |
427 | { "send", addsend }, | |
428 | { "fork", addfork }, | |
429 | { "delay", adddelay }, | |
a2e06ed5 | 430 | { "drop", adddrop }, |
50c74957 | 431 | { "corrupt", addcorrupt }, |
432 | { 0, 0 } | |
433 | }; | |
434 | ||
435 | static void dofilter(peer *from, peer *to, unsigned ac, char **av) | |
436 | { | |
437 | filter **ff, *f = CREATE(filter); | |
438 | const struct filtab *ft; | |
6dbded74 | 439 | if (ac < 1) die(1, "syntax: {l,r,}filt:NAME:..."); |
50c74957 | 440 | f->next = 0; |
441 | f->p_from = from; | |
442 | f->p_to = to; | |
443 | f->state = 0; | |
6dbded74 | 444 | for (ff = &from->f; *ff; ff = &(*ff)->next); |
50c74957 | 445 | *ff = f; |
6dbded74 MW |
446 | for (ft = filtab; ft->name; ft++) |
447 | if (strcmp(av[0], ft->name) == 0) | |
448 | { ft->func(f, ac - 1, av + 1); return; } | |
50c74957 | 449 | die(1, "unknown filter `%s'", av[0]); |
450 | } | |
451 | ||
452 | /*----- Flooding ----------------------------------------------------------*/ | |
453 | ||
454 | typedef struct flood { | |
455 | peer *p; | |
456 | unsigned type; | |
457 | size_t sz; | |
458 | unsigned long t; | |
459 | sel_timer tm; | |
460 | } flood; | |
461 | ||
462 | static void setflood(flood *f); | |
463 | ||
464 | static void floodtimer(struct timeval *tv, void *vv) | |
465 | { | |
466 | flood *f = vv; | |
467 | octet buf[PKBUFSZ]; | |
468 | size_t sz; | |
469 | ||
470 | sz = RND(f->sz); | |
471 | sz += RND(f->sz); | |
472 | sz += RND(f->sz); | |
473 | sz += RND(f->sz); | |
474 | sz /= 2; | |
475 | ||
476 | rng->ops->fill(rng, buf, sz); | |
6dbded74 | 477 | if (f->type < 0x100) buf[0] = f->type; |
50c74957 | 478 | puts("flood packet"); |
479 | PASS(f->p->f, buf, sz); | |
480 | setflood(f); | |
481 | } | |
e04c2d50 | 482 | |
50c74957 | 483 | static void setflood(flood *f) |
484 | { | |
485 | struct timeval tv; | |
486 | gettimeofday(&tv, 0); | |
487 | TV_ADDL(&tv, &tv, 0, RND(f->t)); | |
488 | sel_addtimer(&sel, &f->tm, &tv, floodtimer, f); | |
489 | } | |
490 | ||
491 | static void doflood(peer *p, unsigned ac, char **av) | |
492 | { | |
493 | flood *f; | |
6dbded74 | 494 | if (ac > 3) die(1, "syntax: flood[:TYPE:MILLIS:SIZE]"); |
50c74957 | 495 | f = CREATE(flood); |
496 | f->p = p; | |
6dbded74 MW |
497 | if (ac > 0) f->type = strtoul(av[0], 0, 16); |
498 | else f->type = 0x100; | |
499 | if (ac > 1) f->t = atoi(av[1]); | |
500 | else f->t = 10; | |
501 | if (ac > 2) f->sz = atoi(av[2]); | |
502 | else f->sz = 128; | |
50c74957 | 503 | f->t *= 1000; |
504 | setflood(f); | |
505 | } | |
506 | ||
507 | /*----- Configuration commands --------------------------------------------*/ | |
508 | ||
509 | static void parse(char *p); | |
510 | ||
511 | static void addflood(unsigned ac, char **av) { | |
512 | doflood(&peers[0], ac, av); | |
513 | doflood(&peers[1], ac, av); | |
514 | } | |
515 | static void addlflood(unsigned ac, char **av) { | |
516 | doflood(&peers[0], ac, av); | |
517 | } | |
518 | static void addrflood(unsigned ac, char **av) { | |
519 | doflood(&peers[1], ac, av); | |
520 | } | |
521 | ||
522 | static void addfilter(unsigned ac, char **av) { | |
523 | dofilter(&peers[0], &peers[1], ac, av); | |
524 | dofilter(&peers[1], &peers[0], ac, av); | |
525 | } | |
526 | static void addlfilter(unsigned ac, char **av) { | |
527 | dofilter(&peers[0], &peers[1], ac, av); | |
528 | } | |
529 | static void addrfilter(unsigned ac, char **av) { | |
530 | dofilter(&peers[1], &peers[0], ac, av); | |
531 | } | |
532 | ||
533 | static void include(unsigned ac, char **av) | |
534 | { | |
535 | FILE *fp; | |
536 | dstr d = DSTR_INIT; | |
6dbded74 | 537 | if (!ac) die(1, "syntax: include:FILE:..."); |
50c74957 | 538 | while (*av) { |
539 | if ((fp = fopen(*av, "r")) == 0) | |
540 | die(1, "fopen `%s': %s", *av, strerror(errno)); | |
6dbded74 | 541 | while (dstr_putline(&d, fp) != EOF) { parse(d.buf); DRESET(&d); } |
50c74957 | 542 | fclose(fp); |
543 | av++; | |
544 | } | |
545 | } | |
546 | ||
547 | const struct cmdtab { | |
548 | const char *name; | |
549 | void (*func)(unsigned /*ac*/, char **/*av*/); | |
550 | } cmdtab[] = { | |
551 | { "peer", addpeer }, | |
552 | { "include", include }, | |
553 | { "filt", addfilter }, | |
554 | { "lfilt", addlfilter }, | |
555 | { "rfilt", addrfilter }, | |
556 | { "next", nextfork }, | |
557 | { "flood", addflood }, | |
558 | { "lflood", addlflood }, | |
559 | { "rflood", addrflood }, | |
560 | { 0, 0 } | |
561 | }; | |
562 | ||
563 | #define AVMAX 16 | |
564 | ||
565 | static void parse(char *p) | |
566 | { | |
567 | char *v[AVMAX]; | |
568 | unsigned c = 0; | |
569 | const struct cmdtab *ct; | |
570 | ||
571 | p = strtok(p, ":"); | |
6dbded74 | 572 | if (!p || *p == '#') return; |
50c74957 | 573 | do { |
574 | v[c++] = p; | |
575 | p = strtok(0, ":"); | |
576 | } while (p && c < AVMAX - 1); | |
577 | v[c] = 0; | |
578 | for (ct = cmdtab; ct->name; ct++) { | |
579 | if (strcmp(ct->name, v[0]) == 0) { | |
580 | ct->func(c - 1, v + 1); | |
581 | return; | |
582 | } | |
583 | } | |
584 | die(1, "unknown command `%s'", v[0]); | |
585 | } | |
586 | ||
587 | /*----- Main driver -------------------------------------------------------*/ | |
588 | ||
589 | static void version(FILE *fp) | |
f98df549 | 590 | { pquis(fp, "$, TrIPE version " VERSION "\n"); } |
50c74957 | 591 | |
592 | static void usage(FILE *fp) | |
f98df549 | 593 | { pquis(fp, "Usage: $ [-k KEYRING] DIRECTIVE...\n"); } |
50c74957 | 594 | |
595 | static void help(FILE *fp) | |
596 | { | |
597 | version(fp); | |
598 | putc('\n', fp); | |
599 | usage(fp); | |
2d752320 | 600 | fputs("\n\ |
3cdc3f3a | 601 | Options:\n\ |
602 | \n\ | |
603 | -h, --help Show this help text.\n\ | |
604 | -v, --version Show the version number.\n\ | |
605 | -u, --usage Show terse usage summary.\n\ | |
606 | \n\ | |
607 | -k, --keyring=FILE Fetch keys from FILE.\n\ | |
608 | \n\ | |
2d752320 | 609 | Directives:\n\ |
610 | peer:NAME:LOCAL-PORT:REMOTE-ADDR:REMOTE-PORT\n\ | |
611 | include:FILE\n\ | |
612 | {,l,r}filt:FILTER:ARGS:...\n\ | |
613 | next:TAG\n\ | |
614 | {,l,r}flood:TYPE:MILLIS:SIZE\n\ | |
615 | \n\ | |
616 | Filters:\n\ | |
617 | send\n\ | |
618 | fork:TAG\n\ | |
619 | delay:QLEN[:MILLIS:P-REPLAY]\n\ | |
a2e06ed5 | 620 | drop[:P-DROP]\n\ |
2d752320 | 621 | corrupt[:P-CORRUPT]\n", |
622 | fp); | |
50c74957 | 623 | } |
624 | ||
625 | int main(int argc, char *argv[]) | |
626 | { | |
627 | const char *kfname = "keyring.pub"; | |
628 | int i; | |
629 | unsigned f = 0; | |
9f90c1f6 MW |
630 | char buf[32]; |
631 | static octet zero[CHACHA_NONCESZ]; | |
50c74957 | 632 | |
633 | #define f_bogus 1u | |
634 | ||
635 | ego(argv[0]); | |
636 | for (;;) { | |
637 | static const struct option opt[] = { | |
638 | { "help", 0, 0, 'h' }, | |
639 | { "version", 0, 0, 'v' }, | |
640 | { "usage", 0, 0, 'u' }, | |
641 | { "keyring", OPTF_ARGREQ, 0, 'k' }, | |
642 | { 0, 0, 0, 0 } | |
643 | }; | |
6dbded74 | 644 | if ((i = mdwopt(argc, argv, "hvuk:", opt, 0, 0, 0)) < 0) break; |
50c74957 | 645 | switch (i) { |
6dbded74 MW |
646 | case 'h': help(stdout); exit(0); |
647 | case 'v': version(stdout); exit(0); | |
648 | case 'u': usage(stdout); exit(0); | |
649 | case 'k': kfname = optarg; break; | |
650 | default: f |= f_bogus; break; | |
50c74957 | 651 | } |
652 | } | |
6dbded74 MW |
653 | if (f & f_bogus) { usage(stderr); exit(1); } |
654 | ||
50c74957 | 655 | rand_noisesrc(RAND_GLOBAL, &noise_source); |
9f90c1f6 | 656 | rand_seed(RAND_GLOBAL, 256); |
50c74957 | 657 | rand_get(RAND_GLOBAL, buf, sizeof(buf)); |
9f90c1f6 | 658 | rng = chacha20_rand(buf, sizeof(buf), zero); |
50c74957 | 659 | sel_init(&sel); |
660 | if (key_open(&keys, kfname, KOPEN_READ, key_moan, 0)) | |
661 | die(1, "couldn't open `%s': %s", kfname, strerror(errno)); | |
6dbded74 MW |
662 | for (i = optind; i < argc; i++) parse(argv[i]); |
663 | if (npeer != 2) die(1, "need two peers"); | |
c9cb7c0c MW |
664 | for (;;) { |
665 | if (sel_select(&sel) && errno != EINTR) | |
666 | die(1, "select failed: %s", strerror(errno)); | |
667 | } | |
50c74957 | 668 | |
669 | #undef f_bogus | |
670 | } | |
671 | ||
672 | /*----- That's all, folks -------------------------------------------------*/ |