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 */ 6 7 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt 8 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> 36 #include <linux/pid_namespace.h> 37 #include <linux/fdtable.h> 38 #include <linux/file.h> 39 40 #include "gfs2.h" 41 #include "incore.h" 42 #include "glock.h" 43 #include "glops.h" 44 #include "inode.h" 45 #include "lops.h" 46 #include "meta_io.h" 47 #include "quota.h" 48 #include "super.h" 49 #include "util.h" 50 #include "bmap.h" 51 #define CREATE_TRACE_POINTS 52 #include "trace_gfs2.h" 53 54 struct gfs2_glock_iter { 55 struct gfs2_sbd *sdp; /* incore superblock */ 56 struct rhashtable_iter hti; /* rhashtable iterator */ 57 struct gfs2_glock *gl; /* current glock struct */ 58 loff_t last_pos; /* last position */ 59 }; 60 61 typedef void (*glock_examiner) (struct gfs2_glock * gl); 62 63 static void do_xmote(struct gfs2_glock *gl, struct gfs2_holder *gh, unsigned int target); 64 static void request_demote(struct gfs2_glock *gl, unsigned int state, 65 unsigned long delay, bool remote); 66 67 static struct dentry *gfs2_root; 68 static LIST_HEAD(lru_list); 69 static atomic_t lru_count = ATOMIC_INIT(0); 70 static DEFINE_SPINLOCK(lru_lock); 71 72 #define GFS2_GL_HASH_SHIFT 15 73 #define GFS2_GL_HASH_SIZE BIT(GFS2_GL_HASH_SHIFT) 74 75 static const struct rhashtable_params ht_parms = { 76 .nelem_hint = GFS2_GL_HASH_SIZE * 3 / 4, 77 .key_len = offsetofend(struct lm_lockname, ln_type), 78 .key_offset = offsetof(struct gfs2_glock, gl_name), 79 .head_offset = offsetof(struct gfs2_glock, gl_node), 80 }; 81 82 static struct rhashtable gl_hash_table; 83 84 #define GLOCK_WAIT_TABLE_BITS 12 85 #define GLOCK_WAIT_TABLE_SIZE (1 << GLOCK_WAIT_TABLE_BITS) 86 static wait_queue_head_t glock_wait_table[GLOCK_WAIT_TABLE_SIZE] __cacheline_aligned; 87 88 struct wait_glock_queue { 89 struct lm_lockname *name; 90 wait_queue_entry_t wait; 91 }; 92 93 static int glock_wake_function(wait_queue_entry_t *wait, unsigned int mode, 94 int sync, void *key) 95 { 96 struct wait_glock_queue *wait_glock = 97 container_of(wait, struct wait_glock_queue, wait); 98 struct lm_lockname *wait_name = wait_glock->name; 99 struct lm_lockname *wake_name = key; 100 101 if (wake_name->ln_sbd != wait_name->ln_sbd || 102 wake_name->ln_number != wait_name->ln_number || 103 wake_name->ln_type != wait_name->ln_type) 104 return 0; 105 return autoremove_wake_function(wait, mode, sync, key); 106 } 107 108 static wait_queue_head_t *glock_waitqueue(struct lm_lockname *name) 109 { 110 u32 hash = jhash2((u32 *)name, ht_parms.key_len / 4, 0); 111 112 return glock_wait_table + hash_32(hash, GLOCK_WAIT_TABLE_BITS); 113 } 114 115 /** 116 * wake_up_glock - Wake up waiters on a glock 117 * @gl: the glock 118 */ 119 static void wake_up_glock(struct gfs2_glock *gl) 120 { 121 wait_queue_head_t *wq = glock_waitqueue(&gl->gl_name); 122 123 if (waitqueue_active(wq)) 124 __wake_up(wq, TASK_NORMAL, 1, &gl->gl_name); 125 } 126 127 static void gfs2_glock_dealloc(struct rcu_head *rcu) 128 { 129 struct gfs2_glock *gl = container_of(rcu, struct gfs2_glock, gl_rcu); 130 131 kfree(gl->gl_lksb.sb_lvbptr); 132 if (gl->gl_ops->go_flags & GLOF_ASPACE) { 133 struct gfs2_glock_aspace *gla = 134 container_of(gl, struct gfs2_glock_aspace, glock); 135 kmem_cache_free(gfs2_glock_aspace_cachep, gla); 136 } else 137 kmem_cache_free(gfs2_glock_cachep, gl); 138 } 139 140 /** 141 * glock_blocked_by_withdraw - determine if we can still use a glock 142 * @gl: the glock 143 * 144 * We need to allow some glocks to be enqueued, dequeued, promoted, and demoted 145 * when we're withdrawn. For example, to maintain metadata integrity, we should 146 * disallow the use of inode and rgrp glocks when withdrawn. Other glocks like 147 * the iopen or freeze glock may be safely used because none of their 148 * metadata goes through the journal. So in general, we should disallow all 149 * glocks that are journaled, and allow all the others. One exception is: 150 * we need to allow our active journal to be promoted and demoted so others 151 * may recover it and we can reacquire it when they're done. 152 */ 153 static bool glock_blocked_by_withdraw(struct gfs2_glock *gl) 154 { 155 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd; 156 157 if (!gfs2_withdrawing_or_withdrawn(sdp)) 158 return false; 159 if (gl->gl_ops->go_flags & GLOF_NONDISK) 160 return false; 161 if (!sdp->sd_jdesc || 162 gl->gl_name.ln_number == sdp->sd_jdesc->jd_no_addr) 163 return false; 164 return true; 165 } 166 167 static void __gfs2_glock_free(struct gfs2_glock *gl) 168 { 169 rhashtable_remove_fast(&gl_hash_table, &gl->gl_node, ht_parms); 170 smp_mb(); 171 wake_up_glock(gl); 172 call_rcu(&gl->gl_rcu, gfs2_glock_dealloc); 173 } 174 175 void gfs2_glock_free(struct gfs2_glock *gl) { 176 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd; 177 178 __gfs2_glock_free(gl); 179 if (atomic_dec_and_test(&sdp->sd_glock_disposal)) 180 wake_up(&sdp->sd_kill_wait); 181 } 182 183 void gfs2_glock_free_later(struct gfs2_glock *gl) { 184 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd; 185 186 spin_lock(&lru_lock); 187 list_add(&gl->gl_lru, &sdp->sd_dead_glocks); 188 spin_unlock(&lru_lock); 189 if (atomic_dec_and_test(&sdp->sd_glock_disposal)) 190 wake_up(&sdp->sd_kill_wait); 191 } 192 193 static void gfs2_free_dead_glocks(struct gfs2_sbd *sdp) 194 { 195 struct list_head *list = &sdp->sd_dead_glocks; 196 197 while(!list_empty(list)) { 198 struct gfs2_glock *gl; 199 200 gl = list_first_entry(list, struct gfs2_glock, gl_lru); 201 list_del_init(&gl->gl_lru); 202 __gfs2_glock_free(gl); 203 } 204 } 205 206 /** 207 * gfs2_glock_hold() - increment reference count on glock 208 * @gl: The glock to hold 209 * 210 */ 211 212 struct gfs2_glock *gfs2_glock_hold(struct gfs2_glock *gl) 213 { 214 GLOCK_BUG_ON(gl, __lockref_is_dead(&gl->gl_lockref)); 215 lockref_get(&gl->gl_lockref); 216 return gl; 217 } 218 219 static void gfs2_glock_add_to_lru(struct gfs2_glock *gl) 220 { 221 spin_lock(&lru_lock); 222 list_move_tail(&gl->gl_lru, &lru_list); 223 224 if (!test_bit(GLF_LRU, &gl->gl_flags)) { 225 set_bit(GLF_LRU, &gl->gl_flags); 226 atomic_inc(&lru_count); 227 } 228 229 spin_unlock(&lru_lock); 230 } 231 232 static void gfs2_glock_remove_from_lru(struct gfs2_glock *gl) 233 { 234 spin_lock(&lru_lock); 235 if (test_bit(GLF_LRU, &gl->gl_flags)) { 236 list_del_init(&gl->gl_lru); 237 atomic_dec(&lru_count); 238 clear_bit(GLF_LRU, &gl->gl_flags); 239 } 240 spin_unlock(&lru_lock); 241 } 242 243 /* 244 * Enqueue the glock on the work queue. Passes one glock reference on to the 245 * work queue. 246 */ 247 static void gfs2_glock_queue_work(struct gfs2_glock *gl, unsigned long delay) { 248 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd; 249 250 if (!queue_delayed_work(sdp->sd_glock_wq, &gl->gl_work, delay)) { 251 /* 252 * We are holding the lockref spinlock, and the work was still 253 * queued above. The queued work (glock_work_func) takes that 254 * spinlock before dropping its glock reference(s), so it 255 * cannot have dropped them in the meantime. 256 */ 257 GLOCK_BUG_ON(gl, gl->gl_lockref.count < 2); 258 gl->gl_lockref.count--; 259 } 260 } 261 262 static void __gfs2_glock_put(struct gfs2_glock *gl) 263 { 264 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd; 265 struct address_space *mapping = gfs2_glock2aspace(gl); 266 267 lockref_mark_dead(&gl->gl_lockref); 268 spin_unlock(&gl->gl_lockref.lock); 269 gfs2_glock_remove_from_lru(gl); 270 GLOCK_BUG_ON(gl, !list_empty(&gl->gl_holders)); 271 if (mapping) { 272 truncate_inode_pages_final(mapping); 273 if (!gfs2_withdrawing_or_withdrawn(sdp)) 274 GLOCK_BUG_ON(gl, !mapping_empty(mapping)); 275 } 276 trace_gfs2_glock_put(gl); 277 sdp->sd_lockstruct.ls_ops->lm_put_lock(gl); 278 } 279 280 static bool __gfs2_glock_put_or_lock(struct gfs2_glock *gl) 281 { 282 if (lockref_put_or_lock(&gl->gl_lockref)) 283 return true; 284 GLOCK_BUG_ON(gl, gl->gl_lockref.count != 1); 285 if (gl->gl_state != LM_ST_UNLOCKED) { 286 gl->gl_lockref.count--; 287 gfs2_glock_add_to_lru(gl); 288 spin_unlock(&gl->gl_lockref.lock); 289 return true; 290 } 291 return false; 292 } 293 294 /** 295 * gfs2_glock_put() - Decrement reference count on glock 296 * @gl: The glock to put 297 * 298 */ 299 300 void gfs2_glock_put(struct gfs2_glock *gl) 301 { 302 if (__gfs2_glock_put_or_lock(gl)) 303 return; 304 305 __gfs2_glock_put(gl); 306 } 307 308 /* 309 * gfs2_glock_put_async - Decrement reference count without sleeping 310 * @gl: The glock to put 311 * 312 * Decrement the reference count on glock immediately unless it is the last 313 * reference. Defer putting the last reference to work queue context. 314 */ 315 void gfs2_glock_put_async(struct gfs2_glock *gl) 316 { 317 if (__gfs2_glock_put_or_lock(gl)) 318 return; 319 320 gfs2_glock_queue_work(gl, 0); 321 spin_unlock(&gl->gl_lockref.lock); 322 } 323 324 /** 325 * may_grant - check if it's ok to grant a new lock 326 * @gl: The glock 327 * @current_gh: One of the current holders of @gl 328 * @gh: The lock request which we wish to grant 329 * 330 * With our current compatibility rules, if a glock has one or more active 331 * holders (HIF_HOLDER flag set), any of those holders can be passed in as 332 * @current_gh; they are all the same as far as compatibility with the new @gh 333 * goes. 334 * 335 * Returns true if it's ok to grant the lock. 336 */ 337 338 static inline bool may_grant(struct gfs2_glock *gl, 339 struct gfs2_holder *current_gh, 340 struct gfs2_holder *gh) 341 { 342 if (current_gh) { 343 GLOCK_BUG_ON(gl, !test_bit(HIF_HOLDER, ¤t_gh->gh_iflags)); 344 345 switch(current_gh->gh_state) { 346 case LM_ST_EXCLUSIVE: 347 /* 348 * Here we make a special exception to grant holders 349 * who agree to share the EX lock with other holders 350 * who also have the bit set. If the original holder 351 * has the LM_FLAG_NODE_SCOPE bit set, we grant more 352 * holders with the bit set. 353 */ 354 return gh->gh_state == LM_ST_EXCLUSIVE && 355 (current_gh->gh_flags & LM_FLAG_NODE_SCOPE) && 356 (gh->gh_flags & LM_FLAG_NODE_SCOPE); 357 358 case LM_ST_SHARED: 359 case LM_ST_DEFERRED: 360 return gh->gh_state == current_gh->gh_state; 361 362 default: 363 return false; 364 } 365 } 366 367 if (gl->gl_state == gh->gh_state) 368 return true; 369 if (gh->gh_flags & GL_EXACT) 370 return false; 371 if (gl->gl_state == LM_ST_EXCLUSIVE) { 372 return gh->gh_state == LM_ST_SHARED || 373 gh->gh_state == LM_ST_DEFERRED; 374 } 375 if (gh->gh_flags & LM_FLAG_ANY) 376 return gl->gl_state != LM_ST_UNLOCKED; 377 return false; 378 } 379 380 static void gfs2_holder_wake(struct gfs2_holder *gh) 381 { 382 clear_bit(HIF_WAIT, &gh->gh_iflags); 383 smp_mb__after_atomic(); 384 wake_up_bit(&gh->gh_iflags, HIF_WAIT); 385 if (gh->gh_flags & GL_ASYNC) { 386 struct gfs2_sbd *sdp = gh->gh_gl->gl_name.ln_sbd; 387 388 wake_up(&sdp->sd_async_glock_wait); 389 } 390 } 391 392 /** 393 * do_error - Something unexpected has happened during a lock request 394 * @gl: The glock 395 * @ret: The status from the DLM 396 */ 397 398 static void do_error(struct gfs2_glock *gl, const int ret) 399 { 400 struct gfs2_holder *gh, *tmp; 401 402 list_for_each_entry_safe(gh, tmp, &gl->gl_holders, gh_list) { 403 if (test_bit(HIF_HOLDER, &gh->gh_iflags)) 404 continue; 405 if (ret & LM_OUT_ERROR) 406 gh->gh_error = -EIO; 407 else if (gh->gh_flags & (LM_FLAG_TRY | LM_FLAG_TRY_1CB)) 408 gh->gh_error = GLR_TRYFAILED; 409 else 410 continue; 411 list_del_init(&gh->gh_list); 412 trace_gfs2_glock_queue(gh, 0); 413 gfs2_holder_wake(gh); 414 } 415 } 416 417 /** 418 * find_first_holder - find the first "holder" gh 419 * @gl: the glock 420 */ 421 422 static inline struct gfs2_holder *find_first_holder(const struct gfs2_glock *gl) 423 { 424 struct gfs2_holder *gh; 425 426 if (!list_empty(&gl->gl_holders)) { 427 gh = list_first_entry(&gl->gl_holders, struct gfs2_holder, 428 gh_list); 429 if (test_bit(HIF_HOLDER, &gh->gh_iflags)) 430 return gh; 431 } 432 return NULL; 433 } 434 435 /* 436 * gfs2_instantiate - Call the glops instantiate function 437 * @gh: The glock holder 438 * 439 * Returns: 0 if instantiate was successful, or error. 440 */ 441 int gfs2_instantiate(struct gfs2_holder *gh) 442 { 443 struct gfs2_glock *gl = gh->gh_gl; 444 const struct gfs2_glock_operations *glops = gl->gl_ops; 445 int ret; 446 447 again: 448 if (!test_bit(GLF_INSTANTIATE_NEEDED, &gl->gl_flags)) 449 goto done; 450 451 /* 452 * Since we unlock the lockref lock, we set a flag to indicate 453 * instantiate is in progress. 454 */ 455 if (test_and_set_bit(GLF_INSTANTIATE_IN_PROG, &gl->gl_flags)) { 456 wait_on_bit(&gl->gl_flags, GLF_INSTANTIATE_IN_PROG, 457 TASK_UNINTERRUPTIBLE); 458 /* 459 * Here we just waited for a different instantiate to finish. 460 * But that may not have been successful, as when a process 461 * locks an inode glock _before_ it has an actual inode to 462 * instantiate into. So we check again. This process might 463 * have an inode to instantiate, so might be successful. 464 */ 465 goto again; 466 } 467 468 ret = glops->go_instantiate(gl); 469 if (!ret) 470 clear_bit(GLF_INSTANTIATE_NEEDED, &gl->gl_flags); 471 clear_and_wake_up_bit(GLF_INSTANTIATE_IN_PROG, &gl->gl_flags); 472 if (ret) 473 return ret; 474 475 done: 476 if (glops->go_held) 477 return glops->go_held(gh); 478 return 0; 479 } 480 481 /** 482 * do_promote - promote as many requests as possible on the current queue 483 * @gl: The glock 484 * 485 * Returns true on success (i.e., progress was made or there are no waiters). 486 */ 487 488 static bool do_promote(struct gfs2_glock *gl) 489 { 490 struct gfs2_holder *gh, *current_gh; 491 492 current_gh = find_first_holder(gl); 493 list_for_each_entry(gh, &gl->gl_holders, gh_list) { 494 if (test_bit(HIF_HOLDER, &gh->gh_iflags)) 495 continue; 496 if (!may_grant(gl, current_gh, gh)) { 497 /* 498 * If we get here, it means we may not grant this 499 * holder for some reason. If this holder is at the 500 * head of the list, it means we have a blocked holder 501 * at the head, so return false. 502 */ 503 if (list_is_first(&gh->gh_list, &gl->gl_holders)) 504 return false; 505 do_error(gl, 0); 506 break; 507 } 508 set_bit(HIF_HOLDER, &gh->gh_iflags); 509 trace_gfs2_promote(gh); 510 gfs2_holder_wake(gh); 511 if (!current_gh) 512 current_gh = gh; 513 } 514 return true; 515 } 516 517 /** 518 * find_first_waiter - find the first gh that's waiting for the glock 519 * @gl: the glock 520 */ 521 522 static inline struct gfs2_holder *find_first_waiter(const struct gfs2_glock *gl) 523 { 524 struct gfs2_holder *gh; 525 526 list_for_each_entry(gh, &gl->gl_holders, gh_list) { 527 if (!test_bit(HIF_HOLDER, &gh->gh_iflags)) 528 return gh; 529 } 530 return NULL; 531 } 532 533 /** 534 * find_last_waiter - find the last gh that's waiting for the glock 535 * @gl: the glock 536 * 537 * This also is a fast way of finding out if there are any waiters. 538 */ 539 540 static inline struct gfs2_holder *find_last_waiter(const struct gfs2_glock *gl) 541 { 542 struct gfs2_holder *gh; 543 544 if (list_empty(&gl->gl_holders)) 545 return NULL; 546 gh = list_last_entry(&gl->gl_holders, struct gfs2_holder, gh_list); 547 return test_bit(HIF_HOLDER, &gh->gh_iflags) ? NULL : gh; 548 } 549 550 /** 551 * state_change - record that the glock is now in a different state 552 * @gl: the glock 553 * @new_state: the new state 554 */ 555 556 static void state_change(struct gfs2_glock *gl, unsigned int new_state) 557 { 558 if (new_state != gl->gl_target) 559 /* shorten our minimum hold time */ 560 gl->gl_hold_time = max(gl->gl_hold_time - GL_GLOCK_HOLD_DECR, 561 GL_GLOCK_MIN_HOLD); 562 gl->gl_state = new_state; 563 gl->gl_tchange = jiffies; 564 } 565 566 static void gfs2_set_demote(struct gfs2_glock *gl) 567 { 568 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd; 569 570 set_bit(GLF_DEMOTE, &gl->gl_flags); 571 smp_mb(); 572 wake_up(&sdp->sd_async_glock_wait); 573 } 574 575 static void gfs2_demote_wake(struct gfs2_glock *gl) 576 { 577 gl->gl_demote_state = LM_ST_EXCLUSIVE; 578 clear_bit(GLF_DEMOTE, &gl->gl_flags); 579 smp_mb__after_atomic(); 580 wake_up_bit(&gl->gl_flags, GLF_DEMOTE); 581 } 582 583 /** 584 * finish_xmote - The DLM has replied to one of our lock requests 585 * @gl: The glock 586 * @ret: The status from the DLM 587 * 588 */ 589 590 static void finish_xmote(struct gfs2_glock *gl, unsigned int ret) 591 { 592 const struct gfs2_glock_operations *glops = gl->gl_ops; 593 struct gfs2_holder *gh; 594 unsigned state = ret & LM_OUT_ST_MASK; 595 596 trace_gfs2_glock_state_change(gl, state); 597 state_change(gl, state); 598 gh = find_first_waiter(gl); 599 600 /* Demote to UN request arrived during demote to SH or DF */ 601 if (test_bit(GLF_DEMOTE_IN_PROGRESS, &gl->gl_flags) && 602 state != LM_ST_UNLOCKED && gl->gl_demote_state == LM_ST_UNLOCKED) 603 gl->gl_target = LM_ST_UNLOCKED; 604 605 /* Check for state != intended state */ 606 if (unlikely(state != gl->gl_target)) { 607 if (gh && (ret & LM_OUT_CANCELED)) 608 gfs2_holder_wake(gh); 609 if (gh && !test_bit(GLF_DEMOTE_IN_PROGRESS, &gl->gl_flags)) { 610 /* move to back of queue and try next entry */ 611 if (ret & LM_OUT_CANCELED) { 612 list_move_tail(&gh->gh_list, &gl->gl_holders); 613 gh = find_first_waiter(gl); 614 gl->gl_target = gh->gh_state; 615 if (do_promote(gl)) 616 goto out; 617 goto retry; 618 } 619 /* Some error or failed "try lock" - report it */ 620 if ((ret & LM_OUT_ERROR) || 621 (gh->gh_flags & (LM_FLAG_TRY | LM_FLAG_TRY_1CB))) { 622 gl->gl_target = gl->gl_state; 623 do_error(gl, ret); 624 goto out; 625 } 626 } 627 switch(state) { 628 /* Unlocked due to conversion deadlock, try again */ 629 case LM_ST_UNLOCKED: 630 retry: 631 do_xmote(gl, gh, gl->gl_target); 632 break; 633 /* Conversion fails, unlock and try again */ 634 case LM_ST_SHARED: 635 case LM_ST_DEFERRED: 636 do_xmote(gl, gh, LM_ST_UNLOCKED); 637 break; 638 default: /* Everything else */ 639 fs_err(gl->gl_name.ln_sbd, "wanted %u got %u\n", 640 gl->gl_target, state); 641 GLOCK_BUG_ON(gl, 1); 642 } 643 return; 644 } 645 646 /* Fast path - we got what we asked for */ 647 if (test_and_clear_bit(GLF_DEMOTE_IN_PROGRESS, &gl->gl_flags)) 648 gfs2_demote_wake(gl); 649 if (state != LM_ST_UNLOCKED) { 650 if (glops->go_xmote_bh) { 651 int rv; 652 653 spin_unlock(&gl->gl_lockref.lock); 654 rv = glops->go_xmote_bh(gl); 655 spin_lock(&gl->gl_lockref.lock); 656 if (rv) { 657 do_error(gl, rv); 658 goto out; 659 } 660 } 661 do_promote(gl); 662 } 663 out: 664 clear_bit(GLF_LOCK, &gl->gl_flags); 665 } 666 667 static bool is_system_glock(struct gfs2_glock *gl) 668 { 669 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd; 670 struct gfs2_inode *m_ip = GFS2_I(sdp->sd_statfs_inode); 671 672 if (gl == m_ip->i_gl) 673 return true; 674 return false; 675 } 676 677 /** 678 * do_xmote - Calls the DLM to change the state of a lock 679 * @gl: The lock state 680 * @gh: The holder (only for promotes) 681 * @target: The target lock state 682 * 683 */ 684 685 static void do_xmote(struct gfs2_glock *gl, struct gfs2_holder *gh, 686 unsigned int target) 687 __releases(&gl->gl_lockref.lock) 688 __acquires(&gl->gl_lockref.lock) 689 { 690 const struct gfs2_glock_operations *glops = gl->gl_ops; 691 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd; 692 struct lm_lockstruct *ls = &sdp->sd_lockstruct; 693 unsigned int lck_flags = (unsigned int)(gh ? gh->gh_flags : 0); 694 int ret; 695 696 if (target != LM_ST_UNLOCKED && glock_blocked_by_withdraw(gl) && 697 gh && !(gh->gh_flags & LM_FLAG_NOEXP)) 698 goto skip_inval; 699 700 lck_flags &= (LM_FLAG_TRY | LM_FLAG_TRY_1CB | LM_FLAG_NOEXP); 701 GLOCK_BUG_ON(gl, gl->gl_state == target); 702 GLOCK_BUG_ON(gl, gl->gl_state == gl->gl_target); 703 if ((target == LM_ST_UNLOCKED || target == LM_ST_DEFERRED) && 704 glops->go_inval) { 705 /* 706 * If another process is already doing the invalidate, let that 707 * finish first. The glock state machine will get back to this 708 * holder again later. 709 */ 710 if (test_and_set_bit(GLF_INVALIDATE_IN_PROGRESS, 711 &gl->gl_flags)) 712 return; 713 do_error(gl, 0); /* Fail queued try locks */ 714 } 715 gl->gl_req = target; 716 set_bit(GLF_BLOCKING, &gl->gl_flags); 717 if ((gl->gl_req == LM_ST_UNLOCKED) || 718 (gl->gl_state == LM_ST_EXCLUSIVE) || 719 (lck_flags & (LM_FLAG_TRY|LM_FLAG_TRY_1CB))) 720 clear_bit(GLF_BLOCKING, &gl->gl_flags); 721 if (!glops->go_inval && !glops->go_sync) 722 goto skip_inval; 723 724 spin_unlock(&gl->gl_lockref.lock); 725 if (glops->go_sync) { 726 ret = glops->go_sync(gl); 727 /* If we had a problem syncing (due to io errors or whatever, 728 * we should not invalidate the metadata or tell dlm to 729 * release the glock to other nodes. 730 */ 731 if (ret) { 732 if (cmpxchg(&sdp->sd_log_error, 0, ret)) { 733 fs_err(sdp, "Error %d syncing glock \n", ret); 734 gfs2_dump_glock(NULL, gl, true); 735 } 736 spin_lock(&gl->gl_lockref.lock); 737 goto skip_inval; 738 } 739 } 740 if (test_bit(GLF_INVALIDATE_IN_PROGRESS, &gl->gl_flags)) { 741 /* 742 * The call to go_sync should have cleared out the ail list. 743 * If there are still items, we have a problem. We ought to 744 * withdraw, but we can't because the withdraw code also uses 745 * glocks. Warn about the error, dump the glock, then fall 746 * through and wait for logd to do the withdraw for us. 747 */ 748 if ((atomic_read(&gl->gl_ail_count) != 0) && 749 (!cmpxchg(&sdp->sd_log_error, 0, -EIO))) { 750 gfs2_glock_assert_warn(gl, 751 !atomic_read(&gl->gl_ail_count)); 752 gfs2_dump_glock(NULL, gl, true); 753 } 754 glops->go_inval(gl, target == LM_ST_DEFERRED ? 0 : DIO_METADATA); 755 clear_bit(GLF_INVALIDATE_IN_PROGRESS, &gl->gl_flags); 756 } 757 spin_lock(&gl->gl_lockref.lock); 758 759 skip_inval: 760 gl->gl_lockref.count++; 761 /* 762 * Check for an error encountered since we called go_sync and go_inval. 763 * If so, we can't withdraw from the glock code because the withdraw 764 * code itself uses glocks (see function signal_our_withdraw) to 765 * change the mount to read-only. Most importantly, we must not call 766 * dlm to unlock the glock until the journal is in a known good state 767 * (after journal replay) otherwise other nodes may use the object 768 * (rgrp or dinode) and then later, journal replay will corrupt the 769 * file system. The best we can do here is wait for the logd daemon 770 * to see sd_log_error and withdraw, and in the meantime, requeue the 771 * work for later. 772 * 773 * We make a special exception for some system glocks, such as the 774 * system statfs inode glock, which needs to be granted before the 775 * gfs2_quotad daemon can exit, and that exit needs to finish before 776 * we can unmount the withdrawn file system. 777 * 778 * However, if we're just unlocking the lock (say, for unmount, when 779 * gfs2_gl_hash_clear calls clear_glock) and recovery is complete 780 * then it's okay to tell dlm to unlock it. 781 */ 782 if (unlikely(sdp->sd_log_error) && !gfs2_withdrawing_or_withdrawn(sdp)) 783 gfs2_withdraw_delayed(sdp); 784 if (glock_blocked_by_withdraw(gl) && 785 (target != LM_ST_UNLOCKED || 786 test_bit(SDF_WITHDRAW_RECOVERY, &sdp->sd_flags))) { 787 if (!is_system_glock(gl)) { 788 request_demote(gl, LM_ST_UNLOCKED, 0, false); 789 /* 790 * Ordinarily, we would call dlm and its callback would call 791 * finish_xmote, which would call state_change() to the new state. 792 * Since we withdrew, we won't call dlm, so call state_change 793 * manually, but to the UNLOCKED state we desire. 794 */ 795 state_change(gl, LM_ST_UNLOCKED); 796 /* 797 * We skip telling dlm to do the locking, so we won't get a 798 * reply that would otherwise clear GLF_LOCK. So we clear it here. 799 */ 800 clear_bit(GLF_LOCK, &gl->gl_flags); 801 clear_bit(GLF_DEMOTE_IN_PROGRESS, &gl->gl_flags); 802 gfs2_glock_queue_work(gl, GL_GLOCK_DFT_HOLD); 803 return; 804 } else { 805 clear_bit(GLF_INVALIDATE_IN_PROGRESS, &gl->gl_flags); 806 } 807 } 808 809 if (ls->ls_ops->lm_lock) { 810 spin_unlock(&gl->gl_lockref.lock); 811 ret = ls->ls_ops->lm_lock(gl, target, lck_flags); 812 spin_lock(&gl->gl_lockref.lock); 813 814 if (ret == -EINVAL && gl->gl_target == LM_ST_UNLOCKED && 815 target == LM_ST_UNLOCKED && 816 test_bit(DFL_UNMOUNT, &ls->ls_recover_flags)) { 817 /* 818 * The lockspace has been released and the lock has 819 * been unlocked implicitly. 820 */ 821 } else if (ret) { 822 fs_err(sdp, "lm_lock ret %d\n", ret); 823 target = gl->gl_state | LM_OUT_ERROR; 824 } else { 825 /* The operation will be completed asynchronously. */ 826 return; 827 } 828 } 829 830 /* Complete the operation now. */ 831 finish_xmote(gl, target); 832 gfs2_glock_queue_work(gl, 0); 833 } 834 835 /** 836 * run_queue - do all outstanding tasks related to a glock 837 * @gl: The glock in question 838 * @nonblock: True if we must not block in run_queue 839 * 840 */ 841 842 static void run_queue(struct gfs2_glock *gl, const int nonblock) 843 __releases(&gl->gl_lockref.lock) 844 __acquires(&gl->gl_lockref.lock) 845 { 846 struct gfs2_holder *gh = NULL; 847 848 if (test_bit(GLF_LOCK, &gl->gl_flags)) 849 return; 850 set_bit(GLF_LOCK, &gl->gl_flags); 851 852 GLOCK_BUG_ON(gl, test_bit(GLF_DEMOTE_IN_PROGRESS, &gl->gl_flags)); 853 854 if (test_bit(GLF_DEMOTE, &gl->gl_flags) && 855 gl->gl_demote_state != gl->gl_state) { 856 if (find_first_holder(gl)) 857 goto out_unlock; 858 if (nonblock) 859 goto out_sched; 860 set_bit(GLF_DEMOTE_IN_PROGRESS, &gl->gl_flags); 861 GLOCK_BUG_ON(gl, gl->gl_demote_state == LM_ST_EXCLUSIVE); 862 gl->gl_target = gl->gl_demote_state; 863 } else { 864 if (test_bit(GLF_DEMOTE, &gl->gl_flags)) 865 gfs2_demote_wake(gl); 866 if (do_promote(gl)) 867 goto out_unlock; 868 gh = find_first_waiter(gl); 869 gl->gl_target = gh->gh_state; 870 if (!(gh->gh_flags & (LM_FLAG_TRY | LM_FLAG_TRY_1CB))) 871 do_error(gl, 0); /* Fail queued try locks */ 872 } 873 do_xmote(gl, gh, gl->gl_target); 874 return; 875 876 out_sched: 877 clear_bit(GLF_LOCK, &gl->gl_flags); 878 smp_mb__after_atomic(); 879 gl->gl_lockref.count++; 880 gfs2_glock_queue_work(gl, 0); 881 return; 882 883 out_unlock: 884 clear_bit(GLF_LOCK, &gl->gl_flags); 885 smp_mb__after_atomic(); 886 } 887 888 /** 889 * glock_set_object - set the gl_object field of a glock 890 * @gl: the glock 891 * @object: the object 892 */ 893 void glock_set_object(struct gfs2_glock *gl, void *object) 894 { 895 void *prev_object; 896 897 spin_lock(&gl->gl_lockref.lock); 898 prev_object = gl->gl_object; 899 gl->gl_object = object; 900 spin_unlock(&gl->gl_lockref.lock); 901 if (gfs2_assert_warn(gl->gl_name.ln_sbd, prev_object == NULL)) { 902 pr_warn("glock=%u/%llx\n", 903 gl->gl_name.ln_type, 904 (unsigned long long)gl->gl_name.ln_number); 905 gfs2_dump_glock(NULL, gl, true); 906 } 907 } 908 909 /** 910 * glock_clear_object - clear the gl_object field of a glock 911 * @gl: the glock 912 * @object: object the glock currently points at 913 */ 914 void glock_clear_object(struct gfs2_glock *gl, void *object) 915 { 916 void *prev_object; 917 918 spin_lock(&gl->gl_lockref.lock); 919 prev_object = gl->gl_object; 920 gl->gl_object = NULL; 921 spin_unlock(&gl->gl_lockref.lock); 922 if (gfs2_assert_warn(gl->gl_name.ln_sbd, prev_object == object)) { 923 pr_warn("glock=%u/%llx\n", 924 gl->gl_name.ln_type, 925 (unsigned long long)gl->gl_name.ln_number); 926 gfs2_dump_glock(NULL, gl, true); 927 } 928 } 929 930 void gfs2_inode_remember_delete(struct gfs2_glock *gl, u64 generation) 931 { 932 struct gfs2_inode_lvb *ri = (void *)gl->gl_lksb.sb_lvbptr; 933 934 if (ri->ri_magic == 0) 935 ri->ri_magic = cpu_to_be32(GFS2_MAGIC); 936 if (ri->ri_magic == cpu_to_be32(GFS2_MAGIC)) 937 ri->ri_generation_deleted = cpu_to_be64(generation); 938 } 939 940 bool gfs2_inode_already_deleted(struct gfs2_glock *gl, u64 generation) 941 { 942 struct gfs2_inode_lvb *ri = (void *)gl->gl_lksb.sb_lvbptr; 943 944 if (ri->ri_magic != cpu_to_be32(GFS2_MAGIC)) 945 return false; 946 return generation <= be64_to_cpu(ri->ri_generation_deleted); 947 } 948 949 static void gfs2_glock_poke(struct gfs2_glock *gl) 950 { 951 int flags = LM_FLAG_TRY_1CB | LM_FLAG_ANY | GL_SKIP; 952 struct gfs2_holder gh; 953 int error; 954 955 __gfs2_holder_init(gl, LM_ST_SHARED, flags, &gh, _RET_IP_); 956 error = gfs2_glock_nq(&gh); 957 if (!error) 958 gfs2_glock_dq(&gh); 959 gfs2_holder_uninit(&gh); 960 } 961 962 static bool gfs2_try_evict(struct gfs2_glock *gl) 963 { 964 struct gfs2_inode *ip; 965 bool evicted = false; 966 967 /* 968 * If there is contention on the iopen glock and we have an inode, try 969 * to grab and release the inode so that it can be evicted. This will 970 * allow the remote node to go ahead and delete the inode without us 971 * having to do it, which will avoid rgrp glock thrashing. 972 * 973 * The remote node is likely still holding the corresponding inode 974 * glock, so it will run before we get to verify that the delete has 975 * happened below. 976 */ 977 spin_lock(&gl->gl_lockref.lock); 978 ip = gl->gl_object; 979 if (ip && !igrab(&ip->i_inode)) 980 ip = NULL; 981 spin_unlock(&gl->gl_lockref.lock); 982 if (ip) { 983 gl->gl_no_formal_ino = ip->i_no_formal_ino; 984 set_bit(GIF_DEFERRED_DELETE, &ip->i_flags); 985 d_prune_aliases(&ip->i_inode); 986 iput(&ip->i_inode); 987 988 /* If the inode was evicted, gl->gl_object will now be NULL. */ 989 spin_lock(&gl->gl_lockref.lock); 990 ip = gl->gl_object; 991 if (ip) { 992 clear_bit(GIF_DEFERRED_DELETE, &ip->i_flags); 993 if (!igrab(&ip->i_inode)) 994 ip = NULL; 995 } 996 spin_unlock(&gl->gl_lockref.lock); 997 if (ip) { 998 gfs2_glock_poke(ip->i_gl); 999 iput(&ip->i_inode); 1000 } 1001 evicted = !ip; 1002 } 1003 return evicted; 1004 } 1005 1006 bool gfs2_queue_try_to_evict(struct gfs2_glock *gl) 1007 { 1008 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd; 1009 1010 if (test_and_set_bit(GLF_TRY_TO_EVICT, &gl->gl_flags)) 1011 return false; 1012 return queue_delayed_work(sdp->sd_delete_wq, 1013 &gl->gl_delete, 0); 1014 } 1015 1016 static bool gfs2_queue_verify_evict(struct gfs2_glock *gl) 1017 { 1018 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd; 1019 1020 if (test_and_set_bit(GLF_VERIFY_EVICT, &gl->gl_flags)) 1021 return false; 1022 return queue_delayed_work(sdp->sd_delete_wq, 1023 &gl->gl_delete, 5 * HZ); 1024 } 1025 1026 static void delete_work_func(struct work_struct *work) 1027 { 1028 struct delayed_work *dwork = to_delayed_work(work); 1029 struct gfs2_glock *gl = container_of(dwork, struct gfs2_glock, gl_delete); 1030 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd; 1031 struct inode *inode; 1032 u64 no_addr = gl->gl_name.ln_number; 1033 1034 if (test_and_clear_bit(GLF_TRY_TO_EVICT, &gl->gl_flags)) { 1035 /* 1036 * If we can evict the inode, give the remote node trying to 1037 * delete the inode some time before verifying that the delete 1038 * has happened. Otherwise, if we cause contention on the inode glock 1039 * immediately, the remote node will think that we still have 1040 * the inode in use, and so it will give up waiting. 1041 * 1042 * If we can't evict the inode, signal to the remote node that 1043 * the inode is still in use. We'll later try to delete the 1044 * inode locally in gfs2_evict_inode. 1045 * 1046 * FIXME: We only need to verify that the remote node has 1047 * deleted the inode because nodes before this remote delete 1048 * rework won't cooperate. At a later time, when we no longer 1049 * care about compatibility with such nodes, we can skip this 1050 * step entirely. 1051 */ 1052 if (gfs2_try_evict(gl)) { 1053 if (test_bit(SDF_KILL, &sdp->sd_flags)) 1054 goto out; 1055 if (gfs2_queue_verify_evict(gl)) 1056 return; 1057 } 1058 goto out; 1059 } 1060 1061 if (test_and_clear_bit(GLF_VERIFY_EVICT, &gl->gl_flags)) { 1062 inode = gfs2_lookup_by_inum(sdp, no_addr, gl->gl_no_formal_ino, 1063 GFS2_BLKST_UNLINKED); 1064 if (IS_ERR(inode)) { 1065 if (PTR_ERR(inode) == -EAGAIN && 1066 !test_bit(SDF_KILL, &sdp->sd_flags) && 1067 gfs2_queue_verify_evict(gl)) 1068 return; 1069 } else { 1070 d_prune_aliases(inode); 1071 iput(inode); 1072 } 1073 } 1074 1075 out: 1076 gfs2_glock_put(gl); 1077 } 1078 1079 static void glock_work_func(struct work_struct *work) 1080 { 1081 unsigned long delay = 0; 1082 struct gfs2_glock *gl = container_of(work, struct gfs2_glock, gl_work.work); 1083 unsigned int drop_refs = 1; 1084 1085 spin_lock(&gl->gl_lockref.lock); 1086 if (test_bit(GLF_HAVE_REPLY, &gl->gl_flags)) { 1087 clear_bit(GLF_HAVE_REPLY, &gl->gl_flags); 1088 finish_xmote(gl, gl->gl_reply); 1089 drop_refs++; 1090 } 1091 if (test_bit(GLF_PENDING_DEMOTE, &gl->gl_flags) && 1092 gl->gl_state != LM_ST_UNLOCKED && 1093 gl->gl_demote_state != LM_ST_EXCLUSIVE) { 1094 if (gl->gl_name.ln_type == LM_TYPE_INODE) { 1095 unsigned long holdtime, now = jiffies; 1096 1097 holdtime = gl->gl_tchange + gl->gl_hold_time; 1098 if (time_before(now, holdtime)) 1099 delay = holdtime - now; 1100 } 1101 1102 if (!delay) { 1103 clear_bit(GLF_PENDING_DEMOTE, &gl->gl_flags); 1104 gfs2_set_demote(gl); 1105 } 1106 } 1107 run_queue(gl, 0); 1108 if (delay) { 1109 /* Keep one glock reference for the work we requeue. */ 1110 drop_refs--; 1111 gfs2_glock_queue_work(gl, delay); 1112 } 1113 1114 /* Drop the remaining glock references manually. */ 1115 GLOCK_BUG_ON(gl, gl->gl_lockref.count < drop_refs); 1116 gl->gl_lockref.count -= drop_refs; 1117 if (!gl->gl_lockref.count) { 1118 if (gl->gl_state == LM_ST_UNLOCKED) { 1119 __gfs2_glock_put(gl); 1120 return; 1121 } 1122 gfs2_glock_add_to_lru(gl); 1123 } 1124 spin_unlock(&gl->gl_lockref.lock); 1125 } 1126 1127 static struct gfs2_glock *find_insert_glock(struct lm_lockname *name, 1128 struct gfs2_glock *new) 1129 { 1130 struct wait_glock_queue wait; 1131 wait_queue_head_t *wq = glock_waitqueue(name); 1132 struct gfs2_glock *gl; 1133 1134 wait.name = name; 1135 init_wait(&wait.wait); 1136 wait.wait.func = glock_wake_function; 1137 1138 again: 1139 prepare_to_wait(wq, &wait.wait, TASK_UNINTERRUPTIBLE); 1140 rcu_read_lock(); 1141 if (new) { 1142 gl = rhashtable_lookup_get_insert_fast(&gl_hash_table, 1143 &new->gl_node, ht_parms); 1144 if (IS_ERR(gl)) 1145 goto out; 1146 } else { 1147 gl = rhashtable_lookup_fast(&gl_hash_table, 1148 name, ht_parms); 1149 } 1150 if (gl && !lockref_get_not_dead(&gl->gl_lockref)) { 1151 rcu_read_unlock(); 1152 schedule(); 1153 goto again; 1154 } 1155 out: 1156 rcu_read_unlock(); 1157 finish_wait(wq, &wait.wait); 1158 if (gl) 1159 gfs2_glock_remove_from_lru(gl); 1160 return gl; 1161 } 1162 1163 /** 1164 * gfs2_glock_get() - Get a glock, or create one if one doesn't exist 1165 * @sdp: The GFS2 superblock 1166 * @number: the lock number 1167 * @glops: The glock_operations to use 1168 * @create: If 0, don't create the glock if it doesn't exist 1169 * @glp: the glock is returned here 1170 * 1171 * This does not lock a glock, just finds/creates structures for one. 1172 * 1173 * Returns: errno 1174 */ 1175 1176 int gfs2_glock_get(struct gfs2_sbd *sdp, u64 number, 1177 const struct gfs2_glock_operations *glops, int create, 1178 struct gfs2_glock **glp) 1179 { 1180 struct super_block *s = sdp->sd_vfs; 1181 struct lm_lockname name = { .ln_number = number, 1182 .ln_type = glops->go_type, 1183 .ln_sbd = sdp }; 1184 struct gfs2_glock *gl, *tmp; 1185 struct address_space *mapping; 1186 1187 gl = find_insert_glock(&name, NULL); 1188 if (gl) 1189 goto found; 1190 if (!create) 1191 return -ENOENT; 1192 1193 if (glops->go_flags & GLOF_ASPACE) { 1194 struct gfs2_glock_aspace *gla = 1195 kmem_cache_alloc(gfs2_glock_aspace_cachep, GFP_NOFS); 1196 if (!gla) 1197 return -ENOMEM; 1198 gl = &gla->glock; 1199 } else { 1200 gl = kmem_cache_alloc(gfs2_glock_cachep, GFP_NOFS); 1201 if (!gl) 1202 return -ENOMEM; 1203 } 1204 memset(&gl->gl_lksb, 0, sizeof(struct dlm_lksb)); 1205 gl->gl_ops = glops; 1206 1207 if (glops->go_flags & GLOF_LVB) { 1208 gl->gl_lksb.sb_lvbptr = kzalloc(GDLM_LVB_SIZE, GFP_NOFS); 1209 if (!gl->gl_lksb.sb_lvbptr) { 1210 gfs2_glock_dealloc(&gl->gl_rcu); 1211 return -ENOMEM; 1212 } 1213 } 1214 1215 atomic_inc(&sdp->sd_glock_disposal); 1216 gl->gl_node.next = NULL; 1217 gl->gl_flags = BIT(GLF_INITIAL); 1218 if (glops->go_instantiate) 1219 gl->gl_flags |= BIT(GLF_INSTANTIATE_NEEDED); 1220 gl->gl_name = name; 1221 lockdep_set_subclass(&gl->gl_lockref.lock, glops->go_subclass); 1222 gl->gl_lockref.count = 1; 1223 gl->gl_state = LM_ST_UNLOCKED; 1224 gl->gl_target = LM_ST_UNLOCKED; 1225 gl->gl_demote_state = LM_ST_EXCLUSIVE; 1226 gl->gl_dstamp = 0; 1227 preempt_disable(); 1228 /* We use the global stats to estimate the initial per-glock stats */ 1229 gl->gl_stats = this_cpu_ptr(sdp->sd_lkstats)->lkstats[glops->go_type]; 1230 preempt_enable(); 1231 gl->gl_stats.stats[GFS2_LKS_DCOUNT] = 0; 1232 gl->gl_stats.stats[GFS2_LKS_QCOUNT] = 0; 1233 gl->gl_tchange = jiffies; 1234 gl->gl_object = NULL; 1235 gl->gl_hold_time = GL_GLOCK_DFT_HOLD; 1236 INIT_DELAYED_WORK(&gl->gl_work, glock_work_func); 1237 if (gl->gl_name.ln_type == LM_TYPE_IOPEN) 1238 INIT_DELAYED_WORK(&gl->gl_delete, delete_work_func); 1239 1240 mapping = gfs2_glock2aspace(gl); 1241 if (mapping) { 1242 mapping->a_ops = &gfs2_meta_aops; 1243 mapping->host = s->s_bdev->bd_mapping->host; 1244 mapping->flags = 0; 1245 mapping_set_gfp_mask(mapping, GFP_NOFS); 1246 mapping->i_private_data = NULL; 1247 mapping->writeback_index = 0; 1248 } 1249 1250 tmp = find_insert_glock(&name, gl); 1251 if (tmp) { 1252 gfs2_glock_dealloc(&gl->gl_rcu); 1253 if (atomic_dec_and_test(&sdp->sd_glock_disposal)) 1254 wake_up(&sdp->sd_kill_wait); 1255 1256 if (IS_ERR(tmp)) 1257 return PTR_ERR(tmp); 1258 gl = tmp; 1259 } 1260 1261 found: 1262 *glp = gl; 1263 return 0; 1264 } 1265 1266 /** 1267 * __gfs2_holder_init - initialize a struct gfs2_holder in the default way 1268 * @gl: the glock 1269 * @state: the state we're requesting 1270 * @flags: the modifier flags 1271 * @gh: the holder structure 1272 * 1273 */ 1274 1275 void __gfs2_holder_init(struct gfs2_glock *gl, unsigned int state, u16 flags, 1276 struct gfs2_holder *gh, unsigned long ip) 1277 { 1278 INIT_LIST_HEAD(&gh->gh_list); 1279 gh->gh_gl = gfs2_glock_hold(gl); 1280 gh->gh_ip = ip; 1281 gh->gh_owner_pid = get_pid(task_pid(current)); 1282 gh->gh_state = state; 1283 gh->gh_flags = flags; 1284 gh->gh_iflags = 0; 1285 } 1286 1287 /** 1288 * gfs2_holder_reinit - reinitialize a struct gfs2_holder so we can requeue it 1289 * @state: the state we're requesting 1290 * @flags: the modifier flags 1291 * @gh: the holder structure 1292 * 1293 * Don't mess with the glock. 1294 * 1295 */ 1296 1297 void gfs2_holder_reinit(unsigned int state, u16 flags, struct gfs2_holder *gh) 1298 { 1299 gh->gh_state = state; 1300 gh->gh_flags = flags; 1301 gh->gh_iflags = 0; 1302 gh->gh_ip = _RET_IP_; 1303 put_pid(gh->gh_owner_pid); 1304 gh->gh_owner_pid = get_pid(task_pid(current)); 1305 } 1306 1307 /** 1308 * gfs2_holder_uninit - uninitialize a holder structure (drop glock reference) 1309 * @gh: the holder structure 1310 * 1311 */ 1312 1313 void gfs2_holder_uninit(struct gfs2_holder *gh) 1314 { 1315 put_pid(gh->gh_owner_pid); 1316 gfs2_glock_put(gh->gh_gl); 1317 gfs2_holder_mark_uninitialized(gh); 1318 gh->gh_ip = 0; 1319 } 1320 1321 static void gfs2_glock_update_hold_time(struct gfs2_glock *gl, 1322 unsigned long start_time) 1323 { 1324 /* Have we waited longer that a second? */ 1325 if (time_after(jiffies, start_time + HZ)) { 1326 /* Lengthen the minimum hold time. */ 1327 gl->gl_hold_time = min(gl->gl_hold_time + GL_GLOCK_HOLD_INCR, 1328 GL_GLOCK_MAX_HOLD); 1329 } 1330 } 1331 1332 /** 1333 * gfs2_glock_holder_ready - holder is ready and its error code can be collected 1334 * @gh: the glock holder 1335 * 1336 * Called when a glock holder no longer needs to be waited for because it is 1337 * now either held (HIF_HOLDER set; gh_error == 0), or acquiring the lock has 1338 * failed (gh_error != 0). 1339 */ 1340 1341 int gfs2_glock_holder_ready(struct gfs2_holder *gh) 1342 { 1343 if (gh->gh_error || (gh->gh_flags & GL_SKIP)) 1344 return gh->gh_error; 1345 gh->gh_error = gfs2_instantiate(gh); 1346 if (gh->gh_error) 1347 gfs2_glock_dq(gh); 1348 return gh->gh_error; 1349 } 1350 1351 /** 1352 * gfs2_glock_wait - wait on a glock acquisition 1353 * @gh: the glock holder 1354 * 1355 * Returns: 0 on success 1356 */ 1357 1358 int gfs2_glock_wait(struct gfs2_holder *gh) 1359 { 1360 unsigned long start_time = jiffies; 1361 1362 might_sleep(); 1363 wait_on_bit(&gh->gh_iflags, HIF_WAIT, TASK_UNINTERRUPTIBLE); 1364 gfs2_glock_update_hold_time(gh->gh_gl, start_time); 1365 return gfs2_glock_holder_ready(gh); 1366 } 1367 1368 static int glocks_pending(unsigned int num_gh, struct gfs2_holder *ghs) 1369 { 1370 int i; 1371 1372 for (i = 0; i < num_gh; i++) 1373 if (test_bit(HIF_WAIT, &ghs[i].gh_iflags)) 1374 return 1; 1375 return 0; 1376 } 1377 1378 /** 1379 * gfs2_glock_async_wait - wait on multiple asynchronous glock acquisitions 1380 * @num_gh: the number of holders in the array 1381 * @ghs: the glock holder array 1382 * 1383 * Returns: 0 on success, meaning all glocks have been granted and are held. 1384 * -ESTALE if the request timed out, meaning all glocks were released, 1385 * and the caller should retry the operation. 1386 */ 1387 1388 int gfs2_glock_async_wait(unsigned int num_gh, struct gfs2_holder *ghs) 1389 { 1390 struct gfs2_sbd *sdp = ghs[0].gh_gl->gl_name.ln_sbd; 1391 int i, ret = 0, timeout = 0; 1392 unsigned long start_time = jiffies; 1393 1394 might_sleep(); 1395 /* 1396 * Total up the (minimum hold time * 2) of all glocks and use that to 1397 * determine the max amount of time we should wait. 1398 */ 1399 for (i = 0; i < num_gh; i++) 1400 timeout += ghs[i].gh_gl->gl_hold_time << 1; 1401 1402 if (!wait_event_timeout(sdp->sd_async_glock_wait, 1403 !glocks_pending(num_gh, ghs), timeout)) { 1404 ret = -ESTALE; /* request timed out. */ 1405 goto out; 1406 } 1407 1408 for (i = 0; i < num_gh; i++) { 1409 struct gfs2_holder *gh = &ghs[i]; 1410 int ret2; 1411 1412 if (test_bit(HIF_HOLDER, &gh->gh_iflags)) { 1413 gfs2_glock_update_hold_time(gh->gh_gl, 1414 start_time); 1415 } 1416 ret2 = gfs2_glock_holder_ready(gh); 1417 if (!ret) 1418 ret = ret2; 1419 } 1420 1421 out: 1422 if (ret) { 1423 for (i = 0; i < num_gh; i++) { 1424 struct gfs2_holder *gh = &ghs[i]; 1425 1426 gfs2_glock_dq(gh); 1427 } 1428 } 1429 return ret; 1430 } 1431 1432 /** 1433 * request_demote - process a demote request 1434 * @gl: the glock 1435 * @state: the state the caller wants us to change to 1436 * @delay: zero to demote immediately; otherwise pending demote 1437 * @remote: true if this came from a different cluster node 1438 * 1439 * There are only two requests that we are going to see in actual 1440 * practise: LM_ST_SHARED and LM_ST_UNLOCKED 1441 */ 1442 1443 static void request_demote(struct gfs2_glock *gl, unsigned int state, 1444 unsigned long delay, bool remote) 1445 { 1446 if (delay) 1447 set_bit(GLF_PENDING_DEMOTE, &gl->gl_flags); 1448 else 1449 gfs2_set_demote(gl); 1450 if (gl->gl_demote_state == LM_ST_EXCLUSIVE) { 1451 gl->gl_demote_state = state; 1452 gl->gl_demote_time = jiffies; 1453 } else if (gl->gl_demote_state != LM_ST_UNLOCKED && 1454 gl->gl_demote_state != state) { 1455 gl->gl_demote_state = LM_ST_UNLOCKED; 1456 } 1457 if (gl->gl_ops->go_callback) 1458 gl->gl_ops->go_callback(gl, remote); 1459 trace_gfs2_demote_rq(gl, remote); 1460 } 1461 1462 void gfs2_print_dbg(struct seq_file *seq, const char *fmt, ...) 1463 { 1464 struct va_format vaf; 1465 va_list args; 1466 1467 va_start(args, fmt); 1468 1469 if (seq) { 1470 seq_vprintf(seq, fmt, args); 1471 } else { 1472 vaf.fmt = fmt; 1473 vaf.va = &args; 1474 1475 pr_err("%pV", &vaf); 1476 } 1477 1478 va_end(args); 1479 } 1480 1481 static inline bool pid_is_meaningful(const struct gfs2_holder *gh) 1482 { 1483 if (!(gh->gh_flags & GL_NOPID)) 1484 return true; 1485 if (gh->gh_state == LM_ST_UNLOCKED) 1486 return true; 1487 return false; 1488 } 1489 1490 /** 1491 * add_to_queue - Add a holder to the wait queue (but look for recursion) 1492 * @gh: the holder structure to add 1493 * 1494 * Eventually we should move the recursive locking trap to a 1495 * debugging option or something like that. This is the fast 1496 * path and needs to have the minimum number of distractions. 1497 * 1498 */ 1499 1500 static inline void add_to_queue(struct gfs2_holder *gh) 1501 __releases(&gl->gl_lockref.lock) 1502 __acquires(&gl->gl_lockref.lock) 1503 { 1504 struct gfs2_glock *gl = gh->gh_gl; 1505 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd; 1506 struct list_head *insert_pt = NULL; 1507 struct gfs2_holder *gh2; 1508 int try_futile = 0; 1509 1510 GLOCK_BUG_ON(gl, gh->gh_owner_pid == NULL); 1511 if (test_and_set_bit(HIF_WAIT, &gh->gh_iflags)) 1512 GLOCK_BUG_ON(gl, true); 1513 1514 if (gh->gh_flags & (LM_FLAG_TRY | LM_FLAG_TRY_1CB)) { 1515 if (test_bit(GLF_LOCK, &gl->gl_flags)) { 1516 struct gfs2_holder *current_gh; 1517 1518 current_gh = find_first_holder(gl); 1519 try_futile = !may_grant(gl, current_gh, gh); 1520 } 1521 if (test_bit(GLF_INVALIDATE_IN_PROGRESS, &gl->gl_flags)) 1522 goto fail; 1523 } 1524 1525 list_for_each_entry(gh2, &gl->gl_holders, gh_list) { 1526 if (likely(gh2->gh_owner_pid != gh->gh_owner_pid)) 1527 continue; 1528 if (gh->gh_gl->gl_ops->go_type == LM_TYPE_FLOCK) 1529 continue; 1530 if (!pid_is_meaningful(gh2)) 1531 continue; 1532 goto trap_recursive; 1533 } 1534 list_for_each_entry(gh2, &gl->gl_holders, gh_list) { 1535 if (try_futile && 1536 !(gh2->gh_flags & (LM_FLAG_TRY | LM_FLAG_TRY_1CB))) { 1537 fail: 1538 gh->gh_error = GLR_TRYFAILED; 1539 gfs2_holder_wake(gh); 1540 return; 1541 } 1542 if (test_bit(HIF_HOLDER, &gh2->gh_iflags)) 1543 continue; 1544 } 1545 trace_gfs2_glock_queue(gh, 1); 1546 gfs2_glstats_inc(gl, GFS2_LKS_QCOUNT); 1547 gfs2_sbstats_inc(gl, GFS2_LKS_QCOUNT); 1548 if (likely(insert_pt == NULL)) { 1549 list_add_tail(&gh->gh_list, &gl->gl_holders); 1550 return; 1551 } 1552 list_add_tail(&gh->gh_list, insert_pt); 1553 spin_unlock(&gl->gl_lockref.lock); 1554 if (sdp->sd_lockstruct.ls_ops->lm_cancel) 1555 sdp->sd_lockstruct.ls_ops->lm_cancel(gl); 1556 spin_lock(&gl->gl_lockref.lock); 1557 return; 1558 1559 trap_recursive: 1560 fs_err(sdp, "original: %pSR\n", (void *)gh2->gh_ip); 1561 fs_err(sdp, "pid: %d\n", pid_nr(gh2->gh_owner_pid)); 1562 fs_err(sdp, "lock type: %d req lock state : %d\n", 1563 gh2->gh_gl->gl_name.ln_type, gh2->gh_state); 1564 fs_err(sdp, "new: %pSR\n", (void *)gh->gh_ip); 1565 fs_err(sdp, "pid: %d\n", pid_nr(gh->gh_owner_pid)); 1566 fs_err(sdp, "lock type: %d req lock state : %d\n", 1567 gh->gh_gl->gl_name.ln_type, gh->gh_state); 1568 gfs2_dump_glock(NULL, gl, true); 1569 BUG(); 1570 } 1571 1572 /** 1573 * gfs2_glock_nq - enqueue a struct gfs2_holder onto a glock (acquire a glock) 1574 * @gh: the holder structure 1575 * 1576 * if (gh->gh_flags & GL_ASYNC), this never returns an error 1577 * 1578 * Returns: 0, GLR_TRYFAILED, or errno on failure 1579 */ 1580 1581 int gfs2_glock_nq(struct gfs2_holder *gh) 1582 { 1583 struct gfs2_glock *gl = gh->gh_gl; 1584 int error; 1585 1586 if (glock_blocked_by_withdraw(gl) && !(gh->gh_flags & LM_FLAG_NOEXP)) 1587 return -EIO; 1588 1589 if (gh->gh_flags & GL_NOBLOCK) { 1590 struct gfs2_holder *current_gh; 1591 1592 error = -ECHILD; 1593 spin_lock(&gl->gl_lockref.lock); 1594 if (find_last_waiter(gl)) 1595 goto unlock; 1596 current_gh = find_first_holder(gl); 1597 if (!may_grant(gl, current_gh, gh)) 1598 goto unlock; 1599 set_bit(HIF_HOLDER, &gh->gh_iflags); 1600 list_add_tail(&gh->gh_list, &gl->gl_holders); 1601 trace_gfs2_promote(gh); 1602 error = 0; 1603 unlock: 1604 spin_unlock(&gl->gl_lockref.lock); 1605 return error; 1606 } 1607 1608 gh->gh_error = 0; 1609 spin_lock(&gl->gl_lockref.lock); 1610 add_to_queue(gh); 1611 if (unlikely((LM_FLAG_NOEXP & gh->gh_flags) && 1612 test_and_clear_bit(GLF_HAVE_FROZEN_REPLY, &gl->gl_flags))) { 1613 set_bit(GLF_HAVE_REPLY, &gl->gl_flags); 1614 gl->gl_lockref.count++; 1615 gfs2_glock_queue_work(gl, 0); 1616 } 1617 run_queue(gl, 1); 1618 spin_unlock(&gl->gl_lockref.lock); 1619 1620 error = 0; 1621 if (!(gh->gh_flags & GL_ASYNC)) 1622 error = gfs2_glock_wait(gh); 1623 1624 return error; 1625 } 1626 1627 /** 1628 * gfs2_glock_poll - poll to see if an async request has been completed 1629 * @gh: the holder 1630 * 1631 * Returns: 1 if the request is ready to be gfs2_glock_wait()ed on 1632 */ 1633 1634 int gfs2_glock_poll(struct gfs2_holder *gh) 1635 { 1636 return test_bit(HIF_WAIT, &gh->gh_iflags) ? 0 : 1; 1637 } 1638 1639 static inline bool needs_demote(struct gfs2_glock *gl) 1640 { 1641 return (test_bit(GLF_DEMOTE, &gl->gl_flags) || 1642 test_bit(GLF_PENDING_DEMOTE, &gl->gl_flags)); 1643 } 1644 1645 static void __gfs2_glock_dq(struct gfs2_holder *gh) 1646 { 1647 struct gfs2_glock *gl = gh->gh_gl; 1648 unsigned delay = 0; 1649 int fast_path = 0; 1650 1651 /* 1652 * This holder should not be cached, so mark it for demote. 1653 * Note: this should be done before the check for needs_demote 1654 * below. 1655 */ 1656 if (gh->gh_flags & GL_NOCACHE) 1657 request_demote(gl, LM_ST_UNLOCKED, 0, false); 1658 1659 list_del_init(&gh->gh_list); 1660 clear_bit(HIF_HOLDER, &gh->gh_iflags); 1661 trace_gfs2_glock_queue(gh, 0); 1662 1663 /* 1664 * If there hasn't been a demote request we are done. 1665 * (Let the remaining holders, if any, keep holding it.) 1666 */ 1667 if (!needs_demote(gl)) { 1668 if (list_empty(&gl->gl_holders)) 1669 fast_path = 1; 1670 } 1671 1672 if (unlikely(!fast_path)) { 1673 gl->gl_lockref.count++; 1674 if (test_bit(GLF_PENDING_DEMOTE, &gl->gl_flags) && 1675 !test_bit(GLF_DEMOTE, &gl->gl_flags) && 1676 gl->gl_name.ln_type == LM_TYPE_INODE) 1677 delay = gl->gl_hold_time; 1678 gfs2_glock_queue_work(gl, delay); 1679 } 1680 } 1681 1682 /** 1683 * gfs2_glock_dq - dequeue a struct gfs2_holder from a glock (release a glock) 1684 * @gh: the glock holder 1685 * 1686 */ 1687 void gfs2_glock_dq(struct gfs2_holder *gh) 1688 { 1689 struct gfs2_glock *gl = gh->gh_gl; 1690 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd; 1691 1692 spin_lock(&gl->gl_lockref.lock); 1693 if (!gfs2_holder_queued(gh)) { 1694 /* 1695 * May have already been dequeued because the locking request 1696 * was GL_ASYNC and it has failed in the meantime. 1697 */ 1698 goto out; 1699 } 1700 1701 if (list_is_first(&gh->gh_list, &gl->gl_holders) && 1702 !test_bit(HIF_HOLDER, &gh->gh_iflags)) { 1703 spin_unlock(&gl->gl_lockref.lock); 1704 gl->gl_name.ln_sbd->sd_lockstruct.ls_ops->lm_cancel(gl); 1705 wait_on_bit(&gh->gh_iflags, HIF_WAIT, TASK_UNINTERRUPTIBLE); 1706 spin_lock(&gl->gl_lockref.lock); 1707 } 1708 1709 /* 1710 * If we're in the process of file system withdraw, we cannot just 1711 * dequeue any glocks until our journal is recovered, lest we introduce 1712 * file system corruption. We need two exceptions to this rule: We need 1713 * to allow unlocking of nondisk glocks and the glock for our own 1714 * journal that needs recovery. 1715 */ 1716 if (test_bit(SDF_WITHDRAW_RECOVERY, &sdp->sd_flags) && 1717 glock_blocked_by_withdraw(gl) && 1718 gh->gh_gl != sdp->sd_jinode_gl) { 1719 sdp->sd_glock_dqs_held++; 1720 spin_unlock(&gl->gl_lockref.lock); 1721 might_sleep(); 1722 wait_on_bit(&sdp->sd_flags, SDF_WITHDRAW_RECOVERY, 1723 TASK_UNINTERRUPTIBLE); 1724 spin_lock(&gl->gl_lockref.lock); 1725 } 1726 1727 __gfs2_glock_dq(gh); 1728 out: 1729 spin_unlock(&gl->gl_lockref.lock); 1730 } 1731 1732 void gfs2_glock_dq_wait(struct gfs2_holder *gh) 1733 { 1734 struct gfs2_glock *gl = gh->gh_gl; 1735 gfs2_glock_dq(gh); 1736 might_sleep(); 1737 wait_on_bit(&gl->gl_flags, GLF_DEMOTE, TASK_UNINTERRUPTIBLE); 1738 } 1739 1740 /** 1741 * gfs2_glock_dq_uninit - dequeue a holder from a glock and initialize it 1742 * @gh: the holder structure 1743 * 1744 */ 1745 1746 void gfs2_glock_dq_uninit(struct gfs2_holder *gh) 1747 { 1748 gfs2_glock_dq(gh); 1749 gfs2_holder_uninit(gh); 1750 } 1751 1752 /** 1753 * gfs2_glock_nq_num - acquire a glock based on lock number 1754 * @sdp: the filesystem 1755 * @number: the lock number 1756 * @glops: the glock operations for the type of glock 1757 * @state: the state to acquire the glock in 1758 * @flags: modifier flags for the acquisition 1759 * @gh: the struct gfs2_holder 1760 * 1761 * Returns: errno 1762 */ 1763 1764 int gfs2_glock_nq_num(struct gfs2_sbd *sdp, u64 number, 1765 const struct gfs2_glock_operations *glops, 1766 unsigned int state, u16 flags, struct gfs2_holder *gh) 1767 { 1768 struct gfs2_glock *gl; 1769 int error; 1770 1771 error = gfs2_glock_get(sdp, number, glops, CREATE, &gl); 1772 if (!error) { 1773 error = gfs2_glock_nq_init(gl, state, flags, gh); 1774 gfs2_glock_put(gl); 1775 } 1776 1777 return error; 1778 } 1779 1780 /** 1781 * glock_compare - Compare two struct gfs2_glock structures for sorting 1782 * @arg_a: the first structure 1783 * @arg_b: the second structure 1784 * 1785 */ 1786 1787 static int glock_compare(const void *arg_a, const void *arg_b) 1788 { 1789 const struct gfs2_holder *gh_a = *(const struct gfs2_holder **)arg_a; 1790 const struct gfs2_holder *gh_b = *(const struct gfs2_holder **)arg_b; 1791 const struct lm_lockname *a = &gh_a->gh_gl->gl_name; 1792 const struct lm_lockname *b = &gh_b->gh_gl->gl_name; 1793 1794 if (a->ln_number > b->ln_number) 1795 return 1; 1796 if (a->ln_number < b->ln_number) 1797 return -1; 1798 BUG_ON(gh_a->gh_gl->gl_ops->go_type == gh_b->gh_gl->gl_ops->go_type); 1799 return 0; 1800 } 1801 1802 /** 1803 * nq_m_sync - synchronously acquire more than one glock in deadlock free order 1804 * @num_gh: the number of structures 1805 * @ghs: an array of struct gfs2_holder structures 1806 * @p: placeholder for the holder structure to pass back 1807 * 1808 * Returns: 0 on success (all glocks acquired), 1809 * errno on failure (no glocks acquired) 1810 */ 1811 1812 static int nq_m_sync(unsigned int num_gh, struct gfs2_holder *ghs, 1813 struct gfs2_holder **p) 1814 { 1815 unsigned int x; 1816 int error = 0; 1817 1818 for (x = 0; x < num_gh; x++) 1819 p[x] = &ghs[x]; 1820 1821 sort(p, num_gh, sizeof(struct gfs2_holder *), glock_compare, NULL); 1822 1823 for (x = 0; x < num_gh; x++) { 1824 error = gfs2_glock_nq(p[x]); 1825 if (error) { 1826 while (x--) 1827 gfs2_glock_dq(p[x]); 1828 break; 1829 } 1830 } 1831 1832 return error; 1833 } 1834 1835 /** 1836 * gfs2_glock_nq_m - acquire multiple glocks 1837 * @num_gh: the number of structures 1838 * @ghs: an array of struct gfs2_holder structures 1839 * 1840 * Returns: 0 on success (all glocks acquired), 1841 * errno on failure (no glocks acquired) 1842 */ 1843 1844 int gfs2_glock_nq_m(unsigned int num_gh, struct gfs2_holder *ghs) 1845 { 1846 struct gfs2_holder *tmp[4]; 1847 struct gfs2_holder **pph = tmp; 1848 int error = 0; 1849 1850 switch(num_gh) { 1851 case 0: 1852 return 0; 1853 case 1: 1854 return gfs2_glock_nq(ghs); 1855 default: 1856 if (num_gh <= 4) 1857 break; 1858 pph = kmalloc_array(num_gh, sizeof(struct gfs2_holder *), 1859 GFP_NOFS); 1860 if (!pph) 1861 return -ENOMEM; 1862 } 1863 1864 error = nq_m_sync(num_gh, ghs, pph); 1865 1866 if (pph != tmp) 1867 kfree(pph); 1868 1869 return error; 1870 } 1871 1872 /** 1873 * gfs2_glock_dq_m - release multiple glocks 1874 * @num_gh: the number of structures 1875 * @ghs: an array of struct gfs2_holder structures 1876 * 1877 */ 1878 1879 void gfs2_glock_dq_m(unsigned int num_gh, struct gfs2_holder *ghs) 1880 { 1881 while (num_gh--) 1882 gfs2_glock_dq(&ghs[num_gh]); 1883 } 1884 1885 void gfs2_glock_cb(struct gfs2_glock *gl, unsigned int state) 1886 { 1887 unsigned long delay = 0; 1888 unsigned long holdtime; 1889 unsigned long now = jiffies; 1890 1891 gfs2_glock_hold(gl); 1892 spin_lock(&gl->gl_lockref.lock); 1893 holdtime = gl->gl_tchange + gl->gl_hold_time; 1894 if (!list_empty(&gl->gl_holders) && 1895 gl->gl_name.ln_type == LM_TYPE_INODE) { 1896 if (time_before(now, holdtime)) 1897 delay = holdtime - now; 1898 if (test_bit(GLF_HAVE_REPLY, &gl->gl_flags)) 1899 delay = gl->gl_hold_time; 1900 } 1901 request_demote(gl, state, delay, true); 1902 gfs2_glock_queue_work(gl, delay); 1903 spin_unlock(&gl->gl_lockref.lock); 1904 } 1905 1906 /** 1907 * gfs2_should_freeze - Figure out if glock should be frozen 1908 * @gl: The glock in question 1909 * 1910 * Glocks are not frozen if (a) the result of the dlm operation is 1911 * an error, (b) the locking operation was an unlock operation or 1912 * (c) if there is a "noexp" flagged request anywhere in the queue 1913 * 1914 * Returns: 1 if freezing should occur, 0 otherwise 1915 */ 1916 1917 static int gfs2_should_freeze(const struct gfs2_glock *gl) 1918 { 1919 const struct gfs2_holder *gh; 1920 1921 if (gl->gl_reply & ~LM_OUT_ST_MASK) 1922 return 0; 1923 if (gl->gl_target == LM_ST_UNLOCKED) 1924 return 0; 1925 1926 list_for_each_entry(gh, &gl->gl_holders, gh_list) { 1927 if (test_bit(HIF_HOLDER, &gh->gh_iflags)) 1928 continue; 1929 if (LM_FLAG_NOEXP & gh->gh_flags) 1930 return 0; 1931 } 1932 1933 return 1; 1934 } 1935 1936 /** 1937 * gfs2_glock_complete - Callback used by locking 1938 * @gl: Pointer to the glock 1939 * @ret: The return value from the dlm 1940 * 1941 * The gl_reply field is under the gl_lockref.lock lock so that it is ok 1942 * to use a bitfield shared with other glock state fields. 1943 */ 1944 1945 void gfs2_glock_complete(struct gfs2_glock *gl, int ret) 1946 { 1947 struct lm_lockstruct *ls = &gl->gl_name.ln_sbd->sd_lockstruct; 1948 1949 spin_lock(&gl->gl_lockref.lock); 1950 gl->gl_reply = ret; 1951 1952 if (unlikely(test_bit(DFL_BLOCK_LOCKS, &ls->ls_recover_flags))) { 1953 if (gfs2_should_freeze(gl)) { 1954 set_bit(GLF_HAVE_FROZEN_REPLY, &gl->gl_flags); 1955 spin_unlock(&gl->gl_lockref.lock); 1956 return; 1957 } 1958 } 1959 1960 gl->gl_lockref.count++; 1961 set_bit(GLF_HAVE_REPLY, &gl->gl_flags); 1962 gfs2_glock_queue_work(gl, 0); 1963 spin_unlock(&gl->gl_lockref.lock); 1964 } 1965 1966 static int glock_cmp(void *priv, const struct list_head *a, 1967 const struct list_head *b) 1968 { 1969 struct gfs2_glock *gla, *glb; 1970 1971 gla = list_entry(a, struct gfs2_glock, gl_lru); 1972 glb = list_entry(b, struct gfs2_glock, gl_lru); 1973 1974 if (gla->gl_name.ln_number > glb->gl_name.ln_number) 1975 return 1; 1976 if (gla->gl_name.ln_number < glb->gl_name.ln_number) 1977 return -1; 1978 1979 return 0; 1980 } 1981 1982 static bool can_free_glock(struct gfs2_glock *gl) 1983 { 1984 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd; 1985 1986 return !test_bit(GLF_LOCK, &gl->gl_flags) && 1987 !gl->gl_lockref.count && 1988 (!test_bit(GLF_LFLUSH, &gl->gl_flags) || 1989 test_bit(SDF_KILL, &sdp->sd_flags)); 1990 } 1991 1992 /** 1993 * gfs2_dispose_glock_lru - Demote a list of glocks 1994 * @list: The list to dispose of 1995 * 1996 * Disposing of glocks may involve disk accesses, so that here we sort 1997 * the glocks by number (i.e. disk location of the inodes) so that if 1998 * there are any such accesses, they'll be sent in order (mostly). 1999 * 2000 * Must be called under the lru_lock, but may drop and retake this 2001 * lock. While the lru_lock is dropped, entries may vanish from the 2002 * list, but no new entries will appear on the list (since it is 2003 * private) 2004 */ 2005 2006 static unsigned long gfs2_dispose_glock_lru(struct list_head *list) 2007 __releases(&lru_lock) 2008 __acquires(&lru_lock) 2009 { 2010 struct gfs2_glock *gl; 2011 unsigned long freed = 0; 2012 2013 list_sort(NULL, list, glock_cmp); 2014 2015 while(!list_empty(list)) { 2016 gl = list_first_entry(list, struct gfs2_glock, gl_lru); 2017 if (!spin_trylock(&gl->gl_lockref.lock)) { 2018 add_back_to_lru: 2019 list_move(&gl->gl_lru, &lru_list); 2020 continue; 2021 } 2022 if (!can_free_glock(gl)) { 2023 spin_unlock(&gl->gl_lockref.lock); 2024 goto add_back_to_lru; 2025 } 2026 list_del_init(&gl->gl_lru); 2027 atomic_dec(&lru_count); 2028 clear_bit(GLF_LRU, &gl->gl_flags); 2029 freed++; 2030 gl->gl_lockref.count++; 2031 if (gl->gl_state != LM_ST_UNLOCKED) 2032 request_demote(gl, LM_ST_UNLOCKED, 0, false); 2033 gfs2_glock_queue_work(gl, 0); 2034 spin_unlock(&gl->gl_lockref.lock); 2035 cond_resched_lock(&lru_lock); 2036 } 2037 return freed; 2038 } 2039 2040 /** 2041 * gfs2_scan_glock_lru - Scan the LRU looking for locks to demote 2042 * @nr: The number of entries to scan 2043 * 2044 * This function selects the entries on the LRU which are able to 2045 * be demoted, and then kicks off the process by calling 2046 * gfs2_dispose_glock_lru() above. 2047 */ 2048 2049 static unsigned long gfs2_scan_glock_lru(unsigned long nr) 2050 { 2051 struct gfs2_glock *gl, *next; 2052 LIST_HEAD(dispose); 2053 unsigned long freed = 0; 2054 2055 spin_lock(&lru_lock); 2056 list_for_each_entry_safe(gl, next, &lru_list, gl_lru) { 2057 if (!nr--) 2058 break; 2059 if (can_free_glock(gl)) 2060 list_move(&gl->gl_lru, &dispose); 2061 } 2062 if (!list_empty(&dispose)) 2063 freed = gfs2_dispose_glock_lru(&dispose); 2064 spin_unlock(&lru_lock); 2065 2066 return freed; 2067 } 2068 2069 static unsigned long gfs2_glock_shrink_scan(struct shrinker *shrink, 2070 struct shrink_control *sc) 2071 { 2072 if (!(sc->gfp_mask & __GFP_FS)) 2073 return SHRINK_STOP; 2074 return gfs2_scan_glock_lru(sc->nr_to_scan); 2075 } 2076 2077 static unsigned long gfs2_glock_shrink_count(struct shrinker *shrink, 2078 struct shrink_control *sc) 2079 { 2080 return vfs_pressure_ratio(atomic_read(&lru_count)); 2081 } 2082 2083 static struct shrinker *glock_shrinker; 2084 2085 /** 2086 * glock_hash_walk - Call a function for glock in a hash bucket 2087 * @examiner: the function 2088 * @sdp: the filesystem 2089 * 2090 * Note that the function can be called multiple times on the same 2091 * object. So the user must ensure that the function can cope with 2092 * that. 2093 */ 2094 2095 static void glock_hash_walk(glock_examiner examiner, const struct gfs2_sbd *sdp) 2096 { 2097 struct gfs2_glock *gl; 2098 struct rhashtable_iter iter; 2099 2100 rhashtable_walk_enter(&gl_hash_table, &iter); 2101 2102 do { 2103 rhashtable_walk_start(&iter); 2104 2105 while ((gl = rhashtable_walk_next(&iter)) && !IS_ERR(gl)) { 2106 if (gl->gl_name.ln_sbd == sdp) 2107 examiner(gl); 2108 } 2109 2110 rhashtable_walk_stop(&iter); 2111 } while (cond_resched(), gl == ERR_PTR(-EAGAIN)); 2112 2113 rhashtable_walk_exit(&iter); 2114 } 2115 2116 void gfs2_cancel_delete_work(struct gfs2_glock *gl) 2117 { 2118 clear_bit(GLF_TRY_TO_EVICT, &gl->gl_flags); 2119 clear_bit(GLF_VERIFY_EVICT, &gl->gl_flags); 2120 if (cancel_delayed_work(&gl->gl_delete)) 2121 gfs2_glock_put(gl); 2122 } 2123 2124 static void flush_delete_work(struct gfs2_glock *gl) 2125 { 2126 if (gl->gl_name.ln_type == LM_TYPE_IOPEN) { 2127 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd; 2128 2129 if (cancel_delayed_work(&gl->gl_delete)) { 2130 queue_delayed_work(sdp->sd_delete_wq, 2131 &gl->gl_delete, 0); 2132 } 2133 } 2134 } 2135 2136 void gfs2_flush_delete_work(struct gfs2_sbd *sdp) 2137 { 2138 glock_hash_walk(flush_delete_work, sdp); 2139 flush_workqueue(sdp->sd_delete_wq); 2140 } 2141 2142 /** 2143 * thaw_glock - thaw out a glock which has an unprocessed reply waiting 2144 * @gl: The glock to thaw 2145 * 2146 */ 2147 2148 static void thaw_glock(struct gfs2_glock *gl) 2149 { 2150 if (!test_and_clear_bit(GLF_HAVE_FROZEN_REPLY, &gl->gl_flags)) 2151 return; 2152 if (!lockref_get_not_dead(&gl->gl_lockref)) 2153 return; 2154 2155 gfs2_glock_remove_from_lru(gl); 2156 spin_lock(&gl->gl_lockref.lock); 2157 set_bit(GLF_HAVE_REPLY, &gl->gl_flags); 2158 gfs2_glock_queue_work(gl, 0); 2159 spin_unlock(&gl->gl_lockref.lock); 2160 } 2161 2162 /** 2163 * clear_glock - look at a glock and see if we can free it from glock cache 2164 * @gl: the glock to look at 2165 * 2166 */ 2167 2168 static void clear_glock(struct gfs2_glock *gl) 2169 { 2170 gfs2_glock_remove_from_lru(gl); 2171 2172 spin_lock(&gl->gl_lockref.lock); 2173 if (!__lockref_is_dead(&gl->gl_lockref)) { 2174 gl->gl_lockref.count++; 2175 if (gl->gl_state != LM_ST_UNLOCKED) 2176 request_demote(gl, LM_ST_UNLOCKED, 0, false); 2177 gfs2_glock_queue_work(gl, 0); 2178 } 2179 spin_unlock(&gl->gl_lockref.lock); 2180 } 2181 2182 /** 2183 * gfs2_glock_thaw - Thaw any frozen glocks 2184 * @sdp: The super block 2185 * 2186 */ 2187 2188 void gfs2_glock_thaw(struct gfs2_sbd *sdp) 2189 { 2190 glock_hash_walk(thaw_glock, sdp); 2191 } 2192 2193 static void dump_glock(struct seq_file *seq, struct gfs2_glock *gl, bool fsid) 2194 { 2195 spin_lock(&gl->gl_lockref.lock); 2196 gfs2_dump_glock(seq, gl, fsid); 2197 spin_unlock(&gl->gl_lockref.lock); 2198 } 2199 2200 static void dump_glock_func(struct gfs2_glock *gl) 2201 { 2202 dump_glock(NULL, gl, true); 2203 } 2204 2205 static void withdraw_dq(struct gfs2_glock *gl) 2206 { 2207 spin_lock(&gl->gl_lockref.lock); 2208 if (!__lockref_is_dead(&gl->gl_lockref) && 2209 glock_blocked_by_withdraw(gl)) 2210 do_error(gl, LM_OUT_ERROR); /* remove pending waiters */ 2211 spin_unlock(&gl->gl_lockref.lock); 2212 } 2213 2214 void gfs2_gl_dq_holders(struct gfs2_sbd *sdp) 2215 { 2216 glock_hash_walk(withdraw_dq, sdp); 2217 } 2218 2219 /** 2220 * gfs2_gl_hash_clear - Empty out the glock hash table 2221 * @sdp: the filesystem 2222 * 2223 * Called when unmounting the filesystem. 2224 */ 2225 2226 void gfs2_gl_hash_clear(struct gfs2_sbd *sdp) 2227 { 2228 unsigned long start = jiffies; 2229 bool timed_out = false; 2230 2231 set_bit(SDF_SKIP_DLM_UNLOCK, &sdp->sd_flags); 2232 flush_workqueue(sdp->sd_glock_wq); 2233 glock_hash_walk(clear_glock, sdp); 2234 flush_workqueue(sdp->sd_glock_wq); 2235 2236 while (!timed_out) { 2237 wait_event_timeout(sdp->sd_kill_wait, 2238 !atomic_read(&sdp->sd_glock_disposal), 2239 HZ * 60); 2240 if (!atomic_read(&sdp->sd_glock_disposal)) 2241 break; 2242 timed_out = time_after(jiffies, start + (HZ * 600)); 2243 fs_warn(sdp, "%u glocks left after %u seconds%s\n", 2244 atomic_read(&sdp->sd_glock_disposal), 2245 jiffies_to_msecs(jiffies - start) / 1000, 2246 timed_out ? ":" : "; still waiting"); 2247 } 2248 gfs2_lm_unmount(sdp); 2249 gfs2_free_dead_glocks(sdp); 2250 glock_hash_walk(dump_glock_func, sdp); 2251 destroy_workqueue(sdp->sd_glock_wq); 2252 sdp->sd_glock_wq = NULL; 2253 } 2254 2255 static const char *state2str(unsigned state) 2256 { 2257 switch(state) { 2258 case LM_ST_UNLOCKED: 2259 return "UN"; 2260 case LM_ST_SHARED: 2261 return "SH"; 2262 case LM_ST_DEFERRED: 2263 return "DF"; 2264 case LM_ST_EXCLUSIVE: 2265 return "EX"; 2266 } 2267 return "??"; 2268 } 2269 2270 static const char *hflags2str(char *buf, u16 flags, unsigned long iflags) 2271 { 2272 char *p = buf; 2273 if (flags & LM_FLAG_TRY) 2274 *p++ = 't'; 2275 if (flags & LM_FLAG_TRY_1CB) 2276 *p++ = 'T'; 2277 if (flags & LM_FLAG_NOEXP) 2278 *p++ = 'e'; 2279 if (flags & LM_FLAG_ANY) 2280 *p++ = 'A'; 2281 if (flags & LM_FLAG_NODE_SCOPE) 2282 *p++ = 'n'; 2283 if (flags & GL_ASYNC) 2284 *p++ = 'a'; 2285 if (flags & GL_EXACT) 2286 *p++ = 'E'; 2287 if (flags & GL_NOCACHE) 2288 *p++ = 'c'; 2289 if (test_bit(HIF_HOLDER, &iflags)) 2290 *p++ = 'H'; 2291 if (test_bit(HIF_WAIT, &iflags)) 2292 *p++ = 'W'; 2293 if (flags & GL_SKIP) 2294 *p++ = 's'; 2295 *p = 0; 2296 return buf; 2297 } 2298 2299 /** 2300 * dump_holder - print information about a glock holder 2301 * @seq: the seq_file struct 2302 * @gh: the glock holder 2303 * @fs_id_buf: pointer to file system id (if requested) 2304 * 2305 */ 2306 2307 static void dump_holder(struct seq_file *seq, const struct gfs2_holder *gh, 2308 const char *fs_id_buf) 2309 { 2310 const char *comm = "(none)"; 2311 pid_t owner_pid = 0; 2312 char flags_buf[32]; 2313 2314 rcu_read_lock(); 2315 if (pid_is_meaningful(gh)) { 2316 struct task_struct *gh_owner; 2317 2318 comm = "(ended)"; 2319 owner_pid = pid_nr(gh->gh_owner_pid); 2320 gh_owner = pid_task(gh->gh_owner_pid, PIDTYPE_PID); 2321 if (gh_owner) 2322 comm = gh_owner->comm; 2323 } 2324 gfs2_print_dbg(seq, "%s H: s:%s f:%s e:%d p:%ld [%s] %pS\n", 2325 fs_id_buf, state2str(gh->gh_state), 2326 hflags2str(flags_buf, gh->gh_flags, gh->gh_iflags), 2327 gh->gh_error, (long)owner_pid, comm, (void *)gh->gh_ip); 2328 rcu_read_unlock(); 2329 } 2330 2331 static const char *gflags2str(char *buf, const struct gfs2_glock *gl) 2332 { 2333 const unsigned long *gflags = &gl->gl_flags; 2334 char *p = buf; 2335 2336 if (test_bit(GLF_LOCK, gflags)) 2337 *p++ = 'l'; 2338 if (test_bit(GLF_DEMOTE, gflags)) 2339 *p++ = 'D'; 2340 if (test_bit(GLF_PENDING_DEMOTE, gflags)) 2341 *p++ = 'd'; 2342 if (test_bit(GLF_DEMOTE_IN_PROGRESS, gflags)) 2343 *p++ = 'p'; 2344 if (test_bit(GLF_DIRTY, gflags)) 2345 *p++ = 'y'; 2346 if (test_bit(GLF_LFLUSH, gflags)) 2347 *p++ = 'f'; 2348 if (test_bit(GLF_INVALIDATE_IN_PROGRESS, gflags)) 2349 *p++ = 'i'; 2350 if (test_bit(GLF_HAVE_REPLY, gflags)) 2351 *p++ = 'r'; 2352 if (test_bit(GLF_INITIAL, gflags)) 2353 *p++ = 'a'; 2354 if (test_bit(GLF_HAVE_FROZEN_REPLY, gflags)) 2355 *p++ = 'F'; 2356 if (!list_empty(&gl->gl_holders)) 2357 *p++ = 'q'; 2358 if (test_bit(GLF_LRU, gflags)) 2359 *p++ = 'L'; 2360 if (gl->gl_object) 2361 *p++ = 'o'; 2362 if (test_bit(GLF_BLOCKING, gflags)) 2363 *p++ = 'b'; 2364 if (test_bit(GLF_UNLOCKED, gflags)) 2365 *p++ = 'x'; 2366 if (test_bit(GLF_INSTANTIATE_NEEDED, gflags)) 2367 *p++ = 'n'; 2368 if (test_bit(GLF_INSTANTIATE_IN_PROG, gflags)) 2369 *p++ = 'N'; 2370 if (test_bit(GLF_TRY_TO_EVICT, gflags)) 2371 *p++ = 'e'; 2372 if (test_bit(GLF_VERIFY_EVICT, gflags)) 2373 *p++ = 'E'; 2374 *p = 0; 2375 return buf; 2376 } 2377 2378 /** 2379 * gfs2_dump_glock - print information about a glock 2380 * @seq: The seq_file struct 2381 * @gl: the glock 2382 * @fsid: If true, also dump the file system id 2383 * 2384 * The file format is as follows: 2385 * One line per object, capital letters are used to indicate objects 2386 * G = glock, I = Inode, R = rgrp, H = holder. Glocks are not indented, 2387 * other objects are indented by a single space and follow the glock to 2388 * which they are related. Fields are indicated by lower case letters 2389 * followed by a colon and the field value, except for strings which are in 2390 * [] so that its possible to see if they are composed of spaces for 2391 * example. The field's are n = number (id of the object), f = flags, 2392 * t = type, s = state, r = refcount, e = error, p = pid. 2393 * 2394 */ 2395 2396 void gfs2_dump_glock(struct seq_file *seq, struct gfs2_glock *gl, bool fsid) 2397 { 2398 const struct gfs2_glock_operations *glops = gl->gl_ops; 2399 unsigned long long dtime; 2400 const struct gfs2_holder *gh; 2401 char gflags_buf[32]; 2402 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd; 2403 char fs_id_buf[sizeof(sdp->sd_fsname) + 7]; 2404 unsigned long nrpages = 0; 2405 2406 if (gl->gl_ops->go_flags & GLOF_ASPACE) { 2407 struct address_space *mapping = gfs2_glock2aspace(gl); 2408 2409 nrpages = mapping->nrpages; 2410 } 2411 memset(fs_id_buf, 0, sizeof(fs_id_buf)); 2412 if (fsid && sdp) /* safety precaution */ 2413 sprintf(fs_id_buf, "fsid=%s: ", sdp->sd_fsname); 2414 dtime = jiffies - gl->gl_demote_time; 2415 dtime *= 1000000/HZ; /* demote time in uSec */ 2416 if (!test_bit(GLF_DEMOTE, &gl->gl_flags)) 2417 dtime = 0; 2418 gfs2_print_dbg(seq, "%sG: s:%s n:%u/%llx f:%s t:%s d:%s/%llu a:%d " 2419 "v:%d r:%d m:%ld p:%lu\n", 2420 fs_id_buf, state2str(gl->gl_state), 2421 gl->gl_name.ln_type, 2422 (unsigned long long)gl->gl_name.ln_number, 2423 gflags2str(gflags_buf, gl), 2424 state2str(gl->gl_target), 2425 state2str(gl->gl_demote_state), dtime, 2426 atomic_read(&gl->gl_ail_count), 2427 atomic_read(&gl->gl_revokes), 2428 (int)gl->gl_lockref.count, gl->gl_hold_time, nrpages); 2429 2430 list_for_each_entry(gh, &gl->gl_holders, gh_list) 2431 dump_holder(seq, gh, fs_id_buf); 2432 2433 if (gl->gl_state != LM_ST_UNLOCKED && glops->go_dump) 2434 glops->go_dump(seq, gl, fs_id_buf); 2435 } 2436 2437 static int gfs2_glstats_seq_show(struct seq_file *seq, void *iter_ptr) 2438 { 2439 struct gfs2_glock *gl = iter_ptr; 2440 2441 seq_printf(seq, "G: n:%u/%llx rtt:%llu/%llu rttb:%llu/%llu irt:%llu/%llu dcnt: %llu qcnt: %llu\n", 2442 gl->gl_name.ln_type, 2443 (unsigned long long)gl->gl_name.ln_number, 2444 (unsigned long long)gl->gl_stats.stats[GFS2_LKS_SRTT], 2445 (unsigned long long)gl->gl_stats.stats[GFS2_LKS_SRTTVAR], 2446 (unsigned long long)gl->gl_stats.stats[GFS2_LKS_SRTTB], 2447 (unsigned long long)gl->gl_stats.stats[GFS2_LKS_SRTTVARB], 2448 (unsigned long long)gl->gl_stats.stats[GFS2_LKS_SIRT], 2449 (unsigned long long)gl->gl_stats.stats[GFS2_LKS_SIRTVAR], 2450 (unsigned long long)gl->gl_stats.stats[GFS2_LKS_DCOUNT], 2451 (unsigned long long)gl->gl_stats.stats[GFS2_LKS_QCOUNT]); 2452 return 0; 2453 } 2454 2455 static const char *gfs2_gltype[] = { 2456 "type", 2457 "reserved", 2458 "nondisk", 2459 "inode", 2460 "rgrp", 2461 "meta", 2462 "iopen", 2463 "flock", 2464 "plock", 2465 "quota", 2466 "journal", 2467 }; 2468 2469 static const char *gfs2_stype[] = { 2470 [GFS2_LKS_SRTT] = "srtt", 2471 [GFS2_LKS_SRTTVAR] = "srttvar", 2472 [GFS2_LKS_SRTTB] = "srttb", 2473 [GFS2_LKS_SRTTVARB] = "srttvarb", 2474 [GFS2_LKS_SIRT] = "sirt", 2475 [GFS2_LKS_SIRTVAR] = "sirtvar", 2476 [GFS2_LKS_DCOUNT] = "dlm", 2477 [GFS2_LKS_QCOUNT] = "queue", 2478 }; 2479 2480 #define GFS2_NR_SBSTATS (ARRAY_SIZE(gfs2_gltype) * ARRAY_SIZE(gfs2_stype)) 2481 2482 static int gfs2_sbstats_seq_show(struct seq_file *seq, void *iter_ptr) 2483 { 2484 struct gfs2_sbd *sdp = seq->private; 2485 loff_t pos = *(loff_t *)iter_ptr; 2486 unsigned index = pos >> 3; 2487 unsigned subindex = pos & 0x07; 2488 int i; 2489 2490 if (index == 0 && subindex != 0) 2491 return 0; 2492 2493 seq_printf(seq, "%-10s %8s:", gfs2_gltype[index], 2494 (index == 0) ? "cpu": gfs2_stype[subindex]); 2495 2496 for_each_possible_cpu(i) { 2497 const struct gfs2_pcpu_lkstats *lkstats = per_cpu_ptr(sdp->sd_lkstats, i); 2498 2499 if (index == 0) 2500 seq_printf(seq, " %15u", i); 2501 else 2502 seq_printf(seq, " %15llu", (unsigned long long)lkstats-> 2503 lkstats[index - 1].stats[subindex]); 2504 } 2505 seq_putc(seq, '\n'); 2506 return 0; 2507 } 2508 2509 int __init gfs2_glock_init(void) 2510 { 2511 int i, ret; 2512 2513 ret = rhashtable_init(&gl_hash_table, &ht_parms); 2514 if (ret < 0) 2515 return ret; 2516 2517 glock_shrinker = shrinker_alloc(0, "gfs2-glock"); 2518 if (!glock_shrinker) { 2519 rhashtable_destroy(&gl_hash_table); 2520 return -ENOMEM; 2521 } 2522 2523 glock_shrinker->count_objects = gfs2_glock_shrink_count; 2524 glock_shrinker->scan_objects = gfs2_glock_shrink_scan; 2525 2526 shrinker_register(glock_shrinker); 2527 2528 for (i = 0; i < GLOCK_WAIT_TABLE_SIZE; i++) 2529 init_waitqueue_head(glock_wait_table + i); 2530 2531 return 0; 2532 } 2533 2534 void gfs2_glock_exit(void) 2535 { 2536 shrinker_free(glock_shrinker); 2537 rhashtable_destroy(&gl_hash_table); 2538 } 2539 2540 static void gfs2_glock_iter_next(struct gfs2_glock_iter *gi, loff_t n) 2541 { 2542 struct gfs2_glock *gl = gi->gl; 2543 2544 if (gl) { 2545 if (n == 0) 2546 return; 2547 gfs2_glock_put_async(gl); 2548 } 2549 for (;;) { 2550 gl = rhashtable_walk_next(&gi->hti); 2551 if (IS_ERR_OR_NULL(gl)) { 2552 if (gl == ERR_PTR(-EAGAIN)) { 2553 n = 1; 2554 continue; 2555 } 2556 gl = NULL; 2557 break; 2558 } 2559 if (gl->gl_name.ln_sbd != gi->sdp) 2560 continue; 2561 if (n <= 1) { 2562 if (!lockref_get_not_dead(&gl->gl_lockref)) 2563 continue; 2564 break; 2565 } else { 2566 if (__lockref_is_dead(&gl->gl_lockref)) 2567 continue; 2568 n--; 2569 } 2570 } 2571 gi->gl = gl; 2572 } 2573 2574 static void *gfs2_glock_seq_start(struct seq_file *seq, loff_t *pos) 2575 __acquires(RCU) 2576 { 2577 struct gfs2_glock_iter *gi = seq->private; 2578 loff_t n; 2579 2580 /* 2581 * We can either stay where we are, skip to the next hash table 2582 * entry, or start from the beginning. 2583 */ 2584 if (*pos < gi->last_pos) { 2585 rhashtable_walk_exit(&gi->hti); 2586 rhashtable_walk_enter(&gl_hash_table, &gi->hti); 2587 n = *pos + 1; 2588 } else { 2589 n = *pos - gi->last_pos; 2590 } 2591 2592 rhashtable_walk_start(&gi->hti); 2593 2594 gfs2_glock_iter_next(gi, n); 2595 gi->last_pos = *pos; 2596 return gi->gl; 2597 } 2598 2599 static void *gfs2_glock_seq_next(struct seq_file *seq, void *iter_ptr, 2600 loff_t *pos) 2601 { 2602 struct gfs2_glock_iter *gi = seq->private; 2603 2604 (*pos)++; 2605 gi->last_pos = *pos; 2606 gfs2_glock_iter_next(gi, 1); 2607 return gi->gl; 2608 } 2609 2610 static void gfs2_glock_seq_stop(struct seq_file *seq, void *iter_ptr) 2611 __releases(RCU) 2612 { 2613 struct gfs2_glock_iter *gi = seq->private; 2614 2615 rhashtable_walk_stop(&gi->hti); 2616 } 2617 2618 static int gfs2_glock_seq_show(struct seq_file *seq, void *iter_ptr) 2619 { 2620 dump_glock(seq, iter_ptr, false); 2621 return 0; 2622 } 2623 2624 static void *gfs2_sbstats_seq_start(struct seq_file *seq, loff_t *pos) 2625 { 2626 preempt_disable(); 2627 if (*pos >= GFS2_NR_SBSTATS) 2628 return NULL; 2629 return pos; 2630 } 2631 2632 static void *gfs2_sbstats_seq_next(struct seq_file *seq, void *iter_ptr, 2633 loff_t *pos) 2634 { 2635 (*pos)++; 2636 if (*pos >= GFS2_NR_SBSTATS) 2637 return NULL; 2638 return pos; 2639 } 2640 2641 static void gfs2_sbstats_seq_stop(struct seq_file *seq, void *iter_ptr) 2642 { 2643 preempt_enable(); 2644 } 2645 2646 static const struct seq_operations gfs2_glock_seq_ops = { 2647 .start = gfs2_glock_seq_start, 2648 .next = gfs2_glock_seq_next, 2649 .stop = gfs2_glock_seq_stop, 2650 .show = gfs2_glock_seq_show, 2651 }; 2652 2653 static const struct seq_operations gfs2_glstats_seq_ops = { 2654 .start = gfs2_glock_seq_start, 2655 .next = gfs2_glock_seq_next, 2656 .stop = gfs2_glock_seq_stop, 2657 .show = gfs2_glstats_seq_show, 2658 }; 2659 2660 static const struct seq_operations gfs2_sbstats_sops = { 2661 .start = gfs2_sbstats_seq_start, 2662 .next = gfs2_sbstats_seq_next, 2663 .stop = gfs2_sbstats_seq_stop, 2664 .show = gfs2_sbstats_seq_show, 2665 }; 2666 2667 #define GFS2_SEQ_GOODSIZE min(PAGE_SIZE << PAGE_ALLOC_COSTLY_ORDER, 65536UL) 2668 2669 static int __gfs2_glocks_open(struct inode *inode, struct file *file, 2670 const struct seq_operations *ops) 2671 { 2672 int ret = seq_open_private(file, ops, sizeof(struct gfs2_glock_iter)); 2673 if (ret == 0) { 2674 struct seq_file *seq = file->private_data; 2675 struct gfs2_glock_iter *gi = seq->private; 2676 2677 gi->sdp = inode->i_private; 2678 seq->buf = kmalloc(GFS2_SEQ_GOODSIZE, GFP_KERNEL | __GFP_NOWARN); 2679 if (seq->buf) 2680 seq->size = GFS2_SEQ_GOODSIZE; 2681 /* 2682 * Initially, we are "before" the first hash table entry; the 2683 * first call to rhashtable_walk_next gets us the first entry. 2684 */ 2685 gi->last_pos = -1; 2686 gi->gl = NULL; 2687 rhashtable_walk_enter(&gl_hash_table, &gi->hti); 2688 } 2689 return ret; 2690 } 2691 2692 static int gfs2_glocks_open(struct inode *inode, struct file *file) 2693 { 2694 return __gfs2_glocks_open(inode, file, &gfs2_glock_seq_ops); 2695 } 2696 2697 static int gfs2_glocks_release(struct inode *inode, struct file *file) 2698 { 2699 struct seq_file *seq = file->private_data; 2700 struct gfs2_glock_iter *gi = seq->private; 2701 2702 if (gi->gl) 2703 gfs2_glock_put(gi->gl); 2704 rhashtable_walk_exit(&gi->hti); 2705 return seq_release_private(inode, file); 2706 } 2707 2708 static int gfs2_glstats_open(struct inode *inode, struct file *file) 2709 { 2710 return __gfs2_glocks_open(inode, file, &gfs2_glstats_seq_ops); 2711 } 2712 2713 static const struct file_operations gfs2_glocks_fops = { 2714 .owner = THIS_MODULE, 2715 .open = gfs2_glocks_open, 2716 .read = seq_read, 2717 .llseek = seq_lseek, 2718 .release = gfs2_glocks_release, 2719 }; 2720 2721 static const struct file_operations gfs2_glstats_fops = { 2722 .owner = THIS_MODULE, 2723 .open = gfs2_glstats_open, 2724 .read = seq_read, 2725 .llseek = seq_lseek, 2726 .release = gfs2_glocks_release, 2727 }; 2728 2729 struct gfs2_glockfd_iter { 2730 struct super_block *sb; 2731 unsigned int tgid; 2732 struct task_struct *task; 2733 unsigned int fd; 2734 struct file *file; 2735 }; 2736 2737 static struct task_struct *gfs2_glockfd_next_task(struct gfs2_glockfd_iter *i) 2738 { 2739 struct pid_namespace *ns = task_active_pid_ns(current); 2740 struct pid *pid; 2741 2742 if (i->task) 2743 put_task_struct(i->task); 2744 2745 rcu_read_lock(); 2746 retry: 2747 i->task = NULL; 2748 pid = find_ge_pid(i->tgid, ns); 2749 if (pid) { 2750 i->tgid = pid_nr_ns(pid, ns); 2751 i->task = pid_task(pid, PIDTYPE_TGID); 2752 if (!i->task) { 2753 i->tgid++; 2754 goto retry; 2755 } 2756 get_task_struct(i->task); 2757 } 2758 rcu_read_unlock(); 2759 return i->task; 2760 } 2761 2762 static struct file *gfs2_glockfd_next_file(struct gfs2_glockfd_iter *i) 2763 { 2764 if (i->file) { 2765 fput(i->file); 2766 i->file = NULL; 2767 } 2768 2769 rcu_read_lock(); 2770 for(;; i->fd++) { 2771 struct inode *inode; 2772 2773 i->file = task_lookup_next_fdget_rcu(i->task, &i->fd); 2774 if (!i->file) { 2775 i->fd = 0; 2776 break; 2777 } 2778 2779 inode = file_inode(i->file); 2780 if (inode->i_sb == i->sb) 2781 break; 2782 2783 rcu_read_unlock(); 2784 fput(i->file); 2785 rcu_read_lock(); 2786 } 2787 rcu_read_unlock(); 2788 return i->file; 2789 } 2790 2791 static void *gfs2_glockfd_seq_start(struct seq_file *seq, loff_t *pos) 2792 { 2793 struct gfs2_glockfd_iter *i = seq->private; 2794 2795 if (*pos) 2796 return NULL; 2797 while (gfs2_glockfd_next_task(i)) { 2798 if (gfs2_glockfd_next_file(i)) 2799 return i; 2800 i->tgid++; 2801 } 2802 return NULL; 2803 } 2804 2805 static void *gfs2_glockfd_seq_next(struct seq_file *seq, void *iter_ptr, 2806 loff_t *pos) 2807 { 2808 struct gfs2_glockfd_iter *i = seq->private; 2809 2810 (*pos)++; 2811 i->fd++; 2812 do { 2813 if (gfs2_glockfd_next_file(i)) 2814 return i; 2815 i->tgid++; 2816 } while (gfs2_glockfd_next_task(i)); 2817 return NULL; 2818 } 2819 2820 static void gfs2_glockfd_seq_stop(struct seq_file *seq, void *iter_ptr) 2821 { 2822 struct gfs2_glockfd_iter *i = seq->private; 2823 2824 if (i->file) 2825 fput(i->file); 2826 if (i->task) 2827 put_task_struct(i->task); 2828 } 2829 2830 static void gfs2_glockfd_seq_show_flock(struct seq_file *seq, 2831 struct gfs2_glockfd_iter *i) 2832 { 2833 struct gfs2_file *fp = i->file->private_data; 2834 struct gfs2_holder *fl_gh = &fp->f_fl_gh; 2835 struct lm_lockname gl_name = { .ln_type = LM_TYPE_RESERVED }; 2836 2837 if (!READ_ONCE(fl_gh->gh_gl)) 2838 return; 2839 2840 spin_lock(&i->file->f_lock); 2841 if (gfs2_holder_initialized(fl_gh)) 2842 gl_name = fl_gh->gh_gl->gl_name; 2843 spin_unlock(&i->file->f_lock); 2844 2845 if (gl_name.ln_type != LM_TYPE_RESERVED) { 2846 seq_printf(seq, "%d %u %u/%llx\n", 2847 i->tgid, i->fd, gl_name.ln_type, 2848 (unsigned long long)gl_name.ln_number); 2849 } 2850 } 2851 2852 static int gfs2_glockfd_seq_show(struct seq_file *seq, void *iter_ptr) 2853 { 2854 struct gfs2_glockfd_iter *i = seq->private; 2855 struct inode *inode = file_inode(i->file); 2856 struct gfs2_glock *gl; 2857 2858 inode_lock_shared(inode); 2859 gl = GFS2_I(inode)->i_iopen_gh.gh_gl; 2860 if (gl) { 2861 seq_printf(seq, "%d %u %u/%llx\n", 2862 i->tgid, i->fd, gl->gl_name.ln_type, 2863 (unsigned long long)gl->gl_name.ln_number); 2864 } 2865 gfs2_glockfd_seq_show_flock(seq, i); 2866 inode_unlock_shared(inode); 2867 return 0; 2868 } 2869 2870 static const struct seq_operations gfs2_glockfd_seq_ops = { 2871 .start = gfs2_glockfd_seq_start, 2872 .next = gfs2_glockfd_seq_next, 2873 .stop = gfs2_glockfd_seq_stop, 2874 .show = gfs2_glockfd_seq_show, 2875 }; 2876 2877 static int gfs2_glockfd_open(struct inode *inode, struct file *file) 2878 { 2879 struct gfs2_glockfd_iter *i; 2880 struct gfs2_sbd *sdp = inode->i_private; 2881 2882 i = __seq_open_private(file, &gfs2_glockfd_seq_ops, 2883 sizeof(struct gfs2_glockfd_iter)); 2884 if (!i) 2885 return -ENOMEM; 2886 i->sb = sdp->sd_vfs; 2887 return 0; 2888 } 2889 2890 static const struct file_operations gfs2_glockfd_fops = { 2891 .owner = THIS_MODULE, 2892 .open = gfs2_glockfd_open, 2893 .read = seq_read, 2894 .llseek = seq_lseek, 2895 .release = seq_release_private, 2896 }; 2897 2898 DEFINE_SEQ_ATTRIBUTE(gfs2_sbstats); 2899 2900 void gfs2_create_debugfs_file(struct gfs2_sbd *sdp) 2901 { 2902 sdp->debugfs_dir = debugfs_create_dir(sdp->sd_table_name, gfs2_root); 2903 2904 debugfs_create_file("glocks", S_IFREG | S_IRUGO, sdp->debugfs_dir, sdp, 2905 &gfs2_glocks_fops); 2906 2907 debugfs_create_file("glockfd", S_IFREG | S_IRUGO, sdp->debugfs_dir, sdp, 2908 &gfs2_glockfd_fops); 2909 2910 debugfs_create_file("glstats", S_IFREG | S_IRUGO, sdp->debugfs_dir, sdp, 2911 &gfs2_glstats_fops); 2912 2913 debugfs_create_file("sbstats", S_IFREG | S_IRUGO, sdp->debugfs_dir, sdp, 2914 &gfs2_sbstats_fops); 2915 } 2916 2917 void gfs2_delete_debugfs_file(struct gfs2_sbd *sdp) 2918 { 2919 debugfs_remove_recursive(sdp->debugfs_dir); 2920 sdp->debugfs_dir = NULL; 2921 } 2922 2923 void gfs2_register_debugfs(void) 2924 { 2925 gfs2_root = debugfs_create_dir("gfs2", NULL); 2926 } 2927 2928 void gfs2_unregister_debugfs(void) 2929 { 2930 debugfs_remove(gfs2_root); 2931 gfs2_root = NULL; 2932 } 2933
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.