1 /* -*- mode: c; c-basic-offset: 8; -*-
2 * vim: noexpandtab sw=8 ts=8 sts=0:
8 * Copyright (C) 2004 Oracle. All rights reserved.
10 * This program is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU General Public
12 * License as published by the Free Software Foundation; either
13 * version 2 of the License, or (at your option) any later version.
15 * This program is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 * General Public License for more details.
20 * You should have received a copy of the GNU General Public
21 * License along with this program; if not, write to the
22 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
23 * Boston, MA 021110-1307, USA.
28 #include <linux/module.h>
30 #include <linux/types.h>
31 #include <linux/slab.h>
32 #include <linux/highmem.h>
33 #include <linux/init.h>
34 #include <linux/sysctl.h>
35 #include <linux/random.h>
36 #include <linux/blkdev.h>
37 #include <linux/socket.h>
38 #include <linux/inet.h>
39 #include <linux/timer.h>
40 #include <linux/kthread.h>
41 #include <linux/delay.h>
44 #include "cluster/heartbeat.h"
45 #include "cluster/nodemanager.h"
46 #include "cluster/tcp.h"
49 #include "dlmcommon.h"
50 #include "dlmdomain.h"
52 #define MLOG_MASK_PREFIX (ML_DLM|ML_DLM_RECOVERY)
53 #include "cluster/masklog.h"
55 static void dlm_do_local_recovery_cleanup(struct dlm_ctxt
*dlm
, u8 dead_node
);
57 static int dlm_recovery_thread(void *data
);
58 static int dlm_do_recovery(struct dlm_ctxt
*dlm
);
60 static int dlm_pick_recovery_master(struct dlm_ctxt
*dlm
);
61 static int dlm_remaster_locks(struct dlm_ctxt
*dlm
, u8 dead_node
);
62 static int dlm_init_recovery_area(struct dlm_ctxt
*dlm
, u8 dead_node
);
63 static int dlm_request_all_locks(struct dlm_ctxt
*dlm
,
64 u8 request_from
, u8 dead_node
);
65 static void dlm_destroy_recovery_area(struct dlm_ctxt
*dlm
, u8 dead_node
);
67 static inline int dlm_num_locks_in_lockres(struct dlm_lock_resource
*res
);
68 static void dlm_init_migratable_lockres(struct dlm_migratable_lockres
*mres
,
69 const char *lockname
, int namelen
,
70 int total_locks
, u64 cookie
,
72 static int dlm_send_mig_lockres_msg(struct dlm_ctxt
*dlm
,
73 struct dlm_migratable_lockres
*mres
,
75 struct dlm_lock_resource
*res
,
77 static int dlm_process_recovery_data(struct dlm_ctxt
*dlm
,
78 struct dlm_lock_resource
*res
,
79 struct dlm_migratable_lockres
*mres
);
80 static int dlm_send_finalize_reco_message(struct dlm_ctxt
*dlm
);
81 static int dlm_send_all_done_msg(struct dlm_ctxt
*dlm
,
82 u8 dead_node
, u8 send_to
);
83 static int dlm_send_begin_reco_message(struct dlm_ctxt
*dlm
, u8 dead_node
);
84 static void dlm_move_reco_locks_to_list(struct dlm_ctxt
*dlm
,
85 struct list_head
*list
, u8 dead_node
);
86 static void dlm_finish_local_lockres_recovery(struct dlm_ctxt
*dlm
,
87 u8 dead_node
, u8 new_master
);
88 static void dlm_reco_ast(void *astdata
);
89 static void dlm_reco_bast(void *astdata
, int blocked_type
);
90 static void dlm_reco_unlock_ast(void *astdata
, enum dlm_status st
);
91 static void dlm_request_all_locks_worker(struct dlm_work_item
*item
,
93 static void dlm_mig_lockres_worker(struct dlm_work_item
*item
, void *data
);
94 static int dlm_lockres_master_requery(struct dlm_ctxt
*dlm
,
95 struct dlm_lock_resource
*res
,
98 static u64
dlm_get_next_mig_cookie(void);
100 static DEFINE_SPINLOCK(dlm_reco_state_lock
);
101 static DEFINE_SPINLOCK(dlm_mig_cookie_lock
);
102 static u64 dlm_mig_cookie
= 1;
104 static u64
dlm_get_next_mig_cookie(void)
107 spin_lock(&dlm_mig_cookie_lock
);
109 if (dlm_mig_cookie
== (~0ULL))
113 spin_unlock(&dlm_mig_cookie_lock
);
117 static inline void dlm_set_reco_dead_node(struct dlm_ctxt
*dlm
,
120 assert_spin_locked(&dlm
->spinlock
);
121 if (dlm
->reco
.dead_node
!= dead_node
)
122 mlog(0, "%s: changing dead_node from %u to %u\n",
123 dlm
->name
, dlm
->reco
.dead_node
, dead_node
);
124 dlm
->reco
.dead_node
= dead_node
;
127 static inline void dlm_set_reco_master(struct dlm_ctxt
*dlm
,
130 assert_spin_locked(&dlm
->spinlock
);
131 mlog(0, "%s: changing new_master from %u to %u\n",
132 dlm
->name
, dlm
->reco
.new_master
, master
);
133 dlm
->reco
.new_master
= master
;
136 static inline void __dlm_reset_recovery(struct dlm_ctxt
*dlm
)
138 assert_spin_locked(&dlm
->spinlock
);
139 clear_bit(dlm
->reco
.dead_node
, dlm
->recovery_map
);
140 dlm_set_reco_dead_node(dlm
, O2NM_INVALID_NODE_NUM
);
141 dlm_set_reco_master(dlm
, O2NM_INVALID_NODE_NUM
);
144 static inline void dlm_reset_recovery(struct dlm_ctxt
*dlm
)
146 spin_lock(&dlm
->spinlock
);
147 __dlm_reset_recovery(dlm
);
148 spin_unlock(&dlm
->spinlock
);
151 /* Worker function used during recovery. */
152 void dlm_dispatch_work(struct work_struct
*work
)
154 struct dlm_ctxt
*dlm
=
155 container_of(work
, struct dlm_ctxt
, dispatched_work
);
157 struct dlm_work_item
*item
, *next
;
158 dlm_workfunc_t
*workfunc
;
161 spin_lock(&dlm
->work_lock
);
162 list_splice_init(&dlm
->work_list
, &tmp_list
);
163 spin_unlock(&dlm
->work_lock
);
165 list_for_each_entry(item
, &tmp_list
, list
) {
168 mlog(0, "%s: work thread has %d work items\n", dlm
->name
, tot
);
170 list_for_each_entry_safe(item
, next
, &tmp_list
, list
) {
171 workfunc
= item
->func
;
172 list_del_init(&item
->list
);
174 /* already have ref on dlm to avoid having
175 * it disappear. just double-check. */
176 BUG_ON(item
->dlm
!= dlm
);
178 /* this is allowed to sleep and
179 * call network stuff */
180 workfunc(item
, item
->data
);
191 void dlm_kick_recovery_thread(struct dlm_ctxt
*dlm
)
193 /* wake the recovery thread
194 * this will wake the reco thread in one of three places
195 * 1) sleeping with no recovery happening
196 * 2) sleeping with recovery mastered elsewhere
197 * 3) recovery mastered here, waiting on reco data */
199 wake_up(&dlm
->dlm_reco_thread_wq
);
202 /* Launch the recovery thread */
203 int dlm_launch_recovery_thread(struct dlm_ctxt
*dlm
)
205 mlog(0, "starting dlm recovery thread...\n");
207 dlm
->dlm_reco_thread_task
= kthread_run(dlm_recovery_thread
, dlm
,
208 "dlm_reco-%s", dlm
->name
);
209 if (IS_ERR(dlm
->dlm_reco_thread_task
)) {
210 mlog_errno(PTR_ERR(dlm
->dlm_reco_thread_task
));
211 dlm
->dlm_reco_thread_task
= NULL
;
218 void dlm_complete_recovery_thread(struct dlm_ctxt
*dlm
)
220 if (dlm
->dlm_reco_thread_task
) {
221 mlog(0, "waiting for dlm recovery thread to exit\n");
222 kthread_stop(dlm
->dlm_reco_thread_task
);
223 dlm
->dlm_reco_thread_task
= NULL
;
230 * this is lame, but here's how recovery works...
231 * 1) all recovery threads cluster wide will work on recovering
233 * 2) negotiate who will take over all the locks for the dead node.
234 * thats right... ALL the locks.
235 * 3) once a new master is chosen, everyone scans all locks
236 * and moves aside those mastered by the dead guy
237 * 4) each of these locks should be locked until recovery is done
238 * 5) the new master collects up all of secondary lock queue info
239 * one lock at a time, forcing each node to communicate back
241 * 6) each secondary lock queue responds with the full known lock info
242 * 7) once the new master has run all its locks, it sends a ALLDONE!
243 * message to everyone
244 * 8) upon receiving this message, the secondary queue node unlocks
245 * and responds to the ALLDONE
246 * 9) once the new master gets responses from everyone, he unlocks
247 * everything and recovery for this dead node is done
248 *10) go back to 2) while there are still dead nodes
252 static void dlm_print_reco_node_status(struct dlm_ctxt
*dlm
)
254 struct dlm_reco_node_data
*ndata
;
255 struct dlm_lock_resource
*res
;
257 mlog(ML_NOTICE
, "%s(%d): recovery info, state=%s, dead=%u, master=%u\n",
258 dlm
->name
, task_pid_nr(dlm
->dlm_reco_thread_task
),
259 dlm
->reco
.state
& DLM_RECO_STATE_ACTIVE
? "ACTIVE" : "inactive",
260 dlm
->reco
.dead_node
, dlm
->reco
.new_master
);
262 list_for_each_entry(ndata
, &dlm
->reco
.node_data
, list
) {
263 char *st
= "unknown";
264 switch (ndata
->state
) {
265 case DLM_RECO_NODE_DATA_INIT
:
268 case DLM_RECO_NODE_DATA_REQUESTING
:
271 case DLM_RECO_NODE_DATA_DEAD
:
274 case DLM_RECO_NODE_DATA_RECEIVING
:
277 case DLM_RECO_NODE_DATA_REQUESTED
:
280 case DLM_RECO_NODE_DATA_DONE
:
283 case DLM_RECO_NODE_DATA_FINALIZE_SENT
:
284 st
= "finalize-sent";
290 mlog(ML_NOTICE
, "%s: reco state, node %u, state=%s\n",
291 dlm
->name
, ndata
->node_num
, st
);
293 list_for_each_entry(res
, &dlm
->reco
.resources
, recovering
) {
294 mlog(ML_NOTICE
, "%s: lockres %.*s on recovering list\n",
295 dlm
->name
, res
->lockname
.len
, res
->lockname
.name
);
299 #define DLM_RECO_THREAD_TIMEOUT_MS (5 * 1000)
301 static int dlm_recovery_thread(void *data
)
304 struct dlm_ctxt
*dlm
= data
;
305 unsigned long timeout
= msecs_to_jiffies(DLM_RECO_THREAD_TIMEOUT_MS
);
307 mlog(0, "dlm thread running for %s...\n", dlm
->name
);
309 while (!kthread_should_stop()) {
310 if (dlm_domain_fully_joined(dlm
)) {
311 status
= dlm_do_recovery(dlm
);
312 if (status
== -EAGAIN
) {
313 /* do not sleep, recheck immediately. */
320 wait_event_interruptible_timeout(dlm
->dlm_reco_thread_wq
,
321 kthread_should_stop(),
325 mlog(0, "quitting DLM recovery thread\n");
329 /* returns true when the recovery master has contacted us */
330 static int dlm_reco_master_ready(struct dlm_ctxt
*dlm
)
333 spin_lock(&dlm
->spinlock
);
334 ready
= (dlm
->reco
.new_master
!= O2NM_INVALID_NODE_NUM
);
335 spin_unlock(&dlm
->spinlock
);
339 /* returns true if node is no longer in the domain
340 * could be dead or just not joined */
341 int dlm_is_node_dead(struct dlm_ctxt
*dlm
, u8 node
)
344 spin_lock(&dlm
->spinlock
);
345 dead
= !test_bit(node
, dlm
->domain_map
);
346 spin_unlock(&dlm
->spinlock
);
350 /* returns true if node is no longer in the domain
351 * could be dead or just not joined */
352 static int dlm_is_node_recovered(struct dlm_ctxt
*dlm
, u8 node
)
355 spin_lock(&dlm
->spinlock
);
356 recovered
= !test_bit(node
, dlm
->recovery_map
);
357 spin_unlock(&dlm
->spinlock
);
362 void dlm_wait_for_node_death(struct dlm_ctxt
*dlm
, u8 node
, int timeout
)
364 if (dlm_is_node_dead(dlm
, node
))
367 printk(KERN_NOTICE
"o2dlm: Waiting on the death of node %u in "
368 "domain %s\n", node
, dlm
->name
);
371 wait_event_timeout(dlm
->dlm_reco_thread_wq
,
372 dlm_is_node_dead(dlm
, node
),
373 msecs_to_jiffies(timeout
));
375 wait_event(dlm
->dlm_reco_thread_wq
,
376 dlm_is_node_dead(dlm
, node
));
379 void dlm_wait_for_node_recovery(struct dlm_ctxt
*dlm
, u8 node
, int timeout
)
381 if (dlm_is_node_recovered(dlm
, node
))
384 printk(KERN_NOTICE
"o2dlm: Waiting on the recovery of node %u in "
385 "domain %s\n", node
, dlm
->name
);
388 wait_event_timeout(dlm
->dlm_reco_thread_wq
,
389 dlm_is_node_recovered(dlm
, node
),
390 msecs_to_jiffies(timeout
));
392 wait_event(dlm
->dlm_reco_thread_wq
,
393 dlm_is_node_recovered(dlm
, node
));
396 /* callers of the top-level api calls (dlmlock/dlmunlock) should
397 * block on the dlm->reco.event when recovery is in progress.
398 * the dlm recovery thread will set this state when it begins
399 * recovering a dead node (as the new master or not) and clear
400 * the state and wake as soon as all affected lock resources have
401 * been marked with the RECOVERY flag */
402 static int dlm_in_recovery(struct dlm_ctxt
*dlm
)
405 spin_lock(&dlm
->spinlock
);
406 in_recovery
= !!(dlm
->reco
.state
& DLM_RECO_STATE_ACTIVE
);
407 spin_unlock(&dlm
->spinlock
);
412 void dlm_wait_for_recovery(struct dlm_ctxt
*dlm
)
414 if (dlm_in_recovery(dlm
)) {
415 mlog(0, "%s: reco thread %d in recovery: "
416 "state=%d, master=%u, dead=%u\n",
417 dlm
->name
, task_pid_nr(dlm
->dlm_reco_thread_task
),
418 dlm
->reco
.state
, dlm
->reco
.new_master
,
419 dlm
->reco
.dead_node
);
421 wait_event(dlm
->reco
.event
, !dlm_in_recovery(dlm
));
424 static void dlm_begin_recovery(struct dlm_ctxt
*dlm
)
426 spin_lock(&dlm
->spinlock
);
427 BUG_ON(dlm
->reco
.state
& DLM_RECO_STATE_ACTIVE
);
428 printk(KERN_NOTICE
"o2dlm: Begin recovery on domain %s for node %u\n",
429 dlm
->name
, dlm
->reco
.dead_node
);
430 dlm
->reco
.state
|= DLM_RECO_STATE_ACTIVE
;
431 spin_unlock(&dlm
->spinlock
);
434 static void dlm_end_recovery(struct dlm_ctxt
*dlm
)
436 spin_lock(&dlm
->spinlock
);
437 BUG_ON(!(dlm
->reco
.state
& DLM_RECO_STATE_ACTIVE
));
438 dlm
->reco
.state
&= ~DLM_RECO_STATE_ACTIVE
;
439 spin_unlock(&dlm
->spinlock
);
440 printk(KERN_NOTICE
"o2dlm: End recovery on domain %s\n", dlm
->name
);
441 wake_up(&dlm
->reco
.event
);
444 static void dlm_print_recovery_master(struct dlm_ctxt
*dlm
)
446 printk(KERN_NOTICE
"o2dlm: Node %u (%s) is the Recovery Master for the "
447 "dead node %u in domain %s\n", dlm
->reco
.new_master
,
448 (dlm
->node_num
== dlm
->reco
.new_master
? "me" : "he"),
449 dlm
->reco
.dead_node
, dlm
->name
);
452 static int dlm_do_recovery(struct dlm_ctxt
*dlm
)
457 spin_lock(&dlm
->spinlock
);
459 /* check to see if the new master has died */
460 if (dlm
->reco
.new_master
!= O2NM_INVALID_NODE_NUM
&&
461 test_bit(dlm
->reco
.new_master
, dlm
->recovery_map
)) {
462 mlog(0, "new master %u died while recovering %u!\n",
463 dlm
->reco
.new_master
, dlm
->reco
.dead_node
);
464 /* unset the new_master, leave dead_node */
465 dlm_set_reco_master(dlm
, O2NM_INVALID_NODE_NUM
);
468 /* select a target to recover */
469 if (dlm
->reco
.dead_node
== O2NM_INVALID_NODE_NUM
) {
472 bit
= find_next_bit (dlm
->recovery_map
, O2NM_MAX_NODES
, 0);
473 if (bit
>= O2NM_MAX_NODES
|| bit
< 0)
474 dlm_set_reco_dead_node(dlm
, O2NM_INVALID_NODE_NUM
);
476 dlm_set_reco_dead_node(dlm
, bit
);
477 } else if (!test_bit(dlm
->reco
.dead_node
, dlm
->recovery_map
)) {
479 mlog(ML_ERROR
, "dead_node %u no longer in recovery map!\n",
480 dlm
->reco
.dead_node
);
481 dlm_set_reco_dead_node(dlm
, O2NM_INVALID_NODE_NUM
);
484 if (dlm
->reco
.dead_node
== O2NM_INVALID_NODE_NUM
) {
485 // mlog(0, "nothing to recover! sleeping now!\n");
486 spin_unlock(&dlm
->spinlock
);
487 /* return to main thread loop and sleep. */
490 mlog(0, "%s(%d):recovery thread found node %u in the recovery map!\n",
491 dlm
->name
, task_pid_nr(dlm
->dlm_reco_thread_task
),
492 dlm
->reco
.dead_node
);
493 spin_unlock(&dlm
->spinlock
);
495 /* take write barrier */
496 /* (stops the list reshuffling thread, proxy ast handling) */
497 dlm_begin_recovery(dlm
);
499 if (dlm
->reco
.new_master
== dlm
->node_num
)
502 if (dlm
->reco
.new_master
== O2NM_INVALID_NODE_NUM
) {
503 /* choose a new master, returns 0 if this node
504 * is the master, -EEXIST if it's another node.
505 * this does not return until a new master is chosen
506 * or recovery completes entirely. */
507 ret
= dlm_pick_recovery_master(dlm
);
509 /* already notified everyone. go. */
512 mlog(0, "another node will master this recovery session.\n");
515 dlm_print_recovery_master(dlm
);
517 /* it is safe to start everything back up here
518 * because all of the dead node's lock resources
519 * have been marked as in-recovery */
520 dlm_end_recovery(dlm
);
522 /* sleep out in main dlm_recovery_thread loop. */
526 dlm_print_recovery_master(dlm
);
528 status
= dlm_remaster_locks(dlm
, dlm
->reco
.dead_node
);
530 /* we should never hit this anymore */
531 mlog(ML_ERROR
, "%s: Error %d remastering locks for node %u, "
532 "retrying.\n", dlm
->name
, status
, dlm
->reco
.dead_node
);
533 /* yield a bit to allow any final network messages
534 * to get handled on remaining nodes */
537 /* success! see if any other nodes need recovery */
538 mlog(0, "DONE mastering recovery of %s:%u here(this=%u)!\n",
539 dlm
->name
, dlm
->reco
.dead_node
, dlm
->node_num
);
540 spin_lock(&dlm
->spinlock
);
541 __dlm_reset_recovery(dlm
);
542 dlm
->reco
.state
&= ~DLM_RECO_STATE_FINALIZE
;
543 spin_unlock(&dlm
->spinlock
);
545 dlm_end_recovery(dlm
);
547 /* continue and look for another dead node */
551 static int dlm_remaster_locks(struct dlm_ctxt
*dlm
, u8 dead_node
)
554 struct dlm_reco_node_data
*ndata
;
560 /* we have become recovery master. there is no escaping
561 * this, so just keep trying until we get it. */
562 status
= dlm_init_recovery_area(dlm
, dead_node
);
564 mlog(ML_ERROR
, "%s: failed to alloc recovery area, "
565 "retrying\n", dlm
->name
);
568 } while (status
!= 0);
570 /* safe to access the node data list without a lock, since this
571 * process is the only one to change the list */
572 list_for_each_entry(ndata
, &dlm
->reco
.node_data
, list
) {
573 BUG_ON(ndata
->state
!= DLM_RECO_NODE_DATA_INIT
);
574 ndata
->state
= DLM_RECO_NODE_DATA_REQUESTING
;
576 mlog(0, "%s: Requesting lock info from node %u\n", dlm
->name
,
579 if (ndata
->node_num
== dlm
->node_num
) {
580 ndata
->state
= DLM_RECO_NODE_DATA_DONE
;
585 status
= dlm_request_all_locks(dlm
, ndata
->node_num
,
589 if (dlm_is_host_down(status
)) {
590 /* node died, ignore it for recovery */
592 ndata
->state
= DLM_RECO_NODE_DATA_DEAD
;
593 /* wait for the domain map to catch up
594 * with the network state. */
595 wait_event_timeout(dlm
->dlm_reco_thread_wq
,
596 dlm_is_node_dead(dlm
,
598 msecs_to_jiffies(1000));
599 mlog(0, "waited 1 sec for %u, "
600 "dead? %s\n", ndata
->node_num
,
601 dlm_is_node_dead(dlm
, ndata
->node_num
) ?
604 /* -ENOMEM on the other node */
605 mlog(0, "%s: node %u returned "
606 "%d during recovery, retrying "
607 "after a short wait\n",
608 dlm
->name
, ndata
->node_num
,
613 } while (status
!= 0);
615 spin_lock(&dlm_reco_state_lock
);
616 switch (ndata
->state
) {
617 case DLM_RECO_NODE_DATA_INIT
:
618 case DLM_RECO_NODE_DATA_FINALIZE_SENT
:
619 case DLM_RECO_NODE_DATA_REQUESTED
:
622 case DLM_RECO_NODE_DATA_DEAD
:
623 mlog(0, "node %u died after requesting "
624 "recovery info for node %u\n",
625 ndata
->node_num
, dead_node
);
626 /* fine. don't need this node's info.
627 * continue without it. */
629 case DLM_RECO_NODE_DATA_REQUESTING
:
630 ndata
->state
= DLM_RECO_NODE_DATA_REQUESTED
;
631 mlog(0, "now receiving recovery data from "
632 "node %u for dead node %u\n",
633 ndata
->node_num
, dead_node
);
635 case DLM_RECO_NODE_DATA_RECEIVING
:
636 mlog(0, "already receiving recovery data from "
637 "node %u for dead node %u\n",
638 ndata
->node_num
, dead_node
);
640 case DLM_RECO_NODE_DATA_DONE
:
641 mlog(0, "already DONE receiving recovery data "
642 "from node %u for dead node %u\n",
643 ndata
->node_num
, dead_node
);
646 spin_unlock(&dlm_reco_state_lock
);
649 mlog(0, "%s: Done requesting all lock info\n", dlm
->name
);
651 /* nodes should be sending reco data now
652 * just need to wait */
655 /* check all the nodes now to see if we are
656 * done, or if anyone died */
658 spin_lock(&dlm_reco_state_lock
);
659 list_for_each_entry(ndata
, &dlm
->reco
.node_data
, list
) {
660 mlog(0, "checking recovery state of node %u\n",
662 switch (ndata
->state
) {
663 case DLM_RECO_NODE_DATA_INIT
:
664 case DLM_RECO_NODE_DATA_REQUESTING
:
665 mlog(ML_ERROR
, "bad ndata state for "
666 "node %u: state=%d\n",
667 ndata
->node_num
, ndata
->state
);
670 case DLM_RECO_NODE_DATA_DEAD
:
671 mlog(0, "node %u died after "
672 "requesting recovery info for "
673 "node %u\n", ndata
->node_num
,
676 case DLM_RECO_NODE_DATA_RECEIVING
:
677 case DLM_RECO_NODE_DATA_REQUESTED
:
678 mlog(0, "%s: node %u still in state %s\n",
679 dlm
->name
, ndata
->node_num
,
680 ndata
->state
==DLM_RECO_NODE_DATA_RECEIVING
?
681 "receiving" : "requested");
684 case DLM_RECO_NODE_DATA_DONE
:
685 mlog(0, "%s: node %u state is done\n",
686 dlm
->name
, ndata
->node_num
);
688 case DLM_RECO_NODE_DATA_FINALIZE_SENT
:
689 mlog(0, "%s: node %u state is finalize\n",
690 dlm
->name
, ndata
->node_num
);
694 spin_unlock(&dlm_reco_state_lock
);
696 mlog(0, "pass #%d, all_nodes_done?: %s\n", ++pass
,
697 all_nodes_done
?"yes":"no");
698 if (all_nodes_done
) {
701 /* Set this flag on recovery master to avoid
702 * a new recovery for another dead node start
703 * before the recovery is not done. That may
704 * cause recovery hung.*/
705 spin_lock(&dlm
->spinlock
);
706 dlm
->reco
.state
|= DLM_RECO_STATE_FINALIZE
;
707 spin_unlock(&dlm
->spinlock
);
709 /* all nodes are now in DLM_RECO_NODE_DATA_DONE state
710 * just send a finalize message to everyone and
712 mlog(0, "all nodes are done! send finalize\n");
713 ret
= dlm_send_finalize_reco_message(dlm
);
717 spin_lock(&dlm
->spinlock
);
718 dlm_finish_local_lockres_recovery(dlm
, dead_node
,
720 spin_unlock(&dlm
->spinlock
);
721 mlog(0, "should be done with recovery!\n");
723 mlog(0, "finishing recovery of %s at %lu, "
724 "dead=%u, this=%u, new=%u\n", dlm
->name
,
725 jiffies
, dlm
->reco
.dead_node
,
726 dlm
->node_num
, dlm
->reco
.new_master
);
729 /* rescan everything marked dirty along the way */
730 dlm_kick_thread(dlm
, NULL
);
733 /* wait to be signalled, with periodic timeout
734 * to check for node death */
735 wait_event_interruptible_timeout(dlm
->dlm_reco_thread_wq
,
736 kthread_should_stop(),
737 msecs_to_jiffies(DLM_RECO_THREAD_TIMEOUT_MS
));
742 dlm_destroy_recovery_area(dlm
, dead_node
);
747 static int dlm_init_recovery_area(struct dlm_ctxt
*dlm
, u8 dead_node
)
750 struct dlm_reco_node_data
*ndata
;
752 spin_lock(&dlm
->spinlock
);
753 memcpy(dlm
->reco
.node_map
, dlm
->domain_map
, sizeof(dlm
->domain_map
));
754 /* nodes can only be removed (by dying) after dropping
755 * this lock, and death will be trapped later, so this should do */
756 spin_unlock(&dlm
->spinlock
);
759 num
= find_next_bit (dlm
->reco
.node_map
, O2NM_MAX_NODES
, num
);
760 if (num
>= O2NM_MAX_NODES
) {
763 BUG_ON(num
== dead_node
);
765 ndata
= kzalloc(sizeof(*ndata
), GFP_NOFS
);
767 dlm_destroy_recovery_area(dlm
, dead_node
);
770 ndata
->node_num
= num
;
771 ndata
->state
= DLM_RECO_NODE_DATA_INIT
;
772 spin_lock(&dlm_reco_state_lock
);
773 list_add_tail(&ndata
->list
, &dlm
->reco
.node_data
);
774 spin_unlock(&dlm_reco_state_lock
);
781 static void dlm_destroy_recovery_area(struct dlm_ctxt
*dlm
, u8 dead_node
)
783 struct dlm_reco_node_data
*ndata
, *next
;
786 spin_lock(&dlm_reco_state_lock
);
787 list_splice_init(&dlm
->reco
.node_data
, &tmplist
);
788 spin_unlock(&dlm_reco_state_lock
);
790 list_for_each_entry_safe(ndata
, next
, &tmplist
, list
) {
791 list_del_init(&ndata
->list
);
796 static int dlm_request_all_locks(struct dlm_ctxt
*dlm
, u8 request_from
,
799 struct dlm_lock_request lr
;
806 mlog(0, "dlm_request_all_locks: dead node is %u, sending request "
807 "to %u\n", dead_node
, request_from
);
809 memset(&lr
, 0, sizeof(lr
));
810 lr
.node_idx
= dlm
->node_num
;
811 lr
.dead_node
= dead_node
;
814 ret
= o2net_send_message(DLM_LOCK_REQUEST_MSG
, dlm
->key
,
815 &lr
, sizeof(lr
), request_from
, &status
);
817 /* negative status is handled by caller */
819 mlog(ML_ERROR
, "%s: Error %d send LOCK_REQUEST to node %u "
820 "to recover dead node %u\n", dlm
->name
, ret
,
821 request_from
, dead_node
);
824 // return from here, then
825 // sleep until all received or error
830 int dlm_request_all_locks_handler(struct o2net_msg
*msg
, u32 len
, void *data
,
833 struct dlm_ctxt
*dlm
= data
;
834 struct dlm_lock_request
*lr
= (struct dlm_lock_request
*)msg
->buf
;
836 struct dlm_work_item
*item
= NULL
;
841 if (lr
->dead_node
!= dlm
->reco
.dead_node
) {
842 mlog(ML_ERROR
, "%s: node %u sent dead_node=%u, but local "
843 "dead_node is %u\n", dlm
->name
, lr
->node_idx
,
844 lr
->dead_node
, dlm
->reco
.dead_node
);
845 dlm_print_reco_node_status(dlm
);
850 BUG_ON(lr
->dead_node
!= dlm
->reco
.dead_node
);
852 item
= kzalloc(sizeof(*item
), GFP_NOFS
);
858 /* this will get freed by dlm_request_all_locks_worker */
859 buf
= (char *) __get_free_page(GFP_NOFS
);
866 /* queue up work for dlm_request_all_locks_worker */
867 dlm_grab(dlm
); /* get an extra ref for the work item */
868 dlm_init_work_item(dlm
, item
, dlm_request_all_locks_worker
, buf
);
869 item
->u
.ral
.reco_master
= lr
->node_idx
;
870 item
->u
.ral
.dead_node
= lr
->dead_node
;
871 spin_lock(&dlm
->work_lock
);
872 list_add_tail(&item
->list
, &dlm
->work_list
);
873 spin_unlock(&dlm
->work_lock
);
874 queue_work(dlm
->dlm_worker
, &dlm
->dispatched_work
);
880 static void dlm_request_all_locks_worker(struct dlm_work_item
*item
, void *data
)
882 struct dlm_migratable_lockres
*mres
;
883 struct dlm_lock_resource
*res
;
884 struct dlm_ctxt
*dlm
;
885 LIST_HEAD(resources
);
887 u8 dead_node
, reco_master
;
888 int skip_all_done
= 0;
891 dead_node
= item
->u
.ral
.dead_node
;
892 reco_master
= item
->u
.ral
.reco_master
;
893 mres
= (struct dlm_migratable_lockres
*)data
;
895 mlog(0, "%s: recovery worker started, dead=%u, master=%u\n",
896 dlm
->name
, dead_node
, reco_master
);
898 if (dead_node
!= dlm
->reco
.dead_node
||
899 reco_master
!= dlm
->reco
.new_master
) {
900 /* worker could have been created before the recovery master
901 * died. if so, do not continue, but do not error. */
902 if (dlm
->reco
.new_master
== O2NM_INVALID_NODE_NUM
) {
903 mlog(ML_NOTICE
, "%s: will not send recovery state, "
904 "recovery master %u died, thread=(dead=%u,mas=%u)"
905 " current=(dead=%u,mas=%u)\n", dlm
->name
,
906 reco_master
, dead_node
, reco_master
,
907 dlm
->reco
.dead_node
, dlm
->reco
.new_master
);
909 mlog(ML_NOTICE
, "%s: reco state invalid: reco(dead=%u, "
910 "master=%u), request(dead=%u, master=%u)\n",
911 dlm
->name
, dlm
->reco
.dead_node
,
912 dlm
->reco
.new_master
, dead_node
, reco_master
);
917 /* lock resources should have already been moved to the
918 * dlm->reco.resources list. now move items from that list
919 * to a temp list if the dead owner matches. note that the
920 * whole cluster recovers only one node at a time, so we
921 * can safely move UNKNOWN lock resources for each recovery
923 dlm_move_reco_locks_to_list(dlm
, &resources
, dead_node
);
925 /* now we can begin blasting lockreses without the dlm lock */
927 /* any errors returned will be due to the new_master dying,
928 * the dlm_reco_thread should detect this */
929 list_for_each_entry(res
, &resources
, recovering
) {
930 ret
= dlm_send_one_lockres(dlm
, res
, mres
, reco_master
,
933 mlog(ML_ERROR
, "%s: node %u went down while sending "
934 "recovery state for dead node %u, ret=%d\n", dlm
->name
,
935 reco_master
, dead_node
, ret
);
941 /* move the resources back to the list */
942 spin_lock(&dlm
->spinlock
);
943 list_splice_init(&resources
, &dlm
->reco
.resources
);
944 spin_unlock(&dlm
->spinlock
);
946 if (!skip_all_done
) {
947 ret
= dlm_send_all_done_msg(dlm
, dead_node
, reco_master
);
949 mlog(ML_ERROR
, "%s: node %u went down while sending "
950 "recovery all-done for dead node %u, ret=%d\n",
951 dlm
->name
, reco_master
, dead_node
, ret
);
955 free_page((unsigned long)data
);
959 static int dlm_send_all_done_msg(struct dlm_ctxt
*dlm
, u8 dead_node
, u8 send_to
)
962 struct dlm_reco_data_done done_msg
;
964 memset(&done_msg
, 0, sizeof(done_msg
));
965 done_msg
.node_idx
= dlm
->node_num
;
966 done_msg
.dead_node
= dead_node
;
967 mlog(0, "sending DATA DONE message to %u, "
968 "my node=%u, dead node=%u\n", send_to
, done_msg
.node_idx
,
971 ret
= o2net_send_message(DLM_RECO_DATA_DONE_MSG
, dlm
->key
, &done_msg
,
972 sizeof(done_msg
), send_to
, &tmpret
);
974 mlog(ML_ERROR
, "%s: Error %d send RECO_DATA_DONE to node %u "
975 "to recover dead node %u\n", dlm
->name
, ret
, send_to
,
977 if (!dlm_is_host_down(ret
)) {
986 int dlm_reco_data_done_handler(struct o2net_msg
*msg
, u32 len
, void *data
,
989 struct dlm_ctxt
*dlm
= data
;
990 struct dlm_reco_data_done
*done
= (struct dlm_reco_data_done
*)msg
->buf
;
991 struct dlm_reco_node_data
*ndata
= NULL
;
997 mlog(0, "got DATA DONE: dead_node=%u, reco.dead_node=%u, "
998 "node_idx=%u, this node=%u\n", done
->dead_node
,
999 dlm
->reco
.dead_node
, done
->node_idx
, dlm
->node_num
);
1001 mlog_bug_on_msg((done
->dead_node
!= dlm
->reco
.dead_node
),
1002 "Got DATA DONE: dead_node=%u, reco.dead_node=%u, "
1003 "node_idx=%u, this node=%u\n", done
->dead_node
,
1004 dlm
->reco
.dead_node
, done
->node_idx
, dlm
->node_num
);
1006 spin_lock(&dlm_reco_state_lock
);
1007 list_for_each_entry(ndata
, &dlm
->reco
.node_data
, list
) {
1008 if (ndata
->node_num
!= done
->node_idx
)
1011 switch (ndata
->state
) {
1012 /* should have moved beyond INIT but not to FINALIZE yet */
1013 case DLM_RECO_NODE_DATA_INIT
:
1014 case DLM_RECO_NODE_DATA_DEAD
:
1015 case DLM_RECO_NODE_DATA_FINALIZE_SENT
:
1016 mlog(ML_ERROR
, "bad ndata state for node %u:"
1017 " state=%d\n", ndata
->node_num
,
1021 /* these states are possible at this point, anywhere along
1022 * the line of recovery */
1023 case DLM_RECO_NODE_DATA_DONE
:
1024 case DLM_RECO_NODE_DATA_RECEIVING
:
1025 case DLM_RECO_NODE_DATA_REQUESTED
:
1026 case DLM_RECO_NODE_DATA_REQUESTING
:
1027 mlog(0, "node %u is DONE sending "
1031 ndata
->state
= DLM_RECO_NODE_DATA_DONE
;
1036 spin_unlock(&dlm_reco_state_lock
);
1038 /* wake the recovery thread, some node is done */
1040 dlm_kick_recovery_thread(dlm
);
1043 mlog(ML_ERROR
, "failed to find recovery node data for node "
1044 "%u\n", done
->node_idx
);
1047 mlog(0, "leaving reco data done handler, ret=%d\n", ret
);
1051 static void dlm_move_reco_locks_to_list(struct dlm_ctxt
*dlm
,
1052 struct list_head
*list
,
1055 struct dlm_lock_resource
*res
, *next
;
1056 struct dlm_lock
*lock
;
1058 spin_lock(&dlm
->spinlock
);
1059 list_for_each_entry_safe(res
, next
, &dlm
->reco
.resources
, recovering
) {
1060 /* always prune any $RECOVERY entries for dead nodes,
1061 * otherwise hangs can occur during later recovery */
1062 if (dlm_is_recovery_lock(res
->lockname
.name
,
1063 res
->lockname
.len
)) {
1064 spin_lock(&res
->spinlock
);
1065 list_for_each_entry(lock
, &res
->granted
, list
) {
1066 if (lock
->ml
.node
== dead_node
) {
1067 mlog(0, "AHA! there was "
1068 "a $RECOVERY lock for dead "
1070 dead_node
, dlm
->name
);
1071 list_del_init(&lock
->list
);
1073 /* Can't schedule DLM_UNLOCK_FREE_LOCK
1079 spin_unlock(&res
->spinlock
);
1083 if (res
->owner
== dead_node
) {
1084 mlog(0, "found lockres owned by dead node while "
1085 "doing recovery for node %u. sending it.\n",
1087 list_move_tail(&res
->recovering
, list
);
1088 } else if (res
->owner
== DLM_LOCK_RES_OWNER_UNKNOWN
) {
1089 mlog(0, "found UNKNOWN owner while doing recovery "
1090 "for node %u. sending it.\n", dead_node
);
1091 list_move_tail(&res
->recovering
, list
);
1094 spin_unlock(&dlm
->spinlock
);
1097 static inline int dlm_num_locks_in_lockres(struct dlm_lock_resource
*res
)
1099 int total_locks
= 0;
1100 struct list_head
*iter
, *queue
= &res
->granted
;
1103 for (i
=0; i
<3; i
++) {
1104 list_for_each(iter
, queue
)
1112 static int dlm_send_mig_lockres_msg(struct dlm_ctxt
*dlm
,
1113 struct dlm_migratable_lockres
*mres
,
1115 struct dlm_lock_resource
*res
,
1118 u64 mig_cookie
= be64_to_cpu(mres
->mig_cookie
);
1119 int mres_total_locks
= be32_to_cpu(mres
->total_locks
);
1120 int sz
, ret
= 0, status
= 0;
1121 u8 orig_flags
= mres
->flags
,
1122 orig_master
= mres
->master
;
1124 BUG_ON(mres
->num_locks
> DLM_MAX_MIGRATABLE_LOCKS
);
1125 if (!mres
->num_locks
)
1128 sz
= sizeof(struct dlm_migratable_lockres
) +
1129 (mres
->num_locks
* sizeof(struct dlm_migratable_lock
));
1131 /* add an all-done flag if we reached the last lock */
1132 orig_flags
= mres
->flags
;
1133 BUG_ON(total_locks
> mres_total_locks
);
1134 if (total_locks
== mres_total_locks
)
1135 mres
->flags
|= DLM_MRES_ALL_DONE
;
1137 mlog(0, "%s:%.*s: sending mig lockres (%s) to %u\n",
1138 dlm
->name
, res
->lockname
.len
, res
->lockname
.name
,
1139 orig_flags
& DLM_MRES_MIGRATION
? "migration" : "recovery",
1143 ret
= o2net_send_message(DLM_MIG_LOCKRES_MSG
, dlm
->key
, mres
,
1144 sz
, send_to
, &status
);
1146 /* XXX: negative status is not handled.
1147 * this will end up killing this node. */
1148 mlog(ML_ERROR
, "%s: res %.*s, Error %d send MIG_LOCKRES to "
1149 "node %u (%s)\n", dlm
->name
, mres
->lockname_len
,
1150 mres
->lockname
, ret
, send_to
,
1151 (orig_flags
& DLM_MRES_MIGRATION
?
1152 "migration" : "recovery"));
1154 /* might get an -ENOMEM back here */
1159 if (ret
== -EFAULT
) {
1160 mlog(ML_ERROR
, "node %u told me to kill "
1161 "myself!\n", send_to
);
1167 /* zero and reinit the message buffer */
1168 dlm_init_migratable_lockres(mres
, res
->lockname
.name
,
1169 res
->lockname
.len
, mres_total_locks
,
1170 mig_cookie
, orig_flags
, orig_master
);
1174 static void dlm_init_migratable_lockres(struct dlm_migratable_lockres
*mres
,
1175 const char *lockname
, int namelen
,
1176 int total_locks
, u64 cookie
,
1177 u8 flags
, u8 master
)
1179 /* mres here is one full page */
1181 mres
->lockname_len
= namelen
;
1182 memcpy(mres
->lockname
, lockname
, namelen
);
1183 mres
->num_locks
= 0;
1184 mres
->total_locks
= cpu_to_be32(total_locks
);
1185 mres
->mig_cookie
= cpu_to_be64(cookie
);
1186 mres
->flags
= flags
;
1187 mres
->master
= master
;
1190 static void dlm_prepare_lvb_for_migration(struct dlm_lock
*lock
,
1191 struct dlm_migratable_lockres
*mres
,
1197 /* Ignore lvb in all locks in the blocked list */
1198 if (queue
== DLM_BLOCKED_LIST
)
1201 /* Only consider lvbs in locks with granted EX or PR lock levels */
1202 if (lock
->ml
.type
!= LKM_EXMODE
&& lock
->ml
.type
!= LKM_PRMODE
)
1205 if (dlm_lvb_is_empty(mres
->lvb
)) {
1206 memcpy(mres
->lvb
, lock
->lksb
->lvb
, DLM_LVB_LEN
);
1210 /* Ensure the lvb copied for migration matches in other valid locks */
1211 if (!memcmp(mres
->lvb
, lock
->lksb
->lvb
, DLM_LVB_LEN
))
1214 mlog(ML_ERROR
, "Mismatched lvb in lock cookie=%u:%llu, name=%.*s, "
1216 dlm_get_lock_cookie_node(be64_to_cpu(lock
->ml
.cookie
)),
1217 dlm_get_lock_cookie_seq(be64_to_cpu(lock
->ml
.cookie
)),
1218 lock
->lockres
->lockname
.len
, lock
->lockres
->lockname
.name
,
1220 dlm_print_one_lock_resource(lock
->lockres
);
1224 /* returns 1 if this lock fills the network structure,
1226 static int dlm_add_lock_to_array(struct dlm_lock
*lock
,
1227 struct dlm_migratable_lockres
*mres
, int queue
)
1229 struct dlm_migratable_lock
*ml
;
1230 int lock_num
= mres
->num_locks
;
1232 ml
= &(mres
->ml
[lock_num
]);
1233 ml
->cookie
= lock
->ml
.cookie
;
1234 ml
->type
= lock
->ml
.type
;
1235 ml
->convert_type
= lock
->ml
.convert_type
;
1236 ml
->highest_blocked
= lock
->ml
.highest_blocked
;
1239 ml
->flags
= lock
->lksb
->flags
;
1240 dlm_prepare_lvb_for_migration(lock
, mres
, queue
);
1242 ml
->node
= lock
->ml
.node
;
1244 /* we reached the max, send this network message */
1245 if (mres
->num_locks
== DLM_MAX_MIGRATABLE_LOCKS
)
1250 static void dlm_add_dummy_lock(struct dlm_ctxt
*dlm
,
1251 struct dlm_migratable_lockres
*mres
)
1253 struct dlm_lock dummy
;
1254 memset(&dummy
, 0, sizeof(dummy
));
1255 dummy
.ml
.cookie
= 0;
1256 dummy
.ml
.type
= LKM_IVMODE
;
1257 dummy
.ml
.convert_type
= LKM_IVMODE
;
1258 dummy
.ml
.highest_blocked
= LKM_IVMODE
;
1260 dummy
.ml
.node
= dlm
->node_num
;
1261 dlm_add_lock_to_array(&dummy
, mres
, DLM_BLOCKED_LIST
);
1264 static inline int dlm_is_dummy_lock(struct dlm_ctxt
*dlm
,
1265 struct dlm_migratable_lock
*ml
,
1268 if (unlikely(ml
->cookie
== 0 &&
1269 ml
->type
== LKM_IVMODE
&&
1270 ml
->convert_type
== LKM_IVMODE
&&
1271 ml
->highest_blocked
== LKM_IVMODE
&&
1272 ml
->list
== DLM_BLOCKED_LIST
)) {
1273 *nodenum
= ml
->node
;
1279 int dlm_send_one_lockres(struct dlm_ctxt
*dlm
, struct dlm_lock_resource
*res
,
1280 struct dlm_migratable_lockres
*mres
,
1281 u8 send_to
, u8 flags
)
1283 struct list_head
*queue
;
1286 struct dlm_lock
*lock
;
1289 BUG_ON(!(flags
& (DLM_MRES_RECOVERY
|DLM_MRES_MIGRATION
)));
1291 mlog(0, "sending to %u\n", send_to
);
1293 total_locks
= dlm_num_locks_in_lockres(res
);
1294 if (total_locks
> DLM_MAX_MIGRATABLE_LOCKS
) {
1295 /* rare, but possible */
1296 mlog(0, "argh. lockres has %d locks. this will "
1297 "require more than one network packet to "
1298 "migrate\n", total_locks
);
1299 mig_cookie
= dlm_get_next_mig_cookie();
1302 dlm_init_migratable_lockres(mres
, res
->lockname
.name
,
1303 res
->lockname
.len
, total_locks
,
1304 mig_cookie
, flags
, res
->owner
);
1307 for (i
=DLM_GRANTED_LIST
; i
<=DLM_BLOCKED_LIST
; i
++) {
1308 queue
= dlm_list_idx_to_ptr(res
, i
);
1309 list_for_each_entry(lock
, queue
, list
) {
1310 /* add another lock. */
1312 if (!dlm_add_lock_to_array(lock
, mres
, i
))
1315 /* this filled the lock message,
1316 * we must send it immediately. */
1317 ret
= dlm_send_mig_lockres_msg(dlm
, mres
, send_to
,
1323 if (total_locks
== 0) {
1324 /* send a dummy lock to indicate a mastery reference only */
1325 mlog(0, "%s:%.*s: sending dummy lock to %u, %s\n",
1326 dlm
->name
, res
->lockname
.len
, res
->lockname
.name
,
1327 send_to
, flags
& DLM_MRES_RECOVERY
? "recovery" :
1329 dlm_add_dummy_lock(dlm
, mres
);
1331 /* flush any remaining locks */
1332 ret
= dlm_send_mig_lockres_msg(dlm
, mres
, send_to
, res
, total_locks
);
1338 mlog(ML_ERROR
, "%s: dlm_send_mig_lockres_msg returned %d\n",
1340 if (!dlm_is_host_down(ret
))
1342 mlog(0, "%s: node %u went down while sending %s "
1343 "lockres %.*s\n", dlm
->name
, send_to
,
1344 flags
& DLM_MRES_RECOVERY
? "recovery" : "migration",
1345 res
->lockname
.len
, res
->lockname
.name
);
1352 * this message will contain no more than one page worth of
1353 * recovery data, and it will work on only one lockres.
1354 * there may be many locks in this page, and we may need to wait
1355 * for additional packets to complete all the locks (rare, but
1359 * NOTE: the allocation error cases here are scary
1360 * we really cannot afford to fail an alloc in recovery
1361 * do we spin? returning an error only delays the problem really
1364 int dlm_mig_lockres_handler(struct o2net_msg
*msg
, u32 len
, void *data
,
1367 struct dlm_ctxt
*dlm
= data
;
1368 struct dlm_migratable_lockres
*mres
=
1369 (struct dlm_migratable_lockres
*)msg
->buf
;
1374 struct dlm_work_item
*item
= NULL
;
1375 struct dlm_lock_resource
*res
= NULL
;
1381 BUG_ON(!(mres
->flags
& (DLM_MRES_RECOVERY
|DLM_MRES_MIGRATION
)));
1383 real_master
= mres
->master
;
1384 if (real_master
== DLM_LOCK_RES_OWNER_UNKNOWN
) {
1385 /* cannot migrate a lockres with no master */
1386 BUG_ON(!(mres
->flags
& DLM_MRES_RECOVERY
));
1389 mlog(0, "%s message received from node %u\n",
1390 (mres
->flags
& DLM_MRES_RECOVERY
) ?
1391 "recovery" : "migration", mres
->master
);
1392 if (mres
->flags
& DLM_MRES_ALL_DONE
)
1393 mlog(0, "all done flag. all lockres data received!\n");
1396 buf
= kmalloc(be16_to_cpu(msg
->data_len
), GFP_NOFS
);
1397 item
= kzalloc(sizeof(*item
), GFP_NOFS
);
1401 /* lookup the lock to see if we have a secondary queue for this
1402 * already... just add the locks in and this will have its owner
1403 * and RECOVERY flag changed when it completes. */
1404 hash
= dlm_lockid_hash(mres
->lockname
, mres
->lockname_len
);
1405 spin_lock(&dlm
->spinlock
);
1406 res
= __dlm_lookup_lockres_full(dlm
, mres
->lockname
, mres
->lockname_len
,
1409 /* this will get a ref on res */
1410 /* mark it as recovering/migrating and hash it */
1411 spin_lock(&res
->spinlock
);
1412 if (res
->state
& DLM_LOCK_RES_DROPPING_REF
) {
1413 mlog(0, "%s: node is attempting to migrate "
1414 "lockres %.*s, but marked as dropping "
1415 " ref!\n", dlm
->name
,
1416 mres
->lockname_len
, mres
->lockname
);
1418 spin_unlock(&res
->spinlock
);
1419 spin_unlock(&dlm
->spinlock
);
1420 dlm_lockres_put(res
);
1424 if (mres
->flags
& DLM_MRES_RECOVERY
) {
1425 res
->state
|= DLM_LOCK_RES_RECOVERING
;
1427 if (res
->state
& DLM_LOCK_RES_MIGRATING
) {
1428 /* this is at least the second
1429 * lockres message */
1430 mlog(0, "lock %.*s is already migrating\n",
1433 } else if (res
->state
& DLM_LOCK_RES_RECOVERING
) {
1434 /* caller should BUG */
1435 mlog(ML_ERROR
, "node is attempting to migrate "
1436 "lock %.*s, but marked as recovering!\n",
1437 mres
->lockname_len
, mres
->lockname
);
1439 spin_unlock(&res
->spinlock
);
1440 spin_unlock(&dlm
->spinlock
);
1441 dlm_lockres_put(res
);
1444 res
->state
|= DLM_LOCK_RES_MIGRATING
;
1446 spin_unlock(&res
->spinlock
);
1447 spin_unlock(&dlm
->spinlock
);
1449 spin_unlock(&dlm
->spinlock
);
1450 /* need to allocate, just like if it was
1451 * mastered here normally */
1452 res
= dlm_new_lockres(dlm
, mres
->lockname
, mres
->lockname_len
);
1456 /* to match the ref that we would have gotten if
1457 * dlm_lookup_lockres had succeeded */
1458 dlm_lockres_get(res
);
1460 /* mark it as recovering/migrating and hash it */
1461 if (mres
->flags
& DLM_MRES_RECOVERY
)
1462 res
->state
|= DLM_LOCK_RES_RECOVERING
;
1464 res
->state
|= DLM_LOCK_RES_MIGRATING
;
1466 spin_lock(&dlm
->spinlock
);
1467 __dlm_insert_lockres(dlm
, res
);
1468 spin_unlock(&dlm
->spinlock
);
1470 /* Add an extra ref for this lock-less lockres lest the
1471 * dlm_thread purges it before we get the chance to add
1473 dlm_lockres_get(res
);
1475 /* There are three refs that need to be put.
1477 * 2. kref_init in dlm_new_lockres()->dlm_init_lockres().
1478 * 3. dlm_lookup_lockres()
1479 * The first one is handled at the end of this function. The
1480 * other two are handled in the worker thread after locks have
1481 * been attached. Yes, we don't wait for purge time to match
1482 * kref_init. The lockres will still have atleast one ref
1483 * added because it is in the hash __dlm_insert_lockres() */
1486 /* now that the new lockres is inserted,
1487 * make it usable by other processes */
1488 spin_lock(&res
->spinlock
);
1489 res
->state
&= ~DLM_LOCK_RES_IN_PROGRESS
;
1490 spin_unlock(&res
->spinlock
);
1494 /* at this point we have allocated everything we need,
1495 * and we have a hashed lockres with an extra ref and
1496 * the proper res->state flags. */
1498 spin_lock(&res
->spinlock
);
1499 /* drop this either when master requery finds a different master
1500 * or when a lock is added by the recovery worker */
1501 dlm_lockres_grab_inflight_ref(dlm
, res
);
1502 if (mres
->master
== DLM_LOCK_RES_OWNER_UNKNOWN
) {
1503 /* migration cannot have an unknown master */
1504 BUG_ON(!(mres
->flags
& DLM_MRES_RECOVERY
));
1505 mlog(0, "recovery has passed me a lockres with an "
1506 "unknown owner.. will need to requery: "
1507 "%.*s\n", mres
->lockname_len
, mres
->lockname
);
1509 /* take a reference now to pin the lockres, drop it
1510 * when locks are added in the worker */
1511 dlm_change_lockres_owner(dlm
, res
, dlm
->node_num
);
1513 spin_unlock(&res
->spinlock
);
1515 /* queue up work for dlm_mig_lockres_worker */
1516 dlm_grab(dlm
); /* get an extra ref for the work item */
1517 memcpy(buf
, msg
->buf
, be16_to_cpu(msg
->data_len
)); /* copy the whole message */
1518 dlm_init_work_item(dlm
, item
, dlm_mig_lockres_worker
, buf
);
1519 item
->u
.ml
.lockres
= res
; /* already have a ref */
1520 item
->u
.ml
.real_master
= real_master
;
1521 item
->u
.ml
.extra_ref
= extra_refs
;
1522 spin_lock(&dlm
->work_lock
);
1523 list_add_tail(&item
->list
, &dlm
->work_list
);
1524 spin_unlock(&dlm
->work_lock
);
1525 queue_work(dlm
->dlm_worker
, &dlm
->dispatched_work
);
1528 /* One extra ref taken needs to be put here */
1530 dlm_lockres_put(res
);
1543 static void dlm_mig_lockres_worker(struct dlm_work_item
*item
, void *data
)
1545 struct dlm_ctxt
*dlm
;
1546 struct dlm_migratable_lockres
*mres
;
1548 struct dlm_lock_resource
*res
;
1553 mres
= (struct dlm_migratable_lockres
*)data
;
1555 res
= item
->u
.ml
.lockres
;
1556 real_master
= item
->u
.ml
.real_master
;
1557 extra_ref
= item
->u
.ml
.extra_ref
;
1559 if (real_master
== DLM_LOCK_RES_OWNER_UNKNOWN
) {
1560 /* this case is super-rare. only occurs if
1561 * node death happens during migration. */
1563 ret
= dlm_lockres_master_requery(dlm
, res
, &real_master
);
1565 mlog(0, "dlm_lockres_master_requery ret=%d\n",
1569 if (real_master
== DLM_LOCK_RES_OWNER_UNKNOWN
) {
1570 mlog(0, "lockres %.*s not claimed. "
1571 "this node will take it.\n",
1572 res
->lockname
.len
, res
->lockname
.name
);
1574 spin_lock(&res
->spinlock
);
1575 dlm_lockres_drop_inflight_ref(dlm
, res
);
1576 spin_unlock(&res
->spinlock
);
1577 mlog(0, "master needs to respond to sender "
1578 "that node %u still owns %.*s\n",
1579 real_master
, res
->lockname
.len
,
1580 res
->lockname
.name
);
1581 /* cannot touch this lockres */
1586 ret
= dlm_process_recovery_data(dlm
, res
, mres
);
1588 mlog(0, "dlm_process_recovery_data returned %d\n", ret
);
1590 mlog(0, "dlm_process_recovery_data succeeded\n");
1592 if ((mres
->flags
& (DLM_MRES_MIGRATION
|DLM_MRES_ALL_DONE
)) ==
1593 (DLM_MRES_MIGRATION
|DLM_MRES_ALL_DONE
)) {
1594 ret
= dlm_finish_migration(dlm
, res
, mres
->master
);
1600 /* See comment in dlm_mig_lockres_handler() */
1603 dlm_lockres_put(res
);
1604 dlm_lockres_put(res
);
1611 static int dlm_lockres_master_requery(struct dlm_ctxt
*dlm
,
1612 struct dlm_lock_resource
*res
,
1615 struct dlm_node_iter iter
;
1619 *real_master
= DLM_LOCK_RES_OWNER_UNKNOWN
;
1621 /* we only reach here if one of the two nodes in a
1622 * migration died while the migration was in progress.
1623 * at this point we need to requery the master. we
1624 * know that the new_master got as far as creating
1625 * an mle on at least one node, but we do not know
1626 * if any nodes had actually cleared the mle and set
1627 * the master to the new_master. the old master
1628 * is supposed to set the owner to UNKNOWN in the
1629 * event of a new_master death, so the only possible
1630 * responses that we can get from nodes here are
1631 * that the master is new_master, or that the master
1633 * if all nodes come back with UNKNOWN then we know
1634 * the lock needs remastering here.
1635 * if any node comes back with a valid master, check
1636 * to see if that master is the one that we are
1637 * recovering. if so, then the new_master died and
1638 * we need to remaster this lock. if not, then the
1639 * new_master survived and that node will respond to
1640 * other nodes about the owner.
1641 * if there is an owner, this node needs to dump this
1642 * lockres and alert the sender that this lockres
1644 spin_lock(&dlm
->spinlock
);
1645 dlm_node_iter_init(dlm
->domain_map
, &iter
);
1646 spin_unlock(&dlm
->spinlock
);
1648 while ((nodenum
= dlm_node_iter_next(&iter
)) >= 0) {
1649 /* do not send to self */
1650 if (nodenum
== dlm
->node_num
)
1652 ret
= dlm_do_master_requery(dlm
, res
, nodenum
, real_master
);
1655 if (!dlm_is_host_down(ret
))
1657 /* host is down, so answer for that node would be
1658 * DLM_LOCK_RES_OWNER_UNKNOWN. continue. */
1660 if (*real_master
!= DLM_LOCK_RES_OWNER_UNKNOWN
) {
1661 mlog(0, "lock master is %u\n", *real_master
);
1669 int dlm_do_master_requery(struct dlm_ctxt
*dlm
, struct dlm_lock_resource
*res
,
1670 u8 nodenum
, u8
*real_master
)
1673 struct dlm_master_requery req
;
1674 int status
= DLM_LOCK_RES_OWNER_UNKNOWN
;
1676 memset(&req
, 0, sizeof(req
));
1677 req
.node_idx
= dlm
->node_num
;
1678 req
.namelen
= res
->lockname
.len
;
1679 memcpy(req
.name
, res
->lockname
.name
, res
->lockname
.len
);
1682 ret
= o2net_send_message(DLM_MASTER_REQUERY_MSG
, dlm
->key
,
1683 &req
, sizeof(req
), nodenum
, &status
);
1685 mlog(ML_ERROR
, "Error %d when sending message %u (key "
1686 "0x%x) to node %u\n", ret
, DLM_MASTER_REQUERY_MSG
,
1688 else if (status
== -ENOMEM
) {
1694 BUG_ON(status
> DLM_LOCK_RES_OWNER_UNKNOWN
);
1695 *real_master
= (u8
) (status
& 0xff);
1696 mlog(0, "node %u responded to master requery with %u\n",
1697 nodenum
, *real_master
);
1704 /* this function cannot error, so unless the sending
1705 * or receiving of the message failed, the owner can
1707 int dlm_master_requery_handler(struct o2net_msg
*msg
, u32 len
, void *data
,
1710 struct dlm_ctxt
*dlm
= data
;
1711 struct dlm_master_requery
*req
= (struct dlm_master_requery
*)msg
->buf
;
1712 struct dlm_lock_resource
*res
= NULL
;
1714 int master
= DLM_LOCK_RES_OWNER_UNKNOWN
;
1715 u32 flags
= DLM_ASSERT_MASTER_REQUERY
;
1718 if (!dlm_grab(dlm
)) {
1719 /* since the domain has gone away on this
1720 * node, the proper response is UNKNOWN */
1724 hash
= dlm_lockid_hash(req
->name
, req
->namelen
);
1726 spin_lock(&dlm
->spinlock
);
1727 res
= __dlm_lookup_lockres(dlm
, req
->name
, req
->namelen
, hash
);
1729 spin_lock(&res
->spinlock
);
1730 master
= res
->owner
;
1731 if (master
== dlm
->node_num
) {
1732 int ret
= dlm_dispatch_assert_master(dlm
, res
,
1736 spin_unlock(&res
->spinlock
);
1737 dlm_lockres_put(res
);
1738 spin_unlock(&dlm
->spinlock
);
1740 /* sender will take care of this and retry */
1744 __dlm_lockres_grab_inflight_worker(dlm
, res
);
1745 spin_unlock(&res
->spinlock
);
1748 /* put.. incase we are not the master */
1749 spin_unlock(&res
->spinlock
);
1750 dlm_lockres_put(res
);
1753 spin_unlock(&dlm
->spinlock
);
1760 static inline struct list_head
*
1761 dlm_list_num_to_pointer(struct dlm_lock_resource
*res
, int list_num
)
1763 struct list_head
*ret
;
1764 BUG_ON(list_num
< 0);
1765 BUG_ON(list_num
> 2);
1766 ret
= &(res
->granted
);
1770 /* TODO: do ast flush business
1771 * TODO: do MIGRATING and RECOVERING spinning
1775 * NOTE about in-flight requests during migration:
1777 * Before attempting the migrate, the master has marked the lockres as
1778 * MIGRATING and then flushed all of its pending ASTS. So any in-flight
1779 * requests either got queued before the MIGRATING flag got set, in which
1780 * case the lock data will reflect the change and a return message is on
1781 * the way, or the request failed to get in before MIGRATING got set. In
1782 * this case, the caller will be told to spin and wait for the MIGRATING
1783 * flag to be dropped, then recheck the master.
1784 * This holds true for the convert, cancel and unlock cases, and since lvb
1785 * updates are tied to these same messages, it applies to lvb updates as
1786 * well. For the lock case, there is no way a lock can be on the master
1787 * queue and not be on the secondary queue since the lock is always added
1788 * locally first. This means that the new target node will never be sent
1789 * a lock that he doesn't already have on the list.
1790 * In total, this means that the local lock is correct and should not be
1791 * updated to match the one sent by the master. Any messages sent back
1792 * from the master before the MIGRATING flag will bring the lock properly
1793 * up-to-date, and the change will be ordered properly for the waiter.
1794 * We will *not* attempt to modify the lock underneath the waiter.
1797 static int dlm_process_recovery_data(struct dlm_ctxt
*dlm
,
1798 struct dlm_lock_resource
*res
,
1799 struct dlm_migratable_lockres
*mres
)
1801 struct dlm_migratable_lock
*ml
;
1802 struct list_head
*queue
, *iter
;
1803 struct list_head
*tmpq
= NULL
;
1804 struct dlm_lock
*newlock
= NULL
;
1805 struct dlm_lockstatus
*lksb
= NULL
;
1808 struct dlm_lock
*lock
;
1809 u8 from
= O2NM_MAX_NODES
;
1810 unsigned int added
= 0;
1813 mlog(0, "running %d locks for this lockres\n", mres
->num_locks
);
1814 for (i
=0; i
<mres
->num_locks
; i
++) {
1815 ml
= &(mres
->ml
[i
]);
1817 if (dlm_is_dummy_lock(dlm
, ml
, &from
)) {
1818 /* placeholder, just need to set the refmap bit */
1819 BUG_ON(mres
->num_locks
!= 1);
1820 mlog(0, "%s:%.*s: dummy lock for %u\n",
1821 dlm
->name
, mres
->lockname_len
, mres
->lockname
,
1823 spin_lock(&res
->spinlock
);
1824 dlm_lockres_set_refmap_bit(dlm
, res
, from
);
1825 spin_unlock(&res
->spinlock
);
1829 BUG_ON(ml
->highest_blocked
!= LKM_IVMODE
);
1833 queue
= dlm_list_num_to_pointer(res
, ml
->list
);
1836 /* if the lock is for the local node it needs to
1837 * be moved to the proper location within the queue.
1838 * do not allocate a new lock structure. */
1839 if (ml
->node
== dlm
->node_num
) {
1840 /* MIGRATION ONLY! */
1841 BUG_ON(!(mres
->flags
& DLM_MRES_MIGRATION
));
1844 spin_lock(&res
->spinlock
);
1845 for (j
= DLM_GRANTED_LIST
; j
<= DLM_BLOCKED_LIST
; j
++) {
1846 tmpq
= dlm_list_idx_to_ptr(res
, j
);
1847 list_for_each(iter
, tmpq
) {
1848 lock
= list_entry(iter
,
1849 struct dlm_lock
, list
);
1850 if (lock
->ml
.cookie
== ml
->cookie
)
1858 /* lock is always created locally first, and
1859 * destroyed locally last. it must be on the list */
1862 mlog(ML_ERROR
, "Could not find local lock "
1863 "with cookie %u:%llu, node %u, "
1864 "list %u, flags 0x%x, type %d, "
1865 "conv %d, highest blocked %d\n",
1866 dlm_get_lock_cookie_node(be64_to_cpu(c
)),
1867 dlm_get_lock_cookie_seq(be64_to_cpu(c
)),
1868 ml
->node
, ml
->list
, ml
->flags
, ml
->type
,
1869 ml
->convert_type
, ml
->highest_blocked
);
1870 __dlm_print_one_lock_resource(res
);
1874 if (lock
->ml
.node
!= ml
->node
) {
1875 c
= lock
->ml
.cookie
;
1876 mlog(ML_ERROR
, "Mismatched node# in lock "
1877 "cookie %u:%llu, name %.*s, node %u\n",
1878 dlm_get_lock_cookie_node(be64_to_cpu(c
)),
1879 dlm_get_lock_cookie_seq(be64_to_cpu(c
)),
1880 res
->lockname
.len
, res
->lockname
.name
,
1883 mlog(ML_ERROR
, "Migrate lock cookie %u:%llu, "
1884 "node %u, list %u, flags 0x%x, type %d, "
1885 "conv %d, highest blocked %d\n",
1886 dlm_get_lock_cookie_node(be64_to_cpu(c
)),
1887 dlm_get_lock_cookie_seq(be64_to_cpu(c
)),
1888 ml
->node
, ml
->list
, ml
->flags
, ml
->type
,
1889 ml
->convert_type
, ml
->highest_blocked
);
1890 __dlm_print_one_lock_resource(res
);
1894 if (tmpq
!= queue
) {
1896 mlog(0, "Lock cookie %u:%llu was on list %u "
1897 "instead of list %u for %.*s\n",
1898 dlm_get_lock_cookie_node(be64_to_cpu(c
)),
1899 dlm_get_lock_cookie_seq(be64_to_cpu(c
)),
1900 j
, ml
->list
, res
->lockname
.len
,
1901 res
->lockname
.name
);
1902 __dlm_print_one_lock_resource(res
);
1903 spin_unlock(&res
->spinlock
);
1907 /* see NOTE above about why we do not update
1908 * to match the master here */
1910 /* move the lock to its proper place */
1911 /* do not alter lock refcount. switching lists. */
1912 list_move_tail(&lock
->list
, queue
);
1913 spin_unlock(&res
->spinlock
);
1916 mlog(0, "just reordered a local lock!\n");
1920 /* lock is for another node. */
1921 newlock
= dlm_new_lock(ml
->type
, ml
->node
,
1922 be64_to_cpu(ml
->cookie
), NULL
);
1927 lksb
= newlock
->lksb
;
1928 dlm_lock_attach_lockres(newlock
, res
);
1930 if (ml
->convert_type
!= LKM_IVMODE
) {
1931 BUG_ON(queue
!= &res
->converting
);
1932 newlock
->ml
.convert_type
= ml
->convert_type
;
1934 lksb
->flags
|= (ml
->flags
&
1935 (DLM_LKSB_PUT_LVB
|DLM_LKSB_GET_LVB
));
1937 if (ml
->type
== LKM_NLMODE
)
1941 * If the lock is in the blocked list it can't have a valid lvb,
1944 if (ml
->list
== DLM_BLOCKED_LIST
)
1947 if (!dlm_lvb_is_empty(mres
->lvb
)) {
1948 if (lksb
->flags
& DLM_LKSB_PUT_LVB
) {
1949 /* other node was trying to update
1950 * lvb when node died. recreate the
1951 * lksb with the updated lvb. */
1952 memcpy(lksb
->lvb
, mres
->lvb
, DLM_LVB_LEN
);
1953 /* the lock resource lvb update must happen
1954 * NOW, before the spinlock is dropped.
1955 * we no longer wait for the AST to update
1957 memcpy(res
->lvb
, mres
->lvb
, DLM_LVB_LEN
);
1959 /* otherwise, the node is sending its
1960 * most recent valid lvb info */
1961 BUG_ON(ml
->type
!= LKM_EXMODE
&&
1962 ml
->type
!= LKM_PRMODE
);
1963 if (!dlm_lvb_is_empty(res
->lvb
) &&
1964 (ml
->type
== LKM_EXMODE
||
1965 memcmp(res
->lvb
, mres
->lvb
, DLM_LVB_LEN
))) {
1967 mlog(ML_ERROR
, "%s:%.*s: received bad "
1968 "lvb! type=%d\n", dlm
->name
,
1970 res
->lockname
.name
, ml
->type
);
1971 printk("lockres lvb=[");
1972 for (i
=0; i
<DLM_LVB_LEN
; i
++)
1973 printk("%02x", res
->lvb
[i
]);
1974 printk("]\nmigrated lvb=[");
1975 for (i
=0; i
<DLM_LVB_LEN
; i
++)
1976 printk("%02x", mres
->lvb
[i
]);
1978 dlm_print_one_lock_resource(res
);
1981 memcpy(res
->lvb
, mres
->lvb
, DLM_LVB_LEN
);
1987 * wrt lock queue ordering and recovery:
1988 * 1. order of locks on granted queue is
1990 * 2. order of locks on converting queue is
1991 * LOST with the node death. sorry charlie.
1992 * 3. order of locks on the blocked queue is
1994 * order of locks does not affect integrity, it
1995 * just means that a lock request may get pushed
1996 * back in line as a result of the node death.
1997 * also note that for a given node the lock order
1998 * for its secondary queue locks is preserved
1999 * relative to each other, but clearly *not*
2000 * preserved relative to locks from other nodes.
2003 spin_lock(&res
->spinlock
);
2004 list_for_each_entry(lock
, queue
, list
) {
2005 if (lock
->ml
.cookie
== ml
->cookie
) {
2006 c
= lock
->ml
.cookie
;
2007 mlog(ML_ERROR
, "%s:%.*s: %u:%llu: lock already "
2008 "exists on this lockres!\n", dlm
->name
,
2009 res
->lockname
.len
, res
->lockname
.name
,
2010 dlm_get_lock_cookie_node(be64_to_cpu(c
)),
2011 dlm_get_lock_cookie_seq(be64_to_cpu(c
)));
2013 mlog(ML_NOTICE
, "sent lock: type=%d, conv=%d, "
2014 "node=%u, cookie=%u:%llu, queue=%d\n",
2015 ml
->type
, ml
->convert_type
, ml
->node
,
2016 dlm_get_lock_cookie_node(be64_to_cpu(ml
->cookie
)),
2017 dlm_get_lock_cookie_seq(be64_to_cpu(ml
->cookie
)),
2020 __dlm_print_one_lock_resource(res
);
2026 dlm_lock_get(newlock
);
2027 if (mres
->flags
& DLM_MRES_RECOVERY
&&
2028 ml
->list
== DLM_CONVERTING_LIST
&&
2030 newlock
->ml
.convert_type
) {
2031 /* newlock is doing downconvert, add it to the
2032 * head of converting list */
2033 list_add(&newlock
->list
, queue
);
2035 list_add_tail(&newlock
->list
, queue
);
2036 mlog(0, "%s:%.*s: added lock for node %u, "
2037 "setting refmap bit\n", dlm
->name
,
2038 res
->lockname
.len
, res
->lockname
.name
, ml
->node
);
2039 dlm_lockres_set_refmap_bit(dlm
, res
, ml
->node
);
2042 spin_unlock(&res
->spinlock
);
2044 mlog(0, "done running all the locks\n");
2047 /* balance the ref taken when the work was queued */
2048 spin_lock(&res
->spinlock
);
2049 dlm_lockres_drop_inflight_ref(dlm
, res
);
2050 spin_unlock(&res
->spinlock
);
2058 void dlm_move_lockres_to_recovery_list(struct dlm_ctxt
*dlm
,
2059 struct dlm_lock_resource
*res
)
2062 struct list_head
*queue
;
2063 struct dlm_lock
*lock
, *next
;
2065 assert_spin_locked(&dlm
->spinlock
);
2066 assert_spin_locked(&res
->spinlock
);
2067 res
->state
|= DLM_LOCK_RES_RECOVERING
;
2068 if (!list_empty(&res
->recovering
)) {
2070 "Recovering res %s:%.*s, is already on recovery list!\n",
2071 dlm
->name
, res
->lockname
.len
, res
->lockname
.name
);
2072 list_del_init(&res
->recovering
);
2073 dlm_lockres_put(res
);
2075 /* We need to hold a reference while on the recovery list */
2076 dlm_lockres_get(res
);
2077 list_add_tail(&res
->recovering
, &dlm
->reco
.resources
);
2079 /* find any pending locks and put them back on proper list */
2080 for (i
=DLM_BLOCKED_LIST
; i
>=DLM_GRANTED_LIST
; i
--) {
2081 queue
= dlm_list_idx_to_ptr(res
, i
);
2082 list_for_each_entry_safe(lock
, next
, queue
, list
) {
2084 if (lock
->convert_pending
) {
2085 /* move converting lock back to granted */
2086 mlog(0, "node died with convert pending "
2087 "on %.*s. move back to granted list.\n",
2088 res
->lockname
.len
, res
->lockname
.name
);
2089 dlm_revert_pending_convert(res
, lock
);
2090 lock
->convert_pending
= 0;
2091 } else if (lock
->lock_pending
) {
2092 /* remove pending lock requests completely */
2093 BUG_ON(i
!= DLM_BLOCKED_LIST
);
2094 mlog(0, "node died with lock pending "
2095 "on %.*s. remove from blocked list and skip.\n",
2096 res
->lockname
.len
, res
->lockname
.name
);
2097 /* lock will be floating until ref in
2098 * dlmlock_remote is freed after the network
2099 * call returns. ok for it to not be on any
2100 * list since no ast can be called
2101 * (the master is dead). */
2102 dlm_revert_pending_lock(res
, lock
);
2103 lock
->lock_pending
= 0;
2104 } else if (lock
->unlock_pending
) {
2105 /* if an unlock was in progress, treat as
2106 * if this had completed successfully
2107 * before sending this lock state to the
2108 * new master. note that the dlm_unlock
2109 * call is still responsible for calling
2110 * the unlockast. that will happen after
2111 * the network call times out. for now,
2112 * just move lists to prepare the new
2113 * recovery master. */
2114 BUG_ON(i
!= DLM_GRANTED_LIST
);
2115 mlog(0, "node died with unlock pending "
2116 "on %.*s. remove from blocked list and skip.\n",
2117 res
->lockname
.len
, res
->lockname
.name
);
2118 dlm_commit_pending_unlock(res
, lock
);
2119 lock
->unlock_pending
= 0;
2120 } else if (lock
->cancel_pending
) {
2121 /* if a cancel was in progress, treat as
2122 * if this had completed successfully
2123 * before sending this lock state to the
2125 BUG_ON(i
!= DLM_CONVERTING_LIST
);
2126 mlog(0, "node died with cancel pending "
2127 "on %.*s. move back to granted list.\n",
2128 res
->lockname
.len
, res
->lockname
.name
);
2129 dlm_commit_pending_cancel(res
, lock
);
2130 lock
->cancel_pending
= 0;
2139 /* removes all recovered locks from the recovery list.
2140 * sets the res->owner to the new master.
2141 * unsets the RECOVERY flag and wakes waiters. */
2142 static void dlm_finish_local_lockres_recovery(struct dlm_ctxt
*dlm
,
2143 u8 dead_node
, u8 new_master
)
2146 struct hlist_head
*bucket
;
2147 struct dlm_lock_resource
*res
, *next
;
2149 assert_spin_locked(&dlm
->spinlock
);
2151 list_for_each_entry_safe(res
, next
, &dlm
->reco
.resources
, recovering
) {
2152 if (res
->owner
== dead_node
) {
2153 mlog(0, "%s: res %.*s, Changing owner from %u to %u\n",
2154 dlm
->name
, res
->lockname
.len
, res
->lockname
.name
,
2155 res
->owner
, new_master
);
2156 list_del_init(&res
->recovering
);
2157 spin_lock(&res
->spinlock
);
2158 /* new_master has our reference from
2159 * the lock state sent during recovery */
2160 dlm_change_lockres_owner(dlm
, res
, new_master
);
2161 res
->state
&= ~DLM_LOCK_RES_RECOVERING
;
2162 if (__dlm_lockres_has_locks(res
))
2163 __dlm_dirty_lockres(dlm
, res
);
2164 spin_unlock(&res
->spinlock
);
2166 dlm_lockres_put(res
);
2170 /* this will become unnecessary eventually, but
2171 * for now we need to run the whole hash, clear
2172 * the RECOVERING state and set the owner
2174 for (i
= 0; i
< DLM_HASH_BUCKETS
; i
++) {
2175 bucket
= dlm_lockres_hash(dlm
, i
);
2176 hlist_for_each_entry(res
, bucket
, hash_node
) {
2177 if (res
->state
& DLM_LOCK_RES_RECOVERY_WAITING
) {
2178 spin_lock(&res
->spinlock
);
2179 res
->state
&= ~DLM_LOCK_RES_RECOVERY_WAITING
;
2180 spin_unlock(&res
->spinlock
);
2184 if (!(res
->state
& DLM_LOCK_RES_RECOVERING
))
2187 if (res
->owner
!= dead_node
&&
2188 res
->owner
!= dlm
->node_num
)
2191 if (!list_empty(&res
->recovering
)) {
2192 list_del_init(&res
->recovering
);
2193 dlm_lockres_put(res
);
2196 /* new_master has our reference from
2197 * the lock state sent during recovery */
2198 mlog(0, "%s: res %.*s, Changing owner from %u to %u\n",
2199 dlm
->name
, res
->lockname
.len
, res
->lockname
.name
,
2200 res
->owner
, new_master
);
2201 spin_lock(&res
->spinlock
);
2202 dlm_change_lockres_owner(dlm
, res
, new_master
);
2203 res
->state
&= ~DLM_LOCK_RES_RECOVERING
;
2204 if (__dlm_lockres_has_locks(res
))
2205 __dlm_dirty_lockres(dlm
, res
);
2206 spin_unlock(&res
->spinlock
);
2212 static inline int dlm_lvb_needs_invalidation(struct dlm_lock
*lock
, int local
)
2215 if (lock
->ml
.type
!= LKM_EXMODE
&&
2216 lock
->ml
.type
!= LKM_PRMODE
)
2218 } else if (lock
->ml
.type
== LKM_EXMODE
)
2223 static void dlm_revalidate_lvb(struct dlm_ctxt
*dlm
,
2224 struct dlm_lock_resource
*res
, u8 dead_node
)
2226 struct list_head
*queue
;
2227 struct dlm_lock
*lock
;
2228 int blank_lvb
= 0, local
= 0;
2232 assert_spin_locked(&dlm
->spinlock
);
2233 assert_spin_locked(&res
->spinlock
);
2235 if (res
->owner
== dlm
->node_num
)
2236 /* if this node owned the lockres, and if the dead node
2237 * had an EX when he died, blank out the lvb */
2238 search_node
= dead_node
;
2240 /* if this is a secondary lockres, and we had no EX or PR
2241 * locks granted, we can no longer trust the lvb */
2242 search_node
= dlm
->node_num
;
2243 local
= 1; /* check local state for valid lvb */
2246 for (i
=DLM_GRANTED_LIST
; i
<=DLM_CONVERTING_LIST
; i
++) {
2247 queue
= dlm_list_idx_to_ptr(res
, i
);
2248 list_for_each_entry(lock
, queue
, list
) {
2249 if (lock
->ml
.node
== search_node
) {
2250 if (dlm_lvb_needs_invalidation(lock
, local
)) {
2251 /* zero the lksb lvb and lockres lvb */
2253 memset(lock
->lksb
->lvb
, 0, DLM_LVB_LEN
);
2260 mlog(0, "clearing %.*s lvb, dead node %u had EX\n",
2261 res
->lockname
.len
, res
->lockname
.name
, dead_node
);
2262 memset(res
->lvb
, 0, DLM_LVB_LEN
);
2266 static void dlm_free_dead_locks(struct dlm_ctxt
*dlm
,
2267 struct dlm_lock_resource
*res
, u8 dead_node
)
2269 struct dlm_lock
*lock
, *next
;
2270 unsigned int freed
= 0;
2272 /* this node is the lockres master:
2273 * 1) remove any stale locks for the dead node
2274 * 2) if the dead node had an EX when he died, blank out the lvb
2276 assert_spin_locked(&dlm
->spinlock
);
2277 assert_spin_locked(&res
->spinlock
);
2279 /* We do two dlm_lock_put(). One for removing from list and the other is
2280 * to force the DLM_UNLOCK_FREE_LOCK action so as to free the locks */
2282 /* TODO: check pending_asts, pending_basts here */
2283 list_for_each_entry_safe(lock
, next
, &res
->granted
, list
) {
2284 if (lock
->ml
.node
== dead_node
) {
2285 list_del_init(&lock
->list
);
2287 /* Can't schedule DLM_UNLOCK_FREE_LOCK - do manually */
2292 list_for_each_entry_safe(lock
, next
, &res
->converting
, list
) {
2293 if (lock
->ml
.node
== dead_node
) {
2294 list_del_init(&lock
->list
);
2296 /* Can't schedule DLM_UNLOCK_FREE_LOCK - do manually */
2301 list_for_each_entry_safe(lock
, next
, &res
->blocked
, list
) {
2302 if (lock
->ml
.node
== dead_node
) {
2303 list_del_init(&lock
->list
);
2305 /* Can't schedule DLM_UNLOCK_FREE_LOCK - do manually */
2312 mlog(0, "%s:%.*s: freed %u locks for dead node %u, "
2313 "dropping ref from lockres\n", dlm
->name
,
2314 res
->lockname
.len
, res
->lockname
.name
, freed
, dead_node
);
2315 if(!test_bit(dead_node
, res
->refmap
)) {
2316 mlog(ML_ERROR
, "%s:%.*s: freed %u locks for dead node %u, "
2317 "but ref was not set\n", dlm
->name
,
2318 res
->lockname
.len
, res
->lockname
.name
, freed
, dead_node
);
2319 __dlm_print_one_lock_resource(res
);
2321 res
->state
|= DLM_LOCK_RES_RECOVERY_WAITING
;
2322 dlm_lockres_clear_refmap_bit(dlm
, res
, dead_node
);
2323 } else if (test_bit(dead_node
, res
->refmap
)) {
2324 mlog(0, "%s:%.*s: dead node %u had a ref, but had "
2325 "no locks and had not purged before dying\n", dlm
->name
,
2326 res
->lockname
.len
, res
->lockname
.name
, dead_node
);
2327 dlm_lockres_clear_refmap_bit(dlm
, res
, dead_node
);
2330 /* do not kick thread yet */
2331 __dlm_dirty_lockres(dlm
, res
);
2334 /* if this node is the recovery master, and there are no
2335 * locks for a given lockres owned by this node that are in
2336 * either PR or EX mode, zero out the lvb before requesting.
2341 static void dlm_do_local_recovery_cleanup(struct dlm_ctxt
*dlm
, u8 dead_node
)
2343 struct dlm_lock_resource
*res
;
2345 struct hlist_head
*bucket
;
2346 struct dlm_lock
*lock
;
2349 /* purge any stale mles */
2350 dlm_clean_master_list(dlm
, dead_node
);
2353 * now clean up all lock resources. there are two rules:
2355 * 1) if the dead node was the master, move the lockres
2356 * to the recovering list. set the RECOVERING flag.
2357 * this lockres needs to be cleaned up before it can
2360 * 2) if this node was the master, remove all locks from
2361 * each of the lockres queues that were owned by the
2362 * dead node. once recovery finishes, the dlm thread
2363 * can be kicked again to see if any ASTs or BASTs
2364 * need to be fired as a result.
2366 for (i
= 0; i
< DLM_HASH_BUCKETS
; i
++) {
2367 bucket
= dlm_lockres_hash(dlm
, i
);
2368 hlist_for_each_entry(res
, bucket
, hash_node
) {
2369 /* always prune any $RECOVERY entries for dead nodes,
2370 * otherwise hangs can occur during later recovery */
2371 if (dlm_is_recovery_lock(res
->lockname
.name
,
2372 res
->lockname
.len
)) {
2373 spin_lock(&res
->spinlock
);
2374 list_for_each_entry(lock
, &res
->granted
, list
) {
2375 if (lock
->ml
.node
== dead_node
) {
2376 mlog(0, "AHA! there was "
2377 "a $RECOVERY lock for dead "
2379 dead_node
, dlm
->name
);
2380 list_del_init(&lock
->list
);
2383 * DLM_UNLOCK_FREE_LOCK
2389 dlm_lockres_clear_refmap_bit(dlm
, res
,
2391 spin_unlock(&res
->spinlock
);
2394 spin_lock(&res
->spinlock
);
2395 /* zero the lvb if necessary */
2396 dlm_revalidate_lvb(dlm
, res
, dead_node
);
2397 if (res
->owner
== dead_node
) {
2398 if (res
->state
& DLM_LOCK_RES_DROPPING_REF
) {
2399 mlog(0, "%s:%.*s: owned by "
2400 "dead node %u, this node was "
2401 "dropping its ref when it died. "
2402 "continue, dropping the flag.\n",
2403 dlm
->name
, res
->lockname
.len
,
2404 res
->lockname
.name
, dead_node
);
2406 res
->state
&= ~DLM_LOCK_RES_DROPPING_REF
;
2407 dlm_move_lockres_to_recovery_list(dlm
,
2409 } else if (res
->owner
== dlm
->node_num
) {
2410 dlm_free_dead_locks(dlm
, res
, dead_node
);
2411 __dlm_lockres_calc_usage(dlm
, res
);
2412 } else if (res
->owner
== DLM_LOCK_RES_OWNER_UNKNOWN
) {
2413 if (test_bit(dead_node
, res
->refmap
)) {
2414 mlog(0, "%s:%.*s: dead node %u had a ref, but had "
2415 "no locks and had not purged before dying\n",
2416 dlm
->name
, res
->lockname
.len
,
2417 res
->lockname
.name
, dead_node
);
2418 dlm_lockres_clear_refmap_bit(dlm
, res
, dead_node
);
2421 spin_unlock(&res
->spinlock
);
2427 static void __dlm_hb_node_down(struct dlm_ctxt
*dlm
, int idx
)
2429 assert_spin_locked(&dlm
->spinlock
);
2431 if (dlm
->reco
.new_master
== idx
) {
2432 mlog(0, "%s: recovery master %d just died\n",
2434 if (dlm
->reco
.state
& DLM_RECO_STATE_FINALIZE
) {
2435 /* finalize1 was reached, so it is safe to clear
2436 * the new_master and dead_node. that recovery
2438 mlog(0, "%s: dead master %d had reached "
2439 "finalize1 state, clearing\n", dlm
->name
, idx
);
2440 dlm
->reco
.state
&= ~DLM_RECO_STATE_FINALIZE
;
2441 __dlm_reset_recovery(dlm
);
2445 /* Clean up join state on node death. */
2446 if (dlm
->joining_node
== idx
) {
2447 mlog(0, "Clearing join state for node %u\n", idx
);
2448 __dlm_set_joining_node(dlm
, DLM_LOCK_RES_OWNER_UNKNOWN
);
2451 /* check to see if the node is already considered dead */
2452 if (!test_bit(idx
, dlm
->live_nodes_map
)) {
2453 mlog(0, "for domain %s, node %d is already dead. "
2454 "another node likely did recovery already.\n",
2459 /* check to see if we do not care about this node */
2460 if (!test_bit(idx
, dlm
->domain_map
)) {
2461 /* This also catches the case that we get a node down
2462 * but haven't joined the domain yet. */
2463 mlog(0, "node %u already removed from domain!\n", idx
);
2467 clear_bit(idx
, dlm
->live_nodes_map
);
2469 /* make sure local cleanup occurs before the heartbeat events */
2470 if (!test_bit(idx
, dlm
->recovery_map
))
2471 dlm_do_local_recovery_cleanup(dlm
, idx
);
2473 /* notify anything attached to the heartbeat events */
2474 dlm_hb_event_notify_attached(dlm
, idx
, 0);
2476 mlog(0, "node %u being removed from domain map!\n", idx
);
2477 clear_bit(idx
, dlm
->domain_map
);
2478 clear_bit(idx
, dlm
->exit_domain_map
);
2479 /* wake up migration waiters if a node goes down.
2480 * perhaps later we can genericize this for other waiters. */
2481 wake_up(&dlm
->migration_wq
);
2483 set_bit(idx
, dlm
->recovery_map
);
2486 void dlm_hb_node_down_cb(struct o2nm_node
*node
, int idx
, void *data
)
2488 struct dlm_ctxt
*dlm
= data
;
2494 * This will notify any dlm users that a node in our domain
2495 * went away without notifying us first.
2497 if (test_bit(idx
, dlm
->domain_map
))
2498 dlm_fire_domain_eviction_callbacks(dlm
, idx
);
2500 spin_lock(&dlm
->spinlock
);
2501 __dlm_hb_node_down(dlm
, idx
);
2502 spin_unlock(&dlm
->spinlock
);
2507 void dlm_hb_node_up_cb(struct o2nm_node
*node
, int idx
, void *data
)
2509 struct dlm_ctxt
*dlm
= data
;
2514 spin_lock(&dlm
->spinlock
);
2515 set_bit(idx
, dlm
->live_nodes_map
);
2516 /* do NOT notify mle attached to the heartbeat events.
2517 * new nodes are not interesting in mastery until joined. */
2518 spin_unlock(&dlm
->spinlock
);
2523 static void dlm_reco_ast(void *astdata
)
2525 struct dlm_ctxt
*dlm
= astdata
;
2526 mlog(0, "ast for recovery lock fired!, this=%u, dlm=%s\n",
2527 dlm
->node_num
, dlm
->name
);
2529 static void dlm_reco_bast(void *astdata
, int blocked_type
)
2531 struct dlm_ctxt
*dlm
= astdata
;
2532 mlog(0, "bast for recovery lock fired!, this=%u, dlm=%s\n",
2533 dlm
->node_num
, dlm
->name
);
2535 static void dlm_reco_unlock_ast(void *astdata
, enum dlm_status st
)
2537 mlog(0, "unlockast for recovery lock fired!\n");
2541 * dlm_pick_recovery_master will continually attempt to use
2542 * dlmlock() on the special "$RECOVERY" lockres with the
2543 * LKM_NOQUEUE flag to get an EX. every thread that enters
2544 * this function on each node racing to become the recovery
2545 * master will not stop attempting this until either:
2546 * a) this node gets the EX (and becomes the recovery master),
2547 * or b) dlm->reco.new_master gets set to some nodenum
2548 * != O2NM_INVALID_NODE_NUM (another node will do the reco).
2549 * so each time a recovery master is needed, the entire cluster
2550 * will sync at this point. if the new master dies, that will
2551 * be detected in dlm_do_recovery */
2552 static int dlm_pick_recovery_master(struct dlm_ctxt
*dlm
)
2554 enum dlm_status ret
;
2555 struct dlm_lockstatus lksb
;
2556 int status
= -EINVAL
;
2558 mlog(0, "starting recovery of %s at %lu, dead=%u, this=%u\n",
2559 dlm
->name
, jiffies
, dlm
->reco
.dead_node
, dlm
->node_num
);
2561 memset(&lksb
, 0, sizeof(lksb
));
2563 ret
= dlmlock(dlm
, LKM_EXMODE
, &lksb
, LKM_NOQUEUE
|LKM_RECOVERY
,
2564 DLM_RECOVERY_LOCK_NAME
, DLM_RECOVERY_LOCK_NAME_LEN
,
2565 dlm_reco_ast
, dlm
, dlm_reco_bast
);
2567 mlog(0, "%s: dlmlock($RECOVERY) returned %d, lksb=%d\n",
2568 dlm
->name
, ret
, lksb
.status
);
2570 if (ret
== DLM_NORMAL
) {
2571 mlog(0, "dlm=%s dlmlock says I got it (this=%u)\n",
2572 dlm
->name
, dlm
->node_num
);
2574 /* got the EX lock. check to see if another node
2575 * just became the reco master */
2576 if (dlm_reco_master_ready(dlm
)) {
2577 mlog(0, "%s: got reco EX lock, but %u will "
2578 "do the recovery\n", dlm
->name
,
2579 dlm
->reco
.new_master
);
2584 /* see if recovery was already finished elsewhere */
2585 spin_lock(&dlm
->spinlock
);
2586 if (dlm
->reco
.dead_node
== O2NM_INVALID_NODE_NUM
) {
2588 mlog(0, "%s: got reco EX lock, but "
2589 "node got recovered already\n", dlm
->name
);
2590 if (dlm
->reco
.new_master
!= O2NM_INVALID_NODE_NUM
) {
2591 mlog(ML_ERROR
, "%s: new master is %u "
2592 "but no dead node!\n",
2593 dlm
->name
, dlm
->reco
.new_master
);
2597 spin_unlock(&dlm
->spinlock
);
2600 /* if this node has actually become the recovery master,
2601 * set the master and send the messages to begin recovery */
2603 mlog(0, "%s: dead=%u, this=%u, sending "
2604 "begin_reco now\n", dlm
->name
,
2605 dlm
->reco
.dead_node
, dlm
->node_num
);
2606 status
= dlm_send_begin_reco_message(dlm
,
2607 dlm
->reco
.dead_node
);
2608 /* this always succeeds */
2611 /* set the new_master to this node */
2612 spin_lock(&dlm
->spinlock
);
2613 dlm_set_reco_master(dlm
, dlm
->node_num
);
2614 spin_unlock(&dlm
->spinlock
);
2617 /* recovery lock is a special case. ast will not get fired,
2618 * so just go ahead and unlock it. */
2619 ret
= dlmunlock(dlm
, &lksb
, 0, dlm_reco_unlock_ast
, dlm
);
2620 if (ret
== DLM_DENIED
) {
2621 mlog(0, "got DLM_DENIED, trying LKM_CANCEL\n");
2622 ret
= dlmunlock(dlm
, &lksb
, LKM_CANCEL
, dlm_reco_unlock_ast
, dlm
);
2624 if (ret
!= DLM_NORMAL
) {
2625 /* this would really suck. this could only happen
2626 * if there was a network error during the unlock
2627 * because of node death. this means the unlock
2628 * is actually "done" and the lock structure is
2629 * even freed. we can continue, but only
2630 * because this specific lock name is special. */
2631 mlog(ML_ERROR
, "dlmunlock returned %d\n", ret
);
2633 } else if (ret
== DLM_NOTQUEUED
) {
2634 mlog(0, "dlm=%s dlmlock says another node got it (this=%u)\n",
2635 dlm
->name
, dlm
->node_num
);
2636 /* another node is master. wait on
2637 * reco.new_master != O2NM_INVALID_NODE_NUM
2638 * for at most one second */
2639 wait_event_timeout(dlm
->dlm_reco_thread_wq
,
2640 dlm_reco_master_ready(dlm
),
2641 msecs_to_jiffies(1000));
2642 if (!dlm_reco_master_ready(dlm
)) {
2643 mlog(0, "%s: reco master taking awhile\n",
2647 /* another node has informed this one that it is reco master */
2648 mlog(0, "%s: reco master %u is ready to recover %u\n",
2649 dlm
->name
, dlm
->reco
.new_master
, dlm
->reco
.dead_node
);
2651 } else if (ret
== DLM_RECOVERING
) {
2652 mlog(0, "dlm=%s dlmlock says master node died (this=%u)\n",
2653 dlm
->name
, dlm
->node_num
);
2656 struct dlm_lock_resource
*res
;
2658 /* dlmlock returned something other than NOTQUEUED or NORMAL */
2659 mlog(ML_ERROR
, "%s: got %s from dlmlock($RECOVERY), "
2660 "lksb.status=%s\n", dlm
->name
, dlm_errname(ret
),
2661 dlm_errname(lksb
.status
));
2662 res
= dlm_lookup_lockres(dlm
, DLM_RECOVERY_LOCK_NAME
,
2663 DLM_RECOVERY_LOCK_NAME_LEN
);
2665 dlm_print_one_lock_resource(res
);
2666 dlm_lockres_put(res
);
2668 mlog(ML_ERROR
, "recovery lock not found\n");
2676 static int dlm_send_begin_reco_message(struct dlm_ctxt
*dlm
, u8 dead_node
)
2678 struct dlm_begin_reco br
;
2680 struct dlm_node_iter iter
;
2684 mlog(0, "%s: dead node is %u\n", dlm
->name
, dead_node
);
2686 spin_lock(&dlm
->spinlock
);
2687 dlm_node_iter_init(dlm
->domain_map
, &iter
);
2688 spin_unlock(&dlm
->spinlock
);
2690 clear_bit(dead_node
, iter
.node_map
);
2692 memset(&br
, 0, sizeof(br
));
2693 br
.node_idx
= dlm
->node_num
;
2694 br
.dead_node
= dead_node
;
2696 while ((nodenum
= dlm_node_iter_next(&iter
)) >= 0) {
2698 if (nodenum
== dead_node
) {
2699 mlog(0, "not sending begin reco to dead node "
2703 if (nodenum
== dlm
->node_num
) {
2704 mlog(0, "not sending begin reco to self\n");
2709 mlog(0, "attempting to send begin reco msg to %d\n",
2711 ret
= o2net_send_message(DLM_BEGIN_RECO_MSG
, dlm
->key
,
2712 &br
, sizeof(br
), nodenum
, &status
);
2713 /* negative status is handled ok by caller here */
2716 if (dlm_is_host_down(ret
)) {
2717 /* node is down. not involved in recovery
2718 * so just keep going */
2719 mlog(ML_NOTICE
, "%s: node %u was down when sending "
2720 "begin reco msg (%d)\n", dlm
->name
, nodenum
, ret
);
2725 * Prior to commit aad1b15310b9bcd59fa81ab8f2b1513b59553ea8,
2726 * dlm_begin_reco_handler() returned EAGAIN and not -EAGAIN.
2727 * We are handling both for compatibility reasons.
2729 if (ret
== -EAGAIN
|| ret
== EAGAIN
) {
2730 mlog(0, "%s: trying to start recovery of node "
2731 "%u, but node %u is waiting for last recovery "
2732 "to complete, backoff for a bit\n", dlm
->name
,
2733 dead_node
, nodenum
);
2738 struct dlm_lock_resource
*res
;
2740 /* this is now a serious problem, possibly ENOMEM
2741 * in the network stack. must retry */
2743 mlog(ML_ERROR
, "begin reco of dlm %s to node %u "
2744 "returned %d\n", dlm
->name
, nodenum
, ret
);
2745 res
= dlm_lookup_lockres(dlm
, DLM_RECOVERY_LOCK_NAME
,
2746 DLM_RECOVERY_LOCK_NAME_LEN
);
2748 dlm_print_one_lock_resource(res
);
2749 dlm_lockres_put(res
);
2751 mlog(ML_ERROR
, "recovery lock not found\n");
2753 /* sleep for a bit in hopes that we can avoid
2763 int dlm_begin_reco_handler(struct o2net_msg
*msg
, u32 len
, void *data
,
2766 struct dlm_ctxt
*dlm
= data
;
2767 struct dlm_begin_reco
*br
= (struct dlm_begin_reco
*)msg
->buf
;
2769 /* ok to return 0, domain has gone away */
2773 spin_lock(&dlm
->spinlock
);
2774 if (dlm
->reco
.state
& DLM_RECO_STATE_FINALIZE
) {
2775 mlog(0, "%s: node %u wants to recover node %u (%u:%u) "
2776 "but this node is in finalize state, waiting on finalize2\n",
2777 dlm
->name
, br
->node_idx
, br
->dead_node
,
2778 dlm
->reco
.dead_node
, dlm
->reco
.new_master
);
2779 spin_unlock(&dlm
->spinlock
);
2783 spin_unlock(&dlm
->spinlock
);
2785 mlog(0, "%s: node %u wants to recover node %u (%u:%u)\n",
2786 dlm
->name
, br
->node_idx
, br
->dead_node
,
2787 dlm
->reco
.dead_node
, dlm
->reco
.new_master
);
2789 dlm_fire_domain_eviction_callbacks(dlm
, br
->dead_node
);
2791 spin_lock(&dlm
->spinlock
);
2792 if (dlm
->reco
.new_master
!= O2NM_INVALID_NODE_NUM
) {
2793 if (test_bit(dlm
->reco
.new_master
, dlm
->recovery_map
)) {
2794 mlog(0, "%s: new_master %u died, changing "
2795 "to %u\n", dlm
->name
, dlm
->reco
.new_master
,
2798 mlog(0, "%s: new_master %u NOT DEAD, changing "
2799 "to %u\n", dlm
->name
, dlm
->reco
.new_master
,
2801 /* may not have seen the new master as dead yet */
2804 if (dlm
->reco
.dead_node
!= O2NM_INVALID_NODE_NUM
) {
2805 mlog(ML_NOTICE
, "%s: dead_node previously set to %u, "
2806 "node %u changing it to %u\n", dlm
->name
,
2807 dlm
->reco
.dead_node
, br
->node_idx
, br
->dead_node
);
2809 dlm_set_reco_master(dlm
, br
->node_idx
);
2810 dlm_set_reco_dead_node(dlm
, br
->dead_node
);
2811 if (!test_bit(br
->dead_node
, dlm
->recovery_map
)) {
2812 mlog(0, "recovery master %u sees %u as dead, but this "
2813 "node has not yet. marking %u as dead\n",
2814 br
->node_idx
, br
->dead_node
, br
->dead_node
);
2815 if (!test_bit(br
->dead_node
, dlm
->domain_map
) ||
2816 !test_bit(br
->dead_node
, dlm
->live_nodes_map
))
2817 mlog(0, "%u not in domain/live_nodes map "
2818 "so setting it in reco map manually\n",
2820 /* force the recovery cleanup in __dlm_hb_node_down
2821 * both of these will be cleared in a moment */
2822 set_bit(br
->dead_node
, dlm
->domain_map
);
2823 set_bit(br
->dead_node
, dlm
->live_nodes_map
);
2824 __dlm_hb_node_down(dlm
, br
->dead_node
);
2826 spin_unlock(&dlm
->spinlock
);
2828 dlm_kick_recovery_thread(dlm
);
2830 mlog(0, "%s: recovery started by node %u, for %u (%u:%u)\n",
2831 dlm
->name
, br
->node_idx
, br
->dead_node
,
2832 dlm
->reco
.dead_node
, dlm
->reco
.new_master
);
2838 #define DLM_FINALIZE_STAGE2 0x01
2839 static int dlm_send_finalize_reco_message(struct dlm_ctxt
*dlm
)
2842 struct dlm_finalize_reco fr
;
2843 struct dlm_node_iter iter
;
2848 mlog(0, "finishing recovery for node %s:%u, "
2849 "stage %d\n", dlm
->name
, dlm
->reco
.dead_node
, stage
);
2851 spin_lock(&dlm
->spinlock
);
2852 dlm_node_iter_init(dlm
->domain_map
, &iter
);
2853 spin_unlock(&dlm
->spinlock
);
2856 memset(&fr
, 0, sizeof(fr
));
2857 fr
.node_idx
= dlm
->node_num
;
2858 fr
.dead_node
= dlm
->reco
.dead_node
;
2860 fr
.flags
|= DLM_FINALIZE_STAGE2
;
2862 while ((nodenum
= dlm_node_iter_next(&iter
)) >= 0) {
2863 if (nodenum
== dlm
->node_num
)
2865 ret
= o2net_send_message(DLM_FINALIZE_RECO_MSG
, dlm
->key
,
2866 &fr
, sizeof(fr
), nodenum
, &status
);
2870 mlog(ML_ERROR
, "Error %d when sending message %u (key "
2871 "0x%x) to node %u\n", ret
, DLM_FINALIZE_RECO_MSG
,
2873 if (dlm_is_host_down(ret
)) {
2874 /* this has no effect on this recovery
2875 * session, so set the status to zero to
2876 * finish out the last recovery */
2877 mlog(ML_ERROR
, "node %u went down after this "
2878 "node finished recovery.\n", nodenum
);
2886 /* reset the node_iter back to the top and send finalize2 */
2895 int dlm_finalize_reco_handler(struct o2net_msg
*msg
, u32 len
, void *data
,
2898 struct dlm_ctxt
*dlm
= data
;
2899 struct dlm_finalize_reco
*fr
= (struct dlm_finalize_reco
*)msg
->buf
;
2902 /* ok to return 0, domain has gone away */
2906 if (fr
->flags
& DLM_FINALIZE_STAGE2
)
2909 mlog(0, "%s: node %u finalizing recovery stage%d of "
2910 "node %u (%u:%u)\n", dlm
->name
, fr
->node_idx
, stage
,
2911 fr
->dead_node
, dlm
->reco
.dead_node
, dlm
->reco
.new_master
);
2913 spin_lock(&dlm
->spinlock
);
2915 if (dlm
->reco
.new_master
!= fr
->node_idx
) {
2916 mlog(ML_ERROR
, "node %u sent recovery finalize msg, but node "
2917 "%u is supposed to be the new master, dead=%u\n",
2918 fr
->node_idx
, dlm
->reco
.new_master
, fr
->dead_node
);
2921 if (dlm
->reco
.dead_node
!= fr
->dead_node
) {
2922 mlog(ML_ERROR
, "node %u sent recovery finalize msg for dead "
2923 "node %u, but node %u is supposed to be dead\n",
2924 fr
->node_idx
, fr
->dead_node
, dlm
->reco
.dead_node
);
2930 dlm_finish_local_lockres_recovery(dlm
, fr
->dead_node
, fr
->node_idx
);
2931 if (dlm
->reco
.state
& DLM_RECO_STATE_FINALIZE
) {
2932 mlog(ML_ERROR
, "%s: received finalize1 from "
2933 "new master %u for dead node %u, but "
2934 "this node has already received it!\n",
2935 dlm
->name
, fr
->node_idx
, fr
->dead_node
);
2936 dlm_print_reco_node_status(dlm
);
2939 dlm
->reco
.state
|= DLM_RECO_STATE_FINALIZE
;
2940 spin_unlock(&dlm
->spinlock
);
2943 if (!(dlm
->reco
.state
& DLM_RECO_STATE_FINALIZE
)) {
2944 mlog(ML_ERROR
, "%s: received finalize2 from "
2945 "new master %u for dead node %u, but "
2946 "this node did not have finalize1!\n",
2947 dlm
->name
, fr
->node_idx
, fr
->dead_node
);
2948 dlm_print_reco_node_status(dlm
);
2951 dlm
->reco
.state
&= ~DLM_RECO_STATE_FINALIZE
;
2952 __dlm_reset_recovery(dlm
);
2953 spin_unlock(&dlm
->spinlock
);
2954 dlm_kick_recovery_thread(dlm
);
2960 mlog(0, "%s: recovery done, reco master was %u, dead now %u, master now %u\n",
2961 dlm
->name
, fr
->node_idx
, dlm
->reco
.dead_node
, dlm
->reco
.new_master
);