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_GFP(link, lov_lock_link_kmem, CFS_ALLOC_IO);
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 *lck,
196 struct lov_lock_sub *lls,
197 struct cl_lock_closure *closure,
198 struct lov_sublock_env **lsep)
200 struct lovsub_lock *sublock;
201 struct cl_lock *child;
205 LASSERT(list_empty(&closure->clc_list));
207 sublock = lls->sub_lock;
208 child = sublock->lss_cl.cls_lock;
209 result = cl_lock_closure_build(env, child, closure);
211 struct cl_lock *parent = closure->clc_origin;
213 LASSERT(cl_lock_is_mutexed(child));
214 sublock->lss_active = parent;
216 if (unlikely(child->cll_state == CLS_FREEING)) {
217 struct lov_lock_link *link;
219 * we could race with lock deletion which temporarily
220 * put the lock in freeing state, bug 19080.
222 LASSERT(!(lls->sub_flags & LSF_HELD));
224 link = lov_lock_link_find(env, lck, sublock);
225 LASSERT(link != NULL);
226 lov_lock_unlink(env, link, sublock);
227 lov_sublock_unlock(env, sublock, closure, NULL);
230 struct lov_sublock_env *subenv;
231 subenv = lov_sublock_env_get(env, parent, lls);
232 if (IS_ERR(subenv)) {
233 lov_sublock_unlock(env, sublock,
235 result = PTR_ERR(subenv);
245 * Updates the result of a top-lock operation from a result of sub-lock
246 * sub-operations. Top-operations like lov_lock_{enqueue,use,unuse}() iterate
247 * over sub-locks and lov_subresult() is used to calculate return value of a
248 * top-operation. To this end, possible return values of sub-operations are
252 * - CLO_WAIT wait for event
253 * - CLO_REPEAT repeat top-operation
254 * - -ne fundamental error
256 * Top-level return code can only go down through this list. CLO_REPEAT
257 * overwrites CLO_WAIT, because lock mutex was released and sleeping condition
258 * has to be rechecked by the upper layer.
260 static int lov_subresult(int result, int rc)
265 LASSERT(result <= 0 || result == CLO_REPEAT || result == CLO_WAIT);
266 LASSERT(rc <= 0 || rc == CLO_REPEAT || rc == CLO_WAIT);
267 CLASSERT(CLO_WAIT < CLO_REPEAT);
271 /* calculate ranks in the ordering above */
272 result_rank = result < 0 ? 1 + CLO_REPEAT : result;
273 rc_rank = rc < 0 ? 1 + CLO_REPEAT : rc;
275 if (result_rank < rc_rank)
281 * Creates sub-locks for a given lov_lock for the first time.
283 * Goes through all sub-objects of top-object, and creates sub-locks on every
284 * sub-object intersecting with top-lock extent. This is complicated by the
285 * fact that top-lock (that is being created) can be accessed concurrently
286 * through already created sub-locks (possibly shared with other top-locks).
288 static int lov_lock_sub_init(const struct lu_env *env,
289 struct lov_lock *lck, const struct cl_io *io)
299 struct lov_object *loo = cl2lov(lck->lls_cl.cls_obj);
300 struct lov_layout_raid0 *r0 = lov_r0(loo);
301 struct cl_lock *parent = lck->lls_cl.cls_lock;
305 lck->lls_orig = parent->cll_descr;
306 file_start = cl_offset(lov2cl(loo), parent->cll_descr.cld_start);
307 file_end = cl_offset(lov2cl(loo), parent->cll_descr.cld_end + 1) - 1;
309 for (i = 0, nr = 0; i < r0->lo_nr; i++) {
311 * XXX for wide striping smarter algorithm is desirable,
312 * breaking out of the loop, early.
314 if (lov_stripe_intersects(r0->lo_lsm, i,
315 file_start, file_end, &start, &end))
319 OBD_ALLOC(lck->lls_sub, nr * sizeof lck->lls_sub[0]);
320 if (lck->lls_sub == NULL)
325 * First, fill in sub-lock descriptions in
326 * lck->lls_sub[].sub_descr. They are used by lov_sublock_alloc()
327 * (called below in this function, and by lov_lock_enqueue()) to
328 * create sub-locks. At this moment, no other thread can access
331 for (i = 0, nr = 0; i < r0->lo_nr; ++i) {
332 if (lov_stripe_intersects(r0->lo_lsm, i,
333 file_start, file_end, &start, &end)) {
334 struct cl_lock_descr *descr;
336 descr = &lck->lls_sub[nr].sub_descr;
338 LASSERT(descr->cld_obj == NULL);
339 descr->cld_obj = lovsub2cl(r0->lo_sub[i]);
340 descr->cld_start = cl_index(descr->cld_obj, start);
341 descr->cld_end = cl_index(descr->cld_obj, end);
342 descr->cld_mode = parent->cll_descr.cld_mode;
343 descr->cld_gid = parent->cll_descr.cld_gid;
344 /* XXX has no effect */
345 lck->lls_sub[nr].sub_got = *descr;
346 lck->lls_sub[nr].sub_stripe = i;
350 LASSERT(nr == lck->lls_nr);
352 * Then, create sub-locks. Once at least one sub-lock was created,
353 * top-lock can be reached by other threads.
355 for (i = 0; i < lck->lls_nr; ++i) {
356 struct cl_lock *sublock;
357 struct lov_lock_link *link;
359 if (lck->lls_sub[i].sub_lock == NULL) {
360 sublock = lov_sublock_alloc(env, io, lck, i, &link);
361 if (IS_ERR(sublock)) {
362 result = PTR_ERR(sublock);
365 cl_lock_mutex_get(env, sublock);
366 cl_lock_mutex_get(env, parent);
368 * recheck under mutex that sub-lock wasn't created
369 * concurrently, and that top-lock is still alive.
371 if (lck->lls_sub[i].sub_lock == NULL &&
372 parent->cll_state < CLS_FREEING) {
373 lov_sublock_adopt(env, lck, sublock, i, link);
374 cl_lock_mutex_put(env, parent);
376 OBD_SLAB_FREE_PTR(link, lov_lock_link_kmem);
377 cl_lock_mutex_put(env, parent);
378 cl_lock_unhold(env, sublock,
379 "lov-parent", parent);
381 cl_lock_mutex_put(env, sublock);
385 * Some sub-locks can be missing at this point. This is not a problem,
386 * because enqueue will create them anyway. Main duty of this function
387 * is to fill in sub-lock descriptions in a race free manner.
392 static int lov_sublock_release(const struct lu_env *env, struct lov_lock *lck,
393 int i, int deluser, int rc)
395 struct cl_lock *parent = lck->lls_cl.cls_lock;
397 LASSERT(cl_lock_is_mutexed(parent));
400 if (lck->lls_sub[i].sub_flags & LSF_HELD) {
401 struct cl_lock *sublock;
404 LASSERT(lck->lls_sub[i].sub_lock != NULL);
405 sublock = lck->lls_sub[i].sub_lock->lss_cl.cls_lock;
406 LASSERT(cl_lock_is_mutexed(sublock));
408 lck->lls_sub[i].sub_flags &= ~LSF_HELD;
410 cl_lock_user_del(env, sublock);
412 * If the last hold is released, and cancellation is pending
413 * for a sub-lock, release parent mutex, to avoid keeping it
414 * while sub-lock is being paged out.
416 dying = (sublock->cll_descr.cld_mode == CLM_PHANTOM ||
417 sublock->cll_descr.cld_mode == CLM_GROUP ||
418 (sublock->cll_flags & (CLF_CANCELPEND|CLF_DOOMED))) &&
419 sublock->cll_holds == 1;
421 cl_lock_mutex_put(env, parent);
422 cl_lock_unhold(env, sublock, "lov-parent", parent);
424 cl_lock_mutex_get(env, parent);
425 rc = lov_subresult(rc, CLO_REPEAT);
428 * From now on lck->lls_sub[i].sub_lock is a "weak" pointer,
429 * not backed by a reference on a
430 * sub-lock. lovsub_lock_delete() will clear
431 * lck->lls_sub[i].sub_lock under semaphores, just before
432 * sub-lock is destroyed.
438 static void lov_sublock_hold(const struct lu_env *env, struct lov_lock *lck,
441 struct cl_lock *parent = lck->lls_cl.cls_lock;
443 LASSERT(cl_lock_is_mutexed(parent));
446 if (!(lck->lls_sub[i].sub_flags & LSF_HELD)) {
447 struct cl_lock *sublock;
449 LASSERT(lck->lls_sub[i].sub_lock != NULL);
450 sublock = lck->lls_sub[i].sub_lock->lss_cl.cls_lock;
451 LASSERT(cl_lock_is_mutexed(sublock));
452 LASSERT(sublock->cll_state != CLS_FREEING);
454 lck->lls_sub[i].sub_flags |= LSF_HELD;
456 cl_lock_get_trust(sublock);
457 cl_lock_hold_add(env, sublock, "lov-parent", parent);
458 cl_lock_user_add(env, sublock);
459 cl_lock_put(env, sublock);
464 static void lov_lock_fini(const struct lu_env *env,
465 struct cl_lock_slice *slice)
467 struct lov_lock *lck;
471 lck = cl2lov_lock(slice);
472 LASSERT(lck->lls_nr_filled == 0);
473 if (lck->lls_sub != NULL) {
474 for (i = 0; i < lck->lls_nr; ++i)
476 * No sub-locks exists at this point, as sub-lock has
477 * a reference on its parent.
479 LASSERT(lck->lls_sub[i].sub_lock == NULL);
480 OBD_FREE(lck->lls_sub, lck->lls_nr * sizeof lck->lls_sub[0]);
482 OBD_SLAB_FREE_PTR(lck, lov_lock_kmem);
487 * Tries to advance a state machine of a given sub-lock toward enqueuing of
490 * \retval 0 if state-transition can proceed
491 * \retval -ve otherwise.
493 static int lov_lock_enqueue_one(const struct lu_env *env, struct lov_lock *lck,
494 struct cl_lock *sublock,
495 struct cl_io *io, __u32 enqflags, int last)
500 /* first, try to enqueue a sub-lock ... */
501 result = cl_enqueue_try(env, sublock, io, enqflags);
502 if (sublock->cll_state == CLS_ENQUEUED)
503 /* if it is enqueued, try to `wait' on it---maybe it's already
505 result = cl_wait_try(env, sublock);
507 * If CEF_ASYNC flag is set, then all sub-locks can be enqueued in
508 * parallel, otherwise---enqueue has to wait until sub-lock is granted
509 * before proceeding to the next one.
511 if (result == CLO_WAIT && sublock->cll_state <= CLS_HELD &&
512 enqflags & CEF_ASYNC && !last)
518 * Helper function for lov_lock_enqueue() that creates missing sub-lock.
520 static int lov_sublock_fill(const struct lu_env *env, struct cl_lock *parent,
521 struct cl_io *io, struct lov_lock *lck, int idx)
523 struct lov_lock_link *link;
524 struct cl_lock *sublock;
527 LASSERT(parent->cll_depth == 1);
528 cl_lock_mutex_put(env, parent);
529 sublock = lov_sublock_alloc(env, io, lck, idx, &link);
530 if (!IS_ERR(sublock))
531 cl_lock_mutex_get(env, sublock);
532 cl_lock_mutex_get(env, parent);
534 if (!IS_ERR(sublock)) {
535 if (parent->cll_state == CLS_QUEUING &&
536 lck->lls_sub[idx].sub_lock == NULL)
537 lov_sublock_adopt(env, lck, sublock, idx, link);
539 OBD_SLAB_FREE_PTR(link, lov_lock_link_kmem);
540 /* other thread allocated sub-lock, or enqueue is no
542 cl_lock_mutex_put(env, parent);
543 cl_lock_unhold(env, sublock, "lov-parent", parent);
544 cl_lock_mutex_get(env, parent);
546 cl_lock_mutex_put(env, sublock);
549 result = PTR_ERR(sublock);
554 * Implementation of cl_lock_operations::clo_enqueue() for lov layer. This
555 * function is rather subtle, as it enqueues top-lock (i.e., advances top-lock
556 * state machine from CLS_QUEUING to CLS_ENQUEUED states) by juggling sub-lock
557 * state machines in the face of sub-locks sharing (by multiple top-locks),
558 * and concurrent sub-lock cancellations.
560 static int lov_lock_enqueue(const struct lu_env *env,
561 const struct cl_lock_slice *slice,
562 struct cl_io *io, __u32 enqflags)
564 struct cl_lock *lock = slice->cls_lock;
565 struct lov_lock *lck = cl2lov_lock(slice);
566 struct cl_lock_closure *closure = lov_closure_get(env, lock);
569 enum cl_lock_state minstate;
573 for (result = 0, minstate = CLS_FREEING, i = 0; i < lck->lls_nr; ++i) {
575 struct lovsub_lock *sub;
576 struct lov_lock_sub *lls;
577 struct cl_lock *sublock;
578 struct lov_sublock_env *subenv;
580 if (lock->cll_state != CLS_QUEUING) {
582 * Lock might have left QUEUING state if previous
583 * iteration released its mutex. Stop enqueing in this
584 * case and let the upper layer to decide what to do.
586 LASSERT(i > 0 && result != 0);
590 lls = &lck->lls_sub[i];
593 * Sub-lock might have been canceled, while top-lock was
597 result = lov_sublock_fill(env, lock, io, lck, i);
598 /* lov_sublock_fill() released @lock mutex,
602 sublock = sub->lss_cl.cls_lock;
603 rc = lov_sublock_lock(env, lck, lls, closure, &subenv);
605 lov_sublock_hold(env, lck, i);
606 rc = lov_lock_enqueue_one(subenv->lse_env, lck, sublock,
607 subenv->lse_io, enqflags,
608 i == lck->lls_nr - 1);
609 minstate = min(minstate, sublock->cll_state);
611 * Don't hold a sub-lock in CLS_CACHED state, see
612 * description for lov_lock::lls_sub.
614 if (sublock->cll_state > CLS_HELD)
615 rc = lov_sublock_release(env, lck, i, 1, rc);
616 lov_sublock_unlock(env, sub, closure, subenv);
618 result = lov_subresult(result, rc);
622 cl_lock_closure_fini(closure);
623 RETURN(result ?: minstate >= CLS_ENQUEUED ? 0 : CLO_WAIT);
626 static int lov_lock_unuse(const struct lu_env *env,
627 const struct cl_lock_slice *slice)
629 struct lov_lock *lck = cl2lov_lock(slice);
630 struct cl_lock_closure *closure = lov_closure_get(env, slice->cls_lock);
636 for (result = 0, i = 0; i < lck->lls_nr; ++i) {
638 struct lovsub_lock *sub;
639 struct cl_lock *sublock;
640 struct lov_lock_sub *lls;
641 struct lov_sublock_env *subenv;
643 /* top-lock state cannot change concurrently, because single
644 * thread (one that released the last hold) carries unlocking
645 * to the completion. */
646 LASSERT(slice->cls_lock->cll_state == CLS_UNLOCKING);
647 lls = &lck->lls_sub[i];
652 sublock = sub->lss_cl.cls_lock;
653 rc = lov_sublock_lock(env, lck, lls, closure, &subenv);
655 if (lck->lls_sub[i].sub_flags & LSF_HELD) {
656 LASSERT(sublock->cll_state == CLS_HELD);
657 rc = cl_unuse_try(subenv->lse_env, sublock);
659 rc = lov_sublock_release(env, lck,
662 lov_sublock_unlock(env, sub, closure, subenv);
664 result = lov_subresult(result, rc);
668 if (result == 0 && lck->lls_unuse_race) {
669 lck->lls_unuse_race = 0;
672 cl_lock_closure_fini(closure);
676 static int lov_lock_wait(const struct lu_env *env,
677 const struct cl_lock_slice *slice)
679 struct lov_lock *lck = cl2lov_lock(slice);
680 struct cl_lock_closure *closure = lov_closure_get(env, slice->cls_lock);
681 enum cl_lock_state minstate;
687 for (result = 0, minstate = CLS_FREEING, i = 0; i < lck->lls_nr; ++i) {
689 struct lovsub_lock *sub;
690 struct cl_lock *sublock;
691 struct lov_lock_sub *lls;
692 struct lov_sublock_env *subenv;
694 lls = &lck->lls_sub[i];
696 LASSERT(sub != NULL);
697 sublock = sub->lss_cl.cls_lock;
698 rc = lov_sublock_lock(env, lck, lls, closure, &subenv);
700 LASSERT(sublock->cll_state >= CLS_ENQUEUED);
701 if (sublock->cll_state < CLS_HELD)
702 rc = cl_wait_try(env, sublock);
704 minstate = min(minstate, sublock->cll_state);
705 lov_sublock_unlock(env, sub, closure, subenv);
707 result = lov_subresult(result, rc);
711 cl_lock_closure_fini(closure);
712 RETURN(result ?: minstate >= CLS_HELD ? 0 : CLO_WAIT);
715 static int lov_lock_use(const struct lu_env *env,
716 const struct cl_lock_slice *slice)
718 struct lov_lock *lck = cl2lov_lock(slice);
719 struct cl_lock_closure *closure = lov_closure_get(env, slice->cls_lock);
723 LASSERT(slice->cls_lock->cll_state == CLS_CACHED);
726 for (result = 0, i = 0; i < lck->lls_nr; ++i) {
728 struct lovsub_lock *sub;
729 struct cl_lock *sublock;
730 struct lov_lock_sub *lls;
731 struct lov_sublock_env *subenv;
733 if (slice->cls_lock->cll_state != CLS_CACHED) {
734 /* see comment in lov_lock_enqueue(). */
735 LASSERT(i > 0 && result != 0);
739 * if a sub-lock was destroyed while top-lock was in
740 * CLS_CACHED state, top-lock would have been moved into
741 * CLS_NEW state, so all sub-locks have to be in place.
743 lls = &lck->lls_sub[i];
745 LASSERT(sub != NULL);
746 sublock = sub->lss_cl.cls_lock;
747 rc = lov_sublock_lock(env, lck, lls, closure, &subenv);
749 LASSERT(sublock->cll_state != CLS_FREEING);
750 lov_sublock_hold(env, lck, i);
751 if (sublock->cll_state == CLS_CACHED) {
752 rc = cl_use_try(subenv->lse_env, sublock);
754 rc = lov_sublock_release(env, lck,
758 lov_sublock_unlock(env, sub, closure, subenv);
760 result = lov_subresult(result, rc);
764 cl_lock_closure_fini(closure);
769 static int lock_lock_multi_match()
771 struct cl_lock *lock = slice->cls_lock;
772 struct cl_lock_descr *subneed = &lov_env_info(env)->lti_ldescr;
773 struct lov_object *loo = cl2lov(lov->lls_cl.cls_obj);
774 struct lov_layout_raid0 *r0 = lov_r0(loo);
775 struct lov_lock_sub *sub;
776 struct cl_object *subobj;
783 fstart = cl_offset(need->cld_obj, need->cld_start);
784 fend = cl_offset(need->cld_obj, need->cld_end + 1) - 1;
785 subneed->cld_mode = need->cld_mode;
786 cl_lock_mutex_get(env, lock);
787 for (i = 0; i < lov->lls_nr; ++i) {
788 sub = &lov->lls_sub[i];
789 if (sub->sub_lock == NULL)
791 subobj = sub->sub_descr.cld_obj;
792 if (!lov_stripe_intersects(r0->lo_lsm, sub->sub_stripe,
793 fstart, fend, &start, &end))
795 subneed->cld_start = cl_index(subobj, start);
796 subneed->cld_end = cl_index(subobj, end);
797 subneed->cld_obj = subobj;
798 if (!cl_lock_ext_match(&sub->sub_got, subneed)) {
803 cl_lock_mutex_put(env, lock);
808 * Check if the extent region \a descr is covered by \a child against the
809 * specific \a stripe.
811 static int lov_lock_stripe_is_matching(const struct lu_env *env,
812 struct lov_object *lov, int stripe,
813 const struct cl_lock_descr *child,
814 const struct cl_lock_descr *descr)
816 struct lov_stripe_md *lsm = lov_r0(lov)->lo_lsm;
821 if (lov_r0(lov)->lo_nr == 1)
822 return cl_lock_ext_match(child, descr);
825 * For a multi-stripes object:
826 * - make sure the descr only covers child's stripe, and
827 * - check if extent is matching.
829 start = cl_offset(&lov->lo_cl, descr->cld_start);
830 end = cl_offset(&lov->lo_cl, descr->cld_end + 1) - 1;
831 result = end - start <= lsm->lsm_stripe_size &&
832 stripe == lov_stripe_number(lsm, start) &&
833 stripe == lov_stripe_number(lsm, end);
835 struct cl_lock_descr *subd = &lov_env_info(env)->lti_ldescr;
839 subd->cld_obj = NULL; /* don't need sub object at all */
840 subd->cld_mode = descr->cld_mode;
841 subd->cld_gid = descr->cld_gid;
842 result = lov_stripe_intersects(lsm, stripe, start, end,
843 &sub_start, &sub_end);
845 subd->cld_start = cl_index(child->cld_obj, sub_start);
846 subd->cld_end = cl_index(child->cld_obj, sub_end);
847 result = cl_lock_ext_match(child, subd);
853 * An implementation of cl_lock_operations::clo_fits_into() method.
855 * Checks whether a lock (given by \a slice) is suitable for \a
856 * io. Multi-stripe locks can be used only for "quick" io, like truncate, or
859 * \see ccc_lock_fits_into().
861 static int lov_lock_fits_into(const struct lu_env *env,
862 const struct cl_lock_slice *slice,
863 const struct cl_lock_descr *need,
864 const struct cl_io *io)
866 struct lov_lock *lov = cl2lov_lock(slice);
867 struct lov_object *obj = cl2lov(slice->cls_obj);
870 LASSERT(cl_object_same(need->cld_obj, slice->cls_obj));
871 LASSERT(lov->lls_nr > 0);
875 if (need->cld_mode == CLM_GROUP)
877 * always allow to match group lock.
879 result = cl_lock_ext_match(&lov->lls_orig, need);
880 else if (lov->lls_nr == 1) {
881 struct cl_lock_descr *got = &lov->lls_sub[0].sub_got;
882 result = lov_lock_stripe_is_matching(env,
883 cl2lov(slice->cls_obj),
884 lov->lls_sub[0].sub_stripe,
886 } else if (io->ci_type != CIT_TRUNC && io->ci_type != CIT_MISC &&
887 !cl_io_is_append(io) && need->cld_mode != CLM_PHANTOM)
889 * Multi-stripe locks are only suitable for `quick' IO and for
895 * Most general case: multi-stripe existing lock, and
896 * (potentially) multi-stripe @need lock. Check that @need is
897 * covered by @lov's sub-locks.
899 * For now, ignore lock expansions made by the server, and
900 * match against original lock extent.
902 result = cl_lock_ext_match(&lov->lls_orig, need);
903 CDEBUG(D_DLMTRACE, DDESCR"/"DDESCR" %i %i/%i: %i\n",
904 PDESCR(&lov->lls_orig), PDESCR(&lov->lls_sub[0].sub_got),
905 lov->lls_sub[0].sub_stripe, lov->lls_nr, lov_r0(obj)->lo_nr,
910 void lov_lock_unlink(const struct lu_env *env,
911 struct lov_lock_link *link, struct lovsub_lock *sub)
913 struct lov_lock *lck = link->lll_super;
914 struct cl_lock *parent = lck->lls_cl.cls_lock;
916 LASSERT(cl_lock_is_mutexed(parent));
917 LASSERT(cl_lock_is_mutexed(sub->lss_cl.cls_lock));
920 list_del_init(&link->lll_list);
921 LASSERT(lck->lls_sub[link->lll_idx].sub_lock == sub);
922 /* yank this sub-lock from parent's array */
923 lck->lls_sub[link->lll_idx].sub_lock = NULL;
924 LASSERT(lck->lls_nr_filled > 0);
925 lck->lls_nr_filled--;
926 lu_ref_del(&parent->cll_reference, "lov-child", sub->lss_cl.cls_lock);
927 cl_lock_put(env, parent);
928 OBD_SLAB_FREE_PTR(link, lov_lock_link_kmem);
932 struct lov_lock_link *lov_lock_link_find(const struct lu_env *env,
933 struct lov_lock *lck,
934 struct lovsub_lock *sub)
936 struct lov_lock_link *scan;
938 LASSERT(cl_lock_is_mutexed(sub->lss_cl.cls_lock));
941 list_for_each_entry(scan, &sub->lss_parents, lll_list) {
942 if (scan->lll_super == lck)
949 * An implementation of cl_lock_operations::clo_delete() method. This is
950 * invoked for "top-to-bottom" delete, when lock destruction starts from the
951 * top-lock, e.g., as a result of inode destruction.
953 * Unlinks top-lock from all its sub-locks. Sub-locks are not deleted there:
954 * this is done separately elsewhere:
956 * - for inode destruction, lov_object_delete() calls cl_object_kill() for
957 * each sub-object, purging its locks;
959 * - in other cases (e.g., a fatal error with a top-lock) sub-locks are
962 static void lov_lock_delete(const struct lu_env *env,
963 const struct cl_lock_slice *slice)
965 struct lov_lock *lck = cl2lov_lock(slice);
966 struct cl_lock_closure *closure = lov_closure_get(env, slice->cls_lock);
969 LASSERT(slice->cls_lock->cll_state == CLS_FREEING);
972 for (i = 0; i < lck->lls_nr; ++i) {
973 struct lov_lock_sub *lls;
974 struct lovsub_lock *lsl;
975 struct cl_lock *sublock;
978 lls = &lck->lls_sub[i];
983 sublock = lsl->lss_cl.cls_lock;
984 rc = lov_sublock_lock(env, lck, lls, closure, NULL);
986 if (lck->lls_sub[i].sub_flags & LSF_HELD)
987 lov_sublock_release(env, lck, i, 1, 0);
988 if (sublock->cll_state < CLS_FREEING) {
989 struct lov_lock_link *link;
991 link = lov_lock_link_find(env, lck, lsl);
992 LASSERT(link != NULL);
993 lov_lock_unlink(env, link, lsl);
994 LASSERT(lck->lls_sub[i].sub_lock == NULL);
996 lov_sublock_unlock(env, lsl, closure, NULL);
997 } else if (rc == CLO_REPEAT) {
998 --i; /* repeat with this lock */
1000 CL_LOCK_DEBUG(D_ERROR, env, sublock,
1001 "Cannot get sub-lock for delete: %i\n",
1005 cl_lock_closure_fini(closure);
1009 static int lov_lock_print(const struct lu_env *env, void *cookie,
1010 lu_printer_t p, const struct cl_lock_slice *slice)
1012 struct lov_lock *lck = cl2lov_lock(slice);
1015 (*p)(env, cookie, "%d\n", lck->lls_nr);
1016 for (i = 0; i < lck->lls_nr; ++i) {
1017 struct lov_lock_sub *sub;
1019 sub = &lck->lls_sub[i];
1020 (*p)(env, cookie, " %d %x: ", i, sub->sub_flags);
1021 if (sub->sub_lock != NULL)
1022 cl_lock_print(env, cookie, p,
1023 sub->sub_lock->lss_cl.cls_lock);
1025 (*p)(env, cookie, "---\n");
1030 static const struct cl_lock_operations lov_lock_ops = {
1031 .clo_fini = lov_lock_fini,
1032 .clo_enqueue = lov_lock_enqueue,
1033 .clo_wait = lov_lock_wait,
1034 .clo_use = lov_lock_use,
1035 .clo_unuse = lov_lock_unuse,
1036 .clo_fits_into = lov_lock_fits_into,
1037 .clo_delete = lov_lock_delete,
1038 .clo_print = lov_lock_print
1041 int lov_lock_init_raid0(const struct lu_env *env, struct cl_object *obj,
1042 struct cl_lock *lock, const struct cl_io *io)
1044 struct lov_lock *lck;
1048 OBD_SLAB_ALLOC_PTR_GFP(lck, lov_lock_kmem, CFS_ALLOC_IO);
1050 cl_lock_slice_add(lock, &lck->lls_cl, obj, &lov_lock_ops);
1051 result = lov_lock_sub_init(env, lck, io);
1057 static struct cl_lock_closure *lov_closure_get(const struct lu_env *env,
1058 struct cl_lock *parent)
1060 struct cl_lock_closure *closure;
1062 closure = &lov_env_info(env)->lti_closure;
1063 LASSERT(list_empty(&closure->clc_list));
1064 cl_lock_closure_init(env, closure, parent, 1);