4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
20 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
21 * CA 95054 USA or visit www.sun.com if you need additional information or
27 * Copyright (c) 2008, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
30 * Copyright (c) 2011, 2013, Intel Corporation.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
38 * Author: Nikita Danilov <nikita.danilov@sun.com>
41 #define DEBUG_SUBSYSTEM S_CLASS
43 #include <obd_class.h>
44 #include <obd_support.h>
45 #include <lustre_fid.h>
46 #include <libcfs/list.h>
47 #include <cl_object.h>
48 #include "cl_internal.h"
50 /** Lock class of cl_lock::cll_guard */
51 static struct lock_class_key cl_lock_guard_class;
52 static struct kmem_cache *cl_lock_kmem;
54 static struct lu_kmem_descr cl_lock_caches[] = {
56 .ckd_cache = &cl_lock_kmem,
57 .ckd_name = "cl_lock_kmem",
58 .ckd_size = sizeof (struct cl_lock)
65 #ifdef CONFIG_DEBUG_PAGESTATE_TRACKING
66 #define CS_LOCK_INC(o, item) \
67 cfs_atomic_inc(&cl_object_site(o)->cs_locks.cs_stats[CS_##item])
68 #define CS_LOCK_DEC(o, item) \
69 cfs_atomic_dec(&cl_object_site(o)->cs_locks.cs_stats[CS_##item])
70 #define CS_LOCKSTATE_INC(o, state) \
71 cfs_atomic_inc(&cl_object_site(o)->cs_locks_state[state])
72 #define CS_LOCKSTATE_DEC(o, state) \
73 cfs_atomic_dec(&cl_object_site(o)->cs_locks_state[state])
75 #define CS_LOCK_INC(o, item)
76 #define CS_LOCK_DEC(o, item)
77 #define CS_LOCKSTATE_INC(o, state)
78 #define CS_LOCKSTATE_DEC(o, state)
82 * Basic lock invariant that is maintained at all times. Caller either has a
83 * reference to \a lock, or somehow assures that \a lock cannot be freed.
85 * \see cl_lock_invariant()
87 static int cl_lock_invariant_trusted(const struct lu_env *env,
88 const struct cl_lock *lock)
90 return ergo(lock->cll_state == CLS_FREEING, lock->cll_holds == 0) &&
91 cfs_atomic_read(&lock->cll_ref) >= lock->cll_holds &&
92 lock->cll_holds >= lock->cll_users &&
93 lock->cll_holds >= 0 &&
94 lock->cll_users >= 0 &&
99 * Stronger lock invariant, checking that caller has a reference on a lock.
101 * \see cl_lock_invariant_trusted()
103 static int cl_lock_invariant(const struct lu_env *env,
104 const struct cl_lock *lock)
108 result = cfs_atomic_read(&lock->cll_ref) > 0 &&
109 cl_lock_invariant_trusted(env, lock);
110 if (!result && env != NULL)
111 CL_LOCK_DEBUG(D_ERROR, env, lock, "invariant broken");
116 * Returns lock "nesting": 0 for a top-lock and 1 for a sub-lock.
118 static enum clt_nesting_level cl_lock_nesting(const struct cl_lock *lock)
120 return cl_object_header(lock->cll_descr.cld_obj)->coh_nesting;
124 * Returns a set of counters for this lock, depending on a lock nesting.
126 static struct cl_thread_counters *cl_lock_counters(const struct lu_env *env,
127 const struct cl_lock *lock)
129 struct cl_thread_info *info;
130 enum clt_nesting_level nesting;
132 info = cl_env_info(env);
133 nesting = cl_lock_nesting(lock);
134 LASSERT(nesting < ARRAY_SIZE(info->clt_counters));
135 return &info->clt_counters[nesting];
138 static void cl_lock_trace0(int level, const struct lu_env *env,
139 const char *prefix, const struct cl_lock *lock,
140 const char *func, const int line)
142 struct cl_object_header *h = cl_object_header(lock->cll_descr.cld_obj);
143 CDEBUG(level, "%s: %p@(%d %p %d %d %d %d %d %lx)"
144 "(%p/%d/%d) at %s():%d\n",
145 prefix, lock, cfs_atomic_read(&lock->cll_ref),
146 lock->cll_guarder, lock->cll_depth,
147 lock->cll_state, lock->cll_error, lock->cll_holds,
148 lock->cll_users, lock->cll_flags,
149 env, h->coh_nesting, cl_lock_nr_mutexed(env),
152 #define cl_lock_trace(level, env, prefix, lock) \
153 cl_lock_trace0(level, env, prefix, lock, __FUNCTION__, __LINE__)
155 #define RETIP ((unsigned long)__builtin_return_address(0))
157 #ifdef CONFIG_LOCKDEP
158 static struct lock_class_key cl_lock_key;
160 static void cl_lock_lockdep_init(struct cl_lock *lock)
162 lockdep_set_class_and_name(lock, &cl_lock_key, "EXT");
165 static void cl_lock_lockdep_acquire(const struct lu_env *env,
166 struct cl_lock *lock, __u32 enqflags)
168 cl_lock_counters(env, lock)->ctc_nr_locks_acquired++;
169 lock_map_acquire(&lock->dep_map);
172 static void cl_lock_lockdep_release(const struct lu_env *env,
173 struct cl_lock *lock)
175 cl_lock_counters(env, lock)->ctc_nr_locks_acquired--;
176 lock_map_release(&lock->dep_map);
179 #else /* !CONFIG_LOCKDEP */
181 static void cl_lock_lockdep_init(struct cl_lock *lock)
183 static void cl_lock_lockdep_acquire(const struct lu_env *env,
184 struct cl_lock *lock, __u32 enqflags)
186 static void cl_lock_lockdep_release(const struct lu_env *env,
187 struct cl_lock *lock)
190 #endif /* !CONFIG_LOCKDEP */
193 * Adds lock slice to the compound lock.
195 * This is called by cl_object_operations::coo_lock_init() methods to add a
196 * per-layer state to the lock. New state is added at the end of
197 * cl_lock::cll_layers list, that is, it is at the bottom of the stack.
199 * \see cl_req_slice_add(), cl_page_slice_add(), cl_io_slice_add()
201 void cl_lock_slice_add(struct cl_lock *lock, struct cl_lock_slice *slice,
202 struct cl_object *obj,
203 const struct cl_lock_operations *ops)
206 slice->cls_lock = lock;
207 cfs_list_add_tail(&slice->cls_linkage, &lock->cll_layers);
208 slice->cls_obj = obj;
209 slice->cls_ops = ops;
212 EXPORT_SYMBOL(cl_lock_slice_add);
215 * Returns true iff a lock with the mode \a has provides at least the same
216 * guarantees as a lock with the mode \a need.
218 int cl_lock_mode_match(enum cl_lock_mode has, enum cl_lock_mode need)
220 LINVRNT(need == CLM_READ || need == CLM_WRITE ||
221 need == CLM_PHANTOM || need == CLM_GROUP);
222 LINVRNT(has == CLM_READ || has == CLM_WRITE ||
223 has == CLM_PHANTOM || has == CLM_GROUP);
224 CLASSERT(CLM_PHANTOM < CLM_READ);
225 CLASSERT(CLM_READ < CLM_WRITE);
226 CLASSERT(CLM_WRITE < CLM_GROUP);
228 if (has != CLM_GROUP)
233 EXPORT_SYMBOL(cl_lock_mode_match);
236 * Returns true iff extent portions of lock descriptions match.
238 int cl_lock_ext_match(const struct cl_lock_descr *has,
239 const struct cl_lock_descr *need)
242 has->cld_start <= need->cld_start &&
243 has->cld_end >= need->cld_end &&
244 cl_lock_mode_match(has->cld_mode, need->cld_mode) &&
245 (has->cld_mode != CLM_GROUP || has->cld_gid == need->cld_gid);
247 EXPORT_SYMBOL(cl_lock_ext_match);
250 * Returns true iff a lock with the description \a has provides at least the
251 * same guarantees as a lock with the description \a need.
253 int cl_lock_descr_match(const struct cl_lock_descr *has,
254 const struct cl_lock_descr *need)
257 cl_object_same(has->cld_obj, need->cld_obj) &&
258 cl_lock_ext_match(has, need);
260 EXPORT_SYMBOL(cl_lock_descr_match);
262 static void cl_lock_free(const struct lu_env *env, struct cl_lock *lock)
264 struct cl_object *obj = lock->cll_descr.cld_obj;
266 LINVRNT(!cl_lock_is_mutexed(lock));
269 cl_lock_trace(D_DLMTRACE, env, "free lock", lock);
271 while (!cfs_list_empty(&lock->cll_layers)) {
272 struct cl_lock_slice *slice;
274 slice = cfs_list_entry(lock->cll_layers.next,
275 struct cl_lock_slice, cls_linkage);
276 cfs_list_del_init(lock->cll_layers.next);
277 slice->cls_ops->clo_fini(env, slice);
279 CS_LOCK_DEC(obj, total);
280 CS_LOCKSTATE_DEC(obj, lock->cll_state);
281 lu_object_ref_del_at(&obj->co_lu, &lock->cll_obj_ref, "cl_lock", lock);
282 cl_object_put(env, obj);
283 lu_ref_fini(&lock->cll_reference);
284 lu_ref_fini(&lock->cll_holders);
285 mutex_destroy(&lock->cll_guard);
286 OBD_SLAB_FREE_PTR(lock, cl_lock_kmem);
291 * Releases a reference on a lock.
293 * When last reference is released, lock is returned to the cache, unless it
294 * is in cl_lock_state::CLS_FREEING state, in which case it is destroyed
297 * \see cl_object_put(), cl_page_put()
299 void cl_lock_put(const struct lu_env *env, struct cl_lock *lock)
301 struct cl_object *obj;
303 LINVRNT(cl_lock_invariant(env, lock));
305 obj = lock->cll_descr.cld_obj;
306 LINVRNT(obj != NULL);
308 CDEBUG(D_TRACE, "releasing reference: %d %p %lu\n",
309 cfs_atomic_read(&lock->cll_ref), lock, RETIP);
311 if (cfs_atomic_dec_and_test(&lock->cll_ref)) {
312 if (lock->cll_state == CLS_FREEING) {
313 LASSERT(cfs_list_empty(&lock->cll_linkage));
314 cl_lock_free(env, lock);
316 CS_LOCK_DEC(obj, busy);
320 EXPORT_SYMBOL(cl_lock_put);
323 * Acquires an additional reference to a lock.
325 * This can be called only by caller already possessing a reference to \a
328 * \see cl_object_get(), cl_page_get()
330 void cl_lock_get(struct cl_lock *lock)
332 LINVRNT(cl_lock_invariant(NULL, lock));
333 CDEBUG(D_TRACE, "acquiring reference: %d %p %lu\n",
334 cfs_atomic_read(&lock->cll_ref), lock, RETIP);
335 cfs_atomic_inc(&lock->cll_ref);
337 EXPORT_SYMBOL(cl_lock_get);
340 * Acquires a reference to a lock.
342 * This is much like cl_lock_get(), except that this function can be used to
343 * acquire initial reference to the cached lock. Caller has to deal with all
344 * possible races. Use with care!
346 * \see cl_page_get_trust()
348 void cl_lock_get_trust(struct cl_lock *lock)
350 CDEBUG(D_TRACE, "acquiring trusted reference: %d %p %lu\n",
351 cfs_atomic_read(&lock->cll_ref), lock, RETIP);
352 if (cfs_atomic_inc_return(&lock->cll_ref) == 1)
353 CS_LOCK_INC(lock->cll_descr.cld_obj, busy);
355 EXPORT_SYMBOL(cl_lock_get_trust);
358 * Helper function destroying the lock that wasn't completely initialized.
360 * Other threads can acquire references to the top-lock through its
361 * sub-locks. Hence, it cannot be cl_lock_free()-ed immediately.
363 static void cl_lock_finish(const struct lu_env *env, struct cl_lock *lock)
365 cl_lock_mutex_get(env, lock);
366 cl_lock_cancel(env, lock);
367 cl_lock_delete(env, lock);
368 cl_lock_mutex_put(env, lock);
369 cl_lock_put(env, lock);
372 static struct cl_lock *cl_lock_alloc(const struct lu_env *env,
373 struct cl_object *obj,
374 const struct cl_io *io,
375 const struct cl_lock_descr *descr)
377 struct cl_lock *lock;
378 struct lu_object_header *head;
381 OBD_SLAB_ALLOC_PTR_GFP(lock, cl_lock_kmem, __GFP_IO);
383 cfs_atomic_set(&lock->cll_ref, 1);
384 lock->cll_descr = *descr;
385 lock->cll_state = CLS_NEW;
387 lu_object_ref_add_at(&obj->co_lu, &lock->cll_obj_ref, "cl_lock",
389 CFS_INIT_LIST_HEAD(&lock->cll_layers);
390 CFS_INIT_LIST_HEAD(&lock->cll_linkage);
391 CFS_INIT_LIST_HEAD(&lock->cll_inclosure);
392 lu_ref_init(&lock->cll_reference);
393 lu_ref_init(&lock->cll_holders);
394 mutex_init(&lock->cll_guard);
395 lockdep_set_class(&lock->cll_guard, &cl_lock_guard_class);
396 init_waitqueue_head(&lock->cll_wq);
397 head = obj->co_lu.lo_header;
398 CS_LOCKSTATE_INC(obj, CLS_NEW);
399 CS_LOCK_INC(obj, total);
400 CS_LOCK_INC(obj, create);
401 cl_lock_lockdep_init(lock);
402 cfs_list_for_each_entry(obj, &head->loh_layers,
406 err = obj->co_ops->coo_lock_init(env, obj, lock, io);
408 cl_lock_finish(env, lock);
414 lock = ERR_PTR(-ENOMEM);
419 * Transfer the lock into INTRANSIT state and return the original state.
421 * \pre state: CLS_CACHED, CLS_HELD or CLS_ENQUEUED
422 * \post state: CLS_INTRANSIT
425 enum cl_lock_state cl_lock_intransit(const struct lu_env *env,
426 struct cl_lock *lock)
428 enum cl_lock_state state = lock->cll_state;
430 LASSERT(cl_lock_is_mutexed(lock));
431 LASSERT(state != CLS_INTRANSIT);
432 LASSERTF(state >= CLS_ENQUEUED && state <= CLS_CACHED,
433 "Malformed lock state %d.\n", state);
435 cl_lock_state_set(env, lock, CLS_INTRANSIT);
436 lock->cll_intransit_owner = current;
437 cl_lock_hold_add(env, lock, "intransit", current);
440 EXPORT_SYMBOL(cl_lock_intransit);
443 * Exit the intransit state and restore the lock state to the original state
445 void cl_lock_extransit(const struct lu_env *env, struct cl_lock *lock,
446 enum cl_lock_state state)
448 LASSERT(cl_lock_is_mutexed(lock));
449 LASSERT(lock->cll_state == CLS_INTRANSIT);
450 LASSERT(state != CLS_INTRANSIT);
451 LASSERT(lock->cll_intransit_owner == current);
453 lock->cll_intransit_owner = NULL;
454 cl_lock_state_set(env, lock, state);
455 cl_lock_unhold(env, lock, "intransit", current);
457 EXPORT_SYMBOL(cl_lock_extransit);
460 * Checking whether the lock is intransit state
462 int cl_lock_is_intransit(struct cl_lock *lock)
464 LASSERT(cl_lock_is_mutexed(lock));
465 return lock->cll_state == CLS_INTRANSIT &&
466 lock->cll_intransit_owner != current;
468 EXPORT_SYMBOL(cl_lock_is_intransit);
470 * Returns true iff lock is "suitable" for given io. E.g., locks acquired by
471 * truncate and O_APPEND cannot be reused for read/non-append-write, as they
472 * cover multiple stripes and can trigger cascading timeouts.
474 static int cl_lock_fits_into(const struct lu_env *env,
475 const struct cl_lock *lock,
476 const struct cl_lock_descr *need,
477 const struct cl_io *io)
479 const struct cl_lock_slice *slice;
481 LINVRNT(cl_lock_invariant_trusted(env, lock));
483 cfs_list_for_each_entry(slice, &lock->cll_layers, cls_linkage) {
484 if (slice->cls_ops->clo_fits_into != NULL &&
485 !slice->cls_ops->clo_fits_into(env, slice, need, io))
491 static struct cl_lock *cl_lock_lookup(const struct lu_env *env,
492 struct cl_object *obj,
493 const struct cl_io *io,
494 const struct cl_lock_descr *need)
496 struct cl_lock *lock;
497 struct cl_object_header *head;
501 head = cl_object_header(obj);
502 LINVRNT(spin_is_locked(&head->coh_lock_guard));
503 CS_LOCK_INC(obj, lookup);
504 cfs_list_for_each_entry(lock, &head->coh_locks, cll_linkage) {
507 matched = cl_lock_ext_match(&lock->cll_descr, need) &&
508 lock->cll_state < CLS_FREEING &&
509 lock->cll_error == 0 &&
510 !(lock->cll_flags & CLF_CANCELLED) &&
511 cl_lock_fits_into(env, lock, need, io);
512 CDEBUG(D_DLMTRACE, "has: "DDESCR"(%d) need: "DDESCR": %d\n",
513 PDESCR(&lock->cll_descr), lock->cll_state, PDESCR(need),
516 cl_lock_get_trust(lock);
517 CS_LOCK_INC(obj, hit);
525 * Returns a lock matching description \a need.
527 * This is the main entry point into the cl_lock caching interface. First, a
528 * cache (implemented as a per-object linked list) is consulted. If lock is
529 * found there, it is returned immediately. Otherwise new lock is allocated
530 * and returned. In any case, additional reference to lock is acquired.
532 * \see cl_object_find(), cl_page_find()
534 static struct cl_lock *cl_lock_find(const struct lu_env *env,
535 const struct cl_io *io,
536 const struct cl_lock_descr *need)
538 struct cl_object_header *head;
539 struct cl_object *obj;
540 struct cl_lock *lock;
545 head = cl_object_header(obj);
547 spin_lock(&head->coh_lock_guard);
548 lock = cl_lock_lookup(env, obj, io, need);
549 spin_unlock(&head->coh_lock_guard);
552 lock = cl_lock_alloc(env, obj, io, need);
554 struct cl_lock *ghost;
556 spin_lock(&head->coh_lock_guard);
557 ghost = cl_lock_lookup(env, obj, io, need);
559 cfs_list_add_tail(&lock->cll_linkage,
561 spin_unlock(&head->coh_lock_guard);
562 CS_LOCK_INC(obj, busy);
564 spin_unlock(&head->coh_lock_guard);
566 * Other threads can acquire references to the
567 * top-lock through its sub-locks. Hence, it
568 * cannot be cl_lock_free()-ed immediately.
570 cl_lock_finish(env, lock);
579 * Returns existing lock matching given description. This is similar to
580 * cl_lock_find() except that no new lock is created, and returned lock is
581 * guaranteed to be in enum cl_lock_state::CLS_HELD state.
583 struct cl_lock *cl_lock_peek(const struct lu_env *env, const struct cl_io *io,
584 const struct cl_lock_descr *need,
585 const char *scope, const void *source)
587 struct cl_object_header *head;
588 struct cl_object *obj;
589 struct cl_lock *lock;
592 head = cl_object_header(obj);
595 spin_lock(&head->coh_lock_guard);
596 lock = cl_lock_lookup(env, obj, io, need);
597 spin_unlock(&head->coh_lock_guard);
601 cl_lock_mutex_get(env, lock);
602 if (lock->cll_state == CLS_INTRANSIT)
603 /* Don't care return value. */
604 cl_lock_state_wait(env, lock);
605 if (lock->cll_state == CLS_FREEING) {
606 cl_lock_mutex_put(env, lock);
607 cl_lock_put(env, lock);
610 } while (lock == NULL);
612 cl_lock_hold_add(env, lock, scope, source);
613 cl_lock_user_add(env, lock);
614 if (lock->cll_state == CLS_CACHED)
615 cl_use_try(env, lock, 1);
616 if (lock->cll_state == CLS_HELD) {
617 cl_lock_mutex_put(env, lock);
618 cl_lock_lockdep_acquire(env, lock, 0);
619 cl_lock_put(env, lock);
621 cl_unuse_try(env, lock);
622 cl_lock_unhold(env, lock, scope, source);
623 cl_lock_mutex_put(env, lock);
624 cl_lock_put(env, lock);
630 EXPORT_SYMBOL(cl_lock_peek);
633 * Returns a slice within a lock, corresponding to the given layer in the
638 const struct cl_lock_slice *cl_lock_at(const struct cl_lock *lock,
639 const struct lu_device_type *dtype)
641 const struct cl_lock_slice *slice;
643 LINVRNT(cl_lock_invariant_trusted(NULL, lock));
646 cfs_list_for_each_entry(slice, &lock->cll_layers, cls_linkage) {
647 if (slice->cls_obj->co_lu.lo_dev->ld_type == dtype)
652 EXPORT_SYMBOL(cl_lock_at);
654 static void cl_lock_mutex_tail(const struct lu_env *env, struct cl_lock *lock)
656 struct cl_thread_counters *counters;
658 counters = cl_lock_counters(env, lock);
660 counters->ctc_nr_locks_locked++;
661 lu_ref_add(&counters->ctc_locks_locked, "cll_guard", lock);
662 cl_lock_trace(D_TRACE, env, "got mutex", lock);
666 * Locks cl_lock object.
668 * This is used to manipulate cl_lock fields, and to serialize state
669 * transitions in the lock state machine.
671 * \post cl_lock_is_mutexed(lock)
673 * \see cl_lock_mutex_put()
675 void cl_lock_mutex_get(const struct lu_env *env, struct cl_lock *lock)
677 LINVRNT(cl_lock_invariant(env, lock));
679 if (lock->cll_guarder == current) {
680 LINVRNT(cl_lock_is_mutexed(lock));
681 LINVRNT(lock->cll_depth > 0);
683 struct cl_object_header *hdr;
684 struct cl_thread_info *info;
687 LINVRNT(lock->cll_guarder != current);
688 hdr = cl_object_header(lock->cll_descr.cld_obj);
690 * Check that mutices are taken in the bottom-to-top order.
692 info = cl_env_info(env);
693 for (i = 0; i < hdr->coh_nesting; ++i)
694 LASSERT(info->clt_counters[i].ctc_nr_locks_locked == 0);
695 mutex_lock_nested(&lock->cll_guard, hdr->coh_nesting);
696 lock->cll_guarder = current;
697 LINVRNT(lock->cll_depth == 0);
699 cl_lock_mutex_tail(env, lock);
701 EXPORT_SYMBOL(cl_lock_mutex_get);
704 * Try-locks cl_lock object.
706 * \retval 0 \a lock was successfully locked
708 * \retval -EBUSY \a lock cannot be locked right now
710 * \post ergo(result == 0, cl_lock_is_mutexed(lock))
712 * \see cl_lock_mutex_get()
714 int cl_lock_mutex_try(const struct lu_env *env, struct cl_lock *lock)
718 LINVRNT(cl_lock_invariant_trusted(env, lock));
722 if (lock->cll_guarder == current) {
723 LINVRNT(lock->cll_depth > 0);
724 cl_lock_mutex_tail(env, lock);
725 } else if (mutex_trylock(&lock->cll_guard)) {
726 LINVRNT(lock->cll_depth == 0);
727 lock->cll_guarder = current;
728 cl_lock_mutex_tail(env, lock);
733 EXPORT_SYMBOL(cl_lock_mutex_try);
736 {* Unlocks cl_lock object.
738 * \pre cl_lock_is_mutexed(lock)
740 * \see cl_lock_mutex_get()
742 void cl_lock_mutex_put(const struct lu_env *env, struct cl_lock *lock)
744 struct cl_thread_counters *counters;
746 LINVRNT(cl_lock_invariant(env, lock));
747 LINVRNT(cl_lock_is_mutexed(lock));
748 LINVRNT(lock->cll_guarder == current);
749 LINVRNT(lock->cll_depth > 0);
751 counters = cl_lock_counters(env, lock);
752 LINVRNT(counters->ctc_nr_locks_locked > 0);
754 cl_lock_trace(D_TRACE, env, "put mutex", lock);
755 lu_ref_del(&counters->ctc_locks_locked, "cll_guard", lock);
756 counters->ctc_nr_locks_locked--;
757 if (--lock->cll_depth == 0) {
758 lock->cll_guarder = NULL;
759 mutex_unlock(&lock->cll_guard);
762 EXPORT_SYMBOL(cl_lock_mutex_put);
765 * Returns true iff lock's mutex is owned by the current thread.
767 int cl_lock_is_mutexed(struct cl_lock *lock)
769 return lock->cll_guarder == current;
771 EXPORT_SYMBOL(cl_lock_is_mutexed);
774 * Returns number of cl_lock mutices held by the current thread (environment).
776 int cl_lock_nr_mutexed(const struct lu_env *env)
778 struct cl_thread_info *info;
783 * NOTE: if summation across all nesting levels (currently 2) proves
784 * too expensive, a summary counter can be added to
785 * struct cl_thread_info.
787 info = cl_env_info(env);
788 for (i = 0, locked = 0; i < ARRAY_SIZE(info->clt_counters); ++i)
789 locked += info->clt_counters[i].ctc_nr_locks_locked;
792 EXPORT_SYMBOL(cl_lock_nr_mutexed);
794 static void cl_lock_cancel0(const struct lu_env *env, struct cl_lock *lock)
796 LINVRNT(cl_lock_is_mutexed(lock));
797 LINVRNT(cl_lock_invariant(env, lock));
799 if (!(lock->cll_flags & CLF_CANCELLED)) {
800 const struct cl_lock_slice *slice;
802 lock->cll_flags |= CLF_CANCELLED;
803 cfs_list_for_each_entry_reverse(slice, &lock->cll_layers,
805 if (slice->cls_ops->clo_cancel != NULL)
806 slice->cls_ops->clo_cancel(env, slice);
812 static void cl_lock_delete0(const struct lu_env *env, struct cl_lock *lock)
814 struct cl_object_header *head;
815 const struct cl_lock_slice *slice;
817 LINVRNT(cl_lock_is_mutexed(lock));
818 LINVRNT(cl_lock_invariant(env, lock));
821 if (lock->cll_state < CLS_FREEING) {
822 LASSERT(lock->cll_state != CLS_INTRANSIT);
823 cl_lock_state_set(env, lock, CLS_FREEING);
825 head = cl_object_header(lock->cll_descr.cld_obj);
827 spin_lock(&head->coh_lock_guard);
828 cfs_list_del_init(&lock->cll_linkage);
829 spin_unlock(&head->coh_lock_guard);
832 * From now on, no new references to this lock can be acquired
833 * by cl_lock_lookup().
835 cfs_list_for_each_entry_reverse(slice, &lock->cll_layers,
837 if (slice->cls_ops->clo_delete != NULL)
838 slice->cls_ops->clo_delete(env, slice);
841 * From now on, no new references to this lock can be acquired
842 * by layer-specific means (like a pointer from struct
843 * ldlm_lock in osc, or a pointer from top-lock to sub-lock in
846 * Lock will be finally freed in cl_lock_put() when last of
847 * existing references goes away.
854 * Mod(ifie)s cl_lock::cll_holds counter for a given lock. Also, for a
855 * top-lock (nesting == 0) accounts for this modification in the per-thread
856 * debugging counters. Sub-lock holds can be released by a thread different
857 * from one that acquired it.
859 static void cl_lock_hold_mod(const struct lu_env *env, struct cl_lock *lock,
862 struct cl_thread_counters *counters;
863 enum clt_nesting_level nesting;
865 lock->cll_holds += delta;
866 nesting = cl_lock_nesting(lock);
867 if (nesting == CNL_TOP) {
868 counters = &cl_env_info(env)->clt_counters[CNL_TOP];
869 counters->ctc_nr_held += delta;
870 LASSERT(counters->ctc_nr_held >= 0);
875 * Mod(ifie)s cl_lock::cll_users counter for a given lock. See
876 * cl_lock_hold_mod() for the explanation of the debugging code.
878 static void cl_lock_used_mod(const struct lu_env *env, struct cl_lock *lock,
881 struct cl_thread_counters *counters;
882 enum clt_nesting_level nesting;
884 lock->cll_users += delta;
885 nesting = cl_lock_nesting(lock);
886 if (nesting == CNL_TOP) {
887 counters = &cl_env_info(env)->clt_counters[CNL_TOP];
888 counters->ctc_nr_used += delta;
889 LASSERT(counters->ctc_nr_used >= 0);
893 void cl_lock_hold_release(const struct lu_env *env, struct cl_lock *lock,
894 const char *scope, const void *source)
896 LINVRNT(cl_lock_is_mutexed(lock));
897 LINVRNT(cl_lock_invariant(env, lock));
898 LASSERT(lock->cll_holds > 0);
901 cl_lock_trace(D_DLMTRACE, env, "hold release lock", lock);
902 lu_ref_del(&lock->cll_holders, scope, source);
903 cl_lock_hold_mod(env, lock, -1);
904 if (lock->cll_holds == 0) {
905 CL_LOCK_ASSERT(lock->cll_state != CLS_HELD, env, lock);
906 if (lock->cll_descr.cld_mode == CLM_PHANTOM ||
907 lock->cll_descr.cld_mode == CLM_GROUP ||
908 lock->cll_state != CLS_CACHED)
910 * If lock is still phantom or grouplock when user is
911 * done with it---destroy the lock.
913 lock->cll_flags |= CLF_CANCELPEND|CLF_DOOMED;
914 if (lock->cll_flags & CLF_CANCELPEND) {
915 lock->cll_flags &= ~CLF_CANCELPEND;
916 cl_lock_cancel0(env, lock);
918 if (lock->cll_flags & CLF_DOOMED) {
919 /* no longer doomed: it's dead... Jim. */
920 lock->cll_flags &= ~CLF_DOOMED;
921 cl_lock_delete0(env, lock);
926 EXPORT_SYMBOL(cl_lock_hold_release);
929 * Waits until lock state is changed.
931 * This function is called with cl_lock mutex locked, atomically releases
932 * mutex and goes to sleep, waiting for a lock state change (signaled by
933 * cl_lock_signal()), and re-acquires the mutex before return.
935 * This function is used to wait until lock state machine makes some progress
936 * and to emulate synchronous operations on top of asynchronous lock
939 * \retval -EINTR wait was interrupted
941 * \retval 0 wait wasn't interrupted
943 * \pre cl_lock_is_mutexed(lock)
945 * \see cl_lock_signal()
947 int cl_lock_state_wait(const struct lu_env *env, struct cl_lock *lock)
954 LINVRNT(cl_lock_is_mutexed(lock));
955 LINVRNT(cl_lock_invariant(env, lock));
956 LASSERT(lock->cll_depth == 1);
957 LASSERT(lock->cll_state != CLS_FREEING); /* too late to wait */
959 cl_lock_trace(D_DLMTRACE, env, "state wait lock", lock);
960 result = lock->cll_error;
962 /* To avoid being interrupted by the 'non-fatal' signals
963 * (SIGCHLD, for instance), we'd block them temporarily.
965 blocked = cfs_block_sigsinv(LUSTRE_FATAL_SIGS);
967 init_waitqueue_entry_current(&waiter);
968 add_wait_queue(&lock->cll_wq, &waiter);
969 set_current_state(TASK_INTERRUPTIBLE);
970 cl_lock_mutex_put(env, lock);
972 LASSERT(cl_lock_nr_mutexed(env) == 0);
974 /* Returning ERESTARTSYS instead of EINTR so syscalls
975 * can be restarted if signals are pending here */
976 result = -ERESTARTSYS;
977 if (likely(!OBD_FAIL_CHECK(OBD_FAIL_LOCK_STATE_WAIT_INTR))) {
978 waitq_wait(&waiter, TASK_INTERRUPTIBLE);
979 if (!cfs_signal_pending())
983 cl_lock_mutex_get(env, lock);
984 set_current_state(TASK_RUNNING);
985 remove_wait_queue(&lock->cll_wq, &waiter);
987 /* Restore old blocked signals */
988 cfs_restore_sigs(blocked);
992 EXPORT_SYMBOL(cl_lock_state_wait);
994 static void cl_lock_state_signal(const struct lu_env *env, struct cl_lock *lock,
995 enum cl_lock_state state)
997 const struct cl_lock_slice *slice;
1000 LINVRNT(cl_lock_is_mutexed(lock));
1001 LINVRNT(cl_lock_invariant(env, lock));
1003 cfs_list_for_each_entry(slice, &lock->cll_layers, cls_linkage)
1004 if (slice->cls_ops->clo_state != NULL)
1005 slice->cls_ops->clo_state(env, slice, state);
1006 wake_up_all(&lock->cll_wq);
1011 * Notifies waiters that lock state changed.
1013 * Wakes up all waiters sleeping in cl_lock_state_wait(), also notifies all
1014 * layers about state change by calling cl_lock_operations::clo_state()
1017 void cl_lock_signal(const struct lu_env *env, struct cl_lock *lock)
1020 cl_lock_trace(D_DLMTRACE, env, "state signal lock", lock);
1021 cl_lock_state_signal(env, lock, lock->cll_state);
1024 EXPORT_SYMBOL(cl_lock_signal);
1027 * Changes lock state.
1029 * This function is invoked to notify layers that lock state changed, possible
1030 * as a result of an asynchronous event such as call-back reception.
1032 * \post lock->cll_state == state
1034 * \see cl_lock_operations::clo_state()
1036 void cl_lock_state_set(const struct lu_env *env, struct cl_lock *lock,
1037 enum cl_lock_state state)
1040 LASSERT(lock->cll_state <= state ||
1041 (lock->cll_state == CLS_CACHED &&
1042 (state == CLS_HELD || /* lock found in cache */
1043 state == CLS_NEW || /* sub-lock canceled */
1044 state == CLS_INTRANSIT)) ||
1045 /* lock is in transit state */
1046 lock->cll_state == CLS_INTRANSIT);
1048 if (lock->cll_state != state) {
1049 CS_LOCKSTATE_DEC(lock->cll_descr.cld_obj, lock->cll_state);
1050 CS_LOCKSTATE_INC(lock->cll_descr.cld_obj, state);
1052 cl_lock_state_signal(env, lock, state);
1053 lock->cll_state = state;
1057 EXPORT_SYMBOL(cl_lock_state_set);
1059 static int cl_unuse_try_internal(const struct lu_env *env, struct cl_lock *lock)
1061 const struct cl_lock_slice *slice;
1067 LINVRNT(cl_lock_is_mutexed(lock));
1068 LINVRNT(cl_lock_invariant(env, lock));
1069 LASSERT(lock->cll_state == CLS_INTRANSIT);
1072 cfs_list_for_each_entry_reverse(slice, &lock->cll_layers,
1074 if (slice->cls_ops->clo_unuse != NULL) {
1075 result = slice->cls_ops->clo_unuse(env, slice);
1080 LASSERT(result != -ENOSYS);
1081 } while (result == CLO_REPEAT);
1087 * Yanks lock from the cache (cl_lock_state::CLS_CACHED state) by calling
1088 * cl_lock_operations::clo_use() top-to-bottom to notify layers.
1089 * @atomic = 1, it must unuse the lock to recovery the lock to keep the
1090 * use process atomic
1092 int cl_use_try(const struct lu_env *env, struct cl_lock *lock, int atomic)
1094 const struct cl_lock_slice *slice;
1096 enum cl_lock_state state;
1099 cl_lock_trace(D_DLMTRACE, env, "use lock", lock);
1101 LASSERT(lock->cll_state == CLS_CACHED);
1102 if (lock->cll_error)
1103 RETURN(lock->cll_error);
1106 state = cl_lock_intransit(env, lock);
1107 cfs_list_for_each_entry(slice, &lock->cll_layers, cls_linkage) {
1108 if (slice->cls_ops->clo_use != NULL) {
1109 result = slice->cls_ops->clo_use(env, slice);
1114 LASSERT(result != -ENOSYS);
1116 LASSERTF(lock->cll_state == CLS_INTRANSIT, "Wrong state %d.\n",
1122 if (result == -ESTALE) {
1124 * ESTALE means sublock being cancelled
1125 * at this time, and set lock state to
1126 * be NEW here and ask the caller to repeat.
1129 result = CLO_REPEAT;
1132 /* @atomic means back-off-on-failure. */
1135 rc = cl_unuse_try_internal(env, lock);
1136 /* Vet the results. */
1137 if (rc < 0 && result > 0)
1142 cl_lock_extransit(env, lock, state);
1145 EXPORT_SYMBOL(cl_use_try);
1148 * Helper for cl_enqueue_try() that calls ->clo_enqueue() across all layers
1151 static int cl_enqueue_kick(const struct lu_env *env,
1152 struct cl_lock *lock,
1153 struct cl_io *io, __u32 flags)
1156 const struct cl_lock_slice *slice;
1160 cfs_list_for_each_entry(slice, &lock->cll_layers, cls_linkage) {
1161 if (slice->cls_ops->clo_enqueue != NULL) {
1162 result = slice->cls_ops->clo_enqueue(env,
1168 LASSERT(result != -ENOSYS);
1173 * Tries to enqueue a lock.
1175 * This function is called repeatedly by cl_enqueue() until either lock is
1176 * enqueued, or error occurs. This function does not block waiting for
1177 * networking communication to complete.
1179 * \post ergo(result == 0, lock->cll_state == CLS_ENQUEUED ||
1180 * lock->cll_state == CLS_HELD)
1182 * \see cl_enqueue() cl_lock_operations::clo_enqueue()
1183 * \see cl_lock_state::CLS_ENQUEUED
1185 int cl_enqueue_try(const struct lu_env *env, struct cl_lock *lock,
1186 struct cl_io *io, __u32 flags)
1191 cl_lock_trace(D_DLMTRACE, env, "enqueue lock", lock);
1193 LINVRNT(cl_lock_is_mutexed(lock));
1195 result = lock->cll_error;
1199 switch (lock->cll_state) {
1201 cl_lock_state_set(env, lock, CLS_QUEUING);
1205 result = cl_enqueue_kick(env, lock, io, flags);
1206 /* For AGL case, the cl_lock::cll_state may
1207 * become CLS_HELD already. */
1208 if (result == 0 && lock->cll_state == CLS_QUEUING)
1209 cl_lock_state_set(env, lock, CLS_ENQUEUED);
1212 LASSERT(cl_lock_is_intransit(lock));
1216 /* yank lock from the cache. */
1217 result = cl_use_try(env, lock, 0);
1226 * impossible, only held locks with increased
1227 * ->cll_holds can be enqueued, and they cannot be
1232 } while (result == CLO_REPEAT);
1235 EXPORT_SYMBOL(cl_enqueue_try);
1238 * Cancel the conflicting lock found during previous enqueue.
1240 * \retval 0 conflicting lock has been canceled.
1241 * \retval -ve error code.
1243 int cl_lock_enqueue_wait(const struct lu_env *env,
1244 struct cl_lock *lock,
1247 struct cl_lock *conflict;
1251 LASSERT(cl_lock_is_mutexed(lock));
1252 LASSERT(lock->cll_state == CLS_QUEUING);
1253 LASSERT(lock->cll_conflict != NULL);
1255 conflict = lock->cll_conflict;
1256 lock->cll_conflict = NULL;
1258 cl_lock_mutex_put(env, lock);
1259 LASSERT(cl_lock_nr_mutexed(env) == 0);
1261 cl_lock_mutex_get(env, conflict);
1262 cl_lock_trace(D_DLMTRACE, env, "enqueue wait", conflict);
1263 cl_lock_cancel(env, conflict);
1264 cl_lock_delete(env, conflict);
1266 while (conflict->cll_state != CLS_FREEING) {
1267 rc = cl_lock_state_wait(env, conflict);
1271 cl_lock_mutex_put(env, conflict);
1272 lu_ref_del(&conflict->cll_reference, "cancel-wait", lock);
1273 cl_lock_put(env, conflict);
1276 cl_lock_mutex_get(env, lock);
1281 EXPORT_SYMBOL(cl_lock_enqueue_wait);
1283 static int cl_enqueue_locked(const struct lu_env *env, struct cl_lock *lock,
1284 struct cl_io *io, __u32 enqflags)
1290 LINVRNT(cl_lock_is_mutexed(lock));
1291 LINVRNT(cl_lock_invariant(env, lock));
1292 LASSERT(lock->cll_holds > 0);
1294 cl_lock_user_add(env, lock);
1296 result = cl_enqueue_try(env, lock, io, enqflags);
1297 if (result == CLO_WAIT) {
1298 if (lock->cll_conflict != NULL)
1299 result = cl_lock_enqueue_wait(env, lock, 1);
1301 result = cl_lock_state_wait(env, lock);
1308 cl_unuse_try(env, lock);
1309 LASSERT(ergo(result == 0 && !(enqflags & CEF_AGL),
1310 lock->cll_state == CLS_ENQUEUED ||
1311 lock->cll_state == CLS_HELD));
1318 * \pre current thread or io owns a hold on lock.
1320 * \post ergo(result == 0, lock->users increased)
1321 * \post ergo(result == 0, lock->cll_state == CLS_ENQUEUED ||
1322 * lock->cll_state == CLS_HELD)
1324 int cl_enqueue(const struct lu_env *env, struct cl_lock *lock,
1325 struct cl_io *io, __u32 enqflags)
1331 cl_lock_lockdep_acquire(env, lock, enqflags);
1332 cl_lock_mutex_get(env, lock);
1333 result = cl_enqueue_locked(env, lock, io, enqflags);
1334 cl_lock_mutex_put(env, lock);
1336 cl_lock_lockdep_release(env, lock);
1337 LASSERT(ergo(result == 0, lock->cll_state == CLS_ENQUEUED ||
1338 lock->cll_state == CLS_HELD));
1341 EXPORT_SYMBOL(cl_enqueue);
1344 * Tries to unlock a lock.
1346 * This function is called to release underlying resource:
1347 * 1. for top lock, the resource is sublocks it held;
1348 * 2. for sublock, the resource is the reference to dlmlock.
1350 * cl_unuse_try is a one-shot operation, so it must NOT return CLO_WAIT.
1352 * \see cl_unuse() cl_lock_operations::clo_unuse()
1353 * \see cl_lock_state::CLS_CACHED
1355 int cl_unuse_try(const struct lu_env *env, struct cl_lock *lock)
1358 enum cl_lock_state state = CLS_NEW;
1361 cl_lock_trace(D_DLMTRACE, env, "unuse lock", lock);
1363 if (lock->cll_users > 1) {
1364 cl_lock_user_del(env, lock);
1368 /* Only if the lock is in CLS_HELD or CLS_ENQUEUED state, it can hold
1369 * underlying resources. */
1370 if (!(lock->cll_state == CLS_HELD || lock->cll_state == CLS_ENQUEUED)) {
1371 cl_lock_user_del(env, lock);
1376 * New lock users (->cll_users) are not protecting unlocking
1377 * from proceeding. From this point, lock eventually reaches
1378 * CLS_CACHED, is reinitialized to CLS_NEW or fails into
1381 state = cl_lock_intransit(env, lock);
1383 result = cl_unuse_try_internal(env, lock);
1384 LASSERT(lock->cll_state == CLS_INTRANSIT);
1385 LASSERT(result != CLO_WAIT);
1386 cl_lock_user_del(env, lock);
1387 if (result == 0 || result == -ESTALE) {
1389 * Return lock back to the cache. This is the only
1390 * place where lock is moved into CLS_CACHED state.
1392 * If one of ->clo_unuse() methods returned -ESTALE, lock
1393 * cannot be placed into cache and has to be
1394 * re-initialized. This happens e.g., when a sub-lock was
1395 * canceled while unlocking was in progress.
1397 if (state == CLS_HELD && result == 0)
1401 cl_lock_extransit(env, lock, state);
1404 * Hide -ESTALE error.
1405 * If the lock is a glimpse lock, and it has multiple
1406 * stripes. Assuming that one of its sublock returned -ENAVAIL,
1407 * and other sublocks are matched write locks. In this case,
1408 * we can't set this lock to error because otherwise some of
1409 * its sublocks may not be canceled. This causes some dirty
1410 * pages won't be written to OSTs. -jay
1414 CERROR("result = %d, this is unlikely!\n", result);
1416 cl_lock_extransit(env, lock, state);
1418 RETURN(result ?: lock->cll_error);
1420 EXPORT_SYMBOL(cl_unuse_try);
1422 static void cl_unuse_locked(const struct lu_env *env, struct cl_lock *lock)
1427 result = cl_unuse_try(env, lock);
1429 CL_LOCK_DEBUG(D_ERROR, env, lock, "unuse return %d\n", result);
1437 void cl_unuse(const struct lu_env *env, struct cl_lock *lock)
1440 cl_lock_mutex_get(env, lock);
1441 cl_unuse_locked(env, lock);
1442 cl_lock_mutex_put(env, lock);
1443 cl_lock_lockdep_release(env, lock);
1446 EXPORT_SYMBOL(cl_unuse);
1449 * Tries to wait for a lock.
1451 * This function is called repeatedly by cl_wait() until either lock is
1452 * granted, or error occurs. This function does not block waiting for network
1453 * communication to complete.
1455 * \see cl_wait() cl_lock_operations::clo_wait()
1456 * \see cl_lock_state::CLS_HELD
1458 int cl_wait_try(const struct lu_env *env, struct cl_lock *lock)
1460 const struct cl_lock_slice *slice;
1464 cl_lock_trace(D_DLMTRACE, env, "wait lock try", lock);
1466 LINVRNT(cl_lock_is_mutexed(lock));
1467 LINVRNT(cl_lock_invariant(env, lock));
1468 LASSERTF(lock->cll_state == CLS_QUEUING ||
1469 lock->cll_state == CLS_ENQUEUED ||
1470 lock->cll_state == CLS_HELD ||
1471 lock->cll_state == CLS_INTRANSIT,
1472 "lock state: %d\n", lock->cll_state);
1473 LASSERT(lock->cll_users > 0);
1474 LASSERT(lock->cll_holds > 0);
1476 result = lock->cll_error;
1480 if (cl_lock_is_intransit(lock)) {
1485 if (lock->cll_state == CLS_HELD)
1490 cfs_list_for_each_entry(slice, &lock->cll_layers, cls_linkage) {
1491 if (slice->cls_ops->clo_wait != NULL) {
1492 result = slice->cls_ops->clo_wait(env, slice);
1497 LASSERT(result != -ENOSYS);
1499 LASSERT(lock->cll_state != CLS_INTRANSIT);
1500 cl_lock_state_set(env, lock, CLS_HELD);
1502 } while (result == CLO_REPEAT);
1505 EXPORT_SYMBOL(cl_wait_try);
1508 * Waits until enqueued lock is granted.
1510 * \pre current thread or io owns a hold on the lock
1511 * \pre ergo(result == 0, lock->cll_state == CLS_ENQUEUED ||
1512 * lock->cll_state == CLS_HELD)
1514 * \post ergo(result == 0, lock->cll_state == CLS_HELD)
1516 int cl_wait(const struct lu_env *env, struct cl_lock *lock)
1521 cl_lock_mutex_get(env, lock);
1523 LINVRNT(cl_lock_invariant(env, lock));
1524 LASSERTF(lock->cll_state == CLS_ENQUEUED || lock->cll_state == CLS_HELD,
1525 "Wrong state %d \n", lock->cll_state);
1526 LASSERT(lock->cll_holds > 0);
1529 result = cl_wait_try(env, lock);
1530 if (result == CLO_WAIT) {
1531 result = cl_lock_state_wait(env, lock);
1538 cl_unuse_try(env, lock);
1539 cl_lock_lockdep_release(env, lock);
1541 cl_lock_trace(D_DLMTRACE, env, "wait lock", lock);
1542 cl_lock_mutex_put(env, lock);
1543 LASSERT(ergo(result == 0, lock->cll_state == CLS_HELD));
1546 EXPORT_SYMBOL(cl_wait);
1549 * Executes cl_lock_operations::clo_weigh(), and sums results to estimate lock
1552 unsigned long cl_lock_weigh(const struct lu_env *env, struct cl_lock *lock)
1554 const struct cl_lock_slice *slice;
1555 unsigned long pound;
1556 unsigned long ounce;
1559 LINVRNT(cl_lock_is_mutexed(lock));
1560 LINVRNT(cl_lock_invariant(env, lock));
1563 cfs_list_for_each_entry_reverse(slice, &lock->cll_layers, cls_linkage) {
1564 if (slice->cls_ops->clo_weigh != NULL) {
1565 ounce = slice->cls_ops->clo_weigh(env, slice);
1567 if (pound < ounce) /* over-weight^Wflow */
1573 EXPORT_SYMBOL(cl_lock_weigh);
1576 * Notifies layers that lock description changed.
1578 * The server can grant client a lock different from one that was requested
1579 * (e.g., larger in extent). This method is called when actually granted lock
1580 * description becomes known to let layers to accommodate for changed lock
1583 * \see cl_lock_operations::clo_modify()
1585 int cl_lock_modify(const struct lu_env *env, struct cl_lock *lock,
1586 const struct cl_lock_descr *desc)
1588 const struct cl_lock_slice *slice;
1589 struct cl_object *obj = lock->cll_descr.cld_obj;
1590 struct cl_object_header *hdr = cl_object_header(obj);
1594 cl_lock_trace(D_DLMTRACE, env, "modify lock", lock);
1595 /* don't allow object to change */
1596 LASSERT(obj == desc->cld_obj);
1597 LINVRNT(cl_lock_is_mutexed(lock));
1598 LINVRNT(cl_lock_invariant(env, lock));
1600 cfs_list_for_each_entry_reverse(slice, &lock->cll_layers, cls_linkage) {
1601 if (slice->cls_ops->clo_modify != NULL) {
1602 result = slice->cls_ops->clo_modify(env, slice, desc);
1607 CL_LOCK_DEBUG(D_DLMTRACE, env, lock, " -> "DDESCR"@"DFID"\n",
1608 PDESCR(desc), PFID(lu_object_fid(&desc->cld_obj->co_lu)));
1610 * Just replace description in place. Nothing more is needed for
1611 * now. If locks were indexed according to their extent and/or mode,
1612 * that index would have to be updated here.
1614 spin_lock(&hdr->coh_lock_guard);
1615 lock->cll_descr = *desc;
1616 spin_unlock(&hdr->coh_lock_guard);
1619 EXPORT_SYMBOL(cl_lock_modify);
1622 * Initializes lock closure with a given origin.
1624 * \see cl_lock_closure
1626 void cl_lock_closure_init(const struct lu_env *env,
1627 struct cl_lock_closure *closure,
1628 struct cl_lock *origin, int wait)
1630 LINVRNT(cl_lock_is_mutexed(origin));
1631 LINVRNT(cl_lock_invariant(env, origin));
1633 CFS_INIT_LIST_HEAD(&closure->clc_list);
1634 closure->clc_origin = origin;
1635 closure->clc_wait = wait;
1636 closure->clc_nr = 0;
1638 EXPORT_SYMBOL(cl_lock_closure_init);
1641 * Builds a closure of \a lock.
1643 * Building of a closure consists of adding initial lock (\a lock) into it,
1644 * and calling cl_lock_operations::clo_closure() methods of \a lock. These
1645 * methods might call cl_lock_closure_build() recursively again, adding more
1646 * locks to the closure, etc.
1648 * \see cl_lock_closure
1650 int cl_lock_closure_build(const struct lu_env *env, struct cl_lock *lock,
1651 struct cl_lock_closure *closure)
1653 const struct cl_lock_slice *slice;
1657 LINVRNT(cl_lock_is_mutexed(closure->clc_origin));
1658 LINVRNT(cl_lock_invariant(env, closure->clc_origin));
1660 result = cl_lock_enclosure(env, lock, closure);
1662 cfs_list_for_each_entry(slice, &lock->cll_layers, cls_linkage) {
1663 if (slice->cls_ops->clo_closure != NULL) {
1664 result = slice->cls_ops->clo_closure(env, slice,
1672 cl_lock_disclosure(env, closure);
1675 EXPORT_SYMBOL(cl_lock_closure_build);
1678 * Adds new lock to a closure.
1680 * Try-locks \a lock and if succeeded, adds it to the closure (never more than
1681 * once). If try-lock failed, returns CLO_REPEAT, after optionally waiting
1682 * until next try-lock is likely to succeed.
1684 int cl_lock_enclosure(const struct lu_env *env, struct cl_lock *lock,
1685 struct cl_lock_closure *closure)
1689 cl_lock_trace(D_DLMTRACE, env, "enclosure lock", lock);
1690 if (!cl_lock_mutex_try(env, lock)) {
1692 * If lock->cll_inclosure is not empty, lock is already in
1695 if (cfs_list_empty(&lock->cll_inclosure)) {
1696 cl_lock_get_trust(lock);
1697 lu_ref_add(&lock->cll_reference, "closure", closure);
1698 cfs_list_add(&lock->cll_inclosure, &closure->clc_list);
1701 cl_lock_mutex_put(env, lock);
1704 cl_lock_disclosure(env, closure);
1705 if (closure->clc_wait) {
1706 cl_lock_get_trust(lock);
1707 lu_ref_add(&lock->cll_reference, "closure-w", closure);
1708 cl_lock_mutex_put(env, closure->clc_origin);
1710 LASSERT(cl_lock_nr_mutexed(env) == 0);
1711 cl_lock_mutex_get(env, lock);
1712 cl_lock_mutex_put(env, lock);
1714 cl_lock_mutex_get(env, closure->clc_origin);
1715 lu_ref_del(&lock->cll_reference, "closure-w", closure);
1716 cl_lock_put(env, lock);
1718 result = CLO_REPEAT;
1722 EXPORT_SYMBOL(cl_lock_enclosure);
1724 /** Releases mutices of enclosed locks. */
1725 void cl_lock_disclosure(const struct lu_env *env,
1726 struct cl_lock_closure *closure)
1728 struct cl_lock *scan;
1729 struct cl_lock *temp;
1731 cl_lock_trace(D_DLMTRACE, env, "disclosure lock", closure->clc_origin);
1732 cfs_list_for_each_entry_safe(scan, temp, &closure->clc_list,
1734 cfs_list_del_init(&scan->cll_inclosure);
1735 cl_lock_mutex_put(env, scan);
1736 lu_ref_del(&scan->cll_reference, "closure", closure);
1737 cl_lock_put(env, scan);
1740 LASSERT(closure->clc_nr == 0);
1742 EXPORT_SYMBOL(cl_lock_disclosure);
1744 /** Finalizes a closure. */
1745 void cl_lock_closure_fini(struct cl_lock_closure *closure)
1747 LASSERT(closure->clc_nr == 0);
1748 LASSERT(cfs_list_empty(&closure->clc_list));
1750 EXPORT_SYMBOL(cl_lock_closure_fini);
1753 * Destroys this lock. Notifies layers (bottom-to-top) that lock is being
1754 * destroyed, then destroy the lock. If there are holds on the lock, postpone
1755 * destruction until all holds are released. This is called when a decision is
1756 * made to destroy the lock in the future. E.g., when a blocking AST is
1757 * received on it, or fatal communication error happens.
1759 * Caller must have a reference on this lock to prevent a situation, when
1760 * deleted lock lingers in memory for indefinite time, because nobody calls
1761 * cl_lock_put() to finish it.
1763 * \pre atomic_read(&lock->cll_ref) > 0
1764 * \pre ergo(cl_lock_nesting(lock) == CNL_TOP,
1765 * cl_lock_nr_mutexed(env) == 1)
1766 * [i.e., if a top-lock is deleted, mutices of no other locks can be
1767 * held, as deletion of sub-locks might require releasing a top-lock
1770 * \see cl_lock_operations::clo_delete()
1771 * \see cl_lock::cll_holds
1773 void cl_lock_delete(const struct lu_env *env, struct cl_lock *lock)
1775 LINVRNT(cl_lock_is_mutexed(lock));
1776 LINVRNT(cl_lock_invariant(env, lock));
1777 LASSERT(ergo(cl_lock_nesting(lock) == CNL_TOP,
1778 cl_lock_nr_mutexed(env) == 1));
1781 cl_lock_trace(D_DLMTRACE, env, "delete lock", lock);
1782 if (lock->cll_holds == 0)
1783 cl_lock_delete0(env, lock);
1785 lock->cll_flags |= CLF_DOOMED;
1788 EXPORT_SYMBOL(cl_lock_delete);
1791 * Mark lock as irrecoverably failed, and mark it for destruction. This
1792 * happens when, e.g., server fails to grant a lock to us, or networking
1795 * \pre atomic_read(&lock->cll_ref) > 0
1797 * \see clo_lock_delete()
1798 * \see cl_lock::cll_holds
1800 void cl_lock_error(const struct lu_env *env, struct cl_lock *lock, int error)
1802 LINVRNT(cl_lock_is_mutexed(lock));
1803 LINVRNT(cl_lock_invariant(env, lock));
1806 if (lock->cll_error == 0 && error != 0) {
1807 cl_lock_trace(D_DLMTRACE, env, "set lock error", lock);
1808 lock->cll_error = error;
1809 cl_lock_signal(env, lock);
1810 cl_lock_cancel(env, lock);
1811 cl_lock_delete(env, lock);
1815 EXPORT_SYMBOL(cl_lock_error);
1818 * Cancels this lock. Notifies layers
1819 * (bottom-to-top) that lock is being cancelled, then destroy the lock. If
1820 * there are holds on the lock, postpone cancellation until
1821 * all holds are released.
1823 * Cancellation notification is delivered to layers at most once.
1825 * \see cl_lock_operations::clo_cancel()
1826 * \see cl_lock::cll_holds
1828 void cl_lock_cancel(const struct lu_env *env, struct cl_lock *lock)
1830 LINVRNT(cl_lock_is_mutexed(lock));
1831 LINVRNT(cl_lock_invariant(env, lock));
1834 cl_lock_trace(D_DLMTRACE, env, "cancel lock", lock);
1835 if (lock->cll_holds == 0)
1836 cl_lock_cancel0(env, lock);
1838 lock->cll_flags |= CLF_CANCELPEND;
1841 EXPORT_SYMBOL(cl_lock_cancel);
1844 * Finds an existing lock covering given index and optionally different from a
1845 * given \a except lock.
1847 struct cl_lock *cl_lock_at_pgoff(const struct lu_env *env,
1848 struct cl_object *obj, pgoff_t index,
1849 struct cl_lock *except,
1850 int pending, int canceld)
1852 struct cl_object_header *head;
1853 struct cl_lock *scan;
1854 struct cl_lock *lock;
1855 struct cl_lock_descr *need;
1859 head = cl_object_header(obj);
1860 need = &cl_env_info(env)->clt_descr;
1863 need->cld_mode = CLM_READ; /* CLM_READ matches both READ & WRITE, but
1865 need->cld_start = need->cld_end = index;
1866 need->cld_enq_flags = 0;
1868 spin_lock(&head->coh_lock_guard);
1869 /* It is fine to match any group lock since there could be only one
1870 * with a uniq gid and it conflicts with all other lock modes too */
1871 cfs_list_for_each_entry(scan, &head->coh_locks, cll_linkage) {
1872 if (scan != except &&
1873 (scan->cll_descr.cld_mode == CLM_GROUP ||
1874 cl_lock_ext_match(&scan->cll_descr, need)) &&
1875 scan->cll_state >= CLS_HELD &&
1876 scan->cll_state < CLS_FREEING &&
1878 * This check is racy as the lock can be canceled right
1879 * after it is done, but this is fine, because page exists
1882 (canceld || !(scan->cll_flags & CLF_CANCELLED)) &&
1883 (pending || !(scan->cll_flags & CLF_CANCELPEND))) {
1884 /* Don't increase cs_hit here since this
1885 * is just a helper function. */
1886 cl_lock_get_trust(scan);
1891 spin_unlock(&head->coh_lock_guard);
1894 EXPORT_SYMBOL(cl_lock_at_pgoff);
1897 * Calculate the page offset at the layer of @lock.
1898 * At the time of this writing, @page is top page and @lock is sub lock.
1900 static pgoff_t pgoff_at_lock(struct cl_page *page, struct cl_lock *lock)
1902 struct lu_device_type *dtype;
1903 const struct cl_page_slice *slice;
1905 dtype = lock->cll_descr.cld_obj->co_lu.lo_dev->ld_type;
1906 slice = cl_page_at(page, dtype);
1907 LASSERT(slice != NULL);
1908 return slice->cpl_page->cp_index;
1912 * Check if page @page is covered by an extra lock or discard it.
1914 static int check_and_discard_cb(const struct lu_env *env, struct cl_io *io,
1915 struct cl_page *page, void *cbdata)
1917 struct cl_thread_info *info = cl_env_info(env);
1918 struct cl_lock *lock = cbdata;
1919 pgoff_t index = pgoff_at_lock(page, lock);
1921 if (index >= info->clt_fn_index) {
1922 struct cl_lock *tmp;
1924 /* refresh non-overlapped index */
1925 tmp = cl_lock_at_pgoff(env, lock->cll_descr.cld_obj, index,
1928 /* Cache the first-non-overlapped index so as to skip
1929 * all pages within [index, clt_fn_index). This
1930 * is safe because if tmp lock is canceled, it will
1931 * discard these pages. */
1932 info->clt_fn_index = tmp->cll_descr.cld_end + 1;
1933 if (tmp->cll_descr.cld_end == CL_PAGE_EOF)
1934 info->clt_fn_index = CL_PAGE_EOF;
1935 cl_lock_put(env, tmp);
1936 } else if (cl_page_own(env, io, page) == 0) {
1937 /* discard the page */
1938 cl_page_unmap(env, io, page);
1939 cl_page_discard(env, io, page);
1940 cl_page_disown(env, io, page);
1942 LASSERT(page->cp_state == CPS_FREEING);
1946 info->clt_next_index = index + 1;
1947 return CLP_GANG_OKAY;
1950 static int discard_cb(const struct lu_env *env, struct cl_io *io,
1951 struct cl_page *page, void *cbdata)
1953 struct cl_thread_info *info = cl_env_info(env);
1954 struct cl_lock *lock = cbdata;
1956 LASSERT(lock->cll_descr.cld_mode >= CLM_WRITE);
1957 KLASSERT(ergo(page->cp_type == CPT_CACHEABLE,
1958 !PageWriteback(cl_page_vmpage(env, page))));
1959 KLASSERT(ergo(page->cp_type == CPT_CACHEABLE,
1960 !PageDirty(cl_page_vmpage(env, page))));
1962 info->clt_next_index = pgoff_at_lock(page, lock) + 1;
1963 if (cl_page_own(env, io, page) == 0) {
1964 /* discard the page */
1965 cl_page_unmap(env, io, page);
1966 cl_page_discard(env, io, page);
1967 cl_page_disown(env, io, page);
1969 LASSERT(page->cp_state == CPS_FREEING);
1972 return CLP_GANG_OKAY;
1976 * Discard pages protected by the given lock. This function traverses radix
1977 * tree to find all covering pages and discard them. If a page is being covered
1978 * by other locks, it should remain in cache.
1980 * If error happens on any step, the process continues anyway (the reasoning
1981 * behind this being that lock cancellation cannot be delayed indefinitely).
1983 int cl_lock_discard_pages(const struct lu_env *env, struct cl_lock *lock)
1985 struct cl_thread_info *info = cl_env_info(env);
1986 struct cl_io *io = &info->clt_io;
1987 struct cl_lock_descr *descr = &lock->cll_descr;
1988 cl_page_gang_cb_t cb;
1992 LINVRNT(cl_lock_invariant(env, lock));
1995 io->ci_obj = cl_object_top(descr->cld_obj);
1996 io->ci_ignore_layout = 1;
1997 result = cl_io_init(env, io, CIT_MISC, io->ci_obj);
2001 cb = descr->cld_mode == CLM_READ ? check_and_discard_cb : discard_cb;
2002 info->clt_fn_index = info->clt_next_index = descr->cld_start;
2004 res = cl_page_gang_lookup(env, descr->cld_obj, io,
2005 info->clt_next_index, descr->cld_end,
2007 if (info->clt_next_index > descr->cld_end)
2010 if (res == CLP_GANG_RESCHED)
2012 } while (res != CLP_GANG_OKAY);
2014 cl_io_fini(env, io);
2017 EXPORT_SYMBOL(cl_lock_discard_pages);
2020 * Eliminate all locks for a given object.
2022 * Caller has to guarantee that no lock is in active use.
2024 * \param cancel when this is set, cl_locks_prune() cancels locks before
2027 void cl_locks_prune(const struct lu_env *env, struct cl_object *obj, int cancel)
2029 struct cl_object_header *head;
2030 struct cl_lock *lock;
2033 head = cl_object_header(obj);
2035 * If locks are destroyed without cancellation, all pages must be
2036 * already destroyed (as otherwise they will be left unprotected).
2038 LASSERT(ergo(!cancel,
2039 head->coh_tree.rnode == NULL && head->coh_pages == 0));
2041 spin_lock(&head->coh_lock_guard);
2042 while (!cfs_list_empty(&head->coh_locks)) {
2043 lock = container_of(head->coh_locks.next,
2044 struct cl_lock, cll_linkage);
2045 cl_lock_get_trust(lock);
2046 spin_unlock(&head->coh_lock_guard);
2047 lu_ref_add(&lock->cll_reference, "prune", current);
2050 cl_lock_mutex_get(env, lock);
2051 if (lock->cll_state < CLS_FREEING) {
2052 LASSERT(lock->cll_users <= 1);
2053 if (unlikely(lock->cll_users == 1)) {
2054 struct l_wait_info lwi = { 0 };
2056 cl_lock_mutex_put(env, lock);
2057 l_wait_event(lock->cll_wq,
2058 lock->cll_users == 0,
2064 cl_lock_cancel(env, lock);
2065 cl_lock_delete(env, lock);
2067 cl_lock_mutex_put(env, lock);
2068 lu_ref_del(&lock->cll_reference, "prune", current);
2069 cl_lock_put(env, lock);
2070 spin_lock(&head->coh_lock_guard);
2072 spin_unlock(&head->coh_lock_guard);
2075 EXPORT_SYMBOL(cl_locks_prune);
2077 static struct cl_lock *cl_lock_hold_mutex(const struct lu_env *env,
2078 const struct cl_io *io,
2079 const struct cl_lock_descr *need,
2080 const char *scope, const void *source)
2082 struct cl_lock *lock;
2087 lock = cl_lock_find(env, io, need);
2090 cl_lock_mutex_get(env, lock);
2091 if (lock->cll_state < CLS_FREEING &&
2092 !(lock->cll_flags & CLF_CANCELLED)) {
2093 cl_lock_hold_mod(env, lock, +1);
2094 lu_ref_add(&lock->cll_holders, scope, source);
2095 lu_ref_add(&lock->cll_reference, scope, source);
2098 cl_lock_mutex_put(env, lock);
2099 cl_lock_put(env, lock);
2105 * Returns a lock matching \a need description with a reference and a hold on
2108 * This is much like cl_lock_find(), except that cl_lock_hold() additionally
2109 * guarantees that lock is not in the CLS_FREEING state on return.
2111 struct cl_lock *cl_lock_hold(const struct lu_env *env, const struct cl_io *io,
2112 const struct cl_lock_descr *need,
2113 const char *scope, const void *source)
2115 struct cl_lock *lock;
2119 lock = cl_lock_hold_mutex(env, io, need, scope, source);
2121 cl_lock_mutex_put(env, lock);
2124 EXPORT_SYMBOL(cl_lock_hold);
2127 * Main high-level entry point of cl_lock interface that finds existing or
2128 * enqueues new lock matching given description.
2130 struct cl_lock *cl_lock_request(const struct lu_env *env, struct cl_io *io,
2131 const struct cl_lock_descr *need,
2132 const char *scope, const void *source)
2134 struct cl_lock *lock;
2136 __u32 enqflags = need->cld_enq_flags;
2140 lock = cl_lock_hold_mutex(env, io, need, scope, source);
2144 rc = cl_enqueue_locked(env, lock, io, enqflags);
2146 if (cl_lock_fits_into(env, lock, need, io)) {
2147 if (!(enqflags & CEF_AGL)) {
2148 cl_lock_mutex_put(env, lock);
2149 cl_lock_lockdep_acquire(env, lock,
2155 cl_unuse_locked(env, lock);
2157 cl_lock_trace(D_DLMTRACE, env,
2158 rc <= 0 ? "enqueue failed" : "agl succeed", lock);
2159 cl_lock_hold_release(env, lock, scope, source);
2160 cl_lock_mutex_put(env, lock);
2161 lu_ref_del(&lock->cll_reference, scope, source);
2162 cl_lock_put(env, lock);
2164 LASSERT(enqflags & CEF_AGL);
2166 } else if (rc != 0) {
2172 EXPORT_SYMBOL(cl_lock_request);
2175 * Adds a hold to a known lock.
2177 void cl_lock_hold_add(const struct lu_env *env, struct cl_lock *lock,
2178 const char *scope, const void *source)
2180 LINVRNT(cl_lock_is_mutexed(lock));
2181 LINVRNT(cl_lock_invariant(env, lock));
2182 LASSERT(lock->cll_state != CLS_FREEING);
2185 cl_lock_hold_mod(env, lock, +1);
2187 lu_ref_add(&lock->cll_holders, scope, source);
2188 lu_ref_add(&lock->cll_reference, scope, source);
2191 EXPORT_SYMBOL(cl_lock_hold_add);
2194 * Releases a hold and a reference on a lock, on which caller acquired a
2197 void cl_lock_unhold(const struct lu_env *env, struct cl_lock *lock,
2198 const char *scope, const void *source)
2200 LINVRNT(cl_lock_invariant(env, lock));
2202 cl_lock_hold_release(env, lock, scope, source);
2203 lu_ref_del(&lock->cll_reference, scope, source);
2204 cl_lock_put(env, lock);
2207 EXPORT_SYMBOL(cl_lock_unhold);
2210 * Releases a hold and a reference on a lock, obtained by cl_lock_hold().
2212 void cl_lock_release(const struct lu_env *env, struct cl_lock *lock,
2213 const char *scope, const void *source)
2215 LINVRNT(cl_lock_invariant(env, lock));
2217 cl_lock_trace(D_DLMTRACE, env, "release lock", lock);
2218 cl_lock_mutex_get(env, lock);
2219 cl_lock_hold_release(env, lock, scope, source);
2220 cl_lock_mutex_put(env, lock);
2221 lu_ref_del(&lock->cll_reference, scope, source);
2222 cl_lock_put(env, lock);
2225 EXPORT_SYMBOL(cl_lock_release);
2227 void cl_lock_user_add(const struct lu_env *env, struct cl_lock *lock)
2229 LINVRNT(cl_lock_is_mutexed(lock));
2230 LINVRNT(cl_lock_invariant(env, lock));
2233 cl_lock_used_mod(env, lock, +1);
2236 EXPORT_SYMBOL(cl_lock_user_add);
2238 void cl_lock_user_del(const struct lu_env *env, struct cl_lock *lock)
2240 LINVRNT(cl_lock_is_mutexed(lock));
2241 LINVRNT(cl_lock_invariant(env, lock));
2242 LASSERT(lock->cll_users > 0);
2245 cl_lock_used_mod(env, lock, -1);
2246 if (lock->cll_users == 0)
2247 wake_up_all(&lock->cll_wq);
2250 EXPORT_SYMBOL(cl_lock_user_del);
2252 const char *cl_lock_mode_name(const enum cl_lock_mode mode)
2254 static const char *names[] = {
2255 [CLM_PHANTOM] = "P",
2260 if (0 <= mode && mode < ARRAY_SIZE(names))
2265 EXPORT_SYMBOL(cl_lock_mode_name);
2268 * Prints human readable representation of a lock description.
2270 void cl_lock_descr_print(const struct lu_env *env, void *cookie,
2271 lu_printer_t printer,
2272 const struct cl_lock_descr *descr)
2274 const struct lu_fid *fid;
2276 fid = lu_object_fid(&descr->cld_obj->co_lu);
2277 (*printer)(env, cookie, DDESCR"@"DFID, PDESCR(descr), PFID(fid));
2279 EXPORT_SYMBOL(cl_lock_descr_print);
2282 * Prints human readable representation of \a lock to the \a f.
2284 void cl_lock_print(const struct lu_env *env, void *cookie,
2285 lu_printer_t printer, const struct cl_lock *lock)
2287 const struct cl_lock_slice *slice;
2288 (*printer)(env, cookie, "lock@%p[%d %d %d %d %d %08lx] ",
2289 lock, cfs_atomic_read(&lock->cll_ref),
2290 lock->cll_state, lock->cll_error, lock->cll_holds,
2291 lock->cll_users, lock->cll_flags);
2292 cl_lock_descr_print(env, cookie, printer, &lock->cll_descr);
2293 (*printer)(env, cookie, " {\n");
2295 cfs_list_for_each_entry(slice, &lock->cll_layers, cls_linkage) {
2296 (*printer)(env, cookie, " %s@%p: ",
2297 slice->cls_obj->co_lu.lo_dev->ld_type->ldt_name,
2299 if (slice->cls_ops->clo_print != NULL)
2300 slice->cls_ops->clo_print(env, cookie, printer, slice);
2301 (*printer)(env, cookie, "\n");
2303 (*printer)(env, cookie, "} lock@%p\n", lock);
2305 EXPORT_SYMBOL(cl_lock_print);
2307 int cl_lock_init(void)
2309 return lu_kmem_init(cl_lock_caches);
2312 void cl_lock_fini(void)
2314 lu_kmem_fini(cl_lock_caches);