Searched refs:ls_rsbtbl (Results 1 – 6 of 6) sorted by relevance
| /linux-4.19.296/fs/dlm/ |
| D | debug_fs.c | 452 tree = toss ? &ls->ls_rsbtbl[bucket].toss : &ls->ls_rsbtbl[bucket].keep; in table_seq_start()
454 spin_lock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
462 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
467 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
484 tree = toss ? &ls->ls_rsbtbl[bucket].toss : &ls->ls_rsbtbl[bucket].keep; in table_seq_start()
486 spin_lock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
493 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
497 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
518 spin_lock(&ls->ls_rsbtbl[bucket].lock); in table_seq_next()
526 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in table_seq_next()
[all …]
|
| D | lock.c | 354 spin_lock(&ls->ls_rsbtbl[bucket].lock); in put_rsb()
356 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in put_rsb()
594 spin_lock(&ls->ls_rsbtbl[b].lock); in find_rsb_dir()
596 error = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].keep, name, len, &r); in find_rsb_dir()
610 error = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].toss, name, len, &r); in find_rsb_dir()
650 rb_erase(&r->res_hashnode, &ls->ls_rsbtbl[b].toss); in find_rsb_dir()
651 error = rsb_insert(r, &ls->ls_rsbtbl[b].keep); in find_rsb_dir()
665 spin_unlock(&ls->ls_rsbtbl[b].lock); in find_rsb_dir()
712 error = rsb_insert(r, &ls->ls_rsbtbl[b].keep); in find_rsb_dir()
714 spin_unlock(&ls->ls_rsbtbl[b].lock); in find_rsb_dir()
[all …]
|
| D | lockspace.c | 520 ls->ls_rsbtbl = vmalloc(array_size(size, sizeof(struct dlm_rsbtable))); in new_lockspace()
521 if (!ls->ls_rsbtbl) in new_lockspace()
524 ls->ls_rsbtbl[i].keep.rb_node = NULL; in new_lockspace()
525 ls->ls_rsbtbl[i].toss.rb_node = NULL; in new_lockspace()
526 spin_lock_init(&ls->ls_rsbtbl[i].lock); in new_lockspace()
688 vfree(ls->ls_rsbtbl); in new_lockspace()
825 while ((n = rb_first(&ls->ls_rsbtbl[i].keep))) { in release_lockspace()
827 rb_erase(n, &ls->ls_rsbtbl[i].keep); in release_lockspace()
831 while ((n = rb_first(&ls->ls_rsbtbl[i].toss))) { in release_lockspace()
833 rb_erase(n, &ls->ls_rsbtbl[i].toss); in release_lockspace()
[all …]
|
| D | dir.c | 209 spin_lock(&ls->ls_rsbtbl[bucket].lock); in find_rsb_root()
210 rv = dlm_search_rsb_tree(&ls->ls_rsbtbl[bucket].keep, name, len, &r); in find_rsb_root()
212 rv = dlm_search_rsb_tree(&ls->ls_rsbtbl[bucket].toss, in find_rsb_root()
214 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in find_rsb_root()
|
| D | recover.c | 908 spin_lock(&ls->ls_rsbtbl[i].lock); in dlm_create_root_list()
909 for (n = rb_first(&ls->ls_rsbtbl[i].keep); n; n = rb_next(n)) { in dlm_create_root_list()
915 if (!RB_EMPTY_ROOT(&ls->ls_rsbtbl[i].toss)) in dlm_create_root_list()
917 spin_unlock(&ls->ls_rsbtbl[i].lock); in dlm_create_root_list()
944 spin_lock(&ls->ls_rsbtbl[i].lock); in dlm_clear_toss()
945 for (n = rb_first(&ls->ls_rsbtbl[i].toss); n; n = next) { in dlm_clear_toss()
948 rb_erase(n, &ls->ls_rsbtbl[i].toss); in dlm_clear_toss()
952 spin_unlock(&ls->ls_rsbtbl[i].lock); in dlm_clear_toss()
|
| D | dlm_internal.h | 537 struct dlm_rsbtable *ls_rsbtbl; member
|