Whamcloud - gitweb
b=13766
[fs/lustre-release.git] / lustre / ldlm / ldlm_resource.c
1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
2  * vim:expandtab:shiftwidth=8:tabstop=8:
3  *
4  * Copyright (C) 2002, 2003 Cluster File Systems, Inc.
5  *   Author: Phil Schwan <phil@clusterfs.com>
6  *   Author: Peter Braam <braam@clusterfs.com>
7  *
8  *   This file is part of the Lustre file system, http://www.lustre.org
9  *   Lustre is a trademark of Cluster File Systems, Inc.
10  *
11  *   You may have signed or agreed to another license before downloading
12  *   this software.  If so, you are bound by the terms and conditions
13  *   of that agreement, and the following does not apply to you.  See the
14  *   LICENSE file included with this distribution for more information.
15  *
16  *   If you did not agree to a different license, then this copy of Lustre
17  *   is open source software; you can redistribute it and/or modify it
18  *   under the terms of version 2 of the GNU General Public License as
19  *   published by the Free Software Foundation.
20  *
21  *   In either case, Lustre is distributed in the hope that it will be
22  *   useful, but WITHOUT ANY WARRANTY; without even the implied warranty
23  *   of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
24  *   license text for more details.
25  */
26
27 #define DEBUG_SUBSYSTEM S_LDLM
28 #ifdef __KERNEL__
29 # include <lustre_dlm.h>
30 #else
31 # include <liblustre.h>
32 #endif
33
34 #include <obd_class.h>
35 #include "ldlm_internal.h"
36
37 cfs_mem_cache_t *ldlm_resource_slab, *ldlm_lock_slab;
38
39 atomic_t ldlm_srv_namespace_nr = ATOMIC_INIT(0);
40 atomic_t ldlm_cli_namespace_nr = ATOMIC_INIT(0);
41
42 struct semaphore ldlm_srv_namespace_lock;
43 struct list_head ldlm_srv_namespace_list = 
44         CFS_LIST_HEAD_INIT(ldlm_srv_namespace_list);
45
46 struct semaphore ldlm_cli_namespace_lock;
47 struct list_head ldlm_cli_namespace_list = 
48         CFS_LIST_HEAD_INIT(ldlm_cli_namespace_list);
49
50 cfs_proc_dir_entry_t *ldlm_type_proc_dir = NULL;
51 cfs_proc_dir_entry_t *ldlm_ns_proc_dir = NULL;
52 cfs_proc_dir_entry_t *ldlm_svc_proc_dir = NULL;
53
54 #ifdef LPROCFS
55 static int ldlm_proc_dump_ns(struct file *file, const char *buffer,
56                              unsigned long count, void *data)
57 {
58         ldlm_dump_all_namespaces(LDLM_NAMESPACE_SERVER, D_DLMTRACE);
59         ldlm_dump_all_namespaces(LDLM_NAMESPACE_CLIENT, D_DLMTRACE);
60         RETURN(count);
61 }
62
63 int ldlm_proc_setup(void)
64 {
65         int rc;
66         struct lprocfs_vars list[] = {
67                 { "dump_namespaces", NULL, ldlm_proc_dump_ns, NULL },
68                 { NULL }};
69         ENTRY;
70         LASSERT(ldlm_ns_proc_dir == NULL);
71
72         ldlm_type_proc_dir = lprocfs_register(OBD_LDLM_DEVICENAME,
73                                               proc_lustre_root,
74                                               NULL, NULL);
75         if (IS_ERR(ldlm_type_proc_dir)) {
76                 CERROR("LProcFS failed in ldlm-init\n");
77                 rc = PTR_ERR(ldlm_type_proc_dir);
78                 GOTO(err, rc);
79         }
80
81         ldlm_ns_proc_dir = lprocfs_register("namespaces",
82                                             ldlm_type_proc_dir,
83                                             NULL, NULL);
84         if (IS_ERR(ldlm_ns_proc_dir)) {
85                 CERROR("LProcFS failed in ldlm-init\n");
86                 rc = PTR_ERR(ldlm_ns_proc_dir);
87                 GOTO(err_type, rc);
88         }
89
90         ldlm_svc_proc_dir = lprocfs_register("services",
91                                             ldlm_type_proc_dir,
92                                             NULL, NULL);
93         if (IS_ERR(ldlm_svc_proc_dir)) {
94                 CERROR("LProcFS failed in ldlm-init\n");
95                 rc = PTR_ERR(ldlm_svc_proc_dir);
96                 GOTO(err_ns, rc);
97         }
98
99         rc = lprocfs_add_vars(ldlm_type_proc_dir, list, NULL);
100
101         RETURN(0);
102
103 err_ns:
104         lprocfs_remove(&ldlm_ns_proc_dir);
105 err_type:
106         lprocfs_remove(&ldlm_type_proc_dir);
107 err:
108         ldlm_svc_proc_dir = NULL;
109         RETURN(rc);
110 }
111
112 void ldlm_proc_cleanup(void)
113 {
114         if (ldlm_svc_proc_dir)
115                 lprocfs_remove(&ldlm_svc_proc_dir);
116
117         if (ldlm_ns_proc_dir)
118                 lprocfs_remove(&ldlm_ns_proc_dir);
119
120         if (ldlm_type_proc_dir)
121                 lprocfs_remove(&ldlm_type_proc_dir);
122 }
123
124 static int lprocfs_rd_lru_size(char *page, char **start, off_t off,
125                                int count, int *eof, void *data)
126 {
127         struct ldlm_namespace *ns = data;
128         __u32 *nr = &ns->ns_max_unused;
129
130         if (ns_connect_lru_resize(ns))
131                 nr = &ns->ns_nr_unused;
132         return lprocfs_rd_uint(page, start, off, count, eof, nr);
133 }
134
135 static int lprocfs_wr_lru_size(struct file *file, const char *buffer,
136                                unsigned long count, void *data)
137 {
138         struct ldlm_namespace *ns = data;
139         char dummy[MAX_STRING_SIZE + 1], *end;
140         unsigned long tmp;
141         int lru_resize;
142
143         dummy[MAX_STRING_SIZE] = '\0';
144         if (copy_from_user(dummy, buffer, MAX_STRING_SIZE))
145                 return -EFAULT;
146
147         if (count == 6 && memcmp(dummy, "clear", 5) == 0) {
148                 CDEBUG(D_DLMTRACE,
149                        "dropping all unused locks from namespace %s\n",
150                        ns->ns_name);
151                 if (ns_connect_lru_resize(ns)) {
152                         int canceled, unused  = ns->ns_nr_unused;
153                         
154                         /* Try to cancel all @ns_nr_unused locks. */
155                         canceled = ldlm_cancel_lru(ns, unused, LDLM_SYNC, 
156                                                    LDLM_CANCEL_PASSED);
157                         if (canceled < unused) {
158                                 CERROR("not all requested locks are canceled, "
159                                        "requested: %d, canceled: %d\n", unused, 
160                                        canceled);
161                                 return -EINVAL;
162                         }
163                 } else {
164                         tmp = ns->ns_max_unused;
165                         ns->ns_max_unused = 0;
166                         ldlm_cancel_lru(ns, 0, LDLM_SYNC, LDLM_CANCEL_PASSED);
167                         ns->ns_max_unused = tmp;
168                 }
169                 return count;
170         }
171
172         tmp = simple_strtoul(dummy, &end, 0);
173         if (dummy == end) {
174                 CERROR("invalid value written\n");
175                 return -EINVAL;
176         }
177         lru_resize = (tmp == 0);
178         
179         if (ns_connect_lru_resize(ns)) {
180                 if (!lru_resize)
181                         ns->ns_max_unused = (unsigned int)tmp;
182                         
183                 if (tmp > ns->ns_nr_unused)
184                         tmp = ns->ns_nr_unused;
185                 tmp = ns->ns_nr_unused - tmp;
186                 
187                 CDEBUG(D_DLMTRACE, "changing namespace %s unused locks from %u to %u\n", 
188                        ns->ns_name, ns->ns_nr_unused, (unsigned int)tmp);
189                 ldlm_cancel_lru(ns, (unsigned int)tmp, LDLM_ASYNC, LDLM_CANCEL_PASSED);
190                 
191                 if (!lru_resize) {
192                         CDEBUG(D_DLMTRACE, "disable lru_resize for namespace %s\n", 
193                                ns->ns_name);
194                         ns->ns_connect_flags &= ~OBD_CONNECT_LRU_RESIZE;
195                 }
196         } else {
197                 CDEBUG(D_DLMTRACE, "changing namespace %s max_unused from %u to %u\n",
198                        ns->ns_name, ns->ns_max_unused, (unsigned int)tmp);
199                 ns->ns_max_unused = (unsigned int)tmp;
200                 ldlm_cancel_lru(ns, 0, LDLM_ASYNC, LDLM_CANCEL_PASSED);
201                 
202                 /* Make sure that originally lru resize was supported before 
203                  * turning it on here. */
204                 if (lru_resize && 
205                     (ns->ns_orig_connect_flags & OBD_CONNECT_LRU_RESIZE)) {
206                         CDEBUG(D_DLMTRACE, "enable lru_resize for namespace %s\n", 
207                                ns->ns_name);
208                         ns->ns_connect_flags |= OBD_CONNECT_LRU_RESIZE;
209                 }
210         }
211
212         return count;
213 }
214
215 void ldlm_proc_namespace(struct ldlm_namespace *ns)
216 {
217         struct lprocfs_vars lock_vars[2];
218         char lock_name[MAX_STRING_SIZE + 1];
219
220         LASSERT(ns != NULL);
221         LASSERT(ns->ns_name != NULL);
222
223         lock_name[MAX_STRING_SIZE] = '\0';
224
225         memset(lock_vars, 0, sizeof(lock_vars));
226         lock_vars[0].name = lock_name;
227
228         snprintf(lock_name, MAX_STRING_SIZE, "%s/resource_count", ns->ns_name);
229         lock_vars[0].data = &ns->ns_refcount;
230         lock_vars[0].read_fptr = lprocfs_rd_atomic;
231         lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
232
233         snprintf(lock_name, MAX_STRING_SIZE, "%s/lock_count", ns->ns_name);
234         lock_vars[0].data = &ns->ns_locks;
235         lock_vars[0].read_fptr = lprocfs_rd_atomic;
236         lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
237
238         if (ns_is_client(ns)) {
239                 snprintf(lock_name, MAX_STRING_SIZE, "%s/lock_unused_count",
240                          ns->ns_name);
241                 lock_vars[0].data = &ns->ns_nr_unused;
242                 lock_vars[0].read_fptr = lprocfs_rd_uint;
243                 lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
244
245                 snprintf(lock_name, MAX_STRING_SIZE, "%s/lru_size",
246                          ns->ns_name);
247                 lock_vars[0].data = ns;
248                 lock_vars[0].read_fptr = lprocfs_rd_lru_size;
249                 lock_vars[0].write_fptr = lprocfs_wr_lru_size;
250                 lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
251
252                 snprintf(lock_name, MAX_STRING_SIZE, "%s/shrink_thumb",
253                          ns->ns_name);
254                 lock_vars[0].data = ns;
255                 lock_vars[0].read_fptr = lprocfs_rd_uint;
256                 lock_vars[0].write_fptr = lprocfs_wr_uint;
257                 lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
258
259                 snprintf(lock_name, MAX_STRING_SIZE, "%s/lru_max_age",
260                          ns->ns_name);
261                 lock_vars[0].data = &ns->ns_max_age;
262                 lock_vars[0].read_fptr = lprocfs_rd_uint;
263                 lock_vars[0].write_fptr = lprocfs_wr_uint;
264                 lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
265         }
266 }
267 #undef MAX_STRING_SIZE
268 #else
269 #define ldlm_proc_namespace(ns) do {} while (0)
270 #endif /* LPROCFS */
271
272 struct ldlm_namespace *ldlm_namespace_new(char *name, ldlm_side_t client, 
273                                           ldlm_appetite_t apt)
274 {
275         struct ldlm_namespace *ns = NULL;
276         struct list_head *bucket;
277         int rc, idx, namelen;
278         ENTRY;
279
280         rc = ldlm_get_ref();
281         if (rc) {
282                 CERROR("ldlm_get_ref failed: %d\n", rc);
283                 RETURN(NULL);
284         }
285
286         OBD_ALLOC_PTR(ns);
287         if (!ns)
288                 GOTO(out_ref, NULL);
289
290         OBD_VMALLOC(ns->ns_hash, sizeof(*ns->ns_hash) * RES_HASH_SIZE);
291         if (!ns->ns_hash)
292                 GOTO(out_ns, NULL);
293
294         ns->ns_shrink_thumb = LDLM_LOCK_SHRINK_THUMB;
295         ns->ns_appetite = apt;
296         namelen = strlen(name);
297         OBD_ALLOC(ns->ns_name, namelen + 1);
298         if (!ns->ns_name)
299                 GOTO(out_hash, NULL);
300
301         strcpy(ns->ns_name, name);
302
303         CFS_INIT_LIST_HEAD(&ns->ns_root_list);
304         ns->ns_refcount = 0;
305         ns->ns_client = client;
306         spin_lock_init(&ns->ns_hash_lock);
307         atomic_set(&ns->ns_locks, 0);
308         ns->ns_resources = 0;
309         cfs_waitq_init(&ns->ns_waitq);
310
311         for (bucket = ns->ns_hash + RES_HASH_SIZE - 1; bucket >= ns->ns_hash;
312              bucket--)
313                 CFS_INIT_LIST_HEAD(bucket);
314
315         CFS_INIT_LIST_HEAD(&ns->ns_unused_list);
316         ns->ns_nr_unused = 0;
317         ns->ns_max_unused = LDLM_DEFAULT_LRU_SIZE;
318         ns->ns_max_age = LDLM_DEFAULT_MAX_ALIVE;
319         spin_lock_init(&ns->ns_unused_lock);
320         ns->ns_orig_connect_flags = 0;
321         ns->ns_connect_flags = 0;
322         ldlm_proc_namespace(ns);
323
324         idx = atomic_read(ldlm_namespace_nr(client));
325         rc = ldlm_pool_init(&ns->ns_pool, ns, idx, client);
326         if (rc) {
327                 CERROR("Can't initialize lock pool, rc %d\n", rc);
328                 GOTO(out_proc, rc);
329         }
330
331         mutex_down(ldlm_namespace_lock(client));
332         list_add(&ns->ns_list_chain, ldlm_namespace_list(client));
333         atomic_inc(ldlm_namespace_nr(client));
334         mutex_up(ldlm_namespace_lock(client));
335
336         RETURN(ns);
337 out_proc:
338         ldlm_namespace_cleanup(ns, 0);
339         OBD_FREE(ns->ns_name, namelen + 1);
340 out_hash:
341         OBD_VFREE(ns->ns_hash, sizeof(*ns->ns_hash) * RES_HASH_SIZE);
342 out_ns:
343         OBD_FREE_PTR(ns);
344 out_ref:
345         ldlm_put_ref(0);
346         RETURN(NULL);
347 }
348
349 extern struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock);
350
351 /* If flags contains FL_LOCAL_ONLY, don't try to tell the server, just cleanup.
352  * This is currently only used for recovery, and we make certain assumptions
353  * as a result--notably, that we shouldn't cancel locks with refs. -phil
354  *
355  * Called with the ns_lock held. */
356 static void cleanup_resource(struct ldlm_resource *res, struct list_head *q,
357                              int flags)
358 {
359         struct list_head *tmp;
360         int rc = 0, client = ns_is_client(res->lr_namespace);
361         int local_only = (flags & LDLM_FL_LOCAL_ONLY);
362         ENTRY;
363
364
365         do {
366                 struct ldlm_lock *lock = NULL;
367
368                 /* first, we look for non-cleaned-yet lock
369                  * all cleaned locks are marked by CLEANED flag */
370                 lock_res(res);
371                 list_for_each(tmp, q) {
372                         lock = list_entry(tmp, struct ldlm_lock, l_res_link);
373                         if (lock->l_flags & LDLM_FL_CLEANED) {
374                                 lock = NULL;
375                                 continue;
376                         }
377                         LDLM_LOCK_GET(lock);
378                         lock->l_flags |= LDLM_FL_CLEANED;
379                         break;
380                 }
381
382                 if (lock == NULL) {
383                         unlock_res(res);
384                         break;
385                 }
386
387                 /* Set CBPENDING so nothing in the cancellation path
388                  * can match this lock */
389                 lock->l_flags |= LDLM_FL_CBPENDING;
390                 lock->l_flags |= LDLM_FL_FAILED;
391                 lock->l_flags |= flags;
392
393                 /* ... without sending a CANCEL message for local_only. */
394                 if (local_only)
395                         lock->l_flags |= LDLM_FL_LOCAL_ONLY;
396
397                 if (local_only && (lock->l_readers || lock->l_writers)) {
398                         /* This is a little bit gross, but much better than the
399                          * alternative: pretend that we got a blocking AST from
400                          * the server, so that when the lock is decref'd, it
401                          * will go away ... */
402                         unlock_res(res);
403                         LDLM_DEBUG(lock, "setting FL_LOCAL_ONLY");
404                         if (lock->l_completion_ast)
405                                 lock->l_completion_ast(lock, 0, NULL);
406                         LDLM_LOCK_PUT(lock);
407                         continue;
408                 }
409
410                 if (client) {
411                         struct lustre_handle lockh;
412
413                         unlock_res(res);
414                         ldlm_lock2handle(lock, &lockh);
415                         rc = ldlm_cli_cancel(&lockh);
416                         if (rc)
417                                 CERROR("ldlm_cli_cancel: %d\n", rc);
418                 } else {
419                         ldlm_resource_unlink_lock(lock);
420                         unlock_res(res);
421                         LDLM_DEBUG(lock, "Freeing a lock still held by a "
422                                    "client node");
423                         ldlm_lock_destroy(lock);
424                 }
425                 LDLM_LOCK_PUT(lock);
426         } while (1);
427
428         EXIT;
429 }
430
431 int ldlm_namespace_cleanup(struct ldlm_namespace *ns, int flags)
432 {
433         struct list_head *tmp;
434         int i;
435
436         if (ns == NULL) {
437                 CDEBUG(D_INFO, "NULL ns, skipping cleanup\n");
438                 return ELDLM_OK;
439         }
440
441         for (i = 0; i < RES_HASH_SIZE; i++) {
442                 spin_lock(&ns->ns_hash_lock);
443                 tmp = ns->ns_hash[i].next;
444                 while (tmp != &(ns->ns_hash[i])) {
445                         struct ldlm_resource *res;
446                         res = list_entry(tmp, struct ldlm_resource, lr_hash);
447                         ldlm_resource_getref(res);
448                         spin_unlock(&ns->ns_hash_lock);
449
450                         cleanup_resource(res, &res->lr_granted, flags);
451                         cleanup_resource(res, &res->lr_converting, flags);
452                         cleanup_resource(res, &res->lr_waiting, flags);
453
454                         spin_lock(&ns->ns_hash_lock);
455                         tmp  = tmp->next;
456
457                         /* XXX: former stuff caused issues in case of race
458                          * between ldlm_namespace_cleanup() and lockd() when
459                          * client gets blocking ast when lock gets distracted by
460                          * server. This is 1_4 branch solution, let's see how
461                          * will it behave. */
462                         if (!ldlm_resource_putref_locked(res))
463                                 CDEBUG(D_INFO,
464                                        "Namespace %s resource refcount nonzero "
465                                        "(%d) after lock cleanup; forcing cleanup.\n",
466                                        ns->ns_name, atomic_read(&res->lr_refcount));
467                 }
468                 spin_unlock(&ns->ns_hash_lock);
469         }
470
471         return ELDLM_OK;
472 }
473
474 /* Cleanup, but also free, the namespace */
475 int ldlm_namespace_free(struct ldlm_namespace *ns, int force)
476 {
477         ENTRY;
478         if (!ns)
479                 RETURN(ELDLM_OK);
480
481         mutex_down(ldlm_namespace_lock(ns->ns_client));
482         list_del(&ns->ns_list_chain);
483         atomic_dec(ldlm_namespace_nr(ns->ns_client));
484         ldlm_pool_fini(&ns->ns_pool);
485         mutex_up(ldlm_namespace_lock(ns->ns_client));
486
487         /* At shutdown time, don't call the cancellation callback */
488         ldlm_namespace_cleanup(ns, 0);
489
490 #ifdef LPROCFS
491         {
492                 struct proc_dir_entry *dir;
493                 dir = lprocfs_srch(ldlm_ns_proc_dir, ns->ns_name);
494                 if (dir == NULL) {
495                         CERROR("dlm namespace %s has no procfs dir?\n",
496                                ns->ns_name);
497                 } else {
498                         lprocfs_remove(&dir);
499                 }
500         }
501 #endif
502
503         if (ns->ns_refcount > 0) {
504                 struct l_wait_info lwi = LWI_INTR(LWI_ON_SIGNAL_NOOP, NULL);
505                 int rc;
506                 CDEBUG(D_DLMTRACE,
507                        "dlm namespace %s free waiting on refcount %d\n",
508                        ns->ns_name, ns->ns_refcount);
509                 rc = l_wait_event(ns->ns_waitq,
510                                   ns->ns_refcount == 0, &lwi);
511                 if (ns->ns_refcount)
512                         LCONSOLE_ERROR_MSG(0x139, "Lock manager: wait for %s "
513                                            "namespace cleanup aborted with %d "
514                                            "resources in use. (%d)\nI'm going "
515                                            "to try to clean up anyway, but I "
516                                            "might need a reboot of this node.\n",
517                                             ns->ns_name, (int) ns->ns_refcount, 
518                                             rc);
519                 CDEBUG(D_DLMTRACE,
520                        "dlm namespace %s free done waiting\n", ns->ns_name);
521         }
522
523         OBD_VFREE(ns->ns_hash, sizeof(*ns->ns_hash) * RES_HASH_SIZE);
524         OBD_FREE(ns->ns_name, strlen(ns->ns_name) + 1);
525         OBD_FREE_PTR(ns);
526
527         ldlm_put_ref(force);
528
529         RETURN(ELDLM_OK);
530 }
531
532 void ldlm_namespace_get_nolock(struct ldlm_namespace *ns)
533 {
534         LASSERT(ns->ns_refcount >= 0);
535         ns->ns_refcount++;
536 }
537
538 void ldlm_namespace_get(struct ldlm_namespace *ns)
539 {
540         spin_lock(&ns->ns_hash_lock);
541         ldlm_namespace_get_nolock(ns);
542         spin_unlock(&ns->ns_hash_lock);
543 }
544
545 void ldlm_namespace_put_nolock(struct ldlm_namespace *ns, int wakeup)
546 {
547         LASSERT(ns->ns_refcount > 0);
548         ns->ns_refcount--;
549         if (ns->ns_refcount == 0 && wakeup)
550                 wake_up(&ns->ns_waitq);
551 }
552
553 void ldlm_namespace_put(struct ldlm_namespace *ns, int wakeup)
554 {
555         spin_lock(&ns->ns_hash_lock);
556         ldlm_namespace_put_nolock(ns, wakeup);
557         spin_unlock(&ns->ns_hash_lock);
558 }
559
560 /* Should be called under ldlm_namespace_lock(client) taken */
561 void ldlm_namespace_move(struct ldlm_namespace *ns, ldlm_side_t client)
562 {
563         LASSERT(!list_empty(&ns->ns_list_chain));
564         LASSERT_SEM_LOCKED(ldlm_namespace_lock(client));
565         list_move_tail(&ns->ns_list_chain, ldlm_namespace_list(client));
566 }
567
568 /* Should be called under ldlm_namespace_lock(client) taken */
569 struct ldlm_namespace *ldlm_namespace_first(ldlm_side_t client)
570 {
571         LASSERT_SEM_LOCKED(ldlm_namespace_lock(client));
572         LASSERT(!list_empty(ldlm_namespace_list(client)));
573         return container_of(ldlm_namespace_list(client)->next, 
574                 struct ldlm_namespace, ns_list_chain);
575 }
576 static __u32 ldlm_hash_fn(struct ldlm_resource *parent,
577                           const struct ldlm_res_id *name)
578 {
579         __u32 hash = 0;
580         int i;
581
582         for (i = 0; i < RES_NAME_SIZE; i++)
583                 hash += name->name[i];
584
585         hash += (__u32)((unsigned long)parent >> 4);
586
587         return (hash & RES_HASH_MASK);
588 }
589
590 static struct ldlm_resource *ldlm_resource_new(void)
591 {
592         struct ldlm_resource *res;
593
594         OBD_SLAB_ALLOC(res, ldlm_resource_slab, CFS_ALLOC_IO, sizeof *res);
595         if (res == NULL)
596                 return NULL;
597
598         memset(res, 0, sizeof(*res));
599
600         CFS_INIT_LIST_HEAD(&res->lr_children);
601         CFS_INIT_LIST_HEAD(&res->lr_childof);
602         CFS_INIT_LIST_HEAD(&res->lr_granted);
603         CFS_INIT_LIST_HEAD(&res->lr_converting);
604         CFS_INIT_LIST_HEAD(&res->lr_waiting);
605         atomic_set(&res->lr_refcount, 1);
606         spin_lock_init(&res->lr_lock);
607
608         /* one who creates the resource must unlock
609          * the semaphore after lvb initialization */
610         init_MUTEX_LOCKED(&res->lr_lvb_sem);
611
612         return res;
613 }
614
615 /* must be called with hash lock held */
616 static struct ldlm_resource *
617 ldlm_resource_find(struct ldlm_namespace *ns, const struct ldlm_res_id *name,
618                    __u32 hash)
619 {
620         struct list_head *bucket, *tmp;
621         struct ldlm_resource *res;
622
623         LASSERT_SPIN_LOCKED(&ns->ns_hash_lock);
624         bucket = ns->ns_hash + hash;
625
626         list_for_each(tmp, bucket) {
627                 res = list_entry(tmp, struct ldlm_resource, lr_hash);
628                 if (memcmp(&res->lr_name, name, sizeof(res->lr_name)) == 0)
629                         return res;
630         }
631
632         return NULL;
633 }
634
635 /* Args: locked namespace
636  * Returns: newly-allocated, referenced, unlocked resource */
637 static struct ldlm_resource *
638 ldlm_resource_add(struct ldlm_namespace *ns, struct ldlm_resource *parent,
639                   const struct ldlm_res_id *name, __u32 hash, ldlm_type_t type)
640 {
641         struct list_head *bucket;
642         struct ldlm_resource *res, *old_res;
643         ENTRY;
644
645         LASSERTF(type >= LDLM_MIN_TYPE && type < LDLM_MAX_TYPE,
646                  "type: %d\n", type);
647
648         res = ldlm_resource_new();
649         if (!res)
650                 RETURN(NULL);
651
652         res->lr_name = *name;
653         res->lr_namespace = ns;
654         res->lr_type = type;
655         res->lr_most_restr = LCK_NL;
656
657         spin_lock(&ns->ns_hash_lock);
658         old_res = ldlm_resource_find(ns, name, hash);
659         if (old_res) {
660                 /* someone won the race and added the resource before */
661                 ldlm_resource_getref(old_res);
662                 spin_unlock(&ns->ns_hash_lock);
663                 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
664                 /* synchronize WRT resource creation */
665                 if (ns->ns_lvbo && ns->ns_lvbo->lvbo_init) {
666                         down(&old_res->lr_lvb_sem);
667                         up(&old_res->lr_lvb_sem);
668                 }
669                 RETURN(old_res);
670         }
671
672         /* we won! let's add the resource */
673         bucket = ns->ns_hash + hash;
674         list_add(&res->lr_hash, bucket);
675         ns->ns_resources++;
676         ldlm_namespace_get_nolock(ns);
677
678         if (parent == NULL) {
679                 list_add(&res->lr_childof, &ns->ns_root_list);
680         } else {
681                 res->lr_parent = parent;
682                 list_add(&res->lr_childof, &parent->lr_children);
683         }
684         spin_unlock(&ns->ns_hash_lock);
685
686         if (ns->ns_lvbo && ns->ns_lvbo->lvbo_init) {
687                 int rc;
688
689                 OBD_FAIL_TIMEOUT(OBD_FAIL_LDLM_CREATE_RESOURCE, 2);
690                 rc = ns->ns_lvbo->lvbo_init(res);
691                 if (rc)
692                         CERROR("lvbo_init failed for resource "
693                                LPU64": rc %d\n", name->name[0], rc);
694                 /* we create resource with locked lr_lvb_sem */
695                 up(&res->lr_lvb_sem);
696         }
697
698         RETURN(res);
699 }
700
701 /* Args: unlocked namespace
702  * Locks: takes and releases ns->ns_lock and res->lr_lock
703  * Returns: referenced, unlocked ldlm_resource or NULL */
704 struct ldlm_resource *
705 ldlm_resource_get(struct ldlm_namespace *ns, struct ldlm_resource *parent,
706                   const struct ldlm_res_id *name, ldlm_type_t type, int create)
707 {
708         __u32 hash = ldlm_hash_fn(parent, name);
709         struct ldlm_resource *res = NULL;
710         ENTRY;
711
712         LASSERT(ns != NULL);
713         LASSERT(ns->ns_hash != NULL);
714         LASSERT(name->name[0] != 0);
715
716         spin_lock(&ns->ns_hash_lock);
717         res = ldlm_resource_find(ns, name, hash);
718         if (res) {
719                 ldlm_resource_getref(res);
720                 spin_unlock(&ns->ns_hash_lock);
721                 /* synchronize WRT resource creation */
722                 if (ns->ns_lvbo && ns->ns_lvbo->lvbo_init) {
723                         down(&res->lr_lvb_sem);
724                         up(&res->lr_lvb_sem);
725                 }
726                 RETURN(res);
727         }
728         spin_unlock(&ns->ns_hash_lock);
729
730         if (create == 0)
731                 RETURN(NULL);
732
733         res = ldlm_resource_add(ns, parent, name, hash, type);
734         RETURN(res);
735 }
736
737 struct ldlm_resource *ldlm_resource_getref(struct ldlm_resource *res)
738 {
739         LASSERT(res != NULL);
740         LASSERT(res != LP_POISON);
741         atomic_inc(&res->lr_refcount);
742         CDEBUG(D_INFO, "getref res: %p count: %d\n", res,
743                atomic_read(&res->lr_refcount));
744         return res;
745 }
746
747 void __ldlm_resource_putref_final(struct ldlm_resource *res)
748 {
749         struct ldlm_namespace *ns = res->lr_namespace;
750
751         LASSERT_SPIN_LOCKED(&ns->ns_hash_lock);
752
753         if (!list_empty(&res->lr_granted)) {
754                 ldlm_resource_dump(D_ERROR, res);
755                 LBUG();
756         }
757
758         if (!list_empty(&res->lr_converting)) {
759                 ldlm_resource_dump(D_ERROR, res);
760                 LBUG();
761         }
762
763         if (!list_empty(&res->lr_waiting)) {
764                 ldlm_resource_dump(D_ERROR, res);
765                 LBUG();
766         }
767
768         if (!list_empty(&res->lr_children)) {
769                 ldlm_resource_dump(D_ERROR, res);
770                 LBUG();
771         }
772
773         /* Pass 0 here to not wake ->ns_waitq up yet, we will do it few 
774          * lines below when all children are freed. */
775         ldlm_namespace_put_nolock(ns, 0);
776         list_del_init(&res->lr_hash);
777         list_del_init(&res->lr_childof);
778
779         ns->ns_resources--;
780         if (ns->ns_resources == 0)
781                 wake_up(&ns->ns_waitq);
782 }
783
784 /* Returns 1 if the resource was freed, 0 if it remains. */
785 int ldlm_resource_putref(struct ldlm_resource *res)
786 {
787         struct ldlm_namespace *ns = res->lr_namespace;
788         int rc = 0;
789         ENTRY;
790
791         CDEBUG(D_INFO, "putref res: %p count: %d\n", res,
792                atomic_read(&res->lr_refcount) - 1);
793         LASSERTF(atomic_read(&res->lr_refcount) > 0, "%d",
794                  atomic_read(&res->lr_refcount));
795         LASSERTF(atomic_read(&res->lr_refcount) < LI_POISON, "%d",
796                  atomic_read(&res->lr_refcount));
797
798         if (atomic_dec_and_lock(&res->lr_refcount, &ns->ns_hash_lock)) {
799                 __ldlm_resource_putref_final(res);
800                 spin_unlock(&ns->ns_hash_lock);
801                 if (res->lr_lvb_data)
802                         OBD_FREE(res->lr_lvb_data, res->lr_lvb_len);
803                 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
804                 rc = 1;
805         }
806
807         RETURN(rc);
808 }
809
810 /* Returns 1 if the resource was freed, 0 if it remains. */
811 int ldlm_resource_putref_locked(struct ldlm_resource *res)
812 {
813         int rc = 0;
814         ENTRY;
815
816         CDEBUG(D_INFO, "putref res: %p count: %d\n", res,
817                atomic_read(&res->lr_refcount) - 1);
818         LASSERT(atomic_read(&res->lr_refcount) > 0);
819         LASSERT(atomic_read(&res->lr_refcount) < LI_POISON);
820
821         LASSERT(atomic_read(&res->lr_refcount) >= 0);
822         if (atomic_dec_and_test(&res->lr_refcount)) {
823                 __ldlm_resource_putref_final(res);
824                 if (res->lr_lvb_data)
825                         OBD_FREE(res->lr_lvb_data, res->lr_lvb_len);
826                 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
827                 rc = 1;
828         }
829
830         RETURN(rc);
831 }
832
833 void ldlm_resource_add_lock(struct ldlm_resource *res, struct list_head *head,
834                             struct ldlm_lock *lock)
835 {
836         check_res_locked(res);
837
838         ldlm_resource_dump(D_OTHER, res);
839         CDEBUG(D_OTHER, "About to add this lock:\n");
840         ldlm_lock_dump(D_OTHER, lock, 0);
841
842         if (lock->l_destroyed) {
843                 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
844                 return;
845         }
846
847         LASSERT(list_empty(&lock->l_res_link));
848
849         list_add_tail(&lock->l_res_link, head);
850 }
851
852 void ldlm_resource_insert_lock_after(struct ldlm_lock *original,
853                                      struct ldlm_lock *new)
854 {
855         struct ldlm_resource *res = original->l_resource;
856
857         check_res_locked(res);
858
859         ldlm_resource_dump(D_OTHER, res);
860         CDEBUG(D_OTHER, "About to insert this lock after %p:\n", original);
861         ldlm_lock_dump(D_OTHER, new, 0);
862
863         if (new->l_destroyed) {
864                 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
865                 goto out;
866         }
867
868         LASSERT(list_empty(&new->l_res_link));
869
870         list_add(&new->l_res_link, &original->l_res_link);
871  out:;
872 }
873
874 void ldlm_resource_unlink_lock(struct ldlm_lock *lock)
875 {
876         check_res_locked(lock->l_resource);
877         ldlm_unlink_lock_skiplist(lock);
878         list_del_init(&lock->l_res_link);
879 }
880
881 void ldlm_res2desc(struct ldlm_resource *res, struct ldlm_resource_desc *desc)
882 {
883         desc->lr_type = res->lr_type;
884         desc->lr_name = res->lr_name;
885 }
886
887 void ldlm_dump_all_namespaces(ldlm_side_t client, int level)
888 {
889         struct list_head *tmp;
890
891         if (!((libcfs_debug | D_ERROR) & level))
892                 return;
893
894         mutex_down(ldlm_namespace_lock(client));
895
896         list_for_each(tmp, ldlm_namespace_list(client)) {
897                 struct ldlm_namespace *ns;
898                 ns = list_entry(tmp, struct ldlm_namespace, ns_list_chain);
899                 ldlm_namespace_dump(level, ns);
900         }
901
902         mutex_up(ldlm_namespace_lock(client));
903 }
904
905 void ldlm_namespace_dump(int level, struct ldlm_namespace *ns)
906 {
907         struct list_head *tmp;
908
909         if (!((libcfs_debug | D_ERROR) & level))
910                 return;
911
912         CDEBUG(level, "--- Namespace: %s (rc: %d, side: %s)\n", 
913                ns->ns_name, ns->ns_refcount, 
914                ns_is_client(ns) ? "client" : "server");
915
916         if (cfs_time_before(cfs_time_current(), ns->ns_next_dump))
917                 return;
918
919         spin_lock(&ns->ns_hash_lock);
920         tmp = ns->ns_root_list.next;
921         while (tmp != &ns->ns_root_list) {
922                 struct ldlm_resource *res;
923                 res = list_entry(tmp, struct ldlm_resource, lr_childof);
924
925                 ldlm_resource_getref(res);
926                 spin_unlock(&ns->ns_hash_lock);
927
928                 lock_res(res);
929                 ldlm_resource_dump(level, res);
930                 unlock_res(res);
931
932                 spin_lock(&ns->ns_hash_lock);
933                 tmp = tmp->next;
934                 ldlm_resource_putref_locked(res);
935         }
936         ns->ns_next_dump = cfs_time_shift(10);
937         spin_unlock(&ns->ns_hash_lock);
938 }
939
940 void ldlm_resource_dump(int level, struct ldlm_resource *res)
941 {
942         struct list_head *tmp;
943         int pos;
944
945         CLASSERT(RES_NAME_SIZE == 4);
946
947         if (!((libcfs_debug | D_ERROR) & level))
948                 return;
949
950         CDEBUG(level, "--- Resource: %p ("LPU64"/"LPU64"/"LPU64"/"LPU64
951                ") (rc: %d)\n", res, res->lr_name.name[0], res->lr_name.name[1],
952                res->lr_name.name[2], res->lr_name.name[3],
953                atomic_read(&res->lr_refcount));
954
955         if (!list_empty(&res->lr_granted)) {
956                 pos = 0;
957                 CDEBUG(level, "Granted locks:\n");
958                 list_for_each(tmp, &res->lr_granted) {
959                         struct ldlm_lock *lock;
960                         lock = list_entry(tmp, struct ldlm_lock, l_res_link);
961                         ldlm_lock_dump(level, lock, ++pos);
962                 }
963         }
964         if (!list_empty(&res->lr_converting)) {
965                 pos = 0;
966                 CDEBUG(level, "Converting locks:\n");
967                 list_for_each(tmp, &res->lr_converting) {
968                         struct ldlm_lock *lock;
969                         lock = list_entry(tmp, struct ldlm_lock, l_res_link);
970                         ldlm_lock_dump(level, lock, ++pos);
971                 }
972         }
973         if (!list_empty(&res->lr_waiting)) {
974                 pos = 0;
975                 CDEBUG(level, "Waiting locks:\n");
976                 list_for_each(tmp, &res->lr_waiting) {
977                         struct ldlm_lock *lock;
978                         lock = list_entry(tmp, struct ldlm_lock, l_res_link);
979                         ldlm_lock_dump(level, lock, ++pos);
980                 }
981         }
982 }