src/usr/neighmgmt.c

   1 /*
   2  * Copyright (C) 2013 Michael Brown <mbrown@fensystems.co.uk>.
   3  *
   4  * This program is free software; you can redistribute it and/or
   5  * modify it under the terms of the GNU General Public License as
   6  * published by the Free Software Foundation; either version 2 of the
   7  * License, or any later version.
   8  *
   9  * This program is distributed in the hope that it will be useful, but
  10  * WITHOUT ANY WARRANTY; without even the implied warranty of
  11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  12  * General Public License for more details.
  13  *
  14  * You should have received a copy of the GNU General Public License
  15  * along with this program; if not, write to the Free Software
  16  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
  17  * 02110-1301, USA.
  18  *
  19  * You can also choose to distribute this program under the terms of
  20  * the Unmodified Binary Distribution Licence (as given in the file
  21  * COPYING.UBDL), provided that you have satisfied its requirements.
  22  */
  23
  24 FILE_LICENCE ( GPL2_OR_LATER_OR_UBDL );
  25
  26 #include <stdio.h>
  27 #include <ipxe/neighbour.h>
  28 #include <usr/neighmgmt.h>
  29
  30 /** @file
  31  *
  32  * Neighbour management
  33  *
  34  */
  35
  36 /**
  37  * Print neighbour table
  38  *
  39  */
  40 void nstat ( void ) {
  41         struct neighbour *neighbour;
  42         struct net_device *netdev;
  43         struct ll_protocol *ll_protocol;
  44         struct net_protocol *net_protocol;
  45
  46         list_for_each_entry ( neighbour, &neighbours, list ) {
  47                 netdev = neighbour->netdev;
  48                 ll_protocol = netdev->ll_protocol;
  49                 net_protocol = neighbour->net_protocol;
  50                 printf ( "%s %s %s is %s %s", netdev->name, net_protocol->name,
  51                          net_protocol->ntoa ( neighbour->net_dest ),
  52                          ll_protocol->name,
  53                          ( neighbour_has_ll_dest ( neighbour ) ?
  54                            ll_protocol->ntoa ( neighbour->ll_dest ) :
  55                            "(incomplete)" ) );
  56                 if ( neighbour->discovery )
  57                         printf ( " (%s)", neighbour->discovery->name );
  58                 printf ( "\n" );
  59         }
  60 }