You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

neighmgmt.c 1.8KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
  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. FILE_LICENCE ( GPL2_OR_LATER_OR_UBDL );
  24. #include <stdio.h>
  25. #include <ipxe/neighbour.h>
  26. #include <usr/neighmgmt.h>
  27. /** @file
  28. *
  29. * Neighbour management
  30. *
  31. */
  32. /**
  33. * Print neighbour table
  34. *
  35. */
  36. void nstat ( void ) {
  37. struct neighbour *neighbour;
  38. struct net_device *netdev;
  39. struct ll_protocol *ll_protocol;
  40. struct net_protocol *net_protocol;
  41. list_for_each_entry ( neighbour, &neighbours, list ) {
  42. netdev = neighbour->netdev;
  43. ll_protocol = netdev->ll_protocol;
  44. net_protocol = neighbour->net_protocol;
  45. printf ( "%s %s %s is %s %s", netdev->name, net_protocol->name,
  46. net_protocol->ntoa ( neighbour->net_dest ),
  47. ll_protocol->name,
  48. ( neighbour_has_ll_dest ( neighbour ) ?
  49. ll_protocol->ntoa ( neighbour->ll_dest ) :
  50. "(incomplete)" ) );
  51. if ( neighbour->discovery )
  52. printf ( " (%s)", neighbour->discovery->name );
  53. printf ( "\n" );
  54. }
  55. }