Lines Matching refs:list
10 * Rewritten with rehash code from br_multicast plus single list
335 list_for_each_entry(walker, &old_tbl->walkers, list)
502 struct rhlist_head *list;
517 list = container_of(obj, struct rhlist_head, rhead);
520 RCU_INIT_POINTER(list->next, plist);
522 RCU_INIT_POINTER(list->rhead.next, head);
569 struct rhlist_head *list;
571 list = container_of(obj, struct rhlist_head, rhead);
572 RCU_INIT_POINTER(list->next, NULL);
575 /* bkt is always the head of the list, so it holds
676 list_add(&iter->walker.list, &iter->walker.tbl->walkers);
691 list_del(&iter->walker.list);
724 list_del(&iter->walker.list);
752 /* Need to validate that 'list' is still in the table, and
756 struct rhlist_head *list;
759 for (list = container_of(p, struct rhlist_head, rhead);
760 list;
761 list = rcu_dereference(list->next)) {
763 if (list == iter->list) {
790 struct rhlist_head *list = iter->list;
803 list = container_of(p, struct rhlist_head,
809 list = rcu_dereference(list->next);
810 } while (list);
823 iter->list = list;
824 return rht_obj(ht, rhlist ? &list->rhead : p);
861 struct rhlist_head *list = iter->list;
867 if (!rhlist || !(list = rcu_dereference(list->next))) {
869 list = container_of(p, struct rhlist_head, rhead);
874 iter->list = list;
875 return rht_obj(ht, rhlist ? &list->rhead : p);
900 struct rhlist_head *list = iter->list;
905 return rht_obj(ht, ht->rhlist ? &list->rhead : p);
946 list_add(&iter->walker.list, &tbl->walkers);
1078 * rhltable_init - initialize a new hash list table
1079 * @hlt: hash list table to be initialized
1082 * Initializes a new hash list table.
1100 struct rhlist_head *list;
1107 list = container_of(obj, struct rhlist_head, rhead);
1109 obj = &list->rhead;
1110 list = rht_dereference(list->next, ht);
1112 } while (list);