Whamcloud - gitweb
branch: HEAD
[fs/lustre-release.git] / lustre / lov / lov_page.c
1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
2  * vim:expandtab:shiftwidth=8:tabstop=8:
3  *
4  * GPL HEADER START
5  *
6  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
7  *
8  * This program is free software; you can redistribute it and/or modify
9  * it under the terms of the GNU General Public License version 2 only,
10  * as published by the Free Software Foundation.
11  *
12  * This program is distributed in the hope that it will be useful, but
13  * WITHOUT ANY WARRANTY; without even the implied warranty of
14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
15  * General Public License version 2 for more details (a copy is included
16  * in the LICENSE file that accompanied this code).
17  *
18  * You should have received a copy of the GNU General Public License
19  * version 2 along with this program; If not, see
20  * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
21  *
22  * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
23  * CA 95054 USA or visit www.sun.com if you need additional information or
24  * have any questions.
25  *
26  * GPL HEADER END
27  */
28 /*
29  * Copyright 2008 Sun Microsystems, Inc.  All rights reserved.
30  * Use is subject to license terms.
31  */
32 /*
33  * This file is part of Lustre, http://www.lustre.org/
34  * Lustre is a trademark of Sun Microsystems, Inc.
35  *
36  * Implementation of cl_page for LOV layer.
37  *
38  *   Author: Nikita Danilov <nikita.danilov@sun.com>
39  */
40
41 #define DEBUG_SUBSYSTEM S_LOV
42
43 #include "lov_cl_internal.h"
44
45 /** \addtogroup lov lov @{ */
46
47 /*****************************************************************************
48  *
49  * Lov page operations.
50  *
51  */
52
53 static int lov_page_invariant(const struct cl_page_slice *slice)
54 {
55         const struct cl_page  *page = slice->cpl_page;
56         const struct cl_page  *sub  = lov_sub_page(slice);
57
58         return ergo(sub != NULL,
59                     page->cp_child == sub &&
60                     sub->cp_parent == page &&
61                     page->cp_state == sub->cp_state);
62 }
63
64 static void lov_page_fini(const struct lu_env *env,
65                           struct cl_page_slice *slice)
66 {
67         struct lov_page *lp  = cl2lov_page(slice);
68         struct cl_page  *sub = lov_sub_page(slice);
69
70         LINVRNT(lov_page_invariant(slice));
71         ENTRY;
72
73         if (sub != NULL) {
74                 LASSERT(sub->cp_state == CPS_FREEING);
75                 lu_ref_del(&sub->cp_reference, "lov", sub->cp_parent);
76                 sub->cp_parent = NULL;
77                 slice->cpl_page->cp_child = NULL;
78                 cl_page_put(env, sub);
79         }
80         OBD_SLAB_FREE_PTR(lp, lov_page_kmem);
81         EXIT;
82 }
83
84 static void lov_page_own(const struct lu_env *env,
85                          const struct cl_page_slice *slice, struct cl_io *io)
86 {
87         struct lov_io     *lio = lov_env_io(env);
88         struct lov_io_sub *sub;
89
90         LINVRNT(lov_page_invariant(slice));
91         LINVRNT(!cl2lov_page(slice)->lps_invalid);
92         ENTRY;
93
94         sub = lov_page_subio(env, lio, slice);
95         if (!IS_ERR(sub)) {
96                 lov_sub_page(slice)->cp_owner = sub->sub_io;
97                 lov_sub_put(sub);
98         } else
99                 LBUG(); /* Arrgh */
100         EXIT;
101 }
102
103 static void lov_page_assume(const struct lu_env *env,
104                             const struct cl_page_slice *slice, struct cl_io *io)
105 {
106         return lov_page_own(env, slice, io);
107 }
108
109 static int lov_page_print(const struct lu_env *env,
110                           const struct cl_page_slice *slice,
111                           void *cookie, lu_printer_t printer)
112 {
113         struct lov_page *lp = cl2lov_page(slice);
114
115         return (*printer)(env, cookie, LUSTRE_LOV_NAME"-page@%p\n", lp);
116 }
117
118 static const struct cl_page_operations lov_page_ops = {
119         .cpo_fini   = lov_page_fini,
120         .cpo_own    = lov_page_own,
121         .cpo_assume = lov_page_assume,
122         .cpo_print  = lov_page_print
123 };
124
125 static void lov_empty_page_fini(const struct lu_env *env,
126                                 struct cl_page_slice *slice)
127 {
128         struct lov_page *lp  = cl2lov_page(slice);
129
130         LASSERT(slice->cpl_page->cp_child == NULL);
131         ENTRY;
132         OBD_SLAB_FREE_PTR(lp, lov_page_kmem);
133         EXIT;
134 }
135
136 struct cl_page *lov_page_init_raid0(const struct lu_env *env,
137                                     struct cl_object *obj, struct cl_page *page,
138                                     cfs_page_t *vmpage)
139 {
140         struct lov_page   *lpg;
141         struct lov_object *loo = cl2lov(obj);
142         int result;
143
144         ENTRY;
145         OBD_SLAB_ALLOC_PTR_GFP(lpg, lov_page_kmem, CFS_ALLOC_IO);
146         if (lpg != NULL) {
147                 loff_t   offset;
148                 int      stripe;
149                 obd_off  suboff;
150                 struct cl_page          *subpage;
151                 struct cl_object        *subobj;
152                 struct lov_layout_raid0 *r0 = lov_r0(loo);
153
154                 offset = cl_offset(obj, page->cp_index);
155                 stripe = lov_stripe_number(r0->lo_lsm, offset);
156                 result = lov_stripe_offset(r0->lo_lsm, offset, stripe,
157                                            &suboff);
158                 LASSERT(stripe < r0->lo_nr);
159                 LASSERT(result == 0);
160
161                 subobj  = lovsub2cl(r0->lo_sub[stripe]);
162                 subpage = cl_page_find(env, subobj,
163                                        cl_index(subobj, suboff), vmpage,
164                                        page->cp_type);
165                 if (!IS_ERR(subpage)) {
166                         if (subpage->cp_parent != NULL) {
167                                 /*
168                                  * This is only possible when TRANSIENT page
169                                  * is being created, and CACHEABLE sub-page
170                                  * (attached to already existing top-page) has
171                                  * been found. Tell cl_page_find() to use
172                                  * existing page.
173                                  */
174                                 LASSERT(subpage->cp_type == CPT_CACHEABLE);
175                                 LASSERT(page->cp_type == CPT_TRANSIENT);
176                                 lpg->lps_invalid = 1;
177                                 cl_page_put(env, subpage);
178                                 /*
179                                  * XXX This assumes that lov is in the topmost
180                                  * cl_page.
181                                  */
182                                 result = PTR_ERR(cl_page_top(subpage));
183                         } else {
184                                 lu_ref_add(&subpage->cp_reference, "lov", page);
185                                 subpage->cp_parent = page;
186                                 page->cp_child = subpage;
187                         }
188                         cl_page_slice_add(page, &lpg->lps_cl,
189                                           obj, &lov_page_ops);
190                 } else
191                         result = PTR_ERR(subpage);
192         } else
193                 result = -ENOMEM;
194         RETURN(ERR_PTR(result));
195 }
196
197
198 static const struct cl_page_operations lov_empty_page_ops = {
199         .cpo_fini   = lov_empty_page_fini,
200         .cpo_print  = lov_page_print
201 };
202
203 struct cl_page *lov_page_init_empty(const struct lu_env *env,
204                                     struct cl_object *obj, struct cl_page *page,
205                                     cfs_page_t *vmpage)
206 {
207         struct lov_page   *lpg;
208         int result = -ENOMEM;
209         ENTRY;
210
211         OBD_SLAB_ALLOC_PTR_GFP(lpg, lov_page_kmem, CFS_ALLOC_IO);
212         if (lpg != NULL) {
213                 void *addr;
214                 cl_page_slice_add(page, &lpg->lps_cl,
215                                   obj, &lov_empty_page_ops);
216                 addr = cfs_kmap(vmpage);
217                 memset(addr, 0, cl_page_size(obj));
218                 cfs_kunmap(vmpage);
219                 cl_page_export(env, page);
220                 result = 0;
221         }
222         RETURN(ERR_PTR(result));
223 }
224
225
226 /** @} lov */
227