Lines Matching defs:sectorsize

90 static int test_bitmaps(struct btrfs_block_group *cache, u32 sectorsize)
130 next_bitmap_offset = (u64)(BITS_PER_BITMAP * sectorsize);
159 u32 sectorsize)
161 u64 bitmap_offset = (u64)(BITS_PER_BITMAP * sectorsize);
396 u32 sectorsize)
533 ret = btrfs_add_free_space(cache, SZ_128M + SZ_16M, sectorsize);
591 if (cache->free_space_ctl->free_space != (SZ_1M + sectorsize)) {
592 test_err("cache free space is not 1Mb + %u", sectorsize);
607 * All that remains is a sectorsize free space region in a bitmap.
614 if (cache->free_space_ctl->free_space != sectorsize) {
615 test_err("cache free space is not %u", sectorsize);
620 0, sectorsize, 0,
624 sectorsize, offset);
731 ret = btrfs_add_free_space(cache, SZ_32M, 2 * sectorsize);
755 * bitmap, because of the small 2 * sectorsize free space region.
781 if (cache->free_space_ctl->free_space != (SZ_1M + 2 * sectorsize)) {
782 test_err("cache free space is not 1Mb + %u", 2 * sectorsize);
796 * All that remains is 2 * sectorsize free space region
803 if (cache->free_space_ctl->free_space != 2 * sectorsize) {
804 test_err("cache free space is not %u", 2 * sectorsize);
809 0, 2 * sectorsize, 0,
813 2 * sectorsize, offset);
833 static int test_bytes_index(struct btrfs_block_group *cache, u32 sectorsize)
856 offset += bytes + sectorsize;
873 offset = i * BITS_PER_BITMAP * sectorsize;
898 ret = test_add_free_space_entry(cache, 0, sectorsize, 1);
904 offset = BITS_PER_BITMAP * sectorsize;
905 ret = test_add_free_space_entry(cache, offset, sectorsize, 1);
912 * Now set a bunch of sectorsize extents in the first entry so it's
916 offset = sectorsize * i;
917 ret = btrfs_add_free_space(cache, offset, sectorsize);
928 offset = (BITS_PER_BITMAP * sectorsize) + sectorsize;
929 ret = btrfs_add_free_space(cache, offset, sectorsize);
941 if (entry->bytes != (10 * sectorsize)) {
947 offset = btrfs_find_space_for_alloc(cache, cache->start, sectorsize * 3,
954 if (max_extent_size != (2 * sectorsize)) {
956 max_extent_size, (unsigned long long)(2 * sectorsize));
966 if (entry->bytes != (2 * sectorsize)) {
971 /* Add another sectorsize to re-arrange the tree back to ->bytes. */
972 offset = (BITS_PER_BITMAP * sectorsize) - sectorsize;
973 ret = btrfs_add_free_space(cache, offset, sectorsize);
981 if (entry->bytes != (11 * sectorsize)) {
991 offset = btrfs_find_space_for_alloc(cache, cache->start, sectorsize * 2,
993 if (offset != (BITS_PER_BITMAP * sectorsize)) {
996 (unsigned long long)(BITS_PER_BITMAP * sectorsize));
1005 int btrfs_test_free_space_cache(u32 sectorsize, u32 nodesize)
1013 fs_info = btrfs_alloc_dummy_fs_info(nodesize, sectorsize);
1025 BITS_PER_BITMAP * sectorsize + PAGE_SIZE);
1047 ret = test_bitmaps(cache, sectorsize);
1050 ret = test_bitmaps_and_extents(cache, sectorsize);
1054 ret = test_steal_space_from_bitmap_to_extent(cache, sectorsize);
1057 ret = test_bytes_index(cache, sectorsize);