search for: start_objectid

...quot;. In general the values set are the last one returned "+1". But doing so we reduce the "acceptance criteria window". I propose to add three more fields in the struct btrfs_ioctl_search_key: + /* starting search key fields */ + __u32 start_type; + __u64 start_objectid; + __u64 start_offset; Is resposibility of the program to fill these fields during the begin of the search. If these are 0, the code set these to the min_* values. At the end of the search the kernel code stores the last key found + 1, in accordance of the "acceptance criteria"....

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

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