server/peer.c, server/admin.c: Introduce `p_destroyall'.
[tripe] / server / peer.c
1 /* -*-c-*-
2 *
3 * Communication with the peer
4 *
5 * (c) 2001 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 "tripe.h"
29
30 /*----- Global state ------------------------------------------------------*/
31
32 udpsocket udpsock[NADDRFAM];
33
34 /*----- Static variables --------------------------------------------------*/
35
36 static sym_table byname;
37 static addrmap byaddr;
38 static unsigned nmobile;
39
40 /*----- Tunnel table ------------------------------------------------------*/
41
42 const tunnel_ops *tunnels[] = {
43 #ifdef TUN_LINUX
44 &tun_linux,
45 #endif
46 #ifdef TUN_BSD
47 &tun_bsd,
48 #endif
49 #ifdef TUN_UNET
50 &tun_unet,
51 #endif
52 &tun_slip,
53 0
54 }, *tun_default;
55
56 /*----- Main code ---------------------------------------------------------*/
57
58 /* --- @p_pingtype@ --- *
59 *
60 * Arguments: @unsigned msg@ = message type
61 *
62 * Returns: String to describe the message.
63 */
64
65 static const char *p_pingtype(unsigned msg)
66 {
67 switch (msg & MSG_TYPEMASK) {
68 case MISC_PING:
69 case MISC_PONG:
70 return "transport-ping";
71 case MISC_EPING:
72 case MISC_EPONG:
73 return "encrypted-ping";
74 default:
75 abort();
76 }
77 }
78
79 /* --- @p_ponged@ --- *
80 *
81 * Arguments: @peer *p@ = peer packet arrived from
82 * @unsigned msg@ = message type
83 * @buf *b@ = buffer containing payload
84 *
85 * Returns: ---
86 *
87 * Use: Processes a ping response.
88 */
89
90 static void p_ponged(peer *p, unsigned msg, buf *b)
91 {
92 uint32 id;
93 const octet *magic;
94 ping *pg;
95
96 IF_TRACING(T_PEER, {
97 trace(T_PEER, "peer: received %s reply from %s",
98 p_pingtype(msg), p->spec.name);
99 trace_block(T_PACKET, "peer: ping contents", BBASE(b), BSZ(b));
100 })
101
102 if (buf_getu32(b, &id) ||
103 (magic = buf_get(b, sizeof(pg->magic))) == 0 ||
104 BLEFT(b)) {
105 a_warn("PEER", "?PEER", p, "malformed-%s", p_pingtype(msg), A_END);
106 return;
107 }
108
109 for (pg = p->pings; pg; pg = pg->next) {
110 if (pg->id == id)
111 goto found;
112 }
113 a_warn("PEER",
114 "?PEER", p,
115 "unexpected-%s", p_pingtype(msg),
116 "0x%08lx", (unsigned long)id,
117 A_END);
118 return;
119
120 found:
121 if (memcmp(magic, pg->magic, sizeof(pg->magic)) != 0) {
122 a_warn("PEER", "?PEER", p, "corrupt-%s", p_pingtype(msg), A_END);
123 return;
124 }
125 p_pingdone(pg, PING_OK);
126 }
127
128 /* --- @p_rxupdstats@ --- *
129 *
130 * Arguments: @peer *p@ = peer to update
131 * @size_t n@ = size of incoming packet
132 *
133 * Returns: ---
134 *
135 * Use: Updates the peer's incoming packet statistics.
136 */
137
138 static void p_rxupdstats(peer *p, size_t n)
139 {
140 p->st.t_last = time(0);
141 p->st.n_in++;
142 p->st.sz_in += n;
143 }
144
145 /* --- @p_encrypt@ --- *
146 *
147 * Arguments: @peer *p@ = peer to encrypt message to
148 * @int ty@ message type to send
149 * @buf *bin, *bout@ = input and output buffers
150 *
151 * Returns: ---
152 *
153 * Use: Convenience function for packet encryption. Forces
154 * renegotiation when necessary. Check for the output buffer
155 * being broken to find out whether the encryption was
156 * successful.
157 */
158
159 static int p_encrypt(peer *p, int ty, buf *bin, buf *bout)
160 {
161 int err = ksl_encrypt(&p->ks, ty, bin, bout);
162
163 if (err == KSERR_REGEN) {
164 kx_start(&p->kx, 1);
165 err = 0;
166 }
167 if (!BOK(bout))
168 err = -1;
169 return (err);
170 }
171
172 /* --- @p_updateaddr@ --- *
173 *
174 * Arguments: @peer *p@ = pointer to peer block
175 * @const addr *a@ = address to associate with this peer
176 *
177 * Returns: Zero if the address was changed; @+1@ if it was already
178 * right.
179 *
180 * Use: Updates our idea of @p@'s address.
181 */
182
183 int p_updateaddr(peer *p, const addr *a)
184 {
185 peer *q;
186 peer_byaddr *pa, *qa;
187 int ix;
188 unsigned f;
189
190 /* --- Figure out how to proceed --- *
191 *
192 * If this address already belongs to a different peer, then swap the
193 * addresses over. This doesn't leave the displaced peer in an especially
194 * good state, but it ought to get sorted out soon enough.
195 */
196
197 pa = am_find(&byaddr, a, sizeof(peer_byaddr), &f);
198 if (f && pa->p == p)
199 return (+1);
200 else if (!f) {
201 T( trace(T_PEER, "peer: updating address for `%s'", p_name(p)); )
202 am_remove(&byaddr, p->byaddr);
203 p->byaddr = pa; p->spec.sa = *a; pa->p = p;
204 p->afix = afix(p->spec.sa.sa.sa_family); assert(p->afix >= 0);
205 a_notify("NEWADDR", "?PEER", p, "?ADDR", a, A_END);
206 return (0);
207 } else {
208 q = pa->p; qa = p->byaddr;
209 T( trace(T_PEER, "peer: swapping addresses for `%s' and `%s'",
210 p_name(p), p_name(q)); )
211 q->byaddr = qa; qa->p = q; q->spec.sa = p->spec.sa;
212 p->byaddr = pa; pa->p = p; p->spec.sa = *a;
213 ix = p->afix; p->afix = q->afix; q->afix = ix;
214 a_notify("NEWADDR", "?PEER", p, "?ADDR", a, A_END);
215 a_notify("NEWADDR", "?PEER", q, "?ADDR", &q->spec.sa, A_END);
216 return (0);
217 }
218 }
219
220 /* --- @p_decrypt@ --- *
221 *
222 * Arguments: @peer **pp@ = pointer to peer to decrypt message from
223 * @addr *a@ = address the packet arrived on
224 * @size_t n@ = size of original incoming packet
225 * @int ty@ = message type to expect
226 * @buf *bin, *bout@ = input and output buffers
227 *
228 * Returns: Zero on success; nonzero on error.
229 *
230 * Use: Convenience function for packet decryption. Reports errors
231 * and updates statistics appropriately.
232 *
233 * If @*pp@ is null on entry and there are mobile peers then we
234 * see if any of them can decrypt the packet. If so, we record
235 * @*a@ as the peer's new address and send a notification.
236 */
237
238 static int p_decrypt(peer **pp, addr *a, size_t n,
239 int ty, buf *bin, buf *bout)
240 {
241 peer *p, *q;
242 int err = KSERR_DECRYPT;
243
244 /* --- If we have a match on the source address then try that first --- */
245
246 q = *pp;
247 if (q) {
248 T( trace(T_PEER, "peer: decrypting packet from known peer `%s'",
249 p_name(q)); )
250 if ((err = ksl_decrypt(&q->ks, ty, bin, bout)) != KSERR_DECRYPT ||
251 !(q->spec.f & PSF_MOBILE) || nmobile == 1) {
252 p = q;
253 goto match;
254 }
255 T( trace(T_PEER, "peer: failed to decrypt: try other mobile peers..."); )
256 } else if (nmobile)
257 T( trace(T_PEER, "peer: unknown source: trying mobile peers...") );
258 else {
259 p = 0;
260 goto searched;
261 }
262
263 /* --- See whether any mobile peer is interested --- */
264
265 p = 0;
266 FOREACH_PEER(qq, {
267 if (qq == q || !(qq->spec.f & PSF_MOBILE)) continue;
268 if ((err = ksl_decrypt(&qq->ks, ty, bin, bout)) == KSERR_DECRYPT) {
269 T( trace(T_PEER, "peer: peer `%s' failed to decrypt",
270 p_name(qq)); )
271 continue;
272 } else {
273 p = qq;
274 IF_TRACING(T_PEER, {
275 if (!err)
276 trace(T_PEER, "peer: peer `%s' reports success", p_name(qq));
277 else {
278 trace(T_PEER, "peer: peer `%s' reports decryption error %d",
279 p_name(qq), err);
280 }
281 })
282 break;
283 }
284 });
285
286 /* --- We've searched the mobile peers --- */
287
288 searched:
289 if (!p) {
290 if (!q)
291 a_warn("PEER", "-", "unexpected-source", "?ADDR", a, A_END);
292 else {
293 a_warn("PEER", "?PEER", p, "decrypt-failed",
294 "error-code", "%d", err, A_END);
295 p_rxupdstats(q, n);
296 }
297 return (-1);
298 }
299
300 /* --- We found one that accepted, so update the peer's address --- */
301
302 if (!err) {
303 *pp = p;
304 p_updateaddr(p, a);
305 }
306
307 match:
308 p_rxupdstats(p, n);
309 if (err) {
310 if (p) p->st.n_reject++;
311 a_warn("PEER", "?PEER", p, "decrypt-failed",
312 "error-code", "%d", err, A_END);
313 return (-1);
314 }
315 if (!BOK(bout))
316 return (-1);
317 return (0);
318 }
319
320 /* --- @p_read@ --- *
321 *
322 * Arguments: @int fd@ = file descriptor to read from
323 * @unsigned mode@ = what happened
324 * @void *v@ = an uninteresting pointer
325 *
326 * Returns: ---
327 *
328 * Use: Reads a packet from somewhere.
329 */
330
331 static void p_read(int fd, unsigned mode, void *v)
332 {
333 peer *p = 0;
334 addr a;
335 socklen_t sz;
336 ssize_t n;
337 int ch;
338 buf b, bb;
339 #ifndef NTRACE
340 int ix = -1;
341 char name[NI_MAXHOST], svc[NI_MAXSERV];
342 #endif
343
344 /* --- Read the data --- */
345
346 QUICKRAND;
347 sz = sizeof(addr);
348 n = recvfrom(fd, buf_i, sizeof(buf_i), 0, &a.sa, &sz);
349 if (n < 0) {
350 a_warn("PEER", "-", "socket-read-error", "?ERRNO", A_END);
351 return;
352 }
353 IF_TRACING(T_PEER, {
354 ix = afix(a.sa.sa_family);
355 getnameinfo(&a.sa, sz, name, sizeof(name), svc, sizeof(svc),
356 NI_NUMERICHOST | NI_NUMERICSERV);
357 })
358
359 /* --- If the packet is a greeting, don't check peers --- */
360
361 if (n && buf_i[0] == (MSG_MISC | MISC_GREET)) {
362 IF_TRACING(T_PEER, {
363 trace(T_PEER, "peer: greeting received from %s %s %s",
364 aftab[ix].name, name, svc);
365 trace_block(T_PACKET, "peer: greeting contents", buf_i, n);
366 })
367 buf_init(&b, buf_i, n);
368 buf_getbyte(&b);
369 if (c_check(0, 0, &b) || BLEFT(&b)) {
370 a_warn("PEER", "-", "invalid-greeting", A_END);
371 return;
372 }
373 a_notify("GREET",
374 "?B64", buf_i + 1, (size_t)(n - 1),
375 "?ADDR", &a,
376 A_END);
377 return;
378 }
379
380 /* --- Find the appropriate peer --- *
381 *
382 * At this stage, don't worry too much about whether we actually found it.
383 */
384
385 p = p_findbyaddr(&a);
386
387 IF_TRACING(T_PEER, {
388 if (p) {
389 trace(T_PEER,
390 "peer: packet received from `%s' from address %s %s %s",
391 p_name(p), aftab[ix].name, name, svc);
392 } else {
393 trace(T_PEER, "peer: packet received from unknown address %s %s %s",
394 aftab[ix].name, name, svc);
395 }
396 trace_block(T_PACKET, "peer: packet contents", buf_i, n);
397 })
398
399 /* --- Pick the packet apart --- */
400
401 buf_init(&b, buf_i, n);
402 if ((ch = buf_getbyte(&b)) < 0) {
403 a_warn("PEER", "?PEER", p, "bad-packet", "no-type", A_END);
404 return;
405 }
406 switch (ch & MSG_CATMASK) {
407 case MSG_PACKET:
408 if (ch & MSG_TYPEMASK) {
409 a_warn("PEER",
410 "?PEER", p,
411 "bad-packet",
412 "unknown-type", "0x%02x", ch,
413 A_END);
414 if (p) p->st.n_reject++;
415 return;
416 }
417 buf_init(&bb, buf_o, sizeof(buf_o));
418 if (p_decrypt(&p, &a, n, MSG_PACKET, &b, &bb))
419 return;
420 if (BOK(&bb)) {
421 p->st.n_ipin++;
422 p->st.sz_ipin += BSZ(&b);
423 p->t->ops->inject(p->t, &bb);
424 } else {
425 p->st.n_reject++;
426 a_warn("PEER", "?PEER", p, "packet-build-failed", A_END);
427 }
428 break;
429 case MSG_KEYEXCH:
430 if (p) p_rxupdstats(p, n);
431 if (kx_message(p ? &p->kx : 0, &a, ch & MSG_TYPEMASK, &b)) goto unexp;
432 break;
433 case MSG_MISC:
434 switch (ch & MSG_TYPEMASK) {
435 case MISC_NOP:
436 if (!p) goto unexp;
437 p_rxupdstats(p, n);
438 T( trace(T_PEER, "peer: received NOP packet"); )
439 break;
440 case MISC_PING:
441 if (!p) goto unexp;
442 p_rxupdstats(p, n);
443 buf_put(p_txstart(p, MSG_MISC | MISC_PONG), BCUR(&b), BLEFT(&b));
444 p_txend(p);
445 break;
446 case MISC_PONG:
447 if (!p) goto unexp;
448 p_rxupdstats(p, n);
449 p_ponged(p, MISC_PONG, &b);
450 break;
451 case MISC_EPING:
452 buf_init(&bb, buf_t, sizeof(buf_t));
453 if (p_decrypt(&p, &a, n, ch, &b, &bb))
454 return;
455 if (BOK(&bb)) {
456 buf_flip(&bb);
457 p_encrypt(p, MSG_MISC | MISC_EPONG, &bb,
458 p_txstart(p, MSG_MISC | MISC_EPONG));
459 p_txend(p);
460 }
461 break;
462 case MISC_EPONG:
463 buf_init(&bb, buf_t, sizeof(buf_t));
464 if (p_decrypt(&p, &a, n, ch, &b, &bb))
465 return;
466 if (BOK(&bb)) {
467 buf_flip(&bb);
468 p_ponged(p, MISC_EPONG, &bb);
469 }
470 break;
471 case MISC_BYE:
472 buf_init(&bb, buf_t, sizeof(buf_t));
473 if (p_decrypt(&p, &a, n, ch, &b, &bb)) return;
474 if (!(p->spec.f&PSF_EPHEM)) return;
475 if (BOK(&bb)) {
476 buf_flip(&bb);
477 if (BSZ(&bb)) return;
478 p_destroy(p, 0);
479 }
480 break;
481 }
482 break;
483 default:
484 if (p) p->st.n_reject++;
485 a_warn("PEER",
486 "?PEER", p,
487 "bad-packet",
488 "unknown-category", "0x%02x", ch,
489 A_END);
490 break;
491 unexp:
492 a_warn("PEER", "-", "unexpected-source", "?ADDR", &a, A_END);
493 break;
494 }
495 }
496
497 /* --- @p_txstart@ --- *
498 *
499 * Arguments: @peer *p@ = pointer to peer block
500 * @unsigned msg@ = message type code
501 *
502 * Returns: A pointer to a buffer to write to.
503 *
504 * Use: Starts sending to a peer. Only one send can happen at a
505 * time.
506 */
507
508 buf *p_txstart(peer *p, unsigned msg)
509 {
510 buf_init(&p->b, buf_o, sizeof(buf_o));
511 buf_putbyte(&p->b, msg);
512 return (&p->b);
513 }
514
515 /* --- @p_txaddr@ --- *
516 *
517 * Arguments: @const addr *a@ = recipient address
518 * @const void *p@ = pointer to packet to send
519 * @size_t sz@ = length of packet
520 *
521 * Returns: Zero if successful, nonzero on error.
522 *
523 * Use: Sends a packet to an address which (possibly) isn't a current
524 * peer.
525 */
526
527 int p_txaddr(const addr *a, const void *p, size_t sz)
528 {
529 socklen_t sasz = addrsz(a);
530 int i;
531
532 if ((i = afix(a->sa.sa_family)) < 0) {
533 a_warn("PEER", "?ADDR", a, "disabled-address-family", A_END);
534 return (-1);
535 }
536 IF_TRACING(T_PEER, trace_block(T_PACKET, "peer: sending packet", p, sz); )
537 if (sendto(udpsock[i].sf.fd, p, sz, 0, &a->sa, sasz) < 0) {
538 a_warn("PEER", "?ADDR", a, "socket-write-error", "?ERRNO", A_END);
539 return (-1);
540 }
541 return (0);
542 }
543
544 /* --- @p_txend@ --- *
545 *
546 * Arguments: @peer *p@ = pointer to peer block
547 *
548 * Returns: ---
549 *
550 * Use: Sends a packet to the peer.
551 */
552
553 static void p_setkatimer(peer *);
554
555 static int p_dotxend(peer *p)
556 {
557 socklen_t sasz = addrsz(&p->spec.sa);
558
559 if (!BOK(&p->b)) {
560 a_warn("PEER", "?PEER", p, "packet-build-failed", A_END);
561 return (0);
562 }
563 IF_TRACING(T_PEER, trace_block(T_PACKET, "peer: sending packet",
564 BBASE(&p->b), BLEN(&p->b)); )
565 if (sendto(udpsock[p->afix].sf.fd, BBASE(&p->b), BLEN(&p->b),
566 0, &p->spec.sa.sa, sasz) < 0) {
567 a_warn("PEER", "?PEER", p, "socket-write-error", "?ERRNO", A_END);
568 return (0);
569 } else {
570 p->st.n_out++;
571 p->st.sz_out += BLEN(&p->b);
572 return (1);
573 }
574 }
575
576 void p_txend(peer *p)
577 {
578 if (p_dotxend(p) && p->spec.t_ka) {
579 sel_rmtimer(&p->tka);
580 p_setkatimer(p);
581 }
582 }
583
584 /* --- @p_pingwrite@ --- *
585 *
586 * Arguments: @ping *p@ = ping structure
587 * @buf *b@ = buffer to write in
588 *
589 * Returns: ---
590 *
591 * Use: Fills in a ping structure and writes the packet payload.
592 */
593
594 static void p_pingwrite(ping *p, buf *b)
595 {
596 static uint32 seq = 0;
597
598 p->id = U32(seq++);
599 GR_FILL(&rand_global, p->magic, sizeof(p->magic));
600 buf_putu32(b, p->id);
601 buf_put(b, p->magic, sizeof(p->magic));
602 }
603
604 /* --- @p_pingdone@ --- *
605 *
606 * Arguments: @ping *p@ = ping structure
607 * @int rc@ = return code to pass on
608 *
609 * Returns: ---
610 *
611 * Use: Disposes of a ping structure, maybe sending a notification.
612 */
613
614 void p_pingdone(ping *p, int rc)
615 {
616 if (p->prev) p->prev->next = p->next;
617 else p->p->pings = p->next;
618 if (p->next) p->next->prev = p->prev;
619 if (rc != PING_TIMEOUT) sel_rmtimer(&p->t);
620 T( trace(T_PEER, "peer: ping 0x%08lx done (rc = %d)",
621 (unsigned long)p->id, rc); )
622 if (rc >= 0) p->func(rc, p->arg);
623 }
624
625 /* --- @p_pingtimeout@ --- *
626 *
627 * Arguments: @struct timeval *now@ = the time now
628 * @void *pv@ = pointer to ping block
629 *
630 * Returns: ---
631 *
632 * Use: Called when a ping times out.
633 */
634
635 static void p_pingtimeout(struct timeval *now, void *pv)
636 {
637 ping *p = pv;
638
639 T( trace(T_PEER, "peer: ping 0x%08lx timed out", (unsigned long)p->id); )
640 p_pingdone(p, PING_TIMEOUT);
641 }
642
643 /* --- @p_pingsend@ --- *
644 *
645 * Arguments: @peer *p@ = destination peer
646 * @ping *pg@ = structure to fill in
647 * @unsigned type@ = message type
648 * @unsigned long timeout@ = how long to wait before giving up
649 * @void (*func)(int, void *)@ = callback function
650 * @void *arg@ = argument for callback
651 *
652 * Returns: Zero if successful, nonzero if it failed.
653 *
654 * Use: Sends a ping to a peer. Call @func@ with a nonzero argument
655 * if we get an answer within the timeout, or zero if no answer.
656 */
657
658 int p_pingsend(peer *p, ping *pg, unsigned type,
659 unsigned long timeout,
660 void (*func)(int, void *), void *arg)
661 {
662 buf *b, bb;
663 struct timeval tv;
664
665 switch (type) {
666 case MISC_PING:
667 pg->msg = MISC_PONG;
668 b = p_txstart(p, MSG_MISC | MISC_PING);
669 p_pingwrite(pg, b);
670 p_txend(p);
671 break;
672 case MISC_EPING:
673 pg->msg = MISC_EPONG;
674 b = p_txstart(p, MSG_MISC | MISC_EPING);
675 buf_init(&bb, buf_t, sizeof(buf_t));
676 p_pingwrite(pg, &bb);
677 buf_flip(&bb);
678 p_encrypt(p, MSG_MISC | MISC_EPING, &bb, b);
679 if (!BOK(b))
680 return (-1);
681 p_txend(p);
682 break;
683 default:
684 abort();
685 break;
686 }
687
688 pg->next = p->pings;
689 pg->prev = 0;
690 pg->p = p;
691 pg->func = func;
692 pg->arg = arg;
693 if (p->pings) p->pings->prev = pg;
694 p->pings = pg;
695 gettimeofday(&tv, 0);
696 tv.tv_sec += timeout;
697 sel_addtimer(&sel, &pg->t, &tv, p_pingtimeout, pg);
698 T( trace(T_PEER, "peer: send %s 0x%08lx to %s",
699 p_pingtype(type), (unsigned long)pg->id, p->spec.name); )
700 return (0);
701 }
702
703 /* --- @p_greet@ --- *
704 *
705 * Arguments: @peer *p@ = peer to send to
706 * @const void *c@ = pointer to challenge
707 * @size_t sz@ = size of challenge
708 *
709 * Returns: ---
710 *
711 * Use: Sends a greeting packet.
712 */
713
714 void p_greet(peer *p, const void *c, size_t sz)
715 {
716 buf *b = p_txstart(p, MSG_MISC | MISC_GREET);
717 buf_put(b, c, sz);
718 p_txend(p);
719 }
720
721 /* --- @p_tun@ --- *
722 *
723 * Arguments: @peer *p@ = pointer to peer block
724 * @buf *b@ = buffer containing incoming packet
725 *
726 * Returns: ---
727 *
728 * Use: Handles a packet which needs to be sent to a peer.
729 */
730
731 void p_tun(peer *p, buf *b)
732 {
733 buf *bb = p_txstart(p, MSG_PACKET);
734
735 QUICKRAND;
736 p_encrypt(p, MSG_PACKET, b, bb);
737 if (BOK(bb) && BLEN(bb)) {
738 p->st.n_ipout++;
739 p->st.sz_ipout += BLEN(bb);
740 p_txend(p);
741 }
742 }
743
744 /* --- @p_keyreload@ --- *
745 *
746 * Arguments: ---
747 *
748 * Returns: ---
749 *
750 * Use: Forces a check of the daemon's keyring files.
751 */
752
753 void p_keyreload(void)
754 {
755 if (km_reload())
756 FOREACH_PEER(p, { kx_newkeys(&p->kx); });
757 }
758
759 /* --- @p_interval@ --- *
760 *
761 * Arguments: ---
762 *
763 * Returns: ---
764 *
765 * Use: Called periodically to do tidying.
766 */
767
768 void p_interval(void)
769 {
770 p_keyreload();
771 FOREACH_PEER(p, { ksl_prune(&p->ks); });
772 }
773
774 /* --- @p_stats@ --- *
775 *
776 * Arguments: @peer *p@ = pointer to a peer block
777 *
778 * Returns: A pointer to the peer's statistics.
779 */
780
781 stats *p_stats(peer *p) { return (&p->st); }
782
783 /* --- @p_ifname@ --- *
784 *
785 * Arguments: @peer *p@ = pointer to a peer block
786 *
787 * Returns: A pointer to the peer's interface name.
788 */
789
790 const char *p_ifname(peer *p) { return (p->ifname); }
791
792 /* --- @p_setifname@ --- *
793 *
794 * Arguments: @peer *p@ = pointer to a peer block
795 * @const char *name@ = pointer to the new name
796 *
797 * Returns: ---
798 *
799 * Use: Changes the name held for a peer's interface.
800 */
801
802 void p_setifname(peer *p, const char *name)
803 {
804 xfree(p->ifname);
805 p->ifname = xstrdup(name);
806 if (p->spec.tops->setifname)
807 p->spec.tops->setifname(p->t, name);
808 }
809
810 /* --- @p_addr@ --- *
811 *
812 * Arguments: @peer *p@ = pointer to a peer block
813 *
814 * Returns: A pointer to the peer's address.
815 */
816
817 const addr *p_addr(peer *p) { return (&p->spec.sa); }
818
819 /* --- @p_bind@ --- *
820 *
821 * Arguments: @struct addrinfo *ailist@ = addresses to bind to
822 *
823 * Returns: ---
824 *
825 * Use: Initializes the peer system; creates the socket.
826 */
827
828 void p_bind(struct addrinfo *ailist)
829 {
830 int fd;
831 int len = PKBUFSZ;
832 int yes = 1;
833 int i;
834 struct addrinfo *ai;
835 unsigned port, lastport = 0;
836 addr a;
837 socklen_t sz;
838
839 for (i = 0; i < NADDRFAM; i++) udpsock[i].sf.fd = -1;
840
841 for (ai = ailist; ai; ai = ai->ai_next) {
842 if ((i = afix(ai->ai_family)) < 0) continue;
843 if (udpsock[i].sf.fd != -1) continue;
844
845 /* --- Note on socket buffer sizes --- *
846 *
847 * For some bizarre reason, Linux 2.2 (at least) doubles the socket
848 * buffer sizes I pass to @setsockopt@. I'm not putting special-case
849 * code here for Linux: BSD (at least TCPv2) does what I tell it rather
850 * than second-guessing me.
851 */
852
853 if ((fd = socket(ai->ai_family, SOCK_DGRAM, 0)) < 0) {
854 a_warn("PEER", "-", "udp-socket", "%s", aftab[i].name,
855 "create-failed", "?ERRNO", A_END);
856 exit(EXIT_FAILURE);
857 }
858 if (i == AFIX_INET6 &&
859 setsockopt(fd, IPPROTO_IPV6, IPV6_V6ONLY, &yes, sizeof(yes))) {
860 a_warn("PEER", "-", "udp-socket", "%s", aftab[i].name,
861 "set-v6only-failed", "?ERRNO", A_END);
862 exit(EXIT_FAILURE);
863 }
864 assert(ai->ai_addrlen <= sizeof(a));
865 memcpy(&a, ai->ai_addr, ai->ai_addrlen);
866 if ((port = getport(&a)) == 0 && lastport) setport(&a, lastport);
867 if (bind(fd, &a.sa, addrsz(&a))) {
868 a_warn("PEER", "-", "udp-socket", "%s", aftab[i].name,
869 "bind-failed", "?ERRNO", A_END);
870 exit(EXIT_FAILURE);
871 }
872 if (setsockopt(fd, SOL_SOCKET, SO_RCVBUF, &len, sizeof(len)) ||
873 setsockopt(fd, SOL_SOCKET, SO_SNDBUF, &len, sizeof(len))) {
874 a_warn("PEER", "-", "udp-socket", "%s", aftab[i].name,
875 "set-buffers-failed", "?ERRNO", A_END);
876 exit(EXIT_FAILURE);
877 }
878 fdflags(fd, O_NONBLOCK, O_NONBLOCK, FD_CLOEXEC, FD_CLOEXEC);
879 if (port)
880 udpsock[i].port = port;
881 else {
882 sz = sizeof(a);
883 if (getsockname(fd, &a.sa, &sz)) {
884 a_warn("PEER", "-", "udp-socket", "%s", aftab[i].name,
885 "read-local-address-failed", "?ERRNO", A_END);
886 exit(EXIT_FAILURE);
887 }
888 udpsock[i].port = lastport = getport(&a);
889 }
890 T( trace(T_PEER, "peer: created %s socket", aftab[i].name); )
891 sel_initfile(&sel, &udpsock[i].sf, fd, SEL_READ, p_read, 0);
892 sel_addfile(&udpsock[i].sf);
893 }
894
895 }
896
897 /* --- @p_init@ --- *
898 *
899 * Arguments: ---
900 *
901 * Returns: ---
902 *
903 * Use: Initializes the peer system.
904 */
905
906 void p_init(void)
907 {
908 sym_create(&byname);
909 am_create(&byaddr);
910 }
911
912 /* --- @p_keepalive@ --- *
913 *
914 * Arguments: @struct timeval *now@ = the current time
915 * @void *pv@ = peer to wake up
916 *
917 * Returns: ---
918 *
919 * Use: Sends a keepalive ping message to its peer.
920 */
921
922 static void p_keepalive(struct timeval *now, void *pv)
923 {
924 peer *p = pv;
925
926 p_txstart(p, MSG_MISC | MISC_NOP); p_dotxend(p);
927 T( trace(T_PEER, "peer: sent keepalive to %s", p->spec.name); )
928 p_setkatimer(p);
929 }
930
931 /* --- @p_setkatimer@ --- *
932 *
933 * Arguments: @peer *p@ = peer to set
934 *
935 * Returns: ---
936 *
937 * Use: Resets the keepalive timer thing.
938 */
939
940 static void p_setkatimer(peer *p)
941 {
942 struct timeval tv;
943
944 if (!p->spec.t_ka)
945 return;
946 gettimeofday(&tv, 0);
947 tv.tv_sec += p->spec.t_ka;
948 sel_addtimer(&sel, &p->tka, &tv, p_keepalive, p);
949 }
950
951 /* --- @p_create@ --- *
952 *
953 * Arguments: @peerspec *spec@ = information about this peer
954 *
955 * Returns: Pointer to the peer block, or null if it failed.
956 *
957 * Use: Creates a new named peer block. No peer is actually attached
958 * by this point.
959 */
960
961 peer *p_create(peerspec *spec)
962 {
963 peer *p = CREATE(peer);
964 const tunnel_ops *tops = spec->tops;
965 int fd;
966 unsigned f;
967
968 p->byname = sym_find(&byname, spec->name, -1, sizeof(peer_byname), &f);
969 if (f) goto tidy_0;
970 p->byaddr = am_find(&byaddr, &spec->sa, sizeof(peer_byaddr), &f);
971 if (f) goto tidy_1;
972 p->byname->p = p->byaddr->p = p;
973
974 T( trace(T_PEER, "peer: creating new peer `%s'", spec->name); )
975 p->spec = *spec;
976 p->spec.name = (/*unconst*/ char *)SYM_NAME(p->byname);
977 if (spec->tag) p->spec.tag = xstrdup(spec->tag);
978 if (spec->privtag) p->spec.privtag = xstrdup(spec->privtag);
979 if (spec->knock) p->spec.knock = xstrdup(spec->knock);
980 p->ks = 0;
981 p->pings = 0;
982 p->ifname = 0;
983 p->afix = afix(p->spec.sa.sa.sa_family); assert(p->afix >= 0);
984 memset(&p->st, 0, sizeof(stats));
985 p->st.t_start = time(0);
986 if (!(tops->flags & TUNF_PRIVOPEN))
987 fd = -1;
988 else if ((fd = ps_tunfd(tops, &p->ifname)) < 0)
989 goto tidy_2;
990 if ((p->t = tops->create(p, fd, &p->ifname)) == 0)
991 goto tidy_3;
992 T( trace(T_TUNNEL, "peer: attached interface %s to peer `%s'",
993 p->ifname, p_name(p)); )
994 p_setkatimer(p);
995 iv_addreason();
996 if (kx_setup(&p->kx, p, &p->ks, p->spec.f & PSF_KXMASK))
997 goto tidy_4;
998 a_notify("ADD",
999 "?PEER", p,
1000 "%s", p->ifname,
1001 "?ADDR", &p->spec.sa,
1002 A_END);
1003 if (!(p->spec.f & KXF_CORK)) {
1004 a_notify("KXSTART", "?PEER", p, A_END);
1005 /* Couldn't tell anyone before */
1006 }
1007 if (p->spec.f & PSF_MOBILE) nmobile++;
1008 return (p);
1009
1010 tidy_4:
1011 if (spec->t_ka) sel_rmtimer(&p->tka);
1012 xfree(p->ifname);
1013 p->t->ops->destroy(p->t);
1014 iv_rmreason();
1015 tidy_3:
1016 if (fd >= 0) close(fd);
1017 tidy_2:
1018 am_remove(&byaddr, p->byaddr);
1019 if (p->spec.tag) xfree(p->spec.tag);
1020 if (p->spec.privtag) xfree(p->spec.privtag);
1021 tidy_1:
1022 sym_remove(&byname, p->byname);
1023 tidy_0:
1024 DESTROY(p);
1025 return (0);
1026 }
1027
1028 /* --- @p_name@ --- *
1029 *
1030 * Arguments: @peer *p@ = pointer to a peer block
1031 *
1032 * Returns: A pointer to the peer's name.
1033 */
1034
1035 const char *p_name(peer *p)
1036 { if (p) return (p->spec.name); else return ("-"); }
1037
1038 /* --- @p_tag@ --- *
1039 *
1040 * Arguments: @peer *p@ = pointer to a peer block
1041 *
1042 * Returns: A pointer to the peer's public key tag.
1043 */
1044
1045 const char *p_tag(peer *p)
1046 { return (p->spec.tag ? p->spec.tag : p->spec.name); }
1047
1048 /* --- @p_privtag@ --- *
1049 *
1050 * Arguments: @peer *p@ = pointer to a peer block
1051 *
1052 * Returns: A pointer to the peer's private key tag.
1053 */
1054
1055 const char *p_privtag(peer *p)
1056 { return (p->spec.privtag ? p->spec.privtag : tag_priv); }
1057
1058 /* --- @p_spec@ --- *
1059 *
1060 * Arguments: @peer *p@ = pointer to a peer block
1061 *
1062 * Returns: Pointer to the peer's specification
1063 */
1064
1065 const peerspec *p_spec(peer *p) { return (&p->spec); }
1066
1067 /* --- @p_findbyaddr@ --- *
1068 *
1069 * Arguments: @const addr *a@ = address to look up
1070 *
1071 * Returns: Pointer to the peer block, or null if not found.
1072 *
1073 * Use: Finds a peer by address.
1074 */
1075
1076 peer *p_findbyaddr(const addr *a)
1077 {
1078 peer_byaddr *pa;
1079
1080 if ((pa = am_find(&byaddr, a, 0, 0)) != 0) {
1081 assert(pa->p);
1082 return (pa->p);
1083 }
1084 return (0);
1085 }
1086
1087 /* --- @p_find@ --- *
1088 *
1089 * Arguments: @const char *name@ = name to look up
1090 *
1091 * Returns: Pointer to the peer block, or null if not found.
1092 *
1093 * Use: Finds a peer by name.
1094 */
1095
1096 peer *p_find(const char *name)
1097 {
1098 peer_byname *pn;
1099
1100 if ((pn = sym_find(&byname, name, -1, 0, 0)) != 0)
1101 return (pn->p);
1102 return (0);
1103 }
1104
1105 /* --- @p_destroy@ --- *
1106 *
1107 * Arguments: @peer *p@ = pointer to a peer
1108 * @int bye@ = say goodbye to the peer?
1109 *
1110 * Returns: ---
1111 *
1112 * Use: Destroys a peer.
1113 */
1114
1115 void p_destroy(peer *p, int bye)
1116 {
1117 ping *pg, *ppg;
1118 buf *b, bb;
1119
1120 T( trace(T_PEER, "peer: destroying peer `%s'", p->spec.name); )
1121
1122 if (bye && (p->spec.f&PSF_EPHEM)) {
1123 b = p_txstart(p, MSG_MISC | MISC_BYE);
1124 buf_init(&bb, buf_t, sizeof(buf_t));
1125 assert(BOK(&bb)); buf_flip(&bb);
1126 p_encrypt(p, MSG_MISC | MISC_BYE, &bb, b);
1127 p_txend(p);
1128 }
1129
1130 a_notify("KILL", "%s", p->spec.name, A_END);
1131 ksl_free(&p->ks);
1132 kx_free(&p->kx);
1133 if (p->spec.f & PSF_MOBILE) nmobile--;
1134 if (p->ifname) xfree(p->ifname);
1135 if (p->spec.tag) xfree(p->spec.tag);
1136 if (p->spec.privtag) xfree(p->spec.privtag);
1137 if (p->spec.knock) xfree(p->spec.knock);
1138 p->t->ops->destroy(p->t);
1139 if (p->spec.t_ka) sel_rmtimer(&p->tka);
1140 for (pg = p->pings; pg; pg = ppg) {
1141 ppg = pg->next;
1142 p_pingdone(pg, PING_PEERDIED);
1143 }
1144 sym_remove(&byname, p->byname);
1145 am_remove(&byaddr, p->byaddr);
1146 iv_rmreason();
1147 DESTROY(p);
1148 }
1149
1150 /* --- @p_destroyall@ --- *
1151 *
1152 * Arguments: ---
1153 *
1154 * Returns: ---
1155 *
1156 * Use: Destroys all of the peers, saying goodbye.
1157 */
1158
1159 void p_destroyall(void) { FOREACH_PEER(p, { p_destroy(p, 1); }); }
1160
1161 /* --- @p_mkiter@ --- *
1162 *
1163 * Arguments: @peer_iter *i@ = pointer to an iterator
1164 *
1165 * Returns: ---
1166 *
1167 * Use: Initializes the iterator.
1168 */
1169
1170 void p_mkiter(peer_iter *i) { sym_mkiter(&i->i, &byname); }
1171
1172 /* --- @p_next@ --- *
1173 *
1174 * Arguments: @peer_iter *i@ = pointer to an iterator
1175 *
1176 * Returns: Next peer, or null if at the end.
1177 *
1178 * Use: Returns the next peer.
1179 */
1180
1181 peer *p_next(peer_iter *i)
1182 {
1183 peer_byname *pn;
1184
1185 if ((pn = sym_next(&i->i)) == 0)
1186 return (0);
1187 return (pn->p);
1188 }
1189
1190 /*----- That's all, folks -------------------------------------------------*/