Lines Matching refs:path
17 struct btrfs_path *path);
52 struct btrfs_path *path) in add_new_free_space_info() argument
64 ret = btrfs_insert_empty_item(trans, root, path, &key, sizeof(*info)); in add_new_free_space_info()
68 leaf = path->nodes[0]; in add_new_free_space_info()
69 info = btrfs_item_ptr(leaf, path->slots[0], in add_new_free_space_info()
77 btrfs_release_path(path); in add_new_free_space_info()
85 struct btrfs_path *path, int cow) in search_free_space_info() argument
96 ret = btrfs_search_slot(trans, root, &key, path, 0, cow); in search_free_space_info()
106 return btrfs_item_ptr(path->nodes[0], path->slots[0], in search_free_space_info()
188 struct btrfs_path *path) in convert_free_space_to_bitmaps() argument
219 ret = btrfs_search_prev_slot(trans, root, &key, path, -1, 1); in convert_free_space_to_bitmaps()
223 leaf = path->nodes[0]; in convert_free_space_to_bitmaps()
225 path->slots[0]++; in convert_free_space_to_bitmaps()
226 while (path->slots[0] > 0) { in convert_free_space_to_bitmaps()
227 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0] - 1); in convert_free_space_to_bitmaps()
249 path->slots[0]--; in convert_free_space_to_bitmaps()
255 ret = btrfs_del_items(trans, root, path, path->slots[0], nr); in convert_free_space_to_bitmaps()
258 btrfs_release_path(path); in convert_free_space_to_bitmaps()
261 info = search_free_space_info(trans, block_group, path, 1); in convert_free_space_to_bitmaps()
266 leaf = path->nodes[0]; in convert_free_space_to_bitmaps()
272 btrfs_release_path(path); in convert_free_space_to_bitmaps()
299 ret = btrfs_insert_empty_item(trans, root, path, &key, in convert_free_space_to_bitmaps()
304 leaf = path->nodes[0]; in convert_free_space_to_bitmaps()
305 ptr = btrfs_item_ptr_offset(leaf, path->slots[0]); in convert_free_space_to_bitmaps()
309 btrfs_release_path(path); in convert_free_space_to_bitmaps()
326 struct btrfs_path *path) in convert_free_space_to_extents() argument
356 ret = btrfs_search_prev_slot(trans, root, &key, path, -1, 1); in convert_free_space_to_extents()
360 leaf = path->nodes[0]; in convert_free_space_to_extents()
362 path->slots[0]++; in convert_free_space_to_extents()
363 while (path->slots[0] > 0) { in convert_free_space_to_extents()
364 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0] - 1); in convert_free_space_to_extents()
387 ptr = btrfs_item_ptr_offset(leaf, path->slots[0] - 1); in convert_free_space_to_extents()
392 path->slots[0]--; in convert_free_space_to_extents()
398 ret = btrfs_del_items(trans, root, path, path->slots[0], nr); in convert_free_space_to_extents()
401 btrfs_release_path(path); in convert_free_space_to_extents()
404 info = search_free_space_info(trans, block_group, path, 1); in convert_free_space_to_extents()
409 leaf = path->nodes[0]; in convert_free_space_to_extents()
415 btrfs_release_path(path); in convert_free_space_to_extents()
428 ret = btrfs_insert_empty_item(trans, root, path, &key, 0); in convert_free_space_to_extents()
431 btrfs_release_path(path); in convert_free_space_to_extents()
458 struct btrfs_path *path, in update_free_space_extent_count() argument
469 info = search_free_space_info(trans, block_group, path, 1); in update_free_space_extent_count()
474 flags = btrfs_free_space_flags(path->nodes[0], info); in update_free_space_extent_count()
475 extent_count = btrfs_free_space_extent_count(path->nodes[0], info); in update_free_space_extent_count()
478 btrfs_set_free_space_extent_count(path->nodes[0], info, extent_count); in update_free_space_extent_count()
479 btrfs_mark_buffer_dirty(path->nodes[0]); in update_free_space_extent_count()
480 btrfs_release_path(path); in update_free_space_extent_count()
484 ret = convert_free_space_to_bitmaps(trans, block_group, path); in update_free_space_extent_count()
487 ret = convert_free_space_to_extents(trans, block_group, path); in update_free_space_extent_count()
496 struct btrfs_path *path, u64 offset) in free_space_test_bit() argument
503 leaf = path->nodes[0]; in free_space_test_bit()
504 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in free_space_test_bit()
511 ptr = btrfs_item_ptr_offset(leaf, path->slots[0]); in free_space_test_bit()
518 struct btrfs_path *path, u64 *start, u64 *size, in free_space_set_bits() argument
528 leaf = path->nodes[0]; in free_space_set_bits()
529 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in free_space_set_bits()
540 ptr = btrfs_item_ptr_offset(leaf, path->slots[0]); in free_space_set_bits()
586 struct btrfs_path *path, in modify_free_space_bitmap() argument
608 ret = btrfs_search_prev_slot(trans, root, &key, path, 0, 1); in modify_free_space_bitmap()
612 prev_bit = free_space_test_bit(block_group, path, prev_block); in modify_free_space_bitmap()
615 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in modify_free_space_bitmap()
617 ret = free_space_next_bitmap(trans, root, path); in modify_free_space_bitmap()
626 ret = btrfs_search_prev_slot(trans, root, &key, path, 0, 1); in modify_free_space_bitmap()
640 free_space_set_bits(block_group, path, &cur_start, &cur_size, in modify_free_space_bitmap()
644 ret = free_space_next_bitmap(trans, root, path); in modify_free_space_bitmap()
655 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in modify_free_space_bitmap()
657 ret = free_space_next_bitmap(trans, root, path); in modify_free_space_bitmap()
662 next_bit = free_space_test_bit(block_group, path, end); in modify_free_space_bitmap()
689 btrfs_release_path(path); in modify_free_space_bitmap()
690 ret = update_free_space_extent_count(trans, block_group, path, in modify_free_space_bitmap()
699 struct btrfs_path *path, in remove_free_space_extent() argument
713 ret = btrfs_search_prev_slot(trans, root, &key, path, -1, 1); in remove_free_space_extent()
717 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in remove_free_space_extent()
745 ret = btrfs_del_item(trans, root, path); in remove_free_space_extent()
755 btrfs_release_path(path); in remove_free_space_extent()
756 ret = btrfs_insert_empty_item(trans, root, path, &key, 0); in remove_free_space_extent()
768 btrfs_release_path(path); in remove_free_space_extent()
769 ret = btrfs_insert_empty_item(trans, root, path, &key, 0); in remove_free_space_extent()
775 btrfs_release_path(path); in remove_free_space_extent()
776 ret = update_free_space_extent_count(trans, block_group, path, in remove_free_space_extent()
786 struct btrfs_path *path, u64 start, u64 size) in __remove_from_free_space_tree() argument
793 ret = __add_block_group_free_space(trans, block_group, path); in __remove_from_free_space_tree()
798 info = search_free_space_info(NULL, block_group, path, 0); in __remove_from_free_space_tree()
801 flags = btrfs_free_space_flags(path->nodes[0], info); in __remove_from_free_space_tree()
802 btrfs_release_path(path); in __remove_from_free_space_tree()
805 return modify_free_space_bitmap(trans, block_group, path, in __remove_from_free_space_tree()
808 return remove_free_space_extent(trans, block_group, path, in __remove_from_free_space_tree()
817 struct btrfs_path *path; in remove_from_free_space_tree() local
823 path = btrfs_alloc_path(); in remove_from_free_space_tree()
824 if (!path) { in remove_from_free_space_tree()
837 ret = __remove_from_free_space_tree(trans, block_group, path, start, in remove_from_free_space_tree()
843 btrfs_free_path(path); in remove_from_free_space_tree()
851 struct btrfs_path *path, in add_free_space_extent() argument
890 ret = btrfs_search_prev_slot(trans, root, &key, path, -1, 1); in add_free_space_extent()
894 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in add_free_space_extent()
898 btrfs_release_path(path); in add_free_space_extent()
913 ret = btrfs_del_item(trans, root, path); in add_free_space_extent()
920 btrfs_release_path(path); in add_free_space_extent()
930 ret = btrfs_search_prev_slot(trans, root, &key, path, -1, 1); in add_free_space_extent()
934 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in add_free_space_extent()
938 btrfs_release_path(path); in add_free_space_extent()
954 ret = btrfs_del_item(trans, root, path); in add_free_space_extent()
960 btrfs_release_path(path); in add_free_space_extent()
964 ret = btrfs_insert_empty_item(trans, root, path, &new_key, 0); in add_free_space_extent()
968 btrfs_release_path(path); in add_free_space_extent()
969 ret = update_free_space_extent_count(trans, block_group, path, in add_free_space_extent()
979 struct btrfs_path *path, u64 start, u64 size) in __add_to_free_space_tree() argument
986 ret = __add_block_group_free_space(trans, block_group, path); in __add_to_free_space_tree()
991 info = search_free_space_info(NULL, block_group, path, 0); in __add_to_free_space_tree()
994 flags = btrfs_free_space_flags(path->nodes[0], info); in __add_to_free_space_tree()
995 btrfs_release_path(path); in __add_to_free_space_tree()
998 return modify_free_space_bitmap(trans, block_group, path, in __add_to_free_space_tree()
1001 return add_free_space_extent(trans, block_group, path, start, in __add_to_free_space_tree()
1010 struct btrfs_path *path; in add_to_free_space_tree() local
1016 path = btrfs_alloc_path(); in add_to_free_space_tree()
1017 if (!path) { in add_to_free_space_tree()
1030 ret = __add_to_free_space_tree(trans, block_group, path, start, size); in add_to_free_space_tree()
1035 btrfs_free_path(path); in add_to_free_space_tree()
1050 struct btrfs_path *path, *path2; in populate_free_space_tree() local
1055 path = btrfs_alloc_path(); in populate_free_space_tree()
1056 if (!path) in populate_free_space_tree()
1058 path->reada = READA_FORWARD; in populate_free_space_tree()
1062 btrfs_free_path(path); in populate_free_space_tree()
1083 ret = btrfs_search_slot_for_read(extent_root, &key, path, 1, 0); in populate_free_space_tree()
1091 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in populate_free_space_tree()
1117 ret = btrfs_next_item(extent_root, path); in populate_free_space_tree()
1135 btrfs_free_path(path); in populate_free_space_tree()
1195 struct btrfs_path *path; in clear_free_space_tree() local
1200 path = btrfs_alloc_path(); in clear_free_space_tree()
1201 if (!path) in clear_free_space_tree()
1209 ret = btrfs_search_slot(trans, root, &key, path, -1, 1); in clear_free_space_tree()
1213 nr = btrfs_header_nritems(path->nodes[0]); in clear_free_space_tree()
1217 path->slots[0] = 0; in clear_free_space_tree()
1218 ret = btrfs_del_items(trans, root, path, 0, nr); in clear_free_space_tree()
1222 btrfs_release_path(path); in clear_free_space_tree()
1227 btrfs_free_path(path); in clear_free_space_tree()
1274 struct btrfs_path *path) in __add_block_group_free_space() argument
1280 ret = add_new_free_space_info(trans, block_group, path); in __add_block_group_free_space()
1284 return __add_to_free_space_tree(trans, block_group, path, in __add_block_group_free_space()
1293 struct btrfs_path *path = NULL; in add_block_group_free_space() local
1303 path = btrfs_alloc_path(); in add_block_group_free_space()
1304 if (!path) { in add_block_group_free_space()
1309 ret = __add_block_group_free_space(trans, block_group, path); in add_block_group_free_space()
1312 btrfs_free_path(path); in add_block_group_free_space()
1323 struct btrfs_path *path; in remove_block_group_free_space() local
1338 path = btrfs_alloc_path(); in remove_block_group_free_space()
1339 if (!path) { in remove_block_group_free_space()
1352 ret = btrfs_search_prev_slot(trans, root, &key, path, -1, 1); in remove_block_group_free_space()
1356 leaf = path->nodes[0]; in remove_block_group_free_space()
1358 path->slots[0]++; in remove_block_group_free_space()
1359 while (path->slots[0] > 0) { in remove_block_group_free_space()
1360 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0] - 1); in remove_block_group_free_space()
1367 path->slots[0]--; in remove_block_group_free_space()
1375 path->slots[0]--; in remove_block_group_free_space()
1381 ret = btrfs_del_items(trans, root, path, path->slots[0], nr); in remove_block_group_free_space()
1384 btrfs_release_path(path); in remove_block_group_free_space()
1389 btrfs_free_path(path); in remove_block_group_free_space()
1396 struct btrfs_path *path, in load_free_space_bitmaps() argument
1418 ret = btrfs_next_item(root, path); in load_free_space_bitmaps()
1424 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in load_free_space_bitmaps()
1436 bit = free_space_test_bit(block_group, path, offset); in load_free_space_bitmaps()
1477 struct btrfs_path *path, in load_free_space_extents() argument
1496 ret = btrfs_next_item(root, path); in load_free_space_extents()
1502 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in load_free_space_extents()
1542 struct btrfs_path *path; in load_free_space_tree() local
1548 path = btrfs_alloc_path(); in load_free_space_tree()
1549 if (!path) in load_free_space_tree()
1556 path->skip_locking = 1; in load_free_space_tree()
1557 path->search_commit_root = 1; in load_free_space_tree()
1558 path->reada = READA_FORWARD; in load_free_space_tree()
1560 info = search_free_space_info(NULL, block_group, path, 0); in load_free_space_tree()
1565 extent_count = btrfs_free_space_extent_count(path->nodes[0], info); in load_free_space_tree()
1566 flags = btrfs_free_space_flags(path->nodes[0], info); in load_free_space_tree()
1574 ret = load_free_space_bitmaps(caching_ctl, path, extent_count); in load_free_space_tree()
1576 ret = load_free_space_extents(caching_ctl, path, extent_count); in load_free_space_tree()
1579 btrfs_free_path(path); in load_free_space_tree()