Nest: Get hash chain is not deprecated, it is still useful

diff --git a/nest/route.h b/nest/route.h
index 61b30f6e9a847670e4df1cf1ab24f1316135f0f2..cb0a70836885c83f7ca060613b72613e85fc9807 100644 (file)
--- a/nest/route.h
+++ b/nest/route.h
@@ -79,7 +79,7 @@ static inline struct fib_node * fib_user_to_node(struct fib *f, void *e)
 
 void fib_init(struct fib *f, pool *p, uint addr_type, uint node_size, uint node_offset, uint hash_order, fib_init_fn init);
 void *fib_find(struct fib *, const net_addr *);        /* Find or return NULL if doesn't exist */
-void *fib_get_chain(struct fib *f, const net_addr *a) DEPRECATED; /* Find first node in linked list from hash table */
+void *fib_get_chain(struct fib *f, const net_addr *a); /* Find first node in linked list from hash table */
 void *fib_get(struct fib *, const net_addr *); /* Find or create new if nonexistent */
 void *fib_route(struct fib *, const net_addr *); /* Longest-match routing lookup */
 void fib_delete(struct fib *, void *); /* Remove fib entry */

diff --git a/nest/rt-table.c b/nest/rt-table.c
index 3db7d8a775ff20864b24c997cb862a2266123728..5a0ef91434db7c74178d73cf8eec4f7c0901a390 100644 (file)
--- a/nest/rt-table.c
+++ b/nest/rt-table.c
@@ -101,7 +101,6 @@ net_route_ip6_sadr(rtable *t, net_addr_ip6_sadr *n)
        match with the smallest matching src prefix. */
     for (fn = fib_get_chain(&t->fib, (net_addr *) n); fn; fn = fn->next)
     {
-      /* TODO: This may be more effectively done by searching in the redblack tree. */
       net_addr_ip6_sadr *a = (void *) fn->addr;
 
       if (net_equal_dst_ip6_sadr(n, a) &&