dax.c (6d75f366b9242f9b17ed7d0b0604d7460f818f21) dax.c (4d693d08607ab319095ec8942909df4b4aebdf66)
1/*
2 * fs/dax.c - Direct Access filesystem code
3 * Copyright (c) 2013-2014 Intel Corporation
4 * Author: Matthew Wilcox <matthew.r.wilcox@intel.com>
5 * Author: Ross Zwisler <ross.zwisler@linux.intel.com>
6 *
7 * This program is free software; you can redistribute it and/or modify it
8 * under the terms and conditions of the GNU General Public License,

--- 635 unchanged lines hidden (view full) ---

644 mapping->nrexceptional++;
645 } else {
646 struct radix_tree_node *node;
647 void **slot;
648 void *ret;
649
650 ret = __radix_tree_lookup(page_tree, index, &node, &slot);
651 WARN_ON_ONCE(ret != entry);
1/*
2 * fs/dax.c - Direct Access filesystem code
3 * Copyright (c) 2013-2014 Intel Corporation
4 * Author: Matthew Wilcox <matthew.r.wilcox@intel.com>
5 * Author: Ross Zwisler <ross.zwisler@linux.intel.com>
6 *
7 * This program is free software; you can redistribute it and/or modify it
8 * under the terms and conditions of the GNU General Public License,

--- 635 unchanged lines hidden (view full) ---

644 mapping->nrexceptional++;
645 } else {
646 struct radix_tree_node *node;
647 void **slot;
648 void *ret;
649
650 ret = __radix_tree_lookup(page_tree, index, &node, &slot);
651 WARN_ON_ONCE(ret != entry);
652 __radix_tree_replace(page_tree, node, slot, new_entry);
652 __radix_tree_replace(page_tree, node, slot,
653 new_entry, NULL, NULL);
653 }
654 if (vmf->flags & FAULT_FLAG_WRITE)
655 radix_tree_tag_set(page_tree, index, PAGECACHE_TAG_DIRTY);
656 unlock:
657 spin_unlock_irq(&mapping->tree_lock);
658 if (hole_fill) {
659 radix_tree_preload_end();
660 /*

--- 812 unchanged lines hidden --- 		654 }
655 if (vmf->flags & FAULT_FLAG_WRITE)
656 radix_tree_tag_set(page_tree, index, PAGECACHE_TAG_DIRTY);
657 unlock:
658 spin_unlock_irq(&mapping->tree_lock);
659 if (hole_fill) {
660 radix_tree_preload_end();
661 /*

--- 812 unchanged lines hidden ---