search for: get_ext

...=$(realpath $scratchdir/mnt/3) checkit "$RSYNC -a --clone-dest='$clonedir' '$scratchdir/mnt/1/' '$scratchdir/mnt/2/'" "$scratchdir/mnt/1/" "$scratchdir/mnt/2/" sync $scratchdir/mnt/2/a sync $scratchdir/mnt/2/b # check the extents are the same get_extents() { result=$(btrfs-search-metadata file $1 | grep disk_bytenr | sed 's/.*disk_bytenr\ //' | sed 's/\ disk_num_bytes.*//') if [ ! -n "$result" ]; then echo "couldn't find extents for " $1 fi echo "$result" } test "$(...

...prefetchw(&page->flags); list_del(&page->lru); + + if (!pagelst) + pagelst = kmalloc(sizeof(*pagelst), GFP_NOFS); + if (!pagelst) + delay_read = false; + if (!add_to_page_cache_lru(page, mapping, page->index, GFP_NOFS)) { - __extent_read_full_page(tree, page, get_extent, - &bio, 0, &bio_flags); + if (delay_read) { + pagelst->page = page; + list_add(&pagelst->lst, &page_pool); + page_cache_get(page); + pagelst = NULL; + } else { + __extent_read_full_page(tree, page, get_extent, + &bio, 0, &bio_flags); +...

Hi, The following series of patches implements in btrfs an ioctl to do out-of-band deduplication of file extents. To be clear, this means that the file system is mounted and running, but the dedupe is not done during file writes, but after the fact when some userspace software initiates a dedupe. The primary patch is loosely based off of one sent by Josef Bacik back in January, 2011.

I pushed a few of the msys2 patches upstream. I changed the way that $(SHARED_LDFLAGS) works so it's more to my liking, and the others were pushed unchanged. Three patches remain which I'm posting on the mailing list for proper review. Rich.

...(void); + int (*peer_name) (void *addr, void *addrlen); + void (*shutdown) (void); + + struct nbdkit_extents *(*extents_new) (uint64_t start, uint64_t end); + void (*extents_free) (struct nbdkit_extents *); + size_t (*extents_count) (const struct nbdkit_extents *); + struct nbdkit_extent (*get_extent) (const struct nbdkit_extents *, size_t); + int (*add_extent) (struct nbdkit_extents *, uint64_t offset, uint64_t length, + uint32_t type); + + void (*set_error) (int err); +}; + +struct nbdkit_functions _nbdkit_functions; +#endif + +#ifdef __cplusplus +} +#endif +#endif +#e...

...extent_map.h --- a/extent_map.h Thu Sep 20 14:14:42 2007 -0400 +++ b/extent_map.h Tue Nov 06 19:06:04 2007 -0500 @@ -78,7 +78,7 @@ void free_extent_map(struct extent_map * void free_extent_map(struct extent_map *em); int extent_read_full_page(struct extent_map_tree *tree, struct page *page, get_extent_t *get_extent); -void __init extent_map_init(void); +int __init extent_map_init(void); void __exit extent_map_exit(void); int extent_clean_all_trees(struct extent_map_tree *tree); int set_extent_uptodate(struct extent_map_tree *tree, u64 start, u64 end, diff -r 29b8cc7794ac super.c --- a/supe...

We''ve been hitting BUG()''s in btrfs_cont_expand and btrfs_fallocate and anywhere else that calls btrfs_get_extent while running xfstests 13 in a loop. This is because fiemap is calling btrfs_get_extent with non-sectorsize aligned offsets, which will end up adding mappings that are not sectorsize aligned, which will cause problems in some cases for subsequent calls to btrfs_get_extent for similar areas that...

...;peer_name = dummy_peer_name; + functions->shutdown = nbdkit_shutdown; + functions->add_extent = nbdkit_add_extent; + functions->extents_new = nbdkit_extents_new; + functions->extents_free = nbdkit_extents_free; + functions->extents_count = nbdkit_extents_count; + functions->get_extent = nbdkit_get_extent; +} +#endif + int main (int argc, char *argv[]) { @@ -178,6 +222,9 @@ main (int argc, char *argv[]) perror ("expecting stdin/stdout to be opened"); exit (EXIT_FAILURE); } +#ifdef WINDOWS_COMPAT + init_functions (); +#endif #if !ENABLE_LIBFUZZER...

While testing raid-auto-repair patches I''m going to send out later, I just found the very last bug in my current scrub patch series: Changelog v4->v5: - fixed a deadlock when fixup is taking longer while scrub is about to end Original message follows: ------------------------ This patch set introduces two new features for scrub. They share the backref iteration code which is the

...flags); list_del(&page->lru); + + if (!pagelst) + pagelst = kmalloc(sizeof(*pagelst), GFP_NOFS); + + if (!pagelst) { + page_cache_release(page); + continue; + } if (!add_to_page_cache_lru(page, mapping, page->index, GFP_NOFS)) { - __extent_read_full_page(tree, page, get_extent, - &bio, 0, &bio_flags); + pagelst->page = page; + list_add(&pagelst->lst, &page_pool); + page_cache_get(page); + pagelst = NULL; } page_cache_release(page); } + + while (!list_empty(&page_pool)) { + struct page *page; + + pagelst = list_entry(pag...

Hi all - The following 9 patches add more error handling to the btrfs code: - Add btrfs_panic - Catch locking failures in {set,clear}_extent_bit - Push up set_extent_bit errors to callers - Push up lock_extent errors to callers - Push up clear_extent_bit errors to callers - Push up unlock_extent errors to callers - Make pin_down_extent return void - Push up btrfs_pin_extent errors to

This series introduces a generic readahead interface for btrfs trees. The intention is to use it to speed up scrub in a first run, but balance is another hot candidate. In general, every tree walk could be accompanied by a readahead. Deletion of large files comes to mind, where the fetching of the csums takes most of the time. Also the initial build-ups of free-space-caches and

...5.116488] [<ffffffff81255810>] ? end_bio_extent_readpage+0x0/0x210 > [ 605.116654] [<ffffffff81257241>] ? __extent_read_full_page+0x4e1/0x680 > [ 605.116820] [<ffffffff81255810>] ? end_bio_extent_readpage+0x0/0x210 > [ 605.116990] [<ffffffff8122c260>] ? btree_get_extent+0x0/0x1e0 > [ 605.117151] [<ffffffff81257660>] ? read_extent_buffer_pages+0x280/0x3c0 > [ 605.117320] [<ffffffff812d77ec>] ? radix_tree_insert+0x1bc/0x210 > [ 605.117488] [<ffffffff8122c260>] ? btree_get_extent+0x0/0x1e0 > [ 605.117651] [<ffffffff8122e945...

This series introduces a generic readahead interface for btrfs trees. The intention is to use it to speed up scrub in a first run, but balance is another hot candidate. In general, every tree walk could be accompanied by a readahead. Deletion of large files comes to mind, where the fetching of the csums takes most of the time. Also the initial build-ups of free-space-caches and

Hi all - Here''s my current error handling patchset, against 3.1-rc8. Almost all of this patchset is preparing for actual error handling. Before we start in on that work, I''m trying to reduce the surface we need to worry about. It turns out that there is a ton of code that returns an error code but never actually reports an error. The patchset has grown to 65 patches. 46 of them