Linux 5.8-rc4
[linux/fpc-iii.git] / fs / gfs2 / glock.c
blob8545024a1401f74bfe70e1e97154a29682331715
1 // SPDX-License-Identifier: GPL-2.0-only
2 /*
3 * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
4 * Copyright (C) 2004-2008 Red Hat, Inc. All rights reserved.
5 */
7 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
9 #include <linux/sched.h>
10 #include <linux/slab.h>
11 #include <linux/spinlock.h>
12 #include <linux/buffer_head.h>
13 #include <linux/delay.h>
14 #include <linux/sort.h>
15 #include <linux/hash.h>
16 #include <linux/jhash.h>
17 #include <linux/kallsyms.h>
18 #include <linux/gfs2_ondisk.h>
19 #include <linux/list.h>
20 #include <linux/wait.h>
21 #include <linux/module.h>
22 #include <linux/uaccess.h>
23 #include <linux/seq_file.h>
24 #include <linux/debugfs.h>
25 #include <linux/kthread.h>
26 #include <linux/freezer.h>
27 #include <linux/workqueue.h>
28 #include <linux/jiffies.h>
29 #include <linux/rcupdate.h>
30 #include <linux/rculist_bl.h>
31 #include <linux/bit_spinlock.h>
32 #include <linux/percpu.h>
33 #include <linux/list_sort.h>
34 #include <linux/lockref.h>
35 #include <linux/rhashtable.h>
37 #include "gfs2.h"
38 #include "incore.h"
39 #include "glock.h"
40 #include "glops.h"
41 #include "inode.h"
42 #include "lops.h"
43 #include "meta_io.h"
44 #include "quota.h"
45 #include "super.h"
46 #include "util.h"
47 #include "bmap.h"
48 #define CREATE_TRACE_POINTS
49 #include "trace_gfs2.h"
51 struct gfs2_glock_iter {
52 struct gfs2_sbd *sdp; /* incore superblock */
53 struct rhashtable_iter hti; /* rhashtable iterator */
54 struct gfs2_glock *gl; /* current glock struct */
55 loff_t last_pos; /* last position */
58 typedef void (*glock_examiner) (struct gfs2_glock * gl);
60 static void do_xmote(struct gfs2_glock *gl, struct gfs2_holder *gh, unsigned int target);
62 static struct dentry *gfs2_root;
63 static struct workqueue_struct *glock_workqueue;
64 struct workqueue_struct *gfs2_delete_workqueue;
65 static LIST_HEAD(lru_list);
66 static atomic_t lru_count = ATOMIC_INIT(0);
67 static DEFINE_SPINLOCK(lru_lock);
69 #define GFS2_GL_HASH_SHIFT 15
70 #define GFS2_GL_HASH_SIZE BIT(GFS2_GL_HASH_SHIFT)
72 static const struct rhashtable_params ht_parms = {
73 .nelem_hint = GFS2_GL_HASH_SIZE * 3 / 4,
74 .key_len = offsetofend(struct lm_lockname, ln_type),
75 .key_offset = offsetof(struct gfs2_glock, gl_name),
76 .head_offset = offsetof(struct gfs2_glock, gl_node),
79 static struct rhashtable gl_hash_table;
81 #define GLOCK_WAIT_TABLE_BITS 12
82 #define GLOCK_WAIT_TABLE_SIZE (1 << GLOCK_WAIT_TABLE_BITS)
83 static wait_queue_head_t glock_wait_table[GLOCK_WAIT_TABLE_SIZE] __cacheline_aligned;
85 struct wait_glock_queue {
86 struct lm_lockname *name;
87 wait_queue_entry_t wait;
90 static int glock_wake_function(wait_queue_entry_t *wait, unsigned int mode,
91 int sync, void *key)
93 struct wait_glock_queue *wait_glock =
94 container_of(wait, struct wait_glock_queue, wait);
95 struct lm_lockname *wait_name = wait_glock->name;
96 struct lm_lockname *wake_name = key;
98 if (wake_name->ln_sbd != wait_name->ln_sbd ||
99 wake_name->ln_number != wait_name->ln_number ||
100 wake_name->ln_type != wait_name->ln_type)
101 return 0;
102 return autoremove_wake_function(wait, mode, sync, key);
105 static wait_queue_head_t *glock_waitqueue(struct lm_lockname *name)
107 u32 hash = jhash2((u32 *)name, ht_parms.key_len / 4, 0);
109 return glock_wait_table + hash_32(hash, GLOCK_WAIT_TABLE_BITS);
113 * wake_up_glock - Wake up waiters on a glock
114 * @gl: the glock
116 static void wake_up_glock(struct gfs2_glock *gl)
118 wait_queue_head_t *wq = glock_waitqueue(&gl->gl_name);
120 if (waitqueue_active(wq))
121 __wake_up(wq, TASK_NORMAL, 1, &gl->gl_name);
124 static void gfs2_glock_dealloc(struct rcu_head *rcu)
126 struct gfs2_glock *gl = container_of(rcu, struct gfs2_glock, gl_rcu);
128 kfree(gl->gl_lksb.sb_lvbptr);
129 if (gl->gl_ops->go_flags & GLOF_ASPACE)
130 kmem_cache_free(gfs2_glock_aspace_cachep, gl);
131 else
132 kmem_cache_free(gfs2_glock_cachep, gl);
136 * glock_blocked_by_withdraw - determine if we can still use a glock
137 * @gl: the glock
139 * We need to allow some glocks to be enqueued, dequeued, promoted, and demoted
140 * when we're withdrawn. For example, to maintain metadata integrity, we should
141 * disallow the use of inode and rgrp glocks when withdrawn. Other glocks, like
142 * iopen or the transaction glocks may be safely used because none of their
143 * metadata goes through the journal. So in general, we should disallow all
144 * glocks that are journaled, and allow all the others. One exception is:
145 * we need to allow our active journal to be promoted and demoted so others
146 * may recover it and we can reacquire it when they're done.
148 static bool glock_blocked_by_withdraw(struct gfs2_glock *gl)
150 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd;
152 if (likely(!gfs2_withdrawn(sdp)))
153 return false;
154 if (gl->gl_ops->go_flags & GLOF_NONDISK)
155 return false;
156 if (!sdp->sd_jdesc ||
157 gl->gl_name.ln_number == sdp->sd_jdesc->jd_no_addr)
158 return false;
159 return true;
162 void gfs2_glock_free(struct gfs2_glock *gl)
164 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd;
166 gfs2_glock_assert_withdraw(gl, atomic_read(&gl->gl_revokes) == 0);
167 rhashtable_remove_fast(&gl_hash_table, &gl->gl_node, ht_parms);
168 smp_mb();
169 wake_up_glock(gl);
170 call_rcu(&gl->gl_rcu, gfs2_glock_dealloc);
171 if (atomic_dec_and_test(&sdp->sd_glock_disposal))
172 wake_up(&sdp->sd_glock_wait);
176 * gfs2_glock_hold() - increment reference count on glock
177 * @gl: The glock to hold
181 void gfs2_glock_hold(struct gfs2_glock *gl)
183 GLOCK_BUG_ON(gl, __lockref_is_dead(&gl->gl_lockref));
184 lockref_get(&gl->gl_lockref);
188 * demote_ok - Check to see if it's ok to unlock a glock
189 * @gl: the glock
191 * Returns: 1 if it's ok
194 static int demote_ok(const struct gfs2_glock *gl)
196 const struct gfs2_glock_operations *glops = gl->gl_ops;
198 if (gl->gl_state == LM_ST_UNLOCKED)
199 return 0;
200 if (!list_empty(&gl->gl_holders))
201 return 0;
202 if (glops->go_demote_ok)
203 return glops->go_demote_ok(gl);
204 return 1;
208 void gfs2_glock_add_to_lru(struct gfs2_glock *gl)
210 if (!(gl->gl_ops->go_flags & GLOF_LRU))
211 return;
213 spin_lock(&lru_lock);
215 list_del(&gl->gl_lru);
216 list_add_tail(&gl->gl_lru, &lru_list);
218 if (!test_bit(GLF_LRU, &gl->gl_flags)) {
219 set_bit(GLF_LRU, &gl->gl_flags);
220 atomic_inc(&lru_count);
223 spin_unlock(&lru_lock);
226 static void gfs2_glock_remove_from_lru(struct gfs2_glock *gl)
228 if (!(gl->gl_ops->go_flags & GLOF_LRU))
229 return;
231 spin_lock(&lru_lock);
232 if (test_bit(GLF_LRU, &gl->gl_flags)) {
233 list_del_init(&gl->gl_lru);
234 atomic_dec(&lru_count);
235 clear_bit(GLF_LRU, &gl->gl_flags);
237 spin_unlock(&lru_lock);
241 * Enqueue the glock on the work queue. Passes one glock reference on to the
242 * work queue.
244 static void __gfs2_glock_queue_work(struct gfs2_glock *gl, unsigned long delay) {
245 if (!queue_delayed_work(glock_workqueue, &gl->gl_work, delay)) {
247 * We are holding the lockref spinlock, and the work was still
248 * queued above. The queued work (glock_work_func) takes that
249 * spinlock before dropping its glock reference(s), so it
250 * cannot have dropped them in the meantime.
252 GLOCK_BUG_ON(gl, gl->gl_lockref.count < 2);
253 gl->gl_lockref.count--;
257 static void gfs2_glock_queue_work(struct gfs2_glock *gl, unsigned long delay) {
258 spin_lock(&gl->gl_lockref.lock);
259 __gfs2_glock_queue_work(gl, delay);
260 spin_unlock(&gl->gl_lockref.lock);
263 static void __gfs2_glock_put(struct gfs2_glock *gl)
265 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd;
266 struct address_space *mapping = gfs2_glock2aspace(gl);
268 lockref_mark_dead(&gl->gl_lockref);
270 gfs2_glock_remove_from_lru(gl);
271 spin_unlock(&gl->gl_lockref.lock);
272 GLOCK_BUG_ON(gl, !list_empty(&gl->gl_holders));
273 GLOCK_BUG_ON(gl, mapping && mapping->nrpages && !gfs2_withdrawn(sdp));
274 trace_gfs2_glock_put(gl);
275 sdp->sd_lockstruct.ls_ops->lm_put_lock(gl);
279 * Cause the glock to be put in work queue context.
281 void gfs2_glock_queue_put(struct gfs2_glock *gl)
283 gfs2_glock_queue_work(gl, 0);
287 * gfs2_glock_put() - Decrement reference count on glock
288 * @gl: The glock to put
292 void gfs2_glock_put(struct gfs2_glock *gl)
294 if (lockref_put_or_lock(&gl->gl_lockref))
295 return;
297 __gfs2_glock_put(gl);
301 * may_grant - check if its ok to grant a new lock
302 * @gl: The glock
303 * @gh: The lock request which we wish to grant
305 * Returns: true if its ok to grant the lock
308 static inline int may_grant(const struct gfs2_glock *gl, const struct gfs2_holder *gh)
310 const struct gfs2_holder *gh_head = list_first_entry(&gl->gl_holders, const struct gfs2_holder, gh_list);
311 if ((gh->gh_state == LM_ST_EXCLUSIVE ||
312 gh_head->gh_state == LM_ST_EXCLUSIVE) && gh != gh_head)
313 return 0;
314 if (gl->gl_state == gh->gh_state)
315 return 1;
316 if (gh->gh_flags & GL_EXACT)
317 return 0;
318 if (gl->gl_state == LM_ST_EXCLUSIVE) {
319 if (gh->gh_state == LM_ST_SHARED && gh_head->gh_state == LM_ST_SHARED)
320 return 1;
321 if (gh->gh_state == LM_ST_DEFERRED && gh_head->gh_state == LM_ST_DEFERRED)
322 return 1;
324 if (gl->gl_state != LM_ST_UNLOCKED && (gh->gh_flags & LM_FLAG_ANY))
325 return 1;
326 return 0;
329 static void gfs2_holder_wake(struct gfs2_holder *gh)
331 clear_bit(HIF_WAIT, &gh->gh_iflags);
332 smp_mb__after_atomic();
333 wake_up_bit(&gh->gh_iflags, HIF_WAIT);
334 if (gh->gh_flags & GL_ASYNC) {
335 struct gfs2_sbd *sdp = gh->gh_gl->gl_name.ln_sbd;
337 wake_up(&sdp->sd_async_glock_wait);
342 * do_error - Something unexpected has happened during a lock request
346 static void do_error(struct gfs2_glock *gl, const int ret)
348 struct gfs2_holder *gh, *tmp;
350 list_for_each_entry_safe(gh, tmp, &gl->gl_holders, gh_list) {
351 if (test_bit(HIF_HOLDER, &gh->gh_iflags))
352 continue;
353 if (ret & LM_OUT_ERROR)
354 gh->gh_error = -EIO;
355 else if (gh->gh_flags & (LM_FLAG_TRY | LM_FLAG_TRY_1CB))
356 gh->gh_error = GLR_TRYFAILED;
357 else
358 continue;
359 list_del_init(&gh->gh_list);
360 trace_gfs2_glock_queue(gh, 0);
361 gfs2_holder_wake(gh);
366 * do_promote - promote as many requests as possible on the current queue
367 * @gl: The glock
369 * Returns: 1 if there is a blocked holder at the head of the list, or 2
370 * if a type specific operation is underway.
373 static int do_promote(struct gfs2_glock *gl)
374 __releases(&gl->gl_lockref.lock)
375 __acquires(&gl->gl_lockref.lock)
377 const struct gfs2_glock_operations *glops = gl->gl_ops;
378 struct gfs2_holder *gh, *tmp;
379 int ret;
381 restart:
382 list_for_each_entry_safe(gh, tmp, &gl->gl_holders, gh_list) {
383 if (test_bit(HIF_HOLDER, &gh->gh_iflags))
384 continue;
385 if (may_grant(gl, gh)) {
386 if (gh->gh_list.prev == &gl->gl_holders &&
387 glops->go_lock) {
388 spin_unlock(&gl->gl_lockref.lock);
389 /* FIXME: eliminate this eventually */
390 ret = glops->go_lock(gh);
391 spin_lock(&gl->gl_lockref.lock);
392 if (ret) {
393 if (ret == 1)
394 return 2;
395 gh->gh_error = ret;
396 list_del_init(&gh->gh_list);
397 trace_gfs2_glock_queue(gh, 0);
398 gfs2_holder_wake(gh);
399 goto restart;
401 set_bit(HIF_HOLDER, &gh->gh_iflags);
402 trace_gfs2_promote(gh, 1);
403 gfs2_holder_wake(gh);
404 goto restart;
406 set_bit(HIF_HOLDER, &gh->gh_iflags);
407 trace_gfs2_promote(gh, 0);
408 gfs2_holder_wake(gh);
409 continue;
411 if (gh->gh_list.prev == &gl->gl_holders)
412 return 1;
413 do_error(gl, 0);
414 break;
416 return 0;
420 * find_first_waiter - find the first gh that's waiting for the glock
421 * @gl: the glock
424 static inline struct gfs2_holder *find_first_waiter(const struct gfs2_glock *gl)
426 struct gfs2_holder *gh;
428 list_for_each_entry(gh, &gl->gl_holders, gh_list) {
429 if (!test_bit(HIF_HOLDER, &gh->gh_iflags))
430 return gh;
432 return NULL;
436 * state_change - record that the glock is now in a different state
437 * @gl: the glock
438 * @new_state the new state
442 static void state_change(struct gfs2_glock *gl, unsigned int new_state)
444 int held1, held2;
446 held1 = (gl->gl_state != LM_ST_UNLOCKED);
447 held2 = (new_state != LM_ST_UNLOCKED);
449 if (held1 != held2) {
450 GLOCK_BUG_ON(gl, __lockref_is_dead(&gl->gl_lockref));
451 if (held2)
452 gl->gl_lockref.count++;
453 else
454 gl->gl_lockref.count--;
456 if (held1 && held2 && list_empty(&gl->gl_holders))
457 clear_bit(GLF_QUEUED, &gl->gl_flags);
459 if (new_state != gl->gl_target)
460 /* shorten our minimum hold time */
461 gl->gl_hold_time = max(gl->gl_hold_time - GL_GLOCK_HOLD_DECR,
462 GL_GLOCK_MIN_HOLD);
463 gl->gl_state = new_state;
464 gl->gl_tchange = jiffies;
467 static void gfs2_set_demote(struct gfs2_glock *gl)
469 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd;
471 set_bit(GLF_DEMOTE, &gl->gl_flags);
472 smp_mb();
473 wake_up(&sdp->sd_async_glock_wait);
476 static void gfs2_demote_wake(struct gfs2_glock *gl)
478 gl->gl_demote_state = LM_ST_EXCLUSIVE;
479 clear_bit(GLF_DEMOTE, &gl->gl_flags);
480 smp_mb__after_atomic();
481 wake_up_bit(&gl->gl_flags, GLF_DEMOTE);
485 * finish_xmote - The DLM has replied to one of our lock requests
486 * @gl: The glock
487 * @ret: The status from the DLM
491 static void finish_xmote(struct gfs2_glock *gl, unsigned int ret)
493 const struct gfs2_glock_operations *glops = gl->gl_ops;
494 struct gfs2_holder *gh;
495 unsigned state = ret & LM_OUT_ST_MASK;
496 int rv;
498 spin_lock(&gl->gl_lockref.lock);
499 trace_gfs2_glock_state_change(gl, state);
500 state_change(gl, state);
501 gh = find_first_waiter(gl);
503 /* Demote to UN request arrived during demote to SH or DF */
504 if (test_bit(GLF_DEMOTE_IN_PROGRESS, &gl->gl_flags) &&
505 state != LM_ST_UNLOCKED && gl->gl_demote_state == LM_ST_UNLOCKED)
506 gl->gl_target = LM_ST_UNLOCKED;
508 /* Check for state != intended state */
509 if (unlikely(state != gl->gl_target)) {
510 if (gh && !test_bit(GLF_DEMOTE_IN_PROGRESS, &gl->gl_flags)) {
511 /* move to back of queue and try next entry */
512 if (ret & LM_OUT_CANCELED) {
513 if ((gh->gh_flags & LM_FLAG_PRIORITY) == 0)
514 list_move_tail(&gh->gh_list, &gl->gl_holders);
515 gh = find_first_waiter(gl);
516 gl->gl_target = gh->gh_state;
517 goto retry;
519 /* Some error or failed "try lock" - report it */
520 if ((ret & LM_OUT_ERROR) ||
521 (gh->gh_flags & (LM_FLAG_TRY | LM_FLAG_TRY_1CB))) {
522 gl->gl_target = gl->gl_state;
523 do_error(gl, ret);
524 goto out;
527 switch(state) {
528 /* Unlocked due to conversion deadlock, try again */
529 case LM_ST_UNLOCKED:
530 retry:
531 do_xmote(gl, gh, gl->gl_target);
532 break;
533 /* Conversion fails, unlock and try again */
534 case LM_ST_SHARED:
535 case LM_ST_DEFERRED:
536 do_xmote(gl, gh, LM_ST_UNLOCKED);
537 break;
538 default: /* Everything else */
539 fs_err(gl->gl_name.ln_sbd, "wanted %u got %u\n",
540 gl->gl_target, state);
541 GLOCK_BUG_ON(gl, 1);
543 spin_unlock(&gl->gl_lockref.lock);
544 return;
547 /* Fast path - we got what we asked for */
548 if (test_and_clear_bit(GLF_DEMOTE_IN_PROGRESS, &gl->gl_flags))
549 gfs2_demote_wake(gl);
550 if (state != LM_ST_UNLOCKED) {
551 if (glops->go_xmote_bh) {
552 spin_unlock(&gl->gl_lockref.lock);
553 rv = glops->go_xmote_bh(gl, gh);
554 spin_lock(&gl->gl_lockref.lock);
555 if (rv) {
556 do_error(gl, rv);
557 goto out;
560 rv = do_promote(gl);
561 if (rv == 2)
562 goto out_locked;
564 out:
565 clear_bit(GLF_LOCK, &gl->gl_flags);
566 out_locked:
567 spin_unlock(&gl->gl_lockref.lock);
571 * do_xmote - Calls the DLM to change the state of a lock
572 * @gl: The lock state
573 * @gh: The holder (only for promotes)
574 * @target: The target lock state
578 static void do_xmote(struct gfs2_glock *gl, struct gfs2_holder *gh, unsigned int target)
579 __releases(&gl->gl_lockref.lock)
580 __acquires(&gl->gl_lockref.lock)
582 const struct gfs2_glock_operations *glops = gl->gl_ops;
583 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd;
584 unsigned int lck_flags = (unsigned int)(gh ? gh->gh_flags : 0);
585 int ret;
587 if (target != LM_ST_UNLOCKED && glock_blocked_by_withdraw(gl) &&
588 gh && !(gh->gh_flags & LM_FLAG_NOEXP))
589 return;
590 lck_flags &= (LM_FLAG_TRY | LM_FLAG_TRY_1CB | LM_FLAG_NOEXP |
591 LM_FLAG_PRIORITY);
592 GLOCK_BUG_ON(gl, gl->gl_state == target);
593 GLOCK_BUG_ON(gl, gl->gl_state == gl->gl_target);
594 if ((target == LM_ST_UNLOCKED || target == LM_ST_DEFERRED) &&
595 glops->go_inval) {
597 * If another process is already doing the invalidate, let that
598 * finish first. The glock state machine will get back to this
599 * holder again later.
601 if (test_and_set_bit(GLF_INVALIDATE_IN_PROGRESS,
602 &gl->gl_flags))
603 return;
604 do_error(gl, 0); /* Fail queued try locks */
606 gl->gl_req = target;
607 set_bit(GLF_BLOCKING, &gl->gl_flags);
608 if ((gl->gl_req == LM_ST_UNLOCKED) ||
609 (gl->gl_state == LM_ST_EXCLUSIVE) ||
610 (lck_flags & (LM_FLAG_TRY|LM_FLAG_TRY_1CB)))
611 clear_bit(GLF_BLOCKING, &gl->gl_flags);
612 spin_unlock(&gl->gl_lockref.lock);
613 if (glops->go_sync) {
614 ret = glops->go_sync(gl);
615 /* If we had a problem syncing (due to io errors or whatever,
616 * we should not invalidate the metadata or tell dlm to
617 * release the glock to other nodes.
619 if (ret) {
620 if (cmpxchg(&sdp->sd_log_error, 0, ret)) {
621 fs_err(sdp, "Error %d syncing glock \n", ret);
622 gfs2_dump_glock(NULL, gl, true);
624 goto skip_inval;
627 if (test_bit(GLF_INVALIDATE_IN_PROGRESS, &gl->gl_flags)) {
629 * The call to go_sync should have cleared out the ail list.
630 * If there are still items, we have a problem. We ought to
631 * withdraw, but we can't because the withdraw code also uses
632 * glocks. Warn about the error, dump the glock, then fall
633 * through and wait for logd to do the withdraw for us.
635 if ((atomic_read(&gl->gl_ail_count) != 0) &&
636 (!cmpxchg(&sdp->sd_log_error, 0, -EIO))) {
637 gfs2_glock_assert_warn(gl,
638 !atomic_read(&gl->gl_ail_count));
639 gfs2_dump_glock(NULL, gl, true);
641 glops->go_inval(gl, target == LM_ST_DEFERRED ? 0 : DIO_METADATA);
642 clear_bit(GLF_INVALIDATE_IN_PROGRESS, &gl->gl_flags);
645 skip_inval:
646 gfs2_glock_hold(gl);
648 * Check for an error encountered since we called go_sync and go_inval.
649 * If so, we can't withdraw from the glock code because the withdraw
650 * code itself uses glocks (see function signal_our_withdraw) to
651 * change the mount to read-only. Most importantly, we must not call
652 * dlm to unlock the glock until the journal is in a known good state
653 * (after journal replay) otherwise other nodes may use the object
654 * (rgrp or dinode) and then later, journal replay will corrupt the
655 * file system. The best we can do here is wait for the logd daemon
656 * to see sd_log_error and withdraw, and in the meantime, requeue the
657 * work for later.
659 * However, if we're just unlocking the lock (say, for unmount, when
660 * gfs2_gl_hash_clear calls clear_glock) and recovery is complete
661 * then it's okay to tell dlm to unlock it.
663 if (unlikely(sdp->sd_log_error && !gfs2_withdrawn(sdp)))
664 gfs2_withdraw_delayed(sdp);
665 if (glock_blocked_by_withdraw(gl)) {
666 if (target != LM_ST_UNLOCKED ||
667 test_bit(SDF_WITHDRAW_RECOVERY, &sdp->sd_flags)) {
668 gfs2_glock_queue_work(gl, GL_GLOCK_DFT_HOLD);
669 goto out;
673 if (sdp->sd_lockstruct.ls_ops->lm_lock) {
674 /* lock_dlm */
675 ret = sdp->sd_lockstruct.ls_ops->lm_lock(gl, target, lck_flags);
676 if (ret == -EINVAL && gl->gl_target == LM_ST_UNLOCKED &&
677 target == LM_ST_UNLOCKED &&
678 test_bit(SDF_SKIP_DLM_UNLOCK, &sdp->sd_flags)) {
679 finish_xmote(gl, target);
680 gfs2_glock_queue_work(gl, 0);
681 } else if (ret) {
682 fs_err(sdp, "lm_lock ret %d\n", ret);
683 GLOCK_BUG_ON(gl, !gfs2_withdrawn(sdp));
685 } else { /* lock_nolock */
686 finish_xmote(gl, target);
687 gfs2_glock_queue_work(gl, 0);
689 out:
690 spin_lock(&gl->gl_lockref.lock);
694 * find_first_holder - find the first "holder" gh
695 * @gl: the glock
698 static inline struct gfs2_holder *find_first_holder(const struct gfs2_glock *gl)
700 struct gfs2_holder *gh;
702 if (!list_empty(&gl->gl_holders)) {
703 gh = list_first_entry(&gl->gl_holders, struct gfs2_holder, gh_list);
704 if (test_bit(HIF_HOLDER, &gh->gh_iflags))
705 return gh;
707 return NULL;
711 * run_queue - do all outstanding tasks related to a glock
712 * @gl: The glock in question
713 * @nonblock: True if we must not block in run_queue
717 static void run_queue(struct gfs2_glock *gl, const int nonblock)
718 __releases(&gl->gl_lockref.lock)
719 __acquires(&gl->gl_lockref.lock)
721 struct gfs2_holder *gh = NULL;
722 int ret;
724 if (test_and_set_bit(GLF_LOCK, &gl->gl_flags))
725 return;
727 GLOCK_BUG_ON(gl, test_bit(GLF_DEMOTE_IN_PROGRESS, &gl->gl_flags));
729 if (test_bit(GLF_DEMOTE, &gl->gl_flags) &&
730 gl->gl_demote_state != gl->gl_state) {
731 if (find_first_holder(gl))
732 goto out_unlock;
733 if (nonblock)
734 goto out_sched;
735 set_bit(GLF_DEMOTE_IN_PROGRESS, &gl->gl_flags);
736 GLOCK_BUG_ON(gl, gl->gl_demote_state == LM_ST_EXCLUSIVE);
737 gl->gl_target = gl->gl_demote_state;
738 } else {
739 if (test_bit(GLF_DEMOTE, &gl->gl_flags))
740 gfs2_demote_wake(gl);
741 ret = do_promote(gl);
742 if (ret == 0)
743 goto out_unlock;
744 if (ret == 2)
745 goto out;
746 gh = find_first_waiter(gl);
747 gl->gl_target = gh->gh_state;
748 if (!(gh->gh_flags & (LM_FLAG_TRY | LM_FLAG_TRY_1CB)))
749 do_error(gl, 0); /* Fail queued try locks */
751 do_xmote(gl, gh, gl->gl_target);
752 out:
753 return;
755 out_sched:
756 clear_bit(GLF_LOCK, &gl->gl_flags);
757 smp_mb__after_atomic();
758 gl->gl_lockref.count++;
759 __gfs2_glock_queue_work(gl, 0);
760 return;
762 out_unlock:
763 clear_bit(GLF_LOCK, &gl->gl_flags);
764 smp_mb__after_atomic();
765 return;
768 void gfs2_inode_remember_delete(struct gfs2_glock *gl, u64 generation)
770 struct gfs2_inode_lvb *ri = (void *)gl->gl_lksb.sb_lvbptr;
772 if (ri->ri_magic == 0)
773 ri->ri_magic = cpu_to_be32(GFS2_MAGIC);
774 if (ri->ri_magic == cpu_to_be32(GFS2_MAGIC))
775 ri->ri_generation_deleted = cpu_to_be64(generation);
778 bool gfs2_inode_already_deleted(struct gfs2_glock *gl, u64 generation)
780 struct gfs2_inode_lvb *ri = (void *)gl->gl_lksb.sb_lvbptr;
782 if (ri->ri_magic != cpu_to_be32(GFS2_MAGIC))
783 return false;
784 return generation <= be64_to_cpu(ri->ri_generation_deleted);
787 static void gfs2_glock_poke(struct gfs2_glock *gl)
789 int flags = LM_FLAG_TRY_1CB | LM_FLAG_ANY | GL_SKIP;
790 struct gfs2_holder gh;
791 int error;
793 error = gfs2_glock_nq_init(gl, LM_ST_SHARED, flags, &gh);
794 if (!error)
795 gfs2_glock_dq(&gh);
798 static bool gfs2_try_evict(struct gfs2_glock *gl)
800 struct gfs2_inode *ip;
801 bool evicted = false;
804 * If there is contention on the iopen glock and we have an inode, try
805 * to grab and release the inode so that it can be evicted. This will
806 * allow the remote node to go ahead and delete the inode without us
807 * having to do it, which will avoid rgrp glock thrashing.
809 * The remote node is likely still holding the corresponding inode
810 * glock, so it will run before we get to verify that the delete has
811 * happened below.
813 spin_lock(&gl->gl_lockref.lock);
814 ip = gl->gl_object;
815 if (ip && !igrab(&ip->i_inode))
816 ip = NULL;
817 spin_unlock(&gl->gl_lockref.lock);
818 if (ip) {
819 struct gfs2_glock *inode_gl = NULL;
821 gl->gl_no_formal_ino = ip->i_no_formal_ino;
822 set_bit(GIF_DEFERRED_DELETE, &ip->i_flags);
823 d_prune_aliases(&ip->i_inode);
824 iput(&ip->i_inode);
826 /* If the inode was evicted, gl->gl_object will now be NULL. */
827 spin_lock(&gl->gl_lockref.lock);
828 ip = gl->gl_object;
829 if (ip) {
830 inode_gl = ip->i_gl;
831 lockref_get(&inode_gl->gl_lockref);
832 clear_bit(GIF_DEFERRED_DELETE, &ip->i_flags);
834 spin_unlock(&gl->gl_lockref.lock);
835 if (inode_gl) {
836 gfs2_glock_poke(inode_gl);
837 gfs2_glock_put(inode_gl);
839 evicted = !ip;
841 return evicted;
844 static void delete_work_func(struct work_struct *work)
846 struct delayed_work *dwork = to_delayed_work(work);
847 struct gfs2_glock *gl = container_of(dwork, struct gfs2_glock, gl_delete);
848 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd;
849 struct inode *inode;
850 u64 no_addr = gl->gl_name.ln_number;
852 spin_lock(&gl->gl_lockref.lock);
853 clear_bit(GLF_PENDING_DELETE, &gl->gl_flags);
854 spin_unlock(&gl->gl_lockref.lock);
856 /* If someone's using this glock to create a new dinode, the block must
857 have been freed by another node, then re-used, in which case our
858 iopen callback is too late after the fact. Ignore it. */
859 if (test_bit(GLF_INODE_CREATING, &gl->gl_flags))
860 goto out;
862 if (test_bit(GLF_DEMOTE, &gl->gl_flags)) {
864 * If we can evict the inode, give the remote node trying to
865 * delete the inode some time before verifying that the delete
866 * has happened. Otherwise, if we cause contention on the inode glock
867 * immediately, the remote node will think that we still have
868 * the inode in use, and so it will give up waiting.
870 * If we can't evict the inode, signal to the remote node that
871 * the inode is still in use. We'll later try to delete the
872 * inode locally in gfs2_evict_inode.
874 * FIXME: We only need to verify that the remote node has
875 * deleted the inode because nodes before this remote delete
876 * rework won't cooperate. At a later time, when we no longer
877 * care about compatibility with such nodes, we can skip this
878 * step entirely.
880 if (gfs2_try_evict(gl)) {
881 if (gfs2_queue_delete_work(gl, 5 * HZ))
882 return;
884 goto out;
887 inode = gfs2_lookup_by_inum(sdp, no_addr, gl->gl_no_formal_ino,
888 GFS2_BLKST_UNLINKED);
889 if (!IS_ERR_OR_NULL(inode)) {
890 d_prune_aliases(inode);
891 iput(inode);
893 out:
894 gfs2_glock_put(gl);
897 static void glock_work_func(struct work_struct *work)
899 unsigned long delay = 0;
900 struct gfs2_glock *gl = container_of(work, struct gfs2_glock, gl_work.work);
901 unsigned int drop_refs = 1;
903 if (test_and_clear_bit(GLF_REPLY_PENDING, &gl->gl_flags)) {
904 finish_xmote(gl, gl->gl_reply);
905 drop_refs++;
907 spin_lock(&gl->gl_lockref.lock);
908 if (test_bit(GLF_PENDING_DEMOTE, &gl->gl_flags) &&
909 gl->gl_state != LM_ST_UNLOCKED &&
910 gl->gl_demote_state != LM_ST_EXCLUSIVE) {
911 unsigned long holdtime, now = jiffies;
913 holdtime = gl->gl_tchange + gl->gl_hold_time;
914 if (time_before(now, holdtime))
915 delay = holdtime - now;
917 if (!delay) {
918 clear_bit(GLF_PENDING_DEMOTE, &gl->gl_flags);
919 gfs2_set_demote(gl);
922 run_queue(gl, 0);
923 if (delay) {
924 /* Keep one glock reference for the work we requeue. */
925 drop_refs--;
926 if (gl->gl_name.ln_type != LM_TYPE_INODE)
927 delay = 0;
928 __gfs2_glock_queue_work(gl, delay);
932 * Drop the remaining glock references manually here. (Mind that
933 * __gfs2_glock_queue_work depends on the lockref spinlock begin held
934 * here as well.)
936 gl->gl_lockref.count -= drop_refs;
937 if (!gl->gl_lockref.count) {
938 __gfs2_glock_put(gl);
939 return;
941 spin_unlock(&gl->gl_lockref.lock);
944 static struct gfs2_glock *find_insert_glock(struct lm_lockname *name,
945 struct gfs2_glock *new)
947 struct wait_glock_queue wait;
948 wait_queue_head_t *wq = glock_waitqueue(name);
949 struct gfs2_glock *gl;
951 wait.name = name;
952 init_wait(&wait.wait);
953 wait.wait.func = glock_wake_function;
955 again:
956 prepare_to_wait(wq, &wait.wait, TASK_UNINTERRUPTIBLE);
957 rcu_read_lock();
958 if (new) {
959 gl = rhashtable_lookup_get_insert_fast(&gl_hash_table,
960 &new->gl_node, ht_parms);
961 if (IS_ERR(gl))
962 goto out;
963 } else {
964 gl = rhashtable_lookup_fast(&gl_hash_table,
965 name, ht_parms);
967 if (gl && !lockref_get_not_dead(&gl->gl_lockref)) {
968 rcu_read_unlock();
969 schedule();
970 goto again;
972 out:
973 rcu_read_unlock();
974 finish_wait(wq, &wait.wait);
975 return gl;
979 * gfs2_glock_get() - Get a glock, or create one if one doesn't exist
980 * @sdp: The GFS2 superblock
981 * @number: the lock number
982 * @glops: The glock_operations to use
983 * @create: If 0, don't create the glock if it doesn't exist
984 * @glp: the glock is returned here
986 * This does not lock a glock, just finds/creates structures for one.
988 * Returns: errno
991 int gfs2_glock_get(struct gfs2_sbd *sdp, u64 number,
992 const struct gfs2_glock_operations *glops, int create,
993 struct gfs2_glock **glp)
995 struct super_block *s = sdp->sd_vfs;
996 struct lm_lockname name = { .ln_number = number,
997 .ln_type = glops->go_type,
998 .ln_sbd = sdp };
999 struct gfs2_glock *gl, *tmp;
1000 struct address_space *mapping;
1001 struct kmem_cache *cachep;
1002 int ret = 0;
1004 gl = find_insert_glock(&name, NULL);
1005 if (gl) {
1006 *glp = gl;
1007 return 0;
1009 if (!create)
1010 return -ENOENT;
1012 if (glops->go_flags & GLOF_ASPACE)
1013 cachep = gfs2_glock_aspace_cachep;
1014 else
1015 cachep = gfs2_glock_cachep;
1016 gl = kmem_cache_alloc(cachep, GFP_NOFS);
1017 if (!gl)
1018 return -ENOMEM;
1020 memset(&gl->gl_lksb, 0, sizeof(struct dlm_lksb));
1022 if (glops->go_flags & GLOF_LVB) {
1023 gl->gl_lksb.sb_lvbptr = kzalloc(GDLM_LVB_SIZE, GFP_NOFS);
1024 if (!gl->gl_lksb.sb_lvbptr) {
1025 kmem_cache_free(cachep, gl);
1026 return -ENOMEM;
1030 atomic_inc(&sdp->sd_glock_disposal);
1031 gl->gl_node.next = NULL;
1032 gl->gl_flags = 0;
1033 gl->gl_name = name;
1034 gl->gl_lockref.count = 1;
1035 gl->gl_state = LM_ST_UNLOCKED;
1036 gl->gl_target = LM_ST_UNLOCKED;
1037 gl->gl_demote_state = LM_ST_EXCLUSIVE;
1038 gl->gl_ops = glops;
1039 gl->gl_dstamp = 0;
1040 preempt_disable();
1041 /* We use the global stats to estimate the initial per-glock stats */
1042 gl->gl_stats = this_cpu_ptr(sdp->sd_lkstats)->lkstats[glops->go_type];
1043 preempt_enable();
1044 gl->gl_stats.stats[GFS2_LKS_DCOUNT] = 0;
1045 gl->gl_stats.stats[GFS2_LKS_QCOUNT] = 0;
1046 gl->gl_tchange = jiffies;
1047 gl->gl_object = NULL;
1048 gl->gl_hold_time = GL_GLOCK_DFT_HOLD;
1049 INIT_DELAYED_WORK(&gl->gl_work, glock_work_func);
1050 INIT_DELAYED_WORK(&gl->gl_delete, delete_work_func);
1052 mapping = gfs2_glock2aspace(gl);
1053 if (mapping) {
1054 mapping->a_ops = &gfs2_meta_aops;
1055 mapping->host = s->s_bdev->bd_inode;
1056 mapping->flags = 0;
1057 mapping_set_gfp_mask(mapping, GFP_NOFS);
1058 mapping->private_data = NULL;
1059 mapping->writeback_index = 0;
1062 tmp = find_insert_glock(&name, gl);
1063 if (!tmp) {
1064 *glp = gl;
1065 goto out;
1067 if (IS_ERR(tmp)) {
1068 ret = PTR_ERR(tmp);
1069 goto out_free;
1071 *glp = tmp;
1073 out_free:
1074 kfree(gl->gl_lksb.sb_lvbptr);
1075 kmem_cache_free(cachep, gl);
1076 atomic_dec(&sdp->sd_glock_disposal);
1078 out:
1079 return ret;
1083 * gfs2_holder_init - initialize a struct gfs2_holder in the default way
1084 * @gl: the glock
1085 * @state: the state we're requesting
1086 * @flags: the modifier flags
1087 * @gh: the holder structure
1091 void gfs2_holder_init(struct gfs2_glock *gl, unsigned int state, u16 flags,
1092 struct gfs2_holder *gh)
1094 INIT_LIST_HEAD(&gh->gh_list);
1095 gh->gh_gl = gl;
1096 gh->gh_ip = _RET_IP_;
1097 gh->gh_owner_pid = get_pid(task_pid(current));
1098 gh->gh_state = state;
1099 gh->gh_flags = flags;
1100 gh->gh_error = 0;
1101 gh->gh_iflags = 0;
1102 gfs2_glock_hold(gl);
1106 * gfs2_holder_reinit - reinitialize a struct gfs2_holder so we can requeue it
1107 * @state: the state we're requesting
1108 * @flags: the modifier flags
1109 * @gh: the holder structure
1111 * Don't mess with the glock.
1115 void gfs2_holder_reinit(unsigned int state, u16 flags, struct gfs2_holder *gh)
1117 gh->gh_state = state;
1118 gh->gh_flags = flags;
1119 gh->gh_iflags = 0;
1120 gh->gh_ip = _RET_IP_;
1121 put_pid(gh->gh_owner_pid);
1122 gh->gh_owner_pid = get_pid(task_pid(current));
1126 * gfs2_holder_uninit - uninitialize a holder structure (drop glock reference)
1127 * @gh: the holder structure
1131 void gfs2_holder_uninit(struct gfs2_holder *gh)
1133 put_pid(gh->gh_owner_pid);
1134 gfs2_glock_put(gh->gh_gl);
1135 gfs2_holder_mark_uninitialized(gh);
1136 gh->gh_ip = 0;
1139 static void gfs2_glock_update_hold_time(struct gfs2_glock *gl,
1140 unsigned long start_time)
1142 /* Have we waited longer that a second? */
1143 if (time_after(jiffies, start_time + HZ)) {
1144 /* Lengthen the minimum hold time. */
1145 gl->gl_hold_time = min(gl->gl_hold_time + GL_GLOCK_HOLD_INCR,
1146 GL_GLOCK_MAX_HOLD);
1151 * gfs2_glock_wait - wait on a glock acquisition
1152 * @gh: the glock holder
1154 * Returns: 0 on success
1157 int gfs2_glock_wait(struct gfs2_holder *gh)
1159 unsigned long start_time = jiffies;
1161 might_sleep();
1162 wait_on_bit(&gh->gh_iflags, HIF_WAIT, TASK_UNINTERRUPTIBLE);
1163 gfs2_glock_update_hold_time(gh->gh_gl, start_time);
1164 return gh->gh_error;
1167 static int glocks_pending(unsigned int num_gh, struct gfs2_holder *ghs)
1169 int i;
1171 for (i = 0; i < num_gh; i++)
1172 if (test_bit(HIF_WAIT, &ghs[i].gh_iflags))
1173 return 1;
1174 return 0;
1178 * gfs2_glock_async_wait - wait on multiple asynchronous glock acquisitions
1179 * @num_gh: the number of holders in the array
1180 * @ghs: the glock holder array
1182 * Returns: 0 on success, meaning all glocks have been granted and are held.
1183 * -ESTALE if the request timed out, meaning all glocks were released,
1184 * and the caller should retry the operation.
1187 int gfs2_glock_async_wait(unsigned int num_gh, struct gfs2_holder *ghs)
1189 struct gfs2_sbd *sdp = ghs[0].gh_gl->gl_name.ln_sbd;
1190 int i, ret = 0, timeout = 0;
1191 unsigned long start_time = jiffies;
1192 bool keep_waiting;
1194 might_sleep();
1196 * Total up the (minimum hold time * 2) of all glocks and use that to
1197 * determine the max amount of time we should wait.
1199 for (i = 0; i < num_gh; i++)
1200 timeout += ghs[i].gh_gl->gl_hold_time << 1;
1202 wait_for_dlm:
1203 if (!wait_event_timeout(sdp->sd_async_glock_wait,
1204 !glocks_pending(num_gh, ghs), timeout))
1205 ret = -ESTALE; /* request timed out. */
1208 * If dlm granted all our requests, we need to adjust the glock
1209 * minimum hold time values according to how long we waited.
1211 * If our request timed out, we need to repeatedly release any held
1212 * glocks we acquired thus far to allow dlm to acquire the remaining
1213 * glocks without deadlocking. We cannot currently cancel outstanding
1214 * glock acquisitions.
1216 * The HIF_WAIT bit tells us which requests still need a response from
1217 * dlm.
1219 * If dlm sent us any errors, we return the first error we find.
1221 keep_waiting = false;
1222 for (i = 0; i < num_gh; i++) {
1223 /* Skip holders we have already dequeued below. */
1224 if (!gfs2_holder_queued(&ghs[i]))
1225 continue;
1226 /* Skip holders with a pending DLM response. */
1227 if (test_bit(HIF_WAIT, &ghs[i].gh_iflags)) {
1228 keep_waiting = true;
1229 continue;
1232 if (test_bit(HIF_HOLDER, &ghs[i].gh_iflags)) {
1233 if (ret == -ESTALE)
1234 gfs2_glock_dq(&ghs[i]);
1235 else
1236 gfs2_glock_update_hold_time(ghs[i].gh_gl,
1237 start_time);
1239 if (!ret)
1240 ret = ghs[i].gh_error;
1243 if (keep_waiting)
1244 goto wait_for_dlm;
1247 * At this point, we've either acquired all locks or released them all.
1249 return ret;
1253 * handle_callback - process a demote request
1254 * @gl: the glock
1255 * @state: the state the caller wants us to change to
1257 * There are only two requests that we are going to see in actual
1258 * practise: LM_ST_SHARED and LM_ST_UNLOCKED
1261 static void handle_callback(struct gfs2_glock *gl, unsigned int state,
1262 unsigned long delay, bool remote)
1264 if (delay)
1265 set_bit(GLF_PENDING_DEMOTE, &gl->gl_flags);
1266 else
1267 gfs2_set_demote(gl);
1268 if (gl->gl_demote_state == LM_ST_EXCLUSIVE) {
1269 gl->gl_demote_state = state;
1270 gl->gl_demote_time = jiffies;
1271 } else if (gl->gl_demote_state != LM_ST_UNLOCKED &&
1272 gl->gl_demote_state != state) {
1273 gl->gl_demote_state = LM_ST_UNLOCKED;
1275 if (gl->gl_ops->go_callback)
1276 gl->gl_ops->go_callback(gl, remote);
1277 trace_gfs2_demote_rq(gl, remote);
1280 void gfs2_print_dbg(struct seq_file *seq, const char *fmt, ...)
1282 struct va_format vaf;
1283 va_list args;
1285 va_start(args, fmt);
1287 if (seq) {
1288 seq_vprintf(seq, fmt, args);
1289 } else {
1290 vaf.fmt = fmt;
1291 vaf.va = &args;
1293 pr_err("%pV", &vaf);
1296 va_end(args);
1300 * add_to_queue - Add a holder to the wait queue (but look for recursion)
1301 * @gh: the holder structure to add
1303 * Eventually we should move the recursive locking trap to a
1304 * debugging option or something like that. This is the fast
1305 * path and needs to have the minimum number of distractions.
1309 static inline void add_to_queue(struct gfs2_holder *gh)
1310 __releases(&gl->gl_lockref.lock)
1311 __acquires(&gl->gl_lockref.lock)
1313 struct gfs2_glock *gl = gh->gh_gl;
1314 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd;
1315 struct list_head *insert_pt = NULL;
1316 struct gfs2_holder *gh2;
1317 int try_futile = 0;
1319 GLOCK_BUG_ON(gl, gh->gh_owner_pid == NULL);
1320 if (test_and_set_bit(HIF_WAIT, &gh->gh_iflags))
1321 GLOCK_BUG_ON(gl, true);
1323 if (gh->gh_flags & (LM_FLAG_TRY | LM_FLAG_TRY_1CB)) {
1324 if (test_bit(GLF_LOCK, &gl->gl_flags))
1325 try_futile = !may_grant(gl, gh);
1326 if (test_bit(GLF_INVALIDATE_IN_PROGRESS, &gl->gl_flags))
1327 goto fail;
1330 list_for_each_entry(gh2, &gl->gl_holders, gh_list) {
1331 if (unlikely(gh2->gh_owner_pid == gh->gh_owner_pid &&
1332 (gh->gh_gl->gl_ops->go_type != LM_TYPE_FLOCK)))
1333 goto trap_recursive;
1334 if (try_futile &&
1335 !(gh2->gh_flags & (LM_FLAG_TRY | LM_FLAG_TRY_1CB))) {
1336 fail:
1337 gh->gh_error = GLR_TRYFAILED;
1338 gfs2_holder_wake(gh);
1339 return;
1341 if (test_bit(HIF_HOLDER, &gh2->gh_iflags))
1342 continue;
1343 if (unlikely((gh->gh_flags & LM_FLAG_PRIORITY) && !insert_pt))
1344 insert_pt = &gh2->gh_list;
1346 set_bit(GLF_QUEUED, &gl->gl_flags);
1347 trace_gfs2_glock_queue(gh, 1);
1348 gfs2_glstats_inc(gl, GFS2_LKS_QCOUNT);
1349 gfs2_sbstats_inc(gl, GFS2_LKS_QCOUNT);
1350 if (likely(insert_pt == NULL)) {
1351 list_add_tail(&gh->gh_list, &gl->gl_holders);
1352 if (unlikely(gh->gh_flags & LM_FLAG_PRIORITY))
1353 goto do_cancel;
1354 return;
1356 list_add_tail(&gh->gh_list, insert_pt);
1357 do_cancel:
1358 gh = list_first_entry(&gl->gl_holders, struct gfs2_holder, gh_list);
1359 if (!(gh->gh_flags & LM_FLAG_PRIORITY)) {
1360 spin_unlock(&gl->gl_lockref.lock);
1361 if (sdp->sd_lockstruct.ls_ops->lm_cancel)
1362 sdp->sd_lockstruct.ls_ops->lm_cancel(gl);
1363 spin_lock(&gl->gl_lockref.lock);
1365 return;
1367 trap_recursive:
1368 fs_err(sdp, "original: %pSR\n", (void *)gh2->gh_ip);
1369 fs_err(sdp, "pid: %d\n", pid_nr(gh2->gh_owner_pid));
1370 fs_err(sdp, "lock type: %d req lock state : %d\n",
1371 gh2->gh_gl->gl_name.ln_type, gh2->gh_state);
1372 fs_err(sdp, "new: %pSR\n", (void *)gh->gh_ip);
1373 fs_err(sdp, "pid: %d\n", pid_nr(gh->gh_owner_pid));
1374 fs_err(sdp, "lock type: %d req lock state : %d\n",
1375 gh->gh_gl->gl_name.ln_type, gh->gh_state);
1376 gfs2_dump_glock(NULL, gl, true);
1377 BUG();
1381 * gfs2_glock_nq - enqueue a struct gfs2_holder onto a glock (acquire a glock)
1382 * @gh: the holder structure
1384 * if (gh->gh_flags & GL_ASYNC), this never returns an error
1386 * Returns: 0, GLR_TRYFAILED, or errno on failure
1389 int gfs2_glock_nq(struct gfs2_holder *gh)
1391 struct gfs2_glock *gl = gh->gh_gl;
1392 int error = 0;
1394 if (glock_blocked_by_withdraw(gl) && !(gh->gh_flags & LM_FLAG_NOEXP))
1395 return -EIO;
1397 if (test_bit(GLF_LRU, &gl->gl_flags))
1398 gfs2_glock_remove_from_lru(gl);
1400 spin_lock(&gl->gl_lockref.lock);
1401 add_to_queue(gh);
1402 if (unlikely((LM_FLAG_NOEXP & gh->gh_flags) &&
1403 test_and_clear_bit(GLF_FROZEN, &gl->gl_flags))) {
1404 set_bit(GLF_REPLY_PENDING, &gl->gl_flags);
1405 gl->gl_lockref.count++;
1406 __gfs2_glock_queue_work(gl, 0);
1408 run_queue(gl, 1);
1409 spin_unlock(&gl->gl_lockref.lock);
1411 if (!(gh->gh_flags & GL_ASYNC))
1412 error = gfs2_glock_wait(gh);
1414 return error;
1418 * gfs2_glock_poll - poll to see if an async request has been completed
1419 * @gh: the holder
1421 * Returns: 1 if the request is ready to be gfs2_glock_wait()ed on
1424 int gfs2_glock_poll(struct gfs2_holder *gh)
1426 return test_bit(HIF_WAIT, &gh->gh_iflags) ? 0 : 1;
1430 * gfs2_glock_dq - dequeue a struct gfs2_holder from a glock (release a glock)
1431 * @gh: the glock holder
1435 void gfs2_glock_dq(struct gfs2_holder *gh)
1437 struct gfs2_glock *gl = gh->gh_gl;
1438 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd;
1439 unsigned delay = 0;
1440 int fast_path = 0;
1442 spin_lock(&gl->gl_lockref.lock);
1444 * If we're in the process of file system withdraw, we cannot just
1445 * dequeue any glocks until our journal is recovered, lest we
1446 * introduce file system corruption. We need two exceptions to this
1447 * rule: We need to allow unlocking of nondisk glocks and the glock
1448 * for our own journal that needs recovery.
1450 if (test_bit(SDF_WITHDRAW_RECOVERY, &sdp->sd_flags) &&
1451 glock_blocked_by_withdraw(gl) &&
1452 gh->gh_gl != sdp->sd_jinode_gl) {
1453 sdp->sd_glock_dqs_held++;
1454 might_sleep();
1455 wait_on_bit(&sdp->sd_flags, SDF_WITHDRAW_RECOVERY,
1456 TASK_UNINTERRUPTIBLE);
1458 if (gh->gh_flags & GL_NOCACHE)
1459 handle_callback(gl, LM_ST_UNLOCKED, 0, false);
1461 list_del_init(&gh->gh_list);
1462 clear_bit(HIF_HOLDER, &gh->gh_iflags);
1463 if (find_first_holder(gl) == NULL) {
1464 if (list_empty(&gl->gl_holders) &&
1465 !test_bit(GLF_PENDING_DEMOTE, &gl->gl_flags) &&
1466 !test_bit(GLF_DEMOTE, &gl->gl_flags))
1467 fast_path = 1;
1469 if (!test_bit(GLF_LFLUSH, &gl->gl_flags) && demote_ok(gl))
1470 gfs2_glock_add_to_lru(gl);
1472 trace_gfs2_glock_queue(gh, 0);
1473 if (unlikely(!fast_path)) {
1474 gl->gl_lockref.count++;
1475 if (test_bit(GLF_PENDING_DEMOTE, &gl->gl_flags) &&
1476 !test_bit(GLF_DEMOTE, &gl->gl_flags) &&
1477 gl->gl_name.ln_type == LM_TYPE_INODE)
1478 delay = gl->gl_hold_time;
1479 __gfs2_glock_queue_work(gl, delay);
1481 spin_unlock(&gl->gl_lockref.lock);
1484 void gfs2_glock_dq_wait(struct gfs2_holder *gh)
1486 struct gfs2_glock *gl = gh->gh_gl;
1487 gfs2_glock_dq(gh);
1488 might_sleep();
1489 wait_on_bit(&gl->gl_flags, GLF_DEMOTE, TASK_UNINTERRUPTIBLE);
1493 * gfs2_glock_dq_uninit - dequeue a holder from a glock and initialize it
1494 * @gh: the holder structure
1498 void gfs2_glock_dq_uninit(struct gfs2_holder *gh)
1500 gfs2_glock_dq(gh);
1501 gfs2_holder_uninit(gh);
1505 * gfs2_glock_nq_num - acquire a glock based on lock number
1506 * @sdp: the filesystem
1507 * @number: the lock number
1508 * @glops: the glock operations for the type of glock
1509 * @state: the state to acquire the glock in
1510 * @flags: modifier flags for the acquisition
1511 * @gh: the struct gfs2_holder
1513 * Returns: errno
1516 int gfs2_glock_nq_num(struct gfs2_sbd *sdp, u64 number,
1517 const struct gfs2_glock_operations *glops,
1518 unsigned int state, u16 flags, struct gfs2_holder *gh)
1520 struct gfs2_glock *gl;
1521 int error;
1523 error = gfs2_glock_get(sdp, number, glops, CREATE, &gl);
1524 if (!error) {
1525 error = gfs2_glock_nq_init(gl, state, flags, gh);
1526 gfs2_glock_put(gl);
1529 return error;
1533 * glock_compare - Compare two struct gfs2_glock structures for sorting
1534 * @arg_a: the first structure
1535 * @arg_b: the second structure
1539 static int glock_compare(const void *arg_a, const void *arg_b)
1541 const struct gfs2_holder *gh_a = *(const struct gfs2_holder **)arg_a;
1542 const struct gfs2_holder *gh_b = *(const struct gfs2_holder **)arg_b;
1543 const struct lm_lockname *a = &gh_a->gh_gl->gl_name;
1544 const struct lm_lockname *b = &gh_b->gh_gl->gl_name;
1546 if (a->ln_number > b->ln_number)
1547 return 1;
1548 if (a->ln_number < b->ln_number)
1549 return -1;
1550 BUG_ON(gh_a->gh_gl->gl_ops->go_type == gh_b->gh_gl->gl_ops->go_type);
1551 return 0;
1555 * nq_m_sync - synchonously acquire more than one glock in deadlock free order
1556 * @num_gh: the number of structures
1557 * @ghs: an array of struct gfs2_holder structures
1559 * Returns: 0 on success (all glocks acquired),
1560 * errno on failure (no glocks acquired)
1563 static int nq_m_sync(unsigned int num_gh, struct gfs2_holder *ghs,
1564 struct gfs2_holder **p)
1566 unsigned int x;
1567 int error = 0;
1569 for (x = 0; x < num_gh; x++)
1570 p[x] = &ghs[x];
1572 sort(p, num_gh, sizeof(struct gfs2_holder *), glock_compare, NULL);
1574 for (x = 0; x < num_gh; x++) {
1575 p[x]->gh_flags &= ~(LM_FLAG_TRY | GL_ASYNC);
1577 error = gfs2_glock_nq(p[x]);
1578 if (error) {
1579 while (x--)
1580 gfs2_glock_dq(p[x]);
1581 break;
1585 return error;
1589 * gfs2_glock_nq_m - acquire multiple glocks
1590 * @num_gh: the number of structures
1591 * @ghs: an array of struct gfs2_holder structures
1594 * Returns: 0 on success (all glocks acquired),
1595 * errno on failure (no glocks acquired)
1598 int gfs2_glock_nq_m(unsigned int num_gh, struct gfs2_holder *ghs)
1600 struct gfs2_holder *tmp[4];
1601 struct gfs2_holder **pph = tmp;
1602 int error = 0;
1604 switch(num_gh) {
1605 case 0:
1606 return 0;
1607 case 1:
1608 ghs->gh_flags &= ~(LM_FLAG_TRY | GL_ASYNC);
1609 return gfs2_glock_nq(ghs);
1610 default:
1611 if (num_gh <= 4)
1612 break;
1613 pph = kmalloc_array(num_gh, sizeof(struct gfs2_holder *),
1614 GFP_NOFS);
1615 if (!pph)
1616 return -ENOMEM;
1619 error = nq_m_sync(num_gh, ghs, pph);
1621 if (pph != tmp)
1622 kfree(pph);
1624 return error;
1628 * gfs2_glock_dq_m - release multiple glocks
1629 * @num_gh: the number of structures
1630 * @ghs: an array of struct gfs2_holder structures
1634 void gfs2_glock_dq_m(unsigned int num_gh, struct gfs2_holder *ghs)
1636 while (num_gh--)
1637 gfs2_glock_dq(&ghs[num_gh]);
1640 void gfs2_glock_cb(struct gfs2_glock *gl, unsigned int state)
1642 unsigned long delay = 0;
1643 unsigned long holdtime;
1644 unsigned long now = jiffies;
1646 gfs2_glock_hold(gl);
1647 holdtime = gl->gl_tchange + gl->gl_hold_time;
1648 if (test_bit(GLF_QUEUED, &gl->gl_flags) &&
1649 gl->gl_name.ln_type == LM_TYPE_INODE) {
1650 if (time_before(now, holdtime))
1651 delay = holdtime - now;
1652 if (test_bit(GLF_REPLY_PENDING, &gl->gl_flags))
1653 delay = gl->gl_hold_time;
1656 spin_lock(&gl->gl_lockref.lock);
1657 handle_callback(gl, state, delay, true);
1658 __gfs2_glock_queue_work(gl, delay);
1659 spin_unlock(&gl->gl_lockref.lock);
1663 * gfs2_should_freeze - Figure out if glock should be frozen
1664 * @gl: The glock in question
1666 * Glocks are not frozen if (a) the result of the dlm operation is
1667 * an error, (b) the locking operation was an unlock operation or
1668 * (c) if there is a "noexp" flagged request anywhere in the queue
1670 * Returns: 1 if freezing should occur, 0 otherwise
1673 static int gfs2_should_freeze(const struct gfs2_glock *gl)
1675 const struct gfs2_holder *gh;
1677 if (gl->gl_reply & ~LM_OUT_ST_MASK)
1678 return 0;
1679 if (gl->gl_target == LM_ST_UNLOCKED)
1680 return 0;
1682 list_for_each_entry(gh, &gl->gl_holders, gh_list) {
1683 if (test_bit(HIF_HOLDER, &gh->gh_iflags))
1684 continue;
1685 if (LM_FLAG_NOEXP & gh->gh_flags)
1686 return 0;
1689 return 1;
1693 * gfs2_glock_complete - Callback used by locking
1694 * @gl: Pointer to the glock
1695 * @ret: The return value from the dlm
1697 * The gl_reply field is under the gl_lockref.lock lock so that it is ok
1698 * to use a bitfield shared with other glock state fields.
1701 void gfs2_glock_complete(struct gfs2_glock *gl, int ret)
1703 struct lm_lockstruct *ls = &gl->gl_name.ln_sbd->sd_lockstruct;
1705 spin_lock(&gl->gl_lockref.lock);
1706 gl->gl_reply = ret;
1708 if (unlikely(test_bit(DFL_BLOCK_LOCKS, &ls->ls_recover_flags))) {
1709 if (gfs2_should_freeze(gl)) {
1710 set_bit(GLF_FROZEN, &gl->gl_flags);
1711 spin_unlock(&gl->gl_lockref.lock);
1712 return;
1716 gl->gl_lockref.count++;
1717 set_bit(GLF_REPLY_PENDING, &gl->gl_flags);
1718 __gfs2_glock_queue_work(gl, 0);
1719 spin_unlock(&gl->gl_lockref.lock);
1722 static int glock_cmp(void *priv, struct list_head *a, struct list_head *b)
1724 struct gfs2_glock *gla, *glb;
1726 gla = list_entry(a, struct gfs2_glock, gl_lru);
1727 glb = list_entry(b, struct gfs2_glock, gl_lru);
1729 if (gla->gl_name.ln_number > glb->gl_name.ln_number)
1730 return 1;
1731 if (gla->gl_name.ln_number < glb->gl_name.ln_number)
1732 return -1;
1734 return 0;
1738 * gfs2_dispose_glock_lru - Demote a list of glocks
1739 * @list: The list to dispose of
1741 * Disposing of glocks may involve disk accesses, so that here we sort
1742 * the glocks by number (i.e. disk location of the inodes) so that if
1743 * there are any such accesses, they'll be sent in order (mostly).
1745 * Must be called under the lru_lock, but may drop and retake this
1746 * lock. While the lru_lock is dropped, entries may vanish from the
1747 * list, but no new entries will appear on the list (since it is
1748 * private)
1751 static void gfs2_dispose_glock_lru(struct list_head *list)
1752 __releases(&lru_lock)
1753 __acquires(&lru_lock)
1755 struct gfs2_glock *gl;
1757 list_sort(NULL, list, glock_cmp);
1759 while(!list_empty(list)) {
1760 gl = list_first_entry(list, struct gfs2_glock, gl_lru);
1761 list_del_init(&gl->gl_lru);
1762 if (!spin_trylock(&gl->gl_lockref.lock)) {
1763 add_back_to_lru:
1764 list_add(&gl->gl_lru, &lru_list);
1765 set_bit(GLF_LRU, &gl->gl_flags);
1766 atomic_inc(&lru_count);
1767 continue;
1769 if (test_and_set_bit(GLF_LOCK, &gl->gl_flags)) {
1770 spin_unlock(&gl->gl_lockref.lock);
1771 goto add_back_to_lru;
1773 gl->gl_lockref.count++;
1774 if (demote_ok(gl))
1775 handle_callback(gl, LM_ST_UNLOCKED, 0, false);
1776 WARN_ON(!test_and_clear_bit(GLF_LOCK, &gl->gl_flags));
1777 __gfs2_glock_queue_work(gl, 0);
1778 spin_unlock(&gl->gl_lockref.lock);
1779 cond_resched_lock(&lru_lock);
1784 * gfs2_scan_glock_lru - Scan the LRU looking for locks to demote
1785 * @nr: The number of entries to scan
1787 * This function selects the entries on the LRU which are able to
1788 * be demoted, and then kicks off the process by calling
1789 * gfs2_dispose_glock_lru() above.
1792 static long gfs2_scan_glock_lru(int nr)
1794 struct gfs2_glock *gl;
1795 LIST_HEAD(skipped);
1796 LIST_HEAD(dispose);
1797 long freed = 0;
1799 spin_lock(&lru_lock);
1800 while ((nr-- >= 0) && !list_empty(&lru_list)) {
1801 gl = list_first_entry(&lru_list, struct gfs2_glock, gl_lru);
1803 /* Test for being demotable */
1804 if (!test_bit(GLF_LOCK, &gl->gl_flags)) {
1805 list_move(&gl->gl_lru, &dispose);
1806 atomic_dec(&lru_count);
1807 clear_bit(GLF_LRU, &gl->gl_flags);
1808 freed++;
1809 continue;
1812 list_move(&gl->gl_lru, &skipped);
1814 list_splice(&skipped, &lru_list);
1815 if (!list_empty(&dispose))
1816 gfs2_dispose_glock_lru(&dispose);
1817 spin_unlock(&lru_lock);
1819 return freed;
1822 static unsigned long gfs2_glock_shrink_scan(struct shrinker *shrink,
1823 struct shrink_control *sc)
1825 if (!(sc->gfp_mask & __GFP_FS))
1826 return SHRINK_STOP;
1827 return gfs2_scan_glock_lru(sc->nr_to_scan);
1830 static unsigned long gfs2_glock_shrink_count(struct shrinker *shrink,
1831 struct shrink_control *sc)
1833 return vfs_pressure_ratio(atomic_read(&lru_count));
1836 static struct shrinker glock_shrinker = {
1837 .seeks = DEFAULT_SEEKS,
1838 .count_objects = gfs2_glock_shrink_count,
1839 .scan_objects = gfs2_glock_shrink_scan,
1843 * examine_bucket - Call a function for glock in a hash bucket
1844 * @examiner: the function
1845 * @sdp: the filesystem
1846 * @bucket: the bucket
1848 * Note that the function can be called multiple times on the same
1849 * object. So the user must ensure that the function can cope with
1850 * that.
1853 static void glock_hash_walk(glock_examiner examiner, const struct gfs2_sbd *sdp)
1855 struct gfs2_glock *gl;
1856 struct rhashtable_iter iter;
1858 rhashtable_walk_enter(&gl_hash_table, &iter);
1860 do {
1861 rhashtable_walk_start(&iter);
1863 while ((gl = rhashtable_walk_next(&iter)) && !IS_ERR(gl))
1864 if (gl->gl_name.ln_sbd == sdp &&
1865 lockref_get_not_dead(&gl->gl_lockref))
1866 examiner(gl);
1868 rhashtable_walk_stop(&iter);
1869 } while (cond_resched(), gl == ERR_PTR(-EAGAIN));
1871 rhashtable_walk_exit(&iter);
1874 bool gfs2_queue_delete_work(struct gfs2_glock *gl, unsigned long delay)
1876 bool queued;
1878 spin_lock(&gl->gl_lockref.lock);
1879 queued = queue_delayed_work(gfs2_delete_workqueue,
1880 &gl->gl_delete, delay);
1881 if (queued)
1882 set_bit(GLF_PENDING_DELETE, &gl->gl_flags);
1883 spin_unlock(&gl->gl_lockref.lock);
1884 return queued;
1887 void gfs2_cancel_delete_work(struct gfs2_glock *gl)
1889 if (cancel_delayed_work_sync(&gl->gl_delete)) {
1890 clear_bit(GLF_PENDING_DELETE, &gl->gl_flags);
1891 gfs2_glock_put(gl);
1895 bool gfs2_delete_work_queued(const struct gfs2_glock *gl)
1897 return test_bit(GLF_PENDING_DELETE, &gl->gl_flags);
1900 static void flush_delete_work(struct gfs2_glock *gl)
1902 if (cancel_delayed_work(&gl->gl_delete)) {
1903 queue_delayed_work(gfs2_delete_workqueue,
1904 &gl->gl_delete, 0);
1906 gfs2_glock_queue_work(gl, 0);
1909 void gfs2_flush_delete_work(struct gfs2_sbd *sdp)
1911 glock_hash_walk(flush_delete_work, sdp);
1912 flush_workqueue(gfs2_delete_workqueue);
1916 * thaw_glock - thaw out a glock which has an unprocessed reply waiting
1917 * @gl: The glock to thaw
1921 static void thaw_glock(struct gfs2_glock *gl)
1923 if (!test_and_clear_bit(GLF_FROZEN, &gl->gl_flags)) {
1924 gfs2_glock_put(gl);
1925 return;
1927 set_bit(GLF_REPLY_PENDING, &gl->gl_flags);
1928 gfs2_glock_queue_work(gl, 0);
1932 * clear_glock - look at a glock and see if we can free it from glock cache
1933 * @gl: the glock to look at
1937 static void clear_glock(struct gfs2_glock *gl)
1939 gfs2_glock_remove_from_lru(gl);
1941 spin_lock(&gl->gl_lockref.lock);
1942 if (gl->gl_state != LM_ST_UNLOCKED)
1943 handle_callback(gl, LM_ST_UNLOCKED, 0, false);
1944 __gfs2_glock_queue_work(gl, 0);
1945 spin_unlock(&gl->gl_lockref.lock);
1949 * gfs2_glock_thaw - Thaw any frozen glocks
1950 * @sdp: The super block
1954 void gfs2_glock_thaw(struct gfs2_sbd *sdp)
1956 glock_hash_walk(thaw_glock, sdp);
1959 static void dump_glock(struct seq_file *seq, struct gfs2_glock *gl, bool fsid)
1961 spin_lock(&gl->gl_lockref.lock);
1962 gfs2_dump_glock(seq, gl, fsid);
1963 spin_unlock(&gl->gl_lockref.lock);
1966 static void dump_glock_func(struct gfs2_glock *gl)
1968 dump_glock(NULL, gl, true);
1972 * gfs2_gl_hash_clear - Empty out the glock hash table
1973 * @sdp: the filesystem
1974 * @wait: wait until it's all gone
1976 * Called when unmounting the filesystem.
1979 void gfs2_gl_hash_clear(struct gfs2_sbd *sdp)
1981 set_bit(SDF_SKIP_DLM_UNLOCK, &sdp->sd_flags);
1982 flush_workqueue(glock_workqueue);
1983 glock_hash_walk(clear_glock, sdp);
1984 flush_workqueue(glock_workqueue);
1985 wait_event_timeout(sdp->sd_glock_wait,
1986 atomic_read(&sdp->sd_glock_disposal) == 0,
1987 HZ * 600);
1988 glock_hash_walk(dump_glock_func, sdp);
1991 void gfs2_glock_finish_truncate(struct gfs2_inode *ip)
1993 struct gfs2_glock *gl = ip->i_gl;
1994 int ret;
1996 ret = gfs2_truncatei_resume(ip);
1997 gfs2_glock_assert_withdraw(gl, ret == 0);
1999 spin_lock(&gl->gl_lockref.lock);
2000 clear_bit(GLF_LOCK, &gl->gl_flags);
2001 run_queue(gl, 1);
2002 spin_unlock(&gl->gl_lockref.lock);
2005 static const char *state2str(unsigned state)
2007 switch(state) {
2008 case LM_ST_UNLOCKED:
2009 return "UN";
2010 case LM_ST_SHARED:
2011 return "SH";
2012 case LM_ST_DEFERRED:
2013 return "DF";
2014 case LM_ST_EXCLUSIVE:
2015 return "EX";
2017 return "??";
2020 static const char *hflags2str(char *buf, u16 flags, unsigned long iflags)
2022 char *p = buf;
2023 if (flags & LM_FLAG_TRY)
2024 *p++ = 't';
2025 if (flags & LM_FLAG_TRY_1CB)
2026 *p++ = 'T';
2027 if (flags & LM_FLAG_NOEXP)
2028 *p++ = 'e';
2029 if (flags & LM_FLAG_ANY)
2030 *p++ = 'A';
2031 if (flags & LM_FLAG_PRIORITY)
2032 *p++ = 'p';
2033 if (flags & GL_ASYNC)
2034 *p++ = 'a';
2035 if (flags & GL_EXACT)
2036 *p++ = 'E';
2037 if (flags & GL_NOCACHE)
2038 *p++ = 'c';
2039 if (test_bit(HIF_HOLDER, &iflags))
2040 *p++ = 'H';
2041 if (test_bit(HIF_WAIT, &iflags))
2042 *p++ = 'W';
2043 if (test_bit(HIF_FIRST, &iflags))
2044 *p++ = 'F';
2045 *p = 0;
2046 return buf;
2050 * dump_holder - print information about a glock holder
2051 * @seq: the seq_file struct
2052 * @gh: the glock holder
2053 * @fs_id_buf: pointer to file system id (if requested)
2057 static void dump_holder(struct seq_file *seq, const struct gfs2_holder *gh,
2058 const char *fs_id_buf)
2060 struct task_struct *gh_owner = NULL;
2061 char flags_buf[32];
2063 rcu_read_lock();
2064 if (gh->gh_owner_pid)
2065 gh_owner = pid_task(gh->gh_owner_pid, PIDTYPE_PID);
2066 gfs2_print_dbg(seq, "%s H: s:%s f:%s e:%d p:%ld [%s] %pS\n",
2067 fs_id_buf, state2str(gh->gh_state),
2068 hflags2str(flags_buf, gh->gh_flags, gh->gh_iflags),
2069 gh->gh_error,
2070 gh->gh_owner_pid ? (long)pid_nr(gh->gh_owner_pid) : -1,
2071 gh_owner ? gh_owner->comm : "(ended)",
2072 (void *)gh->gh_ip);
2073 rcu_read_unlock();
2076 static const char *gflags2str(char *buf, const struct gfs2_glock *gl)
2078 const unsigned long *gflags = &gl->gl_flags;
2079 char *p = buf;
2081 if (test_bit(GLF_LOCK, gflags))
2082 *p++ = 'l';
2083 if (test_bit(GLF_DEMOTE, gflags))
2084 *p++ = 'D';
2085 if (test_bit(GLF_PENDING_DEMOTE, gflags))
2086 *p++ = 'd';
2087 if (test_bit(GLF_DEMOTE_IN_PROGRESS, gflags))
2088 *p++ = 'p';
2089 if (test_bit(GLF_DIRTY, gflags))
2090 *p++ = 'y';
2091 if (test_bit(GLF_LFLUSH, gflags))
2092 *p++ = 'f';
2093 if (test_bit(GLF_INVALIDATE_IN_PROGRESS, gflags))
2094 *p++ = 'i';
2095 if (test_bit(GLF_REPLY_PENDING, gflags))
2096 *p++ = 'r';
2097 if (test_bit(GLF_INITIAL, gflags))
2098 *p++ = 'I';
2099 if (test_bit(GLF_FROZEN, gflags))
2100 *p++ = 'F';
2101 if (test_bit(GLF_QUEUED, gflags))
2102 *p++ = 'q';
2103 if (test_bit(GLF_LRU, gflags))
2104 *p++ = 'L';
2105 if (gl->gl_object)
2106 *p++ = 'o';
2107 if (test_bit(GLF_BLOCKING, gflags))
2108 *p++ = 'b';
2109 *p = 0;
2110 return buf;
2114 * gfs2_dump_glock - print information about a glock
2115 * @seq: The seq_file struct
2116 * @gl: the glock
2117 * @fsid: If true, also dump the file system id
2119 * The file format is as follows:
2120 * One line per object, capital letters are used to indicate objects
2121 * G = glock, I = Inode, R = rgrp, H = holder. Glocks are not indented,
2122 * other objects are indented by a single space and follow the glock to
2123 * which they are related. Fields are indicated by lower case letters
2124 * followed by a colon and the field value, except for strings which are in
2125 * [] so that its possible to see if they are composed of spaces for
2126 * example. The field's are n = number (id of the object), f = flags,
2127 * t = type, s = state, r = refcount, e = error, p = pid.
2131 void gfs2_dump_glock(struct seq_file *seq, struct gfs2_glock *gl, bool fsid)
2133 const struct gfs2_glock_operations *glops = gl->gl_ops;
2134 unsigned long long dtime;
2135 const struct gfs2_holder *gh;
2136 char gflags_buf[32];
2137 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd;
2138 char fs_id_buf[sizeof(sdp->sd_fsname) + 7];
2139 unsigned long nrpages = 0;
2141 if (gl->gl_ops->go_flags & GLOF_ASPACE) {
2142 struct address_space *mapping = gfs2_glock2aspace(gl);
2144 nrpages = mapping->nrpages;
2146 memset(fs_id_buf, 0, sizeof(fs_id_buf));
2147 if (fsid && sdp) /* safety precaution */
2148 sprintf(fs_id_buf, "fsid=%s: ", sdp->sd_fsname);
2149 dtime = jiffies - gl->gl_demote_time;
2150 dtime *= 1000000/HZ; /* demote time in uSec */
2151 if (!test_bit(GLF_DEMOTE, &gl->gl_flags))
2152 dtime = 0;
2153 gfs2_print_dbg(seq, "%sG: s:%s n:%u/%llx f:%s t:%s d:%s/%llu a:%d "
2154 "v:%d r:%d m:%ld p:%lu\n",
2155 fs_id_buf, state2str(gl->gl_state),
2156 gl->gl_name.ln_type,
2157 (unsigned long long)gl->gl_name.ln_number,
2158 gflags2str(gflags_buf, gl),
2159 state2str(gl->gl_target),
2160 state2str(gl->gl_demote_state), dtime,
2161 atomic_read(&gl->gl_ail_count),
2162 atomic_read(&gl->gl_revokes),
2163 (int)gl->gl_lockref.count, gl->gl_hold_time, nrpages);
2165 list_for_each_entry(gh, &gl->gl_holders, gh_list)
2166 dump_holder(seq, gh, fs_id_buf);
2168 if (gl->gl_state != LM_ST_UNLOCKED && glops->go_dump)
2169 glops->go_dump(seq, gl, fs_id_buf);
2172 static int gfs2_glstats_seq_show(struct seq_file *seq, void *iter_ptr)
2174 struct gfs2_glock *gl = iter_ptr;
2176 seq_printf(seq, "G: n:%u/%llx rtt:%llu/%llu rttb:%llu/%llu irt:%llu/%llu dcnt: %llu qcnt: %llu\n",
2177 gl->gl_name.ln_type,
2178 (unsigned long long)gl->gl_name.ln_number,
2179 (unsigned long long)gl->gl_stats.stats[GFS2_LKS_SRTT],
2180 (unsigned long long)gl->gl_stats.stats[GFS2_LKS_SRTTVAR],
2181 (unsigned long long)gl->gl_stats.stats[GFS2_LKS_SRTTB],
2182 (unsigned long long)gl->gl_stats.stats[GFS2_LKS_SRTTVARB],
2183 (unsigned long long)gl->gl_stats.stats[GFS2_LKS_SIRT],
2184 (unsigned long long)gl->gl_stats.stats[GFS2_LKS_SIRTVAR],
2185 (unsigned long long)gl->gl_stats.stats[GFS2_LKS_DCOUNT],
2186 (unsigned long long)gl->gl_stats.stats[GFS2_LKS_QCOUNT]);
2187 return 0;
2190 static const char *gfs2_gltype[] = {
2191 "type",
2192 "reserved",
2193 "nondisk",
2194 "inode",
2195 "rgrp",
2196 "meta",
2197 "iopen",
2198 "flock",
2199 "plock",
2200 "quota",
2201 "journal",
2204 static const char *gfs2_stype[] = {
2205 [GFS2_LKS_SRTT] = "srtt",
2206 [GFS2_LKS_SRTTVAR] = "srttvar",
2207 [GFS2_LKS_SRTTB] = "srttb",
2208 [GFS2_LKS_SRTTVARB] = "srttvarb",
2209 [GFS2_LKS_SIRT] = "sirt",
2210 [GFS2_LKS_SIRTVAR] = "sirtvar",
2211 [GFS2_LKS_DCOUNT] = "dlm",
2212 [GFS2_LKS_QCOUNT] = "queue",
2215 #define GFS2_NR_SBSTATS (ARRAY_SIZE(gfs2_gltype) * ARRAY_SIZE(gfs2_stype))
2217 static int gfs2_sbstats_seq_show(struct seq_file *seq, void *iter_ptr)
2219 struct gfs2_sbd *sdp = seq->private;
2220 loff_t pos = *(loff_t *)iter_ptr;
2221 unsigned index = pos >> 3;
2222 unsigned subindex = pos & 0x07;
2223 int i;
2225 if (index == 0 && subindex != 0)
2226 return 0;
2228 seq_printf(seq, "%-10s %8s:", gfs2_gltype[index],
2229 (index == 0) ? "cpu": gfs2_stype[subindex]);
2231 for_each_possible_cpu(i) {
2232 const struct gfs2_pcpu_lkstats *lkstats = per_cpu_ptr(sdp->sd_lkstats, i);
2234 if (index == 0)
2235 seq_printf(seq, " %15u", i);
2236 else
2237 seq_printf(seq, " %15llu", (unsigned long long)lkstats->
2238 lkstats[index - 1].stats[subindex]);
2240 seq_putc(seq, '\n');
2241 return 0;
2244 int __init gfs2_glock_init(void)
2246 int i, ret;
2248 ret = rhashtable_init(&gl_hash_table, &ht_parms);
2249 if (ret < 0)
2250 return ret;
2252 glock_workqueue = alloc_workqueue("glock_workqueue", WQ_MEM_RECLAIM |
2253 WQ_HIGHPRI | WQ_FREEZABLE, 0);
2254 if (!glock_workqueue) {
2255 rhashtable_destroy(&gl_hash_table);
2256 return -ENOMEM;
2258 gfs2_delete_workqueue = alloc_workqueue("delete_workqueue",
2259 WQ_MEM_RECLAIM | WQ_FREEZABLE,
2261 if (!gfs2_delete_workqueue) {
2262 destroy_workqueue(glock_workqueue);
2263 rhashtable_destroy(&gl_hash_table);
2264 return -ENOMEM;
2267 ret = register_shrinker(&glock_shrinker);
2268 if (ret) {
2269 destroy_workqueue(gfs2_delete_workqueue);
2270 destroy_workqueue(glock_workqueue);
2271 rhashtable_destroy(&gl_hash_table);
2272 return ret;
2275 for (i = 0; i < GLOCK_WAIT_TABLE_SIZE; i++)
2276 init_waitqueue_head(glock_wait_table + i);
2278 return 0;
2281 void gfs2_glock_exit(void)
2283 unregister_shrinker(&glock_shrinker);
2284 rhashtable_destroy(&gl_hash_table);
2285 destroy_workqueue(glock_workqueue);
2286 destroy_workqueue(gfs2_delete_workqueue);
2289 static void gfs2_glock_iter_next(struct gfs2_glock_iter *gi, loff_t n)
2291 struct gfs2_glock *gl = gi->gl;
2293 if (gl) {
2294 if (n == 0)
2295 return;
2296 if (!lockref_put_not_zero(&gl->gl_lockref))
2297 gfs2_glock_queue_put(gl);
2299 for (;;) {
2300 gl = rhashtable_walk_next(&gi->hti);
2301 if (IS_ERR_OR_NULL(gl)) {
2302 if (gl == ERR_PTR(-EAGAIN)) {
2303 n = 1;
2304 continue;
2306 gl = NULL;
2307 break;
2309 if (gl->gl_name.ln_sbd != gi->sdp)
2310 continue;
2311 if (n <= 1) {
2312 if (!lockref_get_not_dead(&gl->gl_lockref))
2313 continue;
2314 break;
2315 } else {
2316 if (__lockref_is_dead(&gl->gl_lockref))
2317 continue;
2318 n--;
2321 gi->gl = gl;
2324 static void *gfs2_glock_seq_start(struct seq_file *seq, loff_t *pos)
2325 __acquires(RCU)
2327 struct gfs2_glock_iter *gi = seq->private;
2328 loff_t n;
2331 * We can either stay where we are, skip to the next hash table
2332 * entry, or start from the beginning.
2334 if (*pos < gi->last_pos) {
2335 rhashtable_walk_exit(&gi->hti);
2336 rhashtable_walk_enter(&gl_hash_table, &gi->hti);
2337 n = *pos + 1;
2338 } else {
2339 n = *pos - gi->last_pos;
2342 rhashtable_walk_start(&gi->hti);
2344 gfs2_glock_iter_next(gi, n);
2345 gi->last_pos = *pos;
2346 return gi->gl;
2349 static void *gfs2_glock_seq_next(struct seq_file *seq, void *iter_ptr,
2350 loff_t *pos)
2352 struct gfs2_glock_iter *gi = seq->private;
2354 (*pos)++;
2355 gi->last_pos = *pos;
2356 gfs2_glock_iter_next(gi, 1);
2357 return gi->gl;
2360 static void gfs2_glock_seq_stop(struct seq_file *seq, void *iter_ptr)
2361 __releases(RCU)
2363 struct gfs2_glock_iter *gi = seq->private;
2365 rhashtable_walk_stop(&gi->hti);
2368 static int gfs2_glock_seq_show(struct seq_file *seq, void *iter_ptr)
2370 dump_glock(seq, iter_ptr, false);
2371 return 0;
2374 static void *gfs2_sbstats_seq_start(struct seq_file *seq, loff_t *pos)
2376 preempt_disable();
2377 if (*pos >= GFS2_NR_SBSTATS)
2378 return NULL;
2379 return pos;
2382 static void *gfs2_sbstats_seq_next(struct seq_file *seq, void *iter_ptr,
2383 loff_t *pos)
2385 (*pos)++;
2386 if (*pos >= GFS2_NR_SBSTATS)
2387 return NULL;
2388 return pos;
2391 static void gfs2_sbstats_seq_stop(struct seq_file *seq, void *iter_ptr)
2393 preempt_enable();
2396 static const struct seq_operations gfs2_glock_seq_ops = {
2397 .start = gfs2_glock_seq_start,
2398 .next = gfs2_glock_seq_next,
2399 .stop = gfs2_glock_seq_stop,
2400 .show = gfs2_glock_seq_show,
2403 static const struct seq_operations gfs2_glstats_seq_ops = {
2404 .start = gfs2_glock_seq_start,
2405 .next = gfs2_glock_seq_next,
2406 .stop = gfs2_glock_seq_stop,
2407 .show = gfs2_glstats_seq_show,
2410 static const struct seq_operations gfs2_sbstats_seq_ops = {
2411 .start = gfs2_sbstats_seq_start,
2412 .next = gfs2_sbstats_seq_next,
2413 .stop = gfs2_sbstats_seq_stop,
2414 .show = gfs2_sbstats_seq_show,
2417 #define GFS2_SEQ_GOODSIZE min(PAGE_SIZE << PAGE_ALLOC_COSTLY_ORDER, 65536UL)
2419 static int __gfs2_glocks_open(struct inode *inode, struct file *file,
2420 const struct seq_operations *ops)
2422 int ret = seq_open_private(file, ops, sizeof(struct gfs2_glock_iter));
2423 if (ret == 0) {
2424 struct seq_file *seq = file->private_data;
2425 struct gfs2_glock_iter *gi = seq->private;
2427 gi->sdp = inode->i_private;
2428 seq->buf = kmalloc(GFS2_SEQ_GOODSIZE, GFP_KERNEL | __GFP_NOWARN);
2429 if (seq->buf)
2430 seq->size = GFS2_SEQ_GOODSIZE;
2432 * Initially, we are "before" the first hash table entry; the
2433 * first call to rhashtable_walk_next gets us the first entry.
2435 gi->last_pos = -1;
2436 gi->gl = NULL;
2437 rhashtable_walk_enter(&gl_hash_table, &gi->hti);
2439 return ret;
2442 static int gfs2_glocks_open(struct inode *inode, struct file *file)
2444 return __gfs2_glocks_open(inode, file, &gfs2_glock_seq_ops);
2447 static int gfs2_glocks_release(struct inode *inode, struct file *file)
2449 struct seq_file *seq = file->private_data;
2450 struct gfs2_glock_iter *gi = seq->private;
2452 if (gi->gl)
2453 gfs2_glock_put(gi->gl);
2454 rhashtable_walk_exit(&gi->hti);
2455 return seq_release_private(inode, file);
2458 static int gfs2_glstats_open(struct inode *inode, struct file *file)
2460 return __gfs2_glocks_open(inode, file, &gfs2_glstats_seq_ops);
2463 static int gfs2_sbstats_open(struct inode *inode, struct file *file)
2465 int ret = seq_open(file, &gfs2_sbstats_seq_ops);
2466 if (ret == 0) {
2467 struct seq_file *seq = file->private_data;
2468 seq->private = inode->i_private; /* sdp */
2470 return ret;
2473 static const struct file_operations gfs2_glocks_fops = {
2474 .owner = THIS_MODULE,
2475 .open = gfs2_glocks_open,
2476 .read = seq_read,
2477 .llseek = seq_lseek,
2478 .release = gfs2_glocks_release,
2481 static const struct file_operations gfs2_glstats_fops = {
2482 .owner = THIS_MODULE,
2483 .open = gfs2_glstats_open,
2484 .read = seq_read,
2485 .llseek = seq_lseek,
2486 .release = gfs2_glocks_release,
2489 static const struct file_operations gfs2_sbstats_fops = {
2490 .owner = THIS_MODULE,
2491 .open = gfs2_sbstats_open,
2492 .read = seq_read,
2493 .llseek = seq_lseek,
2494 .release = seq_release,
2497 void gfs2_create_debugfs_file(struct gfs2_sbd *sdp)
2499 sdp->debugfs_dir = debugfs_create_dir(sdp->sd_table_name, gfs2_root);
2501 debugfs_create_file("glocks", S_IFREG | S_IRUGO, sdp->debugfs_dir, sdp,
2502 &gfs2_glocks_fops);
2504 debugfs_create_file("glstats", S_IFREG | S_IRUGO, sdp->debugfs_dir, sdp,
2505 &gfs2_glstats_fops);
2507 debugfs_create_file("sbstats", S_IFREG | S_IRUGO, sdp->debugfs_dir, sdp,
2508 &gfs2_sbstats_fops);
2511 void gfs2_delete_debugfs_file(struct gfs2_sbd *sdp)
2513 debugfs_remove_recursive(sdp->debugfs_dir);
2514 sdp->debugfs_dir = NULL;
2517 void gfs2_register_debugfs(void)
2519 gfs2_root = debugfs_create_dir("gfs2", NULL);
2522 void gfs2_unregister_debugfs(void)
2524 debugfs_remove(gfs2_root);
2525 gfs2_root = NULL;