xref: /freebsd/stand/libsa/net.c (revision 502b7cf99bea531fa3cf59d72cf89fcbb9311b8c)
1ca987d46SWarner Losh /*	$NetBSD: net.c,v 1.20 1997/12/26 22:41:30 scottr Exp $	*/
2ca987d46SWarner Losh 
3ca987d46SWarner Losh /*
4ca987d46SWarner Losh  * Copyright (c) 1992 Regents of the University of California.
5ca987d46SWarner Losh  * All rights reserved.
6ca987d46SWarner Losh  *
7ca987d46SWarner Losh  * This software was developed by the Computer Systems Engineering group
8ca987d46SWarner Losh  * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
9ca987d46SWarner Losh  * contributed to Berkeley.
10ca987d46SWarner Losh  *
11ca987d46SWarner Losh  * Redistribution and use in source and binary forms, with or without
12ca987d46SWarner Losh  * modification, are permitted provided that the following conditions
13ca987d46SWarner Losh  * are met:
14ca987d46SWarner Losh  * 1. Redistributions of source code must retain the above copyright
15ca987d46SWarner Losh  *    notice, this list of conditions and the following disclaimer.
16ca987d46SWarner Losh  * 2. Redistributions in binary form must reproduce the above copyright
17ca987d46SWarner Losh  *    notice, this list of conditions and the following disclaimer in the
18ca987d46SWarner Losh  *    documentation and/or other materials provided with the distribution.
19ca987d46SWarner Losh  * 3. Neither the name of the University nor the names of its contributors
20ca987d46SWarner Losh  *    may be used to endorse or promote products derived from this software
21ca987d46SWarner Losh  *    without specific prior written permission.
22ca987d46SWarner Losh  *
23ca987d46SWarner Losh  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24ca987d46SWarner Losh  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25ca987d46SWarner Losh  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26ca987d46SWarner Losh  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27ca987d46SWarner Losh  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28ca987d46SWarner Losh  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29ca987d46SWarner Losh  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30ca987d46SWarner Losh  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31ca987d46SWarner Losh  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32ca987d46SWarner Losh  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33ca987d46SWarner Losh  * SUCH DAMAGE.
34ca987d46SWarner Losh  *
35ca987d46SWarner Losh  * @(#) Header: net.c,v 1.9 93/08/06 19:32:15 leres Exp  (LBL)
36ca987d46SWarner Losh  */
37ca987d46SWarner Losh 
38ca987d46SWarner Losh #include <sys/cdefs.h>
39ca987d46SWarner Losh __FBSDID("$FreeBSD$");
40ca987d46SWarner Losh 
41ca987d46SWarner Losh #include <sys/param.h>
42ca987d46SWarner Losh #include <sys/socket.h>
43ca987d46SWarner Losh 
44ca987d46SWarner Losh #include <string.h>
45ca987d46SWarner Losh 
46ca987d46SWarner Losh #include <net/if.h>
47ca987d46SWarner Losh #include <netinet/in.h>
48ca987d46SWarner Losh #include <netinet/if_ether.h>
49ca987d46SWarner Losh #include <netinet/in_systm.h>
50ca987d46SWarner Losh 
51ca987d46SWarner Losh #include <netinet/in_pcb.h>
52ca987d46SWarner Losh #include <netinet/ip.h>
53ca987d46SWarner Losh #include <netinet/ip_var.h>
54ca987d46SWarner Losh #include <netinet/udp.h>
55ca987d46SWarner Losh #include <netinet/udp_var.h>
56ca987d46SWarner Losh 
57ca987d46SWarner Losh #include "stand.h"
58ca987d46SWarner Losh #include "net.h"
59ca987d46SWarner Losh 
60ca987d46SWarner Losh /*
61ca987d46SWarner Losh  * Send a packet and wait for a reply, with exponential backoff.
62ca987d46SWarner Losh  *
63ca987d46SWarner Losh  * The send routine must return the actual number of bytes written,
64ca987d46SWarner Losh  * or -1 on error.
65ca987d46SWarner Losh  *
66ca987d46SWarner Losh  * The receive routine can indicate success by returning the number of
67ca987d46SWarner Losh  * bytes read; it can return 0 to indicate EOF; it can return -1 with a
68ca987d46SWarner Losh  * non-zero errno to indicate failure; finally, it can return -1 with a
69ca987d46SWarner Losh  * zero errno to indicate it isn't done yet.
70ca987d46SWarner Losh  */
71ca987d46SWarner Losh ssize_t
72ca987d46SWarner Losh sendrecv(struct iodesc *d,
73ca987d46SWarner Losh     ssize_t (*sproc)(struct iodesc *, void *, size_t),
74ca987d46SWarner Losh     void *sbuf, size_t ssize,
75ca987d46SWarner Losh     ssize_t (*rproc)(struct iodesc *, void **, void **, time_t),
76ca987d46SWarner Losh     void **pkt, void **payload)
77ca987d46SWarner Losh {
78ca987d46SWarner Losh 	ssize_t cc;
79ca987d46SWarner Losh 	time_t t, tmo, tlast;
80ca987d46SWarner Losh 	long tleft;
81ca987d46SWarner Losh 
82ca987d46SWarner Losh #ifdef NET_DEBUG
83ca987d46SWarner Losh 	if (debug)
84ca987d46SWarner Losh 		printf("sendrecv: called\n");
85ca987d46SWarner Losh #endif
86ca987d46SWarner Losh 
87ca987d46SWarner Losh 	tmo = MINTMO;
88ca987d46SWarner Losh 	tlast = 0;
89ca987d46SWarner Losh 	tleft = 0;
90ca987d46SWarner Losh 	t = getsecs();
91ca987d46SWarner Losh 	for (;;) {
92ca987d46SWarner Losh 		if (tleft <= 0) {
93ca987d46SWarner Losh 			if (tmo >= MAXTMO) {
94ca987d46SWarner Losh 				errno = ETIMEDOUT;
95ca987d46SWarner Losh 				return -1;
96ca987d46SWarner Losh 			}
97ca987d46SWarner Losh 			cc = (*sproc)(d, sbuf, ssize);
98ca987d46SWarner Losh 			if (cc != -1 && cc < ssize)
99ca987d46SWarner Losh 				panic("sendrecv: short write! (%zd < %zd)",
100ca987d46SWarner Losh 				    cc, ssize);
101ca987d46SWarner Losh 
102ca987d46SWarner Losh 			tleft = tmo;
103ca987d46SWarner Losh 			tmo += MINTMO;
104ca987d46SWarner Losh 			if (tmo > MAXTMO)
105ca987d46SWarner Losh 				tmo = MAXTMO;
106ca987d46SWarner Losh 
107ca987d46SWarner Losh 			if (cc == -1) {
108ca987d46SWarner Losh 				/* Error on transmit; wait before retrying */
109ca987d46SWarner Losh 				while ((getsecs() - t) < tmo)
110ca987d46SWarner Losh 					;
111ca987d46SWarner Losh 				tleft = 0;
112ca987d46SWarner Losh 				continue;
113ca987d46SWarner Losh 			}
114ca987d46SWarner Losh 
115ca987d46SWarner Losh 			tlast = t;
116ca987d46SWarner Losh 		}
117ca987d46SWarner Losh 
118ca987d46SWarner Losh 		/* Try to get a packet and process it. */
119ca987d46SWarner Losh 		cc = (*rproc)(d, pkt, payload, tleft);
120ca987d46SWarner Losh 		/* Return on data, EOF or real error. */
121*502b7cf9SKyle Evans 		if (cc != -1 || (errno != 0 && errno != ETIMEDOUT))
122ca987d46SWarner Losh 			return (cc);
123ca987d46SWarner Losh 
124ca987d46SWarner Losh 		/* Timed out or didn't get the packet we're waiting for */
125ca987d46SWarner Losh 		t = getsecs();
126ca987d46SWarner Losh 		tleft -= t - tlast;
127ca987d46SWarner Losh 		tlast = t;
128ca987d46SWarner Losh 	}
129ca987d46SWarner Losh }
130ca987d46SWarner Losh 
131ca987d46SWarner Losh /*
132ca987d46SWarner Losh  * Like inet_addr() in the C library, but we only accept base-10.
133ca987d46SWarner Losh  * Return values are in network order.
134ca987d46SWarner Losh  */
135ca987d46SWarner Losh n_long
136ca987d46SWarner Losh inet_addr(char *cp)
137ca987d46SWarner Losh {
138ca987d46SWarner Losh 	u_long val;
139ca987d46SWarner Losh 	int n;
140ca987d46SWarner Losh 	char c;
141ca987d46SWarner Losh 	u_int parts[4];
142ca987d46SWarner Losh 	u_int *pp = parts;
143ca987d46SWarner Losh 
144ca987d46SWarner Losh 	for (;;) {
145ca987d46SWarner Losh 		/*
146ca987d46SWarner Losh 		 * Collect number up to ``.''.
147ca987d46SWarner Losh 		 * Values are specified as for C:
148ca987d46SWarner Losh 		 * 0x=hex, 0=octal, other=decimal.
149ca987d46SWarner Losh 		 */
150ca987d46SWarner Losh 		val = 0;
151ca987d46SWarner Losh 		while ((c = *cp) != '\0') {
152ca987d46SWarner Losh 			if (c >= '0' && c <= '9') {
153ca987d46SWarner Losh 				val = (val * 10) + (c - '0');
154ca987d46SWarner Losh 				cp++;
155ca987d46SWarner Losh 				continue;
156ca987d46SWarner Losh 			}
157ca987d46SWarner Losh 			break;
158ca987d46SWarner Losh 		}
159ca987d46SWarner Losh 		if (*cp == '.') {
160ca987d46SWarner Losh 			/*
161ca987d46SWarner Losh 			 * Internet format:
162ca987d46SWarner Losh 			 *	a.b.c.d
163ca987d46SWarner Losh 			 *	a.b.c	(with c treated as 16-bits)
164ca987d46SWarner Losh 			 *	a.b	(with b treated as 24 bits)
165ca987d46SWarner Losh 			 */
166ca987d46SWarner Losh 			if (pp >= parts + 3 || val > 0xff)
167ca987d46SWarner Losh 				goto bad;
168ca987d46SWarner Losh 			*pp++ = val, cp++;
169ca987d46SWarner Losh 		} else
170ca987d46SWarner Losh 			break;
171ca987d46SWarner Losh 	}
172ca987d46SWarner Losh 	/*
173ca987d46SWarner Losh 	 * Check for trailing characters.
174ca987d46SWarner Losh 	 */
175ca987d46SWarner Losh 	if (*cp != '\0')
176ca987d46SWarner Losh 		goto bad;
177ca987d46SWarner Losh 
178ca987d46SWarner Losh 	/*
179ca987d46SWarner Losh 	 * Concoct the address according to
180ca987d46SWarner Losh 	 * the number of parts specified.
181ca987d46SWarner Losh 	 */
182ca987d46SWarner Losh 	n = pp - parts + 1;
183ca987d46SWarner Losh 	switch (n) {
184ca987d46SWarner Losh 
185ca987d46SWarner Losh 	case 1:				/* a -- 32 bits */
186ca987d46SWarner Losh 		break;
187ca987d46SWarner Losh 
188ca987d46SWarner Losh 	case 2:				/* a.b -- 8.24 bits */
189ca987d46SWarner Losh 		if (val > 0xffffff)
190ca987d46SWarner Losh 			goto bad;
191ca987d46SWarner Losh 		val |= parts[0] << 24;
192ca987d46SWarner Losh 		break;
193ca987d46SWarner Losh 
194ca987d46SWarner Losh 	case 3:				/* a.b.c -- 8.8.16 bits */
195ca987d46SWarner Losh 		if (val > 0xffff)
196ca987d46SWarner Losh 			goto bad;
197ca987d46SWarner Losh 		val |= (parts[0] << 24) | (parts[1] << 16);
198ca987d46SWarner Losh 		break;
199ca987d46SWarner Losh 
200ca987d46SWarner Losh 	case 4:				/* a.b.c.d -- 8.8.8.8 bits */
201ca987d46SWarner Losh 		if (val > 0xff)
202ca987d46SWarner Losh 			goto bad;
203ca987d46SWarner Losh 		val |= (parts[0] << 24) | (parts[1] << 16) | (parts[2] << 8);
204ca987d46SWarner Losh 		break;
205ca987d46SWarner Losh 	}
206ca987d46SWarner Losh 
207ca987d46SWarner Losh 	return (htonl(val));
208ca987d46SWarner Losh  bad:
209ca987d46SWarner Losh 	return (htonl(INADDR_NONE));
210ca987d46SWarner Losh }
211ca987d46SWarner Losh 
212ca987d46SWarner Losh char *
213ca987d46SWarner Losh inet_ntoa(struct in_addr ia)
214ca987d46SWarner Losh {
215ca987d46SWarner Losh 	return (intoa(ia.s_addr));
216ca987d46SWarner Losh }
217ca987d46SWarner Losh 
218ca987d46SWarner Losh /* Similar to inet_ntoa() */
219ca987d46SWarner Losh char *
220ca987d46SWarner Losh intoa(n_long addr)
221ca987d46SWarner Losh {
222ca987d46SWarner Losh 	char *cp;
223ca987d46SWarner Losh 	u_int byte;
224ca987d46SWarner Losh 	int n;
225ca987d46SWarner Losh 	static char buf[17];	/* strlen(".255.255.255.255") + 1 */
226ca987d46SWarner Losh 
227ca987d46SWarner Losh 	addr = ntohl(addr);
228ca987d46SWarner Losh 	cp = &buf[sizeof buf];
229ca987d46SWarner Losh 	*--cp = '\0';
230ca987d46SWarner Losh 
231ca987d46SWarner Losh 	n = 4;
232ca987d46SWarner Losh 	do {
233ca987d46SWarner Losh 		byte = addr & 0xff;
234ca987d46SWarner Losh 		*--cp = byte % 10 + '0';
235ca987d46SWarner Losh 		byte /= 10;
236ca987d46SWarner Losh 		if (byte > 0) {
237ca987d46SWarner Losh 			*--cp = byte % 10 + '0';
238ca987d46SWarner Losh 			byte /= 10;
239ca987d46SWarner Losh 			if (byte > 0)
240ca987d46SWarner Losh 				*--cp = byte + '0';
241ca987d46SWarner Losh 		}
242ca987d46SWarner Losh 		*--cp = '.';
243ca987d46SWarner Losh 		addr >>= 8;
244ca987d46SWarner Losh 	} while (--n > 0);
245ca987d46SWarner Losh 
246ca987d46SWarner Losh 	return (cp+1);
247ca987d46SWarner Losh }
248ca987d46SWarner Losh 
249ca987d46SWarner Losh static char *
250ca987d46SWarner Losh number(char *s, int *n)
251ca987d46SWarner Losh {
252ca987d46SWarner Losh 	for (*n = 0; isdigit(*s); s++)
253ca987d46SWarner Losh 		*n = (*n * 10) + *s - '0';
254ca987d46SWarner Losh 	return s;
255ca987d46SWarner Losh }
256ca987d46SWarner Losh 
257ca987d46SWarner Losh n_long
258ca987d46SWarner Losh ip_convertaddr(char *p)
259ca987d46SWarner Losh {
260ca987d46SWarner Losh #define IP_ANYADDR	0
261ca987d46SWarner Losh 	n_long addr = 0, n;
262ca987d46SWarner Losh 
263ca987d46SWarner Losh 	if (p == (char *)0 || *p == '\0')
264ca987d46SWarner Losh 		return IP_ANYADDR;
265ca987d46SWarner Losh 	p = number(p, &n);
266ca987d46SWarner Losh 	addr |= (n << 24) & 0xff000000;
267ca987d46SWarner Losh 	if (*p == '\0' || *p++ != '.')
268ca987d46SWarner Losh 		return IP_ANYADDR;
269ca987d46SWarner Losh 	p = number(p, &n);
270ca987d46SWarner Losh 	addr |= (n << 16) & 0xff0000;
271ca987d46SWarner Losh 	if (*p == '\0' || *p++ != '.')
272ca987d46SWarner Losh 		return IP_ANYADDR;
273ca987d46SWarner Losh 	p = number(p, &n);
274ca987d46SWarner Losh 	addr |= (n << 8) & 0xff00;
275ca987d46SWarner Losh 	if (*p == '\0' || *p++ != '.')
276ca987d46SWarner Losh 		return IP_ANYADDR;
277ca987d46SWarner Losh 	p = number(p, &n);
278ca987d46SWarner Losh 	addr |= n & 0xff;
279ca987d46SWarner Losh 	if (*p != '\0')
280ca987d46SWarner Losh 		return IP_ANYADDR;
281ca987d46SWarner Losh 
282ca987d46SWarner Losh 	return htonl(addr);
283ca987d46SWarner Losh }
284