Lines Matching refs:ls
33 int dlm_hash2nodeid(struct dlm_ls *ls, uint32_t hash)
37 if (ls->ls_num_nodes == 1)
40 node = (hash >> 16) % ls->ls_total_weight;
41 return ls->ls_node_array[node];
50 void dlm_recover_dir_nodeid(struct dlm_ls *ls)
54 down_read(&ls->ls_root_sem);
55 list_for_each_entry(r, &ls->ls_root_list, res_root_list) {
56 r->res_dir_nodeid = dlm_hash2nodeid(ls, r->res_hash);
58 up_read(&ls->ls_root_sem);
61 int dlm_recover_directory(struct dlm_ls *ls)
69 log_rinfo(ls, "dlm_recover_directory");
71 if (dlm_no_directory(ls))
78 list_for_each_entry(memb, &ls->ls_nodes, list) {
87 error = dlm_recovery_stopped(ls);
91 error = dlm_rcom_names(ls, memb->nodeid,
102 b = ls->ls_recover_buf->rc_buf;
103 left = ls->ls_recover_buf->rc_header.h_length;
133 error = dlm_master_lookup(ls, memb->nodeid,
138 log_error(ls, "recover_dir lookup %d",
151 log_error(ls, "recover_dir lookup %d "
188 dlm_set_recover_status(ls, DLM_RS_DIR);
190 log_rinfo(ls, "dlm_recover_directory %u in %u new",
198 static struct dlm_rsb *find_rsb_root(struct dlm_ls *ls, char *name, int len)
205 bucket = hash & (ls->ls_rsbtbl_size - 1);
207 spin_lock(&ls->ls_rsbtbl[bucket].lock);
208 rv = dlm_search_rsb_tree(&ls->ls_rsbtbl[bucket].keep, name, len, &r);
210 rv = dlm_search_rsb_tree(&ls->ls_rsbtbl[bucket].toss,
212 spin_unlock(&ls->ls_rsbtbl[bucket].lock);
217 down_read(&ls->ls_root_sem);
218 list_for_each_entry(r, &ls->ls_root_list, res_root_list) {
220 up_read(&ls->ls_root_sem);
221 log_debug(ls, "find_rsb_root revert to root_list %s",
226 up_read(&ls->ls_root_sem);
234 void dlm_copy_master_names(struct dlm_ls *ls, char *inbuf, int inlen,
242 down_read(&ls->ls_root_sem);
245 r = find_rsb_root(ls, inbuf, inlen);
248 log_error(ls, "copy_master_names from %d start %d %s",
254 list = ls->ls_root_list.next;
257 for (offset = 0; list != &ls->ls_root_list; list = list->next) {
279 ls->ls_recover_dir_sent_msg++;
288 ls->ls_recover_dir_sent_res++;
296 if ((list == &ls->ls_root_list) &&
301 ls->ls_recover_dir_sent_msg++;
304 up_read(&ls->ls_root_sem);