Lines Matching refs:next
231 struct rhash_head *head, *next, *entry;
244 next = rht_dereference_bucket(entry->next, old_tbl, old_hash);
246 if (rht_is_a_nulls(next))
249 pprev = &entry->next;
262 RCU_INIT_POINTER(entry->next, head);
267 rcu_assign_pointer(*pprev, next);
270 rht_assign_locked(bkt, next);
513 pprev = &head->next;
523 RCU_INIT_POINTER(list->next, plist);
524 head = rht_dereference_bucket(head->next, tbl, hash);
525 RCU_INIT_POINTER(list->rhead.next, head);
570 RCU_INIT_POINTER(obj->next, head);
575 RCU_INIT_POINTER(list->next, NULL);
657 * there are removals in between rhashtable_walk_stop and the next
765 list = rcu_dereference(list->next)) {
782 * __rhashtable_walk_find_next - Find the next element in a table (or the first
811 goto next;
813 list = rcu_dereference(list->next);
823 next:
852 * rhashtable_walk_next - Return the next object and advance the iterator
858 * Returns the next object or NULL when the end of the table is reached.
871 if (!rhlist || !(list = rcu_dereference(list->next))) {
872 p = rcu_dereference(p->next);
882 /* At the end of this slot, switch to next one and then find
883 * next entry from that point.
894 * rhashtable_walk_peek - Return the next object but don't advance the iterator
897 * Returns the next object or NULL when the end of the table is reached.
911 /* No object found in current iter, find next one in the table. */
914 /* A nonzero skip value points to the next entry in the table
1114 list = rht_dereference(list->next, ht);
1148 struct rhash_head *pos, *next;
1152 next = !rht_is_a_nulls(pos) ?
1153 rht_dereference(pos->next, ht) : NULL;
1155 pos = next,
1156 next = !rht_is_a_nulls(pos) ?
1157 rht_dereference(pos->next, ht) : NULL)