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 (!kref_read(&mle->mle_refs)) {
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 spin_lock(&tmpmle->spinlock);
1613 if (tmpmle->master == dlm->node_num) {
1614 mlog(ML_ERROR, "no lockres, but an mle with this node as master!\n");
1615 BUG();
1616 }
1617 if (tmpmle->type == DLM_MLE_BLOCK)
1618 response = DLM_MASTER_RESP_NO;
1619 else if (tmpmle->type == DLM_MLE_MIGRATION) {
1620 mlog(0, "migration mle was found (%u->%u)\n",
1621 tmpmle->master, tmpmle->new_master);
1622
1623 response = DLM_MASTER_RESP_NO;
1624 } else
1625 response = DLM_MASTER_RESP_MAYBE;
1626 set_bit(request->node_idx, tmpmle->maybe_map);
1627 spin_unlock(&tmpmle->spinlock);
1628 }
1629 spin_unlock(&dlm->master_lock);
1630 spin_unlock(&dlm->spinlock);
1631
1632 if (found) {
1633
1634 dlm_put_mle(tmpmle);
1635 }
1636send_response:
1637
1638
1639
1640
1641
1642
1643 if (dispatch_assert) {
1644 mlog(0, "%u is the owner of %.*s, cleaning everyone else\n",
1645 dlm->node_num, res->lockname.len, res->lockname.name);
1646 spin_lock(&res->spinlock);
1647 ret = dlm_dispatch_assert_master(dlm, res, 0, request->node_idx,
1648 DLM_ASSERT_MASTER_MLE_CLEANUP);
1649 if (ret < 0) {
1650 mlog(ML_ERROR, "failed to dispatch assert master work\n");
1651 response = DLM_MASTER_RESP_ERROR;
1652 spin_unlock(&res->spinlock);
1653 dlm_lockres_put(res);
1654 } else {
1655 dispatched = 1;
1656 __dlm_lockres_grab_inflight_worker(dlm, res);
1657 spin_unlock(&res->spinlock);
1658 }
1659 } else {
1660 if (res)
1661 dlm_lockres_put(res);
1662 }
1663
1664 if (!dispatched)
1665 dlm_put(dlm);
1666 return response;
1667}
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679static int dlm_do_assert_master(struct dlm_ctxt *dlm,
1680 struct dlm_lock_resource *res,
1681 void *nodemap, u32 flags)
1682{
1683 struct dlm_assert_master assert;
1684 int to, tmpret;
1685 struct dlm_node_iter iter;
1686 int ret = 0;
1687 int reassert;
1688 const char *lockname = res->lockname.name;
1689 unsigned int namelen = res->lockname.len;
1690
1691 BUG_ON(namelen > O2NM_MAX_NAME_LEN);
1692
1693 spin_lock(&res->spinlock);
1694 res->state |= DLM_LOCK_RES_SETREF_INPROG;
1695 spin_unlock(&res->spinlock);
1696
1697again:
1698 reassert = 0;
1699
1700
1701 dlm_node_iter_init(nodemap, &iter);
1702 while ((to = dlm_node_iter_next(&iter)) >= 0) {
1703 int r = 0;
1704 struct dlm_master_list_entry *mle = NULL;
1705
1706 mlog(0, "sending assert master to %d (%.*s)\n", to,
1707 namelen, lockname);
1708 memset(&assert, 0, sizeof(assert));
1709 assert.node_idx = dlm->node_num;
1710 assert.namelen = namelen;
1711 memcpy(assert.name, lockname, namelen);
1712 assert.flags = cpu_to_be32(flags);
1713
1714 tmpret = o2net_send_message(DLM_ASSERT_MASTER_MSG, dlm->key,
1715 &assert, sizeof(assert), to, &r);
1716 if (tmpret < 0) {
1717 mlog(ML_ERROR, "Error %d when sending message %u (key "
1718 "0x%x) to node %u\n", tmpret,
1719 DLM_ASSERT_MASTER_MSG, dlm->key, to);
1720 if (!dlm_is_host_down(tmpret)) {
1721 mlog(ML_ERROR, "unhandled error=%d!\n", tmpret);
1722 BUG();
1723 }
1724
1725 mlog(0, "link to %d went down!\n", to);
1726
1727 ret = tmpret;
1728 r = 0;
1729 } else if (r < 0) {
1730
1731 mlog(ML_ERROR,"during assert master of %.*s to %u, "
1732 "got %d.\n", namelen, lockname, to, r);
1733 spin_lock(&dlm->spinlock);
1734 spin_lock(&dlm->master_lock);
1735 if (dlm_find_mle(dlm, &mle, (char *)lockname,
1736 namelen)) {
1737 dlm_print_one_mle(mle);
1738 __dlm_put_mle(mle);
1739 }
1740 spin_unlock(&dlm->master_lock);
1741 spin_unlock(&dlm->spinlock);
1742 BUG();
1743 }
1744
1745 if (r & DLM_ASSERT_RESPONSE_REASSERT &&
1746 !(r & DLM_ASSERT_RESPONSE_MASTERY_REF)) {
1747 mlog(ML_ERROR, "%.*s: very strange, "
1748 "master MLE but no lockres on %u\n",
1749 namelen, lockname, to);
1750 }
1751
1752 if (r & DLM_ASSERT_RESPONSE_REASSERT) {
1753 mlog(0, "%.*s: node %u create mles on other "
1754 "nodes and requests a re-assert\n",
1755 namelen, lockname, to);
1756 reassert = 1;
1757 }
1758 if (r & DLM_ASSERT_RESPONSE_MASTERY_REF) {
1759 mlog(0, "%.*s: node %u has a reference to this "
1760 "lockres, set the bit in the refmap\n",
1761 namelen, lockname, to);
1762 spin_lock(&res->spinlock);
1763 dlm_lockres_set_refmap_bit(dlm, res, to);
1764 spin_unlock(&res->spinlock);
1765 }
1766 }
1767
1768 if (reassert)
1769 goto again;
1770
1771 spin_lock(&res->spinlock);
1772 res->state &= ~DLM_LOCK_RES_SETREF_INPROG;
1773 spin_unlock(&res->spinlock);
1774 wake_up(&res->wq);
1775
1776 return ret;
1777}
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788int dlm_assert_master_handler(struct o2net_msg *msg, u32 len, void *data,
1789 void **ret_data)
1790{
1791 struct dlm_ctxt *dlm = data;
1792 struct dlm_master_list_entry *mle = NULL;
1793 struct dlm_assert_master *assert = (struct dlm_assert_master *)msg->buf;
1794 struct dlm_lock_resource *res = NULL;
1795 char *name;
1796 unsigned int namelen, hash;
1797 u32 flags;
1798 int master_request = 0, have_lockres_ref = 0;
1799 int ret = 0;
1800
1801 if (!dlm_grab(dlm))
1802 return 0;
1803
1804 name = assert->name;
1805 namelen = assert->namelen;
1806 hash = dlm_lockid_hash(name, namelen);
1807 flags = be32_to_cpu(assert->flags);
1808
1809 if (namelen > DLM_LOCKID_NAME_MAX) {
1810 mlog(ML_ERROR, "Invalid name length!");
1811 goto done;
1812 }
1813
1814 spin_lock(&dlm->spinlock);
1815
1816 if (flags)
1817 mlog(0, "assert_master with flags: %u\n", flags);
1818
1819
1820 spin_lock(&dlm->master_lock);
1821 if (!dlm_find_mle(dlm, &mle, name, namelen)) {
1822
1823 mlog(0, "just got an assert_master from %u, but no "
1824 "MLE for it! (%.*s)\n", assert->node_idx,
1825 namelen, name);
1826 } else {
1827 int bit = find_next_bit (mle->maybe_map, O2NM_MAX_NODES, 0);
1828 if (bit >= O2NM_MAX_NODES) {
1829
1830
1831 mlog(0, "no bits set in the maybe_map, but %u "
1832 "is asserting! (%.*s)\n", assert->node_idx,
1833 namelen, name);
1834 } else if (bit != assert->node_idx) {
1835 if (flags & DLM_ASSERT_MASTER_MLE_CLEANUP) {
1836 mlog(0, "master %u was found, %u should "
1837 "back off\n", assert->node_idx, bit);
1838 } else {
1839
1840
1841
1842
1843 mlog(0, "%u is the lowest node, "
1844 "%u is asserting. (%.*s) %u must "
1845 "have begun after %u won.\n", bit,
1846 assert->node_idx, namelen, name, bit,
1847 assert->node_idx);
1848 }
1849 }
1850 if (mle->type == DLM_MLE_MIGRATION) {
1851 if (flags & DLM_ASSERT_MASTER_MLE_CLEANUP) {
1852 mlog(0, "%s:%.*s: got cleanup assert"
1853 " from %u for migration\n",
1854 dlm->name, namelen, name,
1855 assert->node_idx);
1856 } else if (!(flags & DLM_ASSERT_MASTER_FINISH_MIGRATION)) {
1857 mlog(0, "%s:%.*s: got unrelated assert"
1858 " from %u for migration, ignoring\n",
1859 dlm->name, namelen, name,
1860 assert->node_idx);
1861 __dlm_put_mle(mle);
1862 spin_unlock(&dlm->master_lock);
1863 spin_unlock(&dlm->spinlock);
1864 goto done;
1865 }
1866 }
1867 }
1868 spin_unlock(&dlm->master_lock);
1869
1870
1871
1872 res = __dlm_lookup_lockres(dlm, name, namelen, hash);
1873 if (res) {
1874 spin_lock(&res->spinlock);
1875 if (res->state & DLM_LOCK_RES_RECOVERING) {
1876 mlog(ML_ERROR, "%u asserting but %.*s is "
1877 "RECOVERING!\n", assert->node_idx, namelen, name);
1878 goto kill;
1879 }
1880 if (!mle) {
1881 if (res->owner != DLM_LOCK_RES_OWNER_UNKNOWN &&
1882 res->owner != assert->node_idx) {
1883 mlog(ML_ERROR, "DIE! Mastery assert from %u, "
1884 "but current owner is %u! (%.*s)\n",
1885 assert->node_idx, res->owner, namelen,
1886 name);
1887 __dlm_print_one_lock_resource(res);
1888 BUG();
1889 }
1890 } else if (mle->type != DLM_MLE_MIGRATION) {
1891 if (res->owner != DLM_LOCK_RES_OWNER_UNKNOWN) {
1892
1893 if (res->owner == assert->node_idx) {
1894 mlog(0, "owner %u re-asserting on "
1895 "lock %.*s\n", assert->node_idx,
1896 namelen, name);
1897 goto ok;
1898 }
1899 mlog(ML_ERROR, "got assert_master from "
1900 "node %u, but %u is the owner! "
1901 "(%.*s)\n", assert->node_idx,
1902 res->owner, namelen, name);
1903 goto kill;
1904 }
1905 if (!(res->state & DLM_LOCK_RES_IN_PROGRESS)) {
1906 mlog(ML_ERROR, "got assert from %u, but lock "
1907 "with no owner should be "
1908 "in-progress! (%.*s)\n",
1909 assert->node_idx,
1910 namelen, name);
1911 goto kill;
1912 }
1913 } else {
1914
1915 if (assert->node_idx != mle->new_master) {
1916 mlog(ML_ERROR, "got assert from %u, but "
1917 "new master is %u, and old master "
1918 "was %u (%.*s)\n",
1919 assert->node_idx, mle->new_master,
1920 mle->master, namelen, name);
1921 goto kill;
1922 }
1923
1924 }
1925ok:
1926 spin_unlock(&res->spinlock);
1927 }
1928
1929
1930
1931 if (mle) {
1932 int extra_ref = 0;
1933 int nn = -1;
1934 int rr, err = 0;
1935
1936 spin_lock(&mle->spinlock);
1937 if (mle->type == DLM_MLE_BLOCK || mle->type == DLM_MLE_MIGRATION)
1938 extra_ref = 1;
1939 else {
1940
1941
1942
1943 while ((nn = find_next_bit (mle->response_map, O2NM_MAX_NODES,
1944 nn+1)) < O2NM_MAX_NODES) {
1945 if (nn != dlm->node_num && nn != assert->node_idx) {
1946 master_request = 1;
1947 break;
1948 }
1949 }
1950 }
1951 mle->master = assert->node_idx;
1952 atomic_set(&mle->woken, 1);
1953 wake_up(&mle->wq);
1954 spin_unlock(&mle->spinlock);
1955
1956 if (res) {
1957 int wake = 0;
1958 spin_lock(&res->spinlock);
1959 if (mle->type == DLM_MLE_MIGRATION) {
1960 mlog(0, "finishing off migration of lockres %.*s, "
1961 "from %u to %u\n",
1962 res->lockname.len, res->lockname.name,
1963 dlm->node_num, mle->new_master);
1964 res->state &= ~DLM_LOCK_RES_MIGRATING;
1965 wake = 1;
1966 dlm_change_lockres_owner(dlm, res, mle->new_master);
1967 BUG_ON(res->state & DLM_LOCK_RES_DIRTY);
1968 } else {
1969 dlm_change_lockres_owner(dlm, res, mle->master);
1970 }
1971 spin_unlock(&res->spinlock);
1972 have_lockres_ref = 1;
1973 if (wake)
1974 wake_up(&res->wq);
1975 }
1976
1977
1978
1979
1980 spin_lock(&dlm->master_lock);
1981
1982 rr = kref_read(&mle->mle_refs);
1983 if (mle->inuse > 0) {
1984 if (extra_ref && rr < 3)
1985 err = 1;
1986 else if (!extra_ref && rr < 2)
1987 err = 1;
1988 } else {
1989 if (extra_ref && rr < 2)
1990 err = 1;
1991 else if (!extra_ref && rr < 1)
1992 err = 1;
1993 }
1994 if (err) {
1995 mlog(ML_ERROR, "%s:%.*s: got assert master from %u "
1996 "that will mess up this node, refs=%d, extra=%d, "
1997 "inuse=%d\n", dlm->name, namelen, name,
1998 assert->node_idx, rr, extra_ref, mle->inuse);
1999 dlm_print_one_mle(mle);
2000 }
2001 __dlm_unlink_mle(dlm, mle);
2002 __dlm_mle_detach_hb_events(dlm, mle);
2003 __dlm_put_mle(mle);
2004 if (extra_ref) {
2005
2006
2007
2008
2009 __dlm_put_mle(mle);
2010 }
2011 spin_unlock(&dlm->master_lock);
2012 } else if (res) {
2013 if (res->owner != assert->node_idx) {
2014 mlog(0, "assert_master from %u, but current "
2015 "owner is %u (%.*s), no mle\n", assert->node_idx,
2016 res->owner, namelen, name);
2017 }
2018 }
2019 spin_unlock(&dlm->spinlock);
2020
2021done:
2022 ret = 0;
2023 if (res) {
2024 spin_lock(&res->spinlock);
2025 res->state |= DLM_LOCK_RES_SETREF_INPROG;
2026 spin_unlock(&res->spinlock);
2027 *ret_data = (void *)res;
2028 }
2029 dlm_put(dlm);
2030 if (master_request) {
2031 mlog(0, "need to tell master to reassert\n");
2032
2033 ret |= DLM_ASSERT_RESPONSE_REASSERT;
2034 if (!have_lockres_ref) {
2035 mlog(ML_ERROR, "strange, got assert from %u, MASTER "
2036 "mle present here for %s:%.*s, but no lockres!\n",
2037 assert->node_idx, dlm->name, namelen, name);
2038 }
2039 }
2040 if (have_lockres_ref) {
2041
2042 ret |= DLM_ASSERT_RESPONSE_MASTERY_REF;
2043 mlog(0, "%s:%.*s: got assert from %u, need a ref\n",
2044 dlm->name, namelen, name, assert->node_idx);
2045 }
2046 return ret;
2047
2048kill:
2049
2050 mlog(ML_ERROR, "Bad message received from another node. Dumping state "
2051 "and killing the other node now! This node is OK and can continue.\n");
2052 __dlm_print_one_lock_resource(res);
2053 spin_unlock(&res->spinlock);
2054 spin_lock(&dlm->master_lock);
2055 if (mle)
2056 __dlm_put_mle(mle);
2057 spin_unlock(&dlm->master_lock);
2058 spin_unlock(&dlm->spinlock);
2059 *ret_data = (void *)res;
2060 dlm_put(dlm);
2061 return -EINVAL;
2062}
2063
2064void dlm_assert_master_post_handler(int status, void *data, void *ret_data)
2065{
2066 struct dlm_lock_resource *res = (struct dlm_lock_resource *)ret_data;
2067
2068 if (ret_data) {
2069 spin_lock(&res->spinlock);
2070 res->state &= ~DLM_LOCK_RES_SETREF_INPROG;
2071 spin_unlock(&res->spinlock);
2072 wake_up(&res->wq);
2073 dlm_lockres_put(res);
2074 }
2075 return;
2076}
2077
2078int dlm_dispatch_assert_master(struct dlm_ctxt *dlm,
2079 struct dlm_lock_resource *res,
2080 int ignore_higher, u8 request_from, u32 flags)
2081{
2082 struct dlm_work_item *item;
2083 item = kzalloc(sizeof(*item), GFP_ATOMIC);
2084 if (!item)
2085 return -ENOMEM;
2086
2087
2088
2089 dlm_init_work_item(dlm, item, dlm_assert_master_worker, NULL);
2090 item->u.am.lockres = res;
2091
2092 item->u.am.ignore_higher = ignore_higher;
2093 item->u.am.request_from = request_from;
2094 item->u.am.flags = flags;
2095
2096 if (ignore_higher)
2097 mlog(0, "IGNORE HIGHER: %.*s\n", res->lockname.len,
2098 res->lockname.name);
2099
2100 spin_lock(&dlm->work_lock);
2101 list_add_tail(&item->list, &dlm->work_list);
2102 spin_unlock(&dlm->work_lock);
2103
2104 queue_work(dlm->dlm_worker, &dlm->dispatched_work);
2105 return 0;
2106}
2107
2108static void dlm_assert_master_worker(struct dlm_work_item *item, void *data)
2109{
2110 struct dlm_ctxt *dlm = data;
2111 int ret = 0;
2112 struct dlm_lock_resource *res;
2113 unsigned long nodemap[BITS_TO_LONGS(O2NM_MAX_NODES)];
2114 int ignore_higher;
2115 int bit;
2116 u8 request_from;
2117 u32 flags;
2118
2119 dlm = item->dlm;
2120 res = item->u.am.lockres;
2121 ignore_higher = item->u.am.ignore_higher;
2122 request_from = item->u.am.request_from;
2123 flags = item->u.am.flags;
2124
2125 spin_lock(&dlm->spinlock);
2126 memcpy(nodemap, dlm->domain_map, sizeof(nodemap));
2127 spin_unlock(&dlm->spinlock);
2128
2129 clear_bit(dlm->node_num, nodemap);
2130 if (ignore_higher) {
2131
2132
2133
2134 clear_bit(request_from, nodemap);
2135 bit = dlm->node_num;
2136 while (1) {
2137 bit = find_next_bit(nodemap, O2NM_MAX_NODES,
2138 bit+1);
2139 if (bit >= O2NM_MAX_NODES)
2140 break;
2141 clear_bit(bit, nodemap);
2142 }
2143 }
2144
2145
2146
2147
2148
2149
2150
2151 spin_lock(&res->spinlock);
2152 if (res->state & DLM_LOCK_RES_MIGRATING) {
2153 mlog(0, "Someone asked us to assert mastery, but we're "
2154 "in the middle of migration. Skipping assert, "
2155 "the new master will handle that.\n");
2156 spin_unlock(&res->spinlock);
2157 goto put;
2158 } else
2159 __dlm_lockres_reserve_ast(res);
2160 spin_unlock(&res->spinlock);
2161
2162
2163
2164 mlog(0, "worker about to master %.*s here, this=%u\n",
2165 res->lockname.len, res->lockname.name, dlm->node_num);
2166 ret = dlm_do_assert_master(dlm, res, nodemap, flags);
2167 if (ret < 0) {
2168
2169 if (!dlm_is_host_down(ret))
2170 mlog_errno(ret);
2171 }
2172
2173
2174 dlm_lockres_release_ast(dlm, res);
2175
2176put:
2177 dlm_lockres_drop_inflight_worker(dlm, res);
2178
2179 dlm_lockres_put(res);
2180
2181 mlog(0, "finished with dlm_assert_master_worker\n");
2182}
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194static int dlm_pre_master_reco_lockres(struct dlm_ctxt *dlm,
2195 struct dlm_lock_resource *res)
2196{
2197 struct dlm_node_iter iter;
2198 int nodenum;
2199 int ret = 0;
2200 u8 master = DLM_LOCK_RES_OWNER_UNKNOWN;
2201
2202 spin_lock(&dlm->spinlock);
2203 dlm_node_iter_init(dlm->domain_map, &iter);
2204 spin_unlock(&dlm->spinlock);
2205
2206 while ((nodenum = dlm_node_iter_next(&iter)) >= 0) {
2207
2208 if (nodenum == dlm->node_num)
2209 continue;
2210 ret = dlm_do_master_requery(dlm, res, nodenum, &master);
2211 if (ret < 0) {
2212 mlog_errno(ret);
2213 if (!dlm_is_host_down(ret))
2214 BUG();
2215
2216
2217 ret = 0;
2218 }
2219
2220 if (master != DLM_LOCK_RES_OWNER_UNKNOWN) {
2221
2222 spin_lock(&dlm->spinlock);
2223 if (test_bit(master, dlm->recovery_map)) {
2224 mlog(ML_NOTICE, "%s: node %u has not seen "
2225 "node %u go down yet, and thinks the "
2226 "dead node is mastering the recovery "
2227 "lock. must wait.\n", dlm->name,
2228 nodenum, master);
2229 ret = -EAGAIN;
2230 }
2231 spin_unlock(&dlm->spinlock);
2232 mlog(0, "%s: reco lock master is %u\n", dlm->name,
2233 master);
2234 break;
2235 }
2236 }
2237 return ret;
2238}
2239
2240
2241
2242
2243
2244int dlm_drop_lockres_ref(struct dlm_ctxt *dlm, struct dlm_lock_resource *res)
2245{
2246 struct dlm_deref_lockres deref;
2247 int ret = 0, r;
2248 const char *lockname;
2249 unsigned int namelen;
2250
2251 lockname = res->lockname.name;
2252 namelen = res->lockname.len;
2253 BUG_ON(namelen > O2NM_MAX_NAME_LEN);
2254
2255 memset(&deref, 0, sizeof(deref));
2256 deref.node_idx = dlm->node_num;
2257 deref.namelen = namelen;
2258 memcpy(deref.name, lockname, namelen);
2259
2260 ret = o2net_send_message(DLM_DEREF_LOCKRES_MSG, dlm->key,
2261 &deref, sizeof(deref), res->owner, &r);
2262 if (ret < 0)
2263 mlog(ML_ERROR, "%s: res %.*s, error %d send DEREF to node %u\n",
2264 dlm->name, namelen, lockname, ret, res->owner);
2265 else if (r < 0) {
2266
2267 mlog(ML_ERROR, "%s: res %.*s, DEREF to node %u got %d\n",
2268 dlm->name, namelen, lockname, res->owner, r);
2269 dlm_print_one_lock_resource(res);
2270 if (r == -ENOMEM)
2271 BUG();
2272 } else
2273 ret = r;
2274
2275 return ret;
2276}
2277
2278int dlm_deref_lockres_handler(struct o2net_msg *msg, u32 len, void *data,
2279 void **ret_data)
2280{
2281 struct dlm_ctxt *dlm = data;
2282 struct dlm_deref_lockres *deref = (struct dlm_deref_lockres *)msg->buf;
2283 struct dlm_lock_resource *res = NULL;
2284 char *name;
2285 unsigned int namelen;
2286 int ret = -EINVAL;
2287 u8 node;
2288 unsigned int hash;
2289 struct dlm_work_item *item;
2290 int cleared = 0;
2291 int dispatch = 0;
2292
2293 if (!dlm_grab(dlm))
2294 return 0;
2295
2296 name = deref->name;
2297 namelen = deref->namelen;
2298 node = deref->node_idx;
2299
2300 if (namelen > DLM_LOCKID_NAME_MAX) {
2301 mlog(ML_ERROR, "Invalid name length!");
2302 goto done;
2303 }
2304 if (deref->node_idx >= O2NM_MAX_NODES) {
2305 mlog(ML_ERROR, "Invalid node number: %u\n", node);
2306 goto done;
2307 }
2308
2309 hash = dlm_lockid_hash(name, namelen);
2310
2311 spin_lock(&dlm->spinlock);
2312 res = __dlm_lookup_lockres_full(dlm, name, namelen, hash);
2313 if (!res) {
2314 spin_unlock(&dlm->spinlock);
2315 mlog(ML_ERROR, "%s:%.*s: bad lockres name\n",
2316 dlm->name, namelen, name);
2317 goto done;
2318 }
2319 spin_unlock(&dlm->spinlock);
2320
2321 spin_lock(&res->spinlock);
2322 if (res->state & DLM_LOCK_RES_SETREF_INPROG)
2323 dispatch = 1;
2324 else {
2325 BUG_ON(res->state & DLM_LOCK_RES_DROPPING_REF);
2326 if (test_bit(node, res->refmap)) {
2327 dlm_lockres_clear_refmap_bit(dlm, res, node);
2328 cleared = 1;
2329 }
2330 }
2331 spin_unlock(&res->spinlock);
2332
2333 if (!dispatch) {
2334 if (cleared)
2335 dlm_lockres_calc_usage(dlm, res);
2336 else {
2337 mlog(ML_ERROR, "%s:%.*s: node %u trying to drop ref "
2338 "but it is already dropped!\n", dlm->name,
2339 res->lockname.len, res->lockname.name, node);
2340 dlm_print_one_lock_resource(res);
2341 }
2342 ret = DLM_DEREF_RESPONSE_DONE;
2343 goto done;
2344 }
2345
2346 item = kzalloc(sizeof(*item), GFP_NOFS);
2347 if (!item) {
2348 ret = -ENOMEM;
2349 mlog_errno(ret);
2350 goto done;
2351 }
2352
2353 dlm_init_work_item(dlm, item, dlm_deref_lockres_worker, NULL);
2354 item->u.dl.deref_res = res;
2355 item->u.dl.deref_node = node;
2356
2357 spin_lock(&dlm->work_lock);
2358 list_add_tail(&item->list, &dlm->work_list);
2359 spin_unlock(&dlm->work_lock);
2360
2361 queue_work(dlm->dlm_worker, &dlm->dispatched_work);
2362 return DLM_DEREF_RESPONSE_INPROG;
2363
2364done:
2365 if (res)
2366 dlm_lockres_put(res);
2367 dlm_put(dlm);
2368
2369 return ret;
2370}
2371
2372int dlm_deref_lockres_done_handler(struct o2net_msg *msg, u32 len, void *data,
2373 void **ret_data)
2374{
2375 struct dlm_ctxt *dlm = data;
2376 struct dlm_deref_lockres_done *deref
2377 = (struct dlm_deref_lockres_done *)msg->buf;
2378 struct dlm_lock_resource *res = NULL;
2379 char *name;
2380 unsigned int namelen;
2381 int ret = -EINVAL;
2382 u8 node;
2383 unsigned int hash;
2384
2385 if (!dlm_grab(dlm))
2386 return 0;
2387
2388 name = deref->name;
2389 namelen = deref->namelen;
2390 node = deref->node_idx;
2391
2392 if (namelen > DLM_LOCKID_NAME_MAX) {
2393 mlog(ML_ERROR, "Invalid name length!");
2394 goto done;
2395 }
2396 if (deref->node_idx >= O2NM_MAX_NODES) {
2397 mlog(ML_ERROR, "Invalid node number: %u\n", node);
2398 goto done;
2399 }
2400
2401 hash = dlm_lockid_hash(name, namelen);
2402
2403 spin_lock(&dlm->spinlock);
2404 res = __dlm_lookup_lockres_full(dlm, name, namelen, hash);
2405 if (!res) {
2406 spin_unlock(&dlm->spinlock);
2407 mlog(ML_ERROR, "%s:%.*s: bad lockres name\n",
2408 dlm->name, namelen, name);
2409 goto done;
2410 }
2411
2412 spin_lock(&res->spinlock);
2413 if (!(res->state & DLM_LOCK_RES_DROPPING_REF)) {
2414 spin_unlock(&res->spinlock);
2415 spin_unlock(&dlm->spinlock);
2416 mlog(ML_NOTICE, "%s:%.*s: node %u sends deref done "
2417 "but it is already derefed!\n", dlm->name,
2418 res->lockname.len, res->lockname.name, node);
2419 ret = 0;
2420 goto done;
2421 }
2422
2423 __dlm_do_purge_lockres(dlm, res);
2424 spin_unlock(&res->spinlock);
2425 wake_up(&res->wq);
2426
2427 spin_unlock(&dlm->spinlock);
2428
2429 ret = 0;
2430done:
2431 if (res)
2432 dlm_lockres_put(res);
2433 dlm_put(dlm);
2434 return ret;
2435}
2436
2437static void dlm_drop_lockres_ref_done(struct dlm_ctxt *dlm,
2438 struct dlm_lock_resource *res, u8 node)
2439{
2440 struct dlm_deref_lockres_done deref;
2441 int ret = 0, r;
2442 const char *lockname;
2443 unsigned int namelen;
2444
2445 lockname = res->lockname.name;
2446 namelen = res->lockname.len;
2447 BUG_ON(namelen > O2NM_MAX_NAME_LEN);
2448
2449 memset(&deref, 0, sizeof(deref));
2450 deref.node_idx = dlm->node_num;
2451 deref.namelen = namelen;
2452 memcpy(deref.name, lockname, namelen);
2453
2454 ret = o2net_send_message(DLM_DEREF_LOCKRES_DONE, dlm->key,
2455 &deref, sizeof(deref), node, &r);
2456 if (ret < 0) {
2457 mlog(ML_ERROR, "%s: res %.*s, error %d send DEREF DONE "
2458 " to node %u\n", dlm->name, namelen,
2459 lockname, ret, node);
2460 } else if (r < 0) {
2461
2462 mlog(ML_ERROR, "%s: res %.*s, DEREF to node %u got %d\n",
2463 dlm->name, namelen, lockname, node, r);
2464 dlm_print_one_lock_resource(res);
2465 }
2466}
2467
2468static void dlm_deref_lockres_worker(struct dlm_work_item *item, void *data)
2469{
2470 struct dlm_ctxt *dlm;
2471 struct dlm_lock_resource *res;
2472 u8 node;
2473 u8 cleared = 0;
2474
2475 dlm = item->dlm;
2476 res = item->u.dl.deref_res;
2477 node = item->u.dl.deref_node;
2478
2479 spin_lock(&res->spinlock);
2480 BUG_ON(res->state & DLM_LOCK_RES_DROPPING_REF);
2481 __dlm_wait_on_lockres_flags(res, DLM_LOCK_RES_SETREF_INPROG);
2482 if (test_bit(node, res->refmap)) {
2483 dlm_lockres_clear_refmap_bit(dlm, res, node);
2484 cleared = 1;
2485 }
2486 spin_unlock(&res->spinlock);
2487
2488 dlm_drop_lockres_ref_done(dlm, res, node);
2489
2490 if (cleared) {
2491 mlog(0, "%s:%.*s node %u ref dropped in dispatch\n",
2492 dlm->name, res->lockname.len, res->lockname.name, node);
2493 dlm_lockres_calc_usage(dlm, res);
2494 } else {
2495 mlog(ML_ERROR, "%s:%.*s: node %u trying to drop ref "
2496 "but it is already dropped!\n", dlm->name,
2497 res->lockname.len, res->lockname.name, node);
2498 dlm_print_one_lock_resource(res);
2499 }
2500
2501 dlm_lockres_put(res);
2502}
2503
2504
2505
2506
2507
2508
2509
2510
2511static int dlm_is_lockres_migrateable(struct dlm_ctxt *dlm,
2512 struct dlm_lock_resource *res)
2513{
2514 enum dlm_lockres_list idx;
2515 int nonlocal = 0, node_ref;
2516 struct list_head *queue;
2517 struct dlm_lock *lock;
2518 u64 cookie;
2519
2520 assert_spin_locked(&res->spinlock);
2521
2522
2523 if (res->state & DLM_LOCK_RES_MIGRATING)
2524 return 0;
2525
2526
2527 if (res->state & (DLM_LOCK_RES_RECOVERING|
2528 DLM_LOCK_RES_RECOVERY_WAITING))
2529 return 0;
2530
2531 if (res->owner != dlm->node_num)
2532 return 0;
2533
2534 for (idx = DLM_GRANTED_LIST; idx <= DLM_BLOCKED_LIST; idx++) {
2535 queue = dlm_list_idx_to_ptr(res, idx);
2536 list_for_each_entry(lock, queue, list) {
2537 if (lock->ml.node != dlm->node_num) {
2538 nonlocal++;
2539 continue;
2540 }
2541 cookie = be64_to_cpu(lock->ml.cookie);
2542 mlog(0, "%s: Not migrateable res %.*s, lock %u:%llu on "
2543 "%s list\n", dlm->name, res->lockname.len,
2544 res->lockname.name,
2545 dlm_get_lock_cookie_node(cookie),
2546 dlm_get_lock_cookie_seq(cookie),
2547 dlm_list_in_text(idx));
2548 return 0;
2549 }
2550 }
2551
2552 if (!nonlocal) {
2553 node_ref = find_next_bit(res->refmap, O2NM_MAX_NODES, 0);
2554 if (node_ref >= O2NM_MAX_NODES)
2555 return 0;
2556 }
2557
2558 mlog(0, "%s: res %.*s, Migrateable\n", dlm->name, res->lockname.len,
2559 res->lockname.name);
2560
2561 return 1;
2562}
2563
2564
2565
2566
2567
2568
2569static int dlm_migrate_lockres(struct dlm_ctxt *dlm,
2570 struct dlm_lock_resource *res, u8 target)
2571{
2572 struct dlm_master_list_entry *mle = NULL;
2573 struct dlm_master_list_entry *oldmle = NULL;
2574 struct dlm_migratable_lockres *mres = NULL;
2575 int ret = 0;
2576 const char *name;
2577 unsigned int namelen;
2578 int mle_added = 0;
2579 int wake = 0;
2580
2581 if (!dlm_grab(dlm))
2582 return -EINVAL;
2583
2584 BUG_ON(target == O2NM_MAX_NODES);
2585
2586 name = res->lockname.name;
2587 namelen = res->lockname.len;
2588
2589 mlog(0, "%s: Migrating %.*s to node %u\n", dlm->name, namelen, name,
2590 target);
2591
2592
2593 ret = -ENOMEM;
2594 mres = (struct dlm_migratable_lockres *) __get_free_page(GFP_NOFS);
2595 if (!mres) {
2596 mlog_errno(ret);
2597 goto leave;
2598 }
2599
2600 mle = kmem_cache_alloc(dlm_mle_cache, GFP_NOFS);
2601 if (!mle) {
2602 mlog_errno(ret);
2603 goto leave;
2604 }
2605 ret = 0;
2606
2607
2608
2609
2610
2611 spin_lock(&dlm->spinlock);
2612 spin_lock(&dlm->master_lock);
2613 ret = dlm_add_migration_mle(dlm, res, mle, &oldmle, name,
2614 namelen, target, dlm->node_num);
2615
2616
2617
2618
2619 if (ret != -EEXIST)
2620 dlm_get_mle_inuse(mle);
2621
2622 spin_unlock(&dlm->master_lock);
2623 spin_unlock(&dlm->spinlock);
2624
2625 if (ret == -EEXIST) {
2626 mlog(0, "another process is already migrating it\n");
2627 goto fail;
2628 }
2629 mle_added = 1;
2630
2631
2632
2633
2634
2635 if (dlm_mark_lockres_migrating(dlm, res, target) < 0) {
2636 mlog(ML_ERROR, "tried to migrate %.*s to %u, but "
2637 "the target went down.\n", res->lockname.len,
2638 res->lockname.name, target);
2639 spin_lock(&res->spinlock);
2640 res->state &= ~DLM_LOCK_RES_MIGRATING;
2641 wake = 1;
2642 spin_unlock(&res->spinlock);
2643 ret = -EINVAL;
2644 }
2645
2646fail:
2647 if (ret != -EEXIST && oldmle) {
2648
2649 dlm_mle_detach_hb_events(dlm, oldmle);
2650 dlm_put_mle(oldmle);
2651 }
2652
2653 if (ret < 0) {
2654 if (mle_added) {
2655 dlm_mle_detach_hb_events(dlm, mle);
2656 dlm_put_mle(mle);
2657 dlm_put_mle_inuse(mle);
2658 } else if (mle) {
2659 kmem_cache_free(dlm_mle_cache, mle);
2660 mle = NULL;
2661 }
2662 goto leave;
2663 }
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673 flush_workqueue(dlm->dlm_worker);
2674
2675
2676
2677
2678
2679 ret = dlm_send_one_lockres(dlm, res, mres, target,
2680 DLM_MRES_MIGRATION);
2681
2682 if (ret < 0) {
2683 mlog(0, "migration to node %u failed with %d\n",
2684 target, ret);
2685
2686 dlm_mle_detach_hb_events(dlm, mle);
2687 dlm_put_mle(mle);
2688 dlm_put_mle_inuse(mle);
2689 spin_lock(&res->spinlock);
2690 res->state &= ~DLM_LOCK_RES_MIGRATING;
2691 wake = 1;
2692 spin_unlock(&res->spinlock);
2693 if (dlm_is_host_down(ret))
2694 dlm_wait_for_node_death(dlm, target,
2695 DLM_NODE_DEATH_WAIT_MAX);
2696 goto leave;
2697 }
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711 while (1) {
2712 ret = wait_event_interruptible_timeout(mle->wq,
2713 (atomic_read(&mle->woken) == 1),
2714 msecs_to_jiffies(5000));
2715
2716 if (ret >= 0) {
2717 if (atomic_read(&mle->woken) == 1 ||
2718 res->owner == target)
2719 break;
2720
2721 mlog(0, "%s:%.*s: timed out during migration\n",
2722 dlm->name, res->lockname.len, res->lockname.name);
2723
2724
2725 if (dlm_is_node_dead(dlm, target)) {
2726 mlog(0, "%s:%.*s: expected migration "
2727 "target %u is no longer up, restarting\n",
2728 dlm->name, res->lockname.len,
2729 res->lockname.name, target);
2730 ret = -EINVAL;
2731
2732 dlm_mle_detach_hb_events(dlm, mle);
2733 dlm_put_mle(mle);
2734 dlm_put_mle_inuse(mle);
2735 spin_lock(&res->spinlock);
2736 res->state &= ~DLM_LOCK_RES_MIGRATING;
2737 wake = 1;
2738 spin_unlock(&res->spinlock);
2739 goto leave;
2740 }
2741 } else
2742 mlog(0, "%s:%.*s: caught signal during migration\n",
2743 dlm->name, res->lockname.len, res->lockname.name);
2744 }
2745
2746
2747 spin_lock(&res->spinlock);
2748 dlm_set_lockres_owner(dlm, res, target);
2749 res->state &= ~DLM_LOCK_RES_MIGRATING;
2750 dlm_remove_nonlocal_locks(dlm, res);
2751 spin_unlock(&res->spinlock);
2752 wake_up(&res->wq);
2753
2754
2755 dlm_mle_detach_hb_events(dlm, mle);
2756 dlm_put_mle_inuse(mle);
2757 ret = 0;
2758
2759 dlm_lockres_calc_usage(dlm, res);
2760
2761leave:
2762
2763 if (ret < 0)
2764 dlm_kick_thread(dlm, res);
2765
2766
2767
2768 if (wake)
2769 wake_up(&res->wq);
2770
2771 if (mres)
2772 free_page((unsigned long)mres);
2773
2774 dlm_put(dlm);
2775
2776 mlog(0, "%s: Migrating %.*s to %u, returns %d\n", dlm->name, namelen,
2777 name, target, ret);
2778 return ret;
2779}
2780
2781#define DLM_MIGRATION_RETRY_MS 100
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793int dlm_empty_lockres(struct dlm_ctxt *dlm, struct dlm_lock_resource *res)
2794{
2795 int ret;
2796 int lock_dropped = 0;
2797 u8 target = O2NM_MAX_NODES;
2798
2799 assert_spin_locked(&dlm->spinlock);
2800
2801 spin_lock(&res->spinlock);
2802 if (dlm_is_lockres_migrateable(dlm, res))
2803 target = dlm_pick_migration_target(dlm, res);
2804 spin_unlock(&res->spinlock);
2805
2806 if (target == O2NM_MAX_NODES)
2807 goto leave;
2808
2809
2810 spin_unlock(&dlm->spinlock);
2811 lock_dropped = 1;
2812 ret = dlm_migrate_lockres(dlm, res, target);
2813 if (ret)
2814 mlog(0, "%s: res %.*s, Migrate to node %u failed with %d\n",
2815 dlm->name, res->lockname.len, res->lockname.name,
2816 target, ret);
2817 spin_lock(&dlm->spinlock);
2818leave:
2819 return lock_dropped;
2820}
2821
2822int dlm_lock_basts_flushed(struct dlm_ctxt *dlm, struct dlm_lock *lock)
2823{
2824 int ret;
2825 spin_lock(&dlm->ast_lock);
2826 spin_lock(&lock->spinlock);
2827 ret = (list_empty(&lock->bast_list) && !lock->bast_pending);
2828 spin_unlock(&lock->spinlock);
2829 spin_unlock(&dlm->ast_lock);
2830 return ret;
2831}
2832
2833static int dlm_migration_can_proceed(struct dlm_ctxt *dlm,
2834 struct dlm_lock_resource *res,
2835 u8 mig_target)
2836{
2837 int can_proceed;
2838 spin_lock(&res->spinlock);
2839 can_proceed = !!(res->state & DLM_LOCK_RES_MIGRATING);
2840 spin_unlock(&res->spinlock);
2841
2842
2843
2844 spin_lock(&dlm->spinlock);
2845 if (!test_bit(mig_target, dlm->domain_map))
2846 can_proceed = 1;
2847 spin_unlock(&dlm->spinlock);
2848 return can_proceed;
2849}
2850
2851static int dlm_lockres_is_dirty(struct dlm_ctxt *dlm,
2852 struct dlm_lock_resource *res)
2853{
2854 int ret;
2855 spin_lock(&res->spinlock);
2856 ret = !!(res->state & DLM_LOCK_RES_DIRTY);
2857 spin_unlock(&res->spinlock);
2858 return ret;
2859}
2860
2861
2862static int dlm_mark_lockres_migrating(struct dlm_ctxt *dlm,
2863 struct dlm_lock_resource *res,
2864 u8 target)
2865{
2866 int ret = 0;
2867
2868 mlog(0, "dlm_mark_lockres_migrating: %.*s, from %u to %u\n",
2869 res->lockname.len, res->lockname.name, dlm->node_num,
2870 target);
2871
2872
2873 spin_lock(&res->spinlock);
2874 BUG_ON(res->migration_pending);
2875 res->migration_pending = 1;
2876
2877
2878 __dlm_lockres_reserve_ast(res);
2879 spin_unlock(&res->spinlock);
2880
2881
2882 dlm_kick_thread(dlm, res);
2883
2884
2885 spin_lock(&res->spinlock);
2886 BUG_ON(res->state & DLM_LOCK_RES_BLOCK_DIRTY);
2887 res->state |= DLM_LOCK_RES_BLOCK_DIRTY;
2888 spin_unlock(&res->spinlock);
2889
2890 wait_event(dlm->ast_wq, !dlm_lockres_is_dirty(dlm, res));
2891 dlm_lockres_release_ast(dlm, res);
2892
2893 mlog(0, "about to wait on migration_wq, dirty=%s\n",
2894 res->state & DLM_LOCK_RES_DIRTY ? "yes" : "no");
2895
2896
2897
2898again:
2899 ret = wait_event_interruptible_timeout(dlm->migration_wq,
2900 dlm_migration_can_proceed(dlm, res, target),
2901 msecs_to_jiffies(1000));
2902 if (ret < 0) {
2903 mlog(0, "woken again: migrating? %s, dead? %s\n",
2904 res->state & DLM_LOCK_RES_MIGRATING ? "yes":"no",
2905 test_bit(target, dlm->domain_map) ? "no":"yes");
2906 } else {
2907 mlog(0, "all is well: migrating? %s, dead? %s\n",
2908 res->state & DLM_LOCK_RES_MIGRATING ? "yes":"no",
2909 test_bit(target, dlm->domain_map) ? "no":"yes");
2910 }
2911 if (!dlm_migration_can_proceed(dlm, res, target)) {
2912 mlog(0, "trying again...\n");
2913 goto again;
2914 }
2915
2916 ret = 0;
2917
2918 spin_lock(&dlm->spinlock);
2919 if (!test_bit(target, dlm->domain_map)) {
2920 mlog(ML_ERROR, "aha. migration target %u just went down\n",
2921 target);
2922 ret = -EHOSTDOWN;
2923 }
2924 spin_unlock(&dlm->spinlock);
2925
2926
2927
2928
2929
2930
2931 spin_lock(&res->spinlock);
2932 BUG_ON(!(res->state & DLM_LOCK_RES_BLOCK_DIRTY));
2933 res->state &= ~DLM_LOCK_RES_BLOCK_DIRTY;
2934 if (!ret)
2935 BUG_ON(!(res->state & DLM_LOCK_RES_MIGRATING));
2936 else
2937 res->migration_pending = 0;
2938 spin_unlock(&res->spinlock);
2939
2940
2941
2942
2943
2944
2945
2946
2947
2948 return ret;
2949}
2950
2951
2952
2953
2954static void dlm_remove_nonlocal_locks(struct dlm_ctxt *dlm,
2955 struct dlm_lock_resource *res)
2956{
2957 struct list_head *queue = &res->granted;
2958 int i, bit;
2959 struct dlm_lock *lock, *next;
2960
2961 assert_spin_locked(&res->spinlock);
2962
2963 BUG_ON(res->owner == dlm->node_num);
2964
2965 for (i=0; i<3; i++) {
2966 list_for_each_entry_safe(lock, next, queue, list) {
2967 if (lock->ml.node != dlm->node_num) {
2968 mlog(0, "putting lock for node %u\n",
2969 lock->ml.node);
2970
2971 BUG_ON(!list_empty(&lock->ast_list));
2972 BUG_ON(!list_empty(&lock->bast_list));
2973 BUG_ON(lock->ast_pending);
2974 BUG_ON(lock->bast_pending);
2975 dlm_lockres_clear_refmap_bit(dlm, res,
2976 lock->ml.node);
2977 list_del_init(&lock->list);
2978 dlm_lock_put(lock);
2979
2980
2981 dlm_lock_put(lock);
2982 }
2983 }
2984 queue++;
2985 }
2986 bit = 0;
2987 while (1) {
2988 bit = find_next_bit(res->refmap, O2NM_MAX_NODES, bit);
2989 if (bit >= O2NM_MAX_NODES)
2990 break;
2991
2992
2993 if (bit != dlm->node_num) {
2994 mlog(0, "%s:%.*s: node %u had a ref to this "
2995 "migrating lockres, clearing\n", dlm->name,
2996 res->lockname.len, res->lockname.name, bit);
2997 dlm_lockres_clear_refmap_bit(dlm, res, bit);
2998 }
2999 bit++;
3000 }
3001}
3002
3003
3004
3005
3006
3007
3008static u8 dlm_pick_migration_target(struct dlm_ctxt *dlm,
3009 struct dlm_lock_resource *res)
3010{
3011 enum dlm_lockres_list idx;
3012 struct list_head *queue = &res->granted;
3013 struct dlm_lock *lock;
3014 int noderef;
3015 u8 nodenum = O2NM_MAX_NODES;
3016
3017 assert_spin_locked(&dlm->spinlock);
3018 assert_spin_locked(&res->spinlock);
3019
3020
3021 for (idx = DLM_GRANTED_LIST; idx <= DLM_BLOCKED_LIST; idx++) {
3022 queue = dlm_list_idx_to_ptr(res, idx);
3023 list_for_each_entry(lock, queue, list) {
3024 if (lock->ml.node == dlm->node_num)
3025 continue;
3026 if (test_bit(lock->ml.node, dlm->exit_domain_map))
3027 continue;
3028 nodenum = lock->ml.node;
3029 goto bail;
3030 }
3031 }
3032
3033
3034 noderef = -1;
3035 while (1) {
3036 noderef = find_next_bit(res->refmap, O2NM_MAX_NODES,
3037 noderef + 1);
3038 if (noderef >= O2NM_MAX_NODES)
3039 break;
3040 if (noderef == dlm->node_num)
3041 continue;
3042 if (test_bit(noderef, dlm->exit_domain_map))
3043 continue;
3044 nodenum = noderef;
3045 goto bail;
3046 }
3047
3048bail:
3049 return nodenum;
3050}
3051
3052
3053
3054static int dlm_do_migrate_request(struct dlm_ctxt *dlm,
3055 struct dlm_lock_resource *res,
3056 u8 master, u8 new_master,
3057 struct dlm_node_iter *iter)
3058{
3059 struct dlm_migrate_request migrate;
3060 int ret, skip, status = 0;
3061 int nodenum;
3062
3063 memset(&migrate, 0, sizeof(migrate));
3064 migrate.namelen = res->lockname.len;
3065 memcpy(migrate.name, res->lockname.name, migrate.namelen);
3066 migrate.new_master = new_master;
3067 migrate.master = master;
3068
3069 ret = 0;
3070
3071
3072 while ((nodenum = dlm_node_iter_next(iter)) >= 0) {
3073 if (nodenum == master ||
3074 nodenum == new_master)
3075 continue;
3076
3077
3078 spin_lock(&dlm->spinlock);
3079 skip = (!test_bit(nodenum, dlm->domain_map));
3080 spin_unlock(&dlm->spinlock);
3081 if (skip) {
3082 clear_bit(nodenum, iter->node_map);
3083 continue;
3084 }
3085
3086 ret = o2net_send_message(DLM_MIGRATE_REQUEST_MSG, dlm->key,
3087 &migrate, sizeof(migrate), nodenum,
3088 &status);
3089 if (ret < 0) {
3090 mlog(ML_ERROR, "%s: res %.*s, Error %d send "
3091 "MIGRATE_REQUEST to node %u\n", dlm->name,
3092 migrate.namelen, migrate.name, ret, nodenum);
3093 if (!dlm_is_host_down(ret)) {
3094 mlog(ML_ERROR, "unhandled error=%d!\n", ret);
3095 BUG();
3096 }
3097 clear_bit(nodenum, iter->node_map);
3098 ret = 0;
3099 } else if (status < 0) {
3100 mlog(0, "migrate request (node %u) returned %d!\n",
3101 nodenum, status);
3102 ret = status;
3103 } else if (status == DLM_MIGRATE_RESPONSE_MASTERY_REF) {
3104
3105
3106
3107 mlog(0, "%s:%.*s: need ref for node %u\n",
3108 dlm->name, res->lockname.len, res->lockname.name,
3109 nodenum);
3110 spin_lock(&res->spinlock);
3111 dlm_lockres_set_refmap_bit(dlm, res, nodenum);
3112 spin_unlock(&res->spinlock);
3113 }
3114 }
3115
3116 if (ret < 0)
3117 mlog_errno(ret);
3118
3119 mlog(0, "returning ret=%d\n", ret);
3120 return ret;
3121}
3122
3123
3124
3125
3126
3127
3128
3129
3130
3131int dlm_migrate_request_handler(struct o2net_msg *msg, u32 len, void *data,
3132 void **ret_data)
3133{
3134 struct dlm_ctxt *dlm = data;
3135 struct dlm_lock_resource *res = NULL;
3136 struct dlm_migrate_request *migrate = (struct dlm_migrate_request *) msg->buf;
3137 struct dlm_master_list_entry *mle = NULL, *oldmle = NULL;
3138 const char *name;
3139 unsigned int namelen, hash;
3140 int ret = 0;
3141
3142 if (!dlm_grab(dlm))
3143 return 0;
3144
3145 name = migrate->name;
3146 namelen = migrate->namelen;
3147 hash = dlm_lockid_hash(name, namelen);
3148
3149
3150 mle = kmem_cache_alloc(dlm_mle_cache, GFP_NOFS);
3151
3152 if (!mle) {
3153 ret = -ENOMEM;
3154 goto leave;
3155 }
3156
3157
3158 spin_lock(&dlm->spinlock);
3159 res = __dlm_lookup_lockres(dlm, name, namelen, hash);
3160 if (res) {
3161 spin_lock(&res->spinlock);
3162 if (res->state & DLM_LOCK_RES_RECOVERING) {
3163
3164
3165
3166 spin_unlock(&res->spinlock);
3167 mlog(ML_ERROR, "Got a migrate request, but the "
3168 "lockres is marked as recovering!");
3169 kmem_cache_free(dlm_mle_cache, mle);
3170 ret = -EINVAL;
3171 goto unlock;
3172 }
3173 res->state |= DLM_LOCK_RES_MIGRATING;
3174 spin_unlock(&res->spinlock);
3175 }
3176
3177 spin_lock(&dlm->master_lock);
3178
3179 ret = dlm_add_migration_mle(dlm, res, mle, &oldmle,
3180 name, namelen,
3181 migrate->new_master,
3182 migrate->master);
3183
3184 if (ret < 0)
3185 kmem_cache_free(dlm_mle_cache, mle);
3186
3187 spin_unlock(&dlm->master_lock);
3188unlock:
3189 spin_unlock(&dlm->spinlock);
3190
3191 if (oldmle) {
3192
3193 dlm_mle_detach_hb_events(dlm, oldmle);
3194 dlm_put_mle(oldmle);
3195 }
3196
3197 if (res)
3198 dlm_lockres_put(res);
3199leave:
3200 dlm_put(dlm);
3201 return ret;
3202}
3203
3204
3205
3206
3207
3208
3209
3210
3211static int dlm_add_migration_mle(struct dlm_ctxt *dlm,
3212 struct dlm_lock_resource *res,
3213 struct dlm_master_list_entry *mle,
3214 struct dlm_master_list_entry **oldmle,
3215 const char *name, unsigned int namelen,
3216 u8 new_master, u8 master)
3217{
3218 int found;
3219 int ret = 0;
3220
3221 *oldmle = NULL;
3222
3223 assert_spin_locked(&dlm->spinlock);
3224 assert_spin_locked(&dlm->master_lock);
3225
3226
3227 found = dlm_find_mle(dlm, oldmle, (char *)name, namelen);
3228 if (found) {
3229 struct dlm_master_list_entry *tmp = *oldmle;
3230 spin_lock(&tmp->spinlock);
3231 if (tmp->type == DLM_MLE_MIGRATION) {
3232 if (master == dlm->node_num) {
3233
3234 mlog(0, "tried to migrate %.*s, but some "
3235 "process beat me to it\n",
3236 namelen, name);
3237 spin_unlock(&tmp->spinlock);
3238 return -EEXIST;
3239 } else {
3240
3241 mlog(ML_ERROR, "migration error mle: "
3242 "master=%u new_master=%u // request: "
3243 "master=%u new_master=%u // "
3244 "lockres=%.*s\n",
3245 tmp->master, tmp->new_master,
3246 master, new_master,
3247 namelen, name);
3248 BUG();
3249 }
3250 } else {
3251
3252 tmp->master = master;
3253 atomic_set(&tmp->woken, 1);
3254 wake_up(&tmp->wq);
3255
3256 __dlm_unlink_mle(dlm, tmp);
3257 __dlm_mle_detach_hb_events(dlm, tmp);
3258 if (tmp->type == DLM_MLE_MASTER) {
3259 ret = DLM_MIGRATE_RESPONSE_MASTERY_REF;
3260 mlog(0, "%s:%.*s: master=%u, newmaster=%u, "
3261 "telling master to get ref "
3262 "for cleared out mle during "
3263 "migration\n", dlm->name,
3264 namelen, name, master,
3265 new_master);
3266 }
3267 }
3268 spin_unlock(&tmp->spinlock);
3269 }
3270
3271
3272 dlm_init_mle(mle, DLM_MLE_MIGRATION, dlm, res, name, namelen);
3273 mle->new_master = new_master;
3274
3275
3276 mle->master = master;
3277
3278 set_bit(new_master, mle->maybe_map);
3279 __dlm_insert_mle(dlm, mle);
3280
3281 return ret;
3282}
3283
3284
3285
3286
3287static struct dlm_lock_resource *dlm_reset_mleres_owner(struct dlm_ctxt *dlm,
3288 struct dlm_master_list_entry *mle)
3289{
3290 struct dlm_lock_resource *res;
3291
3292
3293 res = __dlm_lookup_lockres(dlm, mle->mname, mle->mnamelen,
3294 mle->mnamehash);
3295 if (res) {
3296 spin_unlock(&dlm->master_lock);
3297
3298
3299 spin_lock(&res->spinlock);
3300 dlm_set_lockres_owner(dlm, res, DLM_LOCK_RES_OWNER_UNKNOWN);
3301 dlm_move_lockres_to_recovery_list(dlm, res);
3302 spin_unlock(&res->spinlock);
3303 dlm_lockres_put(res);
3304
3305
3306 __dlm_mle_detach_hb_events(dlm, mle);
3307
3308
3309 spin_lock(&dlm->master_lock);
3310 __dlm_put_mle(mle);
3311 spin_unlock(&dlm->master_lock);
3312 }
3313
3314 return res;
3315}
3316
3317static void dlm_clean_migration_mle(struct dlm_ctxt *dlm,
3318 struct dlm_master_list_entry *mle)
3319{
3320 __dlm_mle_detach_hb_events(dlm, mle);
3321
3322 spin_lock(&mle->spinlock);
3323 __dlm_unlink_mle(dlm, mle);
3324 atomic_set(&mle->woken, 1);
3325 spin_unlock(&mle->spinlock);
3326
3327 wake_up(&mle->wq);
3328}
3329
3330static void dlm_clean_block_mle(struct dlm_ctxt *dlm,
3331 struct dlm_master_list_entry *mle, u8 dead_node)
3332{
3333 int bit;
3334
3335 BUG_ON(mle->type != DLM_MLE_BLOCK);
3336
3337 spin_lock(&mle->spinlock);
3338 bit = find_next_bit(mle->maybe_map, O2NM_MAX_NODES, 0);
3339 if (bit != dead_node) {
3340 mlog(0, "mle found, but dead node %u would not have been "
3341 "master\n", dead_node);
3342 spin_unlock(&mle->spinlock);
3343 } else {
3344
3345
3346
3347
3348 mlog(0, "node %u was expected master\n", dead_node);
3349 atomic_set(&mle->woken, 1);
3350 spin_unlock(&mle->spinlock);
3351 wake_up(&mle->wq);
3352
3353
3354 __dlm_mle_detach_hb_events(dlm, mle);
3355 __dlm_put_mle(mle);
3356 }
3357}
3358
3359void dlm_clean_master_list(struct dlm_ctxt *dlm, u8 dead_node)
3360{
3361 struct dlm_master_list_entry *mle;
3362 struct dlm_lock_resource *res;
3363 struct hlist_head *bucket;
3364 struct hlist_node *tmp;
3365 unsigned int i;
3366
3367 mlog(0, "dlm=%s, dead node=%u\n", dlm->name, dead_node);
3368top:
3369 assert_spin_locked(&dlm->spinlock);
3370
3371
3372 spin_lock(&dlm->master_lock);
3373 for (i = 0; i < DLM_HASH_BUCKETS; i++) {
3374 bucket = dlm_master_hash(dlm, i);
3375 hlist_for_each_entry_safe(mle, tmp, bucket, master_hash_node) {
3376 BUG_ON(mle->type != DLM_MLE_BLOCK &&
3377 mle->type != DLM_MLE_MASTER &&
3378 mle->type != DLM_MLE_MIGRATION);
3379
3380
3381
3382
3383 if (mle->type == DLM_MLE_MASTER)
3384 continue;
3385
3386
3387
3388
3389 if (mle->type == DLM_MLE_BLOCK) {
3390 dlm_clean_block_mle(dlm, mle, dead_node);
3391 continue;
3392 }
3393
3394
3395
3396
3397
3398
3399
3400
3401
3402
3403
3404
3405 if (mle->master != dead_node &&
3406 mle->new_master != dead_node)
3407 continue;
3408
3409 if (mle->new_master == dead_node && mle->inuse) {
3410 mlog(ML_NOTICE, "%s: target %u died during "
3411 "migration from %u, the MLE is "
3412 "still keep used, ignore it!\n",
3413 dlm->name, dead_node,
3414 mle->master);
3415 continue;
3416 }
3417
3418
3419
3420 dlm_clean_migration_mle(dlm, mle);
3421
3422 mlog(0, "%s: node %u died during migration from "
3423 "%u to %u!\n", dlm->name, dead_node, mle->master,
3424 mle->new_master);
3425
3426
3427
3428
3429
3430
3431 res = dlm_reset_mleres_owner(dlm, mle);
3432 if (res)
3433
3434 goto top;
3435
3436
3437 __dlm_put_mle(mle);
3438 }
3439 }
3440 spin_unlock(&dlm->master_lock);
3441}
3442
3443int dlm_finish_migration(struct dlm_ctxt *dlm, struct dlm_lock_resource *res,
3444 u8 old_master)
3445{
3446 struct dlm_node_iter iter;
3447 int ret = 0;
3448
3449 spin_lock(&dlm->spinlock);
3450 dlm_node_iter_init(dlm->domain_map, &iter);
3451 clear_bit(old_master, iter.node_map);
3452 clear_bit(dlm->node_num, iter.node_map);
3453 spin_unlock(&dlm->spinlock);
3454
3455
3456
3457
3458 spin_lock(&res->spinlock);
3459 dlm_lockres_set_refmap_bit(dlm, res, old_master);
3460 spin_unlock(&res->spinlock);
3461
3462 mlog(0, "now time to do a migrate request to other nodes\n");
3463 ret = dlm_do_migrate_request(dlm, res, old_master,
3464 dlm->node_num, &iter);
3465 if (ret < 0) {
3466 mlog_errno(ret);
3467 goto leave;
3468 }
3469
3470 mlog(0, "doing assert master of %.*s to all except the original node\n",
3471 res->lockname.len, res->lockname.name);
3472
3473
3474 ret = dlm_do_assert_master(dlm, res, iter.node_map,
3475 DLM_ASSERT_MASTER_FINISH_MIGRATION);
3476 if (ret < 0) {
3477
3478 mlog_errno(ret);
3479 ret = 0;
3480 }
3481
3482 memset(iter.node_map, 0, sizeof(iter.node_map));
3483 set_bit(old_master, iter.node_map);
3484 mlog(0, "doing assert master of %.*s back to %u\n",
3485 res->lockname.len, res->lockname.name, old_master);
3486 ret = dlm_do_assert_master(dlm, res, iter.node_map,
3487 DLM_ASSERT_MASTER_FINISH_MIGRATION);
3488 if (ret < 0) {
3489 mlog(0, "assert master to original master failed "
3490 "with %d.\n", ret);
3491
3492
3493 ret = 0;
3494 }
3495
3496
3497 spin_lock(&res->spinlock);
3498 dlm_set_lockres_owner(dlm, res, dlm->node_num);
3499 res->state &= ~DLM_LOCK_RES_MIGRATING;
3500 spin_unlock(&res->spinlock);
3501
3502 dlm_kick_thread(dlm, res);
3503 wake_up(&res->wq);
3504leave:
3505 return ret;
3506}
3507
3508
3509
3510
3511
3512
3513
3514
3515
3516
3517void __dlm_lockres_reserve_ast(struct dlm_lock_resource *res)
3518{
3519 assert_spin_locked(&res->spinlock);
3520 if (res->state & DLM_LOCK_RES_MIGRATING) {
3521 __dlm_print_one_lock_resource(res);
3522 }
3523 BUG_ON(res->state & DLM_LOCK_RES_MIGRATING);
3524
3525 atomic_inc(&res->asts_reserved);
3526}
3527
3528
3529
3530
3531
3532
3533
3534
3535
3536
3537
3538
3539
3540
3541void dlm_lockres_release_ast(struct dlm_ctxt *dlm,
3542 struct dlm_lock_resource *res)
3543{
3544 if (!atomic_dec_and_lock(&res->asts_reserved, &res->spinlock))
3545 return;
3546
3547 if (!res->migration_pending) {
3548 spin_unlock(&res->spinlock);
3549 return;
3550 }
3551
3552 BUG_ON(res->state & DLM_LOCK_RES_MIGRATING);
3553 res->migration_pending = 0;
3554 res->state |= DLM_LOCK_RES_MIGRATING;
3555 spin_unlock(&res->spinlock);
3556 wake_up(&res->wq);
3557 wake_up(&dlm->migration_wq);
3558}
3559
3560void dlm_force_free_mles(struct dlm_ctxt *dlm)
3561{
3562 int i;
3563 struct hlist_head *bucket;
3564 struct dlm_master_list_entry *mle;
3565 struct hlist_node *tmp;
3566
3567
3568
3569
3570
3571
3572
3573 spin_lock(&dlm->spinlock);
3574 spin_lock(&dlm->master_lock);
3575
3576 BUG_ON(dlm->dlm_state != DLM_CTXT_LEAVING);
3577 BUG_ON((find_next_bit(dlm->domain_map, O2NM_MAX_NODES, 0) < O2NM_MAX_NODES));
3578
3579 for (i = 0; i < DLM_HASH_BUCKETS; i++) {
3580 bucket = dlm_master_hash(dlm, i);
3581 hlist_for_each_entry_safe(mle, tmp, bucket, master_hash_node) {
3582 if (mle->type != DLM_MLE_BLOCK) {
3583 mlog(ML_ERROR, "bad mle: %p\n", mle);
3584 dlm_print_one_mle(mle);
3585 }
3586 atomic_set(&mle->woken, 1);
3587 wake_up(&mle->wq);
3588
3589 __dlm_unlink_mle(dlm, mle);
3590 __dlm_mle_detach_hb_events(dlm, mle);
3591 __dlm_put_mle(mle);
3592 }
3593 }
3594 spin_unlock(&dlm->master_lock);
3595 spin_unlock(&dlm->spinlock);
3596}
3597