Lines Matching refs:list
10 * Rewritten with rehash code from br_multicast plus single list
338 list_for_each_entry(walker, &old_tbl->walkers, list)
505 struct rhlist_head *list;
520 list = container_of(obj, struct rhlist_head, rhead);
523 RCU_INIT_POINTER(list->next, plist);
525 RCU_INIT_POINTER(list->rhead.next, head);
572 struct rhlist_head *list;
574 list = container_of(obj, struct rhlist_head, rhead);
575 RCU_INIT_POINTER(list->next, NULL);
578 /* bkt is always the head of the list, so it holds
680 list_add(&iter->walker.list, &iter->walker.tbl->walkers);
695 list_del(&iter->walker.list);
728 list_del(&iter->walker.list);
756 /* Need to validate that 'list' is still in the table, and
760 struct rhlist_head *list;
763 for (list = container_of(p, struct rhlist_head, rhead);
764 list;
765 list = rcu_dereference(list->next)) {
767 if (list == iter->list) {
794 struct rhlist_head *list = iter->list;
807 list = container_of(p, struct rhlist_head,
813 list = rcu_dereference(list->next);
814 } while (list);
827 iter->list = list;
828 return rht_obj(ht, rhlist ? &list->rhead : p);
865 struct rhlist_head *list = iter->list;
871 if (!rhlist || !(list = rcu_dereference(list->next))) {
873 list = container_of(p, struct rhlist_head, rhead);
878 iter->list = list;
879 return rht_obj(ht, rhlist ? &list->rhead : p);
904 struct rhlist_head *list = iter->list;
909 return rht_obj(ht, ht->rhlist ? &list->rhead : p);
950 list_add(&iter->walker.list, &tbl->walkers);
1082 * rhltable_init - initialize a new hash list table
1083 * @hlt: hash list table to be initialized
1086 * Initializes a new hash list table.
1104 struct rhlist_head *list;
1111 list = container_of(obj, struct rhlist_head, rhead);
1113 obj = &list->rhead;
1114 list = rht_dereference(list->next, ht);
1116 } while (list);