Searched refs:entry_tree (Results 1 – 2 of 2) sorted by relevance
83 struct rb_node *node = eht_set->entry_tree.rb_node; in br_multicast_eht_set_entry_lookup()155 WARN_ON(!RB_EMPTY_ROOT(&eht_set->entry_tree)); in br_multicast_destroy_eht_set()166 rb_erase(&set_h->rb_node, &set_h->eht_set->entry_tree); in __eht_del_set_entry()184 while ((node = rb_first(&eht_set->entry_tree))) { in br_multicast_del_eht_set()289 struct rb_node **link = &eht_set->entry_tree.rb_node, *parent = NULL; in __eht_lookup_create_set_entry()327 rb_insert_color(&set_h->rb_node, &eht_set->entry_tree); in __eht_lookup_create_set_entry()368 eht_set->entry_tree = RB_ROOT; in __eht_lookup_create_set()456 if (RB_EMPTY_ROOT(&eht_set->entry_tree)) in br_multicast_create_eht_set_entry()478 if (RB_EMPTY_ROOT(&eht_set->entry_tree)) { in br_multicast_del_eht_set_entry()
45 struct rb_root entry_tree; member