Home
last modified time | relevance | path

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

/fs/dlm/
Ddebug_fs.c450 tree = toss ? &ls->ls_rsbtbl[bucket].toss : &ls->ls_rsbtbl[bucket].keep; in table_seq_start()
452 spin_lock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
460 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
465 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
482 tree = toss ? &ls->ls_rsbtbl[bucket].toss : &ls->ls_rsbtbl[bucket].keep; in table_seq_start()
484 spin_lock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
491 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
495 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
516 spin_lock(&ls->ls_rsbtbl[bucket].lock); in table_seq_next()
524 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in table_seq_next()
[all …]
Dlock.c352 spin_lock(&ls->ls_rsbtbl[bucket].lock); in put_rsb()
354 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in put_rsb()
592 spin_lock(&ls->ls_rsbtbl[b].lock); in find_rsb_dir()
594 error = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].keep, name, len, &r); in find_rsb_dir()
608 error = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].toss, name, len, &r); in find_rsb_dir()
648 rb_erase(&r->res_hashnode, &ls->ls_rsbtbl[b].toss); in find_rsb_dir()
649 error = rsb_insert(r, &ls->ls_rsbtbl[b].keep); in find_rsb_dir()
663 spin_unlock(&ls->ls_rsbtbl[b].lock); in find_rsb_dir()
710 error = rsb_insert(r, &ls->ls_rsbtbl[b].keep); in find_rsb_dir()
712 spin_unlock(&ls->ls_rsbtbl[b].lock); in find_rsb_dir()
[all …]
Dlockspace.c519 ls->ls_rsbtbl = vmalloc(array_size(size, sizeof(struct dlm_rsbtable))); in new_lockspace()
520 if (!ls->ls_rsbtbl) in new_lockspace()
523 ls->ls_rsbtbl[i].keep.rb_node = NULL; in new_lockspace()
524 ls->ls_rsbtbl[i].toss.rb_node = NULL; in new_lockspace()
525 spin_lock_init(&ls->ls_rsbtbl[i].lock); in new_lockspace()
685 vfree(ls->ls_rsbtbl); in new_lockspace()
822 while ((n = rb_first(&ls->ls_rsbtbl[i].keep))) { in release_lockspace()
824 rb_erase(n, &ls->ls_rsbtbl[i].keep); in release_lockspace()
828 while ((n = rb_first(&ls->ls_rsbtbl[i].toss))) { in release_lockspace()
830 rb_erase(n, &ls->ls_rsbtbl[i].toss); in release_lockspace()
[all …]
Ddir.c207 spin_lock(&ls->ls_rsbtbl[bucket].lock); in find_rsb_root()
208 rv = dlm_search_rsb_tree(&ls->ls_rsbtbl[bucket].keep, name, len, &r); in find_rsb_root()
210 rv = dlm_search_rsb_tree(&ls->ls_rsbtbl[bucket].toss, in find_rsb_root()
212 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in find_rsb_root()
Drecover.c907 spin_lock(&ls->ls_rsbtbl[i].lock); in dlm_create_root_list()
908 for (n = rb_first(&ls->ls_rsbtbl[i].keep); n; n = rb_next(n)) { in dlm_create_root_list()
914 if (!RB_EMPTY_ROOT(&ls->ls_rsbtbl[i].toss)) in dlm_create_root_list()
916 spin_unlock(&ls->ls_rsbtbl[i].lock); in dlm_create_root_list()
943 spin_lock(&ls->ls_rsbtbl[i].lock); in dlm_clear_toss()
944 for (n = rb_first(&ls->ls_rsbtbl[i].toss); n; n = next) { in dlm_clear_toss()
947 rb_erase(n, &ls->ls_rsbtbl[i].toss); in dlm_clear_toss()
951 spin_unlock(&ls->ls_rsbtbl[i].lock); in dlm_clear_toss()
Ddlm_internal.h536 struct dlm_rsbtable *ls_rsbtbl; member