Lines Matching defs:next
1582 async_extent = list_entry(async_chunk->extents.next,
1737 sums = list_entry(list.next, struct btrfs_ordered_sum, list);
2024 /* Go to next leaf if we have exhausted the current one */
2083 * the next extent.
2104 * be COWed. It will be written out before the next
2628 goto next;
2639 next:
4824 * or btrfs_update_inode() will be called, which guarantee that the next
4927 goto next;
4948 next:
5302 * the tree. They will be cleaned up on the next mount. If the inode
5321 * the tree and we'll retry on the next mount. Again, we might also want
5799 /* index_cnt is the index number of next new entry, so decrement it. */
6691 * the end of an inline extent and the beginning of the next block, so we
6829 goto next;
6852 next:
6871 goto next;
7991 goto next;
7998 * the ordered extent in the next iteration.
8002 goto next;
8016 goto next;
8055 next:
8349 * We want to drop from the next block forward in case this new
8439 * If no extents were dropped or trimmed we don't need to force the next
9252 struct btrfs_delalloc_work *work, *next;
9262 binode = list_entry(splice.next, struct btrfs_inode,
9304 list_for_each_entry_safe(work, next, &works, list) {
9634 goto next;
9649 next:
10494 struct rb_node *node, *next;
10499 next = rb_next(node);
10510 node = next;