Commit | Line | Data |
---|---|---|
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 | ||
3abd18e8 IJ |
92 | int32_t site_max_start_pad = 4*4; |
93 | ||
fe5e9cc4 | 94 | static cstring_t state_name(uint32_t state) |
2fe58dfd SE |
95 | { |
96 | switch (state) { | |
3454dce4 SE |
97 | case 0: return "STOP"; |
98 | case 1: return "RUN"; | |
99 | case 2: return "RESOLVE"; | |
100 | case 3: return "SENTMSG1"; | |
101 | case 4: return "SENTMSG2"; | |
102 | case 5: return "SENTMSG3"; | |
103 | case 6: return "SENTMSG4"; | |
104 | case 7: return "SENTMSG5"; | |
105 | case 8: return "WAIT"; | |
2fe58dfd SE |
106 | default: return "*bad state*"; |
107 | } | |
108 | } | |
109 | ||
2fe58dfd SE |
110 | #define NONCELEN 8 |
111 | ||
112 | #define LOG_UNEXPECTED 0x00000001 | |
113 | #define LOG_SETUP_INIT 0x00000002 | |
114 | #define LOG_SETUP_TIMEOUT 0x00000004 | |
115 | #define LOG_ACTIVATE_KEY 0x00000008 | |
116 | #define LOG_TIMEOUT_KEY 0x00000010 | |
9d3a4132 | 117 | #define LOG_SEC 0x00000020 |
2fe58dfd SE |
118 | #define LOG_STATE 0x00000040 |
119 | #define LOG_DROP 0x00000080 | |
120 | #define LOG_DUMP 0x00000100 | |
121 | #define LOG_ERROR 0x00000400 | |
446353cd | 122 | #define LOG_PEER_ADDRS 0x00000800 |
2fe58dfd | 123 | |
9d3a4132 SE |
124 | static struct flagstr log_event_table[]={ |
125 | { "unexpected", LOG_UNEXPECTED }, | |
126 | { "setup-init", LOG_SETUP_INIT }, | |
127 | { "setup-timeout", LOG_SETUP_TIMEOUT }, | |
128 | { "activate-key", LOG_ACTIVATE_KEY }, | |
129 | { "timeout-key", LOG_TIMEOUT_KEY }, | |
130 | { "security", LOG_SEC }, | |
131 | { "state-change", LOG_STATE }, | |
132 | { "packet-drop", LOG_DROP }, | |
133 | { "dump-packets", LOG_DUMP }, | |
134 | { "errors", LOG_ERROR }, | |
446353cd | 135 | { "peer-addrs", LOG_PEER_ADDRS }, |
ff05a229 SE |
136 | { "default", LOG_SETUP_INIT|LOG_SETUP_TIMEOUT| |
137 | LOG_ACTIVATE_KEY|LOG_TIMEOUT_KEY|LOG_SEC|LOG_ERROR }, | |
9d3a4132 SE |
138 | { "all", 0xffffffff }, |
139 | { NULL, 0 } | |
140 | }; | |
141 | ||
446353cd IJ |
142 | |
143 | /***** TRANSPORT PEERS declarations *****/ | |
144 | ||
145 | /* Details of "mobile peer" semantics: | |
146 | ||
147 | - We record mobile_peers_max peer address/port numbers ("peers") | |
148 | for key setup, and separately mobile_peers_max for data | |
149 | transfer. If these lists fill up, we retain the newest peers. | |
150 | (For non-mobile peers we only record one of each.) | |
151 | ||
152 | - Outgoing packets are sent to every recorded peer in the | |
153 | applicable list. | |
154 | ||
155 | - Data transfer peers are straightforward: whenever we successfully | |
156 | process a data packet, we record the peer. Also, whenever we | |
157 | successfully complete a key setup, we merge the key setup | |
158 | peers into the data transfer peers. | |
159 | ||
160 | (For "non-mobile" peers we simply copy the peer used for | |
161 | successful key setup, and don't change the peer otherwise.) | |
162 | ||
163 | - Key setup peers are slightly more complicated. | |
164 | ||
165 | Whenever we receive and successfully process a key exchange | |
166 | packet, we record the peer. | |
167 | ||
168 | Whenever we try to initiate a key setup, we copy the list of data | |
169 | transfer peers and use it for key setup. But we also look to see | |
170 | if the config supplies an address and port number and if so we | |
171 | add that as a key setup peer (possibly evicting one of the data | |
172 | transfer peers we just copied). | |
173 | ||
174 | (For "non-mobile" peers, if we if we have a configured peer | |
175 | address and port, we always use that; otherwise if we have a | |
176 | current data peer address we use that; otherwise we do not | |
177 | attempt to initiate a key setup for lack of a peer address.) | |
178 | ||
179 | "Record the peer" means | |
180 | 1. expire any peers last seen >120s ("mobile-peer-expiry") ago | |
181 | 2. add the peer of the just received packet to the applicable list | |
182 | (possibly evicting older entries) | |
183 | NB that we do not expire peers until an incoming packet arrives. | |
184 | ||
185 | */ | |
186 | ||
187 | #define MAX_MOBILE_PEERS_MAX 5 /* send at most this many copies, compiled max */ | |
188 | ||
189 | typedef struct { | |
190 | struct timeval last; | |
191 | struct comm_addr addr; | |
192 | } transport_peer; | |
193 | ||
194 | typedef struct { | |
195 | /* configuration information */ | |
196 | /* runtime information */ | |
197 | int npeers; | |
198 | transport_peer peers[MAX_MOBILE_PEERS_MAX]; | |
199 | } transport_peers; | |
200 | ||
201 | static void transport_peers_clear(struct site *st, transport_peers *peers); | |
202 | static int transport_peers_valid(transport_peers *peers); | |
203 | static void transport_peers_copy(struct site *st, transport_peers *dst, | |
204 | const transport_peers *src); | |
205 | ||
206 | static void transport_setup_msgok(struct site *st, const struct comm_addr *a); | |
207 | static void transport_data_msgok(struct site *st, const struct comm_addr *a); | |
208 | static bool_t transport_compute_setupinit_peers(struct site *st, | |
dd9209d1 | 209 | const struct comm_addr *configured_addr /* 0 if none or not found */, |
a96fda35 | 210 | const struct comm_addr *incoming_packet_addr /* 0 if none */); |
90d7e3ad IJ |
211 | static void transport_resolve_complete(struct site *st, |
212 | const struct comm_addr *a); | |
213 | static void transport_resolve_complete_tardy(struct site *st, | |
214 | const struct comm_addr *ca_use); | |
446353cd IJ |
215 | static void transport_record_peer(struct site *st, transport_peers *peers, |
216 | const struct comm_addr *addr, const char *m); | |
217 | ||
218 | static void transport_xmit(struct site *st, transport_peers *peers, | |
219 | struct buffer_if *buf, bool_t candebug); | |
220 | ||
221 | /***** END of transport peers declarations *****/ | |
222 | ||
223 | ||
19e9a588 IJ |
224 | struct data_key { |
225 | struct transform_inst_if *transform; | |
226 | uint64_t key_timeout; /* End of life of current key */ | |
227 | uint32_t remote_session_id; | |
228 | }; | |
229 | ||
2fe58dfd SE |
230 | struct site { |
231 | closure_t cl; | |
232 | struct site_if ops; | |
233 | /* configuration information */ | |
234 | string_t localname; | |
235 | string_t remotename; | |
0391d9ee | 236 | bool_t local_mobile, peer_mobile; /* Mobile client support */ |
446353cd | 237 | int32_t transport_peers_max; |
ff05a229 | 238 | string_t tunname; /* localname<->remotename by default, used in logs */ |
2fe58dfd | 239 | string_t address; /* DNS name for bootstrapping, optional */ |
ff05a229 | 240 | int remoteport; /* Port for bootstrapping, optional */ |
3ed1846a | 241 | uint32_t mtu_target; |
2fe58dfd | 242 | struct netlink_if *netlink; |
59533c16 IJ |
243 | struct comm_if **comms; |
244 | int ncomms; | |
2fe58dfd SE |
245 | struct resolver_if *resolver; |
246 | struct log_if *log; | |
247 | struct random_if *random; | |
248 | struct rsaprivkey_if *privkey; | |
2fe58dfd | 249 | struct rsapubkey_if *pubkey; |
5b5f297f IJ |
250 | struct transform_if **transforms; |
251 | int ntransforms; | |
2fe58dfd SE |
252 | struct dh_if *dh; |
253 | struct hash_if *hash; | |
2fe58dfd | 254 | |
58650a70 | 255 | uint32_t index; /* Index of this site */ |
09a385fb | 256 | uint32_t local_capabilities; |
1caa23ff | 257 | int32_t setup_retries; /* How many times to send setup packets */ |
e7f8ec2a | 258 | int32_t setup_retry_interval; /* Initial timeout for setup packets */ |
4a8aed08 | 259 | int32_t wait_timeout; /* How long to wait if setup unsuccessful */ |
446353cd | 260 | int32_t mobile_peer_expiry; /* How long to remember 2ary addresses */ |
4a8aed08 IJ |
261 | int32_t key_lifetime; /* How long a key lasts once set up */ |
262 | int32_t key_renegotiate_time; /* If we see traffic (or a keepalive) | |
9d3a4132 SE |
263 | after this time, initiate a new |
264 | key exchange */ | |
2fe58dfd | 265 | |
2fe58dfd SE |
266 | bool_t setup_priority; /* Do we have precedence if both sites emit |
267 | message 1 simultaneously? */ | |
268 | uint32_t log_events; | |
269 | ||
270 | /* runtime information */ | |
271 | uint32_t state; | |
272 | uint64_t now; /* Most recently seen time */ | |
dd9209d1 | 273 | bool_t allow_send_prod; |
5c19b79c | 274 | bool_t resolving; |
2fe58dfd | 275 | |
ff05a229 | 276 | /* The currently established session */ |
19e9a588 | 277 | struct data_key current; |
02b0959b | 278 | struct data_key auxiliary_key; |
bd98cd6b | 279 | bool_t auxiliary_is_new; |
ff05a229 | 280 | uint64_t renegotiate_key_time; /* When we can negotiate a new key */ |
bd98cd6b | 281 | uint64_t auxiliary_renegotiate_key_time; |
446353cd | 282 | transport_peers peers; /* Current address(es) of peer for data traffic */ |
2fe58dfd | 283 | |
ff05a229 SE |
284 | /* The current key setup protocol exchange. We can only be |
285 | involved in one of these at a time. There's a potential for | |
286 | denial of service here (the attacker keeps sending a setup | |
287 | packet; we keep trying to continue the exchange, and have to | |
288 | timeout before we can listen for another setup packet); perhaps | |
289 | we should keep a list of 'bad' sources for setup packets. */ | |
09a385fb | 290 | uint32_t remote_capabilities; |
3ed1846a | 291 | uint16_t remote_adv_mtu; |
5b5f297f | 292 | struct transform_if *chosen_transform; |
2fe58dfd | 293 | uint32_t setup_session_id; |
446353cd | 294 | transport_peers setup_peers; |
2fe58dfd SE |
295 | uint8_t localN[NONCELEN]; /* Nonces for key exchange */ |
296 | uint8_t remoteN[NONCELEN]; | |
297 | struct buffer_if buffer; /* Current outgoing key exchange packet */ | |
05f39b4d | 298 | struct buffer_if scratch; |
4a8aed08 | 299 | int32_t retries; /* Number of retries remaining */ |
2fe58dfd SE |
300 | uint64_t timeout; /* Timeout for current state */ |
301 | uint8_t *dhsecret; | |
302 | uint8_t *sharedsecret; | |
5b5f297f | 303 | uint32_t sharedsecretlen, sharedsecretallocd; |
2fe58dfd SE |
304 | struct transform_inst_if *new_transform; /* For key setup/verify */ |
305 | }; | |
306 | ||
8368df34 IJ |
307 | static uint32_t event_log_priority(struct site *st, uint32_t event) |
308 | { | |
309 | if (!(event&st->log_events)) | |
310 | return 0; | |
311 | switch(event) { | |
312 | case LOG_UNEXPECTED: return M_INFO; | |
313 | case LOG_SETUP_INIT: return M_INFO; | |
314 | case LOG_SETUP_TIMEOUT: return M_NOTICE; | |
315 | case LOG_ACTIVATE_KEY: return M_INFO; | |
316 | case LOG_TIMEOUT_KEY: return M_INFO; | |
317 | case LOG_SEC: return M_SECURITY; | |
318 | case LOG_STATE: return M_DEBUG; | |
319 | case LOG_DROP: return M_DEBUG; | |
320 | case LOG_DUMP: return M_DEBUG; | |
321 | case LOG_ERROR: return M_ERR; | |
322 | case LOG_PEER_ADDRS: return M_DEBUG; | |
323 | default: return M_ERR; | |
324 | } | |
325 | } | |
326 | ||
0237c848 IJ |
327 | static void vslog(struct site *st, uint32_t event, cstring_t msg, va_list ap) |
328 | FORMAT(printf,3,0); | |
329 | static void vslog(struct site *st, uint32_t event, cstring_t msg, va_list ap) | |
2fe58dfd | 330 | { |
b2a56f7c | 331 | uint32_t class; |
2fe58dfd | 332 | |
8368df34 IJ |
333 | class=event_log_priority(st, event); |
334 | if (class) { | |
e5d8c16e IJ |
335 | slilog_part(st->log,class,"%s: ",st->tunname); |
336 | vslilog_part(st->log,class,msg,ap); | |
337 | slilog_part(st->log,class,"\n"); | |
2fe58dfd | 338 | } |
2fe58dfd SE |
339 | } |
340 | ||
0237c848 IJ |
341 | static void slog(struct site *st, uint32_t event, cstring_t msg, ...) |
342 | FORMAT(printf,3,4); | |
343 | static void slog(struct site *st, uint32_t event, cstring_t msg, ...) | |
344 | { | |
345 | va_list ap; | |
346 | va_start(ap,msg); | |
347 | vslog(st,event,msg,ap); | |
348 | va_end(ap); | |
349 | } | |
350 | ||
4f3c75ac IJ |
351 | static void logtimeout(struct site *st, const char *fmt, ...) |
352 | FORMAT(printf,2,3); | |
353 | static void logtimeout(struct site *st, const char *fmt, ...) | |
354 | { | |
e9c9020e IJ |
355 | uint32_t class=event_log_priority(st,LOG_SETUP_TIMEOUT); |
356 | if (!class) | |
357 | return; | |
358 | ||
4f3c75ac IJ |
359 | va_list ap; |
360 | va_start(ap,fmt); | |
e9c9020e IJ |
361 | |
362 | slilog_part(st->log,class,"%s: ",st->tunname); | |
363 | vslilog_part(st->log,class,fmt,ap); | |
364 | ||
365 | const char *delim; | |
366 | int i; | |
367 | for (i=0, delim=" (tried "; | |
368 | i<st->setup_peers.npeers; | |
369 | i++, delim=", ") { | |
370 | transport_peer *peer=&st->setup_peers.peers[i]; | |
371 | const char *s=comm_addr_to_string(&peer->addr); | |
372 | slilog_part(st->log,class,"%s%s",delim,s); | |
373 | } | |
374 | ||
375 | slilog_part(st->log,class,")\n"); | |
4f3c75ac IJ |
376 | va_end(ap); |
377 | } | |
378 | ||
9d3a4132 | 379 | static void set_link_quality(struct site *st); |
1d388569 IJ |
380 | static void delete_keys(struct site *st, cstring_t reason, uint32_t loglevel); |
381 | static void delete_one_key(struct site *st, struct data_key *key, | |
382 | const char *reason /* may be 0 meaning don't log*/, | |
383 | const char *which /* ignored if !reasonn */, | |
384 | uint32_t loglevel /* ignored if !reasonn */); | |
dd9209d1 IJ |
385 | static bool_t initiate_key_setup(struct site *st, cstring_t reason, |
386 | const struct comm_addr *prod_hint); | |
2fe58dfd SE |
387 | static void enter_state_run(struct site *st); |
388 | static bool_t enter_state_resolve(struct site *st); | |
ff05a229 | 389 | static bool_t enter_new_state(struct site *st,uint32_t next); |
2fe58dfd | 390 | static void enter_state_wait(struct site *st); |
05f39b4d | 391 | static void activate_new_key(struct site *st); |
2fe58dfd | 392 | |
0afd257e IJ |
393 | static bool_t is_transform_valid(struct transform_inst_if *transform) |
394 | { | |
fcad4b0b | 395 | return transform && transform->valid(transform->st); |
0afd257e IJ |
396 | } |
397 | ||
3d8d8f4e IJ |
398 | static bool_t current_valid(struct site *st) |
399 | { | |
0afd257e IJ |
400 | return is_transform_valid(st->current.transform); |
401 | } | |
402 | ||
403 | #define DEFINE_CALL_TRANSFORM(fwdrev) \ | |
404 | static int call_transform_##fwdrev(struct site *st, \ | |
405 | struct transform_inst_if *transform, \ | |
406 | struct buffer_if *buf, \ | |
407 | const char **errmsg) \ | |
408 | { \ | |
fcad4b0b IJ |
409 | if (!is_transform_valid(transform)) { \ |
410 | *errmsg="transform not set up"; \ | |
411 | return 1; \ | |
412 | } \ | |
0afd257e | 413 | return transform->fwdrev(transform->st,buf,errmsg); \ |
3d8d8f4e IJ |
414 | } |
415 | ||
0afd257e IJ |
416 | DEFINE_CALL_TRANSFORM(forwards) |
417 | DEFINE_CALL_TRANSFORM(reverse) | |
418 | ||
419 | static void dispose_transform(struct transform_inst_if **transform_var) | |
420 | { | |
0afd257e | 421 | struct transform_inst_if *transform=*transform_var; |
fcad4b0b IJ |
422 | if (transform) { |
423 | transform->delkey(transform->st); | |
424 | transform->destroy(transform->st); | |
425 | } | |
426 | *transform_var = 0; | |
0afd257e IJ |
427 | } |
428 | ||
2fe58dfd SE |
429 | #define CHECK_AVAIL(b,l) do { if ((b)->size<(l)) return False; } while(0) |
430 | #define CHECK_EMPTY(b) do { if ((b)->size!=0) return False; } while(0) | |
431 | #define CHECK_TYPE(b,t) do { uint32_t type; \ | |
432 | CHECK_AVAIL((b),4); \ | |
59635212 | 433 | type=buf_unprepend_uint32((b)); \ |
2fe58dfd SE |
434 | if (type!=(t)) return False; } while(0) |
435 | ||
3ed1846a IJ |
436 | static _Bool type_is_msg34(uint32_t type) |
437 | { | |
438 | return | |
439 | type == LABEL_MSG3 || | |
440 | type == LABEL_MSG3BIS || | |
441 | type == LABEL_MSG4; | |
442 | } | |
443 | ||
1737eeef IJ |
444 | struct parsedname { |
445 | int32_t len; | |
446 | uint8_t *name; | |
09a385fb | 447 | struct buffer_if extrainfo; |
1737eeef IJ |
448 | }; |
449 | ||
2fe58dfd SE |
450 | struct msg { |
451 | uint8_t *hashstart; | |
452 | uint32_t dest; | |
453 | uint32_t source; | |
1737eeef IJ |
454 | struct parsedname remote; |
455 | struct parsedname local; | |
09a385fb | 456 | uint32_t remote_capabilities; |
3ed1846a | 457 | uint16_t remote_mtu; |
5b5f297f | 458 | int capab_transformnum; |
2fe58dfd SE |
459 | uint8_t *nR; |
460 | uint8_t *nL; | |
1caa23ff | 461 | int32_t pklen; |
3e8addad | 462 | char *pk; |
1caa23ff IJ |
463 | int32_t hashlen; |
464 | int32_t siglen; | |
3e8addad | 465 | char *sig; |
2fe58dfd SE |
466 | }; |
467 | ||
5b5f297f | 468 | static void set_new_transform(struct site *st, char *pk) |
0afd257e | 469 | { |
5b5f297f IJ |
470 | /* Make room for the shared key */ |
471 | st->sharedsecretlen=st->chosen_transform->keylen?:st->dh->ceil_len; | |
472 | assert(st->sharedsecretlen); | |
473 | if (st->sharedsecretlen > st->sharedsecretallocd) { | |
474 | st->sharedsecretallocd=st->sharedsecretlen; | |
475 | st->sharedsecret=realloc(st->sharedsecret,st->sharedsecretallocd); | |
476 | } | |
477 | if (!st->sharedsecret) fatal_perror("site:sharedsecret"); | |
478 | ||
479 | /* Generate the shared key */ | |
480 | st->dh->makeshared(st->dh->st,st->dhsecret,st->dh->len,pk, | |
481 | st->sharedsecret,st->sharedsecretlen); | |
482 | ||
483 | /* Set up the transform */ | |
484 | struct transform_if *generator=st->chosen_transform; | |
fcad4b0b IJ |
485 | struct transform_inst_if *generated=generator->create(generator->st); |
486 | generated->setkey(generated->st,st->sharedsecret, | |
487 | st->sharedsecretlen,st->setup_priority); | |
488 | dispose_transform(&st->new_transform); | |
489 | st->new_transform=generated; | |
5b5f297f IJ |
490 | |
491 | slog(st,LOG_SETUP_INIT,"key exchange negotiated transform" | |
492 | " %d (capabilities ours=%#"PRIx32" theirs=%#"PRIx32")", | |
493 | st->chosen_transform->capab_transformnum, | |
494 | st->local_capabilities, st->remote_capabilities); | |
0afd257e IJ |
495 | } |
496 | ||
09a385fb IJ |
497 | struct xinfoadd { |
498 | int32_t lenpos, afternul; | |
499 | }; | |
500 | static void append_string_xinfo_start(struct buffer_if *buf, | |
501 | struct xinfoadd *xia, | |
502 | const char *str) | |
503 | /* Helps construct one of the names with additional info as found | |
504 | * in MSG1..4. Call this function first, then append all the | |
505 | * desired extra info (not including the nul byte) to the buffer, | |
506 | * then call append_string_xinfo_done. */ | |
507 | { | |
508 | xia->lenpos = buf->size; | |
509 | buf_append_string(buf,str); | |
510 | buf_append_uint8(buf,0); | |
511 | xia->afternul = buf->size; | |
512 | } | |
513 | static void append_string_xinfo_done(struct buffer_if *buf, | |
514 | struct xinfoadd *xia) | |
515 | { | |
516 | /* we just need to adjust the string length */ | |
517 | if (buf->size == xia->afternul) { | |
518 | /* no extra info, strip the nul too */ | |
519 | buf_unappend_uint8(buf); | |
520 | } else { | |
521 | put_uint16(buf->start+xia->lenpos, buf->size-(xia->lenpos+2)); | |
522 | } | |
523 | } | |
524 | ||
ff05a229 SE |
525 | /* Build any of msg1 to msg4. msg5 and msg6 are built from the inside |
526 | out using a transform of config data supplied by netlink */ | |
fe5e9cc4 | 527 | static bool_t generate_msg(struct site *st, uint32_t type, cstring_t what) |
2fe58dfd SE |
528 | { |
529 | void *hst; | |
3b83c932 | 530 | uint8_t *hash; |
2fe58dfd SE |
531 | string_t dhpub, sig; |
532 | ||
533 | st->retries=st->setup_retries; | |
534 | BUF_ALLOC(&st->buffer,what); | |
535 | buffer_init(&st->buffer,0); | |
59635212 SE |
536 | buf_append_uint32(&st->buffer, |
537 | (type==LABEL_MSG1?0:st->setup_session_id)); | |
58650a70 | 538 | buf_append_uint32(&st->buffer,st->index); |
59635212 | 539 | buf_append_uint32(&st->buffer,type); |
09a385fb IJ |
540 | |
541 | struct xinfoadd xia; | |
542 | append_string_xinfo_start(&st->buffer,&xia,st->localname); | |
543 | if ((st->local_capabilities & CAPAB_EARLY) || (type != LABEL_MSG1)) { | |
544 | buf_append_uint32(&st->buffer,st->local_capabilities); | |
545 | } | |
3ed1846a IJ |
546 | if (type_is_msg34(type)) { |
547 | buf_append_uint16(&st->buffer,st->mtu_target); | |
548 | } | |
09a385fb IJ |
549 | append_string_xinfo_done(&st->buffer,&xia); |
550 | ||
2fe58dfd | 551 | buf_append_string(&st->buffer,st->remotename); |
4f28e77e | 552 | BUF_ADD_OBJ(append,&st->buffer,st->localN); |
2fe58dfd | 553 | if (type==LABEL_MSG1) return True; |
4f28e77e | 554 | BUF_ADD_OBJ(append,&st->buffer,st->remoteN); |
2fe58dfd | 555 | if (type==LABEL_MSG2) return True; |
3b83c932 SE |
556 | |
557 | if (hacky_par_mid_failnow()) return False; | |
558 | ||
5b5f297f IJ |
559 | if (type==LABEL_MSG3BIS) |
560 | buf_append_uint8(&st->buffer,st->chosen_transform->capab_transformnum); | |
561 | ||
2fe58dfd SE |
562 | dhpub=st->dh->makepublic(st->dh->st,st->dhsecret,st->dh->len); |
563 | buf_append_string(&st->buffer,dhpub); | |
564 | free(dhpub); | |
3b83c932 | 565 | hash=safe_malloc(st->hash->len, "generate_msg"); |
2fe58dfd SE |
566 | hst=st->hash->init(); |
567 | st->hash->update(hst,st->buffer.start,st->buffer.size); | |
568 | st->hash->final(hst,hash); | |
569 | sig=st->privkey->sign(st->privkey->st,hash,st->hash->len); | |
570 | buf_append_string(&st->buffer,sig); | |
571 | free(sig); | |
3b83c932 | 572 | free(hash); |
2fe58dfd SE |
573 | return True; |
574 | } | |
575 | ||
1737eeef IJ |
576 | static bool_t unpick_name(struct buffer_if *msg, struct parsedname *nm) |
577 | { | |
578 | CHECK_AVAIL(msg,2); | |
579 | nm->len=buf_unprepend_uint16(msg); | |
580 | CHECK_AVAIL(msg,nm->len); | |
581 | nm->name=buf_unprepend(msg,nm->len); | |
582 | uint8_t *nul=memchr(nm->name,0,nm->len); | |
583 | if (!nul) { | |
09a385fb | 584 | buffer_readonly_view(&nm->extrainfo,0,0); |
1737eeef | 585 | } else { |
09a385fb | 586 | buffer_readonly_view(&nm->extrainfo, nul+1, msg->start-(nul+1)); |
1737eeef IJ |
587 | nm->len=nul-nm->name; |
588 | } | |
589 | return True; | |
590 | } | |
591 | ||
2fe58dfd SE |
592 | static bool_t unpick_msg(struct site *st, uint32_t type, |
593 | struct buffer_if *msg, struct msg *m) | |
594 | { | |
5b5f297f | 595 | m->capab_transformnum=-1; |
2fe58dfd SE |
596 | m->hashstart=msg->start; |
597 | CHECK_AVAIL(msg,4); | |
59635212 | 598 | m->dest=buf_unprepend_uint32(msg); |
2fe58dfd | 599 | CHECK_AVAIL(msg,4); |
59635212 | 600 | m->source=buf_unprepend_uint32(msg); |
2fe58dfd | 601 | CHECK_TYPE(msg,type); |
1737eeef | 602 | if (!unpick_name(msg,&m->remote)) return False; |
09a385fb | 603 | m->remote_capabilities=0; |
3ed1846a | 604 | m->remote_mtu=0; |
09a385fb IJ |
605 | if (m->remote.extrainfo.size) { |
606 | CHECK_AVAIL(&m->remote.extrainfo,4); | |
607 | m->remote_capabilities=buf_unprepend_uint32(&m->remote.extrainfo); | |
608 | } | |
3ed1846a IJ |
609 | if (type_is_msg34(type) && m->remote.extrainfo.size) { |
610 | CHECK_AVAIL(&m->remote.extrainfo,2); | |
611 | m->remote_mtu=buf_unprepend_uint16(&m->remote.extrainfo); | |
612 | } | |
1737eeef | 613 | if (!unpick_name(msg,&m->local)) return False; |
dd9209d1 IJ |
614 | if (type==LABEL_PROD) { |
615 | CHECK_EMPTY(msg); | |
616 | return True; | |
617 | } | |
2fe58dfd SE |
618 | CHECK_AVAIL(msg,NONCELEN); |
619 | m->nR=buf_unprepend(msg,NONCELEN); | |
620 | if (type==LABEL_MSG1) { | |
621 | CHECK_EMPTY(msg); | |
622 | return True; | |
623 | } | |
624 | CHECK_AVAIL(msg,NONCELEN); | |
625 | m->nL=buf_unprepend(msg,NONCELEN); | |
626 | if (type==LABEL_MSG2) { | |
627 | CHECK_EMPTY(msg); | |
628 | return True; | |
629 | } | |
5b5f297f IJ |
630 | if (type==LABEL_MSG3BIS) { |
631 | CHECK_AVAIL(msg,1); | |
632 | m->capab_transformnum = buf_unprepend_uint8(msg); | |
633 | } else { | |
634 | m->capab_transformnum = CAPAB_TRANSFORMNUM_ANCIENT; | |
635 | } | |
2fe58dfd | 636 | CHECK_AVAIL(msg,2); |
59635212 | 637 | m->pklen=buf_unprepend_uint16(msg); |
2fe58dfd SE |
638 | CHECK_AVAIL(msg,m->pklen); |
639 | m->pk=buf_unprepend(msg,m->pklen); | |
640 | m->hashlen=msg->start-m->hashstart; | |
641 | CHECK_AVAIL(msg,2); | |
59635212 | 642 | m->siglen=buf_unprepend_uint16(msg); |
2fe58dfd SE |
643 | CHECK_AVAIL(msg,m->siglen); |
644 | m->sig=buf_unprepend(msg,m->siglen); | |
645 | CHECK_EMPTY(msg); | |
646 | return True; | |
647 | } | |
648 | ||
1737eeef IJ |
649 | static bool_t name_matches(const struct parsedname *nm, const char *expected) |
650 | { | |
651 | int expected_len=strlen(expected); | |
652 | return | |
653 | nm->len == expected_len && | |
654 | !memcmp(nm->name, expected, expected_len); | |
655 | } | |
656 | ||
ff05a229 | 657 | static bool_t check_msg(struct site *st, uint32_t type, struct msg *m, |
fe5e9cc4 | 658 | cstring_t *error) |
ff05a229 SE |
659 | { |
660 | if (type==LABEL_MSG1) return True; | |
661 | ||
662 | /* Check that the site names and our nonce have been sent | |
663 | back correctly, and then store our peer's nonce. */ | |
1737eeef | 664 | if (!name_matches(&m->remote,st->remotename)) { |
ff05a229 SE |
665 | *error="wrong remote site name"; |
666 | return False; | |
667 | } | |
1737eeef | 668 | if (!name_matches(&m->local,st->localname)) { |
ff05a229 SE |
669 | *error="wrong local site name"; |
670 | return False; | |
671 | } | |
672 | if (memcmp(m->nL,st->localN,NONCELEN)!=0) { | |
673 | *error="wrong locally-generated nonce"; | |
674 | return False; | |
675 | } | |
676 | if (type==LABEL_MSG2) return True; | |
5ad34db2 | 677 | if (!consttime_memeq(m->nR,st->remoteN,NONCELEN)!=0) { |
ff05a229 SE |
678 | *error="wrong remotely-generated nonce"; |
679 | return False; | |
680 | } | |
09a385fb IJ |
681 | /* MSG3 has complicated rules about capabilities, which are |
682 | * handled in process_msg3. */ | |
5b5f297f | 683 | if (type==LABEL_MSG3 || type==LABEL_MSG3BIS) return True; |
09a385fb IJ |
684 | if (m->remote_capabilities!=st->remote_capabilities) { |
685 | *error="remote capabilities changed"; | |
686 | return False; | |
687 | } | |
ff05a229 SE |
688 | if (type==LABEL_MSG4) return True; |
689 | *error="unknown message type"; | |
690 | return False; | |
691 | } | |
692 | ||
2fe58dfd SE |
693 | static bool_t generate_msg1(struct site *st) |
694 | { | |
695 | st->random->generate(st->random->st,NONCELEN,st->localN); | |
696 | return generate_msg(st,LABEL_MSG1,"site:MSG1"); | |
697 | } | |
698 | ||
699 | static bool_t process_msg1(struct site *st, struct buffer_if *msg1, | |
7e29719e | 700 | const struct comm_addr *src, struct msg *m) |
2fe58dfd | 701 | { |
2fe58dfd SE |
702 | /* We've already determined we're in an appropriate state to |
703 | process an incoming MSG1, and that the MSG1 has correct values | |
704 | of A and B. */ | |
705 | ||
7e29719e | 706 | st->setup_session_id=m->source; |
09a385fb | 707 | st->remote_capabilities=m->remote_capabilities; |
7e29719e | 708 | memcpy(st->remoteN,m->nR,NONCELEN); |
2fe58dfd SE |
709 | return True; |
710 | } | |
711 | ||
712 | static bool_t generate_msg2(struct site *st) | |
713 | { | |
714 | st->random->generate(st->random->st,NONCELEN,st->localN); | |
715 | return generate_msg(st,LABEL_MSG2,"site:MSG2"); | |
716 | } | |
717 | ||
718 | static bool_t process_msg2(struct site *st, struct buffer_if *msg2, | |
a15faeb2 | 719 | const struct comm_addr *src) |
2fe58dfd SE |
720 | { |
721 | struct msg m; | |
fe5e9cc4 | 722 | cstring_t err; |
2fe58dfd SE |
723 | |
724 | if (!unpick_msg(st,LABEL_MSG2,msg2,&m)) return False; | |
ff05a229 SE |
725 | if (!check_msg(st,LABEL_MSG2,&m,&err)) { |
726 | slog(st,LOG_SEC,"msg2: %s",err); | |
2fe58dfd SE |
727 | return False; |
728 | } | |
729 | st->setup_session_id=m.source; | |
09a385fb | 730 | st->remote_capabilities=m.remote_capabilities; |
5b5f297f IJ |
731 | |
732 | /* Select the transform to use */ | |
733 | ||
734 | uint32_t remote_transforms = st->remote_capabilities & CAPAB_TRANSFORM_MASK; | |
735 | if (!remote_transforms) | |
736 | /* old secnets only had this one transform */ | |
737 | remote_transforms = 1UL << CAPAB_TRANSFORMNUM_ANCIENT; | |
738 | ||
739 | struct transform_if *ti; | |
740 | int i; | |
741 | for (i=0; i<st->ntransforms; i++) { | |
742 | ti=st->transforms[i]; | |
743 | if ((1UL << ti->capab_transformnum) & remote_transforms) | |
744 | goto transform_found; | |
745 | } | |
746 | slog(st,LOG_ERROR,"no transforms in common" | |
747 | " (us %#"PRIx32"; them: %#"PRIx32")", | |
748 | st->local_capabilities & CAPAB_TRANSFORM_MASK, | |
749 | remote_transforms); | |
750 | return False; | |
751 | transform_found: | |
752 | st->chosen_transform=ti; | |
753 | ||
2fe58dfd SE |
754 | memcpy(st->remoteN,m.nR,NONCELEN); |
755 | return True; | |
756 | } | |
757 | ||
758 | static bool_t generate_msg3(struct site *st) | |
759 | { | |
760 | /* Now we have our nonce and their nonce. Think of a secret key, | |
761 | and create message number 3. */ | |
762 | st->random->generate(st->random->st,st->dh->len,st->dhsecret); | |
5b5f297f IJ |
763 | return generate_msg(st, |
764 | (st->remote_capabilities & CAPAB_TRANSFORM_MASK | |
765 | ? LABEL_MSG3BIS : LABEL_MSG3), | |
766 | "site:MSG3"); | |
2fe58dfd SE |
767 | } |
768 | ||
e001e8c0 IJ |
769 | static bool_t process_msg3_msg4(struct site *st, struct msg *m) |
770 | { | |
771 | uint8_t *hash; | |
772 | void *hst; | |
773 | ||
774 | /* Check signature and store g^x mod m */ | |
775 | hash=safe_malloc(st->hash->len, "process_msg3_msg4"); | |
776 | hst=st->hash->init(); | |
777 | st->hash->update(hst,m->hashstart,m->hashlen); | |
778 | st->hash->final(hst,hash); | |
779 | /* Terminate signature with a '0' - cheating, but should be ok */ | |
780 | m->sig[m->siglen]=0; | |
781 | if (!st->pubkey->check(st->pubkey->st,hash,st->hash->len,m->sig)) { | |
782 | slog(st,LOG_SEC,"msg3/msg4 signature failed check!"); | |
783 | free(hash); | |
784 | return False; | |
785 | } | |
786 | free(hash); | |
787 | ||
3ed1846a IJ |
788 | st->remote_adv_mtu=m->remote_mtu; |
789 | ||
e001e8c0 IJ |
790 | return True; |
791 | } | |
792 | ||
2fe58dfd | 793 | static bool_t process_msg3(struct site *st, struct buffer_if *msg3, |
5b5f297f | 794 | const struct comm_addr *src, uint32_t msgtype) |
2fe58dfd SE |
795 | { |
796 | struct msg m; | |
fe5e9cc4 | 797 | cstring_t err; |
2fe58dfd | 798 | |
5b5f297f IJ |
799 | assert(msgtype==LABEL_MSG3 || msgtype==LABEL_MSG3BIS); |
800 | ||
801 | if (!unpick_msg(st,msgtype,msg3,&m)) return False; | |
802 | if (!check_msg(st,msgtype,&m,&err)) { | |
ff05a229 | 803 | slog(st,LOG_SEC,"msg3: %s",err); |
2fe58dfd SE |
804 | return False; |
805 | } | |
09a385fb IJ |
806 | uint32_t capab_adv_late = m.remote_capabilities |
807 | & ~st->remote_capabilities & CAPAB_EARLY; | |
808 | if (capab_adv_late) { | |
809 | slog(st,LOG_SEC,"msg3 impermissibly adds early capability flag(s)" | |
810 | " %#"PRIx32" (was %#"PRIx32", now %#"PRIx32")", | |
811 | capab_adv_late, st->remote_capabilities, m.remote_capabilities); | |
812 | return False; | |
813 | } | |
814 | st->remote_capabilities|=m.remote_capabilities; | |
ff05a229 | 815 | |
5b5f297f IJ |
816 | struct transform_if *ti; |
817 | int i; | |
818 | for (i=0; i<st->ntransforms; i++) { | |
819 | ti=st->transforms[i]; | |
820 | if (ti->capab_transformnum == m.capab_transformnum) | |
821 | goto transform_found; | |
822 | } | |
823 | slog(st,LOG_SEC,"peer chose unknown-to-us transform %d!", | |
824 | m.capab_transformnum); | |
825 | return False; | |
826 | transform_found: | |
827 | st->chosen_transform=ti; | |
828 | ||
e001e8c0 | 829 | if (!process_msg3_msg4(st,&m)) |
2fe58dfd | 830 | return False; |
2fe58dfd SE |
831 | |
832 | /* Terminate their DH public key with a '0' */ | |
833 | m.pk[m.pklen]=0; | |
834 | /* Invent our DH secret key */ | |
835 | st->random->generate(st->random->st,st->dh->len,st->dhsecret); | |
836 | ||
5b5f297f IJ |
837 | /* Generate the shared key and set up the transform */ |
838 | set_new_transform(st,m.pk); | |
2fe58dfd SE |
839 | |
840 | return True; | |
841 | } | |
842 | ||
843 | static bool_t generate_msg4(struct site *st) | |
844 | { | |
845 | /* We have both nonces, their public key and our private key. Generate | |
846 | our public key, sign it and send it to them. */ | |
847 | return generate_msg(st,LABEL_MSG4,"site:MSG4"); | |
848 | } | |
849 | ||
850 | static bool_t process_msg4(struct site *st, struct buffer_if *msg4, | |
a15faeb2 | 851 | const struct comm_addr *src) |
2fe58dfd SE |
852 | { |
853 | struct msg m; | |
fe5e9cc4 | 854 | cstring_t err; |
2fe58dfd SE |
855 | |
856 | if (!unpick_msg(st,LABEL_MSG4,msg4,&m)) return False; | |
ff05a229 SE |
857 | if (!check_msg(st,LABEL_MSG4,&m,&err)) { |
858 | slog(st,LOG_SEC,"msg4: %s",err); | |
2fe58dfd SE |
859 | return False; |
860 | } | |
861 | ||
e001e8c0 | 862 | if (!process_msg3_msg4(st,&m)) |
2fe58dfd | 863 | return False; |
2fe58dfd SE |
864 | |
865 | /* Terminate their DH public key with a '0' */ | |
866 | m.pk[m.pklen]=0; | |
5b5f297f IJ |
867 | |
868 | /* Generate the shared key and set up the transform */ | |
869 | set_new_transform(st,m.pk); | |
2fe58dfd SE |
870 | |
871 | return True; | |
872 | } | |
873 | ||
2fe58dfd SE |
874 | struct msg0 { |
875 | uint32_t dest; | |
876 | uint32_t source; | |
877 | uint32_t type; | |
878 | }; | |
879 | ||
880 | static bool_t unpick_msg0(struct site *st, struct buffer_if *msg0, | |
881 | struct msg0 *m) | |
882 | { | |
883 | CHECK_AVAIL(msg0,4); | |
59635212 | 884 | m->dest=buf_unprepend_uint32(msg0); |
2fe58dfd | 885 | CHECK_AVAIL(msg0,4); |
59635212 | 886 | m->source=buf_unprepend_uint32(msg0); |
2fe58dfd | 887 | CHECK_AVAIL(msg0,4); |
59635212 | 888 | m->type=buf_unprepend_uint32(msg0); |
2fe58dfd SE |
889 | return True; |
890 | /* Leaves transformed part of buffer untouched */ | |
891 | } | |
892 | ||
ff05a229 SE |
893 | static bool_t generate_msg5(struct site *st) |
894 | { | |
fe5e9cc4 | 895 | cstring_t transform_err; |
ff05a229 SE |
896 | |
897 | BUF_ALLOC(&st->buffer,"site:MSG5"); | |
898 | /* We are going to add four words to the message */ | |
3abd18e8 | 899 | buffer_init(&st->buffer,calculate_max_start_pad()); |
ff05a229 SE |
900 | /* Give the netlink code an opportunity to put its own stuff in the |
901 | message (configuration information, etc.) */ | |
ff05a229 | 902 | buf_prepend_uint32(&st->buffer,LABEL_MSG5); |
0afd257e IJ |
903 | if (call_transform_forwards(st,st->new_transform, |
904 | &st->buffer,&transform_err)) | |
905 | return False; | |
ff05a229 | 906 | buf_prepend_uint32(&st->buffer,LABEL_MSG5); |
58650a70 | 907 | buf_prepend_uint32(&st->buffer,st->index); |
ff05a229 SE |
908 | buf_prepend_uint32(&st->buffer,st->setup_session_id); |
909 | ||
910 | st->retries=st->setup_retries; | |
911 | return True; | |
912 | } | |
913 | ||
2fe58dfd | 914 | static bool_t process_msg5(struct site *st, struct buffer_if *msg5, |
c90cc2a7 IJ |
915 | const struct comm_addr *src, |
916 | struct transform_inst_if *transform) | |
2fe58dfd SE |
917 | { |
918 | struct msg0 m; | |
fe5e9cc4 | 919 | cstring_t transform_err; |
2fe58dfd SE |
920 | |
921 | if (!unpick_msg0(st,msg5,&m)) return False; | |
922 | ||
0afd257e | 923 | if (call_transform_reverse(st,transform,msg5,&transform_err)) { |
2fe58dfd | 924 | /* There's a problem */ |
59635212 | 925 | slog(st,LOG_SEC,"process_msg5: transform: %s",transform_err); |
2fe58dfd SE |
926 | return False; |
927 | } | |
928 | /* Buffer should now contain untransformed PING packet data */ | |
929 | CHECK_AVAIL(msg5,4); | |
59635212 | 930 | if (buf_unprepend_uint32(msg5)!=LABEL_MSG5) { |
ff05a229 | 931 | slog(st,LOG_SEC,"MSG5/PING packet contained wrong label"); |
2fe58dfd SE |
932 | return False; |
933 | } | |
ff7cdc9e IJ |
934 | /* Older versions of secnet used to write some config data here |
935 | * which we ignore. So we don't CHECK_EMPTY */ | |
2fe58dfd SE |
936 | return True; |
937 | } | |
938 | ||
c90cc2a7 IJ |
939 | static void create_msg6(struct site *st, struct transform_inst_if *transform, |
940 | uint32_t session_id) | |
2fe58dfd | 941 | { |
fe5e9cc4 | 942 | cstring_t transform_err; |
2fe58dfd SE |
943 | |
944 | BUF_ALLOC(&st->buffer,"site:MSG6"); | |
ff05a229 | 945 | /* We are going to add four words to the message */ |
3abd18e8 | 946 | buffer_init(&st->buffer,calculate_max_start_pad()); |
794f2398 SE |
947 | /* Give the netlink code an opportunity to put its own stuff in the |
948 | message (configuration information, etc.) */ | |
ff05a229 | 949 | buf_prepend_uint32(&st->buffer,LABEL_MSG6); |
0afd257e IJ |
950 | int problem = call_transform_forwards(st,transform, |
951 | &st->buffer,&transform_err); | |
952 | assert(!problem); | |
59635212 | 953 | buf_prepend_uint32(&st->buffer,LABEL_MSG6); |
58650a70 | 954 | buf_prepend_uint32(&st->buffer,st->index); |
c90cc2a7 IJ |
955 | buf_prepend_uint32(&st->buffer,session_id); |
956 | } | |
2fe58dfd | 957 | |
c90cc2a7 IJ |
958 | static bool_t generate_msg6(struct site *st) |
959 | { | |
0afd257e IJ |
960 | if (!is_transform_valid(st->new_transform)) |
961 | return False; | |
c90cc2a7 | 962 | create_msg6(st,st->new_transform,st->setup_session_id); |
ff05a229 | 963 | st->retries=1; /* Peer will retransmit MSG5 if this packet gets lost */ |
2fe58dfd SE |
964 | return True; |
965 | } | |
966 | ||
967 | static bool_t process_msg6(struct site *st, struct buffer_if *msg6, | |
a15faeb2 | 968 | const struct comm_addr *src) |
2fe58dfd SE |
969 | { |
970 | struct msg0 m; | |
fe5e9cc4 | 971 | cstring_t transform_err; |
2fe58dfd SE |
972 | |
973 | if (!unpick_msg0(st,msg6,&m)) return False; | |
974 | ||
0afd257e | 975 | if (call_transform_reverse(st,st->new_transform,msg6,&transform_err)) { |
2fe58dfd | 976 | /* There's a problem */ |
59635212 | 977 | slog(st,LOG_SEC,"process_msg6: transform: %s",transform_err); |
2fe58dfd SE |
978 | return False; |
979 | } | |
980 | /* Buffer should now contain untransformed PING packet data */ | |
981 | CHECK_AVAIL(msg6,4); | |
59635212 SE |
982 | if (buf_unprepend_uint32(msg6)!=LABEL_MSG6) { |
983 | slog(st,LOG_SEC,"MSG6/PONG packet contained invalid data"); | |
2fe58dfd SE |
984 | return False; |
985 | } | |
ff7cdc9e IJ |
986 | /* Older versions of secnet used to write some config data here |
987 | * which we ignore. So we don't CHECK_EMPTY */ | |
2fe58dfd SE |
988 | return True; |
989 | } | |
990 | ||
48b97423 IJ |
991 | static bool_t decrypt_msg0(struct site *st, struct buffer_if *msg0, |
992 | const struct comm_addr *src) | |
2fe58dfd | 993 | { |
02b0959b | 994 | cstring_t transform_err, auxkey_err, newkey_err="n/a"; |
065e1922 IJ |
995 | struct msg0 m; |
996 | uint32_t problem; | |
2fe58dfd | 997 | |
2fe58dfd SE |
998 | if (!unpick_msg0(st,msg0,&m)) return False; |
999 | ||
05f39b4d IJ |
1000 | /* Keep a copy so we can try decrypting it with multiple keys */ |
1001 | buffer_copy(&st->scratch, msg0); | |
1002 | ||
0afd257e IJ |
1003 | problem = call_transform_reverse(st,st->current.transform, |
1004 | msg0,&transform_err); | |
02b0959b | 1005 | if (!problem) { |
bd98cd6b IJ |
1006 | if (!st->auxiliary_is_new) |
1007 | delete_one_key(st,&st->auxiliary_key, | |
1008 | "peer has used new key","auxiliary key",LOG_SEC); | |
02b0959b IJ |
1009 | return True; |
1010 | } | |
48b97423 IJ |
1011 | if (problem==2) |
1012 | goto skew; | |
07e4774c | 1013 | |
02b0959b | 1014 | buffer_copy(msg0, &st->scratch); |
fcad4b0b IJ |
1015 | problem = call_transform_reverse(st,st->auxiliary_key.transform, |
1016 | msg0,&auxkey_err); | |
02b0959b IJ |
1017 | if (problem==0) { |
1018 | slog(st,LOG_DROP,"processing packet which uses auxiliary key"); | |
bd98cd6b IJ |
1019 | if (st->auxiliary_is_new) { |
1020 | /* We previously timed out in state SENTMSG5 but it turns | |
1021 | * out that our peer did in fact get our MSG5 and is | |
1022 | * using the new key. So we should switch to it too. */ | |
1023 | /* This is a bit like activate_new_key. */ | |
1024 | struct data_key t; | |
1025 | t=st->current; | |
1026 | st->current=st->auxiliary_key; | |
1027 | st->auxiliary_key=t; | |
1028 | ||
1029 | delete_one_key(st,&st->auxiliary_key,"peer has used new key", | |
1030 | "previous key",LOG_SEC); | |
1031 | st->auxiliary_is_new=0; | |
1032 | st->renegotiate_key_time=st->auxiliary_renegotiate_key_time; | |
1033 | } | |
02b0959b IJ |
1034 | return True; |
1035 | } | |
48b97423 IJ |
1036 | if (problem==2) |
1037 | goto skew; | |
02b0959b | 1038 | |
05f39b4d IJ |
1039 | if (st->state==SITE_SENTMSG5) { |
1040 | buffer_copy(msg0, &st->scratch); | |
0afd257e IJ |
1041 | problem = call_transform_reverse(st,st->new_transform, |
1042 | msg0,&newkey_err); | |
48b97423 | 1043 | if (!problem) { |
05f39b4d IJ |
1044 | /* It looks like we didn't get the peer's MSG6 */ |
1045 | /* This is like a cut-down enter_new_state(SITE_RUN) */ | |
1046 | slog(st,LOG_STATE,"will enter state RUN (MSG0 with new key)"); | |
1047 | BUF_FREE(&st->buffer); | |
1048 | st->timeout=0; | |
1049 | activate_new_key(st); | |
1050 | return True; /* do process the data in this packet */ | |
1051 | } | |
48b97423 IJ |
1052 | if (problem==2) |
1053 | goto skew; | |
05f39b4d IJ |
1054 | } |
1055 | ||
02b0959b IJ |
1056 | slog(st,LOG_SEC,"transform: %s (aux: %s, new: %s)", |
1057 | transform_err,auxkey_err,newkey_err); | |
dd9209d1 | 1058 | initiate_key_setup(st,"incoming message would not decrypt",0); |
48b97423 IJ |
1059 | send_nak(src,m.dest,m.source,m.type,msg0,"message would not decrypt"); |
1060 | return False; | |
1061 | ||
1062 | skew: | |
1063 | slog(st,LOG_DROP,"transform: %s (merely skew)",transform_err); | |
065e1922 IJ |
1064 | return False; |
1065 | } | |
1066 | ||
1067 | static bool_t process_msg0(struct site *st, struct buffer_if *msg0, | |
1068 | const struct comm_addr *src) | |
1069 | { | |
1070 | uint32_t type; | |
1071 | ||
48b97423 | 1072 | if (!decrypt_msg0(st,msg0,src)) |
065e1922 IJ |
1073 | return False; |
1074 | ||
2fe58dfd | 1075 | CHECK_AVAIL(msg0,4); |
59635212 | 1076 | type=buf_unprepend_uint32(msg0); |
2fe58dfd | 1077 | switch(type) { |
794f2398 SE |
1078 | case LABEL_MSG7: |
1079 | /* We must forget about the current session. */ | |
1d388569 | 1080 | delete_keys(st,"request from peer",LOG_SEC); |
794f2398 | 1081 | return True; |
2fe58dfd SE |
1082 | case LABEL_MSG9: |
1083 | /* Deliver to netlink layer */ | |
469fd1d9 | 1084 | st->netlink->deliver(st->netlink->st,msg0); |
446353cd | 1085 | transport_data_msgok(st,src); |
837cf01e IJ |
1086 | /* See whether we should start negotiating a new key */ |
1087 | if (st->now > st->renegotiate_key_time) | |
dd9209d1 | 1088 | initiate_key_setup(st,"incoming packet in renegotiation window",0); |
2fe58dfd | 1089 | return True; |
2fe58dfd | 1090 | default: |
ff05a229 SE |
1091 | slog(st,LOG_SEC,"incoming encrypted message of type %08x " |
1092 | "(unknown)",type); | |
2fe58dfd SE |
1093 | break; |
1094 | } | |
1095 | return False; | |
1096 | } | |
1097 | ||
1098 | static void dump_packet(struct site *st, struct buffer_if *buf, | |
a15faeb2 | 1099 | const struct comm_addr *addr, bool_t incoming) |
2fe58dfd | 1100 | { |
0a6cbade IJ |
1101 | uint32_t dest=get_uint32(buf->start); |
1102 | uint32_t source=get_uint32(buf->start+4); | |
1103 | uint32_t msgtype=get_uint32(buf->start+8); | |
2fe58dfd SE |
1104 | |
1105 | if (st->log_events & LOG_DUMP) | |
040ee979 SE |
1106 | slilog(st->log,M_DEBUG,"%s: %s: %08x<-%08x: %08x:", |
1107 | st->tunname,incoming?"incoming":"outgoing", | |
1108 | dest,source,msgtype); | |
2fe58dfd SE |
1109 | } |
1110 | ||
1111 | static uint32_t site_status(void *st) | |
1112 | { | |
1113 | return 0; | |
1114 | } | |
1115 | ||
1116 | static bool_t send_msg(struct site *st) | |
1117 | { | |
1118 | if (st->retries>0) { | |
446353cd | 1119 | transport_xmit(st, &st->setup_peers, &st->buffer, True); |
e7f8ec2a | 1120 | st->timeout=st->now+st->setup_retry_interval; |
2fe58dfd SE |
1121 | st->retries--; |
1122 | return True; | |
bd98cd6b | 1123 | } else if (st->state==SITE_SENTMSG5) { |
4f3c75ac | 1124 | logtimeout(st,"timed out sending MSG5, stashing new key"); |
bd98cd6b IJ |
1125 | /* We stash the key we have produced, in case it turns out that |
1126 | * our peer did see our MSG5 after all and starts using it. */ | |
1127 | /* This is a bit like some of activate_new_key */ | |
1128 | struct transform_inst_if *t; | |
1129 | t=st->auxiliary_key.transform; | |
1130 | st->auxiliary_key.transform=st->new_transform; | |
1131 | st->new_transform=t; | |
0afd257e | 1132 | dispose_transform(&st->new_transform); |
bd98cd6b | 1133 | |
bd98cd6b IJ |
1134 | st->auxiliary_is_new=1; |
1135 | st->auxiliary_key.key_timeout=st->now+st->key_lifetime; | |
1136 | st->auxiliary_renegotiate_key_time=st->now+st->key_renegotiate_time; | |
1137 | st->auxiliary_key.remote_session_id=st->setup_session_id; | |
1138 | ||
1139 | enter_state_wait(st); | |
1140 | return False; | |
2fe58dfd | 1141 | } else { |
4f3c75ac | 1142 | logtimeout(st,"timed out sending key setup packet " |
3454dce4 | 1143 | "(in state %s)",state_name(st->state)); |
2fe58dfd SE |
1144 | enter_state_wait(st); |
1145 | return False; | |
1146 | } | |
1147 | } | |
1148 | ||
1149 | static void site_resolve_callback(void *sst, struct in_addr *address) | |
1150 | { | |
1151 | struct site *st=sst; | |
446353cd | 1152 | struct comm_addr ca_buf, *ca_use; |
2fe58dfd | 1153 | |
5c19b79c IJ |
1154 | st->resolving=False; |
1155 | ||
2fe58dfd | 1156 | if (address) { |
446353cd | 1157 | FILLZERO(ca_buf); |
59533c16 | 1158 | ca_buf.comm=st->comms[0]; |
446353cd IJ |
1159 | ca_buf.sin.sin_family=AF_INET; |
1160 | ca_buf.sin.sin_port=htons(st->remoteport); | |
1161 | ca_buf.sin.sin_addr=*address; | |
1162 | ca_use=&ca_buf; | |
4ac8a7d2 IJ |
1163 | slog(st,LOG_STATE,"resolution of %s completed: %s", |
1164 | st->address, comm_addr_to_string(ca_use));; | |
2fe58dfd | 1165 | } else { |
2fe58dfd | 1166 | slog(st,LOG_ERROR,"resolution of %s failed",st->address); |
446353cd IJ |
1167 | ca_use=0; |
1168 | } | |
c22c3541 IJ |
1169 | |
1170 | switch (st->state) { | |
1171 | case SITE_RESOLVE: | |
1172 | if (transport_compute_setupinit_peers(st,ca_use,0)) { | |
1173 | enter_new_state(st,SITE_SENTMSG1); | |
1174 | } else { | |
1175 | /* Can't figure out who to try to to talk to */ | |
1176 | slog(st,LOG_SETUP_INIT, | |
1177 | "key exchange failed: cannot find peer address"); | |
1178 | enter_state_run(st); | |
1179 | } | |
1180 | break; | |
1181 | case SITE_SENTMSG1: case SITE_SENTMSG2: | |
1182 | case SITE_SENTMSG3: case SITE_SENTMSG4: | |
1183 | case SITE_SENTMSG5: | |
1184 | if (ca_use) { | |
1185 | /* We start using the address immediately for data too. | |
1186 | * It's best to store it in st->peers now because we might | |
1187 | * go via SENTMSG5, WAIT, and a MSG0, straight into using | |
1188 | * the new key (without updating the data peer addrs). */ | |
90d7e3ad | 1189 | transport_resolve_complete(st,ca_use); |
c22c3541 IJ |
1190 | } else if (st->local_mobile) { |
1191 | /* We can't let this rest because we may have a peer | |
1192 | * address which will break in the future. */ | |
1193 | slog(st,LOG_SETUP_INIT,"resolution of %s failed: " | |
1194 | "abandoning key exchange",st->address); | |
1195 | enter_state_wait(st); | |
1196 | } else { | |
1197 | slog(st,LOG_SETUP_INIT,"resolution of %s failed: " | |
1198 | " continuing to use source address of peer's packets" | |
1199 | " for key exchange and ultimately data", | |
1200 | st->address); | |
1201 | } | |
1202 | break; | |
1203 | case SITE_RUN: | |
1204 | if (ca_use) { | |
1205 | slog(st,LOG_SETUP_INIT,"resolution of %s completed tardily," | |
1206 | " updating peer address(es)",st->address); | |
90d7e3ad | 1207 | transport_resolve_complete_tardy(st,ca_use); |
c22c3541 IJ |
1208 | } else if (st->local_mobile) { |
1209 | /* Not very good. We should queue (another) renegotiation | |
1210 | * so that we can update the peer address. */ | |
1211 | st->key_renegotiate_time=st->now+st->wait_timeout; | |
1212 | } else { | |
1213 | slog(st,LOG_SETUP_INIT,"resolution of %s failed: " | |
1214 | " continuing to use source address of peer's packets", | |
1215 | st->address); | |
1216 | } | |
1217 | break; | |
1218 | case SITE_WAIT: | |
1219 | case SITE_STOP: | |
1220 | /* oh well */ | |
1221 | break; | |
2fe58dfd SE |
1222 | } |
1223 | } | |
1224 | ||
dd9209d1 IJ |
1225 | static bool_t initiate_key_setup(struct site *st, cstring_t reason, |
1226 | const struct comm_addr *prod_hint) | |
9d3a4132 | 1227 | { |
77effe1d | 1228 | /* Reentrancy hazard: can call enter_new_state/enter_state_* */ |
9d3a4132 | 1229 | if (st->state!=SITE_RUN) return False; |
794f2398 | 1230 | slog(st,LOG_SETUP_INIT,"initiating key exchange (%s)",reason); |
9d3a4132 | 1231 | if (st->address) { |
794f2398 | 1232 | slog(st,LOG_SETUP_INIT,"resolving peer address"); |
9d3a4132 | 1233 | return enter_state_resolve(st); |
dd9209d1 | 1234 | } else if (transport_compute_setupinit_peers(st,0,prod_hint)) { |
ff05a229 | 1235 | return enter_new_state(st,SITE_SENTMSG1); |
9d3a4132 | 1236 | } |
ff05a229 | 1237 | slog(st,LOG_SETUP_INIT,"key exchange failed: no address for peer"); |
9d3a4132 SE |
1238 | return False; |
1239 | } | |
1240 | ||
2fe58dfd SE |
1241 | static void activate_new_key(struct site *st) |
1242 | { | |
1243 | struct transform_inst_if *t; | |
1244 | ||
02b0959b IJ |
1245 | /* We have three transform instances, which we swap between old, |
1246 | active and setup */ | |
1247 | t=st->auxiliary_key.transform; | |
1248 | st->auxiliary_key.transform=st->current.transform; | |
19e9a588 | 1249 | st->current.transform=st->new_transform; |
2fe58dfd | 1250 | st->new_transform=t; |
0afd257e | 1251 | dispose_transform(&st->new_transform); |
2fe58dfd | 1252 | |
2fe58dfd | 1253 | st->timeout=0; |
bd98cd6b | 1254 | st->auxiliary_is_new=0; |
02b0959b | 1255 | st->auxiliary_key.key_timeout=st->current.key_timeout; |
19e9a588 | 1256 | st->current.key_timeout=st->now+st->key_lifetime; |
ff05a229 | 1257 | st->renegotiate_key_time=st->now+st->key_renegotiate_time; |
446353cd | 1258 | transport_peers_copy(st,&st->peers,&st->setup_peers); |
19e9a588 | 1259 | st->current.remote_session_id=st->setup_session_id; |
2fe58dfd | 1260 | |
3ed1846a IJ |
1261 | /* Compute the inter-site MTU. This is min( our_mtu, their_mtu ). |
1262 | * But their mtu be unspecified, in which case we just use ours. */ | |
1263 | uint32_t intersite_mtu= | |
1264 | MIN(st->mtu_target, st->remote_adv_mtu ?: ~(uint32_t)0); | |
1265 | st->netlink->set_mtu(st->netlink->st,intersite_mtu); | |
1266 | ||
1267 | slog(st,LOG_ACTIVATE_KEY,"new key activated" | |
1268 | " (mtu ours=%"PRId32" theirs=%"PRId32" intersite=%"PRId32")", | |
1269 | st->mtu_target, st->remote_adv_mtu, intersite_mtu); | |
9d3a4132 | 1270 | enter_state_run(st); |
2fe58dfd SE |
1271 | } |
1272 | ||
1d388569 IJ |
1273 | static void delete_one_key(struct site *st, struct data_key *key, |
1274 | cstring_t reason, cstring_t which, uint32_t loglevel) | |
1275 | { | |
0afd257e | 1276 | if (!is_transform_valid(key->transform)) return; |
1d388569 | 1277 | if (reason) slog(st,loglevel,"%s deleted (%s)",which,reason); |
0afd257e | 1278 | dispose_transform(&key->transform); |
1d388569 IJ |
1279 | key->key_timeout=0; |
1280 | } | |
1281 | ||
1282 | static void delete_keys(struct site *st, cstring_t reason, uint32_t loglevel) | |
794f2398 | 1283 | { |
3d8d8f4e | 1284 | if (current_valid(st)) { |
794f2398 SE |
1285 | slog(st,loglevel,"session closed (%s)",reason); |
1286 | ||
1d388569 | 1287 | delete_one_key(st,&st->current,0,0,0); |
794f2398 SE |
1288 | set_link_quality(st); |
1289 | } | |
02b0959b | 1290 | delete_one_key(st,&st->auxiliary_key,0,0,0); |
794f2398 SE |
1291 | } |
1292 | ||
2fe58dfd SE |
1293 | static void state_assert(struct site *st, bool_t ok) |
1294 | { | |
4f5e39ec | 1295 | if (!ok) fatal("site:state_assert"); |
2fe58dfd SE |
1296 | } |
1297 | ||
1298 | static void enter_state_stop(struct site *st) | |
1299 | { | |
1300 | st->state=SITE_STOP; | |
1301 | st->timeout=0; | |
1d388569 | 1302 | delete_keys(st,"entering state STOP",LOG_TIMEOUT_KEY); |
0afd257e | 1303 | dispose_transform(&st->new_transform); |
2fe58dfd SE |
1304 | } |
1305 | ||
9d3a4132 SE |
1306 | static void set_link_quality(struct site *st) |
1307 | { | |
1308 | uint32_t quality; | |
3d8d8f4e | 1309 | if (current_valid(st)) |
9d3a4132 SE |
1310 | quality=LINK_QUALITY_UP; |
1311 | else if (st->state==SITE_WAIT || st->state==SITE_STOP) | |
1312 | quality=LINK_QUALITY_DOWN; | |
1313 | else if (st->address) | |
1314 | quality=LINK_QUALITY_DOWN_CURRENT_ADDRESS; | |
446353cd | 1315 | else if (transport_peers_valid(&st->peers)) |
9d3a4132 SE |
1316 | quality=LINK_QUALITY_DOWN_STALE_ADDRESS; |
1317 | else | |
1318 | quality=LINK_QUALITY_DOWN; | |
1319 | ||
469fd1d9 | 1320 | st->netlink->set_quality(st->netlink->st,quality); |
9d3a4132 SE |
1321 | } |
1322 | ||
2fe58dfd SE |
1323 | static void enter_state_run(struct site *st) |
1324 | { | |
1325 | slog(st,LOG_STATE,"entering state RUN"); | |
1326 | st->state=SITE_RUN; | |
1327 | st->timeout=0; | |
9d3a4132 | 1328 | |
ff05a229 | 1329 | st->setup_session_id=0; |
446353cd | 1330 | transport_peers_clear(st,&st->setup_peers); |
4f28e77e IJ |
1331 | FILLZERO(st->localN); |
1332 | FILLZERO(st->remoteN); | |
0afd257e | 1333 | dispose_transform(&st->new_transform); |
ff05a229 | 1334 | memset(st->dhsecret,0,st->dh->len); |
7c9ca4bd | 1335 | memset(st->sharedsecret,0,st->sharedsecretlen); |
9d3a4132 | 1336 | set_link_quality(st); |
2fe58dfd SE |
1337 | } |
1338 | ||
5c19b79c IJ |
1339 | static bool_t ensure_resolving(struct site *st) |
1340 | { | |
1341 | /* Reentrancy hazard: may call site_resolve_callback and hence | |
1342 | * enter_new_state, enter_state_* and generate_msg*. */ | |
1343 | if (st->resolving) | |
1344 | return True; | |
1345 | ||
4ac8a7d2 IJ |
1346 | assert(st->address); |
1347 | ||
5c19b79c IJ |
1348 | /* resolver->request might reentrantly call site_resolve_callback |
1349 | * which will clear st->resolving, so we need to set it beforehand | |
1350 | * rather than afterwards; also, it might return False, in which | |
1351 | * case we have to clear ->resolving again. */ | |
1352 | st->resolving=True; | |
1353 | bool_t ok = st->resolver->request(st->resolver->st,st->address, | |
1354 | site_resolve_callback,st); | |
1355 | if (!ok) | |
1356 | st->resolving=False; | |
1357 | ||
1358 | return ok; | |
1359 | } | |
1360 | ||
2fe58dfd SE |
1361 | static bool_t enter_state_resolve(struct site *st) |
1362 | { | |
77effe1d | 1363 | /* Reentrancy hazard! See ensure_resolving. */ |
2fe58dfd SE |
1364 | state_assert(st,st->state==SITE_RUN); |
1365 | slog(st,LOG_STATE,"entering state RESOLVE"); | |
1366 | st->state=SITE_RESOLVE; | |
5c19b79c | 1367 | return ensure_resolving(st); |
2fe58dfd SE |
1368 | } |
1369 | ||
ff05a229 | 1370 | static bool_t enter_new_state(struct site *st, uint32_t next) |
2fe58dfd | 1371 | { |
ff05a229 | 1372 | bool_t (*gen)(struct site *st); |
3b83c932 SE |
1373 | int r; |
1374 | ||
ff05a229 SE |
1375 | slog(st,LOG_STATE,"entering state %s",state_name(next)); |
1376 | switch(next) { | |
1377 | case SITE_SENTMSG1: | |
1378 | state_assert(st,st->state==SITE_RUN || st->state==SITE_RESOLVE); | |
1379 | gen=generate_msg1; | |
1380 | break; | |
1381 | case SITE_SENTMSG2: | |
1382 | state_assert(st,st->state==SITE_RUN || st->state==SITE_RESOLVE || | |
1383 | st->state==SITE_SENTMSG1 || st->state==SITE_WAIT); | |
1384 | gen=generate_msg2; | |
1385 | break; | |
1386 | case SITE_SENTMSG3: | |
1387 | state_assert(st,st->state==SITE_SENTMSG1); | |
1388 | BUF_FREE(&st->buffer); | |
1389 | gen=generate_msg3; | |
1390 | break; | |
1391 | case SITE_SENTMSG4: | |
1392 | state_assert(st,st->state==SITE_SENTMSG2); | |
1393 | BUF_FREE(&st->buffer); | |
1394 | gen=generate_msg4; | |
1395 | break; | |
1396 | case SITE_SENTMSG5: | |
1397 | state_assert(st,st->state==SITE_SENTMSG3); | |
1398 | BUF_FREE(&st->buffer); | |
1399 | gen=generate_msg5; | |
1400 | break; | |
1401 | case SITE_RUN: | |
1402 | state_assert(st,st->state==SITE_SENTMSG4); | |
1403 | BUF_FREE(&st->buffer); | |
1404 | gen=generate_msg6; | |
1405 | break; | |
1406 | default: | |
1407 | gen=NULL; | |
4f5e39ec | 1408 | fatal("enter_new_state(%s): invalid new state",state_name(next)); |
ff05a229 | 1409 | break; |
2fe58dfd | 1410 | } |
2fe58dfd | 1411 | |
3b83c932 SE |
1412 | if (hacky_par_start_failnow()) return False; |
1413 | ||
1414 | r= gen(st) && send_msg(st); | |
1415 | ||
1416 | hacky_par_end(&r, | |
e7f8ec2a | 1417 | st->setup_retries, st->setup_retry_interval, |
3b83c932 SE |
1418 | send_msg, st); |
1419 | ||
1420 | if (r) { | |
ff05a229 SE |
1421 | st->state=next; |
1422 | if (next==SITE_RUN) { | |
1423 | BUF_FREE(&st->buffer); /* Never reused */ | |
1424 | st->timeout=0; /* Never retransmit */ | |
1425 | activate_new_key(st); | |
1426 | } | |
2fe58dfd SE |
1427 | return True; |
1428 | } | |
ff05a229 SE |
1429 | slog(st,LOG_ERROR,"error entering state %s",state_name(next)); |
1430 | st->buffer.free=False; /* Unconditionally use the buffer; it may be | |
1431 | in either state, and enter_state_wait() will | |
1432 | do a BUF_FREE() */ | |
2fe58dfd SE |
1433 | enter_state_wait(st); |
1434 | return False; | |
1435 | } | |
1436 | ||
ff05a229 | 1437 | /* msg7 tells our peer that we're about to forget our key */ |
fe5e9cc4 | 1438 | static bool_t send_msg7(struct site *st, cstring_t reason) |
794f2398 | 1439 | { |
fe5e9cc4 | 1440 | cstring_t transform_err; |
794f2398 | 1441 | |
3d8d8f4e | 1442 | if (current_valid(st) && st->buffer.free |
446353cd | 1443 | && transport_peers_valid(&st->peers)) { |
794f2398 | 1444 | BUF_ALLOC(&st->buffer,"site:MSG7"); |
3abd18e8 | 1445 | buffer_init(&st->buffer,calculate_max_start_pad()); |
794f2398 SE |
1446 | buf_append_uint32(&st->buffer,LABEL_MSG7); |
1447 | buf_append_string(&st->buffer,reason); | |
0afd257e IJ |
1448 | if (call_transform_forwards(st, st->current.transform, |
1449 | &st->buffer, &transform_err)) | |
1450 | goto free_out; | |
794f2398 | 1451 | buf_prepend_uint32(&st->buffer,LABEL_MSG0); |
58650a70 | 1452 | buf_prepend_uint32(&st->buffer,st->index); |
19e9a588 | 1453 | buf_prepend_uint32(&st->buffer,st->current.remote_session_id); |
446353cd | 1454 | transport_xmit(st,&st->peers,&st->buffer,True); |
794f2398 | 1455 | BUF_FREE(&st->buffer); |
0afd257e | 1456 | free_out: |
794f2398 SE |
1457 | return True; |
1458 | } | |
1459 | return False; | |
1460 | } | |
1461 | ||
2fe58dfd SE |
1462 | /* We go into this state if our peer becomes uncommunicative. Similar to |
1463 | the "stop" state, we forget all session keys for a while, before | |
1464 | re-entering the "run" state. */ | |
1465 | static void enter_state_wait(struct site *st) | |
1466 | { | |
1467 | slog(st,LOG_STATE,"entering state WAIT"); | |
1468 | st->timeout=st->now+st->wait_timeout; | |
1469 | st->state=SITE_WAIT; | |
9d3a4132 | 1470 | set_link_quality(st); |
2fe58dfd SE |
1471 | BUF_FREE(&st->buffer); /* will have had an outgoing packet in it */ |
1472 | /* XXX Erase keys etc. */ | |
1473 | } | |
1474 | ||
dd9209d1 IJ |
1475 | static void generate_prod(struct site *st, struct buffer_if *buf) |
1476 | { | |
1477 | buffer_init(buf,0); | |
1478 | buf_append_uint32(buf,0); | |
1479 | buf_append_uint32(buf,0); | |
1480 | buf_append_uint32(buf,LABEL_PROD); | |
1481 | buf_append_string(buf,st->localname); | |
1482 | buf_append_string(buf,st->remotename); | |
1483 | } | |
1484 | ||
1485 | static void generate_send_prod(struct site *st, | |
1486 | const struct comm_addr *source) | |
1487 | { | |
1488 | if (!st->allow_send_prod) return; /* too soon */ | |
1489 | if (!(st->state==SITE_RUN || st->state==SITE_RESOLVE || | |
1490 | st->state==SITE_WAIT)) return; /* we'd ignore peer's MSG1 */ | |
1491 | ||
1492 | slog(st,LOG_SETUP_INIT,"prodding peer for key exchange"); | |
1493 | st->allow_send_prod=0; | |
1494 | generate_prod(st,&st->scratch); | |
1495 | dump_packet(st,&st->scratch,source,False); | |
1496 | source->comm->sendmsg(source->comm->st, &st->scratch, source); | |
1497 | } | |
1498 | ||
16f73fa6 | 1499 | static inline void site_settimeout(uint64_t timeout, int *timeout_io) |
fe5e9cc4 SE |
1500 | { |
1501 | if (timeout) { | |
0009e60a IJ |
1502 | int64_t offset=timeout-*now; |
1503 | if (offset<0) offset=0; | |
fe5e9cc4 SE |
1504 | if (offset>INT_MAX) offset=INT_MAX; |
1505 | if (*timeout_io<0 || offset<*timeout_io) | |
1506 | *timeout_io=offset; | |
1507 | } | |
1508 | } | |
1509 | ||
2fe58dfd | 1510 | static int site_beforepoll(void *sst, struct pollfd *fds, int *nfds_io, |
90a39563 | 1511 | int *timeout_io) |
2fe58dfd SE |
1512 | { |
1513 | struct site *st=sst; | |
1514 | ||
1515 | *nfds_io=0; /* We don't use any file descriptors */ | |
1516 | st->now=*now; | |
1517 | ||
1518 | /* Work out when our next timeout is. The earlier of 'timeout' or | |
19e9a588 | 1519 | 'current.key_timeout'. A stored value of '0' indicates no timeout |
2fe58dfd | 1520 | active. */ |
16f73fa6 | 1521 | site_settimeout(st->timeout, timeout_io); |
19e9a588 | 1522 | site_settimeout(st->current.key_timeout, timeout_io); |
02b0959b | 1523 | site_settimeout(st->auxiliary_key.key_timeout, timeout_io); |
2fe58dfd SE |
1524 | |
1525 | return 0; /* success */ | |
1526 | } | |
1527 | ||
1d388569 IJ |
1528 | static void check_expiry(struct site *st, struct data_key *key, |
1529 | const char *which) | |
1530 | { | |
1531 | if (key->key_timeout && *now>key->key_timeout) { | |
1532 | delete_one_key(st,key,"maximum life exceeded",which,LOG_TIMEOUT_KEY); | |
1533 | } | |
1534 | } | |
1535 | ||
2fe58dfd | 1536 | /* NB site_afterpoll will be called before site_beforepoll is ever called */ |
90a39563 | 1537 | static void site_afterpoll(void *sst, struct pollfd *fds, int nfds) |
2fe58dfd SE |
1538 | { |
1539 | struct site *st=sst; | |
1540 | ||
1541 | st->now=*now; | |
1542 | if (st->timeout && *now>st->timeout) { | |
2fe58dfd | 1543 | st->timeout=0; |
3b83c932 SE |
1544 | if (st->state>=SITE_SENTMSG1 && st->state<=SITE_SENTMSG5) { |
1545 | if (!hacky_par_start_failnow()) | |
1546 | send_msg(st); | |
1547 | } else if (st->state==SITE_WAIT) { | |
2fe58dfd SE |
1548 | enter_state_run(st); |
1549 | } else { | |
1550 | slog(st,LOG_ERROR,"site_afterpoll: unexpected timeout, state=%d", | |
1551 | st->state); | |
1552 | } | |
1553 | } | |
1d388569 | 1554 | check_expiry(st,&st->current,"current key"); |
02b0959b | 1555 | check_expiry(st,&st->auxiliary_key,"auxiliary key"); |
2fe58dfd SE |
1556 | } |
1557 | ||
1558 | /* This function is called by the netlink device to deliver packets | |
1559 | intended for the remote network. The packet is in "raw" wire | |
1560 | format, but is guaranteed to be word-aligned. */ | |
469fd1d9 | 1561 | static void site_outgoing(void *sst, struct buffer_if *buf) |
2fe58dfd SE |
1562 | { |
1563 | struct site *st=sst; | |
fe5e9cc4 | 1564 | cstring_t transform_err; |
2fe58dfd SE |
1565 | |
1566 | if (st->state==SITE_STOP) { | |
1567 | BUF_FREE(buf); | |
1568 | return; | |
1569 | } | |
1570 | ||
dd9209d1 IJ |
1571 | st->allow_send_prod=1; |
1572 | ||
2fe58dfd SE |
1573 | /* In all other states we consider delivering the packet if we have |
1574 | a valid key and a valid address to send it to. */ | |
3d8d8f4e | 1575 | if (current_valid(st) && transport_peers_valid(&st->peers)) { |
2fe58dfd | 1576 | /* Transform it and send it */ |
70dc107b SE |
1577 | if (buf->size>0) { |
1578 | buf_prepend_uint32(buf,LABEL_MSG9); | |
0afd257e IJ |
1579 | if (call_transform_forwards(st, st->current.transform, |
1580 | buf, &transform_err)) | |
1581 | goto free_out; | |
70dc107b | 1582 | buf_prepend_uint32(buf,LABEL_MSG0); |
58650a70 | 1583 | buf_prepend_uint32(buf,st->index); |
19e9a588 | 1584 | buf_prepend_uint32(buf,st->current.remote_session_id); |
446353cd | 1585 | transport_xmit(st,&st->peers,buf,False); |
70dc107b | 1586 | } |
0afd257e | 1587 | free_out: |
2fe58dfd SE |
1588 | BUF_FREE(buf); |
1589 | return; | |
1590 | } | |
1591 | ||
70dc107b | 1592 | slog(st,LOG_DROP,"discarding outgoing packet of size %d",buf->size); |
2fe58dfd | 1593 | BUF_FREE(buf); |
dd9209d1 | 1594 | initiate_key_setup(st,"outgoing packet",0); |
2fe58dfd SE |
1595 | } |
1596 | ||
7e29719e IJ |
1597 | static bool_t named_for_us(struct site *st, const struct buffer_if *buf_in, |
1598 | uint32_t type, struct msg *m) | |
1599 | /* For packets which are identified by the local and remote names. | |
1600 | * If it has our name and our peer's name in it it's for us. */ | |
1601 | { | |
1602 | struct buffer_if buf[1]; | |
1603 | buffer_readonly_clone(buf,buf_in); | |
1604 | return unpick_msg(st,type,buf,m) | |
1605 | && name_matches(&m->remote,st->remotename) | |
1606 | && name_matches(&m->local,st->localname); | |
1607 | } | |
1608 | ||
2fe58dfd | 1609 | /* This function is called by the communication device to deliver |
dd9209d1 IJ |
1610 | packets from our peers. |
1611 | It should return True if the packet is recognised as being for | |
1612 | this current site instance (and should therefore not be processed | |
1613 | by other sites), even if the packet was otherwise ignored. */ | |
2fe58dfd | 1614 | static bool_t site_incoming(void *sst, struct buffer_if *buf, |
a15faeb2 | 1615 | const struct comm_addr *source) |
2fe58dfd SE |
1616 | { |
1617 | struct site *st=sst; | |
20138876 IJ |
1618 | |
1619 | if (buf->size < 12) return False; | |
1620 | ||
0a6cbade IJ |
1621 | uint32_t dest=get_uint32(buf->start); |
1622 | uint32_t msgtype=get_uint32(buf->start+8); | |
7e29719e IJ |
1623 | struct msg named_msg; |
1624 | ||
1625 | if (msgtype==LABEL_MSG1) { | |
1626 | if (!named_for_us(st,buf,msgtype,&named_msg)) | |
1627 | return False; | |
1628 | /* It's a MSG1 addressed to us. Decide what to do about it. */ | |
1629 | dump_packet(st,buf,source,True); | |
1630 | if (st->state==SITE_RUN || st->state==SITE_RESOLVE || | |
1631 | st->state==SITE_WAIT) { | |
1632 | /* We should definitely process it */ | |
30834eab | 1633 | transport_compute_setupinit_peers(st,0,source); |
7e29719e IJ |
1634 | if (process_msg1(st,buf,source,&named_msg)) { |
1635 | slog(st,LOG_SETUP_INIT,"key setup initiated by peer"); | |
c22c3541 | 1636 | bool_t entered=enter_new_state(st,SITE_SENTMSG2); |
7d8d39dc | 1637 | if (entered && st->address && st->local_mobile) |
c22c3541 IJ |
1638 | /* We must do this as the very last thing, because |
1639 | the resolver callback might reenter us. */ | |
1640 | ensure_resolving(st); | |
7e29719e IJ |
1641 | } else { |
1642 | slog(st,LOG_ERROR,"failed to process incoming msg1"); | |
1643 | } | |
1644 | BUF_FREE(buf); | |
1645 | return True; | |
1646 | } else if (st->state==SITE_SENTMSG1) { | |
1647 | /* We've just sent a message 1! They may have crossed on | |
1648 | the wire. If we have priority then we ignore the | |
1649 | incoming one, otherwise we process it as usual. */ | |
1650 | if (st->setup_priority) { | |
1651 | BUF_FREE(buf); | |
1652 | slog(st,LOG_DUMP,"crossed msg1s; we are higher " | |
1653 | "priority => ignore incoming msg1"); | |
1654 | return True; | |
1655 | } else { | |
1656 | slog(st,LOG_DUMP,"crossed msg1s; we are lower " | |
1657 | "priority => use incoming msg1"); | |
1658 | if (process_msg1(st,buf,source,&named_msg)) { | |
1659 | BUF_FREE(&st->buffer); /* Free our old message 1 */ | |
c22c3541 | 1660 | transport_setup_msgok(st,source); |
ff05a229 | 1661 | enter_new_state(st,SITE_SENTMSG2); |
2fe58dfd | 1662 | } else { |
7e29719e IJ |
1663 | slog(st,LOG_ERROR,"failed to process an incoming " |
1664 | "crossed msg1 (we have low priority)"); | |
2fe58dfd SE |
1665 | } |
1666 | BUF_FREE(buf); | |
1667 | return True; | |
2fe58dfd | 1668 | } |
2fe58dfd | 1669 | } |
7e29719e IJ |
1670 | /* The message 1 was received at an unexpected stage of the |
1671 | key setup. XXX POLICY - what do we do? */ | |
1672 | slog(st,LOG_UNEXPECTED,"unexpected incoming message 1"); | |
1673 | BUF_FREE(buf); | |
1674 | return True; | |
2fe58dfd | 1675 | } |
dd9209d1 IJ |
1676 | if (msgtype==LABEL_PROD) { |
1677 | if (!named_for_us(st,buf,msgtype,&named_msg)) | |
1678 | return False; | |
1679 | dump_packet(st,buf,source,True); | |
1680 | if (st->state!=SITE_RUN) { | |
1681 | slog(st,LOG_DROP,"ignoring PROD when not in state RUN"); | |
1682 | } else if (current_valid(st)) { | |
1683 | slog(st,LOG_DROP,"ignoring PROD when we think we have a key"); | |
1684 | } else { | |
1685 | initiate_key_setup(st,"peer sent PROD packet",source); | |
1686 | } | |
1687 | BUF_FREE(buf); | |
1688 | return True; | |
1689 | } | |
58650a70 | 1690 | if (dest==st->index) { |
2fe58dfd SE |
1691 | /* Explicitly addressed to us */ |
1692 | if (msgtype!=LABEL_MSG0) dump_packet(st,buf,source,True); | |
1693 | switch (msgtype) { | |
136740e6 | 1694 | case LABEL_NAK: |
794f2398 SE |
1695 | /* If the source is our current peer then initiate a key setup, |
1696 | because our peer's forgotten the key */ | |
19e9a588 | 1697 | if (get_uint32(buf->start+4)==st->current.remote_session_id) { |
dd9209d1 | 1698 | bool_t initiated; |
e5e67212 | 1699 | initiated = initiate_key_setup(st,"received a NAK",source); |
dd9209d1 | 1700 | if (!initiated) generate_send_prod(st,source); |
794f2398 SE |
1701 | } else { |
1702 | slog(st,LOG_SEC,"bad incoming NAK"); | |
1703 | } | |
1704 | break; | |
2fe58dfd SE |
1705 | case LABEL_MSG0: |
1706 | process_msg0(st,buf,source); | |
1707 | break; | |
1708 | case LABEL_MSG1: | |
1709 | /* Setup packet: should not have been explicitly addressed | |
1710 | to us */ | |
59635212 | 1711 | slog(st,LOG_SEC,"incoming explicitly addressed msg1"); |
2fe58dfd SE |
1712 | break; |
1713 | case LABEL_MSG2: | |
1714 | /* Setup packet: expected only in state SENTMSG1 */ | |
1715 | if (st->state!=SITE_SENTMSG1) { | |
1716 | slog(st,LOG_UNEXPECTED,"unexpected MSG2"); | |
446353cd IJ |
1717 | } else if (process_msg2(st,buf,source)) { |
1718 | transport_setup_msgok(st,source); | |
ff05a229 | 1719 | enter_new_state(st,SITE_SENTMSG3); |
446353cd | 1720 | } else { |
59635212 | 1721 | slog(st,LOG_SEC,"invalid MSG2"); |
2fe58dfd SE |
1722 | } |
1723 | break; | |
1724 | case LABEL_MSG3: | |
5b5f297f | 1725 | case LABEL_MSG3BIS: |
2fe58dfd SE |
1726 | /* Setup packet: expected only in state SENTMSG2 */ |
1727 | if (st->state!=SITE_SENTMSG2) { | |
1728 | slog(st,LOG_UNEXPECTED,"unexpected MSG3"); | |
5b5f297f | 1729 | } else if (process_msg3(st,buf,source,msgtype)) { |
446353cd | 1730 | transport_setup_msgok(st,source); |
ff05a229 | 1731 | enter_new_state(st,SITE_SENTMSG4); |
446353cd | 1732 | } else { |
59635212 | 1733 | slog(st,LOG_SEC,"invalid MSG3"); |
2fe58dfd SE |
1734 | } |
1735 | break; | |
1736 | case LABEL_MSG4: | |
1737 | /* Setup packet: expected only in state SENTMSG3 */ | |
1738 | if (st->state!=SITE_SENTMSG3) { | |
1739 | slog(st,LOG_UNEXPECTED,"unexpected MSG4"); | |
446353cd IJ |
1740 | } else if (process_msg4(st,buf,source)) { |
1741 | transport_setup_msgok(st,source); | |
ff05a229 | 1742 | enter_new_state(st,SITE_SENTMSG5); |
446353cd | 1743 | } else { |
59635212 | 1744 | slog(st,LOG_SEC,"invalid MSG4"); |
2fe58dfd SE |
1745 | } |
1746 | break; | |
1747 | case LABEL_MSG5: | |
4efd681a SE |
1748 | /* Setup packet: expected only in state SENTMSG4 */ |
1749 | /* (may turn up in state RUN if our return MSG6 was lost | |
1750 | and the new key has already been activated. In that | |
05f39b4d IJ |
1751 | case we discard it. The peer will realise that we |
1752 | are using the new key when they see our data packets. | |
1753 | Until then the peer's data packets to us get discarded. */ | |
c90cc2a7 IJ |
1754 | if (st->state==SITE_SENTMSG4) { |
1755 | if (process_msg5(st,buf,source,st->new_transform)) { | |
1756 | transport_setup_msgok(st,source); | |
1757 | enter_new_state(st,SITE_RUN); | |
1758 | } else { | |
1759 | slog(st,LOG_SEC,"invalid MSG5"); | |
1760 | } | |
1761 | } else if (st->state==SITE_RUN) { | |
19e9a588 | 1762 | if (process_msg5(st,buf,source,st->current.transform)) { |
c90cc2a7 IJ |
1763 | slog(st,LOG_DROP,"got MSG5, retransmitting MSG6"); |
1764 | transport_setup_msgok(st,source); | |
19e9a588 IJ |
1765 | create_msg6(st,st->current.transform, |
1766 | st->current.remote_session_id); | |
c90cc2a7 IJ |
1767 | transport_xmit(st,&st->peers,&st->buffer,True); |
1768 | BUF_FREE(&st->buffer); | |
1769 | } else { | |
1770 | slog(st,LOG_SEC,"invalid MSG5 (in state RUN)"); | |
1771 | } | |
2fe58dfd | 1772 | } else { |
c90cc2a7 | 1773 | slog(st,LOG_UNEXPECTED,"unexpected MSG5"); |
2fe58dfd SE |
1774 | } |
1775 | break; | |
1776 | case LABEL_MSG6: | |
1777 | /* Setup packet: expected only in state SENTMSG5 */ | |
1778 | if (st->state!=SITE_SENTMSG5) { | |
1779 | slog(st,LOG_UNEXPECTED,"unexpected MSG6"); | |
1780 | } else if (process_msg6(st,buf,source)) { | |
1781 | BUF_FREE(&st->buffer); /* Free message 5 */ | |
446353cd | 1782 | transport_setup_msgok(st,source); |
2fe58dfd SE |
1783 | activate_new_key(st); |
1784 | } else { | |
59635212 | 1785 | slog(st,LOG_SEC,"invalid MSG6"); |
2fe58dfd SE |
1786 | } |
1787 | break; | |
2fe58dfd | 1788 | default: |
59635212 | 1789 | slog(st,LOG_SEC,"received message of unknown type 0x%08x", |
2fe58dfd SE |
1790 | msgtype); |
1791 | break; | |
1792 | } | |
1793 | BUF_FREE(buf); | |
1794 | return True; | |
1795 | } | |
1796 | ||
1797 | return False; | |
1798 | } | |
1799 | ||
1800 | static void site_control(void *vst, bool_t run) | |
1801 | { | |
1802 | struct site *st=vst; | |
1803 | if (run) enter_state_run(st); | |
1804 | else enter_state_stop(st); | |
1805 | } | |
1806 | ||
794f2398 SE |
1807 | static void site_phase_hook(void *sst, uint32_t newphase) |
1808 | { | |
1809 | struct site *st=sst; | |
1810 | ||
1811 | /* The program is shutting down; tell our peer */ | |
1812 | send_msg7(st,"shutting down"); | |
1813 | } | |
1814 | ||
2fe58dfd SE |
1815 | static list_t *site_apply(closure_t *self, struct cloc loc, dict_t *context, |
1816 | list_t *args) | |
1817 | { | |
58650a70 | 1818 | static uint32_t index_sequence; |
2fe58dfd SE |
1819 | struct site *st; |
1820 | item_t *item; | |
1821 | dict_t *dict; | |
59533c16 | 1822 | int i; |
2fe58dfd SE |
1823 | |
1824 | st=safe_malloc(sizeof(*st),"site_apply"); | |
1825 | ||
1826 | st->cl.description="site"; | |
1827 | st->cl.type=CL_SITE; | |
1828 | st->cl.apply=NULL; | |
1829 | st->cl.interface=&st->ops; | |
1830 | st->ops.st=st; | |
1831 | st->ops.control=site_control; | |
1832 | st->ops.status=site_status; | |
1833 | ||
1834 | /* First parameter must be a dict */ | |
1835 | item=list_elem(args,0); | |
1836 | if (!item || item->type!=t_dict) | |
1837 | cfgfatal(loc,"site","parameter must be a dictionary\n"); | |
1838 | ||
1839 | dict=item->data.dict; | |
558fa3fb SE |
1840 | st->localname=dict_read_string(dict, "local-name", True, "site", loc); |
1841 | st->remotename=dict_read_string(dict, "name", True, "site", loc); | |
dba19f84 IJ |
1842 | |
1843 | st->peer_mobile=dict_read_bool(dict,"mobile",False,"site",loc,False); | |
0391d9ee | 1844 | st->local_mobile= |
dba19f84 IJ |
1845 | dict_read_bool(dict,"local-mobile",False,"site",loc,False); |
1846 | ||
558fa3fb SE |
1847 | /* Sanity check (which also allows the 'sites' file to include |
1848 | site() closures for all sites including our own): refuse to | |
1849 | talk to ourselves */ | |
1850 | if (strcmp(st->localname,st->remotename)==0) { | |
b2a56f7c | 1851 | Message(M_DEBUG,"site %s: local-name==name -> ignoring this site\n", |
baa06aeb | 1852 | st->localname); |
0391d9ee | 1853 | if (st->peer_mobile != st->local_mobile) |
dba19f84 IJ |
1854 | cfgfatal(loc,"site","site %s's peer-mobile=%d" |
1855 | " but our local-mobile=%d\n", | |
0391d9ee | 1856 | st->localname, st->peer_mobile, st->local_mobile); |
dba19f84 IJ |
1857 | free(st); |
1858 | return NULL; | |
1859 | } | |
0391d9ee | 1860 | if (st->peer_mobile && st->local_mobile) { |
dba19f84 IJ |
1861 | Message(M_WARNING,"site %s: site is mobile but so are we" |
1862 | " -> ignoring this site\n", st->remotename); | |
558fa3fb SE |
1863 | free(st); |
1864 | return NULL; | |
1865 | } | |
dba19f84 | 1866 | |
58650a70 RK |
1867 | assert(index_sequence < 0xffffffffUL); |
1868 | st->index = ++index_sequence; | |
09a385fb | 1869 | st->local_capabilities = 0; |
469fd1d9 | 1870 | st->netlink=find_cl_if(dict,"link",CL_NETLINK,True,"site",loc); |
59533c16 | 1871 | |
5b5f297f IJ |
1872 | #define GET_CLOSURE_LIST(dictkey,things,nthings,CL_TYPE) do{ \ |
1873 | list_t *things##_cfg=dict_lookup(dict,dictkey); \ | |
1874 | if (!things##_cfg) \ | |
1875 | cfgfatal(loc,"site","closure list \"%s\" not found\n",dictkey); \ | |
1876 | st->nthings=list_length(things##_cfg); \ | |
1877 | st->things=safe_malloc_ary(sizeof(*st->things),st->nthings,dictkey "s"); \ | |
1878 | assert(st->nthings); \ | |
1879 | for (i=0; i<st->nthings; i++) { \ | |
1880 | item_t *item=list_elem(things##_cfg,i); \ | |
1881 | if (item->type!=t_closure) \ | |
1882 | cfgfatal(loc,"site","%s is not a closure\n",dictkey); \ | |
1883 | closure_t *cl=item->data.closure; \ | |
1884 | if (cl->type!=CL_TYPE) \ | |
1885 | cfgfatal(loc,"site","%s closure wrong type\n",dictkey); \ | |
1886 | st->things[i]=cl->interface; \ | |
1887 | } \ | |
1888 | }while(0) | |
1889 | ||
1890 | GET_CLOSURE_LIST("comm",comms,ncomms,CL_COMM); | |
59533c16 | 1891 | |
2fe58dfd SE |
1892 | st->resolver=find_cl_if(dict,"resolver",CL_RESOLVER,True,"site",loc); |
1893 | st->log=find_cl_if(dict,"log",CL_LOG,True,"site",loc); | |
1894 | st->random=find_cl_if(dict,"random",CL_RANDOMSRC,True,"site",loc); | |
1895 | ||
2fe58dfd | 1896 | st->privkey=find_cl_if(dict,"local-key",CL_RSAPRIVKEY,True,"site",loc); |
2fe58dfd | 1897 | st->address=dict_read_string(dict, "address", False, "site", loc); |
3454dce4 SE |
1898 | if (st->address) |
1899 | st->remoteport=dict_read_number(dict,"port",True,"site",loc,0); | |
1900 | else st->remoteport=0; | |
2fe58dfd SE |
1901 | st->pubkey=find_cl_if(dict,"key",CL_RSAPUBKEY,True,"site",loc); |
1902 | ||
5b5f297f | 1903 | GET_CLOSURE_LIST("transform",transforms,ntransforms,CL_TRANSFORM); |
2fe58dfd SE |
1904 | |
1905 | st->dh=find_cl_if(dict,"dh",CL_DH,True,"site",loc); | |
1906 | st->hash=find_cl_if(dict,"hash",CL_HASH,True,"site",loc); | |
1907 | ||
0391d9ee | 1908 | #define DEFAULT(D) (st->peer_mobile || st->local_mobile \ |
e57264d6 | 1909 | ? DEFAULT_MOBILE_##D : DEFAULT_##D) |
e7f8ec2a | 1910 | #define CFG_NUMBER(k,D) dict_read_number(dict,(k),False,"site",loc,DEFAULT(D)); |
c27ca22f | 1911 | |
e7f8ec2a IJ |
1912 | st->key_lifetime= CFG_NUMBER("key-lifetime", KEY_LIFETIME); |
1913 | st->setup_retries= CFG_NUMBER("setup-retries", SETUP_RETRIES); | |
1914 | st->setup_retry_interval= CFG_NUMBER("setup-timeout", SETUP_RETRY_INTERVAL); | |
1915 | st->wait_timeout= CFG_NUMBER("wait-time", WAIT_TIME); | |
3ed1846a | 1916 | st->mtu_target= dict_read_number(dict,"mtu-target",False,"site",loc,0); |
e7f8ec2a | 1917 | |
446353cd IJ |
1918 | st->mobile_peer_expiry= dict_read_number( |
1919 | dict,"mobile-peer-expiry",False,"site",loc,DEFAULT_MOBILE_PEER_EXPIRY); | |
1920 | ||
1921 | st->transport_peers_max= !st->peer_mobile ? 1 : dict_read_number( | |
1922 | dict,"mobile-peers-max",False,"site",loc,DEFAULT_MOBILE_PEERS_MAX); | |
1923 | if (st->transport_peers_max<1 || | |
ca0a30fc | 1924 | st->transport_peers_max>MAX_MOBILE_PEERS_MAX) { |
446353cd IJ |
1925 | cfgfatal(loc,"site","mobile-peers-max must be in range 1.." |
1926 | STRING(MAX_MOBILE_PEERS_MAX) "\n"); | |
1927 | } | |
1928 | ||
e7f8ec2a | 1929 | if (st->key_lifetime < DEFAULT(KEY_RENEGOTIATE_GAP)*2) |
c27ca22f IJ |
1930 | st->key_renegotiate_time=st->key_lifetime/2; |
1931 | else | |
e7f8ec2a | 1932 | st->key_renegotiate_time=st->key_lifetime-DEFAULT(KEY_RENEGOTIATE_GAP); |
9d3a4132 | 1933 | st->key_renegotiate_time=dict_read_number( |
cce0051f | 1934 | dict,"renegotiate-time",False,"site",loc,st->key_renegotiate_time); |
9d3a4132 SE |
1935 | if (st->key_renegotiate_time > st->key_lifetime) { |
1936 | cfgfatal(loc,"site", | |
1937 | "renegotiate-time must be less than key-lifetime\n"); | |
1938 | } | |
9d3a4132 SE |
1939 | |
1940 | st->log_events=string_list_to_word(dict_lookup(dict,"log-events"), | |
1941 | log_event_table,"site"); | |
2fe58dfd | 1942 | |
5c19b79c | 1943 | st->resolving=False; |
dd9209d1 IJ |
1944 | st->allow_send_prod=0; |
1945 | ||
4efd681a SE |
1946 | st->tunname=safe_malloc(strlen(st->localname)+strlen(st->remotename)+5, |
1947 | "site_apply"); | |
1948 | sprintf(st->tunname,"%s<->%s",st->localname,st->remotename); | |
1949 | ||
2fe58dfd | 1950 | /* The information we expect to see in incoming messages of type 1 */ |
59230b9b IJ |
1951 | /* fixme: lots of unchecked overflows here, but the results are only |
1952 | corrupted packets rather than undefined behaviour */ | |
2fe58dfd SE |
1953 | st->setup_priority=(strcmp(st->localname,st->remotename)>0); |
1954 | ||
1955 | buffer_new(&st->buffer,SETUP_BUFFER_LEN); | |
1956 | ||
8aaaa634 | 1957 | buffer_new(&st->scratch,SETUP_BUFFER_LEN); |
05f39b4d IJ |
1958 | BUF_ALLOC(&st->scratch,"site:scratch"); |
1959 | ||
2fe58dfd SE |
1960 | /* We are interested in poll(), but only for timeouts. We don't have |
1961 | any fds of our own. */ | |
1962 | register_for_poll(st, site_beforepoll, site_afterpoll, 0, "site"); | |
1963 | st->timeout=0; | |
1964 | ||
09a385fb | 1965 | st->remote_capabilities=0; |
5b5f297f | 1966 | st->chosen_transform=0; |
19e9a588 | 1967 | st->current.key_timeout=0; |
02b0959b | 1968 | st->auxiliary_key.key_timeout=0; |
446353cd IJ |
1969 | transport_peers_clear(st,&st->peers); |
1970 | transport_peers_clear(st,&st->setup_peers); | |
2fe58dfd SE |
1971 | /* XXX mlock these */ |
1972 | st->dhsecret=safe_malloc(st->dh->len,"site:dhsecret"); | |
5b5f297f IJ |
1973 | st->sharedsecretlen=st->sharedsecretallocd=0; |
1974 | st->sharedsecret=0; | |
1975 | ||
5b5f297f IJ |
1976 | for (i=0; i<st->ntransforms; i++) { |
1977 | struct transform_if *ti=st->transforms[i]; | |
1978 | uint32_t capbit = 1UL << ti->capab_transformnum; | |
1979 | if (st->local_capabilities & capbit) | |
1980 | slog(st,LOG_ERROR,"transformnum capability bit" | |
1981 | " %d (%#"PRIx32") reused", ti->capab_transformnum, capbit); | |
1982 | st->local_capabilities |= capbit; | |
59533c16 | 1983 | } |
59533c16 | 1984 | |
2fe58dfd | 1985 | /* We need to register the remote networks with the netlink device */ |
3ed1846a IJ |
1986 | uint32_t netlink_mtu; /* local virtual interface mtu */ |
1987 | st->netlink->reg(st->netlink->st, site_outgoing, st, &netlink_mtu); | |
1988 | if (!st->mtu_target) | |
1989 | st->mtu_target=netlink_mtu; | |
ff05a229 | 1990 | |
59533c16 IJ |
1991 | for (i=0; i<st->ncomms; i++) |
1992 | st->comms[i]->request_notify(st->comms[i]->st, st, site_incoming); | |
2fe58dfd | 1993 | |
fcad4b0b IJ |
1994 | st->current.transform=0; |
1995 | st->auxiliary_key.transform=0; | |
1996 | st->new_transform=0; | |
bd98cd6b | 1997 | st->auxiliary_is_new=0; |
2fe58dfd SE |
1998 | |
1999 | enter_state_stop(st); | |
2000 | ||
794f2398 SE |
2001 | add_hook(PHASE_SHUTDOWN,site_phase_hook,st); |
2002 | ||
2fe58dfd SE |
2003 | return new_closure(&st->cl); |
2004 | } | |
2005 | ||
2fe58dfd SE |
2006 | void site_module(dict_t *dict) |
2007 | { | |
2008 | add_closure(dict,"site",site_apply); | |
2009 | } | |
446353cd IJ |
2010 | |
2011 | ||
2012 | /***** TRANSPORT PEERS definitions *****/ | |
2013 | ||
2014 | static void transport_peers_debug(struct site *st, transport_peers *dst, | |
2015 | const char *didwhat, | |
2016 | int nargs, const struct comm_addr *args, | |
2017 | size_t stride) { | |
2018 | int i; | |
2019 | char *argp; | |
2020 | ||
2021 | if (!(st->log_events & LOG_PEER_ADDRS)) | |
2022 | return; /* an optimisation */ | |
2023 | ||
2024 | slog(st, LOG_PEER_ADDRS, "peers (%s) %s nargs=%d => npeers=%d", | |
2025 | (dst==&st->peers ? "data" : | |
2026 | dst==&st->setup_peers ? "setup" : "UNKNOWN"), | |
2027 | didwhat, nargs, dst->npeers); | |
2028 | ||
2029 | for (i=0, argp=(void*)args; | |
2030 | i<nargs; | |
2031 | i++, (argp+=stride?stride:sizeof(*args))) { | |
2032 | const struct comm_addr *ca=(void*)argp; | |
2033 | slog(st, LOG_PEER_ADDRS, " args: addrs[%d]=%s", | |
1a448682 | 2034 | i, comm_addr_to_string(ca)); |
446353cd IJ |
2035 | } |
2036 | for (i=0; i<dst->npeers; i++) { | |
2037 | struct timeval diff; | |
2038 | timersub(tv_now,&dst->peers[i].last,&diff); | |
2039 | const struct comm_addr *ca=&dst->peers[i].addr; | |
2040 | slog(st, LOG_PEER_ADDRS, " peers: addrs[%d]=%s T-%ld.%06ld", | |
1a448682 | 2041 | i, comm_addr_to_string(ca), |
446353cd IJ |
2042 | (unsigned long)diff.tv_sec, (unsigned long)diff.tv_usec); |
2043 | } | |
2044 | } | |
2045 | ||
2046 | static int transport_peer_compar(const void *av, const void *bv) { | |
2047 | const transport_peer *a=av; | |
2048 | const transport_peer *b=bv; | |
2049 | /* put most recent first in the array */ | |
2050 | if (timercmp(&a->last, &b->last, <)) return +1; | |
2051 | if (timercmp(&a->last, &b->last, >)) return -11; | |
2052 | return 0; | |
2053 | } | |
2054 | ||
2055 | static void transport_peers_expire(struct site *st, transport_peers *peers) { | |
2056 | /* peers must be sorted first */ | |
2057 | int previous_peers=peers->npeers; | |
2058 | struct timeval oldest; | |
2059 | oldest.tv_sec = tv_now->tv_sec - st->mobile_peer_expiry; | |
2060 | oldest.tv_usec = tv_now->tv_usec; | |
2061 | while (peers->npeers>1 && | |
2062 | timercmp(&peers->peers[peers->npeers-1].last, &oldest, <)) | |
2063 | peers->npeers--; | |
2064 | if (peers->npeers != previous_peers) | |
2065 | transport_peers_debug(st,peers,"expire", 0,0,0); | |
2066 | } | |
2067 | ||
2068 | static void transport_record_peer(struct site *st, transport_peers *peers, | |
2069 | const struct comm_addr *addr, const char *m) { | |
2070 | int slot, changed=0; | |
2071 | ||
2072 | for (slot=0; slot<peers->npeers; slot++) | |
2073 | if (!memcmp(&peers->peers[slot].addr, addr, sizeof(*addr))) | |
2074 | goto found; | |
2075 | ||
2076 | changed=1; | |
2077 | if (peers->npeers==st->transport_peers_max) | |
925c5ca8 | 2078 | slot=st->transport_peers_max-1; |
446353cd IJ |
2079 | else |
2080 | slot=peers->npeers++; | |
2081 | ||
2082 | found: | |
2083 | peers->peers[slot].addr=*addr; | |
2084 | peers->peers[slot].last=*tv_now; | |
2085 | ||
2086 | if (peers->npeers>1) | |
2087 | qsort(peers->peers, peers->npeers, | |
2088 | sizeof(*peers->peers), transport_peer_compar); | |
2089 | ||
2090 | if (changed || peers->npeers!=1) | |
2091 | transport_peers_debug(st,peers,m, 1,addr,0); | |
2092 | transport_peers_expire(st, peers); | |
2093 | } | |
2094 | ||
2095 | static bool_t transport_compute_setupinit_peers(struct site *st, | |
dd9209d1 | 2096 | const struct comm_addr *configured_addr /* 0 if none or not found */, |
a96fda35 | 2097 | const struct comm_addr *incoming_packet_addr /* 0 if none */) { |
446353cd | 2098 | |
a96fda35 | 2099 | if (!configured_addr && !incoming_packet_addr && |
dd9209d1 | 2100 | !transport_peers_valid(&st->peers)) |
446353cd IJ |
2101 | return False; |
2102 | ||
2103 | slog(st,LOG_SETUP_INIT, | |
dd9209d1 IJ |
2104 | "using:%s%s %d old peer address(es)", |
2105 | configured_addr ? " configured address;" : "", | |
a96fda35 | 2106 | incoming_packet_addr ? " incoming packet address;" : "", |
779837e1 | 2107 | st->peers.npeers); |
446353cd | 2108 | |
0391d9ee | 2109 | /* Non-mobile peers have st->peers.npeers==0 or ==1, since they |
446353cd IJ |
2110 | * have transport_peers_max==1. The effect is that this code |
2111 | * always uses the configured address if supplied, or otherwise | |
dd9209d1 IJ |
2112 | * the address of the incoming PROD, or the existing data peer if |
2113 | * one exists; this is as desired. */ | |
446353cd IJ |
2114 | |
2115 | transport_peers_copy(st,&st->setup_peers,&st->peers); | |
2116 | ||
a96fda35 IJ |
2117 | if (incoming_packet_addr) |
2118 | transport_record_peer(st,&st->setup_peers,incoming_packet_addr, | |
2119 | "incoming"); | |
dd9209d1 | 2120 | |
446353cd IJ |
2121 | if (configured_addr) |
2122 | transport_record_peer(st,&st->setup_peers,configured_addr,"setupinit"); | |
2123 | ||
2124 | assert(transport_peers_valid(&st->setup_peers)); | |
2125 | return True; | |
2126 | } | |
2127 | ||
2128 | static void transport_setup_msgok(struct site *st, const struct comm_addr *a) { | |
2129 | if (st->peer_mobile) | |
2130 | transport_record_peer(st,&st->setup_peers,a,"setupmsg"); | |
2131 | } | |
2132 | static void transport_data_msgok(struct site *st, const struct comm_addr *a) { | |
2133 | if (st->peer_mobile) | |
2134 | transport_record_peer(st,&st->peers,a,"datamsg"); | |
2135 | } | |
2136 | ||
2137 | static int transport_peers_valid(transport_peers *peers) { | |
2138 | return peers->npeers; | |
2139 | } | |
2140 | static void transport_peers_clear(struct site *st, transport_peers *peers) { | |
2141 | peers->npeers= 0; | |
2142 | transport_peers_debug(st,peers,"clear",0,0,0); | |
2143 | } | |
2144 | static void transport_peers_copy(struct site *st, transport_peers *dst, | |
2145 | const transport_peers *src) { | |
2146 | dst->npeers=src->npeers; | |
4f28e77e | 2147 | COPY_ARRAY(dst->peers, src->peers, dst->npeers); |
446353cd | 2148 | transport_peers_debug(st,dst,"copy", |
a620a048 | 2149 | src->npeers, &src->peers->addr, sizeof(*src->peers)); |
446353cd IJ |
2150 | } |
2151 | ||
90d7e3ad IJ |
2152 | static void transport_resolve_complete(struct site *st, |
2153 | const struct comm_addr *ca_use) { | |
2154 | transport_record_peer(st,&st->peers,ca_use,"resolved data"); | |
2155 | transport_record_peer(st,&st->setup_peers,ca_use,"resolved setup"); | |
2156 | } | |
2157 | ||
2158 | static void transport_resolve_complete_tardy(struct site *st, | |
2159 | const struct comm_addr *ca_use) { | |
2160 | transport_record_peer(st,&st->peers,ca_use,"resolved tardily"); | |
2161 | } | |
2162 | ||
446353cd IJ |
2163 | void transport_xmit(struct site *st, transport_peers *peers, |
2164 | struct buffer_if *buf, bool_t candebug) { | |
2165 | int slot; | |
2166 | transport_peers_expire(st, peers); | |
2167 | for (slot=0; slot<peers->npeers; slot++) { | |
2168 | transport_peer *peer=&peers->peers[slot]; | |
2169 | if (candebug) | |
2170 | dump_packet(st, buf, &peer->addr, False); | |
2171 | peer->addr.comm->sendmsg(peer->addr.comm->st, buf, &peer->addr); | |
2172 | } | |
2173 | } | |
2174 | ||
2175 | /***** END of transport peers declarations *****/ |