Lines Matching full:wc
5234 * @wc: the walk control for this deletion
5236 * @refs: the number of refs for wc->level - 1
5237 * @flags: the flags for wc->level - 1
5241 * wc->level should be read and walked into, or if we can simply delete our
5249 static bool visit_node_for_delete(struct btrfs_root *root, struct walk_control *wc, in visit_node_for_delete() argument
5254 int level = wc->level; in visit_node_for_delete()
5257 ASSERT(wc->refs[level - 1] > 0); in visit_node_for_delete()
5263 if (wc->stage == UPDATE_BACKREF) { in visit_node_for_delete()
5273 if (wc->refs[level - 1] == 1) in visit_node_for_delete()
5288 if (!wc->update_ref || generation <= btrfs_root_origin_generation(root)) in visit_node_for_delete()
5296 if (btrfs_comp_cpu_keys(&key, &wc->update_progress) < 0) in visit_node_for_delete()
5305 struct walk_control *wc, in reada_walk_down() argument
5319 if (path->slots[wc->level] < wc->reada_slot) { in reada_walk_down()
5320 wc->reada_count = wc->reada_count * 2 / 3; in reada_walk_down()
5321 wc->reada_count = max(wc->reada_count, 2); in reada_walk_down()
5323 wc->reada_count = wc->reada_count * 3 / 2; in reada_walk_down()
5324 wc->reada_count = min_t(int, wc->reada_count, in reada_walk_down()
5328 eb = path->nodes[wc->level]; in reada_walk_down()
5331 for (slot = path->slots[wc->level]; slot < nritems; slot++) { in reada_walk_down()
5332 if (nread >= wc->reada_count) in reada_walk_down()
5339 if (slot == path->slots[wc->level]) in reada_walk_down()
5342 if (wc->stage == UPDATE_BACKREF && in reada_walk_down()
5348 wc->level - 1, 1, &refs, in reada_walk_down()
5364 if (!visit_node_for_delete(root, wc, eb, flags, slot)) in reada_walk_down()
5370 wc->reada_slot = slot; in reada_walk_down()
5376 * when wc->stage == UPDATE_BACKREF, this function updates
5384 struct walk_control *wc) in walk_down_proc() argument
5387 int level = wc->level; in walk_down_proc()
5392 if (wc->stage == UPDATE_BACKREF && btrfs_header_owner(eb) != btrfs_root_id(root)) in walk_down_proc()
5399 if (wc->lookup_info && in walk_down_proc()
5400 ((wc->stage == DROP_REFERENCE && wc->refs[level] != 1) || in walk_down_proc()
5401 (wc->stage == UPDATE_BACKREF && !(wc->flags[level] & flag)))) { in walk_down_proc()
5405 &wc->refs[level], in walk_down_proc()
5406 &wc->flags[level], in walk_down_proc()
5410 if (unlikely(wc->refs[level] == 0)) { in walk_down_proc()
5417 if (wc->stage == DROP_REFERENCE) { in walk_down_proc()
5418 if (wc->refs[level] > 1) in walk_down_proc()
5421 if (path->locks[level] && !wc->keep_locks) { in walk_down_proc()
5428 /* wc->stage == UPDATE_BACKREF */ in walk_down_proc()
5429 if (!(wc->flags[level] & flag)) { in walk_down_proc()
5446 wc->flags[level] |= flag; in walk_down_proc()
5532 struct walk_control *wc, in check_next_block_uptodate() argument
5537 int level = wc->level; in check_next_block_uptodate()
5555 reada_walk_down(trans, root, wc, path); in check_next_block_uptodate()
5562 wc->lookup_info = 1; in check_next_block_uptodate()
5567 * If we determine that we don't have to visit wc->level - 1 then we need to
5577 struct btrfs_path *path, struct walk_control *wc, in maybe_drop_reference() argument
5587 int level = wc->level; in maybe_drop_reference()
5591 if (wc->stage == UPDATE_BACKREF) in maybe_drop_reference()
5594 if (wc->flags[level] & BTRFS_BLOCK_FLAG_FULL_BACKREF) { in maybe_drop_reference()
5610 if (wc->restarted) { in maybe_drop_reference()
5616 wc->restarted = 0; in maybe_drop_reference()
5625 wc->refs[level - 1] > 1) { in maybe_drop_reference()
5643 wc->drop_level = level; in maybe_drop_reference()
5644 find_next_key(path, level, &wc->drop_progress); in maybe_drop_reference()
5653 * when wc->stage == DROP_REFERENCE, this function checks
5656 * rooted at the block, this function changes wc->stage to
5666 struct walk_control *wc) in do_walk_down() argument
5673 int level = wc->level; in do_walk_down()
5683 if (wc->stage == UPDATE_BACKREF && in do_walk_down()
5685 wc->lookup_info = 1; in do_walk_down()
5699 &wc->refs[level - 1], in do_walk_down()
5700 &wc->flags[level - 1], in do_walk_down()
5705 if (unlikely(wc->refs[level - 1] == 0)) { in do_walk_down()
5711 wc->lookup_info = 0; in do_walk_down()
5714 if (!visit_node_for_delete(root, wc, path->nodes[level], in do_walk_down()
5715 wc->flags[level - 1], path->slots[level])) in do_walk_down()
5723 if (wc->stage == DROP_REFERENCE && wc->refs[level - 1] > 1) { in do_walk_down()
5724 wc->stage = UPDATE_BACKREF; in do_walk_down()
5725 wc->shared_level = level - 1; in do_walk_down()
5728 ret = check_next_block_uptodate(trans, root, path, wc, next); in do_walk_down()
5742 wc->level = level; in do_walk_down()
5743 if (wc->level == 1) in do_walk_down()
5744 wc->reada_slot = 0; in do_walk_down()
5747 ret = maybe_drop_reference(trans, root, path, wc, next, owner_root); in do_walk_down()
5750 wc->refs[level - 1] = 0; in do_walk_down()
5751 wc->flags[level - 1] = 0; in do_walk_down()
5752 wc->lookup_info = 1; in do_walk_down()
5765 * when wc->stage == DROP_REFERENCE, this function drops
5768 * when wc->stage == UPDATE_BACKREF, this function changes
5769 * wc->stage back to DROP_REFERENCE if we changed wc->stage
5777 struct walk_control *wc) in walk_up_proc() argument
5781 int level = wc->level; in walk_up_proc()
5785 if (wc->stage == UPDATE_BACKREF) { in walk_up_proc()
5786 ASSERT(wc->shared_level >= level); in walk_up_proc()
5787 if (level < wc->shared_level) in walk_up_proc()
5790 ret = find_next_key(path, level + 1, &wc->update_progress); in walk_up_proc()
5792 wc->update_ref = 0; in walk_up_proc()
5794 wc->stage = DROP_REFERENCE; in walk_up_proc()
5795 wc->shared_level = -1; in walk_up_proc()
5810 &wc->refs[level], in walk_up_proc()
5811 &wc->flags[level], in walk_up_proc()
5818 if (unlikely(wc->refs[level] == 0)) { in walk_up_proc()
5824 if (wc->refs[level] == 1) { in walk_up_proc()
5832 /* wc->stage == DROP_REFERENCE */ in walk_up_proc()
5833 ASSERT(path->locks[level] || wc->refs[level] == 1); in walk_up_proc()
5835 if (wc->refs[level] == 1) { in walk_up_proc()
5837 if (wc->flags[level] & BTRFS_BLOCK_FLAG_FULL_BACKREF) in walk_up_proc()
5863 if (wc->flags[level] & BTRFS_BLOCK_FLAG_FULL_BACKREF) in walk_up_proc()
5868 if (wc->flags[level + 1] & BTRFS_BLOCK_FLAG_FULL_BACKREF) in walk_up_proc()
5876 wc->refs[level] == 1); in walk_up_proc()
5880 wc->refs[level] = 0; in walk_up_proc()
5881 wc->flags[level] = 0; in walk_up_proc()
5894 * wc->level. At this point path->nodes[wc->level] should be populated and
5903 * our current path->nodes[wc->level]. For DROP_REFERENCE that means dropping
5914 struct walk_control *wc) in walk_down_tree() argument
5916 int level = wc->level; in walk_down_tree()
5919 wc->lookup_info = 1; in walk_down_tree()
5921 ret = walk_down_proc(trans, root, path, wc); in walk_down_tree()
5932 ret = do_walk_down(trans, root, path, wc); in walk_down_tree()
5938 level = wc->level; in walk_down_tree()
5949 * UPDATE_BACKREF. If we wc->level is currently less than our wc->shared_level
5952 * wc->shared_level. Once we're at or above our wc->shared_level we can switch
5963 struct walk_control *wc, int max_level) in walk_up_tree() argument
5965 int level = wc->level; in walk_up_tree()
5970 wc->level = level; in walk_up_tree()
5976 ret = walk_up_proc(trans, root, path, wc); in walk_up_tree()
6016 struct walk_control *wc; in btrfs_drop_snapshot() local
6032 wc = kzalloc(sizeof(*wc), GFP_NOFS); in btrfs_drop_snapshot()
6033 if (!wc) { in btrfs_drop_snapshot()
6072 memset(&wc->update_progress, 0, in btrfs_drop_snapshot()
6073 sizeof(wc->update_progress)); in btrfs_drop_snapshot()
6076 memcpy(&wc->update_progress, &key, in btrfs_drop_snapshot()
6077 sizeof(wc->update_progress)); in btrfs_drop_snapshot()
6107 level, 1, &wc->refs[level], in btrfs_drop_snapshot()
6108 &wc->flags[level], NULL); in btrfs_drop_snapshot()
6112 BUG_ON(wc->refs[level] == 0); in btrfs_drop_snapshot()
6119 WARN_ON(wc->refs[level] != 1); in btrfs_drop_snapshot()
6124 wc->restarted = test_bit(BTRFS_ROOT_DEAD_TREE, &root->state); in btrfs_drop_snapshot()
6125 wc->level = level; in btrfs_drop_snapshot()
6126 wc->shared_level = -1; in btrfs_drop_snapshot()
6127 wc->stage = DROP_REFERENCE; in btrfs_drop_snapshot()
6128 wc->update_ref = update_ref; in btrfs_drop_snapshot()
6129 wc->keep_locks = 0; in btrfs_drop_snapshot()
6130 wc->reada_count = BTRFS_NODEPTRS_PER_BLOCK(fs_info); in btrfs_drop_snapshot()
6134 ret = walk_down_tree(trans, root, path, wc); in btrfs_drop_snapshot()
6140 ret = walk_up_tree(trans, root, path, wc, BTRFS_MAX_LEVEL); in btrfs_drop_snapshot()
6147 BUG_ON(wc->stage != DROP_REFERENCE); in btrfs_drop_snapshot()
6152 if (wc->stage == DROP_REFERENCE) { in btrfs_drop_snapshot()
6153 wc->drop_level = wc->level; in btrfs_drop_snapshot()
6154 btrfs_node_key_to_cpu(path->nodes[wc->drop_level], in btrfs_drop_snapshot()
6155 &wc->drop_progress, in btrfs_drop_snapshot()
6156 path->slots[wc->drop_level]); in btrfs_drop_snapshot()
6159 &wc->drop_progress); in btrfs_drop_snapshot()
6160 btrfs_set_root_drop_level(root_item, wc->drop_level); in btrfs_drop_snapshot()
6162 BUG_ON(wc->level == 0); in btrfs_drop_snapshot()
6246 kfree(wc); in btrfs_drop_snapshot()
6289 struct walk_control *wc; in btrfs_drop_subtree() local
6300 wc = kzalloc(sizeof(*wc), GFP_NOFS); in btrfs_drop_subtree()
6301 if (!wc) in btrfs_drop_subtree()
6316 wc->refs[parent_level] = 1; in btrfs_drop_subtree()
6317 wc->flags[parent_level] = BTRFS_BLOCK_FLAG_FULL_BACKREF; in btrfs_drop_subtree()
6318 wc->level = level; in btrfs_drop_subtree()
6319 wc->shared_level = -1; in btrfs_drop_subtree()
6320 wc->stage = DROP_REFERENCE; in btrfs_drop_subtree()
6321 wc->update_ref = 0; in btrfs_drop_subtree()
6322 wc->keep_locks = 1; in btrfs_drop_subtree()
6323 wc->reada_count = BTRFS_NODEPTRS_PER_BLOCK(fs_info); in btrfs_drop_subtree()
6326 ret = walk_down_tree(trans, root, path, wc); in btrfs_drop_subtree()
6330 ret = walk_up_tree(trans, root, path, wc, parent_level); in btrfs_drop_subtree()
6338 kfree(wc); in btrfs_drop_subtree()