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
39 static const char sccsid[] = "@(#)tables.c 8.1 (Berkeley) 6/5/93";
43 * Routing Table Management Daemon
46 #include <sys/ioctl.h>
56 #define FIXLEN(s) { if ((s)->sa_len == 0) (s)->sa_len = sizeof (*(s));}
58 int install = !DEBUG; /* if 1 call kernel */
61 struct rthash nethash[ROUTEHASHSIZ];
64 * Lookup dst in the tables for an exact match.
67 rtlookup(struct sockaddr *dst)
69 register struct rt_entry *rt;
70 register struct rthash *rh;
74 if (dst->sa_family >= AF_MAX)
76 (*afswitch[dst->sa_family].af_hash)(dst, &h);
78 rh = &nethash[hash & ROUTEHASHMASK];
79 for (rt = rh->rt_forw; rt != (struct rt_entry *)rh; rt = rt->rt_forw) {
80 if (rt->rt_hash != hash)
82 if (equal(&rt->rt_dst, dst))
89 * Find a route to dst as the kernel would.
92 rtfind(struct sockaddr *dst)
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(struct sockaddr *dst, struct sockaddr *gate, short metric,
120 short ticks, int state)
123 register struct rt_entry *rt;
125 int af = dst->sa_family, flags;
132 (*afswitch[af].af_hash)(dst, &h);
133 flags = (*afswitch[af].af_ishost)(dst) ? RTF_HOST : 0;
134 hash = h.afh_nethash;
135 rh = &nethash[hash & ROUTEHASHMASK];
136 rt = (struct rt_entry *)malloc(sizeof (*rt));
141 rt->rt_router = *gate;
142 rt->rt_metric = metric;
143 rt->rt_ticks = ticks;
145 rt->rt_flags = RTF_UP | flags;
146 rt->rt_state = state | RTS_CHANGED;
147 rt->rt_ifp = if_ifwithnet(&rt->rt_router);
150 rt->rt_flags |= RTF_GATEWAY;
152 TRACE_ACTION("ADD", rt);
154 * If the ioctl fails because the gateway is unreachable
155 * from this host, discard the entry. This should only
156 * occur because of an incorrect entry in /etc/gateways.
158 if (install && rtioctl(ADD, &rt->rt_rt) < 0) {
161 if (errno == ENETUNREACH) {
162 TRACE_ACTION("DELETE", rt);
170 rtadd_clone(struct rt_entry *ort, struct sockaddr *dst,
171 struct sockaddr *gate, short metric, short ticks, int state)
174 register struct rt_entry *rt;
176 int af = dst->sa_family, flags;
183 (*afswitch[af].af_hash)(dst, &h);
184 flags = (*afswitch[af].af_ishost)(dst) ? RTF_HOST : 0;
185 hash = h.afh_nethash;
186 rh = &nethash[hash & ROUTEHASHMASK];
187 rt = (struct rt_entry *)malloc(sizeof (*rt));
192 rt->rt_router = *gate;
193 rt->rt_metric = metric;
194 rt->rt_ticks = ticks;
196 rt->rt_flags = RTF_UP | flags;
197 rt->rt_state = state | RTS_CHANGED;
198 rt->rt_ifp = if_ifwithnet(&rt->rt_router);
203 rt->rt_flags |= RTF_GATEWAY;
205 while(ort->rt_clone != NULL)
208 TRACE_ACTION("ADD_CLONE", rt);
212 rtchange(struct rt_entry *rt, struct sockaddr *gate, short metric,
215 int doioctl = 0, metricchanged = 0;
216 struct rtuentry oldroute;
220 * Handling of clones.
221 * When the route changed and it had clones, handle it special.
222 * 1. If the new route is cheaper than the clone(s), free the clones.
223 * 2. If the new route is the same cost, it may be one of the clones,
224 * search for it and free it.
225 * 3. If the new route is more expensive than the clone(s), use the
226 * values of the clone(s).
229 if ((ticks < rt->rt_clone->rt_ticks) ||
230 ((ticks == rt->rt_clone->rt_ticks) &&
231 (metric < rt->rt_clone->rt_metric))) {
235 struct rt_entry *trt, *nrt;
244 } else if ((ticks == rt->rt_clone->rt_ticks) &&
245 (metric == rt->rt_clone->rt_metric)) {
246 struct rt_entry *prt, *trt;
252 if (equal(&trt->rt_router, gate)) {
253 prt->rt_clone = trt->rt_clone;
263 * Use the values of the first clone.
264 * Delete the corresponding clone.
266 struct rt_entry *trt;
269 rt->rt_clone = rt->rt_clone->rt_clone;
270 metric = trt->rt_metric;
271 ticks = trt->rt_ticks;
272 *gate = trt->rt_router;
277 if (!equal(&rt->rt_router, gate))
279 if ((metric != rt->rt_metric) || (ticks != rt->rt_ticks))
281 if (doioctl || metricchanged) {
282 TRACE_ACTION("CHANGE FROM", rt);
284 oldroute = rt->rt_rt;
285 rt->rt_router = *gate;
287 rt->rt_metric = metric;
288 rt->rt_ticks = ticks;
289 if ((rt->rt_state & RTS_INTERFACE) && metric) {
290 rt->rt_state &= ~RTS_INTERFACE;
293 "changing route from interface %s (timed out)",
294 rt->rt_ifp->int_name);
297 "changing route from interface ??? (timed out)");
300 rt->rt_flags |= RTF_GATEWAY;
302 rt->rt_flags &= ~RTF_GATEWAY;
303 rt->rt_ifp = if_ifwithnet(&rt->rt_router);
304 rt->rt_state |= RTS_CHANGED;
305 TRACE_ACTION("CHANGE TO", rt);
307 if (doioctl && install) {
309 if (rtioctl(ADD, &rt->rt_rt) < 0)
310 syslog(LOG_ERR, "rtioctl ADD dst %s, gw %s: %m",
311 ipx_ntoa(&((struct sockaddr_ipx *)&rt->rt_dst)->sipx_addr),
312 ipx_ntoa(&((struct sockaddr_ipx *)&rt->rt_router)->sipx_addr));
313 if (delete && rtioctl(DELETE, &oldroute) < 0)
314 perror("rtioctl DELETE");
317 if (rtioctl(ADD, &rt->rt_rt) >= 0)
320 if (rtioctl(CHANGE, &rt->rt_rt) >= 0)
323 syslog(LOG_ERR, "rtioctl ADD dst %s, gw %s: %m",
324 ipxdp_ntoa(&((struct sockaddr_ipx *)&rt->rt_dst)->sipx_addr),
325 ipxdp_ntoa(&((struct sockaddr_ipx *)&rt->rt_router)->sipx_addr));
331 rtdelete(struct rt_entry *rt)
334 struct sockaddr *sa = &(rt->rt_router);
340 * If there is a clone we just do a rt_change to it.
342 struct rt_entry *trt = rt->rt_clone;
343 rtchange(rt, &trt->rt_router, trt->rt_metric, trt->rt_ticks);
346 if (rt->rt_state & RTS_INTERFACE) {
349 "deleting route to interface %s (timed out)",
350 rt->rt_ifp->int_name);
353 "deleting route to interface ??? (timed out)");
355 TRACE_ACTION("DELETE", rt);
356 if (install && rtioctl(DELETE, &rt->rt_rt) < 0)
357 perror("rtioctl DELETE");
365 register struct rthash *rh;
367 for (rh = nethash; rh < &nethash[ROUTEHASHSIZ]; rh++)
368 rh->rt_forw = rh->rt_back = (struct rt_entry *)rh;
373 rtioctl(int action, struct rtuentry *ort)
379 ort->rtu_rtflags = ort->rtu_flags;
384 return (ioctl(s, SIOCADDRT, (char *)ort));
387 return (ioctl(s, SIOCDELRT, (char *)ort));
394 struct rt_msghdr w_rtm;
395 struct sockaddr w_dst;
396 struct sockaddr w_gate;
397 struct sockaddr_ipx w_netmask;
401 bzero((char *)&w, sizeof(w));
402 rtm.rtm_msglen = sizeof(w);
403 rtm.rtm_version = RTM_VERSION;
404 rtm.rtm_type = (action == ADD ? RTM_ADD :
405 (action == DELETE ? RTM_DELETE : RTM_CHANGE));
406 rtm.rtm_flags = ort->rtu_flags;
407 rtm.rtm_seq = ++seqno;
408 rtm.rtm_addrs = RTA_DST|RTA_GATEWAY;
409 bcopy((char *)&ort->rtu_dst, (char *)&w.w_dst, sizeof(w.w_dst));
410 bcopy((char *)&ort->rtu_router, (char *)&w.w_gate, sizeof(w.w_gate));
411 w.w_gate.sa_family = w.w_dst.sa_family = AF_IPX;
412 w.w_gate.sa_len = w.w_dst.sa_len = sizeof(w.w_dst);
413 if (rtm.rtm_flags & RTF_HOST) {
414 rtm.rtm_msglen -= sizeof(w.w_netmask);
416 rtm.rtm_addrs |= RTA_NETMASK;
417 w.w_netmask = ipx_netmask;
418 rtm.rtm_msglen -= sizeof(w.w_netmask) - ipx_netmask.sipx_len;
421 return write(r, (char *)&w, rtm.rtm_msglen);