Lines Matching refs:path
22 struct btrfs_path *path);
71 struct btrfs_path *path) in add_new_free_space_info() argument
83 ret = btrfs_insert_empty_item(trans, root, path, &key, sizeof(*info)); in add_new_free_space_info()
87 leaf = path->nodes[0]; in add_new_free_space_info()
88 info = btrfs_item_ptr(leaf, path->slots[0], in add_new_free_space_info()
96 btrfs_release_path(path); in add_new_free_space_info()
104 struct btrfs_path *path, int cow) in search_free_space_info() argument
115 ret = btrfs_search_slot(trans, root, &key, path, 0, cow); in search_free_space_info()
125 return btrfs_item_ptr(path->nodes[0], path->slots[0], in search_free_space_info()
207 struct btrfs_path *path) in convert_free_space_to_bitmaps() argument
238 ret = btrfs_search_prev_slot(trans, root, &key, path, -1, 1); in convert_free_space_to_bitmaps()
242 leaf = path->nodes[0]; in convert_free_space_to_bitmaps()
244 path->slots[0]++; in convert_free_space_to_bitmaps()
245 while (path->slots[0] > 0) { in convert_free_space_to_bitmaps()
246 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0] - 1); in convert_free_space_to_bitmaps()
268 path->slots[0]--; in convert_free_space_to_bitmaps()
274 ret = btrfs_del_items(trans, root, path, path->slots[0], nr); in convert_free_space_to_bitmaps()
277 btrfs_release_path(path); in convert_free_space_to_bitmaps()
280 info = search_free_space_info(trans, block_group, path, 1); in convert_free_space_to_bitmaps()
285 leaf = path->nodes[0]; in convert_free_space_to_bitmaps()
291 btrfs_release_path(path); in convert_free_space_to_bitmaps()
318 ret = btrfs_insert_empty_item(trans, root, path, &key, in convert_free_space_to_bitmaps()
323 leaf = path->nodes[0]; in convert_free_space_to_bitmaps()
324 ptr = btrfs_item_ptr_offset(leaf, path->slots[0]); in convert_free_space_to_bitmaps()
328 btrfs_release_path(path); in convert_free_space_to_bitmaps()
345 struct btrfs_path *path) in convert_free_space_to_extents() argument
375 ret = btrfs_search_prev_slot(trans, root, &key, path, -1, 1); in convert_free_space_to_extents()
379 leaf = path->nodes[0]; in convert_free_space_to_extents()
381 path->slots[0]++; in convert_free_space_to_extents()
382 while (path->slots[0] > 0) { in convert_free_space_to_extents()
383 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0] - 1); in convert_free_space_to_extents()
406 ptr = btrfs_item_ptr_offset(leaf, path->slots[0] - 1); in convert_free_space_to_extents()
411 path->slots[0]--; in convert_free_space_to_extents()
417 ret = btrfs_del_items(trans, root, path, path->slots[0], nr); in convert_free_space_to_extents()
420 btrfs_release_path(path); in convert_free_space_to_extents()
423 info = search_free_space_info(trans, block_group, path, 1); in convert_free_space_to_extents()
428 leaf = path->nodes[0]; in convert_free_space_to_extents()
434 btrfs_release_path(path); in convert_free_space_to_extents()
447 ret = btrfs_insert_empty_item(trans, root, path, &key, 0); in convert_free_space_to_extents()
450 btrfs_release_path(path); in convert_free_space_to_extents()
477 struct btrfs_path *path, in update_free_space_extent_count() argument
488 info = search_free_space_info(trans, block_group, path, 1); in update_free_space_extent_count()
493 flags = btrfs_free_space_flags(path->nodes[0], info); in update_free_space_extent_count()
494 extent_count = btrfs_free_space_extent_count(path->nodes[0], info); in update_free_space_extent_count()
497 btrfs_set_free_space_extent_count(path->nodes[0], info, extent_count); in update_free_space_extent_count()
498 btrfs_mark_buffer_dirty(path->nodes[0]); in update_free_space_extent_count()
499 btrfs_release_path(path); in update_free_space_extent_count()
503 ret = convert_free_space_to_bitmaps(trans, block_group, path); in update_free_space_extent_count()
506 ret = convert_free_space_to_extents(trans, block_group, path); in update_free_space_extent_count()
515 struct btrfs_path *path, u64 offset) in free_space_test_bit() argument
522 leaf = path->nodes[0]; in free_space_test_bit()
523 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in free_space_test_bit()
530 ptr = btrfs_item_ptr_offset(leaf, path->slots[0]); in free_space_test_bit()
537 struct btrfs_path *path, u64 *start, u64 *size, in free_space_set_bits() argument
547 leaf = path->nodes[0]; in free_space_set_bits()
548 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in free_space_set_bits()
559 ptr = btrfs_item_ptr_offset(leaf, path->slots[0]); in free_space_set_bits()
605 struct btrfs_path *path, in modify_free_space_bitmap() argument
627 ret = btrfs_search_prev_slot(trans, root, &key, path, 0, 1); in modify_free_space_bitmap()
631 prev_bit = free_space_test_bit(block_group, path, prev_block); in modify_free_space_bitmap()
634 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in modify_free_space_bitmap()
636 ret = free_space_next_bitmap(trans, root, path); in modify_free_space_bitmap()
645 ret = btrfs_search_prev_slot(trans, root, &key, path, 0, 1); in modify_free_space_bitmap()
659 free_space_set_bits(block_group, path, &cur_start, &cur_size, in modify_free_space_bitmap()
663 ret = free_space_next_bitmap(trans, root, path); in modify_free_space_bitmap()
674 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in modify_free_space_bitmap()
676 ret = free_space_next_bitmap(trans, root, path); in modify_free_space_bitmap()
681 next_bit = free_space_test_bit(block_group, path, end); in modify_free_space_bitmap()
708 btrfs_release_path(path); in modify_free_space_bitmap()
709 ret = update_free_space_extent_count(trans, block_group, path, in modify_free_space_bitmap()
718 struct btrfs_path *path, in remove_free_space_extent() argument
732 ret = btrfs_search_prev_slot(trans, root, &key, path, -1, 1); in remove_free_space_extent()
736 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in remove_free_space_extent()
764 ret = btrfs_del_item(trans, root, path); in remove_free_space_extent()
774 btrfs_release_path(path); in remove_free_space_extent()
775 ret = btrfs_insert_empty_item(trans, root, path, &key, 0); in remove_free_space_extent()
787 btrfs_release_path(path); in remove_free_space_extent()
788 ret = btrfs_insert_empty_item(trans, root, path, &key, 0); in remove_free_space_extent()
794 btrfs_release_path(path); in remove_free_space_extent()
795 ret = update_free_space_extent_count(trans, block_group, path, in remove_free_space_extent()
805 struct btrfs_path *path, u64 start, u64 size) in __remove_from_free_space_tree() argument
812 ret = __add_block_group_free_space(trans, block_group, path); in __remove_from_free_space_tree()
817 info = search_free_space_info(NULL, block_group, path, 0); in __remove_from_free_space_tree()
820 flags = btrfs_free_space_flags(path->nodes[0], info); in __remove_from_free_space_tree()
821 btrfs_release_path(path); in __remove_from_free_space_tree()
824 return modify_free_space_bitmap(trans, block_group, path, in __remove_from_free_space_tree()
827 return remove_free_space_extent(trans, block_group, path, in __remove_from_free_space_tree()
836 struct btrfs_path *path; in remove_from_free_space_tree() local
842 path = btrfs_alloc_path(); in remove_from_free_space_tree()
843 if (!path) { in remove_from_free_space_tree()
856 ret = __remove_from_free_space_tree(trans, block_group, path, start, in remove_from_free_space_tree()
862 btrfs_free_path(path); in remove_from_free_space_tree()
870 struct btrfs_path *path, in add_free_space_extent() argument
909 ret = btrfs_search_prev_slot(trans, root, &key, path, -1, 1); in add_free_space_extent()
913 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in add_free_space_extent()
917 btrfs_release_path(path); in add_free_space_extent()
932 ret = btrfs_del_item(trans, root, path); in add_free_space_extent()
939 btrfs_release_path(path); in add_free_space_extent()
949 ret = btrfs_search_prev_slot(trans, root, &key, path, -1, 1); in add_free_space_extent()
953 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in add_free_space_extent()
957 btrfs_release_path(path); in add_free_space_extent()
973 ret = btrfs_del_item(trans, root, path); in add_free_space_extent()
979 btrfs_release_path(path); in add_free_space_extent()
983 ret = btrfs_insert_empty_item(trans, root, path, &new_key, 0); in add_free_space_extent()
987 btrfs_release_path(path); in add_free_space_extent()
988 ret = update_free_space_extent_count(trans, block_group, path, in add_free_space_extent()
998 struct btrfs_path *path, u64 start, u64 size) in __add_to_free_space_tree() argument
1005 ret = __add_block_group_free_space(trans, block_group, path); in __add_to_free_space_tree()
1010 info = search_free_space_info(NULL, block_group, path, 0); in __add_to_free_space_tree()
1013 flags = btrfs_free_space_flags(path->nodes[0], info); in __add_to_free_space_tree()
1014 btrfs_release_path(path); in __add_to_free_space_tree()
1017 return modify_free_space_bitmap(trans, block_group, path, in __add_to_free_space_tree()
1020 return add_free_space_extent(trans, block_group, path, start, in __add_to_free_space_tree()
1029 struct btrfs_path *path; in add_to_free_space_tree() local
1035 path = btrfs_alloc_path(); in add_to_free_space_tree()
1036 if (!path) { in add_to_free_space_tree()
1049 ret = __add_to_free_space_tree(trans, block_group, path, start, size); in add_to_free_space_tree()
1054 btrfs_free_path(path); in add_to_free_space_tree()
1069 struct btrfs_path *path, *path2; in populate_free_space_tree() local
1074 path = btrfs_alloc_path(); in populate_free_space_tree()
1075 if (!path) in populate_free_space_tree()
1077 path->reada = READA_FORWARD; in populate_free_space_tree()
1081 btrfs_free_path(path); in populate_free_space_tree()
1103 ret = btrfs_search_slot_for_read(extent_root, &key, path, 1, 0); in populate_free_space_tree()
1111 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in populate_free_space_tree()
1137 ret = btrfs_next_item(extent_root, path); in populate_free_space_tree()
1155 btrfs_free_path(path); in populate_free_space_tree()
1219 struct btrfs_path *path; in clear_free_space_tree() local
1224 path = btrfs_alloc_path(); in clear_free_space_tree()
1225 if (!path) in clear_free_space_tree()
1233 ret = btrfs_search_slot(trans, root, &key, path, -1, 1); in clear_free_space_tree()
1237 nr = btrfs_header_nritems(path->nodes[0]); in clear_free_space_tree()
1241 path->slots[0] = 0; in clear_free_space_tree()
1242 ret = btrfs_del_items(trans, root, path, 0, nr); in clear_free_space_tree()
1246 btrfs_release_path(path); in clear_free_space_tree()
1251 btrfs_free_path(path); in clear_free_space_tree()
1303 struct btrfs_path *path) in __add_block_group_free_space() argument
1309 ret = add_new_free_space_info(trans, block_group, path); in __add_block_group_free_space()
1313 return __add_to_free_space_tree(trans, block_group, path, in __add_block_group_free_space()
1322 struct btrfs_path *path = NULL; in add_block_group_free_space() local
1332 path = btrfs_alloc_path(); in add_block_group_free_space()
1333 if (!path) { in add_block_group_free_space()
1338 ret = __add_block_group_free_space(trans, block_group, path); in add_block_group_free_space()
1341 btrfs_free_path(path); in add_block_group_free_space()
1352 struct btrfs_path *path; in remove_block_group_free_space() local
1367 path = btrfs_alloc_path(); in remove_block_group_free_space()
1368 if (!path) { in remove_block_group_free_space()
1381 ret = btrfs_search_prev_slot(trans, root, &key, path, -1, 1); in remove_block_group_free_space()
1385 leaf = path->nodes[0]; in remove_block_group_free_space()
1387 path->slots[0]++; in remove_block_group_free_space()
1388 while (path->slots[0] > 0) { in remove_block_group_free_space()
1389 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0] - 1); in remove_block_group_free_space()
1396 path->slots[0]--; in remove_block_group_free_space()
1404 path->slots[0]--; in remove_block_group_free_space()
1410 ret = btrfs_del_items(trans, root, path, path->slots[0], nr); in remove_block_group_free_space()
1413 btrfs_release_path(path); in remove_block_group_free_space()
1418 btrfs_free_path(path); in remove_block_group_free_space()
1425 struct btrfs_path *path, in load_free_space_bitmaps() argument
1447 ret = btrfs_next_item(root, path); in load_free_space_bitmaps()
1453 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in load_free_space_bitmaps()
1463 bit = free_space_test_bit(block_group, path, offset); in load_free_space_bitmaps()
1502 struct btrfs_path *path, in load_free_space_extents() argument
1521 ret = btrfs_next_item(root, path); in load_free_space_extents()
1527 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in load_free_space_extents()
1563 struct btrfs_path *path; in load_free_space_tree() local
1569 path = btrfs_alloc_path(); in load_free_space_tree()
1570 if (!path) in load_free_space_tree()
1577 path->skip_locking = 1; in load_free_space_tree()
1578 path->search_commit_root = 1; in load_free_space_tree()
1579 path->reada = READA_FORWARD; in load_free_space_tree()
1581 info = search_free_space_info(NULL, block_group, path, 0); in load_free_space_tree()
1586 extent_count = btrfs_free_space_extent_count(path->nodes[0], info); in load_free_space_tree()
1587 flags = btrfs_free_space_flags(path->nodes[0], info); in load_free_space_tree()
1595 ret = load_free_space_bitmaps(caching_ctl, path, extent_count); in load_free_space_tree()
1597 ret = load_free_space_extents(caching_ctl, path, extent_count); in load_free_space_tree()
1600 btrfs_free_path(path); in load_free_space_tree()