fs/dlm/recover.c

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, seq);
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, seq);
154 static int wait_status(struct dlm_ls *ls, uint32_t status, uint64_t seq)
159 	if (ls->ls_low_nodeid == dlm_our_nodeid()) {
160 		error = wait_status_all(ls, status, 0, seq);
162 			dlm_set_recover_status(ls, status_all);
164 		error = wait_status_low(ls, status_all, 0, seq);
169 int dlm_recover_members_wait(struct dlm_ls *ls, uint64_t seq)
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, seq);
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,
207 		dlm_slots_copy_in(ls);
213 int dlm_recover_directory_wait(struct dlm_ls *ls, uint64_t seq)
215 	return wait_status(ls, DLM_RS_DIR, seq);
218 int dlm_recover_locks_wait(struct dlm_ls *ls, uint64_t seq)
220 	return wait_status(ls, DLM_RS_LOCKS, seq);
223 int dlm_recover_done_wait(struct dlm_ls *ls, uint64_t seq)
225 	return wait_status(ls, DLM_RS_DONE, seq);
240 static int recover_list_empty(struct dlm_ls *ls)
244 	spin_lock(&ls->ls_recover_list_lock);
245 	empty = list_empty(&ls->ls_recover_list);
246 	spin_unlock(&ls->ls_recover_list_lock);
253 	struct dlm_ls *ls = r->res_ls;
255 	spin_lock(&ls->ls_recover_list_lock);
257 		list_add_tail(&r->res_recover_list, &ls->ls_recover_list);
258 		ls->ls_recover_list_count++;
261 	spin_unlock(&ls->ls_recover_list_lock);
266 	struct dlm_ls *ls = r->res_ls;
268 	spin_lock(&ls->ls_recover_list_lock);
270 	ls->ls_recover_list_count--;
271 	spin_unlock(&ls->ls_recover_list_lock);
276 static void recover_list_clear(struct dlm_ls *ls)
280 	spin_lock(&ls->ls_recover_list_lock);
281 	list_for_each_entry_safe(r, s, &ls->ls_recover_list, res_recover_list) {
285 		ls->ls_recover_list_count--;
288 	if (ls->ls_recover_list_count != 0) {
289 		log_error(ls, "warning: recover_list_count %d",
290 			  ls->ls_recover_list_count);
291 		ls->ls_recover_list_count = 0;
293 	spin_unlock(&ls->ls_recover_list_lock);
296 static int recover_idr_empty(struct dlm_ls *ls)
300 	spin_lock(&ls->ls_recover_idr_lock);
301 	if (ls->ls_recover_list_count)
303 	spin_unlock(&ls->ls_recover_idr_lock);
310 	struct dlm_ls *ls = r->res_ls;
314 	spin_lock(&ls->ls_recover_idr_lock);
319 	rv = idr_alloc(&ls->ls_recover_idr, r, 1, 0, GFP_NOWAIT);
324 	ls->ls_recover_list_count++;
328 	spin_unlock(&ls->ls_recover_idr_lock);
335 	struct dlm_ls *ls = r->res_ls;
337 	spin_lock(&ls->ls_recover_idr_lock);
338 	idr_remove(&ls->ls_recover_idr, r->res_id);
340 	ls->ls_recover_list_count--;
341 	spin_unlock(&ls->ls_recover_idr_lock);
346 static struct dlm_rsb *recover_idr_find(struct dlm_ls *ls, uint64_t id)
350 	spin_lock(&ls->ls_recover_idr_lock);
351 	r = idr_find(&ls->ls_recover_idr, (int)id);
352 	spin_unlock(&ls->ls_recover_idr_lock);
356 static void recover_idr_clear(struct dlm_ls *ls)
361 	spin_lock(&ls->ls_recover_idr_lock);
363 	idr_for_each_entry(&ls->ls_recover_idr, r, id) {
364 		idr_remove(&ls->ls_recover_idr, id);
367 		ls->ls_recover_list_count--;
372 	if (ls->ls_recover_list_count != 0) {
373 		log_error(ls, "warning: recover_list_count %d",
374 			  ls->ls_recover_list_count);
375 		ls->ls_recover_list_count = 0;
377 	spin_unlock(&ls->ls_recover_idr_lock);
447 	struct dlm_ls *ls = r->res_ls;
455 	is_removed = dlm_is_removed(ls, r->res_nodeid);
524 int dlm_recover_masters(struct dlm_ls *ls, uint64_t seq)
529 	int nodir = dlm_no_directory(ls);
532 	log_rinfo(ls, "dlm_recover_masters");
534 	down_read(&ls->ls_root_sem);
535 	list_for_each_entry(r, &ls->ls_root_list, res_root_list) {
536 		if (dlm_recovery_stopped(ls)) {
537 			up_read(&ls->ls_root_sem);
552 			up_read(&ls->ls_root_sem);
556 	up_read(&ls->ls_root_sem);
558 	log_rinfo(ls, "dlm_recover_masters %u of %u", count, total);
560 	error = dlm_wait_function(ls, &recover_idr_empty);
563 		recover_idr_clear(ls);
567 int dlm_recover_master_reply(struct dlm_ls *ls, const struct dlm_rcom *rc)
572 	r = recover_idr_find(ls, le64_to_cpu(rc->rc_id));
574 		log_error(ls, "dlm_recover_master_reply no id %llx",
593 	if (recover_idr_empty(ls))
594 		wake_up(&ls->ls_wait_general);
661 int dlm_recover_locks(struct dlm_ls *ls, uint64_t seq)
666 	down_read(&ls->ls_root_sem);
667 	list_for_each_entry(r, &ls->ls_root_list, res_root_list) {
676 		if (dlm_recovery_stopped(ls)) {
678 			up_read(&ls->ls_root_sem);
684 			up_read(&ls->ls_root_sem);
690 	up_read(&ls->ls_root_sem);
692 	log_rinfo(ls, "dlm_recover_locks %d out", count);
694 	error = dlm_wait_function(ls, &recover_list_empty);
697 		recover_list_clear(ls);
822 	struct dlm_ls *ls = r->res_ls;
838 			log_debug(ls, "recover_conversion %x set gr to rq %d",
842 			log_debug(ls, "recover_conversion %x set gr %d",
859 void dlm_recover_rsbs(struct dlm_ls *ls)
864 	down_read(&ls->ls_root_sem);
865 	list_for_each_entry(r, &ls->ls_root_list, res_root_list) {
886 	up_read(&ls->ls_root_sem);
889 		log_rinfo(ls, "dlm_recover_rsbs %d done", count);
894 int dlm_create_root_list(struct dlm_ls *ls)
900 	down_write(&ls->ls_root_sem);
901 	if (!list_empty(&ls->ls_root_list)) {
902 		log_error(ls, "root list not empty");
907 	for (i = 0; i < ls->ls_rsbtbl_size; i++) {
908 		spin_lock(&ls->ls_rsbtbl[i].lock);
909 		for (n = rb_first(&ls->ls_rsbtbl[i].keep); n; n = rb_next(n)) {
911 			list_add(&r->res_root_list, &ls->ls_root_list);
915 		if (!RB_EMPTY_ROOT(&ls->ls_rsbtbl[i].toss))
916 			log_error(ls, "dlm_create_root_list toss not empty");
917 		spin_unlock(&ls->ls_rsbtbl[i].lock);
920 	up_write(&ls->ls_root_sem);
924 void dlm_release_root_list(struct dlm_ls *ls)
928 	down_write(&ls->ls_root_sem);
929 	list_for_each_entry_safe(r, safe, &ls->ls_root_list, res_root_list) {
933 	up_write(&ls->ls_root_sem);
936 void dlm_clear_toss(struct dlm_ls *ls)
943 	for (i = 0; i < ls->ls_rsbtbl_size; i++) {
944 		spin_lock(&ls->ls_rsbtbl[i].lock);
945 		for (n = rb_first(&ls->ls_rsbtbl[i].toss); n; n = next) {
948 			rb_erase(n, &ls->ls_rsbtbl[i].toss);
952 		spin_unlock(&ls->ls_rsbtbl[i].lock);
956 		log_rinfo(ls, "dlm_clear_toss %u done", count);