/* * GPL HEADER START * * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * 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. * * 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 * 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) 2008, 2010, Oracle and/or its affiliates. All rights reserved. * Use is subject to license terms. * * Copyright (c) 2011, 2013, Intel Corporation. */ /* * This file is part of Lustre, http://www.lustre.org/ * Lustre is a trademark of Sun Microsystems, Inc. * * Implementation of cl_page for LOV layer. * * Author: Nikita Danilov * Author: Jinshan Xiong */ #define DEBUG_SUBSYSTEM S_LOV #include "lov_cl_internal.h" /** \addtogroup lov * @{ */ /***************************************************************************** * * Lov page operations. * */ /** * Adjust the stripe index by layout of raid0. @max_index is the maximum * page index covered by an underlying DLM lock. * This function converts max_index from stripe level to file level, and make * sure it's not beyond one stripe. */ static int lov_raid0_page_is_under_lock(const struct lu_env *env, const struct cl_page_slice *slice, struct cl_io *unused, pgoff_t *max_index) { struct lov_object *loo = cl2lov(slice->cpl_obj); struct lov_layout_raid0 *r0 = lov_r0(loo); pgoff_t index = *max_index; unsigned int pps; /* pages per stripe */ ENTRY; CDEBUG(D_READA, DFID "*max_index = %lu, nr = %d\n", PFID(lu_object_fid(lov2lu(loo))), index, r0->lo_nr); if (index == 0) /* the page is not covered by any lock */ RETURN(0); if (r0->lo_nr == 1) /* single stripe file */ RETURN(0); /* max_index is stripe level, convert it into file level */ if (index != CL_PAGE_EOF) { int stripeno = lov_page_stripe(slice->cpl_page); *max_index = lov_stripe_pgoff(loo->lo_lsm, index, stripeno); } /* calculate the end of current stripe */ pps = loo->lo_lsm->lsm_stripe_size >> PAGE_CACHE_SHIFT; index = slice->cpl_index + pps - slice->cpl_index % pps - 1; CDEBUG(D_READA, DFID "*max_index = %lu, index = %lu, pps = %u, " "stripe_size = %u, stripe no = %u, page index = %lu\n", PFID(lu_object_fid(lov2lu(loo))), *max_index, index, pps, loo->lo_lsm->lsm_stripe_size, lov_page_stripe(slice->cpl_page), slice->cpl_index); /* never exceed the end of the stripe */ *max_index = min_t(pgoff_t, *max_index, index); RETURN(0); } static int lov_raid0_page_print(const struct lu_env *env, const struct cl_page_slice *slice, void *cookie, lu_printer_t printer) { struct lov_page *lp = cl2lov_page(slice); return (*printer)(env, cookie, LUSTRE_LOV_NAME"-page@%p, raid0\n", lp); } static const struct cl_page_operations lov_raid0_page_ops = { .cpo_is_under_lock = lov_raid0_page_is_under_lock, .cpo_print = lov_raid0_page_print }; int lov_page_init_raid0(const struct lu_env *env, struct cl_object *obj, struct cl_page *page, pgoff_t index) { struct lov_object *loo = cl2lov(obj); struct lov_layout_raid0 *r0 = lov_r0(loo); struct lov_io *lio = lov_env_io(env); struct cl_object *subobj; struct cl_object *o; struct lov_io_sub *sub; struct lov_page *lpg = cl_object_page_slice(obj, page); loff_t offset; obd_off suboff; int stripe; int rc; ENTRY; offset = cl_offset(obj, index); stripe = lov_stripe_number(loo->lo_lsm, offset); LASSERT(stripe < r0->lo_nr); rc = lov_stripe_offset(loo->lo_lsm, offset, stripe, &suboff); LASSERT(rc == 0); lpg->lps_stripe = stripe; cl_page_slice_add(page, &lpg->lps_cl, obj, index, &lov_raid0_page_ops); sub = lov_sub_get(env, lio, stripe); if (IS_ERR(sub)) RETURN(PTR_ERR(sub)); subobj = lovsub2cl(r0->lo_sub[stripe]); list_for_each_entry(o, &subobj->co_lu.lo_header->loh_layers, co_lu.lo_linkage) { if (o->co_ops->coo_page_init != NULL) { rc = o->co_ops->coo_page_init(sub->sub_env, o, page, cl_index(subobj, suboff)); if (rc != 0) break; } } lov_sub_put(sub); RETURN(rc); } static int lov_empty_page_print(const struct lu_env *env, const struct cl_page_slice *slice, void *cookie, lu_printer_t printer) { struct lov_page *lp = cl2lov_page(slice); return (*printer)(env, cookie, LUSTRE_LOV_NAME"-page@%p, empty.\n", lp); } static const struct cl_page_operations lov_empty_page_ops = { .cpo_print = lov_empty_page_print }; int lov_page_init_empty(const struct lu_env *env, struct cl_object *obj, struct cl_page *page, pgoff_t index) { struct lov_page *lpg = cl_object_page_slice(obj, page); void *addr; ENTRY; cl_page_slice_add(page, &lpg->lps_cl, obj, index, &lov_empty_page_ops); addr = kmap(page->cp_vmpage); memset(addr, 0, cl_page_size(obj)); kunmap(page->cp_vmpage); cl_page_export(env, page, 1); RETURN(0); } /** @} lov */