table: NameTree::findLongestPrefixMatch predicate
refs #1313
Change-Id: I759c8ddf9bc0fe5b970c979f69131a98b1ef32e4
diff --git a/daemon/table/fib.hpp b/daemon/table/fib.hpp
index 166eb1b..0399833 100644
--- a/daemon/table/fib.hpp
+++ b/daemon/table/fib.hpp
@@ -66,9 +66,16 @@
size() const;
private:
- shared_ptr<fib::Entry> m_rootEntry;
NameTree& m_nameTree;
- size_t m_nItems; // Number of items being stored
+ size_t m_nItems;
+
+ /** \brief The empty FIB entry.
+ *
+ * This entry has no nexthops.
+ * It is returned by findLongestPrefixMatch if nothing is matched.
+ */
+ // Returning empty entry instead of nullptr makes forwarding and strategy implementation easier.
+ static const shared_ptr<fib::Entry> m_emptyEntry;
};
inline size_t