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
,
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
);
1076 spin_unlock(&res
->spinlock
);
1080 if (res
->owner
== dead_node
) {
1081 mlog(0, "found lockres owned by dead node while "
1082 "doing recovery for node %u. sending it.\n",
1084 list_move_tail(&res
->recovering
, list
);
1085 } else if (res
->owner
== DLM_LOCK_RES_OWNER_UNKNOWN
) {
1086 mlog(0, "found UNKNOWN owner while doing recovery "
1087 "for node %u. sending it.\n", dead_node
);
1088 list_move_tail(&res
->recovering
, list
);
1091 spin_unlock(&dlm
->spinlock
);
1094 static inline int dlm_num_locks_in_lockres(struct dlm_lock_resource
*res
)
1096 int total_locks
= 0;
1097 struct list_head
*iter
, *queue
= &res
->granted
;
1100 for (i
=0; i
<3; i
++) {
1101 list_for_each(iter
, queue
)
1109 static int dlm_send_mig_lockres_msg(struct dlm_ctxt
*dlm
,
1110 struct dlm_migratable_lockres
*mres
,
1112 struct dlm_lock_resource
*res
,
1115 u64 mig_cookie
= be64_to_cpu(mres
->mig_cookie
);
1116 int mres_total_locks
= be32_to_cpu(mres
->total_locks
);
1117 int sz
, ret
= 0, status
= 0;
1118 u8 orig_flags
= mres
->flags
,
1119 orig_master
= mres
->master
;
1121 BUG_ON(mres
->num_locks
> DLM_MAX_MIGRATABLE_LOCKS
);
1122 if (!mres
->num_locks
)
1125 sz
= sizeof(struct dlm_migratable_lockres
) +
1126 (mres
->num_locks
* sizeof(struct dlm_migratable_lock
));
1128 /* add an all-done flag if we reached the last lock */
1129 orig_flags
= mres
->flags
;
1130 BUG_ON(total_locks
> mres_total_locks
);
1131 if (total_locks
== mres_total_locks
)
1132 mres
->flags
|= DLM_MRES_ALL_DONE
;
1134 mlog(0, "%s:%.*s: sending mig lockres (%s) to %u\n",
1135 dlm
->name
, res
->lockname
.len
, res
->lockname
.name
,
1136 orig_flags
& DLM_MRES_MIGRATION
? "migration" : "recovery",
1140 ret
= o2net_send_message(DLM_MIG_LOCKRES_MSG
, dlm
->key
, mres
,
1141 sz
, send_to
, &status
);
1143 /* XXX: negative status is not handled.
1144 * this will end up killing this node. */
1145 mlog(ML_ERROR
, "%s: res %.*s, Error %d send MIG_LOCKRES to "
1146 "node %u (%s)\n", dlm
->name
, mres
->lockname_len
,
1147 mres
->lockname
, ret
, send_to
,
1148 (orig_flags
& DLM_MRES_MIGRATION
?
1149 "migration" : "recovery"));
1151 /* might get an -ENOMEM back here */
1156 if (ret
== -EFAULT
) {
1157 mlog(ML_ERROR
, "node %u told me to kill "
1158 "myself!\n", send_to
);
1164 /* zero and reinit the message buffer */
1165 dlm_init_migratable_lockres(mres
, res
->lockname
.name
,
1166 res
->lockname
.len
, mres_total_locks
,
1167 mig_cookie
, orig_flags
, orig_master
);
1171 static void dlm_init_migratable_lockres(struct dlm_migratable_lockres
*mres
,
1172 const char *lockname
, int namelen
,
1173 int total_locks
, u64 cookie
,
1174 u8 flags
, u8 master
)
1176 /* mres here is one full page */
1178 mres
->lockname_len
= namelen
;
1179 memcpy(mres
->lockname
, lockname
, namelen
);
1180 mres
->num_locks
= 0;
1181 mres
->total_locks
= cpu_to_be32(total_locks
);
1182 mres
->mig_cookie
= cpu_to_be64(cookie
);
1183 mres
->flags
= flags
;
1184 mres
->master
= master
;
1187 static void dlm_prepare_lvb_for_migration(struct dlm_lock
*lock
,
1188 struct dlm_migratable_lockres
*mres
,
1194 /* Ignore lvb in all locks in the blocked list */
1195 if (queue
== DLM_BLOCKED_LIST
)
1198 /* Only consider lvbs in locks with granted EX or PR lock levels */
1199 if (lock
->ml
.type
!= LKM_EXMODE
&& lock
->ml
.type
!= LKM_PRMODE
)
1202 if (dlm_lvb_is_empty(mres
->lvb
)) {
1203 memcpy(mres
->lvb
, lock
->lksb
->lvb
, DLM_LVB_LEN
);
1207 /* Ensure the lvb copied for migration matches in other valid locks */
1208 if (!memcmp(mres
->lvb
, lock
->lksb
->lvb
, DLM_LVB_LEN
))
1211 mlog(ML_ERROR
, "Mismatched lvb in lock cookie=%u:%llu, name=%.*s, "
1213 dlm_get_lock_cookie_node(be64_to_cpu(lock
->ml
.cookie
)),
1214 dlm_get_lock_cookie_seq(be64_to_cpu(lock
->ml
.cookie
)),
1215 lock
->lockres
->lockname
.len
, lock
->lockres
->lockname
.name
,
1217 dlm_print_one_lock_resource(lock
->lockres
);
1221 /* returns 1 if this lock fills the network structure,
1223 static int dlm_add_lock_to_array(struct dlm_lock
*lock
,
1224 struct dlm_migratable_lockres
*mres
, int queue
)
1226 struct dlm_migratable_lock
*ml
;
1227 int lock_num
= mres
->num_locks
;
1229 ml
= &(mres
->ml
[lock_num
]);
1230 ml
->cookie
= lock
->ml
.cookie
;
1231 ml
->type
= lock
->ml
.type
;
1232 ml
->convert_type
= lock
->ml
.convert_type
;
1233 ml
->highest_blocked
= lock
->ml
.highest_blocked
;
1236 ml
->flags
= lock
->lksb
->flags
;
1237 dlm_prepare_lvb_for_migration(lock
, mres
, queue
);
1239 ml
->node
= lock
->ml
.node
;
1241 /* we reached the max, send this network message */
1242 if (mres
->num_locks
== DLM_MAX_MIGRATABLE_LOCKS
)
1247 static void dlm_add_dummy_lock(struct dlm_ctxt
*dlm
,
1248 struct dlm_migratable_lockres
*mres
)
1250 struct dlm_lock dummy
;
1251 memset(&dummy
, 0, sizeof(dummy
));
1252 dummy
.ml
.cookie
= 0;
1253 dummy
.ml
.type
= LKM_IVMODE
;
1254 dummy
.ml
.convert_type
= LKM_IVMODE
;
1255 dummy
.ml
.highest_blocked
= LKM_IVMODE
;
1257 dummy
.ml
.node
= dlm
->node_num
;
1258 dlm_add_lock_to_array(&dummy
, mres
, DLM_BLOCKED_LIST
);
1261 static inline int dlm_is_dummy_lock(struct dlm_ctxt
*dlm
,
1262 struct dlm_migratable_lock
*ml
,
1265 if (unlikely(ml
->cookie
== 0 &&
1266 ml
->type
== LKM_IVMODE
&&
1267 ml
->convert_type
== LKM_IVMODE
&&
1268 ml
->highest_blocked
== LKM_IVMODE
&&
1269 ml
->list
== DLM_BLOCKED_LIST
)) {
1270 *nodenum
= ml
->node
;
1276 int dlm_send_one_lockres(struct dlm_ctxt
*dlm
, struct dlm_lock_resource
*res
,
1277 struct dlm_migratable_lockres
*mres
,
1278 u8 send_to
, u8 flags
)
1280 struct list_head
*queue
;
1283 struct dlm_lock
*lock
;
1286 BUG_ON(!(flags
& (DLM_MRES_RECOVERY
|DLM_MRES_MIGRATION
)));
1288 mlog(0, "sending to %u\n", send_to
);
1290 total_locks
= dlm_num_locks_in_lockres(res
);
1291 if (total_locks
> DLM_MAX_MIGRATABLE_LOCKS
) {
1292 /* rare, but possible */
1293 mlog(0, "argh. lockres has %d locks. this will "
1294 "require more than one network packet to "
1295 "migrate\n", total_locks
);
1296 mig_cookie
= dlm_get_next_mig_cookie();
1299 dlm_init_migratable_lockres(mres
, res
->lockname
.name
,
1300 res
->lockname
.len
, total_locks
,
1301 mig_cookie
, flags
, res
->owner
);
1304 for (i
=DLM_GRANTED_LIST
; i
<=DLM_BLOCKED_LIST
; i
++) {
1305 queue
= dlm_list_idx_to_ptr(res
, i
);
1306 list_for_each_entry(lock
, queue
, list
) {
1307 /* add another lock. */
1309 if (!dlm_add_lock_to_array(lock
, mres
, i
))
1312 /* this filled the lock message,
1313 * we must send it immediately. */
1314 ret
= dlm_send_mig_lockres_msg(dlm
, mres
, send_to
,
1320 if (total_locks
== 0) {
1321 /* send a dummy lock to indicate a mastery reference only */
1322 mlog(0, "%s:%.*s: sending dummy lock to %u, %s\n",
1323 dlm
->name
, res
->lockname
.len
, res
->lockname
.name
,
1324 send_to
, flags
& DLM_MRES_RECOVERY
? "recovery" :
1326 dlm_add_dummy_lock(dlm
, mres
);
1328 /* flush any remaining locks */
1329 ret
= dlm_send_mig_lockres_msg(dlm
, mres
, send_to
, res
, total_locks
);
1335 mlog(ML_ERROR
, "%s: dlm_send_mig_lockres_msg returned %d\n",
1337 if (!dlm_is_host_down(ret
))
1339 mlog(0, "%s: node %u went down while sending %s "
1340 "lockres %.*s\n", dlm
->name
, send_to
,
1341 flags
& DLM_MRES_RECOVERY
? "recovery" : "migration",
1342 res
->lockname
.len
, res
->lockname
.name
);
1349 * this message will contain no more than one page worth of
1350 * recovery data, and it will work on only one lockres.
1351 * there may be many locks in this page, and we may need to wait
1352 * for additional packets to complete all the locks (rare, but
1356 * NOTE: the allocation error cases here are scary
1357 * we really cannot afford to fail an alloc in recovery
1358 * do we spin? returning an error only delays the problem really
1361 int dlm_mig_lockres_handler(struct o2net_msg
*msg
, u32 len
, void *data
,
1364 struct dlm_ctxt
*dlm
= data
;
1365 struct dlm_migratable_lockres
*mres
=
1366 (struct dlm_migratable_lockres
*)msg
->buf
;
1371 struct dlm_work_item
*item
= NULL
;
1372 struct dlm_lock_resource
*res
= NULL
;
1377 BUG_ON(!(mres
->flags
& (DLM_MRES_RECOVERY
|DLM_MRES_MIGRATION
)));
1379 real_master
= mres
->master
;
1380 if (real_master
== DLM_LOCK_RES_OWNER_UNKNOWN
) {
1381 /* cannot migrate a lockres with no master */
1382 BUG_ON(!(mres
->flags
& DLM_MRES_RECOVERY
));
1385 mlog(0, "%s message received from node %u\n",
1386 (mres
->flags
& DLM_MRES_RECOVERY
) ?
1387 "recovery" : "migration", mres
->master
);
1388 if (mres
->flags
& DLM_MRES_ALL_DONE
)
1389 mlog(0, "all done flag. all lockres data received!\n");
1392 buf
= kmalloc(be16_to_cpu(msg
->data_len
), GFP_NOFS
);
1393 item
= kzalloc(sizeof(*item
), GFP_NOFS
);
1397 /* lookup the lock to see if we have a secondary queue for this
1398 * already... just add the locks in and this will have its owner
1399 * and RECOVERY flag changed when it completes. */
1400 res
= dlm_lookup_lockres(dlm
, mres
->lockname
, mres
->lockname_len
);
1402 /* this will get a ref on res */
1403 /* mark it as recovering/migrating and hash it */
1404 spin_lock(&res
->spinlock
);
1405 if (mres
->flags
& DLM_MRES_RECOVERY
) {
1406 res
->state
|= DLM_LOCK_RES_RECOVERING
;
1408 if (res
->state
& DLM_LOCK_RES_MIGRATING
) {
1409 /* this is at least the second
1410 * lockres message */
1411 mlog(0, "lock %.*s is already migrating\n",
1414 } else if (res
->state
& DLM_LOCK_RES_RECOVERING
) {
1415 /* caller should BUG */
1416 mlog(ML_ERROR
, "node is attempting to migrate "
1417 "lock %.*s, but marked as recovering!\n",
1418 mres
->lockname_len
, mres
->lockname
);
1420 spin_unlock(&res
->spinlock
);
1421 dlm_lockres_put(res
);
1424 res
->state
|= DLM_LOCK_RES_MIGRATING
;
1426 spin_unlock(&res
->spinlock
);
1428 /* need to allocate, just like if it was
1429 * mastered here normally */
1430 res
= dlm_new_lockres(dlm
, mres
->lockname
, mres
->lockname_len
);
1434 /* to match the ref that we would have gotten if
1435 * dlm_lookup_lockres had succeeded */
1436 dlm_lockres_get(res
);
1438 /* mark it as recovering/migrating and hash it */
1439 if (mres
->flags
& DLM_MRES_RECOVERY
)
1440 res
->state
|= DLM_LOCK_RES_RECOVERING
;
1442 res
->state
|= DLM_LOCK_RES_MIGRATING
;
1444 spin_lock(&dlm
->spinlock
);
1445 __dlm_insert_lockres(dlm
, res
);
1446 spin_unlock(&dlm
->spinlock
);
1448 /* Add an extra ref for this lock-less lockres lest the
1449 * dlm_thread purges it before we get the chance to add
1451 dlm_lockres_get(res
);
1453 /* There are three refs that need to be put.
1455 * 2. kref_init in dlm_new_lockres()->dlm_init_lockres().
1456 * 3. dlm_lookup_lockres()
1457 * The first one is handled at the end of this function. The
1458 * other two are handled in the worker thread after locks have
1459 * been attached. Yes, we don't wait for purge time to match
1460 * kref_init. The lockres will still have atleast one ref
1461 * added because it is in the hash __dlm_insert_lockres() */
1464 /* now that the new lockres is inserted,
1465 * make it usable by other processes */
1466 spin_lock(&res
->spinlock
);
1467 res
->state
&= ~DLM_LOCK_RES_IN_PROGRESS
;
1468 spin_unlock(&res
->spinlock
);
1472 /* at this point we have allocated everything we need,
1473 * and we have a hashed lockres with an extra ref and
1474 * the proper res->state flags. */
1476 spin_lock(&res
->spinlock
);
1477 /* drop this either when master requery finds a different master
1478 * or when a lock is added by the recovery worker */
1479 dlm_lockres_grab_inflight_ref(dlm
, res
);
1480 if (mres
->master
== DLM_LOCK_RES_OWNER_UNKNOWN
) {
1481 /* migration cannot have an unknown master */
1482 BUG_ON(!(mres
->flags
& DLM_MRES_RECOVERY
));
1483 mlog(0, "recovery has passed me a lockres with an "
1484 "unknown owner.. will need to requery: "
1485 "%.*s\n", mres
->lockname_len
, mres
->lockname
);
1487 /* take a reference now to pin the lockres, drop it
1488 * when locks are added in the worker */
1489 dlm_change_lockres_owner(dlm
, res
, dlm
->node_num
);
1491 spin_unlock(&res
->spinlock
);
1493 /* queue up work for dlm_mig_lockres_worker */
1494 dlm_grab(dlm
); /* get an extra ref for the work item */
1495 memcpy(buf
, msg
->buf
, be16_to_cpu(msg
->data_len
)); /* copy the whole message */
1496 dlm_init_work_item(dlm
, item
, dlm_mig_lockres_worker
, buf
);
1497 item
->u
.ml
.lockres
= res
; /* already have a ref */
1498 item
->u
.ml
.real_master
= real_master
;
1499 item
->u
.ml
.extra_ref
= extra_refs
;
1500 spin_lock(&dlm
->work_lock
);
1501 list_add_tail(&item
->list
, &dlm
->work_list
);
1502 spin_unlock(&dlm
->work_lock
);
1503 queue_work(dlm
->dlm_worker
, &dlm
->dispatched_work
);
1506 /* One extra ref taken needs to be put here */
1508 dlm_lockres_put(res
);
1521 static void dlm_mig_lockres_worker(struct dlm_work_item
*item
, void *data
)
1523 struct dlm_ctxt
*dlm
;
1524 struct dlm_migratable_lockres
*mres
;
1526 struct dlm_lock_resource
*res
;
1531 mres
= (struct dlm_migratable_lockres
*)data
;
1533 res
= item
->u
.ml
.lockres
;
1534 real_master
= item
->u
.ml
.real_master
;
1535 extra_ref
= item
->u
.ml
.extra_ref
;
1537 if (real_master
== DLM_LOCK_RES_OWNER_UNKNOWN
) {
1538 /* this case is super-rare. only occurs if
1539 * node death happens during migration. */
1541 ret
= dlm_lockres_master_requery(dlm
, res
, &real_master
);
1543 mlog(0, "dlm_lockres_master_requery ret=%d\n",
1547 if (real_master
== DLM_LOCK_RES_OWNER_UNKNOWN
) {
1548 mlog(0, "lockres %.*s not claimed. "
1549 "this node will take it.\n",
1550 res
->lockname
.len
, res
->lockname
.name
);
1552 spin_lock(&res
->spinlock
);
1553 dlm_lockres_drop_inflight_ref(dlm
, res
);
1554 spin_unlock(&res
->spinlock
);
1555 mlog(0, "master needs to respond to sender "
1556 "that node %u still owns %.*s\n",
1557 real_master
, res
->lockname
.len
,
1558 res
->lockname
.name
);
1559 /* cannot touch this lockres */
1564 ret
= dlm_process_recovery_data(dlm
, res
, mres
);
1566 mlog(0, "dlm_process_recovery_data returned %d\n", ret
);
1568 mlog(0, "dlm_process_recovery_data succeeded\n");
1570 if ((mres
->flags
& (DLM_MRES_MIGRATION
|DLM_MRES_ALL_DONE
)) ==
1571 (DLM_MRES_MIGRATION
|DLM_MRES_ALL_DONE
)) {
1572 ret
= dlm_finish_migration(dlm
, res
, mres
->master
);
1578 /* See comment in dlm_mig_lockres_handler() */
1581 dlm_lockres_put(res
);
1582 dlm_lockres_put(res
);
1589 static int dlm_lockres_master_requery(struct dlm_ctxt
*dlm
,
1590 struct dlm_lock_resource
*res
,
1593 struct dlm_node_iter iter
;
1597 *real_master
= DLM_LOCK_RES_OWNER_UNKNOWN
;
1599 /* we only reach here if one of the two nodes in a
1600 * migration died while the migration was in progress.
1601 * at this point we need to requery the master. we
1602 * know that the new_master got as far as creating
1603 * an mle on at least one node, but we do not know
1604 * if any nodes had actually cleared the mle and set
1605 * the master to the new_master. the old master
1606 * is supposed to set the owner to UNKNOWN in the
1607 * event of a new_master death, so the only possible
1608 * responses that we can get from nodes here are
1609 * that the master is new_master, or that the master
1611 * if all nodes come back with UNKNOWN then we know
1612 * the lock needs remastering here.
1613 * if any node comes back with a valid master, check
1614 * to see if that master is the one that we are
1615 * recovering. if so, then the new_master died and
1616 * we need to remaster this lock. if not, then the
1617 * new_master survived and that node will respond to
1618 * other nodes about the owner.
1619 * if there is an owner, this node needs to dump this
1620 * lockres and alert the sender that this lockres
1622 spin_lock(&dlm
->spinlock
);
1623 dlm_node_iter_init(dlm
->domain_map
, &iter
);
1624 spin_unlock(&dlm
->spinlock
);
1626 while ((nodenum
= dlm_node_iter_next(&iter
)) >= 0) {
1627 /* do not send to self */
1628 if (nodenum
== dlm
->node_num
)
1630 ret
= dlm_do_master_requery(dlm
, res
, nodenum
, real_master
);
1633 if (!dlm_is_host_down(ret
))
1635 /* host is down, so answer for that node would be
1636 * DLM_LOCK_RES_OWNER_UNKNOWN. continue. */
1638 if (*real_master
!= DLM_LOCK_RES_OWNER_UNKNOWN
) {
1639 mlog(0, "lock master is %u\n", *real_master
);
1647 int dlm_do_master_requery(struct dlm_ctxt
*dlm
, struct dlm_lock_resource
*res
,
1648 u8 nodenum
, u8
*real_master
)
1651 struct dlm_master_requery req
;
1652 int status
= DLM_LOCK_RES_OWNER_UNKNOWN
;
1654 memset(&req
, 0, sizeof(req
));
1655 req
.node_idx
= dlm
->node_num
;
1656 req
.namelen
= res
->lockname
.len
;
1657 memcpy(req
.name
, res
->lockname
.name
, res
->lockname
.len
);
1659 ret
= o2net_send_message(DLM_MASTER_REQUERY_MSG
, dlm
->key
,
1660 &req
, sizeof(req
), nodenum
, &status
);
1661 /* XXX: negative status not handled properly here. */
1663 mlog(ML_ERROR
, "Error %d when sending message %u (key "
1664 "0x%x) to node %u\n", ret
, DLM_MASTER_REQUERY_MSG
,
1668 BUG_ON(status
> DLM_LOCK_RES_OWNER_UNKNOWN
);
1669 *real_master
= (u8
) (status
& 0xff);
1670 mlog(0, "node %u responded to master requery with %u\n",
1671 nodenum
, *real_master
);
1678 /* this function cannot error, so unless the sending
1679 * or receiving of the message failed, the owner can
1681 int dlm_master_requery_handler(struct o2net_msg
*msg
, u32 len
, void *data
,
1684 struct dlm_ctxt
*dlm
= data
;
1685 struct dlm_master_requery
*req
= (struct dlm_master_requery
*)msg
->buf
;
1686 struct dlm_lock_resource
*res
= NULL
;
1688 int master
= DLM_LOCK_RES_OWNER_UNKNOWN
;
1689 u32 flags
= DLM_ASSERT_MASTER_REQUERY
;
1691 if (!dlm_grab(dlm
)) {
1692 /* since the domain has gone away on this
1693 * node, the proper response is UNKNOWN */
1697 hash
= dlm_lockid_hash(req
->name
, req
->namelen
);
1699 spin_lock(&dlm
->spinlock
);
1700 res
= __dlm_lookup_lockres(dlm
, req
->name
, req
->namelen
, hash
);
1702 spin_lock(&res
->spinlock
);
1703 master
= res
->owner
;
1704 if (master
== dlm
->node_num
) {
1705 int ret
= dlm_dispatch_assert_master(dlm
, res
,
1708 mlog_errno(-ENOMEM
);
1712 } else /* put.. incase we are not the master */
1713 dlm_lockres_put(res
);
1714 spin_unlock(&res
->spinlock
);
1716 spin_unlock(&dlm
->spinlock
);
1722 static inline struct list_head
*
1723 dlm_list_num_to_pointer(struct dlm_lock_resource
*res
, int list_num
)
1725 struct list_head
*ret
;
1726 BUG_ON(list_num
< 0);
1727 BUG_ON(list_num
> 2);
1728 ret
= &(res
->granted
);
1732 /* TODO: do ast flush business
1733 * TODO: do MIGRATING and RECOVERING spinning
1737 * NOTE about in-flight requests during migration:
1739 * Before attempting the migrate, the master has marked the lockres as
1740 * MIGRATING and then flushed all of its pending ASTS. So any in-flight
1741 * requests either got queued before the MIGRATING flag got set, in which
1742 * case the lock data will reflect the change and a return message is on
1743 * the way, or the request failed to get in before MIGRATING got set. In
1744 * this case, the caller will be told to spin and wait for the MIGRATING
1745 * flag to be dropped, then recheck the master.
1746 * This holds true for the convert, cancel and unlock cases, and since lvb
1747 * updates are tied to these same messages, it applies to lvb updates as
1748 * well. For the lock case, there is no way a lock can be on the master
1749 * queue and not be on the secondary queue since the lock is always added
1750 * locally first. This means that the new target node will never be sent
1751 * a lock that he doesn't already have on the list.
1752 * In total, this means that the local lock is correct and should not be
1753 * updated to match the one sent by the master. Any messages sent back
1754 * from the master before the MIGRATING flag will bring the lock properly
1755 * up-to-date, and the change will be ordered properly for the waiter.
1756 * We will *not* attempt to modify the lock underneath the waiter.
1759 static int dlm_process_recovery_data(struct dlm_ctxt
*dlm
,
1760 struct dlm_lock_resource
*res
,
1761 struct dlm_migratable_lockres
*mres
)
1763 struct dlm_migratable_lock
*ml
;
1764 struct list_head
*queue
, *iter
;
1765 struct list_head
*tmpq
= NULL
;
1766 struct dlm_lock
*newlock
= NULL
;
1767 struct dlm_lockstatus
*lksb
= NULL
;
1770 struct dlm_lock
*lock
;
1771 u8 from
= O2NM_MAX_NODES
;
1772 unsigned int added
= 0;
1775 mlog(0, "running %d locks for this lockres\n", mres
->num_locks
);
1776 for (i
=0; i
<mres
->num_locks
; i
++) {
1777 ml
= &(mres
->ml
[i
]);
1779 if (dlm_is_dummy_lock(dlm
, ml
, &from
)) {
1780 /* placeholder, just need to set the refmap bit */
1781 BUG_ON(mres
->num_locks
!= 1);
1782 mlog(0, "%s:%.*s: dummy lock for %u\n",
1783 dlm
->name
, mres
->lockname_len
, mres
->lockname
,
1785 spin_lock(&res
->spinlock
);
1786 dlm_lockres_set_refmap_bit(dlm
, res
, from
);
1787 spin_unlock(&res
->spinlock
);
1791 BUG_ON(ml
->highest_blocked
!= LKM_IVMODE
);
1795 queue
= dlm_list_num_to_pointer(res
, ml
->list
);
1798 /* if the lock is for the local node it needs to
1799 * be moved to the proper location within the queue.
1800 * do not allocate a new lock structure. */
1801 if (ml
->node
== dlm
->node_num
) {
1802 /* MIGRATION ONLY! */
1803 BUG_ON(!(mres
->flags
& DLM_MRES_MIGRATION
));
1806 spin_lock(&res
->spinlock
);
1807 for (j
= DLM_GRANTED_LIST
; j
<= DLM_BLOCKED_LIST
; j
++) {
1808 tmpq
= dlm_list_idx_to_ptr(res
, j
);
1809 list_for_each(iter
, tmpq
) {
1810 lock
= list_entry(iter
,
1811 struct dlm_lock
, list
);
1812 if (lock
->ml
.cookie
== ml
->cookie
)
1820 /* lock is always created locally first, and
1821 * destroyed locally last. it must be on the list */
1824 mlog(ML_ERROR
, "Could not find local lock "
1825 "with cookie %u:%llu, node %u, "
1826 "list %u, flags 0x%x, type %d, "
1827 "conv %d, highest blocked %d\n",
1828 dlm_get_lock_cookie_node(be64_to_cpu(c
)),
1829 dlm_get_lock_cookie_seq(be64_to_cpu(c
)),
1830 ml
->node
, ml
->list
, ml
->flags
, ml
->type
,
1831 ml
->convert_type
, ml
->highest_blocked
);
1832 __dlm_print_one_lock_resource(res
);
1836 if (lock
->ml
.node
!= ml
->node
) {
1837 c
= lock
->ml
.cookie
;
1838 mlog(ML_ERROR
, "Mismatched node# in lock "
1839 "cookie %u:%llu, name %.*s, node %u\n",
1840 dlm_get_lock_cookie_node(be64_to_cpu(c
)),
1841 dlm_get_lock_cookie_seq(be64_to_cpu(c
)),
1842 res
->lockname
.len
, res
->lockname
.name
,
1845 mlog(ML_ERROR
, "Migrate lock cookie %u:%llu, "
1846 "node %u, list %u, flags 0x%x, type %d, "
1847 "conv %d, highest blocked %d\n",
1848 dlm_get_lock_cookie_node(be64_to_cpu(c
)),
1849 dlm_get_lock_cookie_seq(be64_to_cpu(c
)),
1850 ml
->node
, ml
->list
, ml
->flags
, ml
->type
,
1851 ml
->convert_type
, ml
->highest_blocked
);
1852 __dlm_print_one_lock_resource(res
);
1856 if (tmpq
!= queue
) {
1858 mlog(0, "Lock cookie %u:%llu was on list %u "
1859 "instead of list %u for %.*s\n",
1860 dlm_get_lock_cookie_node(be64_to_cpu(c
)),
1861 dlm_get_lock_cookie_seq(be64_to_cpu(c
)),
1862 j
, ml
->list
, res
->lockname
.len
,
1863 res
->lockname
.name
);
1864 __dlm_print_one_lock_resource(res
);
1865 spin_unlock(&res
->spinlock
);
1869 /* see NOTE above about why we do not update
1870 * to match the master here */
1872 /* move the lock to its proper place */
1873 /* do not alter lock refcount. switching lists. */
1874 list_move_tail(&lock
->list
, queue
);
1875 spin_unlock(&res
->spinlock
);
1878 mlog(0, "just reordered a local lock!\n");
1882 /* lock is for another node. */
1883 newlock
= dlm_new_lock(ml
->type
, ml
->node
,
1884 be64_to_cpu(ml
->cookie
), NULL
);
1889 lksb
= newlock
->lksb
;
1890 dlm_lock_attach_lockres(newlock
, res
);
1892 if (ml
->convert_type
!= LKM_IVMODE
) {
1893 BUG_ON(queue
!= &res
->converting
);
1894 newlock
->ml
.convert_type
= ml
->convert_type
;
1896 lksb
->flags
|= (ml
->flags
&
1897 (DLM_LKSB_PUT_LVB
|DLM_LKSB_GET_LVB
));
1899 if (ml
->type
== LKM_NLMODE
)
1903 * If the lock is in the blocked list it can't have a valid lvb,
1906 if (ml
->list
== DLM_BLOCKED_LIST
)
1909 if (!dlm_lvb_is_empty(mres
->lvb
)) {
1910 if (lksb
->flags
& DLM_LKSB_PUT_LVB
) {
1911 /* other node was trying to update
1912 * lvb when node died. recreate the
1913 * lksb with the updated lvb. */
1914 memcpy(lksb
->lvb
, mres
->lvb
, DLM_LVB_LEN
);
1915 /* the lock resource lvb update must happen
1916 * NOW, before the spinlock is dropped.
1917 * we no longer wait for the AST to update
1919 memcpy(res
->lvb
, mres
->lvb
, DLM_LVB_LEN
);
1921 /* otherwise, the node is sending its
1922 * most recent valid lvb info */
1923 BUG_ON(ml
->type
!= LKM_EXMODE
&&
1924 ml
->type
!= LKM_PRMODE
);
1925 if (!dlm_lvb_is_empty(res
->lvb
) &&
1926 (ml
->type
== LKM_EXMODE
||
1927 memcmp(res
->lvb
, mres
->lvb
, DLM_LVB_LEN
))) {
1929 mlog(ML_ERROR
, "%s:%.*s: received bad "
1930 "lvb! type=%d\n", dlm
->name
,
1932 res
->lockname
.name
, ml
->type
);
1933 printk("lockres lvb=[");
1934 for (i
=0; i
<DLM_LVB_LEN
; i
++)
1935 printk("%02x", res
->lvb
[i
]);
1936 printk("]\nmigrated lvb=[");
1937 for (i
=0; i
<DLM_LVB_LEN
; i
++)
1938 printk("%02x", mres
->lvb
[i
]);
1940 dlm_print_one_lock_resource(res
);
1943 memcpy(res
->lvb
, mres
->lvb
, DLM_LVB_LEN
);
1949 * wrt lock queue ordering and recovery:
1950 * 1. order of locks on granted queue is
1952 * 2. order of locks on converting queue is
1953 * LOST with the node death. sorry charlie.
1954 * 3. order of locks on the blocked queue is
1956 * order of locks does not affect integrity, it
1957 * just means that a lock request may get pushed
1958 * back in line as a result of the node death.
1959 * also note that for a given node the lock order
1960 * for its secondary queue locks is preserved
1961 * relative to each other, but clearly *not*
1962 * preserved relative to locks from other nodes.
1965 spin_lock(&res
->spinlock
);
1966 list_for_each_entry(lock
, queue
, list
) {
1967 if (lock
->ml
.cookie
== ml
->cookie
) {
1968 c
= lock
->ml
.cookie
;
1969 mlog(ML_ERROR
, "%s:%.*s: %u:%llu: lock already "
1970 "exists on this lockres!\n", dlm
->name
,
1971 res
->lockname
.len
, res
->lockname
.name
,
1972 dlm_get_lock_cookie_node(be64_to_cpu(c
)),
1973 dlm_get_lock_cookie_seq(be64_to_cpu(c
)));
1975 mlog(ML_NOTICE
, "sent lock: type=%d, conv=%d, "
1976 "node=%u, cookie=%u:%llu, queue=%d\n",
1977 ml
->type
, ml
->convert_type
, ml
->node
,
1978 dlm_get_lock_cookie_node(be64_to_cpu(ml
->cookie
)),
1979 dlm_get_lock_cookie_seq(be64_to_cpu(ml
->cookie
)),
1982 __dlm_print_one_lock_resource(res
);
1988 dlm_lock_get(newlock
);
1989 if (mres
->flags
& DLM_MRES_RECOVERY
&&
1990 ml
->list
== DLM_CONVERTING_LIST
&&
1992 newlock
->ml
.convert_type
) {
1993 /* newlock is doing downconvert, add it to the
1994 * head of converting list */
1995 list_add(&newlock
->list
, queue
);
1997 list_add_tail(&newlock
->list
, queue
);
1998 mlog(0, "%s:%.*s: added lock for node %u, "
1999 "setting refmap bit\n", dlm
->name
,
2000 res
->lockname
.len
, res
->lockname
.name
, ml
->node
);
2001 dlm_lockres_set_refmap_bit(dlm
, res
, ml
->node
);
2004 spin_unlock(&res
->spinlock
);
2006 mlog(0, "done running all the locks\n");
2009 /* balance the ref taken when the work was queued */
2010 spin_lock(&res
->spinlock
);
2011 dlm_lockres_drop_inflight_ref(dlm
, res
);
2012 spin_unlock(&res
->spinlock
);
2017 dlm_lock_put(newlock
);
2023 void dlm_move_lockres_to_recovery_list(struct dlm_ctxt
*dlm
,
2024 struct dlm_lock_resource
*res
)
2027 struct list_head
*queue
;
2028 struct dlm_lock
*lock
, *next
;
2030 assert_spin_locked(&dlm
->spinlock
);
2031 assert_spin_locked(&res
->spinlock
);
2032 res
->state
|= DLM_LOCK_RES_RECOVERING
;
2033 if (!list_empty(&res
->recovering
)) {
2035 "Recovering res %s:%.*s, is already on recovery list!\n",
2036 dlm
->name
, res
->lockname
.len
, res
->lockname
.name
);
2037 list_del_init(&res
->recovering
);
2038 dlm_lockres_put(res
);
2040 /* We need to hold a reference while on the recovery list */
2041 dlm_lockres_get(res
);
2042 list_add_tail(&res
->recovering
, &dlm
->reco
.resources
);
2044 /* find any pending locks and put them back on proper list */
2045 for (i
=DLM_BLOCKED_LIST
; i
>=DLM_GRANTED_LIST
; i
--) {
2046 queue
= dlm_list_idx_to_ptr(res
, i
);
2047 list_for_each_entry_safe(lock
, next
, queue
, list
) {
2049 if (lock
->convert_pending
) {
2050 /* move converting lock back to granted */
2051 BUG_ON(i
!= DLM_CONVERTING_LIST
);
2052 mlog(0, "node died with convert pending "
2053 "on %.*s. move back to granted list.\n",
2054 res
->lockname
.len
, res
->lockname
.name
);
2055 dlm_revert_pending_convert(res
, lock
);
2056 lock
->convert_pending
= 0;
2057 } else if (lock
->lock_pending
) {
2058 /* remove pending lock requests completely */
2059 BUG_ON(i
!= DLM_BLOCKED_LIST
);
2060 mlog(0, "node died with lock pending "
2061 "on %.*s. remove from blocked list and skip.\n",
2062 res
->lockname
.len
, res
->lockname
.name
);
2063 /* lock will be floating until ref in
2064 * dlmlock_remote is freed after the network
2065 * call returns. ok for it to not be on any
2066 * list since no ast can be called
2067 * (the master is dead). */
2068 dlm_revert_pending_lock(res
, lock
);
2069 lock
->lock_pending
= 0;
2070 } else if (lock
->unlock_pending
) {
2071 /* if an unlock was in progress, treat as
2072 * if this had completed successfully
2073 * before sending this lock state to the
2074 * new master. note that the dlm_unlock
2075 * call is still responsible for calling
2076 * the unlockast. that will happen after
2077 * the network call times out. for now,
2078 * just move lists to prepare the new
2079 * recovery master. */
2080 BUG_ON(i
!= DLM_GRANTED_LIST
);
2081 mlog(0, "node died with unlock pending "
2082 "on %.*s. remove from blocked list and skip.\n",
2083 res
->lockname
.len
, res
->lockname
.name
);
2084 dlm_commit_pending_unlock(res
, lock
);
2085 lock
->unlock_pending
= 0;
2086 } else if (lock
->cancel_pending
) {
2087 /* if a cancel was in progress, treat as
2088 * if this had completed successfully
2089 * before sending this lock state to the
2091 BUG_ON(i
!= DLM_CONVERTING_LIST
);
2092 mlog(0, "node died with cancel pending "
2093 "on %.*s. move back to granted list.\n",
2094 res
->lockname
.len
, res
->lockname
.name
);
2095 dlm_commit_pending_cancel(res
, lock
);
2096 lock
->cancel_pending
= 0;
2105 /* removes all recovered locks from the recovery list.
2106 * sets the res->owner to the new master.
2107 * unsets the RECOVERY flag and wakes waiters. */
2108 static void dlm_finish_local_lockres_recovery(struct dlm_ctxt
*dlm
,
2109 u8 dead_node
, u8 new_master
)
2112 struct hlist_head
*bucket
;
2113 struct dlm_lock_resource
*res
, *next
;
2115 assert_spin_locked(&dlm
->spinlock
);
2117 list_for_each_entry_safe(res
, next
, &dlm
->reco
.resources
, recovering
) {
2118 if (res
->owner
== dead_node
) {
2119 mlog(0, "%s: res %.*s, Changing owner from %u to %u\n",
2120 dlm
->name
, res
->lockname
.len
, res
->lockname
.name
,
2121 res
->owner
, new_master
);
2122 list_del_init(&res
->recovering
);
2123 spin_lock(&res
->spinlock
);
2124 /* new_master has our reference from
2125 * the lock state sent during recovery */
2126 dlm_change_lockres_owner(dlm
, res
, new_master
);
2127 res
->state
&= ~DLM_LOCK_RES_RECOVERING
;
2128 if (__dlm_lockres_has_locks(res
))
2129 __dlm_dirty_lockres(dlm
, res
);
2130 spin_unlock(&res
->spinlock
);
2132 dlm_lockres_put(res
);
2136 /* this will become unnecessary eventually, but
2137 * for now we need to run the whole hash, clear
2138 * the RECOVERING state and set the owner
2140 for (i
= 0; i
< DLM_HASH_BUCKETS
; i
++) {
2141 bucket
= dlm_lockres_hash(dlm
, i
);
2142 hlist_for_each_entry(res
, bucket
, hash_node
) {
2143 if (!(res
->state
& DLM_LOCK_RES_RECOVERING
))
2146 if (res
->owner
!= dead_node
&&
2147 res
->owner
!= dlm
->node_num
)
2150 if (!list_empty(&res
->recovering
)) {
2151 list_del_init(&res
->recovering
);
2152 dlm_lockres_put(res
);
2155 /* new_master has our reference from
2156 * the lock state sent during recovery */
2157 mlog(0, "%s: res %.*s, Changing owner from %u to %u\n",
2158 dlm
->name
, res
->lockname
.len
, res
->lockname
.name
,
2159 res
->owner
, new_master
);
2160 spin_lock(&res
->spinlock
);
2161 dlm_change_lockres_owner(dlm
, res
, new_master
);
2162 res
->state
&= ~DLM_LOCK_RES_RECOVERING
;
2163 if (__dlm_lockres_has_locks(res
))
2164 __dlm_dirty_lockres(dlm
, res
);
2165 spin_unlock(&res
->spinlock
);
2171 static inline int dlm_lvb_needs_invalidation(struct dlm_lock
*lock
, int local
)
2174 if (lock
->ml
.type
!= LKM_EXMODE
&&
2175 lock
->ml
.type
!= LKM_PRMODE
)
2177 } else if (lock
->ml
.type
== LKM_EXMODE
)
2182 static void dlm_revalidate_lvb(struct dlm_ctxt
*dlm
,
2183 struct dlm_lock_resource
*res
, u8 dead_node
)
2185 struct list_head
*queue
;
2186 struct dlm_lock
*lock
;
2187 int blank_lvb
= 0, local
= 0;
2191 assert_spin_locked(&dlm
->spinlock
);
2192 assert_spin_locked(&res
->spinlock
);
2194 if (res
->owner
== dlm
->node_num
)
2195 /* if this node owned the lockres, and if the dead node
2196 * had an EX when he died, blank out the lvb */
2197 search_node
= dead_node
;
2199 /* if this is a secondary lockres, and we had no EX or PR
2200 * locks granted, we can no longer trust the lvb */
2201 search_node
= dlm
->node_num
;
2202 local
= 1; /* check local state for valid lvb */
2205 for (i
=DLM_GRANTED_LIST
; i
<=DLM_CONVERTING_LIST
; i
++) {
2206 queue
= dlm_list_idx_to_ptr(res
, i
);
2207 list_for_each_entry(lock
, queue
, list
) {
2208 if (lock
->ml
.node
== search_node
) {
2209 if (dlm_lvb_needs_invalidation(lock
, local
)) {
2210 /* zero the lksb lvb and lockres lvb */
2212 memset(lock
->lksb
->lvb
, 0, DLM_LVB_LEN
);
2219 mlog(0, "clearing %.*s lvb, dead node %u had EX\n",
2220 res
->lockname
.len
, res
->lockname
.name
, dead_node
);
2221 memset(res
->lvb
, 0, DLM_LVB_LEN
);
2225 static void dlm_free_dead_locks(struct dlm_ctxt
*dlm
,
2226 struct dlm_lock_resource
*res
, u8 dead_node
)
2228 struct dlm_lock
*lock
, *next
;
2229 unsigned int freed
= 0;
2231 /* this node is the lockres master:
2232 * 1) remove any stale locks for the dead node
2233 * 2) if the dead node had an EX when he died, blank out the lvb
2235 assert_spin_locked(&dlm
->spinlock
);
2236 assert_spin_locked(&res
->spinlock
);
2238 /* We do two dlm_lock_put(). One for removing from list and the other is
2239 * to force the DLM_UNLOCK_FREE_LOCK action so as to free the locks */
2241 /* TODO: check pending_asts, pending_basts here */
2242 list_for_each_entry_safe(lock
, next
, &res
->granted
, list
) {
2243 if (lock
->ml
.node
== dead_node
) {
2244 list_del_init(&lock
->list
);
2246 /* Can't schedule DLM_UNLOCK_FREE_LOCK - do manually */
2251 list_for_each_entry_safe(lock
, next
, &res
->converting
, list
) {
2252 if (lock
->ml
.node
== dead_node
) {
2253 list_del_init(&lock
->list
);
2255 /* Can't schedule DLM_UNLOCK_FREE_LOCK - do manually */
2260 list_for_each_entry_safe(lock
, next
, &res
->blocked
, list
) {
2261 if (lock
->ml
.node
== dead_node
) {
2262 list_del_init(&lock
->list
);
2264 /* Can't schedule DLM_UNLOCK_FREE_LOCK - do manually */
2271 mlog(0, "%s:%.*s: freed %u locks for dead node %u, "
2272 "dropping ref from lockres\n", dlm
->name
,
2273 res
->lockname
.len
, res
->lockname
.name
, freed
, dead_node
);
2274 if(!test_bit(dead_node
, res
->refmap
)) {
2275 mlog(ML_ERROR
, "%s:%.*s: freed %u locks for dead node %u, "
2276 "but ref was not set\n", dlm
->name
,
2277 res
->lockname
.len
, res
->lockname
.name
, freed
, dead_node
);
2278 __dlm_print_one_lock_resource(res
);
2280 dlm_lockres_clear_refmap_bit(dlm
, res
, dead_node
);
2281 } else if (test_bit(dead_node
, res
->refmap
)) {
2282 mlog(0, "%s:%.*s: dead node %u had a ref, but had "
2283 "no locks and had not purged before dying\n", dlm
->name
,
2284 res
->lockname
.len
, res
->lockname
.name
, dead_node
);
2285 dlm_lockres_clear_refmap_bit(dlm
, res
, dead_node
);
2288 /* do not kick thread yet */
2289 __dlm_dirty_lockres(dlm
, res
);
2292 /* if this node is the recovery master, and there are no
2293 * locks for a given lockres owned by this node that are in
2294 * either PR or EX mode, zero out the lvb before requesting.
2299 static void dlm_do_local_recovery_cleanup(struct dlm_ctxt
*dlm
, u8 dead_node
)
2301 struct dlm_lock_resource
*res
;
2303 struct hlist_head
*bucket
;
2304 struct dlm_lock
*lock
;
2307 /* purge any stale mles */
2308 dlm_clean_master_list(dlm
, dead_node
);
2311 * now clean up all lock resources. there are two rules:
2313 * 1) if the dead node was the master, move the lockres
2314 * to the recovering list. set the RECOVERING flag.
2315 * this lockres needs to be cleaned up before it can
2318 * 2) if this node was the master, remove all locks from
2319 * each of the lockres queues that were owned by the
2320 * dead node. once recovery finishes, the dlm thread
2321 * can be kicked again to see if any ASTs or BASTs
2322 * need to be fired as a result.
2324 for (i
= 0; i
< DLM_HASH_BUCKETS
; i
++) {
2325 bucket
= dlm_lockres_hash(dlm
, i
);
2326 hlist_for_each_entry(res
, bucket
, hash_node
) {
2327 /* always prune any $RECOVERY entries for dead nodes,
2328 * otherwise hangs can occur during later recovery */
2329 if (dlm_is_recovery_lock(res
->lockname
.name
,
2330 res
->lockname
.len
)) {
2331 spin_lock(&res
->spinlock
);
2332 list_for_each_entry(lock
, &res
->granted
, list
) {
2333 if (lock
->ml
.node
== dead_node
) {
2334 mlog(0, "AHA! there was "
2335 "a $RECOVERY lock for dead "
2337 dead_node
, dlm
->name
);
2338 list_del_init(&lock
->list
);
2343 spin_unlock(&res
->spinlock
);
2346 spin_lock(&res
->spinlock
);
2347 /* zero the lvb if necessary */
2348 dlm_revalidate_lvb(dlm
, res
, dead_node
);
2349 if (res
->owner
== dead_node
) {
2350 if (res
->state
& DLM_LOCK_RES_DROPPING_REF
) {
2351 mlog(ML_NOTICE
, "%s: res %.*s, Skip "
2352 "recovery as it is being freed\n",
2353 dlm
->name
, res
->lockname
.len
,
2354 res
->lockname
.name
);
2356 dlm_move_lockres_to_recovery_list(dlm
,
2359 } else if (res
->owner
== dlm
->node_num
) {
2360 dlm_free_dead_locks(dlm
, res
, dead_node
);
2361 __dlm_lockres_calc_usage(dlm
, res
);
2362 } else if (res
->owner
== DLM_LOCK_RES_OWNER_UNKNOWN
) {
2363 if (test_bit(dead_node
, res
->refmap
)) {
2364 mlog(0, "%s:%.*s: dead node %u had a ref, but had "
2365 "no locks and had not purged before dying\n",
2366 dlm
->name
, res
->lockname
.len
,
2367 res
->lockname
.name
, dead_node
);
2368 dlm_lockres_clear_refmap_bit(dlm
, res
, dead_node
);
2371 spin_unlock(&res
->spinlock
);
2377 static void __dlm_hb_node_down(struct dlm_ctxt
*dlm
, int idx
)
2379 assert_spin_locked(&dlm
->spinlock
);
2381 if (dlm
->reco
.new_master
== idx
) {
2382 mlog(0, "%s: recovery master %d just died\n",
2384 if (dlm
->reco
.state
& DLM_RECO_STATE_FINALIZE
) {
2385 /* finalize1 was reached, so it is safe to clear
2386 * the new_master and dead_node. that recovery
2388 mlog(0, "%s: dead master %d had reached "
2389 "finalize1 state, clearing\n", dlm
->name
, idx
);
2390 dlm
->reco
.state
&= ~DLM_RECO_STATE_FINALIZE
;
2391 __dlm_reset_recovery(dlm
);
2395 /* Clean up join state on node death. */
2396 if (dlm
->joining_node
== idx
) {
2397 mlog(0, "Clearing join state for node %u\n", idx
);
2398 __dlm_set_joining_node(dlm
, DLM_LOCK_RES_OWNER_UNKNOWN
);
2401 /* check to see if the node is already considered dead */
2402 if (!test_bit(idx
, dlm
->live_nodes_map
)) {
2403 mlog(0, "for domain %s, node %d is already dead. "
2404 "another node likely did recovery already.\n",
2409 /* check to see if we do not care about this node */
2410 if (!test_bit(idx
, dlm
->domain_map
)) {
2411 /* This also catches the case that we get a node down
2412 * but haven't joined the domain yet. */
2413 mlog(0, "node %u already removed from domain!\n", idx
);
2417 clear_bit(idx
, dlm
->live_nodes_map
);
2419 /* make sure local cleanup occurs before the heartbeat events */
2420 if (!test_bit(idx
, dlm
->recovery_map
))
2421 dlm_do_local_recovery_cleanup(dlm
, idx
);
2423 /* notify anything attached to the heartbeat events */
2424 dlm_hb_event_notify_attached(dlm
, idx
, 0);
2426 mlog(0, "node %u being removed from domain map!\n", idx
);
2427 clear_bit(idx
, dlm
->domain_map
);
2428 clear_bit(idx
, dlm
->exit_domain_map
);
2429 /* wake up migration waiters if a node goes down.
2430 * perhaps later we can genericize this for other waiters. */
2431 wake_up(&dlm
->migration_wq
);
2433 if (test_bit(idx
, dlm
->recovery_map
))
2434 mlog(0, "domain %s, node %u already added "
2435 "to recovery map!\n", dlm
->name
, idx
);
2437 set_bit(idx
, dlm
->recovery_map
);
2440 void dlm_hb_node_down_cb(struct o2nm_node
*node
, int idx
, void *data
)
2442 struct dlm_ctxt
*dlm
= data
;
2448 * This will notify any dlm users that a node in our domain
2449 * went away without notifying us first.
2451 if (test_bit(idx
, dlm
->domain_map
))
2452 dlm_fire_domain_eviction_callbacks(dlm
, idx
);
2454 spin_lock(&dlm
->spinlock
);
2455 __dlm_hb_node_down(dlm
, idx
);
2456 spin_unlock(&dlm
->spinlock
);
2461 void dlm_hb_node_up_cb(struct o2nm_node
*node
, int idx
, void *data
)
2463 struct dlm_ctxt
*dlm
= data
;
2468 spin_lock(&dlm
->spinlock
);
2469 set_bit(idx
, dlm
->live_nodes_map
);
2470 /* do NOT notify mle attached to the heartbeat events.
2471 * new nodes are not interesting in mastery until joined. */
2472 spin_unlock(&dlm
->spinlock
);
2477 static void dlm_reco_ast(void *astdata
)
2479 struct dlm_ctxt
*dlm
= astdata
;
2480 mlog(0, "ast for recovery lock fired!, this=%u, dlm=%s\n",
2481 dlm
->node_num
, dlm
->name
);
2483 static void dlm_reco_bast(void *astdata
, int blocked_type
)
2485 struct dlm_ctxt
*dlm
= astdata
;
2486 mlog(0, "bast for recovery lock fired!, this=%u, dlm=%s\n",
2487 dlm
->node_num
, dlm
->name
);
2489 static void dlm_reco_unlock_ast(void *astdata
, enum dlm_status st
)
2491 mlog(0, "unlockast for recovery lock fired!\n");
2495 * dlm_pick_recovery_master will continually attempt to use
2496 * dlmlock() on the special "$RECOVERY" lockres with the
2497 * LKM_NOQUEUE flag to get an EX. every thread that enters
2498 * this function on each node racing to become the recovery
2499 * master will not stop attempting this until either:
2500 * a) this node gets the EX (and becomes the recovery master),
2501 * or b) dlm->reco.new_master gets set to some nodenum
2502 * != O2NM_INVALID_NODE_NUM (another node will do the reco).
2503 * so each time a recovery master is needed, the entire cluster
2504 * will sync at this point. if the new master dies, that will
2505 * be detected in dlm_do_recovery */
2506 static int dlm_pick_recovery_master(struct dlm_ctxt
*dlm
)
2508 enum dlm_status ret
;
2509 struct dlm_lockstatus lksb
;
2510 int status
= -EINVAL
;
2512 mlog(0, "starting recovery of %s at %lu, dead=%u, this=%u\n",
2513 dlm
->name
, jiffies
, dlm
->reco
.dead_node
, dlm
->node_num
);
2515 memset(&lksb
, 0, sizeof(lksb
));
2517 ret
= dlmlock(dlm
, LKM_EXMODE
, &lksb
, LKM_NOQUEUE
|LKM_RECOVERY
,
2518 DLM_RECOVERY_LOCK_NAME
, DLM_RECOVERY_LOCK_NAME_LEN
,
2519 dlm_reco_ast
, dlm
, dlm_reco_bast
);
2521 mlog(0, "%s: dlmlock($RECOVERY) returned %d, lksb=%d\n",
2522 dlm
->name
, ret
, lksb
.status
);
2524 if (ret
== DLM_NORMAL
) {
2525 mlog(0, "dlm=%s dlmlock says I got it (this=%u)\n",
2526 dlm
->name
, dlm
->node_num
);
2528 /* got the EX lock. check to see if another node
2529 * just became the reco master */
2530 if (dlm_reco_master_ready(dlm
)) {
2531 mlog(0, "%s: got reco EX lock, but %u will "
2532 "do the recovery\n", dlm
->name
,
2533 dlm
->reco
.new_master
);
2538 /* see if recovery was already finished elsewhere */
2539 spin_lock(&dlm
->spinlock
);
2540 if (dlm
->reco
.dead_node
== O2NM_INVALID_NODE_NUM
) {
2542 mlog(0, "%s: got reco EX lock, but "
2543 "node got recovered already\n", dlm
->name
);
2544 if (dlm
->reco
.new_master
!= O2NM_INVALID_NODE_NUM
) {
2545 mlog(ML_ERROR
, "%s: new master is %u "
2546 "but no dead node!\n",
2547 dlm
->name
, dlm
->reco
.new_master
);
2551 spin_unlock(&dlm
->spinlock
);
2554 /* if this node has actually become the recovery master,
2555 * set the master and send the messages to begin recovery */
2557 mlog(0, "%s: dead=%u, this=%u, sending "
2558 "begin_reco now\n", dlm
->name
,
2559 dlm
->reco
.dead_node
, dlm
->node_num
);
2560 status
= dlm_send_begin_reco_message(dlm
,
2561 dlm
->reco
.dead_node
);
2562 /* this always succeeds */
2565 /* set the new_master to this node */
2566 spin_lock(&dlm
->spinlock
);
2567 dlm_set_reco_master(dlm
, dlm
->node_num
);
2568 spin_unlock(&dlm
->spinlock
);
2571 /* recovery lock is a special case. ast will not get fired,
2572 * so just go ahead and unlock it. */
2573 ret
= dlmunlock(dlm
, &lksb
, 0, dlm_reco_unlock_ast
, dlm
);
2574 if (ret
== DLM_DENIED
) {
2575 mlog(0, "got DLM_DENIED, trying LKM_CANCEL\n");
2576 ret
= dlmunlock(dlm
, &lksb
, LKM_CANCEL
, dlm_reco_unlock_ast
, dlm
);
2578 if (ret
!= DLM_NORMAL
) {
2579 /* this would really suck. this could only happen
2580 * if there was a network error during the unlock
2581 * because of node death. this means the unlock
2582 * is actually "done" and the lock structure is
2583 * even freed. we can continue, but only
2584 * because this specific lock name is special. */
2585 mlog(ML_ERROR
, "dlmunlock returned %d\n", ret
);
2587 } else if (ret
== DLM_NOTQUEUED
) {
2588 mlog(0, "dlm=%s dlmlock says another node got it (this=%u)\n",
2589 dlm
->name
, dlm
->node_num
);
2590 /* another node is master. wait on
2591 * reco.new_master != O2NM_INVALID_NODE_NUM
2592 * for at most one second */
2593 wait_event_timeout(dlm
->dlm_reco_thread_wq
,
2594 dlm_reco_master_ready(dlm
),
2595 msecs_to_jiffies(1000));
2596 if (!dlm_reco_master_ready(dlm
)) {
2597 mlog(0, "%s: reco master taking awhile\n",
2601 /* another node has informed this one that it is reco master */
2602 mlog(0, "%s: reco master %u is ready to recover %u\n",
2603 dlm
->name
, dlm
->reco
.new_master
, dlm
->reco
.dead_node
);
2605 } else if (ret
== DLM_RECOVERING
) {
2606 mlog(0, "dlm=%s dlmlock says master node died (this=%u)\n",
2607 dlm
->name
, dlm
->node_num
);
2610 struct dlm_lock_resource
*res
;
2612 /* dlmlock returned something other than NOTQUEUED or NORMAL */
2613 mlog(ML_ERROR
, "%s: got %s from dlmlock($RECOVERY), "
2614 "lksb.status=%s\n", dlm
->name
, dlm_errname(ret
),
2615 dlm_errname(lksb
.status
));
2616 res
= dlm_lookup_lockres(dlm
, DLM_RECOVERY_LOCK_NAME
,
2617 DLM_RECOVERY_LOCK_NAME_LEN
);
2619 dlm_print_one_lock_resource(res
);
2620 dlm_lockres_put(res
);
2622 mlog(ML_ERROR
, "recovery lock not found\n");
2630 static int dlm_send_begin_reco_message(struct dlm_ctxt
*dlm
, u8 dead_node
)
2632 struct dlm_begin_reco br
;
2634 struct dlm_node_iter iter
;
2638 mlog(0, "%s: dead node is %u\n", dlm
->name
, dead_node
);
2640 spin_lock(&dlm
->spinlock
);
2641 dlm_node_iter_init(dlm
->domain_map
, &iter
);
2642 spin_unlock(&dlm
->spinlock
);
2644 clear_bit(dead_node
, iter
.node_map
);
2646 memset(&br
, 0, sizeof(br
));
2647 br
.node_idx
= dlm
->node_num
;
2648 br
.dead_node
= dead_node
;
2650 while ((nodenum
= dlm_node_iter_next(&iter
)) >= 0) {
2652 if (nodenum
== dead_node
) {
2653 mlog(0, "not sending begin reco to dead node "
2657 if (nodenum
== dlm
->node_num
) {
2658 mlog(0, "not sending begin reco to self\n");
2663 mlog(0, "attempting to send begin reco msg to %d\n",
2665 ret
= o2net_send_message(DLM_BEGIN_RECO_MSG
, dlm
->key
,
2666 &br
, sizeof(br
), nodenum
, &status
);
2667 /* negative status is handled ok by caller here */
2670 if (dlm_is_host_down(ret
)) {
2671 /* node is down. not involved in recovery
2672 * so just keep going */
2673 mlog(ML_NOTICE
, "%s: node %u was down when sending "
2674 "begin reco msg (%d)\n", dlm
->name
, nodenum
, ret
);
2679 * Prior to commit aad1b15310b9bcd59fa81ab8f2b1513b59553ea8,
2680 * dlm_begin_reco_handler() returned EAGAIN and not -EAGAIN.
2681 * We are handling both for compatibility reasons.
2683 if (ret
== -EAGAIN
|| ret
== EAGAIN
) {
2684 mlog(0, "%s: trying to start recovery of node "
2685 "%u, but node %u is waiting for last recovery "
2686 "to complete, backoff for a bit\n", dlm
->name
,
2687 dead_node
, nodenum
);
2692 struct dlm_lock_resource
*res
;
2694 /* this is now a serious problem, possibly ENOMEM
2695 * in the network stack. must retry */
2697 mlog(ML_ERROR
, "begin reco of dlm %s to node %u "
2698 "returned %d\n", dlm
->name
, nodenum
, ret
);
2699 res
= dlm_lookup_lockres(dlm
, DLM_RECOVERY_LOCK_NAME
,
2700 DLM_RECOVERY_LOCK_NAME_LEN
);
2702 dlm_print_one_lock_resource(res
);
2703 dlm_lockres_put(res
);
2705 mlog(ML_ERROR
, "recovery lock not found\n");
2707 /* sleep for a bit in hopes that we can avoid
2717 int dlm_begin_reco_handler(struct o2net_msg
*msg
, u32 len
, void *data
,
2720 struct dlm_ctxt
*dlm
= data
;
2721 struct dlm_begin_reco
*br
= (struct dlm_begin_reco
*)msg
->buf
;
2723 /* ok to return 0, domain has gone away */
2727 spin_lock(&dlm
->spinlock
);
2728 if (dlm
->reco
.state
& DLM_RECO_STATE_FINALIZE
) {
2729 mlog(0, "%s: node %u wants to recover node %u (%u:%u) "
2730 "but this node is in finalize state, waiting on finalize2\n",
2731 dlm
->name
, br
->node_idx
, br
->dead_node
,
2732 dlm
->reco
.dead_node
, dlm
->reco
.new_master
);
2733 spin_unlock(&dlm
->spinlock
);
2737 spin_unlock(&dlm
->spinlock
);
2739 mlog(0, "%s: node %u wants to recover node %u (%u:%u)\n",
2740 dlm
->name
, br
->node_idx
, br
->dead_node
,
2741 dlm
->reco
.dead_node
, dlm
->reco
.new_master
);
2743 dlm_fire_domain_eviction_callbacks(dlm
, br
->dead_node
);
2745 spin_lock(&dlm
->spinlock
);
2746 if (dlm
->reco
.new_master
!= O2NM_INVALID_NODE_NUM
) {
2747 if (test_bit(dlm
->reco
.new_master
, dlm
->recovery_map
)) {
2748 mlog(0, "%s: new_master %u died, changing "
2749 "to %u\n", dlm
->name
, dlm
->reco
.new_master
,
2752 mlog(0, "%s: new_master %u NOT DEAD, changing "
2753 "to %u\n", dlm
->name
, dlm
->reco
.new_master
,
2755 /* may not have seen the new master as dead yet */
2758 if (dlm
->reco
.dead_node
!= O2NM_INVALID_NODE_NUM
) {
2759 mlog(ML_NOTICE
, "%s: dead_node previously set to %u, "
2760 "node %u changing it to %u\n", dlm
->name
,
2761 dlm
->reco
.dead_node
, br
->node_idx
, br
->dead_node
);
2763 dlm_set_reco_master(dlm
, br
->node_idx
);
2764 dlm_set_reco_dead_node(dlm
, br
->dead_node
);
2765 if (!test_bit(br
->dead_node
, dlm
->recovery_map
)) {
2766 mlog(0, "recovery master %u sees %u as dead, but this "
2767 "node has not yet. marking %u as dead\n",
2768 br
->node_idx
, br
->dead_node
, br
->dead_node
);
2769 if (!test_bit(br
->dead_node
, dlm
->domain_map
) ||
2770 !test_bit(br
->dead_node
, dlm
->live_nodes_map
))
2771 mlog(0, "%u not in domain/live_nodes map "
2772 "so setting it in reco map manually\n",
2774 /* force the recovery cleanup in __dlm_hb_node_down
2775 * both of these will be cleared in a moment */
2776 set_bit(br
->dead_node
, dlm
->domain_map
);
2777 set_bit(br
->dead_node
, dlm
->live_nodes_map
);
2778 __dlm_hb_node_down(dlm
, br
->dead_node
);
2780 spin_unlock(&dlm
->spinlock
);
2782 dlm_kick_recovery_thread(dlm
);
2784 mlog(0, "%s: recovery started by node %u, for %u (%u:%u)\n",
2785 dlm
->name
, br
->node_idx
, br
->dead_node
,
2786 dlm
->reco
.dead_node
, dlm
->reco
.new_master
);
2792 #define DLM_FINALIZE_STAGE2 0x01
2793 static int dlm_send_finalize_reco_message(struct dlm_ctxt
*dlm
)
2796 struct dlm_finalize_reco fr
;
2797 struct dlm_node_iter iter
;
2802 mlog(0, "finishing recovery for node %s:%u, "
2803 "stage %d\n", dlm
->name
, dlm
->reco
.dead_node
, stage
);
2805 spin_lock(&dlm
->spinlock
);
2806 dlm_node_iter_init(dlm
->domain_map
, &iter
);
2807 spin_unlock(&dlm
->spinlock
);
2810 memset(&fr
, 0, sizeof(fr
));
2811 fr
.node_idx
= dlm
->node_num
;
2812 fr
.dead_node
= dlm
->reco
.dead_node
;
2814 fr
.flags
|= DLM_FINALIZE_STAGE2
;
2816 while ((nodenum
= dlm_node_iter_next(&iter
)) >= 0) {
2817 if (nodenum
== dlm
->node_num
)
2819 ret
= o2net_send_message(DLM_FINALIZE_RECO_MSG
, dlm
->key
,
2820 &fr
, sizeof(fr
), nodenum
, &status
);
2824 mlog(ML_ERROR
, "Error %d when sending message %u (key "
2825 "0x%x) to node %u\n", ret
, DLM_FINALIZE_RECO_MSG
,
2827 if (dlm_is_host_down(ret
)) {
2828 /* this has no effect on this recovery
2829 * session, so set the status to zero to
2830 * finish out the last recovery */
2831 mlog(ML_ERROR
, "node %u went down after this "
2832 "node finished recovery.\n", nodenum
);
2840 /* reset the node_iter back to the top and send finalize2 */
2849 int dlm_finalize_reco_handler(struct o2net_msg
*msg
, u32 len
, void *data
,
2852 struct dlm_ctxt
*dlm
= data
;
2853 struct dlm_finalize_reco
*fr
= (struct dlm_finalize_reco
*)msg
->buf
;
2856 /* ok to return 0, domain has gone away */
2860 if (fr
->flags
& DLM_FINALIZE_STAGE2
)
2863 mlog(0, "%s: node %u finalizing recovery stage%d of "
2864 "node %u (%u:%u)\n", dlm
->name
, fr
->node_idx
, stage
,
2865 fr
->dead_node
, dlm
->reco
.dead_node
, dlm
->reco
.new_master
);
2867 spin_lock(&dlm
->spinlock
);
2869 if (dlm
->reco
.new_master
!= fr
->node_idx
) {
2870 mlog(ML_ERROR
, "node %u sent recovery finalize msg, but node "
2871 "%u is supposed to be the new master, dead=%u\n",
2872 fr
->node_idx
, dlm
->reco
.new_master
, fr
->dead_node
);
2875 if (dlm
->reco
.dead_node
!= fr
->dead_node
) {
2876 mlog(ML_ERROR
, "node %u sent recovery finalize msg for dead "
2877 "node %u, but node %u is supposed to be dead\n",
2878 fr
->node_idx
, fr
->dead_node
, dlm
->reco
.dead_node
);
2884 dlm_finish_local_lockres_recovery(dlm
, fr
->dead_node
, fr
->node_idx
);
2885 if (dlm
->reco
.state
& DLM_RECO_STATE_FINALIZE
) {
2886 mlog(ML_ERROR
, "%s: received finalize1 from "
2887 "new master %u for dead node %u, but "
2888 "this node has already received it!\n",
2889 dlm
->name
, fr
->node_idx
, fr
->dead_node
);
2890 dlm_print_reco_node_status(dlm
);
2893 dlm
->reco
.state
|= DLM_RECO_STATE_FINALIZE
;
2894 spin_unlock(&dlm
->spinlock
);
2897 if (!(dlm
->reco
.state
& DLM_RECO_STATE_FINALIZE
)) {
2898 mlog(ML_ERROR
, "%s: received finalize2 from "
2899 "new master %u for dead node %u, but "
2900 "this node did not have finalize1!\n",
2901 dlm
->name
, fr
->node_idx
, fr
->dead_node
);
2902 dlm_print_reco_node_status(dlm
);
2905 dlm
->reco
.state
&= ~DLM_RECO_STATE_FINALIZE
;
2906 __dlm_reset_recovery(dlm
);
2907 spin_unlock(&dlm
->spinlock
);
2908 dlm_kick_recovery_thread(dlm
);
2914 mlog(0, "%s: recovery done, reco master was %u, dead now %u, master now %u\n",
2915 dlm
->name
, fr
->node_idx
, dlm
->reco
.dead_node
, dlm
->reco
.new_master
);