Lines Matching +full:32 +full:k
50 * extent [0, 16K), followed by another file extent [16K, 20K), two dio reads
51 * are entering btrfs_get_extent() concurrently, t1 is reading [8K, 16K), t2 is
52 * reading [0, 8K)
57 * -> add_extent_mapping(0, 16K)
59 * ->add_extent_mapping(0, 16K)
77 /* Add [0, 16K) */ in test_case_1()
87 test_err("cannot add extent range [0, 16K)"); in test_case_1()
92 /* Add [16K, 20K) following [0, 16K) */ in test_case_1()
109 test_err("cannot add extent range [16K, 20K)"); in test_case_1()
121 /* Add [0, 8K), should return [0, 16K) instead. */ in test_case_1()
176 /* Add [0, 1K) */ in test_case_2()
186 test_err("cannot add extent range [0, 1K)"); in test_case_2()
191 /* Add [4K, 8K) following [0, 1K) */ in test_case_2()
208 test_err("cannot add extent range [4K, 8K)"); in test_case_2()
220 /* Add [0, 1K) */ in test_case_2()
230 test_err("case2 [0 1K]: ret %d", ret); in test_case_2()
234 test_err("case2 [0 1K]: no extent map returned"); in test_case_2()
241 "case2 [0 1K]: ret %d return a wrong em (start %llu len %llu disk_bytenr %llu", in test_case_2()
269 /* Add [4K, 8K) */ in __test_case_3()
279 test_err("cannot add extent range [4K, 8K)"); in __test_case_3()
291 /* Add [0, 16K) */ in __test_case_3()
336 * There is a file extent [0, 16K), two jobs are running concurrently
337 * against it, t1 is buffered writing to [4K, 8K) and t2 is doing dio
338 * read from [0, 4K) or [8K, 12K) or [12K, 16K).
340 * t1 goes ahead of t2 and adds em [4K, 8K) into tree.
378 /* Add [0K, 8K) */ in __test_case_4()
388 test_err("cannot add extent range [0, 8K)"); in __test_case_4()
400 /* Add [8K, 32K) */ in __test_case_4()
410 test_err("cannot add extent range [8K, 32K)"); in __test_case_4()
421 /* Add [0K, 32K) */ in __test_case_4()
461 * There is a file extent [0, 32K), two jobs are running concurrently
462 * against it, t1 is doing dio write to [8K, 32K) and t2 is doing dio
463 * read from [0, 4K) or [4K, 8K).
465 * t1 goes ahead of t2 and splits em [0, 32K) to em [0K, 8K) and [8K 32K).
472 * # load [0, 32K)
475 * # split [0, 32K)
477 * # add [8K, 32K)
480 * # [0, 32K)
533 { .start = 0, .len = SZ_8K }, /* [0, 8K) */
534 { .start = SZ_4K * 3, .len = SZ_4K * 3}, /* [12k, 24k) */
535 { .start = SZ_4K * 6, .len = SZ_4K * 3}, /* [24k, 36k) */
536 { .start = SZ_32K + SZ_4K, .len = SZ_4K}, /* [36k, 40k) */
537 { .start = SZ_4K * 10, .len = SZ_4K * 6}, /* [40k, 64k) */
540 { .start = 0, .len = SZ_8K }, /* [0, 8K) */
541 { .start = SZ_4K * 5, .len = SZ_4K}, /* [20k, 24k) */
542 { .start = SZ_4K * 6, .len = SZ_4K * 3}, /* [24k, 36k) */
543 { .start = SZ_32K + SZ_4K, .len = SZ_4K}, /* [36k, 40k) */
544 { .start = SZ_4K * 10, .len = SZ_4K * 6}, /* [40k, 64k) */
547 { .start = 0, .len = SZ_8K }, /* [0, 8K) */
548 { .start = SZ_4K * 5, .len = SZ_4K}, /* [20k, 24k) */
549 { .start = SZ_4K * 6, .len = SZ_4K}, /* [24k, 28k) */
550 { .start = SZ_32K, .len = SZ_4K}, /* [32k, 36k) */
551 { .start = SZ_32K + SZ_4K, .len = SZ_4K}, /* [36k, 40k) */
552 { .start = SZ_4K * 10, .len = SZ_4K * 6}, /* [40k, 64k) */
555 { .start = 0, .len = SZ_8K}, /* [0, 8K) */
556 { .start = SZ_4K * 5, .len = SZ_4K}, /* [20k, 24k) */
557 { .start = SZ_4K * 6, .len = SZ_4K}, /* [24k, 28k) */
608 * [0, 12k)[12k, 24k)[24k, 36k)[36k, 40k)[40k,64k)
612 * [8k, 12k) - test the single front split
613 * [12k, 20k) - test the single back split
614 * [28k, 32k) - test the double split
615 * [32k, 64k) - test whole em dropping
628 /* [0, 12k) */ in test_case_5()
631 test_err("cannot add extent range [0, 12K)"); in test_case_5()
635 /* [12k, 24k) */ in test_case_5()
638 test_err("cannot add extent range [12k, 24k)"); in test_case_5()
642 /* [24k, 36k) */ in test_case_5()
645 test_err("cannot add extent range [12k, 24k)"); in test_case_5()
649 /* [36k, 40k) */ in test_case_5()
652 test_err("cannot add extent range [12k, 24k)"); in test_case_5()
656 /* [40k, 64k) */ in test_case_5()
659 test_err("cannot add extent range [12k, 24k)"); in test_case_5()
663 /* Drop [8k, 12k) */ in test_case_5()
671 /* Drop [12k, 20k) */ in test_case_5()
679 /* Drop [28k, 32k) */ in test_case_5()
687 /* Drop [32k, 64k) */ in test_case_5()
749 test_err("unexpected em->len %llu, expected 4K", em->len); in test_case_6()
782 /* [0, 16K), pinned */ in test_case_7()
805 /* [32K, 48K), not pinned */ in test_case_7()
821 * Drop [0, 36K) This should skip the [0, 4K) extent and then split the in test_case_7()
822 * [32K, 48K) extent. in test_case_7()
841 test_err("em->len is %llu, expected 16K", em->len); in test_case_7()
859 test_err("didn't find an em at 32K as expected"); in test_case_7()
864 test_err("em->start is %llu, expected 36K", em->start); in test_case_7()
869 test_err("em->len is %llu, expected 12K", em->len); in test_case_7()
874 test_err("em->block_start is %llu, expected 36K", in test_case_7()
885 test_err("found an unexpected em above 48K"); in test_case_7()
922 /* Compressed extent for the file range [120K, 128K). */ in test_case_8()
933 test_err("couldn't add extent map for range [120K, 128K)"); in test_case_8()
945 * Compressed extent for the file range [108K, 144K), which overlaps in test_case_8()
946 * with the [120K, 128K) we previously inserted. in test_case_8()
955 * Try to add the extent map but with a search range of [140K, 144K), in test_case_8()
957 * [128K, 144K), with a length of 16K and an offset of 20K. in test_case_8()
960 * have a compressed file extent item for the range [108K, 144K) and we in test_case_8()
961 * have an overlapping compressed extent map for the range [120K, 128K), in test_case_8()
972 test_err("couldn't add extent map for range [108K, 144K)"); in test_case_8()
977 test_err("unexpected extent map start %llu (should be 128K)", em->start); in test_case_8()
982 test_err("unexpected extent map length %llu (should be 16K)", em->len); in test_case_8()
987 test_err("unexpected extent map offset %llu (should be 20K)", em->offset); in test_case_8()