chiark / gitweb /
Upgrade licence to GPLv3+.
[tripe] / uslip / uslip.c
... / ...
CommitLineData
1/* -*-c-*-
2 *
3 * A simple SLIP implementation drivable from the command-line
4 *
5 * (c) 2008 Straylight/Edgeware
6 */
7
8/*----- Licensing notice --------------------------------------------------*
9 *
10 * This file is part of Trivial IP Encryption (TrIPE).
11 *
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.
16 *
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.
21 *
22 * You should have received a copy of the GNU General Public License
23 * along with TrIPE. If not, see <https://www.gnu.org/licenses/>.
24 */
25
26/*----- Header files ------------------------------------------------------*/
27
28#include "config.h"
29
30#include <assert.h>
31#include <ctype.h>
32#include <errno.h>
33#include <signal.h>
34#include <stdio.h>
35#include <stdlib.h>
36#include <string.h>
37
38#include <sys/types.h>
39#include <sys/time.h>
40#include <unistd.h>
41
42#include <sys/socket.h>
43#include <sys/un.h>
44#include <netinet/in.h>
45#include <arpa/inet.h>
46#include <netdb.h>
47
48#include <mLib/alloc.h>
49#include <mLib/bits.h>
50#include <mLib/conn.h>
51#include <mLib/dstr.h>
52#include <mLib/fdflags.h>
53#include <mLib/mdwopt.h>
54#include <mLib/quis.h>
55#include <mLib/report.h>
56#include <mLib/sel.h>
57#include <mLib/sig.h>
58#include <mLib/sub.h>
59#include <mLib/tv.h>
60
61#include "slip.h"
62
63#undef sun
64
65/*----- Data structures ---------------------------------------------------*/
66
67typedef struct pkq_node {
68 struct pkq_node *next;
69 unsigned char *buf;
70 size_t n, sz;
71} pkq_node;
72
73typedef struct pkq {
74 pkq_node *head, **tail;
75} pkq;
76
77enum { START, OK, ESC, BAD, SYNC1, SYNC2 };
78
79typedef struct client {
80 sel_file f;
81 dstr d;
82 int mode;
83} client;
84
85typedef struct gobbler {
86 sel_file f;
87 void (*done)(struct gobbler *, int, void *);
88 void *p;
89} gobbler;
90
91typedef struct dribbler {
92 sel_file f;
93 pkq q;
94 void (*done)(struct dribbler *, int, void *);
95 void *p;
96} dribbler;
97
98typedef struct waiter {
99 struct waiter *next;
100 int fd;
101 gobbler *g;
102} waiter;
103
104/*----- Static variables --------------------------------------------------*/
105
106static pkq q_in;
107static dribbler *dribble_out;
108static dstr slipbuf = DSTR_INIT;
109static int slipstate = SYNC1;
110static sel_file slip_in, listener;
111static sel_state sel;
112static unsigned reasons;
113static waiter *wait_head, **wait_tail = &wait_head;
114static unsigned char buf[16384];
115static const char *name;
116
117/*----- Utilities ---------------------------------------------------------*/
118
119static void socketaddr(struct sockaddr_un *sun, size_t *sz)
120{
121 size_t n = strlen(name) + 1;
122 if (n + offsetof(struct sockaddr_un, sun_path) > sizeof(*sun))
123 die(EXIT_FAILURE, "name too long: `%s'", name);
124 sun->sun_family = AF_UNIX;
125 memcpy(sun->sun_path, name, n);
126 if (sz)
127 *sz = n + offsetof(struct sockaddr_un, sun_path);
128}
129
130/*------ Packet queue -----------------------------------------------------*
131 *
132 * A packet queue contains a sequence of octet strings. Packets can be added
133 * to the end and read off the front.
134 */
135
136static void initqueue(pkq *q) { q->head = 0; q->tail = &q->head; }
137
138static pkq_node *make_pkqnode(const void *p, size_t n)
139{
140 pkq_node *pn;
141
142 if (!n) return (0);
143 pn = CREATE(pkq_node);
144 pn->next = 0;
145 pn->buf = xmalloc(n);
146 if (p) memcpy(pn->buf, p, n);
147 pn->sz = n;
148 pn->n = 0;
149 return (pn);
150}
151
152static int enqueue(pkq *q, pkq_node *pn)
153{
154 int rc = 0;
155
156 if (!pn) return (0);
157 rc = !q->head;
158 pn->next = 0;
159 *q->tail = pn;
160 q->tail = &pn->next;
161 return (rc);
162}
163
164static void destroy_pkqnode(pkq_node *pn) { xfree(pn->buf); DESTROY(pn); }
165
166static int dequeue(pkq *q, int freep)
167{
168 pkq_node *pn = q->head;
169 assert(pn);
170 q->head = pn->next;
171 if (freep)
172 destroy_pkqnode(pn);
173 if (!q->head) {
174 q->tail = &q->head;
175 return (1);
176 }
177 return (0);
178}
179
180static void destroy_pkq(pkq *q)
181{
182 pkq_node *pn, *pnn;
183
184 for (pn = q->head; pn; pn = pnn) {
185 pnn = pn->next;
186 destroy_pkqnode(pn);
187 }
188 q->head = 0; q->tail = &q->head;
189}
190
191/*----- Gobblers ----------------------------------------------------------*
192 *
193 * A gobbler just eats everything it sees on its input descriptor.
194 * Eventually, when it sees end-of-file, it closes the input descriptor,
195 * calls a user-supplied calback function, and quits.
196 */
197
198static void close_gobbler(gobbler *g)
199 { if (g->f.fd != -1) { sel_rmfile(&g->f); close(g->f.fd); g->f.fd = -1; } }
200
201static void destroy_gobbler(gobbler *g) { close_gobbler(g); DESTROY(g); }
202
203static void do_gobble_in(int fd, unsigned mode, void *p)
204{
205 gobbler *g = p;
206 ssize_t n;
207
208 for (;;) {
209 n = read(fd, buf, sizeof(buf));
210 if (n < 0) {
211 if (errno == EAGAIN || errno == EWOULDBLOCK || errno == EINTR)
212 break;
213 else {
214 moan("read (gobble): %s", strerror(errno));
215 if (g->done) g->done(g, errno, g->p);
216 close_gobbler(g);
217 break;
218 }
219 } else if (n == 0) {
220 if (g->done) g->done(g, 0, g->p);
221 close_gobbler(g);
222 break;
223 }
224 }
225}
226
227static gobbler *make_gobbler(int fd,
228 void (*done)(gobbler *, int, void *),
229 void *p)
230{
231 gobbler *g;
232
233 g = CREATE(gobbler);
234 g->done = done;
235 g->p = p;
236 sel_initfile(&sel, &g->f, fd, SEL_READ, do_gobble_in, g);
237 sel_addfile(&g->f);
238 do_gobble_in(fd, SEL_READ, g);
239 return (g);
240}
241
242/*----- Dribbler ----------------------------------------------------------*
243 *
244 * A dribbler hands out data from a packet queue to a file descriptor. It
245 * makes no attempt to preserve the record boundaries inherent in the packet
246 * queue structure. If the dribbler reaches the end of its queue, it invokes
247 * a user-supplied `done' function and stops selecting its output descriptor
248 * for writing.
249 */
250
251static void cripple_dribbler(dribbler *d) { close(d->f.fd); d->f.fd = -1; }
252
253static void destroy_dribbler(dribbler *d)
254 { cripple_dribbler(d); DESTROY(d); }
255
256static void dribble_done(dribbler *d, int err)
257{
258 if (d->q.head) {
259 sel_rmfile(&d->f);
260 destroy_pkq(&d->q);
261 }
262 d->done(d, err, d->p);
263}
264
265static void do_dribble_out(int fd, unsigned mode, void *p)
266{
267 dribbler *d = p;
268 ssize_t n;
269 pkq_node *pn;
270
271 for (;;) {
272 pn = d->q.head;
273 n = write(fd, pn->buf + pn->n, pn->sz - pn->n);
274 if (n < 0) {
275 if (errno == EAGAIN || errno == EWOULDBLOCK || errno == EINTR)
276 break;
277 else {
278 dribble_done(d, errno);
279 break;
280 }
281 }
282 pn->n += n;
283 if (pn->n == pn->sz && dequeue(&d->q, 1)) {
284 sel_rmfile(&d->f);
285 dribble_done(d, 0);
286 break;
287 }
288 }
289}
290
291static int enqueue_dribble(dribbler *d, pkq_node *pn)
292{
293 if (d->f.fd == -1) {
294 destroy_pkqnode(pn);
295 return (0);
296 }
297 if (enqueue(&d->q, pn)) {
298 sel_addfile(&d->f);
299 do_dribble_out(d->f.fd, SEL_WRITE, d);
300 return (1);
301 }
302 return (0);
303}
304
305static dribbler *make_dribbler(int fd,
306 void (*done)(dribbler *, int, void *),
307 void *p)
308{
309 dribbler *d = CREATE(dribbler);
310 sel_initfile(&sel, &d->f, fd, SEL_WRITE, do_dribble_out, d);
311 initqueue(&d->q);
312 d->done = done;
313 d->p = p;
314 return (d);
315}
316
317/*----- Clients -----------------------------------------------------------*/
318
319static void done_client_dribble(dribbler *d, int err, void *p)
320{
321 if (err)
322 moan("write (client): %s", strerror(err));
323 destroy_gobbler(p);
324 destroy_dribbler(d);
325 reasons--;
326}
327
328static void dequeue_to_waiter(void)
329{
330 waiter *w;
331 dribbler *d;
332 pkq_node *pn;
333
334 while (q_in.head && wait_head) {
335 w = wait_head;
336 wait_head = w->next;
337 if (!wait_head)
338 wait_tail = &wait_head;
339 d = make_dribbler(w->fd, done_client_dribble, w->g);
340 DESTROY(w);
341 pn = q_in.head;
342 if (dequeue(&q_in, 0))
343 reasons--;
344 enqueue_dribble(d, pn);
345 }
346}
347
348static void destroy_client(client *c)
349{
350 sel_rmfile(&c->f);
351 close(c->f.fd);
352 dstr_destroy(&c->d);
353 reasons--;
354 DESTROY(c);
355}
356
357static void do_client_in(int fd, unsigned mode, void *p)
358{
359 client *c = p;
360 ssize_t n, i, i0;
361 waiter *w;
362
363 /* --- Attention --- *
364 *
365 * The queue for outbound packets is SLIP-encoded; we need to encode it
366 * here. The queue for inbound packets is raw.
367 */
368
369 for (;;) {
370 n = read(fd, buf, sizeof(buf));
371 i0 = 0;
372 if (n < 0) {
373 if (errno == EAGAIN || errno == EWOULDBLOCK || errno == EINTR)
374 break;
375 else {
376 moan("read (client): %s", strerror(errno));
377 destroy_client(c);
378 return;
379 }
380 } else if (n == 0) {
381 if (c->mode == '>') {
382 DPUTC(&c->d, SL_END);
383 if (enqueue_dribble(dribble_out, make_pkqnode(c->d.buf, c->d.len)))
384 reasons++;
385 }
386 destroy_client(c);
387 return;
388 }
389 if (c->mode == '?') {
390 switch (buf[0]) {
391 case '>':
392 i0 = 1;
393 c->mode = '>';
394 break;
395 case '<':
396 w = CREATE(waiter);
397 w->g = make_gobbler(fd, 0, 0);
398 w->next = 0;
399 w->fd = fd;
400 *wait_tail = w;
401 wait_tail = &w->next;
402 sel_rmfile(&c->f);
403 DESTROY(c);
404 dequeue_to_waiter();
405 return;
406 default:
407 moan("bad client mode `%c'", buf[0]);
408 destroy_client(c);
409 return;
410 }
411 }
412 for (i = i0; i < n; i++) {
413 switch (buf[i]) {
414 case SL_ESC:
415 DPUTC(&c->d, SL_ESC);
416 DPUTC(&c->d, SL_ESCESC);
417 break;
418 case SL_END:
419 DPUTC(&c->d, SL_ESC);
420 DPUTC(&c->d, SL_ESCEND);
421 break;
422 default:
423 DPUTC(&c->d, buf[i]);
424 break;
425 }
426 }
427 }
428}
429
430static void do_accept(int fd, unsigned mode, void *hunoz)
431{
432 client *c;
433 struct sockaddr_un sun;
434 socklen_t n = sizeof(sun);
435 int nfd;
436
437 if ((nfd = accept(fd, (struct sockaddr *)&sun, &n)) < 0) {
438 if (errno == EAGAIN || errno == EWOULDBLOCK || errno == EINTR)
439 return;
440 else
441 die(EXIT_FAILURE, "accept: %s", strerror(errno));
442 }
443 c = CREATE(client);
444 c->mode = '?';
445 dstr_create(&c->d);
446 fdflags(nfd, O_NONBLOCK, O_NONBLOCK, 0, 0);
447 sel_initfile(&sel, &c->f, nfd, SEL_READ, do_client_in, c);
448 sel_addfile(&c->f);
449 reasons++;
450}
451
452/*----- Main daemon -------------------------------------------------------*/
453
454static void done_slip_dribble(dribbler *d, int err, void *hunoz)
455{
456 if (!err)
457 reasons--;
458 else if (err != EPIPE)
459 die(EXIT_FAILURE, "write (slip): %s", strerror(errno));
460 else
461 cripple_dribbler(d);
462}
463
464static void close_slip(int fd)
465{
466 switch (slipstate) {
467 case SYNC1: case SYNC2: case START: case BAD: break;
468 default: moan("eof found while processing packet (discarding)"); break;
469 }
470 close(fd); sel_rmfile(&slip_in);
471 reasons--;
472}
473
474static void do_slip_in(int fd, unsigned mode, void *hunoz)
475{
476 ssize_t i, n;
477
478 /* --- Attention --- *
479 *
480 * The queue for inbound packets contains raw data; we need to decode it
481 * here. The queue for outbound packets is SLIP-encoded.
482 *
483 * TrIPE sends two empty packets on start-up, in order to resynchronize the
484 * target. We don't need this and it messes us up.
485 */
486
487 for (;;) {
488 n = read(fd, buf, sizeof(buf));
489 if (n == 0) {
490 close_slip(fd);
491 return;
492 } else if (n < 0) {
493 if (errno == EAGAIN || errno == EWOULDBLOCK || errno == EINTR)
494 break;
495 die(EXIT_FAILURE, "read (slip in): %s", strerror(errno));
496 }
497 for (i = 0; i < n; i++) {
498 switch (slipstate) {
499 case SYNC1:
500 switch (buf[i]) {
501 case SL_END:
502 slipstate = SYNC2;
503 break;
504 default:
505 goto start;
506 }
507 break;
508 case SYNC2:
509 switch (buf[i]) {
510 case SL_END:
511 slipstate = START;
512 break;
513 default:
514 goto start;
515 }
516 break;
517 case BAD:
518 switch (buf[i]) {
519 case SL_END:
520 DRESET(&slipbuf);
521 slipstate = OK;
522 break;
523 default:
524 break;
525 }
526 break;
527 case ESC:
528 switch (buf[i]) {
529 case SL_ESCEND:
530 DPUTC(&slipbuf, SL_END);
531 slipstate = OK;
532 break;
533 case SL_ESCESC:
534 DPUTC(&slipbuf, SL_ESC);
535 slipstate = OK;
536 break;
537 case SL_END:
538 moan("found escaped end byte (discard packet and resync");
539 DRESET(&slipbuf);
540 slipstate = OK;
541 break;
542 default:
543 moan("unexpected escape char 0x%02x", buf[i]);
544 slipstate = BAD;
545 break;
546 }
547 break;
548 case START:
549 case OK:
550 start:
551 switch (buf[i]) {
552 case SL_ESC:
553 slipstate = ESC;
554 break;
555 case SL_END:
556 if (enqueue(&q_in, make_pkqnode(slipbuf.buf, slipbuf.len)))
557 reasons++;
558 DRESET(&slipbuf);
559 dequeue_to_waiter();
560 slipstate = START;
561 break;
562 default:
563 DPUTC(&slipbuf, buf[i]);
564 slipstate = OK;
565 break;
566 }
567 break;
568 }
569 }
570 }
571}
572
573static void slip_term(int n, void *fdp)
574 { close_slip(*(int *)fdp); }
575
576static void slipif(void)
577{
578 int fd;
579 dstr d = DSTR_INIT;
580 struct sockaddr_un sun;
581 sig term;
582 size_t sz;
583
584 /* --- Make the socket --- */
585
586 if ((fd = socket(PF_UNIX, SOCK_STREAM, 0)) < 0)
587 die(EXIT_FAILURE, "socket: %s", strerror(errno));
588 socketaddr(&sun, &sz);
589 if (bind(fd, (struct sockaddr *)&sun, sz))
590 die(EXIT_FAILURE, "bind: %s", strerror(errno));
591 if (listen(fd, 5))
592 die(EXIT_FAILURE, "listen: %s", strerror(errno));
593
594 /* --- Set up listeners for things --- */
595
596 fdflags(fd, O_NONBLOCK, O_NONBLOCK, 0, 0);
597 sel_initfile(&sel, &listener, fd, SEL_READ, do_accept, 0);
598 sel_addfile(&listener);
599
600 fdflags(STDIN_FILENO, O_NONBLOCK, O_NONBLOCK, 0, 0);
601 fdflags(STDOUT_FILENO, O_NONBLOCK, O_NONBLOCK, 0, 0);
602 sel_initfile(&sel, &slip_in, STDIN_FILENO, SEL_READ, do_slip_in, 0);
603 dribble_out = make_dribbler(STDOUT_FILENO, done_slip_dribble, 0);
604 sel_addfile(&slip_in);
605
606 sig_init(&sel);
607 sig_add(&term, SIGTERM, slip_term, &fd);
608 sig_add(&term, SIGINT, slip_term, &fd);
609
610 initqueue(&q_in);
611 reasons++;
612
613 /* --- Write the interface name --- */
614
615 dstr_putf(&d, "%s-%s\n", QUIS, name);
616 if (enqueue_dribble(dribble_out, make_pkqnode(d.buf, d.len)))
617 reasons++;
618 dstr_destroy(&d);
619
620 /* --- Main loop --- */
621
622 while (reasons) {
623 if (sel_select(&sel))
624 die(EXIT_FAILURE, "select: %s", strerror(errno));
625 }
626
627 /* --- Done --- */
628
629 unlink(name);
630}
631
632/*----- Putting and getting -----------------------------------------------*/
633
634static int make_sock(int mode)
635{
636 struct sockaddr_un sun;
637 size_t sz;
638 int fd;
639 char ch;
640
641 if ((fd = socket(PF_UNIX, SOCK_STREAM, 0)) < 0)
642 die(EXIT_FAILURE, "socket: %s", strerror(errno));
643 socketaddr(&sun, &sz);
644 if (connect(fd, (struct sockaddr *)&sun, sz))
645 die(EXIT_FAILURE, "connect: %s", strerror(errno));
646 ch = mode;
647 if (write(fd, &ch, 1) < 0)
648 die(EXIT_FAILURE, "write (mode): %s", strerror(errno));
649 return (fd);
650}
651
652static void shovel(int from, int to)
653{
654 ssize_t n;
655 size_t sz;
656 unsigned char *p;
657
658 for (;;) {
659 n = read(from, buf, sizeof(buf));
660 if (n < 0) {
661 if (errno == EINTR)
662 continue;
663 else
664 die(EXIT_FAILURE, "read (shovel): %s", strerror(errno));
665 } else if (n == 0)
666 break;
667
668 sz = n;
669 p = buf;
670 while (sz) {
671 n = write(to, p, sz);
672 if (n < 0) {
673 if (errno == EINTR)
674 continue;
675 else
676 die(EXIT_FAILURE, "write (shovel): %s", strerror(errno));
677 }
678 p += n;
679 sz -= n;
680 }
681 }
682 close(from);
683 close(to);
684}
685
686static void put(void) { shovel(STDIN_FILENO, make_sock('>')); }
687static void get(void) { shovel(make_sock('<'), STDOUT_FILENO); }
688
689/*----- Flooding and sinking ----------------------------------------------*/
690
691/* --- Connection jobs --- */
692
693typedef struct conninfo {
694 struct conninfo *next;
695 conn c;
696} conninfo;
697
698#define MAXCONN 32
699static conninfo conns[MAXCONN], *freeconns;
700
701static void (*connhook)(int, conninfo *);
702
703static void connrecycle(conninfo *c) { c->next = freeconns; freeconns = c; }
704
705static void connerr(conninfo *c)
706{
707 if (errno == EAGAIN) connrecycle(c);
708 else die(EXIT_FAILURE, "connect: %s", strerror(errno));
709}
710
711static void connected(int fd, void *p)
712 { if (fd == -1) connerr(p); else connhook(fd, p); }
713
714static void conndoconnect(conninfo *c)
715{
716 int fd;
717 struct sockaddr_un sun;
718 size_t sz;
719
720 if ((fd = socket(PF_UNIX, SOCK_STREAM, 0)) < 0)
721 die(EXIT_FAILURE, "socket: %s", strerror(errno));
722 socketaddr(&sun, &sz);
723 if (conn_init(&c->c, &sel, fd, (struct sockaddr *)&sun, sz, connected, c))
724 connerr(c);
725}
726
727static int timerflag;
728
729static void conndrip(struct timeval *tv, void *hunoz)
730{
731 conninfo *c, *cc;
732
733 timerflag = 0;
734 while (freeconns) {
735 c = freeconns; freeconns = 0;
736 while (c) { cc = c->next; conndoconnect(c); c = cc; }
737 }
738}
739
740static void connloop(void (*connected)(int, conninfo *))
741{
742 int i;
743 conninfo **cc;
744 sel_timer t;
745 struct timeval tv;
746
747 connhook = connected;
748 for (i = 0, cc = &freeconns; i < MAXCONN; i++) {
749 *cc = &conns[i];
750 cc = &conns[i].next;
751 }
752 *cc = 0;
753
754 for (;;) {
755 if (freeconns && !timerflag) {
756 gettimeofday(&tv, 0);
757 TV_ADDL(&tv, &tv, 0, 10000);
758 sel_addtimer(&sel, &t, &tv, conndrip, 0);
759 timerflag = 1;
760 }
761 if (sel_select(&sel))
762 die(EXIT_FAILURE, "select: %s", strerror(errno));
763 }
764}
765
766/* --- Sinking (glug glug) --- */
767
768static void close_sink(gobbler *g, int err, void *p)
769{
770 static char baton[4] = "/-\\|";
771 static int pos = 0;
772 static int count = 0;
773 static int state = '?';
774
775 conninfo *c = p;
776
777 if (!err) {
778 if (state == '?')
779 state = isatty(STDOUT_FILENO) ? 'y' : 'n';
780 if (state == 'y') {
781 if (count) count--;
782 else {
783 putchar(baton[pos]);
784 putchar('\b');
785 fflush(stdout);
786 pos++;
787 if (pos >= sizeof(baton)) pos = 0;
788 count = 128;
789 }
790 }
791 }
792 connrecycle(c);
793}
794
795static void sink_connected(int fd, conninfo *c)
796{
797 char dir = '<';
798
799 if (write(fd, &dir, 1) != 1) {
800 moan("write: %s (continuing)", strerror(errno));
801 close(fd);
802 connrecycle(c);
803 return;
804 }
805 make_gobbler(fd, close_sink, c);
806}
807
808static void sink(void) { connloop(sink_connected); }
809
810/* --- Flooding --- */
811
812static void close_flood(dribbler *d, int err, void *p)
813{
814 conninfo *c = p;
815
816 if (err) moan("write: %s (continuing)\n", strerror(errno));
817 destroy_dribbler(d);
818 connrecycle(c);
819}
820
821static void flood_connected(int fd, conninfo *c)
822{
823 static uint32 seq;
824
825 dribbler *d;
826 pkq_node *pn;
827 int i;
828
829#define FLOOD_PKSZ 1024
830
831 pn = make_pkqnode(0, 1 + FLOOD_PKSZ);
832 pn->buf[0] = '>';
833 STORE32(pn->buf + 1, seq);
834 for (i = 4; i < FLOOD_PKSZ; i++)
835 pn->buf[i + 1] = i & 0xff;
836 seq++;
837 d = make_dribbler(fd, close_flood, c);
838 enqueue_dribble(d, pn);
839}
840
841static void flood(void) { connloop(flood_connected); }
842
843/*----- Main code ---------------------------------------------------------*/
844
845static void usage(FILE *fp) { pquis(fp, "Usage: $ [-fgps] SOCKET\n"); }
846
847static void version(void)
848 { pquis(stdout, "$ (" PACKAGE " version " VERSION")\n"); }
849
850static void help(void)
851{
852 version();
853 fputc('\n', stdout);
854 usage(stdout);
855 puts("\n\
856With no options, provides a SLIP interface for TrIPE.\n\
857\n\
858Options:\n\
859 -f, --flood Send packets to TrIPE as fast as possible.\n\
860 -g, --get Receive packet from TrIPE and write to stdout.\n\
861 -p, --put Send packet on stdin to TrIPE.\n\
862 -s, --sink Slurp packets out of TrIPE and display progress.");
863}
864
865int main(int argc, char *argv[])
866{
867 int mode = 'd';
868 int i;
869
870 ego(argv[0]);
871 for (;;) {
872 const struct option opt[] = {
873 { "help", 0, 0, 'h' },
874 { "version", 0, 0, 'v' },
875 { "put", 0, 0, 'p' },
876 { "get", 0, 0, 'g' },
877 { "flood", 0, 0, 'f' },
878 { "sink", 0, 0, 's' },
879 { 0, 0, 0, 0 }
880 };
881 i = mdwopt(argc, argv, "hvpgfs", opt, 0, 0, 0);
882 if (i < 0)
883 break;
884 switch (i) {
885 case 'h': help(); return (0);
886 case 'v': version(); return (0);
887 case 'p': case 'g': case 's': case 'f': mode = i; break;
888 default: usage(stderr); exit(EXIT_FAILURE); break;
889 }
890 }
891 if (argc - optind != 1) { usage(stderr); exit(EXIT_FAILURE); }
892 name = argv[optind];
893 signal(SIGPIPE, SIG_IGN);
894 switch (mode) {
895 case 'd': slipif(); break;
896 case 'p': put(); break;
897 case 'g': get(); break;
898 case 'f': flood(); break;
899 case 's': sink(); break;
900 }
901 return (0);
902}
903
904/*----- That's all, folks -------------------------------------------------*/