215 	p = delayed_root->node_list.next;  in btrfs_first_delayed_node()
229 	struct btrfs_delayed_node *next = NULL;  in btrfs_next_delayed_node()  local
237 		p = delayed_root->node_list.next;  in btrfs_next_delayed_node()
241 		p = node->n_list.next;  in btrfs_next_delayed_node()
243 	next = list_entry(p, struct btrfs_delayed_node, n_list);  in btrfs_next_delayed_node()
244 	refcount_inc(&next->refs);  in btrfs_next_delayed_node()
248 	return next;  in btrfs_next_delayed_node()
300 	p = delayed_root->prepare_list.next;  in btrfs_first_prepared_delayed_node()
344 				struct btrfs_delayed_item **next)  in __btrfs_lookup_delayed_item()  argument
377 	if (next) {  in __btrfs_lookup_delayed_item()
379 			*next = NULL;  in __btrfs_lookup_delayed_item()
381 			*next = delayed_item;  in __btrfs_lookup_delayed_item()
383 			*next = rb_entry(node, struct btrfs_delayed_item,  in __btrfs_lookup_delayed_item()
386 			*next = NULL;  in __btrfs_lookup_delayed_item()
538 	struct btrfs_delayed_item *next = NULL;  in __btrfs_next_delayed_item()  local
542 		next = rb_entry(p, struct btrfs_delayed_item, rb_node);  in __btrfs_next_delayed_item()
544 	return next;  in __btrfs_next_delayed_item()
684 	struct btrfs_delayed_item *next;  in btrfs_insert_delayed_item()  local
701 		next = __btrfs_next_delayed_item(curr);  in btrfs_insert_delayed_item()
702 		if (!next || !btrfs_is_continuous_delayed_item(curr, next))  in btrfs_insert_delayed_item()
705 		next_size = next->data_len + sizeof(struct btrfs_item);  in btrfs_insert_delayed_item()
709 		list_add_tail(&next->tree_list, &batch);  in btrfs_insert_delayed_item()
712 		curr = next;  in btrfs_insert_delayed_item()
757 	list_for_each_entry_safe(curr, next, &batch, tree_list) {  in btrfs_insert_delayed_item()
795 	struct btrfs_delayed_item *curr, *next;  in btrfs_batch_delete_items()  local
811 	next = item;  in btrfs_batch_delete_items()
818 	while (btrfs_comp_cpu_keys(&next->key, &key) == 0) {  in btrfs_batch_delete_items()
819 		list_add_tail(&next->tree_list, &head);  in btrfs_batch_delete_items()
822 		curr = next;  in btrfs_batch_delete_items()
823 		next = __btrfs_next_delayed_item(curr);  in btrfs_batch_delete_items()
824 		if (!next)  in btrfs_batch_delete_items()
827 		if (!btrfs_is_continuous_delayed_item(curr, next))  in btrfs_batch_delete_items()
843 	list_for_each_entry_safe(curr, next, &head, tree_list) {  in btrfs_batch_delete_items()
1567 	struct btrfs_delayed_item *curr, *next;  in btrfs_readdir_put_delayed_items()  local
1569 	list_for_each_entry_safe(curr, next, ins_list, readdir_list) {  in btrfs_readdir_put_delayed_items()
1575 	list_for_each_entry_safe(curr, next, del_list, readdir_list) {  in btrfs_readdir_put_delayed_items()
1613 	struct btrfs_delayed_item *curr, *next;  in btrfs_readdir_delayed_dir_index()  local
1628 	list_for_each_entry_safe(curr, next, ins_list, readdir_list) {  in btrfs_readdir_delayed_dir_index()