Added fib_route() which does (although very slow) lookup of longest-match

routing in a FIB.

1 files changed, 17 insertions, 0 deletions

diff --git a/nest/rt-fib.c b/nest/rt-fib.c
index 22ba2ff6..6a5d1361 100644
--- a/nest/rt-fib.c
+++ b/nest/rt-fib.c
@@ -152,6 +152,23 @@ fib_get(struct fib *f, ip_addr *a, int len)
   return e;
 }
 
+void *
+fib_route(struct fib *f, ip_addr a, int len)
+{
+  ip_addr a0;
+  void *t;
+
+  while (len >= 0)
+    {
+      a0 = ipa_and(a, ipa_mkmask(len));
+      t = fib_find(f, &a0, len);
+      if (t)
+	return t;
+      len--;
+    }
+  return NULL;
+}
+
 static inline void
 fib_merge_readers(struct fib_iterator *i, struct fib_node *to)
 {