iface.c revision 40561
1/*- 2 * Copyright (c) 1998 Brian Somers <brian@Awfulhak.org> 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24 * SUCH DAMAGE. 25 * 26 * $Id:$ 27 */ 28 29#include <sys/types.h> 30#include <sys/socket.h> 31#include <netinet/in.h> 32#include <net/if.h> 33#include <net/if_dl.h> 34#include <net/route.h> 35#include <arpa/inet.h> 36#include <netinet/in_systm.h> 37#include <netinet/ip.h> 38#include <sys/un.h> 39 40#include <sys/errno.h> 41#include <sys/ioctl.h> 42#include <sys/sysctl.h> 43#include <string.h> 44#include <stdio.h> 45#include <stdlib.h> 46#include <termios.h> 47#include <unistd.h> 48 49#include "defs.h" 50#include "command.h" 51#include "mbuf.h" 52#include "log.h" 53#include "id.h" 54#include "timer.h" 55#include "fsm.h" 56#include "iplist.h" 57#include "lqr.h" 58#include "hdlc.h" 59#include "throughput.h" 60#include "slcompress.h" 61#include "filter.h" 62#include "descriptor.h" 63#include "ipcp.h" 64#include "lcp.h" 65#include "ccp.h" 66#include "link.h" 67#include "mp.h" 68#include "bundle.h" 69#include "prompt.h" 70#include "iface.h" 71 72 73static int 74bitsinmask(struct in_addr mask) 75{ 76 u_int32_t bitmask, maskaddr; 77 int bits; 78 79 bitmask = 0xffffffff; 80 maskaddr = ntohl(mask.s_addr); 81 for (bits = 32; bits >= 0; bits--) { 82 if (maskaddr == bitmask) 83 break; 84 bitmask &= ~(1 << (32 - bits)); 85 } 86 87 return bits; 88} 89 90struct iface * 91iface_Create(const char *name) 92{ 93 int mib[6], i, s; 94 size_t needed; 95 char *buf, *ptr, *end, *cp, *lim; 96 struct if_msghdr *ifm; 97 struct ifa_msghdr *ifam; 98 struct sockaddr_dl *dl; 99 struct rt_addrinfo rti; 100 struct iface *iface; 101 struct iface_addr *addr; 102 103 s = socket(AF_INET, SOCK_DGRAM, 0); 104 if (s < 0) { 105 fprintf(stderr, "iface_Create: socket(): %s\n", strerror(errno)); 106 return NULL; 107 } 108 109 mib[0] = CTL_NET; 110 mib[1] = PF_ROUTE; 111 mib[2] = 0; 112 mib[3] = 0; 113 mib[4] = NET_RT_IFLIST; 114 mib[5] = 0; 115 116 if (sysctl(mib, 6, NULL, &needed, NULL, 0) < 0) { 117 fprintf(stderr, "clean: sysctl: estimate: %s\n", 118 strerror(errno)); 119 close(s); 120 return NULL; 121 } 122 123 if ((buf = (char *)malloc(needed)) == NULL) { 124 close(s); 125 return NULL; 126 } 127 128 if (sysctl(mib, 6, buf, &needed, NULL, 0) < 0) { 129 free(buf); 130 close(s); 131 return NULL; 132 } 133 134 ptr = buf; 135 end = buf + needed; 136 iface = NULL; 137 138 while (ptr < end && iface == NULL) { 139 ifm = (struct if_msghdr *)ptr; /* On if_msghdr */ 140 if (ifm->ifm_type != RTM_IFINFO) 141 break; 142 dl = (struct sockaddr_dl *)(ifm + 1); /* Single _dl at end */ 143 if (!strncmp(name, dl->sdl_data, dl->sdl_nlen)) { 144 iface = (struct iface *)malloc(sizeof *iface); 145 if (iface == NULL) { 146 fprintf(stderr, "iface_Create: malloc: %s\n", strerror(errno)); 147 return NULL; 148 } 149 iface->name = strdup(name); 150 iface->flags = ifm->ifm_flags; 151 iface->index = ifm->ifm_index; 152 iface->in_addrs = 0; 153 iface->in_addr = NULL; 154 } 155 ptr += ifm->ifm_msglen; /* First ifa_msghdr */ 156 for (; ptr < end; ptr += ifam->ifam_msglen) { 157 ifam = (struct ifa_msghdr *)ptr; /* Next if address */ 158 159 if (ifam->ifam_type != RTM_NEWADDR) /* finished this if */ 160 break; 161 162 if (iface == NULL) /* Keep wading */ 163 continue; 164 165 /* Found an address ! */ 166 167 if (ifam->ifam_addrs & (1 << RTAX_IFA)) { 168 /* *And* it's configured ! */ 169 rti.rti_addrs = ifam->ifam_addrs; 170 lim = (char *)ifam + ifam->ifam_msglen; 171 cp = (char *)(ifam + 1); 172 memset(rti.rti_info, '\0', sizeof(rti.rti_info)); 173 for (i = 0; i < RTAX_MAX && cp < lim; i++) { 174 if ((rti.rti_addrs & (1 << i)) == 0) 175 continue; 176 rti.rti_info[i] = (struct sockaddr *)cp; 177#define ROUNDUP(x) \ 178 ((x) > 0 ? (1 + (((x) - 1) | (sizeof(long) - 1))) : sizeof(long)) 179 cp += ROUNDUP(rti.rti_info[i]->sa_len); 180 } 181 182 if (rti.rti_info[RTAX_IFA] && 183 rti.rti_info[RTAX_IFA]->sa_family == AF_INET) { 184 /* Record the iface address rti */ 185 186 addr = (struct iface_addr *)realloc 187 (iface->in_addr, (iface->in_addrs + 1) * sizeof iface->in_addr[0]); 188 if (addr == NULL) 189 break; 190 iface->in_addr = addr; 191 192 addr += iface->in_addrs; 193 iface->in_addrs++; 194 195 addr->ifa.s_addr = ((struct sockaddr_in *)rti.rti_info[RTAX_IFA])-> 196 sin_addr.s_addr; 197 addr->brd.s_addr = rti.rti_info[RTAX_BRD] ? 198 ((struct sockaddr_in *)rti.rti_info[RTAX_BRD])->sin_addr.s_addr : 199 INADDR_ANY; 200 addr->mask.s_addr = rti.rti_info[RTAX_NETMASK] ? 201 ((struct sockaddr_in *)rti.rti_info[RTAX_NETMASK])->sin_addr.s_addr: 202 INADDR_ANY; 203 204 addr->bits = bitsinmask(addr->mask); 205 } 206 } 207 } 208 } 209 210 free(buf); 211 close(s); 212 213 return iface; 214} 215 216static void 217iface_addr_Zap(const char *name, struct iface_addr *addr) 218{ 219 struct ifaliasreq ifra; 220 struct sockaddr_in *me, *peer; 221 int s; 222 223 s = ID0socket(AF_INET, SOCK_DGRAM, 0); 224 if (s < 0) 225 log_Printf(LogERROR, "iface_addr_Zap: socket(): %s\n", strerror(errno)); 226 else { 227 memset(&ifra, '\0', sizeof ifra); 228 strncpy(ifra.ifra_name, name, sizeof ifra.ifra_name - 1); 229 me = (struct sockaddr_in *)&ifra.ifra_addr; 230 peer = (struct sockaddr_in *)&ifra.ifra_broadaddr; 231 me->sin_family = peer->sin_family = AF_INET; 232 me->sin_len = peer->sin_len = sizeof(struct sockaddr_in); 233 me->sin_addr = addr->ifa; 234 peer->sin_addr = addr->brd; 235 if (ID0ioctl(s, SIOCDIFADDR, &ifra) < 0) 236 log_Printf(LogWARN, "iface_addr_Zap: ioctl(SIOCDIFADDR, %s): %s\n", 237 inet_ntoa(addr->ifa), strerror(errno)); 238 close(s); 239 } 240} 241 242void 243iface_inClear(struct iface *iface, int how) 244{ 245 int n, addrs; 246 247 addrs = n = how == IFACE_CLEAR_ALL ? 0 : 1; 248 for (; n < iface->in_addrs; n++) 249 iface_addr_Zap(iface->name, iface->in_addr + n); 250 251 iface->in_addrs = addrs; 252 /* Don't bother realloc()ing - we have little to gain */ 253} 254 255int 256iface_inAdd(struct iface *iface, struct in_addr ifa, struct in_addr mask, 257 struct in_addr brd, int how) 258{ 259 int slot, s; 260 struct ifaliasreq ifra; 261 struct sockaddr_in *me, *peer, *msk; 262 struct iface_addr *addr; 263 264 for (slot = 0; slot < iface->in_addrs; slot++) 265 if (iface->in_addr[slot].ifa.s_addr == ifa.s_addr) { 266 if (how & IFACE_FORCE_ADD) 267 break; 268 else 269 /* errno = EEXIST; */ 270 return 0; 271 } 272 273 addr = (struct iface_addr *)realloc 274 (iface->in_addr, (iface->in_addrs + 1) * sizeof iface->in_addr[0]); 275 if (addr == NULL) { 276 log_Printf(LogERROR, "iface_inAdd: realloc: %s\n", strerror(errno)); 277 return 0; 278 } 279 iface->in_addr = addr; 280 281 s = ID0socket(AF_INET, SOCK_DGRAM, 0); 282 if (s < 0) { 283 log_Printf(LogERROR, "iface_inAdd: socket(): %s\n", strerror(errno)); 284 return 0; 285 } 286 287 memset(&ifra, '\0', sizeof ifra); 288 strncpy(ifra.ifra_name, iface->name, sizeof ifra.ifra_name - 1); 289 290 me = (struct sockaddr_in *)&ifra.ifra_addr; 291 msk = (struct sockaddr_in *)&ifra.ifra_mask; 292 peer = (struct sockaddr_in *)&ifra.ifra_broadaddr; 293 294 me->sin_family = msk->sin_family = peer->sin_family = AF_INET; 295 me->sin_len = msk->sin_len = peer->sin_len = sizeof(struct sockaddr_in); 296 297 me->sin_addr = ifa; 298 msk->sin_addr = mask; 299 peer->sin_addr = brd; 300 301 /* 302 * Note: EEXIST is sometimes returned, despite the route actually being 303 * added ! 304 */ 305 if (ID0ioctl(s, SIOCAIFADDR, &ifra) < 0 && errno != EEXIST) { 306 log_Printf(LogERROR, "iface_inAdd: ioctl(SIOCAIFADDR): %s\n", 307 strerror(errno)); 308 close(s); 309 return 0; 310 } 311 close(s); 312 313 if (slot == iface->in_addrs) { 314 /* We're adding a new interface address */ 315 316 if (how & IFACE_ADD_FIRST) { 317 /* Stuff it at the start of our list */ 318 slot = 0; 319 bcopy(iface->in_addr, iface->in_addr + 1, 320 iface->in_addrs * sizeof iface->in_addr[0]); 321 } 322 323 iface->in_addrs++; 324 } else if (how & IFACE_ADD_FIRST) { 325 /* Shift it up to the first slot */ 326 bcopy(iface->in_addr, iface->in_addr + 1, slot * sizeof iface->in_addr[0]); 327 slot = 0; 328 } 329 330 iface->in_addr[slot].ifa = ifa; 331 iface->in_addr[slot].mask = mask; 332 iface->in_addr[slot].brd = brd; 333 iface->in_addr[slot].bits = bitsinmask(iface->in_addr[slot].mask); 334 335 return 1; 336} 337 338int 339iface_inDelete(struct iface *iface, struct in_addr ip) 340{ 341 int n; 342 343 for (n = 0; n < iface->in_addrs; n++) 344 if (iface->in_addr[n].ifa.s_addr == ip.s_addr) { 345 iface_addr_Zap(iface->name, iface->in_addr + n); 346 bcopy(iface->in_addr + n + 1, iface->in_addr + n, 347 (iface->in_addrs - n - 1) * sizeof iface->in_addr[0]); 348 iface->in_addrs--; 349 return 1; 350 } 351 352 return 0; 353} 354 355void 356iface_Destroy(struct iface *iface) 357{ 358 /* 359 * iface_Clear(iface, IFACE_CLEAR_ALL) must be called manually 360 * if that's what the user wants. It's better to leave the interface 361 * allocated so that existing connections can continue to work. 362 */ 363 364 if (iface != NULL) { 365 free(iface->name); 366 free(iface->in_addr); 367 free(iface); 368 } 369} 370 371#define if_entry(x) { IFF_##x, #x } 372 373struct { 374 int flag; 375 const char *value; 376} if_flags[] = { 377 if_entry(UP), 378 if_entry(BROADCAST), 379 if_entry(DEBUG), 380 if_entry(LOOPBACK), 381 if_entry(POINTOPOINT), 382 if_entry(RUNNING), 383 if_entry(NOARP), 384 if_entry(PROMISC), 385 if_entry(ALLMULTI), 386 if_entry(OACTIVE), 387 if_entry(SIMPLEX), 388 if_entry(LINK0), 389 if_entry(LINK1), 390 if_entry(LINK2), 391 if_entry(MULTICAST), 392 { 0, "???" } 393}; 394 395int 396iface_Show(struct cmdargs const *arg) 397{ 398 struct iface *iface = arg->bundle->iface, *current; 399 int f, flags; 400 401 current = iface_Create(iface->name); 402 flags = iface->flags = current->flags; 403 iface_Destroy(current); 404 405 prompt_Printf(arg->prompt, "%s (idx %d) <", iface->name, iface->index); 406 for (f = 0; f < sizeof if_flags / sizeof if_flags[0]; f++) 407 if ((if_flags[f].flag & flags) || (!if_flags[f].flag && flags)) { 408 prompt_Printf(arg->prompt, "%s%s", flags == iface->flags ? "" : ",", 409 if_flags[f].value); 410 flags &= ~if_flags[f].flag; 411 } 412 prompt_Printf(arg->prompt, "> has %d address%s:\n", iface->in_addrs, 413 iface->in_addrs == 1 ? "" : "es"); 414 415 for (f = 0; f < iface->in_addrs; f++) { 416 prompt_Printf(arg->prompt, " %s", inet_ntoa(iface->in_addr[f].ifa)); 417 if (iface->in_addr[f].bits >= 0) 418 prompt_Printf(arg->prompt, "/%d", iface->in_addr[f].bits); 419 if (iface->flags & IFF_POINTOPOINT) 420 prompt_Printf(arg->prompt, " -> %s", inet_ntoa(iface->in_addr[f].brd)); 421 else if (iface->flags & IFF_BROADCAST) 422 prompt_Printf(arg->prompt, " broadcast %s", 423 inet_ntoa(iface->in_addr[f].brd)); 424 if (iface->in_addr[f].bits < 0) 425 prompt_Printf(arg->prompt, " (mask %s)", 426 inet_ntoa(iface->in_addr[f].mask)); 427 prompt_Printf(arg->prompt, "\n"); 428 } 429 430 return 0; 431} 432