ls_rsbtbl 450 fs/dlm/debug_fs.c tree = toss ? &ls->ls_rsbtbl[bucket].toss : &ls->ls_rsbtbl[bucket].keep; ls_rsbtbl 452 fs/dlm/debug_fs.c spin_lock(&ls->ls_rsbtbl[bucket].lock); ls_rsbtbl 460 fs/dlm/debug_fs.c spin_unlock(&ls->ls_rsbtbl[bucket].lock); ls_rsbtbl 465 fs/dlm/debug_fs.c spin_unlock(&ls->ls_rsbtbl[bucket].lock); ls_rsbtbl 482 fs/dlm/debug_fs.c tree = toss ? &ls->ls_rsbtbl[bucket].toss : &ls->ls_rsbtbl[bucket].keep; ls_rsbtbl 484 fs/dlm/debug_fs.c spin_lock(&ls->ls_rsbtbl[bucket].lock); ls_rsbtbl 491 fs/dlm/debug_fs.c spin_unlock(&ls->ls_rsbtbl[bucket].lock); ls_rsbtbl 495 fs/dlm/debug_fs.c spin_unlock(&ls->ls_rsbtbl[bucket].lock); ls_rsbtbl 516 fs/dlm/debug_fs.c spin_lock(&ls->ls_rsbtbl[bucket].lock); ls_rsbtbl 524 fs/dlm/debug_fs.c spin_unlock(&ls->ls_rsbtbl[bucket].lock); ls_rsbtbl 529 fs/dlm/debug_fs.c spin_unlock(&ls->ls_rsbtbl[bucket].lock); ls_rsbtbl 547 fs/dlm/debug_fs.c tree = toss ? &ls->ls_rsbtbl[bucket].toss : &ls->ls_rsbtbl[bucket].keep; ls_rsbtbl 549 fs/dlm/debug_fs.c spin_lock(&ls->ls_rsbtbl[bucket].lock); ls_rsbtbl 556 fs/dlm/debug_fs.c spin_unlock(&ls->ls_rsbtbl[bucket].lock); ls_rsbtbl 560 fs/dlm/debug_fs.c spin_unlock(&ls->ls_rsbtbl[bucket].lock); ls_rsbtbl 207 fs/dlm/dir.c spin_lock(&ls->ls_rsbtbl[bucket].lock); ls_rsbtbl 208 fs/dlm/dir.c rv = dlm_search_rsb_tree(&ls->ls_rsbtbl[bucket].keep, name, len, &r); ls_rsbtbl 210 fs/dlm/dir.c rv = dlm_search_rsb_tree(&ls->ls_rsbtbl[bucket].toss, ls_rsbtbl 212 fs/dlm/dir.c spin_unlock(&ls->ls_rsbtbl[bucket].lock); ls_rsbtbl 536 fs/dlm/dlm_internal.h struct dlm_rsbtable *ls_rsbtbl; ls_rsbtbl 352 fs/dlm/lock.c spin_lock(&ls->ls_rsbtbl[bucket].lock); ls_rsbtbl 354 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[bucket].lock); ls_rsbtbl 592 fs/dlm/lock.c spin_lock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 594 fs/dlm/lock.c error = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].keep, name, len, &r); ls_rsbtbl 608 fs/dlm/lock.c error = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].toss, name, len, &r); ls_rsbtbl 648 fs/dlm/lock.c rb_erase(&r->res_hashnode, &ls->ls_rsbtbl[b].toss); ls_rsbtbl 649 fs/dlm/lock.c error = rsb_insert(r, &ls->ls_rsbtbl[b].keep); ls_rsbtbl 663 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 710 fs/dlm/lock.c error = rsb_insert(r, &ls->ls_rsbtbl[b].keep); ls_rsbtbl 712 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 737 fs/dlm/lock.c spin_lock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 739 fs/dlm/lock.c error = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].keep, name, len, &r); ls_rsbtbl 752 fs/dlm/lock.c error = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].toss, name, len, &r); ls_rsbtbl 783 fs/dlm/lock.c rb_erase(&r->res_hashnode, &ls->ls_rsbtbl[b].toss); ls_rsbtbl 784 fs/dlm/lock.c error = rsb_insert(r, &ls->ls_rsbtbl[b].keep); ls_rsbtbl 795 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 808 fs/dlm/lock.c error = rsb_insert(r, &ls->ls_rsbtbl[b].keep); ls_rsbtbl 810 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 946 fs/dlm/lock.c spin_lock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 947 fs/dlm/lock.c error = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].keep, name, len, &r); ls_rsbtbl 953 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 958 fs/dlm/lock.c error = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].toss, name, len, &r); ls_rsbtbl 1041 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 1052 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 1066 fs/dlm/lock.c error = rsb_insert(r, &ls->ls_rsbtbl[b].toss); ls_rsbtbl 1070 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 1079 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 1090 fs/dlm/lock.c spin_lock(&ls->ls_rsbtbl[i].lock); ls_rsbtbl 1091 fs/dlm/lock.c for (n = rb_first(&ls->ls_rsbtbl[i].keep); n; n = rb_next(n)) { ls_rsbtbl 1096 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[i].lock); ls_rsbtbl 1109 fs/dlm/lock.c spin_lock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 1110 fs/dlm/lock.c error = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].keep, name, len, &r); ls_rsbtbl 1114 fs/dlm/lock.c error = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].toss, name, len, &r); ls_rsbtbl 1120 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 1130 fs/dlm/lock.c rb_erase(&r->res_hashnode, &ls->ls_rsbtbl[r->res_bucket].keep); ls_rsbtbl 1131 fs/dlm/lock.c rsb_insert(r, &ls->ls_rsbtbl[r->res_bucket].toss); ls_rsbtbl 1133 fs/dlm/lock.c ls->ls_rsbtbl[r->res_bucket].flags |= DLM_RTF_SHRINK; ls_rsbtbl 1660 fs/dlm/lock.c spin_lock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 1662 fs/dlm/lock.c if (!(ls->ls_rsbtbl[b].flags & DLM_RTF_SHRINK)) { ls_rsbtbl 1663 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 1667 fs/dlm/lock.c for (n = rb_first(&ls->ls_rsbtbl[b].toss); n; n = next) { ls_rsbtbl 1712 fs/dlm/lock.c rb_erase(&r->res_hashnode, &ls->ls_rsbtbl[b].toss); ls_rsbtbl 1717 fs/dlm/lock.c ls->ls_rsbtbl[b].flags |= DLM_RTF_SHRINK; ls_rsbtbl 1719 fs/dlm/lock.c ls->ls_rsbtbl[b].flags &= ~DLM_RTF_SHRINK; ls_rsbtbl 1720 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 1740 fs/dlm/lock.c spin_lock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 1741 fs/dlm/lock.c rv = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].toss, name, len, &r); ls_rsbtbl 1743 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 1749 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 1758 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 1767 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 1774 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 1779 fs/dlm/lock.c rb_erase(&r->res_hashnode, &ls->ls_rsbtbl[b].toss); ls_rsbtbl 1786 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 4033 fs/dlm/lock.c spin_lock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 4034 fs/dlm/lock.c rv = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].keep, name, len, &r); ls_rsbtbl 4036 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 4041 fs/dlm/lock.c rv = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].toss, name, len, &r); ls_rsbtbl 4043 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 4054 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 4425 fs/dlm/lock.c spin_lock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 4427 fs/dlm/lock.c rv = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].toss, name, len, &r); ls_rsbtbl 4430 fs/dlm/lock.c rv = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].keep, name, len, &r); ls_rsbtbl 4435 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 4443 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 4450 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 4458 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 4463 fs/dlm/lock.c rb_erase(&r->res_hashnode, &ls->ls_rsbtbl[b].toss); ls_rsbtbl 4464 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 4470 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[b].lock); ls_rsbtbl 5476 fs/dlm/lock.c spin_lock(&ls->ls_rsbtbl[bucket].lock); ls_rsbtbl 5477 fs/dlm/lock.c for (n = rb_first(&ls->ls_rsbtbl[bucket].keep); n; n = rb_next(n)) { ls_rsbtbl 5487 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[bucket].lock); ls_rsbtbl 5490 fs/dlm/lock.c spin_unlock(&ls->ls_rsbtbl[bucket].lock); ls_rsbtbl 519 fs/dlm/lockspace.c ls->ls_rsbtbl = vmalloc(array_size(size, sizeof(struct dlm_rsbtable))); ls_rsbtbl 520 fs/dlm/lockspace.c if (!ls->ls_rsbtbl) ls_rsbtbl 523 fs/dlm/lockspace.c ls->ls_rsbtbl[i].keep.rb_node = NULL; ls_rsbtbl 524 fs/dlm/lockspace.c ls->ls_rsbtbl[i].toss.rb_node = NULL; ls_rsbtbl 525 fs/dlm/lockspace.c spin_lock_init(&ls->ls_rsbtbl[i].lock); ls_rsbtbl 685 fs/dlm/lockspace.c vfree(ls->ls_rsbtbl); ls_rsbtbl 822 fs/dlm/lockspace.c while ((n = rb_first(&ls->ls_rsbtbl[i].keep))) { ls_rsbtbl 824 fs/dlm/lockspace.c rb_erase(n, &ls->ls_rsbtbl[i].keep); ls_rsbtbl 828 fs/dlm/lockspace.c while ((n = rb_first(&ls->ls_rsbtbl[i].toss))) { ls_rsbtbl 830 fs/dlm/lockspace.c rb_erase(n, &ls->ls_rsbtbl[i].toss); ls_rsbtbl 835 fs/dlm/lockspace.c vfree(ls->ls_rsbtbl); ls_rsbtbl 907 fs/dlm/recover.c spin_lock(&ls->ls_rsbtbl[i].lock); ls_rsbtbl 908 fs/dlm/recover.c for (n = rb_first(&ls->ls_rsbtbl[i].keep); n; n = rb_next(n)) { ls_rsbtbl 914 fs/dlm/recover.c if (!RB_EMPTY_ROOT(&ls->ls_rsbtbl[i].toss)) ls_rsbtbl 916 fs/dlm/recover.c spin_unlock(&ls->ls_rsbtbl[i].lock); ls_rsbtbl 943 fs/dlm/recover.c spin_lock(&ls->ls_rsbtbl[i].lock); ls_rsbtbl 944 fs/dlm/recover.c for (n = rb_first(&ls->ls_rsbtbl[i].toss); n; n = next) { ls_rsbtbl 947 fs/dlm/recover.c rb_erase(n, &ls->ls_rsbtbl[i].toss); ls_rsbtbl 951 fs/dlm/recover.c spin_unlock(&ls->ls_rsbtbl[i].lock);