X-Git-Url: https://git.whamcloud.com/?p=fs%2Flustre-release.git;a=blobdiff_plain;f=lustre%2Fllite%2Fllite_mmap.c;h=39d37566219e5e86b9a3fd8211dbab025a1b3039;hp=f1ff91a6407a20eed07cb45f8f95d39f3a099c8c;hb=15ac26cb2fc0b9b4c6c4507d8cdab683b9b40b7e;hpb=113303973ec9f8484eb2355a1a6ef3c4c7fd6a56 diff --git a/lustre/llite/llite_mmap.c b/lustre/llite/llite_mmap.c index f1ff91a..39d3756 100644 --- a/lustre/llite/llite_mmap.c +++ b/lustre/llite/llite_mmap.c @@ -1,24 +1,40 @@ /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*- * vim:expandtab:shiftwidth=8:tabstop=8: * - * Copyright (c) 2001-2003 Cluster File Systems, Inc. + * GPL HEADER START * - * This file is part of Lustre, http://www.lustre.org. + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * - * Lustre is free software; you can redistribute it and/or - * modify it under the terms of version 2 of the GNU General Public - * License as published by the Free Software Foundation. + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License version 2 only, + * as published by the Free Software Foundation. * - * Lustre is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. + * This program is distributed in the hope that it will be useful, but + * WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + * General Public License version 2 for more details (a copy is included + * in the LICENSE file that accompanied this code). * - * You should have received a copy of the GNU General Public License - * along with Lustre; if not, write to the Free Software - * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. + * You should have received a copy of the GNU General Public License + * version 2 along with this program; If not, see + * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf + * + * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, + * CA 95054 USA or visit www.sun.com if you need additional information or + * have any questions. + * + * GPL HEADER END + */ +/* + * Copyright (c) 2004, 2010, Oracle and/or its affiliates. All rights reserved. + * Use is subject to license terms. */ -#ifdef HAVE_KERNEL_CONFIG_H +/* + * This file is part of Lustre, http://www.lustre.org/ + * Lustre is a trademark of Sun Microsystems, Inc. + */ + +#ifndef AUTOCONF_INCLUDED #include #endif #include @@ -35,16 +51,13 @@ #include #include #include -#include #include #include #include -#if (LINUX_VERSION_CODE < KERNEL_VERSION(2,5,0)) -#include -#endif #define DEBUG_SUBSYSTEM S_LLITE +//#include #include #include "llite_internal.h" #include @@ -56,226 +69,22 @@ vma->vm_file->f_dentry->d_inode->i_ino, \ vma->vm_file->f_dentry->d_iname, ## arg); \ - -struct ll_lock_tree_node { - rb_node_t lt_node; - struct list_head lt_locked_item; - __u64 lt_oid; - ldlm_policy_data_t lt_policy; - struct lustre_handle lt_lockh; - ldlm_mode_t lt_mode; - struct inode *lt_inode; -}; - -int lt_get_mmap_locks(struct ll_lock_tree *tree, - unsigned long addr, size_t count); - -#if (LINUX_VERSION_CODE >= KERNEL_VERSION(2,5,0)) struct page *ll_nopage(struct vm_area_struct *vma, unsigned long address, int *type); -#else - -struct page *ll_nopage(struct vm_area_struct *vma, unsigned long address, - int unused); -#endif - -struct ll_lock_tree_node * ll_node_from_inode(struct inode *inode, __u64 start, - __u64 end, ldlm_mode_t mode) -{ - struct ll_lock_tree_node *node; - - OBD_ALLOC(node, sizeof(*node)); - if (node == NULL) - RETURN(ERR_PTR(-ENOMEM)); - - node->lt_inode = inode; - node->lt_oid = ll_i2info(inode)->lli_smd->lsm_object_id; - node->lt_policy.l_extent.start = start; - node->lt_policy.l_extent.end = end; - memset(&node->lt_lockh, 0, sizeof(node->lt_lockh)); - INIT_LIST_HEAD(&node->lt_locked_item); - node->lt_mode = mode; - - return node; -} -int lt_compare(struct ll_lock_tree_node *one, struct ll_lock_tree_node *two) -{ - /* To avoid multiple fs deadlock */ - if (one->lt_inode->i_sb->s_dev < two->lt_inode->i_sb->s_dev) - return -1; - if (one->lt_inode->i_sb->s_dev > two->lt_inode->i_sb->s_dev) - return 1; - - if (one->lt_oid < two->lt_oid) - return -1; - if (one->lt_oid > two->lt_oid) - return 1; - - if (one->lt_policy.l_extent.end < two->lt_policy.l_extent.start) - return -1; - if (one->lt_policy.l_extent.start > two->lt_policy.l_extent.end) - return 1; - - return 0; /* they are the same object and overlap */ -} - -static void lt_merge(struct ll_lock_tree_node *dst, - struct ll_lock_tree_node *src) -{ - dst->lt_policy.l_extent.start = min(dst->lt_policy.l_extent.start, - src->lt_policy.l_extent.start); - dst->lt_policy.l_extent.end = max(dst->lt_policy.l_extent.end, - src->lt_policy.l_extent.end); - - /* XXX could be a real call to the dlm to find superset modes */ - if (src->lt_mode == LCK_PW && dst->lt_mode != LCK_PW) - dst->lt_mode = LCK_PW; -} - -static void lt_insert(struct ll_lock_tree *tree, - struct ll_lock_tree_node *node) -{ - struct ll_lock_tree_node *walk; - rb_node_t **p, *parent; - ENTRY; - -restart: - p = &tree->lt_root.rb_node; - parent = NULL; - while (*p) { - parent = *p; - walk = rb_entry(parent, struct ll_lock_tree_node, lt_node); - switch (lt_compare(node, walk)) { - case -1: - p = &(*p)->rb_left; - break; - case 1: - p = &(*p)->rb_right; - break; - case 0: - lt_merge(node, walk); - rb_erase(&walk->lt_node, &tree->lt_root); - OBD_FREE(walk, sizeof(*walk)); - goto restart; - break; - default: - LBUG(); - break; - } - } - rb_link_node(&node->lt_node, parent, p); - rb_insert_color(&node->lt_node, &tree->lt_root); - EXIT; -} +static struct vm_operations_struct ll_file_vm_ops; -static struct ll_lock_tree_node *lt_least_node(struct ll_lock_tree *tree) -{ - rb_node_t *rbnode; - struct ll_lock_tree_node *node = NULL; - - for ( rbnode = tree->lt_root.rb_node; rbnode != NULL; - rbnode = rbnode->rb_left) { - if (rbnode->rb_left == NULL) { - node = rb_entry(rbnode, struct ll_lock_tree_node, - lt_node); - break; - } - } - RETURN(node); -} - -int ll_tree_unlock(struct ll_lock_tree *tree) -{ - struct ll_lock_tree_node *node; - struct list_head *pos, *n; - struct inode *inode; - int rc = 0; - ENTRY; - - list_for_each_safe(pos, n, &tree->lt_locked_list) { - node = list_entry(pos, struct ll_lock_tree_node, - lt_locked_item); - - inode = node->lt_inode; - rc = ll_extent_unlock(tree->lt_fd, inode, - ll_i2info(inode)->lli_smd, node->lt_mode, - &node->lt_lockh); - if (rc != 0) { - /* XXX better message */ - CERROR("couldn't unlock %d\n", rc); - } - list_del(&node->lt_locked_item); - OBD_FREE(node, sizeof(*node)); - } - - while ((node = lt_least_node(tree))) { - rb_erase(&node->lt_node, &tree->lt_root); - OBD_FREE(node, sizeof(*node)); - } - - RETURN(rc); -} - -int ll_tree_lock(struct ll_lock_tree *tree, - struct ll_lock_tree_node *first_node, - const char *buf, size_t count, int ast_flags) -{ - struct ll_lock_tree_node *node; - int rc = 0; - ENTRY; - - tree->lt_root.rb_node = NULL; - INIT_LIST_HEAD(&tree->lt_locked_list); - if (first_node != NULL) - lt_insert(tree, first_node); - - /* To avoid such subtle deadlock case: client1 try to read file1 to - * mmapped file2, on the same time, client2 try to read file2 to - * mmapped file1.*/ - rc = lt_get_mmap_locks(tree, (unsigned long)buf, count); - if (rc) - GOTO(out, rc); - - while ((node = lt_least_node(tree))) { - struct inode *inode = node->lt_inode; - rc = ll_extent_lock(tree->lt_fd, inode, - ll_i2info(inode)->lli_smd, node->lt_mode, - &node->lt_policy, &node->lt_lockh, - ast_flags); - if (rc != 0) - GOTO(out, rc); - - rb_erase(&node->lt_node, &tree->lt_root); - list_add_tail(&node->lt_locked_item, &tree->lt_locked_list); - } - RETURN(rc); -out: - ll_tree_unlock(tree); - RETURN(rc); -} - -static ldlm_mode_t mode_from_vma(struct vm_area_struct *vma) -{ - /* we only want to hold PW locks if the mmap() can generate - * writes back to the file and that only happens in shared - * writable vmas */ - if ((vma->vm_flags & VM_SHARED) && (vma->vm_flags & VM_WRITE)) - return LCK_PW; - return LCK_PR; -} - -static void policy_from_vma(ldlm_policy_data_t *policy, +void policy_from_vma(ldlm_policy_data_t *policy, struct vm_area_struct *vma, unsigned long addr, size_t count) { policy->l_extent.start = ((addr - vma->vm_start) & CFS_PAGE_MASK) + - ((__u64)vma->vm_pgoff << CFS_PAGE_SHIFT); + (vma->vm_pgoff << CFS_PAGE_SHIFT); policy->l_extent.end = (policy->l_extent.start + count - 1) | ~CFS_PAGE_MASK; } -static struct vm_area_struct * our_vma(unsigned long addr, size_t count) +struct vm_area_struct * our_vma(unsigned long addr, size_t count) { struct mm_struct *mm = current->mm; struct vm_area_struct *vma, *ret = NULL; @@ -288,7 +97,7 @@ static struct vm_area_struct * our_vma(unsigned long addr, size_t count) spin_lock(&mm->page_table_lock); for(vma = find_vma(mm, addr); vma != NULL && vma->vm_start < (addr + count); vma = vma->vm_next) { - if (vma->vm_ops && vma->vm_ops->nopage == ll_nopage && + if (vma->vm_ops && vma->vm_ops == &ll_file_vm_ops && vma->vm_flags & VM_SHARED) { ret = vma; break; @@ -298,229 +107,264 @@ static struct vm_area_struct * our_vma(unsigned long addr, size_t count) RETURN(ret); } -int lt_get_mmap_locks(struct ll_lock_tree *tree, - unsigned long addr, size_t count) +/** + * API independent part for page fault initialization. + * \param vma - virtual memory area addressed to page fault + * \param env - corespondent lu_env to processing + * \param nest - nested level + * \param index - page index corespondent to fault. + * \parm ra_flags - vma readahead flags. + * + * \return allocated and initialized env for fault operation. + * \retval EINVAL if env can't allocated + * \return other error codes from cl_io_init. + */ +struct cl_io *ll_fault_io_init(struct vm_area_struct *vma, + struct lu_env **env_ret, + struct cl_env_nest *nest, + pgoff_t index, unsigned long *ra_flags) { - struct vm_area_struct *vma; - struct ll_lock_tree_node *node; - ldlm_policy_data_t policy; - struct inode *inode; + struct file *file = vma->vm_file; + struct inode *inode = file->f_dentry->d_inode; + const unsigned long writable = VM_SHARED|VM_WRITE; + struct cl_io *io; + struct cl_fault_io *fio; + struct lu_env *env; ENTRY; - if (count == 0) - RETURN(0); + *env_ret = NULL; + if (ll_file_nolock(file)) + RETURN(ERR_PTR(-EOPNOTSUPP)); - /* we need to look up vmas on page aligned addresses */ - count += addr & (~CFS_PAGE_MASK); - addr &= CFS_PAGE_MASK; + /* + * page fault can be called when lustre IO is + * already active for the current thread, e.g., when doing read/write + * against user level buffer mapped from Lustre buffer. To avoid + * stomping on existing context, optionally force an allocation of a new + * one. + */ + env = cl_env_nested_get(nest); + if (IS_ERR(env)) + RETURN(ERR_PTR(-EINVAL)); - while ((vma = our_vma(addr, count)) != NULL) { - LASSERT(vma->vm_file); + *env_ret = env; - inode = vma->vm_file->f_dentry->d_inode; - policy_from_vma(&policy, vma, addr, count); - node = ll_node_from_inode(inode, policy.l_extent.start, - policy.l_extent.end, - mode_from_vma(vma)); - if (IS_ERR(node)) { - CERROR("not enough mem for lock_tree_node!\n"); - RETURN(-ENOMEM); - } - lt_insert(tree, node); + io = ccc_env_thread_io(env); + io->ci_obj = ll_i2info(inode)->lli_clob; + LASSERT(io->ci_obj != NULL); - if (vma->vm_end - addr >= count) - break; - count -= vma->vm_end - addr; - addr = vma->vm_end; + fio = &io->u.ci_fault; + fio->ft_index = index; + fio->ft_writable = (vma->vm_flags&writable) == writable; + fio->ft_executable = vma->vm_flags&VM_EXEC; + + /* + * disable VM_SEQ_READ and use VM_RAND_READ to make sure that + * the kernel will not read other pages not covered by ldlm in + * filemap_nopage. we do our readahead in ll_readpage. + */ + *ra_flags = vma->vm_flags & (VM_RAND_READ|VM_SEQ_READ); + vma->vm_flags &= ~VM_SEQ_READ; + vma->vm_flags |= VM_RAND_READ; + + CDEBUG(D_INFO, "vm_flags: %lx (%lu %d %d)\n", vma->vm_flags, + fio->ft_index, fio->ft_writable, fio->ft_executable); + + if (cl_io_init(env, io, CIT_FAULT, io->ci_obj) == 0) { + struct ccc_io *cio = ccc_env_io(env); + struct ll_file_data *fd = LUSTRE_FPRIVATE(file); + + LASSERT(cio->cui_cl.cis_io == io); + + /* mmap lock must be MANDATORY + * it has to cache pages. */ + io->ci_lockreq = CILR_MANDATORY; + + cio->cui_fd = fd; } - RETURN(0); + + return io; } -/* FIXME: there is a pagefault race goes as follow (only 2.4): - * 1. A user process on node A accesses a portion of a mapped file, - * resulting in a page fault. The pagefault handler invokes the - * ll_nopage function, which reads the page into memory. - * 2. A user process on node B writes to the same portion of the file - * (either via mmap or write()), that cause node A to cancel the - * lock and truncate the page. - * 3. Node A then executes the rest of do_no_page(), entering the - * now-invalid page into the PTEs. +#ifndef HAVE_VM_OP_FAULT +/** + * Lustre implementation of a vm_operations_struct::nopage() method, called by + * VM to server page fault (both in kernel and user space). + * + * This function sets up CIT_FAULT cl_io that does the job. * - * Make the whole do_no_page as a hook to cover both the page cache - * and page mapping installing with dlm lock would eliminate this race. + * \param vma - is virtiual area struct related to page fault + * \param address - address when hit fault + * \param type - of fault * - * In 2.6, the truncate_count of address_space can cover this race. + * \return allocated and filled _unlocked_ page for address + * \retval NOPAGE_SIGBUS if page not exist on this address + * \retval NOPAGE_OOM not have memory for allocate new page */ -#if (LINUX_VERSION_CODE >= KERNEL_VERSION(2,5,0)) struct page *ll_nopage(struct vm_area_struct *vma, unsigned long address, int *type) -#else -struct page *ll_nopage(struct vm_area_struct *vma, unsigned long address, - int type /* unused */) -#endif { - struct file *filp = vma->vm_file; - struct ll_file_data *fd = LUSTRE_FPRIVATE(filp); - struct inode *inode = filp->f_dentry->d_inode; - struct lustre_handle lockh = { 0 }; - ldlm_policy_data_t policy; - ldlm_mode_t mode; - struct page *page = NULL; - struct ll_inode_info *lli = ll_i2info(inode); - struct lov_stripe_md *lsm; - struct ost_lvb lvb; - __u64 kms, old_mtime; - unsigned long pgoff, size, rand_read, seq_read; - int rc = 0; + struct lu_env *env; + struct cl_env_nest nest; + struct cl_io *io; + struct page *page = NOPAGE_SIGBUS; + struct vvp_io *vio = NULL; + unsigned long ra_flags; + pgoff_t pg_offset; + int result; ENTRY; - if (lli->lli_smd == NULL) { - CERROR("No lsm on fault?\n"); - RETURN(NULL); - } - - /* start and end the lock on the first and last bytes in the page */ - policy_from_vma(&policy, vma, address, CFS_PAGE_SIZE); - - CDEBUG(D_MMAP, "nopage vma %p inode %lu, locking ["LPU64", "LPU64"]\n", - vma, inode->i_ino, policy.l_extent.start, policy.l_extent.end); + pg_offset = ((address - vma->vm_start) >> PAGE_SHIFT) + vma->vm_pgoff; + io = ll_fault_io_init(vma, &env, &nest, pg_offset, &ra_flags); + if (IS_ERR(io)) + return NOPAGE_SIGBUS; - mode = mode_from_vma(vma); - old_mtime = LTIME_S(inode->i_mtime); + result = io->ci_result; + if (result < 0) + goto out_err; - lsm = lli->lli_smd; - rc = ll_extent_lock(fd, inode, lsm, mode, &policy, - &lockh, LDLM_FL_CBPENDING | LDLM_FL_NO_LRU); - if (rc != 0) - RETURN(NULL); - - if (vma->vm_flags & VM_EXEC && LTIME_S(inode->i_mtime) != old_mtime) - CWARN("binary changed. inode %lu\n", inode->i_ino); - - lov_stripe_lock(lsm); - inode_init_lvb(inode, &lvb); - obd_merge_lvb(ll_i2obdexp(inode), lsm, &lvb, 1); - kms = lvb.lvb_size; + vio = vvp_env_io(env); + vio->u.fault.ft_vma = vma; + vio->u.fault.nopage.ft_address = address; + vio->u.fault.nopage.ft_type = type; - pgoff = ((address - vma->vm_start) >> CFS_PAGE_SHIFT) + vma->vm_pgoff; - size = (kms + CFS_PAGE_SIZE - 1) >> CFS_PAGE_SHIFT; + result = cl_io_loop(env, io); - if (pgoff >= size) { - lov_stripe_unlock(lsm); - ll_glimpse_size(inode, LDLM_FL_BLOCK_GRANTED); +out_err: + if (result == 0) { + LASSERT(io->u.ci_fault.ft_page != NULL); + page = vio->u.fault.ft_vmpage; } else { - /* XXX change inode size without ll_inode_size_lock() held! - * there is a race condition with truncate path. (see - * ll_extent_lock) */ - /* region is within kms and, hence, within real file size (A). - * We need to increase i_size to cover the read region so that - * generic_file_read() will do its job, but that doesn't mean - * the kms size is _correct_, it is only the _minimum_ size. - * If someone does a stat they will get the correct size which - * will always be >= the kms value here. b=11081 */ - if (inode->i_size < kms) { - inode->i_size = kms; - CDEBUG(D_INODE, "ino=%lu, updating i_size %llu\n", - inode->i_ino, inode->i_size); - } - lov_stripe_unlock(lsm); + if (result == -ENOMEM) + page = NOPAGE_OOM; } - /* If mapping is writeable, adjust kms to cover this page, - * but do not extend kms beyond actual file size. - * policy.l_extent.end is set to the end of the page by policy_from_vma - * bug 10919 */ - lov_stripe_lock(lsm); - if (mode == LCK_PW) - obd_adjust_kms(ll_i2obdexp(inode), lsm, - min_t(loff_t, policy.l_extent.end,inode->i_size), - 0); - lov_stripe_unlock(lsm); - - /* disable VM_SEQ_READ and use VM_RAND_READ to make sure that - * the kernel will not read other pages not covered by ldlm in - * filemap_nopage. we do our readahead in ll_readpage. - */ - rand_read = vma->vm_flags & VM_RAND_READ; - seq_read = vma->vm_flags & VM_SEQ_READ; - vma->vm_flags &= ~ VM_SEQ_READ; - vma->vm_flags |= VM_RAND_READ; - - page = filemap_nopage(vma, address, type); - LL_CDEBUG_PAGE(D_PAGE, page, "got addr %lu type %lx\n", address, - (long)type); vma->vm_flags &= ~VM_RAND_READ; - vma->vm_flags |= (rand_read | seq_read); + vma->vm_flags |= ra_flags; + + cl_io_fini(env, io); + cl_env_nested_put(&nest, env); - ll_extent_unlock(fd, inode, ll_i2info(inode)->lli_smd, mode, &lockh); RETURN(page); } - -/* To avoid cancel the locks covering mmapped region for lock cache pressure, - * we track the mapped vma count by lli_mmap_cnt. - * ll_vm_open(): when first vma is linked, split locks from lru. - * ll_vm_close(): when last vma is unlinked, join all this file's locks to lru. +#else +/** + * Lustre implementation of a vm_operations_struct::fault() method, called by + * VM to server page fault (both in kernel and user space). + * + * \param vma - is virtiual area struct related to page fault + * \param vmf - structure which describe type and address where hit fault * - * XXX we don't check the if the region of vma/lock for performance. + * \return allocated and filled _locked_ page for address + * \retval VM_FAULT_ERROR on general error + * \retval NOPAGE_OOM not have memory for allocate new page */ -static void ll_vm_open(struct vm_area_struct * vma) +int ll_fault0(struct vm_area_struct *vma, struct vm_fault *vmf) { - struct inode *inode = vma->vm_file->f_dentry->d_inode; - struct ll_inode_info *lli = ll_i2info(inode); + struct lu_env *env; + struct cl_io *io; + struct vvp_io *vio = NULL; + unsigned long ra_flags; + struct cl_env_nest nest; + int result; + int fault_ret = 0; ENTRY; - LASSERT(vma->vm_file); + io = ll_fault_io_init(vma, &env, &nest, vmf->pgoff, &ra_flags); + if (IS_ERR(io)) + RETURN(VM_FAULT_ERROR); - spin_lock(&lli->lli_lock); - LASSERT(atomic_read(&lli->lli_mmap_cnt) >= 0); + result = io->ci_result; + if (result < 0) + goto out_err; - atomic_inc(&lli->lli_mmap_cnt); - if (atomic_read(&lli->lli_mmap_cnt) == 1) { - struct lov_stripe_md *lsm = lli->lli_smd; - struct ll_sb_info *sbi = ll_i2sbi(inode); - int count; + vio = vvp_env_io(env); + vio->u.fault.ft_vma = vma; + vio->u.fault.ft_vmpage = NULL; + vio->u.fault.fault.ft_vmf = vmf; - spin_unlock(&lli->lli_lock); + result = cl_io_loop(env, io); + fault_ret = vio->u.fault.fault.ft_flags; - if (!lsm) - return; - count = obd_join_lru(sbi->ll_osc_exp, lsm, 0); - VMA_DEBUG(vma, "split %d unused locks from lru\n", count); - } else { - spin_unlock(&lli->lli_lock); - } +out_err: + if (result != 0) + fault_ret |= VM_FAULT_ERROR; + + vma->vm_flags |= ra_flags; + cl_io_fini(env, io); + cl_env_nested_put(&nest, env); + + RETURN(fault_ret); } -static void ll_vm_close(struct vm_area_struct *vma) +int ll_fault(struct vm_area_struct *vma, struct vm_fault *vmf) { - struct inode *inode = vma->vm_file->f_dentry->d_inode; - struct ll_inode_info *lli = ll_i2info(inode); - ENTRY; + int count = 0; + bool printed = false; + int result; - LASSERT(vma->vm_file); +restart: + result = ll_fault0(vma, vmf); + LASSERT(!(result & VM_FAULT_LOCKED)); + if (result == 0) { + struct page *vmpage = vmf->page; + + /* check if this page has been truncated */ + lock_page(vmpage); + if (unlikely(vmpage->mapping == NULL)) { /* unlucky */ + unlock_page(vmpage); + page_cache_release(vmpage); + vmf->page = NULL; + + if (!printed && ++count > 16) { + CWARN("the page is under heavy contention," + "maybe your app(%s) needs revising :-)\n", + current->comm); + printed = true; + } - spin_lock(&lli->lli_lock); - LASSERT(atomic_read(&lli->lli_mmap_cnt) > 0); + goto restart; + } - atomic_dec(&lli->lli_mmap_cnt); - if (atomic_read(&lli->lli_mmap_cnt) == 0) { - struct lov_stripe_md *lsm = lli->lli_smd; - struct ll_sb_info *sbi = ll_i2sbi(inode); - int count; + result |= VM_FAULT_LOCKED; + } + return result; +} +#endif - spin_unlock(&lli->lli_lock); +/** + * To avoid cancel the locks covering mmapped region for lock cache pressure, + * we track the mapped vma count in ccc_object::cob_mmap_cnt. + */ +static void ll_vm_open(struct vm_area_struct * vma) +{ + struct inode *inode = vma->vm_file->f_dentry->d_inode; + struct ccc_object *vob = cl_inode2ccc(inode); - if (!lsm) - return; - count = obd_join_lru(sbi->ll_osc_exp, lsm, 1); - VMA_DEBUG(vma, "join %d unused locks to lru\n", count); - } else { - spin_unlock(&lli->lli_lock); - } + ENTRY; + LASSERT(vma->vm_file); + LASSERT(cfs_atomic_read(&vob->cob_mmap_cnt) >= 0); + cfs_atomic_inc(&vob->cob_mmap_cnt); + EXIT; +} + +/** + * Dual to ll_vm_open(). + */ +static void ll_vm_close(struct vm_area_struct *vma) +{ + struct inode *inode = vma->vm_file->f_dentry->d_inode; + struct ccc_object *vob = cl_inode2ccc(inode); + + ENTRY; + LASSERT(vma->vm_file); + cfs_atomic_dec(&vob->cob_mmap_cnt); + LASSERT(cfs_atomic_read(&vob->cob_mmap_cnt) >= 0); + EXIT; } -#if (LINUX_VERSION_CODE >= KERNEL_VERSION(2,5,0)) +#ifndef HAVE_VM_OP_FAULT #ifndef HAVE_FILEMAP_POPULATE static int (*filemap_populate)(struct vm_area_struct * area, unsigned long address, unsigned long len, pgprot_t prot, unsigned long pgoff, int nonblock); #endif @@ -544,47 +388,6 @@ static inline unsigned long file_to_user(struct vm_area_struct *vma, __u64 byte) } -#if (LINUX_VERSION_CODE < KERNEL_VERSION(2,5,0)) -/* [first, last] are the byte offsets affected. - * vm_{start, end} are user addresses of the first byte of the mapping and - * the next byte beyond it - * vm_pgoff is the page index of the first byte in the mapping */ -static void teardown_vmas(struct vm_area_struct *vma, __u64 first, - __u64 last) -{ - unsigned long address, len; - for (; vma ; vma = vma->vm_next_share) { - if (last >> CFS_PAGE_SHIFT < vma->vm_pgoff) - continue; - if (first >> CFS_PAGE_SHIFT >= (vma->vm_pgoff + - ((vma->vm_end - vma->vm_start) >> CFS_PAGE_SHIFT))) - continue; - - /* XXX in case of unmap the cow pages of a running file, - * don't unmap these private writeable mapping here! - * though that will break private mappping a little. - * - * the clean way is to check the mapping of every page - * and just unmap the non-cow pages, just like - * unmap_mapping_range() with even_cow=0 in kernel 2.6. - */ - if (!(vma->vm_flags & VM_SHARED) && - (vma->vm_flags & VM_WRITE)) - continue; - - address = max((unsigned long)vma->vm_start, - file_to_user(vma, first)); - len = min((unsigned long)vma->vm_end, - file_to_user(vma, last) + 1) - address; - - VMA_DEBUG(vma, "zapping vma [first="LPU64" last="LPU64" " - "address=%ld len=%ld]\n", first, last, address, len); - LASSERT(len > 0); - ll_zap_page_range(vma, address, len); - } -} -#endif - /* XXX put nice comment here. talk about __free_pte -> dirty pages and * nopage's reference passing to the pte */ int ll_teardown_mmaps(struct address_space *mapping, __u64 first, __u64 last) @@ -593,53 +396,47 @@ int ll_teardown_mmaps(struct address_space *mapping, __u64 first, __u64 last) ENTRY; LASSERTF(last > first, "last "LPU64" first "LPU64"\n", last, first); -#if (LINUX_VERSION_CODE >= KERNEL_VERSION(2,5,0)) if (mapping_mapped(mapping)) { rc = 0; unmap_mapping_range(mapping, first + CFS_PAGE_SIZE - 1, last - first + 1, 0); } -#else - spin_lock(&mapping->i_shared_lock); - if (mapping->i_mmap != NULL) { - rc = 0; - teardown_vmas(mapping->i_mmap, first, last); - } - if (mapping->i_mmap_shared != NULL) { - rc = 0; - teardown_vmas(mapping->i_mmap_shared, first, last); - } - spin_unlock(&mapping->i_shared_lock); -#endif + RETURN(rc); } static struct vm_operations_struct ll_file_vm_ops = { +#ifndef HAVE_VM_OP_FAULT .nopage = ll_nopage, - .open = ll_vm_open, - .close = ll_vm_close, -#if (LINUX_VERSION_CODE >= KERNEL_VERSION(2,5,0)) .populate = ll_populate, + +#else + .fault = ll_fault, #endif + .open = ll_vm_open, + .close = ll_vm_close, }; -int ll_file_mmap(struct file * file, struct vm_area_struct * vma) +int ll_file_mmap(struct file *file, struct vm_area_struct * vma) { + struct inode *inode = file->f_dentry->d_inode; int rc; ENTRY; - ll_vfs_ops_tally(ll_i2sbi(file->f_dentry->d_inode), VFS_OPS_MMAP); + if (ll_file_nolock(file)) + RETURN(-EOPNOTSUPP); + + ll_stats_ops_tally(ll_i2sbi(inode), LPROC_LL_MAP, 1); rc = generic_file_mmap(file, vma); if (rc == 0) { -#if !defined(HAVE_FILEMAP_POPULATE) && \ - (LINUX_VERSION_CODE >= KERNEL_VERSION(2,5,0)) +#if !defined(HAVE_FILEMAP_POPULATE) && !defined(HAVE_VM_OP_FAULT) if (!filemap_populate) filemap_populate = vma->vm_ops->populate; #endif vma->vm_ops = &ll_file_vm_ops; vma->vm_ops->open(vma); /* update the inode's size and mtime */ - rc = ll_glimpse_size(file->f_dentry->d_inode, 0); + rc = cl_glimpse_size(inode); } RETURN(rc);