netstat.tproj/mroute6.c

   1 /*
   2  * Copyright (C) 1998 WIDE Project.
   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  * 3. Neither the name of the project nor the names of its contributors
  14  *    may be used to endorse or promote products derived from this software
  15  *    without specific prior written permission.
  16  *
  17  * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
  18  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  19  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  20  * ARE DISCLAIMED.  IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
  21  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  22  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  23  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  24  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  25  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  26  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  27  * SUCH DAMAGE.
  28  */
  29
  30 /*
  31  * Copyright (c) 1989 Stephen Deering
  32  * Copyright (c) 1992, 1993
  33  *      The Regents of the University of California.  All rights reserved.
  34  *
  35  * This code is derived from software contributed to Berkeley by
  36  * Stephen Deering of Stanford University.
  37  *
  38  * Redistribution and use in source and binary forms, with or without
  39  * modification, are permitted provided that the following conditions
  40  * are met:
  41  * 1. Redistributions of source code must retain the above copyright
  42  *    notice, this list of conditions and the following disclaimer.
  43  * 2. Redistributions in binary form must reproduce the above copyright
  44  *    notice, this list of conditions and the following disclaimer in the
  45  *    documentation and/or other materials provided with the distribution.
  46  * 3. All advertising materials mentioning features or use of this software
  47  *    must display the following acknowledgement:
  48  *      This product includes software developed by the University of
  49  *      California, Berkeley and its contributors.
  50  * 4. Neither the name of the University nor the names of its contributors
  51  *    may be used to endorse or promote products derived from this software
  52  *    without specific prior written permission.
  53  *
  54  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  55  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  56  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  57  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  58  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  59  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  60  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  61  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  62  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  63  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  64  * SUCH DAMAGE.
  65  *
  66  *      @(#)mroute.c    8.2 (Berkeley) 4/28/95
  67  *      $FreeBSD: src/usr.bin/netstat/mroute6.c,v 1.1.2.5 2001/08/10 09:07:09 ru Exp $
  68  */
  69
  70 #ifdef INET6
  71 #include <sys/param.h>
  72 #include <sys/queue.h>
  73 #include <sys/socket.h>
  74 #include <sys/socketvar.h>
  75 #include <sys/protosw.h>
  76
  77 #include <net/if.h>
  78 #include <net/if_var.h>
  79 #include <net/route.h>
  80
  81 #include <netinet/in.h>
  82
  83 #include <stdio.h>
  84
  85 #define KERNEL 1
  86 #include <netinet6/ip6_mroute.h>
  87 #undef KERNEL
  88
  89 #include "netstat.h"
  90
  91 #define WID_ORG (lflag ? 39 : (nflag ? 29 : 18)) /* width of origin column */
  92 #define WID_GRP (lflag ? 18 : (nflag ? 16 : 18)) /* width of group column */
  93
  94 void
  95 mroute6pr(u_long mfcaddr, u_long mifaddr)
  96 {
  97         struct mf6c *mf6ctable[MF6CTBLSIZ], *mfcp;
  98         struct mif6 mif6table[MAXMIFS];
  99         struct mf6c mfc;
 100         struct rtdetq rte, *rtep;
 101         register struct mif6 *mifp;
 102         register mifi_t mifi;
 103         register int i;
 104         register int banner_printed;
 105         register int saved_nflag;
 106         mifi_t maxmif = 0;
 107         long int waitings;
 108
 109         if (mfcaddr == 0 || mifaddr == 0) {
 110                 printf("No IPv6 multicast routing compiled into this"
 111                        " system.\n");
 112                 return;
 113         }
 114
 115         saved_nflag = nflag;
 116         nflag = 1;
 117
 118         kread(mifaddr, (char *)&mif6table, sizeof(mif6table));
 119         banner_printed = 0;
 120         for (mifi = 0, mifp = mif6table; mifi < MAXMIFS; ++mifi, ++mifp) {
 121                 struct ifnet ifnet;
 122                 char ifname[IFNAMSIZ];
 123
 124                 if (mifp->m6_ifp == NULL)
 125                         continue;
 126
 127                 kread((u_long)mifp->m6_ifp, (char *)&ifnet, sizeof(ifnet));
 128                 maxmif = mifi;
 129                 if (!banner_printed) {
 130                         printf("\nIPv6 Multicast Interface Table\n"
 131                                " Mif   Rate   PhyIF   "
 132                                "Pkts-In   Pkts-Out\n");
 133                         banner_printed = 1;
 134                 }
 135
 136                 printf("  %2u   %4d",
 137                        mifi, mifp->m6_rate_limit);
 138                 printf("   %5s", (mifp->m6_flags & MIFF_REGISTER) ?
 139                        "reg0" : if_indextoname(ifnet.if_index, ifname));
 140
 141                 printf(" %9llu  %9llu\n", (unsigned long long)mifp->m6_pkt_in,
 142                     (unsigned long long)mifp->m6_pkt_out);
 143         }
 144         if (!banner_printed)
 145                 printf("\nIPv6 Multicast Interface Table is empty\n");
 146
 147         kread(mfcaddr, (char *)&mf6ctable, sizeof(mf6ctable));
 148         banner_printed = 0;
 149         for (i = 0; i < MF6CTBLSIZ; ++i) {
 150                 mfcp = mf6ctable[i];
 151                 while(mfcp) {
 152                         kread((u_long)mfcp, (char *)&mfc, sizeof(mfc));
 153                         if (!banner_printed) {
 154                                 printf ("\nIPv6 Multicast Forwarding Cache\n");
 155                                 printf(" %-*.*s %-*.*s %s",
 156                                        WID_ORG, WID_ORG, "Origin",
 157                                        WID_GRP, WID_GRP, "Group",
 158                                        "  Packets Waits In-Mif  Out-Mifs\n");
 159                                 banner_printed = 1;
 160                         }
 161
 162                         printf(" %-*.*s", WID_ORG, WID_ORG,
 163                                routename6(&mfc.mf6c_origin));
 164                         printf(" %-*.*s", WID_GRP, WID_GRP,
 165                                routename6(&mfc.mf6c_mcastgrp));
 166                         printf(" %9llu", (unsigned long long)mfc.mf6c_pkt_cnt);
 167
 168                         for (waitings = 0, rtep = mfc.mf6c_stall; rtep; ) {
 169                                 waitings++;
 170                                 kread((u_long)rtep, (char *)&rte, sizeof(rte));
 171                                 rtep = rte.next;
 172                         }
 173                         printf("   %3ld", waitings);
 174
 175                         if (mfc.mf6c_parent == MF6C_INCOMPLETE_PARENT)
 176                                 printf(" ---   ");
 177                         else
 178                                 printf("  %3d   ", mfc.mf6c_parent);
 179                         for (mifi = 0; mifi <= maxmif; mifi++) {
 180                                 if (IF_ISSET(mifi, &mfc.mf6c_ifset))
 181                                         printf(" %u", mifi);
 182                         }
 183                         printf("\n");
 184
 185                         mfcp = mfc.mf6c_next;
 186                 }
 187         }
 188         if (!banner_printed)
 189                 printf("\nIPv6 Multicast Routing Table is empty\n");
 190
 191         printf("\n");
 192         nflag = saved_nflag;
 193 }
 194
 195 void
 196 mrt6_stats(u_long mstaddr)
 197 {
 198         struct mrt6stat mrtstat;
 199
 200         if (mstaddr == 0) {
 201                 printf("No IPv6 multicast routing compiled into this"
 202                        "system.\n");
 203                 return;
 204         }
 205
 206         kread(mstaddr, (char *)&mrtstat, sizeof(mrtstat));
 207         printf("IPv6 multicast forwarding:\n");
 208         printf(" %10llu multicast forwarding cache lookup%s\n",
 209             (unsigned long long)mrtstat.mrt6s_mfc_lookups,
 210             plural(mrtstat.mrt6s_mfc_lookups));
 211         printf(" %10llu multicast forwarding cache miss%s\n",
 212             (unsigned long long)mrtstat.mrt6s_mfc_misses,
 213             plurales(mrtstat.mrt6s_mfc_misses));
 214         printf(" %10llu upcall%s to mrouted\n",
 215             (unsigned long long)mrtstat.mrt6s_upcalls,
 216             plural(mrtstat.mrt6s_upcalls));
 217         printf(" %10llu upcall llueue overflow%s\n",
 218             (unsigned long long)mrtstat.mrt6s_upq_ovflw,
 219             plural(mrtstat.mrt6s_upq_ovflw));
 220         printf(" %10llu upcall%s dropped due to full socket buffer\n",
 221             (unsigned long long)mrtstat.mrt6s_upq_sockfull,
 222             plural(mrtstat.mrt6s_upq_sockfull));
 223         printf(" %10llu cache cleanup%s\n",
 224             (unsigned long long)mrtstat.mrt6s_cache_cleanups,
 225             plural(mrtstat.mrt6s_cache_cleanups));
 226         printf(" %10llu datagram%s with no route for origin\n",
 227             (unsigned long long)mrtstat.mrt6s_no_route,
 228             plural(mrtstat.mrt6s_no_route));
 229         printf(" %10llu datagram%s arrived with bad tunneling\n",
 230             (unsigned long long)mrtstat.mrt6s_bad_tunnel,
 231             plural(mrtstat.mrt6s_bad_tunnel));
 232         printf(" %10llu datagram%s could not be tunneled\n",
 233             (unsigned long long)mrtstat.mrt6s_cant_tunnel,
 234             plural(mrtstat.mrt6s_cant_tunnel));
 235         printf(" %10llu datagram%s arrived on wrong interface\n",
 236             (unsigned long long)mrtstat.mrt6s_wrong_if,
 237             plural(mrtstat.mrt6s_wrong_if));
 238         printf(" %10llu datagram%s selectively dropped\n",
 239             (unsigned long long)mrtstat.mrt6s_drop_sel,
 240             plural(mrtstat.mrt6s_drop_sel));
 241         printf(" %10llu datagram%s dropped due to llueue overflow\n",
 242             (unsigned long long)mrtstat.mrt6s_q_overflow,
 243             plural(mrtstat.mrt6s_q_overflow));
 244         printf(" %10llu datagram%s dropped for being too large\n",
 245             (unsigned long long)mrtstat.mrt6s_pkt2large,
 246             plural(mrtstat.mrt6s_pkt2large));
 247 }
 248 #endif /*INET6*/