2 * $OpenBSD: show.c,v 1.26 2003/08/26 08:33:12 itojun Exp $
3 * $NetBSD: show.c,v 1.1 1996/11/15 18:01:41 gwr Exp $
6 * Copyright (c) 1983, 1988, 1993
7 * The Regents of the University of California. All rights reserved.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 #include <sys/param.h>
35 #include <sys/protosw.h>
36 #include <sys/socket.h>
40 #include <net/if_dl.h>
41 #include <net/if_types.h>
42 #include <net/route.h>
43 #include <netinet/in.h>
44 #include <arpa/inet.h>
46 #include <sys/sysctl.h>
59 ((a) > 0 ? (1 + (((a) - 1) | (sizeof(long) - 1))) : sizeof(long))
60 #define ADVANCE(x, n) (x += ROUNDUP((n)->sa_len))
63 * Definitions for showing gateway flags.
69 static const struct bits bits[] = {
74 { RTF_BLACKHOLE, 'B' },
76 { RTF_MODIFIED, 'M' },
77 { RTF_DONE, 'd' }, /* Completed -- for routing messages only */
79 { RTF_XRESOLVE, 'X' },
88 static void p_rtentry(struct rt_msghdr *);
89 static int p_sockaddr(struct sockaddr *, int, int);
90 static void p_flags(int, const char *);
91 static void pr_rthdr(void);
92 static void pr_family(int);
95 * Print routing tables.
98 show(int argc, char *argv[])
100 struct rt_msghdr *rtm;
101 char *buf = NULL, *next, *lim = NULL;
109 if (argc == 2 && **argv == '-') {
110 switch (keyword(*argv + 1)) {
142 mib[4] = NET_RT_DUMP;
150 if (sysctl(mib, miblen, NULL, &needed, NULL, 0) < 0) {
151 perror("route-sysctl-estimate");
155 if ((buf = malloc(needed)) == NULL) {
156 printf("out of space\n");
159 if (sysctl(mib, miblen, buf, &needed, NULL, 0) < 0) {
160 perror("sysctl of routing table");
166 printf("Routing tables\n");
169 for (next = buf; next < lim; next += rtm->rtm_msglen) {
170 rtm = (struct rt_msghdr *)next;
171 sa = (struct sockaddr *)(rtm + 1);
172 if (af != 0 && sa->sa_family != af)
180 /* column widths; each followed by one space */
181 #define WID_DST (nflag ? 20 : 32) /* destination column width */
182 #define WID_GW (nflag ? 20 : 32) /* gateway column width */
185 * Print header for routing table columns.
190 printf("%-*.*s %-*.*s %-6.6s\n",
191 WID_DST, WID_DST, "Destination",
192 WID_GW, WID_GW, "Gateway",
197 * Print a routing table entry.
200 p_rtentry(struct rt_msghdr *rtm)
202 struct sockaddr *sa = (struct sockaddr *)(rtm + 1);
204 static int masks_done, banner_printed;
207 int af = 0, interesting = RTF_UP | RTF_GATEWAY | RTF_HOST;
211 /* for the moment, netmasks are skipped over */
212 if (!banner_printed) {
213 printf("Netmasks:\n");
216 if (masks_done == 0) {
217 if (rtm->rtm_addrs != RTA_DST) {
231 * Print the information. If wflag is set p_sockaddr() can return
232 * a wider width then specified and we try to fit the second
233 * address in any remaining space so the flags still lines up.
235 if (rtm->rtm_addrs == RTA_DST) {
236 p_sockaddr(sa, 0, WID_DST + WID_GW + 2);
238 width = p_sockaddr(sa, rtm->rtm_flags, WID_DST);
239 sa = (struct sockaddr *)(ROUNDUP(sa->sa_len) + (char *)sa);
240 p_sockaddr(sa, 0, WID_GW + WID_DST - width);
242 p_flags(rtm->rtm_flags & interesting, "%-6.6s ");
247 * Print address family header before a section of the routing table.
260 afname = "Internet6";
280 printf("\n%s:\n", afname);
282 printf("\nProtocol Family %d:\n", af);
286 p_sockaddr(struct sockaddr *sa, int flags, int width)
291 int len = sizeof(workbuf);
294 switch(sa->sa_family) {
298 struct sockaddr_dl *sdl = (struct sockaddr_dl *)sa;
300 if (sdl->sdl_nlen == 0 && sdl->sdl_alen == 0 &&
301 sdl->sdl_slen == 0) {
302 snprintf(workbuf, sizeof(workbuf),
303 "link#%d", sdl->sdl_index);
305 switch (sdl->sdl_type) {
311 u_char *lla = (u_char *)sdl->sdl_data +
315 for (i = 0; i < sdl->sdl_alen; i++, lla++) {
316 snprintf(cp, len, "%s%02x",
321 break; /* overflow */
337 struct sockaddr_in *in = (struct sockaddr_in *)sa;
339 if (in->sin_addr.s_addr == 0) {
340 /* cp points to workbuf */
341 strncpy(cp, "default", len);
343 cp = (flags & RTF_HOST) ? routename(sa) : netname(sa);
350 struct sockaddr_in6 *in6 = (struct sockaddr_in6 *)sa;
352 if (IN6_IS_ADDR_UNSPECIFIED(&in6->sin6_addr)) {
353 /* cp points to workbuf */
354 strncpy(cp, "default", len);
356 cp = ((flags & RTF_HOST) ? routename(sa)
359 /* make sure numeric address is not truncated */
360 if (strchr(cp, ':') != NULL &&
361 (width < 0 || strlen(cp) > (size_t)width))
369 u_char *s = (u_char *)sa->sa_data, *slim;
371 slim = sa->sa_len + (u_char *) sa;
372 cplim = cp + sizeof(workbuf) - 6;
373 snprintf(cp, len, "(%d)", sa->sa_family);
378 break; /* overflow */
380 while (s < slim && cp < cplim) {
381 snprintf(cp, len, " %02x", *s++);
385 break; /* overflow */
387 snprintf(cp, len, "%02x", *s++);
391 break; /* overflow */
398 count = printf("%s ", cp);
401 count = printf("%-*s ", width, cp);
403 count = printf("%-*.*s ", width, width, cp);
409 p_flags(int f, const char *format)
411 char name[33], *flags;
412 const struct bits *p = bits;
414 for (flags = name; p->b_mask && flags < &name[sizeof(name-2)]; p++) {
419 printf(format, name);