blob: fe29f7978f81a515519fde46b2c14aacb862b399 [file] [log] [blame]
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001/* -*- 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>
Kurt Hackel6714d8e2005-12-15 14:31:23 -080033#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>
Adrian Bunkb4c7f532006-01-14 20:55:10 +010041#include <linux/delay.h>
Kurt Hackel6714d8e2005-12-15 14:31:23 -080042
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
55static void dlm_do_local_recovery_cleanup(struct dlm_ctxt *dlm, u8 dead_node);
56
57static int dlm_recovery_thread(void *data);
Kurt Hackel6714d8e2005-12-15 14:31:23 -080058static int dlm_do_recovery(struct dlm_ctxt *dlm);
59
60static int dlm_pick_recovery_master(struct dlm_ctxt *dlm);
61static int dlm_remaster_locks(struct dlm_ctxt *dlm, u8 dead_node);
62static int dlm_init_recovery_area(struct dlm_ctxt *dlm, u8 dead_node);
63static int dlm_request_all_locks(struct dlm_ctxt *dlm,
64 u8 request_from, u8 dead_node);
65static void dlm_destroy_recovery_area(struct dlm_ctxt *dlm, u8 dead_node);
66
67static inline int dlm_num_locks_in_lockres(struct dlm_lock_resource *res);
68static 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);
72static 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);
Kurt Hackel6714d8e2005-12-15 14:31:23 -080077static int dlm_process_recovery_data(struct dlm_ctxt *dlm,
78 struct dlm_lock_resource *res,
79 struct dlm_migratable_lockres *mres);
Kurt Hackel6714d8e2005-12-15 14:31:23 -080080static int dlm_send_finalize_reco_message(struct dlm_ctxt *dlm);
81static int dlm_send_all_done_msg(struct dlm_ctxt *dlm,
82 u8 dead_node, u8 send_to);
83static int dlm_send_begin_reco_message(struct dlm_ctxt *dlm, u8 dead_node);
84static void dlm_move_reco_locks_to_list(struct dlm_ctxt *dlm,
85 struct list_head *list, u8 dead_node);
86static void dlm_finish_local_lockres_recovery(struct dlm_ctxt *dlm,
87 u8 dead_node, u8 new_master);
88static void dlm_reco_ast(void *astdata);
89static void dlm_reco_bast(void *astdata, int blocked_type);
90static void dlm_reco_unlock_ast(void *astdata, enum dlm_status st);
91static void dlm_request_all_locks_worker(struct dlm_work_item *item,
92 void *data);
93static void dlm_mig_lockres_worker(struct dlm_work_item *item, void *data);
Adrian Bunk8169cae2006-03-31 16:53:55 +020094static int dlm_lockres_master_requery(struct dlm_ctxt *dlm,
95 struct dlm_lock_resource *res,
96 u8 *real_master);
Kurt Hackel6714d8e2005-12-15 14:31:23 -080097
98static u64 dlm_get_next_mig_cookie(void);
99
Ingo Molnar34af9462006-06-27 02:53:55 -0700100static DEFINE_SPINLOCK(dlm_reco_state_lock);
101static DEFINE_SPINLOCK(dlm_mig_cookie_lock);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800102static u64 dlm_mig_cookie = 1;
103
104static 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
Kurt Hackelab27eb62006-04-27 18:03:49 -0700117static 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
127static 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
Kurt Hackel466d1a42006-05-01 11:11:13 -0700136static inline void __dlm_reset_recovery(struct dlm_ctxt *dlm)
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800137{
Kurt Hackel466d1a42006-05-01 11:11:13 -0700138 assert_spin_locked(&dlm->spinlock);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800139 clear_bit(dlm->reco.dead_node, dlm->recovery_map);
Kurt Hackelab27eb62006-04-27 18:03:49 -0700140 dlm_set_reco_dead_node(dlm, O2NM_INVALID_NODE_NUM);
141 dlm_set_reco_master(dlm, O2NM_INVALID_NODE_NUM);
Kurt Hackel466d1a42006-05-01 11:11:13 -0700142}
143
144static inline void dlm_reset_recovery(struct dlm_ctxt *dlm)
145{
146 spin_lock(&dlm->spinlock);
147 __dlm_reset_recovery(dlm);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800148 spin_unlock(&dlm->spinlock);
149}
150
151/* Worker function used during recovery. */
David Howellsc4028952006-11-22 14:57:56 +0000152void dlm_dispatch_work(struct work_struct *work)
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800153{
David Howellsc4028952006-11-22 14:57:56 +0000154 struct dlm_ctxt *dlm =
155 container_of(work, struct dlm_ctxt, dispatched_work);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800156 LIST_HEAD(tmp_list);
Christoph Hellwig800deef2007-05-17 16:03:13 +0200157 struct dlm_work_item *item, *next;
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800158 dlm_workfunc_t *workfunc;
Kurt Hackel3156d262006-05-01 14:39:29 -0700159 int tot=0;
160
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800161 spin_lock(&dlm->work_lock);
162 list_splice_init(&dlm->work_list, &tmp_list);
163 spin_unlock(&dlm->work_lock);
164
Christoph Hellwig800deef2007-05-17 16:03:13 +0200165 list_for_each_entry(item, &tmp_list, list) {
Kurt Hackel3156d262006-05-01 14:39:29 -0700166 tot++;
167 }
168 mlog(0, "%s: work thread has %d work items\n", dlm->name, tot);
169
Christoph Hellwig800deef2007-05-17 16:03:13 +0200170 list_for_each_entry_safe(item, next, &tmp_list, list) {
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800171 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
Kurt Hackelc03872f2006-03-06 14:08:49 -0800191void dlm_kick_recovery_thread(struct dlm_ctxt *dlm)
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800192{
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 */
203int 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
218void 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
Kurt Hackeld6dea6e2006-04-27 18:08:51 -0700252static 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",
Pavel Emelyanovba25f9d2007-10-18 23:40:40 -0700258 dlm->name, task_pid_nr(dlm->dlm_reco_thread_task),
Kurt Hackeld6dea6e2006-04-27 18:08:51 -0700259 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}
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800298
299#define DLM_RECO_THREAD_TIMEOUT_MS (5 * 1000)
300
301static 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()) {
Srinivas Eedabc9838c2010-02-26 12:53:51 -0800310 if (dlm_domain_fully_joined(dlm)) {
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800311 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
Kurt Hackele2faea42006-01-12 14:24:55 -0800329/* returns true when the recovery master has contacted us */
330static 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 */
341int dlm_is_node_dead(struct dlm_ctxt *dlm, u8 node)
342{
343 int dead;
344 spin_lock(&dlm->spinlock);
Kurt Hackelaba9aac2006-04-27 18:00:21 -0700345 dead = !test_bit(node, dlm->domain_map);
Kurt Hackele2faea42006-01-12 14:24:55 -0800346 spin_unlock(&dlm->spinlock);
347 return dead;
348}
349
Kurt Hackelb7084ab2006-05-01 13:54:07 -0700350/* returns true if node is no longer in the domain
351 * could be dead or just not joined */
Adrian Bunk3fb5a982006-05-16 17:26:41 +0200352static int dlm_is_node_recovered(struct dlm_ctxt *dlm, u8 node)
Kurt Hackelb7084ab2006-05-01 13:54:07 -0700353{
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
Sunil Mushraned8625c2011-07-24 10:28:54 -0700362void dlm_wait_for_node_death(struct dlm_ctxt *dlm, u8 node, int timeout)
Kurt Hackel44465a72006-01-18 17:05:38 -0800363{
Sunil Mushraned8625c2011-07-24 10:28:54 -0700364 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)
Kurt Hackel44465a72006-01-18 17:05:38 -0800371 wait_event_timeout(dlm->dlm_reco_thread_wq,
Sunil Mushraned8625c2011-07-24 10:28:54 -0700372 dlm_is_node_dead(dlm, node),
373 msecs_to_jiffies(timeout));
374 else
Kurt Hackel44465a72006-01-18 17:05:38 -0800375 wait_event(dlm->dlm_reco_thread_wq,
376 dlm_is_node_dead(dlm, node));
Kurt Hackel44465a72006-01-18 17:05:38 -0800377}
378
Sunil Mushraned8625c2011-07-24 10:28:54 -0700379void dlm_wait_for_node_recovery(struct dlm_ctxt *dlm, u8 node, int timeout)
Kurt Hackelb7084ab2006-05-01 13:54:07 -0700380{
Sunil Mushraned8625c2011-07-24 10:28:54 -0700381 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)
Kurt Hackelb7084ab2006-05-01 13:54:07 -0700388 wait_event_timeout(dlm->dlm_reco_thread_wq,
Sunil Mushraned8625c2011-07-24 10:28:54 -0700389 dlm_is_node_recovered(dlm, node),
390 msecs_to_jiffies(timeout));
391 else
Kurt Hackelb7084ab2006-05-01 13:54:07 -0700392 wait_event(dlm->dlm_reco_thread_wq,
393 dlm_is_node_recovered(dlm, node));
Kurt Hackelb7084ab2006-05-01 13:54:07 -0700394}
395
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800396/* 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 */
402static 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
412void dlm_wait_for_recovery(struct dlm_ctxt *dlm)
413{
Kurt Hackel56a7c102006-05-01 14:30:39 -0700414 if (dlm_in_recovery(dlm)) {
Kurt Hackel3b3b84a2006-05-01 14:31:37 -0700415 mlog(0, "%s: reco thread %d in recovery: "
Kurt Hackel56a7c102006-05-01 14:30:39 -0700416 "state=%d, master=%u, dead=%u\n",
Pavel Emelyanovba25f9d2007-10-18 23:40:40 -0700417 dlm->name, task_pid_nr(dlm->dlm_reco_thread_task),
Kurt Hackel56a7c102006-05-01 14:30:39 -0700418 dlm->reco.state, dlm->reco.new_master,
419 dlm->reco.dead_node);
420 }
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800421 wait_event(dlm->reco.event, !dlm_in_recovery(dlm));
422}
423
424static void dlm_begin_recovery(struct dlm_ctxt *dlm)
425{
426 spin_lock(&dlm->spinlock);
427 BUG_ON(dlm->reco.state & DLM_RECO_STATE_ACTIVE);
Sunil Mushran8decab32011-07-24 10:23:54 -0700428 printk(KERN_NOTICE "o2dlm: Begin recovery on domain %s for node %u\n",
429 dlm->name, dlm->reco.dead_node);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800430 dlm->reco.state |= DLM_RECO_STATE_ACTIVE;
431 spin_unlock(&dlm->spinlock);
432}
433
434static 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);
Sunil Mushran8decab32011-07-24 10:23:54 -0700440 printk(KERN_NOTICE "o2dlm: End recovery on domain %s\n", dlm->name);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800441 wake_up(&dlm->reco.event);
442}
443
Sunil Mushran8decab32011-07-24 10:23:54 -0700444static 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
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800452static int dlm_do_recovery(struct dlm_ctxt *dlm)
453{
454 int status = 0;
Kurt Hackele2faea42006-01-12 14:24:55 -0800455 int ret;
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800456
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 */
Kurt Hackelab27eb62006-04-27 18:03:49 -0700465 dlm_set_reco_master(dlm, O2NM_INVALID_NODE_NUM);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800466 }
467
468 /* select a target to recover */
469 if (dlm->reco.dead_node == O2NM_INVALID_NODE_NUM) {
470 int bit;
471
Wengang Wangf471c9d2010-06-30 20:23:30 +0800472 bit = find_next_bit (dlm->recovery_map, O2NM_MAX_NODES, 0);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800473 if (bit >= O2NM_MAX_NODES || bit < 0)
Kurt Hackelab27eb62006-04-27 18:03:49 -0700474 dlm_set_reco_dead_node(dlm, O2NM_INVALID_NODE_NUM);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800475 else
Kurt Hackelab27eb62006-04-27 18:03:49 -0700476 dlm_set_reco_dead_node(dlm, bit);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800477 } 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);
Kurt Hackelab27eb62006-04-27 18:03:49 -0700481 dlm_set_reco_dead_node(dlm, O2NM_INVALID_NODE_NUM);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800482 }
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 }
Kurt Hackeld6dea6e2006-04-27 18:08:51 -0700490 mlog(0, "%s(%d):recovery thread found node %u in the recovery map!\n",
Pavel Emelyanovba25f9d2007-10-18 23:40:40 -0700491 dlm->name, task_pid_nr(dlm->dlm_reco_thread_task),
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800492 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) {
Kurt Hackele2faea42006-01-12 14:24:55 -0800503 /* 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) {
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800509 /* already notified everyone. go. */
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800510 goto master_here;
511 }
512 mlog(0, "another node will master this recovery session.\n");
513 }
Sunil Mushran8decab32011-07-24 10:23:54 -0700514
515 dlm_print_recovery_master(dlm);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800516
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
525master_here:
Sunil Mushran8decab32011-07-24 10:23:54 -0700526 dlm_print_recovery_master(dlm);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800527
528 status = dlm_remaster_locks(dlm, dlm->reco.dead_node);
529 if (status < 0) {
Kurt Hackel6a413212006-05-01 13:49:20 -0700530 /* we should never hit this anymore */
Sunil Mushran8decab32011-07-24 10:23:54 -0700531 mlog(ML_ERROR, "%s: Error %d remastering locks for node %u, "
532 "retrying.\n", dlm->name, status, dlm->reco.dead_node);
Kurt Hackele2faea42006-01-12 14:24:55 -0800533 /* yield a bit to allow any final network messages
534 * to get handled on remaining nodes */
535 msleep(100);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800536 } else {
537 /* success! see if any other nodes need recovery */
Kurt Hackele2faea42006-01-12 14:24:55 -0800538 mlog(0, "DONE mastering recovery of %s:%u here(this=%u)!\n",
539 dlm->name, dlm->reco.dead_node, dlm->node_num);
Junxiao Bided2cf72014-04-03 14:46:51 -0700540 spin_lock(&dlm->spinlock);
541 __dlm_reset_recovery(dlm);
542 dlm->reco.state &= ~DLM_RECO_STATE_FINALIZE;
543 spin_unlock(&dlm->spinlock);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800544 }
545 dlm_end_recovery(dlm);
546
547 /* continue and look for another dead node */
548 return -EAGAIN;
549}
550
551static int dlm_remaster_locks(struct dlm_ctxt *dlm, u8 dead_node)
552{
553 int status = 0;
554 struct dlm_reco_node_data *ndata;
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800555 int all_nodes_done;
556 int destroy = 0;
557 int pass = 0;
558
Kurt Hackel6a413212006-05-01 13:49:20 -0700559 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);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800569
570 /* safe to access the node data list without a lock, since this
571 * process is the only one to change the list */
Christoph Hellwig800deef2007-05-17 16:03:13 +0200572 list_for_each_entry(ndata, &dlm->reco.node_data, list) {
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800573 BUG_ON(ndata->state != DLM_RECO_NODE_DATA_INIT);
574 ndata->state = DLM_RECO_NODE_DATA_REQUESTING;
575
Sunil Mushran8decab32011-07-24 10:23:54 -0700576 mlog(0, "%s: Requesting lock info from node %u\n", dlm->name,
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800577 ndata->node_num);
578
579 if (ndata->node_num == dlm->node_num) {
580 ndata->state = DLM_RECO_NODE_DATA_DONE;
581 continue;
582 }
583
Kurt Hackel6a413212006-05-01 13:49:20 -0700584 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 }
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800612 }
Kurt Hackel6a413212006-05-01 13:49:20 -0700613 } while (status != 0);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800614
Srinivas Eeda756a1502007-04-17 13:26:33 -0700615 spin_lock(&dlm_reco_state_lock);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800616 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);
Kurt Hackel6a413212006-05-01 13:49:20 -0700626 /* fine. don't need this node's info.
627 * continue without it. */
628 break;
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800629 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 }
Srinivas Eeda756a1502007-04-17 13:26:33 -0700646 spin_unlock(&dlm_reco_state_lock);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800647 }
648
Sunil Mushran8decab32011-07-24 10:23:54 -0700649 mlog(0, "%s: Done requesting all lock info\n", dlm->name);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800650
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);
Christoph Hellwig800deef2007-05-17 16:03:13 +0200659 list_for_each_entry(ndata, &dlm->reco.node_data, list) {
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800660 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:
Kurt Hackel6a413212006-05-01 13:49:20 -0700671 mlog(0, "node %u died after "
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800672 "requesting recovery info for "
673 "node %u\n", ndata->node_num,
674 dead_node);
Kurt Hackel6a413212006-05-01 13:49:20 -0700675 break;
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800676 case DLM_RECO_NODE_DATA_RECEIVING:
677 case DLM_RECO_NODE_DATA_REQUESTED:
Kurt Hackeld6dea6e2006-04-27 18:08:51 -0700678 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");
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800682 all_nodes_done = 0;
683 break;
684 case DLM_RECO_NODE_DATA_DONE:
Kurt Hackeld6dea6e2006-04-27 18:08:51 -0700685 mlog(0, "%s: node %u state is done\n",
686 dlm->name, ndata->node_num);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800687 break;
688 case DLM_RECO_NODE_DATA_FINALIZE_SENT:
Kurt Hackeld6dea6e2006-04-27 18:08:51 -0700689 mlog(0, "%s: node %u state is finalize\n",
690 dlm->name, ndata->node_num);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800691 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
Junxiao Bided2cf72014-04-03 14:46:51 -0700701 /* 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
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800709 /* 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;
Kurt Hackel6a413212006-05-01 13:49:20 -0700728 status = 0;
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800729 /* 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
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800741 if (destroy)
742 dlm_destroy_recovery_area(dlm, dead_node);
743
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800744 return status;
745}
746
747static 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
Robert P. J. Daycd861282006-12-13 00:34:52 -0800765 ndata = kzalloc(sizeof(*ndata), GFP_NOFS);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800766 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
781static void dlm_destroy_recovery_area(struct dlm_ctxt *dlm, u8 dead_node)
782{
Christoph Hellwig800deef2007-05-17 16:03:13 +0200783 struct dlm_reco_node_data *ndata, *next;
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800784 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
Christoph Hellwig800deef2007-05-17 16:03:13 +0200790 list_for_each_entry_safe(ndata, next, &tmplist, list) {
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800791 list_del_init(&ndata->list);
792 kfree(ndata);
793 }
794}
795
796static int dlm_request_all_locks(struct dlm_ctxt *dlm, u8 request_from,
797 u8 dead_node)
798{
799 struct dlm_lock_request lr;
Joseph Qi22ab9012013-07-03 15:00:47 -0700800 int ret;
Xue jiufei98ac9122013-09-11 14:19:46 -0700801 int status;
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800802
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
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800814 ret = o2net_send_message(DLM_LOCK_REQUEST_MSG, dlm->key,
Xue jiufei98ac9122013-09-11 14:19:46 -0700815 &lr, sizeof(lr), request_from, &status);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800816
817 /* negative status is handled by caller */
818 if (ret < 0)
Sunil Mushran8decab32011-07-24 10:23:54 -0700819 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);
Xue jiufei98ac9122013-09-11 14:19:46 -0700822 else
823 ret = status;
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800824 // return from here, then
825 // sleep until all received or error
826 return ret;
827
828}
829
Kurt Hackeld74c9802007-01-17 17:04:25 -0800830int dlm_request_all_locks_handler(struct o2net_msg *msg, u32 len, void *data,
831 void **ret_data)
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800832{
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
Kurt Hackelc3187ce2006-04-27 18:05:41 -0700841 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);
Kurt Hackeld6dea6e2006-04-27 18:08:51 -0700845 dlm_print_reco_node_status(dlm);
Kurt Hackelc3187ce2006-04-27 18:05:41 -0700846 /* this is a hack */
847 dlm_put(dlm);
848 return -ENOMEM;
849 }
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800850 BUG_ON(lr->dead_node != dlm->reco.dead_node);
851
Robert P. J. Daycd861282006-12-13 00:34:52 -0800852 item = kzalloc(sizeof(*item), GFP_NOFS);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800853 if (!item) {
854 dlm_put(dlm);
855 return -ENOMEM;
856 }
857
858 /* this will get freed by dlm_request_all_locks_worker */
Kurt Hackelad8100e2006-05-01 14:25:21 -0700859 buf = (char *) __get_free_page(GFP_NOFS);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800860 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);
Kurt Hackel3156d262006-05-01 14:39:29 -0700874 queue_work(dlm->dlm_worker, &dlm->dispatched_work);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800875
876 dlm_put(dlm);
877 return 0;
878}
879
880static 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);
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800886 int ret;
887 u8 dead_node, reco_master;
Kurt Hackel29c0fa02006-04-27 18:06:58 -0700888 int skip_all_done = 0;
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800889
890 dlm = item->dlm;
891 dead_node = item->u.ral.dead_node;
892 reco_master = item->u.ral.reco_master;
Kurt Hackele2faea42006-01-12 14:24:55 -0800893 mres = (struct dlm_migratable_lockres *)data;
894
Kurt Hackeld6dea6e2006-04-27 18:08:51 -0700895 mlog(0, "%s: recovery worker started, dead=%u, master=%u\n",
896 dlm->name, dead_node, reco_master);
897
Kurt Hackele2faea42006-01-12 14:24:55 -0800898 if (dead_node != dlm->reco.dead_node ||
899 reco_master != dlm->reco.new_master) {
Kurt Hackel6a413212006-05-01 13:49:20 -0700900 /* 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;
Kurt Hackele2faea42006-01-12 14:24:55 -0800915 }
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800916
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800917 /* 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 */
Kurt Hackel29c0fa02006-04-27 18:06:58 -0700926
927 /* any errors returned will be due to the new_master dying,
928 * the dlm_reco_thread should detect this */
Christoph Hellwig800deef2007-05-17 16:03:13 +0200929 list_for_each_entry(res, &resources, recovering) {
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800930 ret = dlm_send_one_lockres(dlm, res, mres, reco_master,
931 DLM_MRES_RECOVERY);
Kurt Hackel29c0fa02006-04-27 18:06:58 -0700932 if (ret < 0) {
Kurt Hackeld6dea6e2006-04-27 18:08:51 -0700933 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);
Kurt Hackel29c0fa02006-04-27 18:06:58 -0700936 skip_all_done = 1;
937 break;
938 }
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800939 }
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
Kurt Hackel29c0fa02006-04-27 18:06:58 -0700946 if (!skip_all_done) {
947 ret = dlm_send_all_done_msg(dlm, dead_node, reco_master);
948 if (ret < 0) {
Kurt Hackeld6dea6e2006-04-27 18:08:51 -0700949 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);
Kurt Hackel29c0fa02006-04-27 18:06:58 -0700952 }
953 }
Kurt Hackel6a413212006-05-01 13:49:20 -0700954leave:
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800955 free_page((unsigned long)data);
956}
957
958
959static 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);
Kurt Hackel29c0fa02006-04-27 18:06:58 -0700973 if (ret < 0) {
Sunil Mushran8decab32011-07-24 10:23:54 -0700974 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);
Kurt Hackel29c0fa02006-04-27 18:06:58 -0700977 if (!dlm_is_host_down(ret)) {
Kurt Hackel29c0fa02006-04-27 18:06:58 -0700978 BUG();
979 }
980 } else
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800981 ret = tmpret;
982 return ret;
983}
984
985
Kurt Hackeld74c9802007-01-17 17:04:25 -0800986int dlm_reco_data_done_handler(struct o2net_msg *msg, u32 len, void *data,
987 void **ret_data)
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800988{
989 struct dlm_ctxt *dlm = data;
990 struct dlm_reco_data_done *done = (struct dlm_reco_data_done *)msg->buf;
Kurt Hackel6714d8e2005-12-15 14:31:23 -0800991 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);
Kurt Hackeld6dea6e2006-04-27 18:08:51 -07001000
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);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001005
1006 spin_lock(&dlm_reco_state_lock);
Christoph Hellwig800deef2007-05-17 16:03:13 +02001007 list_for_each_entry(ndata, &dlm->reco.node_data, list) {
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001008 if (ndata->node_num != done->node_idx)
1009 continue;
1010
1011 switch (ndata->state) {
Kurt Hackele2faea42006-01-12 14:24:55 -08001012 /* should have moved beyond INIT but not to FINALIZE yet */
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001013 case DLM_RECO_NODE_DATA_INIT:
1014 case DLM_RECO_NODE_DATA_DEAD:
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001015 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;
Kurt Hackele2faea42006-01-12 14:24:55 -08001021 /* these states are possible at this point, anywhere along
1022 * the line of recovery */
1023 case DLM_RECO_NODE_DATA_DONE:
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001024 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
1051static void dlm_move_reco_locks_to_list(struct dlm_ctxt *dlm,
1052 struct list_head *list,
1053 u8 dead_node)
1054{
Christoph Hellwig800deef2007-05-17 16:03:13 +02001055 struct dlm_lock_resource *res, *next;
Kurt Hackele2faea42006-01-12 14:24:55 -08001056 struct dlm_lock *lock;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001057
1058 spin_lock(&dlm->spinlock);
Christoph Hellwig800deef2007-05-17 16:03:13 +02001059 list_for_each_entry_safe(res, next, &dlm->reco.resources, recovering) {
Kurt Hackele2faea42006-01-12 14:24:55 -08001060 /* always prune any $RECOVERY entries for dead nodes,
1061 * otherwise hangs can occur during later recovery */
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001062 if (dlm_is_recovery_lock(res->lockname.name,
Kurt Hackele2faea42006-01-12 14:24:55 -08001063 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 "
Sunil Mushran2bd63212010-01-25 16:57:38 -08001069 "node %u (%s)!\n",
Kurt Hackele2faea42006-01-12 14:24:55 -08001070 dead_node, dlm->name);
1071 list_del_init(&lock->list);
1072 dlm_lock_put(lock);
1073 break;
1074 }
1075 }
1076 spin_unlock(&res->spinlock);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001077 continue;
Kurt Hackele2faea42006-01-12 14:24:55 -08001078 }
1079
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001080 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);
Akinobu Mitaf1166292006-06-26 00:24:46 -07001084 list_move_tail(&res->recovering, list);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001085 } 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);
Akinobu Mitaf1166292006-06-26 00:24:46 -07001088 list_move_tail(&res->recovering, list);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001089 }
1090 }
1091 spin_unlock(&dlm->spinlock);
1092}
1093
1094static 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
1109static 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
Kurt Hackelba2bf212006-12-01 14:47:20 -08001134 mlog(0, "%s:%.*s: sending mig lockres (%s) to %u\n",
1135 dlm->name, res->lockname.len, res->lockname.name,
Jeff Liu17ae26b2009-07-07 15:51:40 +08001136 orig_flags & DLM_MRES_MIGRATION ? "migration" : "recovery",
Kurt Hackelba2bf212006-12-01 14:47:20 -08001137 send_to);
1138
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001139 /* 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. */
Sunil Mushran8decab32011-07-24 10:23:54 -07001145 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"));
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001150 } 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
1171static 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 */
Shani Moideen5fb0f7f02007-06-11 09:38:19 +05301177 clear_page(mres);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001178 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
Sunil Mushran71656fa2010-01-25 16:57:39 -08001187static 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}
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001220
1221/* returns 1 if this lock fills the network structure,
1222 * 0 otherwise */
1223static 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;
Sunil Mushran71656fa2010-01-25 16:57:39 -08001237 dlm_prepare_lvb_for_migration(lock, mres, queue);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001238 }
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
Kurt Hackelba2bf212006-12-01 14:47:20 -08001247static 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
1261static 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}
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001275
1276int 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{
Christoph Hellwig800deef2007-05-17 16:03:13 +02001280 struct list_head *queue;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001281 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);
Christoph Hellwig800deef2007-05-17 16:03:13 +02001306 list_for_each_entry(lock, queue, list) {
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001307 /* 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);
Kurt Hackel29c0fa02006-04-27 18:06:58 -07001316 if (ret < 0)
1317 goto error;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001318 }
1319 }
Kurt Hackelba2bf212006-12-01 14:47:20 -08001320 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 }
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001328 /* flush any remaining locks */
1329 ret = dlm_send_mig_lockres_msg(dlm, mres, send_to, res, total_locks);
Kurt Hackel29c0fa02006-04-27 18:06:58 -07001330 if (ret < 0)
1331 goto error;
1332 return ret;
1333
1334error:
1335 mlog(ML_ERROR, "%s: dlm_send_mig_lockres_msg returned %d\n",
1336 dlm->name, ret);
1337 if (!dlm_is_host_down(ret))
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001338 BUG();
Kurt Hackel29c0fa02006-04-27 18:06:58 -07001339 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);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001343 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
Kurt Hackeld74c9802007-01-17 17:04:25 -08001361int dlm_mig_lockres_handler(struct o2net_msg *msg, u32 len, void *data,
1362 void **ret_data)
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001363{
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;
Sunil Mushran52987e22008-03-01 14:04:21 -08001369 u8 extra_refs = 0;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001370 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;
Kurt Hackelad8100e2006-05-01 14:25:21 -07001392 buf = kmalloc(be16_to_cpu(msg->data_len), GFP_NOFS);
Robert P. J. Daycd861282006-12-13 00:34:52 -08001393 item = kzalloc(sizeof(*item), GFP_NOFS);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001394 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);
Xue jiufei27749f22013-06-12 14:05:03 -07001421 dlm_lockres_put(res);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001422 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
Sunil Mushran52987e22008-03-01 14:04:21 -08001448 /* 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
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001464 /* 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);
Kurt Hackela6fa3642007-01-17 14:59:12 -08001469 wake_up(&res->wq);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001470 }
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;
Kurt Hackelba2bf212006-12-01 14:47:20 -08001476 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);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001480 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 {
Kurt Hackelba2bf212006-12-01 14:47:20 -08001487 /* take a reference now to pin the lockres, drop it
1488 * when locks are added in the worker */
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001489 dlm_change_lockres_owner(dlm, res, dlm->node_num);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001490 }
Kurt Hackelba2bf212006-12-01 14:47:20 -08001491 spin_unlock(&res->spinlock);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001492
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;
Sunil Mushran52987e22008-03-01 14:04:21 -08001499 item->u.ml.extra_ref = extra_refs;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001500 spin_lock(&dlm->work_lock);
1501 list_add_tail(&item->list, &dlm->work_list);
1502 spin_unlock(&dlm->work_lock);
Kurt Hackel3156d262006-05-01 14:39:29 -07001503 queue_work(dlm->dlm_worker, &dlm->dispatched_work);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001504
1505leave:
Sunil Mushran52987e22008-03-01 14:04:21 -08001506 /* One extra ref taken needs to be put here */
1507 if (extra_refs)
1508 dlm_lockres_put(res);
1509
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001510 dlm_put(dlm);
1511 if (ret < 0) {
Sachin Kamat7cfa74d2013-04-29 15:06:00 -07001512 kfree(buf);
1513 kfree(item);
Tao Mac1e8d352011-03-07 16:43:21 +08001514 mlog_errno(ret);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001515 }
1516
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001517 return ret;
1518}
1519
1520
1521static void dlm_mig_lockres_worker(struct dlm_work_item *item, void *data)
1522{
Sunil Mushran52987e22008-03-01 14:04:21 -08001523 struct dlm_ctxt *dlm;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001524 struct dlm_migratable_lockres *mres;
1525 int ret = 0;
1526 struct dlm_lock_resource *res;
1527 u8 real_master;
Sunil Mushran52987e22008-03-01 14:04:21 -08001528 u8 extra_ref;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001529
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;
Sunil Mushran52987e22008-03-01 14:04:21 -08001535 extra_ref = item->u.ml.extra_ref;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001536
1537 if (real_master == DLM_LOCK_RES_OWNER_UNKNOWN) {
1538 /* this case is super-rare. only occurs if
1539 * node death happens during migration. */
1540again:
1541 ret = dlm_lockres_master_requery(dlm, res, &real_master);
1542 if (ret < 0) {
Kurt Hackele2faea42006-01-12 14:24:55 -08001543 mlog(0, "dlm_lockres_master_requery ret=%d\n",
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001544 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 {
Kurt Hackelba2bf212006-12-01 14:47:20 -08001552 spin_lock(&res->spinlock);
1553 dlm_lockres_drop_inflight_ref(dlm, res);
1554 spin_unlock(&res->spinlock);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001555 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
1577leave:
Sunil Mushran52987e22008-03-01 14:04:21 -08001578 /* 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 }
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001584 kfree(data);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001585}
1586
1587
1588
Adrian Bunk8169cae2006-03-31 16:53:55 +02001589static int dlm_lockres_master_requery(struct dlm_ctxt *dlm,
1590 struct dlm_lock_resource *res,
1591 u8 *real_master)
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001592{
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);
Kurt Hackelc03872f2006-03-06 14:08:49 -08001633 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. */
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001637 }
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
Kurt Hackelc03872f2006-03-06 14:08:49 -08001647int dlm_do_master_requery(struct dlm_ctxt *dlm, struct dlm_lock_resource *res,
1648 u8 nodenum, u8 *real_master)
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001649{
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)
Wengang Wanga5196ec2010-03-30 12:09:22 +08001663 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);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001666 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 */
Kurt Hackeld74c9802007-01-17 17:04:25 -08001681int dlm_master_requery_handler(struct o2net_msg *msg, u32 len, void *data,
1682 void **ret_data)
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001683{
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;
Mark Fasheha3d33292006-03-09 17:55:56 -08001687 unsigned int hash;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001688 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
Mark Fasheha3d33292006-03-09 17:55:56 -08001697 hash = dlm_lockid_hash(req->name, req->namelen);
1698
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001699 spin_lock(&dlm->spinlock);
Mark Fasheha3d33292006-03-09 17:55:56 -08001700 res = __dlm_lookup_lockres(dlm, req->name, req->namelen, hash);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001701 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 }
Sunil Mushran52987e22008-03-01 14:04:21 -08001712 } else /* put.. incase we are not the master */
1713 dlm_lockres_put(res);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001714 spin_unlock(&res->spinlock);
1715 }
1716 spin_unlock(&dlm->spinlock);
1717
1718 dlm_put(dlm);
1719 return master;
1720}
1721
1722static inline struct list_head *
1723dlm_list_num_to_pointer(struct dlm_lock_resource *res, int list_num)
1724{
1725 struct list_head *ret;
1726 BUG_ON(list_num < 0);
1727 BUG_ON(list_num > 2);
1728 ret = &(res->granted);
1729 ret += list_num;
1730 return ret;
1731}
1732/* TODO: do ast flush business
1733 * TODO: do MIGRATING and RECOVERING spinning
1734 */
1735
1736/*
1737* NOTE about in-flight requests during migration:
1738*
1739* Before attempting the migrate, the master has marked the lockres as
1740* MIGRATING and then flushed all of its pending ASTS. So any in-flight
1741* requests either got queued before the MIGRATING flag got set, in which
1742* case the lock data will reflect the change and a return message is on
1743* the way, or the request failed to get in before MIGRATING got set. In
1744* this case, the caller will be told to spin and wait for the MIGRATING
1745* flag to be dropped, then recheck the master.
1746* This holds true for the convert, cancel and unlock cases, and since lvb
1747* updates are tied to these same messages, it applies to lvb updates as
1748* well. For the lock case, there is no way a lock can be on the master
1749* queue and not be on the secondary queue since the lock is always added
1750* locally first. This means that the new target node will never be sent
1751* a lock that he doesn't already have on the list.
1752* In total, this means that the local lock is correct and should not be
1753* updated to match the one sent by the master. Any messages sent back
1754* from the master before the MIGRATING flag will bring the lock properly
1755* up-to-date, and the change will be ordered properly for the waiter.
1756* We will *not* attempt to modify the lock underneath the waiter.
1757*/
1758
1759static int dlm_process_recovery_data(struct dlm_ctxt *dlm,
1760 struct dlm_lock_resource *res,
1761 struct dlm_migratable_lockres *mres)
1762{
1763 struct dlm_migratable_lock *ml;
Junxiao Bi34aa8da2014-04-03 14:46:49 -07001764 struct list_head *queue, *iter;
Kurt Hackele17e75e2007-01-05 15:04:49 -08001765 struct list_head *tmpq = NULL;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001766 struct dlm_lock *newlock = NULL;
1767 struct dlm_lockstatus *lksb = NULL;
1768 int ret = 0;
Kurt Hackele17e75e2007-01-05 15:04:49 -08001769 int i, j, bad;
Junxiao Bi34aa8da2014-04-03 14:46:49 -07001770 struct dlm_lock *lock;
Kurt Hackelba2bf212006-12-01 14:47:20 -08001771 u8 from = O2NM_MAX_NODES;
1772 unsigned int added = 0;
Sunil Mushran26636bf2010-01-25 16:57:40 -08001773 __be64 c;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001774
1775 mlog(0, "running %d locks for this lockres\n", mres->num_locks);
1776 for (i=0; i<mres->num_locks; i++) {
1777 ml = &(mres->ml[i]);
Kurt Hackelba2bf212006-12-01 14:47:20 -08001778
1779 if (dlm_is_dummy_lock(dlm, ml, &from)) {
1780 /* placeholder, just need to set the refmap bit */
1781 BUG_ON(mres->num_locks != 1);
1782 mlog(0, "%s:%.*s: dummy lock for %u\n",
1783 dlm->name, mres->lockname_len, mres->lockname,
1784 from);
1785 spin_lock(&res->spinlock);
Sunil Mushran8d400b82011-07-24 10:26:54 -07001786 dlm_lockres_set_refmap_bit(dlm, res, from);
Kurt Hackelba2bf212006-12-01 14:47:20 -08001787 spin_unlock(&res->spinlock);
1788 added++;
1789 break;
1790 }
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001791 BUG_ON(ml->highest_blocked != LKM_IVMODE);
1792 newlock = NULL;
1793 lksb = NULL;
1794
1795 queue = dlm_list_num_to_pointer(res, ml->list);
Kurt Hackele17e75e2007-01-05 15:04:49 -08001796 tmpq = NULL;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001797
1798 /* if the lock is for the local node it needs to
1799 * be moved to the proper location within the queue.
1800 * do not allocate a new lock structure. */
1801 if (ml->node == dlm->node_num) {
1802 /* MIGRATION ONLY! */
1803 BUG_ON(!(mres->flags & DLM_MRES_MIGRATION));
1804
Junxiao Bi34aa8da2014-04-03 14:46:49 -07001805 lock = NULL;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001806 spin_lock(&res->spinlock);
Kurt Hackele17e75e2007-01-05 15:04:49 -08001807 for (j = DLM_GRANTED_LIST; j <= DLM_BLOCKED_LIST; j++) {
1808 tmpq = dlm_list_idx_to_ptr(res, j);
Junxiao Bi34aa8da2014-04-03 14:46:49 -07001809 list_for_each(iter, tmpq) {
1810 lock = list_entry(iter,
1811 struct dlm_lock, list);
1812 if (lock->ml.cookie == ml->cookie)
Kurt Hackele17e75e2007-01-05 15:04:49 -08001813 break;
Junxiao Bi34aa8da2014-04-03 14:46:49 -07001814 lock = NULL;
Kurt Hackele17e75e2007-01-05 15:04:49 -08001815 }
1816 if (lock)
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001817 break;
1818 }
1819
1820 /* lock is always created locally first, and
1821 * destroyed locally last. it must be on the list */
1822 if (!lock) {
Sunil Mushran26636bf2010-01-25 16:57:40 -08001823 c = ml->cookie;
1824 mlog(ML_ERROR, "Could not find local lock "
1825 "with cookie %u:%llu, node %u, "
1826 "list %u, flags 0x%x, type %d, "
1827 "conv %d, highest blocked %d\n",
Kurt Hackel74aa2582007-01-17 15:11:36 -08001828 dlm_get_lock_cookie_node(be64_to_cpu(c)),
Sunil Mushran26636bf2010-01-25 16:57:40 -08001829 dlm_get_lock_cookie_seq(be64_to_cpu(c)),
1830 ml->node, ml->list, ml->flags, ml->type,
1831 ml->convert_type, ml->highest_blocked);
Kurt Hackel71ac1062007-01-05 15:02:30 -08001832 __dlm_print_one_lock_resource(res);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001833 BUG();
1834 }
Sunil Mushran26636bf2010-01-25 16:57:40 -08001835
1836 if (lock->ml.node != ml->node) {
1837 c = lock->ml.cookie;
1838 mlog(ML_ERROR, "Mismatched node# in lock "
1839 "cookie %u:%llu, name %.*s, node %u\n",
1840 dlm_get_lock_cookie_node(be64_to_cpu(c)),
1841 dlm_get_lock_cookie_seq(be64_to_cpu(c)),
1842 res->lockname.len, res->lockname.name,
1843 lock->ml.node);
1844 c = ml->cookie;
1845 mlog(ML_ERROR, "Migrate lock cookie %u:%llu, "
1846 "node %u, list %u, flags 0x%x, type %d, "
1847 "conv %d, highest blocked %d\n",
1848 dlm_get_lock_cookie_node(be64_to_cpu(c)),
1849 dlm_get_lock_cookie_seq(be64_to_cpu(c)),
1850 ml->node, ml->list, ml->flags, ml->type,
1851 ml->convert_type, ml->highest_blocked);
1852 __dlm_print_one_lock_resource(res);
1853 BUG();
1854 }
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001855
Kurt Hackele17e75e2007-01-05 15:04:49 -08001856 if (tmpq != queue) {
Sunil Mushran26636bf2010-01-25 16:57:40 -08001857 c = ml->cookie;
1858 mlog(0, "Lock cookie %u:%llu was on list %u "
1859 "instead of list %u for %.*s\n",
1860 dlm_get_lock_cookie_node(be64_to_cpu(c)),
1861 dlm_get_lock_cookie_seq(be64_to_cpu(c)),
1862 j, ml->list, res->lockname.len,
1863 res->lockname.name);
1864 __dlm_print_one_lock_resource(res);
Kurt Hackele17e75e2007-01-05 15:04:49 -08001865 spin_unlock(&res->spinlock);
1866 continue;
1867 }
1868
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001869 /* see NOTE above about why we do not update
1870 * to match the master here */
1871
1872 /* move the lock to its proper place */
1873 /* do not alter lock refcount. switching lists. */
Akinobu Mitaf1166292006-06-26 00:24:46 -07001874 list_move_tail(&lock->list, queue);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001875 spin_unlock(&res->spinlock);
Kurt Hackelba2bf212006-12-01 14:47:20 -08001876 added++;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001877
1878 mlog(0, "just reordered a local lock!\n");
1879 continue;
1880 }
1881
1882 /* lock is for another node. */
1883 newlock = dlm_new_lock(ml->type, ml->node,
1884 be64_to_cpu(ml->cookie), NULL);
1885 if (!newlock) {
1886 ret = -ENOMEM;
1887 goto leave;
1888 }
1889 lksb = newlock->lksb;
1890 dlm_lock_attach_lockres(newlock, res);
1891
1892 if (ml->convert_type != LKM_IVMODE) {
1893 BUG_ON(queue != &res->converting);
1894 newlock->ml.convert_type = ml->convert_type;
1895 }
1896 lksb->flags |= (ml->flags &
1897 (DLM_LKSB_PUT_LVB|DLM_LKSB_GET_LVB));
Kurt Hackelccd8b1f2006-05-01 11:32:14 -07001898
1899 if (ml->type == LKM_NLMODE)
1900 goto skip_lvb;
1901
Xue jiufei750e3c62013-11-12 15:06:59 -08001902 /*
1903 * If the lock is in the blocked list it can't have a valid lvb,
1904 * so skip it
1905 */
1906 if (ml->list == DLM_BLOCKED_LIST)
1907 goto skip_lvb;
1908
Kurt Hackel8bc674c2006-04-27 18:02:10 -07001909 if (!dlm_lvb_is_empty(mres->lvb)) {
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001910 if (lksb->flags & DLM_LKSB_PUT_LVB) {
1911 /* other node was trying to update
1912 * lvb when node died. recreate the
1913 * lksb with the updated lvb. */
1914 memcpy(lksb->lvb, mres->lvb, DLM_LVB_LEN);
Kurt Hackelccd8b1f2006-05-01 11:32:14 -07001915 /* the lock resource lvb update must happen
1916 * NOW, before the spinlock is dropped.
1917 * we no longer wait for the AST to update
1918 * the lvb. */
1919 memcpy(res->lvb, mres->lvb, DLM_LVB_LEN);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001920 } else {
Sunil Mushran2bd63212010-01-25 16:57:38 -08001921 /* otherwise, the node is sending its
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001922 * most recent valid lvb info */
1923 BUG_ON(ml->type != LKM_EXMODE &&
1924 ml->type != LKM_PRMODE);
Kurt Hackel8bc674c2006-04-27 18:02:10 -07001925 if (!dlm_lvb_is_empty(res->lvb) &&
Kurt Hackelccd8b1f2006-05-01 11:32:14 -07001926 (ml->type == LKM_EXMODE ||
1927 memcmp(res->lvb, mres->lvb, DLM_LVB_LEN))) {
1928 int i;
1929 mlog(ML_ERROR, "%s:%.*s: received bad "
1930 "lvb! type=%d\n", dlm->name,
1931 res->lockname.len,
1932 res->lockname.name, ml->type);
1933 printk("lockres lvb=[");
1934 for (i=0; i<DLM_LVB_LEN; i++)
1935 printk("%02x", res->lvb[i]);
1936 printk("]\nmigrated lvb=[");
1937 for (i=0; i<DLM_LVB_LEN; i++)
1938 printk("%02x", mres->lvb[i]);
1939 printk("]\n");
1940 dlm_print_one_lock_resource(res);
1941 BUG();
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001942 }
1943 memcpy(res->lvb, mres->lvb, DLM_LVB_LEN);
1944 }
1945 }
Kurt Hackelccd8b1f2006-05-01 11:32:14 -07001946skip_lvb:
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001947
1948 /* NOTE:
1949 * wrt lock queue ordering and recovery:
1950 * 1. order of locks on granted queue is
1951 * meaningless.
1952 * 2. order of locks on converting queue is
1953 * LOST with the node death. sorry charlie.
1954 * 3. order of locks on the blocked queue is
1955 * also LOST.
1956 * order of locks does not affect integrity, it
1957 * just means that a lock request may get pushed
1958 * back in line as a result of the node death.
1959 * also note that for a given node the lock order
1960 * for its secondary queue locks is preserved
1961 * relative to each other, but clearly *not*
1962 * preserved relative to locks from other nodes.
1963 */
Kurt Hackelc3187ce2006-04-27 18:05:41 -07001964 bad = 0;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001965 spin_lock(&res->spinlock);
Kurt Hackelc3187ce2006-04-27 18:05:41 -07001966 list_for_each_entry(lock, queue, list) {
1967 if (lock->ml.cookie == ml->cookie) {
Sunil Mushran26636bf2010-01-25 16:57:40 -08001968 c = lock->ml.cookie;
Kurt Hackelc3187ce2006-04-27 18:05:41 -07001969 mlog(ML_ERROR, "%s:%.*s: %u:%llu: lock already "
1970 "exists on this lockres!\n", dlm->name,
1971 res->lockname.len, res->lockname.name,
Kurt Hackel74aa2582007-01-17 15:11:36 -08001972 dlm_get_lock_cookie_node(be64_to_cpu(c)),
1973 dlm_get_lock_cookie_seq(be64_to_cpu(c)));
Kurt Hackelc3187ce2006-04-27 18:05:41 -07001974
1975 mlog(ML_NOTICE, "sent lock: type=%d, conv=%d, "
1976 "node=%u, cookie=%u:%llu, queue=%d\n",
1977 ml->type, ml->convert_type, ml->node,
Kurt Hackel74aa2582007-01-17 15:11:36 -08001978 dlm_get_lock_cookie_node(be64_to_cpu(ml->cookie)),
1979 dlm_get_lock_cookie_seq(be64_to_cpu(ml->cookie)),
Kurt Hackelc3187ce2006-04-27 18:05:41 -07001980 ml->list);
1981
1982 __dlm_print_one_lock_resource(res);
1983 bad = 1;
1984 break;
1985 }
1986 }
1987 if (!bad) {
1988 dlm_lock_get(newlock);
1989 list_add_tail(&newlock->list, queue);
Kurt Hackelba2bf212006-12-01 14:47:20 -08001990 mlog(0, "%s:%.*s: added lock for node %u, "
1991 "setting refmap bit\n", dlm->name,
1992 res->lockname.len, res->lockname.name, ml->node);
Sunil Mushran8d400b82011-07-24 10:26:54 -07001993 dlm_lockres_set_refmap_bit(dlm, res, ml->node);
Kurt Hackelba2bf212006-12-01 14:47:20 -08001994 added++;
Kurt Hackelc3187ce2006-04-27 18:05:41 -07001995 }
Kurt Hackel6714d8e2005-12-15 14:31:23 -08001996 spin_unlock(&res->spinlock);
1997 }
1998 mlog(0, "done running all the locks\n");
1999
2000leave:
Kurt Hackelba2bf212006-12-01 14:47:20 -08002001 /* balance the ref taken when the work was queued */
Kurt Hackel50635f12007-01-17 14:54:39 -08002002 spin_lock(&res->spinlock);
2003 dlm_lockres_drop_inflight_ref(dlm, res);
2004 spin_unlock(&res->spinlock);
Kurt Hackelba2bf212006-12-01 14:47:20 -08002005
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002006 if (ret < 0) {
2007 mlog_errno(ret);
2008 if (newlock)
2009 dlm_lock_put(newlock);
2010 }
2011
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002012 return ret;
2013}
2014
2015void dlm_move_lockres_to_recovery_list(struct dlm_ctxt *dlm,
2016 struct dlm_lock_resource *res)
2017{
2018 int i;
Christoph Hellwig800deef2007-05-17 16:03:13 +02002019 struct list_head *queue;
2020 struct dlm_lock *lock, *next;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002021
Wengang Wanga5248122010-07-30 16:14:44 +08002022 assert_spin_locked(&dlm->spinlock);
2023 assert_spin_locked(&res->spinlock);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002024 res->state |= DLM_LOCK_RES_RECOVERING;
Kurt Hackel69d72b02006-05-01 10:57:51 -07002025 if (!list_empty(&res->recovering)) {
2026 mlog(0,
2027 "Recovering res %s:%.*s, is already on recovery list!\n",
2028 dlm->name, res->lockname.len, res->lockname.name);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002029 list_del_init(&res->recovering);
Sunil Mushran52987e22008-03-01 14:04:21 -08002030 dlm_lockres_put(res);
Kurt Hackel69d72b02006-05-01 10:57:51 -07002031 }
2032 /* We need to hold a reference while on the recovery list */
2033 dlm_lockres_get(res);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002034 list_add_tail(&res->recovering, &dlm->reco.resources);
2035
2036 /* find any pending locks and put them back on proper list */
2037 for (i=DLM_BLOCKED_LIST; i>=DLM_GRANTED_LIST; i--) {
2038 queue = dlm_list_idx_to_ptr(res, i);
Christoph Hellwig800deef2007-05-17 16:03:13 +02002039 list_for_each_entry_safe(lock, next, queue, list) {
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002040 dlm_lock_get(lock);
2041 if (lock->convert_pending) {
2042 /* move converting lock back to granted */
2043 BUG_ON(i != DLM_CONVERTING_LIST);
2044 mlog(0, "node died with convert pending "
2045 "on %.*s. move back to granted list.\n",
2046 res->lockname.len, res->lockname.name);
2047 dlm_revert_pending_convert(res, lock);
2048 lock->convert_pending = 0;
2049 } else if (lock->lock_pending) {
2050 /* remove pending lock requests completely */
2051 BUG_ON(i != DLM_BLOCKED_LIST);
2052 mlog(0, "node died with lock pending "
2053 "on %.*s. remove from blocked list and skip.\n",
2054 res->lockname.len, res->lockname.name);
2055 /* lock will be floating until ref in
2056 * dlmlock_remote is freed after the network
2057 * call returns. ok for it to not be on any
2058 * list since no ast can be called
2059 * (the master is dead). */
2060 dlm_revert_pending_lock(res, lock);
2061 lock->lock_pending = 0;
2062 } else if (lock->unlock_pending) {
2063 /* if an unlock was in progress, treat as
2064 * if this had completed successfully
2065 * before sending this lock state to the
2066 * new master. note that the dlm_unlock
2067 * call is still responsible for calling
2068 * the unlockast. that will happen after
2069 * the network call times out. for now,
2070 * just move lists to prepare the new
2071 * recovery master. */
2072 BUG_ON(i != DLM_GRANTED_LIST);
2073 mlog(0, "node died with unlock pending "
2074 "on %.*s. remove from blocked list and skip.\n",
2075 res->lockname.len, res->lockname.name);
2076 dlm_commit_pending_unlock(res, lock);
2077 lock->unlock_pending = 0;
2078 } else if (lock->cancel_pending) {
2079 /* if a cancel was in progress, treat as
2080 * if this had completed successfully
2081 * before sending this lock state to the
2082 * new master */
2083 BUG_ON(i != DLM_CONVERTING_LIST);
2084 mlog(0, "node died with cancel pending "
2085 "on %.*s. move back to granted list.\n",
2086 res->lockname.len, res->lockname.name);
2087 dlm_commit_pending_cancel(res, lock);
2088 lock->cancel_pending = 0;
2089 }
2090 dlm_lock_put(lock);
2091 }
2092 }
2093}
2094
2095
2096
2097/* removes all recovered locks from the recovery list.
2098 * sets the res->owner to the new master.
2099 * unsets the RECOVERY flag and wakes waiters. */
2100static void dlm_finish_local_lockres_recovery(struct dlm_ctxt *dlm,
2101 u8 dead_node, u8 new_master)
2102{
2103 int i;
Mark Fasheh81f20942006-02-28 17:31:22 -08002104 struct hlist_head *bucket;
Christoph Hellwig800deef2007-05-17 16:03:13 +02002105 struct dlm_lock_resource *res, *next;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002106
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002107 assert_spin_locked(&dlm->spinlock);
2108
Christoph Hellwig800deef2007-05-17 16:03:13 +02002109 list_for_each_entry_safe(res, next, &dlm->reco.resources, recovering) {
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002110 if (res->owner == dead_node) {
Sunil Mushran0afbba12011-07-24 10:25:54 -07002111 mlog(0, "%s: res %.*s, Changing owner from %u to %u\n",
2112 dlm->name, res->lockname.len, res->lockname.name,
2113 res->owner, new_master);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002114 list_del_init(&res->recovering);
2115 spin_lock(&res->spinlock);
Kurt Hackelba2bf212006-12-01 14:47:20 -08002116 /* new_master has our reference from
2117 * the lock state sent during recovery */
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002118 dlm_change_lockres_owner(dlm, res, new_master);
2119 res->state &= ~DLM_LOCK_RES_RECOVERING;
Kurt Hackelba2bf212006-12-01 14:47:20 -08002120 if (__dlm_lockres_has_locks(res))
Kurt Hackel69d72b02006-05-01 10:57:51 -07002121 __dlm_dirty_lockres(dlm, res);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002122 spin_unlock(&res->spinlock);
2123 wake_up(&res->wq);
Kurt Hackel69d72b02006-05-01 10:57:51 -07002124 dlm_lockres_put(res);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002125 }
2126 }
2127
2128 /* this will become unnecessary eventually, but
2129 * for now we need to run the whole hash, clear
2130 * the RECOVERING state and set the owner
2131 * if necessary */
Mark Fasheh81f20942006-02-28 17:31:22 -08002132 for (i = 0; i < DLM_HASH_BUCKETS; i++) {
Daniel Phillips03d864c2006-03-10 18:08:16 -08002133 bucket = dlm_lockres_hash(dlm, i);
Sasha Levinb67bfe02013-02-27 17:06:00 -08002134 hlist_for_each_entry(res, bucket, hash_node) {
Sunil Mushran0afbba12011-07-24 10:25:54 -07002135 if (!(res->state & DLM_LOCK_RES_RECOVERING))
2136 continue;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002137
Sunil Mushran0afbba12011-07-24 10:25:54 -07002138 if (res->owner != dead_node &&
2139 res->owner != dlm->node_num)
2140 continue;
2141
2142 if (!list_empty(&res->recovering)) {
2143 list_del_init(&res->recovering);
2144 dlm_lockres_put(res);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002145 }
Sunil Mushran0afbba12011-07-24 10:25:54 -07002146
2147 /* new_master has our reference from
2148 * the lock state sent during recovery */
2149 mlog(0, "%s: res %.*s, Changing owner from %u to %u\n",
2150 dlm->name, res->lockname.len, res->lockname.name,
2151 res->owner, new_master);
2152 spin_lock(&res->spinlock);
2153 dlm_change_lockres_owner(dlm, res, new_master);
2154 res->state &= ~DLM_LOCK_RES_RECOVERING;
2155 if (__dlm_lockres_has_locks(res))
2156 __dlm_dirty_lockres(dlm, res);
2157 spin_unlock(&res->spinlock);
2158 wake_up(&res->wq);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002159 }
2160 }
2161}
2162
2163static inline int dlm_lvb_needs_invalidation(struct dlm_lock *lock, int local)
2164{
2165 if (local) {
2166 if (lock->ml.type != LKM_EXMODE &&
2167 lock->ml.type != LKM_PRMODE)
2168 return 1;
2169 } else if (lock->ml.type == LKM_EXMODE)
2170 return 1;
2171 return 0;
2172}
2173
2174static void dlm_revalidate_lvb(struct dlm_ctxt *dlm,
2175 struct dlm_lock_resource *res, u8 dead_node)
2176{
Christoph Hellwig800deef2007-05-17 16:03:13 +02002177 struct list_head *queue;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002178 struct dlm_lock *lock;
2179 int blank_lvb = 0, local = 0;
2180 int i;
2181 u8 search_node;
2182
2183 assert_spin_locked(&dlm->spinlock);
2184 assert_spin_locked(&res->spinlock);
2185
2186 if (res->owner == dlm->node_num)
Sunil Mushran2bd63212010-01-25 16:57:38 -08002187 /* if this node owned the lockres, and if the dead node
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002188 * had an EX when he died, blank out the lvb */
2189 search_node = dead_node;
2190 else {
2191 /* if this is a secondary lockres, and we had no EX or PR
2192 * locks granted, we can no longer trust the lvb */
2193 search_node = dlm->node_num;
2194 local = 1; /* check local state for valid lvb */
2195 }
2196
2197 for (i=DLM_GRANTED_LIST; i<=DLM_CONVERTING_LIST; i++) {
2198 queue = dlm_list_idx_to_ptr(res, i);
Christoph Hellwig800deef2007-05-17 16:03:13 +02002199 list_for_each_entry(lock, queue, list) {
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002200 if (lock->ml.node == search_node) {
2201 if (dlm_lvb_needs_invalidation(lock, local)) {
2202 /* zero the lksb lvb and lockres lvb */
2203 blank_lvb = 1;
2204 memset(lock->lksb->lvb, 0, DLM_LVB_LEN);
2205 }
2206 }
2207 }
2208 }
2209
2210 if (blank_lvb) {
2211 mlog(0, "clearing %.*s lvb, dead node %u had EX\n",
2212 res->lockname.len, res->lockname.name, dead_node);
2213 memset(res->lvb, 0, DLM_LVB_LEN);
2214 }
2215}
2216
2217static void dlm_free_dead_locks(struct dlm_ctxt *dlm,
2218 struct dlm_lock_resource *res, u8 dead_node)
2219{
Christoph Hellwig800deef2007-05-17 16:03:13 +02002220 struct dlm_lock *lock, *next;
Kurt Hackelba2bf212006-12-01 14:47:20 -08002221 unsigned int freed = 0;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002222
2223 /* this node is the lockres master:
2224 * 1) remove any stale locks for the dead node
Sunil Mushran2bd63212010-01-25 16:57:38 -08002225 * 2) if the dead node had an EX when he died, blank out the lvb
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002226 */
2227 assert_spin_locked(&dlm->spinlock);
2228 assert_spin_locked(&res->spinlock);
2229
Sunil Mushran2c5c54a2008-03-01 14:04:20 -08002230 /* We do two dlm_lock_put(). One for removing from list and the other is
2231 * to force the DLM_UNLOCK_FREE_LOCK action so as to free the locks */
2232
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002233 /* TODO: check pending_asts, pending_basts here */
Christoph Hellwig800deef2007-05-17 16:03:13 +02002234 list_for_each_entry_safe(lock, next, &res->granted, list) {
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002235 if (lock->ml.node == dead_node) {
2236 list_del_init(&lock->list);
2237 dlm_lock_put(lock);
Sunil Mushran2c5c54a2008-03-01 14:04:20 -08002238 /* Can't schedule DLM_UNLOCK_FREE_LOCK - do manually */
2239 dlm_lock_put(lock);
Kurt Hackelba2bf212006-12-01 14:47:20 -08002240 freed++;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002241 }
2242 }
Christoph Hellwig800deef2007-05-17 16:03:13 +02002243 list_for_each_entry_safe(lock, next, &res->converting, list) {
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002244 if (lock->ml.node == dead_node) {
2245 list_del_init(&lock->list);
2246 dlm_lock_put(lock);
Sunil Mushran2c5c54a2008-03-01 14:04:20 -08002247 /* Can't schedule DLM_UNLOCK_FREE_LOCK - do manually */
2248 dlm_lock_put(lock);
Kurt Hackelba2bf212006-12-01 14:47:20 -08002249 freed++;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002250 }
2251 }
Christoph Hellwig800deef2007-05-17 16:03:13 +02002252 list_for_each_entry_safe(lock, next, &res->blocked, list) {
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002253 if (lock->ml.node == dead_node) {
2254 list_del_init(&lock->list);
2255 dlm_lock_put(lock);
Sunil Mushran2c5c54a2008-03-01 14:04:20 -08002256 /* Can't schedule DLM_UNLOCK_FREE_LOCK - do manually */
2257 dlm_lock_put(lock);
Kurt Hackelba2bf212006-12-01 14:47:20 -08002258 freed++;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002259 }
2260 }
2261
Kurt Hackelba2bf212006-12-01 14:47:20 -08002262 if (freed) {
2263 mlog(0, "%s:%.*s: freed %u locks for dead node %u, "
2264 "dropping ref from lockres\n", dlm->name,
2265 res->lockname.len, res->lockname.name, freed, dead_node);
Sunil Mushrancda70ba2010-02-01 17:34:58 -08002266 if(!test_bit(dead_node, res->refmap)) {
2267 mlog(ML_ERROR, "%s:%.*s: freed %u locks for dead node %u, "
2268 "but ref was not set\n", dlm->name,
2269 res->lockname.len, res->lockname.name, freed, dead_node);
2270 __dlm_print_one_lock_resource(res);
2271 }
Sunil Mushran8d400b82011-07-24 10:26:54 -07002272 dlm_lockres_clear_refmap_bit(dlm, res, dead_node);
Kurt Hackelba2bf212006-12-01 14:47:20 -08002273 } else if (test_bit(dead_node, res->refmap)) {
2274 mlog(0, "%s:%.*s: dead node %u had a ref, but had "
2275 "no locks and had not purged before dying\n", dlm->name,
2276 res->lockname.len, res->lockname.name, dead_node);
Sunil Mushran8d400b82011-07-24 10:26:54 -07002277 dlm_lockres_clear_refmap_bit(dlm, res, dead_node);
Kurt Hackelba2bf212006-12-01 14:47:20 -08002278 }
2279
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002280 /* do not kick thread yet */
2281 __dlm_dirty_lockres(dlm, res);
2282}
2283
2284/* if this node is the recovery master, and there are no
2285 * locks for a given lockres owned by this node that are in
2286 * either PR or EX mode, zero out the lvb before requesting.
2287 *
2288 */
2289
2290
2291static void dlm_do_local_recovery_cleanup(struct dlm_ctxt *dlm, u8 dead_node)
2292{
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002293 struct dlm_lock_resource *res;
2294 int i;
Mark Fasheh81f20942006-02-28 17:31:22 -08002295 struct hlist_head *bucket;
Kurt Hackele2faea42006-01-12 14:24:55 -08002296 struct dlm_lock *lock;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002297
2298
2299 /* purge any stale mles */
2300 dlm_clean_master_list(dlm, dead_node);
2301
2302 /*
2303 * now clean up all lock resources. there are two rules:
2304 *
2305 * 1) if the dead node was the master, move the lockres
2306 * to the recovering list. set the RECOVERING flag.
2307 * this lockres needs to be cleaned up before it can
2308 * be used further.
2309 *
2310 * 2) if this node was the master, remove all locks from
2311 * each of the lockres queues that were owned by the
2312 * dead node. once recovery finishes, the dlm thread
2313 * can be kicked again to see if any ASTs or BASTs
2314 * need to be fired as a result.
2315 */
Mark Fasheh81f20942006-02-28 17:31:22 -08002316 for (i = 0; i < DLM_HASH_BUCKETS; i++) {
Daniel Phillips03d864c2006-03-10 18:08:16 -08002317 bucket = dlm_lockres_hash(dlm, i);
Sasha Levinb67bfe02013-02-27 17:06:00 -08002318 hlist_for_each_entry(res, bucket, hash_node) {
Kurt Hackele2faea42006-01-12 14:24:55 -08002319 /* always prune any $RECOVERY entries for dead nodes,
2320 * otherwise hangs can occur during later recovery */
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002321 if (dlm_is_recovery_lock(res->lockname.name,
Kurt Hackele2faea42006-01-12 14:24:55 -08002322 res->lockname.len)) {
2323 spin_lock(&res->spinlock);
2324 list_for_each_entry(lock, &res->granted, list) {
2325 if (lock->ml.node == dead_node) {
2326 mlog(0, "AHA! there was "
2327 "a $RECOVERY lock for dead "
2328 "node %u (%s)!\n",
2329 dead_node, dlm->name);
2330 list_del_init(&lock->list);
2331 dlm_lock_put(lock);
2332 break;
2333 }
2334 }
2335 spin_unlock(&res->spinlock);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002336 continue;
Sunil Mushran2bd63212010-01-25 16:57:38 -08002337 }
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002338 spin_lock(&res->spinlock);
2339 /* zero the lvb if necessary */
2340 dlm_revalidate_lvb(dlm, res, dead_node);
Kurt Hackelba2bf212006-12-01 14:47:20 -08002341 if (res->owner == dead_node) {
Wengang Wanga5248122010-07-30 16:14:44 +08002342 if (res->state & DLM_LOCK_RES_DROPPING_REF) {
Sunil Mushran8decab32011-07-24 10:23:54 -07002343 mlog(ML_NOTICE, "%s: res %.*s, Skip "
Wengang Wanga5248122010-07-30 16:14:44 +08002344 "recovery as it is being freed\n",
Sunil Mushran8decab32011-07-24 10:23:54 -07002345 dlm->name, res->lockname.len,
Wengang Wanga5248122010-07-30 16:14:44 +08002346 res->lockname.name);
2347 } else
2348 dlm_move_lockres_to_recovery_list(dlm,
2349 res);
Kurt Hackelba2bf212006-12-01 14:47:20 -08002350
Kurt Hackelba2bf212006-12-01 14:47:20 -08002351 } else if (res->owner == dlm->node_num) {
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002352 dlm_free_dead_locks(dlm, res, dead_node);
2353 __dlm_lockres_calc_usage(dlm, res);
Xue jiufei69b2bd162013-09-11 14:19:57 -07002354 } else if (res->owner == DLM_LOCK_RES_OWNER_UNKNOWN) {
2355 if (test_bit(dead_node, res->refmap)) {
2356 mlog(0, "%s:%.*s: dead node %u had a ref, but had "
2357 "no locks and had not purged before dying\n",
2358 dlm->name, res->lockname.len,
2359 res->lockname.name, dead_node);
2360 dlm_lockres_clear_refmap_bit(dlm, res, dead_node);
2361 }
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002362 }
2363 spin_unlock(&res->spinlock);
2364 }
2365 }
2366
2367}
2368
2369static void __dlm_hb_node_down(struct dlm_ctxt *dlm, int idx)
2370{
2371 assert_spin_locked(&dlm->spinlock);
2372
Kurt Hackel466d1a42006-05-01 11:11:13 -07002373 if (dlm->reco.new_master == idx) {
2374 mlog(0, "%s: recovery master %d just died\n",
2375 dlm->name, idx);
2376 if (dlm->reco.state & DLM_RECO_STATE_FINALIZE) {
2377 /* finalize1 was reached, so it is safe to clear
2378 * the new_master and dead_node. that recovery
2379 * is complete. */
2380 mlog(0, "%s: dead master %d had reached "
2381 "finalize1 state, clearing\n", dlm->name, idx);
2382 dlm->reco.state &= ~DLM_RECO_STATE_FINALIZE;
2383 __dlm_reset_recovery(dlm);
2384 }
2385 }
2386
Tao Ma2d4b1cb2008-01-10 15:20:55 +08002387 /* Clean up join state on node death. */
2388 if (dlm->joining_node == idx) {
2389 mlog(0, "Clearing join state for node %u\n", idx);
2390 __dlm_set_joining_node(dlm, DLM_LOCK_RES_OWNER_UNKNOWN);
2391 }
2392
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002393 /* check to see if the node is already considered dead */
2394 if (!test_bit(idx, dlm->live_nodes_map)) {
2395 mlog(0, "for domain %s, node %d is already dead. "
2396 "another node likely did recovery already.\n",
2397 dlm->name, idx);
2398 return;
2399 }
2400
2401 /* check to see if we do not care about this node */
2402 if (!test_bit(idx, dlm->domain_map)) {
2403 /* This also catches the case that we get a node down
2404 * but haven't joined the domain yet. */
2405 mlog(0, "node %u already removed from domain!\n", idx);
2406 return;
2407 }
2408
2409 clear_bit(idx, dlm->live_nodes_map);
2410
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002411 /* make sure local cleanup occurs before the heartbeat events */
2412 if (!test_bit(idx, dlm->recovery_map))
2413 dlm_do_local_recovery_cleanup(dlm, idx);
2414
2415 /* notify anything attached to the heartbeat events */
2416 dlm_hb_event_notify_attached(dlm, idx, 0);
2417
2418 mlog(0, "node %u being removed from domain map!\n", idx);
2419 clear_bit(idx, dlm->domain_map);
Sunil Mushranbddefde2011-05-19 14:34:11 -07002420 clear_bit(idx, dlm->exit_domain_map);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002421 /* wake up migration waiters if a node goes down.
2422 * perhaps later we can genericize this for other waiters. */
2423 wake_up(&dlm->migration_wq);
2424
2425 if (test_bit(idx, dlm->recovery_map))
2426 mlog(0, "domain %s, node %u already added "
2427 "to recovery map!\n", dlm->name, idx);
2428 else
2429 set_bit(idx, dlm->recovery_map);
2430}
2431
2432void dlm_hb_node_down_cb(struct o2nm_node *node, int idx, void *data)
2433{
2434 struct dlm_ctxt *dlm = data;
2435
2436 if (!dlm_grab(dlm))
2437 return;
2438
Mark Fasheh65611682007-09-07 11:11:10 -07002439 /*
2440 * This will notify any dlm users that a node in our domain
2441 * went away without notifying us first.
2442 */
2443 if (test_bit(idx, dlm->domain_map))
2444 dlm_fire_domain_eviction_callbacks(dlm, idx);
2445
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002446 spin_lock(&dlm->spinlock);
2447 __dlm_hb_node_down(dlm, idx);
2448 spin_unlock(&dlm->spinlock);
2449
2450 dlm_put(dlm);
2451}
2452
2453void dlm_hb_node_up_cb(struct o2nm_node *node, int idx, void *data)
2454{
2455 struct dlm_ctxt *dlm = data;
2456
2457 if (!dlm_grab(dlm))
2458 return;
2459
2460 spin_lock(&dlm->spinlock);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002461 set_bit(idx, dlm->live_nodes_map);
Kurt Hackele2faea42006-01-12 14:24:55 -08002462 /* do NOT notify mle attached to the heartbeat events.
2463 * new nodes are not interesting in mastery until joined. */
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002464 spin_unlock(&dlm->spinlock);
2465
2466 dlm_put(dlm);
2467}
2468
2469static void dlm_reco_ast(void *astdata)
2470{
2471 struct dlm_ctxt *dlm = astdata;
2472 mlog(0, "ast for recovery lock fired!, this=%u, dlm=%s\n",
2473 dlm->node_num, dlm->name);
2474}
2475static void dlm_reco_bast(void *astdata, int blocked_type)
2476{
2477 struct dlm_ctxt *dlm = astdata;
2478 mlog(0, "bast for recovery lock fired!, this=%u, dlm=%s\n",
2479 dlm->node_num, dlm->name);
2480}
2481static void dlm_reco_unlock_ast(void *astdata, enum dlm_status st)
2482{
2483 mlog(0, "unlockast for recovery lock fired!\n");
2484}
2485
Kurt Hackele2faea42006-01-12 14:24:55 -08002486/*
2487 * dlm_pick_recovery_master will continually attempt to use
2488 * dlmlock() on the special "$RECOVERY" lockres with the
2489 * LKM_NOQUEUE flag to get an EX. every thread that enters
2490 * this function on each node racing to become the recovery
2491 * master will not stop attempting this until either:
2492 * a) this node gets the EX (and becomes the recovery master),
Sunil Mushran2bd63212010-01-25 16:57:38 -08002493 * or b) dlm->reco.new_master gets set to some nodenum
Kurt Hackele2faea42006-01-12 14:24:55 -08002494 * != O2NM_INVALID_NODE_NUM (another node will do the reco).
2495 * so each time a recovery master is needed, the entire cluster
2496 * will sync at this point. if the new master dies, that will
2497 * be detected in dlm_do_recovery */
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002498static int dlm_pick_recovery_master(struct dlm_ctxt *dlm)
2499{
2500 enum dlm_status ret;
2501 struct dlm_lockstatus lksb;
2502 int status = -EINVAL;
2503
2504 mlog(0, "starting recovery of %s at %lu, dead=%u, this=%u\n",
2505 dlm->name, jiffies, dlm->reco.dead_node, dlm->node_num);
Sunil Mushran2bd63212010-01-25 16:57:38 -08002506again:
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002507 memset(&lksb, 0, sizeof(lksb));
2508
2509 ret = dlmlock(dlm, LKM_EXMODE, &lksb, LKM_NOQUEUE|LKM_RECOVERY,
Mark Fasheh3384f3d2006-09-08 11:38:29 -07002510 DLM_RECOVERY_LOCK_NAME, DLM_RECOVERY_LOCK_NAME_LEN,
2511 dlm_reco_ast, dlm, dlm_reco_bast);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002512
Kurt Hackele2faea42006-01-12 14:24:55 -08002513 mlog(0, "%s: dlmlock($RECOVERY) returned %d, lksb=%d\n",
2514 dlm->name, ret, lksb.status);
2515
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002516 if (ret == DLM_NORMAL) {
2517 mlog(0, "dlm=%s dlmlock says I got it (this=%u)\n",
2518 dlm->name, dlm->node_num);
Sunil Mushran2bd63212010-01-25 16:57:38 -08002519
2520 /* got the EX lock. check to see if another node
Kurt Hackele2faea42006-01-12 14:24:55 -08002521 * just became the reco master */
2522 if (dlm_reco_master_ready(dlm)) {
2523 mlog(0, "%s: got reco EX lock, but %u will "
2524 "do the recovery\n", dlm->name,
2525 dlm->reco.new_master);
2526 status = -EEXIST;
2527 } else {
Kurt Hackel898effa2006-01-18 17:01:25 -08002528 status = 0;
2529
2530 /* see if recovery was already finished elsewhere */
2531 spin_lock(&dlm->spinlock);
2532 if (dlm->reco.dead_node == O2NM_INVALID_NODE_NUM) {
Sunil Mushran2bd63212010-01-25 16:57:38 -08002533 status = -EINVAL;
Kurt Hackel898effa2006-01-18 17:01:25 -08002534 mlog(0, "%s: got reco EX lock, but "
2535 "node got recovered already\n", dlm->name);
2536 if (dlm->reco.new_master != O2NM_INVALID_NODE_NUM) {
2537 mlog(ML_ERROR, "%s: new master is %u "
Sunil Mushran2bd63212010-01-25 16:57:38 -08002538 "but no dead node!\n",
Kurt Hackel898effa2006-01-18 17:01:25 -08002539 dlm->name, dlm->reco.new_master);
2540 BUG();
2541 }
2542 }
2543 spin_unlock(&dlm->spinlock);
2544 }
2545
2546 /* if this node has actually become the recovery master,
2547 * set the master and send the messages to begin recovery */
2548 if (!status) {
2549 mlog(0, "%s: dead=%u, this=%u, sending "
Sunil Mushran2bd63212010-01-25 16:57:38 -08002550 "begin_reco now\n", dlm->name,
Kurt Hackel898effa2006-01-18 17:01:25 -08002551 dlm->reco.dead_node, dlm->node_num);
Kurt Hackele2faea42006-01-12 14:24:55 -08002552 status = dlm_send_begin_reco_message(dlm,
2553 dlm->reco.dead_node);
2554 /* this always succeeds */
2555 BUG_ON(status);
2556
2557 /* set the new_master to this node */
2558 spin_lock(&dlm->spinlock);
Kurt Hackelab27eb62006-04-27 18:03:49 -07002559 dlm_set_reco_master(dlm, dlm->node_num);
Kurt Hackele2faea42006-01-12 14:24:55 -08002560 spin_unlock(&dlm->spinlock);
2561 }
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002562
2563 /* recovery lock is a special case. ast will not get fired,
2564 * so just go ahead and unlock it. */
2565 ret = dlmunlock(dlm, &lksb, 0, dlm_reco_unlock_ast, dlm);
Kurt Hackele2faea42006-01-12 14:24:55 -08002566 if (ret == DLM_DENIED) {
2567 mlog(0, "got DLM_DENIED, trying LKM_CANCEL\n");
2568 ret = dlmunlock(dlm, &lksb, LKM_CANCEL, dlm_reco_unlock_ast, dlm);
2569 }
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002570 if (ret != DLM_NORMAL) {
2571 /* this would really suck. this could only happen
2572 * if there was a network error during the unlock
2573 * because of node death. this means the unlock
2574 * is actually "done" and the lock structure is
2575 * even freed. we can continue, but only
2576 * because this specific lock name is special. */
Kurt Hackele2faea42006-01-12 14:24:55 -08002577 mlog(ML_ERROR, "dlmunlock returned %d\n", ret);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002578 }
2579 } else if (ret == DLM_NOTQUEUED) {
2580 mlog(0, "dlm=%s dlmlock says another node got it (this=%u)\n",
2581 dlm->name, dlm->node_num);
2582 /* another node is master. wait on
Sunil Mushran2bd63212010-01-25 16:57:38 -08002583 * reco.new_master != O2NM_INVALID_NODE_NUM
Kurt Hackele2faea42006-01-12 14:24:55 -08002584 * for at most one second */
2585 wait_event_timeout(dlm->dlm_reco_thread_wq,
2586 dlm_reco_master_ready(dlm),
2587 msecs_to_jiffies(1000));
2588 if (!dlm_reco_master_ready(dlm)) {
2589 mlog(0, "%s: reco master taking awhile\n",
2590 dlm->name);
2591 goto again;
2592 }
2593 /* another node has informed this one that it is reco master */
2594 mlog(0, "%s: reco master %u is ready to recover %u\n",
2595 dlm->name, dlm->reco.new_master, dlm->reco.dead_node);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002596 status = -EEXIST;
Kurt Hackelc8df4122006-05-01 13:47:50 -07002597 } else if (ret == DLM_RECOVERING) {
2598 mlog(0, "dlm=%s dlmlock says master node died (this=%u)\n",
2599 dlm->name, dlm->node_num);
2600 goto again;
Kurt Hackele2faea42006-01-12 14:24:55 -08002601 } else {
2602 struct dlm_lock_resource *res;
2603
2604 /* dlmlock returned something other than NOTQUEUED or NORMAL */
2605 mlog(ML_ERROR, "%s: got %s from dlmlock($RECOVERY), "
2606 "lksb.status=%s\n", dlm->name, dlm_errname(ret),
2607 dlm_errname(lksb.status));
2608 res = dlm_lookup_lockres(dlm, DLM_RECOVERY_LOCK_NAME,
2609 DLM_RECOVERY_LOCK_NAME_LEN);
2610 if (res) {
2611 dlm_print_one_lock_resource(res);
2612 dlm_lockres_put(res);
2613 } else {
2614 mlog(ML_ERROR, "recovery lock not found\n");
2615 }
2616 BUG();
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002617 }
2618
2619 return status;
2620}
2621
2622static int dlm_send_begin_reco_message(struct dlm_ctxt *dlm, u8 dead_node)
2623{
2624 struct dlm_begin_reco br;
2625 int ret = 0;
2626 struct dlm_node_iter iter;
2627 int nodenum;
2628 int status;
2629
Kurt Hackeld6dea6e2006-04-27 18:08:51 -07002630 mlog(0, "%s: dead node is %u\n", dlm->name, dead_node);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002631
2632 spin_lock(&dlm->spinlock);
2633 dlm_node_iter_init(dlm->domain_map, &iter);
2634 spin_unlock(&dlm->spinlock);
2635
2636 clear_bit(dead_node, iter.node_map);
2637
2638 memset(&br, 0, sizeof(br));
2639 br.node_idx = dlm->node_num;
2640 br.dead_node = dead_node;
2641
2642 while ((nodenum = dlm_node_iter_next(&iter)) >= 0) {
2643 ret = 0;
2644 if (nodenum == dead_node) {
2645 mlog(0, "not sending begin reco to dead node "
2646 "%u\n", dead_node);
2647 continue;
2648 }
2649 if (nodenum == dlm->node_num) {
2650 mlog(0, "not sending begin reco to self\n");
2651 continue;
2652 }
Kurt Hackele2faea42006-01-12 14:24:55 -08002653retry:
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002654 ret = -EINVAL;
2655 mlog(0, "attempting to send begin reco msg to %d\n",
2656 nodenum);
2657 ret = o2net_send_message(DLM_BEGIN_RECO_MSG, dlm->key,
2658 &br, sizeof(br), nodenum, &status);
2659 /* negative status is handled ok by caller here */
2660 if (ret >= 0)
2661 ret = status;
Kurt Hackele2faea42006-01-12 14:24:55 -08002662 if (dlm_is_host_down(ret)) {
2663 /* node is down. not involved in recovery
2664 * so just keep going */
Wengang Wanga5196ec2010-03-30 12:09:22 +08002665 mlog(ML_NOTICE, "%s: node %u was down when sending "
Kurt Hackele2faea42006-01-12 14:24:55 -08002666 "begin reco msg (%d)\n", dlm->name, nodenum, ret);
2667 ret = 0;
2668 }
Sunil Mushrancd34edd2010-01-25 17:58:30 -08002669
2670 /*
2671 * Prior to commit aad1b15310b9bcd59fa81ab8f2b1513b59553ea8,
2672 * dlm_begin_reco_handler() returned EAGAIN and not -EAGAIN.
2673 * We are handling both for compatibility reasons.
2674 */
2675 if (ret == -EAGAIN || ret == EAGAIN) {
Tiger Yangaad1b152009-11-19 10:17:46 +08002676 mlog(0, "%s: trying to start recovery of node "
2677 "%u, but node %u is waiting for last recovery "
2678 "to complete, backoff for a bit\n", dlm->name,
2679 dead_node, nodenum);
2680 msleep(100);
2681 goto retry;
2682 }
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002683 if (ret < 0) {
2684 struct dlm_lock_resource *res;
Wengang Wanga5196ec2010-03-30 12:09:22 +08002685
Sunil Mushran2bd63212010-01-25 16:57:38 -08002686 /* this is now a serious problem, possibly ENOMEM
Kurt Hackele2faea42006-01-12 14:24:55 -08002687 * in the network stack. must retry */
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002688 mlog_errno(ret);
2689 mlog(ML_ERROR, "begin reco of dlm %s to node %u "
Wengang Wanga5196ec2010-03-30 12:09:22 +08002690 "returned %d\n", dlm->name, nodenum, ret);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002691 res = dlm_lookup_lockres(dlm, DLM_RECOVERY_LOCK_NAME,
2692 DLM_RECOVERY_LOCK_NAME_LEN);
2693 if (res) {
2694 dlm_print_one_lock_resource(res);
2695 dlm_lockres_put(res);
2696 } else {
2697 mlog(ML_ERROR, "recovery lock not found\n");
2698 }
Sunil Mushran2bd63212010-01-25 16:57:38 -08002699 /* sleep for a bit in hopes that we can avoid
Kurt Hackele2faea42006-01-12 14:24:55 -08002700 * another ENOMEM */
2701 msleep(100);
2702 goto retry;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002703 }
2704 }
2705
2706 return ret;
2707}
2708
Kurt Hackeld74c9802007-01-17 17:04:25 -08002709int dlm_begin_reco_handler(struct o2net_msg *msg, u32 len, void *data,
2710 void **ret_data)
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002711{
2712 struct dlm_ctxt *dlm = data;
2713 struct dlm_begin_reco *br = (struct dlm_begin_reco *)msg->buf;
2714
2715 /* ok to return 0, domain has gone away */
2716 if (!dlm_grab(dlm))
2717 return 0;
2718
Kurt Hackel466d1a42006-05-01 11:11:13 -07002719 spin_lock(&dlm->spinlock);
2720 if (dlm->reco.state & DLM_RECO_STATE_FINALIZE) {
2721 mlog(0, "%s: node %u wants to recover node %u (%u:%u) "
2722 "but this node is in finalize state, waiting on finalize2\n",
2723 dlm->name, br->node_idx, br->dead_node,
2724 dlm->reco.dead_node, dlm->reco.new_master);
2725 spin_unlock(&dlm->spinlock);
Xue jiufei40c7f2e2013-07-03 15:00:50 -07002726 dlm_put(dlm);
Tiger Yangaad1b152009-11-19 10:17:46 +08002727 return -EAGAIN;
Kurt Hackel466d1a42006-05-01 11:11:13 -07002728 }
2729 spin_unlock(&dlm->spinlock);
2730
Kurt Hackeld6dea6e2006-04-27 18:08:51 -07002731 mlog(0, "%s: node %u wants to recover node %u (%u:%u)\n",
2732 dlm->name, br->node_idx, br->dead_node,
2733 dlm->reco.dead_node, dlm->reco.new_master);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002734
2735 dlm_fire_domain_eviction_callbacks(dlm, br->dead_node);
2736
2737 spin_lock(&dlm->spinlock);
2738 if (dlm->reco.new_master != O2NM_INVALID_NODE_NUM) {
Kurt Hackele2faea42006-01-12 14:24:55 -08002739 if (test_bit(dlm->reco.new_master, dlm->recovery_map)) {
2740 mlog(0, "%s: new_master %u died, changing "
2741 "to %u\n", dlm->name, dlm->reco.new_master,
2742 br->node_idx);
2743 } else {
2744 mlog(0, "%s: new_master %u NOT DEAD, changing "
2745 "to %u\n", dlm->name, dlm->reco.new_master,
2746 br->node_idx);
2747 /* may not have seen the new master as dead yet */
2748 }
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002749 }
2750 if (dlm->reco.dead_node != O2NM_INVALID_NODE_NUM) {
Kurt Hackele2faea42006-01-12 14:24:55 -08002751 mlog(ML_NOTICE, "%s: dead_node previously set to %u, "
Sunil Mushran2bd63212010-01-25 16:57:38 -08002752 "node %u changing it to %u\n", dlm->name,
Kurt Hackele2faea42006-01-12 14:24:55 -08002753 dlm->reco.dead_node, br->node_idx, br->dead_node);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002754 }
Kurt Hackelab27eb62006-04-27 18:03:49 -07002755 dlm_set_reco_master(dlm, br->node_idx);
2756 dlm_set_reco_dead_node(dlm, br->dead_node);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002757 if (!test_bit(br->dead_node, dlm->recovery_map)) {
Kurt Hackele2faea42006-01-12 14:24:55 -08002758 mlog(0, "recovery master %u sees %u as dead, but this "
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002759 "node has not yet. marking %u as dead\n",
2760 br->node_idx, br->dead_node, br->dead_node);
Kurt Hackele2faea42006-01-12 14:24:55 -08002761 if (!test_bit(br->dead_node, dlm->domain_map) ||
2762 !test_bit(br->dead_node, dlm->live_nodes_map))
2763 mlog(0, "%u not in domain/live_nodes map "
2764 "so setting it in reco map manually\n",
2765 br->dead_node);
Kurt Hackelc03872f2006-03-06 14:08:49 -08002766 /* force the recovery cleanup in __dlm_hb_node_down
2767 * both of these will be cleared in a moment */
2768 set_bit(br->dead_node, dlm->domain_map);
2769 set_bit(br->dead_node, dlm->live_nodes_map);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002770 __dlm_hb_node_down(dlm, br->dead_node);
2771 }
2772 spin_unlock(&dlm->spinlock);
2773
2774 dlm_kick_recovery_thread(dlm);
Kurt Hackeld6dea6e2006-04-27 18:08:51 -07002775
2776 mlog(0, "%s: recovery started by node %u, for %u (%u:%u)\n",
2777 dlm->name, br->node_idx, br->dead_node,
2778 dlm->reco.dead_node, dlm->reco.new_master);
2779
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002780 dlm_put(dlm);
2781 return 0;
2782}
2783
Kurt Hackel466d1a42006-05-01 11:11:13 -07002784#define DLM_FINALIZE_STAGE2 0x01
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002785static int dlm_send_finalize_reco_message(struct dlm_ctxt *dlm)
2786{
2787 int ret = 0;
2788 struct dlm_finalize_reco fr;
2789 struct dlm_node_iter iter;
2790 int nodenum;
2791 int status;
Kurt Hackel466d1a42006-05-01 11:11:13 -07002792 int stage = 1;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002793
Kurt Hackel466d1a42006-05-01 11:11:13 -07002794 mlog(0, "finishing recovery for node %s:%u, "
2795 "stage %d\n", dlm->name, dlm->reco.dead_node, stage);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002796
2797 spin_lock(&dlm->spinlock);
2798 dlm_node_iter_init(dlm->domain_map, &iter);
2799 spin_unlock(&dlm->spinlock);
2800
Kurt Hackel466d1a42006-05-01 11:11:13 -07002801stage2:
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002802 memset(&fr, 0, sizeof(fr));
2803 fr.node_idx = dlm->node_num;
2804 fr.dead_node = dlm->reco.dead_node;
Kurt Hackel466d1a42006-05-01 11:11:13 -07002805 if (stage == 2)
2806 fr.flags |= DLM_FINALIZE_STAGE2;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002807
2808 while ((nodenum = dlm_node_iter_next(&iter)) >= 0) {
2809 if (nodenum == dlm->node_num)
2810 continue;
2811 ret = o2net_send_message(DLM_FINALIZE_RECO_MSG, dlm->key,
2812 &fr, sizeof(fr), nodenum, &status);
Kurt Hackel466d1a42006-05-01 11:11:13 -07002813 if (ret >= 0)
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002814 ret = status;
Kurt Hackel466d1a42006-05-01 11:11:13 -07002815 if (ret < 0) {
Wengang Wanga5196ec2010-03-30 12:09:22 +08002816 mlog(ML_ERROR, "Error %d when sending message %u (key "
2817 "0x%x) to node %u\n", ret, DLM_FINALIZE_RECO_MSG,
2818 dlm->key, nodenum);
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002819 if (dlm_is_host_down(ret)) {
Sunil Mushran2bd63212010-01-25 16:57:38 -08002820 /* this has no effect on this recovery
2821 * session, so set the status to zero to
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002822 * finish out the last recovery */
2823 mlog(ML_ERROR, "node %u went down after this "
2824 "node finished recovery.\n", nodenum);
2825 ret = 0;
Kurt Hackelc27069e2006-05-01 13:51:49 -07002826 continue;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002827 }
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002828 break;
2829 }
2830 }
Kurt Hackel466d1a42006-05-01 11:11:13 -07002831 if (stage == 1) {
2832 /* reset the node_iter back to the top and send finalize2 */
2833 iter.curnode = -1;
2834 stage = 2;
2835 goto stage2;
2836 }
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002837
2838 return ret;
2839}
2840
Kurt Hackeld74c9802007-01-17 17:04:25 -08002841int dlm_finalize_reco_handler(struct o2net_msg *msg, u32 len, void *data,
2842 void **ret_data)
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002843{
2844 struct dlm_ctxt *dlm = data;
2845 struct dlm_finalize_reco *fr = (struct dlm_finalize_reco *)msg->buf;
Kurt Hackel466d1a42006-05-01 11:11:13 -07002846 int stage = 1;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002847
2848 /* ok to return 0, domain has gone away */
2849 if (!dlm_grab(dlm))
2850 return 0;
2851
Kurt Hackel466d1a42006-05-01 11:11:13 -07002852 if (fr->flags & DLM_FINALIZE_STAGE2)
2853 stage = 2;
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002854
Kurt Hackel466d1a42006-05-01 11:11:13 -07002855 mlog(0, "%s: node %u finalizing recovery stage%d of "
2856 "node %u (%u:%u)\n", dlm->name, fr->node_idx, stage,
2857 fr->dead_node, dlm->reco.dead_node, dlm->reco.new_master);
Sunil Mushran2bd63212010-01-25 16:57:38 -08002858
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002859 spin_lock(&dlm->spinlock);
2860
2861 if (dlm->reco.new_master != fr->node_idx) {
2862 mlog(ML_ERROR, "node %u sent recovery finalize msg, but node "
2863 "%u is supposed to be the new master, dead=%u\n",
2864 fr->node_idx, dlm->reco.new_master, fr->dead_node);
2865 BUG();
2866 }
2867 if (dlm->reco.dead_node != fr->dead_node) {
2868 mlog(ML_ERROR, "node %u sent recovery finalize msg for dead "
2869 "node %u, but node %u is supposed to be dead\n",
2870 fr->node_idx, fr->dead_node, dlm->reco.dead_node);
2871 BUG();
2872 }
2873
Kurt Hackel466d1a42006-05-01 11:11:13 -07002874 switch (stage) {
2875 case 1:
2876 dlm_finish_local_lockres_recovery(dlm, fr->dead_node, fr->node_idx);
2877 if (dlm->reco.state & DLM_RECO_STATE_FINALIZE) {
2878 mlog(ML_ERROR, "%s: received finalize1 from "
2879 "new master %u for dead node %u, but "
2880 "this node has already received it!\n",
2881 dlm->name, fr->node_idx, fr->dead_node);
2882 dlm_print_reco_node_status(dlm);
2883 BUG();
2884 }
2885 dlm->reco.state |= DLM_RECO_STATE_FINALIZE;
2886 spin_unlock(&dlm->spinlock);
2887 break;
2888 case 2:
2889 if (!(dlm->reco.state & DLM_RECO_STATE_FINALIZE)) {
2890 mlog(ML_ERROR, "%s: received finalize2 from "
2891 "new master %u for dead node %u, but "
2892 "this node did not have finalize1!\n",
2893 dlm->name, fr->node_idx, fr->dead_node);
2894 dlm_print_reco_node_status(dlm);
2895 BUG();
2896 }
2897 dlm->reco.state &= ~DLM_RECO_STATE_FINALIZE;
Junxiao Bided2cf72014-04-03 14:46:51 -07002898 __dlm_reset_recovery(dlm);
Kurt Hackel466d1a42006-05-01 11:11:13 -07002899 spin_unlock(&dlm->spinlock);
Kurt Hackel466d1a42006-05-01 11:11:13 -07002900 dlm_kick_recovery_thread(dlm);
2901 break;
2902 default:
2903 BUG();
2904 }
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002905
Kurt Hackeld6dea6e2006-04-27 18:08:51 -07002906 mlog(0, "%s: recovery done, reco master was %u, dead now %u, master now %u\n",
2907 dlm->name, fr->node_idx, dlm->reco.dead_node, dlm->reco.new_master);
2908
Kurt Hackel6714d8e2005-12-15 14:31:23 -08002909 dlm_put(dlm);
2910 return 0;
2911}