Displaying 3 results from an estimated 3 matches for "kern_cont".
2011 Jun 29
14
[PATCH v4 0/6] btrfs: generic readeahead interface
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
2011 Jun 10
6
[PATCH v2 0/6] btrfs: generic readeahead interface
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
2010 Dec 08
2
[PATCH] xen: gntdev: move use of GNTMAP_contains_pte next to the map_op
...priv->lock);
for (address = vma->vm_start; address < vma->vm_end; address += PAGE_SIZE)
{
struct page *page = alloc_page(GFP_KERNEL|__GFP_ZERO); //get_zeroed_page(GFP_KERNEL);
@@ -112,17 +117,22 @@ static int hypercall_mmap(struct file *file, struct vm_area_struct *vma)
printk(KERN_CONT " vm_insert_page -> %d count %d", ret, page_count(page));
if (ret) {
printk(KERN_CONT ": failure!\n");
- return -EINVAL;
+ goto out_unlock;
}
printk(KERN_CONT " %p<-page->%p\n", page->lru.prev, page->lru.next);
list_add_tail(&page...