Lines Matching refs:ls
42 int dlm_wait_function(struct dlm_ls *ls, int (*testfn) (struct dlm_ls *ls))
48 rv = wait_event_timeout(ls->ls_wait_general,
49 testfn(ls) || dlm_recovery_stopped(ls),
53 if (test_bit(LSFL_RCOM_WAIT, &ls->ls_flags)) {
54 log_debug(ls, "dlm_wait_function timed out");
59 if (dlm_recovery_stopped(ls)) {
60 log_debug(ls, "dlm_wait_function aborted");
74 uint32_t dlm_recover_status(struct dlm_ls *ls)
77 spin_lock(&ls->ls_recover_lock);
78 status = ls->ls_recover_status;
79 spin_unlock(&ls->ls_recover_lock);
83 static void _set_recover_status(struct dlm_ls *ls, uint32_t status)
85 ls->ls_recover_status |= status;
88 void dlm_set_recover_status(struct dlm_ls *ls, uint32_t status)
90 spin_lock(&ls->ls_recover_lock);
91 _set_recover_status(ls, status);
92 spin_unlock(&ls->ls_recover_lock);
95 static int wait_status_all(struct dlm_ls *ls, uint32_t wait_status,
98 struct dlm_rcom *rc = ls->ls_recover_buf;
102 list_for_each_entry(memb, &ls->ls_nodes, list) {
105 if (dlm_recovery_stopped(ls)) {
110 error = dlm_rcom_status(ls, memb->nodeid, 0);
115 dlm_slot_save(ls, rc, memb);
128 static int wait_status_low(struct dlm_ls *ls, uint32_t wait_status,
131 struct dlm_rcom *rc = ls->ls_recover_buf;
132 int error = 0, delay = 0, nodeid = ls->ls_low_nodeid;
135 if (dlm_recovery_stopped(ls)) {
140 error = dlm_rcom_status(ls, nodeid, status_flags);
154 static int wait_status(struct dlm_ls *ls, uint32_t status)
159 if (ls->ls_low_nodeid == dlm_our_nodeid()) {
160 error = wait_status_all(ls, status, 0);
162 dlm_set_recover_status(ls, status_all);
164 error = wait_status_low(ls, status_all, 0);
169 int dlm_recover_members_wait(struct dlm_ls *ls)
177 list_for_each_entry(memb, &ls->ls_nodes, list) {
182 if (ls->ls_low_nodeid == dlm_our_nodeid()) {
183 error = wait_status_all(ls, DLM_RS_NODES, 1);
189 rv = dlm_slots_assign(ls, &num_slots, &slots_size, &slots, &gen);
191 spin_lock(&ls->ls_recover_lock);
192 _set_recover_status(ls, DLM_RS_NODES_ALL);
193 ls->ls_num_slots = num_slots;
194 ls->ls_slots_size = slots_size;
195 ls->ls_slots = slots;
196 ls->ls_generation = gen;
197 spin_unlock(&ls->ls_recover_lock);
199 dlm_set_recover_status(ls, DLM_RS_NODES_ALL);
202 error = wait_status_low(ls, DLM_RS_NODES_ALL, DLM_RSF_NEED_SLOTS);
206 dlm_slots_copy_in(ls);
212 int dlm_recover_directory_wait(struct dlm_ls *ls)
214 return wait_status(ls, DLM_RS_DIR);
217 int dlm_recover_locks_wait(struct dlm_ls *ls)
219 return wait_status(ls, DLM_RS_LOCKS);
222 int dlm_recover_done_wait(struct dlm_ls *ls)
224 return wait_status(ls, DLM_RS_DONE);
239 static int recover_list_empty(struct dlm_ls *ls)
243 spin_lock(&ls->ls_recover_list_lock);
244 empty = list_empty(&ls->ls_recover_list);
245 spin_unlock(&ls->ls_recover_list_lock);
252 struct dlm_ls *ls = r->res_ls;
254 spin_lock(&ls->ls_recover_list_lock);
256 list_add_tail(&r->res_recover_list, &ls->ls_recover_list);
257 ls->ls_recover_list_count++;
260 spin_unlock(&ls->ls_recover_list_lock);
265 struct dlm_ls *ls = r->res_ls;
267 spin_lock(&ls->ls_recover_list_lock);
269 ls->ls_recover_list_count--;
270 spin_unlock(&ls->ls_recover_list_lock);
275 static void recover_list_clear(struct dlm_ls *ls)
279 spin_lock(&ls->ls_recover_list_lock);
280 list_for_each_entry_safe(r, s, &ls->ls_recover_list, res_recover_list) {
284 ls->ls_recover_list_count--;
287 if (ls->ls_recover_list_count != 0) {
288 log_error(ls, "warning: recover_list_count %d",
289 ls->ls_recover_list_count);
290 ls->ls_recover_list_count = 0;
292 spin_unlock(&ls->ls_recover_list_lock);
295 static int recover_idr_empty(struct dlm_ls *ls)
299 spin_lock(&ls->ls_recover_idr_lock);
300 if (ls->ls_recover_list_count)
302 spin_unlock(&ls->ls_recover_idr_lock);
309 struct dlm_ls *ls = r->res_ls;
313 spin_lock(&ls->ls_recover_idr_lock);
318 rv = idr_alloc(&ls->ls_recover_idr, r, 1, 0, GFP_NOWAIT);
323 ls->ls_recover_list_count++;
327 spin_unlock(&ls->ls_recover_idr_lock);
334 struct dlm_ls *ls = r->res_ls;
336 spin_lock(&ls->ls_recover_idr_lock);
337 idr_remove(&ls->ls_recover_idr, r->res_id);
339 ls->ls_recover_list_count--;
340 spin_unlock(&ls->ls_recover_idr_lock);
345 static struct dlm_rsb *recover_idr_find(struct dlm_ls *ls, uint64_t id)
349 spin_lock(&ls->ls_recover_idr_lock);
350 r = idr_find(&ls->ls_recover_idr, (int)id);
351 spin_unlock(&ls->ls_recover_idr_lock);
355 static void recover_idr_clear(struct dlm_ls *ls)
360 spin_lock(&ls->ls_recover_idr_lock);
362 idr_for_each_entry(&ls->ls_recover_idr, r, id) {
363 idr_remove(&ls->ls_recover_idr, id);
366 ls->ls_recover_list_count--;
371 if (ls->ls_recover_list_count != 0) {
372 log_error(ls, "warning: recover_list_count %d",
373 ls->ls_recover_list_count);
374 ls->ls_recover_list_count = 0;
376 spin_unlock(&ls->ls_recover_idr_lock);
446 struct dlm_ls *ls = r->res_ls;
454 is_removed = dlm_is_removed(ls, r->res_nodeid);
523 int dlm_recover_masters(struct dlm_ls *ls)
528 int nodir = dlm_no_directory(ls);
531 log_rinfo(ls, "dlm_recover_masters");
533 down_read(&ls->ls_root_sem);
534 list_for_each_entry(r, &ls->ls_root_list, res_root_list) {
535 if (dlm_recovery_stopped(ls)) {
536 up_read(&ls->ls_root_sem);
551 up_read(&ls->ls_root_sem);
555 up_read(&ls->ls_root_sem);
557 log_rinfo(ls, "dlm_recover_masters %u of %u", count, total);
559 error = dlm_wait_function(ls, &recover_idr_empty);
562 recover_idr_clear(ls);
566 int dlm_recover_master_reply(struct dlm_ls *ls, struct dlm_rcom *rc)
571 r = recover_idr_find(ls, rc->rc_id);
573 log_error(ls, "dlm_recover_master_reply no id %llx",
592 if (recover_idr_empty(ls))
593 wake_up(&ls->ls_wait_general);
659 int dlm_recover_locks(struct dlm_ls *ls)
664 down_read(&ls->ls_root_sem);
665 list_for_each_entry(r, &ls->ls_root_list, res_root_list) {
674 if (dlm_recovery_stopped(ls)) {
676 up_read(&ls->ls_root_sem);
682 up_read(&ls->ls_root_sem);
688 up_read(&ls->ls_root_sem);
690 log_rinfo(ls, "dlm_recover_locks %d out", count);
692 error = dlm_wait_function(ls, &recover_list_empty);
695 recover_list_clear(ls);
820 struct dlm_ls *ls = r->res_ls;
836 log_debug(ls, "recover_conversion %x set gr to rq %d",
840 log_debug(ls, "recover_conversion %x set gr %d",
857 void dlm_recover_rsbs(struct dlm_ls *ls)
862 down_read(&ls->ls_root_sem);
863 list_for_each_entry(r, &ls->ls_root_list, res_root_list) {
884 up_read(&ls->ls_root_sem);
887 log_rinfo(ls, "dlm_recover_rsbs %d done", count);
892 int dlm_create_root_list(struct dlm_ls *ls)
898 down_write(&ls->ls_root_sem);
899 if (!list_empty(&ls->ls_root_list)) {
900 log_error(ls, "root list not empty");
905 for (i = 0; i < ls->ls_rsbtbl_size; i++) {
906 spin_lock(&ls->ls_rsbtbl[i].lock);
907 for (n = rb_first(&ls->ls_rsbtbl[i].keep); n; n = rb_next(n)) {
909 list_add(&r->res_root_list, &ls->ls_root_list);
913 if (!RB_EMPTY_ROOT(&ls->ls_rsbtbl[i].toss))
914 log_error(ls, "dlm_create_root_list toss not empty");
915 spin_unlock(&ls->ls_rsbtbl[i].lock);
918 up_write(&ls->ls_root_sem);
922 void dlm_release_root_list(struct dlm_ls *ls)
926 down_write(&ls->ls_root_sem);
927 list_for_each_entry_safe(r, safe, &ls->ls_root_list, res_root_list) {
931 up_write(&ls->ls_root_sem);
934 void dlm_clear_toss(struct dlm_ls *ls)
941 for (i = 0; i < ls->ls_rsbtbl_size; i++) {
942 spin_lock(&ls->ls_rsbtbl[i].lock);
943 for (n = rb_first(&ls->ls_rsbtbl[i].toss); n; n = next) {
946 rb_erase(n, &ls->ls_rsbtbl[i].toss);
950 spin_unlock(&ls->ls_rsbtbl[i].lock);
954 log_rinfo(ls, "dlm_clear_toss %u done", count);