1/* 2 * Copyright (c) 1985, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Copyright (c) 1995 John Hay. All rights reserved. 6 * 7 * This file includes significant work done at Cornell University by 8 * Bill Nesheim. That work included by permission. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 * 38 * $FreeBSD$ 39 */ 40 41#ifndef lint 42static const char sccsid[] = "@(#)startup.c 8.1 (Berkeley) 6/5/93"; 43#endif /* not lint */ 44 45/* 46 * Routing Table Management Daemon 47 */ 48#include "defs.h" 49 50#include <sys/param.h> 51#include <sys/ioctl.h> 52#include <sys/sysctl.h> 53#include <sys/time.h> 54 55#include <net/if.h> 56#include <net/if_dl.h> 57 58#include <errno.h> 59#include <nlist.h> 60#include <search.h> 61#include <stdlib.h> 62 63struct interface *ifnet; 64int lookforinterfaces = 1; 65int performnlist = 1; 66int gateway = 0; 67int externalinterfaces = 0; /* # of remote and local interfaces */ 68 69void 70quit(s) 71 char *s; 72{ 73 int sverrno = errno; 74 75 (void) fprintf(stderr, "IPXroute: "); 76 if (s) 77 (void) fprintf(stderr, "%s: ", s); 78 (void) fprintf(stderr, "%s\n", strerror(sverrno)); 79 exit(1); 80 /* NOTREACHED */ 81} 82 83struct rt_addrinfo info; 84/* XXX Sleazy use of local variables throughout file, warning!!!! */ 85#define netmask info.rti_info[RTAX_NETMASK] 86#define ifaaddr info.rti_info[RTAX_IFA] 87#define brdaddr info.rti_info[RTAX_BRD] 88 89void 90rt_xaddrs(cp, cplim, rtinfo) 91 register caddr_t cp, cplim; 92 register struct rt_addrinfo *rtinfo; 93{ 94 register struct sockaddr *sa; 95 register int i; 96 97 bzero(rtinfo->rti_info, sizeof(rtinfo->rti_info)); 98 for (i = 0; (i < RTAX_MAX) && (cp < cplim); i++) { 99 if ((rtinfo->rti_addrs & (1 << i)) == 0) 100 continue; 101 rtinfo->rti_info[i] = sa = (struct sockaddr *)cp; 102 cp += SA_SIZE(sa); 103 } 104} 105 106/* 107 * Find the network interfaces which have configured themselves. 108 * If the interface is present but not yet up (for example an 109 * ARPANET IMP), set the lookforinterfaces flag so we'll 110 * come back later and look again. 111 */ 112void 113ifinit(void) 114{ 115 struct interface ifs, *ifp; 116 size_t needed; 117 int mib[6], no_ipxaddr = 0, flags = 0; 118 char *buf, *cplim, *cp; 119 register struct if_msghdr *ifm; 120 register struct ifa_msghdr *ifam; 121 struct sockaddr_dl *sdl = 0; 122 123 mib[0] = CTL_NET; 124 mib[1] = PF_ROUTE; 125 mib[2] = 0; 126 mib[3] = AF_IPX; 127 mib[4] = NET_RT_IFLIST; 128 mib[5] = 0; 129 if (sysctl(mib, 6, NULL, &needed, NULL, 0) < 0) 130 quit("route-sysctl-estimate"); 131 if ((buf = malloc(needed)) == NULL) 132 quit("malloc"); 133 if (sysctl(mib, 6, buf, &needed, NULL, 0) < 0) 134 lookforinterfaces = 0; 135 cplim = buf + needed; 136 for (cp = buf; cp < cplim; cp += ifm->ifm_msglen) { 137 ifm = (struct if_msghdr *)cp; 138 if (ifm->ifm_type == RTM_IFINFO) { 139 bzero(&ifs, sizeof(ifs)); 140 ifs.int_flags = flags = ifm->ifm_flags | IFF_INTERFACE; 141 if ((flags & IFF_UP) == 0 || no_ipxaddr) 142 lookforinterfaces = 1; 143 sdl = (struct sockaddr_dl *) (ifm + 1); 144 sdl->sdl_data[sdl->sdl_nlen] = 0; 145 no_ipxaddr = 1; 146 continue; 147 } 148 if (ifm->ifm_type != RTM_NEWADDR) 149 quit("ifinit: out of sync"); 150 if ((flags & IFF_UP) == 0) 151 continue; 152 ifam = (struct ifa_msghdr *)ifm; 153 info.rti_addrs = ifam->ifam_addrs; 154 rt_xaddrs((char *)(ifam + 1), cp + ifam->ifam_msglen, &info); 155 if (ifaaddr == 0) { 156 syslog(LOG_ERR, "%s: (get addr)", sdl->sdl_data); 157 continue; 158 } 159 ifs.int_addr = *ifaaddr; 160 if (ifs.int_addr.sa_family != AF_IPX) 161 continue; 162 no_ipxaddr = 0; 163 if (ifs.int_flags & IFF_POINTOPOINT) { 164 if (brdaddr == 0) { 165 syslog(LOG_ERR, "%s: (get dstaddr)", 166 sdl->sdl_data); 167 continue; 168 } 169 if (brdaddr->sa_family == AF_UNSPEC) { 170 lookforinterfaces = 1; 171 continue; 172 } 173 ifs.int_dstaddr = *brdaddr; 174 } 175 if (ifs.int_flags & IFF_BROADCAST) { 176 if (brdaddr == 0) { 177 syslog(LOG_ERR, "%s: (get broadaddr)", 178 sdl->sdl_data); 179 continue; 180 } 181 ifs.int_dstaddr = *brdaddr; 182 } 183 if (ifs.int_flags & IFF_LOOPBACK) { 184 ifs.int_dstaddr = ifs.int_addr; 185 } 186 /* 187 * already known to us? 188 * what makes a POINTOPOINT if unique is its dst addr, 189 * NOT its source address 190 */ 191 if ( ((ifs.int_flags & IFF_POINTOPOINT) && 192 if_ifwithdstaddr(&ifs.int_dstaddr)) || 193 ( ((ifs.int_flags & IFF_POINTOPOINT) == 0) && 194 if_ifwithaddr(&ifs.int_addr))) 195 continue; 196 ifp = (struct interface *) 197 malloc(sdl->sdl_nlen + 1 + sizeof(ifs)); 198 if (ifp == 0) { 199 syslog(LOG_ERR, "IPXrouted: out of memory\n"); 200 lookforinterfaces = 1; 201 break; 202 } 203 *ifp = ifs; 204 /* 205 * Count the # of directly connected networks 206 * and point to point links which aren't looped 207 * back to ourself. This is used below to 208 * decide if we should be a routing ``supplier''. 209 */ 210 if ((ifs.int_flags & IFF_POINTOPOINT) == 0 || 211 if_ifwithaddr(&ifs.int_dstaddr) == 0) 212 externalinterfaces++; 213 /* 214 * If we have a point-to-point link, we want to act 215 * as a supplier even if it's our only interface, 216 * as that's the only way our peer on the other end 217 * can tell that the link is up. 218 */ 219 if ((ifs.int_flags & IFF_POINTOPOINT) && supplier < 0) 220 supplier = 1; 221 ifp->int_name = (char *)(ifp + 1); 222 strcpy(ifp->int_name, sdl->sdl_data); 223 224 ifp->int_metric = ifam->ifam_metric; 225 ifp->int_next = ifnet; 226 ifnet = ifp; 227 traceinit(ifp); 228 addrouteforif(ifp); 229 } 230 if (externalinterfaces > 1 && supplier < 0) 231 supplier = 1; 232 free(buf); 233} 234 235void 236addrouteforif(ifp) 237 struct interface *ifp; 238{ 239 struct sockaddr_ipx net; 240 struct sockaddr *dst; 241 struct rt_entry *rt; 242 243 if (ifp->int_flags & IFF_POINTOPOINT) { 244 int (*match)(); 245 register struct interface *ifp2 = ifnet; 246 247 dst = &ifp->int_dstaddr; 248 249 /* Search for interfaces with the same net */ 250 ifp->int_sq.n = ifp->int_sq.p = &(ifp->int_sq); 251 match = afswitch[dst->sa_family].af_netmatch; 252 if (match) 253 for (ifp2 = ifnet; ifp2; ifp2 =ifp2->int_next) { 254 if ((ifp->int_flags & IFF_POINTOPOINT) == 0) 255 continue; 256 if ((*match)(&ifp2->int_dstaddr,&ifp->int_dstaddr)) { 257 insque(&ifp2->int_sq,&ifp->int_sq); 258 break; 259 } 260 } 261 } else { 262 bzero(&net, sizeof(net)); 263 net.sipx_family = AF_IPX; 264 net.sipx_len = sizeof (net); 265 net.sipx_addr.x_net = satoipx_addr(ifp->int_broadaddr).x_net; 266 dst = (struct sockaddr *)&net; 267 } 268 rt = rtlookup(dst); 269 if (rt) 270 rtdelete(rt); 271 if (tracing) 272 fprintf(stderr, "Adding route to interface %s\n", ifp->int_name); 273 if (ifp->int_transitions++ > 0) 274 syslog(LOG_ERR, "re-installing interface %s", ifp->int_name); 275 rtadd(dst, &ifp->int_addr, ifp->int_metric, 0, 276 ifp->int_flags & (IFF_INTERFACE|IFF_PASSIVE|IFF_REMOTE)); 277} 278 279