Lines Matching refs:next
231 struct rhash_head *head, *next, *entry;
243 next = rht_dereference_bucket(entry->next, old_tbl, old_hash);
245 if (rht_is_a_nulls(next))
248 pprev = &entry->next;
260 RCU_INIT_POINTER(entry->next, head);
265 rcu_assign_pointer(*pprev, next);
268 rht_assign_locked(bkt, next);
510 pprev = &head->next;
520 RCU_INIT_POINTER(list->next, plist);
521 head = rht_dereference_bucket(head->next, tbl, hash);
522 RCU_INIT_POINTER(list->rhead.next, head);
567 RCU_INIT_POINTER(obj->next, head);
572 RCU_INIT_POINTER(list->next, NULL);
653 * there are removals in between rhashtable_walk_stop and the next
761 list = rcu_dereference(list->next)) {
778 * __rhashtable_walk_find_next - Find the next element in a table (or the first
807 goto next;
809 list = rcu_dereference(list->next);
819 next:
848 * rhashtable_walk_next - Return the next object and advance the iterator
854 * Returns the next object or NULL when the end of the table is reached.
867 if (!rhlist || !(list = rcu_dereference(list->next))) {
868 p = rcu_dereference(p->next);
878 /* At the end of this slot, switch to next one and then find
879 * next entry from that point.
890 * rhashtable_walk_peek - Return the next object but don't advance the iterator
893 * Returns the next object or NULL when the end of the table is reached.
907 /* No object found in current iter, find next one in the table. */
910 /* A nonzero skip value points to the next entry in the table
1110 list = rht_dereference(list->next, ht);
1144 struct rhash_head *pos, *next;
1148 next = !rht_is_a_nulls(pos) ?
1149 rht_dereference(pos->next, ht) : NULL;
1151 pos = next,
1152 next = !rht_is_a_nulls(pos) ?
1153 rht_dereference(pos->next, ht) : NULL)