2 * Copyright (c) 1985, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Copyright (c) 1995 John Hay. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by the University of
18 * California, Berkeley and its contributors.
19 * 4. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * $FreeBSD: src/usr.sbin/IPXrouted/tables.c,v 1.7 1999/08/28 01:15:05 peter Exp $
36 * $DragonFly: src/usr.sbin/IPXrouted/tables.c,v 1.2 2003/06/17 04:29:52 dillon Exp $
38 * @(#)tables.c 8.1 (Berkeley) 6/5/93
42 * Routing Table Management Daemon
45 #include <sys/ioctl.h>
54 #define FIXLEN(s) { if ((s)->sa_len == 0) (s)->sa_len = sizeof (*(s));}
56 int install = !DEBUG; /* if 1 call kernel */
59 struct rthash nethash[ROUTEHASHSIZ];
62 * Lookup dst in the tables for an exact match.
68 register struct rt_entry *rt;
69 register struct rthash *rh;
73 if (dst->sa_family >= AF_MAX)
75 (*afswitch[dst->sa_family].af_hash)(dst, &h);
77 rh = &nethash[hash & ROUTEHASHMASK];
78 for (rt = rh->rt_forw; rt != (struct rt_entry *)rh; rt = rt->rt_forw) {
79 if (rt->rt_hash != hash)
81 if (equal(&rt->rt_dst, dst))
88 * Find a route to dst as the kernel would.
94 register struct rt_entry *rt;
95 register struct rthash *rh;
98 int af = dst->sa_family;
103 (*afswitch[af].af_hash)(dst, &h);
105 hash = h.afh_nethash;
106 rh = &nethash[hash & ROUTEHASHMASK];
107 match = afswitch[af].af_netmatch;
108 for (rt = rh->rt_forw; rt != (struct rt_entry *)rh; rt = rt->rt_forw) {
109 if (rt->rt_hash != hash)
111 if (rt->rt_dst.sa_family == af &&
112 (*match)(&rt->rt_dst, dst))
119 rtadd(dst, gate, metric, ticks, state)
120 struct sockaddr *dst, *gate;
125 register struct rt_entry *rt;
127 int af = dst->sa_family, flags;
134 (*afswitch[af].af_hash)(dst, &h);
135 flags = (*afswitch[af].af_ishost)(dst) ? RTF_HOST : 0;
136 hash = h.afh_nethash;
137 rh = &nethash[hash & ROUTEHASHMASK];
138 rt = (struct rt_entry *)malloc(sizeof (*rt));
143 rt->rt_router = *gate;
144 rt->rt_metric = metric;
145 rt->rt_ticks = ticks;
147 rt->rt_flags = RTF_UP | flags;
148 rt->rt_state = state | RTS_CHANGED;
149 rt->rt_ifp = if_ifwithnet(&rt->rt_router);
152 rt->rt_flags |= RTF_GATEWAY;
154 TRACE_ACTION("ADD", rt);
156 * If the ioctl fails because the gateway is unreachable
157 * from this host, discard the entry. This should only
158 * occur because of an incorrect entry in /etc/gateways.
160 if (install && rtioctl(ADD, &rt->rt_rt) < 0) {
163 if (errno == ENETUNREACH) {
164 TRACE_ACTION("DELETE", rt);
172 rtadd_clone(ort, dst, gate, metric, ticks, state)
173 struct rt_entry *ort;
174 struct sockaddr *dst, *gate;
179 register struct rt_entry *rt;
181 int af = dst->sa_family, flags;
188 (*afswitch[af].af_hash)(dst, &h);
189 flags = (*afswitch[af].af_ishost)(dst) ? RTF_HOST : 0;
190 hash = h.afh_nethash;
191 rh = &nethash[hash & ROUTEHASHMASK];
192 rt = (struct rt_entry *)malloc(sizeof (*rt));
197 rt->rt_router = *gate;
198 rt->rt_metric = metric;
199 rt->rt_ticks = ticks;
201 rt->rt_flags = RTF_UP | flags;
202 rt->rt_state = state | RTS_CHANGED;
203 rt->rt_ifp = if_ifwithnet(&rt->rt_router);
208 rt->rt_flags |= RTF_GATEWAY;
210 while(ort->rt_clone != NULL)
213 TRACE_ACTION("ADD_CLONE", rt);
217 rtchange(rt, gate, metric, ticks)
219 struct sockaddr *gate;
222 int doioctl = 0, metricchanged = 0;
223 struct rtuentry oldroute;
227 * Handling of clones.
228 * When the route changed and it had clones, handle it special.
229 * 1. If the new route is cheaper than the clone(s), free the clones.
230 * 2. If the new route is the same cost, it may be one of the clones,
231 * search for it and free it.
232 * 3. If the new route is more expensive than the clone(s), use the
233 * values of the clone(s).
236 if ((ticks < rt->rt_clone->rt_ticks) ||
237 ((ticks == rt->rt_clone->rt_ticks) &&
238 (metric < rt->rt_clone->rt_metric))) {
242 struct rt_entry *trt, *nrt;
251 } else if ((ticks == rt->rt_clone->rt_ticks) &&
252 (metric == rt->rt_clone->rt_metric)) {
253 struct rt_entry *prt, *trt;
259 if (equal(&trt->rt_router, gate)) {
260 prt->rt_clone = trt->rt_clone;
270 * Use the values of the first clone.
271 * Delete the corresponding clone.
273 struct rt_entry *trt;
276 rt->rt_clone = rt->rt_clone->rt_clone;
277 metric = trt->rt_metric;
278 ticks = trt->rt_ticks;
279 *gate = trt->rt_router;
284 if (!equal(&rt->rt_router, gate))
286 if ((metric != rt->rt_metric) || (ticks != rt->rt_ticks))
288 if (doioctl || metricchanged) {
289 TRACE_ACTION("CHANGE FROM", rt);
291 oldroute = rt->rt_rt;
292 rt->rt_router = *gate;
294 rt->rt_metric = metric;
295 rt->rt_ticks = ticks;
296 if ((rt->rt_state & RTS_INTERFACE) && metric) {
297 rt->rt_state &= ~RTS_INTERFACE;
300 "changing route from interface %s (timed out)",
301 rt->rt_ifp->int_name);
304 "changing route from interface ??? (timed out)");
307 rt->rt_flags |= RTF_GATEWAY;
309 rt->rt_flags &= ~RTF_GATEWAY;
310 rt->rt_ifp = if_ifwithnet(&rt->rt_router);
311 rt->rt_state |= RTS_CHANGED;
312 TRACE_ACTION("CHANGE TO", rt);
314 if (doioctl && install) {
316 if (rtioctl(ADD, &rt->rt_rt) < 0)
317 syslog(LOG_ERR, "rtioctl ADD dst %s, gw %s: %m",
318 ipx_ntoa(&((struct sockaddr_ipx *)&rt->rt_dst)->sipx_addr),
319 ipx_ntoa(&((struct sockaddr_ipx *)&rt->rt_router)->sipx_addr));
320 if (delete && rtioctl(DELETE, &oldroute) < 0)
321 perror("rtioctl DELETE");
324 if (rtioctl(ADD, &rt->rt_rt) >= 0)
327 if (rtioctl(CHANGE, &rt->rt_rt) >= 0)
330 syslog(LOG_ERR, "rtioctl ADD dst %s, gw %s: %m",
331 ipxdp_ntoa(&((struct sockaddr_ipx *)&rt->rt_dst)->sipx_addr),
332 ipxdp_ntoa(&((struct sockaddr_ipx *)&rt->rt_router)->sipx_addr));
342 struct sockaddr *sa = &(rt->rt_router);
348 * If there is a clone we just do a rt_change to it.
350 struct rt_entry *trt = rt->rt_clone;
351 rtchange(rt, &trt->rt_router, trt->rt_metric, trt->rt_ticks);
354 if (rt->rt_state & RTS_INTERFACE) {
357 "deleting route to interface %s (timed out)",
358 rt->rt_ifp->int_name);
361 "deleting route to interface ??? (timed out)");
363 TRACE_ACTION("DELETE", rt);
364 if (install && rtioctl(DELETE, &rt->rt_rt) < 0)
365 perror("rtioctl DELETE");
373 register struct rthash *rh;
375 for (rh = nethash; rh < &nethash[ROUTEHASHSIZ]; rh++)
376 rh->rt_forw = rh->rt_back = (struct rt_entry *)rh;
383 struct rtuentry *ort;
389 ort->rtu_rtflags = ort->rtu_flags;
394 return (ioctl(s, SIOCADDRT, (char *)ort));
397 return (ioctl(s, SIOCDELRT, (char *)ort));
404 struct rt_msghdr w_rtm;
405 struct sockaddr w_dst;
406 struct sockaddr w_gate;
407 struct sockaddr_ipx w_netmask;
411 bzero((char *)&w, sizeof(w));
412 rtm.rtm_msglen = sizeof(w);
413 rtm.rtm_version = RTM_VERSION;
414 rtm.rtm_type = (action == ADD ? RTM_ADD :
415 (action == DELETE ? RTM_DELETE : RTM_CHANGE));
416 rtm.rtm_flags = ort->rtu_flags;
417 rtm.rtm_seq = ++seqno;
418 rtm.rtm_addrs = RTA_DST|RTA_GATEWAY;
419 bcopy((char *)&ort->rtu_dst, (char *)&w.w_dst, sizeof(w.w_dst));
420 bcopy((char *)&ort->rtu_router, (char *)&w.w_gate, sizeof(w.w_gate));
421 w.w_gate.sa_family = w.w_dst.sa_family = AF_IPX;
422 w.w_gate.sa_len = w.w_dst.sa_len = sizeof(w.w_dst);
423 if (rtm.rtm_flags & RTF_HOST) {
424 rtm.rtm_msglen -= sizeof(w.w_netmask);
426 rtm.rtm_addrs |= RTA_NETMASK;
427 w.w_netmask = ipx_netmask;
428 rtm.rtm_msglen -= sizeof(w.w_netmask) - ipx_netmask.sipx_len;
431 return write(r, (char *)&w, rtm.rtm_msglen);