- Rewrote whole interface logic. Removed support for multiple addresses per

  interface since it makes much trouble everywhere. Instead, we understand
  secondary addresses as subinterfaces.

- In case interface addresses or basic flags change, we simply convert it
  to a down/up sequence.

- Implemented the universal neighbour cache. (Just forget what did previous
  includes say of neighbour caching, this one is brand new.)

1 files changed, 1 insertions, 19 deletions

diff --git a/nest/route.h b/nest/route.h
index 255d31a5..f00dded7 100644
--- a/nest/route.h
+++ b/nest/route.h
@@ -13,6 +13,7 @@
 #include "lib/timer.h"
 
 struct protocol;
+struct proto;
 
 /*
  *	Generic data structure for storing network prefixes. Also used
@@ -61,25 +62,6 @@ void fib_free(struct fib *);		/* Destroy the fib */
 	} while (0)
 
 /*
- *	Neighbor Cache. We hold (direct neighbor, protocol) pairs we've seen
- *	along with pointer to protocol-specific data.
- *
- *	The primary goal of this cache is to quickly validate all incoming
- *	packets if their have been sent by our neighbors and to notify
- *	protocols about lost neighbors when an interface goes down.
- */
-
-typedef struct neighbor {
-  ip_addr addr;				/* Address of the neighbor */
-  struct next *next;			/* Next in hashed chain */
-  struct next *sibling;			/* Next in per-device chain */
-  struct proto *proto;			/* Protocol this belongs to */
-  void *data;				/* Protocol-specific data */
-} neighbor;
-
-neighbor *neigh_find(ip_addr *);	/* NULL if not a neighbor */
-
-/*
  *	Master Routing Tables. Generally speaking, each of them is a list
  *	of FIB (one per TOS) with each entry pointing to a list of route entries
  *	representing routes to given network.