1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
2 * vim:expandtab:shiftwidth=8:tabstop=8:
4 * Copyright (c) 2002 Cluster File Systems, Inc.
5 * Author: Peter Braam <braam@clusterfs.com>
6 * Author: Phil Schwan <phil@clusterfs.com>
8 * This file is part of Lustre, http://www.lustre.org.
10 * Lustre is free software; you can redistribute it and/or
11 * modify it under the terms of version 2 of the GNU General Public
12 * License as published by the Free Software Foundation.
14 * Lustre is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
19 * You should have received a copy of the GNU General Public License
20 * along with Lustre; if not, write to the Free Software
21 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
24 #define DEBUG_SUBSYSTEM S_LDLM
26 #include <linux/slab.h>
27 #include <linux/module.h>
28 #include <linux/random.h>
29 #include <linux/lustre_dlm.h>
30 #include <linux/lustre_mds.h>
31 #include <linux/obd_class.h>
34 char *ldlm_lockname[] = {
43 char *ldlm_typename[] = {
46 [LDLM_MDSINTENT] "INT"
49 char *ldlm_it2str(int it)
56 case (IT_OPEN | IT_CREAT):
85 CERROR("Unknown intent %d\n", it);
90 extern kmem_cache_t *ldlm_lock_slab;
92 static int ldlm_plain_compat(struct ldlm_lock *a, struct ldlm_lock *b);
94 ldlm_res_compat ldlm_res_compat_table[] = {
95 [LDLM_PLAIN] ldlm_plain_compat,
96 [LDLM_EXTENT] ldlm_extent_compat,
97 [LDLM_MDSINTENT] ldlm_plain_compat
100 ldlm_res_policy ldlm_res_policy_table[] = {
102 [LDLM_EXTENT] ldlm_extent_policy,
103 [LDLM_MDSINTENT] NULL
106 void ldlm_register_intent(int (*arg) (struct ldlm_lock * lock, void *req_cookie,
107 ldlm_mode_t mode, void *data))
109 ldlm_res_policy_table[LDLM_MDSINTENT] = arg;
112 void ldlm_unregister_intent(void)
114 ldlm_res_policy_table[LDLM_MDSINTENT] = NULL;
118 * REFCOUNTED LOCK OBJECTS
123 * Lock refcounts, during creation:
124 * - one special one for allocation, dec'd only once in destroy
125 * - one for being a lock that's in-use
126 * - one for the addref associated with a new lock
128 struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock)
130 l_lock(&lock->l_resource->lr_namespace->ns_lock);
132 ldlm_resource_getref(lock->l_resource);
133 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
137 void ldlm_lock_put(struct ldlm_lock *lock)
139 struct lustre_lock *nslock = &lock->l_resource->lr_namespace->ns_lock;
144 //LDLM_DEBUG(lock, "after refc--");
145 if (lock->l_refc < 0)
148 ldlm_resource_put(lock->l_resource);
150 LDLM_LOCK_PUT(lock->l_parent);
152 if (lock->l_refc == 0 && (lock->l_flags & LDLM_FL_DESTROYED)) {
153 lock->l_resource = NULL;
154 LDLM_DEBUG(lock, "final lock_put on destroyed lock, freeing");
155 if (lock->l_export && lock->l_export->exp_connection)
156 ptlrpc_put_connection(lock->l_export->exp_connection);
157 CDEBUG(D_MALLOC, "kfreed 'lock': %d at %p (tot 1).\n",
158 sizeof(*lock), lock);
159 kmem_cache_free(ldlm_lock_slab, lock);
165 void ldlm_lock_destroy(struct ldlm_lock *lock)
168 l_lock(&lock->l_resource->lr_namespace->ns_lock);
170 if (!list_empty(&lock->l_children)) {
171 LDLM_DEBUG(lock, "still has children (%p)!",
172 lock->l_children.next);
173 ldlm_lock_dump(lock);
176 if (lock->l_readers || lock->l_writers) {
177 LDLM_DEBUG(lock, "lock still has references");
178 ldlm_lock_dump(lock);
182 if (!list_empty(&lock->l_res_link)) {
183 ldlm_lock_dump(lock);
187 if (lock->l_flags & LDLM_FL_DESTROYED) {
188 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
193 list_del(&lock->l_export_chain);
194 lock->l_export = NULL;
195 lock->l_flags |= LDLM_FL_DESTROYED;
197 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
203 usage: pass in a resource on which you have done get
204 pass in a parent lock on which you have done a get
205 do not put the resource or the parent
206 returns: lock with refcount 1
208 static struct ldlm_lock *ldlm_lock_new(struct ldlm_lock *parent,
209 struct ldlm_resource *resource)
211 struct ldlm_lock *lock;
214 if (resource == NULL)
217 lock = kmem_cache_alloc(ldlm_lock_slab, SLAB_KERNEL);
220 CDEBUG(D_MALLOC, "kmalloced 'lock': %d at "
221 "%p (tot %d).\n", sizeof(*lock), lock, 1);
223 memset(lock, 0, sizeof(*lock));
224 get_random_bytes(&lock->l_random, sizeof(__u64));
226 lock->l_resource = resource;
227 /* this refcount matches the one of the resource passed
228 in which is not being put away */
230 INIT_LIST_HEAD(&lock->l_children);
231 INIT_LIST_HEAD(&lock->l_res_link);
232 INIT_LIST_HEAD(&lock->l_export_chain);
233 INIT_LIST_HEAD(&lock->l_pending_chain);
234 init_waitqueue_head(&lock->l_waitq);
236 if (parent != NULL) {
237 l_lock(&parent->l_resource->lr_namespace->ns_lock);
238 lock->l_parent = parent;
239 list_add(&lock->l_childof, &parent->l_children);
240 l_unlock(&parent->l_resource->lr_namespace->ns_lock);
242 /* this is the extra refcount, to prevent the lock
248 int ldlm_lock_change_resource(struct ldlm_lock *lock, __u64 new_resid[3])
250 struct ldlm_namespace *ns = lock->l_resource->lr_namespace;
251 struct ldlm_resource *oldres = lock->l_resource;
255 l_lock(&ns->ns_lock);
256 if (memcmp(new_resid, lock->l_resource->lr_name,
257 sizeof(lock->l_resource->lr_name)) == 0) {
259 l_unlock(&ns->ns_lock);
263 type = lock->l_resource->lr_type;
264 if (new_resid[0] == 0)
266 lock->l_resource = ldlm_resource_get(ns, NULL, new_resid, type, 1);
267 if (lock->l_resource == NULL) {
272 /* move references over */
273 for (i = 0; i < lock->l_refc; i++) {
275 ldlm_resource_getref(lock->l_resource);
276 rc = ldlm_resource_put(oldres);
277 if (rc == 1 && i != lock->l_refc - 1)
280 /* compensate for the initial get above.. */
281 ldlm_resource_put(lock->l_resource);
283 l_unlock(&ns->ns_lock);
291 void ldlm_lock2handle(struct ldlm_lock *lock, struct lustre_handle *lockh)
293 lockh->addr = (__u64) (unsigned long)lock;
294 lockh->cookie = lock->l_random;
297 struct ldlm_lock *ldlm_handle2lock(struct lustre_handle *handle)
299 struct ldlm_lock *lock = NULL, *retval = NULL;
302 if (!handle || !handle->addr)
305 lock = (struct ldlm_lock *)(unsigned long)(handle->addr);
306 if (!kmem_cache_validate(ldlm_lock_slab, (void *)lock))
309 l_lock(&lock->l_resource->lr_namespace->ns_lock);
310 if (lock->l_random != handle->cookie)
313 if (lock->l_flags & LDLM_FL_DESTROYED)
316 retval = LDLM_LOCK_GET(lock);
319 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
323 static int ldlm_plain_compat(struct ldlm_lock *a, struct ldlm_lock *b)
325 return lockmode_compat(a->l_req_mode, b->l_req_mode);
328 void ldlm_lock2desc(struct ldlm_lock *lock, struct ldlm_lock_desc *desc)
330 ldlm_res2desc(lock->l_resource, &desc->l_resource);
331 desc->l_req_mode = lock->l_req_mode;
332 desc->l_granted_mode = lock->l_granted_mode;
333 memcpy(&desc->l_extent, &lock->l_extent, sizeof(desc->l_extent));
334 memcpy(desc->l_version, lock->l_version, sizeof(desc->l_version));
337 static void ldlm_add_ast_work_item(struct ldlm_lock *lock,
338 struct ldlm_lock *new)
340 struct ldlm_ast_work *w;
343 l_lock(&lock->l_resource->lr_namespace->ns_lock);
344 if (new && (lock->l_flags & LDLM_FL_AST_SENT))
347 OBD_ALLOC(w, sizeof(*w));
354 lock->l_flags |= LDLM_FL_AST_SENT;
356 ldlm_lock2desc(new, &w->w_desc);
359 w->w_lock = LDLM_LOCK_GET(lock);
360 list_add(&w->w_list, lock->l_resource->lr_tmp);
362 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
366 void ldlm_lock_addref(struct lustre_handle *lockh, __u32 mode)
368 struct ldlm_lock *lock;
370 lock = ldlm_handle2lock(lockh);
371 ldlm_lock_addref_internal(lock, mode);
375 /* only called for local locks */
376 void ldlm_lock_addref_internal(struct ldlm_lock *lock, __u32 mode)
378 l_lock(&lock->l_resource->lr_namespace->ns_lock);
379 if (mode == LCK_NL || mode == LCK_CR || mode == LCK_PR)
383 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
385 LDLM_DEBUG(lock, "ldlm_lock_addref(%s)", ldlm_lockname[mode]);
388 /* Args: unlocked lock */
389 void ldlm_lock_decref(struct lustre_handle *lockh, __u32 mode)
391 struct ldlm_lock *lock = ldlm_handle2lock(lockh);
397 LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
398 l_lock(&lock->l_resource->lr_namespace->ns_lock);
399 if (mode == LCK_NL || mode == LCK_CR || mode == LCK_PR)
404 /* If we received a blocked AST and this was the last reference,
405 * run the callback. */
406 if (!lock->l_readers && !lock->l_writers &&
407 (lock->l_flags & LDLM_FL_CBPENDING)) {
408 if (!lock->l_resource->lr_namespace->ns_client) {
409 CERROR("LDLM_FL_CBPENDING set on non-local lock!\n");
413 LDLM_DEBUG(lock, "final decref done on cbpending lock");
414 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
416 /* FIXME: need a real 'desc' here */
417 lock->l_blocking_ast(lock, NULL, lock->l_data,
420 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
422 LDLM_LOCK_PUT(lock); /* matches the ldlm_lock_get in addref */
423 LDLM_LOCK_PUT(lock); /* matches the handle2lock above */
428 static int ldlm_lock_compat_list(struct ldlm_lock *lock, int send_cbs,
429 struct list_head *queue)
431 struct list_head *tmp, *pos;
434 list_for_each_safe(tmp, pos, queue) {
435 struct ldlm_lock *child;
436 ldlm_res_compat compat;
438 child = list_entry(tmp, struct ldlm_lock, l_res_link);
442 compat = ldlm_res_compat_table[child->l_resource->lr_type];
443 if (compat && compat(child, lock)) {
444 CDEBUG(D_OTHER, "compat function succeded, next.\n");
447 if (lockmode_compat(child->l_granted_mode, lock->l_req_mode)) {
448 CDEBUG(D_OTHER, "lock modes are compatible, next.\n");
454 if (send_cbs && child->l_blocking_ast != NULL) {
455 CDEBUG(D_OTHER, "lock %p incompatible; sending "
456 "blocking AST.\n", child);
457 ldlm_add_ast_work_item(child, lock);
464 static int ldlm_lock_compat(struct ldlm_lock *lock, int send_cbs)
469 l_lock(&lock->l_resource->lr_namespace->ns_lock);
470 rc = ldlm_lock_compat_list(lock, send_cbs,
471 &lock->l_resource->lr_granted);
472 /* FIXME: should we be sending ASTs to converting? */
474 rc = ldlm_lock_compat_list
475 (lock, send_cbs, &lock->l_resource->lr_converting);
477 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
482 - ldlm_handle_enqueuque - resource
484 void ldlm_grant_lock(struct ldlm_lock *lock)
486 struct ldlm_resource *res = lock->l_resource;
489 l_lock(&lock->l_resource->lr_namespace->ns_lock);
490 ldlm_resource_add_lock(res, &res->lr_granted, lock);
491 lock->l_granted_mode = lock->l_req_mode;
493 if (lock->l_granted_mode < res->lr_most_restr)
494 res->lr_most_restr = lock->l_granted_mode;
496 if (lock->l_completion_ast) {
497 ldlm_add_ast_work_item(lock, NULL);
499 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
503 /* returns a referenced lock or NULL */
504 static struct ldlm_lock *search_queue(struct list_head *queue, ldlm_mode_t mode,
505 struct ldlm_extent *extent)
507 struct ldlm_lock *lock;
508 struct list_head *tmp;
510 list_for_each(tmp, queue) {
511 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
513 if (lock->l_flags & (LDLM_FL_CBPENDING | LDLM_FL_DESTROYED))
516 /* lock_convert() takes the resource lock, so we're sure that
517 * req_mode, lr_type, and l_cookie won't change beneath us */
518 if (lock->l_req_mode != mode)
521 if (lock->l_resource->lr_type == LDLM_EXTENT &&
522 (lock->l_extent.start > extent->start ||
523 lock->l_extent.end < extent->end))
526 ldlm_lock_addref_internal(lock, mode);
533 /* Must be called with no resource or lock locks held.
535 * Returns 1 if it finds an already-existing lock that is compatible; in this
536 * case, lockh is filled in with a addref()ed lock
538 int ldlm_lock_match(struct ldlm_namespace *ns, __u64 * res_id, __u32 type,
539 void *cookie, int cookielen, ldlm_mode_t mode,
540 struct lustre_handle *lockh)
542 struct ldlm_resource *res;
543 struct ldlm_lock *lock;
547 res = ldlm_resource_get(ns, NULL, res_id, type, 0);
551 ns = res->lr_namespace;
552 l_lock(&ns->ns_lock);
554 if ((lock = search_queue(&res->lr_granted, mode, cookie)))
556 if ((lock = search_queue(&res->lr_converting, mode, cookie)))
558 if ((lock = search_queue(&res->lr_waiting, mode, cookie)))
563 ldlm_resource_put(res);
564 l_unlock(&ns->ns_lock);
567 ldlm_lock2handle(lock, lockh);
568 if (lock->l_completion_ast)
569 lock->l_completion_ast(lock, LDLM_FL_WAIT_NOREPROC);
572 LDLM_DEBUG(lock, "matched");
574 LDLM_DEBUG_NOLOCK("not matched");
578 /* Returns a referenced lock */
579 struct ldlm_lock *ldlm_lock_create(struct ldlm_namespace *ns,
580 struct lustre_handle *parent_lock_handle,
581 __u64 * res_id, __u32 type,
582 ldlm_mode_t mode, void *data, __u32 data_len)
584 struct ldlm_resource *res, *parent_res = NULL;
585 struct ldlm_lock *lock, *parent_lock;
587 parent_lock = ldlm_handle2lock(parent_lock_handle);
589 parent_res = parent_lock->l_resource;
591 res = ldlm_resource_get(ns, parent_res, res_id, type, 1);
595 lock = ldlm_lock_new(parent_lock, res);
597 ldlm_resource_put(res);
601 lock->l_req_mode = mode;
603 lock->l_data_len = data_len;
608 /* Must be called with lock->l_lock and lock->l_resource->lr_lock not held */
609 ldlm_error_t ldlm_lock_enqueue(struct ldlm_lock * lock,
610 void *cookie, int cookie_len,
612 ldlm_completion_callback completion,
613 ldlm_blocking_callback blocking)
615 struct ldlm_resource *res;
617 ldlm_res_policy policy;
620 res = lock->l_resource;
621 lock->l_blocking_ast = blocking;
623 if (res->lr_type == LDLM_EXTENT)
624 memcpy(&lock->l_extent, cookie, sizeof(lock->l_extent));
626 /* policies are not executed on the client */
627 local = res->lr_namespace->ns_client;
628 if (!local && (policy = ldlm_res_policy_table[res->lr_type])) {
630 rc = policy(lock, cookie, lock->l_req_mode, NULL);
632 if (rc == ELDLM_LOCK_CHANGED) {
633 res = lock->l_resource;
634 *flags |= LDLM_FL_LOCK_CHANGED;
635 } else if (rc == ELDLM_LOCK_ABORTED) {
636 ldlm_lock_destroy(lock);
641 lock->l_cookie = cookie;
642 lock->l_cookie_len = cookie_len;
644 if (local && lock->l_req_mode == lock->l_granted_mode) {
645 /* The server returned a blocked lock, but it was granted before
646 * we got a chance to actually enqueue it. We don't need to do
648 *flags &= ~(LDLM_FL_BLOCK_GRANTED |
649 LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_WAIT);
653 /* This distinction between local lock trees is very important; a client
654 * namespace only has information about locks taken by that client, and
655 * thus doesn't have enough information to decide for itself if it can
656 * be granted (below). In this case, we do exactly what the server
657 * tells us to do, as dictated by the 'flags' */
658 ldlm_resource_unlink_lock(lock);
660 if (*flags & LDLM_FL_BLOCK_CONV)
661 ldlm_resource_add_lock(res, res->lr_converting.prev,
663 else if (*flags & (LDLM_FL_BLOCK_WAIT | LDLM_FL_BLOCK_GRANTED))
664 ldlm_resource_add_lock(res, res->lr_waiting.prev, lock);
666 ldlm_grant_lock(lock);
670 /* FIXME: We may want to optimize by checking lr_most_restr */
671 if (!list_empty(&res->lr_converting)) {
672 ldlm_resource_add_lock(res, res->lr_waiting.prev, lock);
673 *flags |= LDLM_FL_BLOCK_CONV;
676 if (!list_empty(&res->lr_waiting)) {
677 ldlm_resource_add_lock(res, res->lr_waiting.prev, lock);
678 *flags |= LDLM_FL_BLOCK_WAIT;
681 if (!ldlm_lock_compat(lock, 0)) {
682 ldlm_resource_add_lock(res, res->lr_waiting.prev, lock);
683 *flags |= LDLM_FL_BLOCK_GRANTED;
687 ldlm_grant_lock(lock);
690 /* Don't set 'completion_ast' until here so that if the lock is granted
691 * immediately we don't do an unnecessary completion call. */
692 lock->l_completion_ast = completion;
696 /* Must be called with namespace taken: queue is waiting or converting. */
697 static int ldlm_reprocess_queue(struct ldlm_resource *res,
698 struct list_head *queue)
700 struct list_head *tmp, *pos;
703 list_for_each_safe(tmp, pos, queue) {
704 struct ldlm_lock *pending;
705 pending = list_entry(tmp, struct ldlm_lock, l_res_link);
707 CDEBUG(D_INFO, "Reprocessing lock %p\n", pending);
709 if (!ldlm_lock_compat(pending, 1))
712 list_del_init(&pending->l_res_link);
713 ldlm_grant_lock(pending);
719 void ldlm_run_ast_work(struct list_head *rpc_list)
721 struct list_head *tmp, *pos;
725 list_for_each_safe(tmp, pos, rpc_list) {
726 struct ldlm_ast_work *w =
727 list_entry(tmp, struct ldlm_ast_work, w_list);
730 rc = w->w_lock->l_blocking_ast
731 (w->w_lock, &w->w_desc, w->w_data,
734 rc = w->w_lock->l_completion_ast(w->w_lock, w->w_flags);
736 CERROR("Failed AST - should clean & disconnect "
738 LDLM_LOCK_PUT(w->w_lock);
739 list_del(&w->w_list);
740 OBD_FREE(w, sizeof(*w));
745 /* Must be called with resource->lr_lock not taken. */
746 void ldlm_reprocess_all(struct ldlm_resource *res)
748 struct list_head rpc_list = LIST_HEAD_INIT(rpc_list);
751 /* Local lock trees don't get reprocessed. */
752 if (res->lr_namespace->ns_client) {
757 l_lock(&res->lr_namespace->ns_lock);
758 res->lr_tmp = &rpc_list;
760 ldlm_reprocess_queue(res, &res->lr_converting);
761 if (list_empty(&res->lr_converting))
762 ldlm_reprocess_queue(res, &res->lr_waiting);
765 l_unlock(&res->lr_namespace->ns_lock);
767 ldlm_run_ast_work(&rpc_list);
771 void ldlm_lock_cancel(struct ldlm_lock *lock)
773 struct ldlm_resource *res;
774 struct ldlm_namespace *ns;
777 res = lock->l_resource;
778 ns = res->lr_namespace;
780 l_lock(&ns->ns_lock);
781 if (lock->l_readers || lock->l_writers)
782 CDEBUG(D_INFO, "lock still has references (%d readers, %d "
783 "writers)\n", lock->l_readers, lock->l_writers);
785 ldlm_resource_unlink_lock(lock);
786 ldlm_lock_destroy(lock);
787 l_unlock(&ns->ns_lock);
791 struct ldlm_resource *ldlm_lock_convert(struct ldlm_lock *lock, int new_mode,
794 struct list_head rpc_list = LIST_HEAD_INIT(rpc_list);
795 struct ldlm_resource *res;
796 struct ldlm_namespace *ns;
800 res = lock->l_resource;
801 ns = res->lr_namespace;
803 l_lock(&ns->ns_lock);
805 lock->l_req_mode = new_mode;
806 ldlm_resource_unlink_lock(lock);
808 /* If this is a local resource, put it on the appropriate list. */
809 if (res->lr_namespace->ns_client) {
810 if (*flags & (LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_GRANTED))
811 ldlm_resource_add_lock(res, res->lr_converting.prev,
814 res->lr_tmp = &rpc_list;
815 ldlm_grant_lock(lock);
818 /* FIXME: completion handling not with ns_lock held ! */
819 if (lock->l_completion_ast)
820 lock->l_completion_ast(lock, 0);
823 list_add_tail(&lock->l_res_link, &res->lr_converting);
825 l_unlock(&ns->ns_lock);
828 ldlm_run_ast_work(&rpc_list);
832 void ldlm_lock_dump(struct ldlm_lock *lock)
836 if (!(portal_debug & D_OTHER))
839 if (RES_VERSION_SIZE != 4)
843 CDEBUG(D_OTHER, " NULL LDLM lock\n");
847 snprintf(ver, sizeof(ver), "%x %x %x %x",
848 lock->l_version[0], lock->l_version[1],
849 lock->l_version[2], lock->l_version[3]);
851 CDEBUG(D_OTHER, " -- Lock dump: %p (%s)\n", lock, ver);
852 if (lock->l_export && lock->l_export->exp_connection)
853 CDEBUG(D_OTHER, " Node: NID %x (rhandle: %Lx)\n",
854 lock->l_export->exp_connection->c_peer.peer_nid,
855 lock->l_remote_handle.addr);
857 CDEBUG(D_OTHER, " Node: local\n");
858 CDEBUG(D_OTHER, " Parent: %p\n", lock->l_parent);
859 CDEBUG(D_OTHER, " Resource: %p (%Ld)\n", lock->l_resource,
860 lock->l_resource->lr_name[0]);
861 CDEBUG(D_OTHER, " Requested mode: %d, granted mode: %d\n",
862 (int)lock->l_req_mode, (int)lock->l_granted_mode);
863 CDEBUG(D_OTHER, " Readers: %u ; Writers; %u\n",
864 lock->l_readers, lock->l_writers);
865 if (lock->l_resource->lr_type == LDLM_EXTENT)
866 CDEBUG(D_OTHER, " Extent: %Lu -> %Lu\n",
867 (unsigned long long)lock->l_extent.start,
868 (unsigned long long)lock->l_extent.end);