Lines Matching defs:next
24 struct extent_inode_elem *next;
57 e->next = *eie;
70 eie_next = eie->next;
253 while (eie && eie->next)
254 eie = eie->next;
259 eie->next = newref->inode_list;
453 * For these cases, go to the next leaf before we continue.
492 goto next;
502 goto next;
511 goto next;
517 while (old->next)
518 old = old->next;
519 old->next = eie;
523 next:
911 * reference we may find next a BTRFS_DROP_DELAYED_REF
1423 while (eie->next)
1424 eie = eie->next;
1425 eie->next = ref->inode_list;
1657 * next INODE_REF_KEY_V2 item. In the case
1857 * if more refs exist, 0 is returned and the next call to
1859 * next ref. after the last ref was processed, 1 is returned.
1970 for (eie = inode_list; eie; eie = eie->next) {
2484 * Go to the next backref item of current bytenr, can be either inlined or
2489 * Return 0 if we get next backref without problem.
2525 /* We're at keyed items, there is no inline item, go to the next one */
2610 edge = list_entry(node->upper.next, struct btrfs_backref_edge,
2639 node = list_entry(cache->detached.next,
2645 node = list_entry(cache->leaves.next,
2948 edge = list_entry(cur->upper.next, struct btrfs_backref_edge,