Lines Matching defs:cur
2585 u32 cur;
2620 for (cur = 0; cur < btrfs_item_size(eb, slot); cur += len) {
2625 cur, found_key.objectid,
3134 struct btrfs_backref_node *cur)
3146 cur->is_reloc_root = 1;
3149 root = find_reloc_root(cache->fs_info, cur->bytenr);
3152 cur->root = root;
3158 list_add(&cur->list, &cache->useless_node);
3171 cur->level + 1);
3188 btrfs_backref_link_edge(edge, cur, upper, LINK_LOWER);
3210 struct btrfs_backref_node *cur)
3227 cur->cowonly = 1;
3229 if (btrfs_root_level(&root->root_item) == cur->level) {
3231 ASSERT(btrfs_root_bytenr(&root->root_item) == cur->bytenr);
3244 list_add(&cur->list, &cache->useless_node);
3246 cur->root = root;
3251 level = cur->level + 1;
3267 if (btrfs_node_blockptr(eb, path->slots[level]) != cur->bytenr) {
3270 cur->bytenr, level - 1, root->root_key.objectid,
3276 lower = cur;
3362 * Add backref node @cur into @cache.
3364 * NOTE: Even if the function returned 0, @cur is not yet cached as its upper
3378 struct btrfs_backref_node *cur)
3384 ret = btrfs_backref_iter_start(iter, cur->bytenr);
3401 WARN_ON(cur->checked);
3402 if (!list_empty(&cur->upper)) {
3407 ASSERT(list_is_singular(&cur->upper));
3408 edge = list_entry(cur->upper.next, struct btrfs_backref_edge,
3465 ret = handle_direct_tree_backref(cache, &key, cur);
3475 &key, node_key, cur);
3485 cur->checked = 1;