1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28#include <linux/module.h>
29#include <linux/fs.h>
30#include <linux/types.h>
31#include <linux/slab.h>
32#include <linux/highmem.h>
33#include <linux/init.h>
34#include <linux/sysctl.h>
35#include <linux/random.h>
36#include <linux/blkdev.h>
37#include <linux/socket.h>
38#include <linux/inet.h>
39#include <linux/spinlock.h>
40#include <linux/delay.h>
41
42
43#include "cluster/heartbeat.h"
44#include "cluster/nodemanager.h"
45#include "cluster/tcp.h"
46
47#include "dlmapi.h"
48#include "dlmcommon.h"
49#include "dlmdomain.h"
50#include "dlmdebug.h"
51
52#define MLOG_MASK_PREFIX (ML_DLM|ML_DLM_MASTER)
53#include "cluster/masklog.h"
54
55static void dlm_mle_node_down(struct dlm_ctxt *dlm,
56 struct dlm_master_list_entry *mle,
57 struct o2nm_node *node,
58 int idx);
59static void dlm_mle_node_up(struct dlm_ctxt *dlm,
60 struct dlm_master_list_entry *mle,
61 struct o2nm_node *node,
62 int idx);
63
64static void dlm_assert_master_worker(struct dlm_work_item *item, void *data);
65static int dlm_do_assert_master(struct dlm_ctxt *dlm,
66 struct dlm_lock_resource *res,
67 void *nodemap, u32 flags);
68static void dlm_deref_lockres_worker(struct dlm_work_item *item, void *data);
69
70static inline int dlm_mle_equal(struct dlm_ctxt *dlm,
71 struct dlm_master_list_entry *mle,
72 const char *name,
73 unsigned int namelen)
74{
75 if (dlm != mle->dlm)
76 return 0;
77
78 if (namelen != mle->mnamelen ||
79 memcmp(name, mle->mname, namelen) != 0)
80 return 0;
81
82 return 1;
83}
84
85static struct kmem_cache *dlm_lockres_cache;
86static struct kmem_cache *dlm_lockname_cache;
87static struct kmem_cache *dlm_mle_cache;
88
89static void dlm_mle_release(struct kref *kref);
90static void dlm_init_mle(struct dlm_master_list_entry *mle,
91 enum dlm_mle_type type,
92 struct dlm_ctxt *dlm,
93 struct dlm_lock_resource *res,
94 const char *name,
95 unsigned int namelen);
96static void dlm_put_mle(struct dlm_master_list_entry *mle);
97static void __dlm_put_mle(struct dlm_master_list_entry *mle);
98static int dlm_find_mle(struct dlm_ctxt *dlm,
99 struct dlm_master_list_entry **mle,
100 char *name, unsigned int namelen);
101
102static int dlm_do_master_request(struct dlm_lock_resource *res,
103 struct dlm_master_list_entry *mle, int to);
104
105
106static int dlm_wait_for_lock_mastery(struct dlm_ctxt *dlm,
107 struct dlm_lock_resource *res,
108 struct dlm_master_list_entry *mle,
109 int *blocked);
110static int dlm_restart_lock_mastery(struct dlm_ctxt *dlm,
111 struct dlm_lock_resource *res,
112 struct dlm_master_list_entry *mle,
113 int blocked);
114static int dlm_add_migration_mle(struct dlm_ctxt *dlm,
115 struct dlm_lock_resource *res,
116 struct dlm_master_list_entry *mle,
117 struct dlm_master_list_entry **oldmle,
118 const char *name, unsigned int namelen,
119 u8 new_master, u8 master);
120
121static u8 dlm_pick_migration_target(struct dlm_ctxt *dlm,
122 struct dlm_lock_resource *res);
123static void dlm_remove_nonlocal_locks(struct dlm_ctxt *dlm,
124 struct dlm_lock_resource *res);
125static int dlm_mark_lockres_migrating(struct dlm_ctxt *dlm,
126 struct dlm_lock_resource *res,
127 u8 target);
128static int dlm_pre_master_reco_lockres(struct dlm_ctxt *dlm,
129 struct dlm_lock_resource *res);
130
131
132int dlm_is_host_down(int errno)
133{
134 switch (errno) {
135 case -EBADF:
136 case -ECONNREFUSED:
137 case -ENOTCONN:
138 case -ECONNRESET:
139 case -EPIPE:
140 case -EHOSTDOWN:
141 case -EHOSTUNREACH:
142 case -ETIMEDOUT:
143 case -ECONNABORTED:
144 case -ENETDOWN:
145 case -ENETUNREACH:
146 case -ENETRESET:
147 case -ESHUTDOWN:
148 case -ENOPROTOOPT:
149 case -EINVAL:
150
151 return 1;
152 }
153 return 0;
154}
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178static inline void __dlm_mle_attach_hb_events(struct dlm_ctxt *dlm,
179 struct dlm_master_list_entry *mle)
180{
181 assert_spin_locked(&dlm->spinlock);
182
183 list_add_tail(&mle->hb_events, &dlm->mle_hb_events);
184}
185
186
187static inline void __dlm_mle_detach_hb_events(struct dlm_ctxt *dlm,
188 struct dlm_master_list_entry *mle)
189{
190 if (!list_empty(&mle->hb_events))
191 list_del_init(&mle->hb_events);
192}
193
194
195static inline void dlm_mle_detach_hb_events(struct dlm_ctxt *dlm,
196 struct dlm_master_list_entry *mle)
197{
198 spin_lock(&dlm->spinlock);
199 __dlm_mle_detach_hb_events(dlm, mle);
200 spin_unlock(&dlm->spinlock);
201}
202
203static void dlm_get_mle_inuse(struct dlm_master_list_entry *mle)
204{
205 struct dlm_ctxt *dlm;
206 dlm = mle->dlm;
207
208 assert_spin_locked(&dlm->spinlock);
209 assert_spin_locked(&dlm->master_lock);
210 mle->inuse++;
211 kref_get(&mle->mle_refs);
212}
213
214static void dlm_put_mle_inuse(struct dlm_master_list_entry *mle)
215{
216 struct dlm_ctxt *dlm;
217 dlm = mle->dlm;
218
219 spin_lock(&dlm->spinlock);
220 spin_lock(&dlm->master_lock);
221 mle->inuse--;
222 __dlm_put_mle(mle);
223 spin_unlock(&dlm->master_lock);
224 spin_unlock(&dlm->spinlock);
225
226}
227
228
229static void __dlm_put_mle(struct dlm_master_list_entry *mle)
230{
231 struct dlm_ctxt *dlm;
232 dlm = mle->dlm;
233
234 assert_spin_locked(&dlm->spinlock);
235 assert_spin_locked(&dlm->master_lock);
236 if (!atomic_read(&mle->mle_refs.refcount)) {
237
238
239 mlog(ML_ERROR, "bad mle: %p\n", mle);
240 dlm_print_one_mle(mle);
241 BUG();
242 } else
243 kref_put(&mle->mle_refs, dlm_mle_release);
244}
245
246
247
248static void dlm_put_mle(struct dlm_master_list_entry *mle)
249{
250 struct dlm_ctxt *dlm;
251 dlm = mle->dlm;
252
253 spin_lock(&dlm->spinlock);
254 spin_lock(&dlm->master_lock);
255 __dlm_put_mle(mle);
256 spin_unlock(&dlm->master_lock);
257 spin_unlock(&dlm->spinlock);
258}
259
260static inline void dlm_get_mle(struct dlm_master_list_entry *mle)
261{
262 kref_get(&mle->mle_refs);
263}
264
265static void dlm_init_mle(struct dlm_master_list_entry *mle,
266 enum dlm_mle_type type,
267 struct dlm_ctxt *dlm,
268 struct dlm_lock_resource *res,
269 const char *name,
270 unsigned int namelen)
271{
272 assert_spin_locked(&dlm->spinlock);
273
274 mle->dlm = dlm;
275 mle->type = type;
276 INIT_HLIST_NODE(&mle->master_hash_node);
277 INIT_LIST_HEAD(&mle->hb_events);
278 memset(mle->maybe_map, 0, sizeof(mle->maybe_map));
279 spin_lock_init(&mle->spinlock);
280 init_waitqueue_head(&mle->wq);
281 atomic_set(&mle->woken, 0);
282 kref_init(&mle->mle_refs);
283 memset(mle->response_map, 0, sizeof(mle->response_map));
284 mle->master = O2NM_MAX_NODES;
285 mle->new_master = O2NM_MAX_NODES;
286 mle->inuse = 0;
287
288 BUG_ON(mle->type != DLM_MLE_BLOCK &&
289 mle->type != DLM_MLE_MASTER &&
290 mle->type != DLM_MLE_MIGRATION);
291
292 if (mle->type == DLM_MLE_MASTER) {
293 BUG_ON(!res);
294 mle->mleres = res;
295 memcpy(mle->mname, res->lockname.name, res->lockname.len);
296 mle->mnamelen = res->lockname.len;
297 mle->mnamehash = res->lockname.hash;
298 } else {
299 BUG_ON(!name);
300 mle->mleres = NULL;
301 memcpy(mle->mname, name, namelen);
302 mle->mnamelen = namelen;
303 mle->mnamehash = dlm_lockid_hash(name, namelen);
304 }
305
306 atomic_inc(&dlm->mle_tot_count[mle->type]);
307 atomic_inc(&dlm->mle_cur_count[mle->type]);
308
309
310 memcpy(mle->node_map, dlm->domain_map, sizeof(mle->node_map));
311 memcpy(mle->vote_map, dlm->domain_map, sizeof(mle->vote_map));
312 clear_bit(dlm->node_num, mle->vote_map);
313 clear_bit(dlm->node_num, mle->node_map);
314
315
316 __dlm_mle_attach_hb_events(dlm, mle);
317}
318
319void __dlm_unlink_mle(struct dlm_ctxt *dlm, struct dlm_master_list_entry *mle)
320{
321 assert_spin_locked(&dlm->spinlock);
322 assert_spin_locked(&dlm->master_lock);
323
324 if (!hlist_unhashed(&mle->master_hash_node))
325 hlist_del_init(&mle->master_hash_node);
326}
327
328void __dlm_insert_mle(struct dlm_ctxt *dlm, struct dlm_master_list_entry *mle)
329{
330 struct hlist_head *bucket;
331
332 assert_spin_locked(&dlm->master_lock);
333
334 bucket = dlm_master_hash(dlm, mle->mnamehash);
335 hlist_add_head(&mle->master_hash_node, bucket);
336}
337
338
339static int dlm_find_mle(struct dlm_ctxt *dlm,
340 struct dlm_master_list_entry **mle,
341 char *name, unsigned int namelen)
342{
343 struct dlm_master_list_entry *tmpmle;
344 struct hlist_head *bucket;
345 unsigned int hash;
346
347 assert_spin_locked(&dlm->master_lock);
348
349 hash = dlm_lockid_hash(name, namelen);
350 bucket = dlm_master_hash(dlm, hash);
351 hlist_for_each_entry(tmpmle, bucket, master_hash_node) {
352 if (!dlm_mle_equal(dlm, tmpmle, name, namelen))
353 continue;
354 dlm_get_mle(tmpmle);
355 *mle = tmpmle;
356 return 1;
357 }
358 return 0;
359}
360
361void dlm_hb_event_notify_attached(struct dlm_ctxt *dlm, int idx, int node_up)
362{
363 struct dlm_master_list_entry *mle;
364
365 assert_spin_locked(&dlm->spinlock);
366
367 list_for_each_entry(mle, &dlm->mle_hb_events, hb_events) {
368 if (node_up)
369 dlm_mle_node_up(dlm, mle, NULL, idx);
370 else
371 dlm_mle_node_down(dlm, mle, NULL, idx);
372 }
373}
374
375static void dlm_mle_node_down(struct dlm_ctxt *dlm,
376 struct dlm_master_list_entry *mle,
377 struct o2nm_node *node, int idx)
378{
379 spin_lock(&mle->spinlock);
380
381 if (!test_bit(idx, mle->node_map))
382 mlog(0, "node %u already removed from nodemap!\n", idx);
383 else
384 clear_bit(idx, mle->node_map);
385
386 spin_unlock(&mle->spinlock);
387}
388
389static void dlm_mle_node_up(struct dlm_ctxt *dlm,
390 struct dlm_master_list_entry *mle,
391 struct o2nm_node *node, int idx)
392{
393 spin_lock(&mle->spinlock);
394
395 if (test_bit(idx, mle->node_map))
396 mlog(0, "node %u already in node map!\n", idx);
397 else
398 set_bit(idx, mle->node_map);
399
400 spin_unlock(&mle->spinlock);
401}
402
403
404int dlm_init_mle_cache(void)
405{
406 dlm_mle_cache = kmem_cache_create("o2dlm_mle",
407 sizeof(struct dlm_master_list_entry),
408 0, SLAB_HWCACHE_ALIGN,
409 NULL);
410 if (dlm_mle_cache == NULL)
411 return -ENOMEM;
412 return 0;
413}
414
415void dlm_destroy_mle_cache(void)
416{
417 if (dlm_mle_cache)
418 kmem_cache_destroy(dlm_mle_cache);
419}
420
421static void dlm_mle_release(struct kref *kref)
422{
423 struct dlm_master_list_entry *mle;
424 struct dlm_ctxt *dlm;
425
426 mle = container_of(kref, struct dlm_master_list_entry, mle_refs);
427 dlm = mle->dlm;
428
429 assert_spin_locked(&dlm->spinlock);
430 assert_spin_locked(&dlm->master_lock);
431
432 mlog(0, "Releasing mle for %.*s, type %d\n", mle->mnamelen, mle->mname,
433 mle->type);
434
435
436 __dlm_unlink_mle(dlm, mle);
437
438
439 __dlm_mle_detach_hb_events(dlm, mle);
440
441 atomic_dec(&dlm->mle_cur_count[mle->type]);
442
443
444
445 kmem_cache_free(dlm_mle_cache, mle);
446}
447
448
449
450
451
452
453int dlm_init_master_caches(void)
454{
455 dlm_lockres_cache = kmem_cache_create("o2dlm_lockres",
456 sizeof(struct dlm_lock_resource),
457 0, SLAB_HWCACHE_ALIGN, NULL);
458 if (!dlm_lockres_cache)
459 goto bail;
460
461 dlm_lockname_cache = kmem_cache_create("o2dlm_lockname",
462 DLM_LOCKID_NAME_MAX, 0,
463 SLAB_HWCACHE_ALIGN, NULL);
464 if (!dlm_lockname_cache)
465 goto bail;
466
467 return 0;
468bail:
469 dlm_destroy_master_caches();
470 return -ENOMEM;
471}
472
473void dlm_destroy_master_caches(void)
474{
475 if (dlm_lockname_cache) {
476 kmem_cache_destroy(dlm_lockname_cache);
477 dlm_lockname_cache = NULL;
478 }
479
480 if (dlm_lockres_cache) {
481 kmem_cache_destroy(dlm_lockres_cache);
482 dlm_lockres_cache = NULL;
483 }
484}
485
486static void dlm_lockres_release(struct kref *kref)
487{
488 struct dlm_lock_resource *res;
489 struct dlm_ctxt *dlm;
490
491 res = container_of(kref, struct dlm_lock_resource, refs);
492 dlm = res->dlm;
493
494
495
496 BUG_ON(!res->lockname.name);
497
498 mlog(0, "destroying lockres %.*s\n", res->lockname.len,
499 res->lockname.name);
500
501 atomic_dec(&dlm->res_cur_count);
502
503 if (!hlist_unhashed(&res->hash_node) ||
504 !list_empty(&res->granted) ||
505 !list_empty(&res->converting) ||
506 !list_empty(&res->blocked) ||
507 !list_empty(&res->dirty) ||
508 !list_empty(&res->recovering) ||
509 !list_empty(&res->purge)) {
510 mlog(ML_ERROR,
511 "Going to BUG for resource %.*s."
512 " We're on a list! [%c%c%c%c%c%c%c]\n",
513 res->lockname.len, res->lockname.name,
514 !hlist_unhashed(&res->hash_node) ? 'H' : ' ',
515 !list_empty(&res->granted) ? 'G' : ' ',
516 !list_empty(&res->converting) ? 'C' : ' ',
517 !list_empty(&res->blocked) ? 'B' : ' ',
518 !list_empty(&res->dirty) ? 'D' : ' ',
519 !list_empty(&res->recovering) ? 'R' : ' ',
520 !list_empty(&res->purge) ? 'P' : ' ');
521
522 dlm_print_one_lock_resource(res);
523 }
524
525
526
527 BUG_ON(!hlist_unhashed(&res->hash_node));
528 BUG_ON(!list_empty(&res->granted));
529 BUG_ON(!list_empty(&res->converting));
530 BUG_ON(!list_empty(&res->blocked));
531 BUG_ON(!list_empty(&res->dirty));
532 BUG_ON(!list_empty(&res->recovering));
533 BUG_ON(!list_empty(&res->purge));
534
535 kmem_cache_free(dlm_lockname_cache, (void *)res->lockname.name);
536
537 kmem_cache_free(dlm_lockres_cache, res);
538}
539
540void dlm_lockres_put(struct dlm_lock_resource *res)
541{
542 kref_put(&res->refs, dlm_lockres_release);
543}
544
545static void dlm_init_lockres(struct dlm_ctxt *dlm,
546 struct dlm_lock_resource *res,
547 const char *name, unsigned int namelen)
548{
549 char *qname;
550
551
552
553
554
555 qname = (char *) res->lockname.name;
556 memcpy(qname, name, namelen);
557
558 res->lockname.len = namelen;
559 res->lockname.hash = dlm_lockid_hash(name, namelen);
560
561 init_waitqueue_head(&res->wq);
562 spin_lock_init(&res->spinlock);
563 INIT_HLIST_NODE(&res->hash_node);
564 INIT_LIST_HEAD(&res->granted);
565 INIT_LIST_HEAD(&res->converting);
566 INIT_LIST_HEAD(&res->blocked);
567 INIT_LIST_HEAD(&res->dirty);
568 INIT_LIST_HEAD(&res->recovering);
569 INIT_LIST_HEAD(&res->purge);
570 INIT_LIST_HEAD(&res->tracking);
571 atomic_set(&res->asts_reserved, 0);
572 res->migration_pending = 0;
573 res->inflight_locks = 0;
574 res->inflight_assert_workers = 0;
575
576 res->dlm = dlm;
577
578 kref_init(&res->refs);
579
580 atomic_inc(&dlm->res_tot_count);
581 atomic_inc(&dlm->res_cur_count);
582
583
584 spin_lock(&res->spinlock);
585 dlm_set_lockres_owner(dlm, res, DLM_LOCK_RES_OWNER_UNKNOWN);
586 spin_unlock(&res->spinlock);
587
588 res->state = DLM_LOCK_RES_IN_PROGRESS;
589
590 res->last_used = 0;
591
592 spin_lock(&dlm->spinlock);
593 list_add_tail(&res->tracking, &dlm->tracking_list);
594 spin_unlock(&dlm->spinlock);
595
596 memset(res->lvb, 0, DLM_LVB_LEN);
597 memset(res->refmap, 0, sizeof(res->refmap));
598}
599
600struct dlm_lock_resource *dlm_new_lockres(struct dlm_ctxt *dlm,
601 const char *name,
602 unsigned int namelen)
603{
604 struct dlm_lock_resource *res = NULL;
605
606 res = kmem_cache_zalloc(dlm_lockres_cache, GFP_NOFS);
607 if (!res)
608 goto error;
609
610 res->lockname.name = kmem_cache_zalloc(dlm_lockname_cache, GFP_NOFS);
611 if (!res->lockname.name)
612 goto error;
613
614 dlm_init_lockres(dlm, res, name, namelen);
615 return res;
616
617error:
618 if (res)
619 kmem_cache_free(dlm_lockres_cache, res);
620 return NULL;
621}
622
623void dlm_lockres_set_refmap_bit(struct dlm_ctxt *dlm,
624 struct dlm_lock_resource *res, int bit)
625{
626 assert_spin_locked(&res->spinlock);
627
628 mlog(0, "res %.*s, set node %u, %ps()\n", res->lockname.len,
629 res->lockname.name, bit, __builtin_return_address(0));
630
631 set_bit(bit, res->refmap);
632}
633
634void dlm_lockres_clear_refmap_bit(struct dlm_ctxt *dlm,
635 struct dlm_lock_resource *res, int bit)
636{
637 assert_spin_locked(&res->spinlock);
638
639 mlog(0, "res %.*s, clr node %u, %ps()\n", res->lockname.len,
640 res->lockname.name, bit, __builtin_return_address(0));
641
642 clear_bit(bit, res->refmap);
643}
644
645static void __dlm_lockres_grab_inflight_ref(struct dlm_ctxt *dlm,
646 struct dlm_lock_resource *res)
647{
648 res->inflight_locks++;
649
650 mlog(0, "%s: res %.*s, inflight++: now %u, %ps()\n", dlm->name,
651 res->lockname.len, res->lockname.name, res->inflight_locks,
652 __builtin_return_address(0));
653}
654
655void dlm_lockres_grab_inflight_ref(struct dlm_ctxt *dlm,
656 struct dlm_lock_resource *res)
657{
658 assert_spin_locked(&res->spinlock);
659 __dlm_lockres_grab_inflight_ref(dlm, res);
660}
661
662void dlm_lockres_drop_inflight_ref(struct dlm_ctxt *dlm,
663 struct dlm_lock_resource *res)
664{
665 assert_spin_locked(&res->spinlock);
666
667 BUG_ON(res->inflight_locks == 0);
668
669 res->inflight_locks--;
670
671 mlog(0, "%s: res %.*s, inflight--: now %u, %ps()\n", dlm->name,
672 res->lockname.len, res->lockname.name, res->inflight_locks,
673 __builtin_return_address(0));
674
675 wake_up(&res->wq);
676}
677
678void __dlm_lockres_grab_inflight_worker(struct dlm_ctxt *dlm,
679 struct dlm_lock_resource *res)
680{
681 assert_spin_locked(&res->spinlock);
682 res->inflight_assert_workers++;
683 mlog(0, "%s:%.*s: inflight assert worker++: now %u\n",
684 dlm->name, res->lockname.len, res->lockname.name,
685 res->inflight_assert_workers);
686}
687
688static void __dlm_lockres_drop_inflight_worker(struct dlm_ctxt *dlm,
689 struct dlm_lock_resource *res)
690{
691 assert_spin_locked(&res->spinlock);
692 BUG_ON(res->inflight_assert_workers == 0);
693 res->inflight_assert_workers--;
694 mlog(0, "%s:%.*s: inflight assert worker--: now %u\n",
695 dlm->name, res->lockname.len, res->lockname.name,
696 res->inflight_assert_workers);
697}
698
699static void dlm_lockres_drop_inflight_worker(struct dlm_ctxt *dlm,
700 struct dlm_lock_resource *res)
701{
702 spin_lock(&res->spinlock);
703 __dlm_lockres_drop_inflight_worker(dlm, res);
704 spin_unlock(&res->spinlock);
705}
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723struct dlm_lock_resource * dlm_get_lock_resource(struct dlm_ctxt *dlm,
724 const char *lockid,
725 int namelen,
726 int flags)
727{
728 struct dlm_lock_resource *tmpres=NULL, *res=NULL;
729 struct dlm_master_list_entry *mle = NULL;
730 struct dlm_master_list_entry *alloc_mle = NULL;
731 int blocked = 0;
732 int ret, nodenum;
733 struct dlm_node_iter iter;
734 unsigned int hash;
735 int tries = 0;
736 int bit, wait_on_recovery = 0;
737
738 BUG_ON(!lockid);
739
740 hash = dlm_lockid_hash(lockid, namelen);
741
742 mlog(0, "get lockres %s (len %d)\n", lockid, namelen);
743
744lookup:
745 spin_lock(&dlm->spinlock);
746 tmpres = __dlm_lookup_lockres_full(dlm, lockid, namelen, hash);
747 if (tmpres) {
748 spin_unlock(&dlm->spinlock);
749 spin_lock(&tmpres->spinlock);
750
751
752
753
754
755
756 if (hlist_unhashed(&tmpres->hash_node)) {
757 spin_unlock(&tmpres->spinlock);
758 dlm_lockres_put(tmpres);
759 tmpres = NULL;
760 goto lookup;
761 }
762
763
764 if (tmpres->owner == DLM_LOCK_RES_OWNER_UNKNOWN) {
765 __dlm_wait_on_lockres(tmpres);
766 BUG_ON(tmpres->owner == DLM_LOCK_RES_OWNER_UNKNOWN);
767 spin_unlock(&tmpres->spinlock);
768 dlm_lockres_put(tmpres);
769 tmpres = NULL;
770 goto lookup;
771 }
772
773
774 if (tmpres->state & DLM_LOCK_RES_DROPPING_REF) {
775 BUG_ON(tmpres->owner == dlm->node_num);
776 __dlm_wait_on_lockres_flags(tmpres,
777 DLM_LOCK_RES_DROPPING_REF);
778 spin_unlock(&tmpres->spinlock);
779 dlm_lockres_put(tmpres);
780 tmpres = NULL;
781 goto lookup;
782 }
783
784
785 dlm_lockres_grab_inflight_ref(dlm, tmpres);
786
787 spin_unlock(&tmpres->spinlock);
788 if (res) {
789 spin_lock(&dlm->track_lock);
790 if (!list_empty(&res->tracking))
791 list_del_init(&res->tracking);
792 else
793 mlog(ML_ERROR, "Resource %.*s not "
794 "on the Tracking list\n",
795 res->lockname.len,
796 res->lockname.name);
797 spin_unlock(&dlm->track_lock);
798 dlm_lockres_put(res);
799 }
800 res = tmpres;
801 goto leave;
802 }
803
804 if (!res) {
805 spin_unlock(&dlm->spinlock);
806 mlog(0, "allocating a new resource\n");
807
808 alloc_mle = kmem_cache_alloc(dlm_mle_cache, GFP_NOFS);
809 if (!alloc_mle)
810 goto leave;
811 res = dlm_new_lockres(dlm, lockid, namelen);
812 if (!res)
813 goto leave;
814 goto lookup;
815 }
816
817 mlog(0, "no lockres found, allocated our own: %p\n", res);
818
819 if (flags & LKM_LOCAL) {
820
821
822 spin_lock(&res->spinlock);
823 dlm_change_lockres_owner(dlm, res, dlm->node_num);
824 __dlm_insert_lockres(dlm, res);
825 dlm_lockres_grab_inflight_ref(dlm, res);
826 spin_unlock(&res->spinlock);
827 spin_unlock(&dlm->spinlock);
828
829 goto wake_waiters;
830 }
831
832
833 spin_lock(&dlm->master_lock);
834
835
836 blocked = dlm_find_mle(dlm, &mle, (char *)lockid, namelen);
837 if (blocked) {
838 int mig;
839 if (mle->type == DLM_MLE_MASTER) {
840 mlog(ML_ERROR, "master entry for nonexistent lock!\n");
841 BUG();
842 }
843 mig = (mle->type == DLM_MLE_MIGRATION);
844
845
846
847
848
849
850
851
852 if (mig || mle->master != O2NM_MAX_NODES) {
853 BUG_ON(mig && mle->master == dlm->node_num);
854
855
856 mlog(0, "%s:%.*s: late on %s\n",
857 dlm->name, namelen, lockid,
858 mig ? "MIGRATION" : "BLOCK");
859 spin_unlock(&dlm->master_lock);
860 spin_unlock(&dlm->spinlock);
861
862
863 if (!mig)
864 dlm_mle_detach_hb_events(dlm, mle);
865 dlm_put_mle(mle);
866 mle = NULL;
867
868
869 if (mig)
870 msleep(100);
871 goto lookup;
872 }
873 } else {
874
875 mle = alloc_mle;
876
877 alloc_mle = NULL;
878 dlm_init_mle(mle, DLM_MLE_MASTER, dlm, res, NULL, 0);
879 set_bit(dlm->node_num, mle->maybe_map);
880 __dlm_insert_mle(dlm, mle);
881
882
883
884
885
886 bit = find_next_bit(dlm->recovery_map, O2NM_MAX_NODES, 0);
887 if (bit < O2NM_MAX_NODES) {
888 mlog(0, "%s: res %.*s, At least one node (%d) "
889 "to recover before lock mastery can begin\n",
890 dlm->name, namelen, (char *)lockid, bit);
891 wait_on_recovery = 1;
892 }
893 }
894
895
896
897
898
899
900
901 __dlm_insert_lockres(dlm, res);
902
903
904 __dlm_lockres_grab_inflight_ref(dlm, res);
905
906
907
908
909
910 dlm_get_mle_inuse(mle);
911 spin_unlock(&dlm->master_lock);
912 spin_unlock(&dlm->spinlock);
913
914redo_request:
915 while (wait_on_recovery) {
916
917
918
919 if (dlm_is_recovery_lock(lockid, namelen)) {
920 mlog(0, "%s: Recovery map is not empty, but must "
921 "master $RECOVERY lock now\n", dlm->name);
922 if (!dlm_pre_master_reco_lockres(dlm, res))
923 wait_on_recovery = 0;
924 else {
925 mlog(0, "%s: waiting 500ms for heartbeat state "
926 "change\n", dlm->name);
927 msleep(500);
928 }
929 continue;
930 }
931
932 dlm_kick_recovery_thread(dlm);
933 msleep(1000);
934 dlm_wait_for_recovery(dlm);
935
936 spin_lock(&dlm->spinlock);
937 bit = find_next_bit(dlm->recovery_map, O2NM_MAX_NODES, 0);
938 if (bit < O2NM_MAX_NODES) {
939 mlog(0, "%s: res %.*s, At least one node (%d) "
940 "to recover before lock mastery can begin\n",
941 dlm->name, namelen, (char *)lockid, bit);
942 wait_on_recovery = 1;
943 } else
944 wait_on_recovery = 0;
945 spin_unlock(&dlm->spinlock);
946
947 if (wait_on_recovery)
948 dlm_wait_for_node_recovery(dlm, bit, 10000);
949 }
950
951
952 if (blocked)
953 goto wait;
954
955 ret = -EINVAL;
956 dlm_node_iter_init(mle->vote_map, &iter);
957 while ((nodenum = dlm_node_iter_next(&iter)) >= 0) {
958 ret = dlm_do_master_request(res, mle, nodenum);
959 if (ret < 0)
960 mlog_errno(ret);
961 if (mle->master != O2NM_MAX_NODES) {
962
963 if (mle->master <= nodenum)
964 break;
965
966
967
968
969 mlog(0, "%s: res %.*s, Requests only up to %u but "
970 "master is %u, keep going\n", dlm->name, namelen,
971 lockid, nodenum, mle->master);
972 }
973 }
974
975wait:
976
977 ret = dlm_wait_for_lock_mastery(dlm, res, mle, &blocked);
978 if (ret < 0) {
979 wait_on_recovery = 1;
980 mlog(0, "%s: res %.*s, Node map changed, redo the master "
981 "request now, blocked=%d\n", dlm->name, res->lockname.len,
982 res->lockname.name, blocked);
983 if (++tries > 20) {
984 mlog(ML_ERROR, "%s: res %.*s, Spinning on "
985 "dlm_wait_for_lock_mastery, blocked = %d\n",
986 dlm->name, res->lockname.len,
987 res->lockname.name, blocked);
988 dlm_print_one_lock_resource(res);
989 dlm_print_one_mle(mle);
990 tries = 0;
991 }
992 goto redo_request;
993 }
994
995 mlog(0, "%s: res %.*s, Mastered by %u\n", dlm->name, res->lockname.len,
996 res->lockname.name, res->owner);
997
998 BUG_ON(res->owner == O2NM_MAX_NODES);
999
1000
1001 dlm_mle_detach_hb_events(dlm, mle);
1002 dlm_put_mle(mle);
1003
1004 dlm_put_mle_inuse(mle);
1005
1006wake_waiters:
1007 spin_lock(&res->spinlock);
1008 res->state &= ~DLM_LOCK_RES_IN_PROGRESS;
1009 spin_unlock(&res->spinlock);
1010 wake_up(&res->wq);
1011
1012leave:
1013
1014 if (alloc_mle)
1015 kmem_cache_free(dlm_mle_cache, alloc_mle);
1016
1017 return res;
1018}
1019
1020
1021#define DLM_MASTERY_TIMEOUT_MS 5000
1022
1023static int dlm_wait_for_lock_mastery(struct dlm_ctxt *dlm,
1024 struct dlm_lock_resource *res,
1025 struct dlm_master_list_entry *mle,
1026 int *blocked)
1027{
1028 u8 m;
1029 int ret, bit;
1030 int map_changed, voting_done;
1031 int assert, sleep;
1032
1033recheck:
1034 ret = 0;
1035 assert = 0;
1036
1037
1038 spin_lock(&res->spinlock);
1039 if (res->owner != DLM_LOCK_RES_OWNER_UNKNOWN) {
1040 mlog(0, "%s:%.*s: owner is suddenly %u\n", dlm->name,
1041 res->lockname.len, res->lockname.name, res->owner);
1042 spin_unlock(&res->spinlock);
1043
1044
1045 if (res->owner != dlm->node_num) {
1046 ret = dlm_do_master_request(res, mle, res->owner);
1047 if (ret < 0) {
1048
1049 mlog(ML_ERROR, "link to %u went down?: %d\n", res->owner, ret);
1050 msleep(500);
1051 goto recheck;
1052 }
1053 }
1054 ret = 0;
1055 goto leave;
1056 }
1057 spin_unlock(&res->spinlock);
1058
1059 spin_lock(&mle->spinlock);
1060 m = mle->master;
1061 map_changed = (memcmp(mle->vote_map, mle->node_map,
1062 sizeof(mle->vote_map)) != 0);
1063 voting_done = (memcmp(mle->vote_map, mle->response_map,
1064 sizeof(mle->vote_map)) == 0);
1065
1066
1067 if (map_changed) {
1068 int b;
1069 mlog(0, "%s: %.*s: node map changed, restarting\n",
1070 dlm->name, res->lockname.len, res->lockname.name);
1071 ret = dlm_restart_lock_mastery(dlm, res, mle, *blocked);
1072 b = (mle->type == DLM_MLE_BLOCK);
1073 if ((*blocked && !b) || (!*blocked && b)) {
1074 mlog(0, "%s:%.*s: status change: old=%d new=%d\n",
1075 dlm->name, res->lockname.len, res->lockname.name,
1076 *blocked, b);
1077 *blocked = b;
1078 }
1079 spin_unlock(&mle->spinlock);
1080 if (ret < 0) {
1081 mlog_errno(ret);
1082 goto leave;
1083 }
1084 mlog(0, "%s:%.*s: restart lock mastery succeeded, "
1085 "rechecking now\n", dlm->name, res->lockname.len,
1086 res->lockname.name);
1087 goto recheck;
1088 } else {
1089 if (!voting_done) {
1090 mlog(0, "map not changed and voting not done "
1091 "for %s:%.*s\n", dlm->name, res->lockname.len,
1092 res->lockname.name);
1093 }
1094 }
1095
1096 if (m != O2NM_MAX_NODES) {
1097
1098
1099 sleep = 0;
1100 } else {
1101 sleep = 1;
1102
1103 if (voting_done && !*blocked) {
1104 bit = find_next_bit(mle->maybe_map, O2NM_MAX_NODES, 0);
1105 if (dlm->node_num <= bit) {
1106
1107
1108
1109 mle->master = dlm->node_num;
1110
1111
1112 assert = 1;
1113 sleep = 0;
1114 }
1115
1116
1117 }
1118 }
1119
1120 spin_unlock(&mle->spinlock);
1121
1122
1123 if (sleep) {
1124 unsigned long timeo = msecs_to_jiffies(DLM_MASTERY_TIMEOUT_MS);
1125
1126
1127
1128
1129
1130
1131
1132 atomic_set(&mle->woken, 0);
1133 (void)wait_event_timeout(mle->wq,
1134 (atomic_read(&mle->woken) == 1),
1135 timeo);
1136 if (res->owner == O2NM_MAX_NODES) {
1137 mlog(0, "%s:%.*s: waiting again\n", dlm->name,
1138 res->lockname.len, res->lockname.name);
1139 goto recheck;
1140 }
1141 mlog(0, "done waiting, master is %u\n", res->owner);
1142 ret = 0;
1143 goto leave;
1144 }
1145
1146 ret = 0;
1147 if (assert) {
1148 m = dlm->node_num;
1149 mlog(0, "about to master %.*s here, this=%u\n",
1150 res->lockname.len, res->lockname.name, m);
1151 ret = dlm_do_assert_master(dlm, res, mle->vote_map, 0);
1152 if (ret) {
1153
1154
1155
1156
1157
1158 mlog_errno(ret);
1159 }
1160
1161
1162 ret = 0;
1163 }
1164
1165
1166 spin_lock(&res->spinlock);
1167
1168
1169 dlm_change_lockres_owner(dlm, res, m);
1170 spin_unlock(&res->spinlock);
1171
1172leave:
1173 return ret;
1174}
1175
1176struct dlm_bitmap_diff_iter
1177{
1178 int curnode;
1179 unsigned long *orig_bm;
1180 unsigned long *cur_bm;
1181 unsigned long diff_bm[BITS_TO_LONGS(O2NM_MAX_NODES)];
1182};
1183
1184enum dlm_node_state_change
1185{
1186 NODE_DOWN = -1,
1187 NODE_NO_CHANGE = 0,
1188 NODE_UP
1189};
1190
1191static void dlm_bitmap_diff_iter_init(struct dlm_bitmap_diff_iter *iter,
1192 unsigned long *orig_bm,
1193 unsigned long *cur_bm)
1194{
1195 unsigned long p1, p2;
1196 int i;
1197
1198 iter->curnode = -1;
1199 iter->orig_bm = orig_bm;
1200 iter->cur_bm = cur_bm;
1201
1202 for (i = 0; i < BITS_TO_LONGS(O2NM_MAX_NODES); i++) {
1203 p1 = *(iter->orig_bm + i);
1204 p2 = *(iter->cur_bm + i);
1205 iter->diff_bm[i] = (p1 & ~p2) | (p2 & ~p1);
1206 }
1207}
1208
1209static int dlm_bitmap_diff_iter_next(struct dlm_bitmap_diff_iter *iter,
1210 enum dlm_node_state_change *state)
1211{
1212 int bit;
1213
1214 if (iter->curnode >= O2NM_MAX_NODES)
1215 return -ENOENT;
1216
1217 bit = find_next_bit(iter->diff_bm, O2NM_MAX_NODES,
1218 iter->curnode+1);
1219 if (bit >= O2NM_MAX_NODES) {
1220 iter->curnode = O2NM_MAX_NODES;
1221 return -ENOENT;
1222 }
1223
1224
1225 if (test_bit(bit, iter->orig_bm))
1226 *state = NODE_DOWN;
1227 else
1228 *state = NODE_UP;
1229
1230 iter->curnode = bit;
1231 return bit;
1232}
1233
1234
1235static int dlm_restart_lock_mastery(struct dlm_ctxt *dlm,
1236 struct dlm_lock_resource *res,
1237 struct dlm_master_list_entry *mle,
1238 int blocked)
1239{
1240 struct dlm_bitmap_diff_iter bdi;
1241 enum dlm_node_state_change sc;
1242 int node;
1243 int ret = 0;
1244
1245 mlog(0, "something happened such that the "
1246 "master process may need to be restarted!\n");
1247
1248 assert_spin_locked(&mle->spinlock);
1249
1250 dlm_bitmap_diff_iter_init(&bdi, mle->vote_map, mle->node_map);
1251 node = dlm_bitmap_diff_iter_next(&bdi, &sc);
1252 while (node >= 0) {
1253 if (sc == NODE_UP) {
1254
1255
1256
1257 mlog(ML_NOTICE, "node %d up while restarting\n", node);
1258
1259
1260 mlog(0, "sending request to new node\n");
1261 clear_bit(node, mle->response_map);
1262 set_bit(node, mle->vote_map);
1263 } else {
1264 mlog(ML_ERROR, "node down! %d\n", node);
1265 if (blocked) {
1266 int lowest = find_next_bit(mle->maybe_map,
1267 O2NM_MAX_NODES, 0);
1268
1269
1270 clear_bit(node, mle->maybe_map);
1271
1272 if (node == lowest) {
1273 mlog(0, "expected master %u died"
1274 " while this node was blocked "
1275 "waiting on it!\n", node);
1276 lowest = find_next_bit(mle->maybe_map,
1277 O2NM_MAX_NODES,
1278 lowest+1);
1279 if (lowest < O2NM_MAX_NODES) {
1280 mlog(0, "%s:%.*s:still "
1281 "blocked. waiting on %u "
1282 "now\n", dlm->name,
1283 res->lockname.len,
1284 res->lockname.name,
1285 lowest);
1286 } else {
1287
1288
1289
1290
1291
1292
1293
1294
1295 mlog(0, "%s:%.*s: no "
1296 "longer blocking. try to "
1297 "master this here\n",
1298 dlm->name,
1299 res->lockname.len,
1300 res->lockname.name);
1301 mle->type = DLM_MLE_MASTER;
1302 mle->mleres = res;
1303 }
1304 }
1305 }
1306
1307
1308
1309 memset(mle->maybe_map, 0, sizeof(mle->maybe_map));
1310 memset(mle->response_map, 0, sizeof(mle->response_map));
1311
1312 memcpy(mle->vote_map, mle->node_map,
1313 sizeof(mle->node_map));
1314
1315 if (mle->type != DLM_MLE_BLOCK)
1316 set_bit(dlm->node_num, mle->maybe_map);
1317 }
1318 ret = -EAGAIN;
1319 node = dlm_bitmap_diff_iter_next(&bdi, &sc);
1320 }
1321 return ret;
1322}
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335static int dlm_do_master_request(struct dlm_lock_resource *res,
1336 struct dlm_master_list_entry *mle, int to)
1337{
1338 struct dlm_ctxt *dlm = mle->dlm;
1339 struct dlm_master_request request;
1340 int ret, response=0, resend;
1341
1342 memset(&request, 0, sizeof(request));
1343 request.node_idx = dlm->node_num;
1344
1345 BUG_ON(mle->type == DLM_MLE_MIGRATION);
1346
1347 request.namelen = (u8)mle->mnamelen;
1348 memcpy(request.name, mle->mname, request.namelen);
1349
1350again:
1351 ret = o2net_send_message(DLM_MASTER_REQUEST_MSG, dlm->key, &request,
1352 sizeof(request), to, &response);
1353 if (ret < 0) {
1354 if (ret == -ESRCH) {
1355
1356 mlog(ML_ERROR, "TCP stack not ready!\n");
1357 BUG();
1358 } else if (ret == -EINVAL) {
1359 mlog(ML_ERROR, "bad args passed to o2net!\n");
1360 BUG();
1361 } else if (ret == -ENOMEM) {
1362 mlog(ML_ERROR, "out of memory while trying to send "
1363 "network message! retrying\n");
1364
1365 msleep(50);
1366 goto again;
1367 } else if (!dlm_is_host_down(ret)) {
1368
1369 mlog_errno(ret);
1370 mlog(ML_ERROR, "unhandled error!");
1371 BUG();
1372 }
1373
1374
1375 mlog(ML_ERROR, "link to %d went down!\n", to);
1376 goto out;
1377 }
1378
1379 ret = 0;
1380 resend = 0;
1381 spin_lock(&mle->spinlock);
1382 switch (response) {
1383 case DLM_MASTER_RESP_YES:
1384 set_bit(to, mle->response_map);
1385 mlog(0, "node %u is the master, response=YES\n", to);
1386 mlog(0, "%s:%.*s: master node %u now knows I have a "
1387 "reference\n", dlm->name, res->lockname.len,
1388 res->lockname.name, to);
1389 mle->master = to;
1390 break;
1391 case DLM_MASTER_RESP_NO:
1392 mlog(0, "node %u not master, response=NO\n", to);
1393 set_bit(to, mle->response_map);
1394 break;
1395 case DLM_MASTER_RESP_MAYBE:
1396 mlog(0, "node %u not master, response=MAYBE\n", to);
1397 set_bit(to, mle->response_map);
1398 set_bit(to, mle->maybe_map);
1399 break;
1400 case DLM_MASTER_RESP_ERROR:
1401 mlog(0, "node %u hit an error, resending\n", to);
1402 resend = 1;
1403 response = 0;
1404 break;
1405 default:
1406 mlog(ML_ERROR, "bad response! %u\n", response);
1407 BUG();
1408 }
1409 spin_unlock(&mle->spinlock);
1410 if (resend) {
1411
1412 msleep(50);
1413 goto again;
1414 }
1415
1416out:
1417 return ret;
1418}
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429int dlm_master_request_handler(struct o2net_msg *msg, u32 len, void *data,
1430 void **ret_data)
1431{
1432 u8 response = DLM_MASTER_RESP_MAYBE;
1433 struct dlm_ctxt *dlm = data;
1434 struct dlm_lock_resource *res = NULL;
1435 struct dlm_master_request *request = (struct dlm_master_request *) msg->buf;
1436 struct dlm_master_list_entry *mle = NULL, *tmpmle = NULL;
1437 char *name;
1438 unsigned int namelen, hash;
1439 int found, ret;
1440 int set_maybe;
1441 int dispatch_assert = 0;
1442 int dispatched = 0;
1443
1444 if (!dlm_grab(dlm))
1445 return DLM_MASTER_RESP_NO;
1446
1447 if (!dlm_domain_fully_joined(dlm)) {
1448 response = DLM_MASTER_RESP_NO;
1449 goto send_response;
1450 }
1451
1452 name = request->name;
1453 namelen = request->namelen;
1454 hash = dlm_lockid_hash(name, namelen);
1455
1456 if (namelen > DLM_LOCKID_NAME_MAX) {
1457 response = DLM_IVBUFLEN;
1458 goto send_response;
1459 }
1460
1461way_up_top:
1462 spin_lock(&dlm->spinlock);
1463 res = __dlm_lookup_lockres(dlm, name, namelen, hash);
1464 if (res) {
1465 spin_unlock(&dlm->spinlock);
1466
1467
1468 spin_lock(&res->spinlock);
1469
1470
1471
1472
1473
1474
1475 if (hlist_unhashed(&res->hash_node)) {
1476 spin_unlock(&res->spinlock);
1477 dlm_lockres_put(res);
1478 goto way_up_top;
1479 }
1480
1481 if (res->state & (DLM_LOCK_RES_RECOVERING|
1482 DLM_LOCK_RES_MIGRATING)) {
1483 spin_unlock(&res->spinlock);
1484 mlog(0, "returning DLM_MASTER_RESP_ERROR since res is "
1485 "being recovered/migrated\n");
1486 response = DLM_MASTER_RESP_ERROR;
1487 if (mle)
1488 kmem_cache_free(dlm_mle_cache, mle);
1489 goto send_response;
1490 }
1491
1492 if (res->owner == dlm->node_num) {
1493 dlm_lockres_set_refmap_bit(dlm, res, request->node_idx);
1494 spin_unlock(&res->spinlock);
1495 response = DLM_MASTER_RESP_YES;
1496 if (mle)
1497 kmem_cache_free(dlm_mle_cache, mle);
1498
1499
1500
1501
1502
1503
1504
1505 dispatch_assert = 1;
1506 goto send_response;
1507 } else if (res->owner != DLM_LOCK_RES_OWNER_UNKNOWN) {
1508 spin_unlock(&res->spinlock);
1509
1510 response = DLM_MASTER_RESP_NO;
1511 if (mle)
1512 kmem_cache_free(dlm_mle_cache, mle);
1513 goto send_response;
1514 }
1515
1516
1517
1518
1519 if (!(res->state & DLM_LOCK_RES_IN_PROGRESS)) {
1520 mlog(ML_ERROR, "lock with no owner should be "
1521 "in-progress!\n");
1522 BUG();
1523 }
1524
1525
1526 spin_lock(&dlm->master_lock);
1527 found = dlm_find_mle(dlm, &tmpmle, name, namelen);
1528 if (!found) {
1529 mlog(ML_ERROR, "no mle found for this lock!\n");
1530 BUG();
1531 }
1532 set_maybe = 1;
1533 spin_lock(&tmpmle->spinlock);
1534 if (tmpmle->type == DLM_MLE_BLOCK) {
1535
1536
1537 response = DLM_MASTER_RESP_NO;
1538 } else if (tmpmle->type == DLM_MLE_MIGRATION) {
1539 mlog(0, "node %u is master, but trying to migrate to "
1540 "node %u.\n", tmpmle->master, tmpmle->new_master);
1541 if (tmpmle->master == dlm->node_num) {
1542 mlog(ML_ERROR, "no owner on lockres, but this "
1543 "node is trying to migrate it to %u?!\n",
1544 tmpmle->new_master);
1545 BUG();
1546 } else {
1547
1548 response = DLM_MASTER_RESP_NO;
1549 }
1550 } else if (tmpmle->master != DLM_LOCK_RES_OWNER_UNKNOWN) {
1551 set_maybe = 0;
1552 if (tmpmle->master == dlm->node_num) {
1553 response = DLM_MASTER_RESP_YES;
1554
1555
1556
1557 dispatch_assert = 1;
1558 dlm_lockres_set_refmap_bit(dlm, res,
1559 request->node_idx);
1560 } else
1561 response = DLM_MASTER_RESP_NO;
1562 } else {
1563
1564
1565 response = DLM_MASTER_RESP_MAYBE;
1566 }
1567 if (set_maybe)
1568 set_bit(request->node_idx, tmpmle->maybe_map);
1569 spin_unlock(&tmpmle->spinlock);
1570
1571 spin_unlock(&dlm->master_lock);
1572 spin_unlock(&res->spinlock);
1573
1574
1575 dlm_put_mle(tmpmle);
1576 if (mle)
1577 kmem_cache_free(dlm_mle_cache, mle);
1578 goto send_response;
1579 }
1580
1581
1582
1583
1584
1585
1586
1587 spin_lock(&dlm->master_lock);
1588 found = dlm_find_mle(dlm, &tmpmle, name, namelen);
1589 if (!found) {
1590
1591
1592 if (!mle) {
1593 spin_unlock(&dlm->master_lock);
1594 spin_unlock(&dlm->spinlock);
1595
1596 mle = kmem_cache_alloc(dlm_mle_cache, GFP_NOFS);
1597 if (!mle) {
1598 response = DLM_MASTER_RESP_ERROR;
1599 mlog_errno(-ENOMEM);
1600 goto send_response;
1601 }
1602 goto way_up_top;
1603 }
1604
1605
1606
1607 dlm_init_mle(mle, DLM_MLE_BLOCK, dlm, NULL, name, namelen);
1608 set_bit(request->node_idx, mle->maybe_map);
1609 __dlm_insert_mle(dlm, mle);
1610 response = DLM_MASTER_RESP_NO;
1611 } else {
1612
1613 set_maybe = 1;
1614 spin_lock(&tmpmle->spinlock);
1615 if (tmpmle->master == dlm->node_num) {
1616 mlog(ML_ERROR, "no lockres, but an mle with this node as master!\n");
1617 BUG();
1618 }
1619 if (tmpmle->type == DLM_MLE_BLOCK)
1620 response = DLM_MASTER_RESP_NO;
1621 else if (tmpmle->type == DLM_MLE_MIGRATION) {
1622 mlog(0, "migration mle was found (%u->%u)\n",
1623 tmpmle->master, tmpmle->new_master);
1624
1625 response = DLM_MASTER_RESP_NO;
1626 } else
1627 response = DLM_MASTER_RESP_MAYBE;
1628 if (set_maybe)
1629 set_bit(request->node_idx, tmpmle->maybe_map);
1630 spin_unlock(&tmpmle->spinlock);
1631 }
1632 spin_unlock(&dlm->master_lock);
1633 spin_unlock(&dlm->spinlock);
1634
1635 if (found) {
1636
1637 dlm_put_mle(tmpmle);
1638 }
1639send_response:
1640
1641
1642
1643
1644
1645
1646 if (dispatch_assert) {
1647 if (response != DLM_MASTER_RESP_YES)
1648 mlog(ML_ERROR, "invalid response %d\n", response);
1649 if (!res) {
1650 mlog(ML_ERROR, "bad lockres while trying to assert!\n");
1651 BUG();
1652 }
1653 mlog(0, "%u is the owner of %.*s, cleaning everyone else\n",
1654 dlm->node_num, res->lockname.len, res->lockname.name);
1655 spin_lock(&res->spinlock);
1656 ret = dlm_dispatch_assert_master(dlm, res, 0, request->node_idx,
1657 DLM_ASSERT_MASTER_MLE_CLEANUP);
1658 if (ret < 0) {
1659 mlog(ML_ERROR, "failed to dispatch assert master work\n");
1660 response = DLM_MASTER_RESP_ERROR;
1661 spin_unlock(&res->spinlock);
1662 dlm_lockres_put(res);
1663 } else {
1664 dispatched = 1;
1665 __dlm_lockres_grab_inflight_worker(dlm, res);
1666 spin_unlock(&res->spinlock);
1667 }
1668 } else {
1669 if (res)
1670 dlm_lockres_put(res);
1671 }
1672
1673 if (!dispatched)
1674 dlm_put(dlm);
1675 return response;
1676}
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688static int dlm_do_assert_master(struct dlm_ctxt *dlm,
1689 struct dlm_lock_resource *res,
1690 void *nodemap, u32 flags)
1691{
1692 struct dlm_assert_master assert;
1693 int to, tmpret;
1694 struct dlm_node_iter iter;
1695 int ret = 0;
1696 int reassert;
1697 const char *lockname = res->lockname.name;
1698 unsigned int namelen = res->lockname.len;
1699
1700 BUG_ON(namelen > O2NM_MAX_NAME_LEN);
1701
1702 spin_lock(&res->spinlock);
1703 res->state |= DLM_LOCK_RES_SETREF_INPROG;
1704 spin_unlock(&res->spinlock);
1705
1706again:
1707 reassert = 0;
1708
1709
1710 dlm_node_iter_init(nodemap, &iter);
1711 while ((to = dlm_node_iter_next(&iter)) >= 0) {
1712 int r = 0;
1713 struct dlm_master_list_entry *mle = NULL;
1714
1715 mlog(0, "sending assert master to %d (%.*s)\n", to,
1716 namelen, lockname);
1717 memset(&assert, 0, sizeof(assert));
1718 assert.node_idx = dlm->node_num;
1719 assert.namelen = namelen;
1720 memcpy(assert.name, lockname, namelen);
1721 assert.flags = cpu_to_be32(flags);
1722
1723 tmpret = o2net_send_message(DLM_ASSERT_MASTER_MSG, dlm->key,
1724 &assert, sizeof(assert), to, &r);
1725 if (tmpret < 0) {
1726 mlog(ML_ERROR, "Error %d when sending message %u (key "
1727 "0x%x) to node %u\n", tmpret,
1728 DLM_ASSERT_MASTER_MSG, dlm->key, to);
1729 if (!dlm_is_host_down(tmpret)) {
1730 mlog(ML_ERROR, "unhandled error=%d!\n", tmpret);
1731 BUG();
1732 }
1733
1734 mlog(0, "link to %d went down!\n", to);
1735
1736 ret = tmpret;
1737 r = 0;
1738 } else if (r < 0) {
1739
1740 mlog(ML_ERROR,"during assert master of %.*s to %u, "
1741 "got %d.\n", namelen, lockname, to, r);
1742 spin_lock(&dlm->spinlock);
1743 spin_lock(&dlm->master_lock);
1744 if (dlm_find_mle(dlm, &mle, (char *)lockname,
1745 namelen)) {
1746 dlm_print_one_mle(mle);
1747 __dlm_put_mle(mle);
1748 }
1749 spin_unlock(&dlm->master_lock);
1750 spin_unlock(&dlm->spinlock);
1751 BUG();
1752 }
1753
1754 if (r & DLM_ASSERT_RESPONSE_REASSERT &&
1755 !(r & DLM_ASSERT_RESPONSE_MASTERY_REF)) {
1756 mlog(ML_ERROR, "%.*s: very strange, "
1757 "master MLE but no lockres on %u\n",
1758 namelen, lockname, to);
1759 }
1760
1761 if (r & DLM_ASSERT_RESPONSE_REASSERT) {
1762 mlog(0, "%.*s: node %u create mles on other "
1763 "nodes and requests a re-assert\n",
1764 namelen, lockname, to);
1765 reassert = 1;
1766 }
1767 if (r & DLM_ASSERT_RESPONSE_MASTERY_REF) {
1768 mlog(0, "%.*s: node %u has a reference to this "
1769 "lockres, set the bit in the refmap\n",
1770 namelen, lockname, to);
1771 spin_lock(&res->spinlock);
1772 dlm_lockres_set_refmap_bit(dlm, res, to);
1773 spin_unlock(&res->spinlock);
1774 }
1775 }
1776
1777 if (reassert)
1778 goto again;
1779
1780 spin_lock(&res->spinlock);
1781 res->state &= ~DLM_LOCK_RES_SETREF_INPROG;
1782 spin_unlock(&res->spinlock);
1783 wake_up(&res->wq);
1784
1785 return ret;
1786}
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797int dlm_assert_master_handler(struct o2net_msg *msg, u32 len, void *data,
1798 void **ret_data)
1799{
1800 struct dlm_ctxt *dlm = data;
1801 struct dlm_master_list_entry *mle = NULL;
1802 struct dlm_assert_master *assert = (struct dlm_assert_master *)msg->buf;
1803 struct dlm_lock_resource *res = NULL;
1804 char *name;
1805 unsigned int namelen, hash;
1806 u32 flags;
1807 int master_request = 0, have_lockres_ref = 0;
1808 int ret = 0;
1809
1810 if (!dlm_grab(dlm))
1811 return 0;
1812
1813 name = assert->name;
1814 namelen = assert->namelen;
1815 hash = dlm_lockid_hash(name, namelen);
1816 flags = be32_to_cpu(assert->flags);
1817
1818 if (namelen > DLM_LOCKID_NAME_MAX) {
1819 mlog(ML_ERROR, "Invalid name length!");
1820 goto done;
1821 }
1822
1823 spin_lock(&dlm->spinlock);
1824
1825 if (flags)
1826 mlog(0, "assert_master with flags: %u\n", flags);
1827
1828
1829 spin_lock(&dlm->master_lock);
1830 if (!dlm_find_mle(dlm, &mle, name, namelen)) {
1831
1832 mlog(0, "just got an assert_master from %u, but no "
1833 "MLE for it! (%.*s)\n", assert->node_idx,
1834 namelen, name);
1835 } else {
1836 int bit = find_next_bit (mle->maybe_map, O2NM_MAX_NODES, 0);
1837 if (bit >= O2NM_MAX_NODES) {
1838
1839
1840 mlog(0, "no bits set in the maybe_map, but %u "
1841 "is asserting! (%.*s)\n", assert->node_idx,
1842 namelen, name);
1843 } else if (bit != assert->node_idx) {
1844 if (flags & DLM_ASSERT_MASTER_MLE_CLEANUP) {
1845 mlog(0, "master %u was found, %u should "
1846 "back off\n", assert->node_idx, bit);
1847 } else {
1848
1849
1850
1851
1852 mlog(0, "%u is the lowest node, "
1853 "%u is asserting. (%.*s) %u must "
1854 "have begun after %u won.\n", bit,
1855 assert->node_idx, namelen, name, bit,
1856 assert->node_idx);
1857 }
1858 }
1859 if (mle->type == DLM_MLE_MIGRATION) {
1860 if (flags & DLM_ASSERT_MASTER_MLE_CLEANUP) {
1861 mlog(0, "%s:%.*s: got cleanup assert"
1862 " from %u for migration\n",
1863 dlm->name, namelen, name,
1864 assert->node_idx);
1865 } else if (!(flags & DLM_ASSERT_MASTER_FINISH_MIGRATION)) {
1866 mlog(0, "%s:%.*s: got unrelated assert"
1867 " from %u for migration, ignoring\n",
1868 dlm->name, namelen, name,
1869 assert->node_idx);
1870 __dlm_put_mle(mle);
1871 spin_unlock(&dlm->master_lock);
1872 spin_unlock(&dlm->spinlock);
1873 goto done;
1874 }
1875 }
1876 }
1877 spin_unlock(&dlm->master_lock);
1878
1879
1880
1881 res = __dlm_lookup_lockres(dlm, name, namelen, hash);
1882 if (res) {
1883 spin_lock(&res->spinlock);
1884 if (res->state & DLM_LOCK_RES_RECOVERING) {
1885 mlog(ML_ERROR, "%u asserting but %.*s is "
1886 "RECOVERING!\n", assert->node_idx, namelen, name);
1887 goto kill;
1888 }
1889 if (!mle) {
1890 if (res->owner != DLM_LOCK_RES_OWNER_UNKNOWN &&
1891 res->owner != assert->node_idx) {
1892 mlog(ML_ERROR, "DIE! Mastery assert from %u, "
1893 "but current owner is %u! (%.*s)\n",
1894 assert->node_idx, res->owner, namelen,
1895 name);
1896 __dlm_print_one_lock_resource(res);
1897 BUG();
1898 }
1899 } else if (mle->type != DLM_MLE_MIGRATION) {
1900 if (res->owner != DLM_LOCK_RES_OWNER_UNKNOWN) {
1901
1902 if (res->owner == assert->node_idx) {
1903 mlog(0, "owner %u re-asserting on "
1904 "lock %.*s\n", assert->node_idx,
1905 namelen, name);
1906 goto ok;
1907 }
1908 mlog(ML_ERROR, "got assert_master from "
1909 "node %u, but %u is the owner! "
1910 "(%.*s)\n", assert->node_idx,
1911 res->owner, namelen, name);
1912 goto kill;
1913 }
1914 if (!(res->state & DLM_LOCK_RES_IN_PROGRESS)) {
1915 mlog(ML_ERROR, "got assert from %u, but lock "
1916 "with no owner should be "
1917 "in-progress! (%.*s)\n",
1918 assert->node_idx,
1919 namelen, name);
1920 goto kill;
1921 }
1922 } else {
1923
1924 if (assert->node_idx != mle->new_master) {
1925 mlog(ML_ERROR, "got assert from %u, but "
1926 "new master is %u, and old master "
1927 "was %u (%.*s)\n",
1928 assert->node_idx, mle->new_master,
1929 mle->master, namelen, name);
1930 goto kill;
1931 }
1932
1933 }
1934ok:
1935 spin_unlock(&res->spinlock);
1936 }
1937
1938
1939
1940 if (mle) {
1941 int extra_ref = 0;
1942 int nn = -1;
1943 int rr, err = 0;
1944
1945 spin_lock(&mle->spinlock);
1946 if (mle->type == DLM_MLE_BLOCK || mle->type == DLM_MLE_MIGRATION)
1947 extra_ref = 1;
1948 else {
1949
1950
1951
1952 while ((nn = find_next_bit (mle->response_map, O2NM_MAX_NODES,
1953 nn+1)) < O2NM_MAX_NODES) {
1954 if (nn != dlm->node_num && nn != assert->node_idx) {
1955 master_request = 1;
1956 break;
1957 }
1958 }
1959 }
1960 mle->master = assert->node_idx;
1961 atomic_set(&mle->woken, 1);
1962 wake_up(&mle->wq);
1963 spin_unlock(&mle->spinlock);
1964
1965 if (res) {
1966 int wake = 0;
1967 spin_lock(&res->spinlock);
1968 if (mle->type == DLM_MLE_MIGRATION) {
1969 mlog(0, "finishing off migration of lockres %.*s, "
1970 "from %u to %u\n",
1971 res->lockname.len, res->lockname.name,
1972 dlm->node_num, mle->new_master);
1973 res->state &= ~DLM_LOCK_RES_MIGRATING;
1974 wake = 1;
1975 dlm_change_lockres_owner(dlm, res, mle->new_master);
1976 BUG_ON(res->state & DLM_LOCK_RES_DIRTY);
1977 } else {
1978 dlm_change_lockres_owner(dlm, res, mle->master);
1979 }
1980 spin_unlock(&res->spinlock);
1981 have_lockres_ref = 1;
1982 if (wake)
1983 wake_up(&res->wq);
1984 }
1985
1986
1987
1988
1989 spin_lock(&dlm->master_lock);
1990
1991 rr = atomic_read(&mle->mle_refs.refcount);
1992 if (mle->inuse > 0) {
1993 if (extra_ref && rr < 3)
1994 err = 1;
1995 else if (!extra_ref && rr < 2)
1996 err = 1;
1997 } else {
1998 if (extra_ref && rr < 2)
1999 err = 1;
2000 else if (!extra_ref && rr < 1)
2001 err = 1;
2002 }
2003 if (err) {
2004 mlog(ML_ERROR, "%s:%.*s: got assert master from %u "
2005 "that will mess up this node, refs=%d, extra=%d, "
2006 "inuse=%d\n", dlm->name, namelen, name,
2007 assert->node_idx, rr, extra_ref, mle->inuse);
2008 dlm_print_one_mle(mle);
2009 }
2010 __dlm_unlink_mle(dlm, mle);
2011 __dlm_mle_detach_hb_events(dlm, mle);
2012 __dlm_put_mle(mle);
2013 if (extra_ref) {
2014
2015
2016
2017
2018 __dlm_put_mle(mle);
2019 }
2020 spin_unlock(&dlm->master_lock);
2021 } else if (res) {
2022 if (res->owner != assert->node_idx) {
2023 mlog(0, "assert_master from %u, but current "
2024 "owner is %u (%.*s), no mle\n", assert->node_idx,
2025 res->owner, namelen, name);
2026 }
2027 }
2028 spin_unlock(&dlm->spinlock);
2029
2030done:
2031 ret = 0;
2032 if (res) {
2033 spin_lock(&res->spinlock);
2034 res->state |= DLM_LOCK_RES_SETREF_INPROG;
2035 spin_unlock(&res->spinlock);
2036 *ret_data = (void *)res;
2037 }
2038 dlm_put(dlm);
2039 if (master_request) {
2040 mlog(0, "need to tell master to reassert\n");
2041
2042 ret |= DLM_ASSERT_RESPONSE_REASSERT;
2043 if (!have_lockres_ref) {
2044 mlog(ML_ERROR, "strange, got assert from %u, MASTER "
2045 "mle present here for %s:%.*s, but no lockres!\n",
2046 assert->node_idx, dlm->name, namelen, name);
2047 }
2048 }
2049 if (have_lockres_ref) {
2050
2051 ret |= DLM_ASSERT_RESPONSE_MASTERY_REF;
2052 mlog(0, "%s:%.*s: got assert from %u, need a ref\n",
2053 dlm->name, namelen, name, assert->node_idx);
2054 }
2055 return ret;
2056
2057kill:
2058
2059 mlog(ML_ERROR, "Bad message received from another node. Dumping state "
2060 "and killing the other node now! This node is OK and can continue.\n");
2061 __dlm_print_one_lock_resource(res);
2062 spin_unlock(&res->spinlock);
2063 spin_lock(&dlm->master_lock);
2064 if (mle)
2065 __dlm_put_mle(mle);
2066 spin_unlock(&dlm->master_lock);
2067 spin_unlock(&dlm->spinlock);
2068 *ret_data = (void *)res;
2069 dlm_put(dlm);
2070 return -EINVAL;
2071}
2072
2073void dlm_assert_master_post_handler(int status, void *data, void *ret_data)
2074{
2075 struct dlm_lock_resource *res = (struct dlm_lock_resource *)ret_data;
2076
2077 if (ret_data) {
2078 spin_lock(&res->spinlock);
2079 res->state &= ~DLM_LOCK_RES_SETREF_INPROG;
2080 spin_unlock(&res->spinlock);
2081 wake_up(&res->wq);
2082 dlm_lockres_put(res);
2083 }
2084 return;
2085}
2086
2087int dlm_dispatch_assert_master(struct dlm_ctxt *dlm,
2088 struct dlm_lock_resource *res,
2089 int ignore_higher, u8 request_from, u32 flags)
2090{
2091 struct dlm_work_item *item;
2092 item = kzalloc(sizeof(*item), GFP_ATOMIC);
2093 if (!item)
2094 return -ENOMEM;
2095
2096
2097
2098 dlm_init_work_item(dlm, item, dlm_assert_master_worker, NULL);
2099 item->u.am.lockres = res;
2100
2101 item->u.am.ignore_higher = ignore_higher;
2102 item->u.am.request_from = request_from;
2103 item->u.am.flags = flags;
2104
2105 if (ignore_higher)
2106 mlog(0, "IGNORE HIGHER: %.*s\n", res->lockname.len,
2107 res->lockname.name);
2108
2109 spin_lock(&dlm->work_lock);
2110 list_add_tail(&item->list, &dlm->work_list);
2111 spin_unlock(&dlm->work_lock);
2112
2113 queue_work(dlm->dlm_worker, &dlm->dispatched_work);
2114 return 0;
2115}
2116
2117static void dlm_assert_master_worker(struct dlm_work_item *item, void *data)
2118{
2119 struct dlm_ctxt *dlm = data;
2120 int ret = 0;
2121 struct dlm_lock_resource *res;
2122 unsigned long nodemap[BITS_TO_LONGS(O2NM_MAX_NODES)];
2123 int ignore_higher;
2124 int bit;
2125 u8 request_from;
2126 u32 flags;
2127
2128 dlm = item->dlm;
2129 res = item->u.am.lockres;
2130 ignore_higher = item->u.am.ignore_higher;
2131 request_from = item->u.am.request_from;
2132 flags = item->u.am.flags;
2133
2134 spin_lock(&dlm->spinlock);
2135 memcpy(nodemap, dlm->domain_map, sizeof(nodemap));
2136 spin_unlock(&dlm->spinlock);
2137
2138 clear_bit(dlm->node_num, nodemap);
2139 if (ignore_higher) {
2140
2141
2142
2143 clear_bit(request_from, nodemap);
2144 bit = dlm->node_num;
2145 while (1) {
2146 bit = find_next_bit(nodemap, O2NM_MAX_NODES,
2147 bit+1);
2148 if (bit >= O2NM_MAX_NODES)
2149 break;
2150 clear_bit(bit, nodemap);
2151 }
2152 }
2153
2154
2155
2156
2157
2158
2159
2160 spin_lock(&res->spinlock);
2161 if (res->state & DLM_LOCK_RES_MIGRATING) {
2162 mlog(0, "Someone asked us to assert mastery, but we're "
2163 "in the middle of migration. Skipping assert, "
2164 "the new master will handle that.\n");
2165 spin_unlock(&res->spinlock);
2166 goto put;
2167 } else
2168 __dlm_lockres_reserve_ast(res);
2169 spin_unlock(&res->spinlock);
2170
2171
2172
2173 mlog(0, "worker about to master %.*s here, this=%u\n",
2174 res->lockname.len, res->lockname.name, dlm->node_num);
2175 ret = dlm_do_assert_master(dlm, res, nodemap, flags);
2176 if (ret < 0) {
2177
2178 if (!dlm_is_host_down(ret))
2179 mlog_errno(ret);
2180 }
2181
2182
2183 dlm_lockres_release_ast(dlm, res);
2184
2185put:
2186 dlm_lockres_drop_inflight_worker(dlm, res);
2187
2188 dlm_lockres_put(res);
2189
2190 mlog(0, "finished with dlm_assert_master_worker\n");
2191}
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203static int dlm_pre_master_reco_lockres(struct dlm_ctxt *dlm,
2204 struct dlm_lock_resource *res)
2205{
2206 struct dlm_node_iter iter;
2207 int nodenum;
2208 int ret = 0;
2209 u8 master = DLM_LOCK_RES_OWNER_UNKNOWN;
2210
2211 spin_lock(&dlm->spinlock);
2212 dlm_node_iter_init(dlm->domain_map, &iter);
2213 spin_unlock(&dlm->spinlock);
2214
2215 while ((nodenum = dlm_node_iter_next(&iter)) >= 0) {
2216
2217 if (nodenum == dlm->node_num)
2218 continue;
2219 ret = dlm_do_master_requery(dlm, res, nodenum, &master);
2220 if (ret < 0) {
2221 mlog_errno(ret);
2222 if (!dlm_is_host_down(ret))
2223 BUG();
2224
2225
2226 ret = 0;
2227 }
2228
2229 if (master != DLM_LOCK_RES_OWNER_UNKNOWN) {
2230
2231 spin_lock(&dlm->spinlock);
2232 if (test_bit(master, dlm->recovery_map)) {
2233 mlog(ML_NOTICE, "%s: node %u has not seen "
2234 "node %u go down yet, and thinks the "
2235 "dead node is mastering the recovery "
2236 "lock. must wait.\n", dlm->name,
2237 nodenum, master);
2238 ret = -EAGAIN;
2239 }
2240 spin_unlock(&dlm->spinlock);
2241 mlog(0, "%s: reco lock master is %u\n", dlm->name,
2242 master);
2243 break;
2244 }
2245 }
2246 return ret;
2247}
2248
2249
2250
2251
2252
2253int dlm_drop_lockres_ref(struct dlm_ctxt *dlm, struct dlm_lock_resource *res)
2254{
2255 struct dlm_deref_lockres deref;
2256 int ret = 0, r;
2257 const char *lockname;
2258 unsigned int namelen;
2259
2260 lockname = res->lockname.name;
2261 namelen = res->lockname.len;
2262 BUG_ON(namelen > O2NM_MAX_NAME_LEN);
2263
2264 memset(&deref, 0, sizeof(deref));
2265 deref.node_idx = dlm->node_num;
2266 deref.namelen = namelen;
2267 memcpy(deref.name, lockname, namelen);
2268
2269 ret = o2net_send_message(DLM_DEREF_LOCKRES_MSG, dlm->key,
2270 &deref, sizeof(deref), res->owner, &r);
2271 if (ret < 0)
2272 mlog(ML_ERROR, "%s: res %.*s, error %d send DEREF to node %u\n",
2273 dlm->name, namelen, lockname, ret, res->owner);
2274 else if (r < 0) {
2275
2276 mlog(ML_ERROR, "%s: res %.*s, DEREF to node %u got %d\n",
2277 dlm->name, namelen, lockname, res->owner, r);
2278 dlm_print_one_lock_resource(res);
2279 if (r == -ENOMEM)
2280 BUG();
2281 } else
2282 ret = r;
2283
2284 return ret;
2285}
2286
2287int dlm_deref_lockres_handler(struct o2net_msg *msg, u32 len, void *data,
2288 void **ret_data)
2289{
2290 struct dlm_ctxt *dlm = data;
2291 struct dlm_deref_lockres *deref = (struct dlm_deref_lockres *)msg->buf;
2292 struct dlm_lock_resource *res = NULL;
2293 char *name;
2294 unsigned int namelen;
2295 int ret = -EINVAL;
2296 u8 node;
2297 unsigned int hash;
2298 struct dlm_work_item *item;
2299 int cleared = 0;
2300 int dispatch = 0;
2301
2302 if (!dlm_grab(dlm))
2303 return 0;
2304
2305 name = deref->name;
2306 namelen = deref->namelen;
2307 node = deref->node_idx;
2308
2309 if (namelen > DLM_LOCKID_NAME_MAX) {
2310 mlog(ML_ERROR, "Invalid name length!");
2311 goto done;
2312 }
2313 if (deref->node_idx >= O2NM_MAX_NODES) {
2314 mlog(ML_ERROR, "Invalid node number: %u\n", node);
2315 goto done;
2316 }
2317
2318 hash = dlm_lockid_hash(name, namelen);
2319
2320 spin_lock(&dlm->spinlock);
2321 res = __dlm_lookup_lockres_full(dlm, name, namelen, hash);
2322 if (!res) {
2323 spin_unlock(&dlm->spinlock);
2324 mlog(ML_ERROR, "%s:%.*s: bad lockres name\n",
2325 dlm->name, namelen, name);
2326 goto done;
2327 }
2328 spin_unlock(&dlm->spinlock);
2329
2330 spin_lock(&res->spinlock);
2331 if (res->state & DLM_LOCK_RES_SETREF_INPROG)
2332 dispatch = 1;
2333 else {
2334 BUG_ON(res->state & DLM_LOCK_RES_DROPPING_REF);
2335 if (test_bit(node, res->refmap)) {
2336 dlm_lockres_clear_refmap_bit(dlm, res, node);
2337 cleared = 1;
2338 }
2339 }
2340 spin_unlock(&res->spinlock);
2341
2342 if (!dispatch) {
2343 if (cleared)
2344 dlm_lockres_calc_usage(dlm, res);
2345 else {
2346 mlog(ML_ERROR, "%s:%.*s: node %u trying to drop ref "
2347 "but it is already dropped!\n", dlm->name,
2348 res->lockname.len, res->lockname.name, node);
2349 dlm_print_one_lock_resource(res);
2350 }
2351 ret = DLM_DEREF_RESPONSE_DONE;
2352 goto done;
2353 }
2354
2355 item = kzalloc(sizeof(*item), GFP_NOFS);
2356 if (!item) {
2357 ret = -ENOMEM;
2358 mlog_errno(ret);
2359 goto done;
2360 }
2361
2362 dlm_init_work_item(dlm, item, dlm_deref_lockres_worker, NULL);
2363 item->u.dl.deref_res = res;
2364 item->u.dl.deref_node = node;
2365
2366 spin_lock(&dlm->work_lock);
2367 list_add_tail(&item->list, &dlm->work_list);
2368 spin_unlock(&dlm->work_lock);
2369
2370 queue_work(dlm->dlm_worker, &dlm->dispatched_work);
2371 return DLM_DEREF_RESPONSE_INPROG;
2372
2373done:
2374 if (res)
2375 dlm_lockres_put(res);
2376 dlm_put(dlm);
2377
2378 return ret;
2379}
2380
2381int dlm_deref_lockres_done_handler(struct o2net_msg *msg, u32 len, void *data,
2382 void **ret_data)
2383{
2384 struct dlm_ctxt *dlm = data;
2385 struct dlm_deref_lockres_done *deref
2386 = (struct dlm_deref_lockres_done *)msg->buf;
2387 struct dlm_lock_resource *res = NULL;
2388 char *name;
2389 unsigned int namelen;
2390 int ret = -EINVAL;
2391 u8 node;
2392 unsigned int hash;
2393
2394 if (!dlm_grab(dlm))
2395 return 0;
2396
2397 name = deref->name;
2398 namelen = deref->namelen;
2399 node = deref->node_idx;
2400
2401 if (namelen > DLM_LOCKID_NAME_MAX) {
2402 mlog(ML_ERROR, "Invalid name length!");
2403 goto done;
2404 }
2405 if (deref->node_idx >= O2NM_MAX_NODES) {
2406 mlog(ML_ERROR, "Invalid node number: %u\n", node);
2407 goto done;
2408 }
2409
2410 hash = dlm_lockid_hash(name, namelen);
2411
2412 spin_lock(&dlm->spinlock);
2413 res = __dlm_lookup_lockres_full(dlm, name, namelen, hash);
2414 if (!res) {
2415 spin_unlock(&dlm->spinlock);
2416 mlog(ML_ERROR, "%s:%.*s: bad lockres name\n",
2417 dlm->name, namelen, name);
2418 goto done;
2419 }
2420
2421 spin_lock(&res->spinlock);
2422 if (!(res->state & DLM_LOCK_RES_DROPPING_REF)) {
2423 spin_unlock(&res->spinlock);
2424 spin_unlock(&dlm->spinlock);
2425 mlog(ML_NOTICE, "%s:%.*s: node %u sends deref done "
2426 "but it is already derefed!\n", dlm->name,
2427 res->lockname.len, res->lockname.name, node);
2428 ret = 0;
2429 goto done;
2430 }
2431
2432 __dlm_do_purge_lockres(dlm, res);
2433 spin_unlock(&res->spinlock);
2434 wake_up(&res->wq);
2435
2436 spin_unlock(&dlm->spinlock);
2437
2438 ret = 0;
2439done:
2440 if (res)
2441 dlm_lockres_put(res);
2442 dlm_put(dlm);
2443 return ret;
2444}
2445
2446static void dlm_drop_lockres_ref_done(struct dlm_ctxt *dlm,
2447 struct dlm_lock_resource *res, u8 node)
2448{
2449 struct dlm_deref_lockres_done deref;
2450 int ret = 0, r;
2451 const char *lockname;
2452 unsigned int namelen;
2453
2454 lockname = res->lockname.name;
2455 namelen = res->lockname.len;
2456 BUG_ON(namelen > O2NM_MAX_NAME_LEN);
2457
2458 memset(&deref, 0, sizeof(deref));
2459 deref.node_idx = dlm->node_num;
2460 deref.namelen = namelen;
2461 memcpy(deref.name, lockname, namelen);
2462
2463 ret = o2net_send_message(DLM_DEREF_LOCKRES_DONE, dlm->key,
2464 &deref, sizeof(deref), node, &r);
2465 if (ret < 0) {
2466 mlog(ML_ERROR, "%s: res %.*s, error %d send DEREF DONE "
2467 " to node %u\n", dlm->name, namelen,
2468 lockname, ret, node);
2469 } else if (r < 0) {
2470
2471 mlog(ML_ERROR, "%s: res %.*s, DEREF to node %u got %d\n",
2472 dlm->name, namelen, lockname, node, r);
2473 dlm_print_one_lock_resource(res);
2474 }
2475}
2476
2477static void dlm_deref_lockres_worker(struct dlm_work_item *item, void *data)
2478{
2479 struct dlm_ctxt *dlm;
2480 struct dlm_lock_resource *res;
2481 u8 node;
2482 u8 cleared = 0;
2483
2484 dlm = item->dlm;
2485 res = item->u.dl.deref_res;
2486 node = item->u.dl.deref_node;
2487
2488 spin_lock(&res->spinlock);
2489 BUG_ON(res->state & DLM_LOCK_RES_DROPPING_REF);
2490 __dlm_wait_on_lockres_flags(res, DLM_LOCK_RES_SETREF_INPROG);
2491 if (test_bit(node, res->refmap)) {
2492 dlm_lockres_clear_refmap_bit(dlm, res, node);
2493 cleared = 1;
2494 }
2495 spin_unlock(&res->spinlock);
2496
2497 dlm_drop_lockres_ref_done(dlm, res, node);
2498
2499 if (cleared) {
2500 mlog(0, "%s:%.*s node %u ref dropped in dispatch\n",
2501 dlm->name, res->lockname.len, res->lockname.name, node);
2502 dlm_lockres_calc_usage(dlm, res);
2503 } else {
2504 mlog(ML_ERROR, "%s:%.*s: node %u trying to drop ref "
2505 "but it is already dropped!\n", dlm->name,
2506 res->lockname.len, res->lockname.name, node);
2507 dlm_print_one_lock_resource(res);
2508 }
2509
2510 dlm_lockres_put(res);
2511}
2512
2513
2514
2515
2516
2517
2518
2519
2520static int dlm_is_lockres_migrateable(struct dlm_ctxt *dlm,
2521 struct dlm_lock_resource *res)
2522{
2523 enum dlm_lockres_list idx;
2524 int nonlocal = 0, node_ref;
2525 struct list_head *queue;
2526 struct dlm_lock *lock;
2527 u64 cookie;
2528
2529 assert_spin_locked(&res->spinlock);
2530
2531
2532 if (res->state & DLM_LOCK_RES_MIGRATING)
2533 return 0;
2534
2535
2536 if (res->state & (DLM_LOCK_RES_RECOVERING|
2537 DLM_LOCK_RES_RECOVERY_WAITING))
2538 return 0;
2539
2540 if (res->owner != dlm->node_num)
2541 return 0;
2542
2543 for (idx = DLM_GRANTED_LIST; idx <= DLM_BLOCKED_LIST; idx++) {
2544 queue = dlm_list_idx_to_ptr(res, idx);
2545 list_for_each_entry(lock, queue, list) {
2546 if (lock->ml.node != dlm->node_num) {
2547 nonlocal++;
2548 continue;
2549 }
2550 cookie = be64_to_cpu(lock->ml.cookie);
2551 mlog(0, "%s: Not migrateable res %.*s, lock %u:%llu on "
2552 "%s list\n", dlm->name, res->lockname.len,
2553 res->lockname.name,
2554 dlm_get_lock_cookie_node(cookie),
2555 dlm_get_lock_cookie_seq(cookie),
2556 dlm_list_in_text(idx));
2557 return 0;
2558 }
2559 }
2560
2561 if (!nonlocal) {
2562 node_ref = find_next_bit(res->refmap, O2NM_MAX_NODES, 0);
2563 if (node_ref >= O2NM_MAX_NODES)
2564 return 0;
2565 }
2566
2567 mlog(0, "%s: res %.*s, Migrateable\n", dlm->name, res->lockname.len,
2568 res->lockname.name);
2569
2570 return 1;
2571}
2572
2573
2574
2575
2576
2577
2578static int dlm_migrate_lockres(struct dlm_ctxt *dlm,
2579 struct dlm_lock_resource *res, u8 target)
2580{
2581 struct dlm_master_list_entry *mle = NULL;
2582 struct dlm_master_list_entry *oldmle = NULL;
2583 struct dlm_migratable_lockres *mres = NULL;
2584 int ret = 0;
2585 const char *name;
2586 unsigned int namelen;
2587 int mle_added = 0;
2588 int wake = 0;
2589
2590 if (!dlm_grab(dlm))
2591 return -EINVAL;
2592
2593 BUG_ON(target == O2NM_MAX_NODES);
2594
2595 name = res->lockname.name;
2596 namelen = res->lockname.len;
2597
2598 mlog(0, "%s: Migrating %.*s to node %u\n", dlm->name, namelen, name,
2599 target);
2600
2601
2602 ret = -ENOMEM;
2603 mres = (struct dlm_migratable_lockres *) __get_free_page(GFP_NOFS);
2604 if (!mres) {
2605 mlog_errno(ret);
2606 goto leave;
2607 }
2608
2609 mle = kmem_cache_alloc(dlm_mle_cache, GFP_NOFS);
2610 if (!mle) {
2611 mlog_errno(ret);
2612 goto leave;
2613 }
2614 ret = 0;
2615
2616
2617
2618
2619
2620 spin_lock(&dlm->spinlock);
2621 spin_lock(&dlm->master_lock);
2622 ret = dlm_add_migration_mle(dlm, res, mle, &oldmle, name,
2623 namelen, target, dlm->node_num);
2624
2625
2626
2627
2628 dlm_get_mle_inuse(mle);
2629 spin_unlock(&dlm->master_lock);
2630 spin_unlock(&dlm->spinlock);
2631
2632 if (ret == -EEXIST) {
2633 mlog(0, "another process is already migrating it\n");
2634 goto fail;
2635 }
2636 mle_added = 1;
2637
2638
2639
2640
2641
2642 if (dlm_mark_lockres_migrating(dlm, res, target) < 0) {
2643 mlog(ML_ERROR, "tried to migrate %.*s to %u, but "
2644 "the target went down.\n", res->lockname.len,
2645 res->lockname.name, target);
2646 spin_lock(&res->spinlock);
2647 res->state &= ~DLM_LOCK_RES_MIGRATING;
2648 wake = 1;
2649 spin_unlock(&res->spinlock);
2650 ret = -EINVAL;
2651 }
2652
2653fail:
2654 if (ret != -EEXIST && oldmle) {
2655
2656 dlm_mle_detach_hb_events(dlm, oldmle);
2657 dlm_put_mle(oldmle);
2658 }
2659
2660 if (ret < 0) {
2661 if (mle_added) {
2662 dlm_mle_detach_hb_events(dlm, mle);
2663 dlm_put_mle(mle);
2664 dlm_put_mle_inuse(mle);
2665 } else if (mle) {
2666 kmem_cache_free(dlm_mle_cache, mle);
2667 mle = NULL;
2668 }
2669 goto leave;
2670 }
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680 flush_workqueue(dlm->dlm_worker);
2681
2682
2683
2684
2685
2686 ret = dlm_send_one_lockres(dlm, res, mres, target,
2687 DLM_MRES_MIGRATION);
2688
2689 if (ret < 0) {
2690 mlog(0, "migration to node %u failed with %d\n",
2691 target, ret);
2692
2693 dlm_mle_detach_hb_events(dlm, mle);
2694 dlm_put_mle(mle);
2695 dlm_put_mle_inuse(mle);
2696 spin_lock(&res->spinlock);
2697 res->state &= ~DLM_LOCK_RES_MIGRATING;
2698 wake = 1;
2699 spin_unlock(&res->spinlock);
2700 if (dlm_is_host_down(ret))
2701 dlm_wait_for_node_death(dlm, target,
2702 DLM_NODE_DEATH_WAIT_MAX);
2703 goto leave;
2704 }
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718 while (1) {
2719 ret = wait_event_interruptible_timeout(mle->wq,
2720 (atomic_read(&mle->woken) == 1),
2721 msecs_to_jiffies(5000));
2722
2723 if (ret >= 0) {
2724 if (atomic_read(&mle->woken) == 1 ||
2725 res->owner == target)
2726 break;
2727
2728 mlog(0, "%s:%.*s: timed out during migration\n",
2729 dlm->name, res->lockname.len, res->lockname.name);
2730
2731
2732 if (dlm_is_node_dead(dlm, target)) {
2733 mlog(0, "%s:%.*s: expected migration "
2734 "target %u is no longer up, restarting\n",
2735 dlm->name, res->lockname.len,
2736 res->lockname.name, target);
2737 ret = -EINVAL;
2738
2739 dlm_mle_detach_hb_events(dlm, mle);
2740 dlm_put_mle(mle);
2741 dlm_put_mle_inuse(mle);
2742 spin_lock(&res->spinlock);
2743 res->state &= ~DLM_LOCK_RES_MIGRATING;
2744 wake = 1;
2745 spin_unlock(&res->spinlock);
2746 goto leave;
2747 }
2748 } else
2749 mlog(0, "%s:%.*s: caught signal during migration\n",
2750 dlm->name, res->lockname.len, res->lockname.name);
2751 }
2752
2753
2754 spin_lock(&res->spinlock);
2755 dlm_set_lockres_owner(dlm, res, target);
2756 res->state &= ~DLM_LOCK_RES_MIGRATING;
2757 dlm_remove_nonlocal_locks(dlm, res);
2758 spin_unlock(&res->spinlock);
2759 wake_up(&res->wq);
2760
2761
2762 dlm_mle_detach_hb_events(dlm, mle);
2763 dlm_put_mle_inuse(mle);
2764 ret = 0;
2765
2766 dlm_lockres_calc_usage(dlm, res);
2767
2768leave:
2769
2770 if (ret < 0)
2771 dlm_kick_thread(dlm, res);
2772
2773
2774
2775 if (wake)
2776 wake_up(&res->wq);
2777
2778 if (mres)
2779 free_page((unsigned long)mres);
2780
2781 dlm_put(dlm);
2782
2783 mlog(0, "%s: Migrating %.*s to %u, returns %d\n", dlm->name, namelen,
2784 name, target, ret);
2785 return ret;
2786}
2787
2788#define DLM_MIGRATION_RETRY_MS 100
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800int dlm_empty_lockres(struct dlm_ctxt *dlm, struct dlm_lock_resource *res)
2801{
2802 int ret;
2803 int lock_dropped = 0;
2804 u8 target = O2NM_MAX_NODES;
2805
2806 assert_spin_locked(&dlm->spinlock);
2807
2808 spin_lock(&res->spinlock);
2809 if (dlm_is_lockres_migrateable(dlm, res))
2810 target = dlm_pick_migration_target(dlm, res);
2811 spin_unlock(&res->spinlock);
2812
2813 if (target == O2NM_MAX_NODES)
2814 goto leave;
2815
2816
2817 spin_unlock(&dlm->spinlock);
2818 lock_dropped = 1;
2819 ret = dlm_migrate_lockres(dlm, res, target);
2820 if (ret)
2821 mlog(0, "%s: res %.*s, Migrate to node %u failed with %d\n",
2822 dlm->name, res->lockname.len, res->lockname.name,
2823 target, ret);
2824 spin_lock(&dlm->spinlock);
2825leave:
2826 return lock_dropped;
2827}
2828
2829int dlm_lock_basts_flushed(struct dlm_ctxt *dlm, struct dlm_lock *lock)
2830{
2831 int ret;
2832 spin_lock(&dlm->ast_lock);
2833 spin_lock(&lock->spinlock);
2834 ret = (list_empty(&lock->bast_list) && !lock->bast_pending);
2835 spin_unlock(&lock->spinlock);
2836 spin_unlock(&dlm->ast_lock);
2837 return ret;
2838}
2839
2840static int dlm_migration_can_proceed(struct dlm_ctxt *dlm,
2841 struct dlm_lock_resource *res,
2842 u8 mig_target)
2843{
2844 int can_proceed;
2845 spin_lock(&res->spinlock);
2846 can_proceed = !!(res->state & DLM_LOCK_RES_MIGRATING);
2847 spin_unlock(&res->spinlock);
2848
2849
2850
2851 spin_lock(&dlm->spinlock);
2852 if (!test_bit(mig_target, dlm->domain_map))
2853 can_proceed = 1;
2854 spin_unlock(&dlm->spinlock);
2855 return can_proceed;
2856}
2857
2858static int dlm_lockres_is_dirty(struct dlm_ctxt *dlm,
2859 struct dlm_lock_resource *res)
2860{
2861 int ret;
2862 spin_lock(&res->spinlock);
2863 ret = !!(res->state & DLM_LOCK_RES_DIRTY);
2864 spin_unlock(&res->spinlock);
2865 return ret;
2866}
2867
2868
2869static int dlm_mark_lockres_migrating(struct dlm_ctxt *dlm,
2870 struct dlm_lock_resource *res,
2871 u8 target)
2872{
2873 int ret = 0;
2874
2875 mlog(0, "dlm_mark_lockres_migrating: %.*s, from %u to %u\n",
2876 res->lockname.len, res->lockname.name, dlm->node_num,
2877 target);
2878
2879
2880 spin_lock(&res->spinlock);
2881 BUG_ON(res->migration_pending);
2882 res->migration_pending = 1;
2883
2884
2885 __dlm_lockres_reserve_ast(res);
2886 spin_unlock(&res->spinlock);
2887
2888
2889 dlm_kick_thread(dlm, res);
2890
2891
2892 spin_lock(&res->spinlock);
2893 BUG_ON(res->state & DLM_LOCK_RES_BLOCK_DIRTY);
2894 res->state |= DLM_LOCK_RES_BLOCK_DIRTY;
2895 spin_unlock(&res->spinlock);
2896
2897 wait_event(dlm->ast_wq, !dlm_lockres_is_dirty(dlm, res));
2898 dlm_lockres_release_ast(dlm, res);
2899
2900 mlog(0, "about to wait on migration_wq, dirty=%s\n",
2901 res->state & DLM_LOCK_RES_DIRTY ? "yes" : "no");
2902
2903
2904
2905again:
2906 ret = wait_event_interruptible_timeout(dlm->migration_wq,
2907 dlm_migration_can_proceed(dlm, res, target),
2908 msecs_to_jiffies(1000));
2909 if (ret < 0) {
2910 mlog(0, "woken again: migrating? %s, dead? %s\n",
2911 res->state & DLM_LOCK_RES_MIGRATING ? "yes":"no",
2912 test_bit(target, dlm->domain_map) ? "no":"yes");
2913 } else {
2914 mlog(0, "all is well: migrating? %s, dead? %s\n",
2915 res->state & DLM_LOCK_RES_MIGRATING ? "yes":"no",
2916 test_bit(target, dlm->domain_map) ? "no":"yes");
2917 }
2918 if (!dlm_migration_can_proceed(dlm, res, target)) {
2919 mlog(0, "trying again...\n");
2920 goto again;
2921 }
2922
2923 ret = 0;
2924
2925 spin_lock(&dlm->spinlock);
2926 if (!test_bit(target, dlm->domain_map)) {
2927 mlog(ML_ERROR, "aha. migration target %u just went down\n",
2928 target);
2929 ret = -EHOSTDOWN;
2930 }
2931 spin_unlock(&dlm->spinlock);
2932
2933
2934
2935
2936
2937
2938 spin_lock(&res->spinlock);
2939 BUG_ON(!(res->state & DLM_LOCK_RES_BLOCK_DIRTY));
2940 res->state &= ~DLM_LOCK_RES_BLOCK_DIRTY;
2941 if (!ret)
2942 BUG_ON(!(res->state & DLM_LOCK_RES_MIGRATING));
2943 else
2944 res->migration_pending = 0;
2945 spin_unlock(&res->spinlock);
2946
2947
2948
2949
2950
2951
2952
2953
2954
2955 return ret;
2956}
2957
2958
2959
2960
2961static void dlm_remove_nonlocal_locks(struct dlm_ctxt *dlm,
2962 struct dlm_lock_resource *res)
2963{
2964 struct list_head *queue = &res->granted;
2965 int i, bit;
2966 struct dlm_lock *lock, *next;
2967
2968 assert_spin_locked(&res->spinlock);
2969
2970 BUG_ON(res->owner == dlm->node_num);
2971
2972 for (i=0; i<3; i++) {
2973 list_for_each_entry_safe(lock, next, queue, list) {
2974 if (lock->ml.node != dlm->node_num) {
2975 mlog(0, "putting lock for node %u\n",
2976 lock->ml.node);
2977
2978 BUG_ON(!list_empty(&lock->ast_list));
2979 BUG_ON(!list_empty(&lock->bast_list));
2980 BUG_ON(lock->ast_pending);
2981 BUG_ON(lock->bast_pending);
2982 dlm_lockres_clear_refmap_bit(dlm, res,
2983 lock->ml.node);
2984 list_del_init(&lock->list);
2985 dlm_lock_put(lock);
2986
2987
2988 dlm_lock_put(lock);
2989 }
2990 }
2991 queue++;
2992 }
2993 bit = 0;
2994 while (1) {
2995 bit = find_next_bit(res->refmap, O2NM_MAX_NODES, bit);
2996 if (bit >= O2NM_MAX_NODES)
2997 break;
2998
2999
3000 if (bit != dlm->node_num) {
3001 mlog(0, "%s:%.*s: node %u had a ref to this "
3002 "migrating lockres, clearing\n", dlm->name,
3003 res->lockname.len, res->lockname.name, bit);
3004 dlm_lockres_clear_refmap_bit(dlm, res, bit);
3005 }
3006 bit++;
3007 }
3008}
3009
3010
3011
3012
3013
3014
3015static u8 dlm_pick_migration_target(struct dlm_ctxt *dlm,
3016 struct dlm_lock_resource *res)
3017{
3018 enum dlm_lockres_list idx;
3019 struct list_head *queue = &res->granted;
3020 struct dlm_lock *lock;
3021 int noderef;
3022 u8 nodenum = O2NM_MAX_NODES;
3023
3024 assert_spin_locked(&dlm->spinlock);
3025 assert_spin_locked(&res->spinlock);
3026
3027
3028 for (idx = DLM_GRANTED_LIST; idx <= DLM_BLOCKED_LIST; idx++) {
3029 queue = dlm_list_idx_to_ptr(res, idx);
3030 list_for_each_entry(lock, queue, list) {
3031 if (lock->ml.node == dlm->node_num)
3032 continue;
3033 if (test_bit(lock->ml.node, dlm->exit_domain_map))
3034 continue;
3035 nodenum = lock->ml.node;
3036 goto bail;
3037 }
3038 }
3039
3040
3041 noderef = -1;
3042 while (1) {
3043 noderef = find_next_bit(res->refmap, O2NM_MAX_NODES,
3044 noderef + 1);
3045 if (noderef >= O2NM_MAX_NODES)
3046 break;
3047 if (noderef == dlm->node_num)
3048 continue;
3049 if (test_bit(noderef, dlm->exit_domain_map))
3050 continue;
3051 nodenum = noderef;
3052 goto bail;
3053 }
3054
3055bail:
3056 return nodenum;
3057}
3058
3059
3060
3061static int dlm_do_migrate_request(struct dlm_ctxt *dlm,
3062 struct dlm_lock_resource *res,
3063 u8 master, u8 new_master,
3064 struct dlm_node_iter *iter)
3065{
3066 struct dlm_migrate_request migrate;
3067 int ret, skip, status = 0;
3068 int nodenum;
3069
3070 memset(&migrate, 0, sizeof(migrate));
3071 migrate.namelen = res->lockname.len;
3072 memcpy(migrate.name, res->lockname.name, migrate.namelen);
3073 migrate.new_master = new_master;
3074 migrate.master = master;
3075
3076 ret = 0;
3077
3078
3079 while ((nodenum = dlm_node_iter_next(iter)) >= 0) {
3080 if (nodenum == master ||
3081 nodenum == new_master)
3082 continue;
3083
3084
3085 spin_lock(&dlm->spinlock);
3086 skip = (!test_bit(nodenum, dlm->domain_map));
3087 spin_unlock(&dlm->spinlock);
3088 if (skip) {
3089 clear_bit(nodenum, iter->node_map);
3090 continue;
3091 }
3092
3093 ret = o2net_send_message(DLM_MIGRATE_REQUEST_MSG, dlm->key,
3094 &migrate, sizeof(migrate), nodenum,
3095 &status);
3096 if (ret < 0) {
3097 mlog(ML_ERROR, "%s: res %.*s, Error %d send "
3098 "MIGRATE_REQUEST to node %u\n", dlm->name,
3099 migrate.namelen, migrate.name, ret, nodenum);
3100 if (!dlm_is_host_down(ret)) {
3101 mlog(ML_ERROR, "unhandled error=%d!\n", ret);
3102 BUG();
3103 }
3104 clear_bit(nodenum, iter->node_map);
3105 ret = 0;
3106 } else if (status < 0) {
3107 mlog(0, "migrate request (node %u) returned %d!\n",
3108 nodenum, status);
3109 ret = status;
3110 } else if (status == DLM_MIGRATE_RESPONSE_MASTERY_REF) {
3111
3112
3113
3114 mlog(0, "%s:%.*s: need ref for node %u\n",
3115 dlm->name, res->lockname.len, res->lockname.name,
3116 nodenum);
3117 spin_lock(&res->spinlock);
3118 dlm_lockres_set_refmap_bit(dlm, res, nodenum);
3119 spin_unlock(&res->spinlock);
3120 }
3121 }
3122
3123 if (ret < 0)
3124 mlog_errno(ret);
3125
3126 mlog(0, "returning ret=%d\n", ret);
3127 return ret;
3128}
3129
3130
3131
3132
3133
3134
3135
3136
3137
3138int dlm_migrate_request_handler(struct o2net_msg *msg, u32 len, void *data,
3139 void **ret_data)
3140{
3141 struct dlm_ctxt *dlm = data;
3142 struct dlm_lock_resource *res = NULL;
3143 struct dlm_migrate_request *migrate = (struct dlm_migrate_request *) msg->buf;
3144 struct dlm_master_list_entry *mle = NULL, *oldmle = NULL;
3145 const char *name;
3146 unsigned int namelen, hash;
3147 int ret = 0;
3148
3149 if (!dlm_grab(dlm))
3150 return 0;
3151
3152 name = migrate->name;
3153 namelen = migrate->namelen;
3154 hash = dlm_lockid_hash(name, namelen);
3155
3156
3157 mle = kmem_cache_alloc(dlm_mle_cache, GFP_NOFS);
3158
3159 if (!mle) {
3160 ret = -ENOMEM;
3161 goto leave;
3162 }
3163
3164
3165 spin_lock(&dlm->spinlock);
3166 res = __dlm_lookup_lockres(dlm, name, namelen, hash);
3167 if (res) {
3168 spin_lock(&res->spinlock);
3169 if (res->state & DLM_LOCK_RES_RECOVERING) {
3170
3171
3172
3173 spin_unlock(&res->spinlock);
3174 mlog(ML_ERROR, "Got a migrate request, but the "
3175 "lockres is marked as recovering!");
3176 kmem_cache_free(dlm_mle_cache, mle);
3177 ret = -EINVAL;
3178 goto unlock;
3179 }
3180 res->state |= DLM_LOCK_RES_MIGRATING;
3181 spin_unlock(&res->spinlock);
3182 }
3183
3184 spin_lock(&dlm->master_lock);
3185
3186 ret = dlm_add_migration_mle(dlm, res, mle, &oldmle,
3187 name, namelen,
3188 migrate->new_master,
3189 migrate->master);
3190
3191 spin_unlock(&dlm->master_lock);
3192unlock:
3193 spin_unlock(&dlm->spinlock);
3194
3195 if (oldmle) {
3196
3197 dlm_mle_detach_hb_events(dlm, oldmle);
3198 dlm_put_mle(oldmle);
3199 }
3200
3201 if (res)
3202 dlm_lockres_put(res);
3203leave:
3204 dlm_put(dlm);
3205 return ret;
3206}
3207
3208
3209
3210
3211
3212
3213
3214
3215static int dlm_add_migration_mle(struct dlm_ctxt *dlm,
3216 struct dlm_lock_resource *res,
3217 struct dlm_master_list_entry *mle,
3218 struct dlm_master_list_entry **oldmle,
3219 const char *name, unsigned int namelen,
3220 u8 new_master, u8 master)
3221{
3222 int found;
3223 int ret = 0;
3224
3225 *oldmle = NULL;
3226
3227 assert_spin_locked(&dlm->spinlock);
3228 assert_spin_locked(&dlm->master_lock);
3229
3230
3231 found = dlm_find_mle(dlm, oldmle, (char *)name, namelen);
3232 if (found) {
3233 struct dlm_master_list_entry *tmp = *oldmle;
3234 spin_lock(&tmp->spinlock);
3235 if (tmp->type == DLM_MLE_MIGRATION) {
3236 if (master == dlm->node_num) {
3237
3238 mlog(0, "tried to migrate %.*s, but some "
3239 "process beat me to it\n",
3240 namelen, name);
3241 spin_unlock(&tmp->spinlock);
3242 return -EEXIST;
3243 } else {
3244
3245 mlog(ML_ERROR, "migration error mle: "
3246 "master=%u new_master=%u // request: "
3247 "master=%u new_master=%u // "
3248 "lockres=%.*s\n",
3249 tmp->master, tmp->new_master,
3250 master, new_master,
3251 namelen, name);
3252 BUG();
3253 }
3254 } else {
3255
3256 tmp->master = master;
3257 atomic_set(&tmp->woken, 1);
3258 wake_up(&tmp->wq);
3259
3260 __dlm_unlink_mle(dlm, tmp);
3261 __dlm_mle_detach_hb_events(dlm, tmp);
3262 if (tmp->type == DLM_MLE_MASTER) {
3263 ret = DLM_MIGRATE_RESPONSE_MASTERY_REF;
3264 mlog(0, "%s:%.*s: master=%u, newmaster=%u, "
3265 "telling master to get ref "
3266 "for cleared out mle during "
3267 "migration\n", dlm->name,
3268 namelen, name, master,
3269 new_master);
3270 }
3271 }
3272 spin_unlock(&tmp->spinlock);
3273 }
3274
3275
3276 dlm_init_mle(mle, DLM_MLE_MIGRATION, dlm, res, name, namelen);
3277 mle->new_master = new_master;
3278
3279
3280 mle->master = master;
3281
3282 set_bit(new_master, mle->maybe_map);
3283 __dlm_insert_mle(dlm, mle);
3284
3285 return ret;
3286}
3287
3288
3289
3290
3291static struct dlm_lock_resource *dlm_reset_mleres_owner(struct dlm_ctxt *dlm,
3292 struct dlm_master_list_entry *mle)
3293{
3294 struct dlm_lock_resource *res;
3295
3296
3297 res = __dlm_lookup_lockres(dlm, mle->mname, mle->mnamelen,
3298 mle->mnamehash);
3299 if (res) {
3300 spin_unlock(&dlm->master_lock);
3301
3302
3303 spin_lock(&res->spinlock);
3304 dlm_set_lockres_owner(dlm, res, DLM_LOCK_RES_OWNER_UNKNOWN);
3305 dlm_move_lockres_to_recovery_list(dlm, res);
3306 spin_unlock(&res->spinlock);
3307 dlm_lockres_put(res);
3308
3309
3310 __dlm_mle_detach_hb_events(dlm, mle);
3311
3312
3313 spin_lock(&dlm->master_lock);
3314 __dlm_put_mle(mle);
3315 spin_unlock(&dlm->master_lock);
3316 }
3317
3318 return res;
3319}
3320
3321static void dlm_clean_migration_mle(struct dlm_ctxt *dlm,
3322 struct dlm_master_list_entry *mle)
3323{
3324 __dlm_mle_detach_hb_events(dlm, mle);
3325
3326 spin_lock(&mle->spinlock);
3327 __dlm_unlink_mle(dlm, mle);
3328 atomic_set(&mle->woken, 1);
3329 spin_unlock(&mle->spinlock);
3330
3331 wake_up(&mle->wq);
3332}
3333
3334static void dlm_clean_block_mle(struct dlm_ctxt *dlm,
3335 struct dlm_master_list_entry *mle, u8 dead_node)
3336{
3337 int bit;
3338
3339 BUG_ON(mle->type != DLM_MLE_BLOCK);
3340
3341 spin_lock(&mle->spinlock);
3342 bit = find_next_bit(mle->maybe_map, O2NM_MAX_NODES, 0);
3343 if (bit != dead_node) {
3344 mlog(0, "mle found, but dead node %u would not have been "
3345 "master\n", dead_node);
3346 spin_unlock(&mle->spinlock);
3347 } else {
3348
3349
3350
3351
3352 mlog(0, "node %u was expected master\n", dead_node);
3353 atomic_set(&mle->woken, 1);
3354 spin_unlock(&mle->spinlock);
3355 wake_up(&mle->wq);
3356
3357
3358 __dlm_mle_detach_hb_events(dlm, mle);
3359 __dlm_put_mle(mle);
3360 }
3361}
3362
3363void dlm_clean_master_list(struct dlm_ctxt *dlm, u8 dead_node)
3364{
3365 struct dlm_master_list_entry *mle;
3366 struct dlm_lock_resource *res;
3367 struct hlist_head *bucket;
3368 struct hlist_node *tmp;
3369 unsigned int i;
3370
3371 mlog(0, "dlm=%s, dead node=%u\n", dlm->name, dead_node);
3372top:
3373 assert_spin_locked(&dlm->spinlock);
3374
3375
3376 spin_lock(&dlm->master_lock);
3377 for (i = 0; i < DLM_HASH_BUCKETS; i++) {
3378 bucket = dlm_master_hash(dlm, i);
3379 hlist_for_each_entry_safe(mle, tmp, bucket, master_hash_node) {
3380 BUG_ON(mle->type != DLM_MLE_BLOCK &&
3381 mle->type != DLM_MLE_MASTER &&
3382 mle->type != DLM_MLE_MIGRATION);
3383
3384
3385
3386
3387 if (mle->type == DLM_MLE_MASTER)
3388 continue;
3389
3390
3391
3392
3393 if (mle->type == DLM_MLE_BLOCK) {
3394 dlm_clean_block_mle(dlm, mle, dead_node);
3395 continue;
3396 }
3397
3398
3399
3400
3401
3402
3403
3404
3405
3406
3407
3408
3409 if (mle->master != dead_node &&
3410 mle->new_master != dead_node)
3411 continue;
3412
3413 if (mle->new_master == dead_node && mle->inuse) {
3414 mlog(ML_NOTICE, "%s: target %u died during "
3415 "migration from %u, the MLE is "
3416 "still keep used, ignore it!\n",
3417 dlm->name, dead_node,
3418 mle->master);
3419 continue;
3420 }
3421
3422
3423
3424 dlm_clean_migration_mle(dlm, mle);
3425
3426 mlog(0, "%s: node %u died during migration from "
3427 "%u to %u!\n", dlm->name, dead_node, mle->master,
3428 mle->new_master);
3429
3430
3431
3432
3433
3434
3435 res = dlm_reset_mleres_owner(dlm, mle);
3436 if (res)
3437
3438 goto top;
3439
3440
3441 __dlm_put_mle(mle);
3442 }
3443 }
3444 spin_unlock(&dlm->master_lock);
3445}
3446
3447int dlm_finish_migration(struct dlm_ctxt *dlm, struct dlm_lock_resource *res,
3448 u8 old_master)
3449{
3450 struct dlm_node_iter iter;
3451 int ret = 0;
3452
3453 spin_lock(&dlm->spinlock);
3454 dlm_node_iter_init(dlm->domain_map, &iter);
3455 clear_bit(old_master, iter.node_map);
3456 clear_bit(dlm->node_num, iter.node_map);
3457 spin_unlock(&dlm->spinlock);
3458
3459
3460
3461
3462 spin_lock(&res->spinlock);
3463 dlm_lockres_set_refmap_bit(dlm, res, old_master);
3464 spin_unlock(&res->spinlock);
3465
3466 mlog(0, "now time to do a migrate request to other nodes\n");
3467 ret = dlm_do_migrate_request(dlm, res, old_master,
3468 dlm->node_num, &iter);
3469 if (ret < 0) {
3470 mlog_errno(ret);
3471 goto leave;
3472 }
3473
3474 mlog(0, "doing assert master of %.*s to all except the original node\n",
3475 res->lockname.len, res->lockname.name);
3476
3477
3478 ret = dlm_do_assert_master(dlm, res, iter.node_map,
3479 DLM_ASSERT_MASTER_FINISH_MIGRATION);
3480 if (ret < 0) {
3481
3482 mlog_errno(ret);
3483 ret = 0;
3484 }
3485
3486 memset(iter.node_map, 0, sizeof(iter.node_map));
3487 set_bit(old_master, iter.node_map);
3488 mlog(0, "doing assert master of %.*s back to %u\n",
3489 res->lockname.len, res->lockname.name, old_master);
3490 ret = dlm_do_assert_master(dlm, res, iter.node_map,
3491 DLM_ASSERT_MASTER_FINISH_MIGRATION);
3492 if (ret < 0) {
3493 mlog(0, "assert master to original master failed "
3494 "with %d.\n", ret);
3495
3496
3497 ret = 0;
3498 }
3499
3500
3501 spin_lock(&res->spinlock);
3502 dlm_set_lockres_owner(dlm, res, dlm->node_num);
3503 res->state &= ~DLM_LOCK_RES_MIGRATING;
3504 spin_unlock(&res->spinlock);
3505
3506 dlm_kick_thread(dlm, res);
3507 wake_up(&res->wq);
3508leave:
3509 return ret;
3510}
3511
3512
3513
3514
3515
3516
3517
3518
3519
3520
3521void __dlm_lockres_reserve_ast(struct dlm_lock_resource *res)
3522{
3523 assert_spin_locked(&res->spinlock);
3524 if (res->state & DLM_LOCK_RES_MIGRATING) {
3525 __dlm_print_one_lock_resource(res);
3526 }
3527 BUG_ON(res->state & DLM_LOCK_RES_MIGRATING);
3528
3529 atomic_inc(&res->asts_reserved);
3530}
3531
3532
3533
3534
3535
3536
3537
3538
3539
3540
3541
3542
3543
3544
3545void dlm_lockres_release_ast(struct dlm_ctxt *dlm,
3546 struct dlm_lock_resource *res)
3547{
3548 if (!atomic_dec_and_lock(&res->asts_reserved, &res->spinlock))
3549 return;
3550
3551 if (!res->migration_pending) {
3552 spin_unlock(&res->spinlock);
3553 return;
3554 }
3555
3556 BUG_ON(res->state & DLM_LOCK_RES_MIGRATING);
3557 res->migration_pending = 0;
3558 res->state |= DLM_LOCK_RES_MIGRATING;
3559 spin_unlock(&res->spinlock);
3560 wake_up(&res->wq);
3561 wake_up(&dlm->migration_wq);
3562}
3563
3564void dlm_force_free_mles(struct dlm_ctxt *dlm)
3565{
3566 int i;
3567 struct hlist_head *bucket;
3568 struct dlm_master_list_entry *mle;
3569 struct hlist_node *tmp;
3570
3571
3572
3573
3574
3575
3576
3577 spin_lock(&dlm->spinlock);
3578 spin_lock(&dlm->master_lock);
3579
3580 BUG_ON(dlm->dlm_state != DLM_CTXT_LEAVING);
3581 BUG_ON((find_next_bit(dlm->domain_map, O2NM_MAX_NODES, 0) < O2NM_MAX_NODES));
3582
3583 for (i = 0; i < DLM_HASH_BUCKETS; i++) {
3584 bucket = dlm_master_hash(dlm, i);
3585 hlist_for_each_entry_safe(mle, tmp, bucket, master_hash_node) {
3586 if (mle->type != DLM_MLE_BLOCK) {
3587 mlog(ML_ERROR, "bad mle: %p\n", mle);
3588 dlm_print_one_mle(mle);
3589 }
3590 atomic_set(&mle->woken, 1);
3591 wake_up(&mle->wq);
3592
3593 __dlm_unlink_mle(dlm, mle);
3594 __dlm_mle_detach_hb_events(dlm, mle);
3595 __dlm_put_mle(mle);
3596 }
3597 }
3598 spin_unlock(&dlm->master_lock);
3599 spin_unlock(&dlm->spinlock);
3600}
3601