Lines Matching defs:cur
2121 u32 cur;
2156 for (cur = 0; cur < btrfs_item_size(eb, item); cur += len) {
2161 cur, found_key.objectid,
2677 struct btrfs_backref_node *cur)
2689 cur->is_reloc_root = 1;
2692 root = find_reloc_root(cache->fs_info, cur->bytenr);
2695 cur->root = root;
2701 list_add(&cur->list, &cache->useless_node);
2714 cur->level + 1);
2731 btrfs_backref_link_edge(edge, cur, upper, LINK_LOWER);
2751 struct btrfs_backref_node *cur)
2768 cur->cowonly = 1;
2770 if (btrfs_root_level(&root->root_item) == cur->level) {
2772 ASSERT(btrfs_root_bytenr(&root->root_item) == cur->bytenr);
2785 list_add(&cur->list, &cache->useless_node);
2787 cur->root = root;
2792 level = cur->level + 1;
2808 if (btrfs_node_blockptr(eb, path->slots[level]) != cur->bytenr) {
2811 cur->bytenr, level - 1, root->root_key.objectid,
2817 lower = cur;
2903 * Add backref node @cur into @cache.
2905 * NOTE: Even if the function returned 0, @cur is not yet cached as its upper
2917 struct btrfs_backref_node *cur)
2924 ret = btrfs_backref_iter_start(iter, cur->bytenr);
2941 WARN_ON(cur->checked);
2942 if (!list_empty(&cur->upper)) {
2947 ASSERT(list_is_singular(&cur->upper));
2948 edge = list_entry(cur->upper.next, struct btrfs_backref_edge,
3005 ret = handle_direct_tree_backref(cache, &key, cur);
3024 cur);
3029 cur->checked = 1;