1 /* Taken from $NetBSD: net.c,v 1.20 1997/12/26 22:41:30 scottr Exp $ */
4 * Copyright (c) 1992 Regents of the University of California.
7 * This software was developed by the Computer Systems Engineering group
8 * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
9 * contributed to Berkeley.
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 3. All advertising materials mentioning features or use of this software
20 * must display the following acknowledgement:
21 * This product includes software developed by the University of
22 * California, Lawrence Berkeley Laboratory and its contributors.
23 * 4. Neither the name of the University nor the names of its contributors
24 * may be used to endorse or promote products derived from this software
25 * without specific prior written permission.
27 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
28 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
31 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 * @(#) Header: net.c,v 1.9 93/08/06 19:32:15 leres Exp (LBL)
40 * $FreeBSD: src/lib/libstand/udp.c,v 1.1.2.1 2000/04/15 03:09:29 ps Exp $
41 * $DragonFly: src/lib/libstand/udp.c,v 1.4 2005/12/11 02:27:26 swildner Exp $
44 #include <sys/param.h>
45 #include <sys/socket.h>
50 #include <netinet/in.h>
51 #include <netinet/if_ether.h>
52 #include <netinet/in_systm.h>
54 #include <netinet/ip.h>
55 #include <netinet/ip_var.h>
56 #include <netinet/udp.h>
57 #include <netinet/udp_var.h>
62 /* Caller must leave room for ethernet, ip and udp headers in front!! */
64 sendudp(struct iodesc *d, void *pkt, size_t len)
73 printf("sendudp: d=%lx called.\n", (long)d);
75 printf("saddr: %s:%d",
76 inet_ntoa(d->myip), ntohs(d->myport));
77 printf(" daddr: %s:%d\n",
78 inet_ntoa(d->destip), ntohs(d->destport));
83 uh = (struct udphdr *)pkt - 1;
84 ip = (struct ip *)uh - 1;
85 len += sizeof(*ip) + sizeof(*uh);
87 bzero(ip, sizeof(*ip) + sizeof(*uh));
89 ip->ip_v = IPVERSION; /* half-char */
90 ip->ip_hl = sizeof(*ip) >> 2; /* half-char */
91 ip->ip_len = htons(len);
92 ip->ip_p = IPPROTO_UDP; /* char */
93 ip->ip_ttl = IP_TTL; /* char */
95 ip->ip_dst = d->destip;
96 ip->ip_sum = in_cksum(ip, sizeof(*ip)); /* short, but special */
98 uh->uh_sport = d->myport;
99 uh->uh_dport = d->destport;
100 uh->uh_ulen = htons(len - sizeof(*ip));
107 /* Calculate checksum (must save and restore ip header) */
109 ui = (struct udpiphdr *)ip;
110 bzero(&ui->ui_x1, sizeof(ui->ui_x1));
111 ui->ui_len = uh->uh_ulen;
112 uh->uh_sum = in_cksum(ui, len);
117 if (ip->ip_dst.s_addr == INADDR_BROADCAST || ip->ip_src.s_addr == 0 ||
118 netmask == 0 || SAMENET(ip->ip_src, ip->ip_dst, netmask))
119 ea = arpwhohas(d, ip->ip_dst);
121 ea = arpwhohas(d, gateip);
123 cc = sendether(d, ip, len, ea, ETHERTYPE_IP);
127 panic("sendudp: bad write (%d != %d)", cc, len);
128 return (cc - (sizeof(*ip) + sizeof(*uh)));
132 * Receive a UDP packet and validate it is for us.
133 * Caller leaves room for the headers (Ether, IP, UDP)
136 readudp(struct iodesc *d, void *pkt, size_t len, time_t tleft)
142 u_int16_t etype; /* host order */
146 printf("readudp: called\n");
149 uh = (struct udphdr *)pkt - 1;
150 ip = (struct ip *)uh - 1;
152 n = readether(d, ip, len + sizeof(*ip) + sizeof(*uh), tleft, &etype);
153 if (n == -1 || n < sizeof(*ip) + sizeof(*uh))
156 /* Ethernet address checks now in readether() */
158 /* Need to respond to ARP requests. */
159 if (etype == ETHERTYPE_ARP) {
160 struct arphdr *ah = (void *)ip;
161 if (ah->ar_op == htons(ARPOP_REQUEST)) {
168 if (etype != ETHERTYPE_IP) {
171 printf("readudp: not IP. ether_type=%x\n", etype);
176 /* Check ip header */
177 if (ip->ip_v != IPVERSION ||
178 ip->ip_p != IPPROTO_UDP) { /* half char */
181 printf("readudp: IP version or not UDP. ip_v=%d ip_p=%d\n", ip->ip_v, ip->ip_p);
186 hlen = ip->ip_hl << 2;
187 if (hlen < sizeof(*ip) ||
188 in_cksum(ip, hlen) != 0) {
191 printf("readudp: short hdr or bad cksum.\n");
195 if (n < ntohs(ip->ip_len)) {
198 printf("readudp: bad length %d < %d.\n",
199 (int)n, ntohs(ip->ip_len));
203 if (d->myip.s_addr && ip->ip_dst.s_addr != d->myip.s_addr) {
206 printf("readudp: bad saddr %s != ", inet_ntoa(d->myip));
207 printf("%s\n", inet_ntoa(ip->ip_dst));
213 /* If there were ip options, make them go away */
214 if (hlen != sizeof(*ip)) {
215 bcopy(((u_char *)ip) + hlen, uh, len - hlen);
216 ip->ip_len = htons(sizeof(*ip));
217 n -= hlen - sizeof(*ip);
219 if (uh->uh_dport != d->myport) {
222 printf("readudp: bad dport %d != %d\n",
223 d->myport, ntohs(uh->uh_dport));
233 n = ntohs(uh->uh_ulen) + sizeof(*ip);
234 if (n > RECV_SIZE - ETHER_SIZE) {
235 printf("readudp: huge packet, udp len %d\n", (int)n);
239 /* Check checksum (must save and restore ip header) */
241 ui = (struct udpiphdr *)ip;
242 bzero(&ui->ui_x1, sizeof(ui->ui_x1));
243 ui->ui_len = uh->uh_ulen;
244 if (in_cksum(ui, n) != 0) {
247 printf("readudp: bad cksum\n");
255 if (ntohs(uh->uh_ulen) < sizeof(*uh)) {
258 printf("readudp: bad udp len %d < %d\n",
259 ntohs(uh->uh_ulen), (int)sizeof(*uh));
264 n -= sizeof(*ip) + sizeof(*uh);