]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blob - fs/ocfs2/dlm/dlmrecovery.c
ocfs2/dlm: do not purge lockres that is queued for assert master
[mirror_ubuntu-bionic-kernel.git] / fs / ocfs2 / dlm / dlmrecovery.c
1 /* -*- mode: c; c-basic-offset: 8; -*-
2 * vim: noexpandtab sw=8 ts=8 sts=0:
3 *
4 * dlmrecovery.c
5 *
6 * recovery stuff
7 *
8 * Copyright (C) 2004 Oracle. All rights reserved.
9 *
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.
14 *
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.
19 *
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.
24 *
25 */
26
27
28 #include <linux/module.h>
29 #include <linux/fs.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>
42
43
44 #include "cluster/heartbeat.h"
45 #include "cluster/nodemanager.h"
46 #include "cluster/tcp.h"
47
48 #include "dlmapi.h"
49 #include "dlmcommon.h"
50 #include "dlmdomain.h"
51
52 #define MLOG_MASK_PREFIX (ML_DLM|ML_DLM_RECOVERY)
53 #include "cluster/masklog.h"
54
55 static void dlm_do_local_recovery_cleanup(struct dlm_ctxt *dlm, u8 dead_node);
56
57 static int dlm_recovery_thread(void *data);
58 static int dlm_do_recovery(struct dlm_ctxt *dlm);
59
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);
66
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,
71 u8 flags, u8 master);
72 static int dlm_send_mig_lockres_msg(struct dlm_ctxt *dlm,
73 struct dlm_migratable_lockres *mres,
74 u8 send_to,
75 struct dlm_lock_resource *res,
76 int total_locks);
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,
92 void *data);
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,
96 u8 *real_master);
97
98 static u64 dlm_get_next_mig_cookie(void);
99
100 static DEFINE_SPINLOCK(dlm_reco_state_lock);
101 static DEFINE_SPINLOCK(dlm_mig_cookie_lock);
102 static u64 dlm_mig_cookie = 1;
103
104 static u64 dlm_get_next_mig_cookie(void)
105 {
106 u64 c;
107 spin_lock(&dlm_mig_cookie_lock);
108 c = dlm_mig_cookie;
109 if (dlm_mig_cookie == (~0ULL))
110 dlm_mig_cookie = 1;
111 else
112 dlm_mig_cookie++;
113 spin_unlock(&dlm_mig_cookie_lock);
114 return c;
115 }
116
117 static inline void dlm_set_reco_dead_node(struct dlm_ctxt *dlm,
118 u8 dead_node)
119 {
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;
125 }
126
127 static inline void dlm_set_reco_master(struct dlm_ctxt *dlm,
128 u8 master)
129 {
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;
134 }
135
136 static inline void __dlm_reset_recovery(struct dlm_ctxt *dlm)
137 {
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);
142 }
143
144 static inline void dlm_reset_recovery(struct dlm_ctxt *dlm)
145 {
146 spin_lock(&dlm->spinlock);
147 __dlm_reset_recovery(dlm);
148 spin_unlock(&dlm->spinlock);
149 }
150
151 /* Worker function used during recovery. */
152 void dlm_dispatch_work(struct work_struct *work)
153 {
154 struct dlm_ctxt *dlm =
155 container_of(work, struct dlm_ctxt, dispatched_work);
156 LIST_HEAD(tmp_list);
157 struct dlm_work_item *item, *next;
158 dlm_workfunc_t *workfunc;
159 int tot=0;
160
161 spin_lock(&dlm->work_lock);
162 list_splice_init(&dlm->work_list, &tmp_list);
163 spin_unlock(&dlm->work_lock);
164
165 list_for_each_entry(item, &tmp_list, list) {
166 tot++;
167 }
168 mlog(0, "%s: work thread has %d work items\n", dlm->name, tot);
169
170 list_for_each_entry_safe(item, next, &tmp_list, list) {
171 workfunc = item->func;
172 list_del_init(&item->list);
173
174 /* already have ref on dlm to avoid having
175 * it disappear. just double-check. */
176 BUG_ON(item->dlm != dlm);
177
178 /* this is allowed to sleep and
179 * call network stuff */
180 workfunc(item, item->data);
181
182 dlm_put(dlm);
183 kfree(item);
184 }
185 }
186
187 /*
188 * RECOVERY THREAD
189 */
190
191 void dlm_kick_recovery_thread(struct dlm_ctxt *dlm)
192 {
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 */
198
199 wake_up(&dlm->dlm_reco_thread_wq);
200 }
201
202 /* Launch the recovery thread */
203 int dlm_launch_recovery_thread(struct dlm_ctxt *dlm)
204 {
205 mlog(0, "starting dlm recovery thread...\n");
206
207 dlm->dlm_reco_thread_task = kthread_run(dlm_recovery_thread, dlm,
208 "dlm_reco_thread");
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;
212 return -EINVAL;
213 }
214
215 return 0;
216 }
217
218 void dlm_complete_recovery_thread(struct dlm_ctxt *dlm)
219 {
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;
224 }
225 }
226
227
228
229 /*
230 * this is lame, but here's how recovery works...
231 * 1) all recovery threads cluster wide will work on recovering
232 * ONE node at a time
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
240 * before continuing
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
249 *
250 */
251
252 static void dlm_print_reco_node_status(struct dlm_ctxt *dlm)
253 {
254 struct dlm_reco_node_data *ndata;
255 struct dlm_lock_resource *res;
256
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);
261
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:
266 st = "init";
267 break;
268 case DLM_RECO_NODE_DATA_REQUESTING:
269 st = "requesting";
270 break;
271 case DLM_RECO_NODE_DATA_DEAD:
272 st = "dead";
273 break;
274 case DLM_RECO_NODE_DATA_RECEIVING:
275 st = "receiving";
276 break;
277 case DLM_RECO_NODE_DATA_REQUESTED:
278 st = "requested";
279 break;
280 case DLM_RECO_NODE_DATA_DONE:
281 st = "done";
282 break;
283 case DLM_RECO_NODE_DATA_FINALIZE_SENT:
284 st = "finalize-sent";
285 break;
286 default:
287 st = "bad";
288 break;
289 }
290 mlog(ML_NOTICE, "%s: reco state, node %u, state=%s\n",
291 dlm->name, ndata->node_num, st);
292 }
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);
296 }
297 }
298
299 #define DLM_RECO_THREAD_TIMEOUT_MS (5 * 1000)
300
301 static int dlm_recovery_thread(void *data)
302 {
303 int status;
304 struct dlm_ctxt *dlm = data;
305 unsigned long timeout = msecs_to_jiffies(DLM_RECO_THREAD_TIMEOUT_MS);
306
307 mlog(0, "dlm thread running for %s...\n", dlm->name);
308
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. */
314 continue;
315 }
316 if (status < 0)
317 mlog_errno(status);
318 }
319
320 wait_event_interruptible_timeout(dlm->dlm_reco_thread_wq,
321 kthread_should_stop(),
322 timeout);
323 }
324
325 mlog(0, "quitting DLM recovery thread\n");
326 return 0;
327 }
328
329 /* returns true when the recovery master has contacted us */
330 static int dlm_reco_master_ready(struct dlm_ctxt *dlm)
331 {
332 int ready;
333 spin_lock(&dlm->spinlock);
334 ready = (dlm->reco.new_master != O2NM_INVALID_NODE_NUM);
335 spin_unlock(&dlm->spinlock);
336 return ready;
337 }
338
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)
342 {
343 int dead;
344 spin_lock(&dlm->spinlock);
345 dead = !test_bit(node, dlm->domain_map);
346 spin_unlock(&dlm->spinlock);
347 return dead;
348 }
349
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)
353 {
354 int recovered;
355 spin_lock(&dlm->spinlock);
356 recovered = !test_bit(node, dlm->recovery_map);
357 spin_unlock(&dlm->spinlock);
358 return recovered;
359 }
360
361
362 void dlm_wait_for_node_death(struct dlm_ctxt *dlm, u8 node, int timeout)
363 {
364 if (dlm_is_node_dead(dlm, node))
365 return;
366
367 printk(KERN_NOTICE "o2dlm: Waiting on the death of node %u in "
368 "domain %s\n", node, dlm->name);
369
370 if (timeout)
371 wait_event_timeout(dlm->dlm_reco_thread_wq,
372 dlm_is_node_dead(dlm, node),
373 msecs_to_jiffies(timeout));
374 else
375 wait_event(dlm->dlm_reco_thread_wq,
376 dlm_is_node_dead(dlm, node));
377 }
378
379 void dlm_wait_for_node_recovery(struct dlm_ctxt *dlm, u8 node, int timeout)
380 {
381 if (dlm_is_node_recovered(dlm, node))
382 return;
383
384 printk(KERN_NOTICE "o2dlm: Waiting on the recovery of node %u in "
385 "domain %s\n", node, dlm->name);
386
387 if (timeout)
388 wait_event_timeout(dlm->dlm_reco_thread_wq,
389 dlm_is_node_recovered(dlm, node),
390 msecs_to_jiffies(timeout));
391 else
392 wait_event(dlm->dlm_reco_thread_wq,
393 dlm_is_node_recovered(dlm, node));
394 }
395
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)
403 {
404 int in_recovery;
405 spin_lock(&dlm->spinlock);
406 in_recovery = !!(dlm->reco.state & DLM_RECO_STATE_ACTIVE);
407 spin_unlock(&dlm->spinlock);
408 return in_recovery;
409 }
410
411
412 void dlm_wait_for_recovery(struct dlm_ctxt *dlm)
413 {
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);
420 }
421 wait_event(dlm->reco.event, !dlm_in_recovery(dlm));
422 }
423
424 static void dlm_begin_recovery(struct dlm_ctxt *dlm)
425 {
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);
432 }
433
434 static void dlm_end_recovery(struct dlm_ctxt *dlm)
435 {
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);
442 }
443
444 static void dlm_print_recovery_master(struct dlm_ctxt *dlm)
445 {
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);
450 }
451
452 static int dlm_do_recovery(struct dlm_ctxt *dlm)
453 {
454 int status = 0;
455 int ret;
456
457 spin_lock(&dlm->spinlock);
458
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);
466 }
467
468 /* select a target to recover */
469 if (dlm->reco.dead_node == O2NM_INVALID_NODE_NUM) {
470 int bit;
471
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);
475 else
476 dlm_set_reco_dead_node(dlm, bit);
477 } else if (!test_bit(dlm->reco.dead_node, dlm->recovery_map)) {
478 /* BUG? */
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);
482 }
483
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. */
488 return 0;
489 }
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);
494
495 /* take write barrier */
496 /* (stops the list reshuffling thread, proxy ast handling) */
497 dlm_begin_recovery(dlm);
498
499 if (dlm->reco.new_master == dlm->node_num)
500 goto master_here;
501
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);
508 if (!ret) {
509 /* already notified everyone. go. */
510 goto master_here;
511 }
512 mlog(0, "another node will master this recovery session.\n");
513 }
514
515 dlm_print_recovery_master(dlm);
516
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);
521
522 /* sleep out in main dlm_recovery_thread loop. */
523 return 0;
524
525 master_here:
526 dlm_print_recovery_master(dlm);
527
528 status = dlm_remaster_locks(dlm, dlm->reco.dead_node);
529 if (status < 0) {
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 */
535 msleep(100);
536 } else {
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);
544 }
545 dlm_end_recovery(dlm);
546
547 /* continue and look for another dead node */
548 return -EAGAIN;
549 }
550
551 static int dlm_remaster_locks(struct dlm_ctxt *dlm, u8 dead_node)
552 {
553 int status = 0;
554 struct dlm_reco_node_data *ndata;
555 int all_nodes_done;
556 int destroy = 0;
557 int pass = 0;
558
559 do {
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);
563 if (status < 0) {
564 mlog(ML_ERROR, "%s: failed to alloc recovery area, "
565 "retrying\n", dlm->name);
566 msleep(1000);
567 }
568 } while (status != 0);
569
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;
575
576 mlog(0, "%s: Requesting lock info from node %u\n", dlm->name,
577 ndata->node_num);
578
579 if (ndata->node_num == dlm->node_num) {
580 ndata->state = DLM_RECO_NODE_DATA_DONE;
581 continue;
582 }
583
584 do {
585 status = dlm_request_all_locks(dlm, ndata->node_num,
586 dead_node);
587 if (status < 0) {
588 mlog_errno(status);
589 if (dlm_is_host_down(status)) {
590 /* node died, ignore it for recovery */
591 status = 0;
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,
597 ndata->node_num),
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) ?
602 "yes" : "no");
603 } else {
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,
609 status);
610 msleep(100);
611 }
612 }
613 } while (status != 0);
614
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:
620 BUG();
621 break;
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. */
628 break;
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);
634 break;
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);
639 break;
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);
644 break;
645 }
646 spin_unlock(&dlm_reco_state_lock);
647 }
648
649 mlog(0, "%s: Done requesting all lock info\n", dlm->name);
650
651 /* nodes should be sending reco data now
652 * just need to wait */
653
654 while (1) {
655 /* check all the nodes now to see if we are
656 * done, or if anyone died */
657 all_nodes_done = 1;
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",
661 ndata->node_num);
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);
668 BUG();
669 break;
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,
674 dead_node);
675 break;
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");
682 all_nodes_done = 0;
683 break;
684 case DLM_RECO_NODE_DATA_DONE:
685 mlog(0, "%s: node %u state is done\n",
686 dlm->name, ndata->node_num);
687 break;
688 case DLM_RECO_NODE_DATA_FINALIZE_SENT:
689 mlog(0, "%s: node %u state is finalize\n",
690 dlm->name, ndata->node_num);
691 break;
692 }
693 }
694 spin_unlock(&dlm_reco_state_lock);
695
696 mlog(0, "pass #%d, all_nodes_done?: %s\n", ++pass,
697 all_nodes_done?"yes":"no");
698 if (all_nodes_done) {
699 int ret;
700
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);
708
709 /* all nodes are now in DLM_RECO_NODE_DATA_DONE state
710 * just send a finalize message to everyone and
711 * clean up */
712 mlog(0, "all nodes are done! send finalize\n");
713 ret = dlm_send_finalize_reco_message(dlm);
714 if (ret < 0)
715 mlog_errno(ret);
716
717 spin_lock(&dlm->spinlock);
718 dlm_finish_local_lockres_recovery(dlm, dead_node,
719 dlm->node_num);
720 spin_unlock(&dlm->spinlock);
721 mlog(0, "should be done with recovery!\n");
722
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);
727 destroy = 1;
728 status = 0;
729 /* rescan everything marked dirty along the way */
730 dlm_kick_thread(dlm, NULL);
731 break;
732 }
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));
738
739 }
740
741 if (destroy)
742 dlm_destroy_recovery_area(dlm, dead_node);
743
744 return status;
745 }
746
747 static int dlm_init_recovery_area(struct dlm_ctxt *dlm, u8 dead_node)
748 {
749 int num=0;
750 struct dlm_reco_node_data *ndata;
751
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);
757
758 while (1) {
759 num = find_next_bit (dlm->reco.node_map, O2NM_MAX_NODES, num);
760 if (num >= O2NM_MAX_NODES) {
761 break;
762 }
763 BUG_ON(num == dead_node);
764
765 ndata = kzalloc(sizeof(*ndata), GFP_NOFS);
766 if (!ndata) {
767 dlm_destroy_recovery_area(dlm, dead_node);
768 return -ENOMEM;
769 }
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);
775 num++;
776 }
777
778 return 0;
779 }
780
781 static void dlm_destroy_recovery_area(struct dlm_ctxt *dlm, u8 dead_node)
782 {
783 struct dlm_reco_node_data *ndata, *next;
784 LIST_HEAD(tmplist);
785
786 spin_lock(&dlm_reco_state_lock);
787 list_splice_init(&dlm->reco.node_data, &tmplist);
788 spin_unlock(&dlm_reco_state_lock);
789
790 list_for_each_entry_safe(ndata, next, &tmplist, list) {
791 list_del_init(&ndata->list);
792 kfree(ndata);
793 }
794 }
795
796 static int dlm_request_all_locks(struct dlm_ctxt *dlm, u8 request_from,
797 u8 dead_node)
798 {
799 struct dlm_lock_request lr;
800 int ret;
801 int status;
802
803 mlog(0, "\n");
804
805
806 mlog(0, "dlm_request_all_locks: dead node is %u, sending request "
807 "to %u\n", dead_node, request_from);
808
809 memset(&lr, 0, sizeof(lr));
810 lr.node_idx = dlm->node_num;
811 lr.dead_node = dead_node;
812
813 // send message
814 ret = o2net_send_message(DLM_LOCK_REQUEST_MSG, dlm->key,
815 &lr, sizeof(lr), request_from, &status);
816
817 /* negative status is handled by caller */
818 if (ret < 0)
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);
822 else
823 ret = status;
824 // return from here, then
825 // sleep until all received or error
826 return ret;
827
828 }
829
830 int dlm_request_all_locks_handler(struct o2net_msg *msg, u32 len, void *data,
831 void **ret_data)
832 {
833 struct dlm_ctxt *dlm = data;
834 struct dlm_lock_request *lr = (struct dlm_lock_request *)msg->buf;
835 char *buf = NULL;
836 struct dlm_work_item *item = NULL;
837
838 if (!dlm_grab(dlm))
839 return -EINVAL;
840
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);
846 /* this is a hack */
847 dlm_put(dlm);
848 return -ENOMEM;
849 }
850 BUG_ON(lr->dead_node != dlm->reco.dead_node);
851
852 item = kzalloc(sizeof(*item), GFP_NOFS);
853 if (!item) {
854 dlm_put(dlm);
855 return -ENOMEM;
856 }
857
858 /* this will get freed by dlm_request_all_locks_worker */
859 buf = (char *) __get_free_page(GFP_NOFS);
860 if (!buf) {
861 kfree(item);
862 dlm_put(dlm);
863 return -ENOMEM;
864 }
865
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);
875
876 dlm_put(dlm);
877 return 0;
878 }
879
880 static void dlm_request_all_locks_worker(struct dlm_work_item *item, void *data)
881 {
882 struct dlm_migratable_lockres *mres;
883 struct dlm_lock_resource *res;
884 struct dlm_ctxt *dlm;
885 LIST_HEAD(resources);
886 int ret;
887 u8 dead_node, reco_master;
888 int skip_all_done = 0;
889
890 dlm = item->dlm;
891 dead_node = item->u.ral.dead_node;
892 reco_master = item->u.ral.reco_master;
893 mres = (struct dlm_migratable_lockres *)data;
894
895 mlog(0, "%s: recovery worker started, dead=%u, master=%u\n",
896 dlm->name, dead_node, reco_master);
897
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);
908 } else {
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);
913 }
914 goto leave;
915 }
916
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
922 * session. */
923 dlm_move_reco_locks_to_list(dlm, &resources, dead_node);
924
925 /* now we can begin blasting lockreses without the dlm lock */
926
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,
931 DLM_MRES_RECOVERY);
932 if (ret < 0) {
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);
936 skip_all_done = 1;
937 break;
938 }
939 }
940
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);
945
946 if (!skip_all_done) {
947 ret = dlm_send_all_done_msg(dlm, dead_node, reco_master);
948 if (ret < 0) {
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);
952 }
953 }
954 leave:
955 free_page((unsigned long)data);
956 }
957
958
959 static int dlm_send_all_done_msg(struct dlm_ctxt *dlm, u8 dead_node, u8 send_to)
960 {
961 int ret, tmpret;
962 struct dlm_reco_data_done done_msg;
963
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,
969 done_msg.dead_node);
970
971 ret = o2net_send_message(DLM_RECO_DATA_DONE_MSG, dlm->key, &done_msg,
972 sizeof(done_msg), send_to, &tmpret);
973 if (ret < 0) {
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,
976 dead_node);
977 if (!dlm_is_host_down(ret)) {
978 BUG();
979 }
980 } else
981 ret = tmpret;
982 return ret;
983 }
984
985
986 int dlm_reco_data_done_handler(struct o2net_msg *msg, u32 len, void *data,
987 void **ret_data)
988 {
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;
992 int ret = -EINVAL;
993
994 if (!dlm_grab(dlm))
995 return -EINVAL;
996
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);
1000
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);
1005
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)
1009 continue;
1010
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,
1018 ndata->state);
1019 BUG();
1020 break;
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 "
1028 "recovery data!\n",
1029 ndata->node_num);
1030
1031 ndata->state = DLM_RECO_NODE_DATA_DONE;
1032 ret = 0;
1033 break;
1034 }
1035 }
1036 spin_unlock(&dlm_reco_state_lock);
1037
1038 /* wake the recovery thread, some node is done */
1039 if (!ret)
1040 dlm_kick_recovery_thread(dlm);
1041
1042 if (ret < 0)
1043 mlog(ML_ERROR, "failed to find recovery node data for node "
1044 "%u\n", done->node_idx);
1045 dlm_put(dlm);
1046
1047 mlog(0, "leaving reco data done handler, ret=%d\n", ret);
1048 return ret;
1049 }
1050
1051 static void dlm_move_reco_locks_to_list(struct dlm_ctxt *dlm,
1052 struct list_head *list,
1053 u8 dead_node)
1054 {
1055 struct dlm_lock_resource *res, *next;
1056 struct dlm_lock *lock;
1057
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 "
1069 "node %u (%s)!\n",
1070 dead_node, dlm->name);
1071 list_del_init(&lock->list);
1072 dlm_lock_put(lock);
1073 break;
1074 }
1075 }
1076 spin_unlock(&res->spinlock);
1077 continue;
1078 }
1079
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",
1083 dead_node);
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);
1089 }
1090 }
1091 spin_unlock(&dlm->spinlock);
1092 }
1093
1094 static inline int dlm_num_locks_in_lockres(struct dlm_lock_resource *res)
1095 {
1096 int total_locks = 0;
1097 struct list_head *iter, *queue = &res->granted;
1098 int i;
1099
1100 for (i=0; i<3; i++) {
1101 list_for_each(iter, queue)
1102 total_locks++;
1103 queue++;
1104 }
1105 return total_locks;
1106 }
1107
1108
1109 static int dlm_send_mig_lockres_msg(struct dlm_ctxt *dlm,
1110 struct dlm_migratable_lockres *mres,
1111 u8 send_to,
1112 struct dlm_lock_resource *res,
1113 int total_locks)
1114 {
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;
1120
1121 BUG_ON(mres->num_locks > DLM_MAX_MIGRATABLE_LOCKS);
1122 if (!mres->num_locks)
1123 return 0;
1124
1125 sz = sizeof(struct dlm_migratable_lockres) +
1126 (mres->num_locks * sizeof(struct dlm_migratable_lock));
1127
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;
1133
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",
1137 send_to);
1138
1139 /* send it */
1140 ret = o2net_send_message(DLM_MIG_LOCKRES_MSG, dlm->key, mres,
1141 sz, send_to, &status);
1142 if (ret < 0) {
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"));
1150 } else {
1151 /* might get an -ENOMEM back here */
1152 ret = status;
1153 if (ret < 0) {
1154 mlog_errno(ret);
1155
1156 if (ret == -EFAULT) {
1157 mlog(ML_ERROR, "node %u told me to kill "
1158 "myself!\n", send_to);
1159 BUG();
1160 }
1161 }
1162 }
1163
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);
1168 return ret;
1169 }
1170
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)
1175 {
1176 /* mres here is one full page */
1177 clear_page(mres);
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;
1185 }
1186
1187 static void dlm_prepare_lvb_for_migration(struct dlm_lock *lock,
1188 struct dlm_migratable_lockres *mres,
1189 int queue)
1190 {
1191 if (!lock->lksb)
1192 return;
1193
1194 /* Ignore lvb in all locks in the blocked list */
1195 if (queue == DLM_BLOCKED_LIST)
1196 return;
1197
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)
1200 return;
1201
1202 if (dlm_lvb_is_empty(mres->lvb)) {
1203 memcpy(mres->lvb, lock->lksb->lvb, DLM_LVB_LEN);
1204 return;
1205 }
1206
1207 /* Ensure the lvb copied for migration matches in other valid locks */
1208 if (!memcmp(mres->lvb, lock->lksb->lvb, DLM_LVB_LEN))
1209 return;
1210
1211 mlog(ML_ERROR, "Mismatched lvb in lock cookie=%u:%llu, name=%.*s, "
1212 "node=%u\n",
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,
1216 lock->ml.node);
1217 dlm_print_one_lock_resource(lock->lockres);
1218 BUG();
1219 }
1220
1221 /* returns 1 if this lock fills the network structure,
1222 * 0 otherwise */
1223 static int dlm_add_lock_to_array(struct dlm_lock *lock,
1224 struct dlm_migratable_lockres *mres, int queue)
1225 {
1226 struct dlm_migratable_lock *ml;
1227 int lock_num = mres->num_locks;
1228
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;
1234 ml->list = queue;
1235 if (lock->lksb) {
1236 ml->flags = lock->lksb->flags;
1237 dlm_prepare_lvb_for_migration(lock, mres, queue);
1238 }
1239 ml->node = lock->ml.node;
1240 mres->num_locks++;
1241 /* we reached the max, send this network message */
1242 if (mres->num_locks == DLM_MAX_MIGRATABLE_LOCKS)
1243 return 1;
1244 return 0;
1245 }
1246
1247 static void dlm_add_dummy_lock(struct dlm_ctxt *dlm,
1248 struct dlm_migratable_lockres *mres)
1249 {
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;
1256 dummy.lksb = NULL;
1257 dummy.ml.node = dlm->node_num;
1258 dlm_add_lock_to_array(&dummy, mres, DLM_BLOCKED_LIST);
1259 }
1260
1261 static inline int dlm_is_dummy_lock(struct dlm_ctxt *dlm,
1262 struct dlm_migratable_lock *ml,
1263 u8 *nodenum)
1264 {
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;
1271 return 1;
1272 }
1273 return 0;
1274 }
1275
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)
1279 {
1280 struct list_head *queue;
1281 int total_locks, i;
1282 u64 mig_cookie = 0;
1283 struct dlm_lock *lock;
1284 int ret = 0;
1285
1286 BUG_ON(!(flags & (DLM_MRES_RECOVERY|DLM_MRES_MIGRATION)));
1287
1288 mlog(0, "sending to %u\n", send_to);
1289
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();
1297 }
1298
1299 dlm_init_migratable_lockres(mres, res->lockname.name,
1300 res->lockname.len, total_locks,
1301 mig_cookie, flags, res->owner);
1302
1303 total_locks = 0;
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. */
1308 total_locks++;
1309 if (!dlm_add_lock_to_array(lock, mres, i))
1310 continue;
1311
1312 /* this filled the lock message,
1313 * we must send it immediately. */
1314 ret = dlm_send_mig_lockres_msg(dlm, mres, send_to,
1315 res, total_locks);
1316 if (ret < 0)
1317 goto error;
1318 }
1319 }
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" :
1325 "migration");
1326 dlm_add_dummy_lock(dlm, mres);
1327 }
1328 /* flush any remaining locks */
1329 ret = dlm_send_mig_lockres_msg(dlm, mres, send_to, res, total_locks);
1330 if (ret < 0)
1331 goto error;
1332 return ret;
1333
1334 error:
1335 mlog(ML_ERROR, "%s: dlm_send_mig_lockres_msg returned %d\n",
1336 dlm->name, ret);
1337 if (!dlm_is_host_down(ret))
1338 BUG();
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);
1343 return ret;
1344 }
1345
1346
1347
1348 /*
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
1353 * possible).
1354 */
1355 /*
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
1359 */
1360
1361 int dlm_mig_lockres_handler(struct o2net_msg *msg, u32 len, void *data,
1362 void **ret_data)
1363 {
1364 struct dlm_ctxt *dlm = data;
1365 struct dlm_migratable_lockres *mres =
1366 (struct dlm_migratable_lockres *)msg->buf;
1367 int ret = 0;
1368 u8 real_master;
1369 u8 extra_refs = 0;
1370 char *buf = NULL;
1371 struct dlm_work_item *item = NULL;
1372 struct dlm_lock_resource *res = NULL;
1373
1374 if (!dlm_grab(dlm))
1375 return -EINVAL;
1376
1377 BUG_ON(!(mres->flags & (DLM_MRES_RECOVERY|DLM_MRES_MIGRATION)));
1378
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));
1383 }
1384
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");
1390
1391 ret = -ENOMEM;
1392 buf = kmalloc(be16_to_cpu(msg->data_len), GFP_NOFS);
1393 item = kzalloc(sizeof(*item), GFP_NOFS);
1394 if (!buf || !item)
1395 goto leave;
1396
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);
1401 if (res) {
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;
1407 } else {
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",
1412 mres->lockname_len,
1413 mres->lockname);
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);
1419 ret = -EFAULT;
1420 spin_unlock(&res->spinlock);
1421 dlm_lockres_put(res);
1422 goto leave;
1423 }
1424 res->state |= DLM_LOCK_RES_MIGRATING;
1425 }
1426 spin_unlock(&res->spinlock);
1427 } else {
1428 /* need to allocate, just like if it was
1429 * mastered here normally */
1430 res = dlm_new_lockres(dlm, mres->lockname, mres->lockname_len);
1431 if (!res)
1432 goto leave;
1433
1434 /* to match the ref that we would have gotten if
1435 * dlm_lookup_lockres had succeeded */
1436 dlm_lockres_get(res);
1437
1438 /* mark it as recovering/migrating and hash it */
1439 if (mres->flags & DLM_MRES_RECOVERY)
1440 res->state |= DLM_LOCK_RES_RECOVERING;
1441 else
1442 res->state |= DLM_LOCK_RES_MIGRATING;
1443
1444 spin_lock(&dlm->spinlock);
1445 __dlm_insert_lockres(dlm, res);
1446 spin_unlock(&dlm->spinlock);
1447
1448 /* Add an extra ref for this lock-less lockres lest the
1449 * dlm_thread purges it before we get the chance to add
1450 * locks to it */
1451 dlm_lockres_get(res);
1452
1453 /* There are three refs that need to be put.
1454 * 1. Taken above.
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() */
1462 extra_refs++;
1463
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);
1469 wake_up(&res->wq);
1470 }
1471
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. */
1475 ret = 0;
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);
1486 } else {
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);
1490 }
1491 spin_unlock(&res->spinlock);
1492
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);
1504
1505 leave:
1506 /* One extra ref taken needs to be put here */
1507 if (extra_refs)
1508 dlm_lockres_put(res);
1509
1510 dlm_put(dlm);
1511 if (ret < 0) {
1512 kfree(buf);
1513 kfree(item);
1514 mlog_errno(ret);
1515 }
1516
1517 return ret;
1518 }
1519
1520
1521 static void dlm_mig_lockres_worker(struct dlm_work_item *item, void *data)
1522 {
1523 struct dlm_ctxt *dlm;
1524 struct dlm_migratable_lockres *mres;
1525 int ret = 0;
1526 struct dlm_lock_resource *res;
1527 u8 real_master;
1528 u8 extra_ref;
1529
1530 dlm = item->dlm;
1531 mres = (struct dlm_migratable_lockres *)data;
1532
1533 res = item->u.ml.lockres;
1534 real_master = item->u.ml.real_master;
1535 extra_ref = item->u.ml.extra_ref;
1536
1537 if (real_master == DLM_LOCK_RES_OWNER_UNKNOWN) {
1538 /* this case is super-rare. only occurs if
1539 * node death happens during migration. */
1540 again:
1541 ret = dlm_lockres_master_requery(dlm, res, &real_master);
1542 if (ret < 0) {
1543 mlog(0, "dlm_lockres_master_requery ret=%d\n",
1544 ret);
1545 goto again;
1546 }
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);
1551 } else {
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 */
1560 goto leave;
1561 }
1562 }
1563
1564 ret = dlm_process_recovery_data(dlm, res, mres);
1565 if (ret < 0)
1566 mlog(0, "dlm_process_recovery_data returned %d\n", ret);
1567 else
1568 mlog(0, "dlm_process_recovery_data succeeded\n");
1569
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);
1573 if (ret < 0)
1574 mlog_errno(ret);
1575 }
1576
1577 leave:
1578 /* See comment in dlm_mig_lockres_handler() */
1579 if (res) {
1580 if (extra_ref)
1581 dlm_lockres_put(res);
1582 dlm_lockres_put(res);
1583 }
1584 kfree(data);
1585 }
1586
1587
1588
1589 static int dlm_lockres_master_requery(struct dlm_ctxt *dlm,
1590 struct dlm_lock_resource *res,
1591 u8 *real_master)
1592 {
1593 struct dlm_node_iter iter;
1594 int nodenum;
1595 int ret = 0;
1596
1597 *real_master = DLM_LOCK_RES_OWNER_UNKNOWN;
1598
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
1610 * is UNKNOWN.
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
1621 * was rejected. */
1622 spin_lock(&dlm->spinlock);
1623 dlm_node_iter_init(dlm->domain_map, &iter);
1624 spin_unlock(&dlm->spinlock);
1625
1626 while ((nodenum = dlm_node_iter_next(&iter)) >= 0) {
1627 /* do not send to self */
1628 if (nodenum == dlm->node_num)
1629 continue;
1630 ret = dlm_do_master_requery(dlm, res, nodenum, real_master);
1631 if (ret < 0) {
1632 mlog_errno(ret);
1633 if (!dlm_is_host_down(ret))
1634 BUG();
1635 /* host is down, so answer for that node would be
1636 * DLM_LOCK_RES_OWNER_UNKNOWN. continue. */
1637 }
1638 if (*real_master != DLM_LOCK_RES_OWNER_UNKNOWN) {
1639 mlog(0, "lock master is %u\n", *real_master);
1640 break;
1641 }
1642 }
1643 return ret;
1644 }
1645
1646
1647 int dlm_do_master_requery(struct dlm_ctxt *dlm, struct dlm_lock_resource *res,
1648 u8 nodenum, u8 *real_master)
1649 {
1650 int ret = -EINVAL;
1651 struct dlm_master_requery req;
1652 int status = DLM_LOCK_RES_OWNER_UNKNOWN;
1653
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);
1658
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. */
1662 if (ret < 0)
1663 mlog(ML_ERROR, "Error %d when sending message %u (key "
1664 "0x%x) to node %u\n", ret, DLM_MASTER_REQUERY_MSG,
1665 dlm->key, nodenum);
1666 else {
1667 BUG_ON(status < 0);
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);
1672 ret = 0;
1673 }
1674 return ret;
1675 }
1676
1677
1678 /* this function cannot error, so unless the sending
1679 * or receiving of the message failed, the owner can
1680 * be trusted */
1681 int dlm_master_requery_handler(struct o2net_msg *msg, u32 len, void *data,
1682 void **ret_data)
1683 {
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;
1687 unsigned int hash;
1688 int master = DLM_LOCK_RES_OWNER_UNKNOWN;
1689 u32 flags = DLM_ASSERT_MASTER_REQUERY;
1690
1691 if (!dlm_grab(dlm)) {
1692 /* since the domain has gone away on this
1693 * node, the proper response is UNKNOWN */
1694 return master;
1695 }
1696
1697 hash = dlm_lockid_hash(req->name, req->namelen);
1698
1699 spin_lock(&dlm->spinlock);
1700 res = __dlm_lookup_lockres(dlm, req->name, req->namelen, hash);
1701 if (res) {
1702 spin_lock(&res->spinlock);
1703 master = res->owner;
1704 if (master == dlm->node_num) {
1705 int ret = dlm_dispatch_assert_master(dlm, res,
1706 0, 0, flags);
1707 if (ret < 0) {
1708 mlog_errno(-ENOMEM);
1709 /* retry!? */
1710 BUG();
1711 } else
1712 __dlm_lockres_grab_inflight_worker(dlm, res);
1713 } else /* put.. incase we are not the master */
1714 dlm_lockres_put(res);
1715 spin_unlock(&res->spinlock);
1716 }
1717 spin_unlock(&dlm->spinlock);
1718
1719 dlm_put(dlm);
1720 return master;
1721 }
1722
1723 static inline struct list_head *
1724 dlm_list_num_to_pointer(struct dlm_lock_resource *res, int list_num)
1725 {
1726 struct list_head *ret;
1727 BUG_ON(list_num < 0);
1728 BUG_ON(list_num > 2);
1729 ret = &(res->granted);
1730 ret += list_num;
1731 return ret;
1732 }
1733 /* TODO: do ast flush business
1734 * TODO: do MIGRATING and RECOVERING spinning
1735 */
1736
1737 /*
1738 * NOTE about in-flight requests during migration:
1739 *
1740 * Before attempting the migrate, the master has marked the lockres as
1741 * MIGRATING and then flushed all of its pending ASTS. So any in-flight
1742 * requests either got queued before the MIGRATING flag got set, in which
1743 * case the lock data will reflect the change and a return message is on
1744 * the way, or the request failed to get in before MIGRATING got set. In
1745 * this case, the caller will be told to spin and wait for the MIGRATING
1746 * flag to be dropped, then recheck the master.
1747 * This holds true for the convert, cancel and unlock cases, and since lvb
1748 * updates are tied to these same messages, it applies to lvb updates as
1749 * well. For the lock case, there is no way a lock can be on the master
1750 * queue and not be on the secondary queue since the lock is always added
1751 * locally first. This means that the new target node will never be sent
1752 * a lock that he doesn't already have on the list.
1753 * In total, this means that the local lock is correct and should not be
1754 * updated to match the one sent by the master. Any messages sent back
1755 * from the master before the MIGRATING flag will bring the lock properly
1756 * up-to-date, and the change will be ordered properly for the waiter.
1757 * We will *not* attempt to modify the lock underneath the waiter.
1758 */
1759
1760 static int dlm_process_recovery_data(struct dlm_ctxt *dlm,
1761 struct dlm_lock_resource *res,
1762 struct dlm_migratable_lockres *mres)
1763 {
1764 struct dlm_migratable_lock *ml;
1765 struct list_head *queue, *iter;
1766 struct list_head *tmpq = NULL;
1767 struct dlm_lock *newlock = NULL;
1768 struct dlm_lockstatus *lksb = NULL;
1769 int ret = 0;
1770 int i, j, bad;
1771 struct dlm_lock *lock;
1772 u8 from = O2NM_MAX_NODES;
1773 unsigned int added = 0;
1774 __be64 c;
1775
1776 mlog(0, "running %d locks for this lockres\n", mres->num_locks);
1777 for (i=0; i<mres->num_locks; i++) {
1778 ml = &(mres->ml[i]);
1779
1780 if (dlm_is_dummy_lock(dlm, ml, &from)) {
1781 /* placeholder, just need to set the refmap bit */
1782 BUG_ON(mres->num_locks != 1);
1783 mlog(0, "%s:%.*s: dummy lock for %u\n",
1784 dlm->name, mres->lockname_len, mres->lockname,
1785 from);
1786 spin_lock(&res->spinlock);
1787 dlm_lockres_set_refmap_bit(dlm, res, from);
1788 spin_unlock(&res->spinlock);
1789 added++;
1790 break;
1791 }
1792 BUG_ON(ml->highest_blocked != LKM_IVMODE);
1793 newlock = NULL;
1794 lksb = NULL;
1795
1796 queue = dlm_list_num_to_pointer(res, ml->list);
1797 tmpq = NULL;
1798
1799 /* if the lock is for the local node it needs to
1800 * be moved to the proper location within the queue.
1801 * do not allocate a new lock structure. */
1802 if (ml->node == dlm->node_num) {
1803 /* MIGRATION ONLY! */
1804 BUG_ON(!(mres->flags & DLM_MRES_MIGRATION));
1805
1806 lock = NULL;
1807 spin_lock(&res->spinlock);
1808 for (j = DLM_GRANTED_LIST; j <= DLM_BLOCKED_LIST; j++) {
1809 tmpq = dlm_list_idx_to_ptr(res, j);
1810 list_for_each(iter, tmpq) {
1811 lock = list_entry(iter,
1812 struct dlm_lock, list);
1813 if (lock->ml.cookie == ml->cookie)
1814 break;
1815 lock = NULL;
1816 }
1817 if (lock)
1818 break;
1819 }
1820
1821 /* lock is always created locally first, and
1822 * destroyed locally last. it must be on the list */
1823 if (!lock) {
1824 c = ml->cookie;
1825 mlog(ML_ERROR, "Could not find local lock "
1826 "with cookie %u:%llu, node %u, "
1827 "list %u, flags 0x%x, type %d, "
1828 "conv %d, highest blocked %d\n",
1829 dlm_get_lock_cookie_node(be64_to_cpu(c)),
1830 dlm_get_lock_cookie_seq(be64_to_cpu(c)),
1831 ml->node, ml->list, ml->flags, ml->type,
1832 ml->convert_type, ml->highest_blocked);
1833 __dlm_print_one_lock_resource(res);
1834 BUG();
1835 }
1836
1837 if (lock->ml.node != ml->node) {
1838 c = lock->ml.cookie;
1839 mlog(ML_ERROR, "Mismatched node# in lock "
1840 "cookie %u:%llu, name %.*s, node %u\n",
1841 dlm_get_lock_cookie_node(be64_to_cpu(c)),
1842 dlm_get_lock_cookie_seq(be64_to_cpu(c)),
1843 res->lockname.len, res->lockname.name,
1844 lock->ml.node);
1845 c = ml->cookie;
1846 mlog(ML_ERROR, "Migrate lock cookie %u:%llu, "
1847 "node %u, list %u, flags 0x%x, type %d, "
1848 "conv %d, highest blocked %d\n",
1849 dlm_get_lock_cookie_node(be64_to_cpu(c)),
1850 dlm_get_lock_cookie_seq(be64_to_cpu(c)),
1851 ml->node, ml->list, ml->flags, ml->type,
1852 ml->convert_type, ml->highest_blocked);
1853 __dlm_print_one_lock_resource(res);
1854 BUG();
1855 }
1856
1857 if (tmpq != queue) {
1858 c = ml->cookie;
1859 mlog(0, "Lock cookie %u:%llu was on list %u "
1860 "instead of list %u for %.*s\n",
1861 dlm_get_lock_cookie_node(be64_to_cpu(c)),
1862 dlm_get_lock_cookie_seq(be64_to_cpu(c)),
1863 j, ml->list, res->lockname.len,
1864 res->lockname.name);
1865 __dlm_print_one_lock_resource(res);
1866 spin_unlock(&res->spinlock);
1867 continue;
1868 }
1869
1870 /* see NOTE above about why we do not update
1871 * to match the master here */
1872
1873 /* move the lock to its proper place */
1874 /* do not alter lock refcount. switching lists. */
1875 list_move_tail(&lock->list, queue);
1876 spin_unlock(&res->spinlock);
1877 added++;
1878
1879 mlog(0, "just reordered a local lock!\n");
1880 continue;
1881 }
1882
1883 /* lock is for another node. */
1884 newlock = dlm_new_lock(ml->type, ml->node,
1885 be64_to_cpu(ml->cookie), NULL);
1886 if (!newlock) {
1887 ret = -ENOMEM;
1888 goto leave;
1889 }
1890 lksb = newlock->lksb;
1891 dlm_lock_attach_lockres(newlock, res);
1892
1893 if (ml->convert_type != LKM_IVMODE) {
1894 BUG_ON(queue != &res->converting);
1895 newlock->ml.convert_type = ml->convert_type;
1896 }
1897 lksb->flags |= (ml->flags &
1898 (DLM_LKSB_PUT_LVB|DLM_LKSB_GET_LVB));
1899
1900 if (ml->type == LKM_NLMODE)
1901 goto skip_lvb;
1902
1903 /*
1904 * If the lock is in the blocked list it can't have a valid lvb,
1905 * so skip it
1906 */
1907 if (ml->list == DLM_BLOCKED_LIST)
1908 goto skip_lvb;
1909
1910 if (!dlm_lvb_is_empty(mres->lvb)) {
1911 if (lksb->flags & DLM_LKSB_PUT_LVB) {
1912 /* other node was trying to update
1913 * lvb when node died. recreate the
1914 * lksb with the updated lvb. */
1915 memcpy(lksb->lvb, mres->lvb, DLM_LVB_LEN);
1916 /* the lock resource lvb update must happen
1917 * NOW, before the spinlock is dropped.
1918 * we no longer wait for the AST to update
1919 * the lvb. */
1920 memcpy(res->lvb, mres->lvb, DLM_LVB_LEN);
1921 } else {
1922 /* otherwise, the node is sending its
1923 * most recent valid lvb info */
1924 BUG_ON(ml->type != LKM_EXMODE &&
1925 ml->type != LKM_PRMODE);
1926 if (!dlm_lvb_is_empty(res->lvb) &&
1927 (ml->type == LKM_EXMODE ||
1928 memcmp(res->lvb, mres->lvb, DLM_LVB_LEN))) {
1929 int i;
1930 mlog(ML_ERROR, "%s:%.*s: received bad "
1931 "lvb! type=%d\n", dlm->name,
1932 res->lockname.len,
1933 res->lockname.name, ml->type);
1934 printk("lockres lvb=[");
1935 for (i=0; i<DLM_LVB_LEN; i++)
1936 printk("%02x", res->lvb[i]);
1937 printk("]\nmigrated lvb=[");
1938 for (i=0; i<DLM_LVB_LEN; i++)
1939 printk("%02x", mres->lvb[i]);
1940 printk("]\n");
1941 dlm_print_one_lock_resource(res);
1942 BUG();
1943 }
1944 memcpy(res->lvb, mres->lvb, DLM_LVB_LEN);
1945 }
1946 }
1947 skip_lvb:
1948
1949 /* NOTE:
1950 * wrt lock queue ordering and recovery:
1951 * 1. order of locks on granted queue is
1952 * meaningless.
1953 * 2. order of locks on converting queue is
1954 * LOST with the node death. sorry charlie.
1955 * 3. order of locks on the blocked queue is
1956 * also LOST.
1957 * order of locks does not affect integrity, it
1958 * just means that a lock request may get pushed
1959 * back in line as a result of the node death.
1960 * also note that for a given node the lock order
1961 * for its secondary queue locks is preserved
1962 * relative to each other, but clearly *not*
1963 * preserved relative to locks from other nodes.
1964 */
1965 bad = 0;
1966 spin_lock(&res->spinlock);
1967 list_for_each_entry(lock, queue, list) {
1968 if (lock->ml.cookie == ml->cookie) {
1969 c = lock->ml.cookie;
1970 mlog(ML_ERROR, "%s:%.*s: %u:%llu: lock already "
1971 "exists on this lockres!\n", dlm->name,
1972 res->lockname.len, res->lockname.name,
1973 dlm_get_lock_cookie_node(be64_to_cpu(c)),
1974 dlm_get_lock_cookie_seq(be64_to_cpu(c)));
1975
1976 mlog(ML_NOTICE, "sent lock: type=%d, conv=%d, "
1977 "node=%u, cookie=%u:%llu, queue=%d\n",
1978 ml->type, ml->convert_type, ml->node,
1979 dlm_get_lock_cookie_node(be64_to_cpu(ml->cookie)),
1980 dlm_get_lock_cookie_seq(be64_to_cpu(ml->cookie)),
1981 ml->list);
1982
1983 __dlm_print_one_lock_resource(res);
1984 bad = 1;
1985 break;
1986 }
1987 }
1988 if (!bad) {
1989 dlm_lock_get(newlock);
1990 if (mres->flags & DLM_MRES_RECOVERY &&
1991 ml->list == DLM_CONVERTING_LIST &&
1992 newlock->ml.type >
1993 newlock->ml.convert_type) {
1994 /* newlock is doing downconvert, add it to the
1995 * head of converting list */
1996 list_add(&newlock->list, queue);
1997 } else
1998 list_add_tail(&newlock->list, queue);
1999 mlog(0, "%s:%.*s: added lock for node %u, "
2000 "setting refmap bit\n", dlm->name,
2001 res->lockname.len, res->lockname.name, ml->node);
2002 dlm_lockres_set_refmap_bit(dlm, res, ml->node);
2003 added++;
2004 }
2005 spin_unlock(&res->spinlock);
2006 }
2007 mlog(0, "done running all the locks\n");
2008
2009 leave:
2010 /* balance the ref taken when the work was queued */
2011 spin_lock(&res->spinlock);
2012 dlm_lockres_drop_inflight_ref(dlm, res);
2013 spin_unlock(&res->spinlock);
2014
2015 if (ret < 0) {
2016 mlog_errno(ret);
2017 if (newlock)
2018 dlm_lock_put(newlock);
2019 }
2020
2021 return ret;
2022 }
2023
2024 void dlm_move_lockres_to_recovery_list(struct dlm_ctxt *dlm,
2025 struct dlm_lock_resource *res)
2026 {
2027 int i;
2028 struct list_head *queue;
2029 struct dlm_lock *lock, *next;
2030
2031 assert_spin_locked(&dlm->spinlock);
2032 assert_spin_locked(&res->spinlock);
2033 res->state |= DLM_LOCK_RES_RECOVERING;
2034 if (!list_empty(&res->recovering)) {
2035 mlog(0,
2036 "Recovering res %s:%.*s, is already on recovery list!\n",
2037 dlm->name, res->lockname.len, res->lockname.name);
2038 list_del_init(&res->recovering);
2039 dlm_lockres_put(res);
2040 }
2041 /* We need to hold a reference while on the recovery list */
2042 dlm_lockres_get(res);
2043 list_add_tail(&res->recovering, &dlm->reco.resources);
2044
2045 /* find any pending locks and put them back on proper list */
2046 for (i=DLM_BLOCKED_LIST; i>=DLM_GRANTED_LIST; i--) {
2047 queue = dlm_list_idx_to_ptr(res, i);
2048 list_for_each_entry_safe(lock, next, queue, list) {
2049 dlm_lock_get(lock);
2050 if (lock->convert_pending) {
2051 /* move converting lock back to granted */
2052 BUG_ON(i != DLM_CONVERTING_LIST);
2053 mlog(0, "node died with convert pending "
2054 "on %.*s. move back to granted list.\n",
2055 res->lockname.len, res->lockname.name);
2056 dlm_revert_pending_convert(res, lock);
2057 lock->convert_pending = 0;
2058 } else if (lock->lock_pending) {
2059 /* remove pending lock requests completely */
2060 BUG_ON(i != DLM_BLOCKED_LIST);
2061 mlog(0, "node died with lock pending "
2062 "on %.*s. remove from blocked list and skip.\n",
2063 res->lockname.len, res->lockname.name);
2064 /* lock will be floating until ref in
2065 * dlmlock_remote is freed after the network
2066 * call returns. ok for it to not be on any
2067 * list since no ast can be called
2068 * (the master is dead). */
2069 dlm_revert_pending_lock(res, lock);
2070 lock->lock_pending = 0;
2071 } else if (lock->unlock_pending) {
2072 /* if an unlock was in progress, treat as
2073 * if this had completed successfully
2074 * before sending this lock state to the
2075 * new master. note that the dlm_unlock
2076 * call is still responsible for calling
2077 * the unlockast. that will happen after
2078 * the network call times out. for now,
2079 * just move lists to prepare the new
2080 * recovery master. */
2081 BUG_ON(i != DLM_GRANTED_LIST);
2082 mlog(0, "node died with unlock pending "
2083 "on %.*s. remove from blocked list and skip.\n",
2084 res->lockname.len, res->lockname.name);
2085 dlm_commit_pending_unlock(res, lock);
2086 lock->unlock_pending = 0;
2087 } else if (lock->cancel_pending) {
2088 /* if a cancel was in progress, treat as
2089 * if this had completed successfully
2090 * before sending this lock state to the
2091 * new master */
2092 BUG_ON(i != DLM_CONVERTING_LIST);
2093 mlog(0, "node died with cancel pending "
2094 "on %.*s. move back to granted list.\n",
2095 res->lockname.len, res->lockname.name);
2096 dlm_commit_pending_cancel(res, lock);
2097 lock->cancel_pending = 0;
2098 }
2099 dlm_lock_put(lock);
2100 }
2101 }
2102 }
2103
2104
2105
2106 /* removes all recovered locks from the recovery list.
2107 * sets the res->owner to the new master.
2108 * unsets the RECOVERY flag and wakes waiters. */
2109 static void dlm_finish_local_lockres_recovery(struct dlm_ctxt *dlm,
2110 u8 dead_node, u8 new_master)
2111 {
2112 int i;
2113 struct hlist_head *bucket;
2114 struct dlm_lock_resource *res, *next;
2115
2116 assert_spin_locked(&dlm->spinlock);
2117
2118 list_for_each_entry_safe(res, next, &dlm->reco.resources, recovering) {
2119 if (res->owner == dead_node) {
2120 mlog(0, "%s: res %.*s, Changing owner from %u to %u\n",
2121 dlm->name, res->lockname.len, res->lockname.name,
2122 res->owner, new_master);
2123 list_del_init(&res->recovering);
2124 spin_lock(&res->spinlock);
2125 /* new_master has our reference from
2126 * the lock state sent during recovery */
2127 dlm_change_lockres_owner(dlm, res, new_master);
2128 res->state &= ~DLM_LOCK_RES_RECOVERING;
2129 if (__dlm_lockres_has_locks(res))
2130 __dlm_dirty_lockres(dlm, res);
2131 spin_unlock(&res->spinlock);
2132 wake_up(&res->wq);
2133 dlm_lockres_put(res);
2134 }
2135 }
2136
2137 /* this will become unnecessary eventually, but
2138 * for now we need to run the whole hash, clear
2139 * the RECOVERING state and set the owner
2140 * if necessary */
2141 for (i = 0; i < DLM_HASH_BUCKETS; i++) {
2142 bucket = dlm_lockres_hash(dlm, i);
2143 hlist_for_each_entry(res, bucket, hash_node) {
2144 if (!(res->state & DLM_LOCK_RES_RECOVERING))
2145 continue;
2146
2147 if (res->owner != dead_node &&
2148 res->owner != dlm->node_num)
2149 continue;
2150
2151 if (!list_empty(&res->recovering)) {
2152 list_del_init(&res->recovering);
2153 dlm_lockres_put(res);
2154 }
2155
2156 /* new_master has our reference from
2157 * the lock state sent during recovery */
2158 mlog(0, "%s: res %.*s, Changing owner from %u to %u\n",
2159 dlm->name, res->lockname.len, res->lockname.name,
2160 res->owner, new_master);
2161 spin_lock(&res->spinlock);
2162 dlm_change_lockres_owner(dlm, res, new_master);
2163 res->state &= ~DLM_LOCK_RES_RECOVERING;
2164 if (__dlm_lockres_has_locks(res))
2165 __dlm_dirty_lockres(dlm, res);
2166 spin_unlock(&res->spinlock);
2167 wake_up(&res->wq);
2168 }
2169 }
2170 }
2171
2172 static inline int dlm_lvb_needs_invalidation(struct dlm_lock *lock, int local)
2173 {
2174 if (local) {
2175 if (lock->ml.type != LKM_EXMODE &&
2176 lock->ml.type != LKM_PRMODE)
2177 return 1;
2178 } else if (lock->ml.type == LKM_EXMODE)
2179 return 1;
2180 return 0;
2181 }
2182
2183 static void dlm_revalidate_lvb(struct dlm_ctxt *dlm,
2184 struct dlm_lock_resource *res, u8 dead_node)
2185 {
2186 struct list_head *queue;
2187 struct dlm_lock *lock;
2188 int blank_lvb = 0, local = 0;
2189 int i;
2190 u8 search_node;
2191
2192 assert_spin_locked(&dlm->spinlock);
2193 assert_spin_locked(&res->spinlock);
2194
2195 if (res->owner == dlm->node_num)
2196 /* if this node owned the lockres, and if the dead node
2197 * had an EX when he died, blank out the lvb */
2198 search_node = dead_node;
2199 else {
2200 /* if this is a secondary lockres, and we had no EX or PR
2201 * locks granted, we can no longer trust the lvb */
2202 search_node = dlm->node_num;
2203 local = 1; /* check local state for valid lvb */
2204 }
2205
2206 for (i=DLM_GRANTED_LIST; i<=DLM_CONVERTING_LIST; i++) {
2207 queue = dlm_list_idx_to_ptr(res, i);
2208 list_for_each_entry(lock, queue, list) {
2209 if (lock->ml.node == search_node) {
2210 if (dlm_lvb_needs_invalidation(lock, local)) {
2211 /* zero the lksb lvb and lockres lvb */
2212 blank_lvb = 1;
2213 memset(lock->lksb->lvb, 0, DLM_LVB_LEN);
2214 }
2215 }
2216 }
2217 }
2218
2219 if (blank_lvb) {
2220 mlog(0, "clearing %.*s lvb, dead node %u had EX\n",
2221 res->lockname.len, res->lockname.name, dead_node);
2222 memset(res->lvb, 0, DLM_LVB_LEN);
2223 }
2224 }
2225
2226 static void dlm_free_dead_locks(struct dlm_ctxt *dlm,
2227 struct dlm_lock_resource *res, u8 dead_node)
2228 {
2229 struct dlm_lock *lock, *next;
2230 unsigned int freed = 0;
2231
2232 /* this node is the lockres master:
2233 * 1) remove any stale locks for the dead node
2234 * 2) if the dead node had an EX when he died, blank out the lvb
2235 */
2236 assert_spin_locked(&dlm->spinlock);
2237 assert_spin_locked(&res->spinlock);
2238
2239 /* We do two dlm_lock_put(). One for removing from list and the other is
2240 * to force the DLM_UNLOCK_FREE_LOCK action so as to free the locks */
2241
2242 /* TODO: check pending_asts, pending_basts here */
2243 list_for_each_entry_safe(lock, next, &res->granted, list) {
2244 if (lock->ml.node == dead_node) {
2245 list_del_init(&lock->list);
2246 dlm_lock_put(lock);
2247 /* Can't schedule DLM_UNLOCK_FREE_LOCK - do manually */
2248 dlm_lock_put(lock);
2249 freed++;
2250 }
2251 }
2252 list_for_each_entry_safe(lock, next, &res->converting, list) {
2253 if (lock->ml.node == dead_node) {
2254 list_del_init(&lock->list);
2255 dlm_lock_put(lock);
2256 /* Can't schedule DLM_UNLOCK_FREE_LOCK - do manually */
2257 dlm_lock_put(lock);
2258 freed++;
2259 }
2260 }
2261 list_for_each_entry_safe(lock, next, &res->blocked, list) {
2262 if (lock->ml.node == dead_node) {
2263 list_del_init(&lock->list);
2264 dlm_lock_put(lock);
2265 /* Can't schedule DLM_UNLOCK_FREE_LOCK - do manually */
2266 dlm_lock_put(lock);
2267 freed++;
2268 }
2269 }
2270
2271 if (freed) {
2272 mlog(0, "%s:%.*s: freed %u locks for dead node %u, "
2273 "dropping ref from lockres\n", dlm->name,
2274 res->lockname.len, res->lockname.name, freed, dead_node);
2275 if(!test_bit(dead_node, res->refmap)) {
2276 mlog(ML_ERROR, "%s:%.*s: freed %u locks for dead node %u, "
2277 "but ref was not set\n", dlm->name,
2278 res->lockname.len, res->lockname.name, freed, dead_node);
2279 __dlm_print_one_lock_resource(res);
2280 }
2281 dlm_lockres_clear_refmap_bit(dlm, res, dead_node);
2282 } else if (test_bit(dead_node, res->refmap)) {
2283 mlog(0, "%s:%.*s: dead node %u had a ref, but had "
2284 "no locks and had not purged before dying\n", dlm->name,
2285 res->lockname.len, res->lockname.name, dead_node);
2286 dlm_lockres_clear_refmap_bit(dlm, res, dead_node);
2287 }
2288
2289 /* do not kick thread yet */
2290 __dlm_dirty_lockres(dlm, res);
2291 }
2292
2293 /* if this node is the recovery master, and there are no
2294 * locks for a given lockres owned by this node that are in
2295 * either PR or EX mode, zero out the lvb before requesting.
2296 *
2297 */
2298
2299
2300 static void dlm_do_local_recovery_cleanup(struct dlm_ctxt *dlm, u8 dead_node)
2301 {
2302 struct dlm_lock_resource *res;
2303 int i;
2304 struct hlist_head *bucket;
2305 struct dlm_lock *lock;
2306
2307
2308 /* purge any stale mles */
2309 dlm_clean_master_list(dlm, dead_node);
2310
2311 /*
2312 * now clean up all lock resources. there are two rules:
2313 *
2314 * 1) if the dead node was the master, move the lockres
2315 * to the recovering list. set the RECOVERING flag.
2316 * this lockres needs to be cleaned up before it can
2317 * be used further.
2318 *
2319 * 2) if this node was the master, remove all locks from
2320 * each of the lockres queues that were owned by the
2321 * dead node. once recovery finishes, the dlm thread
2322 * can be kicked again to see if any ASTs or BASTs
2323 * need to be fired as a result.
2324 */
2325 for (i = 0; i < DLM_HASH_BUCKETS; i++) {
2326 bucket = dlm_lockres_hash(dlm, i);
2327 hlist_for_each_entry(res, bucket, hash_node) {
2328 /* always prune any $RECOVERY entries for dead nodes,
2329 * otherwise hangs can occur during later recovery */
2330 if (dlm_is_recovery_lock(res->lockname.name,
2331 res->lockname.len)) {
2332 spin_lock(&res->spinlock);
2333 list_for_each_entry(lock, &res->granted, list) {
2334 if (lock->ml.node == dead_node) {
2335 mlog(0, "AHA! there was "
2336 "a $RECOVERY lock for dead "
2337 "node %u (%s)!\n",
2338 dead_node, dlm->name);
2339 list_del_init(&lock->list);
2340 dlm_lock_put(lock);
2341 break;
2342 }
2343 }
2344 spin_unlock(&res->spinlock);
2345 continue;
2346 }
2347 spin_lock(&res->spinlock);
2348 /* zero the lvb if necessary */
2349 dlm_revalidate_lvb(dlm, res, dead_node);
2350 if (res->owner == dead_node) {
2351 if (res->state & DLM_LOCK_RES_DROPPING_REF) {
2352 mlog(ML_NOTICE, "%s: res %.*s, Skip "
2353 "recovery as it is being freed\n",
2354 dlm->name, res->lockname.len,
2355 res->lockname.name);
2356 } else
2357 dlm_move_lockres_to_recovery_list(dlm,
2358 res);
2359
2360 } else if (res->owner == dlm->node_num) {
2361 dlm_free_dead_locks(dlm, res, dead_node);
2362 __dlm_lockres_calc_usage(dlm, res);
2363 } else if (res->owner == DLM_LOCK_RES_OWNER_UNKNOWN) {
2364 if (test_bit(dead_node, res->refmap)) {
2365 mlog(0, "%s:%.*s: dead node %u had a ref, but had "
2366 "no locks and had not purged before dying\n",
2367 dlm->name, res->lockname.len,
2368 res->lockname.name, dead_node);
2369 dlm_lockres_clear_refmap_bit(dlm, res, dead_node);
2370 }
2371 }
2372 spin_unlock(&res->spinlock);
2373 }
2374 }
2375
2376 }
2377
2378 static void __dlm_hb_node_down(struct dlm_ctxt *dlm, int idx)
2379 {
2380 assert_spin_locked(&dlm->spinlock);
2381
2382 if (dlm->reco.new_master == idx) {
2383 mlog(0, "%s: recovery master %d just died\n",
2384 dlm->name, idx);
2385 if (dlm->reco.state & DLM_RECO_STATE_FINALIZE) {
2386 /* finalize1 was reached, so it is safe to clear
2387 * the new_master and dead_node. that recovery
2388 * is complete. */
2389 mlog(0, "%s: dead master %d had reached "
2390 "finalize1 state, clearing\n", dlm->name, idx);
2391 dlm->reco.state &= ~DLM_RECO_STATE_FINALIZE;
2392 __dlm_reset_recovery(dlm);
2393 }
2394 }
2395
2396 /* Clean up join state on node death. */
2397 if (dlm->joining_node == idx) {
2398 mlog(0, "Clearing join state for node %u\n", idx);
2399 __dlm_set_joining_node(dlm, DLM_LOCK_RES_OWNER_UNKNOWN);
2400 }
2401
2402 /* check to see if the node is already considered dead */
2403 if (!test_bit(idx, dlm->live_nodes_map)) {
2404 mlog(0, "for domain %s, node %d is already dead. "
2405 "another node likely did recovery already.\n",
2406 dlm->name, idx);
2407 return;
2408 }
2409
2410 /* check to see if we do not care about this node */
2411 if (!test_bit(idx, dlm->domain_map)) {
2412 /* This also catches the case that we get a node down
2413 * but haven't joined the domain yet. */
2414 mlog(0, "node %u already removed from domain!\n", idx);
2415 return;
2416 }
2417
2418 clear_bit(idx, dlm->live_nodes_map);
2419
2420 /* make sure local cleanup occurs before the heartbeat events */
2421 if (!test_bit(idx, dlm->recovery_map))
2422 dlm_do_local_recovery_cleanup(dlm, idx);
2423
2424 /* notify anything attached to the heartbeat events */
2425 dlm_hb_event_notify_attached(dlm, idx, 0);
2426
2427 mlog(0, "node %u being removed from domain map!\n", idx);
2428 clear_bit(idx, dlm->domain_map);
2429 clear_bit(idx, dlm->exit_domain_map);
2430 /* wake up migration waiters if a node goes down.
2431 * perhaps later we can genericize this for other waiters. */
2432 wake_up(&dlm->migration_wq);
2433
2434 if (test_bit(idx, dlm->recovery_map))
2435 mlog(0, "domain %s, node %u already added "
2436 "to recovery map!\n", dlm->name, idx);
2437 else
2438 set_bit(idx, dlm->recovery_map);
2439 }
2440
2441 void dlm_hb_node_down_cb(struct o2nm_node *node, int idx, void *data)
2442 {
2443 struct dlm_ctxt *dlm = data;
2444
2445 if (!dlm_grab(dlm))
2446 return;
2447
2448 /*
2449 * This will notify any dlm users that a node in our domain
2450 * went away without notifying us first.
2451 */
2452 if (test_bit(idx, dlm->domain_map))
2453 dlm_fire_domain_eviction_callbacks(dlm, idx);
2454
2455 spin_lock(&dlm->spinlock);
2456 __dlm_hb_node_down(dlm, idx);
2457 spin_unlock(&dlm->spinlock);
2458
2459 dlm_put(dlm);
2460 }
2461
2462 void dlm_hb_node_up_cb(struct o2nm_node *node, int idx, void *data)
2463 {
2464 struct dlm_ctxt *dlm = data;
2465
2466 if (!dlm_grab(dlm))
2467 return;
2468
2469 spin_lock(&dlm->spinlock);
2470 set_bit(idx, dlm->live_nodes_map);
2471 /* do NOT notify mle attached to the heartbeat events.
2472 * new nodes are not interesting in mastery until joined. */
2473 spin_unlock(&dlm->spinlock);
2474
2475 dlm_put(dlm);
2476 }
2477
2478 static void dlm_reco_ast(void *astdata)
2479 {
2480 struct dlm_ctxt *dlm = astdata;
2481 mlog(0, "ast for recovery lock fired!, this=%u, dlm=%s\n",
2482 dlm->node_num, dlm->name);
2483 }
2484 static void dlm_reco_bast(void *astdata, int blocked_type)
2485 {
2486 struct dlm_ctxt *dlm = astdata;
2487 mlog(0, "bast for recovery lock fired!, this=%u, dlm=%s\n",
2488 dlm->node_num, dlm->name);
2489 }
2490 static void dlm_reco_unlock_ast(void *astdata, enum dlm_status st)
2491 {
2492 mlog(0, "unlockast for recovery lock fired!\n");
2493 }
2494
2495 /*
2496 * dlm_pick_recovery_master will continually attempt to use
2497 * dlmlock() on the special "$RECOVERY" lockres with the
2498 * LKM_NOQUEUE flag to get an EX. every thread that enters
2499 * this function on each node racing to become the recovery
2500 * master will not stop attempting this until either:
2501 * a) this node gets the EX (and becomes the recovery master),
2502 * or b) dlm->reco.new_master gets set to some nodenum
2503 * != O2NM_INVALID_NODE_NUM (another node will do the reco).
2504 * so each time a recovery master is needed, the entire cluster
2505 * will sync at this point. if the new master dies, that will
2506 * be detected in dlm_do_recovery */
2507 static int dlm_pick_recovery_master(struct dlm_ctxt *dlm)
2508 {
2509 enum dlm_status ret;
2510 struct dlm_lockstatus lksb;
2511 int status = -EINVAL;
2512
2513 mlog(0, "starting recovery of %s at %lu, dead=%u, this=%u\n",
2514 dlm->name, jiffies, dlm->reco.dead_node, dlm->node_num);
2515 again:
2516 memset(&lksb, 0, sizeof(lksb));
2517
2518 ret = dlmlock(dlm, LKM_EXMODE, &lksb, LKM_NOQUEUE|LKM_RECOVERY,
2519 DLM_RECOVERY_LOCK_NAME, DLM_RECOVERY_LOCK_NAME_LEN,
2520 dlm_reco_ast, dlm, dlm_reco_bast);
2521
2522 mlog(0, "%s: dlmlock($RECOVERY) returned %d, lksb=%d\n",
2523 dlm->name, ret, lksb.status);
2524
2525 if (ret == DLM_NORMAL) {
2526 mlog(0, "dlm=%s dlmlock says I got it (this=%u)\n",
2527 dlm->name, dlm->node_num);
2528
2529 /* got the EX lock. check to see if another node
2530 * just became the reco master */
2531 if (dlm_reco_master_ready(dlm)) {
2532 mlog(0, "%s: got reco EX lock, but %u will "
2533 "do the recovery\n", dlm->name,
2534 dlm->reco.new_master);
2535 status = -EEXIST;
2536 } else {
2537 status = 0;
2538
2539 /* see if recovery was already finished elsewhere */
2540 spin_lock(&dlm->spinlock);
2541 if (dlm->reco.dead_node == O2NM_INVALID_NODE_NUM) {
2542 status = -EINVAL;
2543 mlog(0, "%s: got reco EX lock, but "
2544 "node got recovered already\n", dlm->name);
2545 if (dlm->reco.new_master != O2NM_INVALID_NODE_NUM) {
2546 mlog(ML_ERROR, "%s: new master is %u "
2547 "but no dead node!\n",
2548 dlm->name, dlm->reco.new_master);
2549 BUG();
2550 }
2551 }
2552 spin_unlock(&dlm->spinlock);
2553 }
2554
2555 /* if this node has actually become the recovery master,
2556 * set the master and send the messages to begin recovery */
2557 if (!status) {
2558 mlog(0, "%s: dead=%u, this=%u, sending "
2559 "begin_reco now\n", dlm->name,
2560 dlm->reco.dead_node, dlm->node_num);
2561 status = dlm_send_begin_reco_message(dlm,
2562 dlm->reco.dead_node);
2563 /* this always succeeds */
2564 BUG_ON(status);
2565
2566 /* set the new_master to this node */
2567 spin_lock(&dlm->spinlock);
2568 dlm_set_reco_master(dlm, dlm->node_num);
2569 spin_unlock(&dlm->spinlock);
2570 }
2571
2572 /* recovery lock is a special case. ast will not get fired,
2573 * so just go ahead and unlock it. */
2574 ret = dlmunlock(dlm, &lksb, 0, dlm_reco_unlock_ast, dlm);
2575 if (ret == DLM_DENIED) {
2576 mlog(0, "got DLM_DENIED, trying LKM_CANCEL\n");
2577 ret = dlmunlock(dlm, &lksb, LKM_CANCEL, dlm_reco_unlock_ast, dlm);
2578 }
2579 if (ret != DLM_NORMAL) {
2580 /* this would really suck. this could only happen
2581 * if there was a network error during the unlock
2582 * because of node death. this means the unlock
2583 * is actually "done" and the lock structure is
2584 * even freed. we can continue, but only
2585 * because this specific lock name is special. */
2586 mlog(ML_ERROR, "dlmunlock returned %d\n", ret);
2587 }
2588 } else if (ret == DLM_NOTQUEUED) {
2589 mlog(0, "dlm=%s dlmlock says another node got it (this=%u)\n",
2590 dlm->name, dlm->node_num);
2591 /* another node is master. wait on
2592 * reco.new_master != O2NM_INVALID_NODE_NUM
2593 * for at most one second */
2594 wait_event_timeout(dlm->dlm_reco_thread_wq,
2595 dlm_reco_master_ready(dlm),
2596 msecs_to_jiffies(1000));
2597 if (!dlm_reco_master_ready(dlm)) {
2598 mlog(0, "%s: reco master taking awhile\n",
2599 dlm->name);
2600 goto again;
2601 }
2602 /* another node has informed this one that it is reco master */
2603 mlog(0, "%s: reco master %u is ready to recover %u\n",
2604 dlm->name, dlm->reco.new_master, dlm->reco.dead_node);
2605 status = -EEXIST;
2606 } else if (ret == DLM_RECOVERING) {
2607 mlog(0, "dlm=%s dlmlock says master node died (this=%u)\n",
2608 dlm->name, dlm->node_num);
2609 goto again;
2610 } else {
2611 struct dlm_lock_resource *res;
2612
2613 /* dlmlock returned something other than NOTQUEUED or NORMAL */
2614 mlog(ML_ERROR, "%s: got %s from dlmlock($RECOVERY), "
2615 "lksb.status=%s\n", dlm->name, dlm_errname(ret),
2616 dlm_errname(lksb.status));
2617 res = dlm_lookup_lockres(dlm, DLM_RECOVERY_LOCK_NAME,
2618 DLM_RECOVERY_LOCK_NAME_LEN);
2619 if (res) {
2620 dlm_print_one_lock_resource(res);
2621 dlm_lockres_put(res);
2622 } else {
2623 mlog(ML_ERROR, "recovery lock not found\n");
2624 }
2625 BUG();
2626 }
2627
2628 return status;
2629 }
2630
2631 static int dlm_send_begin_reco_message(struct dlm_ctxt *dlm, u8 dead_node)
2632 {
2633 struct dlm_begin_reco br;
2634 int ret = 0;
2635 struct dlm_node_iter iter;
2636 int nodenum;
2637 int status;
2638
2639 mlog(0, "%s: dead node is %u\n", dlm->name, dead_node);
2640
2641 spin_lock(&dlm->spinlock);
2642 dlm_node_iter_init(dlm->domain_map, &iter);
2643 spin_unlock(&dlm->spinlock);
2644
2645 clear_bit(dead_node, iter.node_map);
2646
2647 memset(&br, 0, sizeof(br));
2648 br.node_idx = dlm->node_num;
2649 br.dead_node = dead_node;
2650
2651 while ((nodenum = dlm_node_iter_next(&iter)) >= 0) {
2652 ret = 0;
2653 if (nodenum == dead_node) {
2654 mlog(0, "not sending begin reco to dead node "
2655 "%u\n", dead_node);
2656 continue;
2657 }
2658 if (nodenum == dlm->node_num) {
2659 mlog(0, "not sending begin reco to self\n");
2660 continue;
2661 }
2662 retry:
2663 ret = -EINVAL;
2664 mlog(0, "attempting to send begin reco msg to %d\n",
2665 nodenum);
2666 ret = o2net_send_message(DLM_BEGIN_RECO_MSG, dlm->key,
2667 &br, sizeof(br), nodenum, &status);
2668 /* negative status is handled ok by caller here */
2669 if (ret >= 0)
2670 ret = status;
2671 if (dlm_is_host_down(ret)) {
2672 /* node is down. not involved in recovery
2673 * so just keep going */
2674 mlog(ML_NOTICE, "%s: node %u was down when sending "
2675 "begin reco msg (%d)\n", dlm->name, nodenum, ret);
2676 ret = 0;
2677 }
2678
2679 /*
2680 * Prior to commit aad1b15310b9bcd59fa81ab8f2b1513b59553ea8,
2681 * dlm_begin_reco_handler() returned EAGAIN and not -EAGAIN.
2682 * We are handling both for compatibility reasons.
2683 */
2684 if (ret == -EAGAIN || ret == EAGAIN) {
2685 mlog(0, "%s: trying to start recovery of node "
2686 "%u, but node %u is waiting for last recovery "
2687 "to complete, backoff for a bit\n", dlm->name,
2688 dead_node, nodenum);
2689 msleep(100);
2690 goto retry;
2691 }
2692 if (ret < 0) {
2693 struct dlm_lock_resource *res;
2694
2695 /* this is now a serious problem, possibly ENOMEM
2696 * in the network stack. must retry */
2697 mlog_errno(ret);
2698 mlog(ML_ERROR, "begin reco of dlm %s to node %u "
2699 "returned %d\n", dlm->name, nodenum, ret);
2700 res = dlm_lookup_lockres(dlm, DLM_RECOVERY_LOCK_NAME,
2701 DLM_RECOVERY_LOCK_NAME_LEN);
2702 if (res) {
2703 dlm_print_one_lock_resource(res);
2704 dlm_lockres_put(res);
2705 } else {
2706 mlog(ML_ERROR, "recovery lock not found\n");
2707 }
2708 /* sleep for a bit in hopes that we can avoid
2709 * another ENOMEM */
2710 msleep(100);
2711 goto retry;
2712 }
2713 }
2714
2715 return ret;
2716 }
2717
2718 int dlm_begin_reco_handler(struct o2net_msg *msg, u32 len, void *data,
2719 void **ret_data)
2720 {
2721 struct dlm_ctxt *dlm = data;
2722 struct dlm_begin_reco *br = (struct dlm_begin_reco *)msg->buf;
2723
2724 /* ok to return 0, domain has gone away */
2725 if (!dlm_grab(dlm))
2726 return 0;
2727
2728 spin_lock(&dlm->spinlock);
2729 if (dlm->reco.state & DLM_RECO_STATE_FINALIZE) {
2730 mlog(0, "%s: node %u wants to recover node %u (%u:%u) "
2731 "but this node is in finalize state, waiting on finalize2\n",
2732 dlm->name, br->node_idx, br->dead_node,
2733 dlm->reco.dead_node, dlm->reco.new_master);
2734 spin_unlock(&dlm->spinlock);
2735 dlm_put(dlm);
2736 return -EAGAIN;
2737 }
2738 spin_unlock(&dlm->spinlock);
2739
2740 mlog(0, "%s: node %u wants to recover node %u (%u:%u)\n",
2741 dlm->name, br->node_idx, br->dead_node,
2742 dlm->reco.dead_node, dlm->reco.new_master);
2743
2744 dlm_fire_domain_eviction_callbacks(dlm, br->dead_node);
2745
2746 spin_lock(&dlm->spinlock);
2747 if (dlm->reco.new_master != O2NM_INVALID_NODE_NUM) {
2748 if (test_bit(dlm->reco.new_master, dlm->recovery_map)) {
2749 mlog(0, "%s: new_master %u died, changing "
2750 "to %u\n", dlm->name, dlm->reco.new_master,
2751 br->node_idx);
2752 } else {
2753 mlog(0, "%s: new_master %u NOT DEAD, changing "
2754 "to %u\n", dlm->name, dlm->reco.new_master,
2755 br->node_idx);
2756 /* may not have seen the new master as dead yet */
2757 }
2758 }
2759 if (dlm->reco.dead_node != O2NM_INVALID_NODE_NUM) {
2760 mlog(ML_NOTICE, "%s: dead_node previously set to %u, "
2761 "node %u changing it to %u\n", dlm->name,
2762 dlm->reco.dead_node, br->node_idx, br->dead_node);
2763 }
2764 dlm_set_reco_master(dlm, br->node_idx);
2765 dlm_set_reco_dead_node(dlm, br->dead_node);
2766 if (!test_bit(br->dead_node, dlm->recovery_map)) {
2767 mlog(0, "recovery master %u sees %u as dead, but this "
2768 "node has not yet. marking %u as dead\n",
2769 br->node_idx, br->dead_node, br->dead_node);
2770 if (!test_bit(br->dead_node, dlm->domain_map) ||
2771 !test_bit(br->dead_node, dlm->live_nodes_map))
2772 mlog(0, "%u not in domain/live_nodes map "
2773 "so setting it in reco map manually\n",
2774 br->dead_node);
2775 /* force the recovery cleanup in __dlm_hb_node_down
2776 * both of these will be cleared in a moment */
2777 set_bit(br->dead_node, dlm->domain_map);
2778 set_bit(br->dead_node, dlm->live_nodes_map);
2779 __dlm_hb_node_down(dlm, br->dead_node);
2780 }
2781 spin_unlock(&dlm->spinlock);
2782
2783 dlm_kick_recovery_thread(dlm);
2784
2785 mlog(0, "%s: recovery started by node %u, for %u (%u:%u)\n",
2786 dlm->name, br->node_idx, br->dead_node,
2787 dlm->reco.dead_node, dlm->reco.new_master);
2788
2789 dlm_put(dlm);
2790 return 0;
2791 }
2792
2793 #define DLM_FINALIZE_STAGE2 0x01
2794 static int dlm_send_finalize_reco_message(struct dlm_ctxt *dlm)
2795 {
2796 int ret = 0;
2797 struct dlm_finalize_reco fr;
2798 struct dlm_node_iter iter;
2799 int nodenum;
2800 int status;
2801 int stage = 1;
2802
2803 mlog(0, "finishing recovery for node %s:%u, "
2804 "stage %d\n", dlm->name, dlm->reco.dead_node, stage);
2805
2806 spin_lock(&dlm->spinlock);
2807 dlm_node_iter_init(dlm->domain_map, &iter);
2808 spin_unlock(&dlm->spinlock);
2809
2810 stage2:
2811 memset(&fr, 0, sizeof(fr));
2812 fr.node_idx = dlm->node_num;
2813 fr.dead_node = dlm->reco.dead_node;
2814 if (stage == 2)
2815 fr.flags |= DLM_FINALIZE_STAGE2;
2816
2817 while ((nodenum = dlm_node_iter_next(&iter)) >= 0) {
2818 if (nodenum == dlm->node_num)
2819 continue;
2820 ret = o2net_send_message(DLM_FINALIZE_RECO_MSG, dlm->key,
2821 &fr, sizeof(fr), nodenum, &status);
2822 if (ret >= 0)
2823 ret = status;
2824 if (ret < 0) {
2825 mlog(ML_ERROR, "Error %d when sending message %u (key "
2826 "0x%x) to node %u\n", ret, DLM_FINALIZE_RECO_MSG,
2827 dlm->key, nodenum);
2828 if (dlm_is_host_down(ret)) {
2829 /* this has no effect on this recovery
2830 * session, so set the status to zero to
2831 * finish out the last recovery */
2832 mlog(ML_ERROR, "node %u went down after this "
2833 "node finished recovery.\n", nodenum);
2834 ret = 0;
2835 continue;
2836 }
2837 break;
2838 }
2839 }
2840 if (stage == 1) {
2841 /* reset the node_iter back to the top and send finalize2 */
2842 iter.curnode = -1;
2843 stage = 2;
2844 goto stage2;
2845 }
2846
2847 return ret;
2848 }
2849
2850 int dlm_finalize_reco_handler(struct o2net_msg *msg, u32 len, void *data,
2851 void **ret_data)
2852 {
2853 struct dlm_ctxt *dlm = data;
2854 struct dlm_finalize_reco *fr = (struct dlm_finalize_reco *)msg->buf;
2855 int stage = 1;
2856
2857 /* ok to return 0, domain has gone away */
2858 if (!dlm_grab(dlm))
2859 return 0;
2860
2861 if (fr->flags & DLM_FINALIZE_STAGE2)
2862 stage = 2;
2863
2864 mlog(0, "%s: node %u finalizing recovery stage%d of "
2865 "node %u (%u:%u)\n", dlm->name, fr->node_idx, stage,
2866 fr->dead_node, dlm->reco.dead_node, dlm->reco.new_master);
2867
2868 spin_lock(&dlm->spinlock);
2869
2870 if (dlm->reco.new_master != fr->node_idx) {
2871 mlog(ML_ERROR, "node %u sent recovery finalize msg, but node "
2872 "%u is supposed to be the new master, dead=%u\n",
2873 fr->node_idx, dlm->reco.new_master, fr->dead_node);
2874 BUG();
2875 }
2876 if (dlm->reco.dead_node != fr->dead_node) {
2877 mlog(ML_ERROR, "node %u sent recovery finalize msg for dead "
2878 "node %u, but node %u is supposed to be dead\n",
2879 fr->node_idx, fr->dead_node, dlm->reco.dead_node);
2880 BUG();
2881 }
2882
2883 switch (stage) {
2884 case 1:
2885 dlm_finish_local_lockres_recovery(dlm, fr->dead_node, fr->node_idx);
2886 if (dlm->reco.state & DLM_RECO_STATE_FINALIZE) {
2887 mlog(ML_ERROR, "%s: received finalize1 from "
2888 "new master %u for dead node %u, but "
2889 "this node has already received it!\n",
2890 dlm->name, fr->node_idx, fr->dead_node);
2891 dlm_print_reco_node_status(dlm);
2892 BUG();
2893 }
2894 dlm->reco.state |= DLM_RECO_STATE_FINALIZE;
2895 spin_unlock(&dlm->spinlock);
2896 break;
2897 case 2:
2898 if (!(dlm->reco.state & DLM_RECO_STATE_FINALIZE)) {
2899 mlog(ML_ERROR, "%s: received finalize2 from "
2900 "new master %u for dead node %u, but "
2901 "this node did not have finalize1!\n",
2902 dlm->name, fr->node_idx, fr->dead_node);
2903 dlm_print_reco_node_status(dlm);
2904 BUG();
2905 }
2906 dlm->reco.state &= ~DLM_RECO_STATE_FINALIZE;
2907 __dlm_reset_recovery(dlm);
2908 spin_unlock(&dlm->spinlock);
2909 dlm_kick_recovery_thread(dlm);
2910 break;
2911 default:
2912 BUG();
2913 }
2914
2915 mlog(0, "%s: recovery done, reco master was %u, dead now %u, master now %u\n",
2916 dlm->name, fr->node_idx, dlm->reco.dead_node, dlm->reco.new_master);
2917
2918 dlm_put(dlm);
2919 return 0;
2920 }