lib/zebra: convert vrf_list to a red-black tree

Since we're already using a red-black tree to store VRFs sorted by their
vrf_id's, create a new tree to store VRFs sorted by their names.

The biggest advantage of doing this is that we reduce the time complexity
of vrf_list_lookup_by_name() from O(n) to O(log n).

Signed-off-by: Renato Westphal <renato@opensourcerouting.org>

1 files changed, 4 insertions, 2 deletions

diff --git a/lib/vrf.h b/lib/vrf.h
index 4ee871b33..9dfaae21f 100644
--- a/lib/vrf.h
+++ b/lib/vrf.h
@@ -70,7 +70,7 @@ enum {
 
 struct vrf
 {
-  RB_ENTRY(vrf) id_entry;
+  RB_ENTRY(vrf) id_entry, name_entry;
 
   /* Identifier, same as the vector index */
   vrf_id_t vrf_id;
@@ -92,11 +92,13 @@ struct vrf
 };
 RB_HEAD (vrf_id_head, vrf);
 RB_PROTOTYPE (vrf_id_head, vrf, id_entry, vrf_id_compare)
+RB_HEAD (vrf_name_head, vrf);
+RB_PROTOTYPE (vrf_name_head, vrf, name_entry, vrf_name_compare)
 DECLARE_QOBJ_TYPE(vrf)
 
 
 extern struct vrf_id_head vrfs_by_id;
-extern struct list *vrf_list;
+extern struct vrf_name_head vrfs_by_name;
 
 /*
  * Add a specific hook to VRF module.