1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
2 * vim:expandtab:shiftwidth=8:tabstop=8:
6 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
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.
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).
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
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
29 * Copyright 2008 Sun Microsystems, Inc. All rights reserved.
30 * Use is subject to license terms.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
36 * Implementation of cl_lock for LOV layer.
38 * Author: Nikita Danilov <nikita.danilov@sun.com>
41 #define DEBUG_SUBSYSTEM S_LOV
43 #include "lov_cl_internal.h"
45 /** \addtogroup lov lov @{ */
47 static struct cl_lock_closure *lov_closure_get(const struct lu_env *env,
48 struct cl_lock *parent);
50 /*****************************************************************************
52 * Lov lock operations.
56 static struct lov_sublock_env *lov_sublock_env_get(const struct lu_env *env,
57 struct cl_lock *parent,
58 struct lov_lock_sub *lls)
60 struct lov_sublock_env *subenv;
61 struct lov_io *lio = lov_env_io(env);
62 struct cl_io *io = lio->lis_cl.cis_io;
63 struct lov_io_sub *sub;
65 subenv = &lov_env_session(env)->ls_subenv;
68 * FIXME: We tend to use the subio's env & io to call the sublock
69 * lock operations because osc lock sometimes stores some control
70 * variables in thread's IO infomation(Now only lockless information).
71 * However, if the lock's host(object) is different from the object
72 * for current IO, we have no way to get the subenv and subio because
73 * they are not initialized at all. As a temp fix, in this case,
74 * we still borrow the parent's env to call sublock operations.
76 if (!cl_object_same(io->ci_obj, parent->cll_descr.cld_obj)) {
77 subenv->lse_env = env;
79 subenv->lse_sub = NULL;
82 sub = lov_sub_get(env, lio, lls->sub_stripe);
84 subenv->lse_env = sub->sub_env;
85 subenv->lse_io = sub->sub_io;
86 subenv->lse_sub = sub;
94 static void lov_sublock_env_put(struct lov_sublock_env *subenv)
96 if (subenv && subenv->lse_sub)
97 lov_sub_put(subenv->lse_sub);
100 static void lov_sublock_adopt(const struct lu_env *env, struct lov_lock *lck,
101 struct cl_lock *sublock, int idx,
102 struct lov_lock_link *link)
104 struct lovsub_lock *lsl;
105 struct cl_lock *parent = lck->lls_cl.cls_lock;
108 LASSERT(cl_lock_is_mutexed(parent));
109 LASSERT(cl_lock_is_mutexed(sublock));
112 lsl = cl2sub_lock(sublock);
114 * check that sub-lock doesn't have lock link to this top-lock.
116 LASSERT(lov_lock_link_find(env, lck, lsl) == NULL);
117 LASSERT(idx < lck->lls_nr);
119 lck->lls_sub[idx].sub_lock = lsl;
120 lck->lls_nr_filled++;
121 LASSERT(lck->lls_nr_filled <= lck->lls_nr);
122 list_add_tail(&link->lll_list, &lsl->lss_parents);
124 link->lll_super = lck;
126 lu_ref_add(&parent->cll_reference, "lov-child", sublock);
127 lck->lls_sub[idx].sub_flags |= LSF_HELD;
128 cl_lock_user_add(env, sublock);
130 rc = lov_sublock_modify(env, lck, lsl, &sublock->cll_descr, idx);
131 LASSERT(rc == 0); /* there is no way this can fail, currently */
135 static struct cl_lock *lov_sublock_alloc(const struct lu_env *env,
136 const struct cl_io *io,
137 struct lov_lock *lck,
138 int idx, struct lov_lock_link **out)
140 struct cl_lock *sublock;
141 struct cl_lock *parent;
142 struct lov_lock_link *link;
144 LASSERT(idx < lck->lls_nr);
147 OBD_SLAB_ALLOC_PTR(link, lov_lock_link_kmem);
149 struct lov_sublock_env *subenv;
150 struct lov_lock_sub *lls;
151 struct cl_lock_descr *descr;
153 parent = lck->lls_cl.cls_lock;
154 lls = &lck->lls_sub[idx];
155 descr = &lls->sub_descr;
157 subenv = lov_sublock_env_get(env, parent, lls);
158 if (!IS_ERR(subenv)) {
159 /* CAVEAT: Don't try to add a field in lov_lock_sub
160 * to remember the subio. This is because lock is able
161 * to be cached, but this is not true for IO. This
162 * further means a sublock might be referenced in
163 * different io context. -jay */
165 sublock = cl_lock_hold(subenv->lse_env, subenv->lse_io,
166 descr, "lov-parent", parent);
167 lov_sublock_env_put(subenv);
170 sublock = (void*)subenv;
173 if (!IS_ERR(sublock))
176 OBD_SLAB_FREE_PTR(link, lov_lock_link_kmem);
178 sublock = ERR_PTR(-ENOMEM);
182 static void lov_sublock_unlock(const struct lu_env *env,
183 struct lovsub_lock *lsl,
184 struct cl_lock_closure *closure,
185 struct lov_sublock_env *subenv)
188 lov_sublock_env_put(subenv);
189 lsl->lss_active = NULL;
190 cl_lock_disclosure(env, closure);
194 static int lov_sublock_lock(const struct lu_env *env,
195 struct lov_lock_sub *lls,
196 struct cl_lock_closure *closure,
197 struct lov_sublock_env **lsep)
199 struct cl_lock *child;
203 LASSERT(list_empty(&closure->clc_list));
205 child = lls->sub_lock->lss_cl.cls_lock;
206 result = cl_lock_closure_build(env, child, closure);
208 struct cl_lock *parent = closure->clc_origin;
210 LASSERT(cl_lock_is_mutexed(child));
211 lls->sub_lock->lss_active = parent;
214 struct lov_sublock_env *subenv;
215 subenv = lov_sublock_env_get(env, parent, lls);
216 if (IS_ERR(subenv)) {
217 lov_sublock_unlock(env, lls->sub_lock,
219 result = PTR_ERR(subenv);
229 * Updates the result of a top-lock operation from a result of sub-lock
230 * sub-operations. Top-operations like lov_lock_{enqueue,use,unuse}() iterate
231 * over sub-locks and lov_subresult() is used to calculate return value of a
232 * top-operation. To this end, possible return values of sub-operations are
236 * - CLO_WAIT wait for event
237 * - CLO_REPEAT repeat top-operation
238 * - -ne fundamental error
240 * Top-level return code can only go down through this list. CLO_REPEAT
241 * overwrites CLO_WAIT, because lock mutex was released and sleeping condition
242 * has to be rechecked by the upper layer.
244 static int lov_subresult(int result, int rc)
249 LASSERT(result <= 0 || result == CLO_REPEAT || result == CLO_WAIT);
250 LASSERT(rc <= 0 || rc == CLO_REPEAT || rc == CLO_WAIT);
251 CLASSERT(CLO_WAIT < CLO_REPEAT);
255 /* calculate ranks in the ordering above */
256 result_rank = result < 0 ? 1 + CLO_REPEAT : result;
257 rc_rank = rc < 0 ? 1 + CLO_REPEAT : rc;
259 if (result_rank < rc_rank)
265 * Creates sub-locks for a given lov_lock for the first time.
267 * Goes through all sub-objects of top-object, and creates sub-locks on every
268 * sub-object intersecting with top-lock extent. This is complicated by the
269 * fact that top-lock (that is being created) can be accessed concurrently
270 * through already created sub-locks (possibly shared with other top-locks).
272 static int lov_lock_sub_init(const struct lu_env *env,
273 struct lov_lock *lck, const struct cl_io *io)
286 struct lov_object *loo = cl2lov(lck->lls_cl.cls_obj);
287 struct lov_layout_raid0 *r0 = lov_r0(loo);
288 struct cl_lock *parent = lck->lls_cl.cls_lock;
292 lck->lls_orig = parent->cll_descr;
293 file_start = cl_offset(lov2cl(loo), parent->cll_descr.cld_start);
294 file_end = cl_offset(lov2cl(loo), parent->cll_descr.cld_end + 1) - 1;
296 start_stripe = lov_stripe_number(r0->lo_lsm, file_start);
297 for (i = 0, nr = 0; i < r0->lo_nr; i++) {
299 * XXX for wide striping smarter algorithm is desirable,
300 * breaking out of the loop, early.
302 stripe = (start_stripe + i) % r0->lo_nr;
303 if (lov_stripe_intersects(r0->lo_lsm, stripe,
304 file_start, file_end, &start, &end))
308 OBD_ALLOC(lck->lls_sub, nr * sizeof lck->lls_sub[0]);
309 if (lck->lls_sub == NULL)
314 * First, fill in sub-lock descriptions in
315 * lck->lls_sub[].sub_descr. They are used by lov_sublock_alloc()
316 * (called below in this function, and by lov_lock_enqueue()) to
317 * create sub-locks. At this moment, no other thread can access
320 for (j = 0, nr = 0; j < i; ++j) {
321 stripe = (start_stripe + j) % r0->lo_nr;
322 if (lov_stripe_intersects(r0->lo_lsm, stripe,
323 file_start, file_end, &start, &end)) {
324 struct cl_lock_descr *descr;
326 descr = &lck->lls_sub[nr].sub_descr;
328 LASSERT(descr->cld_obj == NULL);
329 descr->cld_obj = lovsub2cl(r0->lo_sub[stripe]);
330 descr->cld_start = cl_index(descr->cld_obj, start);
331 descr->cld_end = cl_index(descr->cld_obj, end);
332 descr->cld_mode = parent->cll_descr.cld_mode;
333 lck->lls_sub[nr].sub_got = *descr;
334 lck->lls_sub[nr].sub_stripe = stripe;
338 LASSERT(nr == lck->lls_nr);
340 * Then, create sub-locks. Once at least one sub-lock was created,
341 * top-lock can be reached by other threads.
343 for (i = 0; i < lck->lls_nr; ++i) {
344 struct cl_lock *sublock;
345 struct lov_lock_link *link;
347 if (lck->lls_sub[i].sub_lock == NULL) {
348 sublock = lov_sublock_alloc(env, io, lck, i, &link);
349 if (IS_ERR(sublock)) {
350 result = PTR_ERR(sublock);
353 cl_lock_mutex_get(env, sublock);
354 cl_lock_mutex_get(env, parent);
356 * recheck under mutex that sub-lock wasn't created
357 * concurrently, and that top-lock is still alive.
359 if (lck->lls_sub[i].sub_lock == NULL &&
360 parent->cll_state < CLS_FREEING) {
361 lov_sublock_adopt(env, lck, sublock, i, link);
362 cl_lock_mutex_put(env, parent);
364 cl_lock_mutex_put(env, parent);
365 cl_lock_unhold(env, sublock,
366 "lov-parent", parent);
368 cl_lock_mutex_put(env, sublock);
372 * Some sub-locks can be missing at this point. This is not a problem,
373 * because enqueue will create them anyway. Main duty of this function
374 * is to fill in sub-lock descriptions in a race free manner.
379 static int lov_sublock_release(const struct lu_env *env, struct lov_lock *lck,
380 int i, int deluser, int rc)
382 struct cl_lock *parent = lck->lls_cl.cls_lock;
384 LASSERT(cl_lock_is_mutexed(parent));
387 if (lck->lls_sub[i].sub_flags & LSF_HELD) {
388 struct cl_lock *sublock;
391 LASSERT(lck->lls_sub[i].sub_lock != NULL);
392 sublock = lck->lls_sub[i].sub_lock->lss_cl.cls_lock;
393 LASSERT(cl_lock_is_mutexed(sublock));
395 lck->lls_sub[i].sub_flags &= ~LSF_HELD;
397 cl_lock_user_del(env, sublock);
399 * If the last hold is released, and cancellation is pending
400 * for a sub-lock, release parent mutex, to avoid keeping it
401 * while sub-lock is being paged out.
403 dying = (sublock->cll_descr.cld_mode == CLM_PHANTOM ||
404 (sublock->cll_flags & (CLF_CANCELPEND|CLF_DOOMED))) &&
405 sublock->cll_holds == 1;
407 cl_lock_mutex_put(env, parent);
408 cl_lock_unhold(env, sublock, "lov-parent", parent);
410 cl_lock_mutex_get(env, parent);
411 rc = lov_subresult(rc, CLO_REPEAT);
414 * From now on lck->lls_sub[i].sub_lock is a "weak" pointer,
415 * not backed by a reference on a
416 * sub-lock. lovsub_lock_delete() will clear
417 * lck->lls_sub[i].sub_lock under semaphores, just before
418 * sub-lock is destroyed.
424 static void lov_sublock_hold(const struct lu_env *env, struct lov_lock *lck,
427 struct cl_lock *parent = lck->lls_cl.cls_lock;
429 LASSERT(cl_lock_is_mutexed(parent));
432 if (!(lck->lls_sub[i].sub_flags & LSF_HELD)) {
433 struct cl_lock *sublock;
435 LASSERT(lck->lls_sub[i].sub_lock != NULL);
436 sublock = lck->lls_sub[i].sub_lock->lss_cl.cls_lock;
437 LASSERT(cl_lock_is_mutexed(sublock));
438 LASSERT(sublock->cll_state != CLS_FREEING);
440 lck->lls_sub[i].sub_flags |= LSF_HELD;
442 cl_lock_get_trust(sublock);
443 cl_lock_hold_add(env, sublock, "lov-parent", parent);
444 cl_lock_user_add(env, sublock);
445 cl_lock_put(env, sublock);
450 static void lov_lock_fini(const struct lu_env *env,
451 struct cl_lock_slice *slice)
453 struct lov_lock *lck;
457 lck = cl2lov_lock(slice);
458 LASSERT(lck->lls_nr_filled == 0);
459 if (lck->lls_sub != NULL) {
460 for (i = 0; i < lck->lls_nr; ++i)
462 * No sub-locks exists at this point, as sub-lock has
463 * a reference on its parent.
465 LASSERT(lck->lls_sub[i].sub_lock == NULL);
466 OBD_FREE(lck->lls_sub, lck->lls_nr * sizeof lck->lls_sub[0]);
468 OBD_SLAB_FREE_PTR(lck, lov_lock_kmem);
473 * Tries to advance a state machine of a given sub-lock toward enqueuing of
476 * \retval 0 if state-transition can proceed
477 * \retval -ve otherwise.
479 static int lov_lock_enqueue_one(const struct lu_env *env, struct lov_lock *lck,
480 struct cl_lock *sublock,
481 struct cl_io *io, __u32 enqflags, int last)
486 /* first, try to enqueue a sub-lock ... */
487 result = cl_enqueue_try(env, sublock, io, enqflags);
488 if (sublock->cll_state == CLS_ENQUEUED)
489 /* if it is enqueued, try to `wait' on it---maybe it's already
491 result = cl_wait_try(env, sublock);
493 * If CEF_ASYNC flag is set, then all sub-locks can be enqueued in
494 * parallel, otherwise---enqueue has to wait until sub-lock is granted
495 * before proceeding to the next one.
497 if (result == CLO_WAIT && sublock->cll_state <= CLS_HELD &&
498 enqflags & CEF_ASYNC && !last)
504 * Helper function for lov_lock_enqueue() that creates missing sub-lock.
506 static int lov_sublock_fill(const struct lu_env *env, struct cl_lock *parent,
507 struct cl_io *io, struct lov_lock *lck, int idx)
509 struct lov_lock_link *link;
510 struct cl_lock *sublock;
513 LASSERT(parent->cll_depth == 1);
514 cl_lock_mutex_put(env, parent);
515 sublock = lov_sublock_alloc(env, io, lck, idx, &link);
516 if (!IS_ERR(sublock))
517 cl_lock_mutex_get(env, sublock);
518 cl_lock_mutex_get(env, parent);
520 if (!IS_ERR(sublock)) {
521 if (parent->cll_state == CLS_QUEUING &&
522 lck->lls_sub[idx].sub_lock == NULL)
523 lov_sublock_adopt(env, lck, sublock, idx, link);
525 /* other thread allocated sub-lock, or enqueue is no
527 cl_lock_mutex_put(env, parent);
528 cl_lock_unhold(env, sublock, "lov-parent", parent);
529 cl_lock_mutex_get(env, parent);
531 cl_lock_mutex_put(env, sublock);
534 result = PTR_ERR(sublock);
539 * Implementation of cl_lock_operations::clo_enqueue() for lov layer. This
540 * function is rather subtle, as it enqueues top-lock (i.e., advances top-lock
541 * state machine from CLS_QUEUING to CLS_ENQUEUED states) by juggling sub-lock
542 * state machines in the face of sub-locks sharing (by multiple top-locks),
543 * and concurrent sub-lock cancellations.
545 static int lov_lock_enqueue(const struct lu_env *env,
546 const struct cl_lock_slice *slice,
547 struct cl_io *io, __u32 enqflags)
549 struct cl_lock *lock = slice->cls_lock;
550 struct lov_lock *lck = cl2lov_lock(slice);
551 struct cl_lock_closure *closure = lov_closure_get(env, lock);
554 enum cl_lock_state minstate;
558 for (result = 0, minstate = CLS_FREEING, i = 0; i < lck->lls_nr; ++i) {
560 struct lovsub_lock *sub;
561 struct lov_lock_sub *lls;
562 struct cl_lock *sublock;
563 struct lov_sublock_env *subenv;
565 if (lock->cll_state != CLS_QUEUING) {
567 * Lock might have left QUEUING state if previous
568 * iteration released its mutex. Stop enqueing in this
569 * case and let the upper layer to decide what to do.
571 LASSERT(i > 0 && result != 0);
575 lls = &lck->lls_sub[i];
578 * Sub-lock might have been canceled, while top-lock was
582 result = lov_sublock_fill(env, lock, io, lck, i);
583 /* lov_sublock_fill() released @lock mutex,
587 sublock = sub->lss_cl.cls_lock;
588 rc = lov_sublock_lock(env, lls, closure, &subenv);
590 lov_sublock_hold(env, lck, i);
591 rc = lov_lock_enqueue_one(subenv->lse_env, lck, sublock,
592 subenv->lse_io, enqflags,
593 i == lck->lls_nr - 1);
594 minstate = min(minstate, sublock->cll_state);
596 * Don't hold a sub-lock in CLS_CACHED state, see
597 * description for lov_lock::lls_sub.
599 if (sublock->cll_state > CLS_HELD)
600 rc = lov_sublock_release(env, lck, i, 1, rc);
601 lov_sublock_unlock(env, sub, closure, subenv);
603 result = lov_subresult(result, rc);
607 cl_lock_closure_fini(closure);
608 RETURN(result ?: minstate >= CLS_ENQUEUED ? 0 : CLO_WAIT);
611 static int lov_lock_unuse(const struct lu_env *env,
612 const struct cl_lock_slice *slice)
614 struct lov_lock *lck = cl2lov_lock(slice);
615 struct cl_lock_closure *closure = lov_closure_get(env, slice->cls_lock);
621 for (result = 0, i = 0; i < lck->lls_nr; ++i) {
623 struct lovsub_lock *sub;
624 struct cl_lock *sublock;
625 struct lov_lock_sub *lls;
626 struct lov_sublock_env *subenv;
628 /* top-lock state cannot change concurrently, because single
629 * thread (one that released the last hold) carries unlocking
630 * to the completion. */
631 LASSERT(slice->cls_lock->cll_state == CLS_UNLOCKING);
632 lls = &lck->lls_sub[i];
637 sublock = sub->lss_cl.cls_lock;
638 rc = lov_sublock_lock(env, lls, closure, &subenv);
640 if (lck->lls_sub[i].sub_flags & LSF_HELD) {
641 LASSERT(sublock->cll_state == CLS_HELD);
642 rc = cl_unuse_try(subenv->lse_env, sublock);
644 rc = lov_sublock_release(env, lck,
647 lov_sublock_unlock(env, sub, closure, subenv);
649 result = lov_subresult(result, rc);
653 if (result == 0 && lck->lls_unuse_race) {
654 lck->lls_unuse_race = 0;
657 cl_lock_closure_fini(closure);
661 static int lov_lock_wait(const struct lu_env *env,
662 const struct cl_lock_slice *slice)
664 struct lov_lock *lck = cl2lov_lock(slice);
665 struct cl_lock_closure *closure = lov_closure_get(env, slice->cls_lock);
666 enum cl_lock_state minstate;
672 for (result = 0, minstate = CLS_FREEING, i = 0; i < lck->lls_nr; ++i) {
674 struct lovsub_lock *sub;
675 struct cl_lock *sublock;
676 struct lov_lock_sub *lls;
677 struct lov_sublock_env *subenv;
679 lls = &lck->lls_sub[i];
681 LASSERT(sub != NULL);
682 sublock = sub->lss_cl.cls_lock;
683 rc = lov_sublock_lock(env, lls, closure, &subenv);
685 LASSERT(sublock->cll_state >= CLS_ENQUEUED);
686 if (sublock->cll_state < CLS_HELD)
687 rc = cl_wait_try(env, sublock);
689 minstate = min(minstate, sublock->cll_state);
690 lov_sublock_unlock(env, sub, closure, subenv);
692 result = lov_subresult(result, rc);
696 cl_lock_closure_fini(closure);
697 RETURN(result ?: minstate >= CLS_HELD ? 0 : CLO_WAIT);
700 static int lov_lock_use(const struct lu_env *env,
701 const struct cl_lock_slice *slice)
703 struct lov_lock *lck = cl2lov_lock(slice);
704 struct cl_lock_closure *closure = lov_closure_get(env, slice->cls_lock);
708 LASSERT(slice->cls_lock->cll_state == CLS_CACHED);
711 for (result = 0, i = 0; i < lck->lls_nr; ++i) {
713 struct lovsub_lock *sub;
714 struct cl_lock *sublock;
715 struct lov_lock_sub *lls;
716 struct lov_sublock_env *subenv;
718 if (slice->cls_lock->cll_state != CLS_CACHED) {
719 /* see comment in lov_lock_enqueue(). */
720 LASSERT(i > 0 && result != 0);
724 * if a sub-lock was destroyed while top-lock was in
725 * CLS_CACHED state, top-lock would have been moved into
726 * CLS_NEW state, so all sub-locks have to be in place.
728 lls = &lck->lls_sub[i];
730 LASSERT(sub != NULL);
731 sublock = sub->lss_cl.cls_lock;
732 rc = lov_sublock_lock(env, lls, closure, &subenv);
734 LASSERT(sublock->cll_state != CLS_FREEING);
735 lov_sublock_hold(env, lck, i);
736 if (sublock->cll_state == CLS_CACHED) {
737 rc = cl_use_try(subenv->lse_env, sublock);
739 rc = lov_sublock_release(env, lck,
743 lov_sublock_unlock(env, sub, closure, subenv);
745 result = lov_subresult(result, rc);
749 cl_lock_closure_fini(closure);
754 static int lock_lock_multi_match()
756 struct cl_lock *lock = slice->cls_lock;
757 struct cl_lock_descr *subneed = &lov_env_info(env)->lti_ldescr;
758 struct lov_object *loo = cl2lov(lov->lls_cl.cls_obj);
759 struct lov_layout_raid0 *r0 = lov_r0(loo);
760 struct lov_lock_sub *sub;
761 struct cl_object *subobj;
768 fstart = cl_offset(need->cld_obj, need->cld_start);
769 fend = cl_offset(need->cld_obj, need->cld_end + 1) - 1;
770 subneed->cld_mode = need->cld_mode;
771 cl_lock_mutex_get(env, lock);
772 for (i = 0; i < lov->lls_nr; ++i) {
773 sub = &lov->lls_sub[i];
774 if (sub->sub_lock == NULL)
776 subobj = sub->sub_descr.cld_obj;
777 if (!lov_stripe_intersects(r0->lo_lsm, sub->sub_stripe,
778 fstart, fend, &start, &end))
780 subneed->cld_start = cl_index(subobj, start);
781 subneed->cld_end = cl_index(subobj, end);
782 subneed->cld_obj = subobj;
783 if (!cl_lock_ext_match(&sub->sub_got, subneed)) {
788 cl_lock_mutex_put(env, lock);
793 * Check if the extent region \a descr is covered by \a child against the
794 * specific \a stripe.
796 static int lov_lock_stripe_is_matching(const struct lu_env *env,
797 struct lov_object *lov, int stripe,
798 const struct cl_lock_descr *child,
799 const struct cl_lock_descr *descr)
801 struct lov_stripe_md *lsm = lov_r0(lov)->lo_lsm;
806 if (lov_r0(lov)->lo_nr == 1)
807 return cl_lock_ext_match(child, descr);
810 * For a multi-stripes object:
811 * - make sure the descr only covers child's stripe, and
812 * - check if extent is matching.
814 start = cl_offset(&lov->lo_cl, descr->cld_start);
815 end = cl_offset(&lov->lo_cl, descr->cld_end + 1) - 1;
816 result = end - start <= lsm->lsm_stripe_size &&
817 stripe == lov_stripe_number(lsm, start) &&
818 stripe == lov_stripe_number(lsm, end);
820 struct cl_lock_descr *subd = &lov_env_info(env)->lti_ldescr;
824 subd->cld_obj = NULL; /* don't need sub object at all */
825 subd->cld_mode = descr->cld_mode;
826 result = lov_stripe_intersects(lsm, stripe, start, end,
827 &sub_start, &sub_end);
829 subd->cld_start = cl_index(child->cld_obj, sub_start);
830 subd->cld_end = cl_index(child->cld_obj, sub_end);
831 result = cl_lock_ext_match(child, subd);
837 * An implementation of cl_lock_operations::clo_fits_into() method.
839 * Checks whether a lock (given by \a slice) is suitable for \a
840 * io. Multi-stripe locks can be used only for "quick" io, like truncate, or
843 * \see ccc_lock_fits_into().
845 static int lov_lock_fits_into(const struct lu_env *env,
846 const struct cl_lock_slice *slice,
847 const struct cl_lock_descr *need,
848 const struct cl_io *io)
850 struct lov_lock *lov = cl2lov_lock(slice);
851 struct lov_object *obj = cl2lov(slice->cls_obj);
854 LASSERT(cl_object_same(need->cld_obj, slice->cls_obj));
855 LASSERT(lov->lls_nr > 0);
859 if (lov->lls_nr == 1) {
860 struct cl_lock_descr *got = &lov->lls_sub[0].sub_got;
861 result = lov_lock_stripe_is_matching(env,
862 cl2lov(slice->cls_obj),
863 lov->lls_sub[0].sub_stripe,
865 } else if (io->ci_type != CIT_TRUNC && io->ci_type != CIT_MISC &&
866 !cl_io_is_append(io) && need->cld_mode != CLM_PHANTOM)
868 * Multi-stripe locks are only suitable for `quick' IO and for
874 * Most general case: multi-stripe existing lock, and
875 * (potentially) multi-stripe @need lock. Check that @need is
876 * covered by @lov's sub-locks.
878 * For now, ignore lock expansions made by the server, and
879 * match against original lock extent.
881 result = cl_lock_ext_match(&lov->lls_orig, need);
882 CDEBUG(D_DLMTRACE, DDESCR"/"DDESCR" %i %i/%i: %i\n",
883 PDESCR(&lov->lls_orig), PDESCR(&lov->lls_sub[0].sub_got),
884 lov->lls_sub[0].sub_stripe, lov->lls_nr, lov_r0(obj)->lo_nr,
889 void lov_lock_unlink(const struct lu_env *env,
890 struct lov_lock_link *link, struct lovsub_lock *sub)
892 struct lov_lock *lck = link->lll_super;
893 struct cl_lock *parent = lck->lls_cl.cls_lock;
895 LASSERT(cl_lock_is_mutexed(parent));
896 LASSERT(cl_lock_is_mutexed(sub->lss_cl.cls_lock));
899 list_del_init(&link->lll_list);
900 LASSERT(lck->lls_sub[link->lll_idx].sub_lock == sub);
901 /* yank this sub-lock from parent's array */
902 lck->lls_sub[link->lll_idx].sub_lock = NULL;
903 LASSERT(lck->lls_nr_filled > 0);
904 lck->lls_nr_filled--;
905 lu_ref_del(&parent->cll_reference, "lov-child", sub->lss_cl.cls_lock);
906 cl_lock_put(env, parent);
907 OBD_SLAB_FREE_PTR(link, lov_lock_link_kmem);
911 struct lov_lock_link *lov_lock_link_find(const struct lu_env *env,
912 struct lov_lock *lck,
913 struct lovsub_lock *sub)
915 struct lov_lock_link *scan;
917 LASSERT(cl_lock_is_mutexed(sub->lss_cl.cls_lock));
920 list_for_each_entry(scan, &sub->lss_parents, lll_list) {
921 if (scan->lll_super == lck)
928 * An implementation of cl_lock_operations::clo_delete() method. This is
929 * invoked for "top-to-bottom" delete, when lock destruction starts from the
930 * top-lock, e.g., as a result of inode destruction.
932 * Unlinks top-lock from all its sub-locks. Sub-locks are not deleted there:
933 * this is done separately elsewhere:
935 * - for inode destruction, lov_object_delete() calls cl_object_kill() for
936 * each sub-object, purging its locks;
938 * - in other cases (e.g., a fatal error with a top-lock) sub-locks are
941 static void lov_lock_delete(const struct lu_env *env,
942 const struct cl_lock_slice *slice)
944 struct lov_lock *lck = cl2lov_lock(slice);
945 struct cl_lock_closure *closure = lov_closure_get(env, slice->cls_lock);
948 LASSERT(slice->cls_lock->cll_state == CLS_FREEING);
951 for (i = 0; i < lck->lls_nr; ++i) {
952 struct lov_lock_sub *lls;
953 struct lovsub_lock *lsl;
954 struct cl_lock *sublock;
957 lls = &lck->lls_sub[i];
962 sublock = lsl->lss_cl.cls_lock;
963 rc = lov_sublock_lock(env, lls, closure, NULL);
965 if (lck->lls_sub[i].sub_flags & LSF_HELD)
966 lov_sublock_release(env, lck, i, 1, 0);
967 if (sublock->cll_state < CLS_FREEING) {
968 struct lov_lock_link *link;
970 link = lov_lock_link_find(env, lck, lsl);
971 LASSERT(link != NULL);
972 lov_lock_unlink(env, link, lsl);
973 LASSERT(lck->lls_sub[i].sub_lock == NULL);
975 lov_sublock_unlock(env, lsl, closure, NULL);
976 } else if (rc == CLO_REPEAT) {
977 --i; /* repeat with this lock */
979 CL_LOCK_DEBUG(D_ERROR, env, sublock,
980 "Cannot get sub-lock for delete: %i\n",
984 cl_lock_closure_fini(closure);
988 static int lov_lock_print(const struct lu_env *env, void *cookie,
989 lu_printer_t p, const struct cl_lock_slice *slice)
991 struct lov_lock *lck = cl2lov_lock(slice);
994 (*p)(env, cookie, "%d\n", lck->lls_nr);
995 for (i = 0; i < lck->lls_nr; ++i) {
996 struct lov_lock_sub *sub;
998 sub = &lck->lls_sub[i];
999 (*p)(env, cookie, " %d %x: ", i, sub->sub_flags);
1000 if (sub->sub_lock != NULL)
1001 cl_lock_print(env, cookie, p,
1002 sub->sub_lock->lss_cl.cls_lock);
1004 (*p)(env, cookie, "---\n");
1009 static const struct cl_lock_operations lov_lock_ops = {
1010 .clo_fini = lov_lock_fini,
1011 .clo_enqueue = lov_lock_enqueue,
1012 .clo_wait = lov_lock_wait,
1013 .clo_use = lov_lock_use,
1014 .clo_unuse = lov_lock_unuse,
1015 .clo_fits_into = lov_lock_fits_into,
1016 .clo_delete = lov_lock_delete,
1017 .clo_print = lov_lock_print
1020 int lov_lock_init_raid0(const struct lu_env *env, struct cl_object *obj,
1021 struct cl_lock *lock, const struct cl_io *io)
1023 struct lov_lock *lck;
1027 OBD_SLAB_ALLOC_PTR(lck, lov_lock_kmem);
1029 cl_lock_slice_add(lock, &lck->lls_cl, obj, &lov_lock_ops);
1030 result = lov_lock_sub_init(env, lck, io);
1036 static struct cl_lock_closure *lov_closure_get(const struct lu_env *env,
1037 struct cl_lock *parent)
1039 struct cl_lock_closure *closure;
1041 closure = &lov_env_info(env)->lti_closure;
1042 LINVRNT(list_empty(&closure->clc_list));
1043 cl_lock_closure_init(env, closure, parent, 1);