Whamcloud - gitweb
LU-2906 ldlm: use accessor macros for l_flags
[fs/lustre-release.git] / lustre / ldlm / ldlm_lock.c
1 /*
2  * GPL HEADER START
3  *
4  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
5  *
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.
9  *
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).
15  *
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
19  *
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
22  * have any questions.
23  *
24  * GPL HEADER END
25  */
26 /*
27  * Copyright (c) 2002, 2010, Oracle and/or its affiliates. All rights reserved.
28  * Use is subject to license terms.
29  *
30  * Copyright (c) 2010, 2013, Intel Corporation.
31  */
32 /*
33  * This file is part of Lustre, http://www.lustre.org/
34  * Lustre is a trademark of Sun Microsystems, Inc.
35  *
36  * lustre/ldlm/ldlm_lock.c
37  *
38  * Author: Peter Braam <braam@clusterfs.com>
39  * Author: Phil Schwan <phil@clusterfs.com>
40  */
41
42 #define DEBUG_SUBSYSTEM S_LDLM
43
44 #ifdef __KERNEL__
45 # include <libcfs/libcfs.h>
46 # include <linux/lustre_intent.h>
47 #else
48 # include <liblustre.h>
49 #endif
50
51 #include <obd_class.h>
52 #include "ldlm_internal.h"
53
54 /* lock types */
55 char *ldlm_lockname[] = {
56         [0] "--",
57         [LCK_EX] "EX",
58         [LCK_PW] "PW",
59         [LCK_PR] "PR",
60         [LCK_CW] "CW",
61         [LCK_CR] "CR",
62         [LCK_NL] "NL",
63         [LCK_GROUP] "GROUP",
64         [LCK_COS] "COS"
65 };
66 EXPORT_SYMBOL(ldlm_lockname);
67
68 char *ldlm_typename[] = {
69         [LDLM_PLAIN] "PLN",
70         [LDLM_EXTENT] "EXT",
71         [LDLM_FLOCK] "FLK",
72         [LDLM_IBITS] "IBT",
73 };
74 EXPORT_SYMBOL(ldlm_typename);
75
76 static ldlm_policy_wire_to_local_t ldlm_policy_wire18_to_local[] = {
77         [LDLM_PLAIN - LDLM_MIN_TYPE] ldlm_plain_policy_wire_to_local,
78         [LDLM_EXTENT - LDLM_MIN_TYPE] ldlm_extent_policy_wire_to_local,
79         [LDLM_FLOCK - LDLM_MIN_TYPE] ldlm_flock_policy_wire18_to_local,
80         [LDLM_IBITS - LDLM_MIN_TYPE] ldlm_ibits_policy_wire_to_local,
81 };
82
83 static ldlm_policy_wire_to_local_t ldlm_policy_wire21_to_local[] = {
84         [LDLM_PLAIN - LDLM_MIN_TYPE] ldlm_plain_policy_wire_to_local,
85         [LDLM_EXTENT - LDLM_MIN_TYPE] ldlm_extent_policy_wire_to_local,
86         [LDLM_FLOCK - LDLM_MIN_TYPE] ldlm_flock_policy_wire21_to_local,
87         [LDLM_IBITS - LDLM_MIN_TYPE] ldlm_ibits_policy_wire_to_local,
88 };
89
90 static ldlm_policy_local_to_wire_t ldlm_policy_local_to_wire[] = {
91         [LDLM_PLAIN - LDLM_MIN_TYPE] ldlm_plain_policy_local_to_wire,
92         [LDLM_EXTENT - LDLM_MIN_TYPE] ldlm_extent_policy_local_to_wire,
93         [LDLM_FLOCK - LDLM_MIN_TYPE] ldlm_flock_policy_local_to_wire,
94         [LDLM_IBITS - LDLM_MIN_TYPE] ldlm_ibits_policy_local_to_wire,
95 };
96
97 /**
98  * Converts lock policy from local format to on the wire lock_desc format
99  */
100 void ldlm_convert_policy_to_wire(ldlm_type_t type,
101                                  const ldlm_policy_data_t *lpolicy,
102                                  ldlm_wire_policy_data_t *wpolicy)
103 {
104         ldlm_policy_local_to_wire_t convert;
105
106         convert = ldlm_policy_local_to_wire[type - LDLM_MIN_TYPE];
107
108         convert(lpolicy, wpolicy);
109 }
110
111 /**
112  * Converts lock policy from on the wire lock_desc format to local format
113  */
114 void ldlm_convert_policy_to_local(struct obd_export *exp, ldlm_type_t type,
115                                   const ldlm_wire_policy_data_t *wpolicy,
116                                   ldlm_policy_data_t *lpolicy)
117 {
118         ldlm_policy_wire_to_local_t convert;
119         int new_client;
120
121         /** some badness for 2.0.0 clients, but 2.0.0 isn't supported */
122         new_client = (exp_connect_flags(exp) & OBD_CONNECT_FULL20) != 0;
123         if (new_client)
124                 convert = ldlm_policy_wire21_to_local[type - LDLM_MIN_TYPE];
125         else
126                 convert = ldlm_policy_wire18_to_local[type - LDLM_MIN_TYPE];
127
128         convert(wpolicy, lpolicy);
129 }
130
131 char *ldlm_it2str(int it)
132 {
133         switch (it) {
134         case IT_OPEN:
135                 return "open";
136         case IT_CREAT:
137                 return "creat";
138         case (IT_OPEN | IT_CREAT):
139                 return "open|creat";
140         case IT_READDIR:
141                 return "readdir";
142         case IT_GETATTR:
143                 return "getattr";
144         case IT_LOOKUP:
145                 return "lookup";
146         case IT_UNLINK:
147                 return "unlink";
148         case IT_GETXATTR:
149                 return "getxattr";
150         case IT_LAYOUT:
151                 return "layout";
152         default:
153                 CERROR("Unknown intent %d\n", it);
154                 return "UNKNOWN";
155         }
156 }
157 EXPORT_SYMBOL(ldlm_it2str);
158
159 extern struct kmem_cache *ldlm_lock_slab;
160
161 #ifdef HAVE_SERVER_SUPPORT
162 static ldlm_processing_policy ldlm_processing_policy_table[] = {
163         [LDLM_PLAIN] ldlm_process_plain_lock,
164         [LDLM_EXTENT] ldlm_process_extent_lock,
165 # ifdef __KERNEL__
166         [LDLM_FLOCK] ldlm_process_flock_lock,
167 # endif
168         [LDLM_IBITS] ldlm_process_inodebits_lock,
169 };
170
171 ldlm_processing_policy ldlm_get_processing_policy(struct ldlm_resource *res)
172 {
173         return ldlm_processing_policy_table[res->lr_type];
174 }
175 EXPORT_SYMBOL(ldlm_get_processing_policy);
176 #endif /* HAVE_SERVER_SUPPORT */
177
178 void ldlm_register_intent(struct ldlm_namespace *ns, ldlm_res_policy arg)
179 {
180         ns->ns_policy = arg;
181 }
182 EXPORT_SYMBOL(ldlm_register_intent);
183
184 /*
185  * REFCOUNTED LOCK OBJECTS
186  */
187
188
189 /**
190  * Get a reference on a lock.
191  *
192  * Lock refcounts, during creation:
193  *   - one special one for allocation, dec'd only once in destroy
194  *   - one for being a lock that's in-use
195  *   - one for the addref associated with a new lock
196  */
197 struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock)
198 {
199         cfs_atomic_inc(&lock->l_refc);
200         return lock;
201 }
202 EXPORT_SYMBOL(ldlm_lock_get);
203
204 /**
205  * Release lock reference.
206  *
207  * Also frees the lock if it was last reference.
208  */
209 void ldlm_lock_put(struct ldlm_lock *lock)
210 {
211         ENTRY;
212
213         LASSERT(lock->l_resource != LP_POISON);
214         LASSERT(cfs_atomic_read(&lock->l_refc) > 0);
215         if (cfs_atomic_dec_and_test(&lock->l_refc)) {
216                 struct ldlm_resource *res;
217
218                 LDLM_DEBUG(lock,
219                            "final lock_put on destroyed lock, freeing it.");
220
221                 res = lock->l_resource;
222                 LASSERT(ldlm_is_destroyed(lock));
223                 LASSERT(cfs_list_empty(&lock->l_res_link));
224                 LASSERT(cfs_list_empty(&lock->l_pending_chain));
225
226                 lprocfs_counter_decr(ldlm_res_to_ns(res)->ns_stats,
227                                      LDLM_NSS_LOCKS);
228                 lu_ref_del(&res->lr_reference, "lock", lock);
229                 ldlm_resource_putref(res);
230                 lock->l_resource = NULL;
231                 if (lock->l_export) {
232                         class_export_lock_put(lock->l_export, lock);
233                         lock->l_export = NULL;
234                 }
235
236                 if (lock->l_lvb_data != NULL)
237                         OBD_FREE(lock->l_lvb_data, lock->l_lvb_len);
238
239                 ldlm_interval_free(ldlm_interval_detach(lock));
240                 lu_ref_fini(&lock->l_reference);
241                 OBD_FREE_RCU(lock, sizeof(*lock), &lock->l_handle);
242         }
243
244         EXIT;
245 }
246 EXPORT_SYMBOL(ldlm_lock_put);
247
248 /**
249  * Removes LDLM lock \a lock from LRU. Assumes LRU is already locked.
250  */
251 int ldlm_lock_remove_from_lru_nolock(struct ldlm_lock *lock)
252 {
253         int rc = 0;
254         if (!cfs_list_empty(&lock->l_lru)) {
255                 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
256
257                 LASSERT(lock->l_resource->lr_type != LDLM_FLOCK);
258                 cfs_list_del_init(&lock->l_lru);
259                 ldlm_clear_skipped(lock);
260                 LASSERT(ns->ns_nr_unused > 0);
261                 ns->ns_nr_unused--;
262                 rc = 1;
263         }
264         return rc;
265 }
266
267 /**
268  * Removes LDLM lock \a lock from LRU. Obtains the LRU lock first.
269  */
270 int ldlm_lock_remove_from_lru(struct ldlm_lock *lock)
271 {
272         struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
273         int rc;
274
275         ENTRY;
276         if (ldlm_is_ns_srv(lock)) {
277                 LASSERT(cfs_list_empty(&lock->l_lru));
278                 RETURN(0);
279         }
280
281         spin_lock(&ns->ns_lock);
282         rc = ldlm_lock_remove_from_lru_nolock(lock);
283         spin_unlock(&ns->ns_lock);
284         EXIT;
285         return rc;
286 }
287
288 /**
289  * Adds LDLM lock \a lock to namespace LRU. Assumes LRU is already locked.
290  */
291 void ldlm_lock_add_to_lru_nolock(struct ldlm_lock *lock)
292 {
293         struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
294
295         lock->l_last_used = cfs_time_current();
296         LASSERT(cfs_list_empty(&lock->l_lru));
297         LASSERT(lock->l_resource->lr_type != LDLM_FLOCK);
298         cfs_list_add_tail(&lock->l_lru, &ns->ns_unused_list);
299         LASSERT(ns->ns_nr_unused >= 0);
300         ns->ns_nr_unused++;
301 }
302
303 /**
304  * Adds LDLM lock \a lock to namespace LRU. Obtains necessary LRU locks
305  * first.
306  */
307 void ldlm_lock_add_to_lru(struct ldlm_lock *lock)
308 {
309         struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
310
311         ENTRY;
312         spin_lock(&ns->ns_lock);
313         ldlm_lock_add_to_lru_nolock(lock);
314         spin_unlock(&ns->ns_lock);
315         EXIT;
316 }
317
318 /**
319  * Moves LDLM lock \a lock that is already in namespace LRU to the tail of
320  * the LRU. Performs necessary LRU locking
321  */
322 void ldlm_lock_touch_in_lru(struct ldlm_lock *lock)
323 {
324         struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
325
326         ENTRY;
327         if (ldlm_is_ns_srv(lock)) {
328                 LASSERT(cfs_list_empty(&lock->l_lru));
329                 EXIT;
330                 return;
331         }
332
333         spin_lock(&ns->ns_lock);
334         if (!cfs_list_empty(&lock->l_lru)) {
335                 ldlm_lock_remove_from_lru_nolock(lock);
336                 ldlm_lock_add_to_lru_nolock(lock);
337         }
338         spin_unlock(&ns->ns_lock);
339         EXIT;
340 }
341
342 /**
343  * Helper to destroy a locked lock.
344  *
345  * Used by ldlm_lock_destroy and ldlm_lock_destroy_nolock
346  * Must be called with l_lock and lr_lock held.
347  *
348  * Does not actually free the lock data, but rather marks the lock as
349  * destroyed by setting l_destroyed field in the lock to 1.  Destroys a
350  * handle->lock association too, so that the lock can no longer be found
351  * and removes the lock from LRU list.  Actual lock freeing occurs when
352  * last lock reference goes away.
353  *
354  * Original comment (of some historical value):
355  * This used to have a 'strict' flag, which recovery would use to mark an
356  * in-use lock as needing-to-die.  Lest I am ever tempted to put it back, I
357  * shall explain why it's gone: with the new hash table scheme, once you call
358  * ldlm_lock_destroy, you can never drop your final references on this lock.
359  * Because it's not in the hash table anymore.  -phil
360  */
361 int ldlm_lock_destroy_internal(struct ldlm_lock *lock)
362 {
363         ENTRY;
364
365         if (lock->l_readers || lock->l_writers) {
366                 LDLM_ERROR(lock, "lock still has references");
367                 LBUG();
368         }
369
370         if (!cfs_list_empty(&lock->l_res_link)) {
371                 LDLM_ERROR(lock, "lock still on resource");
372                 LBUG();
373         }
374
375         if (ldlm_is_destroyed(lock)) {
376                 LASSERT(cfs_list_empty(&lock->l_lru));
377                 EXIT;
378                 return 0;
379         }
380         ldlm_set_destroyed(lock);
381
382         if (lock->l_export && lock->l_export->exp_lock_hash) {
383                 /* NB: it's safe to call cfs_hash_del() even lock isn't
384                  * in exp_lock_hash. */
385                 /* In the function below, .hs_keycmp resolves to
386                  * ldlm_export_lock_keycmp() */
387                 /* coverity[overrun-buffer-val] */
388                 cfs_hash_del(lock->l_export->exp_lock_hash,
389                              &lock->l_remote_handle, &lock->l_exp_hash);
390         }
391
392         ldlm_lock_remove_from_lru(lock);
393         class_handle_unhash(&lock->l_handle);
394
395 #if 0
396         /* Wake anyone waiting for this lock */
397         /* FIXME: I should probably add yet another flag, instead of using
398          * l_export to only call this on clients */
399         if (lock->l_export)
400                 class_export_put(lock->l_export);
401         lock->l_export = NULL;
402         if (lock->l_export && lock->l_completion_ast)
403                 lock->l_completion_ast(lock, 0);
404 #endif
405         EXIT;
406         return 1;
407 }
408
409 /**
410  * Destroys a LDLM lock \a lock. Performs necessary locking first.
411  */
412 void ldlm_lock_destroy(struct ldlm_lock *lock)
413 {
414         int first;
415         ENTRY;
416         lock_res_and_lock(lock);
417         first = ldlm_lock_destroy_internal(lock);
418         unlock_res_and_lock(lock);
419
420         /* drop reference from hashtable only for first destroy */
421         if (first) {
422                 lu_ref_del(&lock->l_reference, "hash", lock);
423                 LDLM_LOCK_RELEASE(lock);
424         }
425         EXIT;
426 }
427
428 /**
429  * Destroys a LDLM lock \a lock that is already locked.
430  */
431 void ldlm_lock_destroy_nolock(struct ldlm_lock *lock)
432 {
433         int first;
434         ENTRY;
435         first = ldlm_lock_destroy_internal(lock);
436         /* drop reference from hashtable only for first destroy */
437         if (first) {
438                 lu_ref_del(&lock->l_reference, "hash", lock);
439                 LDLM_LOCK_RELEASE(lock);
440         }
441         EXIT;
442 }
443
444 /* this is called by portals_handle2object with the handle lock taken */
445 static void lock_handle_addref(void *lock)
446 {
447         LDLM_LOCK_GET((struct ldlm_lock *)lock);
448 }
449
450 static void lock_handle_free(void *lock, int size)
451 {
452         LASSERT(size == sizeof(struct ldlm_lock));
453         OBD_SLAB_FREE(lock, ldlm_lock_slab, size);
454 }
455
456 struct portals_handle_ops lock_handle_ops = {
457         .hop_addref = lock_handle_addref,
458         .hop_free   = lock_handle_free,
459 };
460
461 /**
462  *
463  * Allocate and initialize new lock structure.
464  *
465  * usage: pass in a resource on which you have done ldlm_resource_get
466  *        new lock will take over the refcount.
467  * returns: lock with refcount 2 - one for current caller and one for remote
468  */
469 static struct ldlm_lock *ldlm_lock_new(struct ldlm_resource *resource)
470 {
471         struct ldlm_lock *lock;
472         ENTRY;
473
474         if (resource == NULL)
475                 LBUG();
476
477         OBD_SLAB_ALLOC_PTR_GFP(lock, ldlm_lock_slab, __GFP_IO);
478         if (lock == NULL)
479                 RETURN(NULL);
480
481         spin_lock_init(&lock->l_lock);
482         lock->l_resource = resource;
483         lu_ref_add(&resource->lr_reference, "lock", lock);
484
485         cfs_atomic_set(&lock->l_refc, 2);
486         CFS_INIT_LIST_HEAD(&lock->l_res_link);
487         CFS_INIT_LIST_HEAD(&lock->l_lru);
488         CFS_INIT_LIST_HEAD(&lock->l_pending_chain);
489         CFS_INIT_LIST_HEAD(&lock->l_bl_ast);
490         CFS_INIT_LIST_HEAD(&lock->l_cp_ast);
491         CFS_INIT_LIST_HEAD(&lock->l_rk_ast);
492         init_waitqueue_head(&lock->l_waitq);
493         lock->l_blocking_lock = NULL;
494         CFS_INIT_LIST_HEAD(&lock->l_sl_mode);
495         CFS_INIT_LIST_HEAD(&lock->l_sl_policy);
496         CFS_INIT_HLIST_NODE(&lock->l_exp_hash);
497         CFS_INIT_HLIST_NODE(&lock->l_exp_flock_hash);
498
499         lprocfs_counter_incr(ldlm_res_to_ns(resource)->ns_stats,
500                              LDLM_NSS_LOCKS);
501         CFS_INIT_LIST_HEAD(&lock->l_handle.h_link);
502         class_handle_hash(&lock->l_handle, &lock_handle_ops);
503
504         lu_ref_init(&lock->l_reference);
505         lu_ref_add(&lock->l_reference, "hash", lock);
506         lock->l_callback_timeout = 0;
507
508 #if LUSTRE_TRACKS_LOCK_EXP_REFS
509         CFS_INIT_LIST_HEAD(&lock->l_exp_refs_link);
510         lock->l_exp_refs_nr = 0;
511         lock->l_exp_refs_target = NULL;
512 #endif
513         CFS_INIT_LIST_HEAD(&lock->l_exp_list);
514
515         RETURN(lock);
516 }
517
518 /**
519  * Moves LDLM lock \a lock to another resource.
520  * This is used on client when server returns some other lock than requested
521  * (typically as a result of intent operation)
522  */
523 int ldlm_lock_change_resource(struct ldlm_namespace *ns, struct ldlm_lock *lock,
524                               const struct ldlm_res_id *new_resid)
525 {
526         struct ldlm_resource *oldres = lock->l_resource;
527         struct ldlm_resource *newres;
528         int type;
529         ENTRY;
530
531         LASSERT(ns_is_client(ns));
532
533         lock_res_and_lock(lock);
534         if (memcmp(new_resid, &lock->l_resource->lr_name,
535                    sizeof(lock->l_resource->lr_name)) == 0) {
536                 /* Nothing to do */
537                 unlock_res_and_lock(lock);
538                 RETURN(0);
539         }
540
541         LASSERT(new_resid->name[0] != 0);
542
543         /* This function assumes that the lock isn't on any lists */
544         LASSERT(cfs_list_empty(&lock->l_res_link));
545
546         type = oldres->lr_type;
547         unlock_res_and_lock(lock);
548
549         newres = ldlm_resource_get(ns, NULL, new_resid, type, 1);
550         if (newres == NULL)
551                 RETURN(-ENOMEM);
552
553         lu_ref_add(&newres->lr_reference, "lock", lock);
554         /*
555          * To flip the lock from the old to the new resource, lock, oldres and
556          * newres have to be locked. Resource spin-locks are nested within
557          * lock->l_lock, and are taken in the memory address order to avoid
558          * dead-locks.
559          */
560         spin_lock(&lock->l_lock);
561         oldres = lock->l_resource;
562         if (oldres < newres) {
563                 lock_res(oldres);
564                 lock_res_nested(newres, LRT_NEW);
565         } else {
566                 lock_res(newres);
567                 lock_res_nested(oldres, LRT_NEW);
568         }
569         LASSERT(memcmp(new_resid, &oldres->lr_name,
570                        sizeof oldres->lr_name) != 0);
571         lock->l_resource = newres;
572         unlock_res(oldres);
573         unlock_res_and_lock(lock);
574
575         /* ...and the flowers are still standing! */
576         lu_ref_del(&oldres->lr_reference, "lock", lock);
577         ldlm_resource_putref(oldres);
578
579         RETURN(0);
580 }
581 EXPORT_SYMBOL(ldlm_lock_change_resource);
582
583 /** \defgroup ldlm_handles LDLM HANDLES
584  * Ways to get hold of locks without any addresses.
585  * @{
586  */
587
588 /**
589  * Fills in handle for LDLM lock \a lock into supplied \a lockh
590  * Does not take any references.
591  */
592 void ldlm_lock2handle(const struct ldlm_lock *lock, struct lustre_handle *lockh)
593 {
594         lockh->cookie = lock->l_handle.h_cookie;
595 }
596 EXPORT_SYMBOL(ldlm_lock2handle);
597
598 /**
599  * Obtain a lock reference by handle.
600  *
601  * if \a flags: atomically get the lock and set the flags.
602  *              Return NULL if flag already set
603  */
604 struct ldlm_lock *__ldlm_handle2lock(const struct lustre_handle *handle,
605                                      __u64 flags)
606 {
607         struct ldlm_lock *lock;
608         ENTRY;
609
610         LASSERT(handle);
611
612         lock = class_handle2object(handle->cookie, NULL);
613         if (lock == NULL)
614                 RETURN(NULL);
615
616         /* It's unlikely but possible that someone marked the lock as
617          * destroyed after we did handle2object on it */
618         if ((flags == 0) && !ldlm_is_destroyed(lock)) {
619                 lu_ref_add(&lock->l_reference, "handle", current);
620                 RETURN(lock);
621         }
622
623         lock_res_and_lock(lock);
624
625         LASSERT(lock->l_resource != NULL);
626
627         lu_ref_add_atomic(&lock->l_reference, "handle", current);
628         if (unlikely(ldlm_is_destroyed(lock))) {
629                 unlock_res_and_lock(lock);
630                 CDEBUG(D_INFO, "lock already destroyed: lock %p\n", lock);
631                 LDLM_LOCK_PUT(lock);
632                 RETURN(NULL);
633         }
634
635         /* If we're setting flags, make sure none of them are already set. */
636         if (flags != 0) {
637                 if ((lock->l_flags & flags) != 0) {
638                         unlock_res_and_lock(lock);
639                         LDLM_LOCK_PUT(lock);
640                         RETURN(NULL);
641                 }
642
643                 lock->l_flags |= flags;
644         }
645
646         unlock_res_and_lock(lock);
647         RETURN(lock);
648 }
649 EXPORT_SYMBOL(__ldlm_handle2lock);
650 /** @} ldlm_handles */
651
652 /**
653  * Fill in "on the wire" representation for given LDLM lock into supplied
654  * lock descriptor \a desc structure.
655  */
656 void ldlm_lock2desc(struct ldlm_lock *lock, struct ldlm_lock_desc *desc)
657 {
658         struct obd_export *exp = lock->l_export ?: lock->l_conn_export;
659
660         /* INODEBITS_INTEROP: If the other side does not support
661          * inodebits, reply with a plain lock descriptor. */
662         if ((lock->l_resource->lr_type == LDLM_IBITS) &&
663             (exp && !(exp_connect_flags(exp) & OBD_CONNECT_IBITS))) {
664                 /* Make sure all the right bits are set in this lock we
665                    are going to pass to client */
666                 LASSERTF(lock->l_policy_data.l_inodebits.bits ==
667                          (MDS_INODELOCK_LOOKUP | MDS_INODELOCK_UPDATE |
668                           MDS_INODELOCK_LAYOUT),
669                          "Inappropriate inode lock bits during "
670                          "conversion " LPU64 "\n",
671                          lock->l_policy_data.l_inodebits.bits);
672
673                 ldlm_res2desc(lock->l_resource, &desc->l_resource);
674                 desc->l_resource.lr_type = LDLM_PLAIN;
675
676                 /* Convert "new" lock mode to something old client can
677                    understand */
678                 if ((lock->l_req_mode == LCK_CR) ||
679                     (lock->l_req_mode == LCK_CW))
680                         desc->l_req_mode = LCK_PR;
681                 else
682                         desc->l_req_mode = lock->l_req_mode;
683                 if ((lock->l_granted_mode == LCK_CR) ||
684                     (lock->l_granted_mode == LCK_CW)) {
685                         desc->l_granted_mode = LCK_PR;
686                 } else {
687                         /* We never grant PW/EX locks to clients */
688                         LASSERT((lock->l_granted_mode != LCK_PW) &&
689                                 (lock->l_granted_mode != LCK_EX));
690                         desc->l_granted_mode = lock->l_granted_mode;
691                 }
692
693                 /* We do not copy policy here, because there is no
694                    policy for plain locks */
695         } else {
696                 ldlm_res2desc(lock->l_resource, &desc->l_resource);
697                 desc->l_req_mode = lock->l_req_mode;
698                 desc->l_granted_mode = lock->l_granted_mode;
699                 ldlm_convert_policy_to_wire(lock->l_resource->lr_type,
700                                             &lock->l_policy_data,
701                                             &desc->l_policy_data);
702         }
703 }
704 EXPORT_SYMBOL(ldlm_lock2desc);
705
706 /**
707  * Add a lock to list of conflicting locks to send AST to.
708  *
709  * Only add if we have not sent a blocking AST to the lock yet.
710  */
711 void ldlm_add_bl_work_item(struct ldlm_lock *lock, struct ldlm_lock *new,
712                            cfs_list_t *work_list)
713 {
714         if (!ldlm_is_ast_sent(lock)) {
715                 LDLM_DEBUG(lock, "lock incompatible; sending blocking AST.");
716                 ldlm_set_ast_sent(lock);
717                 /* If the enqueuing client said so, tell the AST recipient to
718                  * discard dirty data, rather than writing back. */
719                 if (ldlm_is_ast_discard_data(new))
720                         ldlm_set_discard_data(lock);
721                 LASSERT(cfs_list_empty(&lock->l_bl_ast));
722                 cfs_list_add(&lock->l_bl_ast, work_list);
723                 LDLM_LOCK_GET(lock);
724                 LASSERT(lock->l_blocking_lock == NULL);
725                 lock->l_blocking_lock = LDLM_LOCK_GET(new);
726         }
727 }
728
729 /**
730  * Add a lock to list of just granted locks to send completion AST to.
731  */
732 void ldlm_add_cp_work_item(struct ldlm_lock *lock, cfs_list_t *work_list)
733 {
734         if (!ldlm_is_cp_reqd(lock)) {
735                 ldlm_set_cp_reqd(lock);
736                 LDLM_DEBUG(lock, "lock granted; sending completion AST.");
737                 LASSERT(cfs_list_empty(&lock->l_cp_ast));
738                 cfs_list_add(&lock->l_cp_ast, work_list);
739                 LDLM_LOCK_GET(lock);
740         }
741 }
742
743 /**
744  * Aggregator function to add AST work items into a list. Determines
745  * what sort of an AST work needs to be done and calls the proper
746  * adding function.
747  * Must be called with lr_lock held.
748  */
749 void ldlm_add_ast_work_item(struct ldlm_lock *lock, struct ldlm_lock *new,
750                             cfs_list_t *work_list)
751 {
752         ENTRY;
753         check_res_locked(lock->l_resource);
754         if (new)
755                 ldlm_add_bl_work_item(lock, new, work_list);
756         else
757                 ldlm_add_cp_work_item(lock, work_list);
758         EXIT;
759 }
760
761 /**
762  * Add specified reader/writer reference to LDLM lock with handle \a lockh.
763  * r/w reference type is determined by \a mode
764  * Calls ldlm_lock_addref_internal.
765  */
766 void ldlm_lock_addref(struct lustre_handle *lockh, __u32 mode)
767 {
768         struct ldlm_lock *lock;
769
770         lock = ldlm_handle2lock(lockh);
771         LASSERT(lock != NULL);
772         ldlm_lock_addref_internal(lock, mode);
773         LDLM_LOCK_PUT(lock);
774 }
775 EXPORT_SYMBOL(ldlm_lock_addref);
776
777 /**
778  * Helper function.
779  * Add specified reader/writer reference to LDLM lock \a lock.
780  * r/w reference type is determined by \a mode
781  * Removes lock from LRU if it is there.
782  * Assumes the LDLM lock is already locked.
783  */
784 void ldlm_lock_addref_internal_nolock(struct ldlm_lock *lock, __u32 mode)
785 {
786         ldlm_lock_remove_from_lru(lock);
787         if (mode & (LCK_NL | LCK_CR | LCK_PR)) {
788                 lock->l_readers++;
789                 lu_ref_add_atomic(&lock->l_reference, "reader", lock);
790         }
791         if (mode & (LCK_EX | LCK_CW | LCK_PW | LCK_GROUP | LCK_COS)) {
792                 lock->l_writers++;
793                 lu_ref_add_atomic(&lock->l_reference, "writer", lock);
794         }
795         LDLM_LOCK_GET(lock);
796         lu_ref_add_atomic(&lock->l_reference, "user", lock);
797         LDLM_DEBUG(lock, "ldlm_lock_addref(%s)", ldlm_lockname[mode]);
798 }
799
800 /**
801  * Attempts to add reader/writer reference to a lock with handle \a lockh, and
802  * fails if lock is already LDLM_FL_CBPENDING or destroyed.
803  *
804  * \retval 0 success, lock was addref-ed
805  *
806  * \retval -EAGAIN lock is being canceled.
807  */
808 int ldlm_lock_addref_try(struct lustre_handle *lockh, __u32 mode)
809 {
810         struct ldlm_lock *lock;
811         int               result;
812
813         result = -EAGAIN;
814         lock = ldlm_handle2lock(lockh);
815         if (lock != NULL) {
816                 lock_res_and_lock(lock);
817                 if (lock->l_readers != 0 || lock->l_writers != 0 ||
818                     !ldlm_is_cbpending(lock)) {
819                         ldlm_lock_addref_internal_nolock(lock, mode);
820                         result = 0;
821                 }
822                 unlock_res_and_lock(lock);
823                 LDLM_LOCK_PUT(lock);
824         }
825         return result;
826 }
827 EXPORT_SYMBOL(ldlm_lock_addref_try);
828
829 /**
830  * Add specified reader/writer reference to LDLM lock \a lock.
831  * Locks LDLM lock and calls ldlm_lock_addref_internal_nolock to do the work.
832  * Only called for local locks.
833  */
834 void ldlm_lock_addref_internal(struct ldlm_lock *lock, __u32 mode)
835 {
836         lock_res_and_lock(lock);
837         ldlm_lock_addref_internal_nolock(lock, mode);
838         unlock_res_and_lock(lock);
839 }
840
841 /**
842  * Removes reader/writer reference for LDLM lock \a lock.
843  * Assumes LDLM lock is already locked.
844  * only called in ldlm_flock_destroy and for local locks.
845  * Does NOT add lock to LRU if no r/w references left to accomodate flock locks
846  * that cannot be placed in LRU.
847  */
848 void ldlm_lock_decref_internal_nolock(struct ldlm_lock *lock, __u32 mode)
849 {
850         LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
851         if (mode & (LCK_NL | LCK_CR | LCK_PR)) {
852                 LASSERT(lock->l_readers > 0);
853                 lu_ref_del(&lock->l_reference, "reader", lock);
854                 lock->l_readers--;
855         }
856         if (mode & (LCK_EX | LCK_CW | LCK_PW | LCK_GROUP | LCK_COS)) {
857                 LASSERT(lock->l_writers > 0);
858                 lu_ref_del(&lock->l_reference, "writer", lock);
859                 lock->l_writers--;
860         }
861
862         lu_ref_del(&lock->l_reference, "user", lock);
863         LDLM_LOCK_RELEASE(lock);    /* matches the LDLM_LOCK_GET() in addref */
864 }
865
866 /**
867  * Removes reader/writer reference for LDLM lock \a lock.
868  * Locks LDLM lock first.
869  * If the lock is determined to be client lock on a client and r/w refcount
870  * drops to zero and the lock is not blocked, the lock is added to LRU lock
871  * on the namespace.
872  * For blocked LDLM locks if r/w count drops to zero, blocking_ast is called.
873  */
874 void ldlm_lock_decref_internal(struct ldlm_lock *lock, __u32 mode)
875 {
876         struct ldlm_namespace *ns;
877         ENTRY;
878
879         lock_res_and_lock(lock);
880
881         ns = ldlm_lock_to_ns(lock);
882
883         ldlm_lock_decref_internal_nolock(lock, mode);
884
885         if (ldlm_is_local(lock) &&
886             !lock->l_readers && !lock->l_writers) {
887                 /* If this is a local lock on a server namespace and this was
888                  * the last reference, cancel the lock. */
889                 CDEBUG(D_INFO, "forcing cancel of local lock\n");
890                 ldlm_set_cbpending(lock);
891         }
892
893         if (!lock->l_readers && !lock->l_writers &&
894             ldlm_is_cbpending(lock)) {
895                 /* If we received a blocked AST and this was the last reference,
896                  * run the callback. */
897                 if (ldlm_is_ns_srv(lock) && lock->l_export)
898                         CERROR("FL_CBPENDING set on non-local lock--just a "
899                                "warning\n");
900
901                 LDLM_DEBUG(lock, "final decref done on cbpending lock");
902
903                 LDLM_LOCK_GET(lock); /* dropped by bl thread */
904                 ldlm_lock_remove_from_lru(lock);
905                 unlock_res_and_lock(lock);
906
907                 if (ldlm_is_fail_loc(lock))
908                         OBD_RACE(OBD_FAIL_LDLM_CP_BL_RACE);
909
910                 if (ldlm_is_atomic_cb(lock) ||
911                     ldlm_bl_to_thread_lock(ns, NULL, lock) != 0)
912                         ldlm_handle_bl_callback(ns, NULL, lock);
913         } else if (ns_is_client(ns) &&
914                    !lock->l_readers && !lock->l_writers &&
915                    !ldlm_is_no_lru(lock) &&
916                    !ldlm_is_bl_ast(lock)) {
917
918                 LDLM_DEBUG(lock, "add lock into lru list");
919
920                 /* If this is a client-side namespace and this was the last
921                  * reference, put it on the LRU. */
922                 ldlm_lock_add_to_lru(lock);
923                 unlock_res_and_lock(lock);
924
925                 if (ldlm_is_fail_loc(lock))
926                         OBD_RACE(OBD_FAIL_LDLM_CP_BL_RACE);
927
928                 /* Call ldlm_cancel_lru() only if EARLY_CANCEL and LRU RESIZE
929                  * are not supported by the server, otherwise, it is done on
930                  * enqueue. */
931                 if (!exp_connect_cancelset(lock->l_conn_export) &&
932                     !ns_connect_lru_resize(ns))
933                         ldlm_cancel_lru(ns, 0, LCF_ASYNC, 0);
934         } else {
935                 LDLM_DEBUG(lock, "do not add lock into lru list");
936                 unlock_res_and_lock(lock);
937         }
938
939         EXIT;
940 }
941
942 /**
943  * Decrease reader/writer refcount for LDLM lock with handle \a lockh
944  */
945 void ldlm_lock_decref(struct lustre_handle *lockh, __u32 mode)
946 {
947         struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
948         LASSERTF(lock != NULL, "Non-existing lock: "LPX64"\n", lockh->cookie);
949         ldlm_lock_decref_internal(lock, mode);
950         LDLM_LOCK_PUT(lock);
951 }
952 EXPORT_SYMBOL(ldlm_lock_decref);
953
954 /**
955  * Decrease reader/writer refcount for LDLM lock with handle
956  * \a lockh and mark it for subsequent cancellation once r/w refcount
957  * drops to zero instead of putting into LRU.
958  *
959  * Typical usage is for GROUP locks which we cannot allow to be cached.
960  */
961 void ldlm_lock_decref_and_cancel(struct lustre_handle *lockh, __u32 mode)
962 {
963         struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
964         ENTRY;
965
966         LASSERT(lock != NULL);
967
968         LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
969         lock_res_and_lock(lock);
970         ldlm_set_cbpending(lock);
971         unlock_res_and_lock(lock);
972         ldlm_lock_decref_internal(lock, mode);
973         LDLM_LOCK_PUT(lock);
974 }
975 EXPORT_SYMBOL(ldlm_lock_decref_and_cancel);
976
977 struct sl_insert_point {
978         cfs_list_t *res_link;
979         cfs_list_t *mode_link;
980         cfs_list_t *policy_link;
981 };
982
983 /**
984  * Finds a position to insert the new lock into granted lock list.
985  *
986  * Used for locks eligible for skiplist optimization.
987  *
988  * Parameters:
989  *      queue [input]:  the granted list where search acts on;
990  *      req [input]:    the lock whose position to be located;
991  *      prev [output]:  positions within 3 lists to insert @req to
992  * Return Value:
993  *      filled @prev
994  * NOTE: called by
995  *  - ldlm_grant_lock_with_skiplist
996  */
997 static void search_granted_lock(cfs_list_t *queue,
998                                 struct ldlm_lock *req,
999                                 struct sl_insert_point *prev)
1000 {
1001         cfs_list_t *tmp;
1002         struct ldlm_lock *lock, *mode_end, *policy_end;
1003         ENTRY;
1004
1005         cfs_list_for_each(tmp, queue) {
1006                 lock = cfs_list_entry(tmp, struct ldlm_lock, l_res_link);
1007
1008                 mode_end = cfs_list_entry(lock->l_sl_mode.prev,
1009                                           struct ldlm_lock, l_sl_mode);
1010
1011                 if (lock->l_req_mode != req->l_req_mode) {
1012                         /* jump to last lock of mode group */
1013                         tmp = &mode_end->l_res_link;
1014                         continue;
1015                 }
1016
1017                 /* suitable mode group is found */
1018                 if (lock->l_resource->lr_type == LDLM_PLAIN) {
1019                         /* insert point is last lock of the mode group */
1020                         prev->res_link = &mode_end->l_res_link;
1021                         prev->mode_link = &mode_end->l_sl_mode;
1022                         prev->policy_link = &req->l_sl_policy;
1023                         EXIT;
1024                         return;
1025                 } else if (lock->l_resource->lr_type == LDLM_IBITS) {
1026                         for (;;) {
1027                                 policy_end =
1028                                         cfs_list_entry(lock->l_sl_policy.prev,
1029                                                        struct ldlm_lock,
1030                                                        l_sl_policy);
1031
1032                                 if (lock->l_policy_data.l_inodebits.bits ==
1033                                     req->l_policy_data.l_inodebits.bits) {
1034                                         /* insert point is last lock of
1035                                          * the policy group */
1036                                         prev->res_link =
1037                                                 &policy_end->l_res_link;
1038                                         prev->mode_link =
1039                                                 &policy_end->l_sl_mode;
1040                                         prev->policy_link =
1041                                                 &policy_end->l_sl_policy;
1042                                         EXIT;
1043                                         return;
1044                                 }
1045
1046                                 if (policy_end == mode_end)
1047                                         /* done with mode group */
1048                                         break;
1049
1050                                 /* go to next policy group within mode group */
1051                                 tmp = policy_end->l_res_link.next;
1052                                 lock = cfs_list_entry(tmp, struct ldlm_lock,
1053                                                       l_res_link);
1054                         }  /* loop over policy groups within the mode group */
1055
1056                         /* insert point is last lock of the mode group,
1057                          * new policy group is started */
1058                         prev->res_link = &mode_end->l_res_link;
1059                         prev->mode_link = &mode_end->l_sl_mode;
1060                         prev->policy_link = &req->l_sl_policy;
1061                         EXIT;
1062                         return;
1063                 } else {
1064                         LDLM_ERROR(lock,"is not LDLM_PLAIN or LDLM_IBITS lock");
1065                         LBUG();
1066                 }
1067         }
1068
1069         /* insert point is last lock on the queue,
1070          * new mode group and new policy group are started */
1071         prev->res_link = queue->prev;
1072         prev->mode_link = &req->l_sl_mode;
1073         prev->policy_link = &req->l_sl_policy;
1074         EXIT;
1075         return;
1076 }
1077
1078 /**
1079  * Add a lock into resource granted list after a position described by
1080  * \a prev.
1081  */
1082 static void ldlm_granted_list_add_lock(struct ldlm_lock *lock,
1083                                        struct sl_insert_point *prev)
1084 {
1085         struct ldlm_resource *res = lock->l_resource;
1086         ENTRY;
1087
1088         check_res_locked(res);
1089
1090         ldlm_resource_dump(D_INFO, res);
1091         LDLM_DEBUG(lock, "About to add lock:");
1092
1093         if (ldlm_is_destroyed(lock)) {
1094                 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1095                 return;
1096         }
1097
1098         LASSERT(cfs_list_empty(&lock->l_res_link));
1099         LASSERT(cfs_list_empty(&lock->l_sl_mode));
1100         LASSERT(cfs_list_empty(&lock->l_sl_policy));
1101
1102         /*
1103          * lock->link == prev->link means lock is first starting the group.
1104          * Don't re-add to itself to suppress kernel warnings.
1105          */
1106         if (&lock->l_res_link != prev->res_link)
1107                 cfs_list_add(&lock->l_res_link, prev->res_link);
1108         if (&lock->l_sl_mode != prev->mode_link)
1109                 cfs_list_add(&lock->l_sl_mode, prev->mode_link);
1110         if (&lock->l_sl_policy != prev->policy_link)
1111                 cfs_list_add(&lock->l_sl_policy, prev->policy_link);
1112
1113         EXIT;
1114 }
1115
1116 /**
1117  * Add a lock to granted list on a resource maintaining skiplist
1118  * correctness.
1119  */
1120 static void ldlm_grant_lock_with_skiplist(struct ldlm_lock *lock)
1121 {
1122         struct sl_insert_point prev;
1123         ENTRY;
1124
1125         LASSERT(lock->l_req_mode == lock->l_granted_mode);
1126
1127         search_granted_lock(&lock->l_resource->lr_granted, lock, &prev);
1128         ldlm_granted_list_add_lock(lock, &prev);
1129         EXIT;
1130 }
1131
1132 /**
1133  * Perform lock granting bookkeeping.
1134  *
1135  * Includes putting the lock into granted list and updating lock mode.
1136  * NOTE: called by
1137  *  - ldlm_lock_enqueue
1138  *  - ldlm_reprocess_queue
1139  *  - ldlm_lock_convert
1140  *
1141  * must be called with lr_lock held
1142  */
1143 void ldlm_grant_lock(struct ldlm_lock *lock, cfs_list_t *work_list)
1144 {
1145         struct ldlm_resource *res = lock->l_resource;
1146         ENTRY;
1147
1148         check_res_locked(res);
1149
1150         lock->l_granted_mode = lock->l_req_mode;
1151         if (res->lr_type == LDLM_PLAIN || res->lr_type == LDLM_IBITS)
1152                 ldlm_grant_lock_with_skiplist(lock);
1153         else if (res->lr_type == LDLM_EXTENT)
1154                 ldlm_extent_add_lock(res, lock);
1155         else
1156                 ldlm_resource_add_lock(res, &res->lr_granted, lock);
1157
1158         if (lock->l_granted_mode < res->lr_most_restr)
1159                 res->lr_most_restr = lock->l_granted_mode;
1160
1161         if (work_list && lock->l_completion_ast != NULL)
1162                 ldlm_add_ast_work_item(lock, NULL, work_list);
1163
1164         ldlm_pool_add(&ldlm_res_to_ns(res)->ns_pool, lock);
1165         EXIT;
1166 }
1167
1168 /**
1169  * Search for a lock with given properties in a queue.
1170  *
1171  * \retval a referenced lock or NULL.  See the flag descriptions below, in the
1172  * comment above ldlm_lock_match
1173  */
1174 static struct ldlm_lock *search_queue(cfs_list_t *queue,
1175                                       ldlm_mode_t *mode,
1176                                       ldlm_policy_data_t *policy,
1177                                       struct ldlm_lock *old_lock,
1178                                       __u64 flags, int unref)
1179 {
1180         struct ldlm_lock *lock;
1181         cfs_list_t       *tmp;
1182
1183         cfs_list_for_each(tmp, queue) {
1184                 ldlm_mode_t match;
1185
1186                 lock = cfs_list_entry(tmp, struct ldlm_lock, l_res_link);
1187
1188                 if (lock == old_lock)
1189                         break;
1190
1191                 /* Check if this lock can be matched.
1192                  * Used by LU-2919(exclusive open) for open lease lock */
1193                 if (ldlm_is_excl(lock))
1194                         continue;
1195
1196                 /* llite sometimes wants to match locks that will be
1197                  * canceled when their users drop, but we allow it to match
1198                  * if it passes in CBPENDING and the lock still has users.
1199                  * this is generally only going to be used by children
1200                  * whose parents already hold a lock so forward progress
1201                  * can still happen. */
1202                 if (ldlm_is_cbpending(lock) &&
1203                     !(flags & LDLM_FL_CBPENDING))
1204                         continue;
1205                 if (!unref && ldlm_is_cbpending(lock) &&
1206                     lock->l_readers == 0 && lock->l_writers == 0)
1207                         continue;
1208
1209                 if (!(lock->l_req_mode & *mode))
1210                         continue;
1211                 match = lock->l_req_mode;
1212
1213                 if (lock->l_resource->lr_type == LDLM_EXTENT &&
1214                     (lock->l_policy_data.l_extent.start >
1215                      policy->l_extent.start ||
1216                      lock->l_policy_data.l_extent.end < policy->l_extent.end))
1217                         continue;
1218
1219                 if (unlikely(match == LCK_GROUP) &&
1220                     lock->l_resource->lr_type == LDLM_EXTENT &&
1221                     lock->l_policy_data.l_extent.gid != policy->l_extent.gid)
1222                         continue;
1223
1224                 /* We match if we have existing lock with same or wider set
1225                    of bits. */
1226                 if (lock->l_resource->lr_type == LDLM_IBITS &&
1227                      ((lock->l_policy_data.l_inodebits.bits &
1228                       policy->l_inodebits.bits) !=
1229                       policy->l_inodebits.bits))
1230                         continue;
1231
1232                 if (!unref && LDLM_HAVE_MASK(lock, GONE))
1233                         continue;
1234
1235                 if ((flags & LDLM_FL_LOCAL_ONLY) &&
1236                     !ldlm_is_local(lock))
1237                         continue;
1238
1239                 if (flags & LDLM_FL_TEST_LOCK) {
1240                         LDLM_LOCK_GET(lock);
1241                         ldlm_lock_touch_in_lru(lock);
1242                 } else {
1243                         ldlm_lock_addref_internal_nolock(lock, match);
1244                 }
1245                 *mode = match;
1246                 return lock;
1247         }
1248
1249         return NULL;
1250 }
1251
1252 void ldlm_lock_fail_match_locked(struct ldlm_lock *lock)
1253 {
1254         if ((lock->l_flags & LDLM_FL_FAIL_NOTIFIED) == 0) {
1255                 lock->l_flags |= LDLM_FL_FAIL_NOTIFIED;
1256                 wake_up_all(&lock->l_waitq);
1257         }
1258 }
1259 EXPORT_SYMBOL(ldlm_lock_fail_match_locked);
1260
1261 void ldlm_lock_fail_match(struct ldlm_lock *lock)
1262 {
1263         lock_res_and_lock(lock);
1264         ldlm_lock_fail_match_locked(lock);
1265         unlock_res_and_lock(lock);
1266 }
1267 EXPORT_SYMBOL(ldlm_lock_fail_match);
1268
1269 /**
1270  * Mark lock as "matchable" by OST.
1271  *
1272  * Used to prevent certain races in LOV/OSC where the lock is granted, but LVB
1273  * is not yet valid.
1274  * Assumes LDLM lock is already locked.
1275  */
1276 void ldlm_lock_allow_match_locked(struct ldlm_lock *lock)
1277 {
1278         ldlm_set_lvb_ready(lock);
1279         wake_up_all(&lock->l_waitq);
1280 }
1281 EXPORT_SYMBOL(ldlm_lock_allow_match_locked);
1282
1283 /**
1284  * Mark lock as "matchable" by OST.
1285  * Locks the lock and then \see ldlm_lock_allow_match_locked
1286  */
1287 void ldlm_lock_allow_match(struct ldlm_lock *lock)
1288 {
1289         lock_res_and_lock(lock);
1290         ldlm_lock_allow_match_locked(lock);
1291         unlock_res_and_lock(lock);
1292 }
1293 EXPORT_SYMBOL(ldlm_lock_allow_match);
1294
1295 /**
1296  * Attempt to find a lock with specified properties.
1297  *
1298  * Typically returns a reference to matched lock unless LDLM_FL_TEST_LOCK is
1299  * set in \a flags
1300  *
1301  * Can be called in two ways:
1302  *
1303  * If 'ns' is NULL, then lockh describes an existing lock that we want to look
1304  * for a duplicate of.
1305  *
1306  * Otherwise, all of the fields must be filled in, to match against.
1307  *
1308  * If 'flags' contains LDLM_FL_LOCAL_ONLY, then only match local locks on the
1309  *     server (ie, connh is NULL)
1310  * If 'flags' contains LDLM_FL_BLOCK_GRANTED, then only locks on the granted
1311  *     list will be considered
1312  * If 'flags' contains LDLM_FL_CBPENDING, then locks that have been marked
1313  *     to be canceled can still be matched as long as they still have reader
1314  *     or writer refernces
1315  * If 'flags' contains LDLM_FL_TEST_LOCK, then don't actually reference a lock,
1316  *     just tell us if we would have matched.
1317  *
1318  * \retval 1 if it finds an already-existing lock that is compatible; in this
1319  * case, lockh is filled in with a addref()ed lock
1320  *
1321  * We also check security context, and if that fails we simply return 0 (to
1322  * keep caller code unchanged), the context failure will be discovered by
1323  * caller sometime later.
1324  */
1325 ldlm_mode_t ldlm_lock_match(struct ldlm_namespace *ns, __u64 flags,
1326                             const struct ldlm_res_id *res_id, ldlm_type_t type,
1327                             ldlm_policy_data_t *policy, ldlm_mode_t mode,
1328                             struct lustre_handle *lockh, int unref)
1329 {
1330         struct ldlm_resource *res;
1331         struct ldlm_lock *lock, *old_lock = NULL;
1332         int rc = 0;
1333         ENTRY;
1334
1335         if (ns == NULL) {
1336                 old_lock = ldlm_handle2lock(lockh);
1337                 LASSERT(old_lock);
1338
1339                 ns = ldlm_lock_to_ns(old_lock);
1340                 res_id = &old_lock->l_resource->lr_name;
1341                 type = old_lock->l_resource->lr_type;
1342                 mode = old_lock->l_req_mode;
1343         }
1344
1345         res = ldlm_resource_get(ns, NULL, res_id, type, 0);
1346         if (res == NULL) {
1347                 LASSERT(old_lock == NULL);
1348                 RETURN(0);
1349         }
1350
1351         LDLM_RESOURCE_ADDREF(res);
1352         lock_res(res);
1353
1354         lock = search_queue(&res->lr_granted, &mode, policy, old_lock,
1355                             flags, unref);
1356         if (lock != NULL)
1357                 GOTO(out, rc = 1);
1358         if (flags & LDLM_FL_BLOCK_GRANTED)
1359                 GOTO(out, rc = 0);
1360         lock = search_queue(&res->lr_converting, &mode, policy, old_lock,
1361                             flags, unref);
1362         if (lock != NULL)
1363                 GOTO(out, rc = 1);
1364         lock = search_queue(&res->lr_waiting, &mode, policy, old_lock,
1365                             flags, unref);
1366         if (lock != NULL)
1367                 GOTO(out, rc = 1);
1368
1369         EXIT;
1370  out:
1371         unlock_res(res);
1372         LDLM_RESOURCE_DELREF(res);
1373         ldlm_resource_putref(res);
1374
1375         if (lock) {
1376                 ldlm_lock2handle(lock, lockh);
1377                 if ((flags & LDLM_FL_LVB_READY) &&
1378                     (!ldlm_is_lvb_ready(lock))) {
1379                         __u64 wait_flags = LDLM_FL_LVB_READY |
1380                                 LDLM_FL_DESTROYED | LDLM_FL_FAIL_NOTIFIED;
1381                         struct l_wait_info lwi;
1382                         if (lock->l_completion_ast) {
1383                                 int err = lock->l_completion_ast(lock,
1384                                                           LDLM_FL_WAIT_NOREPROC,
1385                                                                  NULL);
1386                                 if (err) {
1387                                         if (flags & LDLM_FL_TEST_LOCK)
1388                                                 LDLM_LOCK_RELEASE(lock);
1389                                         else
1390                                                 ldlm_lock_decref_internal(lock,
1391                                                                           mode);
1392                                         rc = 0;
1393                                         goto out2;
1394                                 }
1395                         }
1396
1397                         lwi = LWI_TIMEOUT_INTR(cfs_time_seconds(obd_timeout),
1398                                                NULL, LWI_ON_SIGNAL_NOOP, NULL);
1399
1400                         /* XXX FIXME see comment on CAN_MATCH in lustre_dlm.h */
1401                         l_wait_event(lock->l_waitq,
1402                                      lock->l_flags & wait_flags,
1403                                      &lwi);
1404                         if (!ldlm_is_lvb_ready(lock)) {
1405                                 if (flags & LDLM_FL_TEST_LOCK)
1406                                         LDLM_LOCK_RELEASE(lock);
1407                                 else
1408                                         ldlm_lock_decref_internal(lock, mode);
1409                                 rc = 0;
1410                         }
1411                 }
1412         }
1413  out2:
1414         if (rc) {
1415                 LDLM_DEBUG(lock, "matched ("LPU64" "LPU64")",
1416                            (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1417                                 res_id->name[2] : policy->l_extent.start,
1418                            (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1419                                 res_id->name[3] : policy->l_extent.end);
1420
1421                 /* check user's security context */
1422                 if (lock->l_conn_export &&
1423                     sptlrpc_import_check_ctx(
1424                                 class_exp2cliimp(lock->l_conn_export))) {
1425                         if (!(flags & LDLM_FL_TEST_LOCK))
1426                                 ldlm_lock_decref_internal(lock, mode);
1427                         rc = 0;
1428                 }
1429
1430                 if (flags & LDLM_FL_TEST_LOCK)
1431                         LDLM_LOCK_RELEASE(lock);
1432
1433         } else if (!(flags & LDLM_FL_TEST_LOCK)) {/*less verbose for test-only*/
1434                 LDLM_DEBUG_NOLOCK("not matched ns %p type %u mode %u res "
1435                                   LPU64"/"LPU64" ("LPU64" "LPU64")", ns,
1436                                   type, mode, res_id->name[0], res_id->name[1],
1437                                   (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1438                                         res_id->name[2] :policy->l_extent.start,
1439                                   (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1440                                         res_id->name[3] : policy->l_extent.end);
1441         }
1442         if (old_lock)
1443                 LDLM_LOCK_PUT(old_lock);
1444
1445         return rc ? mode : 0;
1446 }
1447 EXPORT_SYMBOL(ldlm_lock_match);
1448
1449 ldlm_mode_t ldlm_revalidate_lock_handle(struct lustre_handle *lockh,
1450                                         __u64 *bits)
1451 {
1452         struct ldlm_lock *lock;
1453         ldlm_mode_t mode = 0;
1454         ENTRY;
1455
1456         lock = ldlm_handle2lock(lockh);
1457         if (lock != NULL) {
1458                 lock_res_and_lock(lock);
1459                 if (LDLM_HAVE_MASK(lock, GONE))
1460                         GOTO(out, mode);
1461
1462                 if (ldlm_is_cbpending(lock) &&
1463                     lock->l_readers == 0 && lock->l_writers == 0)
1464                         GOTO(out, mode);
1465
1466                 if (bits)
1467                         *bits = lock->l_policy_data.l_inodebits.bits;
1468                 mode = lock->l_granted_mode;
1469                 ldlm_lock_addref_internal_nolock(lock, mode);
1470         }
1471
1472         EXIT;
1473
1474 out:
1475         if (lock != NULL) {
1476                 unlock_res_and_lock(lock);
1477                 LDLM_LOCK_PUT(lock);
1478         }
1479         return mode;
1480 }
1481 EXPORT_SYMBOL(ldlm_revalidate_lock_handle);
1482
1483 /** The caller must guarantee that the buffer is large enough. */
1484 int ldlm_fill_lvb(struct ldlm_lock *lock, struct req_capsule *pill,
1485                   enum req_location loc, void *data, int size)
1486 {
1487         void *lvb;
1488         ENTRY;
1489
1490         LASSERT(data != NULL);
1491         LASSERT(size >= 0);
1492
1493         switch (lock->l_lvb_type) {
1494         case LVB_T_OST:
1495                 if (size == sizeof(struct ost_lvb)) {
1496                         if (loc == RCL_CLIENT)
1497                                 lvb = req_capsule_client_swab_get(pill,
1498                                                 &RMF_DLM_LVB,
1499                                                 lustre_swab_ost_lvb);
1500                         else
1501                                 lvb = req_capsule_server_swab_get(pill,
1502                                                 &RMF_DLM_LVB,
1503                                                 lustre_swab_ost_lvb);
1504                         if (unlikely(lvb == NULL)) {
1505                                 LDLM_ERROR(lock, "no LVB");
1506                                 RETURN(-EPROTO);
1507                         }
1508
1509                         memcpy(data, lvb, size);
1510                 } else if (size == sizeof(struct ost_lvb_v1)) {
1511                         struct ost_lvb *olvb = data;
1512
1513                         if (loc == RCL_CLIENT)
1514                                 lvb = req_capsule_client_swab_get(pill,
1515                                                 &RMF_DLM_LVB,
1516                                                 lustre_swab_ost_lvb_v1);
1517                         else
1518                                 lvb = req_capsule_server_sized_swab_get(pill,
1519                                                 &RMF_DLM_LVB, size,
1520                                                 lustre_swab_ost_lvb_v1);
1521                         if (unlikely(lvb == NULL)) {
1522                                 LDLM_ERROR(lock, "no LVB");
1523                                 RETURN(-EPROTO);
1524                         }
1525
1526                         memcpy(data, lvb, size);
1527                         olvb->lvb_mtime_ns = 0;
1528                         olvb->lvb_atime_ns = 0;
1529                         olvb->lvb_ctime_ns = 0;
1530                 } else {
1531                         LDLM_ERROR(lock, "Replied unexpected ost LVB size %d",
1532                                    size);
1533                         RETURN(-EINVAL);
1534                 }
1535                 break;
1536         case LVB_T_LQUOTA:
1537                 if (size == sizeof(struct lquota_lvb)) {
1538                         if (loc == RCL_CLIENT)
1539                                 lvb = req_capsule_client_swab_get(pill,
1540                                                 &RMF_DLM_LVB,
1541                                                 lustre_swab_lquota_lvb);
1542                         else
1543                                 lvb = req_capsule_server_swab_get(pill,
1544                                                 &RMF_DLM_LVB,
1545                                                 lustre_swab_lquota_lvb);
1546                         if (unlikely(lvb == NULL)) {
1547                                 LDLM_ERROR(lock, "no LVB");
1548                                 RETURN(-EPROTO);
1549                         }
1550
1551                         memcpy(data, lvb, size);
1552                 } else {
1553                         LDLM_ERROR(lock, "Replied unexpected lquota LVB size %d",
1554                                    size);
1555                         RETURN(-EINVAL);
1556                 }
1557                 break;
1558         case LVB_T_LAYOUT:
1559                 if (size == 0)
1560                         break;
1561
1562                 if (loc == RCL_CLIENT)
1563                         lvb = req_capsule_client_get(pill, &RMF_DLM_LVB);
1564                 else
1565                         lvb = req_capsule_server_get(pill, &RMF_DLM_LVB);
1566                 if (unlikely(lvb == NULL)) {
1567                         LDLM_ERROR(lock, "no LVB");
1568                         RETURN(-EPROTO);
1569                 }
1570
1571                 memcpy(data, lvb, size);
1572                 break;
1573         default:
1574                 LDLM_ERROR(lock, "Unknown LVB type: %d\n", lock->l_lvb_type);
1575                 libcfs_debug_dumpstack(NULL);
1576                 RETURN(-EINVAL);
1577         }
1578
1579         RETURN(0);
1580 }
1581
1582 /**
1583  * Create and fill in new LDLM lock with specified properties.
1584  * Returns a referenced lock
1585  */
1586 struct ldlm_lock *ldlm_lock_create(struct ldlm_namespace *ns,
1587                                    const struct ldlm_res_id *res_id,
1588                                    ldlm_type_t type,
1589                                    ldlm_mode_t mode,
1590                                    const struct ldlm_callback_suite *cbs,
1591                                    void *data, __u32 lvb_len,
1592                                    enum lvb_type lvb_type)
1593 {
1594         struct ldlm_lock *lock;
1595         struct ldlm_resource *res;
1596         ENTRY;
1597
1598         res = ldlm_resource_get(ns, NULL, res_id, type, 1);
1599         if (res == NULL)
1600                 RETURN(NULL);
1601
1602         lock = ldlm_lock_new(res);
1603
1604         if (lock == NULL)
1605                 RETURN(NULL);
1606
1607         lock->l_req_mode = mode;
1608         lock->l_ast_data = data;
1609         lock->l_pid = current_pid();
1610         if (ns_is_server(ns))
1611                 ldlm_set_ns_srv(lock);
1612         if (cbs) {
1613                 lock->l_blocking_ast = cbs->lcs_blocking;
1614                 lock->l_completion_ast = cbs->lcs_completion;
1615                 lock->l_glimpse_ast = cbs->lcs_glimpse;
1616         }
1617
1618         lock->l_tree_node = NULL;
1619         /* if this is the extent lock, allocate the interval tree node */
1620         if (type == LDLM_EXTENT) {
1621                 if (ldlm_interval_alloc(lock) == NULL)
1622                         GOTO(out, 0);
1623         }
1624
1625         if (lvb_len) {
1626                 lock->l_lvb_len = lvb_len;
1627                 OBD_ALLOC(lock->l_lvb_data, lvb_len);
1628                 if (lock->l_lvb_data == NULL)
1629                         GOTO(out, 0);
1630         }
1631
1632         lock->l_lvb_type = lvb_type;
1633         if (OBD_FAIL_CHECK(OBD_FAIL_LDLM_NEW_LOCK))
1634                 GOTO(out, 0);
1635
1636         RETURN(lock);
1637
1638 out:
1639         ldlm_lock_destroy(lock);
1640         LDLM_LOCK_RELEASE(lock);
1641         return NULL;
1642 }
1643
1644 /**
1645  * Enqueue (request) a lock.
1646  *
1647  * Does not block. As a result of enqueue the lock would be put
1648  * into granted or waiting list.
1649  *
1650  * If namespace has intent policy sent and the lock has LDLM_FL_HAS_INTENT flag
1651  * set, skip all the enqueueing and delegate lock processing to intent policy
1652  * function.
1653  */
1654 ldlm_error_t ldlm_lock_enqueue(struct ldlm_namespace *ns,
1655                                struct ldlm_lock **lockp,
1656                                void *cookie, __u64 *flags)
1657 {
1658         struct ldlm_lock *lock = *lockp;
1659         struct ldlm_resource *res = lock->l_resource;
1660         int local = ns_is_client(ldlm_res_to_ns(res));
1661 #ifdef HAVE_SERVER_SUPPORT
1662         ldlm_processing_policy policy;
1663 #endif
1664         ldlm_error_t rc = ELDLM_OK;
1665         struct ldlm_interval *node = NULL;
1666         ENTRY;
1667
1668         lock->l_last_activity = cfs_time_current_sec();
1669         /* policies are not executed on the client or during replay */
1670         if ((*flags & (LDLM_FL_HAS_INTENT|LDLM_FL_REPLAY)) == LDLM_FL_HAS_INTENT
1671             && !local && ns->ns_policy) {
1672                 rc = ns->ns_policy(ns, lockp, cookie, lock->l_req_mode, *flags,
1673                                    NULL);
1674                 if (rc == ELDLM_LOCK_REPLACED) {
1675                         /* The lock that was returned has already been granted,
1676                          * and placed into lockp.  If it's not the same as the
1677                          * one we passed in, then destroy the old one and our
1678                          * work here is done. */
1679                         if (lock != *lockp) {
1680                                 ldlm_lock_destroy(lock);
1681                                 LDLM_LOCK_RELEASE(lock);
1682                         }
1683                         *flags |= LDLM_FL_LOCK_CHANGED;
1684                         RETURN(0);
1685                 } else if (rc != ELDLM_OK ||
1686                            (rc == ELDLM_OK && (*flags & LDLM_FL_INTENT_ONLY))) {
1687                         ldlm_lock_destroy(lock);
1688                         RETURN(rc);
1689                 }
1690         }
1691
1692         /* For a replaying lock, it might be already in granted list. So
1693          * unlinking the lock will cause the interval node to be freed, we
1694          * have to allocate the interval node early otherwise we can't regrant
1695          * this lock in the future. - jay */
1696         if (!local && (*flags & LDLM_FL_REPLAY) && res->lr_type == LDLM_EXTENT)
1697                 OBD_SLAB_ALLOC_PTR_GFP(node, ldlm_interval_slab, __GFP_IO);
1698
1699         lock_res_and_lock(lock);
1700         if (local && lock->l_req_mode == lock->l_granted_mode) {
1701                 /* The server returned a blocked lock, but it was granted
1702                  * before we got a chance to actually enqueue it.  We don't
1703                  * need to do anything else. */
1704                 *flags &= ~(LDLM_FL_BLOCK_GRANTED |
1705                             LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_WAIT);
1706                 GOTO(out, ELDLM_OK);
1707         }
1708
1709         ldlm_resource_unlink_lock(lock);
1710         if (res->lr_type == LDLM_EXTENT && lock->l_tree_node == NULL) {
1711                 if (node == NULL) {
1712                         ldlm_lock_destroy_nolock(lock);
1713                         GOTO(out, rc = -ENOMEM);
1714                 }
1715
1716                 CFS_INIT_LIST_HEAD(&node->li_group);
1717                 ldlm_interval_attach(node, lock);
1718                 node = NULL;
1719         }
1720
1721         /* Some flags from the enqueue want to make it into the AST, via the
1722          * lock's l_flags. */
1723         if (*flags & LDLM_FL_AST_DISCARD_DATA)
1724                 ldlm_set_ast_discard_data(lock);
1725
1726         /* This distinction between local lock trees is very important; a client
1727          * namespace only has information about locks taken by that client, and
1728          * thus doesn't have enough information to decide for itself if it can
1729          * be granted (below).  In this case, we do exactly what the server
1730          * tells us to do, as dictated by the 'flags'.
1731          *
1732          * We do exactly the same thing during recovery, when the server is
1733          * more or less trusting the clients not to lie.
1734          *
1735          * FIXME (bug 268): Detect obvious lies by checking compatibility in
1736          * granted/converting queues. */
1737         if (local) {
1738                 if (*flags & LDLM_FL_BLOCK_CONV)
1739                         ldlm_resource_add_lock(res, &res->lr_converting, lock);
1740                 else if (*flags & (LDLM_FL_BLOCK_WAIT | LDLM_FL_BLOCK_GRANTED))
1741                         ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1742                 else
1743                         ldlm_grant_lock(lock, NULL);
1744                 GOTO(out, ELDLM_OK);
1745 #ifdef HAVE_SERVER_SUPPORT
1746         } else if (*flags & LDLM_FL_REPLAY) {
1747                 if (*flags & LDLM_FL_BLOCK_CONV) {
1748                         ldlm_resource_add_lock(res, &res->lr_converting, lock);
1749                         GOTO(out, ELDLM_OK);
1750                 } else if (*flags & LDLM_FL_BLOCK_WAIT) {
1751                         ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1752                         GOTO(out, ELDLM_OK);
1753                 } else if (*flags & LDLM_FL_BLOCK_GRANTED) {
1754                         ldlm_grant_lock(lock, NULL);
1755                         GOTO(out, ELDLM_OK);
1756                 }
1757                 /* If no flags, fall through to normal enqueue path. */
1758         }
1759
1760         policy = ldlm_processing_policy_table[res->lr_type];
1761         policy(lock, flags, 1, &rc, NULL);
1762         GOTO(out, rc);
1763 #else
1764         } else {
1765                 CERROR("This is client-side-only module, cannot handle "
1766                        "LDLM_NAMESPACE_SERVER resource type lock.\n");
1767                 LBUG();
1768         }
1769 #endif
1770
1771 out:
1772         unlock_res_and_lock(lock);
1773         if (node)
1774                 OBD_SLAB_FREE(node, ldlm_interval_slab, sizeof(*node));
1775         return rc;
1776 }
1777
1778 #ifdef HAVE_SERVER_SUPPORT
1779 /**
1780  * Iterate through all waiting locks on a given resource queue and attempt to
1781  * grant them.
1782  *
1783  * Must be called with resource lock held.
1784  */
1785 int ldlm_reprocess_queue(struct ldlm_resource *res, cfs_list_t *queue,
1786                          cfs_list_t *work_list)
1787 {
1788         cfs_list_t *tmp, *pos;
1789         ldlm_processing_policy policy;
1790         __u64 flags;
1791         int rc = LDLM_ITER_CONTINUE;
1792         ldlm_error_t err;
1793         ENTRY;
1794
1795         check_res_locked(res);
1796
1797         policy = ldlm_processing_policy_table[res->lr_type];
1798         LASSERT(policy);
1799
1800         cfs_list_for_each_safe(tmp, pos, queue) {
1801                 struct ldlm_lock *pending;
1802                 pending = cfs_list_entry(tmp, struct ldlm_lock, l_res_link);
1803
1804                 CDEBUG(D_INFO, "Reprocessing lock %p\n", pending);
1805
1806                 flags = 0;
1807                 rc = policy(pending, &flags, 0, &err, work_list);
1808                 if (rc != LDLM_ITER_CONTINUE)
1809                         break;
1810         }
1811
1812         RETURN(rc);
1813 }
1814 #endif
1815
1816 /**
1817  * Process a call to blocking AST callback for a lock in ast_work list
1818  */
1819 static int
1820 ldlm_work_bl_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1821 {
1822         struct ldlm_cb_set_arg *arg = opaq;
1823         struct ldlm_lock_desc   d;
1824         int                     rc;
1825         struct ldlm_lock       *lock;
1826         ENTRY;
1827
1828         if (cfs_list_empty(arg->list))
1829                 RETURN(-ENOENT);
1830
1831         lock = cfs_list_entry(arg->list->next, struct ldlm_lock, l_bl_ast);
1832
1833         /* nobody should touch l_bl_ast */
1834         lock_res_and_lock(lock);
1835         cfs_list_del_init(&lock->l_bl_ast);
1836
1837         LASSERT(ldlm_is_ast_sent(lock));
1838         LASSERT(lock->l_bl_ast_run == 0);
1839         LASSERT(lock->l_blocking_lock);
1840         lock->l_bl_ast_run++;
1841         unlock_res_and_lock(lock);
1842
1843         ldlm_lock2desc(lock->l_blocking_lock, &d);
1844
1845         rc = lock->l_blocking_ast(lock, &d, (void *)arg, LDLM_CB_BLOCKING);
1846         LDLM_LOCK_RELEASE(lock->l_blocking_lock);
1847         lock->l_blocking_lock = NULL;
1848         LDLM_LOCK_RELEASE(lock);
1849
1850         RETURN(rc);
1851 }
1852
1853 /**
1854  * Process a call to completion AST callback for a lock in ast_work list
1855  */
1856 static int
1857 ldlm_work_cp_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1858 {
1859         struct ldlm_cb_set_arg  *arg = opaq;
1860         int                      rc = 0;
1861         struct ldlm_lock        *lock;
1862         ldlm_completion_callback completion_callback;
1863         ENTRY;
1864
1865         if (cfs_list_empty(arg->list))
1866                 RETURN(-ENOENT);
1867
1868         lock = cfs_list_entry(arg->list->next, struct ldlm_lock, l_cp_ast);
1869
1870         /* It's possible to receive a completion AST before we've set
1871          * the l_completion_ast pointer: either because the AST arrived
1872          * before the reply, or simply because there's a small race
1873          * window between receiving the reply and finishing the local
1874          * enqueue. (bug 842)
1875          *
1876          * This can't happen with the blocking_ast, however, because we
1877          * will never call the local blocking_ast until we drop our
1878          * reader/writer reference, which we won't do until we get the
1879          * reply and finish enqueueing. */
1880
1881         /* nobody should touch l_cp_ast */
1882         lock_res_and_lock(lock);
1883         cfs_list_del_init(&lock->l_cp_ast);
1884         LASSERT(ldlm_is_cp_reqd(lock));
1885         /* save l_completion_ast since it can be changed by
1886          * mds_intent_policy(), see bug 14225 */
1887         completion_callback = lock->l_completion_ast;
1888         ldlm_clear_cp_reqd(lock);
1889         unlock_res_and_lock(lock);
1890
1891         if (completion_callback != NULL)
1892                 rc = completion_callback(lock, 0, (void *)arg);
1893         LDLM_LOCK_RELEASE(lock);
1894
1895         RETURN(rc);
1896 }
1897
1898 /**
1899  * Process a call to revocation AST callback for a lock in ast_work list
1900  */
1901 static int
1902 ldlm_work_revoke_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1903 {
1904         struct ldlm_cb_set_arg *arg = opaq;
1905         struct ldlm_lock_desc   desc;
1906         int                     rc;
1907         struct ldlm_lock       *lock;
1908         ENTRY;
1909
1910         if (cfs_list_empty(arg->list))
1911                 RETURN(-ENOENT);
1912
1913         lock = cfs_list_entry(arg->list->next, struct ldlm_lock, l_rk_ast);
1914         cfs_list_del_init(&lock->l_rk_ast);
1915
1916         /* the desc just pretend to exclusive */
1917         ldlm_lock2desc(lock, &desc);
1918         desc.l_req_mode = LCK_EX;
1919         desc.l_granted_mode = 0;
1920
1921         rc = lock->l_blocking_ast(lock, &desc, (void*)arg, LDLM_CB_BLOCKING);
1922         LDLM_LOCK_RELEASE(lock);
1923
1924         RETURN(rc);
1925 }
1926
1927 /**
1928  * Process a call to glimpse AST callback for a lock in ast_work list
1929  */
1930 int ldlm_work_gl_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1931 {
1932         struct ldlm_cb_set_arg          *arg = opaq;
1933         struct ldlm_glimpse_work        *gl_work;
1934         struct ldlm_lock                *lock;
1935         int                              rc = 0;
1936         ENTRY;
1937
1938         if (cfs_list_empty(arg->list))
1939                 RETURN(-ENOENT);
1940
1941         gl_work = cfs_list_entry(arg->list->next, struct ldlm_glimpse_work,
1942                                  gl_list);
1943         cfs_list_del_init(&gl_work->gl_list);
1944
1945         lock = gl_work->gl_lock;
1946
1947         /* transfer the glimpse descriptor to ldlm_cb_set_arg */
1948         arg->gl_desc = gl_work->gl_desc;
1949
1950         /* invoke the actual glimpse callback */
1951         if (lock->l_glimpse_ast(lock, (void*)arg) == 0)
1952                 rc = 1;
1953
1954         LDLM_LOCK_RELEASE(lock);
1955
1956         if ((gl_work->gl_flags & LDLM_GL_WORK_NOFREE) == 0)
1957                 OBD_FREE_PTR(gl_work);
1958
1959         RETURN(rc);
1960 }
1961
1962 /**
1963  * Process list of locks in need of ASTs being sent.
1964  *
1965  * Used on server to send multiple ASTs together instead of sending one by
1966  * one.
1967  */
1968 int ldlm_run_ast_work(struct ldlm_namespace *ns, cfs_list_t *rpc_list,
1969                       ldlm_desc_ast_t ast_type)
1970 {
1971         struct ldlm_cb_set_arg *arg;
1972         set_producer_func       work_ast_lock;
1973         int                     rc;
1974
1975         if (cfs_list_empty(rpc_list))
1976                 RETURN(0);
1977
1978         OBD_ALLOC_PTR(arg);
1979         if (arg == NULL)
1980                 RETURN(-ENOMEM);
1981
1982         cfs_atomic_set(&arg->restart, 0);
1983         arg->list = rpc_list;
1984
1985         switch (ast_type) {
1986                 case LDLM_WORK_BL_AST:
1987                         arg->type = LDLM_BL_CALLBACK;
1988                         work_ast_lock = ldlm_work_bl_ast_lock;
1989                         break;
1990                 case LDLM_WORK_CP_AST:
1991                         arg->type = LDLM_CP_CALLBACK;
1992                         work_ast_lock = ldlm_work_cp_ast_lock;
1993                         break;
1994                 case LDLM_WORK_REVOKE_AST:
1995                         arg->type = LDLM_BL_CALLBACK;
1996                         work_ast_lock = ldlm_work_revoke_ast_lock;
1997                         break;
1998                 case LDLM_WORK_GL_AST:
1999                         arg->type = LDLM_GL_CALLBACK;
2000                         work_ast_lock = ldlm_work_gl_ast_lock;
2001                         break;
2002                 default:
2003                         LBUG();
2004         }
2005
2006         /* We create a ptlrpc request set with flow control extension.
2007          * This request set will use the work_ast_lock function to produce new
2008          * requests and will send a new request each time one completes in order
2009          * to keep the number of requests in flight to ns_max_parallel_ast */
2010         arg->set = ptlrpc_prep_fcset(ns->ns_max_parallel_ast ? : UINT_MAX,
2011                                      work_ast_lock, arg);
2012         if (arg->set == NULL)
2013                 GOTO(out, rc = -ENOMEM);
2014
2015         ptlrpc_set_wait(arg->set);
2016         ptlrpc_set_destroy(arg->set);
2017
2018         rc = cfs_atomic_read(&arg->restart) ? -ERESTART : 0;
2019         GOTO(out, rc);
2020 out:
2021         OBD_FREE_PTR(arg);
2022         return rc;
2023 }
2024
2025 static int reprocess_one_queue(struct ldlm_resource *res, void *closure)
2026 {
2027         ldlm_reprocess_all(res);
2028         return LDLM_ITER_CONTINUE;
2029 }
2030
2031 static int ldlm_reprocess_res(cfs_hash_t *hs, cfs_hash_bd_t *bd,
2032                               cfs_hlist_node_t *hnode, void *arg)
2033 {
2034         struct ldlm_resource *res = cfs_hash_object(hs, hnode);
2035         int    rc;
2036
2037         rc = reprocess_one_queue(res, arg);
2038
2039         return rc == LDLM_ITER_STOP;
2040 }
2041
2042 /**
2043  * Iterate through all resources on a namespace attempting to grant waiting
2044  * locks.
2045  */
2046 void ldlm_reprocess_all_ns(struct ldlm_namespace *ns)
2047 {
2048         ENTRY;
2049
2050         if (ns != NULL) {
2051                 cfs_hash_for_each_nolock(ns->ns_rs_hash,
2052                                          ldlm_reprocess_res, NULL);
2053         }
2054         EXIT;
2055 }
2056 EXPORT_SYMBOL(ldlm_reprocess_all_ns);
2057
2058 /**
2059  * Try to grant all waiting locks on a resource.
2060  *
2061  * Calls ldlm_reprocess_queue on converting and waiting queues.
2062  *
2063  * Typically called after some resource locks are cancelled to see
2064  * if anything could be granted as a result of the cancellation.
2065  */
2066 void ldlm_reprocess_all(struct ldlm_resource *res)
2067 {
2068         CFS_LIST_HEAD(rpc_list);
2069
2070 #ifdef HAVE_SERVER_SUPPORT
2071         int rc;
2072         ENTRY;
2073         /* Local lock trees don't get reprocessed. */
2074         if (ns_is_client(ldlm_res_to_ns(res))) {
2075                 EXIT;
2076                 return;
2077         }
2078
2079 restart:
2080         lock_res(res);
2081         rc = ldlm_reprocess_queue(res, &res->lr_converting, &rpc_list);
2082         if (rc == LDLM_ITER_CONTINUE)
2083                 ldlm_reprocess_queue(res, &res->lr_waiting, &rpc_list);
2084         unlock_res(res);
2085
2086         rc = ldlm_run_ast_work(ldlm_res_to_ns(res), &rpc_list,
2087                                LDLM_WORK_CP_AST);
2088         if (rc == -ERESTART) {
2089                 LASSERT(cfs_list_empty(&rpc_list));
2090                 goto restart;
2091         }
2092 #else
2093         ENTRY;
2094         if (!ns_is_client(ldlm_res_to_ns(res))) {
2095                 CERROR("This is client-side-only module, cannot handle "
2096                        "LDLM_NAMESPACE_SERVER resource type lock.\n");
2097                 LBUG();
2098         }
2099 #endif
2100         EXIT;
2101 }
2102 EXPORT_SYMBOL(ldlm_reprocess_all);
2103
2104 /**
2105  * Helper function to call blocking AST for LDLM lock \a lock in a
2106  * "cancelling" mode.
2107  */
2108 void ldlm_cancel_callback(struct ldlm_lock *lock)
2109 {
2110         check_res_locked(lock->l_resource);
2111         if (!ldlm_is_cancel(lock)) {
2112                 ldlm_set_cancel(lock);
2113                 if (lock->l_blocking_ast) {
2114                         unlock_res_and_lock(lock);
2115                         lock->l_blocking_ast(lock, NULL, lock->l_ast_data,
2116                                              LDLM_CB_CANCELING);
2117                         lock_res_and_lock(lock);
2118                 } else {
2119                         LDLM_DEBUG(lock, "no blocking ast");
2120                 }
2121         }
2122         ldlm_set_bl_done(lock);
2123 }
2124
2125 /**
2126  * Remove skiplist-enabled LDLM lock \a req from granted list
2127  */
2128 void ldlm_unlink_lock_skiplist(struct ldlm_lock *req)
2129 {
2130         if (req->l_resource->lr_type != LDLM_PLAIN &&
2131             req->l_resource->lr_type != LDLM_IBITS)
2132                 return;
2133
2134         cfs_list_del_init(&req->l_sl_policy);
2135         cfs_list_del_init(&req->l_sl_mode);
2136 }
2137
2138 /**
2139  * Attempts to cancel LDLM lock \a lock that has no reader/writer references.
2140  */
2141 void ldlm_lock_cancel(struct ldlm_lock *lock)
2142 {
2143         struct ldlm_resource *res;
2144         struct ldlm_namespace *ns;
2145         ENTRY;
2146
2147         lock_res_and_lock(lock);
2148
2149         res = lock->l_resource;
2150         ns  = ldlm_res_to_ns(res);
2151
2152         /* Please do not, no matter how tempting, remove this LBUG without
2153          * talking to me first. -phik */
2154         if (lock->l_readers || lock->l_writers) {
2155                 LDLM_ERROR(lock, "lock still has references");
2156                 LBUG();
2157         }
2158
2159         if (ldlm_is_waited(lock))
2160                 ldlm_del_waiting_lock(lock);
2161
2162         /* Releases cancel callback. */
2163         ldlm_cancel_callback(lock);
2164
2165         /* Yes, second time, just in case it was added again while we were
2166          * running with no res lock in ldlm_cancel_callback */
2167         if (ldlm_is_waited(lock))
2168                 ldlm_del_waiting_lock(lock);
2169
2170         ldlm_resource_unlink_lock(lock);
2171         ldlm_lock_destroy_nolock(lock);
2172
2173         if (lock->l_granted_mode == lock->l_req_mode)
2174                 ldlm_pool_del(&ns->ns_pool, lock);
2175
2176         /* Make sure we will not be called again for same lock what is possible
2177          * if not to zero out lock->l_granted_mode */
2178         lock->l_granted_mode = LCK_MINMODE;
2179         unlock_res_and_lock(lock);
2180
2181         EXIT;
2182 }
2183 EXPORT_SYMBOL(ldlm_lock_cancel);
2184
2185 /**
2186  * Set opaque data into the lock that only makes sense to upper layer.
2187  */
2188 int ldlm_lock_set_data(struct lustre_handle *lockh, void *data)
2189 {
2190         struct ldlm_lock *lock = ldlm_handle2lock(lockh);
2191         int rc = -EINVAL;
2192         ENTRY;
2193
2194         if (lock) {
2195                 if (lock->l_ast_data == NULL)
2196                         lock->l_ast_data = data;
2197                 if (lock->l_ast_data == data)
2198                         rc = 0;
2199                 LDLM_LOCK_PUT(lock);
2200         }
2201         RETURN(rc);
2202 }
2203 EXPORT_SYMBOL(ldlm_lock_set_data);
2204
2205 struct export_cl_data {
2206         struct obd_export       *ecl_exp;
2207         int                     ecl_loop;
2208 };
2209
2210 /**
2211  * Iterator function for ldlm_cancel_locks_for_export.
2212  * Cancels passed locks.
2213  */
2214 int ldlm_cancel_locks_for_export_cb(cfs_hash_t *hs, cfs_hash_bd_t *bd,
2215                                     cfs_hlist_node_t *hnode, void *data)
2216
2217 {
2218         struct export_cl_data   *ecl = (struct export_cl_data *)data;
2219         struct obd_export       *exp  = ecl->ecl_exp;
2220         struct ldlm_lock     *lock = cfs_hash_object(hs, hnode);
2221         struct ldlm_resource *res;
2222
2223         res = ldlm_resource_getref(lock->l_resource);
2224         LDLM_LOCK_GET(lock);
2225
2226         LDLM_DEBUG(lock, "export %p", exp);
2227         ldlm_res_lvbo_update(res, NULL, 1);
2228         ldlm_lock_cancel(lock);
2229         ldlm_reprocess_all(res);
2230         ldlm_resource_putref(res);
2231         LDLM_LOCK_RELEASE(lock);
2232
2233         ecl->ecl_loop++;
2234         if ((ecl->ecl_loop & -ecl->ecl_loop) == ecl->ecl_loop) {
2235                 CDEBUG(D_INFO,
2236                        "Cancel lock %p for export %p (loop %d), still have "
2237                        "%d locks left on hash table.\n",
2238                        lock, exp, ecl->ecl_loop,
2239                        cfs_atomic_read(&hs->hs_count));
2240         }
2241
2242         return 0;
2243 }
2244
2245 /**
2246  * Cancel all locks for given export.
2247  *
2248  * Typically called on client disconnection/eviction
2249  */
2250 void ldlm_cancel_locks_for_export(struct obd_export *exp)
2251 {
2252         struct export_cl_data   ecl = {
2253                 .ecl_exp        = exp,
2254                 .ecl_loop       = 0,
2255         };
2256
2257         cfs_hash_for_each_empty(exp->exp_lock_hash,
2258                                 ldlm_cancel_locks_for_export_cb, &ecl);
2259 }
2260
2261 /**
2262  * Downgrade an exclusive lock.
2263  *
2264  * A fast variant of ldlm_lock_convert for convertion of exclusive
2265  * locks. The convertion is always successful.
2266  * Used by Commit on Sharing (COS) code.
2267  *
2268  * \param lock A lock to convert
2269  * \param new_mode new lock mode
2270  */
2271 void ldlm_lock_downgrade(struct ldlm_lock *lock, int new_mode)
2272 {
2273         ENTRY;
2274
2275         LASSERT(lock->l_granted_mode & (LCK_PW | LCK_EX));
2276         LASSERT(new_mode == LCK_COS);
2277
2278         lock_res_and_lock(lock);
2279         ldlm_resource_unlink_lock(lock);
2280         /*
2281          * Remove the lock from pool as it will be added again in
2282          * ldlm_grant_lock() called below.
2283          */
2284         ldlm_pool_del(&ldlm_lock_to_ns(lock)->ns_pool, lock);
2285
2286         lock->l_req_mode = new_mode;
2287         ldlm_grant_lock(lock, NULL);
2288         unlock_res_and_lock(lock);
2289         ldlm_reprocess_all(lock->l_resource);
2290
2291         EXIT;
2292 }
2293 EXPORT_SYMBOL(ldlm_lock_downgrade);
2294
2295 /**
2296  * Attempt to convert already granted lock to a different mode.
2297  *
2298  * While lock conversion is not currently used, future client-side
2299  * optimizations could take advantage of it to avoid discarding cached
2300  * pages on a file.
2301  */
2302 struct ldlm_resource *ldlm_lock_convert(struct ldlm_lock *lock, int new_mode,
2303                                         __u32 *flags)
2304 {
2305         CFS_LIST_HEAD(rpc_list);
2306         struct ldlm_resource *res;
2307         struct ldlm_namespace *ns;
2308         int granted = 0;
2309 #ifdef HAVE_SERVER_SUPPORT
2310         int old_mode;
2311         struct sl_insert_point prev;
2312 #endif
2313         struct ldlm_interval *node;
2314         ENTRY;
2315
2316         /* Just return if mode is unchanged. */
2317         if (new_mode == lock->l_granted_mode) {
2318                 *flags |= LDLM_FL_BLOCK_GRANTED;
2319                 RETURN(lock->l_resource);
2320         }
2321
2322         /* I can't check the type of lock here because the bitlock of lock
2323          * is not held here, so do the allocation blindly. -jay */
2324         OBD_SLAB_ALLOC_PTR_GFP(node, ldlm_interval_slab, __GFP_IO);
2325         if (node == NULL)  /* Actually, this causes EDEADLOCK to be returned */
2326                 RETURN(NULL);
2327
2328         LASSERTF((new_mode == LCK_PW && lock->l_granted_mode == LCK_PR),
2329                  "new_mode %u, granted %u\n", new_mode, lock->l_granted_mode);
2330
2331         lock_res_and_lock(lock);
2332
2333         res = lock->l_resource;
2334         ns  = ldlm_res_to_ns(res);
2335
2336 #ifdef HAVE_SERVER_SUPPORT
2337         old_mode = lock->l_req_mode;
2338 #endif
2339         lock->l_req_mode = new_mode;
2340         if (res->lr_type == LDLM_PLAIN || res->lr_type == LDLM_IBITS) {
2341 #ifdef HAVE_SERVER_SUPPORT
2342                 /* remember the lock position where the lock might be
2343                  * added back to the granted list later and also
2344                  * remember the join mode for skiplist fixing. */
2345                 prev.res_link = lock->l_res_link.prev;
2346                 prev.mode_link = lock->l_sl_mode.prev;
2347                 prev.policy_link = lock->l_sl_policy.prev;
2348 #endif
2349                 ldlm_resource_unlink_lock(lock);
2350         } else {
2351                 ldlm_resource_unlink_lock(lock);
2352                 if (res->lr_type == LDLM_EXTENT) {
2353                         /* FIXME: ugly code, I have to attach the lock to a
2354                          * interval node again since perhaps it will be granted
2355                          * soon */
2356                         CFS_INIT_LIST_HEAD(&node->li_group);
2357                         ldlm_interval_attach(node, lock);
2358                         node = NULL;
2359                 }
2360         }
2361
2362         /*
2363          * Remove old lock from the pool before adding the lock with new
2364          * mode below in ->policy()
2365          */
2366         ldlm_pool_del(&ns->ns_pool, lock);
2367
2368         /* If this is a local resource, put it on the appropriate list. */
2369         if (ns_is_client(ldlm_res_to_ns(res))) {
2370                 if (*flags & (LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_GRANTED)) {
2371                         ldlm_resource_add_lock(res, &res->lr_converting, lock);
2372                 } else {
2373                         /* This should never happen, because of the way the
2374                          * server handles conversions. */
2375                         LDLM_ERROR(lock, "Erroneous flags %x on local lock\n",
2376                                    *flags);
2377                         LBUG();
2378
2379                         ldlm_grant_lock(lock, &rpc_list);
2380                         granted = 1;
2381                         /* FIXME: completion handling not with lr_lock held ! */
2382                         if (lock->l_completion_ast)
2383                                 lock->l_completion_ast(lock, 0, NULL);
2384                 }
2385 #ifdef HAVE_SERVER_SUPPORT
2386         } else {
2387                 int rc;
2388                 ldlm_error_t err;
2389                 __u64 pflags = 0;
2390                 ldlm_processing_policy policy;
2391                 policy = ldlm_processing_policy_table[res->lr_type];
2392                 rc = policy(lock, &pflags, 0, &err, &rpc_list);
2393                 if (rc == LDLM_ITER_STOP) {
2394                         lock->l_req_mode = old_mode;
2395                         if (res->lr_type == LDLM_EXTENT)
2396                                 ldlm_extent_add_lock(res, lock);
2397                         else
2398                                 ldlm_granted_list_add_lock(lock, &prev);
2399
2400                         res = NULL;
2401                 } else {
2402                         *flags |= LDLM_FL_BLOCK_GRANTED;
2403                         granted = 1;
2404                 }
2405         }
2406 #else
2407         } else {
2408                 CERROR("This is client-side-only module, cannot handle "
2409                        "LDLM_NAMESPACE_SERVER resource type lock.\n");
2410                 LBUG();
2411         }
2412 #endif
2413         unlock_res_and_lock(lock);
2414
2415         if (granted)
2416                 ldlm_run_ast_work(ns, &rpc_list, LDLM_WORK_CP_AST);
2417         if (node)
2418                 OBD_SLAB_FREE(node, ldlm_interval_slab, sizeof(*node));
2419         RETURN(res);
2420 }
2421 EXPORT_SYMBOL(ldlm_lock_convert);
2422
2423 /**
2424  * Print lock with lock handle \a lockh description into debug log.
2425  *
2426  * Used when printing all locks on a resource for debug purposes.
2427  */
2428 void ldlm_lock_dump_handle(int level, struct lustre_handle *lockh)
2429 {
2430         struct ldlm_lock *lock;
2431
2432         if (!((libcfs_debug | D_ERROR) & level))
2433                 return;
2434
2435         lock = ldlm_handle2lock(lockh);
2436         if (lock == NULL)
2437                 return;
2438
2439         LDLM_DEBUG_LIMIT(level, lock, "###");
2440
2441         LDLM_LOCK_PUT(lock);
2442 }
2443 EXPORT_SYMBOL(ldlm_lock_dump_handle);
2444
2445 /**
2446  * Print lock information with custom message into debug log.
2447  * Helper function.
2448  */
2449 void _ldlm_lock_debug(struct ldlm_lock *lock,
2450                       struct libcfs_debug_msg_data *msgdata,
2451                       const char *fmt, ...)
2452 {
2453         va_list args;
2454         struct obd_export *exp = lock->l_export;
2455         struct ldlm_resource *resource = lock->l_resource;
2456         char *nid = "local";
2457
2458         va_start(args, fmt);
2459
2460         if (exp && exp->exp_connection) {
2461                 nid = libcfs_nid2str(exp->exp_connection->c_peer.nid);
2462         } else if (exp && exp->exp_obd != NULL) {
2463                 struct obd_import *imp = exp->exp_obd->u.cli.cl_import;
2464                 nid = libcfs_nid2str(imp->imp_connection->c_peer.nid);
2465         }
2466
2467         if (resource == NULL) {
2468                 libcfs_debug_vmsg2(msgdata, fmt, args,
2469                        " ns: \?\? lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2470                        "res: \?\? rrc=\?\? type: \?\?\? flags: "LPX64" nid: %s "
2471                        "remote: "LPX64" expref: %d pid: %u timeout: %lu "
2472                        "lvb_type: %d\n",
2473                        lock,
2474                        lock->l_handle.h_cookie, cfs_atomic_read(&lock->l_refc),
2475                        lock->l_readers, lock->l_writers,
2476                        ldlm_lockname[lock->l_granted_mode],
2477                        ldlm_lockname[lock->l_req_mode],
2478                        lock->l_flags, nid, lock->l_remote_handle.cookie,
2479                        exp ? cfs_atomic_read(&exp->exp_refcount) : -99,
2480                        lock->l_pid, lock->l_callback_timeout, lock->l_lvb_type);
2481                 va_end(args);
2482                 return;
2483         }
2484
2485         switch (resource->lr_type) {
2486         case LDLM_EXTENT:
2487                 libcfs_debug_vmsg2(msgdata, fmt, args,
2488                         " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2489                         "res: "DLDLMRES" rrc: %d type: %s ["LPU64"->"LPU64"] "
2490                         "(req "LPU64"->"LPU64") flags: "LPX64" nid: %s remote: "
2491                         LPX64" expref: %d pid: %u timeout: %lu lvb_type: %d\n",
2492                         ldlm_lock_to_ns_name(lock), lock,
2493                         lock->l_handle.h_cookie, cfs_atomic_read(&lock->l_refc),
2494                         lock->l_readers, lock->l_writers,
2495                         ldlm_lockname[lock->l_granted_mode],
2496                         ldlm_lockname[lock->l_req_mode],
2497                         PLDLMRES(resource),
2498                         cfs_atomic_read(&resource->lr_refcount),
2499                         ldlm_typename[resource->lr_type],
2500                         lock->l_policy_data.l_extent.start,
2501                         lock->l_policy_data.l_extent.end,
2502                         lock->l_req_extent.start, lock->l_req_extent.end,
2503                         lock->l_flags, nid, lock->l_remote_handle.cookie,
2504                         exp ? cfs_atomic_read(&exp->exp_refcount) : -99,
2505                         lock->l_pid, lock->l_callback_timeout,
2506                         lock->l_lvb_type);
2507                 break;
2508
2509         case LDLM_FLOCK:
2510                 libcfs_debug_vmsg2(msgdata, fmt, args,
2511                         " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2512                         "res: "DLDLMRES" rrc: %d type: %s pid: %d "
2513                         "["LPU64"->"LPU64"] flags: "LPX64" nid: %s "
2514                         "remote: "LPX64" expref: %d pid: %u timeout: %lu\n",
2515                         ldlm_lock_to_ns_name(lock), lock,
2516                         lock->l_handle.h_cookie, cfs_atomic_read(&lock->l_refc),
2517                         lock->l_readers, lock->l_writers,
2518                         ldlm_lockname[lock->l_granted_mode],
2519                         ldlm_lockname[lock->l_req_mode],
2520                         PLDLMRES(resource),
2521                         cfs_atomic_read(&resource->lr_refcount),
2522                         ldlm_typename[resource->lr_type],
2523                         lock->l_policy_data.l_flock.pid,
2524                         lock->l_policy_data.l_flock.start,
2525                         lock->l_policy_data.l_flock.end,
2526                         lock->l_flags, nid, lock->l_remote_handle.cookie,
2527                         exp ? cfs_atomic_read(&exp->exp_refcount) : -99,
2528                         lock->l_pid, lock->l_callback_timeout);
2529                 break;
2530
2531         case LDLM_IBITS:
2532                 libcfs_debug_vmsg2(msgdata, fmt, args,
2533                         " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2534                         "res: "DLDLMRES" bits "LPX64" rrc: %d type: %s "
2535                         "flags: "LPX64" nid: %s remote: "LPX64" expref: %d "
2536                         "pid: %u timeout: %lu lvb_type: %d\n",
2537                         ldlm_lock_to_ns_name(lock),
2538                         lock, lock->l_handle.h_cookie,
2539                         cfs_atomic_read(&lock->l_refc),
2540                         lock->l_readers, lock->l_writers,
2541                         ldlm_lockname[lock->l_granted_mode],
2542                         ldlm_lockname[lock->l_req_mode],
2543                         PLDLMRES(resource),
2544                         lock->l_policy_data.l_inodebits.bits,
2545                         cfs_atomic_read(&resource->lr_refcount),
2546                         ldlm_typename[resource->lr_type],
2547                         lock->l_flags, nid, lock->l_remote_handle.cookie,
2548                         exp ? cfs_atomic_read(&exp->exp_refcount) : -99,
2549                         lock->l_pid, lock->l_callback_timeout,
2550                         lock->l_lvb_type);
2551                 break;
2552
2553         default:
2554                 libcfs_debug_vmsg2(msgdata, fmt, args,
2555                         " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2556                         "res: "DLDLMRES" rrc: %d type: %s flags: "LPX64" "
2557                         "nid: %s remote: "LPX64" expref: %d pid: %u "
2558                         "timeout: %lu lvb_type: %d\n",
2559                         ldlm_lock_to_ns_name(lock),
2560                         lock, lock->l_handle.h_cookie,
2561                         cfs_atomic_read(&lock->l_refc),
2562                         lock->l_readers, lock->l_writers,
2563                         ldlm_lockname[lock->l_granted_mode],
2564                         ldlm_lockname[lock->l_req_mode],
2565                         PLDLMRES(resource),
2566                         cfs_atomic_read(&resource->lr_refcount),
2567                         ldlm_typename[resource->lr_type],
2568                         lock->l_flags, nid, lock->l_remote_handle.cookie,
2569                         exp ? cfs_atomic_read(&exp->exp_refcount) : -99,
2570                         lock->l_pid, lock->l_callback_timeout,
2571                         lock->l_lvb_type);
2572                 break;
2573         }
2574         va_end(args);
2575 }
2576 EXPORT_SYMBOL(_ldlm_lock_debug);