3 * $Id: peer.c,v 1.10 2003/10/15 09:29:38 mdw Exp $
5 * Communication with the peer
7 * (c) 2001 Straylight/Edgeware
10 /*----- Licensing notice --------------------------------------------------*
12 * This file is part of Trivial IP Encryption (TrIPE).
14 * TrIPE is free software; you can redistribute it and/or modify
15 * it under the terms of the GNU General Public License as published by
16 * the Free Software Foundation; either version 2 of the License, or
17 * (at your option) any later version.
19 * TrIPE is distributed in the hope that it will be useful,
20 * but WITHOUT ANY WARRANTY; without even the implied warranty of
21 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * GNU General Public License for more details.
24 * You should have received a copy of the GNU General Public License
25 * along with TrIPE; if not, write to the Free Software Foundation,
26 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
29 /*----- Revision history --------------------------------------------------*
32 * Revision 1.10 2003/10/15 09:29:38 mdw
33 * Cosmetic fix to changelog comment.
35 * Revision 1.9 2003/07/13 11:19:49 mdw
36 * Incompatible protocol fix! Include message type code under MAC tag to
37 * prevent cut-and-paste from key-exchange messages to general packet
40 * Revision 1.8 2003/05/16 12:09:03 mdw
41 * Allow binding to a chosen address.
43 * Revision 1.7 2003/04/15 14:12:05 mdw
44 * Insert a newline to improve readability.
46 * Revision 1.6 2001/06/19 22:07:59 mdw
47 * Use magic number for packet size.
49 * Revision 1.5 2001/03/03 11:15:19 mdw
50 * Set the socket send and receive buffers to maximum. At least this way,
51 * we won't drop large packets on the floor. If the administrator wants to
52 * prevent fragmentation of TrIPE messages, he can lower the MTU on the
53 * tunnel interface. Getting path-MTU stuff out of the kernel is too much
54 * system-specific hard work for this program.
56 * Revision 1.4 2001/02/16 21:40:24 mdw
57 * Change key exchange message interface. Maintain statistics.
59 * Revision 1.3 2001/02/04 17:10:58 mdw
60 * Make file descriptors be nonblocking and close-on-exec.
62 * Revision 1.2 2001/02/03 22:40:29 mdw
63 * Put timer information into the entropy pool when packets are received
64 * and on similar events. Reseed the generator on the interval timer.
66 * Revision 1.1 2001/02/03 20:26:37 mdw
71 /*----- Header files ------------------------------------------------------*/
75 /*----- Static variables --------------------------------------------------*/
77 static peer
*peers
= 0;
80 /*----- Main code ---------------------------------------------------------*/
84 * Arguments: @int fd@ = file descriptor to read from
85 * @unsigned mode@ = what happened
86 * @void *v@ = an uninteresting pointer
90 * Use: Reads a packet from somewhere.
93 static void p_read(int fd
, unsigned mode
, void *v
)
102 /* --- Read the data --- */
106 n
= recvfrom(fd
, buf_i
, sizeof(buf_i
), 0, &a
.sa
, &sz
);
108 a_warn("error reading socket: %s", strerror(errno
));
112 /* --- Find the appropriate peer --- */
114 assert(a
.sa
.sa_family
== AF_INET
);
115 for (p
= peers
; p
; p
= p
->next
) {
116 if (p
->peer
.sin
.sin_addr
.s_addr
== a
.sin
.sin_addr
.s_addr
&&
117 p
->peer
.sin
.sin_port
== a
.sin
.sin_port
)
120 a_warn("packet from unexpected peer: %s:%u",
121 inet_ntoa(a
.sin
.sin_addr
), (unsigned)ntohs(a
.sin
.sin_port
));
125 T( trace(T_PEER
, "peer: packet received from `%s'", p
->name
);
126 trace_block(T_PACKET
, "peer: packet contents", buf_i
, n
); )
128 /* --- Pick the packet apart --- */
130 p
->st
.t_last
= time(0);
133 buf_init(&b
, buf_i
, n
);
134 if ((ch
= buf_getbyte(&b
)) < 0) {
135 a_warn("bad packet from `%s': no type byte", p
->name
);
138 switch (ch
& MSG_CATMASK
) {
140 if (ch
& MSG_TYPEMASK
) {
141 a_warn("unknown packet type from `%s'", p
->name
);
145 buf_init(&bb
, buf_o
, sizeof(buf_o
));
146 if (ksl_decrypt(&p
->ks
, MSG_PACKET
, &b
, &bb
)) {
148 a_warn("couldn't decrypt inbound packet from `%s'", p
->name
);
153 p
->st
.sz_ipin
+= BSZ(&b
);
154 tun_inject(&p
->t
, &bb
);
157 a_warn("packet build failed");
161 kx_message(&p
->kx
, ch
& MSG_TYPEMASK
, &b
);
165 a_warn("bad packet from `%s': unknown packet type", p
->name
);
170 /* --- @p_txstart@ --- *
172 * Arguments: @peer *p@ = pointer to peer block
173 * @unsigned msg@ = message type code
175 * Returns: A pointer to a buffer to write to.
177 * Use: Starts sending to a peer. Only one send can happen at a
181 buf
*p_txstart(peer
*p
, unsigned msg
)
183 buf_init(&p
->b
, buf_o
, sizeof(buf_o
));
184 buf_putbyte(&p
->b
, msg
);
188 /* --- @p_txend@ --- *
190 * Arguments: @peer *p@ = pointer to peer block
194 * Use: Sends a packet to the peer.
197 void p_txend(peer
*p
)
200 a_warn("packet build failed");
203 IF_TRACING(T_PEER
, trace_block(T_PACKET
, "peer: sending packet",
204 BBASE(&p
->b
), BLEN(&p
->b
)); )
205 if (sendto(sock
.fd
, BBASE(&p
->b
), BLEN(&p
->b
),
206 0, &p
->peer
.sa
, p
->sasz
) < 0)
207 a_warn("packet send to `%s' failed: %s", p
->name
, strerror(errno
));
210 p
->st
.sz_out
+= BLEN(&p
->b
);
216 * Arguments: @peer *p@ = pointer to peer block
217 * @buf *b@ = buffer containing incoming packet
221 * Use: Handles a packet which needs to be sent to a peer.
224 void p_tun(peer
*p
, buf
*b
)
226 buf
*bb
= p_txstart(p
, MSG_PACKET
);
229 if (ksl_encrypt(&p
->ks
, MSG_PACKET
, b
, bb
))
231 if (BOK(bb
) && BLEN(bb
)) {
233 p
->st
.sz_ipout
+= BLEN(bb
);
238 /* --- @p_interval@ --- *
244 * Use: Called periodically to do tidying.
247 void p_interval(void)
252 reload
= km_interval();
253 for (p
= peers
; p
; p
= pp
) {
261 /* --- @p_stats@ --- *
263 * Arguments: @peer *p@ = pointer to a peer block
265 * Returns: A pointer to the peer's statistics.
268 stats
*p_stats(peer
*p
) { return (&p
->st
); }
270 /* --- @p_ifname@ --- *
272 * Arguments: @peer *p@ = pointer to a peer block
274 * Returns: A pointer to the peer's interface name.
277 const char *p_ifname(peer
*p
) { return (tun_ifname(&p
->t
)); }
279 /* --- @p_addr@ --- *
281 * Arguments: @peer *p@ = pointer to a peer block
283 * Returns: A pointer to the peer's address.
286 const addr
*p_addr(peer
*p
) { return (&p
->peer
); }
288 /* --- @p_init@ --- *
290 * Arguments: @struct in_addr addr@ = address to bind to
291 * @unsigned port@ = port number to listen to
295 * Use: Initializes the peer system; creates the socket.
298 void p_init(struct in_addr addr
, unsigned port
)
301 struct sockaddr_in sin
;
304 /* --- Note on socket buffer sizes --- *
306 * For some bizarre reason, Linux 2.2 (at least) doubles the socket buffer
307 * sizes I pass to @setsockopt@. I'm not putting special-case code here
308 * for Linux: BSD (at least TCPv2) does what I tell it rather than second-
312 if ((fd
= socket(PF_INET
, SOCK_DGRAM
, 0)) < 0)
313 die(EXIT_FAILURE
, "socket creation failed: %s", strerror(errno
));
315 sin
.sin_family
= AF_INET
;
317 sin
.sin_port
= htons(port
);
318 if (bind(fd
, (struct sockaddr
*)&sin
, sizeof(sin
)))
319 die(EXIT_FAILURE
, "bind failed: %s", strerror(errno
));
320 if (setsockopt(fd
, SOL_SOCKET
, SO_RCVBUF
, &len
, sizeof(len
)) ||
321 setsockopt(fd
, SOL_SOCKET
, SO_SNDBUF
, &len
, sizeof(len
))) {
322 die(EXIT_FAILURE
, "failed to set socket buffer sizes: %s",
325 fdflags(fd
, O_NONBLOCK
, O_NONBLOCK
, FD_CLOEXEC
, FD_CLOEXEC
);
326 sel_initfile(&sel
, &sock
, fd
, SEL_READ
, p_read
, 0);
328 T( trace(T_PEER
, "peer: created socket"); )
331 /* --- @p_port@ --- *
335 * Returns: Port number used for socket.
338 unsigned p_port(void)
341 size_t sz
= sizeof(addr
);
343 if (getsockname(sock
.fd
, &a
.sa
, &sz
))
344 die(EXIT_FAILURE
, "couldn't read port number: %s", strerror(errno
));
345 assert(a
.sa
.sa_family
== AF_INET
);
346 return (ntohs(a
.sin
.sin_port
));
349 /* --- @p_create@ --- *
351 * Arguments: @const char *name@ = name for this peer
352 * @struct sockaddr *sa@ = socket address of peer
353 * @size_t sz@ = size of socket address
355 * Returns: Pointer to the peer block, or null if it failed.
357 * Use: Creates a new named peer block. No peer is actually attached
361 peer
*p_create(const char *name
, struct sockaddr
*sa
, size_t sz
)
363 peer
*p
= CREATE(peer
);
364 T( trace(T_PEER
, "peer: creating new peer `%s'", name
); )
365 p
->name
= xstrdup(name
);
368 memcpy(&p
->peer
.sa
, sa
, sz
);
370 memset(&p
->st
, 0, sizeof(stats
));
371 p
->st
.t_start
= time(0);
372 if (kx_init(&p
->kx
, p
, &p
->ks
))
374 if (tun_create(&p
->t
, p
))
390 /* --- @p_name@ --- *
392 * Arguments: @peer *p@ = pointer to a peer block
394 * Returns: A pointer to the peer's name.
397 const char *p_name(peer
*p
) { return (p
->name
); }
399 /* --- @p_find@ --- *
401 * Arguments: @const char *name@ = name to look up
403 * Returns: Pointer to the peer block, or null if not found.
405 * Use: Finds a peer by name.
408 peer
*p_find(const char *name
)
411 for (p
= peers
; p
; p
= p
->next
) {
412 if (strcmp(name
, p
->name
) == 0)
418 /* --- @p_destroy@ --- *
420 * Arguments: @peer *p@ = pointer to a peer
424 * Use: Destroys a peer.
427 void p_destroy(peer
*p
)
429 T( trace(T_PEER
, "peer: destroying peer `%s'", p
->name
); )
435 p
->next
->prev
= p
->prev
;
437 p
->prev
->next
= p
->next
;
443 /* --- @p_first@, @p_next@ --- *
445 * Arguments: @peer *p@ = a peer block
447 * Returns: @peer_first@ returns the first peer in some ordering;
448 * @peer_next@ returns the peer following a given one in the
449 * same ordering. Null is returned for the end of the list.
452 peer
*p_first(void) { return (peers
); }
453 peer
*p_next(peer
*p
) { return (p
->next
); }
455 /*----- That's all, folks -------------------------------------------------*/