Home
last modified time | relevance | path

Searched refs:ls_rsbtbl (Results 1 – 6 of 6) sorted by relevance

/fs/dlm/
Ddebug_fs.c421 spin_lock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
422 if (!RB_EMPTY_ROOT(&ls->ls_rsbtbl[bucket].keep)) { in table_seq_start()
423 for (node = rb_first(&ls->ls_rsbtbl[bucket].keep); node; in table_seq_start()
430 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
435 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
453 spin_lock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
454 if (!RB_EMPTY_ROOT(&ls->ls_rsbtbl[bucket].keep)) { in table_seq_start()
455 node = rb_first(&ls->ls_rsbtbl[bucket].keep); in table_seq_start()
460 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
464 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
[all …]
Dlockspace.c480 ls->ls_rsbtbl = vmalloc(sizeof(struct dlm_rsbtable) * size); in new_lockspace()
481 if (!ls->ls_rsbtbl) in new_lockspace()
484 ls->ls_rsbtbl[i].keep.rb_node = NULL; in new_lockspace()
485 ls->ls_rsbtbl[i].toss.rb_node = NULL; in new_lockspace()
486 spin_lock_init(&ls->ls_rsbtbl[i].lock); in new_lockspace()
635 vfree(ls->ls_rsbtbl); in new_lockspace()
781 while ((n = rb_first(&ls->ls_rsbtbl[i].keep))) { in release_lockspace()
783 rb_erase(n, &ls->ls_rsbtbl[i].keep); in release_lockspace()
787 while ((n = rb_first(&ls->ls_rsbtbl[i].toss))) { in release_lockspace()
789 rb_erase(n, &ls->ls_rsbtbl[i].toss); in release_lockspace()
[all …]
Drecover.c776 spin_lock(&ls->ls_rsbtbl[i].lock); in dlm_create_root_list()
777 for (n = rb_first(&ls->ls_rsbtbl[i].keep); n; n = rb_next(n)) { in dlm_create_root_list()
788 spin_unlock(&ls->ls_rsbtbl[i].lock); in dlm_create_root_list()
792 for (n = rb_first(&ls->ls_rsbtbl[i].toss); n; n = rb_next(n)) { in dlm_create_root_list()
797 spin_unlock(&ls->ls_rsbtbl[i].lock); in dlm_create_root_list()
828 spin_lock(&ls->ls_rsbtbl[i].lock); in dlm_clear_toss_list()
829 for (n = rb_first(&ls->ls_rsbtbl[i].toss); n; n = next) { in dlm_clear_toss_list()
833 rb_erase(n, &ls->ls_rsbtbl[i].toss); in dlm_clear_toss_list()
837 spin_unlock(&ls->ls_rsbtbl[i].lock); in dlm_clear_toss_list()
Ddir.c360 spin_lock(&ls->ls_rsbtbl[bucket].lock); in find_rsb_root()
361 rv = dlm_search_rsb_tree(&ls->ls_rsbtbl[bucket].keep, name, len, 0, &r); in find_rsb_root()
363 rv = dlm_search_rsb_tree(&ls->ls_rsbtbl[bucket].toss, in find_rsb_root()
365 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in find_rsb_root()
Dlock.c477 error = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].keep, name, len, flags, &r); in _search_rsb()
482 error = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].toss, name, len, flags, &r); in _search_rsb()
486 rb_erase(&r->res_hashnode, &ls->ls_rsbtbl[b].toss); in _search_rsb()
487 error = rsb_insert(r, &ls->ls_rsbtbl[b].keep); in _search_rsb()
548 spin_lock(&ls->ls_rsbtbl[bucket].lock); in find_rsb()
563 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in find_rsb()
581 error = rsb_insert(r, &ls->ls_rsbtbl[bucket].keep); in find_rsb()
583 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in find_rsb()
609 rb_erase(&r->res_hashnode, &ls->ls_rsbtbl[r->res_bucket].keep); in toss_rsb()
610 rsb_insert(r, &ls->ls_rsbtbl[r->res_bucket].toss); in toss_rsb()
[all …]
Ddlm_internal.h499 struct dlm_rsbtable *ls_rsbtbl; member