site: Generalise deletion and timeout of keys
[secnet] / site.c
CommitLineData
2fe58dfd
SE
1/* site.c - manage communication with a remote network site */
2
469fd1d9
SE
3/* The 'site' code doesn't know anything about the structure of the
4 packets it's transmitting. In fact, under the new netlink
5 configuration scheme it doesn't need to know anything at all about
6 IP addresses, except how to contact its peer. This means it could
7 potentially be used to tunnel other protocols too (IPv6, IPX, plain
8 old Ethernet frames) if appropriate netlink code can be written
9 (and that ought not to be too hard, eg. using the TUN/TAP device to
10 pretend to be an Ethernet interface). */
11
ff05a229
SE
12/* At some point in the future the netlink code will be asked for
13 configuration information to go in the PING/PONG packets at the end
14 of the key exchange. */
15
8689b3a9 16#include "secnet.h"
2fe58dfd 17#include <stdio.h>
469fd1d9 18#include <string.h>
fe5e9cc4 19#include <limits.h>
58650a70 20#include <assert.h>
8689b3a9 21#include <sys/socket.h>
2fe58dfd 22
8689b3a9 23#include <sys/mman.h>
2fe58dfd 24#include "util.h"
59635212 25#include "unaligned.h"
ff05a229 26#include "magic.h"
2fe58dfd
SE
27
28#define SETUP_BUFFER_LEN 2048
29
e7f8ec2a
IJ
30#define DEFAULT_KEY_LIFETIME (3600*1000) /* [ms] */
31#define DEFAULT_KEY_RENEGOTIATE_GAP (5*60*1000) /* [ms] */
2fe58dfd 32#define DEFAULT_SETUP_RETRIES 5
e7f8ec2a
IJ
33#define DEFAULT_SETUP_RETRY_INTERVAL (2*1000) /* [ms] */
34#define DEFAULT_WAIT_TIME (20*1000) /* [ms] */
e57264d6
IJ
35
36#define DEFAULT_MOBILE_KEY_LIFETIME (2*24*3600*1000) /* [ms] */
37#define DEFAULT_MOBILE_KEY_RENEGOTIATE_GAP (12*3600*1000) /* [ms] */
38#define DEFAULT_MOBILE_SETUP_RETRIES 30
39#define DEFAULT_MOBILE_SETUP_RETRY_INTERVAL (1*1000) /* [ms] */
40#define DEFAULT_MOBILE_WAIT_TIME (10*1000) /* [ms] */
41
446353cd
IJ
42#define DEFAULT_MOBILE_PEER_EXPIRY (2*60) /* [s] */
43#define DEFAULT_MOBILE_PEERS_MAX 3 /* send at most this many copies (default) */
2fe58dfd
SE
44
45/* Each site can be in one of several possible states. */
46
47/* States:
48 SITE_STOP - nothing is allowed to happen; tunnel is down;
49 all session keys have been erased
50 -> SITE_RUN upon external instruction
51 SITE_RUN - site up, maybe with valid key
52 -> SITE_RESOLVE upon outgoing packet and no valid key
53 we start name resolution for the other end of the tunnel
54 -> SITE_SENTMSG2 upon valid incoming message 1 and suitable time
55 we send an appropriate message 2
56 SITE_RESOLVE - waiting for name resolution
57 -> SITE_SENTMSG1 upon successful resolution
58 we send an appropriate message 1
59 -> SITE_SENTMSG2 upon valid incoming message 1 (then abort resolution)
60 we abort resolution and
61 -> SITE_WAIT on timeout or resolution failure
62 SITE_SENTMSG1
63 -> SITE_SENTMSG2 upon valid incoming message 1 from higher priority end
64 -> SITE_SENTMSG3 upon valid incoming message 2
65 -> SITE_WAIT on timeout
66 SITE_SENTMSG2
67 -> SITE_SENTMSG4 upon valid incoming message 3
68 -> SITE_WAIT on timeout
69 SITE_SENTMSG3
70 -> SITE_SENTMSG5 upon valid incoming message 4
71 -> SITE_WAIT on timeout
72 SITE_SENTMSG4
73 -> SITE_RUN upon valid incoming message 5
74 -> SITE_WAIT on timeout
75 SITE_SENTMSG5
76 -> SITE_RUN upon valid incoming message 6
77 -> SITE_WAIT on timeout
78 SITE_WAIT - failed to establish key; do nothing for a while
79 -> SITE_RUN on timeout
80 */
81
82#define SITE_STOP 0
83#define SITE_RUN 1
84#define SITE_RESOLVE 2
85#define SITE_SENTMSG1 3
86#define SITE_SENTMSG2 4
87#define SITE_SENTMSG3 5
88#define SITE_SENTMSG4 6
89#define SITE_SENTMSG5 7
90#define SITE_WAIT 8
91
fe5e9cc4 92static cstring_t state_name(uint32_t state)
2fe58dfd
SE
93{
94 switch (state) {
3454dce4
SE
95 case 0: return "STOP";
96 case 1: return "RUN";
97 case 2: return "RESOLVE";
98 case 3: return "SENTMSG1";
99 case 4: return "SENTMSG2";
100 case 5: return "SENTMSG3";
101 case 6: return "SENTMSG4";
102 case 7: return "SENTMSG5";
103 case 8: return "WAIT";
2fe58dfd
SE
104 default: return "*bad state*";
105 }
106}
107
2fe58dfd
SE
108#define NONCELEN 8
109
110#define LOG_UNEXPECTED 0x00000001
111#define LOG_SETUP_INIT 0x00000002
112#define LOG_SETUP_TIMEOUT 0x00000004
113#define LOG_ACTIVATE_KEY 0x00000008
114#define LOG_TIMEOUT_KEY 0x00000010
9d3a4132 115#define LOG_SEC 0x00000020
2fe58dfd
SE
116#define LOG_STATE 0x00000040
117#define LOG_DROP 0x00000080
118#define LOG_DUMP 0x00000100
119#define LOG_ERROR 0x00000400
446353cd 120#define LOG_PEER_ADDRS 0x00000800
2fe58dfd 121
9d3a4132
SE
122static struct flagstr log_event_table[]={
123 { "unexpected", LOG_UNEXPECTED },
124 { "setup-init", LOG_SETUP_INIT },
125 { "setup-timeout", LOG_SETUP_TIMEOUT },
126 { "activate-key", LOG_ACTIVATE_KEY },
127 { "timeout-key", LOG_TIMEOUT_KEY },
128 { "security", LOG_SEC },
129 { "state-change", LOG_STATE },
130 { "packet-drop", LOG_DROP },
131 { "dump-packets", LOG_DUMP },
132 { "errors", LOG_ERROR },
446353cd 133 { "peer-addrs", LOG_PEER_ADDRS },
ff05a229
SE
134 { "default", LOG_SETUP_INIT|LOG_SETUP_TIMEOUT|
135 LOG_ACTIVATE_KEY|LOG_TIMEOUT_KEY|LOG_SEC|LOG_ERROR },
9d3a4132
SE
136 { "all", 0xffffffff },
137 { NULL, 0 }
138};
139
446353cd
IJ
140
141/***** TRANSPORT PEERS declarations *****/
142
143/* Details of "mobile peer" semantics:
144
145 - We record mobile_peers_max peer address/port numbers ("peers")
146 for key setup, and separately mobile_peers_max for data
147 transfer. If these lists fill up, we retain the newest peers.
148 (For non-mobile peers we only record one of each.)
149
150 - Outgoing packets are sent to every recorded peer in the
151 applicable list.
152
153 - Data transfer peers are straightforward: whenever we successfully
154 process a data packet, we record the peer. Also, whenever we
155 successfully complete a key setup, we merge the key setup
156 peers into the data transfer peers.
157
158 (For "non-mobile" peers we simply copy the peer used for
159 successful key setup, and don't change the peer otherwise.)
160
161 - Key setup peers are slightly more complicated.
162
163 Whenever we receive and successfully process a key exchange
164 packet, we record the peer.
165
166 Whenever we try to initiate a key setup, we copy the list of data
167 transfer peers and use it for key setup. But we also look to see
168 if the config supplies an address and port number and if so we
169 add that as a key setup peer (possibly evicting one of the data
170 transfer peers we just copied).
171
172 (For "non-mobile" peers, if we if we have a configured peer
173 address and port, we always use that; otherwise if we have a
174 current data peer address we use that; otherwise we do not
175 attempt to initiate a key setup for lack of a peer address.)
176
177 "Record the peer" means
178 1. expire any peers last seen >120s ("mobile-peer-expiry") ago
179 2. add the peer of the just received packet to the applicable list
180 (possibly evicting older entries)
181 NB that we do not expire peers until an incoming packet arrives.
182
183 */
184
185#define MAX_MOBILE_PEERS_MAX 5 /* send at most this many copies, compiled max */
186
187typedef struct {
188 struct timeval last;
189 struct comm_addr addr;
190} transport_peer;
191
192typedef struct {
193/* configuration information */
194/* runtime information */
195 int npeers;
196 transport_peer peers[MAX_MOBILE_PEERS_MAX];
197} transport_peers;
198
199static void transport_peers_clear(struct site *st, transport_peers *peers);
200static int transport_peers_valid(transport_peers *peers);
201static void transport_peers_copy(struct site *st, transport_peers *dst,
202 const transport_peers *src);
203
204static void transport_setup_msgok(struct site *st, const struct comm_addr *a);
205static void transport_data_msgok(struct site *st, const struct comm_addr *a);
206static bool_t transport_compute_setupinit_peers(struct site *st,
207 const struct comm_addr *configured_addr /* 0 if none or not found */);
208static void transport_record_peer(struct site *st, transport_peers *peers,
209 const struct comm_addr *addr, const char *m);
210
211static void transport_xmit(struct site *st, transport_peers *peers,
212 struct buffer_if *buf, bool_t candebug);
213
214 /***** END of transport peers declarations *****/
215
216
19e9a588
IJ
217struct data_key {
218 struct transform_inst_if *transform;
219 uint64_t key_timeout; /* End of life of current key */
220 uint32_t remote_session_id;
221};
222
2fe58dfd
SE
223struct site {
224 closure_t cl;
225 struct site_if ops;
226/* configuration information */
227 string_t localname;
228 string_t remotename;
446353cd
IJ
229 bool_t peer_mobile; /* Mobile client support */
230 int32_t transport_peers_max;
ff05a229 231 string_t tunname; /* localname<->remotename by default, used in logs */
2fe58dfd 232 string_t address; /* DNS name for bootstrapping, optional */
ff05a229 233 int remoteport; /* Port for bootstrapping, optional */
2fe58dfd 234 struct netlink_if *netlink;
59533c16
IJ
235 struct comm_if **comms;
236 int ncomms;
2fe58dfd
SE
237 struct resolver_if *resolver;
238 struct log_if *log;
239 struct random_if *random;
240 struct rsaprivkey_if *privkey;
2fe58dfd
SE
241 struct rsapubkey_if *pubkey;
242 struct transform_if *transform;
243 struct dh_if *dh;
244 struct hash_if *hash;
2fe58dfd 245
58650a70 246 uint32_t index; /* Index of this site */
1caa23ff 247 int32_t setup_retries; /* How many times to send setup packets */
e7f8ec2a 248 int32_t setup_retry_interval; /* Initial timeout for setup packets */
4a8aed08 249 int32_t wait_timeout; /* How long to wait if setup unsuccessful */
446353cd 250 int32_t mobile_peer_expiry; /* How long to remember 2ary addresses */
4a8aed08
IJ
251 int32_t key_lifetime; /* How long a key lasts once set up */
252 int32_t key_renegotiate_time; /* If we see traffic (or a keepalive)
9d3a4132
SE
253 after this time, initiate a new
254 key exchange */
2fe58dfd
SE
255
256 uint8_t *setupsig; /* Expected signature of incoming MSG1 packets */
1caa23ff
IJ
257 int32_t setupsiglen; /* Allows us to discard packets quickly if
258 they are not for us */
2fe58dfd
SE
259 bool_t setup_priority; /* Do we have precedence if both sites emit
260 message 1 simultaneously? */
261 uint32_t log_events;
262
263/* runtime information */
264 uint32_t state;
265 uint64_t now; /* Most recently seen time */
266
ff05a229 267 /* The currently established session */
19e9a588 268 struct data_key current;
ff05a229 269 uint64_t renegotiate_key_time; /* When we can negotiate a new key */
446353cd 270 transport_peers peers; /* Current address(es) of peer for data traffic */
2fe58dfd 271
ff05a229
SE
272 /* The current key setup protocol exchange. We can only be
273 involved in one of these at a time. There's a potential for
274 denial of service here (the attacker keeps sending a setup
275 packet; we keep trying to continue the exchange, and have to
276 timeout before we can listen for another setup packet); perhaps
277 we should keep a list of 'bad' sources for setup packets. */
2fe58dfd 278 uint32_t setup_session_id;
446353cd 279 transport_peers setup_peers;
2fe58dfd
SE
280 uint8_t localN[NONCELEN]; /* Nonces for key exchange */
281 uint8_t remoteN[NONCELEN];
282 struct buffer_if buffer; /* Current outgoing key exchange packet */
05f39b4d 283 struct buffer_if scratch;
4a8aed08 284 int32_t retries; /* Number of retries remaining */
2fe58dfd
SE
285 uint64_t timeout; /* Timeout for current state */
286 uint8_t *dhsecret;
287 uint8_t *sharedsecret;
2fe58dfd
SE
288 struct transform_inst_if *new_transform; /* For key setup/verify */
289};
290
fe5e9cc4 291static void slog(struct site *st, uint32_t event, cstring_t msg, ...)
2fe58dfd
SE
292{
293 va_list ap;
7c006408 294 char buf[240];
b2a56f7c 295 uint32_t class;
2fe58dfd
SE
296
297 va_start(ap,msg);
298
299 if (event&st->log_events) {
b2a56f7c
SE
300 switch(event) {
301 case LOG_UNEXPECTED: class=M_INFO; break;
302 case LOG_SETUP_INIT: class=M_INFO; break;
303 case LOG_SETUP_TIMEOUT: class=M_NOTICE; break;
304 case LOG_ACTIVATE_KEY: class=M_INFO; break;
305 case LOG_TIMEOUT_KEY: class=M_INFO; break;
306 case LOG_SEC: class=M_SECURITY; break;
307 case LOG_STATE: class=M_DEBUG; break;
308 case LOG_DROP: class=M_DEBUG; break;
309 case LOG_DUMP: class=M_DEBUG; break;
469fd1d9 310 case LOG_ERROR: class=M_ERR; break;
446353cd 311 case LOG_PEER_ADDRS: class=M_DEBUG; break;
469fd1d9 312 default: class=M_ERR; break;
b2a56f7c
SE
313 }
314
c1d2109a 315 vsnprintf(buf,sizeof(buf),msg,ap);
b2a56f7c 316 st->log->log(st->log->st,class,"%s: %s",st->tunname,buf);
2fe58dfd
SE
317 }
318 va_end(ap);
319}
320
9d3a4132 321static void set_link_quality(struct site *st);
1d388569
IJ
322static void delete_keys(struct site *st, cstring_t reason, uint32_t loglevel);
323static void delete_one_key(struct site *st, struct data_key *key,
324 const char *reason /* may be 0 meaning don't log*/,
325 const char *which /* ignored if !reasonn */,
326 uint32_t loglevel /* ignored if !reasonn */);
fe5e9cc4 327static bool_t initiate_key_setup(struct site *st, cstring_t reason);
2fe58dfd
SE
328static void enter_state_run(struct site *st);
329static bool_t enter_state_resolve(struct site *st);
ff05a229 330static bool_t enter_new_state(struct site *st,uint32_t next);
2fe58dfd 331static void enter_state_wait(struct site *st);
05f39b4d 332static void activate_new_key(struct site *st);
2fe58dfd 333
3d8d8f4e
IJ
334static bool_t current_valid(struct site *st)
335{
19e9a588 336 return st->current.transform->valid(st->current.transform->st);
3d8d8f4e
IJ
337}
338
2fe58dfd
SE
339#define CHECK_AVAIL(b,l) do { if ((b)->size<(l)) return False; } while(0)
340#define CHECK_EMPTY(b) do { if ((b)->size!=0) return False; } while(0)
341#define CHECK_TYPE(b,t) do { uint32_t type; \
342 CHECK_AVAIL((b),4); \
59635212 343 type=buf_unprepend_uint32((b)); \
2fe58dfd
SE
344 if (type!=(t)) return False; } while(0)
345
346struct msg {
347 uint8_t *hashstart;
348 uint32_t dest;
349 uint32_t source;
1caa23ff 350 int32_t remlen;
2fe58dfd 351 uint8_t *remote;
1caa23ff 352 int32_t loclen;
2fe58dfd
SE
353 uint8_t *local;
354 uint8_t *nR;
355 uint8_t *nL;
1caa23ff 356 int32_t pklen;
3e8addad 357 char *pk;
1caa23ff
IJ
358 int32_t hashlen;
359 int32_t siglen;
3e8addad 360 char *sig;
2fe58dfd
SE
361};
362
ff05a229
SE
363/* Build any of msg1 to msg4. msg5 and msg6 are built from the inside
364 out using a transform of config data supplied by netlink */
fe5e9cc4 365static bool_t generate_msg(struct site *st, uint32_t type, cstring_t what)
2fe58dfd
SE
366{
367 void *hst;
3b83c932 368 uint8_t *hash;
2fe58dfd
SE
369 string_t dhpub, sig;
370
371 st->retries=st->setup_retries;
372 BUF_ALLOC(&st->buffer,what);
373 buffer_init(&st->buffer,0);
59635212
SE
374 buf_append_uint32(&st->buffer,
375 (type==LABEL_MSG1?0:st->setup_session_id));
58650a70 376 buf_append_uint32(&st->buffer,st->index);
59635212 377 buf_append_uint32(&st->buffer,type);
2fe58dfd
SE
378 buf_append_string(&st->buffer,st->localname);
379 buf_append_string(&st->buffer,st->remotename);
380 memcpy(buf_append(&st->buffer,NONCELEN),st->localN,NONCELEN);
381 if (type==LABEL_MSG1) return True;
382 memcpy(buf_append(&st->buffer,NONCELEN),st->remoteN,NONCELEN);
383 if (type==LABEL_MSG2) return True;
3b83c932
SE
384
385 if (hacky_par_mid_failnow()) return False;
386
2fe58dfd
SE
387 dhpub=st->dh->makepublic(st->dh->st,st->dhsecret,st->dh->len);
388 buf_append_string(&st->buffer,dhpub);
389 free(dhpub);
3b83c932 390 hash=safe_malloc(st->hash->len, "generate_msg");
2fe58dfd
SE
391 hst=st->hash->init();
392 st->hash->update(hst,st->buffer.start,st->buffer.size);
393 st->hash->final(hst,hash);
394 sig=st->privkey->sign(st->privkey->st,hash,st->hash->len);
395 buf_append_string(&st->buffer,sig);
396 free(sig);
3b83c932 397 free(hash);
2fe58dfd
SE
398 return True;
399}
400
401static bool_t unpick_msg(struct site *st, uint32_t type,
402 struct buffer_if *msg, struct msg *m)
403{
404 m->hashstart=msg->start;
405 CHECK_AVAIL(msg,4);
59635212 406 m->dest=buf_unprepend_uint32(msg);
2fe58dfd 407 CHECK_AVAIL(msg,4);
59635212 408 m->source=buf_unprepend_uint32(msg);
2fe58dfd
SE
409 CHECK_TYPE(msg,type);
410 CHECK_AVAIL(msg,2);
59635212 411 m->remlen=buf_unprepend_uint16(msg);
2fe58dfd
SE
412 CHECK_AVAIL(msg,m->remlen);
413 m->remote=buf_unprepend(msg,m->remlen);
414 CHECK_AVAIL(msg,2);
59635212 415 m->loclen=buf_unprepend_uint16(msg);
2fe58dfd
SE
416 CHECK_AVAIL(msg,m->loclen);
417 m->local=buf_unprepend(msg,m->loclen);
418 CHECK_AVAIL(msg,NONCELEN);
419 m->nR=buf_unprepend(msg,NONCELEN);
420 if (type==LABEL_MSG1) {
421 CHECK_EMPTY(msg);
422 return True;
423 }
424 CHECK_AVAIL(msg,NONCELEN);
425 m->nL=buf_unprepend(msg,NONCELEN);
426 if (type==LABEL_MSG2) {
427 CHECK_EMPTY(msg);
428 return True;
429 }
430 CHECK_AVAIL(msg,2);
59635212 431 m->pklen=buf_unprepend_uint16(msg);
2fe58dfd
SE
432 CHECK_AVAIL(msg,m->pklen);
433 m->pk=buf_unprepend(msg,m->pklen);
434 m->hashlen=msg->start-m->hashstart;
435 CHECK_AVAIL(msg,2);
59635212 436 m->siglen=buf_unprepend_uint16(msg);
2fe58dfd
SE
437 CHECK_AVAIL(msg,m->siglen);
438 m->sig=buf_unprepend(msg,m->siglen);
439 CHECK_EMPTY(msg);
440 return True;
441}
442
ff05a229 443static bool_t check_msg(struct site *st, uint32_t type, struct msg *m,
fe5e9cc4 444 cstring_t *error)
ff05a229
SE
445{
446 if (type==LABEL_MSG1) return True;
447
448 /* Check that the site names and our nonce have been sent
449 back correctly, and then store our peer's nonce. */
450 if (memcmp(m->remote,st->remotename,strlen(st->remotename)!=0)) {
451 *error="wrong remote site name";
452 return False;
453 }
454 if (memcmp(m->local,st->localname,strlen(st->localname)!=0)) {
455 *error="wrong local site name";
456 return False;
457 }
458 if (memcmp(m->nL,st->localN,NONCELEN)!=0) {
459 *error="wrong locally-generated nonce";
460 return False;
461 }
462 if (type==LABEL_MSG2) return True;
463 if (memcmp(m->nR,st->remoteN,NONCELEN)!=0) {
464 *error="wrong remotely-generated nonce";
465 return False;
466 }
467 if (type==LABEL_MSG3) return True;
468 if (type==LABEL_MSG4) return True;
469 *error="unknown message type";
470 return False;
471}
472
2fe58dfd
SE
473static bool_t generate_msg1(struct site *st)
474{
475 st->random->generate(st->random->st,NONCELEN,st->localN);
476 return generate_msg(st,LABEL_MSG1,"site:MSG1");
477}
478
479static bool_t process_msg1(struct site *st, struct buffer_if *msg1,
a15faeb2 480 const struct comm_addr *src)
2fe58dfd
SE
481{
482 struct msg m;
483
484 /* We've already determined we're in an appropriate state to
485 process an incoming MSG1, and that the MSG1 has correct values
486 of A and B. */
487
488 if (!unpick_msg(st,LABEL_MSG1,msg1,&m)) return False;
489
446353cd 490 transport_record_peer(st,&st->setup_peers,src,"msg1");
2fe58dfd
SE
491 st->setup_session_id=m.source;
492 memcpy(st->remoteN,m.nR,NONCELEN);
493 return True;
494}
495
496static bool_t generate_msg2(struct site *st)
497{
498 st->random->generate(st->random->st,NONCELEN,st->localN);
499 return generate_msg(st,LABEL_MSG2,"site:MSG2");
500}
501
502static bool_t process_msg2(struct site *st, struct buffer_if *msg2,
a15faeb2 503 const struct comm_addr *src)
2fe58dfd
SE
504{
505 struct msg m;
fe5e9cc4 506 cstring_t err;
2fe58dfd
SE
507
508 if (!unpick_msg(st,LABEL_MSG2,msg2,&m)) return False;
ff05a229
SE
509 if (!check_msg(st,LABEL_MSG2,&m,&err)) {
510 slog(st,LOG_SEC,"msg2: %s",err);
2fe58dfd
SE
511 return False;
512 }
513 st->setup_session_id=m.source;
514 memcpy(st->remoteN,m.nR,NONCELEN);
515 return True;
516}
517
518static bool_t generate_msg3(struct site *st)
519{
520 /* Now we have our nonce and their nonce. Think of a secret key,
521 and create message number 3. */
522 st->random->generate(st->random->st,st->dh->len,st->dhsecret);
523 return generate_msg(st,LABEL_MSG3,"site:MSG3");
524}
525
526static bool_t process_msg3(struct site *st, struct buffer_if *msg3,
a15faeb2 527 const struct comm_addr *src)
2fe58dfd
SE
528{
529 struct msg m;
3b83c932 530 uint8_t *hash;
2fe58dfd 531 void *hst;
fe5e9cc4 532 cstring_t err;
2fe58dfd
SE
533
534 if (!unpick_msg(st,LABEL_MSG3,msg3,&m)) return False;
ff05a229
SE
535 if (!check_msg(st,LABEL_MSG3,&m,&err)) {
536 slog(st,LOG_SEC,"msg3: %s",err);
2fe58dfd
SE
537 return False;
538 }
ff05a229 539
2fe58dfd 540 /* Check signature and store g^x mod m */
3b83c932 541 hash=safe_malloc(st->hash->len, "process_msg3");
2fe58dfd
SE
542 hst=st->hash->init();
543 st->hash->update(hst,m.hashstart,m.hashlen);
544 st->hash->final(hst,hash);
545 /* Terminate signature with a '0' - cheating, but should be ok */
546 m.sig[m.siglen]=0;
547 if (!st->pubkey->check(st->pubkey->st,hash,st->hash->len,m.sig)) {
59635212 548 slog(st,LOG_SEC,"msg3 signature failed check!");
3b83c932 549 free(hash);
2fe58dfd
SE
550 return False;
551 }
3b83c932 552 free(hash);
2fe58dfd
SE
553
554 /* Terminate their DH public key with a '0' */
555 m.pk[m.pklen]=0;
556 /* Invent our DH secret key */
557 st->random->generate(st->random->st,st->dh->len,st->dhsecret);
558
559 /* Generate the shared key */
560 st->dh->makeshared(st->dh->st,st->dhsecret,st->dh->len,m.pk,
561 st->sharedsecret,st->transform->keylen);
562
563 /* Set up the transform */
564 st->new_transform->setkey(st->new_transform->st,st->sharedsecret,
565 st->transform->keylen);
566
567 return True;
568}
569
570static bool_t generate_msg4(struct site *st)
571{
572 /* We have both nonces, their public key and our private key. Generate
573 our public key, sign it and send it to them. */
574 return generate_msg(st,LABEL_MSG4,"site:MSG4");
575}
576
577static bool_t process_msg4(struct site *st, struct buffer_if *msg4,
a15faeb2 578 const struct comm_addr *src)
2fe58dfd
SE
579{
580 struct msg m;
3b83c932 581 uint8_t *hash;
2fe58dfd 582 void *hst;
fe5e9cc4 583 cstring_t err;
2fe58dfd
SE
584
585 if (!unpick_msg(st,LABEL_MSG4,msg4,&m)) return False;
ff05a229
SE
586 if (!check_msg(st,LABEL_MSG4,&m,&err)) {
587 slog(st,LOG_SEC,"msg4: %s",err);
2fe58dfd
SE
588 return False;
589 }
590
591 /* Check signature and store g^x mod m */
3b83c932 592 hash=safe_malloc(st->hash->len, "process_msg4");
2fe58dfd
SE
593 hst=st->hash->init();
594 st->hash->update(hst,m.hashstart,m.hashlen);
595 st->hash->final(hst,hash);
596 /* Terminate signature with a '0' - cheating, but should be ok */
597 m.sig[m.siglen]=0;
598 if (!st->pubkey->check(st->pubkey->st,hash,st->hash->len,m.sig)) {
59635212 599 slog(st,LOG_SEC,"msg4 signature failed check!");
3b83c932 600 free(hash);
2fe58dfd
SE
601 return False;
602 }
3b83c932 603 free(hash);
2fe58dfd
SE
604
605 /* Terminate their DH public key with a '0' */
606 m.pk[m.pklen]=0;
607 /* Generate the shared key */
608 st->dh->makeshared(st->dh->st,st->dhsecret,st->dh->len,m.pk,
609 st->sharedsecret,st->transform->keylen);
610 /* Set up the transform */
611 st->new_transform->setkey(st->new_transform->st,st->sharedsecret,
612 st->transform->keylen);
613
614 return True;
615}
616
2fe58dfd
SE
617struct msg0 {
618 uint32_t dest;
619 uint32_t source;
620 uint32_t type;
621};
622
623static bool_t unpick_msg0(struct site *st, struct buffer_if *msg0,
624 struct msg0 *m)
625{
626 CHECK_AVAIL(msg0,4);
59635212 627 m->dest=buf_unprepend_uint32(msg0);
2fe58dfd 628 CHECK_AVAIL(msg0,4);
59635212 629 m->source=buf_unprepend_uint32(msg0);
2fe58dfd 630 CHECK_AVAIL(msg0,4);
59635212 631 m->type=buf_unprepend_uint32(msg0);
2fe58dfd
SE
632 return True;
633 /* Leaves transformed part of buffer untouched */
634}
635
ff05a229
SE
636static bool_t generate_msg5(struct site *st)
637{
fe5e9cc4 638 cstring_t transform_err;
ff05a229
SE
639
640 BUF_ALLOC(&st->buffer,"site:MSG5");
641 /* We are going to add four words to the message */
642 buffer_init(&st->buffer,st->transform->max_start_pad+(4*4));
643 /* Give the netlink code an opportunity to put its own stuff in the
644 message (configuration information, etc.) */
ff05a229
SE
645 buf_prepend_uint32(&st->buffer,LABEL_MSG5);
646 st->new_transform->forwards(st->new_transform->st,&st->buffer,
647 &transform_err);
648 buf_prepend_uint32(&st->buffer,LABEL_MSG5);
58650a70 649 buf_prepend_uint32(&st->buffer,st->index);
ff05a229
SE
650 buf_prepend_uint32(&st->buffer,st->setup_session_id);
651
652 st->retries=st->setup_retries;
653 return True;
654}
655
2fe58dfd 656static bool_t process_msg5(struct site *st, struct buffer_if *msg5,
c90cc2a7
IJ
657 const struct comm_addr *src,
658 struct transform_inst_if *transform)
2fe58dfd
SE
659{
660 struct msg0 m;
fe5e9cc4 661 cstring_t transform_err;
2fe58dfd
SE
662
663 if (!unpick_msg0(st,msg5,&m)) return False;
664
c90cc2a7 665 if (transform->reverse(transform->st,msg5,&transform_err)) {
2fe58dfd 666 /* There's a problem */
59635212 667 slog(st,LOG_SEC,"process_msg5: transform: %s",transform_err);
2fe58dfd
SE
668 return False;
669 }
670 /* Buffer should now contain untransformed PING packet data */
671 CHECK_AVAIL(msg5,4);
59635212 672 if (buf_unprepend_uint32(msg5)!=LABEL_MSG5) {
ff05a229 673 slog(st,LOG_SEC,"MSG5/PING packet contained wrong label");
2fe58dfd
SE
674 return False;
675 }
ff7cdc9e
IJ
676 /* Older versions of secnet used to write some config data here
677 * which we ignore. So we don't CHECK_EMPTY */
2fe58dfd
SE
678 return True;
679}
680
c90cc2a7
IJ
681static void create_msg6(struct site *st, struct transform_inst_if *transform,
682 uint32_t session_id)
2fe58dfd 683{
fe5e9cc4 684 cstring_t transform_err;
2fe58dfd
SE
685
686 BUF_ALLOC(&st->buffer,"site:MSG6");
ff05a229
SE
687 /* We are going to add four words to the message */
688 buffer_init(&st->buffer,st->transform->max_start_pad+(4*4));
794f2398
SE
689 /* Give the netlink code an opportunity to put its own stuff in the
690 message (configuration information, etc.) */
ff05a229 691 buf_prepend_uint32(&st->buffer,LABEL_MSG6);
c90cc2a7 692 transform->forwards(transform->st,&st->buffer,&transform_err);
59635212 693 buf_prepend_uint32(&st->buffer,LABEL_MSG6);
58650a70 694 buf_prepend_uint32(&st->buffer,st->index);
c90cc2a7
IJ
695 buf_prepend_uint32(&st->buffer,session_id);
696}
2fe58dfd 697
c90cc2a7
IJ
698static bool_t generate_msg6(struct site *st)
699{
700 create_msg6(st,st->new_transform,st->setup_session_id);
ff05a229 701 st->retries=1; /* Peer will retransmit MSG5 if this packet gets lost */
2fe58dfd
SE
702 return True;
703}
704
705static bool_t process_msg6(struct site *st, struct buffer_if *msg6,
a15faeb2 706 const struct comm_addr *src)
2fe58dfd
SE
707{
708 struct msg0 m;
fe5e9cc4 709 cstring_t transform_err;
2fe58dfd
SE
710
711 if (!unpick_msg0(st,msg6,&m)) return False;
712
713 if (st->new_transform->reverse(st->new_transform->st,
714 msg6,&transform_err)) {
715 /* There's a problem */
59635212 716 slog(st,LOG_SEC,"process_msg6: transform: %s",transform_err);
2fe58dfd
SE
717 return False;
718 }
719 /* Buffer should now contain untransformed PING packet data */
720 CHECK_AVAIL(msg6,4);
59635212
SE
721 if (buf_unprepend_uint32(msg6)!=LABEL_MSG6) {
722 slog(st,LOG_SEC,"MSG6/PONG packet contained invalid data");
2fe58dfd
SE
723 return False;
724 }
ff7cdc9e
IJ
725 /* Older versions of secnet used to write some config data here
726 * which we ignore. So we don't CHECK_EMPTY */
2fe58dfd
SE
727 return True;
728}
729
065e1922 730static bool_t decrypt_msg0(struct site *st, struct buffer_if *msg0)
2fe58dfd 731{
05f39b4d 732 cstring_t transform_err, newkey_err="n/a";
065e1922
IJ
733 struct msg0 m;
734 uint32_t problem;
2fe58dfd 735
2fe58dfd
SE
736 if (!unpick_msg0(st,msg0,&m)) return False;
737
05f39b4d
IJ
738 /* Keep a copy so we can try decrypting it with multiple keys */
739 buffer_copy(&st->scratch, msg0);
740
19e9a588 741 problem = st->current.transform->reverse(st->current.transform->st,
065e1922
IJ
742 msg0,&transform_err);
743 if (!problem) return True;
744
07e4774c
IJ
745 if (problem==2) {
746 slog(st,LOG_DROP,"transform: %s (merely skew)",transform_err);
747 return False;
748 }
749
05f39b4d
IJ
750 if (st->state==SITE_SENTMSG5) {
751 buffer_copy(msg0, &st->scratch);
752 if (!st->new_transform->reverse(st->new_transform->st,
753 msg0,&newkey_err)) {
754 /* It looks like we didn't get the peer's MSG6 */
755 /* This is like a cut-down enter_new_state(SITE_RUN) */
756 slog(st,LOG_STATE,"will enter state RUN (MSG0 with new key)");
757 BUF_FREE(&st->buffer);
758 st->timeout=0;
759 activate_new_key(st);
760 return True; /* do process the data in this packet */
761 }
762 }
763
764 slog(st,LOG_SEC,"transform: %s (new: %s)",transform_err,newkey_err);
065e1922
IJ
765 initiate_key_setup(st,"incoming message would not decrypt");
766 return False;
767}
768
769static bool_t process_msg0(struct site *st, struct buffer_if *msg0,
770 const struct comm_addr *src)
771{
772 uint32_t type;
773
774 if (!decrypt_msg0(st,msg0))
775 return False;
776
2fe58dfd 777 CHECK_AVAIL(msg0,4);
59635212 778 type=buf_unprepend_uint32(msg0);
2fe58dfd 779 switch(type) {
794f2398
SE
780 case LABEL_MSG7:
781 /* We must forget about the current session. */
1d388569 782 delete_keys(st,"request from peer",LOG_SEC);
794f2398 783 return True;
2fe58dfd
SE
784 case LABEL_MSG9:
785 /* Deliver to netlink layer */
469fd1d9 786 st->netlink->deliver(st->netlink->st,msg0);
446353cd 787 transport_data_msgok(st,src);
837cf01e
IJ
788 /* See whether we should start negotiating a new key */
789 if (st->now > st->renegotiate_key_time)
790 initiate_key_setup(st,"incoming packet in renegotiation window");
2fe58dfd 791 return True;
2fe58dfd 792 default:
ff05a229
SE
793 slog(st,LOG_SEC,"incoming encrypted message of type %08x "
794 "(unknown)",type);
2fe58dfd
SE
795 break;
796 }
797 return False;
798}
799
800static void dump_packet(struct site *st, struct buffer_if *buf,
a15faeb2 801 const struct comm_addr *addr, bool_t incoming)
2fe58dfd 802{
59635212
SE
803 uint32_t dest=ntohl(*(uint32_t *)buf->start);
804 uint32_t source=ntohl(*(uint32_t *)(buf->start+4));
805 uint32_t msgtype=ntohl(*(uint32_t *)(buf->start+8));
2fe58dfd
SE
806
807 if (st->log_events & LOG_DUMP)
040ee979
SE
808 slilog(st->log,M_DEBUG,"%s: %s: %08x<-%08x: %08x:",
809 st->tunname,incoming?"incoming":"outgoing",
810 dest,source,msgtype);
2fe58dfd
SE
811}
812
813static uint32_t site_status(void *st)
814{
815 return 0;
816}
817
818static bool_t send_msg(struct site *st)
819{
820 if (st->retries>0) {
446353cd 821 transport_xmit(st, &st->setup_peers, &st->buffer, True);
e7f8ec2a 822 st->timeout=st->now+st->setup_retry_interval;
2fe58dfd
SE
823 st->retries--;
824 return True;
825 } else {
3454dce4
SE
826 slog(st,LOG_SETUP_TIMEOUT,"timed out sending key setup packet "
827 "(in state %s)",state_name(st->state));
2fe58dfd
SE
828 enter_state_wait(st);
829 return False;
830 }
831}
832
833static void site_resolve_callback(void *sst, struct in_addr *address)
834{
835 struct site *st=sst;
446353cd 836 struct comm_addr ca_buf, *ca_use;
2fe58dfd
SE
837
838 if (st->state!=SITE_RESOLVE) {
839 slog(st,LOG_UNEXPECTED,"site_resolve_callback called unexpectedly");
840 return;
841 }
842 if (address) {
446353cd 843 FILLZERO(ca_buf);
59533c16 844 ca_buf.comm=st->comms[0];
446353cd
IJ
845 ca_buf.sin.sin_family=AF_INET;
846 ca_buf.sin.sin_port=htons(st->remoteport);
847 ca_buf.sin.sin_addr=*address;
848 ca_use=&ca_buf;
2fe58dfd 849 } else {
2fe58dfd 850 slog(st,LOG_ERROR,"resolution of %s failed",st->address);
446353cd
IJ
851 ca_use=0;
852 }
853 if (transport_compute_setupinit_peers(st,ca_use)) {
854 enter_new_state(st,SITE_SENTMSG1);
855 } else {
856 /* Can't figure out who to try to to talk to */
857 slog(st,LOG_SETUP_INIT,"key exchange failed: cannot find peer address");
2fe58dfd
SE
858 enter_state_run(st);
859 }
860}
861
fe5e9cc4 862static bool_t initiate_key_setup(struct site *st, cstring_t reason)
9d3a4132
SE
863{
864 if (st->state!=SITE_RUN) return False;
794f2398 865 slog(st,LOG_SETUP_INIT,"initiating key exchange (%s)",reason);
9d3a4132 866 if (st->address) {
794f2398 867 slog(st,LOG_SETUP_INIT,"resolving peer address");
9d3a4132 868 return enter_state_resolve(st);
446353cd 869 } else if (transport_compute_setupinit_peers(st,0)) {
ff05a229 870 return enter_new_state(st,SITE_SENTMSG1);
9d3a4132 871 }
ff05a229 872 slog(st,LOG_SETUP_INIT,"key exchange failed: no address for peer");
9d3a4132
SE
873 return False;
874}
875
2fe58dfd
SE
876static void activate_new_key(struct site *st)
877{
878 struct transform_inst_if *t;
879
ff05a229
SE
880 /* We have two transform instances, which we swap between active
881 and setup */
19e9a588
IJ
882 t=st->current.transform;
883 st->current.transform=st->new_transform;
2fe58dfd
SE
884 st->new_transform=t;
885
886 t->delkey(t->st);
2fe58dfd 887 st->timeout=0;
19e9a588 888 st->current.key_timeout=st->now+st->key_lifetime;
ff05a229 889 st->renegotiate_key_time=st->now+st->key_renegotiate_time;
446353cd 890 transport_peers_copy(st,&st->peers,&st->setup_peers);
19e9a588 891 st->current.remote_session_id=st->setup_session_id;
2fe58dfd
SE
892
893 slog(st,LOG_ACTIVATE_KEY,"new key activated");
9d3a4132 894 enter_state_run(st);
2fe58dfd
SE
895}
896
1d388569
IJ
897static void delete_one_key(struct site *st, struct data_key *key,
898 cstring_t reason, cstring_t which, uint32_t loglevel)
899{
900 if (!key->transform->valid(key->transform->st)) return;
901 if (reason) slog(st,loglevel,"%s deleted (%s)",which,reason);
902 key->transform->delkey(key->transform->st);
903 key->key_timeout=0;
904}
905
906static void delete_keys(struct site *st, cstring_t reason, uint32_t loglevel)
794f2398 907{
3d8d8f4e 908 if (current_valid(st)) {
794f2398
SE
909 slog(st,loglevel,"session closed (%s)",reason);
910
1d388569 911 delete_one_key(st,&st->current,0,0,0);
794f2398
SE
912 set_link_quality(st);
913 }
914}
915
2fe58dfd
SE
916static void state_assert(struct site *st, bool_t ok)
917{
4f5e39ec 918 if (!ok) fatal("site:state_assert");
2fe58dfd
SE
919}
920
921static void enter_state_stop(struct site *st)
922{
923 st->state=SITE_STOP;
924 st->timeout=0;
1d388569 925 delete_keys(st,"entering state STOP",LOG_TIMEOUT_KEY);
2fe58dfd
SE
926 st->new_transform->delkey(st->new_transform->st);
927}
928
9d3a4132
SE
929static void set_link_quality(struct site *st)
930{
931 uint32_t quality;
3d8d8f4e 932 if (current_valid(st))
9d3a4132
SE
933 quality=LINK_QUALITY_UP;
934 else if (st->state==SITE_WAIT || st->state==SITE_STOP)
935 quality=LINK_QUALITY_DOWN;
936 else if (st->address)
937 quality=LINK_QUALITY_DOWN_CURRENT_ADDRESS;
446353cd 938 else if (transport_peers_valid(&st->peers))
9d3a4132
SE
939 quality=LINK_QUALITY_DOWN_STALE_ADDRESS;
940 else
941 quality=LINK_QUALITY_DOWN;
942
469fd1d9 943 st->netlink->set_quality(st->netlink->st,quality);
9d3a4132
SE
944}
945
2fe58dfd
SE
946static void enter_state_run(struct site *st)
947{
948 slog(st,LOG_STATE,"entering state RUN");
949 st->state=SITE_RUN;
950 st->timeout=0;
9d3a4132 951
ff05a229 952 st->setup_session_id=0;
446353cd 953 transport_peers_clear(st,&st->setup_peers);
ff05a229
SE
954 memset(st->localN,0,NONCELEN);
955 memset(st->remoteN,0,NONCELEN);
956 st->new_transform->delkey(st->new_transform->st);
957 memset(st->dhsecret,0,st->dh->len);
958 memset(st->sharedsecret,0,st->transform->keylen);
9d3a4132 959 set_link_quality(st);
2fe58dfd
SE
960}
961
962static bool_t enter_state_resolve(struct site *st)
963{
964 state_assert(st,st->state==SITE_RUN);
965 slog(st,LOG_STATE,"entering state RESOLVE");
966 st->state=SITE_RESOLVE;
967 st->resolver->request(st->resolver->st,st->address,
968 site_resolve_callback,st);
969 return True;
970}
971
ff05a229 972static bool_t enter_new_state(struct site *st, uint32_t next)
2fe58dfd 973{
ff05a229 974 bool_t (*gen)(struct site *st);
3b83c932
SE
975 int r;
976
ff05a229
SE
977 slog(st,LOG_STATE,"entering state %s",state_name(next));
978 switch(next) {
979 case SITE_SENTMSG1:
980 state_assert(st,st->state==SITE_RUN || st->state==SITE_RESOLVE);
981 gen=generate_msg1;
982 break;
983 case SITE_SENTMSG2:
984 state_assert(st,st->state==SITE_RUN || st->state==SITE_RESOLVE ||
985 st->state==SITE_SENTMSG1 || st->state==SITE_WAIT);
986 gen=generate_msg2;
987 break;
988 case SITE_SENTMSG3:
989 state_assert(st,st->state==SITE_SENTMSG1);
990 BUF_FREE(&st->buffer);
991 gen=generate_msg3;
992 break;
993 case SITE_SENTMSG4:
994 state_assert(st,st->state==SITE_SENTMSG2);
995 BUF_FREE(&st->buffer);
996 gen=generate_msg4;
997 break;
998 case SITE_SENTMSG5:
999 state_assert(st,st->state==SITE_SENTMSG3);
1000 BUF_FREE(&st->buffer);
1001 gen=generate_msg5;
1002 break;
1003 case SITE_RUN:
1004 state_assert(st,st->state==SITE_SENTMSG4);
1005 BUF_FREE(&st->buffer);
1006 gen=generate_msg6;
1007 break;
1008 default:
1009 gen=NULL;
4f5e39ec 1010 fatal("enter_new_state(%s): invalid new state",state_name(next));
ff05a229 1011 break;
2fe58dfd 1012 }
2fe58dfd 1013
3b83c932
SE
1014 if (hacky_par_start_failnow()) return False;
1015
1016 r= gen(st) && send_msg(st);
1017
1018 hacky_par_end(&r,
e7f8ec2a 1019 st->setup_retries, st->setup_retry_interval,
3b83c932
SE
1020 send_msg, st);
1021
1022 if (r) {
ff05a229
SE
1023 st->state=next;
1024 if (next==SITE_RUN) {
1025 BUF_FREE(&st->buffer); /* Never reused */
1026 st->timeout=0; /* Never retransmit */
1027 activate_new_key(st);
1028 }
2fe58dfd
SE
1029 return True;
1030 }
ff05a229
SE
1031 slog(st,LOG_ERROR,"error entering state %s",state_name(next));
1032 st->buffer.free=False; /* Unconditionally use the buffer; it may be
1033 in either state, and enter_state_wait() will
1034 do a BUF_FREE() */
2fe58dfd
SE
1035 enter_state_wait(st);
1036 return False;
1037}
1038
ff05a229 1039/* msg7 tells our peer that we're about to forget our key */
fe5e9cc4 1040static bool_t send_msg7(struct site *st, cstring_t reason)
794f2398 1041{
fe5e9cc4 1042 cstring_t transform_err;
794f2398 1043
3d8d8f4e 1044 if (current_valid(st) && st->buffer.free
446353cd 1045 && transport_peers_valid(&st->peers)) {
794f2398
SE
1046 BUF_ALLOC(&st->buffer,"site:MSG7");
1047 buffer_init(&st->buffer,st->transform->max_start_pad+(4*3));
1048 buf_append_uint32(&st->buffer,LABEL_MSG7);
1049 buf_append_string(&st->buffer,reason);
19e9a588 1050 st->current.transform->forwards(st->current.transform->st,
794f2398
SE
1051 &st->buffer, &transform_err);
1052 buf_prepend_uint32(&st->buffer,LABEL_MSG0);
58650a70 1053 buf_prepend_uint32(&st->buffer,st->index);
19e9a588 1054 buf_prepend_uint32(&st->buffer,st->current.remote_session_id);
446353cd 1055 transport_xmit(st,&st->peers,&st->buffer,True);
794f2398
SE
1056 BUF_FREE(&st->buffer);
1057 return True;
1058 }
1059 return False;
1060}
1061
2fe58dfd
SE
1062/* We go into this state if our peer becomes uncommunicative. Similar to
1063 the "stop" state, we forget all session keys for a while, before
1064 re-entering the "run" state. */
1065static void enter_state_wait(struct site *st)
1066{
1067 slog(st,LOG_STATE,"entering state WAIT");
1068 st->timeout=st->now+st->wait_timeout;
1069 st->state=SITE_WAIT;
9d3a4132 1070 set_link_quality(st);
2fe58dfd
SE
1071 BUF_FREE(&st->buffer); /* will have had an outgoing packet in it */
1072 /* XXX Erase keys etc. */
1073}
1074
16f73fa6 1075static inline void site_settimeout(uint64_t timeout, int *timeout_io)
fe5e9cc4
SE
1076{
1077 if (timeout) {
0009e60a
IJ
1078 int64_t offset=timeout-*now;
1079 if (offset<0) offset=0;
fe5e9cc4
SE
1080 if (offset>INT_MAX) offset=INT_MAX;
1081 if (*timeout_io<0 || offset<*timeout_io)
1082 *timeout_io=offset;
1083 }
1084}
1085
2fe58dfd 1086static int site_beforepoll(void *sst, struct pollfd *fds, int *nfds_io,
90a39563 1087 int *timeout_io)
2fe58dfd
SE
1088{
1089 struct site *st=sst;
1090
1091 *nfds_io=0; /* We don't use any file descriptors */
1092 st->now=*now;
1093
1094 /* Work out when our next timeout is. The earlier of 'timeout' or
19e9a588 1095 'current.key_timeout'. A stored value of '0' indicates no timeout
2fe58dfd 1096 active. */
16f73fa6 1097 site_settimeout(st->timeout, timeout_io);
19e9a588 1098 site_settimeout(st->current.key_timeout, timeout_io);
2fe58dfd
SE
1099
1100 return 0; /* success */
1101}
1102
1d388569
IJ
1103static void check_expiry(struct site *st, struct data_key *key,
1104 const char *which)
1105{
1106 if (key->key_timeout && *now>key->key_timeout) {
1107 delete_one_key(st,key,"maximum life exceeded",which,LOG_TIMEOUT_KEY);
1108 }
1109}
1110
2fe58dfd 1111/* NB site_afterpoll will be called before site_beforepoll is ever called */
90a39563 1112static void site_afterpoll(void *sst, struct pollfd *fds, int nfds)
2fe58dfd
SE
1113{
1114 struct site *st=sst;
1115
1116 st->now=*now;
1117 if (st->timeout && *now>st->timeout) {
2fe58dfd 1118 st->timeout=0;
3b83c932
SE
1119 if (st->state>=SITE_SENTMSG1 && st->state<=SITE_SENTMSG5) {
1120 if (!hacky_par_start_failnow())
1121 send_msg(st);
1122 } else if (st->state==SITE_WAIT) {
2fe58dfd
SE
1123 enter_state_run(st);
1124 } else {
1125 slog(st,LOG_ERROR,"site_afterpoll: unexpected timeout, state=%d",
1126 st->state);
1127 }
1128 }
1d388569 1129 check_expiry(st,&st->current,"current key");
2fe58dfd
SE
1130}
1131
1132/* This function is called by the netlink device to deliver packets
1133 intended for the remote network. The packet is in "raw" wire
1134 format, but is guaranteed to be word-aligned. */
469fd1d9 1135static void site_outgoing(void *sst, struct buffer_if *buf)
2fe58dfd
SE
1136{
1137 struct site *st=sst;
fe5e9cc4 1138 cstring_t transform_err;
2fe58dfd
SE
1139
1140 if (st->state==SITE_STOP) {
1141 BUF_FREE(buf);
1142 return;
1143 }
1144
1145 /* In all other states we consider delivering the packet if we have
1146 a valid key and a valid address to send it to. */
3d8d8f4e 1147 if (current_valid(st) && transport_peers_valid(&st->peers)) {
2fe58dfd 1148 /* Transform it and send it */
70dc107b
SE
1149 if (buf->size>0) {
1150 buf_prepend_uint32(buf,LABEL_MSG9);
19e9a588 1151 st->current.transform->forwards(st->current.transform->st,
70dc107b
SE
1152 buf, &transform_err);
1153 buf_prepend_uint32(buf,LABEL_MSG0);
58650a70 1154 buf_prepend_uint32(buf,st->index);
19e9a588 1155 buf_prepend_uint32(buf,st->current.remote_session_id);
446353cd 1156 transport_xmit(st,&st->peers,buf,False);
70dc107b 1157 }
2fe58dfd
SE
1158 BUF_FREE(buf);
1159 return;
1160 }
1161
70dc107b 1162 slog(st,LOG_DROP,"discarding outgoing packet of size %d",buf->size);
2fe58dfd 1163 BUF_FREE(buf);
794f2398 1164 initiate_key_setup(st,"outgoing packet");
2fe58dfd
SE
1165}
1166
1167/* This function is called by the communication device to deliver
1168 packets from our peers. */
1169static bool_t site_incoming(void *sst, struct buffer_if *buf,
a15faeb2 1170 const struct comm_addr *source)
2fe58dfd
SE
1171{
1172 struct site *st=sst;
20138876
IJ
1173
1174 if (buf->size < 12) return False;
1175
59635212 1176 uint32_t dest=ntohl(*(uint32_t *)buf->start);
2fe58dfd
SE
1177
1178 if (dest==0) {
2fe58dfd
SE
1179 /* It could be for any site - it should have LABEL_MSG1 and
1180 might have our name and our peer's name in it */
ff05a229 1181 if (buf->size<(st->setupsiglen+8+NONCELEN)) return False;
2fe58dfd 1182 if (memcmp(buf->start+8,st->setupsig,st->setupsiglen)==0) {
2fe58dfd 1183 /* It's addressed to us. Decide what to do about it. */
ff05a229 1184 dump_packet(st,buf,source,True);
2fe58dfd
SE
1185 if (st->state==SITE_RUN || st->state==SITE_RESOLVE ||
1186 st->state==SITE_WAIT) {
1187 /* We should definitely process it */
1188 if (process_msg1(st,buf,source)) {
1189 slog(st,LOG_SETUP_INIT,"key setup initiated by peer");
ff05a229 1190 enter_new_state(st,SITE_SENTMSG2);
2fe58dfd
SE
1191 } else {
1192 slog(st,LOG_ERROR,"failed to process incoming msg1");
1193 }
1194 BUF_FREE(buf);
1195 return True;
ff05a229 1196 } else if (st->state==SITE_SENTMSG1) {
2fe58dfd
SE
1197 /* We've just sent a message 1! They may have crossed on
1198 the wire. If we have priority then we ignore the
1199 incoming one, otherwise we process it as usual. */
1200 if (st->setup_priority) {
1201 BUF_FREE(buf);
1202 slog(st,LOG_DUMP,"crossed msg1s; we are higher "
1203 "priority => ignore incoming msg1");
1204 return True;
1205 } else {
1206 slog(st,LOG_DUMP,"crossed msg1s; we are lower "
1207 "priority => use incoming msg1");
1208 if (process_msg1(st,buf,source)) {
1209 BUF_FREE(&st->buffer); /* Free our old message 1 */
ff05a229 1210 enter_new_state(st,SITE_SENTMSG2);
2fe58dfd
SE
1211 } else {
1212 slog(st,LOG_ERROR,"failed to process an incoming "
1213 "crossed msg1 (we have low priority)");
1214 }
1215 BUF_FREE(buf);
1216 return True;
1217 }
1218 }
1219 /* The message 1 was received at an unexpected stage of the
1220 key setup. XXX POLICY - what do we do? */
1221 slog(st,LOG_UNEXPECTED,"unexpected incoming message 1");
1222 BUF_FREE(buf);
1223 return True;
1224 }
1225 return False; /* Not for us. */
1226 }
58650a70 1227 if (dest==st->index) {
2fe58dfd 1228 /* Explicitly addressed to us */
ff05a229 1229 uint32_t msgtype=ntohl(get_uint32(buf->start+8));
2fe58dfd
SE
1230 if (msgtype!=LABEL_MSG0) dump_packet(st,buf,source,True);
1231 switch (msgtype) {
794f2398
SE
1232 case 0: /* NAK */
1233 /* If the source is our current peer then initiate a key setup,
1234 because our peer's forgotten the key */
19e9a588 1235 if (get_uint32(buf->start+4)==st->current.remote_session_id) {
794f2398
SE
1236 initiate_key_setup(st,"received a NAK");
1237 } else {
1238 slog(st,LOG_SEC,"bad incoming NAK");
1239 }
1240 break;
2fe58dfd
SE
1241 case LABEL_MSG0:
1242 process_msg0(st,buf,source);
1243 break;
1244 case LABEL_MSG1:
1245 /* Setup packet: should not have been explicitly addressed
1246 to us */
59635212 1247 slog(st,LOG_SEC,"incoming explicitly addressed msg1");
2fe58dfd
SE
1248 break;
1249 case LABEL_MSG2:
1250 /* Setup packet: expected only in state SENTMSG1 */
1251 if (st->state!=SITE_SENTMSG1) {
1252 slog(st,LOG_UNEXPECTED,"unexpected MSG2");
446353cd
IJ
1253 } else if (process_msg2(st,buf,source)) {
1254 transport_setup_msgok(st,source);
ff05a229 1255 enter_new_state(st,SITE_SENTMSG3);
446353cd 1256 } else {
59635212 1257 slog(st,LOG_SEC,"invalid MSG2");
2fe58dfd
SE
1258 }
1259 break;
1260 case LABEL_MSG3:
1261 /* Setup packet: expected only in state SENTMSG2 */
1262 if (st->state!=SITE_SENTMSG2) {
1263 slog(st,LOG_UNEXPECTED,"unexpected MSG3");
446353cd
IJ
1264 } else if (process_msg3(st,buf,source)) {
1265 transport_setup_msgok(st,source);
ff05a229 1266 enter_new_state(st,SITE_SENTMSG4);
446353cd 1267 } else {
59635212 1268 slog(st,LOG_SEC,"invalid MSG3");
2fe58dfd
SE
1269 }
1270 break;
1271 case LABEL_MSG4:
1272 /* Setup packet: expected only in state SENTMSG3 */
1273 if (st->state!=SITE_SENTMSG3) {
1274 slog(st,LOG_UNEXPECTED,"unexpected MSG4");
446353cd
IJ
1275 } else if (process_msg4(st,buf,source)) {
1276 transport_setup_msgok(st,source);
ff05a229 1277 enter_new_state(st,SITE_SENTMSG5);
446353cd 1278 } else {
59635212 1279 slog(st,LOG_SEC,"invalid MSG4");
2fe58dfd
SE
1280 }
1281 break;
1282 case LABEL_MSG5:
4efd681a
SE
1283 /* Setup packet: expected only in state SENTMSG4 */
1284 /* (may turn up in state RUN if our return MSG6 was lost
1285 and the new key has already been activated. In that
05f39b4d
IJ
1286 case we discard it. The peer will realise that we
1287 are using the new key when they see our data packets.
1288 Until then the peer's data packets to us get discarded. */
c90cc2a7
IJ
1289 if (st->state==SITE_SENTMSG4) {
1290 if (process_msg5(st,buf,source,st->new_transform)) {
1291 transport_setup_msgok(st,source);
1292 enter_new_state(st,SITE_RUN);
1293 } else {
1294 slog(st,LOG_SEC,"invalid MSG5");
1295 }
1296 } else if (st->state==SITE_RUN) {
19e9a588 1297 if (process_msg5(st,buf,source,st->current.transform)) {
c90cc2a7
IJ
1298 slog(st,LOG_DROP,"got MSG5, retransmitting MSG6");
1299 transport_setup_msgok(st,source);
19e9a588
IJ
1300 create_msg6(st,st->current.transform,
1301 st->current.remote_session_id);
c90cc2a7
IJ
1302 transport_xmit(st,&st->peers,&st->buffer,True);
1303 BUF_FREE(&st->buffer);
1304 } else {
1305 slog(st,LOG_SEC,"invalid MSG5 (in state RUN)");
1306 }
2fe58dfd 1307 } else {
c90cc2a7 1308 slog(st,LOG_UNEXPECTED,"unexpected MSG5");
2fe58dfd
SE
1309 }
1310 break;
1311 case LABEL_MSG6:
1312 /* Setup packet: expected only in state SENTMSG5 */
1313 if (st->state!=SITE_SENTMSG5) {
1314 slog(st,LOG_UNEXPECTED,"unexpected MSG6");
1315 } else if (process_msg6(st,buf,source)) {
1316 BUF_FREE(&st->buffer); /* Free message 5 */
446353cd 1317 transport_setup_msgok(st,source);
2fe58dfd
SE
1318 activate_new_key(st);
1319 } else {
59635212 1320 slog(st,LOG_SEC,"invalid MSG6");
2fe58dfd
SE
1321 }
1322 break;
2fe58dfd 1323 default:
59635212 1324 slog(st,LOG_SEC,"received message of unknown type 0x%08x",
2fe58dfd
SE
1325 msgtype);
1326 break;
1327 }
1328 BUF_FREE(buf);
1329 return True;
1330 }
1331
1332 return False;
1333}
1334
1335static void site_control(void *vst, bool_t run)
1336{
1337 struct site *st=vst;
1338 if (run) enter_state_run(st);
1339 else enter_state_stop(st);
1340}
1341
794f2398
SE
1342static void site_phase_hook(void *sst, uint32_t newphase)
1343{
1344 struct site *st=sst;
1345
1346 /* The program is shutting down; tell our peer */
1347 send_msg7(st,"shutting down");
1348}
1349
2fe58dfd
SE
1350static list_t *site_apply(closure_t *self, struct cloc loc, dict_t *context,
1351 list_t *args)
1352{
58650a70 1353 static uint32_t index_sequence;
2fe58dfd
SE
1354 struct site *st;
1355 item_t *item;
1356 dict_t *dict;
59533c16 1357 int i;
2fe58dfd
SE
1358
1359 st=safe_malloc(sizeof(*st),"site_apply");
1360
1361 st->cl.description="site";
1362 st->cl.type=CL_SITE;
1363 st->cl.apply=NULL;
1364 st->cl.interface=&st->ops;
1365 st->ops.st=st;
1366 st->ops.control=site_control;
1367 st->ops.status=site_status;
1368
1369 /* First parameter must be a dict */
1370 item=list_elem(args,0);
1371 if (!item || item->type!=t_dict)
1372 cfgfatal(loc,"site","parameter must be a dictionary\n");
1373
1374 dict=item->data.dict;
558fa3fb
SE
1375 st->localname=dict_read_string(dict, "local-name", True, "site", loc);
1376 st->remotename=dict_read_string(dict, "name", True, "site", loc);
dba19f84
IJ
1377
1378 st->peer_mobile=dict_read_bool(dict,"mobile",False,"site",loc,False);
1379 bool_t local_mobile=
1380 dict_read_bool(dict,"local-mobile",False,"site",loc,False);
1381
558fa3fb
SE
1382 /* Sanity check (which also allows the 'sites' file to include
1383 site() closures for all sites including our own): refuse to
1384 talk to ourselves */
1385 if (strcmp(st->localname,st->remotename)==0) {
b2a56f7c 1386 Message(M_DEBUG,"site %s: local-name==name -> ignoring this site\n",
baa06aeb 1387 st->localname);
dba19f84
IJ
1388 if (st->peer_mobile != local_mobile)
1389 cfgfatal(loc,"site","site %s's peer-mobile=%d"
1390 " but our local-mobile=%d\n",
1391 st->localname, st->peer_mobile, local_mobile);
1392 free(st);
1393 return NULL;
1394 }
1395 if (st->peer_mobile && local_mobile) {
1396 Message(M_WARNING,"site %s: site is mobile but so are we"
1397 " -> ignoring this site\n", st->remotename);
558fa3fb
SE
1398 free(st);
1399 return NULL;
1400 }
dba19f84 1401
58650a70
RK
1402 assert(index_sequence < 0xffffffffUL);
1403 st->index = ++index_sequence;
469fd1d9 1404 st->netlink=find_cl_if(dict,"link",CL_NETLINK,True,"site",loc);
59533c16
IJ
1405
1406 list_t *comms_cfg=dict_lookup(dict,"comm");
39a6b1e2 1407 if (!comms_cfg) cfgfatal(loc,"site","closure list \"comm\" not found\n");
59533c16
IJ
1408 st->ncomms=list_length(comms_cfg);
1409 st->comms=safe_malloc_ary(sizeof(*st->comms),st->ncomms,"comms");
1410 assert(st->ncomms);
1411 for (i=0; i<st->ncomms; i++) {
1412 item_t *item=list_elem(comms_cfg,i);
39a6b1e2
IJ
1413 if (item->type!=t_closure)
1414 cfgfatal(loc,"site","comm is not a closure\n");
59533c16 1415 closure_t *cl=item->data.closure;
39a6b1e2 1416 if (cl->type!=CL_COMM) cfgfatal(loc,"site","comm closure wrong type\n");
59533c16
IJ
1417 st->comms[i]=cl->interface;
1418 }
1419
2fe58dfd
SE
1420 st->resolver=find_cl_if(dict,"resolver",CL_RESOLVER,True,"site",loc);
1421 st->log=find_cl_if(dict,"log",CL_LOG,True,"site",loc);
1422 st->random=find_cl_if(dict,"random",CL_RANDOMSRC,True,"site",loc);
1423
2fe58dfd 1424 st->privkey=find_cl_if(dict,"local-key",CL_RSAPRIVKEY,True,"site",loc);
2fe58dfd 1425 st->address=dict_read_string(dict, "address", False, "site", loc);
3454dce4
SE
1426 if (st->address)
1427 st->remoteport=dict_read_number(dict,"port",True,"site",loc,0);
1428 else st->remoteport=0;
2fe58dfd
SE
1429 st->pubkey=find_cl_if(dict,"key",CL_RSAPUBKEY,True,"site",loc);
1430
1431 st->transform=
1432 find_cl_if(dict,"transform",CL_TRANSFORM,True,"site",loc);
1433
1434 st->dh=find_cl_if(dict,"dh",CL_DH,True,"site",loc);
1435 st->hash=find_cl_if(dict,"hash",CL_HASH,True,"site",loc);
1436
e57264d6
IJ
1437#define DEFAULT(D) (st->peer_mobile || local_mobile \
1438 ? DEFAULT_MOBILE_##D : DEFAULT_##D)
e7f8ec2a 1439#define CFG_NUMBER(k,D) dict_read_number(dict,(k),False,"site",loc,DEFAULT(D));
c27ca22f 1440
e7f8ec2a
IJ
1441 st->key_lifetime= CFG_NUMBER("key-lifetime", KEY_LIFETIME);
1442 st->setup_retries= CFG_NUMBER("setup-retries", SETUP_RETRIES);
1443 st->setup_retry_interval= CFG_NUMBER("setup-timeout", SETUP_RETRY_INTERVAL);
1444 st->wait_timeout= CFG_NUMBER("wait-time", WAIT_TIME);
1445
446353cd
IJ
1446 st->mobile_peer_expiry= dict_read_number(
1447 dict,"mobile-peer-expiry",False,"site",loc,DEFAULT_MOBILE_PEER_EXPIRY);
1448
1449 st->transport_peers_max= !st->peer_mobile ? 1 : dict_read_number(
1450 dict,"mobile-peers-max",False,"site",loc,DEFAULT_MOBILE_PEERS_MAX);
1451 if (st->transport_peers_max<1 ||
1452 st->transport_peers_max>=MAX_MOBILE_PEERS_MAX) {
1453 cfgfatal(loc,"site","mobile-peers-max must be in range 1.."
1454 STRING(MAX_MOBILE_PEERS_MAX) "\n");
1455 }
1456
e7f8ec2a 1457 if (st->key_lifetime < DEFAULT(KEY_RENEGOTIATE_GAP)*2)
c27ca22f
IJ
1458 st->key_renegotiate_time=st->key_lifetime/2;
1459 else
e7f8ec2a 1460 st->key_renegotiate_time=st->key_lifetime-DEFAULT(KEY_RENEGOTIATE_GAP);
9d3a4132 1461 st->key_renegotiate_time=dict_read_number(
cce0051f 1462 dict,"renegotiate-time",False,"site",loc,st->key_renegotiate_time);
9d3a4132
SE
1463 if (st->key_renegotiate_time > st->key_lifetime) {
1464 cfgfatal(loc,"site",
1465 "renegotiate-time must be less than key-lifetime\n");
1466 }
9d3a4132
SE
1467
1468 st->log_events=string_list_to_word(dict_lookup(dict,"log-events"),
1469 log_event_table,"site");
2fe58dfd 1470
4efd681a
SE
1471 st->tunname=safe_malloc(strlen(st->localname)+strlen(st->remotename)+5,
1472 "site_apply");
1473 sprintf(st->tunname,"%s<->%s",st->localname,st->remotename);
1474
2fe58dfd 1475 /* The information we expect to see in incoming messages of type 1 */
59230b9b
IJ
1476 /* fixme: lots of unchecked overflows here, but the results are only
1477 corrupted packets rather than undefined behaviour */
2fe58dfd
SE
1478 st->setupsiglen=strlen(st->remotename)+strlen(st->localname)+8;
1479 st->setupsig=safe_malloc(st->setupsiglen,"site_apply");
8689b3a9
SE
1480 put_uint32(st->setupsig+0,LABEL_MSG1);
1481 put_uint16(st->setupsig+4,strlen(st->remotename));
2fe58dfd 1482 memcpy(&st->setupsig[6],st->remotename,strlen(st->remotename));
8689b3a9 1483 put_uint16(st->setupsig+(6+strlen(st->remotename)),strlen(st->localname));
2fe58dfd
SE
1484 memcpy(&st->setupsig[8+strlen(st->remotename)],st->localname,
1485 strlen(st->localname));
1486 st->setup_priority=(strcmp(st->localname,st->remotename)>0);
1487
1488 buffer_new(&st->buffer,SETUP_BUFFER_LEN);
1489
05f39b4d
IJ
1490 buffer_new(&st->scratch,0);
1491 BUF_ALLOC(&st->scratch,"site:scratch");
1492
2fe58dfd
SE
1493 /* We are interested in poll(), but only for timeouts. We don't have
1494 any fds of our own. */
1495 register_for_poll(st, site_beforepoll, site_afterpoll, 0, "site");
1496 st->timeout=0;
1497
19e9a588 1498 st->current.key_timeout=0;
446353cd
IJ
1499 transport_peers_clear(st,&st->peers);
1500 transport_peers_clear(st,&st->setup_peers);
2fe58dfd
SE
1501 /* XXX mlock these */
1502 st->dhsecret=safe_malloc(st->dh->len,"site:dhsecret");
1503 st->sharedsecret=safe_malloc(st->transform->keylen,"site:sharedsecret");
1504
59533c16
IJ
1505 /* We need to compute some properties of our comms */
1506#define COMPUTE_WORST(pad) \
1507 int worst_##pad=0; \
1508 for (i=0; i<st->ncomms; i++) { \
1509 int thispad=st->comms[i]->pad; \
1510 if (thispad > worst_##pad) \
1511 worst_##pad=thispad; \
1512 }
1513 COMPUTE_WORST(min_start_pad)
1514 COMPUTE_WORST(min_end_pad)
1515
2fe58dfd 1516 /* We need to register the remote networks with the netlink device */
469fd1d9 1517 st->netlink->reg(st->netlink->st, site_outgoing, st,
ff05a229 1518 st->transform->max_start_pad+(4*4)+
59533c16
IJ
1519 worst_min_start_pad,
1520 st->transform->max_end_pad+worst_min_end_pad);
ff05a229 1521
59533c16
IJ
1522 for (i=0; i<st->ncomms; i++)
1523 st->comms[i]->request_notify(st->comms[i]->st, st, site_incoming);
2fe58dfd 1524
19e9a588 1525 st->current.transform=st->transform->create(st->transform->st);
2fe58dfd
SE
1526 st->new_transform=st->transform->create(st->transform->st);
1527
1528 enter_state_stop(st);
1529
794f2398
SE
1530 add_hook(PHASE_SHUTDOWN,site_phase_hook,st);
1531
2fe58dfd
SE
1532 return new_closure(&st->cl);
1533}
1534
2fe58dfd
SE
1535void site_module(dict_t *dict)
1536{
1537 add_closure(dict,"site",site_apply);
1538}
446353cd
IJ
1539
1540
1541/***** TRANSPORT PEERS definitions *****/
1542
1543static void transport_peers_debug(struct site *st, transport_peers *dst,
1544 const char *didwhat,
1545 int nargs, const struct comm_addr *args,
1546 size_t stride) {
1547 int i;
1548 char *argp;
1549
1550 if (!(st->log_events & LOG_PEER_ADDRS))
1551 return; /* an optimisation */
1552
1553 slog(st, LOG_PEER_ADDRS, "peers (%s) %s nargs=%d => npeers=%d",
1554 (dst==&st->peers ? "data" :
1555 dst==&st->setup_peers ? "setup" : "UNKNOWN"),
1556 didwhat, nargs, dst->npeers);
1557
1558 for (i=0, argp=(void*)args;
1559 i<nargs;
1560 i++, (argp+=stride?stride:sizeof(*args))) {
1561 const struct comm_addr *ca=(void*)argp;
1562 slog(st, LOG_PEER_ADDRS, " args: addrs[%d]=%s",
1563 i, ca->comm->addr_to_string(ca->comm->st,ca));
1564 }
1565 for (i=0; i<dst->npeers; i++) {
1566 struct timeval diff;
1567 timersub(tv_now,&dst->peers[i].last,&diff);
1568 const struct comm_addr *ca=&dst->peers[i].addr;
1569 slog(st, LOG_PEER_ADDRS, " peers: addrs[%d]=%s T-%ld.%06ld",
1570 i, ca->comm->addr_to_string(ca->comm->st,ca),
1571 (unsigned long)diff.tv_sec, (unsigned long)diff.tv_usec);
1572 }
1573}
1574
1575static int transport_peer_compar(const void *av, const void *bv) {
1576 const transport_peer *a=av;
1577 const transport_peer *b=bv;
1578 /* put most recent first in the array */
1579 if (timercmp(&a->last, &b->last, <)) return +1;
1580 if (timercmp(&a->last, &b->last, >)) return -11;
1581 return 0;
1582}
1583
1584static void transport_peers_expire(struct site *st, transport_peers *peers) {
1585 /* peers must be sorted first */
1586 int previous_peers=peers->npeers;
1587 struct timeval oldest;
1588 oldest.tv_sec = tv_now->tv_sec - st->mobile_peer_expiry;
1589 oldest.tv_usec = tv_now->tv_usec;
1590 while (peers->npeers>1 &&
1591 timercmp(&peers->peers[peers->npeers-1].last, &oldest, <))
1592 peers->npeers--;
1593 if (peers->npeers != previous_peers)
1594 transport_peers_debug(st,peers,"expire", 0,0,0);
1595}
1596
1597static void transport_record_peer(struct site *st, transport_peers *peers,
1598 const struct comm_addr *addr, const char *m) {
1599 int slot, changed=0;
1600
1601 for (slot=0; slot<peers->npeers; slot++)
1602 if (!memcmp(&peers->peers[slot].addr, addr, sizeof(*addr)))
1603 goto found;
1604
1605 changed=1;
1606 if (peers->npeers==st->transport_peers_max)
1607 slot=st->transport_peers_max;
1608 else
1609 slot=peers->npeers++;
1610
1611 found:
1612 peers->peers[slot].addr=*addr;
1613 peers->peers[slot].last=*tv_now;
1614
1615 if (peers->npeers>1)
1616 qsort(peers->peers, peers->npeers,
1617 sizeof(*peers->peers), transport_peer_compar);
1618
1619 if (changed || peers->npeers!=1)
1620 transport_peers_debug(st,peers,m, 1,addr,0);
1621 transport_peers_expire(st, peers);
1622}
1623
1624static bool_t transport_compute_setupinit_peers(struct site *st,
1625 const struct comm_addr *configured_addr /* 0 if none or not found */) {
1626
1627 if (!configured_addr && !transport_peers_valid(&st->peers))
1628 return False;
1629
1630 slog(st,LOG_SETUP_INIT,
1631 (!configured_addr ? "using only %d old peer address(es)"
1632 : "using configured address, and/or perhaps %d old peer address(es)"),
1633 st->peers);
1634
1635 /* Non-mobile peers havve st->peers.npeers==0 or ==1, since they
1636 * have transport_peers_max==1. The effect is that this code
1637 * always uses the configured address if supplied, or otherwise
1638 * the existing data peer if one exists; this is as desired. */
1639
1640 transport_peers_copy(st,&st->setup_peers,&st->peers);
1641
1642 if (configured_addr)
1643 transport_record_peer(st,&st->setup_peers,configured_addr,"setupinit");
1644
1645 assert(transport_peers_valid(&st->setup_peers));
1646 return True;
1647}
1648
1649static void transport_setup_msgok(struct site *st, const struct comm_addr *a) {
1650 if (st->peer_mobile)
1651 transport_record_peer(st,&st->setup_peers,a,"setupmsg");
1652}
1653static void transport_data_msgok(struct site *st, const struct comm_addr *a) {
1654 if (st->peer_mobile)
1655 transport_record_peer(st,&st->peers,a,"datamsg");
1656}
1657
1658static int transport_peers_valid(transport_peers *peers) {
1659 return peers->npeers;
1660}
1661static void transport_peers_clear(struct site *st, transport_peers *peers) {
1662 peers->npeers= 0;
1663 transport_peers_debug(st,peers,"clear",0,0,0);
1664}
1665static void transport_peers_copy(struct site *st, transport_peers *dst,
1666 const transport_peers *src) {
1667 dst->npeers=src->npeers;
1668 memcpy(dst->peers, src->peers, sizeof(*dst->peers) * dst->npeers);
1669 transport_peers_debug(st,dst,"copy",
a620a048 1670 src->npeers, &src->peers->addr, sizeof(*src->peers));
446353cd
IJ
1671}
1672
1673void transport_xmit(struct site *st, transport_peers *peers,
1674 struct buffer_if *buf, bool_t candebug) {
1675 int slot;
1676 transport_peers_expire(st, peers);
1677 for (slot=0; slot<peers->npeers; slot++) {
1678 transport_peer *peer=&peers->peers[slot];
1679 if (candebug)
1680 dump_packet(st, buf, &peer->addr, False);
1681 peer->addr.comm->sendmsg(peer->addr.comm->st, buf, &peer->addr);
1682 }
1683}
1684
1685/***** END of transport peers declarations *****/