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
36ca987d46SWarner Losh #include <sys/param.h>
37ca987d46SWarner Losh #include <sys/socket.h>
38ca987d46SWarner Losh
39ca987d46SWarner Losh #include <string.h>
40ca987d46SWarner Losh
41ca987d46SWarner Losh #include <net/if.h>
42ca987d46SWarner Losh #include <netinet/in.h>
43ca987d46SWarner Losh #include <netinet/if_ether.h>
44ca987d46SWarner Losh #include <netinet/in_systm.h>
45ca987d46SWarner Losh
46ca987d46SWarner Losh #include <netinet/ip.h>
47ca987d46SWarner Losh #include <netinet/ip_var.h>
48ca987d46SWarner Losh #include <netinet/udp.h>
49ca987d46SWarner Losh #include <netinet/udp_var.h>
50ca987d46SWarner Losh
51ca987d46SWarner Losh #include "stand.h"
52ca987d46SWarner Losh #include "net.h"
53ca987d46SWarner Losh
54ca987d46SWarner Losh /*
55fae9c380SKyle Evans * Maximum wait time for sending and receiving before we give up and timeout.
56fae9c380SKyle Evans * If set to 0, operations will eventually timeout completely, but send/recv
57fae9c380SKyle Evans * timeouts must progress exponentially from MINTMO to MAXTMO before final
58fae9c380SKyle Evans * timeout is hit.
59fae9c380SKyle Evans */
60fae9c380SKyle Evans #ifndef MAXWAIT
61d5cee48fSRebecca Cran #define MAXWAIT 300 /* seconds */
62fae9c380SKyle Evans #endif
63fae9c380SKyle Evans
64fae9c380SKyle Evans #if MAXWAIT < 0
65fae9c380SKyle Evans #error MAXWAIT must not be a negative number
66fae9c380SKyle Evans #endif
67fae9c380SKyle Evans
68fae9c380SKyle Evans /*
69ca987d46SWarner Losh * Send a packet and wait for a reply, with exponential backoff.
70ca987d46SWarner Losh *
71ca987d46SWarner Losh * The send routine must return the actual number of bytes written,
72ca987d46SWarner Losh * or -1 on error.
73ca987d46SWarner Losh *
74ca987d46SWarner Losh * The receive routine can indicate success by returning the number of
75ca987d46SWarner Losh * bytes read; it can return 0 to indicate EOF; it can return -1 with a
76ca987d46SWarner Losh * non-zero errno to indicate failure; finally, it can return -1 with a
77ca987d46SWarner Losh * zero errno to indicate it isn't done yet.
78ca987d46SWarner Losh */
79ca987d46SWarner Losh ssize_t
sendrecv(struct iodesc * d,ssize_t (* sproc)(struct iodesc *,void *,size_t),void * sbuf,size_t ssize,ssize_t (* rproc)(struct iodesc *,void **,void **,time_t,void *),void ** pkt,void ** payload,void * recv_extra)80ca987d46SWarner Losh sendrecv(struct iodesc *d,
81ca987d46SWarner Losh ssize_t (*sproc)(struct iodesc *, void *, size_t),
82ca987d46SWarner Losh void *sbuf, size_t ssize,
83c5b86c3bSKyle Evans ssize_t (*rproc)(struct iodesc *, void **, void **, time_t, void *),
84c5b86c3bSKyle Evans void **pkt, void **payload, void *recv_extra)
85ca987d46SWarner Losh {
86ca987d46SWarner Losh ssize_t cc;
87ca987d46SWarner Losh time_t t, tmo, tlast;
8895c61459SKyle Evans time_t tref;
89ca987d46SWarner Losh long tleft;
90ca987d46SWarner Losh
91ca987d46SWarner Losh #ifdef NET_DEBUG
92ca987d46SWarner Losh if (debug)
93ca987d46SWarner Losh printf("sendrecv: called\n");
94ca987d46SWarner Losh #endif
95ca987d46SWarner Losh
96ca987d46SWarner Losh tmo = MINTMO;
97ca987d46SWarner Losh tlast = 0;
98ca987d46SWarner Losh tleft = 0;
99*c5f24f5eSEmmanuel Vadot tref = t = getsecs();
100ca987d46SWarner Losh for (;;) {
101*c5f24f5eSEmmanuel Vadot if (MAXWAIT > 0 && (t - tref) >= MAXWAIT) {
102ca987d46SWarner Losh errno = ETIMEDOUT;
103ca987d46SWarner Losh return -1;
104ca987d46SWarner Losh }
10595c61459SKyle Evans if (tleft <= 0) {
106ba37055cSKyle Evans if (tmo >= MAXTMO) {
107ba37055cSKyle Evans errno = ETIMEDOUT;
108ba37055cSKyle Evans return -1;
109ba37055cSKyle Evans }
110ca987d46SWarner Losh cc = (*sproc)(d, sbuf, ssize);
111ca987d46SWarner Losh if (cc != -1 && cc < ssize)
112ca987d46SWarner Losh panic("sendrecv: short write! (%zd < %zd)",
113ca987d46SWarner Losh cc, ssize);
114ca987d46SWarner Losh
115ca987d46SWarner Losh tleft = tmo;
116ca987d46SWarner Losh tmo += MINTMO;
117ca987d46SWarner Losh if (tmo > MAXTMO)
118ca987d46SWarner Losh tmo = MAXTMO;
119ca987d46SWarner Losh
120ca987d46SWarner Losh if (cc == -1) {
121ca987d46SWarner Losh /* Error on transmit; wait before retrying */
122ca987d46SWarner Losh while ((getsecs() - t) < tmo)
123ca987d46SWarner Losh ;
124ca987d46SWarner Losh tleft = 0;
125ca987d46SWarner Losh continue;
126ca987d46SWarner Losh }
127ca987d46SWarner Losh
128ca987d46SWarner Losh tlast = t;
129ca987d46SWarner Losh }
130ca987d46SWarner Losh
131ca987d46SWarner Losh /* Try to get a packet and process it. */
132c5b86c3bSKyle Evans cc = (*rproc)(d, pkt, payload, tleft, recv_extra);
133ca987d46SWarner Losh /* Return on data, EOF or real error. */
134502b7cf9SKyle Evans if (cc != -1 || (errno != 0 && errno != ETIMEDOUT))
135ca987d46SWarner Losh return (cc);
136ca987d46SWarner Losh
137ca987d46SWarner Losh /* Timed out or didn't get the packet we're waiting for */
138ca987d46SWarner Losh t = getsecs();
139ca987d46SWarner Losh tleft -= t - tlast;
140ca987d46SWarner Losh tlast = t;
141ca987d46SWarner Losh }
142ca987d46SWarner Losh }
143ca987d46SWarner Losh
144ca987d46SWarner Losh /*
145ca987d46SWarner Losh * Like inet_addr() in the C library, but we only accept base-10.
146ca987d46SWarner Losh * Return values are in network order.
147ca987d46SWarner Losh */
148ca987d46SWarner Losh n_long
inet_addr(char * cp)149ca987d46SWarner Losh inet_addr(char *cp)
150ca987d46SWarner Losh {
151ca987d46SWarner Losh u_long val;
152ca987d46SWarner Losh int n;
153ca987d46SWarner Losh char c;
154ca987d46SWarner Losh u_int parts[4];
155ca987d46SWarner Losh u_int *pp = parts;
156ca987d46SWarner Losh
157ca987d46SWarner Losh for (;;) {
158ca987d46SWarner Losh /*
159ca987d46SWarner Losh * Collect number up to ``.''.
160ca987d46SWarner Losh * Values are specified as for C:
161ca987d46SWarner Losh * 0x=hex, 0=octal, other=decimal.
162ca987d46SWarner Losh */
163ca987d46SWarner Losh val = 0;
164ca987d46SWarner Losh while ((c = *cp) != '\0') {
165ca987d46SWarner Losh if (c >= '0' && c <= '9') {
166ca987d46SWarner Losh val = (val * 10) + (c - '0');
167ca987d46SWarner Losh cp++;
168ca987d46SWarner Losh continue;
169ca987d46SWarner Losh }
170ca987d46SWarner Losh break;
171ca987d46SWarner Losh }
172ca987d46SWarner Losh if (*cp == '.') {
173ca987d46SWarner Losh /*
174ca987d46SWarner Losh * Internet format:
175ca987d46SWarner Losh * a.b.c.d
176ca987d46SWarner Losh * a.b.c (with c treated as 16-bits)
177ca987d46SWarner Losh * a.b (with b treated as 24 bits)
178ca987d46SWarner Losh */
179ca987d46SWarner Losh if (pp >= parts + 3 || val > 0xff)
180ca987d46SWarner Losh goto bad;
181ca987d46SWarner Losh *pp++ = val, cp++;
182ca987d46SWarner Losh } else
183ca987d46SWarner Losh break;
184ca987d46SWarner Losh }
185ca987d46SWarner Losh /*
186ca987d46SWarner Losh * Check for trailing characters.
187ca987d46SWarner Losh */
188ca987d46SWarner Losh if (*cp != '\0')
189ca987d46SWarner Losh goto bad;
190ca987d46SWarner Losh
191ca987d46SWarner Losh /*
192ca987d46SWarner Losh * Concoct the address according to
193ca987d46SWarner Losh * the number of parts specified.
194ca987d46SWarner Losh */
195ca987d46SWarner Losh n = pp - parts + 1;
196ca987d46SWarner Losh switch (n) {
197ca987d46SWarner Losh
198ca987d46SWarner Losh case 1: /* a -- 32 bits */
199ca987d46SWarner Losh break;
200ca987d46SWarner Losh
201ca987d46SWarner Losh case 2: /* a.b -- 8.24 bits */
202ca987d46SWarner Losh if (val > 0xffffff)
203ca987d46SWarner Losh goto bad;
204ca987d46SWarner Losh val |= parts[0] << 24;
205ca987d46SWarner Losh break;
206ca987d46SWarner Losh
207ca987d46SWarner Losh case 3: /* a.b.c -- 8.8.16 bits */
208ca987d46SWarner Losh if (val > 0xffff)
209ca987d46SWarner Losh goto bad;
210ca987d46SWarner Losh val |= (parts[0] << 24) | (parts[1] << 16);
211ca987d46SWarner Losh break;
212ca987d46SWarner Losh
213ca987d46SWarner Losh case 4: /* a.b.c.d -- 8.8.8.8 bits */
214ca987d46SWarner Losh if (val > 0xff)
215ca987d46SWarner Losh goto bad;
216ca987d46SWarner Losh val |= (parts[0] << 24) | (parts[1] << 16) | (parts[2] << 8);
217ca987d46SWarner Losh break;
218ca987d46SWarner Losh }
219ca987d46SWarner Losh
220ca987d46SWarner Losh return (htonl(val));
221ca987d46SWarner Losh bad:
222ca987d46SWarner Losh return (htonl(INADDR_NONE));
223ca987d46SWarner Losh }
224ca987d46SWarner Losh
225ca987d46SWarner Losh char *
inet_ntoa(struct in_addr ia)226ca987d46SWarner Losh inet_ntoa(struct in_addr ia)
227ca987d46SWarner Losh {
228ca987d46SWarner Losh return (intoa(ia.s_addr));
229ca987d46SWarner Losh }
230ca987d46SWarner Losh
231ca987d46SWarner Losh /* Similar to inet_ntoa() */
232ca987d46SWarner Losh char *
intoa(n_long addr)233ca987d46SWarner Losh intoa(n_long addr)
234ca987d46SWarner Losh {
235ca987d46SWarner Losh char *cp;
236ca987d46SWarner Losh u_int byte;
237ca987d46SWarner Losh int n;
238ca987d46SWarner Losh static char buf[17]; /* strlen(".255.255.255.255") + 1 */
239ca987d46SWarner Losh
240ca987d46SWarner Losh addr = ntohl(addr);
241ca987d46SWarner Losh cp = &buf[sizeof buf];
242ca987d46SWarner Losh *--cp = '\0';
243ca987d46SWarner Losh
244ca987d46SWarner Losh n = 4;
245ca987d46SWarner Losh do {
246ca987d46SWarner Losh byte = addr & 0xff;
247ca987d46SWarner Losh *--cp = byte % 10 + '0';
248ca987d46SWarner Losh byte /= 10;
249ca987d46SWarner Losh if (byte > 0) {
250ca987d46SWarner Losh *--cp = byte % 10 + '0';
251ca987d46SWarner Losh byte /= 10;
252ca987d46SWarner Losh if (byte > 0)
253ca987d46SWarner Losh *--cp = byte + '0';
254ca987d46SWarner Losh }
255ca987d46SWarner Losh *--cp = '.';
256ca987d46SWarner Losh addr >>= 8;
257ca987d46SWarner Losh } while (--n > 0);
258ca987d46SWarner Losh
259ca987d46SWarner Losh return (cp+1);
260ca987d46SWarner Losh }
261ca987d46SWarner Losh
262ca987d46SWarner Losh static char *
number(char * s,n_long * n)263eba1bc41SToomas Soome number(char *s, n_long *n)
264ca987d46SWarner Losh {
265ca987d46SWarner Losh for (*n = 0; isdigit(*s); s++)
266ca987d46SWarner Losh *n = (*n * 10) + *s - '0';
267ca987d46SWarner Losh return s;
268ca987d46SWarner Losh }
269ca987d46SWarner Losh
270ca987d46SWarner Losh n_long
ip_convertaddr(char * p)271ca987d46SWarner Losh ip_convertaddr(char *p)
272ca987d46SWarner Losh {
273ca987d46SWarner Losh #define IP_ANYADDR 0
274ca987d46SWarner Losh n_long addr = 0, n;
275ca987d46SWarner Losh
276eba1bc41SToomas Soome if (p == NULL || *p == '\0')
277ca987d46SWarner Losh return IP_ANYADDR;
278ca987d46SWarner Losh p = number(p, &n);
279ca987d46SWarner Losh addr |= (n << 24) & 0xff000000;
280ca987d46SWarner Losh if (*p == '\0' || *p++ != '.')
281ca987d46SWarner Losh return IP_ANYADDR;
282ca987d46SWarner Losh p = number(p, &n);
283ca987d46SWarner Losh addr |= (n << 16) & 0xff0000;
284ca987d46SWarner Losh if (*p == '\0' || *p++ != '.')
285ca987d46SWarner Losh return IP_ANYADDR;
286ca987d46SWarner Losh p = number(p, &n);
287ca987d46SWarner Losh addr |= (n << 8) & 0xff00;
288ca987d46SWarner Losh if (*p == '\0' || *p++ != '.')
289ca987d46SWarner Losh return IP_ANYADDR;
290ca987d46SWarner Losh p = number(p, &n);
291ca987d46SWarner Losh addr |= n & 0xff;
292ca987d46SWarner Losh if (*p != '\0')
293ca987d46SWarner Losh return IP_ANYADDR;
294ca987d46SWarner Losh
295ca987d46SWarner Losh return htonl(addr);
296ca987d46SWarner Losh }
297