iPXE
neighmgmt.c
Go to the documentation of this file.
00001 /*
00002  * Copyright (C) 2013 Michael Brown <mbrown@fensystems.co.uk>.
00003  *
00004  * This program is free software; you can redistribute it and/or
00005  * modify it under the terms of the GNU General Public License as
00006  * published by the Free Software Foundation; either version 2 of the
00007  * License, or any later version.
00008  *
00009  * This program is distributed in the hope that it will be useful, but
00010  * WITHOUT ANY WARRANTY; without even the implied warranty of
00011  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
00012  * General Public License for more details.
00013  *
00014  * You should have received a copy of the GNU General Public License
00015  * along with this program; if not, write to the Free Software
00016  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
00017  * 02110-1301, USA.
00018  *
00019  * You can also choose to distribute this program under the terms of
00020  * the Unmodified Binary Distribution Licence (as given in the file
00021  * COPYING.UBDL), provided that you have satisfied its requirements.
00022  */
00023 
00024 FILE_LICENCE ( GPL2_OR_LATER_OR_UBDL );
00025 
00026 #include <stdio.h>
00027 #include <ipxe/neighbour.h>
00028 #include <usr/neighmgmt.h>
00029 
00030 /** @file
00031  *
00032  * Neighbour management
00033  *
00034  */
00035 
00036 /**
00037  * Print neighbour table
00038  *
00039  */
00040 void nstat ( void ) {
00041         struct neighbour *neighbour;
00042         struct net_device *netdev;
00043         struct ll_protocol *ll_protocol;
00044         struct net_protocol *net_protocol;
00045 
00046         list_for_each_entry ( neighbour, &neighbours, list ) {
00047                 netdev = neighbour->netdev;
00048                 ll_protocol = netdev->ll_protocol;
00049                 net_protocol = neighbour->net_protocol;
00050                 printf ( "%s %s %s is %s %s", netdev->name, net_protocol->name,
00051                          net_protocol->ntoa ( neighbour->net_dest ),
00052                          ll_protocol->name,
00053                          ( neighbour_has_ll_dest ( neighbour ) ?
00054                            ll_protocol->ntoa ( neighbour->ll_dest ) :
00055                            "(incomplete)" ) );
00056                 if ( neighbour->discovery )
00057                         printf ( " (%s)", neighbour->discovery->name );
00058                 printf ( "\n" );
00059         }
00060 }