Lines Matching +full:non +full:- +full:overlapping
1 // SPDX-License-Identifier: GPL-2.0
11 #include "btrfs-tests.h"
34 ret = filemap_get_folios_contig(inode->i_mapping, &index, in process_page_range()
65 if (state->state & EXTENT_##name) \
66 cur += scnprintf(dest + cur, STATE_FLAG_STR_LEN - cur, \
95 node = rb_first(&tree->state); in dump_extent_io_tree()
102 test_msg(" start=%llu len=%llu flags=%s", state->start, in dump_extent_io_tree()
103 state->end + 1 - state->start, flags_str); in dump_extent_io_tree()
120 int ret = -EINVAL; in test_find_delalloc()
127 return -ENOMEM; in test_find_delalloc()
129 tmp = &BTRFS_I(inode)->io_tree; in test_find_delalloc()
143 page = find_or_create_page(inode->i_mapping, index, GFP_KERNEL); in test_find_delalloc()
146 ret = -ENOMEM; in test_find_delalloc()
159 * |--- delalloc ---| in test_find_delalloc()
160 * |--- search ---| in test_find_delalloc()
162 set_extent_bit(tmp, 0, sectorsize - 1, EXTENT_DELALLOC, NULL); in test_find_delalloc()
164 end = start + PAGE_SIZE - 1; in test_find_delalloc()
171 if (start != 0 || end != (sectorsize - 1)) { in test_find_delalloc()
173 sectorsize - 1, start, end); in test_find_delalloc()
183 * |--- delalloc ---| in test_find_delalloc()
184 * |--- search ---| in test_find_delalloc()
187 locked_page = find_lock_page(inode->i_mapping, in test_find_delalloc()
193 set_extent_bit(tmp, sectorsize, max_bytes - 1, EXTENT_DELALLOC, NULL); in test_find_delalloc()
195 end = start + PAGE_SIZE - 1; in test_find_delalloc()
202 if (start != test_start || end != max_bytes - 1) { in test_find_delalloc()
204 test_start, max_bytes - 1, start, end); in test_find_delalloc()
218 * |--- delalloc ---| in test_find_delalloc()
219 * |--- search ---| in test_find_delalloc()
222 locked_page = find_lock_page(inode->i_mapping, test_start >> in test_find_delalloc()
229 end = start + PAGE_SIZE - 1; in test_find_delalloc()
236 if (end != test_start + PAGE_SIZE - 1) { in test_find_delalloc()
243 * [------- delalloc -------| in test_find_delalloc()
244 * [max_bytes]|-- search--| in test_find_delalloc()
246 * We are re-using our test_start from above since it works out well. in test_find_delalloc()
248 set_extent_bit(tmp, max_bytes, total_dirty - 1, EXTENT_DELALLOC, NULL); in test_find_delalloc()
250 end = start + PAGE_SIZE - 1; in test_find_delalloc()
257 if (start != test_start || end != total_dirty - 1) { in test_find_delalloc()
259 test_start, total_dirty - 1, start, end); in test_find_delalloc()
273 page = find_get_page(inode->i_mapping, in test_find_delalloc()
285 end = start + PAGE_SIZE - 1; in test_find_delalloc()
288 * will adjust max_bytes down to PAGE_SIZE and then re-search. If in test_find_delalloc()
298 if (start != test_start && end != test_start + PAGE_SIZE - 1) { in test_find_delalloc()
300 test_start, test_start + PAGE_SIZE - 1, start, end); in test_find_delalloc()
312 clear_extent_bits(tmp, 0, total_dirty - 1, (unsigned)-1); in test_find_delalloc()
316 process_page_range(inode, 0, total_dirty - 1, in test_find_delalloc()
326 for (i = 0; i < eb->len * BITS_PER_BYTE; i++) { in check_eb_bitmap()
341 return -EINVAL; in check_eb_bitmap()
357 return -EINVAL; in check_eb_bitmap()
395 unsigned long byte_len = eb->len; in __test_eb_bitmaps()
440 PAGE_SIZE - sizeof(long) / 2, 0, in __test_eb_bitmaps()
451 PAGE_SIZE - sizeof(long) / 2, 0, in __test_eb_bitmaps()
458 * Generate a wonky pseudo-random bit pattern for the sake of not using in __test_eb_bitmaps()
459 * something repetitive that could miss some hypothetical off-by-n bug. in __test_eb_bitmaps()
498 return -ENOMEM; in test_eb_bitmaps()
504 ret = -ENOMEM; in test_eb_bitmaps()
511 ret = -ENOMEM; in test_eb_bitmaps()
528 ret = -ENOMEM; in test_eb_bitmaps()
544 int ret = -EINVAL; in test_find_first_clear_extent_bit()
552 if (start != 0 || end != -1) { in test_find_first_clear_extent_bit()
559 * Set 1M-4M alloc/discard and 32M-64M thus leaving a hole between in test_find_first_clear_extent_bit()
560 * 4M-32M in test_find_first_clear_extent_bit()
562 set_extent_bit(&tree, SZ_1M, SZ_4M - 1, in test_find_first_clear_extent_bit()
568 if (start != 0 || end != SZ_1M - 1) { in test_find_first_clear_extent_bit()
574 /* Now add 32M-64M so that we have a hole between 4M-32M */ in test_find_first_clear_extent_bit()
575 set_extent_bit(&tree, SZ_32M, SZ_64M - 1, in test_find_first_clear_extent_bit()
579 * Request first hole starting at 12M, we should get 4M-32M in test_find_first_clear_extent_bit()
584 if (start != SZ_4M || end != SZ_32M - 1) { in test_find_first_clear_extent_bit()
592 * available, which happens to be unallocated -> 4M-32M in test_find_first_clear_extent_bit()
597 if (start != SZ_4M || end != SZ_32M - 1) { in test_find_first_clear_extent_bit()
604 * Set 64M-72M with CHUNK_ALLOC flag, then search for CHUNK_TRIMMED flag in test_find_first_clear_extent_bit()
605 * being unset in this range, we should get the entry in range 64M-72M in test_find_first_clear_extent_bit()
607 set_extent_bit(&tree, SZ_64M, SZ_64M + SZ_8M - 1, CHUNK_ALLOCATED, NULL); in test_find_first_clear_extent_bit()
611 if (start != SZ_64M || end != SZ_64M + SZ_8M - 1) { in test_find_first_clear_extent_bit()
617 find_first_clear_extent_bit(&tree, SZ_64M - SZ_8M, &start, &end, in test_find_first_clear_extent_bit()
624 if (start != SZ_64M || end != SZ_64M + SZ_8M - 1) { in test_find_first_clear_extent_bit()
632 * and end should be -1 in test_find_first_clear_extent_bit()
634 find_first_clear_extent_bit(&tree, -1, &start, &end, CHUNK_TRIMMED); in test_find_first_clear_extent_bit()
635 if (start != SZ_64M + SZ_8M || end != -1) { in test_find_first_clear_extent_bit()
646 clear_extent_bits(&tree, 0, (u64)-1, CHUNK_TRIMMED | CHUNK_ALLOCATED); in test_find_first_clear_extent_bit()
654 for (int i = 0; i < eb->len; i++) { in dump_eb_and_memory_contents()
655 struct page *page = folio_page(eb->folios[i >> PAGE_SHIFT], 0); in dump_eb_and_memory_contents()
670 for (int i = 0; i < (eb->len >> PAGE_SHIFT); i++) { in verify_eb_and_memory()
671 void *eb_addr = folio_address(eb->folios[i]); in verify_eb_and_memory()
675 return -EUCLEAN; in verify_eb_and_memory()
687 get_random_bytes(memory, eb->len); in init_eb_and_memory()
688 write_extent_buffer(eb, memory, 0, eb->len); in init_eb_and_memory()
703 return -ENOMEM; in test_eb_mem_ops()
709 ret = -ENOMEM; in test_eb_mem_ops()
716 ret = -ENOMEM; in test_eb_mem_ops()
727 ret = verify_eb_and_memory(eb, memory, "same page non-overlapping memcpy 1"); in test_eb_mem_ops()
733 ret = verify_eb_and_memory(eb, memory, "same page non-overlapping memcpy 2"); in test_eb_mem_ops()
738 ret = verify_eb_and_memory(eb, memory, "same page non-overlapping memcpy 3"); in test_eb_mem_ops()
744 ret = verify_eb_and_memory(eb, memory, "same page overlapping memcpy 1"); in test_eb_mem_ops()
750 ret = verify_eb_and_memory(eb, memory, "same page overlapping memcpy 2"); in test_eb_mem_ops()
755 ret = verify_eb_and_memory(eb, memory, "same page overlapping memcpy 3"); in test_eb_mem_ops()
760 memcpy(memory, memory + 4096 - 128, 256); in test_eb_mem_ops()
761 memcpy_extent_buffer(eb, 0, 4096 - 128, 256); in test_eb_mem_ops()
762 ret = verify_eb_and_memory(eb, memory, "cross page non-overlapping memcpy 1"); in test_eb_mem_ops()
766 memcpy(memory + 4096 - 128, memory + 4096 + 128, 256); in test_eb_mem_ops()
767 memcpy_extent_buffer(eb, 4096 - 128, 4096 + 128, 256); in test_eb_mem_ops()
768 ret = verify_eb_and_memory(eb, memory, "cross page non-overlapping memcpy 2"); in test_eb_mem_ops()
772 memmove(memory + 4096 - 128, memory + 4096 - 64, 256); in test_eb_mem_ops()
773 memmove_extent_buffer(eb, 4096 - 128, 4096 - 64, 256); in test_eb_mem_ops()
774 ret = verify_eb_and_memory(eb, memory, "cross page overlapping memcpy 1"); in test_eb_mem_ops()
778 memmove(memory + 4096 - 64, memory + 4096 - 128, 256); in test_eb_mem_ops()
779 memmove_extent_buffer(eb, 4096 - 64, 4096 - 128, 256); in test_eb_mem_ops()
780 ret = verify_eb_and_memory(eb, memory, "cross page overlapping memcpy 2"); in test_eb_mem_ops()