Lines Matching defs:next
32 struct extent_inode_elem *next;
85 e->next = *eie;
99 eie_next = eie->next;
306 while (eie && eie->next)
307 eie = eie->next;
312 eie->next = newref->inode_list;
506 * For these cases, go to the next leaf before we continue.
545 goto next;
555 goto next;
563 goto next;
569 while (old->next)
570 old = old->next;
571 old->next = eie;
575 next:
964 * reference we may find next a BTRFS_DROP_DELAYED_REF
1665 while (eie->next)
1666 eie = eie->next;
1667 eie->next = ref->inode_list;
2078 * next INODE_REF_KEY_V2 item. In the case
2274 * if more refs exist, 0 is returned and the next call to
2276 * next ref. after the last ref was processed, 1 is returned.
2387 for (eie = inode_list; eie; eie = eie->next) {
2939 * Go to the next backref item of current bytenr, can be either inlined or
2944 * Return 0 if we get next backref without problem.
2981 /* We're at keyed items, there is no inline item, go to the next one */
3067 edge = list_entry(node->upper.next, struct btrfs_backref_edge,
3096 node = list_entry(cache->detached.next,
3102 node = list_entry(cache->leaves.next,
3408 edge = list_entry(cur->upper.next, struct btrfs_backref_edge,