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, 2012, Whamcloud, Inc.
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 /* lu_time_global_{init,fini}() */
50 #include <cl_object.h>
51 #include "cl_internal.h"
53 /** Lock class of cl_lock::cll_guard */
54 static cfs_lock_class_key_t cl_lock_guard_class;
55 static cfs_mem_cache_t *cl_lock_kmem;
57 static struct lu_kmem_descr cl_lock_caches[] = {
59 .ckd_cache = &cl_lock_kmem,
60 .ckd_name = "cl_lock_kmem",
61 .ckd_size = sizeof (struct cl_lock)
69 * Basic lock invariant that is maintained at all times. Caller either has a
70 * reference to \a lock, or somehow assures that \a lock cannot be freed.
72 * \see cl_lock_invariant()
74 static int cl_lock_invariant_trusted(const struct lu_env *env,
75 const struct cl_lock *lock)
77 return ergo(lock->cll_state == CLS_FREEING, lock->cll_holds == 0) &&
78 cfs_atomic_read(&lock->cll_ref) >= lock->cll_holds &&
79 lock->cll_holds >= lock->cll_users &&
80 lock->cll_holds >= 0 &&
81 lock->cll_users >= 0 &&
86 * Stronger lock invariant, checking that caller has a reference on a lock.
88 * \see cl_lock_invariant_trusted()
90 static int cl_lock_invariant(const struct lu_env *env,
91 const struct cl_lock *lock)
95 result = cfs_atomic_read(&lock->cll_ref) > 0 &&
96 cl_lock_invariant_trusted(env, lock);
97 if (!result && env != NULL)
98 CL_LOCK_DEBUG(D_ERROR, env, lock, "invariant broken");
103 * Returns lock "nesting": 0 for a top-lock and 1 for a sub-lock.
105 static enum clt_nesting_level cl_lock_nesting(const struct cl_lock *lock)
107 return cl_object_header(lock->cll_descr.cld_obj)->coh_nesting;
111 * Returns a set of counters for this lock, depending on a lock nesting.
113 static struct cl_thread_counters *cl_lock_counters(const struct lu_env *env,
114 const struct cl_lock *lock)
116 struct cl_thread_info *info;
117 enum clt_nesting_level nesting;
119 info = cl_env_info(env);
120 nesting = cl_lock_nesting(lock);
121 LASSERT(nesting < ARRAY_SIZE(info->clt_counters));
122 return &info->clt_counters[nesting];
125 static void cl_lock_trace0(int level, const struct lu_env *env,
126 const char *prefix, const struct cl_lock *lock,
127 const char *func, const int line)
129 struct cl_object_header *h = cl_object_header(lock->cll_descr.cld_obj);
130 CDEBUG(level, "%s: %p@(%d %p %d %d %d %d %d %lx)"
131 "(%p/%d/%d) at %s():%d\n",
132 prefix, lock, cfs_atomic_read(&lock->cll_ref),
133 lock->cll_guarder, lock->cll_depth,
134 lock->cll_state, lock->cll_error, lock->cll_holds,
135 lock->cll_users, lock->cll_flags,
136 env, h->coh_nesting, cl_lock_nr_mutexed(env),
139 #define cl_lock_trace(level, env, prefix, lock) \
140 cl_lock_trace0(level, env, prefix, lock, __FUNCTION__, __LINE__)
142 #define RETIP ((unsigned long)__builtin_return_address(0))
144 #ifdef CONFIG_LOCKDEP
145 static cfs_lock_class_key_t cl_lock_key;
147 static void cl_lock_lockdep_init(struct cl_lock *lock)
149 lockdep_set_class_and_name(lock, &cl_lock_key, "EXT");
152 static void cl_lock_lockdep_acquire(const struct lu_env *env,
153 struct cl_lock *lock, __u32 enqflags)
155 cl_lock_counters(env, lock)->ctc_nr_locks_acquired++;
156 #ifdef HAVE_LOCK_MAP_ACQUIRE
157 lock_map_acquire(&lock->dep_map);
158 #else /* HAVE_LOCK_MAP_ACQUIRE */
159 lock_acquire(&lock->dep_map, !!(enqflags & CEF_ASYNC),
160 /* try: */ 0, lock->cll_descr.cld_mode <= CLM_READ,
161 /* check: */ 2, RETIP);
162 #endif /* HAVE_LOCK_MAP_ACQUIRE */
165 static void cl_lock_lockdep_release(const struct lu_env *env,
166 struct cl_lock *lock)
168 cl_lock_counters(env, lock)->ctc_nr_locks_acquired--;
169 lock_release(&lock->dep_map, 0, RETIP);
172 #else /* !CONFIG_LOCKDEP */
174 static void cl_lock_lockdep_init(struct cl_lock *lock)
176 static void cl_lock_lockdep_acquire(const struct lu_env *env,
177 struct cl_lock *lock, __u32 enqflags)
179 static void cl_lock_lockdep_release(const struct lu_env *env,
180 struct cl_lock *lock)
183 #endif /* !CONFIG_LOCKDEP */
186 * Adds lock slice to the compound lock.
188 * This is called by cl_object_operations::coo_lock_init() methods to add a
189 * per-layer state to the lock. New state is added at the end of
190 * cl_lock::cll_layers list, that is, it is at the bottom of the stack.
192 * \see cl_req_slice_add(), cl_page_slice_add(), cl_io_slice_add()
194 void cl_lock_slice_add(struct cl_lock *lock, struct cl_lock_slice *slice,
195 struct cl_object *obj,
196 const struct cl_lock_operations *ops)
199 slice->cls_lock = lock;
200 cfs_list_add_tail(&slice->cls_linkage, &lock->cll_layers);
201 slice->cls_obj = obj;
202 slice->cls_ops = ops;
205 EXPORT_SYMBOL(cl_lock_slice_add);
208 * Returns true iff a lock with the mode \a has provides at least the same
209 * guarantees as a lock with the mode \a need.
211 int cl_lock_mode_match(enum cl_lock_mode has, enum cl_lock_mode need)
213 LINVRNT(need == CLM_READ || need == CLM_WRITE ||
214 need == CLM_PHANTOM || need == CLM_GROUP);
215 LINVRNT(has == CLM_READ || has == CLM_WRITE ||
216 has == CLM_PHANTOM || has == CLM_GROUP);
217 CLASSERT(CLM_PHANTOM < CLM_READ);
218 CLASSERT(CLM_READ < CLM_WRITE);
219 CLASSERT(CLM_WRITE < CLM_GROUP);
221 if (has != CLM_GROUP)
226 EXPORT_SYMBOL(cl_lock_mode_match);
229 * Returns true iff extent portions of lock descriptions match.
231 int cl_lock_ext_match(const struct cl_lock_descr *has,
232 const struct cl_lock_descr *need)
235 has->cld_start <= need->cld_start &&
236 has->cld_end >= need->cld_end &&
237 cl_lock_mode_match(has->cld_mode, need->cld_mode) &&
238 (has->cld_mode != CLM_GROUP || has->cld_gid == need->cld_gid);
240 EXPORT_SYMBOL(cl_lock_ext_match);
243 * Returns true iff a lock with the description \a has provides at least the
244 * same guarantees as a lock with the description \a need.
246 int cl_lock_descr_match(const struct cl_lock_descr *has,
247 const struct cl_lock_descr *need)
250 cl_object_same(has->cld_obj, need->cld_obj) &&
251 cl_lock_ext_match(has, need);
253 EXPORT_SYMBOL(cl_lock_descr_match);
255 static void cl_lock_free(const struct lu_env *env, struct cl_lock *lock)
257 struct cl_object *obj = lock->cll_descr.cld_obj;
259 LINVRNT(!cl_lock_is_mutexed(lock));
262 cl_lock_trace(D_DLMTRACE, env, "free lock", lock);
264 while (!cfs_list_empty(&lock->cll_layers)) {
265 struct cl_lock_slice *slice;
267 slice = cfs_list_entry(lock->cll_layers.next,
268 struct cl_lock_slice, cls_linkage);
269 cfs_list_del_init(lock->cll_layers.next);
270 slice->cls_ops->clo_fini(env, slice);
272 cfs_atomic_dec(&cl_object_site(obj)->cs_locks.cs_total);
273 cfs_atomic_dec(&cl_object_site(obj)->cs_locks_state[lock->cll_state]);
274 lu_object_ref_del_at(&obj->co_lu, lock->cll_obj_ref, "cl_lock", lock);
275 cl_object_put(env, obj);
276 lu_ref_fini(&lock->cll_reference);
277 lu_ref_fini(&lock->cll_holders);
278 cfs_mutex_destroy(&lock->cll_guard);
279 OBD_SLAB_FREE_PTR(lock, cl_lock_kmem);
284 * Releases a reference on a lock.
286 * When last reference is released, lock is returned to the cache, unless it
287 * is in cl_lock_state::CLS_FREEING state, in which case it is destroyed
290 * \see cl_object_put(), cl_page_put()
292 void cl_lock_put(const struct lu_env *env, struct cl_lock *lock)
294 struct cl_object *obj;
295 struct cl_site *site;
297 LINVRNT(cl_lock_invariant(env, lock));
299 obj = lock->cll_descr.cld_obj;
300 LINVRNT(obj != NULL);
301 site = cl_object_site(obj);
303 CDEBUG(D_TRACE, "releasing reference: %d %p %lu\n",
304 cfs_atomic_read(&lock->cll_ref), lock, RETIP);
306 if (cfs_atomic_dec_and_test(&lock->cll_ref)) {
307 if (lock->cll_state == CLS_FREEING) {
308 LASSERT(cfs_list_empty(&lock->cll_linkage));
309 cl_lock_free(env, lock);
311 cfs_atomic_dec(&site->cs_locks.cs_busy);
315 EXPORT_SYMBOL(cl_lock_put);
318 * Acquires an additional reference to a lock.
320 * This can be called only by caller already possessing a reference to \a
323 * \see cl_object_get(), cl_page_get()
325 void cl_lock_get(struct cl_lock *lock)
327 LINVRNT(cl_lock_invariant(NULL, lock));
328 CDEBUG(D_TRACE, "acquiring reference: %d %p %lu\n",
329 cfs_atomic_read(&lock->cll_ref), lock, RETIP);
330 cfs_atomic_inc(&lock->cll_ref);
332 EXPORT_SYMBOL(cl_lock_get);
335 * Acquires a reference to a lock.
337 * This is much like cl_lock_get(), except that this function can be used to
338 * acquire initial reference to the cached lock. Caller has to deal with all
339 * possible races. Use with care!
341 * \see cl_page_get_trust()
343 void cl_lock_get_trust(struct cl_lock *lock)
345 struct cl_site *site = cl_object_site(lock->cll_descr.cld_obj);
347 CDEBUG(D_TRACE, "acquiring trusted reference: %d %p %lu\n",
348 cfs_atomic_read(&lock->cll_ref), lock, RETIP);
349 if (cfs_atomic_inc_return(&lock->cll_ref) == 1)
350 cfs_atomic_inc(&site->cs_locks.cs_busy);
352 EXPORT_SYMBOL(cl_lock_get_trust);
355 * Helper function destroying the lock that wasn't completely initialized.
357 * Other threads can acquire references to the top-lock through its
358 * sub-locks. Hence, it cannot be cl_lock_free()-ed immediately.
360 static void cl_lock_finish(const struct lu_env *env, struct cl_lock *lock)
362 cl_lock_mutex_get(env, lock);
363 cl_lock_cancel(env, lock);
364 cl_lock_delete(env, lock);
365 cl_lock_mutex_put(env, lock);
366 cl_lock_put(env, lock);
369 static struct cl_lock *cl_lock_alloc(const struct lu_env *env,
370 struct cl_object *obj,
371 const struct cl_io *io,
372 const struct cl_lock_descr *descr)
374 struct cl_lock *lock;
375 struct lu_object_header *head;
376 struct cl_site *site = cl_object_site(obj);
379 OBD_SLAB_ALLOC_PTR_GFP(lock, cl_lock_kmem, CFS_ALLOC_IO);
381 cfs_atomic_set(&lock->cll_ref, 1);
382 lock->cll_descr = *descr;
383 lock->cll_state = CLS_NEW;
385 lock->cll_obj_ref = lu_object_ref_add(&obj->co_lu,
387 CFS_INIT_LIST_HEAD(&lock->cll_layers);
388 CFS_INIT_LIST_HEAD(&lock->cll_linkage);
389 CFS_INIT_LIST_HEAD(&lock->cll_inclosure);
390 lu_ref_init(&lock->cll_reference);
391 lu_ref_init(&lock->cll_holders);
392 cfs_mutex_init(&lock->cll_guard);
393 cfs_lockdep_set_class(&lock->cll_guard, &cl_lock_guard_class);
394 cfs_waitq_init(&lock->cll_wq);
395 head = obj->co_lu.lo_header;
396 cfs_atomic_inc(&site->cs_locks_state[CLS_NEW]);
397 cfs_atomic_inc(&site->cs_locks.cs_total);
398 cfs_atomic_inc(&site->cs_locks.cs_created);
399 cl_lock_lockdep_init(lock);
400 cfs_list_for_each_entry(obj, &head->loh_layers,
404 err = obj->co_ops->coo_lock_init(env, obj, lock, io);
406 cl_lock_finish(env, lock);
412 lock = ERR_PTR(-ENOMEM);
417 * Transfer the lock into INTRANSIT state and return the original state.
419 * \pre state: CLS_CACHED, CLS_HELD or CLS_ENQUEUED
420 * \post state: CLS_INTRANSIT
423 enum cl_lock_state cl_lock_intransit(const struct lu_env *env,
424 struct cl_lock *lock)
426 enum cl_lock_state state = lock->cll_state;
428 LASSERT(cl_lock_is_mutexed(lock));
429 LASSERT(state != CLS_INTRANSIT);
430 LASSERTF(state >= CLS_ENQUEUED && state <= CLS_CACHED,
431 "Malformed lock state %d.\n", state);
433 cl_lock_state_set(env, lock, CLS_INTRANSIT);
434 lock->cll_intransit_owner = cfs_current();
435 cl_lock_hold_add(env, lock, "intransit", cfs_current());
438 EXPORT_SYMBOL(cl_lock_intransit);
441 * Exit the intransit state and restore the lock state to the original state
443 void cl_lock_extransit(const struct lu_env *env, struct cl_lock *lock,
444 enum cl_lock_state state)
446 LASSERT(cl_lock_is_mutexed(lock));
447 LASSERT(lock->cll_state == CLS_INTRANSIT);
448 LASSERT(state != CLS_INTRANSIT);
449 LASSERT(lock->cll_intransit_owner == cfs_current());
451 lock->cll_intransit_owner = NULL;
452 cl_lock_state_set(env, lock, state);
453 cl_lock_unhold(env, lock, "intransit", cfs_current());
455 EXPORT_SYMBOL(cl_lock_extransit);
458 * Checking whether the lock is intransit state
460 int cl_lock_is_intransit(struct cl_lock *lock)
462 LASSERT(cl_lock_is_mutexed(lock));
463 return lock->cll_state == CLS_INTRANSIT &&
464 lock->cll_intransit_owner != cfs_current();
466 EXPORT_SYMBOL(cl_lock_is_intransit);
468 * Returns true iff lock is "suitable" for given io. E.g., locks acquired by
469 * truncate and O_APPEND cannot be reused for read/non-append-write, as they
470 * cover multiple stripes and can trigger cascading timeouts.
472 static int cl_lock_fits_into(const struct lu_env *env,
473 const struct cl_lock *lock,
474 const struct cl_lock_descr *need,
475 const struct cl_io *io)
477 const struct cl_lock_slice *slice;
479 LINVRNT(cl_lock_invariant_trusted(env, lock));
481 cfs_list_for_each_entry(slice, &lock->cll_layers, cls_linkage) {
482 if (slice->cls_ops->clo_fits_into != NULL &&
483 !slice->cls_ops->clo_fits_into(env, slice, need, io))
489 static struct cl_lock *cl_lock_lookup(const struct lu_env *env,
490 struct cl_object *obj,
491 const struct cl_io *io,
492 const struct cl_lock_descr *need)
494 struct cl_lock *lock;
495 struct cl_object_header *head;
496 struct cl_site *site;
500 head = cl_object_header(obj);
501 site = cl_object_site(obj);
502 LINVRNT_SPIN_LOCKED(&head->coh_lock_guard);
503 cfs_atomic_inc(&site->cs_locks.cs_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 cfs_atomic_inc(&cl_object_site(obj)->cs_locks.cs_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;
541 struct cl_site *site;
546 head = cl_object_header(obj);
547 site = cl_object_site(obj);
549 cfs_spin_lock(&head->coh_lock_guard);
550 lock = cl_lock_lookup(env, obj, io, need);
551 cfs_spin_unlock(&head->coh_lock_guard);
554 lock = cl_lock_alloc(env, obj, io, need);
556 struct cl_lock *ghost;
558 cfs_spin_lock(&head->coh_lock_guard);
559 ghost = cl_lock_lookup(env, obj, io, need);
561 cfs_list_add_tail(&lock->cll_linkage,
563 cfs_spin_unlock(&head->coh_lock_guard);
564 cfs_atomic_inc(&site->cs_locks.cs_busy);
566 cfs_spin_unlock(&head->coh_lock_guard);
568 * Other threads can acquire references to the
569 * top-lock through its sub-locks. Hence, it
570 * cannot be cl_lock_free()-ed immediately.
572 cl_lock_finish(env, lock);
581 * Returns existing lock matching given description. This is similar to
582 * cl_lock_find() except that no new lock is created, and returned lock is
583 * guaranteed to be in enum cl_lock_state::CLS_HELD state.
585 struct cl_lock *cl_lock_peek(const struct lu_env *env, const struct cl_io *io,
586 const struct cl_lock_descr *need,
587 const char *scope, const void *source)
589 struct cl_object_header *head;
590 struct cl_object *obj;
591 struct cl_lock *lock;
594 head = cl_object_header(obj);
596 cfs_spin_lock(&head->coh_lock_guard);
597 lock = cl_lock_lookup(env, obj, io, need);
598 cfs_spin_unlock(&head->coh_lock_guard);
603 cl_lock_mutex_get(env, lock);
604 if (lock->cll_state == CLS_INTRANSIT)
605 cl_lock_state_wait(env, lock); /* Don't care return value. */
606 cl_lock_hold_add(env, lock, scope, source);
607 cl_lock_user_add(env, lock);
608 if (lock->cll_state == CLS_CACHED)
609 cl_use_try(env, lock, 1);
610 if (lock->cll_state == CLS_HELD) {
611 cl_lock_mutex_put(env, lock);
612 cl_lock_lockdep_acquire(env, lock, 0);
613 cl_lock_put(env, lock);
615 cl_unuse_try(env, lock);
616 cl_lock_unhold(env, lock, scope, source);
617 cl_lock_mutex_put(env, lock);
618 cl_lock_put(env, lock);
624 EXPORT_SYMBOL(cl_lock_peek);
627 * Returns a slice within a lock, corresponding to the given layer in the
632 const struct cl_lock_slice *cl_lock_at(const struct cl_lock *lock,
633 const struct lu_device_type *dtype)
635 const struct cl_lock_slice *slice;
637 LINVRNT(cl_lock_invariant_trusted(NULL, lock));
640 cfs_list_for_each_entry(slice, &lock->cll_layers, cls_linkage) {
641 if (slice->cls_obj->co_lu.lo_dev->ld_type == dtype)
646 EXPORT_SYMBOL(cl_lock_at);
648 static void cl_lock_mutex_tail(const struct lu_env *env, struct cl_lock *lock)
650 struct cl_thread_counters *counters;
652 counters = cl_lock_counters(env, lock);
654 counters->ctc_nr_locks_locked++;
655 lu_ref_add(&counters->ctc_locks_locked, "cll_guard", lock);
656 cl_lock_trace(D_TRACE, env, "got mutex", lock);
660 * Locks cl_lock object.
662 * This is used to manipulate cl_lock fields, and to serialize state
663 * transitions in the lock state machine.
665 * \post cl_lock_is_mutexed(lock)
667 * \see cl_lock_mutex_put()
669 void cl_lock_mutex_get(const struct lu_env *env, struct cl_lock *lock)
671 LINVRNT(cl_lock_invariant(env, lock));
673 if (lock->cll_guarder == cfs_current()) {
674 LINVRNT(cl_lock_is_mutexed(lock));
675 LINVRNT(lock->cll_depth > 0);
677 struct cl_object_header *hdr;
678 struct cl_thread_info *info;
681 LINVRNT(lock->cll_guarder != cfs_current());
682 hdr = cl_object_header(lock->cll_descr.cld_obj);
684 * Check that mutices are taken in the bottom-to-top order.
686 info = cl_env_info(env);
687 for (i = 0; i < hdr->coh_nesting; ++i)
688 LASSERT(info->clt_counters[i].ctc_nr_locks_locked == 0);
689 cfs_mutex_lock_nested(&lock->cll_guard, hdr->coh_nesting);
690 lock->cll_guarder = cfs_current();
691 LINVRNT(lock->cll_depth == 0);
693 cl_lock_mutex_tail(env, lock);
695 EXPORT_SYMBOL(cl_lock_mutex_get);
698 * Try-locks cl_lock object.
700 * \retval 0 \a lock was successfully locked
702 * \retval -EBUSY \a lock cannot be locked right now
704 * \post ergo(result == 0, cl_lock_is_mutexed(lock))
706 * \see cl_lock_mutex_get()
708 int cl_lock_mutex_try(const struct lu_env *env, struct cl_lock *lock)
712 LINVRNT(cl_lock_invariant_trusted(env, lock));
716 if (lock->cll_guarder == cfs_current()) {
717 LINVRNT(lock->cll_depth > 0);
718 cl_lock_mutex_tail(env, lock);
719 } else if (cfs_mutex_trylock(&lock->cll_guard)) {
720 LINVRNT(lock->cll_depth == 0);
721 lock->cll_guarder = cfs_current();
722 cl_lock_mutex_tail(env, lock);
727 EXPORT_SYMBOL(cl_lock_mutex_try);
730 {* Unlocks cl_lock object.
732 * \pre cl_lock_is_mutexed(lock)
734 * \see cl_lock_mutex_get()
736 void cl_lock_mutex_put(const struct lu_env *env, struct cl_lock *lock)
738 struct cl_thread_counters *counters;
740 LINVRNT(cl_lock_invariant(env, lock));
741 LINVRNT(cl_lock_is_mutexed(lock));
742 LINVRNT(lock->cll_guarder == cfs_current());
743 LINVRNT(lock->cll_depth > 0);
745 counters = cl_lock_counters(env, lock);
746 LINVRNT(counters->ctc_nr_locks_locked > 0);
748 cl_lock_trace(D_TRACE, env, "put mutex", lock);
749 lu_ref_del(&counters->ctc_locks_locked, "cll_guard", lock);
750 counters->ctc_nr_locks_locked--;
751 if (--lock->cll_depth == 0) {
752 lock->cll_guarder = NULL;
753 cfs_mutex_unlock(&lock->cll_guard);
756 EXPORT_SYMBOL(cl_lock_mutex_put);
759 * Returns true iff lock's mutex is owned by the current thread.
761 int cl_lock_is_mutexed(struct cl_lock *lock)
763 return lock->cll_guarder == cfs_current();
765 EXPORT_SYMBOL(cl_lock_is_mutexed);
768 * Returns number of cl_lock mutices held by the current thread (environment).
770 int cl_lock_nr_mutexed(const struct lu_env *env)
772 struct cl_thread_info *info;
777 * NOTE: if summation across all nesting levels (currently 2) proves
778 * too expensive, a summary counter can be added to
779 * struct cl_thread_info.
781 info = cl_env_info(env);
782 for (i = 0, locked = 0; i < ARRAY_SIZE(info->clt_counters); ++i)
783 locked += info->clt_counters[i].ctc_nr_locks_locked;
786 EXPORT_SYMBOL(cl_lock_nr_mutexed);
788 static void cl_lock_cancel0(const struct lu_env *env, struct cl_lock *lock)
790 LINVRNT(cl_lock_is_mutexed(lock));
791 LINVRNT(cl_lock_invariant(env, lock));
793 if (!(lock->cll_flags & CLF_CANCELLED)) {
794 const struct cl_lock_slice *slice;
796 lock->cll_flags |= CLF_CANCELLED;
797 cfs_list_for_each_entry_reverse(slice, &lock->cll_layers,
799 if (slice->cls_ops->clo_cancel != NULL)
800 slice->cls_ops->clo_cancel(env, slice);
806 static void cl_lock_delete0(const struct lu_env *env, struct cl_lock *lock)
808 struct cl_object_header *head;
809 const struct cl_lock_slice *slice;
811 LINVRNT(cl_lock_is_mutexed(lock));
812 LINVRNT(cl_lock_invariant(env, lock));
815 if (lock->cll_state < CLS_FREEING) {
816 LASSERT(lock->cll_state != CLS_INTRANSIT);
817 cl_lock_state_set(env, lock, CLS_FREEING);
819 head = cl_object_header(lock->cll_descr.cld_obj);
821 cfs_spin_lock(&head->coh_lock_guard);
822 cfs_list_del_init(&lock->cll_linkage);
824 cfs_spin_unlock(&head->coh_lock_guard);
826 * From now on, no new references to this lock can be acquired
827 * by cl_lock_lookup().
829 cfs_list_for_each_entry_reverse(slice, &lock->cll_layers,
831 if (slice->cls_ops->clo_delete != NULL)
832 slice->cls_ops->clo_delete(env, slice);
835 * From now on, no new references to this lock can be acquired
836 * by layer-specific means (like a pointer from struct
837 * ldlm_lock in osc, or a pointer from top-lock to sub-lock in
840 * Lock will be finally freed in cl_lock_put() when last of
841 * existing references goes away.
848 * Mod(ifie)s cl_lock::cll_holds counter for a given lock. Also, for a
849 * top-lock (nesting == 0) accounts for this modification in the per-thread
850 * debugging counters. Sub-lock holds can be released by a thread different
851 * from one that acquired it.
853 static void cl_lock_hold_mod(const struct lu_env *env, struct cl_lock *lock,
856 struct cl_thread_counters *counters;
857 enum clt_nesting_level nesting;
859 lock->cll_holds += delta;
860 nesting = cl_lock_nesting(lock);
861 if (nesting == CNL_TOP) {
862 counters = &cl_env_info(env)->clt_counters[CNL_TOP];
863 counters->ctc_nr_held += delta;
864 LASSERT(counters->ctc_nr_held >= 0);
869 * Mod(ifie)s cl_lock::cll_users counter for a given lock. See
870 * cl_lock_hold_mod() for the explanation of the debugging code.
872 static void cl_lock_used_mod(const struct lu_env *env, struct cl_lock *lock,
875 struct cl_thread_counters *counters;
876 enum clt_nesting_level nesting;
878 lock->cll_users += delta;
879 nesting = cl_lock_nesting(lock);
880 if (nesting == CNL_TOP) {
881 counters = &cl_env_info(env)->clt_counters[CNL_TOP];
882 counters->ctc_nr_used += delta;
883 LASSERT(counters->ctc_nr_used >= 0);
887 void cl_lock_hold_release(const struct lu_env *env, struct cl_lock *lock,
888 const char *scope, const void *source)
890 LINVRNT(cl_lock_is_mutexed(lock));
891 LINVRNT(cl_lock_invariant(env, lock));
892 LASSERT(lock->cll_holds > 0);
895 cl_lock_trace(D_DLMTRACE, env, "hold release lock", lock);
896 lu_ref_del(&lock->cll_holders, scope, source);
897 cl_lock_hold_mod(env, lock, -1);
898 if (lock->cll_holds == 0) {
899 CL_LOCK_ASSERT(lock->cll_state != CLS_HELD, env, lock);
900 if (lock->cll_descr.cld_mode == CLM_PHANTOM ||
901 lock->cll_descr.cld_mode == CLM_GROUP ||
902 lock->cll_state != CLS_CACHED)
904 * If lock is still phantom or grouplock when user is
905 * done with it---destroy the lock.
907 lock->cll_flags |= CLF_CANCELPEND|CLF_DOOMED;
908 if (lock->cll_flags & CLF_CANCELPEND) {
909 lock->cll_flags &= ~CLF_CANCELPEND;
910 cl_lock_cancel0(env, lock);
912 if (lock->cll_flags & CLF_DOOMED) {
913 /* no longer doomed: it's dead... Jim. */
914 lock->cll_flags &= ~CLF_DOOMED;
915 cl_lock_delete0(env, lock);
920 EXPORT_SYMBOL(cl_lock_hold_release);
923 * Waits until lock state is changed.
925 * This function is called with cl_lock mutex locked, atomically releases
926 * mutex and goes to sleep, waiting for a lock state change (signaled by
927 * cl_lock_signal()), and re-acquires the mutex before return.
929 * This function is used to wait until lock state machine makes some progress
930 * and to emulate synchronous operations on top of asynchronous lock
933 * \retval -EINTR wait was interrupted
935 * \retval 0 wait wasn't interrupted
937 * \pre cl_lock_is_mutexed(lock)
939 * \see cl_lock_signal()
941 int cl_lock_state_wait(const struct lu_env *env, struct cl_lock *lock)
943 cfs_waitlink_t waiter;
944 cfs_sigset_t blocked;
948 LINVRNT(cl_lock_is_mutexed(lock));
949 LINVRNT(cl_lock_invariant(env, lock));
950 LASSERT(lock->cll_depth == 1);
951 LASSERT(lock->cll_state != CLS_FREEING); /* too late to wait */
953 cl_lock_trace(D_DLMTRACE, env, "state wait lock", lock);
954 result = lock->cll_error;
956 /* To avoid being interrupted by the 'non-fatal' signals
957 * (SIGCHLD, for instance), we'd block them temporarily.
959 blocked = cfs_block_sigsinv(LUSTRE_FATAL_SIGS);
961 cfs_waitlink_init(&waiter);
962 cfs_waitq_add(&lock->cll_wq, &waiter);
963 cfs_set_current_state(CFS_TASK_INTERRUPTIBLE);
964 cl_lock_mutex_put(env, lock);
966 LASSERT(cl_lock_nr_mutexed(env) == 0);
969 if (likely(!OBD_FAIL_CHECK(OBD_FAIL_LOCK_STATE_WAIT_INTR))) {
970 cfs_waitq_wait(&waiter, CFS_TASK_INTERRUPTIBLE);
971 if (!cfs_signal_pending())
975 cl_lock_mutex_get(env, lock);
976 cfs_set_current_state(CFS_TASK_RUNNING);
977 cfs_waitq_del(&lock->cll_wq, &waiter);
979 /* Restore old blocked signals */
980 cfs_restore_sigs(blocked);
984 EXPORT_SYMBOL(cl_lock_state_wait);
986 static void cl_lock_state_signal(const struct lu_env *env, struct cl_lock *lock,
987 enum cl_lock_state state)
989 const struct cl_lock_slice *slice;
992 LINVRNT(cl_lock_is_mutexed(lock));
993 LINVRNT(cl_lock_invariant(env, lock));
995 cfs_list_for_each_entry(slice, &lock->cll_layers, cls_linkage)
996 if (slice->cls_ops->clo_state != NULL)
997 slice->cls_ops->clo_state(env, slice, state);
998 cfs_waitq_broadcast(&lock->cll_wq);
1003 * Notifies waiters that lock state changed.
1005 * Wakes up all waiters sleeping in cl_lock_state_wait(), also notifies all
1006 * layers about state change by calling cl_lock_operations::clo_state()
1009 void cl_lock_signal(const struct lu_env *env, struct cl_lock *lock)
1012 cl_lock_trace(D_DLMTRACE, env, "state signal lock", lock);
1013 cl_lock_state_signal(env, lock, lock->cll_state);
1016 EXPORT_SYMBOL(cl_lock_signal);
1019 * Changes lock state.
1021 * This function is invoked to notify layers that lock state changed, possible
1022 * as a result of an asynchronous event such as call-back reception.
1024 * \post lock->cll_state == state
1026 * \see cl_lock_operations::clo_state()
1028 void cl_lock_state_set(const struct lu_env *env, struct cl_lock *lock,
1029 enum cl_lock_state state)
1031 struct cl_site *site = cl_object_site(lock->cll_descr.cld_obj);
1034 LASSERT(lock->cll_state <= state ||
1035 (lock->cll_state == CLS_CACHED &&
1036 (state == CLS_HELD || /* lock found in cache */
1037 state == CLS_NEW || /* sub-lock canceled */
1038 state == CLS_INTRANSIT)) ||
1039 /* lock is in transit state */
1040 lock->cll_state == CLS_INTRANSIT);
1042 if (lock->cll_state != state) {
1043 cfs_atomic_dec(&site->cs_locks_state[lock->cll_state]);
1044 cfs_atomic_inc(&site->cs_locks_state[state]);
1046 cl_lock_state_signal(env, lock, state);
1047 lock->cll_state = state;
1051 EXPORT_SYMBOL(cl_lock_state_set);
1053 static int cl_unuse_try_internal(const struct lu_env *env, struct cl_lock *lock)
1055 const struct cl_lock_slice *slice;
1061 LINVRNT(cl_lock_is_mutexed(lock));
1062 LINVRNT(cl_lock_invariant(env, lock));
1063 LASSERT(lock->cll_state == CLS_INTRANSIT);
1066 cfs_list_for_each_entry_reverse(slice, &lock->cll_layers,
1068 if (slice->cls_ops->clo_unuse != NULL) {
1069 result = slice->cls_ops->clo_unuse(env, slice);
1074 LASSERT(result != -ENOSYS);
1075 } while (result == CLO_REPEAT);
1081 * Yanks lock from the cache (cl_lock_state::CLS_CACHED state) by calling
1082 * cl_lock_operations::clo_use() top-to-bottom to notify layers.
1083 * @atomic = 1, it must unuse the lock to recovery the lock to keep the
1084 * use process atomic
1086 int cl_use_try(const struct lu_env *env, struct cl_lock *lock, int atomic)
1088 const struct cl_lock_slice *slice;
1090 enum cl_lock_state state;
1093 cl_lock_trace(D_DLMTRACE, env, "use lock", lock);
1095 LASSERT(lock->cll_state == CLS_CACHED);
1096 if (lock->cll_error)
1097 RETURN(lock->cll_error);
1100 state = cl_lock_intransit(env, lock);
1101 cfs_list_for_each_entry(slice, &lock->cll_layers, cls_linkage) {
1102 if (slice->cls_ops->clo_use != NULL) {
1103 result = slice->cls_ops->clo_use(env, slice);
1108 LASSERT(result != -ENOSYS);
1110 LASSERTF(lock->cll_state == CLS_INTRANSIT, "Wrong state %d.\n",
1116 if (result == -ESTALE) {
1118 * ESTALE means sublock being cancelled
1119 * at this time, and set lock state to
1120 * be NEW here and ask the caller to repeat.
1123 result = CLO_REPEAT;
1126 /* @atomic means back-off-on-failure. */
1129 rc = cl_unuse_try_internal(env, lock);
1130 /* Vet the results. */
1131 if (rc < 0 && result > 0)
1136 cl_lock_extransit(env, lock, state);
1139 EXPORT_SYMBOL(cl_use_try);
1142 * Helper for cl_enqueue_try() that calls ->clo_enqueue() across all layers
1145 static int cl_enqueue_kick(const struct lu_env *env,
1146 struct cl_lock *lock,
1147 struct cl_io *io, __u32 flags)
1150 const struct cl_lock_slice *slice;
1154 cfs_list_for_each_entry(slice, &lock->cll_layers, cls_linkage) {
1155 if (slice->cls_ops->clo_enqueue != NULL) {
1156 result = slice->cls_ops->clo_enqueue(env,
1162 LASSERT(result != -ENOSYS);
1167 * Tries to enqueue a lock.
1169 * This function is called repeatedly by cl_enqueue() until either lock is
1170 * enqueued, or error occurs. This function does not block waiting for
1171 * networking communication to complete.
1173 * \post ergo(result == 0, lock->cll_state == CLS_ENQUEUED ||
1174 * lock->cll_state == CLS_HELD)
1176 * \see cl_enqueue() cl_lock_operations::clo_enqueue()
1177 * \see cl_lock_state::CLS_ENQUEUED
1179 int cl_enqueue_try(const struct lu_env *env, struct cl_lock *lock,
1180 struct cl_io *io, __u32 flags)
1185 cl_lock_trace(D_DLMTRACE, env, "enqueue lock", lock);
1187 LINVRNT(cl_lock_is_mutexed(lock));
1189 result = lock->cll_error;
1193 switch (lock->cll_state) {
1195 cl_lock_state_set(env, lock, CLS_QUEUING);
1199 result = cl_enqueue_kick(env, lock, io, flags);
1200 /* For AGL case, the cl_lock::cll_state may
1201 * become CLS_HELD already. */
1202 if (result == 0 && lock->cll_state == CLS_QUEUING)
1203 cl_lock_state_set(env, lock, CLS_ENQUEUED);
1206 LASSERT(cl_lock_is_intransit(lock));
1210 /* yank lock from the cache. */
1211 result = cl_use_try(env, lock, 0);
1220 * impossible, only held locks with increased
1221 * ->cll_holds can be enqueued, and they cannot be
1226 } while (result == CLO_REPEAT);
1229 EXPORT_SYMBOL(cl_enqueue_try);
1232 * Cancel the conflicting lock found during previous enqueue.
1234 * \retval 0 conflicting lock has been canceled.
1235 * \retval -ve error code.
1237 int cl_lock_enqueue_wait(const struct lu_env *env,
1238 struct cl_lock *lock,
1241 struct cl_lock *conflict;
1245 LASSERT(cl_lock_is_mutexed(lock));
1246 LASSERT(lock->cll_state == CLS_QUEUING);
1247 LASSERT(lock->cll_conflict != NULL);
1249 conflict = lock->cll_conflict;
1250 lock->cll_conflict = NULL;
1252 cl_lock_mutex_put(env, lock);
1253 LASSERT(cl_lock_nr_mutexed(env) == 0);
1255 cl_lock_mutex_get(env, conflict);
1256 cl_lock_trace(D_DLMTRACE, env, "enqueue wait", conflict);
1257 cl_lock_cancel(env, conflict);
1258 cl_lock_delete(env, conflict);
1260 while (conflict->cll_state != CLS_FREEING) {
1261 rc = cl_lock_state_wait(env, conflict);
1265 cl_lock_mutex_put(env, conflict);
1266 lu_ref_del(&conflict->cll_reference, "cancel-wait", lock);
1267 cl_lock_put(env, conflict);
1270 cl_lock_mutex_get(env, lock);
1275 EXPORT_SYMBOL(cl_lock_enqueue_wait);
1277 static int cl_enqueue_locked(const struct lu_env *env, struct cl_lock *lock,
1278 struct cl_io *io, __u32 enqflags)
1284 LINVRNT(cl_lock_is_mutexed(lock));
1285 LINVRNT(cl_lock_invariant(env, lock));
1286 LASSERT(lock->cll_holds > 0);
1288 cl_lock_user_add(env, lock);
1290 result = cl_enqueue_try(env, lock, io, enqflags);
1291 if (result == CLO_WAIT) {
1292 if (lock->cll_conflict != NULL)
1293 result = cl_lock_enqueue_wait(env, lock, 1);
1295 result = cl_lock_state_wait(env, lock);
1302 cl_unuse_try(env, lock);
1303 LASSERT(ergo(result == 0 && !(enqflags & CEF_AGL),
1304 lock->cll_state == CLS_ENQUEUED ||
1305 lock->cll_state == CLS_HELD));
1312 * \pre current thread or io owns a hold on lock.
1314 * \post ergo(result == 0, lock->users increased)
1315 * \post ergo(result == 0, lock->cll_state == CLS_ENQUEUED ||
1316 * lock->cll_state == CLS_HELD)
1318 int cl_enqueue(const struct lu_env *env, struct cl_lock *lock,
1319 struct cl_io *io, __u32 enqflags)
1325 cl_lock_lockdep_acquire(env, lock, enqflags);
1326 cl_lock_mutex_get(env, lock);
1327 result = cl_enqueue_locked(env, lock, io, enqflags);
1328 cl_lock_mutex_put(env, lock);
1330 cl_lock_lockdep_release(env, lock);
1331 LASSERT(ergo(result == 0, lock->cll_state == CLS_ENQUEUED ||
1332 lock->cll_state == CLS_HELD));
1335 EXPORT_SYMBOL(cl_enqueue);
1338 * Tries to unlock a lock.
1340 * This function is called to release underlying resource:
1341 * 1. for top lock, the resource is sublocks it held;
1342 * 2. for sublock, the resource is the reference to dlmlock.
1344 * cl_unuse_try is a one-shot operation, so it must NOT return CLO_WAIT.
1346 * \see cl_unuse() cl_lock_operations::clo_unuse()
1347 * \see cl_lock_state::CLS_CACHED
1349 int cl_unuse_try(const struct lu_env *env, struct cl_lock *lock)
1352 enum cl_lock_state state = CLS_NEW;
1355 cl_lock_trace(D_DLMTRACE, env, "unuse lock", lock);
1357 if (lock->cll_users > 1) {
1358 cl_lock_user_del(env, lock);
1362 /* Only if the lock is in CLS_HELD or CLS_ENQUEUED state, it can hold
1363 * underlying resources. */
1364 if (!(lock->cll_state == CLS_HELD || lock->cll_state == CLS_ENQUEUED)) {
1365 cl_lock_user_del(env, lock);
1370 * New lock users (->cll_users) are not protecting unlocking
1371 * from proceeding. From this point, lock eventually reaches
1372 * CLS_CACHED, is reinitialized to CLS_NEW or fails into
1375 state = cl_lock_intransit(env, lock);
1377 result = cl_unuse_try_internal(env, lock);
1378 LASSERT(lock->cll_state == CLS_INTRANSIT);
1379 LASSERT(result != CLO_WAIT);
1380 cl_lock_user_del(env, lock);
1381 if (result == 0 || result == -ESTALE) {
1383 * Return lock back to the cache. This is the only
1384 * place where lock is moved into CLS_CACHED state.
1386 * If one of ->clo_unuse() methods returned -ESTALE, lock
1387 * cannot be placed into cache and has to be
1388 * re-initialized. This happens e.g., when a sub-lock was
1389 * canceled while unlocking was in progress.
1391 if (state == CLS_HELD && result == 0)
1395 cl_lock_extransit(env, lock, state);
1398 * Hide -ESTALE error.
1399 * If the lock is a glimpse lock, and it has multiple
1400 * stripes. Assuming that one of its sublock returned -ENAVAIL,
1401 * and other sublocks are matched write locks. In this case,
1402 * we can't set this lock to error because otherwise some of
1403 * its sublocks may not be canceled. This causes some dirty
1404 * pages won't be written to OSTs. -jay
1408 CERROR("result = %d, this is unlikely!\n", result);
1410 cl_lock_extransit(env, lock, state);
1412 RETURN(result ?: lock->cll_error);
1414 EXPORT_SYMBOL(cl_unuse_try);
1416 static void cl_unuse_locked(const struct lu_env *env, struct cl_lock *lock)
1421 result = cl_unuse_try(env, lock);
1423 CL_LOCK_DEBUG(D_ERROR, env, lock, "unuse return %d\n", result);
1431 void cl_unuse(const struct lu_env *env, struct cl_lock *lock)
1434 cl_lock_mutex_get(env, lock);
1435 cl_unuse_locked(env, lock);
1436 cl_lock_mutex_put(env, lock);
1437 cl_lock_lockdep_release(env, lock);
1440 EXPORT_SYMBOL(cl_unuse);
1443 * Tries to wait for a lock.
1445 * This function is called repeatedly by cl_wait() until either lock is
1446 * granted, or error occurs. This function does not block waiting for network
1447 * communication to complete.
1449 * \see cl_wait() cl_lock_operations::clo_wait()
1450 * \see cl_lock_state::CLS_HELD
1452 int cl_wait_try(const struct lu_env *env, struct cl_lock *lock)
1454 const struct cl_lock_slice *slice;
1458 cl_lock_trace(D_DLMTRACE, env, "wait lock try", lock);
1460 LINVRNT(cl_lock_is_mutexed(lock));
1461 LINVRNT(cl_lock_invariant(env, lock));
1462 LASSERTF(lock->cll_state == CLS_QUEUING ||
1463 lock->cll_state == CLS_ENQUEUED ||
1464 lock->cll_state == CLS_HELD ||
1465 lock->cll_state == CLS_INTRANSIT,
1466 "lock state: %d\n", lock->cll_state);
1467 LASSERT(lock->cll_users > 0);
1468 LASSERT(lock->cll_holds > 0);
1470 result = lock->cll_error;
1474 if (cl_lock_is_intransit(lock)) {
1479 if (lock->cll_state == CLS_HELD)
1484 cfs_list_for_each_entry(slice, &lock->cll_layers, cls_linkage) {
1485 if (slice->cls_ops->clo_wait != NULL) {
1486 result = slice->cls_ops->clo_wait(env, slice);
1491 LASSERT(result != -ENOSYS);
1493 LASSERT(lock->cll_state != CLS_INTRANSIT);
1494 cl_lock_state_set(env, lock, CLS_HELD);
1496 } while (result == CLO_REPEAT);
1499 EXPORT_SYMBOL(cl_wait_try);
1502 * Waits until enqueued lock is granted.
1504 * \pre current thread or io owns a hold on the lock
1505 * \pre ergo(result == 0, lock->cll_state == CLS_ENQUEUED ||
1506 * lock->cll_state == CLS_HELD)
1508 * \post ergo(result == 0, lock->cll_state == CLS_HELD)
1510 int cl_wait(const struct lu_env *env, struct cl_lock *lock)
1515 cl_lock_mutex_get(env, lock);
1517 LINVRNT(cl_lock_invariant(env, lock));
1518 LASSERTF(lock->cll_state == CLS_ENQUEUED || lock->cll_state == CLS_HELD,
1519 "Wrong state %d \n", lock->cll_state);
1520 LASSERT(lock->cll_holds > 0);
1523 result = cl_wait_try(env, lock);
1524 if (result == CLO_WAIT) {
1525 result = cl_lock_state_wait(env, lock);
1532 cl_unuse_try(env, lock);
1533 cl_lock_lockdep_release(env, lock);
1535 cl_lock_trace(D_DLMTRACE, env, "wait lock", lock);
1536 cl_lock_mutex_put(env, lock);
1537 LASSERT(ergo(result == 0, lock->cll_state == CLS_HELD));
1540 EXPORT_SYMBOL(cl_wait);
1543 * Executes cl_lock_operations::clo_weigh(), and sums results to estimate lock
1546 unsigned long cl_lock_weigh(const struct lu_env *env, struct cl_lock *lock)
1548 const struct cl_lock_slice *slice;
1549 unsigned long pound;
1550 unsigned long ounce;
1553 LINVRNT(cl_lock_is_mutexed(lock));
1554 LINVRNT(cl_lock_invariant(env, lock));
1557 cfs_list_for_each_entry_reverse(slice, &lock->cll_layers, cls_linkage) {
1558 if (slice->cls_ops->clo_weigh != NULL) {
1559 ounce = slice->cls_ops->clo_weigh(env, slice);
1561 if (pound < ounce) /* over-weight^Wflow */
1567 EXPORT_SYMBOL(cl_lock_weigh);
1570 * Notifies layers that lock description changed.
1572 * The server can grant client a lock different from one that was requested
1573 * (e.g., larger in extent). This method is called when actually granted lock
1574 * description becomes known to let layers to accommodate for changed lock
1577 * \see cl_lock_operations::clo_modify()
1579 int cl_lock_modify(const struct lu_env *env, struct cl_lock *lock,
1580 const struct cl_lock_descr *desc)
1582 const struct cl_lock_slice *slice;
1583 struct cl_object *obj = lock->cll_descr.cld_obj;
1584 struct cl_object_header *hdr = cl_object_header(obj);
1588 cl_lock_trace(D_DLMTRACE, env, "modify lock", lock);
1589 /* don't allow object to change */
1590 LASSERT(obj == desc->cld_obj);
1591 LINVRNT(cl_lock_is_mutexed(lock));
1592 LINVRNT(cl_lock_invariant(env, lock));
1594 cfs_list_for_each_entry_reverse(slice, &lock->cll_layers, cls_linkage) {
1595 if (slice->cls_ops->clo_modify != NULL) {
1596 result = slice->cls_ops->clo_modify(env, slice, desc);
1601 CL_LOCK_DEBUG(D_DLMTRACE, env, lock, " -> "DDESCR"@"DFID"\n",
1602 PDESCR(desc), PFID(lu_object_fid(&desc->cld_obj->co_lu)));
1604 * Just replace description in place. Nothing more is needed for
1605 * now. If locks were indexed according to their extent and/or mode,
1606 * that index would have to be updated here.
1608 cfs_spin_lock(&hdr->coh_lock_guard);
1609 lock->cll_descr = *desc;
1610 cfs_spin_unlock(&hdr->coh_lock_guard);
1613 EXPORT_SYMBOL(cl_lock_modify);
1616 * Initializes lock closure with a given origin.
1618 * \see cl_lock_closure
1620 void cl_lock_closure_init(const struct lu_env *env,
1621 struct cl_lock_closure *closure,
1622 struct cl_lock *origin, int wait)
1624 LINVRNT(cl_lock_is_mutexed(origin));
1625 LINVRNT(cl_lock_invariant(env, origin));
1627 CFS_INIT_LIST_HEAD(&closure->clc_list);
1628 closure->clc_origin = origin;
1629 closure->clc_wait = wait;
1630 closure->clc_nr = 0;
1632 EXPORT_SYMBOL(cl_lock_closure_init);
1635 * Builds a closure of \a lock.
1637 * Building of a closure consists of adding initial lock (\a lock) into it,
1638 * and calling cl_lock_operations::clo_closure() methods of \a lock. These
1639 * methods might call cl_lock_closure_build() recursively again, adding more
1640 * locks to the closure, etc.
1642 * \see cl_lock_closure
1644 int cl_lock_closure_build(const struct lu_env *env, struct cl_lock *lock,
1645 struct cl_lock_closure *closure)
1647 const struct cl_lock_slice *slice;
1651 LINVRNT(cl_lock_is_mutexed(closure->clc_origin));
1652 LINVRNT(cl_lock_invariant(env, closure->clc_origin));
1654 result = cl_lock_enclosure(env, lock, closure);
1656 cfs_list_for_each_entry(slice, &lock->cll_layers, cls_linkage) {
1657 if (slice->cls_ops->clo_closure != NULL) {
1658 result = slice->cls_ops->clo_closure(env, slice,
1666 cl_lock_disclosure(env, closure);
1669 EXPORT_SYMBOL(cl_lock_closure_build);
1672 * Adds new lock to a closure.
1674 * Try-locks \a lock and if succeeded, adds it to the closure (never more than
1675 * once). If try-lock failed, returns CLO_REPEAT, after optionally waiting
1676 * until next try-lock is likely to succeed.
1678 int cl_lock_enclosure(const struct lu_env *env, struct cl_lock *lock,
1679 struct cl_lock_closure *closure)
1683 cl_lock_trace(D_DLMTRACE, env, "enclosure lock", lock);
1684 if (!cl_lock_mutex_try(env, lock)) {
1686 * If lock->cll_inclosure is not empty, lock is already in
1689 if (cfs_list_empty(&lock->cll_inclosure)) {
1690 cl_lock_get_trust(lock);
1691 lu_ref_add(&lock->cll_reference, "closure", closure);
1692 cfs_list_add(&lock->cll_inclosure, &closure->clc_list);
1695 cl_lock_mutex_put(env, lock);
1698 cl_lock_disclosure(env, closure);
1699 if (closure->clc_wait) {
1700 cl_lock_get_trust(lock);
1701 lu_ref_add(&lock->cll_reference, "closure-w", closure);
1702 cl_lock_mutex_put(env, closure->clc_origin);
1704 LASSERT(cl_lock_nr_mutexed(env) == 0);
1705 cl_lock_mutex_get(env, lock);
1706 cl_lock_mutex_put(env, lock);
1708 cl_lock_mutex_get(env, closure->clc_origin);
1709 lu_ref_del(&lock->cll_reference, "closure-w", closure);
1710 cl_lock_put(env, lock);
1712 result = CLO_REPEAT;
1716 EXPORT_SYMBOL(cl_lock_enclosure);
1718 /** Releases mutices of enclosed locks. */
1719 void cl_lock_disclosure(const struct lu_env *env,
1720 struct cl_lock_closure *closure)
1722 struct cl_lock *scan;
1723 struct cl_lock *temp;
1725 cl_lock_trace(D_DLMTRACE, env, "disclosure lock", closure->clc_origin);
1726 cfs_list_for_each_entry_safe(scan, temp, &closure->clc_list,
1728 cfs_list_del_init(&scan->cll_inclosure);
1729 cl_lock_mutex_put(env, scan);
1730 lu_ref_del(&scan->cll_reference, "closure", closure);
1731 cl_lock_put(env, scan);
1734 LASSERT(closure->clc_nr == 0);
1736 EXPORT_SYMBOL(cl_lock_disclosure);
1738 /** Finalizes a closure. */
1739 void cl_lock_closure_fini(struct cl_lock_closure *closure)
1741 LASSERT(closure->clc_nr == 0);
1742 LASSERT(cfs_list_empty(&closure->clc_list));
1744 EXPORT_SYMBOL(cl_lock_closure_fini);
1747 * Destroys this lock. Notifies layers (bottom-to-top) that lock is being
1748 * destroyed, then destroy the lock. If there are holds on the lock, postpone
1749 * destruction until all holds are released. This is called when a decision is
1750 * made to destroy the lock in the future. E.g., when a blocking AST is
1751 * received on it, or fatal communication error happens.
1753 * Caller must have a reference on this lock to prevent a situation, when
1754 * deleted lock lingers in memory for indefinite time, because nobody calls
1755 * cl_lock_put() to finish it.
1757 * \pre atomic_read(&lock->cll_ref) > 0
1758 * \pre ergo(cl_lock_nesting(lock) == CNL_TOP,
1759 * cl_lock_nr_mutexed(env) == 1)
1760 * [i.e., if a top-lock is deleted, mutices of no other locks can be
1761 * held, as deletion of sub-locks might require releasing a top-lock
1764 * \see cl_lock_operations::clo_delete()
1765 * \see cl_lock::cll_holds
1767 void cl_lock_delete(const struct lu_env *env, struct cl_lock *lock)
1769 LINVRNT(cl_lock_is_mutexed(lock));
1770 LINVRNT(cl_lock_invariant(env, lock));
1771 LASSERT(ergo(cl_lock_nesting(lock) == CNL_TOP,
1772 cl_lock_nr_mutexed(env) == 1));
1775 cl_lock_trace(D_DLMTRACE, env, "delete lock", lock);
1776 if (lock->cll_holds == 0)
1777 cl_lock_delete0(env, lock);
1779 lock->cll_flags |= CLF_DOOMED;
1782 EXPORT_SYMBOL(cl_lock_delete);
1785 * Mark lock as irrecoverably failed, and mark it for destruction. This
1786 * happens when, e.g., server fails to grant a lock to us, or networking
1789 * \pre atomic_read(&lock->cll_ref) > 0
1791 * \see clo_lock_delete()
1792 * \see cl_lock::cll_holds
1794 void cl_lock_error(const struct lu_env *env, struct cl_lock *lock, int error)
1796 LINVRNT(cl_lock_is_mutexed(lock));
1797 LINVRNT(cl_lock_invariant(env, lock));
1800 if (lock->cll_error == 0 && error != 0) {
1801 cl_lock_trace(D_DLMTRACE, env, "set lock error", lock);
1802 lock->cll_error = error;
1803 cl_lock_signal(env, lock);
1804 cl_lock_cancel(env, lock);
1805 cl_lock_delete(env, lock);
1809 EXPORT_SYMBOL(cl_lock_error);
1812 * Cancels this lock. Notifies layers
1813 * (bottom-to-top) that lock is being cancelled, then destroy the lock. If
1814 * there are holds on the lock, postpone cancellation until
1815 * all holds are released.
1817 * Cancellation notification is delivered to layers at most once.
1819 * \see cl_lock_operations::clo_cancel()
1820 * \see cl_lock::cll_holds
1822 void cl_lock_cancel(const struct lu_env *env, struct cl_lock *lock)
1824 LINVRNT(cl_lock_is_mutexed(lock));
1825 LINVRNT(cl_lock_invariant(env, lock));
1828 cl_lock_trace(D_DLMTRACE, env, "cancel lock", lock);
1829 if (lock->cll_holds == 0)
1830 cl_lock_cancel0(env, lock);
1832 lock->cll_flags |= CLF_CANCELPEND;
1835 EXPORT_SYMBOL(cl_lock_cancel);
1838 * Finds an existing lock covering given index and optionally different from a
1839 * given \a except lock.
1841 struct cl_lock *cl_lock_at_pgoff(const struct lu_env *env,
1842 struct cl_object *obj, pgoff_t index,
1843 struct cl_lock *except,
1844 int pending, int canceld)
1846 struct cl_object_header *head;
1847 struct cl_lock *scan;
1848 struct cl_lock *lock;
1849 struct cl_lock_descr *need;
1853 head = cl_object_header(obj);
1854 need = &cl_env_info(env)->clt_descr;
1857 need->cld_mode = CLM_READ; /* CLM_READ matches both READ & WRITE, but
1859 need->cld_start = need->cld_end = index;
1860 need->cld_enq_flags = 0;
1862 cfs_spin_lock(&head->coh_lock_guard);
1863 /* It is fine to match any group lock since there could be only one
1864 * with a uniq gid and it conflicts with all other lock modes too */
1865 cfs_list_for_each_entry(scan, &head->coh_locks, cll_linkage) {
1866 if (scan != except &&
1867 (scan->cll_descr.cld_mode == CLM_GROUP ||
1868 cl_lock_ext_match(&scan->cll_descr, need)) &&
1869 scan->cll_state >= CLS_HELD &&
1870 scan->cll_state < CLS_FREEING &&
1872 * This check is racy as the lock can be canceled right
1873 * after it is done, but this is fine, because page exists
1876 (canceld || !(scan->cll_flags & CLF_CANCELLED)) &&
1877 (pending || !(scan->cll_flags & CLF_CANCELPEND))) {
1878 /* Don't increase cs_hit here since this
1879 * is just a helper function. */
1880 cl_lock_get_trust(scan);
1885 cfs_spin_unlock(&head->coh_lock_guard);
1888 EXPORT_SYMBOL(cl_lock_at_pgoff);
1891 * Calculate the page offset at the layer of @lock.
1892 * At the time of this writing, @page is top page and @lock is sub lock.
1894 static pgoff_t pgoff_at_lock(struct cl_page *page, struct cl_lock *lock)
1896 struct lu_device_type *dtype;
1897 const struct cl_page_slice *slice;
1899 dtype = lock->cll_descr.cld_obj->co_lu.lo_dev->ld_type;
1900 slice = cl_page_at(page, dtype);
1901 LASSERT(slice != NULL);
1902 return slice->cpl_page->cp_index;
1906 * Check if page @page is covered by an extra lock or discard it.
1908 static int check_and_discard_cb(const struct lu_env *env, struct cl_io *io,
1909 struct cl_page *page, void *cbdata)
1911 struct cl_thread_info *info = cl_env_info(env);
1912 struct cl_lock *lock = cbdata;
1913 pgoff_t index = pgoff_at_lock(page, lock);
1915 if (index >= info->clt_fn_index) {
1916 struct cl_lock *tmp;
1918 /* refresh non-overlapped index */
1919 tmp = cl_lock_at_page(env, lock->cll_descr.cld_obj, page, lock,
1922 /* Cache the first-non-overlapped index so as to skip
1923 * all pages within [index, clt_fn_index). This
1924 * is safe because if tmp lock is canceled, it will
1925 * discard these pages. */
1926 info->clt_fn_index = tmp->cll_descr.cld_end + 1;
1927 if (tmp->cll_descr.cld_end == CL_PAGE_EOF)
1928 info->clt_fn_index = CL_PAGE_EOF;
1929 cl_lock_put(env, tmp);
1930 } else if (cl_page_own(env, io, page) == 0) {
1931 /* discard the page */
1932 cl_page_unmap(env, io, page);
1933 cl_page_discard(env, io, page);
1934 cl_page_disown(env, io, page);
1936 LASSERT(page->cp_state == CPS_FREEING);
1940 info->clt_next_index = index + 1;
1941 return CLP_GANG_OKAY;
1944 static int discard_cb(const struct lu_env *env, struct cl_io *io,
1945 struct cl_page *page, void *cbdata)
1947 struct cl_thread_info *info = cl_env_info(env);
1948 struct cl_lock *lock = cbdata;
1950 LASSERT(lock->cll_descr.cld_mode >= CLM_WRITE);
1951 KLASSERT(ergo(page->cp_type == CPT_CACHEABLE,
1952 !PageWriteback(cl_page_vmpage(env, page))));
1953 KLASSERT(ergo(page->cp_type == CPT_CACHEABLE,
1954 !PageDirty(cl_page_vmpage(env, page))));
1956 info->clt_next_index = pgoff_at_lock(page, lock) + 1;
1957 if (cl_page_own(env, io, page) == 0) {
1958 /* discard the page */
1959 cl_page_unmap(env, io, page);
1960 cl_page_discard(env, io, page);
1961 cl_page_disown(env, io, page);
1963 LASSERT(page->cp_state == CPS_FREEING);
1966 return CLP_GANG_OKAY;
1970 * Discard pages protected by the given lock. This function traverses radix
1971 * tree to find all covering pages and discard them. If a page is being covered
1972 * by other locks, it should remain in cache.
1974 * If error happens on any step, the process continues anyway (the reasoning
1975 * behind this being that lock cancellation cannot be delayed indefinitely).
1977 int cl_lock_discard_pages(const struct lu_env *env, struct cl_lock *lock)
1979 struct cl_thread_info *info = cl_env_info(env);
1980 struct cl_io *io = &info->clt_io;
1981 struct cl_lock_descr *descr = &lock->cll_descr;
1982 cl_page_gang_cb_t cb;
1986 LINVRNT(cl_lock_invariant(env, lock));
1989 io->ci_obj = cl_object_top(descr->cld_obj);
1990 io->ci_ignore_layout = 1;
1991 result = cl_io_init(env, io, CIT_MISC, io->ci_obj);
1995 cb = descr->cld_mode == CLM_READ ? check_and_discard_cb : discard_cb;
1996 info->clt_fn_index = info->clt_next_index = descr->cld_start;
1998 res = cl_page_gang_lookup(env, descr->cld_obj, io,
1999 info->clt_next_index, descr->cld_end,
2001 if (info->clt_next_index > descr->cld_end)
2004 if (res == CLP_GANG_RESCHED)
2006 } while (res != CLP_GANG_OKAY);
2008 cl_io_fini(env, io);
2011 EXPORT_SYMBOL(cl_lock_discard_pages);
2014 * Eliminate all locks for a given object.
2016 * Caller has to guarantee that no lock is in active use.
2018 * \param cancel when this is set, cl_locks_prune() cancels locks before
2021 void cl_locks_prune(const struct lu_env *env, struct cl_object *obj, int cancel)
2023 struct cl_object_header *head;
2024 struct cl_lock *lock;
2027 head = cl_object_header(obj);
2029 * If locks are destroyed without cancellation, all pages must be
2030 * already destroyed (as otherwise they will be left unprotected).
2032 LASSERT(ergo(!cancel,
2033 head->coh_tree.rnode == NULL && head->coh_pages == 0));
2035 cfs_spin_lock(&head->coh_lock_guard);
2036 while (!cfs_list_empty(&head->coh_locks)) {
2037 lock = container_of(head->coh_locks.next,
2038 struct cl_lock, cll_linkage);
2039 cl_lock_get_trust(lock);
2040 cfs_spin_unlock(&head->coh_lock_guard);
2041 lu_ref_add(&lock->cll_reference, "prune", cfs_current());
2044 cl_lock_mutex_get(env, lock);
2045 if (lock->cll_state < CLS_FREEING) {
2046 LASSERT(lock->cll_users <= 1);
2047 if (unlikely(lock->cll_users == 1)) {
2048 struct l_wait_info lwi = { 0 };
2050 cl_lock_mutex_put(env, lock);
2051 l_wait_event(lock->cll_wq,
2052 lock->cll_users == 0,
2058 cl_lock_cancel(env, lock);
2059 cl_lock_delete(env, lock);
2061 cl_lock_mutex_put(env, lock);
2062 lu_ref_del(&lock->cll_reference, "prune", cfs_current());
2063 cl_lock_put(env, lock);
2064 cfs_spin_lock(&head->coh_lock_guard);
2066 cfs_spin_unlock(&head->coh_lock_guard);
2069 EXPORT_SYMBOL(cl_locks_prune);
2071 static struct cl_lock *cl_lock_hold_mutex(const struct lu_env *env,
2072 const struct cl_io *io,
2073 const struct cl_lock_descr *need,
2074 const char *scope, const void *source)
2076 struct cl_lock *lock;
2081 lock = cl_lock_find(env, io, need);
2084 cl_lock_mutex_get(env, lock);
2085 if (lock->cll_state < CLS_FREEING &&
2086 !(lock->cll_flags & CLF_CANCELLED)) {
2087 cl_lock_hold_mod(env, lock, +1);
2088 lu_ref_add(&lock->cll_holders, scope, source);
2089 lu_ref_add(&lock->cll_reference, scope, source);
2092 cl_lock_mutex_put(env, lock);
2093 cl_lock_put(env, lock);
2099 * Returns a lock matching \a need description with a reference and a hold on
2102 * This is much like cl_lock_find(), except that cl_lock_hold() additionally
2103 * guarantees that lock is not in the CLS_FREEING state on return.
2105 struct cl_lock *cl_lock_hold(const struct lu_env *env, const struct cl_io *io,
2106 const struct cl_lock_descr *need,
2107 const char *scope, const void *source)
2109 struct cl_lock *lock;
2113 lock = cl_lock_hold_mutex(env, io, need, scope, source);
2115 cl_lock_mutex_put(env, lock);
2118 EXPORT_SYMBOL(cl_lock_hold);
2121 * Main high-level entry point of cl_lock interface that finds existing or
2122 * enqueues new lock matching given description.
2124 struct cl_lock *cl_lock_request(const struct lu_env *env, struct cl_io *io,
2125 const struct cl_lock_descr *need,
2126 const char *scope, const void *source)
2128 struct cl_lock *lock;
2130 __u32 enqflags = need->cld_enq_flags;
2134 lock = cl_lock_hold_mutex(env, io, need, scope, source);
2138 rc = cl_enqueue_locked(env, lock, io, enqflags);
2140 if (cl_lock_fits_into(env, lock, need, io)) {
2141 if (!(enqflags & CEF_AGL)) {
2142 cl_lock_mutex_put(env, lock);
2143 cl_lock_lockdep_acquire(env, lock,
2149 cl_unuse_locked(env, lock);
2151 cl_lock_trace(D_DLMTRACE, env,
2152 rc <= 0 ? "enqueue failed" : "agl succeed", lock);
2153 cl_lock_hold_release(env, lock, scope, source);
2154 cl_lock_mutex_put(env, lock);
2155 lu_ref_del(&lock->cll_reference, scope, source);
2156 cl_lock_put(env, lock);
2158 LASSERT(enqflags & CEF_AGL);
2160 } else if (rc != 0) {
2166 EXPORT_SYMBOL(cl_lock_request);
2169 * Adds a hold to a known lock.
2171 void cl_lock_hold_add(const struct lu_env *env, struct cl_lock *lock,
2172 const char *scope, const void *source)
2174 LINVRNT(cl_lock_is_mutexed(lock));
2175 LINVRNT(cl_lock_invariant(env, lock));
2176 LASSERT(lock->cll_state != CLS_FREEING);
2179 cl_lock_hold_mod(env, lock, +1);
2181 lu_ref_add(&lock->cll_holders, scope, source);
2182 lu_ref_add(&lock->cll_reference, scope, source);
2185 EXPORT_SYMBOL(cl_lock_hold_add);
2188 * Releases a hold and a reference on a lock, on which caller acquired a
2191 void cl_lock_unhold(const struct lu_env *env, struct cl_lock *lock,
2192 const char *scope, const void *source)
2194 LINVRNT(cl_lock_invariant(env, lock));
2196 cl_lock_hold_release(env, lock, scope, source);
2197 lu_ref_del(&lock->cll_reference, scope, source);
2198 cl_lock_put(env, lock);
2201 EXPORT_SYMBOL(cl_lock_unhold);
2204 * Releases a hold and a reference on a lock, obtained by cl_lock_hold().
2206 void cl_lock_release(const struct lu_env *env, struct cl_lock *lock,
2207 const char *scope, const void *source)
2209 LINVRNT(cl_lock_invariant(env, lock));
2211 cl_lock_trace(D_DLMTRACE, env, "release lock", lock);
2212 cl_lock_mutex_get(env, lock);
2213 cl_lock_hold_release(env, lock, scope, source);
2214 cl_lock_mutex_put(env, lock);
2215 lu_ref_del(&lock->cll_reference, scope, source);
2216 cl_lock_put(env, lock);
2219 EXPORT_SYMBOL(cl_lock_release);
2221 void cl_lock_user_add(const struct lu_env *env, struct cl_lock *lock)
2223 LINVRNT(cl_lock_is_mutexed(lock));
2224 LINVRNT(cl_lock_invariant(env, lock));
2227 cl_lock_used_mod(env, lock, +1);
2230 EXPORT_SYMBOL(cl_lock_user_add);
2232 void cl_lock_user_del(const struct lu_env *env, struct cl_lock *lock)
2234 LINVRNT(cl_lock_is_mutexed(lock));
2235 LINVRNT(cl_lock_invariant(env, lock));
2236 LASSERT(lock->cll_users > 0);
2239 cl_lock_used_mod(env, lock, -1);
2240 if (lock->cll_users == 0)
2241 cfs_waitq_broadcast(&lock->cll_wq);
2244 EXPORT_SYMBOL(cl_lock_user_del);
2246 const char *cl_lock_mode_name(const enum cl_lock_mode mode)
2248 static const char *names[] = {
2249 [CLM_PHANTOM] = "P",
2254 if (0 <= mode && mode < ARRAY_SIZE(names))
2259 EXPORT_SYMBOL(cl_lock_mode_name);
2262 * Prints human readable representation of a lock description.
2264 void cl_lock_descr_print(const struct lu_env *env, void *cookie,
2265 lu_printer_t printer,
2266 const struct cl_lock_descr *descr)
2268 const struct lu_fid *fid;
2270 fid = lu_object_fid(&descr->cld_obj->co_lu);
2271 (*printer)(env, cookie, DDESCR"@"DFID, PDESCR(descr), PFID(fid));
2273 EXPORT_SYMBOL(cl_lock_descr_print);
2276 * Prints human readable representation of \a lock to the \a f.
2278 void cl_lock_print(const struct lu_env *env, void *cookie,
2279 lu_printer_t printer, const struct cl_lock *lock)
2281 const struct cl_lock_slice *slice;
2282 (*printer)(env, cookie, "lock@%p[%d %d %d %d %d %08lx] ",
2283 lock, cfs_atomic_read(&lock->cll_ref),
2284 lock->cll_state, lock->cll_error, lock->cll_holds,
2285 lock->cll_users, lock->cll_flags);
2286 cl_lock_descr_print(env, cookie, printer, &lock->cll_descr);
2287 (*printer)(env, cookie, " {\n");
2289 cfs_list_for_each_entry(slice, &lock->cll_layers, cls_linkage) {
2290 (*printer)(env, cookie, " %s@%p: ",
2291 slice->cls_obj->co_lu.lo_dev->ld_type->ldt_name,
2293 if (slice->cls_ops->clo_print != NULL)
2294 slice->cls_ops->clo_print(env, cookie, printer, slice);
2295 (*printer)(env, cookie, "\n");
2297 (*printer)(env, cookie, "} lock@%p\n", lock);
2299 EXPORT_SYMBOL(cl_lock_print);
2301 int cl_lock_init(void)
2303 return lu_kmem_init(cl_lock_caches);
2306 void cl_lock_fini(void)
2308 lu_kmem_fini(cl_lock_caches);