Home
last modified time | relevance | path

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

/linux-4.1.27/fs/dlm/
Ddebug_fs.c453 tree = toss ? &ls->ls_rsbtbl[bucket].toss : &ls->ls_rsbtbl[bucket].keep; in table_seq_start()
455 spin_lock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
463 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
468 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
485 tree = toss ? &ls->ls_rsbtbl[bucket].toss : &ls->ls_rsbtbl[bucket].keep; in table_seq_start()
487 spin_lock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
494 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
498 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
519 spin_lock(&ls->ls_rsbtbl[bucket].lock); in table_seq_next()
527 spin_unlock(&ls->ls_rsbtbl[bucket].lock); in table_seq_next()
[all …]
Dlock.c354 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 …]
Dlockspace.c513 ls->ls_rsbtbl = vmalloc(sizeof(struct dlm_rsbtable) * size); in new_lockspace()
514 if (!ls->ls_rsbtbl) in new_lockspace()
517 ls->ls_rsbtbl[i].keep.rb_node = NULL; in new_lockspace()
518 ls->ls_rsbtbl[i].toss.rb_node = NULL; in new_lockspace()
519 spin_lock_init(&ls->ls_rsbtbl[i].lock); in new_lockspace()
681 vfree(ls->ls_rsbtbl); in new_lockspace()
817 while ((n = rb_first(&ls->ls_rsbtbl[i].keep))) { in release_lockspace()
819 rb_erase(n, &ls->ls_rsbtbl[i].keep); in release_lockspace()
823 while ((n = rb_first(&ls->ls_rsbtbl[i].toss))) { in release_lockspace()
825 rb_erase(n, &ls->ls_rsbtbl[i].toss); in release_lockspace()
[all …]
Ddir.c209 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()
Drecover.c905 spin_lock(&ls->ls_rsbtbl[i].lock); in dlm_create_root_list()
906 for (n = rb_first(&ls->ls_rsbtbl[i].keep); n; n = rb_next(n)) { in dlm_create_root_list()
912 if (!RB_EMPTY_ROOT(&ls->ls_rsbtbl[i].toss)) in dlm_create_root_list()
914 spin_unlock(&ls->ls_rsbtbl[i].lock); in dlm_create_root_list()
941 spin_lock(&ls->ls_rsbtbl[i].lock); in dlm_clear_toss()
942 for (n = rb_first(&ls->ls_rsbtbl[i].toss); n; n = next) { in dlm_clear_toss()
945 rb_erase(n, &ls->ls_rsbtbl[i].toss); in dlm_clear_toss()
949 spin_unlock(&ls->ls_rsbtbl[i].lock); in dlm_clear_toss()
Ddlm_internal.h531 struct dlm_rsbtable *ls_rsbtbl; member