10a03f5fd79900201b2878a97a1bd76d32b00503
3 * Main header file for TrIPE
5 * (c) 2001 Straylight/Edgeware
8 /*----- Licensing notice --------------------------------------------------*
10 * This file is part of Trivial IP Encryption (TrIPE).
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.
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
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/>.
33 /*----- Header files ------------------------------------------------------*/
49 #include <sys/types.h>
56 #include <sys/socket.h>
58 #include <netinet/in.h>
59 #include <arpa/inet.h>
66 # define ADNS_FEATURE_MANYAF
70 #include <mLib/alloc.h>
71 #include <mLib/arena.h>
72 #include <mLib/base64.h>
74 # include <mLib/bres.h>
76 #include <mLib/codec.h>
77 #include <mLib/daemonize.h>
78 #include <mLib/dstr.h>
80 #include <mLib/fdflags.h>
81 #include <mLib/fdpass.h>
82 #include <mLib/fwatch.h>
83 #include <mLib/hash.h>
84 #include <mLib/macros.h>
85 #include <mLib/mdup.h>
86 #include <mLib/mdwopt.h>
87 #include <mLib/quis.h>
88 #include <mLib/report.h>
90 #include <mLib/selbuf.h>
94 #include <mLib/trace.h>
96 #include <mLib/versioncmp.h>
98 #include <catacomb/buf.h>
99 #include <catacomb/ct.h>
101 #include <catacomb/chacha.h>
102 #include <catacomb/gcipher.h>
103 #include <catacomb/gmac.h>
104 #include <catacomb/grand.h>
105 #include <catacomb/key.h>
106 #include <catacomb/paranoia.h>
107 #include <catacomb/poly1305.h>
108 #include <catacomb/salsa20.h>
110 #include <catacomb/noise.h>
111 #include <catacomb/rand.h>
113 #include <catacomb/mp.h>
114 #include <catacomb/mpmont.h>
115 #include <catacomb/mprand.h>
116 #include <catacomb/dh.h>
117 #include <catacomb/ec.h>
118 #include <catacomb/ec-raw.h>
119 #include <catacomb/ec-keys.h>
120 #include <catacomb/x25519.h>
121 #include <catacomb/x448.h>
124 #include "protocol.h"
130 /*----- Magic numbers -----------------------------------------------------*/
132 /* --- Trace flags --- */
140 #define T_KEYEXCH 64u
141 #define T_KEYMGMT 128u
143 /* T_PRIVSEP in priv.h */
149 #define SEC(n) (n##u)
150 #define MIN(n) (n##u * 60u)
151 #define F_2P32 (65536.0*65536.0)
152 #define MEG(n) (n##ul * 1024ul * 1024ul)
154 /* --- Timing parameters --- */
156 #define T_EXP MIN(60) /* Expiry time for a key */
157 #define T_REGEN MIN(40) /* Regeneration time for a key */
159 #define T_VALID SEC(20) /* Challenge validity period */
160 #define T_RETRYMIN SEC(2) /* Minimum retry interval */
161 #define T_RETRYMAX MIN(5) /* Maximum retry interval */
162 #define T_RETRYGROW (5.0/4.0) /* Retry interval growth factor */
164 #define T_WOBBLE (1.0/3.0) /* Relative timer randomness */
166 /* --- Other things --- */
168 #define PKBUFSZ 65536
170 /*----- Cipher selections -------------------------------------------------*/
172 typedef struct keyset keyset
;
173 typedef struct algswitch algswitch
;
174 typedef struct kdata kdata
;
175 typedef struct admin admin
;
177 typedef struct dhgrp
{
178 const struct dhops
*ops
;
182 typedef struct dhsc dhsc
;
183 typedef struct dhge dhge
;
186 DHFMT_STD
, /* Fixed-width format, suitable for encryption */
187 DHFMT_HASH
, /* Deterministic format, suitable for hashing */
188 DHFMT_VAR
/* Variable-width-format, mostly a bad idea */
191 typedef struct deriveargs
{
192 const char *what
; /* Operation name (hashed) */
193 unsigned f
; /* Flags */
194 #define DF_IN 1u /* Make incoming key */
195 #define DF_OUT 2u /* Make outgoing key */
196 const gchash
*hc
; /* Hash class */
197 const octet
*k
; /* Pointer to contributions */
198 size_t x
, y
, z
; /* Markers in contributions */
201 typedef struct bulkalgs
{
202 const struct bulkops
*ops
;
205 typedef struct bulkctx
{
206 const struct bulkops
*ops
;
209 typedef struct bulkchal
{
210 const struct bulkops
*ops
;
214 typedef struct dhops
{
217 int (*ldpriv
)(key_file */
*kf*/
, key */
*k*/
, key_data */
*d*/
,
218 kdata */
*kd*/
, dstr */
*t*/
, dstr */
*e*/
);
219 /* Load a private key from @d@, storing the data in @kd@. The key's
220 * file and key object are in @kf@ and @k@, mostly in case its
221 * attributes are interesting; the key tag is in @t@; errors are
222 * reported by writing tokens to @e@ and returning nonzero.
225 int (*ldpub
)(key_file */
*kf*/
, key */
*k*/
, key_data */
*d*/
,
226 kdata */
*kd*/
, dstr */
*t*/
, dstr */
*e*/
);
227 /* Load a public key from @d@, storing the data in @kd@. The key's
228 * file and key object are in @kf@ and @k@, mostly in case its
229 * attributes are interesting; the key tag is in @t@; errors are
230 * reported by writing tokens to @e@ and returning nonzero.
233 const char *(*checkgrp
)(const dhgrp */
*g*/
);
234 /* Check that the group is valid; return null on success, or an error
238 void (*grpinfo
)(const dhgrp */
*g*/
, admin */
*a*/
);
239 /* Report on the group to an admin client. */
241 T( void (*tracegrp
)(const dhgrp */
*g*/
); )
242 /* Trace a description of the group. */
244 int (*samegrpp
)(const dhgrp */
*g*/
, const dhgrp */
*gg*/
);
245 /* Return nonzero if the two group objects represent the same
249 void (*freegrp
)(dhgrp */
*g*/
);
250 /* Free a group and the resources it holds. */
252 dhsc
*(*ldsc
)(const dhgrp */
*g*/
, const void */
*p*/
, size_t /*sz*/);
253 /* Load a scalar from @p@, @sz@ and return it. Return null on
257 int (*stsc
)(const dhgrp */
*g*/
,
258 void */
*p*/
, size_t /*sz*/, const dhsc */
*x*/
);
259 /* Store a scalar at @p@, @sz@. Return nonzero on error. */
261 dhsc
*(*randsc
)(const dhgrp */
*g*/
);
262 /* Return a random scalar. */
264 T( const char *(*scstr
)(const dhgrp */
*g*/
, const dhsc */
*x*/
); )
265 /* Return a human-readable representation of @x@; @buf_t@ may be used
269 void (*freesc
)(const dhgrp */
*g*/
, dhsc */
*x*/
);
270 /* Free a scalar and the resources it holds. */
272 dhge
*(*ldge
)(const dhgrp */
*g*/
, buf */
*b*/
, int /*fmt*/);
273 /* Load a group element from @b@, encoded using format @fmt@. Return
277 int (*stge
)(const dhgrp */
*g*/
, buf */
*b*/
,
278 const dhge */
*Y*/
, int /*fmt*/);
279 /* Store a group element in @b@, encoded using format @fmt@. Return
283 int (*checkge
)(const dhgrp */
*h*/
, const dhge */
*Y*/
);
284 /* Check a group element for validity. Return zero if everything
285 * checks out; nonzero on failure.
288 int (*eq
)(const dhgrp */
*g*/
, const dhge */
*Y*/
, const dhge */
*Z*/
);
289 /* Return nonzero if @Y@ and @Z@ are equal. */
291 dhge
*(*mul
)(const dhgrp */
*g*/
, const dhsc */
*x*/
, const dhge */
*Y*/
);
292 /* Multiply a group element by a scalar, resulting in a shared-secret
293 * group element. If @y@ is null, then multiply the well-known
297 T( const char *(*gestr
)(const dhgrp */
*g*/
, const dhge */
*Y*/
); )
298 /* Return a human-readable representation of @Y@; @buf_t@ may be used
302 void (*freege
)(const dhgrp */
*g*/
, dhge */
*Y*/
);
303 /* Free a group element and the resources it holds. */
307 typedef struct bulkops
{
310 bulkalgs
*(*getalgs
)(const algswitch */
*asw*/
, dstr */
*e*/
,
311 key_file */
*kf*/
, key */
*k*/
);
312 /* Determine algorithms to use and return a @bulkalgs@ object
313 * representing the decision. On error, write tokens to @e@ and
317 T( void (*tracealgs
)(const bulkalgs */
*a*/
); )
318 /* Write trace information about the algorithm selection. */
320 int (*checkalgs
)(bulkalgs */
*a*/
, const algswitch */
*asw*/
, dstr */
*e*/
);
321 /* Check that the algorithms in @a@ and @asw@ are acceptable. On
322 * error, write tokens to @e@ and return @-1@; otherwise return zero.
325 int (*samealgsp
)(const bulkalgs */
*a*/
, const bulkalgs */
*aa*/
);
326 /* If @a@ and @aa@ represent the same algorithm selection, return
327 * nonzero; if not, return zero.
330 void (*alginfo
)(const bulkalgs */
*a*/
, admin */
*adm*/
);
331 /* Report on the algorithm selection to an admin client: call
332 * @a_info@ with appropriate key-value pairs.
335 size_t (*overhead
)(const bulkalgs */
*a*/
);
336 /* Return the per-packet overhead of the bulk transform, in bytes. */
338 size_t (*expsz
)(const bulkalgs */
*a*/
);
339 /* Return the total size limit for the bulk transform, in bytes,
340 * after which the keys must no longer be used.
343 bulkctx
*(*genkeys
)(const bulkalgs */
*a*/
, const deriveargs */
*a*/
);
344 /* Generate session keys and construct and return an appropriate
345 * context for using them. The offsets @a->x@, @a->y@ and @a->z@
346 * separate the key material into three parts. Between @a->k@ and
347 * @a->k + a->x@ is `my' contribution to the key material; between
348 * @a->k + a->x@ and @a->k + a->y@ is `your' contribution; and
349 * between @a->k + a->y@ and @a->k + a->z@ is a shared value we made
350 * together. These are used to construct (up to) two collections of
351 * symmetric keys: one for outgoing messages, the other for incoming
352 * messages. If @a->x == 0@ (or @a->y == a->x@) then my (or your)
353 * contribution is omitted.
356 bulkchal
*(*genchal
)(const bulkalgs */
*a*/
);
357 /* Construct and return a challenge issuing and verification
358 * context with a fresh random key.
361 void (*freealgs
)(bulkalgs */
*a*/
);
362 /* Release an algorithm selection object. (Associated bulk
363 * encryption contexts and challenge contexts may still exist and
364 * must remain valid.)
367 int (*encrypt
)(bulkctx */
*bc*/
, unsigned /*ty*/,
368 buf */
*b*/
, buf */
*bb*/
, uint32
/*seq*/);
369 /* Encrypt the packet in @b@, with type @ty@ (which doesn't need
370 * encoding separately) and sequence number @seq@ (which must be
371 * recoverable by @decrypt@), and write the result to @bb@. On
372 * error, return a @KSERR_...@ code and/or break the output buffer.
375 int (*decrypt
)(bulkctx */
*bc*/
, unsigned /*ty*/,
376 buf */
*b*/
, buf */
*bb*/
, uint32 */
*seq*/
);
377 /* Decrypt the packet in @b@, with type @ty@, writing the result to
378 * @bb@ and storing the incoming (claimed) sequence number in @seq@.
379 * On error, return a @KSERR_...@ code.
382 void (*freectx
)(bulkctx */
*a*/
);
383 /* Release a bulk encryption context and the resources it holds. */
385 int (*chaltag
)(bulkchal */
*bc*/
, const void */
*m*/
, size_t /*msz*/,
386 uint32
/*seq*/, void */
*t*/
);
387 /* Calculate a tag for the challenge in @m@, @msz@, with the sequence
388 * number @seq@, and write it to @t@. Return @-1@ on error, zero on
392 int (*chalvrf
)(bulkchal */
*bc*/
, const void */
*m*/
, size_t /*msz*/,
393 uint32
/*seq*/, const void */
*t*/
);
394 /* Check the tag @t@ on @m@, @msz@ and @seq@: return zero if the tag
395 * is OK, nonzero if it's bad.
398 void (*freechal
)(bulkchal */
*bc*/
);
399 /* Release a challenge context and the resources it holds. */
404 const gchash
*h
; size_t hashsz
; /* Hash function */
405 const gccipher
*mgf
; /* Mask-generation function */
406 bulkalgs
*bulk
; /* Bulk crypto algorithms */
410 unsigned ref
; /* Reference counter */
411 struct knode
*kn
; /* Pointer to cache entry */
412 uint32 id
; /* The underlying key's id */
413 char *tag
; /* Full tag name of the key */
414 dhgrp
*grp
; /* The group we work in */
415 dhsc
*k
; /* The private key (or null) */
416 dhge
*K
; /* The public key */
417 time_t t_exp
; /* Expiry time of the key */
418 algswitch algs
; /* Collection of algorithms */
421 typedef struct knode
{
422 sym_base _b
; /* Symbol table intrusion */
423 unsigned f
; /* Various flags */
424 #define KNF_BROKEN 1u /* Don't use this key any more */
425 struct keyhalf
*kh
; /* Pointer to the home keyhalf */
426 kdata
*kd
; /* Pointer to the key data */
429 #define MAXHASHSZ 64 /* Largest possible hash size */
431 #define HASH_STRING(h, s) GH_HASH((h), (s), sizeof(s))
433 extern const dhops dhtab
[];
434 extern const bulkops bulktab
[];
436 /*----- Data structures ---------------------------------------------------*/
438 /* --- The address-family table --- */
445 #define ENUM(af, qf) AFIX_##af,
451 extern const struct addrfam
{
459 /* --- Socket addresses --- *
461 * A magic union of supported socket addresses.
466 struct sockaddr_in sin
;
467 struct sockaddr_in6 sin6
;
470 /* --- Mapping keyed on addresses --- */
472 typedef struct addrmap
{
477 typedef struct addrmap_base
{
482 /* --- Sequence number checking --- */
484 typedef struct seqwin
{
485 uint32 seq
; /* First acceptable input sequence */
486 uint32 win
; /* Window of acceptable numbers */
489 #define SEQ_WINSZ 32 /* Bits in sequence number window */
491 /* --- A symmetric keyset --- *
493 * A keyset contains a set of symmetric keys for encrypting and decrypting
494 * packets. Keysets are stored in a list, sorted in reverse order of
495 * creation, so that the most recent keyset (the one most likely to be used)
498 * Each keyset has a time limit and a data limit. The keyset is destroyed
499 * when either it has existed for too long, or it has been used to encrypt
500 * too much data. New key exchanges are triggered when keys are close to
504 enum { DIR_IN
, DIR_OUT
, NDIR
};
507 struct keyset
*next
; /* Next active keyset in the list */
508 unsigned ref
; /* Reference count for keyset */
509 struct peer
*p
; /* Pointer to peer structure */
510 time_t t_exp
; /* Expiry time for this keyset */
511 unsigned long sz_exp
, sz_regen
; /* Data limits for the keyset */
512 T( unsigned seq
; ) /* Sequence number for tracing */
513 unsigned f
; /* Various useful flags */
514 bulkctx
*bulk
; /* Bulk crypto transform */
515 uint32 oseq
; /* Outbound sequence number */
516 seqwin iseq
; /* Inbound sequence number */
519 #define KSF_LISTEN 1u /* Don't encrypt packets yet */
520 #define KSF_LINK 2u /* Key is in a linked list */
522 #define KSERR_REGEN -1 /* Regenerate keys */
523 #define KSERR_NOKEYS -2 /* No keys left */
524 #define KSERR_DECRYPT -3 /* Unable to decrypt message */
525 #define KSERR_SEQ -4 /* Incorrect sequence number */
526 #define KSERR_MALFORMED -5 /* Input ciphertext is broken */
528 /* --- Key exchange --- *
530 * TrIPE uses the Wrestlers Protocol for its key exchange. The Wrestlers
531 * Protocol has a number of desirable features (e.g., perfect forward
532 * secrecy, and zero-knowledge authentication) which make it attractive for
533 * use in TrIPE. The Wrestlers Protocol was designed by Mark Wooding and
537 typedef struct retry
{
538 double t
; /* Current retry time */
543 typedef struct kxchal
{
544 struct keyexch
*kx
; /* Pointer back to key exchange */
545 dhge
*C
; /* Responder's challenge */
546 dhge
*R
; /* My reply to the challenge */
547 keyset
*ks
; /* Pointer to temporary keyset */
548 unsigned f
; /* Various useful flags */
549 sel_timer t
; /* Response timer for challenge */
550 retry rs
; /* Retry state */
551 octet hc
[MAXHASHSZ
]; /* Hash of his challenge */
552 octet ck
[MAXHASHSZ
]; /* His magical check value */
553 octet hswrq_in
[MAXHASHSZ
]; /* Inbound switch request message */
554 octet hswok_in
[MAXHASHSZ
]; /* Inbound switch confirmation */
555 octet hswrq_out
[MAXHASHSZ
]; /* Outbound switch request message */
556 octet hswok_out
[MAXHASHSZ
]; /* Outbound switch confirmation */
559 typedef struct keyexch
{
560 struct peer
*p
; /* Pointer back to the peer */
561 kdata
*kpriv
; /* Private key and related info */
562 kdata
*kpub
; /* Peer's public key */
563 keyset
**ks
; /* Peer's list of keysets */
564 unsigned f
; /* Various useful flags */
565 unsigned s
; /* Current state in exchange */
566 sel_timer t
; /* Timer for next exchange */
567 retry rs
; /* Retry state */
568 dhsc
*a
; /* My temporary secret */
569 dhge
*C
; /* My challenge */
570 dhge
*RX
; /* The expected response */
571 unsigned nr
; /* Number of extant responses */
572 time_t t_valid
; /* When this exchange goes bad */
573 octet hc
[MAXHASHSZ
]; /* Hash of my challenge */
574 kxchal
*r
[KX_NCHAL
]; /* Array of challenges */
577 #define KXF_TIMER 1u /* Waiting for a timer to go off */
578 #define KXF_DEAD 2u /* The key-exchanger isn't up */
579 #define KXF_PUBKEY 4u /* Key exchanger has a public key */
580 #define KXF_CORK 8u /* Don't send anything yet */
583 KXS_DEAD
, /* Uninitialized state (magical) */
584 KXS_CHAL
, /* Main answer-challenges state */
585 KXS_COMMIT
, /* Committed: send switch request */
586 KXS_SWITCH
/* Switched: send confirmation */
589 /* --- Tunnel structure --- *
591 * Used to maintain system-specific information about the tunnel interface.
594 typedef struct tunnel tunnel
;
597 typedef struct tunnel_ops
{
598 const char *name
; /* Name of this tunnel driver */
599 unsigned flags
; /* Various interesting flags */
600 #define TUNF_PRIVOPEN 1u /* Need helper to open file */
601 void (*init
)(void); /* Initializes the system */
602 tunnel
*(*create
)(struct peer */
*p*/
, int /*fd*/, char **/
*ifn*/
);
603 /* Initializes a new tunnel */
604 void (*setifname
)(tunnel */
*t*/
, const char */
*ifn*/
);
605 /* Notifies ifname change */
606 void (*inject
)(tunnel */
*t*/
, buf */
*b*/
); /* Sends packet through if */
607 void (*destroy
)(tunnel */
*t*/
); /* Destroys a tunnel */
610 #ifndef TUN_INTERNALS
611 struct tunnel
{ const tunnel_ops
*ops
; };
614 /* --- Peer statistics --- *
616 * Contains various interesting and not-so-interesting statistics about a
617 * peer. This is updated by various parts of the code. The format of the
618 * structure isn't considered private, and @p_stats@ returns a pointer to the
619 * statistics block for a given peer.
622 typedef struct stats
{
623 unsigned long sz_in
, sz_out
; /* Size of all data in and out */
624 unsigned long sz_kxin
, sz_kxout
; /* Size of key exchange messages */
625 unsigned long sz_ipin
, sz_ipout
; /* Size of encapsulated IP packets */
626 time_t t_start
, t_last
, t_kx
; /* Time peer created, last pk, kx */
627 unsigned long n_reject
; /* Number of rejected packets */
628 unsigned long n_in
, n_out
; /* Number of packets in and out */
629 unsigned long n_kxin
, n_kxout
; /* Number of key exchange packets */
630 unsigned long n_ipin
, n_ipout
; /* Number of encrypted packets */
633 /* --- Peer structure --- *
635 * The main structure which glues everything else together.
638 typedef struct peerspec
{
639 char *name
; /* Peer's name */
640 char *privtag
; /* Private key tag */
641 char *tag
; /* Public key tag */
642 char *knock
; /* Knock string, or null */
643 const tunnel_ops
*tops
; /* Tunnel operations */
644 unsigned long t_ka
; /* Keep alive interval */
645 addr sa
; /* Socket address to speak to */
646 unsigned f
; /* Flags for the peer */
647 #define PSF_KXMASK 255u /* Key-exchange flags to set */
648 #define PSF_MOBILE 256u /* Address may change rapidly */
649 #define PSF_EPHEM 512u /* Association is ephemeral */
652 typedef struct peer_byname
{
657 typedef struct peer_byaddr
{
662 typedef struct peer
{
663 peer_byname
*byname
; /* Lookup-by-name block */
664 peer_byaddr
*byaddr
; /* Lookup-by-address block */
665 struct ping
*pings
; /* Pings we're waiting for */
666 peerspec spec
; /* Specifications for this peer */
667 int afix
; /* Index of address family */
668 tunnel
*t
; /* Tunnel for local packets */
669 char *ifname
; /* Interface name for tunnel */
670 keyset
*ks
; /* List head for keysets */
671 buf b
; /* Buffer for sending packets */
672 stats st
; /* Statistics */
673 keyexch kx
; /* Key exchange protocol block */
674 sel_timer tka
; /* Timer for keepalives */
677 typedef struct peer_iter
{ sym_iter i
; } peer_iter
;
679 typedef struct ping
{
680 struct ping
*next
, *prev
; /* Links to next and previous */
681 peer
*p
; /* Peer so we can free it */
682 unsigned msg
; /* Kind of response expected */
683 uint32 id
; /* Id so we can recognize response */
684 octet magic
[32]; /* Some random data */
685 sel_timer t
; /* Timeout for ping */
686 void (*func
)(int /*rc*/, void */
*arg*/
); /* Function to call when done */
687 void *arg
; /* Argument for callback */
698 /* --- Admin structure --- */
700 #define OBUFSZ 16384u
702 typedef struct obuf
{
703 struct obuf
*next
; /* Next buffer in list */
704 char *p_in
, *p_out
; /* Pointers into the buffer */
705 char buf
[OBUFSZ
]; /* The actual buffer */
708 typedef struct oqueue
{
709 obuf
*hd
, *tl
; /* Head and tail pointers */
714 typedef struct admin_bgop
{
715 struct admin_bgop
*next
, *prev
; /* Links to next and previous */
716 struct admin
*a
; /* Owner job */
717 char *tag
; /* Tag string for messages */
718 void (*cancel
)(struct admin_bgop
*); /* Destructor function */
721 typedef struct admin_resop
{
722 admin_bgop bg
; /* Background operation header */
723 char *addr
; /* Hostname to be resolved */
727 bres_client r
; /* Background resolver task */
729 sel_timer t
; /* Timer for resolver */
730 addr sa
; /* Socket address */
731 unsigned port
; /* Port number chosen */
732 size_t sasz
; /* Socket address size */
733 void (*func
)(struct admin_resop
*, int); /* Handler */
736 enum { ARES_OK
, ARES_FAIL
};
738 typedef struct admin_addop
{
739 admin_resop r
; /* Name resolution header */
740 peerspec peer
; /* Peer pending creation */
743 typedef struct admin_pingop
{
744 admin_bgop bg
; /* Background operation header */
745 ping ping
; /* Ping pending response */
746 struct timeval pingtime
; /* Time last ping was sent */
749 typedef struct admin_service
{
750 sym_base _b
; /* Hash table base structure */
751 char *version
; /* The provided version */
752 struct admin
*prov
; /* Which client provides me */
753 struct admin_service
*next
, *prev
; /* Client's list of services */
756 typedef struct admin_svcop
{
757 admin_bgop bg
; /* Background operation header */
758 struct admin
*prov
; /* Client servicing this job */
759 unsigned index
; /* This job's index */
760 struct admin_svcop
*next
, *prev
; /* Links for provider's jobs */
763 typedef struct admin_jobentry
{
764 unsigned short seq
; /* Zero if unused */
766 admin_svcop
*op
; /* Operation, if slot in use, ... */
767 uint32 next
; /* ... or index of next free slot */
771 typedef struct admin_jobtable
{
772 uint32 n
, sz
; /* Used slots and table size */
773 admin_svcop
*active
; /* List of active jobs */
774 uint32 free
; /* Index of first free slot */
775 admin_jobentry
*v
; /* And the big array of entries */
779 struct admin
*next
, *prev
; /* Links to next and previous */
780 unsigned f
; /* Various useful flags */
781 unsigned ref
; /* Reference counter */
783 unsigned seq
; /* Sequence number for tracing */
785 oqueue out
; /* Output buffer list */
786 oqueue delay
; /* Delayed output buffer list */
787 admin_bgop
*bg
; /* Backgrounded operations */
788 admin_service
*svcs
; /* Which services I provide */
789 admin_jobtable j
; /* Table of outstanding jobs */
790 selbuf b
; /* Line buffer for commands */
791 sel_file w
; /* Selector for write buffering */
794 #define AF_DEAD 1u /* Destroy this admin block */
795 #define AF_CLOSE 2u /* Client closed connection */
796 #define AF_NOTE 4u /* Catch notifications */
797 #define AF_WARN 8u /* Catch warning messages */
799 # define AF_TRACE 16u /* Catch tracing */
801 #define AF_FOREGROUND 32u /* Quit server when client closes */
804 # define AF_ALLMSGS (AF_NOTE | AF_TRACE | AF_WARN)
806 # define AF_ALLMSGS (AF_NOTE | AF_WARN)
809 /*----- Global variables --------------------------------------------------*/
811 extern sel_state sel
; /* Global I/O event state */
812 extern octet buf_i
[PKBUFSZ
], buf_o
[PKBUFSZ
], buf_t
[PKBUFSZ
], buf_u
[PKBUFSZ
];
813 extern const tunnel_ops
*tunnels
[]; /* Table of tunnels (0-term) */
814 extern const tunnel_ops
*tun_default
; /* Default tunnel to use */
815 extern sel_file udpsock
[NADDRFAM
]; /* The master UDP sockets */
816 extern kdata
*master
; /* Default private key */
817 extern const char *tag_priv
; /* Default private key tag */
820 extern const trace_opt tr_opts
[]; /* Trace options array */
821 extern unsigned tr_flags
; /* Trace options flags */
824 /*----- Other macros ------------------------------------------------------*/
827 do { rand_quick(RAND_GLOBAL); noise_timer(RAND_GLOBAL); } while (0)
829 /*----- Key management ----------------------------------------------------*/
831 /* --- @km_init@ --- *
833 * Arguments: @const char *privkr@ = private keyring file
834 * @const char *pubkr@ = public keyring file
835 * @const char *ptag@ = default private-key tag
839 * Use: Initializes the key-management machinery, loading the
840 * keyrings and so on.
843 extern void km_init(const char */
*privkr*/
, const char */
*pubkr*/
,
844 const char */
*ptag*/
);
846 /* --- @km_reload@ --- *
850 * Returns: Zero if OK, nonzero to force reloading of keys.
852 * Use: Checks the keyrings to see if they need reloading.
855 extern int km_reload(void);
857 /* --- @km_findpub@, @km_findpriv@ --- *
859 * Arguments: @const char *tag@ = key tag to load
861 * Returns: Pointer to the kdata object if successful, or null on error.
863 * Use: Fetches a public or private key from the keyring.
866 extern kdata
*km_findpub(const char */
*tag*/
);
867 extern kdata
*km_findpriv(const char */
*tag*/
);
869 /* --- @km_findpubbyid@, @km_findprivbyid@ --- *
871 * Arguments: @uint32 id@ = key id to load
873 * Returns: Pointer to the kdata object if successful, or null on error.
875 * Use: Fetches a public or private key from the keyring given its
879 extern kdata
*km_findpubbyid(uint32
/*id*/);
880 extern kdata
*km_findprivbyid(uint32
/*id*/);
882 /* --- @km_samealgsp@ --- *
884 * Arguments: @const kdata *kdx, *kdy@ = two key data objects
886 * Returns: Nonzero if their two algorithm selections are the same.
888 * Use: Checks sameness of algorithm selections: used to ensure that
889 * peers are using sensible algorithms.
892 extern int km_samealgsp(const kdata */
*kdx*/
, const kdata */
*kdy*/
);
894 /* --- @km_ref@ --- *
896 * Arguments: @kdata *kd@ = pointer to the kdata object
900 * Use: Claim a new reference to a kdata object.
903 extern void km_ref(kdata */
*kd*/
);
905 /* --- @km_unref@ --- *
907 * Arguments: @kdata *kd@ = pointer to the kdata object
911 * Use: Releases a reference to a kdata object.
914 extern void km_unref(kdata */
*kd*/
);
916 /* --- @km_tag@ --- *
918 * Arguments: @kdata *kd@ - pointer to the kdata object
920 * Returns: A pointer to the short tag by which the kdata was loaded.
923 extern const char *km_tag(kdata */
*kd*/
);
925 /*----- Key exchange ------------------------------------------------------*/
927 /* --- @kx_start@ --- *
929 * Arguments: @keyexch *kx@ = pointer to key exchange context
930 * @int forcep@ = nonzero to ignore the quiet timer
934 * Use: Stimulates a key exchange. If a key exchage is in progress,
935 * a new challenge is sent (unless the quiet timer forbids
936 * this); if no exchange is in progress, one is commenced.
939 extern void kx_start(keyexch */
*kx*/
, int /*forcep*/);
941 /* --- @kx_message@ --- *
943 * Arguments: @keyexch *kx@ = pointer to key exchange context
944 * @const addr *a@ = sender's IP address and port
945 * @unsigned msg@ = the message code
946 * @buf *b@ = pointer to buffer containing the packet
948 * Returns: Nonzero if the sender's address was unknown.
950 * Use: Reads a packet containing key exchange messages and handles
954 extern int kx_message(keyexch */
*kx*/
, const addr */
*a*/
,
955 unsigned /*msg*/, buf */
*b*/
);
957 /* --- @kx_free@ --- *
959 * Arguments: @keyexch *kx@ = pointer to key exchange context
963 * Use: Frees everything in a key exchange context.
966 extern void kx_free(keyexch */
*kx*/
);
968 /* --- @kx_newkeys@ --- *
970 * Arguments: @keyexch *kx@ = pointer to key exchange context
974 * Use: Informs the key exchange module that its keys may have
975 * changed. If fetching the new keys fails, the peer will be
976 * destroyed, we log messages and struggle along with the old
980 extern void kx_newkeys(keyexch */
*kx*/
);
982 /* --- @kx_setup@ --- *
984 * Arguments: @keyexch *kx@ = pointer to key exchange context
985 * @peer *p@ = pointer to peer context
986 * @keyset **ks@ = pointer to keyset list
987 * @unsigned f@ = various useful flags
989 * Returns: Zero if OK, nonzero if it failed.
991 * Use: Initializes a key exchange module. The module currently
992 * contains no keys, and will attempt to initiate a key
996 extern int kx_setup(keyexch */
*kx*/
, peer */
*p*/
,
997 keyset
**/
*ks*/
, unsigned /*f*/);
999 /* --- @kx_init@ --- *
1005 * Use: Initializes the key-exchange logic.
1008 extern void kx_init(void);
1010 /*----- Keysets and symmetric cryptography --------------------------------*/
1012 /* --- @ks_drop@ --- *
1014 * Arguments: @keyset *ks@ = pointer to a keyset
1018 * Use: Decrements a keyset's reference counter. If the counter hits
1019 * zero, the keyset is freed.
1022 extern void ks_drop(keyset */
*ks*/
);
1024 /* --- @ks_gen@ --- *
1026 * Arguments: @deriveargs *a@ = key derivation parameters (modified)
1027 * @peer *p@ = pointer to peer information
1029 * Returns: A pointer to the new keyset.
1031 * Use: Derives a new keyset from the given key material. This will
1032 * set the @what@, @f@, and @hc@ members in @*a@; other members
1033 * must be filled in by the caller.
1035 * The new key is marked so that it won't be selected for output
1036 * by @ksl_encrypt@. You can still encrypt data with it by
1037 * calling @ks_encrypt@ directly.
1040 extern keyset
*ks_gen(deriveargs */
*a*/
, peer */
*p*/
);
1042 /* --- @ks_activate@ --- *
1044 * Arguments: @keyset *ks@ = pointer to a keyset
1048 * Use: Activates a keyset, so that it can be used for encrypting
1049 * outgoing messages.
1052 extern void ks_activate(keyset */
*ks*/
);
1054 /* --- @ks_encrypt@ --- *
1056 * Arguments: @keyset *ks@ = pointer to a keyset
1057 * @unsigned ty@ = message type
1058 * @buf *b@ = pointer to input buffer
1059 * @buf *bb@ = pointer to output buffer
1061 * Returns: Zero if successful; @KSERR_REGEN@ if we should negotiate a
1062 * new key; @KSERR_NOKEYS@ if the key is not usable. Also
1063 * returns zero if there was insufficient buffer (but the output
1064 * buffer is broken in this case).
1066 * Use: Encrypts a block of data using the key. Note that the `key
1067 * ought to be replaced' notification is only ever given once
1068 * for each key. Also note that this call forces a keyset to be
1069 * used even if it's marked as not for data output.
1071 * The encryption transform is permitted to corrupt @buf_u@ for
1072 * its own purposes. Neither the source nor destination should
1073 * be within @buf_u@; and callers mustn't expect anything stored
1074 * in @buf_u@ to still
1077 extern int ks_encrypt(keyset */
*ks*/
, unsigned /*ty*/,
1078 buf */
*b*/
, buf */
*bb*/
);
1080 /* --- @ks_decrypt@ --- *
1082 * Arguments: @keyset *ks@ = pointer to a keyset
1083 * @unsigned ty@ = expected type code
1084 * @buf *b@ = pointer to an input buffer
1085 * @buf *bb@ = pointer to an output buffer
1087 * Returns: Zero on success; @KSERR_DECRYPT@ on failure. Also returns
1088 * zero if there was insufficient buffer (but the output buffer
1089 * is broken in this case).
1091 * Use: Attempts to decrypt a message using a given key. Note that
1092 * requesting decryption with a key directly won't clear a
1093 * marking that it's not for encryption.
1095 * The decryption transform is permitted to corrupt @buf_u@ for
1096 * its own purposes. Neither the source nor destination should
1097 * be within @buf_u@; and callers mustn't expect anything stored
1098 * in @buf_u@ to still
1101 extern int ks_decrypt(keyset */
*ks*/
, unsigned /*ty*/,
1102 buf */
*b*/
, buf */
*bb*/
);
1104 /* --- @ksl_free@ --- *
1106 * Arguments: @keyset **ksroot@ = pointer to keyset list head
1110 * Use: Frees (releases references to) all of the keys in a keyset.
1113 extern void ksl_free(keyset
**/
*ksroot*/
);
1115 /* --- @ksl_link@ --- *
1117 * Arguments: @keyset **ksroot@ = pointer to keyset list head
1118 * @keyset *ks@ = pointer to a keyset
1122 * Use: Links a keyset into a list. A keyset can only be on one list
1123 * at a time. Bad things happen otherwise.
1126 extern void ksl_link(keyset
**/
*ksroot*/
, keyset */
*ks*/
);
1128 /* --- @ksl_prune@ --- *
1130 * Arguments: @keyset **ksroot@ = pointer to keyset list head
1134 * Use: Prunes the keyset list by removing keys which mustn't be used
1138 extern void ksl_prune(keyset
**/
*ksroot*/
);
1140 /* --- @ksl_encrypt@ --- *
1142 * Arguments: @keyset **ksroot@ = pointer to keyset list head
1143 * @unsigned ty@ = message type
1144 * @buf *b@ = pointer to input buffer
1145 * @buf *bb@ = pointer to output buffer
1147 * Returns: Zero if successful; @KSERR_REGEN@ if it's time to negotiate a
1148 * new key; @KSERR_NOKEYS@ if there are no suitable keys
1149 * available. Also returns zero if there was insufficient
1150 * buffer space (but the output buffer is broken in this case).
1152 * Use: Encrypts a packet.
1155 extern int ksl_encrypt(keyset
**/
*ksroot*/
, unsigned /*ty*/,
1156 buf */
*b*/
, buf */
*bb*/
);
1158 /* --- @ksl_decrypt@ --- *
1160 * Arguments: @keyset **ksroot@ = pointer to keyset list head
1161 * @unsigned ty@ = expected type code
1162 * @buf *b@ = pointer to input buffer
1163 * @buf *bb@ = pointer to output buffer
1165 * Returns: Zero on success; @KSERR_DECRYPT@ on failure. Also returns
1166 * zero if there was insufficient buffer (but the output buffer
1167 * is broken in this case).
1169 * Use: Decrypts a packet.
1172 extern int ksl_decrypt(keyset
**/
*ksroot*/
, unsigned /*ty*/,
1173 buf */
*b*/
, buf */
*bb*/
);
1175 /*----- Challenges --------------------------------------------------------*/
1177 /* --- @c_new@ --- *
1179 * Arguments: @const void *m@ = pointer to associated message, or null
1180 * @size_t msz@ = length of associated message
1181 * @buf *b@ = where to put the challenge
1183 * Returns: Zero if OK, nonzero on error.
1185 * Use: Issues a new challenge.
1188 extern int c_new(const void */
*m*/
, size_t /*msz*/, buf */
*b*/
);
1190 /* --- @c_check@ --- *
1192 * Arguments: @const void *m@ = pointer to associated message, or null
1193 * @size_t msz@ = length of associated message
1194 * @buf *b@ = where to find the challenge
1196 * Returns: Zero if OK, nonzero if it didn't work.
1198 * Use: Checks a challenge. On failure, the buffer is broken.
1201 extern int c_check(const void */
*m*/
, size_t /*msz*/, buf */
*b*/
);
1203 /*----- Administration interface ------------------------------------------*/
1205 #define A_END ((char *)0)
1207 /* --- @a_vformat@ --- *
1209 * Arguments: @dstr *d@ = where to leave the formatted message
1210 * @const char *fmt@ = pointer to format string
1211 * @va_list *ap@ = arguments in list
1215 * Use: Main message token formatting driver. The arguments are
1216 * interleaved formatting tokens and their parameters, finally
1217 * terminated by an entry @A_END@.
1219 * Tokens recognized:
1221 * * "*..." ... -- pretokenized @dstr_putf@-like string
1223 * * "?ADDR" SOCKADDR -- a socket address, to be converted
1225 * * "?B64" BUFFER SIZE -- binary data to be base64-encoded
1227 * * "?TOKENS" VECTOR -- null-terminated vector of tokens
1229 * * "?PEER" PEER -- peer's name
1231 * * "?ERRNO" ERRNO -- system error code
1233 * * "[!]..." ... -- @dstr_putf@-like string as single token
1236 extern void a_vformat(dstr */
*d*/
, const char */
*fmt*/
, va_list */
*ap*/
);
1238 /* --- @a_format@ --- *
1240 * Arguments: @dstr *d@ = where to leave the formatted message
1241 * @const char *fmt@ = pointer to format string
1245 * Use: Writes a tokenized message into a string, for later
1249 extern void EXECL_LIKE(0) a_format(dstr */
*d*/
, const char */
*fmt*/
, ...);
1251 /* --- @a_info@ --- *
1253 * Arguments: @admin *a@ = connection
1254 * @const char *fmt@ = format string
1255 * @...@ = other arguments
1259 * Use: Report information to an admin client.
1262 extern void EXECL_LIKE(0) a_info(admin */
*a*/
, const char */
*fmt*/
, ...);
1264 /* --- @a_warn@ --- *
1266 * Arguments: @const char *fmt@ = pointer to format string
1267 * @...@ = other arguments
1271 * Use: Informs all admin connections of a warning.
1274 extern void EXECL_LIKE(0) a_warn(const char */
*fmt*/
, ...);
1276 /* --- @a_notify@ --- *
1278 * Arguments: @const char *fmt@ = pointer to format string
1279 * @...@ = other arguments
1283 * Use: Sends a notification to interested admin connections.
1286 extern void EXECL_LIKE(0) a_notify(const char */
*fmt*/
, ...);
1288 /* --- @a_create@ --- *
1290 * Arguments: @int fd_in, fd_out@ = file descriptors to use
1291 * @unsigned f@ = initial flags to set
1295 * Use: Creates a new admin connection.
1298 extern void a_create(int /*fd_in*/, int /*fd_out*/, unsigned /*f*/);
1300 /* --- @a_quit@ --- *
1306 * Use: Shuts things down nicely.
1309 extern void a_quit(void);
1311 /* --- @a_preselect@ --- *
1317 * Use: Informs the admin module that we're about to select again,
1318 * and that it should do cleanup things it has delayed until a
1322 extern void a_preselect(void);
1324 /* --- @a_daemon@ --- *
1330 * Use: Informs the admin module that it's a daemon.
1333 extern void a_daemon(void);
1335 /* --- @a_init@ --- *
1337 * Arguments: @const char *sock@ = socket name to create
1338 * @uid_t u@ = user to own the socket
1339 * @gid_t g@ = group to own the socket
1340 * @mode_t m@ = permissions to set on the socket
1344 * Use: Creates the admin listening socket.
1347 extern void a_init(const char */
*sock*/
,
1348 uid_t
/*u*/, gid_t
/*g*/, mode_t
/*m*/);
1350 /*----- Mapping with addresses as keys ------------------------------------*/
1352 /* --- @am_create@ --- *
1354 * Arguments: @addrmap *m@ = pointer to map
1358 * Use: Create an address map, properly set up.
1361 extern void am_create(addrmap */
*m*/
);
1363 /* --- @am_destroy@ --- *
1365 * Arguments: @addrmap *m@ = pointer to map
1369 * Use: Destroy an address map, throwing away all the entries.
1372 extern void am_destroy(addrmap */
*m*/
);
1374 /* --- @am_find@ --- *
1376 * Arguments: @addrmap *m@ = pointer to map
1377 * @const addr *a@ = address to look up
1378 * @size_t sz@ = size of block to allocate
1379 * @unsigned *f@ = where to store flags
1381 * Returns: Pointer to found item, or null.
1383 * Use: Finds a record with the given IP address, set @*f@ nonzero
1384 * and returns it. If @sz@ is zero, and no match was found,
1385 * return null; otherwise allocate a new block of @sz@ bytes,
1386 * clear @*f@ to zero and return the block pointer.
1389 extern void *am_find(addrmap */
*m*/
, const addr */
*a*/
,
1390 size_t /*sz*/, unsigned */
*f*/
);
1392 /* --- @am_remove@ --- *
1394 * Arguments: @addrmap *m@ = pointer to map
1395 * @void *i@ = pointer to the item
1399 * Use: Removes an item from the map.
1402 extern void am_remove(addrmap */
*m*/
, void */
*i*/
);
1404 /*----- Privilege separation ----------------------------------------------*/
1406 /* --- @ps_trace@ --- *
1408 * Arguments: @unsigned mask@ = trace mask to check
1409 * @const char *fmt@ = message format
1410 * @...@ = values for placeholders
1414 * Use: Writes a trace message.
1417 T( extern void PRINTF_LIKE(2, 3)
1418 ps_trace(unsigned /*mask*/, const char */
*fmt*/
, ...); )
1420 /* --- @ps_warn@ --- *
1422 * Arguments: @const char *fmt@ = message format
1423 * @...@ = values for placeholders
1427 * Use: Writes a warning message.
1430 extern void PRINTF_LIKE(1, 2) ps_warn(const char */
*fmt*/
, ...);
1432 /* --- @ps_tunfd@ --- *
1434 * Arguments: @const tunnel_ops *tops@ = pointer to tunnel operations
1435 * @char **ifn@ = where to put the interface name
1437 * Returns: The file descriptor, or @-1@ on error.
1439 * Use: Fetches a file descriptor for a tunnel driver.
1442 extern int ps_tunfd(const tunnel_ops */
*tops*/
, char **/
*ifn*/
);
1444 /* --- @ps_split@ --- *
1446 * Arguments: @int detachp@ = whether to detach the child from its terminal
1450 * Use: Separates off the privileged tunnel-opening service from the
1451 * rest of the server.
1454 extern void ps_split(int /*detachp*/);
1456 /* --- @ps_quit@ --- *
1462 * Use: Detaches from the helper process.
1465 extern void ps_quit(void);
1467 /*----- Peer management ---------------------------------------------------*/
1469 /* --- @p_updateaddr@ --- *
1471 * Arguments: @peer *p@ = pointer to peer block
1472 * @const addr *a@ = address to associate with this peer
1474 * Returns: Zero if the address was changed; @+1@ if it was already
1477 * Use: Updates our idea of @p@'s address.
1480 extern int p_updateaddr(peer */
*p*/
, const addr */
*a*/
);
1482 /* --- @p_txstart@ --- *
1484 * Arguments: @peer *p@ = pointer to peer block
1485 * @unsigned msg@ = message type code
1487 * Returns: A pointer to a buffer to write to.
1489 * Use: Starts sending to a peer. Only one send can happen at a
1493 extern buf
*p_txstart(peer */
*p*/
, unsigned /*msg*/);
1495 /* --- @p_txaddr@ --- *
1497 * Arguments: @const addr *a@ = recipient address
1498 * @const void *p@ = pointer to packet to send
1499 * @size_t sz@ = length of packet
1501 * Returns: Zero if successful, nonzero on error.
1503 * Use: Sends a packet to an address which (possibly) isn't a current
1507 extern int p_txaddr(const addr */
*a*/
, const void */
*p*/
, size_t /*sz*/);
1509 /* --- @p_txend@ --- *
1511 * Arguments: @peer *p@ = pointer to peer block
1515 * Use: Sends a packet to the peer.
1518 extern void p_txend(peer */
*p*/
);
1520 /* --- @p_pingsend@ --- *
1522 * Arguments: @peer *p@ = destination peer
1523 * @ping *pg@ = structure to fill in
1524 * @unsigned type@ = message type
1525 * @unsigned long timeout@ = how long to wait before giving up
1526 * @void (*func)(int, void *)@ = callback function
1527 * @void *arg@ = argument for callback
1529 * Returns: Zero if successful, nonzero if it failed.
1531 * Use: Sends a ping to a peer. Call @func@ with a nonzero argument
1532 * if we get an answer within the timeout, or zero if no answer.
1535 extern int p_pingsend(peer */
*p*/
, ping */
*pg*/
, unsigned /*type*/,
1536 unsigned long /*timeout*/,
1537 void (*/
*func*/
)(int, void *), void */
*arg*/
);
1539 /* --- @p_pingdone@ --- *
1541 * Arguments: @ping *p@ = ping structure
1542 * @int rc@ = return code to pass on
1546 * Use: Disposes of a ping structure, maybe sending a notification.
1549 extern void p_pingdone(ping */
*p*/
, int /*rc*/);
1551 /* --- @p_greet@ --- *
1553 * Arguments: @peer *p@ = peer to send to
1554 * @const void *c@ = pointer to challenge
1555 * @size_t sz@ = size of challenge
1559 * Use: Sends a greeting packet.
1562 extern void p_greet(peer */
*p*/
, const void */
*c*/
, size_t /*sz*/);
1564 /* --- @p_tun@ --- *
1566 * Arguments: @peer *p@ = pointer to peer block
1567 * @buf *b@ = buffer containing incoming packet
1571 * Use: Handles a packet which needs to be sent to a peer.
1574 extern void p_tun(peer */
*p*/
, buf */
*b*/
);
1576 /* --- @p_keyreload@ --- *
1582 * Use: Forces a check of the daemon's keyring files.
1585 extern void p_keyreload(void);
1587 /* --- @p_interval@ --- *
1593 * Use: Called periodically to do tidying.
1596 extern void p_interval(void);
1598 /* --- @p_stats@ --- *
1600 * Arguments: @peer *p@ = pointer to a peer block
1602 * Returns: A pointer to the peer's statistics.
1605 extern stats
*p_stats(peer */
*p*/
);
1607 /* --- @p_ifname@ --- *
1609 * Arguments: @peer *p@ = pointer to a peer block
1611 * Returns: A pointer to the peer's interface name.
1614 extern const char *p_ifname(peer */
*p*/
);
1616 /* --- @p_setifname@ --- *
1618 * Arguments: @peer *p@ = pointer to a peer block
1619 * @const char *name@ = pointer to the new name
1623 * Use: Changes the name held for a peer's interface.
1626 extern void p_setifname(peer */
*p*/
, const char */
*name*/
);
1628 /* --- @p_addr@ --- *
1630 * Arguments: @peer *p@ = pointer to a peer block
1632 * Returns: A pointer to the peer's address.
1635 extern const addr
*p_addr(peer */
*p*/
);
1637 /* --- @p_init@ --- *
1639 * Arguments: @struct addrinfo *ailist@ = addresses to bind to
1643 * Use: Initializes the peer system; creates the socket.
1646 extern void p_init(struct addrinfo */
*ailist*/
);
1648 /* --- @p_port@ --- *
1650 * Arguments: @int i@ = address family index to retrieve
1652 * Returns: Port number used for socket.
1655 extern unsigned p_port(int /*i*/);
1657 /* --- @p_create@ --- *
1659 * Arguments: @peerspec *spec@ = information about this peer
1661 * Returns: Pointer to the peer block, or null if it failed.
1663 * Use: Creates a new named peer block. No peer is actually attached
1667 extern peer
*p_create(peerspec */
*spec*/
);
1669 /* --- @p_name@ --- *
1671 * Arguments: @peer *p@ = pointer to a peer block
1673 * Returns: A pointer to the peer's name.
1675 * Use: Equivalent to @p_spec(p)->name@.
1678 extern const char *p_name(peer */
*p*/
);
1680 /* --- @p_tag@ --- *
1682 * Arguments: @peer *p@ = pointer to a peer block
1684 * Returns: A pointer to the peer's public key tag.
1687 extern const char *p_tag(peer */
*p*/
);
1689 /* --- @p_privtag@ --- *
1691 * Arguments: @peer *p@ = pointer to a peer block
1693 * Returns: A pointer to the peer's private key tag.
1696 extern const char *p_privtag(peer */
*p*/
);
1698 /* --- @p_spec@ --- *
1700 * Arguments: @peer *p@ = pointer to a peer block
1702 * Returns: Pointer to the peer's specification
1705 extern const peerspec
*p_spec(peer */
*p*/
);
1707 /* --- @p_findbyaddr@ --- *
1709 * Arguments: @const addr *a@ = address to look up
1711 * Returns: Pointer to the peer block, or null if not found.
1713 * Use: Finds a peer by address.
1716 extern peer
*p_findbyaddr(const addr */
*a*/
);
1718 /* --- @p_find@ --- *
1720 * Arguments: @const char *name@ = name to look up
1722 * Returns: Pointer to the peer block, or null if not found.
1724 * Use: Finds a peer by name.
1727 extern peer
*p_find(const char */
*name*/
);
1729 /* --- @p_destroy@ --- *
1731 * Arguments: @peer *p@ = pointer to a peer
1732 * @int bye@ = say goodbye to the peer?
1736 * Use: Destroys a peer.
1739 extern void p_destroy(peer */
*p*/
, int /*bye*/);
1741 /* --- @FOREACH_PEER@ --- *
1743 * Arguments: @p@ = name to bind to each peer
1744 * @stuff@ = thing to do for each item
1746 * Use: Does something for each current peer.
1749 #define FOREACH_PEER(p, stuff) do { \
1752 for (p_mkiter(&i_); (p = p_next(&i_)) != 0; ) stuff \
1755 /* --- @p_mkiter@ --- *
1757 * Arguments: @peer_iter *i@ = pointer to an iterator
1761 * Use: Initializes the iterator.
1764 extern void p_mkiter(peer_iter */
*i*/
);
1766 /* --- @p_next@ --- *
1768 * Arguments: @peer_iter *i@ = pointer to an iterator
1770 * Returns: Next peer, or null if at the end.
1772 * Use: Returns the next peer.
1775 extern peer
*p_next(peer_iter */
*i*/
);
1777 /*----- Tunnel drivers ----------------------------------------------------*/
1780 extern const tunnel_ops tun_linux
;
1784 extern const tunnel_ops tun_unet
;
1788 extern const tunnel_ops tun_bsd
;
1791 extern const tunnel_ops tun_slip
;
1793 /*----- Other handy utilities ---------------------------------------------*/
1795 /* --- @timestr@ --- *
1797 * Arguments: @time_t t@ = a time to convert
1799 * Returns: A pointer to a textual representation of the time.
1801 * Use: Converts a time to a textual representation. Corrupts
1805 extern const char *timestr(time_t /*t*/);
1807 /* --- @mystrieq@ --- *
1809 * Arguments: @const char *x, *y@ = two strings
1811 * Returns: True if @x@ and @y are equal, up to case.
1814 extern int mystrieq(const char */
*x*/
, const char */
*y*/
);
1818 * Arguments: @int af@ = an address family code
1820 * Returns: The index of the address family's record in @aftab@, or @-1@.
1823 extern int afix(int af
);
1825 /* --- @addrsz@ --- *
1827 * Arguments: @const addr *a@ = a network address
1829 * Returns: The size of the address, for passing into the sockets API.
1832 extern socklen_t
addrsz(const addr */
*a*/
);
1834 /* --- @getport@, @setport@ --- *
1836 * Arguments: @addr *a@ = a network address
1837 * @unsigned port@ = port number to set
1841 * Use: Retrieves or sets the port number in an address structure.
1844 extern unsigned getport(addr */
*a*/
);
1845 extern void setport(addr */
*a*/
, unsigned /*port*/);
1847 /* --- @seq_reset@ --- *
1849 * Arguments: @seqwin *s@ = sequence-checking window
1853 * Use: Resets a sequence number window.
1856 extern void seq_reset(seqwin */
*s*/
);
1858 /* --- @seq_check@ --- *
1860 * Arguments: @seqwin *s@ = sequence-checking window
1861 * @uint32 q@ = sequence number to check
1862 * @const char *service@ = service to report message from
1864 * Returns: A @SEQ_@ code.
1866 * Use: Checks a sequence number against the window, updating things
1870 extern int seq_check(seqwin */
*s*/
, uint32
/*q*/, const char */
*service*/
);
1872 typedef struct ratelim
{
1873 unsigned n
, max
, persec
;
1874 struct timeval when
;
1877 /* --- @ratelim_init@ --- *
1879 * Arguments: @ratelim *r@ = rate-limiting state to fill in
1880 * @unsigned persec@ = credit to accumulate per second
1881 * @unsigned max@ = maximum credit to retain
1885 * Use: Initialize a rate-limiting state.
1888 extern void ratelim_init(ratelim */
*r*/
,
1889 unsigned /*persec*/, unsigned /*max*/);
1891 /* --- @ratelim_withdraw@ --- *
1893 * Arguments: @ratelim *r@ = rate-limiting state
1894 * @unsigned n@ = credit to withdraw
1896 * Returns: Zero if successful; @-1@ if there is unsufficient credit
1898 * Use: Updates the state with any accumulated credit. Then, if
1899 * there there are more than @n@ credits available, withdraw @n@
1900 * and return successfully; otherwise, report failure.
1903 extern int ratelim_withdraw(ratelim */
*r*/
, unsigned /*n*/);
1905 /* --- @ies_encrypt@ --- *
1907 * Arguments: @kdata *kpub@ = recipient's public key
1908 * @unsigned ty@ = message type octet
1909 * @buf *b@ = input message buffer
1910 * @buf *bb@ = output buffer for the ciphertext
1912 * Returns: On error, returns a @KSERR_...@ code or breaks the buffer;
1913 * on success, returns zero and the buffer is good.
1915 * Use: Encrypts a message for a recipient, given their public key.
1916 * This does not (by itself) provide forward secrecy or sender
1917 * authenticity. The ciphertext is self-delimiting (unlike
1921 extern int ies_encrypt(kdata */
*kpub*/
, unsigned /*ty*/,
1922 buf */
*b*/
, buf */
*bb*/
);
1924 /* --- @ies_decrypt@ --- *
1926 * Arguments: @kdata *kpub@ = private key key
1927 * @unsigned ty@ = message type octet
1928 * @buf *b@ = input ciphertext buffer
1929 * @buf *bb@ = output buffer for the message
1931 * Returns: On error, returns a @KSERR_...@ code; on success, returns
1932 * zero and the buffer is good.
1934 * Use: Decrypts a message encrypted using @ies_encrypt@, given our
1938 extern int ies_decrypt(kdata */
*kpriv*/
, unsigned /*ty*/,
1939 buf */
*b*/
, buf */
*bb*/
);
1941 /*----- That's all, folks -------------------------------------------------*/