2 * Copyright (c) 1982, 1986, 1988, 1990, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * @(#)udp_usrreq.c 8.4 (Berkeley) 1/21/94
34 * udp_usrreq.c,v 1.4 1994/10/02 17:48:45 phk Exp
38 * Changes and additions relating to SLiRP
39 * Copyright (c) 1995 Danny Gasparovski.
41 * Please read the file COPYRIGHT for the
42 * terms and conditions of the copyright.
48 struct udpstat udpstat;
53 * UDP protocol implementation.
54 * Per RFC 768, August, 1980.
59 int udpcksum = 0; /* XXX */
62 struct socket *udp_last_so = &udb;
67 udb.so_next = udb.so_prev = &udb;
69 /* m->m_data points at ip packet header
70 * m->m_len length ip packet
71 * ip->ip_len length data (IPDU)
75 register struct mbuf *m;
78 register struct ip *ip;
79 register struct udphdr *uh;
80 /* struct mbuf *opts = 0;*/
85 DEBUG_CALL("udp_input");
86 DEBUG_ARG("m = %lx", (long)m);
87 DEBUG_ARG("iphlen = %d", iphlen);
89 udpstat.udps_ipackets++;
92 * Strip IP options, if any; should skip this,
93 * make available to user, and use on returned packets,
94 * but we don't yet have a way to check the checksum
95 * with options still present.
97 if(iphlen > sizeof(struct ip)) {
98 ip_stripoptions(m, (struct mbuf *)0);
99 iphlen = sizeof(struct ip);
103 * Get IP and UDP header together in first mbuf.
105 ip = mtod(m, struct ip *);
106 uh = (struct udphdr *)((caddr_t)ip + iphlen);
109 * Make mbuf data length reflect UDP length.
110 * If not enough data to reflect UDP length, drop.
112 len = ntohs((u_int16_t)uh->uh_ulen);
114 if (ip->ip_len != len) {
115 if (len > ip->ip_len) {
116 udpstat.udps_badlen++;
119 m_adj(m, len - ip->ip_len);
124 * Save a copy of the IP header in case we want restore it
125 * for sending an ICMP error message in response.
128 save_ip.ip_len+= iphlen; /* tcp_input subtracts this */
131 * Checksum extended UDP header and data.
133 if (udpcksum && uh->uh_sum) {
134 ((struct ipovly *)ip)->ih_next = 0;
135 ((struct ipovly *)ip)->ih_prev = 0;
136 ((struct ipovly *)ip)->ih_x1 = 0;
137 ((struct ipovly *)ip)->ih_len = uh->uh_ulen;
138 /* keep uh_sum for ICMP reply
139 * uh->uh_sum = cksum(m, len + sizeof (struct ip));
142 if(cksum(m, len + sizeof(struct ip))) {
143 udpstat.udps_badsum++;
151 if (ntohs(uh->uh_dport) == BOOTP_SERVER) {
159 if (ntohs(uh->uh_dport) == TFTP_SERVER) {
165 * Locate pcb for datagram.
168 if (so->so_lport != uh->uh_sport ||
169 so->so_laddr.s_addr != ip->ip_src.s_addr) {
172 for (tmp = udb.so_next; tmp != &udb; tmp = tmp->so_next) {
173 if (tmp->so_lport == uh->uh_sport &&
174 tmp->so_laddr.s_addr == ip->ip_src.s_addr) {
175 tmp->so_faddr.s_addr = ip->ip_dst.s_addr;
176 tmp->so_fport = uh->uh_dport;
184 udpstat.udpps_pcbcachemiss++;
191 * If there's no socket for this packet,
194 if ((so = socreate()) == NULL) goto bad;
195 if(udp_attach(so) == -1) {
196 DEBUG_MISC((dfd," udp_attach errno = %d-%s\n",
197 errno,strerror(errno)));
205 /* udp_last_so = so; */
206 so->so_laddr = ip->ip_src;
207 so->so_lport = uh->uh_sport;
208 so->so_faddr = ip->ip_dst; /* XXX */
209 so->so_fport = uh->uh_dport; /* XXX */
211 if ((so->so_iptos = udp_tos(so)) == 0)
212 so->so_iptos = ip->ip_tos;
215 * XXXXX Here, check if it's in udpexec_list,
216 * and if it is, do the fork_exec() etc.
220 iphlen += sizeof(struct udphdr);
225 * Now we sendto() the packet.
230 if(sosendto(so,m) == -1) {
234 DEBUG_MISC((dfd,"udp tx errno = %d-%s\n",errno,strerror(errno)));
235 icmp_error(m, ICMP_UNREACH,ICMP_UNREACH_NET, 0,strerror(errno));
238 m_free(so->so_m); /* used for ICMP if error on sorecvfrom */
240 /* restore the orig mbuf packet */
244 so->so_m=m; /* ICMP backup */
249 /* if (opts) m_freem(opts); */
253 int udp_output2(struct socket *so, struct mbuf *m,
254 struct sockaddr_in *saddr, struct sockaddr_in *daddr,
257 register struct udpiphdr *ui;
260 DEBUG_CALL("udp_output");
261 DEBUG_ARG("so = %lx", (long)so);
262 DEBUG_ARG("m = %lx", (long)m);
263 DEBUG_ARG("saddr = %lx", (long)saddr->sin_addr.s_addr);
264 DEBUG_ARG("daddr = %lx", (long)daddr->sin_addr.s_addr);
269 m->m_data -= sizeof(struct udpiphdr);
270 m->m_len += sizeof(struct udpiphdr);
273 * Fill in mbuf with extended UDP header
274 * and addresses and length put into network format.
276 ui = mtod(m, struct udpiphdr *);
277 ui->ui_next = ui->ui_prev = 0;
279 ui->ui_pr = IPPROTO_UDP;
280 ui->ui_len = htons(m->m_len - sizeof(struct ip)); /* + sizeof (struct udphdr)); */
281 /* XXXXX Check for from-one-location sockets, or from-any-location sockets */
282 ui->ui_src = saddr->sin_addr;
283 ui->ui_dst = daddr->sin_addr;
284 ui->ui_sport = saddr->sin_port;
285 ui->ui_dport = daddr->sin_port;
286 ui->ui_ulen = ui->ui_len;
289 * Stuff checksum and output datagram.
293 if ((ui->ui_sum = cksum(m, /* sizeof (struct udpiphdr) + */ m->m_len)) == 0)
296 ((struct ip *)ui)->ip_len = m->m_len;
298 ((struct ip *)ui)->ip_ttl = ip_defttl;
299 ((struct ip *)ui)->ip_tos = iptos;
301 udpstat.udps_opackets++;
303 error = ip_output(so, m);
308 int udp_output(struct socket *so, struct mbuf *m,
309 struct sockaddr_in *addr)
312 struct sockaddr_in saddr, daddr;
315 if ((so->so_faddr.s_addr & htonl(0xffffff00)) == special_addr.s_addr)
316 saddr.sin_addr.s_addr = so->so_faddr.s_addr;
317 daddr.sin_addr = so->so_laddr;
318 daddr.sin_port = so->so_lport;
320 return udp_output2(so, m, &saddr, &daddr, so->so_iptos);
327 struct sockaddr_in addr;
329 if((so->s = socket(AF_INET,SOCK_DGRAM,0)) != -1) {
331 * Here, we bind() the socket. Although not really needed
332 * (sendto() on an unbound socket will bind it), it's done
333 * here so that emulation of ytalk etc. don't have to do it
335 addr.sin_family = AF_INET;
337 addr.sin_addr.s_addr = INADDR_ANY;
338 if(bind(so->s, (struct sockaddr *)&addr, sizeof(addr))<0) {
344 /* success, insert in queue */
345 so->so_expire = curtime + SO_EXPIRE;
357 /* if (so->so_m) m_free(so->so_m); done by sofree */
362 struct tos_t udptos[] = {
363 {0, 53, IPTOS_LOWDELAY, 0}, /* DNS */
364 {517, 517, IPTOS_LOWDELAY, EMU_TALK}, /* talk */
365 {518, 518, IPTOS_LOWDELAY, EMU_NTALK}, /* ntalk */
366 {0, 7648, IPTOS_LOWDELAY, EMU_CUSEEME}, /* Cu-Seeme */
376 while(udptos[i].tos) {
377 if ((udptos[i].fport && ntohs(so->so_fport) == udptos[i].fport) ||
378 (udptos[i].lport && ntohs(so->so_lport) == udptos[i].lport)) {
379 so->so_emu = udptos[i].emu;
380 return udptos[i].tos;
393 * Here, talk/ytalk/ntalk requests must be emulated
400 struct sockaddr_in addr;
401 int addrlen = sizeof(addr);
405 char buff[sizeof(CTL_MSG)];
408 struct talk_request {
409 struct talk_request *next;
410 struct socket *udp_so;
411 struct socket *tcp_so;
414 static struct talk_request *req_tbl = 0;
431 * Talk emulation. We always change the ctl_addr to get
432 * some answers from the daemon. When an ANNOUNCE comes,
433 * we send LEAVE_INVITE to the local daemons. Also when a
434 * DELETE comes, we send copies to the local daemons.
436 if (getsockname(so->s, (struct sockaddr *)&addr, &addrlen) < 0)
439 #define IS_OLD (so->so_emu == EMU_TALK)
441 #define COPY_MSG(dest, src) { dest->type = src->type; \
442 dest->id_num = src->id_num; \
443 dest->pid = src->pid; \
444 dest->addr = src->addr; \
445 dest->ctl_addr = src->ctl_addr; \
446 memcpy(&dest->l_name, &src->l_name, NAME_SIZE_OLD); \
447 memcpy(&dest->r_name, &src->r_name, NAME_SIZE_OLD); \
448 memcpy(&dest->r_tty, &src->r_tty, TTY_SIZE); }
450 #define OTOSIN(ptr, field) ((struct sockaddr_in *)&ptr->field)
451 /* old_sockaddr to sockaddr_in */
454 if (IS_OLD) { /* old talk */
455 omsg = mtod(m, CTL_MSG_OLD*);
456 nmsg = (CTL_MSG *) buff;
458 OTOSIN(omsg, ctl_addr)->sin_port = addr.sin_port;
459 OTOSIN(omsg, ctl_addr)->sin_addr = our_addr;
460 strncpy(omsg->l_name, getlogin(), NAME_SIZE_OLD);
461 } else { /* new talk */
462 omsg = (CTL_MSG_OLD *) buff;
463 nmsg = mtod(m, CTL_MSG *);
465 OTOSIN(nmsg, ctl_addr)->sin_port = addr.sin_port;
466 OTOSIN(nmsg, ctl_addr)->sin_addr = our_addr;
467 strncpy(nmsg->l_name, getlogin(), NAME_SIZE_OLD);
471 return; /* for LOOK_UP this is enough */
473 if (IS_OLD) { /* make a copy of the message */
474 COPY_MSG(nmsg, omsg);
478 COPY_MSG(omsg, nmsg);
481 * If if is an ANNOUNCE message, we go through the
482 * request table to see if a tcp port has already
483 * been redirected for this socket. If not, we solisten()
484 * a new socket and add this entry to the table.
485 * The port number of the tcp socket and our IP
486 * are put to the addr field of the message structures.
487 * Then a LEAVE_INVITE is sent to both local daemon
488 * ports, 517 and 518. This is why we have two copies
489 * of the message, one in old talk and one in new talk
493 if (type == ANNOUNCE) {
497 for(req = req_tbl; req; req = req->next)
498 if (so == req->udp_so)
499 break; /* found it */
501 if (!req) { /* no entry for so, create new */
502 req = (struct talk_request *)
503 malloc(sizeof(struct talk_request));
505 req->tcp_so = solisten(0,
506 OTOSIN(omsg, addr)->sin_addr.s_addr,
507 OTOSIN(omsg, addr)->sin_port,
513 /* replace port number in addr field */
514 addrlen = sizeof(addr);
515 getsockname(req->tcp_so->s,
516 (struct sockaddr *) &addr,
518 OTOSIN(omsg, addr)->sin_port = addr.sin_port;
519 OTOSIN(omsg, addr)->sin_addr = our_addr;
520 OTOSIN(nmsg, addr)->sin_port = addr.sin_port;
521 OTOSIN(nmsg, addr)->sin_addr = our_addr;
523 /* send LEAVE_INVITEs */
524 temp_port = OTOSIN(omsg, ctl_addr)->sin_port;
525 OTOSIN(omsg, ctl_addr)->sin_port = 0;
526 OTOSIN(nmsg, ctl_addr)->sin_port = 0;
527 omsg->type = nmsg->type = LEAVE_INVITE;
529 s = socket(AF_INET, SOCK_DGRAM, IPPROTO_IP);
530 addr.sin_addr = our_addr;
531 addr.sin_family = AF_INET;
532 addr.sin_port = htons(517);
533 sendto(s, (char *)omsg, sizeof(*omsg), 0,
534 (struct sockaddr *)&addr, sizeof(addr));
535 addr.sin_port = htons(518);
536 sendto(s, (char *)nmsg, sizeof(*nmsg), 0,
537 (struct sockaddr *) &addr, sizeof(addr));
540 omsg->type = nmsg->type = ANNOUNCE;
541 OTOSIN(omsg, ctl_addr)->sin_port = temp_port;
542 OTOSIN(nmsg, ctl_addr)->sin_port = temp_port;
546 * If it is a DELETE message, we send a copy to the
547 * local daemons. Then we delete the entry corresponding
548 * to our socket from the request table.
551 if (type == DELETE) {
552 struct talk_request *temp_req, *req_next;
556 temp_port = OTOSIN(omsg, ctl_addr)->sin_port;
557 OTOSIN(omsg, ctl_addr)->sin_port = 0;
558 OTOSIN(nmsg, ctl_addr)->sin_port = 0;
560 s = socket(AF_INET, SOCK_DGRAM, IPPROTO_IP);
561 addr.sin_addr = our_addr;
562 addr.sin_family = AF_INET;
563 addr.sin_port = htons(517);
564 sendto(s, (char *)omsg, sizeof(*omsg), 0,
565 (struct sockaddr *)&addr, sizeof(addr));
566 addr.sin_port = htons(518);
567 sendto(s, (char *)nmsg, sizeof(*nmsg), 0,
568 (struct sockaddr *)&addr, sizeof(addr));
571 OTOSIN(omsg, ctl_addr)->sin_port = temp_port;
572 OTOSIN(nmsg, ctl_addr)->sin_port = temp_port;
574 /* delete table entry */
575 if (so == req_tbl->udp_so) {
577 req_tbl = req_tbl->next;
581 for(req = req_tbl->next; req; req = req_next) {
582 req_next = req->next;
583 if (so == req->udp_so) {
584 temp_req->next = req_next;
600 * Cu-SeeMe emulation.
601 * Hopefully the packet is more that 16 bytes long. We don't
602 * do any other tests, just replace the address and port
605 if (m->m_len >= sizeof (*cu_head)) {
606 if (getsockname(so->s, (struct sockaddr *)&addr, &addrlen) < 0)
608 cu_head = mtod(m, struct cu_header *);
609 cu_head->port = addr.sin_port;
610 cu_head->addr = (u_long) our_addr.s_addr;
618 udp_listen(port, laddr, lport, flags)
624 struct sockaddr_in addr;
626 int addrlen = sizeof(struct sockaddr_in), opt = 1;
628 if ((so = socreate()) == NULL) {
632 so->s = socket(AF_INET,SOCK_DGRAM,0);
633 so->so_expire = curtime + SO_EXPIRE;
636 addr.sin_family = AF_INET;
637 addr.sin_addr.s_addr = INADDR_ANY;
638 addr.sin_port = port;
640 if (bind(so->s,(struct sockaddr *)&addr, addrlen) < 0) {
644 setsockopt(so->s,SOL_SOCKET,SO_REUSEADDR,(char *)&opt,sizeof(int));
645 /* setsockopt(so->s,SOL_SOCKET,SO_OOBINLINE,(char *)&opt,sizeof(int)); */
647 getsockname(so->s,(struct sockaddr *)&addr,&addrlen);
648 so->so_fport = addr.sin_port;
649 if (addr.sin_addr.s_addr == 0 || addr.sin_addr.s_addr == loopback_addr.s_addr)
650 so->so_faddr = our_addr;
652 so->so_faddr = addr.sin_addr;
654 so->so_lport = lport;
655 so->so_laddr.s_addr = laddr;
656 if (flags != SS_FACCEPTONCE)
659 so->so_state = SS_ISFCONNECTED;