1 /* -*- mode: c; c-basic-offset: 8; -*-
2 * vim: noexpandtab sw=8 ts=8 sts=0:
6 * standalone DLM module
8 * Copyright (C) 2004 Oracle. All rights reserved.
10 * This program is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU General Public
12 * License as published by the Free Software Foundation; either
13 * version 2 of the License, or (at your option) any later version.
15 * This program is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 * General Public License for more details.
20 * You should have received a copy of the GNU General Public
21 * License along with this program; if not, write to the
22 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
23 * Boston, MA 021110-1307, USA.
28 #include <linux/module.h>
30 #include <linux/types.h>
31 #include <linux/slab.h>
32 #include <linux/highmem.h>
33 #include <linux/utsname.h>
34 #include <linux/init.h>
35 #include <linux/sysctl.h>
36 #include <linux/random.h>
37 #include <linux/blkdev.h>
38 #include <linux/socket.h>
39 #include <linux/inet.h>
40 #include <linux/spinlock.h>
41 #include <linux/delay.h>
44 #include "cluster/heartbeat.h"
45 #include "cluster/nodemanager.h"
46 #include "cluster/tcp.h"
49 #include "dlmcommon.h"
51 #include "dlmdomain.h"
53 #define MLOG_MASK_PREFIX (ML_DLM|ML_DLM_MASTER)
54 #include "cluster/masklog.h"
65 u8 name[DLM_LOCKID_NAME_MAX];
68 struct dlm_master_list_entry
70 struct list_head list;
71 struct list_head hb_events;
78 unsigned long maybe_map[BITS_TO_LONGS(O2NM_MAX_NODES)];
79 unsigned long vote_map[BITS_TO_LONGS(O2NM_MAX_NODES)];
80 unsigned long response_map[BITS_TO_LONGS(O2NM_MAX_NODES)];
81 unsigned long node_map[BITS_TO_LONGS(O2NM_MAX_NODES)];
84 enum dlm_mle_type type;
85 struct o2hb_callback_func mle_hb_up;
86 struct o2hb_callback_func mle_hb_down;
88 struct dlm_lock_resource *res;
89 struct dlm_lock_name name;
93 static void dlm_mle_node_down(struct dlm_ctxt *dlm,
94 struct dlm_master_list_entry *mle,
95 struct o2nm_node *node,
97 static void dlm_mle_node_up(struct dlm_ctxt *dlm,
98 struct dlm_master_list_entry *mle,
99 struct o2nm_node *node,
102 static void dlm_assert_master_worker(struct dlm_work_item *item, void *data);
103 static int dlm_do_assert_master(struct dlm_ctxt *dlm, const char *lockname,
104 unsigned int namelen, void *nodemap,
107 static inline int dlm_mle_equal(struct dlm_ctxt *dlm,
108 struct dlm_master_list_entry *mle,
110 unsigned int namelen)
112 struct dlm_lock_resource *res;
117 if (mle->type == DLM_MLE_BLOCK ||
118 mle->type == DLM_MLE_MIGRATION) {
119 if (namelen != mle->u.name.len ||
120 memcmp(name, mle->u.name.name, namelen)!=0)
124 if (namelen != res->lockname.len ||
125 memcmp(res->lockname.name, name, namelen) != 0)
132 /* Code here is included but defined out as it aids debugging */
134 #define dlm_print_nodemap(m) _dlm_print_nodemap(m,#m)
135 void _dlm_print_nodemap(unsigned long *map, const char *mapname)
138 printk("%s=[ ", mapname);
139 for (i=0; i<O2NM_MAX_NODES; i++)
140 if (test_bit(i, map))
145 void dlm_print_one_mle(struct dlm_master_list_entry *mle)
151 unsigned int namelen;
154 unsigned long *maybe = mle->maybe_map,
155 *vote = mle->vote_map,
156 *resp = mle->response_map,
157 *node = mle->node_map;
160 if (mle->type == DLM_MLE_BLOCK)
162 else if (mle->type == DLM_MLE_MASTER)
166 refs = atomic_read(&k->refcount);
167 master = mle->master;
168 attached = (list_empty(&mle->hb_events) ? 'N' : 'Y');
170 if (mle->type != DLM_MLE_MASTER) {
171 namelen = mle->u.name.len;
172 name = mle->u.name.name;
174 namelen = mle->u.res->lockname.len;
175 name = mle->u.res->lockname.name;
178 mlog(ML_NOTICE, "%.*s: %3s refs=%3d mas=%3u new=%3u evt=%c inuse=%d ",
179 namelen, name, type, refs, master, mle->new_master, attached,
181 dlm_print_nodemap(maybe);
183 dlm_print_nodemap(vote);
185 dlm_print_nodemap(resp);
187 dlm_print_nodemap(node);
192 static void dlm_dump_mles(struct dlm_ctxt *dlm)
194 struct dlm_master_list_entry *mle;
195 struct list_head *iter;
197 mlog(ML_NOTICE, "dumping all mles for domain %s:\n", dlm->name);
198 spin_lock(&dlm->master_lock);
199 list_for_each(iter, &dlm->master_list) {
200 mle = list_entry(iter, struct dlm_master_list_entry, list);
201 dlm_print_one_mle(mle);
203 spin_unlock(&dlm->master_lock);
206 int dlm_dump_all_mles(const char __user *data, unsigned int len)
208 struct list_head *iter;
209 struct dlm_ctxt *dlm;
211 spin_lock(&dlm_domain_lock);
212 list_for_each(iter, &dlm_domains) {
213 dlm = list_entry (iter, struct dlm_ctxt, list);
214 mlog(ML_NOTICE, "found dlm: %p, name=%s\n", dlm, dlm->name);
217 spin_unlock(&dlm_domain_lock);
220 EXPORT_SYMBOL_GPL(dlm_dump_all_mles);
225 static kmem_cache_t *dlm_mle_cache = NULL;
228 static void dlm_mle_release(struct kref *kref);
229 static void dlm_init_mle(struct dlm_master_list_entry *mle,
230 enum dlm_mle_type type,
231 struct dlm_ctxt *dlm,
232 struct dlm_lock_resource *res,
234 unsigned int namelen);
235 static void dlm_put_mle(struct dlm_master_list_entry *mle);
236 static void __dlm_put_mle(struct dlm_master_list_entry *mle);
237 static int dlm_find_mle(struct dlm_ctxt *dlm,
238 struct dlm_master_list_entry **mle,
239 char *name, unsigned int namelen);
241 static int dlm_do_master_request(struct dlm_master_list_entry *mle, int to);
244 static int dlm_wait_for_lock_mastery(struct dlm_ctxt *dlm,
245 struct dlm_lock_resource *res,
246 struct dlm_master_list_entry *mle,
248 static int dlm_restart_lock_mastery(struct dlm_ctxt *dlm,
249 struct dlm_lock_resource *res,
250 struct dlm_master_list_entry *mle,
252 static int dlm_add_migration_mle(struct dlm_ctxt *dlm,
253 struct dlm_lock_resource *res,
254 struct dlm_master_list_entry *mle,
255 struct dlm_master_list_entry **oldmle,
256 const char *name, unsigned int namelen,
257 u8 new_master, u8 master);
259 static u8 dlm_pick_migration_target(struct dlm_ctxt *dlm,
260 struct dlm_lock_resource *res);
261 static void dlm_remove_nonlocal_locks(struct dlm_ctxt *dlm,
262 struct dlm_lock_resource *res);
263 static int dlm_mark_lockres_migrating(struct dlm_ctxt *dlm,
264 struct dlm_lock_resource *res,
266 static int dlm_pre_master_reco_lockres(struct dlm_ctxt *dlm,
267 struct dlm_lock_resource *res);
270 int dlm_is_host_down(int errno)
287 case -EINVAL: /* if returned from our tcp code,
288 this means there is no socket */
296 * MASTER LIST FUNCTIONS
301 * regarding master list entries and heartbeat callbacks:
303 * in order to avoid sleeping and allocation that occurs in
304 * heartbeat, master list entries are simply attached to the
305 * dlm's established heartbeat callbacks. the mle is attached
306 * when it is created, and since the dlm->spinlock is held at
307 * that time, any heartbeat event will be properly discovered
308 * by the mle. the mle needs to be detached from the
309 * dlm->mle_hb_events list as soon as heartbeat events are no
310 * longer useful to the mle, and before the mle is freed.
312 * as a general rule, heartbeat events are no longer needed by
313 * the mle once an "answer" regarding the lock master has been
316 static inline void __dlm_mle_attach_hb_events(struct dlm_ctxt *dlm,
317 struct dlm_master_list_entry *mle)
319 assert_spin_locked(&dlm->spinlock);
321 list_add_tail(&mle->hb_events, &dlm->mle_hb_events);
325 static inline void __dlm_mle_detach_hb_events(struct dlm_ctxt *dlm,
326 struct dlm_master_list_entry *mle)
328 if (!list_empty(&mle->hb_events))
329 list_del_init(&mle->hb_events);
333 static inline void dlm_mle_detach_hb_events(struct dlm_ctxt *dlm,
334 struct dlm_master_list_entry *mle)
336 spin_lock(&dlm->spinlock);
337 __dlm_mle_detach_hb_events(dlm, mle);
338 spin_unlock(&dlm->spinlock);
341 static void dlm_get_mle_inuse(struct dlm_master_list_entry *mle)
343 struct dlm_ctxt *dlm;
346 assert_spin_locked(&dlm->spinlock);
347 assert_spin_locked(&dlm->master_lock);
349 kref_get(&mle->mle_refs);
352 static void dlm_put_mle_inuse(struct dlm_master_list_entry *mle)
354 struct dlm_ctxt *dlm;
357 spin_lock(&dlm->spinlock);
358 spin_lock(&dlm->master_lock);
361 spin_unlock(&dlm->master_lock);
362 spin_unlock(&dlm->spinlock);
366 /* remove from list and free */
367 static void __dlm_put_mle(struct dlm_master_list_entry *mle)
369 struct dlm_ctxt *dlm;
372 assert_spin_locked(&dlm->spinlock);
373 assert_spin_locked(&dlm->master_lock);
374 if (!atomic_read(&mle->mle_refs.refcount)) {
375 /* this may or may not crash, but who cares.
377 mlog(ML_ERROR, "bad mle: %p\n", mle);
378 dlm_print_one_mle(mle);
381 kref_put(&mle->mle_refs, dlm_mle_release);
385 /* must not have any spinlocks coming in */
386 static void dlm_put_mle(struct dlm_master_list_entry *mle)
388 struct dlm_ctxt *dlm;
391 spin_lock(&dlm->spinlock);
392 spin_lock(&dlm->master_lock);
394 spin_unlock(&dlm->master_lock);
395 spin_unlock(&dlm->spinlock);
398 static inline void dlm_get_mle(struct dlm_master_list_entry *mle)
400 kref_get(&mle->mle_refs);
403 static void dlm_init_mle(struct dlm_master_list_entry *mle,
404 enum dlm_mle_type type,
405 struct dlm_ctxt *dlm,
406 struct dlm_lock_resource *res,
408 unsigned int namelen)
410 assert_spin_locked(&dlm->spinlock);
414 INIT_LIST_HEAD(&mle->list);
415 INIT_LIST_HEAD(&mle->hb_events);
416 memset(mle->maybe_map, 0, sizeof(mle->maybe_map));
417 spin_lock_init(&mle->spinlock);
418 init_waitqueue_head(&mle->wq);
419 atomic_set(&mle->woken, 0);
420 kref_init(&mle->mle_refs);
421 memset(mle->response_map, 0, sizeof(mle->response_map));
422 mle->master = O2NM_MAX_NODES;
423 mle->new_master = O2NM_MAX_NODES;
426 if (mle->type == DLM_MLE_MASTER) {
429 } else if (mle->type == DLM_MLE_BLOCK) {
431 memcpy(mle->u.name.name, name, namelen);
432 mle->u.name.len = namelen;
433 } else /* DLM_MLE_MIGRATION */ {
435 memcpy(mle->u.name.name, name, namelen);
436 mle->u.name.len = namelen;
439 /* copy off the node_map and register hb callbacks on our copy */
440 memcpy(mle->node_map, dlm->domain_map, sizeof(mle->node_map));
441 memcpy(mle->vote_map, dlm->domain_map, sizeof(mle->vote_map));
442 clear_bit(dlm->node_num, mle->vote_map);
443 clear_bit(dlm->node_num, mle->node_map);
445 /* attach the mle to the domain node up/down events */
446 __dlm_mle_attach_hb_events(dlm, mle);
450 /* returns 1 if found, 0 if not */
451 static int dlm_find_mle(struct dlm_ctxt *dlm,
452 struct dlm_master_list_entry **mle,
453 char *name, unsigned int namelen)
455 struct dlm_master_list_entry *tmpmle;
456 struct list_head *iter;
458 assert_spin_locked(&dlm->master_lock);
460 list_for_each(iter, &dlm->master_list) {
461 tmpmle = list_entry(iter, struct dlm_master_list_entry, list);
462 if (!dlm_mle_equal(dlm, tmpmle, name, namelen))
471 void dlm_hb_event_notify_attached(struct dlm_ctxt *dlm, int idx, int node_up)
473 struct dlm_master_list_entry *mle;
474 struct list_head *iter;
476 assert_spin_locked(&dlm->spinlock);
478 list_for_each(iter, &dlm->mle_hb_events) {
479 mle = list_entry(iter, struct dlm_master_list_entry,
482 dlm_mle_node_up(dlm, mle, NULL, idx);
484 dlm_mle_node_down(dlm, mle, NULL, idx);
488 static void dlm_mle_node_down(struct dlm_ctxt *dlm,
489 struct dlm_master_list_entry *mle,
490 struct o2nm_node *node, int idx)
492 spin_lock(&mle->spinlock);
494 if (!test_bit(idx, mle->node_map))
495 mlog(0, "node %u already removed from nodemap!\n", idx);
497 clear_bit(idx, mle->node_map);
499 spin_unlock(&mle->spinlock);
502 static void dlm_mle_node_up(struct dlm_ctxt *dlm,
503 struct dlm_master_list_entry *mle,
504 struct o2nm_node *node, int idx)
506 spin_lock(&mle->spinlock);
508 if (test_bit(idx, mle->node_map))
509 mlog(0, "node %u already in node map!\n", idx);
511 set_bit(idx, mle->node_map);
513 spin_unlock(&mle->spinlock);
517 int dlm_init_mle_cache(void)
519 dlm_mle_cache = kmem_cache_create("dlm_mle_cache",
520 sizeof(struct dlm_master_list_entry),
521 0, SLAB_HWCACHE_ALIGN,
523 if (dlm_mle_cache == NULL)
528 void dlm_destroy_mle_cache(void)
531 kmem_cache_destroy(dlm_mle_cache);
534 static void dlm_mle_release(struct kref *kref)
536 struct dlm_master_list_entry *mle;
537 struct dlm_ctxt *dlm;
541 mle = container_of(kref, struct dlm_master_list_entry, mle_refs);
544 if (mle->type != DLM_MLE_MASTER) {
545 mlog(0, "calling mle_release for %.*s, type %d\n",
546 mle->u.name.len, mle->u.name.name, mle->type);
548 mlog(0, "calling mle_release for %.*s, type %d\n",
549 mle->u.res->lockname.len,
550 mle->u.res->lockname.name, mle->type);
552 assert_spin_locked(&dlm->spinlock);
553 assert_spin_locked(&dlm->master_lock);
555 /* remove from list if not already */
556 if (!list_empty(&mle->list))
557 list_del_init(&mle->list);
559 /* detach the mle from the domain node up/down events */
560 __dlm_mle_detach_hb_events(dlm, mle);
562 /* NOTE: kfree under spinlock here.
563 * if this is bad, we can move this to a freelist. */
564 kmem_cache_free(dlm_mle_cache, mle);
569 * LOCK RESOURCE FUNCTIONS
572 static void dlm_set_lockres_owner(struct dlm_ctxt *dlm,
573 struct dlm_lock_resource *res,
576 assert_spin_locked(&res->spinlock);
578 mlog_entry("%.*s, %u\n", res->lockname.len, res->lockname.name, owner);
580 if (owner == dlm->node_num)
581 atomic_inc(&dlm->local_resources);
582 else if (owner == DLM_LOCK_RES_OWNER_UNKNOWN)
583 atomic_inc(&dlm->unknown_resources);
585 atomic_inc(&dlm->remote_resources);
590 void dlm_change_lockres_owner(struct dlm_ctxt *dlm,
591 struct dlm_lock_resource *res, u8 owner)
593 assert_spin_locked(&res->spinlock);
595 if (owner == res->owner)
598 if (res->owner == dlm->node_num)
599 atomic_dec(&dlm->local_resources);
600 else if (res->owner == DLM_LOCK_RES_OWNER_UNKNOWN)
601 atomic_dec(&dlm->unknown_resources);
603 atomic_dec(&dlm->remote_resources);
605 dlm_set_lockres_owner(dlm, res, owner);
609 static void dlm_lockres_release(struct kref *kref)
611 struct dlm_lock_resource *res;
613 res = container_of(kref, struct dlm_lock_resource, refs);
615 /* This should not happen -- all lockres' have a name
616 * associated with them at init time. */
617 BUG_ON(!res->lockname.name);
619 mlog(0, "destroying lockres %.*s\n", res->lockname.len,
622 if (!hlist_unhashed(&res->hash_node) ||
623 !list_empty(&res->granted) ||
624 !list_empty(&res->converting) ||
625 !list_empty(&res->blocked) ||
626 !list_empty(&res->dirty) ||
627 !list_empty(&res->recovering) ||
628 !list_empty(&res->purge)) {
630 "Going to BUG for resource %.*s."
631 " We're on a list! [%c%c%c%c%c%c%c]\n",
632 res->lockname.len, res->lockname.name,
633 !hlist_unhashed(&res->hash_node) ? 'H' : ' ',
634 !list_empty(&res->granted) ? 'G' : ' ',
635 !list_empty(&res->converting) ? 'C' : ' ',
636 !list_empty(&res->blocked) ? 'B' : ' ',
637 !list_empty(&res->dirty) ? 'D' : ' ',
638 !list_empty(&res->recovering) ? 'R' : ' ',
639 !list_empty(&res->purge) ? 'P' : ' ');
641 dlm_print_one_lock_resource(res);
644 /* By the time we're ready to blow this guy away, we shouldn't
645 * be on any lists. */
646 BUG_ON(!hlist_unhashed(&res->hash_node));
647 BUG_ON(!list_empty(&res->granted));
648 BUG_ON(!list_empty(&res->converting));
649 BUG_ON(!list_empty(&res->blocked));
650 BUG_ON(!list_empty(&res->dirty));
651 BUG_ON(!list_empty(&res->recovering));
652 BUG_ON(!list_empty(&res->purge));
654 kfree(res->lockname.name);
659 void dlm_lockres_put(struct dlm_lock_resource *res)
661 kref_put(&res->refs, dlm_lockres_release);
664 static void dlm_init_lockres(struct dlm_ctxt *dlm,
665 struct dlm_lock_resource *res,
666 const char *name, unsigned int namelen)
670 /* If we memset here, we lose our reference to the kmalloc'd
671 * res->lockname.name, so be sure to init every field
674 qname = (char *) res->lockname.name;
675 memcpy(qname, name, namelen);
677 res->lockname.len = namelen;
678 res->lockname.hash = dlm_lockid_hash(name, namelen);
680 init_waitqueue_head(&res->wq);
681 spin_lock_init(&res->spinlock);
682 INIT_HLIST_NODE(&res->hash_node);
683 INIT_LIST_HEAD(&res->granted);
684 INIT_LIST_HEAD(&res->converting);
685 INIT_LIST_HEAD(&res->blocked);
686 INIT_LIST_HEAD(&res->dirty);
687 INIT_LIST_HEAD(&res->recovering);
688 INIT_LIST_HEAD(&res->purge);
689 atomic_set(&res->asts_reserved, 0);
690 res->migration_pending = 0;
692 kref_init(&res->refs);
694 /* just for consistency */
695 spin_lock(&res->spinlock);
696 dlm_set_lockres_owner(dlm, res, DLM_LOCK_RES_OWNER_UNKNOWN);
697 spin_unlock(&res->spinlock);
699 res->state = DLM_LOCK_RES_IN_PROGRESS;
703 memset(res->lvb, 0, DLM_LVB_LEN);
706 struct dlm_lock_resource *dlm_new_lockres(struct dlm_ctxt *dlm,
708 unsigned int namelen)
710 struct dlm_lock_resource *res;
712 res = kmalloc(sizeof(struct dlm_lock_resource), GFP_KERNEL);
716 res->lockname.name = kmalloc(namelen, GFP_KERNEL);
717 if (!res->lockname.name) {
722 dlm_init_lockres(dlm, res, name, namelen);
727 * lookup a lock resource by name.
728 * may already exist in the hashtable.
729 * lockid is null terminated
731 * if not, allocate enough for the lockres and for
732 * the temporary structure used in doing the mastering.
734 * also, do a lookup in the dlm->master_list to see
735 * if another node has begun mastering the same lock.
736 * if so, there should be a block entry in there
737 * for this name, and we should *not* attempt to master
738 * the lock here. need to wait around for that node
739 * to assert_master (or die).
742 struct dlm_lock_resource * dlm_get_lock_resource(struct dlm_ctxt *dlm,
746 struct dlm_lock_resource *tmpres=NULL, *res=NULL;
747 struct dlm_master_list_entry *mle = NULL;
748 struct dlm_master_list_entry *alloc_mle = NULL;
751 struct dlm_node_iter iter;
752 unsigned int namelen, hash;
754 int bit, wait_on_recovery = 0;
758 namelen = strlen(lockid);
759 hash = dlm_lockid_hash(lockid, namelen);
761 mlog(0, "get lockres %s (len %d)\n", lockid, namelen);
764 spin_lock(&dlm->spinlock);
765 tmpres = __dlm_lookup_lockres(dlm, lockid, namelen, hash);
767 spin_unlock(&dlm->spinlock);
768 mlog(0, "found in hash!\n");
770 dlm_lockres_put(res);
776 spin_unlock(&dlm->spinlock);
777 mlog(0, "allocating a new resource\n");
778 /* nothing found and we need to allocate one. */
779 alloc_mle = (struct dlm_master_list_entry *)
780 kmem_cache_alloc(dlm_mle_cache, GFP_KERNEL);
783 res = dlm_new_lockres(dlm, lockid, namelen);
789 mlog(0, "no lockres found, allocated our own: %p\n", res);
791 if (flags & LKM_LOCAL) {
792 /* caller knows it's safe to assume it's not mastered elsewhere
793 * DONE! return right away */
794 spin_lock(&res->spinlock);
795 dlm_change_lockres_owner(dlm, res, dlm->node_num);
796 __dlm_insert_lockres(dlm, res);
797 spin_unlock(&res->spinlock);
798 spin_unlock(&dlm->spinlock);
799 /* lockres still marked IN_PROGRESS */
803 /* check master list to see if another node has started mastering it */
804 spin_lock(&dlm->master_lock);
806 /* if we found a block, wait for lock to be mastered by another node */
807 blocked = dlm_find_mle(dlm, &mle, (char *)lockid, namelen);
809 if (mle->type == DLM_MLE_MASTER) {
810 mlog(ML_ERROR, "master entry for nonexistent lock!\n");
812 } else if (mle->type == DLM_MLE_MIGRATION) {
813 /* migration is in progress! */
814 /* the good news is that we now know the
815 * "current" master (mle->master). */
817 spin_unlock(&dlm->master_lock);
818 assert_spin_locked(&dlm->spinlock);
820 /* set the lockres owner and hash it */
821 spin_lock(&res->spinlock);
822 dlm_set_lockres_owner(dlm, res, mle->master);
823 __dlm_insert_lockres(dlm, res);
824 spin_unlock(&res->spinlock);
825 spin_unlock(&dlm->spinlock);
827 /* master is known, detach */
828 dlm_mle_detach_hb_events(dlm, mle);
834 /* go ahead and try to master lock on this node */
836 /* make sure this does not get freed below */
838 dlm_init_mle(mle, DLM_MLE_MASTER, dlm, res, NULL, 0);
839 set_bit(dlm->node_num, mle->maybe_map);
840 list_add(&mle->list, &dlm->master_list);
842 /* still holding the dlm spinlock, check the recovery map
843 * to see if there are any nodes that still need to be
844 * considered. these will not appear in the mle nodemap
845 * but they might own this lockres. wait on them. */
846 bit = find_next_bit(dlm->recovery_map, O2NM_MAX_NODES, 0);
847 if (bit < O2NM_MAX_NODES) {
848 mlog(ML_NOTICE, "%s:%.*s: at least one node (%d) to"
849 "recover before lock mastery can begin\n",
850 dlm->name, namelen, (char *)lockid, bit);
851 wait_on_recovery = 1;
855 /* at this point there is either a DLM_MLE_BLOCK or a
856 * DLM_MLE_MASTER on the master list, so it's safe to add the
857 * lockres to the hashtable. anyone who finds the lock will
858 * still have to wait on the IN_PROGRESS. */
860 /* finally add the lockres to its hash bucket */
861 __dlm_insert_lockres(dlm, res);
862 /* get an extra ref on the mle in case this is a BLOCK
863 * if so, the creator of the BLOCK may try to put the last
864 * ref at this time in the assert master handler, so we
865 * need an extra one to keep from a bad ptr deref. */
866 dlm_get_mle_inuse(mle);
867 spin_unlock(&dlm->master_lock);
868 spin_unlock(&dlm->spinlock);
871 while (wait_on_recovery) {
872 /* any cluster changes that occurred after dropping the
873 * dlm spinlock would be detectable be a change on the mle,
874 * so we only need to clear out the recovery map once. */
875 if (dlm_is_recovery_lock(lockid, namelen)) {
876 mlog(ML_NOTICE, "%s: recovery map is not empty, but "
877 "must master $RECOVERY lock now\n", dlm->name);
878 if (!dlm_pre_master_reco_lockres(dlm, res))
879 wait_on_recovery = 0;
881 mlog(0, "%s: waiting 500ms for heartbeat state "
882 "change\n", dlm->name);
888 dlm_kick_recovery_thread(dlm);
890 dlm_wait_for_recovery(dlm);
892 spin_lock(&dlm->spinlock);
893 bit = find_next_bit(dlm->recovery_map, O2NM_MAX_NODES, 0);
894 if (bit < O2NM_MAX_NODES) {
895 mlog(ML_NOTICE, "%s:%.*s: at least one node (%d) to"
896 "recover before lock mastery can begin\n",
897 dlm->name, namelen, (char *)lockid, bit);
898 wait_on_recovery = 1;
900 wait_on_recovery = 0;
901 spin_unlock(&dlm->spinlock);
904 /* must wait for lock to be mastered elsewhere */
909 dlm_node_iter_init(mle->vote_map, &iter);
910 while ((nodenum = dlm_node_iter_next(&iter)) >= 0) {
911 ret = dlm_do_master_request(mle, nodenum);
914 if (mle->master != O2NM_MAX_NODES) {
915 /* found a master ! */
916 if (mle->master <= nodenum)
918 /* if our master request has not reached the master
919 * yet, keep going until it does. this is how the
920 * master will know that asserts are needed back to
921 * the lower nodes. */
922 mlog(0, "%s:%.*s: requests only up to %u but master "
923 "is %u, keep going\n", dlm->name, namelen,
924 lockid, nodenum, mle->master);
929 /* keep going until the response map includes all nodes */
930 ret = dlm_wait_for_lock_mastery(dlm, res, mle, &blocked);
932 wait_on_recovery = 1;
933 mlog(0, "%s:%.*s: node map changed, redo the "
934 "master request now, blocked=%d\n",
935 dlm->name, res->lockname.len,
936 res->lockname.name, blocked);
938 mlog(ML_ERROR, "%s:%.*s: spinning on "
939 "dlm_wait_for_lock_mastery, blocked=%d\n",
940 dlm->name, res->lockname.len,
941 res->lockname.name, blocked);
942 dlm_print_one_lock_resource(res);
943 /* dlm_print_one_mle(mle); */
949 mlog(0, "lockres mastered by %u\n", res->owner);
950 /* make sure we never continue without this */
951 BUG_ON(res->owner == O2NM_MAX_NODES);
953 /* master is known, detach if not already detached */
954 dlm_mle_detach_hb_events(dlm, mle);
956 /* put the extra ref */
957 dlm_put_mle_inuse(mle);
960 spin_lock(&res->spinlock);
961 res->state &= ~DLM_LOCK_RES_IN_PROGRESS;
962 spin_unlock(&res->spinlock);
966 /* need to free the unused mle */
968 kmem_cache_free(dlm_mle_cache, alloc_mle);
974 #define DLM_MASTERY_TIMEOUT_MS 5000
976 static int dlm_wait_for_lock_mastery(struct dlm_ctxt *dlm,
977 struct dlm_lock_resource *res,
978 struct dlm_master_list_entry *mle,
983 int map_changed, voting_done;
990 /* check if another node has already become the owner */
991 spin_lock(&res->spinlock);
992 if (res->owner != DLM_LOCK_RES_OWNER_UNKNOWN) {
993 mlog(0, "%s:%.*s: owner is suddenly %u\n", dlm->name,
994 res->lockname.len, res->lockname.name, res->owner);
995 spin_unlock(&res->spinlock);
996 /* this will cause the master to re-assert across
997 * the whole cluster, freeing up mles */
998 if (res->owner != dlm->node_num) {
999 ret = dlm_do_master_request(mle, res->owner);
1001 /* give recovery a chance to run */
1002 mlog(ML_ERROR, "link to %u went down?: %d\n", res->owner, ret);
1010 spin_unlock(&res->spinlock);
1012 spin_lock(&mle->spinlock);
1014 map_changed = (memcmp(mle->vote_map, mle->node_map,
1015 sizeof(mle->vote_map)) != 0);
1016 voting_done = (memcmp(mle->vote_map, mle->response_map,
1017 sizeof(mle->vote_map)) == 0);
1019 /* restart if we hit any errors */
1022 mlog(0, "%s: %.*s: node map changed, restarting\n",
1023 dlm->name, res->lockname.len, res->lockname.name);
1024 ret = dlm_restart_lock_mastery(dlm, res, mle, *blocked);
1025 b = (mle->type == DLM_MLE_BLOCK);
1026 if ((*blocked && !b) || (!*blocked && b)) {
1027 mlog(0, "%s:%.*s: status change: old=%d new=%d\n",
1028 dlm->name, res->lockname.len, res->lockname.name,
1032 spin_unlock(&mle->spinlock);
1037 mlog(0, "%s:%.*s: restart lock mastery succeeded, "
1038 "rechecking now\n", dlm->name, res->lockname.len,
1039 res->lockname.name);
1043 mlog(0, "map not changed and voting not done "
1044 "for %s:%.*s\n", dlm->name, res->lockname.len,
1045 res->lockname.name);
1049 if (m != O2NM_MAX_NODES) {
1050 /* another node has done an assert!
1055 /* have all nodes responded? */
1056 if (voting_done && !*blocked) {
1057 bit = find_next_bit(mle->maybe_map, O2NM_MAX_NODES, 0);
1058 if (dlm->node_num <= bit) {
1059 /* my node number is lowest.
1060 * now tell other nodes that I am
1061 * mastering this. */
1062 mle->master = dlm->node_num;
1066 /* if voting is done, but we have not received
1067 * an assert master yet, we must sleep */
1071 spin_unlock(&mle->spinlock);
1073 /* sleep if we haven't finished voting yet */
1075 unsigned long timeo = msecs_to_jiffies(DLM_MASTERY_TIMEOUT_MS);
1078 if (atomic_read(&mle->mle_refs.refcount) < 2)
1079 mlog(ML_ERROR, "mle (%p) refs=%d, name=%.*s\n", mle,
1080 atomic_read(&mle->mle_refs.refcount),
1081 res->lockname.len, res->lockname.name);
1083 atomic_set(&mle->woken, 0);
1084 (void)wait_event_timeout(mle->wq,
1085 (atomic_read(&mle->woken) == 1),
1087 if (res->owner == O2NM_MAX_NODES) {
1088 mlog(0, "waiting again\n");
1091 mlog(0, "done waiting, master is %u\n", res->owner);
1099 mlog(0, "about to master %.*s here, this=%u\n",
1100 res->lockname.len, res->lockname.name, m);
1101 ret = dlm_do_assert_master(dlm, res->lockname.name,
1102 res->lockname.len, mle->vote_map, 0);
1104 /* This is a failure in the network path,
1105 * not in the response to the assert_master
1106 * (any nonzero response is a BUG on this node).
1107 * Most likely a socket just got disconnected
1108 * due to node death. */
1111 /* no longer need to restart lock mastery.
1112 * all living nodes have been contacted. */
1116 /* set the lockres owner */
1117 spin_lock(&res->spinlock);
1118 dlm_change_lockres_owner(dlm, res, m);
1119 spin_unlock(&res->spinlock);
1125 struct dlm_bitmap_diff_iter
1128 unsigned long *orig_bm;
1129 unsigned long *cur_bm;
1130 unsigned long diff_bm[BITS_TO_LONGS(O2NM_MAX_NODES)];
1133 enum dlm_node_state_change
1140 static void dlm_bitmap_diff_iter_init(struct dlm_bitmap_diff_iter *iter,
1141 unsigned long *orig_bm,
1142 unsigned long *cur_bm)
1144 unsigned long p1, p2;
1148 iter->orig_bm = orig_bm;
1149 iter->cur_bm = cur_bm;
1151 for (i = 0; i < BITS_TO_LONGS(O2NM_MAX_NODES); i++) {
1152 p1 = *(iter->orig_bm + i);
1153 p2 = *(iter->cur_bm + i);
1154 iter->diff_bm[i] = (p1 & ~p2) | (p2 & ~p1);
1158 static int dlm_bitmap_diff_iter_next(struct dlm_bitmap_diff_iter *iter,
1159 enum dlm_node_state_change *state)
1163 if (iter->curnode >= O2NM_MAX_NODES)
1166 bit = find_next_bit(iter->diff_bm, O2NM_MAX_NODES,
1168 if (bit >= O2NM_MAX_NODES) {
1169 iter->curnode = O2NM_MAX_NODES;
1173 /* if it was there in the original then this node died */
1174 if (test_bit(bit, iter->orig_bm))
1179 iter->curnode = bit;
1184 static int dlm_restart_lock_mastery(struct dlm_ctxt *dlm,
1185 struct dlm_lock_resource *res,
1186 struct dlm_master_list_entry *mle,
1189 struct dlm_bitmap_diff_iter bdi;
1190 enum dlm_node_state_change sc;
1194 mlog(0, "something happened such that the "
1195 "master process may need to be restarted!\n");
1197 assert_spin_locked(&mle->spinlock);
1199 dlm_bitmap_diff_iter_init(&bdi, mle->vote_map, mle->node_map);
1200 node = dlm_bitmap_diff_iter_next(&bdi, &sc);
1202 if (sc == NODE_UP) {
1203 /* a node came up. clear any old vote from
1204 * the response map and set it in the vote map
1205 * then restart the mastery. */
1206 mlog(ML_NOTICE, "node %d up while restarting\n", node);
1208 /* redo the master request, but only for the new node */
1209 mlog(0, "sending request to new node\n");
1210 clear_bit(node, mle->response_map);
1211 set_bit(node, mle->vote_map);
1213 mlog(ML_ERROR, "node down! %d\n", node);
1215 int lowest = find_next_bit(mle->maybe_map,
1218 /* act like it was never there */
1219 clear_bit(node, mle->maybe_map);
1221 if (node == lowest) {
1222 mlog(0, "expected master %u died"
1223 " while this node was blocked "
1224 "waiting on it!\n", node);
1225 lowest = find_next_bit(mle->maybe_map,
1228 if (lowest < O2NM_MAX_NODES) {
1229 mlog(0, "%s:%.*s:still "
1230 "blocked. waiting on %u "
1236 /* mle is an MLE_BLOCK, but
1237 * there is now nothing left to
1238 * block on. we need to return
1239 * all the way back out and try
1240 * again with an MLE_MASTER.
1241 * dlm_do_local_recovery_cleanup
1242 * has already run, so the mle
1244 mlog(0, "%s:%.*s: no "
1245 "longer blocking. try to "
1246 "master this here\n",
1249 res->lockname.name);
1250 mle->type = DLM_MLE_MASTER;
1256 /* now blank out everything, as if we had never
1257 * contacted anyone */
1258 memset(mle->maybe_map, 0, sizeof(mle->maybe_map));
1259 memset(mle->response_map, 0, sizeof(mle->response_map));
1260 /* reset the vote_map to the current node_map */
1261 memcpy(mle->vote_map, mle->node_map,
1262 sizeof(mle->node_map));
1263 /* put myself into the maybe map */
1264 if (mle->type != DLM_MLE_BLOCK)
1265 set_bit(dlm->node_num, mle->maybe_map);
1268 node = dlm_bitmap_diff_iter_next(&bdi, &sc);
1275 * DLM_MASTER_REQUEST_MSG
1277 * returns: 0 on success,
1278 * -errno on a network error
1280 * on error, the caller should assume the target node is "dead"
1284 static int dlm_do_master_request(struct dlm_master_list_entry *mle, int to)
1286 struct dlm_ctxt *dlm = mle->dlm;
1287 struct dlm_master_request request;
1288 int ret, response=0, resend;
1290 memset(&request, 0, sizeof(request));
1291 request.node_idx = dlm->node_num;
1293 BUG_ON(mle->type == DLM_MLE_MIGRATION);
1295 if (mle->type != DLM_MLE_MASTER) {
1296 request.namelen = mle->u.name.len;
1297 memcpy(request.name, mle->u.name.name, request.namelen);
1299 request.namelen = mle->u.res->lockname.len;
1300 memcpy(request.name, mle->u.res->lockname.name,
1305 ret = o2net_send_message(DLM_MASTER_REQUEST_MSG, dlm->key, &request,
1306 sizeof(request), to, &response);
1308 if (ret == -ESRCH) {
1309 /* should never happen */
1310 mlog(ML_ERROR, "TCP stack not ready!\n");
1312 } else if (ret == -EINVAL) {
1313 mlog(ML_ERROR, "bad args passed to o2net!\n");
1315 } else if (ret == -ENOMEM) {
1316 mlog(ML_ERROR, "out of memory while trying to send "
1317 "network message! retrying\n");
1318 /* this is totally crude */
1321 } else if (!dlm_is_host_down(ret)) {
1322 /* not a network error. bad. */
1324 mlog(ML_ERROR, "unhandled error!");
1327 /* all other errors should be network errors,
1328 * and likely indicate node death */
1329 mlog(ML_ERROR, "link to %d went down!\n", to);
1335 spin_lock(&mle->spinlock);
1337 case DLM_MASTER_RESP_YES:
1338 set_bit(to, mle->response_map);
1339 mlog(0, "node %u is the master, response=YES\n", to);
1342 case DLM_MASTER_RESP_NO:
1343 mlog(0, "node %u not master, response=NO\n", to);
1344 set_bit(to, mle->response_map);
1346 case DLM_MASTER_RESP_MAYBE:
1347 mlog(0, "node %u not master, response=MAYBE\n", to);
1348 set_bit(to, mle->response_map);
1349 set_bit(to, mle->maybe_map);
1351 case DLM_MASTER_RESP_ERROR:
1352 mlog(0, "node %u hit an error, resending\n", to);
1357 mlog(ML_ERROR, "bad response! %u\n", response);
1360 spin_unlock(&mle->spinlock);
1362 /* this is also totally crude */
1372 * locks that can be taken here:
1378 * if possible, TRIM THIS DOWN!!!
1380 int dlm_master_request_handler(struct o2net_msg *msg, u32 len, void *data)
1382 u8 response = DLM_MASTER_RESP_MAYBE;
1383 struct dlm_ctxt *dlm = data;
1384 struct dlm_lock_resource *res = NULL;
1385 struct dlm_master_request *request = (struct dlm_master_request *) msg->buf;
1386 struct dlm_master_list_entry *mle = NULL, *tmpmle = NULL;
1388 unsigned int namelen, hash;
1391 int dispatch_assert = 0;
1394 return DLM_MASTER_RESP_NO;
1396 if (!dlm_domain_fully_joined(dlm)) {
1397 response = DLM_MASTER_RESP_NO;
1401 name = request->name;
1402 namelen = request->namelen;
1403 hash = dlm_lockid_hash(name, namelen);
1405 if (namelen > DLM_LOCKID_NAME_MAX) {
1406 response = DLM_IVBUFLEN;
1411 spin_lock(&dlm->spinlock);
1412 res = __dlm_lookup_lockres(dlm, name, namelen, hash);
1414 spin_unlock(&dlm->spinlock);
1416 /* take care of the easy cases up front */
1417 spin_lock(&res->spinlock);
1418 if (res->state & DLM_LOCK_RES_RECOVERING) {
1419 spin_unlock(&res->spinlock);
1420 mlog(0, "returning DLM_MASTER_RESP_ERROR since res is "
1421 "being recovered\n");
1422 response = DLM_MASTER_RESP_ERROR;
1424 kmem_cache_free(dlm_mle_cache, mle);
1428 if (res->owner == dlm->node_num) {
1429 spin_unlock(&res->spinlock);
1430 // mlog(0, "this node is the master\n");
1431 response = DLM_MASTER_RESP_YES;
1433 kmem_cache_free(dlm_mle_cache, mle);
1435 /* this node is the owner.
1436 * there is some extra work that needs to
1437 * happen now. the requesting node has
1438 * caused all nodes up to this one to
1439 * create mles. this node now needs to
1440 * go back and clean those up. */
1441 dispatch_assert = 1;
1443 } else if (res->owner != DLM_LOCK_RES_OWNER_UNKNOWN) {
1444 spin_unlock(&res->spinlock);
1445 // mlog(0, "node %u is the master\n", res->owner);
1446 response = DLM_MASTER_RESP_NO;
1448 kmem_cache_free(dlm_mle_cache, mle);
1452 /* ok, there is no owner. either this node is
1453 * being blocked, or it is actively trying to
1454 * master this lock. */
1455 if (!(res->state & DLM_LOCK_RES_IN_PROGRESS)) {
1456 mlog(ML_ERROR, "lock with no owner should be "
1461 // mlog(0, "lockres is in progress...\n");
1462 spin_lock(&dlm->master_lock);
1463 found = dlm_find_mle(dlm, &tmpmle, name, namelen);
1465 mlog(ML_ERROR, "no mle found for this lock!\n");
1469 spin_lock(&tmpmle->spinlock);
1470 if (tmpmle->type == DLM_MLE_BLOCK) {
1471 // mlog(0, "this node is waiting for "
1472 // "lockres to be mastered\n");
1473 response = DLM_MASTER_RESP_NO;
1474 } else if (tmpmle->type == DLM_MLE_MIGRATION) {
1475 mlog(0, "node %u is master, but trying to migrate to "
1476 "node %u.\n", tmpmle->master, tmpmle->new_master);
1477 if (tmpmle->master == dlm->node_num) {
1478 response = DLM_MASTER_RESP_YES;
1479 mlog(ML_ERROR, "no owner on lockres, but this "
1480 "node is trying to migrate it to %u?!\n",
1481 tmpmle->new_master);
1484 /* the real master can respond on its own */
1485 response = DLM_MASTER_RESP_NO;
1487 } else if (tmpmle->master != DLM_LOCK_RES_OWNER_UNKNOWN) {
1489 if (tmpmle->master == dlm->node_num) {
1490 response = DLM_MASTER_RESP_YES;
1491 /* this node will be the owner.
1492 * go back and clean the mles on any
1494 dispatch_assert = 1;
1496 response = DLM_MASTER_RESP_NO;
1498 // mlog(0, "this node is attempting to "
1499 // "master lockres\n");
1500 response = DLM_MASTER_RESP_MAYBE;
1503 set_bit(request->node_idx, tmpmle->maybe_map);
1504 spin_unlock(&tmpmle->spinlock);
1506 spin_unlock(&dlm->master_lock);
1507 spin_unlock(&res->spinlock);
1509 /* keep the mle attached to heartbeat events */
1510 dlm_put_mle(tmpmle);
1512 kmem_cache_free(dlm_mle_cache, mle);
1517 * lockres doesn't exist on this node
1518 * if there is an MLE_BLOCK, return NO
1519 * if there is an MLE_MASTER, return MAYBE
1520 * otherwise, add an MLE_BLOCK, return NO
1522 spin_lock(&dlm->master_lock);
1523 found = dlm_find_mle(dlm, &tmpmle, name, namelen);
1525 /* this lockid has never been seen on this node yet */
1526 // mlog(0, "no mle found\n");
1528 spin_unlock(&dlm->master_lock);
1529 spin_unlock(&dlm->spinlock);
1531 mle = (struct dlm_master_list_entry *)
1532 kmem_cache_alloc(dlm_mle_cache, GFP_KERNEL);
1534 response = DLM_MASTER_RESP_ERROR;
1535 mlog_errno(-ENOMEM);
1541 // mlog(0, "this is second time thru, already allocated, "
1542 // "add the block.\n");
1543 dlm_init_mle(mle, DLM_MLE_BLOCK, dlm, NULL, name, namelen);
1544 set_bit(request->node_idx, mle->maybe_map);
1545 list_add(&mle->list, &dlm->master_list);
1546 response = DLM_MASTER_RESP_NO;
1548 // mlog(0, "mle was found\n");
1550 spin_lock(&tmpmle->spinlock);
1551 if (tmpmle->master == dlm->node_num) {
1552 mlog(ML_ERROR, "no lockres, but an mle with this node as master!\n");
1555 if (tmpmle->type == DLM_MLE_BLOCK)
1556 response = DLM_MASTER_RESP_NO;
1557 else if (tmpmle->type == DLM_MLE_MIGRATION) {
1558 mlog(0, "migration mle was found (%u->%u)\n",
1559 tmpmle->master, tmpmle->new_master);
1560 /* real master can respond on its own */
1561 response = DLM_MASTER_RESP_NO;
1563 response = DLM_MASTER_RESP_MAYBE;
1565 set_bit(request->node_idx, tmpmle->maybe_map);
1566 spin_unlock(&tmpmle->spinlock);
1568 spin_unlock(&dlm->master_lock);
1569 spin_unlock(&dlm->spinlock);
1572 /* keep the mle attached to heartbeat events */
1573 dlm_put_mle(tmpmle);
1577 if (dispatch_assert) {
1578 if (response != DLM_MASTER_RESP_YES)
1579 mlog(ML_ERROR, "invalid response %d\n", response);
1581 mlog(ML_ERROR, "bad lockres while trying to assert!\n");
1584 mlog(0, "%u is the owner of %.*s, cleaning everyone else\n",
1585 dlm->node_num, res->lockname.len, res->lockname.name);
1586 ret = dlm_dispatch_assert_master(dlm, res, 0, request->node_idx,
1587 DLM_ASSERT_MASTER_MLE_CLEANUP);
1589 mlog(ML_ERROR, "failed to dispatch assert master work\n");
1590 response = DLM_MASTER_RESP_ERROR;
1599 * DLM_ASSERT_MASTER_MSG
1604 * NOTE: this can be used for debugging
1605 * can periodically run all locks owned by this node
1606 * and re-assert across the cluster...
1608 static int dlm_do_assert_master(struct dlm_ctxt *dlm, const char *lockname,
1609 unsigned int namelen, void *nodemap,
1612 struct dlm_assert_master assert;
1614 struct dlm_node_iter iter;
1618 BUG_ON(namelen > O2NM_MAX_NAME_LEN);
1622 /* note that if this nodemap is empty, it returns 0 */
1623 dlm_node_iter_init(nodemap, &iter);
1624 while ((to = dlm_node_iter_next(&iter)) >= 0) {
1626 struct dlm_master_list_entry *mle = NULL;
1628 mlog(0, "sending assert master to %d (%.*s)\n", to,
1630 memset(&assert, 0, sizeof(assert));
1631 assert.node_idx = dlm->node_num;
1632 assert.namelen = namelen;
1633 memcpy(assert.name, lockname, namelen);
1634 assert.flags = cpu_to_be32(flags);
1636 tmpret = o2net_send_message(DLM_ASSERT_MASTER_MSG, dlm->key,
1637 &assert, sizeof(assert), to, &r);
1639 mlog(ML_ERROR, "assert_master returned %d!\n", tmpret);
1640 if (!dlm_is_host_down(tmpret)) {
1641 mlog(ML_ERROR, "unhandled error!\n");
1644 /* a node died. finish out the rest of the nodes. */
1645 mlog(ML_ERROR, "link to %d went down!\n", to);
1646 /* any nonzero status return will do */
1649 /* ok, something horribly messed. kill thyself. */
1650 mlog(ML_ERROR,"during assert master of %.*s to %u, "
1651 "got %d.\n", namelen, lockname, to, r);
1652 spin_lock(&dlm->spinlock);
1653 spin_lock(&dlm->master_lock);
1654 if (dlm_find_mle(dlm, &mle, (char *)lockname,
1656 dlm_print_one_mle(mle);
1659 spin_unlock(&dlm->master_lock);
1660 spin_unlock(&dlm->spinlock);
1662 } else if (r == EAGAIN) {
1663 mlog(0, "%.*s: node %u create mles on other "
1664 "nodes and requests a re-assert\n",
1665 namelen, lockname, to);
1677 * locks that can be taken here:
1683 * if possible, TRIM THIS DOWN!!!
1685 int dlm_assert_master_handler(struct o2net_msg *msg, u32 len, void *data)
1687 struct dlm_ctxt *dlm = data;
1688 struct dlm_master_list_entry *mle = NULL;
1689 struct dlm_assert_master *assert = (struct dlm_assert_master *)msg->buf;
1690 struct dlm_lock_resource *res = NULL;
1692 unsigned int namelen, hash;
1694 int master_request = 0;
1700 name = assert->name;
1701 namelen = assert->namelen;
1702 hash = dlm_lockid_hash(name, namelen);
1703 flags = be32_to_cpu(assert->flags);
1705 if (namelen > DLM_LOCKID_NAME_MAX) {
1706 mlog(ML_ERROR, "Invalid name length!");
1710 spin_lock(&dlm->spinlock);
1713 mlog(0, "assert_master with flags: %u\n", flags);
1716 spin_lock(&dlm->master_lock);
1717 if (!dlm_find_mle(dlm, &mle, name, namelen)) {
1718 /* not an error, could be master just re-asserting */
1719 mlog(0, "just got an assert_master from %u, but no "
1720 "MLE for it! (%.*s)\n", assert->node_idx,
1723 int bit = find_next_bit (mle->maybe_map, O2NM_MAX_NODES, 0);
1724 if (bit >= O2NM_MAX_NODES) {
1725 /* not necessarily an error, though less likely.
1726 * could be master just re-asserting. */
1727 mlog(0, "no bits set in the maybe_map, but %u "
1728 "is asserting! (%.*s)\n", assert->node_idx,
1730 } else if (bit != assert->node_idx) {
1731 if (flags & DLM_ASSERT_MASTER_MLE_CLEANUP) {
1732 mlog(0, "master %u was found, %u should "
1733 "back off\n", assert->node_idx, bit);
1735 /* with the fix for bug 569, a higher node
1736 * number winning the mastery will respond
1737 * YES to mastery requests, but this node
1738 * had no way of knowing. let it pass. */
1739 mlog(0, "%u is the lowest node, "
1740 "%u is asserting. (%.*s) %u must "
1741 "have begun after %u won.\n", bit,
1742 assert->node_idx, namelen, name, bit,
1746 if (mle->type == DLM_MLE_MIGRATION) {
1747 if (flags & DLM_ASSERT_MASTER_MLE_CLEANUP) {
1748 mlog(0, "%s:%.*s: got cleanup assert"
1749 " from %u for migration\n",
1750 dlm->name, namelen, name,
1752 } else if (!(flags & DLM_ASSERT_MASTER_FINISH_MIGRATION)) {
1753 mlog(0, "%s:%.*s: got unrelated assert"
1754 " from %u for migration, ignoring\n",
1755 dlm->name, namelen, name,
1758 spin_unlock(&dlm->master_lock);
1759 spin_unlock(&dlm->spinlock);
1764 spin_unlock(&dlm->master_lock);
1766 /* ok everything checks out with the MLE
1767 * now check to see if there is a lockres */
1768 res = __dlm_lookup_lockres(dlm, name, namelen, hash);
1770 spin_lock(&res->spinlock);
1771 if (res->state & DLM_LOCK_RES_RECOVERING) {
1772 mlog(ML_ERROR, "%u asserting but %.*s is "
1773 "RECOVERING!\n", assert->node_idx, namelen, name);
1777 if (res->owner != DLM_LOCK_RES_OWNER_UNKNOWN &&
1778 res->owner != assert->node_idx) {
1779 mlog(ML_ERROR, "assert_master from "
1780 "%u, but current owner is "
1782 assert->node_idx, res->owner,
1786 } else if (mle->type != DLM_MLE_MIGRATION) {
1787 if (res->owner != DLM_LOCK_RES_OWNER_UNKNOWN) {
1788 /* owner is just re-asserting */
1789 if (res->owner == assert->node_idx) {
1790 mlog(0, "owner %u re-asserting on "
1791 "lock %.*s\n", assert->node_idx,
1795 mlog(ML_ERROR, "got assert_master from "
1796 "node %u, but %u is the owner! "
1797 "(%.*s)\n", assert->node_idx,
1798 res->owner, namelen, name);
1801 if (!(res->state & DLM_LOCK_RES_IN_PROGRESS)) {
1802 mlog(ML_ERROR, "got assert from %u, but lock "
1803 "with no owner should be "
1804 "in-progress! (%.*s)\n",
1809 } else /* mle->type == DLM_MLE_MIGRATION */ {
1810 /* should only be getting an assert from new master */
1811 if (assert->node_idx != mle->new_master) {
1812 mlog(ML_ERROR, "got assert from %u, but "
1813 "new master is %u, and old master "
1815 assert->node_idx, mle->new_master,
1816 mle->master, namelen, name);
1822 spin_unlock(&res->spinlock);
1824 spin_unlock(&dlm->spinlock);
1826 // mlog(0, "woo! got an assert_master from node %u!\n",
1827 // assert->node_idx);
1833 spin_lock(&mle->spinlock);
1834 if (mle->type == DLM_MLE_BLOCK || mle->type == DLM_MLE_MIGRATION)
1837 /* MASTER mle: if any bits set in the response map
1838 * then the calling node needs to re-assert to clear
1839 * up nodes that this node contacted */
1840 while ((nn = find_next_bit (mle->response_map, O2NM_MAX_NODES,
1841 nn+1)) < O2NM_MAX_NODES) {
1842 if (nn != dlm->node_num && nn != assert->node_idx)
1846 mle->master = assert->node_idx;
1847 atomic_set(&mle->woken, 1);
1849 spin_unlock(&mle->spinlock);
1852 spin_lock(&res->spinlock);
1853 if (mle->type == DLM_MLE_MIGRATION) {
1854 mlog(0, "finishing off migration of lockres %.*s, "
1856 res->lockname.len, res->lockname.name,
1857 dlm->node_num, mle->new_master);
1858 res->state &= ~DLM_LOCK_RES_MIGRATING;
1859 dlm_change_lockres_owner(dlm, res, mle->new_master);
1860 BUG_ON(res->state & DLM_LOCK_RES_DIRTY);
1862 dlm_change_lockres_owner(dlm, res, mle->master);
1864 spin_unlock(&res->spinlock);
1867 /* master is known, detach if not already detached.
1868 * ensures that only one assert_master call will happen
1870 spin_lock(&dlm->spinlock);
1871 spin_lock(&dlm->master_lock);
1873 rr = atomic_read(&mle->mle_refs.refcount);
1874 if (mle->inuse > 0) {
1875 if (extra_ref && rr < 3)
1877 else if (!extra_ref && rr < 2)
1880 if (extra_ref && rr < 2)
1882 else if (!extra_ref && rr < 1)
1886 mlog(ML_ERROR, "%s:%.*s: got assert master from %u "
1887 "that will mess up this node, refs=%d, extra=%d, "
1888 "inuse=%d\n", dlm->name, namelen, name,
1889 assert->node_idx, rr, extra_ref, mle->inuse);
1890 dlm_print_one_mle(mle);
1892 list_del_init(&mle->list);
1893 __dlm_mle_detach_hb_events(dlm, mle);
1896 /* the assert master message now balances the extra
1897 * ref given by the master / migration request message.
1898 * if this is the last put, it will be removed
1902 spin_unlock(&dlm->master_lock);
1903 spin_unlock(&dlm->spinlock);
1905 if (res->owner != assert->node_idx) {
1906 mlog(0, "assert_master from %u, but current "
1907 "owner is %u (%.*s), no mle\n", assert->node_idx,
1908 res->owner, namelen, name);
1915 dlm_lockres_put(res);
1917 if (master_request) {
1918 mlog(0, "need to tell master to reassert\n");
1919 ret = EAGAIN; // positive. negative would shoot down the node.
1924 /* kill the caller! */
1925 mlog(ML_ERROR, "Bad message received from another node. Dumping state "
1926 "and killing the other node now! This node is OK and can continue.\n");
1927 __dlm_print_one_lock_resource(res);
1928 spin_unlock(&res->spinlock);
1929 spin_unlock(&dlm->spinlock);
1930 dlm_lockres_put(res);
1935 int dlm_dispatch_assert_master(struct dlm_ctxt *dlm,
1936 struct dlm_lock_resource *res,
1937 int ignore_higher, u8 request_from, u32 flags)
1939 struct dlm_work_item *item;
1940 item = kcalloc(1, sizeof(*item), GFP_KERNEL);
1945 /* queue up work for dlm_assert_master_worker */
1946 dlm_grab(dlm); /* get an extra ref for the work item */
1947 dlm_init_work_item(dlm, item, dlm_assert_master_worker, NULL);
1948 item->u.am.lockres = res; /* already have a ref */
1949 /* can optionally ignore node numbers higher than this node */
1950 item->u.am.ignore_higher = ignore_higher;
1951 item->u.am.request_from = request_from;
1952 item->u.am.flags = flags;
1955 mlog(0, "IGNORE HIGHER: %.*s\n", res->lockname.len,
1956 res->lockname.name);
1958 spin_lock(&dlm->work_lock);
1959 list_add_tail(&item->list, &dlm->work_list);
1960 spin_unlock(&dlm->work_lock);
1962 schedule_work(&dlm->dispatched_work);
1966 static void dlm_assert_master_worker(struct dlm_work_item *item, void *data)
1968 struct dlm_ctxt *dlm = data;
1970 struct dlm_lock_resource *res;
1971 unsigned long nodemap[BITS_TO_LONGS(O2NM_MAX_NODES)];
1978 res = item->u.am.lockres;
1979 ignore_higher = item->u.am.ignore_higher;
1980 request_from = item->u.am.request_from;
1981 flags = item->u.am.flags;
1983 spin_lock(&dlm->spinlock);
1984 memcpy(nodemap, dlm->domain_map, sizeof(nodemap));
1985 spin_unlock(&dlm->spinlock);
1987 clear_bit(dlm->node_num, nodemap);
1988 if (ignore_higher) {
1989 /* if is this just to clear up mles for nodes below
1990 * this node, do not send the message to the original
1991 * caller or any node number higher than this */
1992 clear_bit(request_from, nodemap);
1993 bit = dlm->node_num;
1995 bit = find_next_bit(nodemap, O2NM_MAX_NODES,
1997 if (bit >= O2NM_MAX_NODES)
1999 clear_bit(bit, nodemap);
2003 /* this call now finishes out the nodemap
2004 * even if one or more nodes die */
2005 mlog(0, "worker about to master %.*s here, this=%u\n",
2006 res->lockname.len, res->lockname.name, dlm->node_num);
2007 ret = dlm_do_assert_master(dlm, res->lockname.name,
2011 /* no need to restart, we are done */
2015 dlm_lockres_put(res);
2017 mlog(0, "finished with dlm_assert_master_worker\n");
2020 /* SPECIAL CASE for the $RECOVERY lock used by the recovery thread.
2021 * We cannot wait for node recovery to complete to begin mastering this
2022 * lockres because this lockres is used to kick off recovery! ;-)
2023 * So, do a pre-check on all living nodes to see if any of those nodes
2024 * think that $RECOVERY is currently mastered by a dead node. If so,
2025 * we wait a short time to allow that node to get notified by its own
2026 * heartbeat stack, then check again. All $RECOVERY lock resources
2027 * mastered by dead nodes are purged when the hearbeat callback is
2028 * fired, so we can know for sure that it is safe to continue once
2029 * the node returns a live node or no node. */
2030 static int dlm_pre_master_reco_lockres(struct dlm_ctxt *dlm,
2031 struct dlm_lock_resource *res)
2033 struct dlm_node_iter iter;
2036 u8 master = DLM_LOCK_RES_OWNER_UNKNOWN;
2038 spin_lock(&dlm->spinlock);
2039 dlm_node_iter_init(dlm->domain_map, &iter);
2040 spin_unlock(&dlm->spinlock);
2042 while ((nodenum = dlm_node_iter_next(&iter)) >= 0) {
2043 /* do not send to self */
2044 if (nodenum == dlm->node_num)
2046 ret = dlm_do_master_requery(dlm, res, nodenum, &master);
2049 if (!dlm_is_host_down(ret))
2051 /* host is down, so answer for that node would be
2052 * DLM_LOCK_RES_OWNER_UNKNOWN. continue. */
2055 if (master != DLM_LOCK_RES_OWNER_UNKNOWN) {
2056 /* check to see if this master is in the recovery map */
2057 spin_lock(&dlm->spinlock);
2058 if (test_bit(master, dlm->recovery_map)) {
2059 mlog(ML_NOTICE, "%s: node %u has not seen "
2060 "node %u go down yet, and thinks the "
2061 "dead node is mastering the recovery "
2062 "lock. must wait.\n", dlm->name,
2066 spin_unlock(&dlm->spinlock);
2067 mlog(0, "%s: reco lock master is %u\n", dlm->name,
2077 * DLM_MIGRATE_LOCKRES
2081 int dlm_migrate_lockres(struct dlm_ctxt *dlm, struct dlm_lock_resource *res,
2084 struct dlm_master_list_entry *mle = NULL;
2085 struct dlm_master_list_entry *oldmle = NULL;
2086 struct dlm_migratable_lockres *mres = NULL;
2089 unsigned int namelen;
2091 struct list_head *queue, *iter;
2093 struct dlm_lock *lock;
2099 name = res->lockname.name;
2100 namelen = res->lockname.len;
2102 mlog(0, "migrating %.*s to %u\n", namelen, name, target);
2105 * ensure this lockres is a proper candidate for migration
2107 spin_lock(&res->spinlock);
2108 if (res->owner == DLM_LOCK_RES_OWNER_UNKNOWN) {
2109 mlog(0, "cannot migrate lockres with unknown owner!\n");
2110 spin_unlock(&res->spinlock);
2113 if (res->owner != dlm->node_num) {
2114 mlog(0, "cannot migrate lockres this node doesn't own!\n");
2115 spin_unlock(&res->spinlock);
2118 mlog(0, "checking queues...\n");
2119 queue = &res->granted;
2120 for (i=0; i<3; i++) {
2121 list_for_each(iter, queue) {
2122 lock = list_entry (iter, struct dlm_lock, list);
2124 if (lock->ml.node == dlm->node_num) {
2125 mlog(0, "found a lock owned by this node "
2126 "still on the %s queue! will not "
2127 "migrate this lockres\n",
2129 (i==1 ? "converting" : "blocked"));
2130 spin_unlock(&res->spinlock);
2137 mlog(0, "all locks on this lockres are nonlocal. continuing\n");
2138 spin_unlock(&res->spinlock);
2142 mlog(0, "no locks were found on this lockres! done!\n");
2148 * preallocate up front
2149 * if this fails, abort
2153 mres = (struct dlm_migratable_lockres *) __get_free_page(GFP_KERNEL);
2159 mle = (struct dlm_master_list_entry *) kmem_cache_alloc(dlm_mle_cache,
2168 * find a node to migrate the lockres to
2171 mlog(0, "picking a migration node\n");
2172 spin_lock(&dlm->spinlock);
2173 /* pick a new node */
2174 if (!test_bit(target, dlm->domain_map) ||
2175 target >= O2NM_MAX_NODES) {
2176 target = dlm_pick_migration_target(dlm, res);
2178 mlog(0, "node %u chosen for migration\n", target);
2180 if (target >= O2NM_MAX_NODES ||
2181 !test_bit(target, dlm->domain_map)) {
2182 /* target chosen is not alive */
2187 spin_unlock(&dlm->spinlock);
2191 mlog(0, "continuing with target = %u\n", target);
2194 * clear any existing master requests and
2195 * add the migration mle to the list
2197 spin_lock(&dlm->master_lock);
2198 ret = dlm_add_migration_mle(dlm, res, mle, &oldmle, name,
2199 namelen, target, dlm->node_num);
2200 spin_unlock(&dlm->master_lock);
2201 spin_unlock(&dlm->spinlock);
2203 if (ret == -EEXIST) {
2204 mlog(0, "another process is already migrating it\n");
2210 * set the MIGRATING flag and flush asts
2211 * if we fail after this we need to re-dirty the lockres
2213 if (dlm_mark_lockres_migrating(dlm, res, target) < 0) {
2214 mlog(ML_ERROR, "tried to migrate %.*s to %u, but "
2215 "the target went down.\n", res->lockname.len,
2216 res->lockname.name, target);
2217 spin_lock(&res->spinlock);
2218 res->state &= ~DLM_LOCK_RES_MIGRATING;
2219 spin_unlock(&res->spinlock);
2225 /* master is known, detach if not already detached */
2226 dlm_mle_detach_hb_events(dlm, oldmle);
2227 dlm_put_mle(oldmle);
2232 dlm_mle_detach_hb_events(dlm, mle);
2235 kmem_cache_free(dlm_mle_cache, mle);
2241 * at this point, we have a migration target, an mle
2242 * in the master list, and the MIGRATING flag set on
2247 /* get an extra reference on the mle.
2248 * otherwise the assert_master from the new
2249 * master will destroy this.
2250 * also, make sure that all callers of dlm_get_mle
2251 * take both dlm->spinlock and dlm->master_lock */
2252 spin_lock(&dlm->spinlock);
2253 spin_lock(&dlm->master_lock);
2254 dlm_get_mle_inuse(mle);
2255 spin_unlock(&dlm->master_lock);
2256 spin_unlock(&dlm->spinlock);
2258 /* notify new node and send all lock state */
2259 /* call send_one_lockres with migration flag.
2260 * this serves as notice to the target node that a
2261 * migration is starting. */
2262 ret = dlm_send_one_lockres(dlm, res, mres, target,
2263 DLM_MRES_MIGRATION);
2266 mlog(0, "migration to node %u failed with %d\n",
2268 /* migration failed, detach and clean up mle */
2269 dlm_mle_detach_hb_events(dlm, mle);
2271 dlm_put_mle_inuse(mle);
2272 spin_lock(&res->spinlock);
2273 res->state &= ~DLM_LOCK_RES_MIGRATING;
2274 spin_unlock(&res->spinlock);
2278 /* at this point, the target sends a message to all nodes,
2279 * (using dlm_do_migrate_request). this node is skipped since
2280 * we had to put an mle in the list to begin the process. this
2281 * node now waits for target to do an assert master. this node
2282 * will be the last one notified, ensuring that the migration
2283 * is complete everywhere. if the target dies while this is
2284 * going on, some nodes could potentially see the target as the
2285 * master, so it is important that my recovery finds the migration
2286 * mle and sets the master to UNKNONWN. */
2289 /* wait for new node to assert master */
2291 ret = wait_event_interruptible_timeout(mle->wq,
2292 (atomic_read(&mle->woken) == 1),
2293 msecs_to_jiffies(5000));
2296 if (atomic_read(&mle->woken) == 1 ||
2297 res->owner == target)
2300 mlog(0, "timed out during migration\n");
2301 /* avoid hang during shutdown when migrating lockres
2302 * to a node which also goes down */
2303 if (dlm_is_node_dead(dlm, target)) {
2304 mlog(0, "%s:%.*s: expected migration "
2305 "target %u is no longer up, restarting\n",
2306 dlm->name, res->lockname.len,
2307 res->lockname.name, target);
2311 if (ret == -ERESTARTSYS) {
2312 /* migration failed, detach and clean up mle */
2313 dlm_mle_detach_hb_events(dlm, mle);
2315 dlm_put_mle_inuse(mle);
2316 spin_lock(&res->spinlock);
2317 res->state &= ~DLM_LOCK_RES_MIGRATING;
2318 spin_unlock(&res->spinlock);
2321 /* TODO: if node died: stop, clean up, return error */
2324 /* all done, set the owner, clear the flag */
2325 spin_lock(&res->spinlock);
2326 dlm_set_lockres_owner(dlm, res, target);
2327 res->state &= ~DLM_LOCK_RES_MIGRATING;
2328 dlm_remove_nonlocal_locks(dlm, res);
2329 spin_unlock(&res->spinlock);
2332 /* master is known, detach if not already detached */
2333 dlm_mle_detach_hb_events(dlm, mle);
2334 dlm_put_mle_inuse(mle);
2337 dlm_lockres_calc_usage(dlm, res);
2340 /* re-dirty the lockres if we failed */
2342 dlm_kick_thread(dlm, res);
2346 free_page((unsigned long)mres);
2350 mlog(0, "returning %d\n", ret);
2353 EXPORT_SYMBOL_GPL(dlm_migrate_lockres);
2355 int dlm_lock_basts_flushed(struct dlm_ctxt *dlm, struct dlm_lock *lock)
2358 spin_lock(&dlm->ast_lock);
2359 spin_lock(&lock->spinlock);
2360 ret = (list_empty(&lock->bast_list) && !lock->bast_pending);
2361 spin_unlock(&lock->spinlock);
2362 spin_unlock(&dlm->ast_lock);
2366 static int dlm_migration_can_proceed(struct dlm_ctxt *dlm,
2367 struct dlm_lock_resource *res,
2371 spin_lock(&res->spinlock);
2372 can_proceed = !!(res->state & DLM_LOCK_RES_MIGRATING);
2373 spin_unlock(&res->spinlock);
2375 /* target has died, so make the caller break out of the
2376 * wait_event, but caller must recheck the domain_map */
2377 spin_lock(&dlm->spinlock);
2378 if (!test_bit(mig_target, dlm->domain_map))
2380 spin_unlock(&dlm->spinlock);
2384 int dlm_lockres_is_dirty(struct dlm_ctxt *dlm, struct dlm_lock_resource *res)
2387 spin_lock(&res->spinlock);
2388 ret = !!(res->state & DLM_LOCK_RES_DIRTY);
2389 spin_unlock(&res->spinlock);
2394 static int dlm_mark_lockres_migrating(struct dlm_ctxt *dlm,
2395 struct dlm_lock_resource *res,
2400 mlog(0, "dlm_mark_lockres_migrating: %.*s, from %u to %u\n",
2401 res->lockname.len, res->lockname.name, dlm->node_num,
2403 /* need to set MIGRATING flag on lockres. this is done by
2404 * ensuring that all asts have been flushed for this lockres. */
2405 spin_lock(&res->spinlock);
2406 BUG_ON(res->migration_pending);
2407 res->migration_pending = 1;
2408 /* strategy is to reserve an extra ast then release
2409 * it below, letting the release do all of the work */
2410 __dlm_lockres_reserve_ast(res);
2411 spin_unlock(&res->spinlock);
2413 /* now flush all the pending asts.. hang out for a bit */
2414 dlm_kick_thread(dlm, res);
2415 wait_event(dlm->ast_wq, !dlm_lockres_is_dirty(dlm, res));
2416 dlm_lockres_release_ast(dlm, res);
2418 mlog(0, "about to wait on migration_wq, dirty=%s\n",
2419 res->state & DLM_LOCK_RES_DIRTY ? "yes" : "no");
2420 /* if the extra ref we just put was the final one, this
2421 * will pass thru immediately. otherwise, we need to wait
2422 * for the last ast to finish. */
2424 ret = wait_event_interruptible_timeout(dlm->migration_wq,
2425 dlm_migration_can_proceed(dlm, res, target),
2426 msecs_to_jiffies(1000));
2428 mlog(0, "woken again: migrating? %s, dead? %s\n",
2429 res->state & DLM_LOCK_RES_MIGRATING ? "yes":"no",
2430 test_bit(target, dlm->domain_map) ? "no":"yes");
2432 mlog(0, "all is well: migrating? %s, dead? %s\n",
2433 res->state & DLM_LOCK_RES_MIGRATING ? "yes":"no",
2434 test_bit(target, dlm->domain_map) ? "no":"yes");
2436 if (!dlm_migration_can_proceed(dlm, res, target)) {
2437 mlog(0, "trying again...\n");
2441 /* did the target go down or die? */
2442 spin_lock(&dlm->spinlock);
2443 if (!test_bit(target, dlm->domain_map)) {
2444 mlog(ML_ERROR, "aha. migration target %u just went down\n",
2448 spin_unlock(&dlm->spinlock);
2453 * o the DLM_LOCK_RES_MIGRATING flag is set
2454 * o there are no pending asts on this lockres
2455 * o all processes trying to reserve an ast on this
2456 * lockres must wait for the MIGRATING flag to clear
2461 /* last step in the migration process.
2462 * original master calls this to free all of the dlm_lock
2463 * structures that used to be for other nodes. */
2464 static void dlm_remove_nonlocal_locks(struct dlm_ctxt *dlm,
2465 struct dlm_lock_resource *res)
2467 struct list_head *iter, *iter2;
2468 struct list_head *queue = &res->granted;
2470 struct dlm_lock *lock;
2472 assert_spin_locked(&res->spinlock);
2474 BUG_ON(res->owner == dlm->node_num);
2476 for (i=0; i<3; i++) {
2477 list_for_each_safe(iter, iter2, queue) {
2478 lock = list_entry (iter, struct dlm_lock, list);
2479 if (lock->ml.node != dlm->node_num) {
2480 mlog(0, "putting lock for node %u\n",
2482 /* be extra careful */
2483 BUG_ON(!list_empty(&lock->ast_list));
2484 BUG_ON(!list_empty(&lock->bast_list));
2485 BUG_ON(lock->ast_pending);
2486 BUG_ON(lock->bast_pending);
2487 list_del_init(&lock->list);
2495 /* for now this is not too intelligent. we will
2496 * need stats to make this do the right thing.
2497 * this just finds the first lock on one of the
2498 * queues and uses that node as the target. */
2499 static u8 dlm_pick_migration_target(struct dlm_ctxt *dlm,
2500 struct dlm_lock_resource *res)
2503 struct list_head *queue = &res->granted;
2504 struct list_head *iter;
2505 struct dlm_lock *lock;
2508 assert_spin_locked(&dlm->spinlock);
2510 spin_lock(&res->spinlock);
2511 for (i=0; i<3; i++) {
2512 list_for_each(iter, queue) {
2513 /* up to the caller to make sure this node
2515 lock = list_entry (iter, struct dlm_lock, list);
2516 if (lock->ml.node != dlm->node_num) {
2517 spin_unlock(&res->spinlock);
2518 return lock->ml.node;
2523 spin_unlock(&res->spinlock);
2524 mlog(0, "have not found a suitable target yet! checking domain map\n");
2526 /* ok now we're getting desperate. pick anyone alive. */
2529 nodenum = find_next_bit(dlm->domain_map,
2530 O2NM_MAX_NODES, nodenum+1);
2531 mlog(0, "found %d in domain map\n", nodenum);
2532 if (nodenum >= O2NM_MAX_NODES)
2534 if (nodenum != dlm->node_num) {
2535 mlog(0, "picking %d\n", nodenum);
2540 mlog(0, "giving up. no master to migrate to\n");
2541 return DLM_LOCK_RES_OWNER_UNKNOWN;
2546 /* this is called by the new master once all lockres
2547 * data has been received */
2548 static int dlm_do_migrate_request(struct dlm_ctxt *dlm,
2549 struct dlm_lock_resource *res,
2550 u8 master, u8 new_master,
2551 struct dlm_node_iter *iter)
2553 struct dlm_migrate_request migrate;
2554 int ret, status = 0;
2557 memset(&migrate, 0, sizeof(migrate));
2558 migrate.namelen = res->lockname.len;
2559 memcpy(migrate.name, res->lockname.name, migrate.namelen);
2560 migrate.new_master = new_master;
2561 migrate.master = master;
2565 /* send message to all nodes, except the master and myself */
2566 while ((nodenum = dlm_node_iter_next(iter)) >= 0) {
2567 if (nodenum == master ||
2568 nodenum == new_master)
2571 ret = o2net_send_message(DLM_MIGRATE_REQUEST_MSG, dlm->key,
2572 &migrate, sizeof(migrate), nodenum,
2576 else if (status < 0) {
2577 mlog(0, "migrate request (node %u) returned %d!\n",
2586 mlog(0, "returning ret=%d\n", ret);
2591 /* if there is an existing mle for this lockres, we now know who the master is.
2592 * (the one who sent us *this* message) we can clear it up right away.
2593 * since the process that put the mle on the list still has a reference to it,
2594 * we can unhash it now, set the master and wake the process. as a result,
2595 * we will have no mle in the list to start with. now we can add an mle for
2596 * the migration and this should be the only one found for those scanning the
2598 int dlm_migrate_request_handler(struct o2net_msg *msg, u32 len, void *data)
2600 struct dlm_ctxt *dlm = data;
2601 struct dlm_lock_resource *res = NULL;
2602 struct dlm_migrate_request *migrate = (struct dlm_migrate_request *) msg->buf;
2603 struct dlm_master_list_entry *mle = NULL, *oldmle = NULL;
2605 unsigned int namelen, hash;
2611 name = migrate->name;
2612 namelen = migrate->namelen;
2613 hash = dlm_lockid_hash(name, namelen);
2615 /* preallocate.. if this fails, abort */
2616 mle = (struct dlm_master_list_entry *) kmem_cache_alloc(dlm_mle_cache,
2624 /* check for pre-existing lock */
2625 spin_lock(&dlm->spinlock);
2626 res = __dlm_lookup_lockres(dlm, name, namelen, hash);
2627 spin_lock(&dlm->master_lock);
2630 spin_lock(&res->spinlock);
2631 if (res->state & DLM_LOCK_RES_RECOVERING) {
2632 /* if all is working ok, this can only mean that we got
2633 * a migrate request from a node that we now see as
2634 * dead. what can we do here? drop it to the floor? */
2635 spin_unlock(&res->spinlock);
2636 mlog(ML_ERROR, "Got a migrate request, but the "
2637 "lockres is marked as recovering!");
2638 kmem_cache_free(dlm_mle_cache, mle);
2639 ret = -EINVAL; /* need a better solution */
2642 res->state |= DLM_LOCK_RES_MIGRATING;
2643 spin_unlock(&res->spinlock);
2646 /* ignore status. only nonzero status would BUG. */
2647 ret = dlm_add_migration_mle(dlm, res, mle, &oldmle,
2649 migrate->new_master,
2653 spin_unlock(&dlm->master_lock);
2654 spin_unlock(&dlm->spinlock);
2657 /* master is known, detach if not already detached */
2658 dlm_mle_detach_hb_events(dlm, oldmle);
2659 dlm_put_mle(oldmle);
2663 dlm_lockres_put(res);
2669 /* must be holding dlm->spinlock and dlm->master_lock
2670 * when adding a migration mle, we can clear any other mles
2671 * in the master list because we know with certainty that
2672 * the master is "master". so we remove any old mle from
2673 * the list after setting it's master field, and then add
2674 * the new migration mle. this way we can hold with the rule
2675 * of having only one mle for a given lock name at all times. */
2676 static int dlm_add_migration_mle(struct dlm_ctxt *dlm,
2677 struct dlm_lock_resource *res,
2678 struct dlm_master_list_entry *mle,
2679 struct dlm_master_list_entry **oldmle,
2680 const char *name, unsigned int namelen,
2681 u8 new_master, u8 master)
2690 assert_spin_locked(&dlm->spinlock);
2691 assert_spin_locked(&dlm->master_lock);
2693 /* caller is responsible for any ref taken here on oldmle */
2694 found = dlm_find_mle(dlm, oldmle, (char *)name, namelen);
2696 struct dlm_master_list_entry *tmp = *oldmle;
2697 spin_lock(&tmp->spinlock);
2698 if (tmp->type == DLM_MLE_MIGRATION) {
2699 if (master == dlm->node_num) {
2700 /* ah another process raced me to it */
2701 mlog(0, "tried to migrate %.*s, but some "
2702 "process beat me to it\n",
2706 /* bad. 2 NODES are trying to migrate! */
2707 mlog(ML_ERROR, "migration error mle: "
2708 "master=%u new_master=%u // request: "
2709 "master=%u new_master=%u // "
2711 tmp->master, tmp->new_master,
2717 /* this is essentially what assert_master does */
2718 tmp->master = master;
2719 atomic_set(&tmp->woken, 1);
2721 /* remove it from the list so that only one
2722 * mle will be found */
2723 list_del_init(&tmp->list);
2724 __dlm_mle_detach_hb_events(dlm, mle);
2726 spin_unlock(&tmp->spinlock);
2729 /* now add a migration mle to the tail of the list */
2730 dlm_init_mle(mle, DLM_MLE_MIGRATION, dlm, res, name, namelen);
2731 mle->new_master = new_master;
2732 mle->master = master;
2733 /* do this for consistency with other mle types */
2734 set_bit(new_master, mle->maybe_map);
2735 list_add(&mle->list, &dlm->master_list);
2741 void dlm_clean_master_list(struct dlm_ctxt *dlm, u8 dead_node)
2743 struct list_head *iter, *iter2;
2744 struct dlm_master_list_entry *mle;
2745 struct dlm_lock_resource *res;
2748 mlog_entry("dlm=%s, dead node=%u\n", dlm->name, dead_node);
2750 assert_spin_locked(&dlm->spinlock);
2752 /* clean the master list */
2753 spin_lock(&dlm->master_lock);
2754 list_for_each_safe(iter, iter2, &dlm->master_list) {
2755 mle = list_entry(iter, struct dlm_master_list_entry, list);
2757 BUG_ON(mle->type != DLM_MLE_BLOCK &&
2758 mle->type != DLM_MLE_MASTER &&
2759 mle->type != DLM_MLE_MIGRATION);
2761 /* MASTER mles are initiated locally. the waiting
2762 * process will notice the node map change
2763 * shortly. let that happen as normal. */
2764 if (mle->type == DLM_MLE_MASTER)
2768 /* BLOCK mles are initiated by other nodes.
2769 * need to clean up if the dead node would have
2770 * been the master. */
2771 if (mle->type == DLM_MLE_BLOCK) {
2774 spin_lock(&mle->spinlock);
2775 bit = find_next_bit(mle->maybe_map, O2NM_MAX_NODES, 0);
2776 if (bit != dead_node) {
2777 mlog(0, "mle found, but dead node %u would "
2778 "not have been master\n", dead_node);
2779 spin_unlock(&mle->spinlock);
2781 /* must drop the refcount by one since the
2782 * assert_master will never arrive. this
2783 * may result in the mle being unlinked and
2784 * freed, but there may still be a process
2785 * waiting in the dlmlock path which is fine. */
2786 mlog(ML_ERROR, "node %u was expected master\n",
2788 atomic_set(&mle->woken, 1);
2789 spin_unlock(&mle->spinlock);
2791 /* do not need events any longer, so detach
2793 __dlm_mle_detach_hb_events(dlm, mle);
2799 /* everything else is a MIGRATION mle */
2801 /* the rule for MIGRATION mles is that the master
2802 * becomes UNKNOWN if *either* the original or
2803 * the new master dies. all UNKNOWN lockreses
2804 * are sent to whichever node becomes the recovery
2805 * master. the new master is responsible for
2806 * determining if there is still a master for
2807 * this lockres, or if he needs to take over
2808 * mastery. either way, this node should expect
2809 * another message to resolve this. */
2810 if (mle->master != dead_node &&
2811 mle->new_master != dead_node)
2814 /* if we have reached this point, this mle needs to
2815 * be removed from the list and freed. */
2817 /* remove from the list early. NOTE: unlinking
2818 * list_head while in list_for_each_safe */
2819 __dlm_mle_detach_hb_events(dlm, mle);
2820 spin_lock(&mle->spinlock);
2821 list_del_init(&mle->list);
2822 atomic_set(&mle->woken, 1);
2823 spin_unlock(&mle->spinlock);
2826 mlog(0, "%s: node %u died during migration from "
2827 "%u to %u!\n", dlm->name, dead_node,
2828 mle->master, mle->new_master);
2829 /* if there is a lockres associated with this
2830 * mle, find it and set its owner to UNKNOWN */
2831 hash = dlm_lockid_hash(mle->u.name.name, mle->u.name.len);
2832 res = __dlm_lookup_lockres(dlm, mle->u.name.name,
2833 mle->u.name.len, hash);
2835 /* unfortunately if we hit this rare case, our
2836 * lock ordering is messed. we need to drop
2837 * the master lock so that we can take the
2838 * lockres lock, meaning that we will have to
2839 * restart from the head of list. */
2840 spin_unlock(&dlm->master_lock);
2842 /* move lockres onto recovery list */
2843 spin_lock(&res->spinlock);
2844 dlm_set_lockres_owner(dlm, res,
2845 DLM_LOCK_RES_OWNER_UNKNOWN);
2846 dlm_move_lockres_to_recovery_list(dlm, res);
2847 spin_unlock(&res->spinlock);
2848 dlm_lockres_put(res);
2850 /* about to get rid of mle, detach from heartbeat */
2851 __dlm_mle_detach_hb_events(dlm, mle);
2854 spin_lock(&dlm->master_lock);
2856 spin_unlock(&dlm->master_lock);
2862 /* this may be the last reference */
2865 spin_unlock(&dlm->master_lock);
2869 int dlm_finish_migration(struct dlm_ctxt *dlm, struct dlm_lock_resource *res,
2872 struct dlm_node_iter iter;
2875 spin_lock(&dlm->spinlock);
2876 dlm_node_iter_init(dlm->domain_map, &iter);
2877 clear_bit(old_master, iter.node_map);
2878 clear_bit(dlm->node_num, iter.node_map);
2879 spin_unlock(&dlm->spinlock);
2881 mlog(0, "now time to do a migrate request to other nodes\n");
2882 ret = dlm_do_migrate_request(dlm, res, old_master,
2883 dlm->node_num, &iter);
2889 mlog(0, "doing assert master of %.*s to all except the original node\n",
2890 res->lockname.len, res->lockname.name);
2891 /* this call now finishes out the nodemap
2892 * even if one or more nodes die */
2893 ret = dlm_do_assert_master(dlm, res->lockname.name,
2894 res->lockname.len, iter.node_map,
2895 DLM_ASSERT_MASTER_FINISH_MIGRATION);
2897 /* no longer need to retry. all living nodes contacted. */
2902 memset(iter.node_map, 0, sizeof(iter.node_map));
2903 set_bit(old_master, iter.node_map);
2904 mlog(0, "doing assert master of %.*s back to %u\n",
2905 res->lockname.len, res->lockname.name, old_master);
2906 ret = dlm_do_assert_master(dlm, res->lockname.name,
2907 res->lockname.len, iter.node_map,
2908 DLM_ASSERT_MASTER_FINISH_MIGRATION);
2910 mlog(0, "assert master to original master failed "
2912 /* the only nonzero status here would be because of
2913 * a dead original node. we're done. */
2917 /* all done, set the owner, clear the flag */
2918 spin_lock(&res->spinlock);
2919 dlm_set_lockres_owner(dlm, res, dlm->node_num);
2920 res->state &= ~DLM_LOCK_RES_MIGRATING;
2921 spin_unlock(&res->spinlock);
2922 /* re-dirty it on the new master */
2923 dlm_kick_thread(dlm, res);
2930 * LOCKRES AST REFCOUNT
2931 * this is integral to migration
2934 /* for future intent to call an ast, reserve one ahead of time.
2935 * this should be called only after waiting on the lockres
2936 * with dlm_wait_on_lockres, and while still holding the
2937 * spinlock after the call. */
2938 void __dlm_lockres_reserve_ast(struct dlm_lock_resource *res)
2940 assert_spin_locked(&res->spinlock);
2941 if (res->state & DLM_LOCK_RES_MIGRATING) {
2942 __dlm_print_one_lock_resource(res);
2944 BUG_ON(res->state & DLM_LOCK_RES_MIGRATING);
2946 atomic_inc(&res->asts_reserved);
2950 * used to drop the reserved ast, either because it went unused,
2951 * or because the ast/bast was actually called.
2953 * also, if there is a pending migration on this lockres,
2954 * and this was the last pending ast on the lockres,
2955 * atomically set the MIGRATING flag before we drop the lock.
2956 * this is how we ensure that migration can proceed with no
2957 * asts in progress. note that it is ok if the state of the
2958 * queues is such that a lock should be granted in the future
2959 * or that a bast should be fired, because the new master will
2960 * shuffle the lists on this lockres as soon as it is migrated.
2962 void dlm_lockres_release_ast(struct dlm_ctxt *dlm,
2963 struct dlm_lock_resource *res)
2965 if (!atomic_dec_and_lock(&res->asts_reserved, &res->spinlock))
2968 if (!res->migration_pending) {
2969 spin_unlock(&res->spinlock);
2973 BUG_ON(res->state & DLM_LOCK_RES_MIGRATING);
2974 res->migration_pending = 0;
2975 res->state |= DLM_LOCK_RES_MIGRATING;
2976 spin_unlock(&res->spinlock);
2978 wake_up(&dlm->migration_wq);