16714d8e8SKurt Hackel /* -*- mode: c; c-basic-offset: 8; -*- 26714d8e8SKurt Hackel * vim: noexpandtab sw=8 ts=8 sts=0: 36714d8e8SKurt Hackel * 46714d8e8SKurt Hackel * dlmmod.c 56714d8e8SKurt Hackel * 66714d8e8SKurt Hackel * standalone DLM module 76714d8e8SKurt Hackel * 86714d8e8SKurt Hackel * Copyright (C) 2004 Oracle. All rights reserved. 96714d8e8SKurt Hackel * 106714d8e8SKurt Hackel * This program is free software; you can redistribute it and/or 116714d8e8SKurt Hackel * modify it under the terms of the GNU General Public 126714d8e8SKurt Hackel * License as published by the Free Software Foundation; either 136714d8e8SKurt Hackel * version 2 of the License, or (at your option) any later version. 146714d8e8SKurt Hackel * 156714d8e8SKurt Hackel * This program is distributed in the hope that it will be useful, 166714d8e8SKurt Hackel * but WITHOUT ANY WARRANTY; without even the implied warranty of 176714d8e8SKurt Hackel * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 186714d8e8SKurt Hackel * General Public License for more details. 196714d8e8SKurt Hackel * 206714d8e8SKurt Hackel * You should have received a copy of the GNU General Public 216714d8e8SKurt Hackel * License along with this program; if not, write to the 226714d8e8SKurt Hackel * Free Software Foundation, Inc., 59 Temple Place - Suite 330, 236714d8e8SKurt Hackel * Boston, MA 021110-1307, USA. 246714d8e8SKurt Hackel * 256714d8e8SKurt Hackel */ 266714d8e8SKurt Hackel 276714d8e8SKurt Hackel 286714d8e8SKurt Hackel #include <linux/module.h> 296714d8e8SKurt Hackel #include <linux/fs.h> 306714d8e8SKurt Hackel #include <linux/types.h> 316714d8e8SKurt Hackel #include <linux/slab.h> 326714d8e8SKurt Hackel #include <linux/highmem.h> 336714d8e8SKurt Hackel #include <linux/init.h> 346714d8e8SKurt Hackel #include <linux/sysctl.h> 356714d8e8SKurt Hackel #include <linux/random.h> 366714d8e8SKurt Hackel #include <linux/blkdev.h> 376714d8e8SKurt Hackel #include <linux/socket.h> 386714d8e8SKurt Hackel #include <linux/inet.h> 396714d8e8SKurt Hackel #include <linux/spinlock.h> 406714d8e8SKurt Hackel #include <linux/delay.h> 416714d8e8SKurt Hackel 426714d8e8SKurt Hackel 436714d8e8SKurt Hackel #include "cluster/heartbeat.h" 446714d8e8SKurt Hackel #include "cluster/nodemanager.h" 456714d8e8SKurt Hackel #include "cluster/tcp.h" 466714d8e8SKurt Hackel 476714d8e8SKurt Hackel #include "dlmapi.h" 486714d8e8SKurt Hackel #include "dlmcommon.h" 4982353b59SAdrian Bunk #include "dlmdomain.h" 50e5a0334cSSunil Mushran #include "dlmdebug.h" 516714d8e8SKurt Hackel 526714d8e8SKurt Hackel #define MLOG_MASK_PREFIX (ML_DLM|ML_DLM_MASTER) 536714d8e8SKurt Hackel #include "cluster/masklog.h" 546714d8e8SKurt Hackel 556714d8e8SKurt Hackel static void dlm_mle_node_down(struct dlm_ctxt *dlm, 566714d8e8SKurt Hackel struct dlm_master_list_entry *mle, 576714d8e8SKurt Hackel struct o2nm_node *node, 586714d8e8SKurt Hackel int idx); 596714d8e8SKurt Hackel static void dlm_mle_node_up(struct dlm_ctxt *dlm, 606714d8e8SKurt Hackel struct dlm_master_list_entry *mle, 616714d8e8SKurt Hackel struct o2nm_node *node, 626714d8e8SKurt Hackel int idx); 636714d8e8SKurt Hackel 646714d8e8SKurt Hackel static void dlm_assert_master_worker(struct dlm_work_item *item, void *data); 65ba2bf218SKurt Hackel static int dlm_do_assert_master(struct dlm_ctxt *dlm, 66ba2bf218SKurt Hackel struct dlm_lock_resource *res, 67ba2bf218SKurt Hackel void *nodemap, u32 flags); 68f3f85464SSunil Mushran static void dlm_deref_lockres_worker(struct dlm_work_item *item, void *data); 696714d8e8SKurt Hackel 706714d8e8SKurt Hackel static inline int dlm_mle_equal(struct dlm_ctxt *dlm, 716714d8e8SKurt Hackel struct dlm_master_list_entry *mle, 726714d8e8SKurt Hackel const char *name, 736714d8e8SKurt Hackel unsigned int namelen) 746714d8e8SKurt Hackel { 756714d8e8SKurt Hackel if (dlm != mle->dlm) 766714d8e8SKurt Hackel return 0; 776714d8e8SKurt Hackel 787141514bSSunil Mushran if (namelen != mle->mnamelen || 797141514bSSunil Mushran memcmp(name, mle->mname, namelen) != 0) 806714d8e8SKurt Hackel return 0; 81f77a9a78SSunil Mushran 826714d8e8SKurt Hackel return 1; 836714d8e8SKurt Hackel } 846714d8e8SKurt Hackel 851a5c4e2aSFabian Frederick static struct kmem_cache *dlm_lockres_cache; 861a5c4e2aSFabian Frederick static struct kmem_cache *dlm_lockname_cache; 871a5c4e2aSFabian Frederick static struct kmem_cache *dlm_mle_cache; 886714d8e8SKurt Hackel 896714d8e8SKurt Hackel static void dlm_mle_release(struct kref *kref); 906714d8e8SKurt Hackel static void dlm_init_mle(struct dlm_master_list_entry *mle, 916714d8e8SKurt Hackel enum dlm_mle_type type, 926714d8e8SKurt Hackel struct dlm_ctxt *dlm, 936714d8e8SKurt Hackel struct dlm_lock_resource *res, 946714d8e8SKurt Hackel const char *name, 956714d8e8SKurt Hackel unsigned int namelen); 966714d8e8SKurt Hackel static void dlm_put_mle(struct dlm_master_list_entry *mle); 976714d8e8SKurt Hackel static void __dlm_put_mle(struct dlm_master_list_entry *mle); 986714d8e8SKurt Hackel static int dlm_find_mle(struct dlm_ctxt *dlm, 996714d8e8SKurt Hackel struct dlm_master_list_entry **mle, 1006714d8e8SKurt Hackel char *name, unsigned int namelen); 1016714d8e8SKurt Hackel 102ba2bf218SKurt Hackel static int dlm_do_master_request(struct dlm_lock_resource *res, 103ba2bf218SKurt Hackel struct dlm_master_list_entry *mle, int to); 1046714d8e8SKurt Hackel 1056714d8e8SKurt Hackel 1066714d8e8SKurt Hackel static int dlm_wait_for_lock_mastery(struct dlm_ctxt *dlm, 1076714d8e8SKurt Hackel struct dlm_lock_resource *res, 1086714d8e8SKurt Hackel struct dlm_master_list_entry *mle, 1096714d8e8SKurt Hackel int *blocked); 1106714d8e8SKurt Hackel static int dlm_restart_lock_mastery(struct dlm_ctxt *dlm, 1116714d8e8SKurt Hackel struct dlm_lock_resource *res, 1126714d8e8SKurt Hackel struct dlm_master_list_entry *mle, 1136714d8e8SKurt Hackel int blocked); 1146714d8e8SKurt Hackel static int dlm_add_migration_mle(struct dlm_ctxt *dlm, 1156714d8e8SKurt Hackel struct dlm_lock_resource *res, 1166714d8e8SKurt Hackel struct dlm_master_list_entry *mle, 1176714d8e8SKurt Hackel struct dlm_master_list_entry **oldmle, 1186714d8e8SKurt Hackel const char *name, unsigned int namelen, 1196714d8e8SKurt Hackel u8 new_master, u8 master); 1206714d8e8SKurt Hackel 1216714d8e8SKurt Hackel static u8 dlm_pick_migration_target(struct dlm_ctxt *dlm, 1226714d8e8SKurt Hackel struct dlm_lock_resource *res); 1236714d8e8SKurt Hackel static void dlm_remove_nonlocal_locks(struct dlm_ctxt *dlm, 1246714d8e8SKurt Hackel struct dlm_lock_resource *res); 1256714d8e8SKurt Hackel static int dlm_mark_lockres_migrating(struct dlm_ctxt *dlm, 1266714d8e8SKurt Hackel struct dlm_lock_resource *res, 1276714d8e8SKurt Hackel u8 target); 128c03872f5SKurt Hackel static int dlm_pre_master_reco_lockres(struct dlm_ctxt *dlm, 129c03872f5SKurt Hackel struct dlm_lock_resource *res); 1306714d8e8SKurt Hackel 1316714d8e8SKurt Hackel 1326714d8e8SKurt Hackel int dlm_is_host_down(int errno) 1336714d8e8SKurt Hackel { 1346714d8e8SKurt Hackel switch (errno) { 1356714d8e8SKurt Hackel case -EBADF: 1366714d8e8SKurt Hackel case -ECONNREFUSED: 1376714d8e8SKurt Hackel case -ENOTCONN: 1386714d8e8SKurt Hackel case -ECONNRESET: 1396714d8e8SKurt Hackel case -EPIPE: 1406714d8e8SKurt Hackel case -EHOSTDOWN: 1416714d8e8SKurt Hackel case -EHOSTUNREACH: 1426714d8e8SKurt Hackel case -ETIMEDOUT: 1436714d8e8SKurt Hackel case -ECONNABORTED: 1446714d8e8SKurt Hackel case -ENETDOWN: 1456714d8e8SKurt Hackel case -ENETUNREACH: 1466714d8e8SKurt Hackel case -ENETRESET: 1476714d8e8SKurt Hackel case -ESHUTDOWN: 1486714d8e8SKurt Hackel case -ENOPROTOOPT: 1496714d8e8SKurt Hackel case -EINVAL: /* if returned from our tcp code, 1506714d8e8SKurt Hackel this means there is no socket */ 1516714d8e8SKurt Hackel return 1; 1526714d8e8SKurt Hackel } 1536714d8e8SKurt Hackel return 0; 1546714d8e8SKurt Hackel } 1556714d8e8SKurt Hackel 1566714d8e8SKurt Hackel 1576714d8e8SKurt Hackel /* 1586714d8e8SKurt Hackel * MASTER LIST FUNCTIONS 1596714d8e8SKurt Hackel */ 1606714d8e8SKurt Hackel 1616714d8e8SKurt Hackel 1626714d8e8SKurt Hackel /* 1636714d8e8SKurt Hackel * regarding master list entries and heartbeat callbacks: 1646714d8e8SKurt Hackel * 1656714d8e8SKurt Hackel * in order to avoid sleeping and allocation that occurs in 1666714d8e8SKurt Hackel * heartbeat, master list entries are simply attached to the 1676714d8e8SKurt Hackel * dlm's established heartbeat callbacks. the mle is attached 1686714d8e8SKurt Hackel * when it is created, and since the dlm->spinlock is held at 1696714d8e8SKurt Hackel * that time, any heartbeat event will be properly discovered 1706714d8e8SKurt Hackel * by the mle. the mle needs to be detached from the 1716714d8e8SKurt Hackel * dlm->mle_hb_events list as soon as heartbeat events are no 1726714d8e8SKurt Hackel * longer useful to the mle, and before the mle is freed. 1736714d8e8SKurt Hackel * 1746714d8e8SKurt Hackel * as a general rule, heartbeat events are no longer needed by 1756714d8e8SKurt Hackel * the mle once an "answer" regarding the lock master has been 1766714d8e8SKurt Hackel * received. 1776714d8e8SKurt Hackel */ 1786714d8e8SKurt Hackel static inline void __dlm_mle_attach_hb_events(struct dlm_ctxt *dlm, 1796714d8e8SKurt Hackel struct dlm_master_list_entry *mle) 1806714d8e8SKurt Hackel { 1816714d8e8SKurt Hackel assert_spin_locked(&dlm->spinlock); 1826714d8e8SKurt Hackel 1836714d8e8SKurt Hackel list_add_tail(&mle->hb_events, &dlm->mle_hb_events); 1846714d8e8SKurt Hackel } 1856714d8e8SKurt Hackel 1866714d8e8SKurt Hackel 1876714d8e8SKurt Hackel static inline void __dlm_mle_detach_hb_events(struct dlm_ctxt *dlm, 1886714d8e8SKurt Hackel struct dlm_master_list_entry *mle) 1896714d8e8SKurt Hackel { 1906714d8e8SKurt Hackel if (!list_empty(&mle->hb_events)) 1916714d8e8SKurt Hackel list_del_init(&mle->hb_events); 1926714d8e8SKurt Hackel } 1936714d8e8SKurt Hackel 1946714d8e8SKurt Hackel 1956714d8e8SKurt Hackel static inline void dlm_mle_detach_hb_events(struct dlm_ctxt *dlm, 1966714d8e8SKurt Hackel struct dlm_master_list_entry *mle) 1976714d8e8SKurt Hackel { 1986714d8e8SKurt Hackel spin_lock(&dlm->spinlock); 1996714d8e8SKurt Hackel __dlm_mle_detach_hb_events(dlm, mle); 2006714d8e8SKurt Hackel spin_unlock(&dlm->spinlock); 2016714d8e8SKurt Hackel } 2026714d8e8SKurt Hackel 203a2bf0477SKurt Hackel static void dlm_get_mle_inuse(struct dlm_master_list_entry *mle) 204a2bf0477SKurt Hackel { 205a2bf0477SKurt Hackel struct dlm_ctxt *dlm; 206a2bf0477SKurt Hackel dlm = mle->dlm; 207a2bf0477SKurt Hackel 208a2bf0477SKurt Hackel assert_spin_locked(&dlm->spinlock); 209a2bf0477SKurt Hackel assert_spin_locked(&dlm->master_lock); 210a2bf0477SKurt Hackel mle->inuse++; 211a2bf0477SKurt Hackel kref_get(&mle->mle_refs); 212a2bf0477SKurt Hackel } 213a2bf0477SKurt Hackel 214a2bf0477SKurt Hackel static void dlm_put_mle_inuse(struct dlm_master_list_entry *mle) 215a2bf0477SKurt Hackel { 216a2bf0477SKurt Hackel struct dlm_ctxt *dlm; 217a2bf0477SKurt Hackel dlm = mle->dlm; 218a2bf0477SKurt Hackel 219a2bf0477SKurt Hackel spin_lock(&dlm->spinlock); 220a2bf0477SKurt Hackel spin_lock(&dlm->master_lock); 221a2bf0477SKurt Hackel mle->inuse--; 222a2bf0477SKurt Hackel __dlm_put_mle(mle); 223a2bf0477SKurt Hackel spin_unlock(&dlm->master_lock); 224a2bf0477SKurt Hackel spin_unlock(&dlm->spinlock); 225a2bf0477SKurt Hackel 226a2bf0477SKurt Hackel } 227a2bf0477SKurt Hackel 2286714d8e8SKurt Hackel /* remove from list and free */ 2296714d8e8SKurt Hackel static void __dlm_put_mle(struct dlm_master_list_entry *mle) 2306714d8e8SKurt Hackel { 2316714d8e8SKurt Hackel struct dlm_ctxt *dlm; 2326714d8e8SKurt Hackel dlm = mle->dlm; 2336714d8e8SKurt Hackel 2346714d8e8SKurt Hackel assert_spin_locked(&dlm->spinlock); 2356714d8e8SKurt Hackel assert_spin_locked(&dlm->master_lock); 236aa852354SKurt Hackel if (!atomic_read(&mle->mle_refs.refcount)) { 237aa852354SKurt Hackel /* this may or may not crash, but who cares. 238aa852354SKurt Hackel * it's a BUG. */ 239aa852354SKurt Hackel mlog(ML_ERROR, "bad mle: %p\n", mle); 240aa852354SKurt Hackel dlm_print_one_mle(mle); 241aa852354SKurt Hackel BUG(); 242aa852354SKurt Hackel } else 2436714d8e8SKurt Hackel kref_put(&mle->mle_refs, dlm_mle_release); 2446714d8e8SKurt Hackel } 2456714d8e8SKurt Hackel 2466714d8e8SKurt Hackel 2476714d8e8SKurt Hackel /* must not have any spinlocks coming in */ 2486714d8e8SKurt Hackel static void dlm_put_mle(struct dlm_master_list_entry *mle) 2496714d8e8SKurt Hackel { 2506714d8e8SKurt Hackel struct dlm_ctxt *dlm; 2516714d8e8SKurt Hackel dlm = mle->dlm; 2526714d8e8SKurt Hackel 2536714d8e8SKurt Hackel spin_lock(&dlm->spinlock); 2546714d8e8SKurt Hackel spin_lock(&dlm->master_lock); 2556714d8e8SKurt Hackel __dlm_put_mle(mle); 2566714d8e8SKurt Hackel spin_unlock(&dlm->master_lock); 2576714d8e8SKurt Hackel spin_unlock(&dlm->spinlock); 2586714d8e8SKurt Hackel } 2596714d8e8SKurt Hackel 2606714d8e8SKurt Hackel static inline void dlm_get_mle(struct dlm_master_list_entry *mle) 2616714d8e8SKurt Hackel { 2626714d8e8SKurt Hackel kref_get(&mle->mle_refs); 2636714d8e8SKurt Hackel } 2646714d8e8SKurt Hackel 2656714d8e8SKurt Hackel static void dlm_init_mle(struct dlm_master_list_entry *mle, 2666714d8e8SKurt Hackel enum dlm_mle_type type, 2676714d8e8SKurt Hackel struct dlm_ctxt *dlm, 2686714d8e8SKurt Hackel struct dlm_lock_resource *res, 2696714d8e8SKurt Hackel const char *name, 2706714d8e8SKurt Hackel unsigned int namelen) 2716714d8e8SKurt Hackel { 2726714d8e8SKurt Hackel assert_spin_locked(&dlm->spinlock); 2736714d8e8SKurt Hackel 2746714d8e8SKurt Hackel mle->dlm = dlm; 2756714d8e8SKurt Hackel mle->type = type; 2762ed6c750SSunil Mushran INIT_HLIST_NODE(&mle->master_hash_node); 2776714d8e8SKurt Hackel INIT_LIST_HEAD(&mle->hb_events); 2786714d8e8SKurt Hackel memset(mle->maybe_map, 0, sizeof(mle->maybe_map)); 2796714d8e8SKurt Hackel spin_lock_init(&mle->spinlock); 2806714d8e8SKurt Hackel init_waitqueue_head(&mle->wq); 2816714d8e8SKurt Hackel atomic_set(&mle->woken, 0); 2826714d8e8SKurt Hackel kref_init(&mle->mle_refs); 2836714d8e8SKurt Hackel memset(mle->response_map, 0, sizeof(mle->response_map)); 2846714d8e8SKurt Hackel mle->master = O2NM_MAX_NODES; 2856714d8e8SKurt Hackel mle->new_master = O2NM_MAX_NODES; 286a2bf0477SKurt Hackel mle->inuse = 0; 2876714d8e8SKurt Hackel 288f77a9a78SSunil Mushran BUG_ON(mle->type != DLM_MLE_BLOCK && 289f77a9a78SSunil Mushran mle->type != DLM_MLE_MASTER && 290f77a9a78SSunil Mushran mle->type != DLM_MLE_MIGRATION); 291f77a9a78SSunil Mushran 2926714d8e8SKurt Hackel if (mle->type == DLM_MLE_MASTER) { 2936714d8e8SKurt Hackel BUG_ON(!res); 2947141514bSSunil Mushran mle->mleres = res; 2957141514bSSunil Mushran memcpy(mle->mname, res->lockname.name, res->lockname.len); 2967141514bSSunil Mushran mle->mnamelen = res->lockname.len; 2977141514bSSunil Mushran mle->mnamehash = res->lockname.hash; 298f77a9a78SSunil Mushran } else { 2996714d8e8SKurt Hackel BUG_ON(!name); 3007141514bSSunil Mushran mle->mleres = NULL; 3017141514bSSunil Mushran memcpy(mle->mname, name, namelen); 3027141514bSSunil Mushran mle->mnamelen = namelen; 3037141514bSSunil Mushran mle->mnamehash = dlm_lockid_hash(name, namelen); 3046714d8e8SKurt Hackel } 3056714d8e8SKurt Hackel 3062041d8fdSSunil Mushran atomic_inc(&dlm->mle_tot_count[mle->type]); 3072041d8fdSSunil Mushran atomic_inc(&dlm->mle_cur_count[mle->type]); 3082041d8fdSSunil Mushran 3096714d8e8SKurt Hackel /* copy off the node_map and register hb callbacks on our copy */ 3106714d8e8SKurt Hackel memcpy(mle->node_map, dlm->domain_map, sizeof(mle->node_map)); 3116714d8e8SKurt Hackel memcpy(mle->vote_map, dlm->domain_map, sizeof(mle->vote_map)); 3126714d8e8SKurt Hackel clear_bit(dlm->node_num, mle->vote_map); 3136714d8e8SKurt Hackel clear_bit(dlm->node_num, mle->node_map); 3146714d8e8SKurt Hackel 3156714d8e8SKurt Hackel /* attach the mle to the domain node up/down events */ 3166714d8e8SKurt Hackel __dlm_mle_attach_hb_events(dlm, mle); 3176714d8e8SKurt Hackel } 3186714d8e8SKurt Hackel 3191c084577SSunil Mushran void __dlm_unlink_mle(struct dlm_ctxt *dlm, struct dlm_master_list_entry *mle) 3201c084577SSunil Mushran { 3211c084577SSunil Mushran assert_spin_locked(&dlm->spinlock); 3221c084577SSunil Mushran assert_spin_locked(&dlm->master_lock); 3231c084577SSunil Mushran 3242ed6c750SSunil Mushran if (!hlist_unhashed(&mle->master_hash_node)) 3252ed6c750SSunil Mushran hlist_del_init(&mle->master_hash_node); 3261c084577SSunil Mushran } 3271c084577SSunil Mushran 3281c084577SSunil Mushran void __dlm_insert_mle(struct dlm_ctxt *dlm, struct dlm_master_list_entry *mle) 3291c084577SSunil Mushran { 3302ed6c750SSunil Mushran struct hlist_head *bucket; 3312ed6c750SSunil Mushran 3321c084577SSunil Mushran assert_spin_locked(&dlm->master_lock); 3331c084577SSunil Mushran 3347141514bSSunil Mushran bucket = dlm_master_hash(dlm, mle->mnamehash); 3352ed6c750SSunil Mushran hlist_add_head(&mle->master_hash_node, bucket); 3361c084577SSunil Mushran } 3376714d8e8SKurt Hackel 3386714d8e8SKurt Hackel /* returns 1 if found, 0 if not */ 3396714d8e8SKurt Hackel static int dlm_find_mle(struct dlm_ctxt *dlm, 3406714d8e8SKurt Hackel struct dlm_master_list_entry **mle, 3416714d8e8SKurt Hackel char *name, unsigned int namelen) 3426714d8e8SKurt Hackel { 3436714d8e8SKurt Hackel struct dlm_master_list_entry *tmpmle; 3442ed6c750SSunil Mushran struct hlist_head *bucket; 3452ed6c750SSunil Mushran unsigned int hash; 3466714d8e8SKurt Hackel 3476714d8e8SKurt Hackel assert_spin_locked(&dlm->master_lock); 3486714d8e8SKurt Hackel 3492ed6c750SSunil Mushran hash = dlm_lockid_hash(name, namelen); 3502ed6c750SSunil Mushran bucket = dlm_master_hash(dlm, hash); 351df53cd3bSDong Fang hlist_for_each_entry(tmpmle, bucket, master_hash_node) { 3526714d8e8SKurt Hackel if (!dlm_mle_equal(dlm, tmpmle, name, namelen)) 3536714d8e8SKurt Hackel continue; 3546714d8e8SKurt Hackel dlm_get_mle(tmpmle); 3556714d8e8SKurt Hackel *mle = tmpmle; 3566714d8e8SKurt Hackel return 1; 3576714d8e8SKurt Hackel } 3586714d8e8SKurt Hackel return 0; 3596714d8e8SKurt Hackel } 3606714d8e8SKurt Hackel 3616714d8e8SKurt Hackel void dlm_hb_event_notify_attached(struct dlm_ctxt *dlm, int idx, int node_up) 3626714d8e8SKurt Hackel { 3636714d8e8SKurt Hackel struct dlm_master_list_entry *mle; 3646714d8e8SKurt Hackel 3656714d8e8SKurt Hackel assert_spin_locked(&dlm->spinlock); 3666714d8e8SKurt Hackel 367800deef3SChristoph Hellwig list_for_each_entry(mle, &dlm->mle_hb_events, hb_events) { 3686714d8e8SKurt Hackel if (node_up) 3696714d8e8SKurt Hackel dlm_mle_node_up(dlm, mle, NULL, idx); 3706714d8e8SKurt Hackel else 3716714d8e8SKurt Hackel dlm_mle_node_down(dlm, mle, NULL, idx); 3726714d8e8SKurt Hackel } 3736714d8e8SKurt Hackel } 3746714d8e8SKurt Hackel 3756714d8e8SKurt Hackel static void dlm_mle_node_down(struct dlm_ctxt *dlm, 3766714d8e8SKurt Hackel struct dlm_master_list_entry *mle, 3776714d8e8SKurt Hackel struct o2nm_node *node, int idx) 3786714d8e8SKurt Hackel { 3796714d8e8SKurt Hackel spin_lock(&mle->spinlock); 3806714d8e8SKurt Hackel 3816714d8e8SKurt Hackel if (!test_bit(idx, mle->node_map)) 3826714d8e8SKurt Hackel mlog(0, "node %u already removed from nodemap!\n", idx); 3836714d8e8SKurt Hackel else 3846714d8e8SKurt Hackel clear_bit(idx, mle->node_map); 3856714d8e8SKurt Hackel 3866714d8e8SKurt Hackel spin_unlock(&mle->spinlock); 3876714d8e8SKurt Hackel } 3886714d8e8SKurt Hackel 3896714d8e8SKurt Hackel static void dlm_mle_node_up(struct dlm_ctxt *dlm, 3906714d8e8SKurt Hackel struct dlm_master_list_entry *mle, 3916714d8e8SKurt Hackel struct o2nm_node *node, int idx) 3926714d8e8SKurt Hackel { 3936714d8e8SKurt Hackel spin_lock(&mle->spinlock); 3946714d8e8SKurt Hackel 3956714d8e8SKurt Hackel if (test_bit(idx, mle->node_map)) 3966714d8e8SKurt Hackel mlog(0, "node %u already in node map!\n", idx); 3976714d8e8SKurt Hackel else 3986714d8e8SKurt Hackel set_bit(idx, mle->node_map); 3996714d8e8SKurt Hackel 4006714d8e8SKurt Hackel spin_unlock(&mle->spinlock); 4016714d8e8SKurt Hackel } 4026714d8e8SKurt Hackel 4036714d8e8SKurt Hackel 4046714d8e8SKurt Hackel int dlm_init_mle_cache(void) 4056714d8e8SKurt Hackel { 40612eb0035SSunil Mushran dlm_mle_cache = kmem_cache_create("o2dlm_mle", 4076714d8e8SKurt Hackel sizeof(struct dlm_master_list_entry), 4086714d8e8SKurt Hackel 0, SLAB_HWCACHE_ALIGN, 40920c2df83SPaul Mundt NULL); 4106714d8e8SKurt Hackel if (dlm_mle_cache == NULL) 4116714d8e8SKurt Hackel return -ENOMEM; 4126714d8e8SKurt Hackel return 0; 4136714d8e8SKurt Hackel } 4146714d8e8SKurt Hackel 4156714d8e8SKurt Hackel void dlm_destroy_mle_cache(void) 4166714d8e8SKurt Hackel { 4176714d8e8SKurt Hackel if (dlm_mle_cache) 4186714d8e8SKurt Hackel kmem_cache_destroy(dlm_mle_cache); 4196714d8e8SKurt Hackel } 4206714d8e8SKurt Hackel 4216714d8e8SKurt Hackel static void dlm_mle_release(struct kref *kref) 4226714d8e8SKurt Hackel { 4236714d8e8SKurt Hackel struct dlm_master_list_entry *mle; 4246714d8e8SKurt Hackel struct dlm_ctxt *dlm; 4256714d8e8SKurt Hackel 4266714d8e8SKurt Hackel mle = container_of(kref, struct dlm_master_list_entry, mle_refs); 4276714d8e8SKurt Hackel dlm = mle->dlm; 4286714d8e8SKurt Hackel 4296714d8e8SKurt Hackel assert_spin_locked(&dlm->spinlock); 4306714d8e8SKurt Hackel assert_spin_locked(&dlm->master_lock); 4316714d8e8SKurt Hackel 4327141514bSSunil Mushran mlog(0, "Releasing mle for %.*s, type %d\n", mle->mnamelen, mle->mname, 4337141514bSSunil Mushran mle->type); 4342ed6c750SSunil Mushran 4356714d8e8SKurt Hackel /* remove from list if not already */ 4361c084577SSunil Mushran __dlm_unlink_mle(dlm, mle); 4376714d8e8SKurt Hackel 4386714d8e8SKurt Hackel /* detach the mle from the domain node up/down events */ 4396714d8e8SKurt Hackel __dlm_mle_detach_hb_events(dlm, mle); 4406714d8e8SKurt Hackel 4412041d8fdSSunil Mushran atomic_dec(&dlm->mle_cur_count[mle->type]); 4422041d8fdSSunil Mushran 4436714d8e8SKurt Hackel /* NOTE: kfree under spinlock here. 4446714d8e8SKurt Hackel * if this is bad, we can move this to a freelist. */ 4456714d8e8SKurt Hackel kmem_cache_free(dlm_mle_cache, mle); 4466714d8e8SKurt Hackel } 4476714d8e8SKurt Hackel 4486714d8e8SKurt Hackel 4496714d8e8SKurt Hackel /* 4506714d8e8SKurt Hackel * LOCK RESOURCE FUNCTIONS 4516714d8e8SKurt Hackel */ 4526714d8e8SKurt Hackel 453724bdca9SSunil Mushran int dlm_init_master_caches(void) 454724bdca9SSunil Mushran { 455724bdca9SSunil Mushran dlm_lockres_cache = kmem_cache_create("o2dlm_lockres", 456724bdca9SSunil Mushran sizeof(struct dlm_lock_resource), 457724bdca9SSunil Mushran 0, SLAB_HWCACHE_ALIGN, NULL); 458724bdca9SSunil Mushran if (!dlm_lockres_cache) 459724bdca9SSunil Mushran goto bail; 460724bdca9SSunil Mushran 461724bdca9SSunil Mushran dlm_lockname_cache = kmem_cache_create("o2dlm_lockname", 462724bdca9SSunil Mushran DLM_LOCKID_NAME_MAX, 0, 463724bdca9SSunil Mushran SLAB_HWCACHE_ALIGN, NULL); 464724bdca9SSunil Mushran if (!dlm_lockname_cache) 465724bdca9SSunil Mushran goto bail; 466724bdca9SSunil Mushran 467724bdca9SSunil Mushran return 0; 468724bdca9SSunil Mushran bail: 469724bdca9SSunil Mushran dlm_destroy_master_caches(); 470724bdca9SSunil Mushran return -ENOMEM; 471724bdca9SSunil Mushran } 472724bdca9SSunil Mushran 473724bdca9SSunil Mushran void dlm_destroy_master_caches(void) 474724bdca9SSunil Mushran { 47566db6cfdSJoseph Qi if (dlm_lockname_cache) { 476724bdca9SSunil Mushran kmem_cache_destroy(dlm_lockname_cache); 47766db6cfdSJoseph Qi dlm_lockname_cache = NULL; 47866db6cfdSJoseph Qi } 479724bdca9SSunil Mushran 48066db6cfdSJoseph Qi if (dlm_lockres_cache) { 481724bdca9SSunil Mushran kmem_cache_destroy(dlm_lockres_cache); 48266db6cfdSJoseph Qi dlm_lockres_cache = NULL; 48366db6cfdSJoseph Qi } 484724bdca9SSunil Mushran } 485724bdca9SSunil Mushran 4866714d8e8SKurt Hackel static void dlm_lockres_release(struct kref *kref) 4876714d8e8SKurt Hackel { 4886714d8e8SKurt Hackel struct dlm_lock_resource *res; 489b0d4f817SSunil Mushran struct dlm_ctxt *dlm; 4906714d8e8SKurt Hackel 4916714d8e8SKurt Hackel res = container_of(kref, struct dlm_lock_resource, refs); 492b0d4f817SSunil Mushran dlm = res->dlm; 4936714d8e8SKurt Hackel 4946714d8e8SKurt Hackel /* This should not happen -- all lockres' have a name 4956714d8e8SKurt Hackel * associated with them at init time. */ 4966714d8e8SKurt Hackel BUG_ON(!res->lockname.name); 4976714d8e8SKurt Hackel 4986714d8e8SKurt Hackel mlog(0, "destroying lockres %.*s\n", res->lockname.len, 4996714d8e8SKurt Hackel res->lockname.name); 5006714d8e8SKurt Hackel 501b0d4f817SSunil Mushran spin_lock(&dlm->track_lock); 50229576f8bSSunil Mushran if (!list_empty(&res->tracking)) 50329576f8bSSunil Mushran list_del_init(&res->tracking); 50429576f8bSSunil Mushran else { 50529576f8bSSunil Mushran mlog(ML_ERROR, "Resource %.*s not on the Tracking list\n", 50629576f8bSSunil Mushran res->lockname.len, res->lockname.name); 50729576f8bSSunil Mushran dlm_print_one_lock_resource(res); 50829576f8bSSunil Mushran } 509b0d4f817SSunil Mushran spin_unlock(&dlm->track_lock); 510b0d4f817SSunil Mushran 5116800791aSSunil Mushran atomic_dec(&dlm->res_cur_count); 5126800791aSSunil Mushran 513a7f90d83SKurt Hackel if (!hlist_unhashed(&res->hash_node) || 514a7f90d83SKurt Hackel !list_empty(&res->granted) || 515a7f90d83SKurt Hackel !list_empty(&res->converting) || 516a7f90d83SKurt Hackel !list_empty(&res->blocked) || 517a7f90d83SKurt Hackel !list_empty(&res->dirty) || 518a7f90d83SKurt Hackel !list_empty(&res->recovering) || 519a7f90d83SKurt Hackel !list_empty(&res->purge)) { 520a7f90d83SKurt Hackel mlog(ML_ERROR, 521a7f90d83SKurt Hackel "Going to BUG for resource %.*s." 522a7f90d83SKurt Hackel " We're on a list! [%c%c%c%c%c%c%c]\n", 523a7f90d83SKurt Hackel res->lockname.len, res->lockname.name, 524a7f90d83SKurt Hackel !hlist_unhashed(&res->hash_node) ? 'H' : ' ', 525a7f90d83SKurt Hackel !list_empty(&res->granted) ? 'G' : ' ', 526a7f90d83SKurt Hackel !list_empty(&res->converting) ? 'C' : ' ', 527a7f90d83SKurt Hackel !list_empty(&res->blocked) ? 'B' : ' ', 528a7f90d83SKurt Hackel !list_empty(&res->dirty) ? 'D' : ' ', 529a7f90d83SKurt Hackel !list_empty(&res->recovering) ? 'R' : ' ', 530a7f90d83SKurt Hackel !list_empty(&res->purge) ? 'P' : ' '); 531a7f90d83SKurt Hackel 532a7f90d83SKurt Hackel dlm_print_one_lock_resource(res); 533a7f90d83SKurt Hackel } 534a7f90d83SKurt Hackel 5356714d8e8SKurt Hackel /* By the time we're ready to blow this guy away, we shouldn't 5366714d8e8SKurt Hackel * be on any lists. */ 53781f2094aSMark Fasheh BUG_ON(!hlist_unhashed(&res->hash_node)); 5386714d8e8SKurt Hackel BUG_ON(!list_empty(&res->granted)); 5396714d8e8SKurt Hackel BUG_ON(!list_empty(&res->converting)); 5406714d8e8SKurt Hackel BUG_ON(!list_empty(&res->blocked)); 5416714d8e8SKurt Hackel BUG_ON(!list_empty(&res->dirty)); 5426714d8e8SKurt Hackel BUG_ON(!list_empty(&res->recovering)); 5436714d8e8SKurt Hackel BUG_ON(!list_empty(&res->purge)); 5446714d8e8SKurt Hackel 545724bdca9SSunil Mushran kmem_cache_free(dlm_lockname_cache, (void *)res->lockname.name); 5466714d8e8SKurt Hackel 547724bdca9SSunil Mushran kmem_cache_free(dlm_lockres_cache, res); 5486714d8e8SKurt Hackel } 5496714d8e8SKurt Hackel 5506714d8e8SKurt Hackel void dlm_lockres_put(struct dlm_lock_resource *res) 5516714d8e8SKurt Hackel { 5526714d8e8SKurt Hackel kref_put(&res->refs, dlm_lockres_release); 5536714d8e8SKurt Hackel } 5546714d8e8SKurt Hackel 5556714d8e8SKurt Hackel static void dlm_init_lockres(struct dlm_ctxt *dlm, 5566714d8e8SKurt Hackel struct dlm_lock_resource *res, 5576714d8e8SKurt Hackel const char *name, unsigned int namelen) 5586714d8e8SKurt Hackel { 5596714d8e8SKurt Hackel char *qname; 5606714d8e8SKurt Hackel 5616714d8e8SKurt Hackel /* If we memset here, we lose our reference to the kmalloc'd 5626714d8e8SKurt Hackel * res->lockname.name, so be sure to init every field 5636714d8e8SKurt Hackel * correctly! */ 5646714d8e8SKurt Hackel 5656714d8e8SKurt Hackel qname = (char *) res->lockname.name; 5666714d8e8SKurt Hackel memcpy(qname, name, namelen); 5676714d8e8SKurt Hackel 5686714d8e8SKurt Hackel res->lockname.len = namelen; 569a3d33291SMark Fasheh res->lockname.hash = dlm_lockid_hash(name, namelen); 5706714d8e8SKurt Hackel 5716714d8e8SKurt Hackel init_waitqueue_head(&res->wq); 5726714d8e8SKurt Hackel spin_lock_init(&res->spinlock); 57381f2094aSMark Fasheh INIT_HLIST_NODE(&res->hash_node); 5746714d8e8SKurt Hackel INIT_LIST_HEAD(&res->granted); 5756714d8e8SKurt Hackel INIT_LIST_HEAD(&res->converting); 5766714d8e8SKurt Hackel INIT_LIST_HEAD(&res->blocked); 5776714d8e8SKurt Hackel INIT_LIST_HEAD(&res->dirty); 5786714d8e8SKurt Hackel INIT_LIST_HEAD(&res->recovering); 5796714d8e8SKurt Hackel INIT_LIST_HEAD(&res->purge); 58029576f8bSSunil Mushran INIT_LIST_HEAD(&res->tracking); 5816714d8e8SKurt Hackel atomic_set(&res->asts_reserved, 0); 5826714d8e8SKurt Hackel res->migration_pending = 0; 583ba2bf218SKurt Hackel res->inflight_locks = 0; 5846714d8e8SKurt Hackel 585b0d4f817SSunil Mushran res->dlm = dlm; 586b0d4f817SSunil Mushran 5876714d8e8SKurt Hackel kref_init(&res->refs); 5886714d8e8SKurt Hackel 5896800791aSSunil Mushran atomic_inc(&dlm->res_tot_count); 5906800791aSSunil Mushran atomic_inc(&dlm->res_cur_count); 5916800791aSSunil Mushran 5926714d8e8SKurt Hackel /* just for consistency */ 5936714d8e8SKurt Hackel spin_lock(&res->spinlock); 5946714d8e8SKurt Hackel dlm_set_lockres_owner(dlm, res, DLM_LOCK_RES_OWNER_UNKNOWN); 5956714d8e8SKurt Hackel spin_unlock(&res->spinlock); 5966714d8e8SKurt Hackel 5976714d8e8SKurt Hackel res->state = DLM_LOCK_RES_IN_PROGRESS; 5986714d8e8SKurt Hackel 5996714d8e8SKurt Hackel res->last_used = 0; 6006714d8e8SKurt Hackel 60118c6ac38SSunil Mushran spin_lock(&dlm->spinlock); 60229576f8bSSunil Mushran list_add_tail(&res->tracking, &dlm->tracking_list); 60318c6ac38SSunil Mushran spin_unlock(&dlm->spinlock); 60429576f8bSSunil Mushran 6056714d8e8SKurt Hackel memset(res->lvb, 0, DLM_LVB_LEN); 606ba2bf218SKurt Hackel memset(res->refmap, 0, sizeof(res->refmap)); 6076714d8e8SKurt Hackel } 6086714d8e8SKurt Hackel 6096714d8e8SKurt Hackel struct dlm_lock_resource *dlm_new_lockres(struct dlm_ctxt *dlm, 6106714d8e8SKurt Hackel const char *name, 6116714d8e8SKurt Hackel unsigned int namelen) 6126714d8e8SKurt Hackel { 613724bdca9SSunil Mushran struct dlm_lock_resource *res = NULL; 6146714d8e8SKurt Hackel 6153914ed0cSJulia Lawall res = kmem_cache_zalloc(dlm_lockres_cache, GFP_NOFS); 6166714d8e8SKurt Hackel if (!res) 617724bdca9SSunil Mushran goto error; 6186714d8e8SKurt Hackel 6193914ed0cSJulia Lawall res->lockname.name = kmem_cache_zalloc(dlm_lockname_cache, GFP_NOFS); 620724bdca9SSunil Mushran if (!res->lockname.name) 621724bdca9SSunil Mushran goto error; 6226714d8e8SKurt Hackel 6236714d8e8SKurt Hackel dlm_init_lockres(dlm, res, name, namelen); 6246714d8e8SKurt Hackel return res; 625724bdca9SSunil Mushran 626724bdca9SSunil Mushran error: 627724bdca9SSunil Mushran if (res && res->lockname.name) 628724bdca9SSunil Mushran kmem_cache_free(dlm_lockname_cache, (void *)res->lockname.name); 629724bdca9SSunil Mushran 630724bdca9SSunil Mushran if (res) 631724bdca9SSunil Mushran kmem_cache_free(dlm_lockres_cache, res); 632724bdca9SSunil Mushran return NULL; 6336714d8e8SKurt Hackel } 6346714d8e8SKurt Hackel 6358d400b81SSunil Mushran void dlm_lockres_set_refmap_bit(struct dlm_ctxt *dlm, 6368d400b81SSunil Mushran struct dlm_lock_resource *res, int bit) 637ba2bf218SKurt Hackel { 6388d400b81SSunil Mushran assert_spin_locked(&res->spinlock); 6398d400b81SSunil Mushran 6408d400b81SSunil Mushran mlog(0, "res %.*s, set node %u, %ps()\n", res->lockname.len, 6418d400b81SSunil Mushran res->lockname.name, bit, __builtin_return_address(0)); 6428d400b81SSunil Mushran 6438d400b81SSunil Mushran set_bit(bit, res->refmap); 6448d400b81SSunil Mushran } 6458d400b81SSunil Mushran 6468d400b81SSunil Mushran void dlm_lockres_clear_refmap_bit(struct dlm_ctxt *dlm, 6478d400b81SSunil Mushran struct dlm_lock_resource *res, int bit) 6488d400b81SSunil Mushran { 6498d400b81SSunil Mushran assert_spin_locked(&res->spinlock); 6508d400b81SSunil Mushran 6518d400b81SSunil Mushran mlog(0, "res %.*s, clr node %u, %ps()\n", res->lockname.len, 6528d400b81SSunil Mushran res->lockname.name, bit, __builtin_return_address(0)); 6538d400b81SSunil Mushran 6548d400b81SSunil Mushran clear_bit(bit, res->refmap); 6558d400b81SSunil Mushran } 6568d400b81SSunil Mushran 6578d400b81SSunil Mushran 6588d400b81SSunil Mushran void dlm_lockres_grab_inflight_ref(struct dlm_ctxt *dlm, 6598d400b81SSunil Mushran struct dlm_lock_resource *res) 6608d400b81SSunil Mushran { 661ba2bf218SKurt Hackel assert_spin_locked(&res->spinlock); 662ba2bf218SKurt Hackel 663ba2bf218SKurt Hackel res->inflight_locks++; 664ff0a522eSSunil Mushran 6658d400b81SSunil Mushran mlog(0, "%s: res %.*s, inflight++: now %u, %ps()\n", dlm->name, 6668d400b81SSunil Mushran res->lockname.len, res->lockname.name, res->inflight_locks, 6678d400b81SSunil Mushran __builtin_return_address(0)); 668ba2bf218SKurt Hackel } 669ba2bf218SKurt Hackel 6708d400b81SSunil Mushran void dlm_lockres_drop_inflight_ref(struct dlm_ctxt *dlm, 6718d400b81SSunil Mushran struct dlm_lock_resource *res) 672ba2bf218SKurt Hackel { 673ba2bf218SKurt Hackel assert_spin_locked(&res->spinlock); 674ba2bf218SKurt Hackel 675ba2bf218SKurt Hackel BUG_ON(res->inflight_locks == 0); 6768d400b81SSunil Mushran 677ba2bf218SKurt Hackel res->inflight_locks--; 678ff0a522eSSunil Mushran 6798d400b81SSunil Mushran mlog(0, "%s: res %.*s, inflight--: now %u, %ps()\n", dlm->name, 6808d400b81SSunil Mushran res->lockname.len, res->lockname.name, res->inflight_locks, 6818d400b81SSunil Mushran __builtin_return_address(0)); 6828d400b81SSunil Mushran 683ba2bf218SKurt Hackel wake_up(&res->wq); 684ba2bf218SKurt Hackel } 685ba2bf218SKurt Hackel 6866714d8e8SKurt Hackel /* 6876714d8e8SKurt Hackel * lookup a lock resource by name. 6886714d8e8SKurt Hackel * may already exist in the hashtable. 6896714d8e8SKurt Hackel * lockid is null terminated 6906714d8e8SKurt Hackel * 6916714d8e8SKurt Hackel * if not, allocate enough for the lockres and for 6926714d8e8SKurt Hackel * the temporary structure used in doing the mastering. 6936714d8e8SKurt Hackel * 6946714d8e8SKurt Hackel * also, do a lookup in the dlm->master_list to see 6956714d8e8SKurt Hackel * if another node has begun mastering the same lock. 6966714d8e8SKurt Hackel * if so, there should be a block entry in there 6976714d8e8SKurt Hackel * for this name, and we should *not* attempt to master 6986714d8e8SKurt Hackel * the lock here. need to wait around for that node 6996714d8e8SKurt Hackel * to assert_master (or die). 7006714d8e8SKurt Hackel * 7016714d8e8SKurt Hackel */ 7026714d8e8SKurt Hackel struct dlm_lock_resource * dlm_get_lock_resource(struct dlm_ctxt *dlm, 7036714d8e8SKurt Hackel const char *lockid, 7043384f3dfSMark Fasheh int namelen, 7056714d8e8SKurt Hackel int flags) 7066714d8e8SKurt Hackel { 7076714d8e8SKurt Hackel struct dlm_lock_resource *tmpres=NULL, *res=NULL; 7086714d8e8SKurt Hackel struct dlm_master_list_entry *mle = NULL; 7096714d8e8SKurt Hackel struct dlm_master_list_entry *alloc_mle = NULL; 7106714d8e8SKurt Hackel int blocked = 0; 7116714d8e8SKurt Hackel int ret, nodenum; 7126714d8e8SKurt Hackel struct dlm_node_iter iter; 7133384f3dfSMark Fasheh unsigned int hash; 7146714d8e8SKurt Hackel int tries = 0; 715c03872f5SKurt Hackel int bit, wait_on_recovery = 0; 7166714d8e8SKurt Hackel 7176714d8e8SKurt Hackel BUG_ON(!lockid); 7186714d8e8SKurt Hackel 719a3d33291SMark Fasheh hash = dlm_lockid_hash(lockid, namelen); 7206714d8e8SKurt Hackel 7216714d8e8SKurt Hackel mlog(0, "get lockres %s (len %d)\n", lockid, namelen); 7226714d8e8SKurt Hackel 7236714d8e8SKurt Hackel lookup: 7246714d8e8SKurt Hackel spin_lock(&dlm->spinlock); 725ba2bf218SKurt Hackel tmpres = __dlm_lookup_lockres_full(dlm, lockid, namelen, hash); 7266714d8e8SKurt Hackel if (tmpres) { 7277b791d68SSunil Mushran spin_unlock(&dlm->spinlock); 728ba2bf218SKurt Hackel spin_lock(&tmpres->spinlock); 729ff0a522eSSunil Mushran /* Wait on the thread that is mastering the resource */ 7307b791d68SSunil Mushran if (tmpres->owner == DLM_LOCK_RES_OWNER_UNKNOWN) { 7317b791d68SSunil Mushran __dlm_wait_on_lockres(tmpres); 7327b791d68SSunil Mushran BUG_ON(tmpres->owner == DLM_LOCK_RES_OWNER_UNKNOWN); 733ba2bf218SKurt Hackel spin_unlock(&tmpres->spinlock); 734ba2bf218SKurt Hackel dlm_lockres_put(tmpres); 735ba2bf218SKurt Hackel tmpres = NULL; 736ba2bf218SKurt Hackel goto lookup; 737ba2bf218SKurt Hackel } 738ba2bf218SKurt Hackel 739ff0a522eSSunil Mushran /* Wait on the resource purge to complete before continuing */ 740ff0a522eSSunil Mushran if (tmpres->state & DLM_LOCK_RES_DROPPING_REF) { 741ff0a522eSSunil Mushran BUG_ON(tmpres->owner == dlm->node_num); 742ff0a522eSSunil Mushran __dlm_wait_on_lockres_flags(tmpres, 743ff0a522eSSunil Mushran DLM_LOCK_RES_DROPPING_REF); 744ff0a522eSSunil Mushran spin_unlock(&tmpres->spinlock); 745ff0a522eSSunil Mushran dlm_lockres_put(tmpres); 746ff0a522eSSunil Mushran tmpres = NULL; 747ff0a522eSSunil Mushran goto lookup; 748ff0a522eSSunil Mushran } 749ff0a522eSSunil Mushran 750ff0a522eSSunil Mushran /* Grab inflight ref to pin the resource */ 751ff0a522eSSunil Mushran dlm_lockres_grab_inflight_ref(dlm, tmpres); 752ff0a522eSSunil Mushran 753ff0a522eSSunil Mushran spin_unlock(&tmpres->spinlock); 7546714d8e8SKurt Hackel if (res) 7556714d8e8SKurt Hackel dlm_lockres_put(res); 7566714d8e8SKurt Hackel res = tmpres; 7576714d8e8SKurt Hackel goto leave; 7586714d8e8SKurt Hackel } 7596714d8e8SKurt Hackel 7606714d8e8SKurt Hackel if (!res) { 7616714d8e8SKurt Hackel spin_unlock(&dlm->spinlock); 7626714d8e8SKurt Hackel mlog(0, "allocating a new resource\n"); 7636714d8e8SKurt Hackel /* nothing found and we need to allocate one. */ 7643914ed0cSJulia Lawall alloc_mle = kmem_cache_alloc(dlm_mle_cache, GFP_NOFS); 7656714d8e8SKurt Hackel if (!alloc_mle) 7666714d8e8SKurt Hackel goto leave; 7676714d8e8SKurt Hackel res = dlm_new_lockres(dlm, lockid, namelen); 7686714d8e8SKurt Hackel if (!res) 7696714d8e8SKurt Hackel goto leave; 7706714d8e8SKurt Hackel goto lookup; 7716714d8e8SKurt Hackel } 7726714d8e8SKurt Hackel 7736714d8e8SKurt Hackel mlog(0, "no lockres found, allocated our own: %p\n", res); 7746714d8e8SKurt Hackel 7756714d8e8SKurt Hackel if (flags & LKM_LOCAL) { 7766714d8e8SKurt Hackel /* caller knows it's safe to assume it's not mastered elsewhere 7776714d8e8SKurt Hackel * DONE! return right away */ 7786714d8e8SKurt Hackel spin_lock(&res->spinlock); 7796714d8e8SKurt Hackel dlm_change_lockres_owner(dlm, res, dlm->node_num); 7806714d8e8SKurt Hackel __dlm_insert_lockres(dlm, res); 781ba2bf218SKurt Hackel dlm_lockres_grab_inflight_ref(dlm, res); 7826714d8e8SKurt Hackel spin_unlock(&res->spinlock); 7836714d8e8SKurt Hackel spin_unlock(&dlm->spinlock); 7846714d8e8SKurt Hackel /* lockres still marked IN_PROGRESS */ 7856714d8e8SKurt Hackel goto wake_waiters; 7866714d8e8SKurt Hackel } 7876714d8e8SKurt Hackel 7886714d8e8SKurt Hackel /* check master list to see if another node has started mastering it */ 7896714d8e8SKurt Hackel spin_lock(&dlm->master_lock); 7906714d8e8SKurt Hackel 7916714d8e8SKurt Hackel /* if we found a block, wait for lock to be mastered by another node */ 7926714d8e8SKurt Hackel blocked = dlm_find_mle(dlm, &mle, (char *)lockid, namelen); 7936714d8e8SKurt Hackel if (blocked) { 794ba2bf218SKurt Hackel int mig; 7956714d8e8SKurt Hackel if (mle->type == DLM_MLE_MASTER) { 7966714d8e8SKurt Hackel mlog(ML_ERROR, "master entry for nonexistent lock!\n"); 7976714d8e8SKurt Hackel BUG(); 798ba2bf218SKurt Hackel } 799ba2bf218SKurt Hackel mig = (mle->type == DLM_MLE_MIGRATION); 800ba2bf218SKurt Hackel /* if there is a migration in progress, let the migration 801ba2bf218SKurt Hackel * finish before continuing. we can wait for the absence 802ba2bf218SKurt Hackel * of the MIGRATION mle: either the migrate finished or 803ba2bf218SKurt Hackel * one of the nodes died and the mle was cleaned up. 804ba2bf218SKurt Hackel * if there is a BLOCK here, but it already has a master 805ba2bf218SKurt Hackel * set, we are too late. the master does not have a ref 806ba2bf218SKurt Hackel * for us in the refmap. detach the mle and drop it. 807ba2bf218SKurt Hackel * either way, go back to the top and start over. */ 808ba2bf218SKurt Hackel if (mig || mle->master != O2NM_MAX_NODES) { 809ba2bf218SKurt Hackel BUG_ON(mig && mle->master == dlm->node_num); 810ba2bf218SKurt Hackel /* we arrived too late. the master does not 811ba2bf218SKurt Hackel * have a ref for us. retry. */ 812ba2bf218SKurt Hackel mlog(0, "%s:%.*s: late on %s\n", 813ba2bf218SKurt Hackel dlm->name, namelen, lockid, 814ba2bf218SKurt Hackel mig ? "MIGRATION" : "BLOCK"); 8156714d8e8SKurt Hackel spin_unlock(&dlm->master_lock); 8166714d8e8SKurt Hackel spin_unlock(&dlm->spinlock); 8176714d8e8SKurt Hackel 8186714d8e8SKurt Hackel /* master is known, detach */ 819ba2bf218SKurt Hackel if (!mig) 8206714d8e8SKurt Hackel dlm_mle_detach_hb_events(dlm, mle); 8216714d8e8SKurt Hackel dlm_put_mle(mle); 8226714d8e8SKurt Hackel mle = NULL; 82325985edcSLucas De Marchi /* this is lame, but we can't wait on either 824ba2bf218SKurt Hackel * the mle or lockres waitqueue here */ 825ba2bf218SKurt Hackel if (mig) 826ba2bf218SKurt Hackel msleep(100); 827ba2bf218SKurt Hackel goto lookup; 8286714d8e8SKurt Hackel } 8296714d8e8SKurt Hackel } else { 8306714d8e8SKurt Hackel /* go ahead and try to master lock on this node */ 8316714d8e8SKurt Hackel mle = alloc_mle; 8326714d8e8SKurt Hackel /* make sure this does not get freed below */ 8336714d8e8SKurt Hackel alloc_mle = NULL; 8346714d8e8SKurt Hackel dlm_init_mle(mle, DLM_MLE_MASTER, dlm, res, NULL, 0); 8356714d8e8SKurt Hackel set_bit(dlm->node_num, mle->maybe_map); 8361c084577SSunil Mushran __dlm_insert_mle(dlm, mle); 837c03872f5SKurt Hackel 838c03872f5SKurt Hackel /* still holding the dlm spinlock, check the recovery map 839c03872f5SKurt Hackel * to see if there are any nodes that still need to be 840c03872f5SKurt Hackel * considered. these will not appear in the mle nodemap 841c03872f5SKurt Hackel * but they might own this lockres. wait on them. */ 842c03872f5SKurt Hackel bit = find_next_bit(dlm->recovery_map, O2NM_MAX_NODES, 0); 843c03872f5SKurt Hackel if (bit < O2NM_MAX_NODES) { 8448decab3cSSunil Mushran mlog(0, "%s: res %.*s, At least one node (%d) " 8458decab3cSSunil Mushran "to recover before lock mastery can begin\n", 846c03872f5SKurt Hackel dlm->name, namelen, (char *)lockid, bit); 847c03872f5SKurt Hackel wait_on_recovery = 1; 848c03872f5SKurt Hackel } 8496714d8e8SKurt Hackel } 8506714d8e8SKurt Hackel 8516714d8e8SKurt Hackel /* at this point there is either a DLM_MLE_BLOCK or a 8526714d8e8SKurt Hackel * DLM_MLE_MASTER on the master list, so it's safe to add the 8536714d8e8SKurt Hackel * lockres to the hashtable. anyone who finds the lock will 8546714d8e8SKurt Hackel * still have to wait on the IN_PROGRESS. */ 8556714d8e8SKurt Hackel 8566714d8e8SKurt Hackel /* finally add the lockres to its hash bucket */ 8576714d8e8SKurt Hackel __dlm_insert_lockres(dlm, res); 8588d400b81SSunil Mushran 859ff0a522eSSunil Mushran /* Grab inflight ref to pin the resource */ 8608d400b81SSunil Mushran spin_lock(&res->spinlock); 8618d400b81SSunil Mushran dlm_lockres_grab_inflight_ref(dlm, res); 8628d400b81SSunil Mushran spin_unlock(&res->spinlock); 863ba2bf218SKurt Hackel 8646714d8e8SKurt Hackel /* get an extra ref on the mle in case this is a BLOCK 8656714d8e8SKurt Hackel * if so, the creator of the BLOCK may try to put the last 8666714d8e8SKurt Hackel * ref at this time in the assert master handler, so we 8676714d8e8SKurt Hackel * need an extra one to keep from a bad ptr deref. */ 868a2bf0477SKurt Hackel dlm_get_mle_inuse(mle); 8696714d8e8SKurt Hackel spin_unlock(&dlm->master_lock); 8706714d8e8SKurt Hackel spin_unlock(&dlm->spinlock); 8716714d8e8SKurt Hackel 872e7e69eb3SKurt Hackel redo_request: 873c03872f5SKurt Hackel while (wait_on_recovery) { 874c03872f5SKurt Hackel /* any cluster changes that occurred after dropping the 875c03872f5SKurt Hackel * dlm spinlock would be detectable be a change on the mle, 876c03872f5SKurt Hackel * so we only need to clear out the recovery map once. */ 877c03872f5SKurt Hackel if (dlm_is_recovery_lock(lockid, namelen)) { 8788decab3cSSunil Mushran mlog(0, "%s: Recovery map is not empty, but must " 8798decab3cSSunil Mushran "master $RECOVERY lock now\n", dlm->name); 880c03872f5SKurt Hackel if (!dlm_pre_master_reco_lockres(dlm, res)) 881c03872f5SKurt Hackel wait_on_recovery = 0; 882c03872f5SKurt Hackel else { 883c03872f5SKurt Hackel mlog(0, "%s: waiting 500ms for heartbeat state " 884c03872f5SKurt Hackel "change\n", dlm->name); 885c03872f5SKurt Hackel msleep(500); 886c03872f5SKurt Hackel } 887c03872f5SKurt Hackel continue; 888c03872f5SKurt Hackel } 889c03872f5SKurt Hackel 890c03872f5SKurt Hackel dlm_kick_recovery_thread(dlm); 891aa087b84SKurt Hackel msleep(1000); 892c03872f5SKurt Hackel dlm_wait_for_recovery(dlm); 893c03872f5SKurt Hackel 894c03872f5SKurt Hackel spin_lock(&dlm->spinlock); 895c03872f5SKurt Hackel bit = find_next_bit(dlm->recovery_map, O2NM_MAX_NODES, 0); 896c03872f5SKurt Hackel if (bit < O2NM_MAX_NODES) { 8978decab3cSSunil Mushran mlog(0, "%s: res %.*s, At least one node (%d) " 8988decab3cSSunil Mushran "to recover before lock mastery can begin\n", 899c03872f5SKurt Hackel dlm->name, namelen, (char *)lockid, bit); 900c03872f5SKurt Hackel wait_on_recovery = 1; 901c03872f5SKurt Hackel } else 902c03872f5SKurt Hackel wait_on_recovery = 0; 903c03872f5SKurt Hackel spin_unlock(&dlm->spinlock); 904b7084ab5SKurt Hackel 905b7084ab5SKurt Hackel if (wait_on_recovery) 906b7084ab5SKurt Hackel dlm_wait_for_node_recovery(dlm, bit, 10000); 907c03872f5SKurt Hackel } 908c03872f5SKurt Hackel 9096714d8e8SKurt Hackel /* must wait for lock to be mastered elsewhere */ 9106714d8e8SKurt Hackel if (blocked) 9116714d8e8SKurt Hackel goto wait; 9126714d8e8SKurt Hackel 9136714d8e8SKurt Hackel ret = -EINVAL; 9146714d8e8SKurt Hackel dlm_node_iter_init(mle->vote_map, &iter); 9156714d8e8SKurt Hackel while ((nodenum = dlm_node_iter_next(&iter)) >= 0) { 916ba2bf218SKurt Hackel ret = dlm_do_master_request(res, mle, nodenum); 9176714d8e8SKurt Hackel if (ret < 0) 9186714d8e8SKurt Hackel mlog_errno(ret); 9196714d8e8SKurt Hackel if (mle->master != O2NM_MAX_NODES) { 9206714d8e8SKurt Hackel /* found a master ! */ 9219c6510a5SKurt Hackel if (mle->master <= nodenum) 9226714d8e8SKurt Hackel break; 9239c6510a5SKurt Hackel /* if our master request has not reached the master 9249c6510a5SKurt Hackel * yet, keep going until it does. this is how the 9259c6510a5SKurt Hackel * master will know that asserts are needed back to 9269c6510a5SKurt Hackel * the lower nodes. */ 9278decab3cSSunil Mushran mlog(0, "%s: res %.*s, Requests only up to %u but " 9288decab3cSSunil Mushran "master is %u, keep going\n", dlm->name, namelen, 9299c6510a5SKurt Hackel lockid, nodenum, mle->master); 9306714d8e8SKurt Hackel } 9316714d8e8SKurt Hackel } 9326714d8e8SKurt Hackel 9336714d8e8SKurt Hackel wait: 9346714d8e8SKurt Hackel /* keep going until the response map includes all nodes */ 9356714d8e8SKurt Hackel ret = dlm_wait_for_lock_mastery(dlm, res, mle, &blocked); 9366714d8e8SKurt Hackel if (ret < 0) { 937e7e69eb3SKurt Hackel wait_on_recovery = 1; 9388decab3cSSunil Mushran mlog(0, "%s: res %.*s, Node map changed, redo the master " 9398decab3cSSunil Mushran "request now, blocked=%d\n", dlm->name, res->lockname.len, 9406714d8e8SKurt Hackel res->lockname.name, blocked); 9416714d8e8SKurt Hackel if (++tries > 20) { 9428decab3cSSunil Mushran mlog(ML_ERROR, "%s: res %.*s, Spinning on " 9436714d8e8SKurt Hackel "dlm_wait_for_lock_mastery, blocked = %d\n", 9446714d8e8SKurt Hackel dlm->name, res->lockname.len, 9456714d8e8SKurt Hackel res->lockname.name, blocked); 9466714d8e8SKurt Hackel dlm_print_one_lock_resource(res); 9478a9343faSMark Fasheh dlm_print_one_mle(mle); 9486714d8e8SKurt Hackel tries = 0; 9496714d8e8SKurt Hackel } 9506714d8e8SKurt Hackel goto redo_request; 9516714d8e8SKurt Hackel } 9526714d8e8SKurt Hackel 9538decab3cSSunil Mushran mlog(0, "%s: res %.*s, Mastered by %u\n", dlm->name, res->lockname.len, 9548decab3cSSunil Mushran res->lockname.name, res->owner); 9556714d8e8SKurt Hackel /* make sure we never continue without this */ 9566714d8e8SKurt Hackel BUG_ON(res->owner == O2NM_MAX_NODES); 9576714d8e8SKurt Hackel 9586714d8e8SKurt Hackel /* master is known, detach if not already detached */ 9596714d8e8SKurt Hackel dlm_mle_detach_hb_events(dlm, mle); 9606714d8e8SKurt Hackel dlm_put_mle(mle); 9616714d8e8SKurt Hackel /* put the extra ref */ 962a2bf0477SKurt Hackel dlm_put_mle_inuse(mle); 9636714d8e8SKurt Hackel 9646714d8e8SKurt Hackel wake_waiters: 9656714d8e8SKurt Hackel spin_lock(&res->spinlock); 9666714d8e8SKurt Hackel res->state &= ~DLM_LOCK_RES_IN_PROGRESS; 9676714d8e8SKurt Hackel spin_unlock(&res->spinlock); 9686714d8e8SKurt Hackel wake_up(&res->wq); 9696714d8e8SKurt Hackel 9706714d8e8SKurt Hackel leave: 9716714d8e8SKurt Hackel /* need to free the unused mle */ 9726714d8e8SKurt Hackel if (alloc_mle) 9736714d8e8SKurt Hackel kmem_cache_free(dlm_mle_cache, alloc_mle); 9746714d8e8SKurt Hackel 9756714d8e8SKurt Hackel return res; 9766714d8e8SKurt Hackel } 9776714d8e8SKurt Hackel 9786714d8e8SKurt Hackel 9796714d8e8SKurt Hackel #define DLM_MASTERY_TIMEOUT_MS 5000 9806714d8e8SKurt Hackel 9816714d8e8SKurt Hackel static int dlm_wait_for_lock_mastery(struct dlm_ctxt *dlm, 9826714d8e8SKurt Hackel struct dlm_lock_resource *res, 9836714d8e8SKurt Hackel struct dlm_master_list_entry *mle, 9846714d8e8SKurt Hackel int *blocked) 9856714d8e8SKurt Hackel { 9866714d8e8SKurt Hackel u8 m; 9876714d8e8SKurt Hackel int ret, bit; 9886714d8e8SKurt Hackel int map_changed, voting_done; 9896714d8e8SKurt Hackel int assert, sleep; 9906714d8e8SKurt Hackel 9916714d8e8SKurt Hackel recheck: 9926714d8e8SKurt Hackel ret = 0; 9936714d8e8SKurt Hackel assert = 0; 9946714d8e8SKurt Hackel 9956714d8e8SKurt Hackel /* check if another node has already become the owner */ 9966714d8e8SKurt Hackel spin_lock(&res->spinlock); 9976714d8e8SKurt Hackel if (res->owner != DLM_LOCK_RES_OWNER_UNKNOWN) { 9989c6510a5SKurt Hackel mlog(0, "%s:%.*s: owner is suddenly %u\n", dlm->name, 9999c6510a5SKurt Hackel res->lockname.len, res->lockname.name, res->owner); 10006714d8e8SKurt Hackel spin_unlock(&res->spinlock); 10019c6510a5SKurt Hackel /* this will cause the master to re-assert across 10029c6510a5SKurt Hackel * the whole cluster, freeing up mles */ 1003588e0090SKurt Hackel if (res->owner != dlm->node_num) { 1004ba2bf218SKurt Hackel ret = dlm_do_master_request(res, mle, res->owner); 10059c6510a5SKurt Hackel if (ret < 0) { 10069c6510a5SKurt Hackel /* give recovery a chance to run */ 10079c6510a5SKurt Hackel mlog(ML_ERROR, "link to %u went down?: %d\n", res->owner, ret); 10089c6510a5SKurt Hackel msleep(500); 10099c6510a5SKurt Hackel goto recheck; 10109c6510a5SKurt Hackel } 1011588e0090SKurt Hackel } 10129c6510a5SKurt Hackel ret = 0; 10136714d8e8SKurt Hackel goto leave; 10146714d8e8SKurt Hackel } 10156714d8e8SKurt Hackel spin_unlock(&res->spinlock); 10166714d8e8SKurt Hackel 10176714d8e8SKurt Hackel spin_lock(&mle->spinlock); 10186714d8e8SKurt Hackel m = mle->master; 10196714d8e8SKurt Hackel map_changed = (memcmp(mle->vote_map, mle->node_map, 10206714d8e8SKurt Hackel sizeof(mle->vote_map)) != 0); 10216714d8e8SKurt Hackel voting_done = (memcmp(mle->vote_map, mle->response_map, 10226714d8e8SKurt Hackel sizeof(mle->vote_map)) == 0); 10236714d8e8SKurt Hackel 10246714d8e8SKurt Hackel /* restart if we hit any errors */ 10256714d8e8SKurt Hackel if (map_changed) { 10266714d8e8SKurt Hackel int b; 10276714d8e8SKurt Hackel mlog(0, "%s: %.*s: node map changed, restarting\n", 10286714d8e8SKurt Hackel dlm->name, res->lockname.len, res->lockname.name); 10296714d8e8SKurt Hackel ret = dlm_restart_lock_mastery(dlm, res, mle, *blocked); 10306714d8e8SKurt Hackel b = (mle->type == DLM_MLE_BLOCK); 10316714d8e8SKurt Hackel if ((*blocked && !b) || (!*blocked && b)) { 10326714d8e8SKurt Hackel mlog(0, "%s:%.*s: status change: old=%d new=%d\n", 10336714d8e8SKurt Hackel dlm->name, res->lockname.len, res->lockname.name, 10346714d8e8SKurt Hackel *blocked, b); 10356714d8e8SKurt Hackel *blocked = b; 10366714d8e8SKurt Hackel } 10376714d8e8SKurt Hackel spin_unlock(&mle->spinlock); 10386714d8e8SKurt Hackel if (ret < 0) { 10396714d8e8SKurt Hackel mlog_errno(ret); 10406714d8e8SKurt Hackel goto leave; 10416714d8e8SKurt Hackel } 10426714d8e8SKurt Hackel mlog(0, "%s:%.*s: restart lock mastery succeeded, " 10436714d8e8SKurt Hackel "rechecking now\n", dlm->name, res->lockname.len, 10446714d8e8SKurt Hackel res->lockname.name); 10456714d8e8SKurt Hackel goto recheck; 1046aa852354SKurt Hackel } else { 1047aa852354SKurt Hackel if (!voting_done) { 1048aa852354SKurt Hackel mlog(0, "map not changed and voting not done " 1049aa852354SKurt Hackel "for %s:%.*s\n", dlm->name, res->lockname.len, 1050aa852354SKurt Hackel res->lockname.name); 1051aa852354SKurt Hackel } 10526714d8e8SKurt Hackel } 10536714d8e8SKurt Hackel 10546714d8e8SKurt Hackel if (m != O2NM_MAX_NODES) { 10556714d8e8SKurt Hackel /* another node has done an assert! 10566714d8e8SKurt Hackel * all done! */ 10576714d8e8SKurt Hackel sleep = 0; 10586714d8e8SKurt Hackel } else { 10596714d8e8SKurt Hackel sleep = 1; 10606714d8e8SKurt Hackel /* have all nodes responded? */ 10616714d8e8SKurt Hackel if (voting_done && !*blocked) { 10626714d8e8SKurt Hackel bit = find_next_bit(mle->maybe_map, O2NM_MAX_NODES, 0); 10636714d8e8SKurt Hackel if (dlm->node_num <= bit) { 10646714d8e8SKurt Hackel /* my node number is lowest. 10656714d8e8SKurt Hackel * now tell other nodes that I am 10666714d8e8SKurt Hackel * mastering this. */ 10676714d8e8SKurt Hackel mle->master = dlm->node_num; 1068ba2bf218SKurt Hackel /* ref was grabbed in get_lock_resource 1069ba2bf218SKurt Hackel * will be dropped in dlmlock_master */ 10706714d8e8SKurt Hackel assert = 1; 10716714d8e8SKurt Hackel sleep = 0; 10726714d8e8SKurt Hackel } 10736714d8e8SKurt Hackel /* if voting is done, but we have not received 10746714d8e8SKurt Hackel * an assert master yet, we must sleep */ 10756714d8e8SKurt Hackel } 10766714d8e8SKurt Hackel } 10776714d8e8SKurt Hackel 10786714d8e8SKurt Hackel spin_unlock(&mle->spinlock); 10796714d8e8SKurt Hackel 10806714d8e8SKurt Hackel /* sleep if we haven't finished voting yet */ 10816714d8e8SKurt Hackel if (sleep) { 10826714d8e8SKurt Hackel unsigned long timeo = msecs_to_jiffies(DLM_MASTERY_TIMEOUT_MS); 10836714d8e8SKurt Hackel 10846714d8e8SKurt Hackel /* 10856714d8e8SKurt Hackel if (atomic_read(&mle->mle_refs.refcount) < 2) 10866714d8e8SKurt Hackel mlog(ML_ERROR, "mle (%p) refs=%d, name=%.*s\n", mle, 10876714d8e8SKurt Hackel atomic_read(&mle->mle_refs.refcount), 10886714d8e8SKurt Hackel res->lockname.len, res->lockname.name); 10896714d8e8SKurt Hackel */ 10906714d8e8SKurt Hackel atomic_set(&mle->woken, 0); 10916714d8e8SKurt Hackel (void)wait_event_timeout(mle->wq, 10926714d8e8SKurt Hackel (atomic_read(&mle->woken) == 1), 10936714d8e8SKurt Hackel timeo); 10946714d8e8SKurt Hackel if (res->owner == O2NM_MAX_NODES) { 1095ba2bf218SKurt Hackel mlog(0, "%s:%.*s: waiting again\n", dlm->name, 1096ba2bf218SKurt Hackel res->lockname.len, res->lockname.name); 10976714d8e8SKurt Hackel goto recheck; 10986714d8e8SKurt Hackel } 10996714d8e8SKurt Hackel mlog(0, "done waiting, master is %u\n", res->owner); 11006714d8e8SKurt Hackel ret = 0; 11016714d8e8SKurt Hackel goto leave; 11026714d8e8SKurt Hackel } 11036714d8e8SKurt Hackel 11046714d8e8SKurt Hackel ret = 0; /* done */ 11056714d8e8SKurt Hackel if (assert) { 11066714d8e8SKurt Hackel m = dlm->node_num; 11076714d8e8SKurt Hackel mlog(0, "about to master %.*s here, this=%u\n", 11086714d8e8SKurt Hackel res->lockname.len, res->lockname.name, m); 1109ba2bf218SKurt Hackel ret = dlm_do_assert_master(dlm, res, mle->vote_map, 0); 11106714d8e8SKurt Hackel if (ret) { 11116714d8e8SKurt Hackel /* This is a failure in the network path, 11126714d8e8SKurt Hackel * not in the response to the assert_master 11136714d8e8SKurt Hackel * (any nonzero response is a BUG on this node). 11146714d8e8SKurt Hackel * Most likely a socket just got disconnected 11156714d8e8SKurt Hackel * due to node death. */ 11166714d8e8SKurt Hackel mlog_errno(ret); 11176714d8e8SKurt Hackel } 11186714d8e8SKurt Hackel /* no longer need to restart lock mastery. 11196714d8e8SKurt Hackel * all living nodes have been contacted. */ 11206714d8e8SKurt Hackel ret = 0; 11216714d8e8SKurt Hackel } 11226714d8e8SKurt Hackel 11236714d8e8SKurt Hackel /* set the lockres owner */ 11246714d8e8SKurt Hackel spin_lock(&res->spinlock); 1125ba2bf218SKurt Hackel /* mastery reference obtained either during 1126ba2bf218SKurt Hackel * assert_master_handler or in get_lock_resource */ 11276714d8e8SKurt Hackel dlm_change_lockres_owner(dlm, res, m); 11286714d8e8SKurt Hackel spin_unlock(&res->spinlock); 11296714d8e8SKurt Hackel 11306714d8e8SKurt Hackel leave: 11316714d8e8SKurt Hackel return ret; 11326714d8e8SKurt Hackel } 11336714d8e8SKurt Hackel 11346714d8e8SKurt Hackel struct dlm_bitmap_diff_iter 11356714d8e8SKurt Hackel { 11366714d8e8SKurt Hackel int curnode; 11376714d8e8SKurt Hackel unsigned long *orig_bm; 11386714d8e8SKurt Hackel unsigned long *cur_bm; 11396714d8e8SKurt Hackel unsigned long diff_bm[BITS_TO_LONGS(O2NM_MAX_NODES)]; 11406714d8e8SKurt Hackel }; 11416714d8e8SKurt Hackel 11426714d8e8SKurt Hackel enum dlm_node_state_change 11436714d8e8SKurt Hackel { 11446714d8e8SKurt Hackel NODE_DOWN = -1, 11456714d8e8SKurt Hackel NODE_NO_CHANGE = 0, 11466714d8e8SKurt Hackel NODE_UP 11476714d8e8SKurt Hackel }; 11486714d8e8SKurt Hackel 11496714d8e8SKurt Hackel static void dlm_bitmap_diff_iter_init(struct dlm_bitmap_diff_iter *iter, 11506714d8e8SKurt Hackel unsigned long *orig_bm, 11516714d8e8SKurt Hackel unsigned long *cur_bm) 11526714d8e8SKurt Hackel { 11536714d8e8SKurt Hackel unsigned long p1, p2; 11546714d8e8SKurt Hackel int i; 11556714d8e8SKurt Hackel 11566714d8e8SKurt Hackel iter->curnode = -1; 11576714d8e8SKurt Hackel iter->orig_bm = orig_bm; 11586714d8e8SKurt Hackel iter->cur_bm = cur_bm; 11596714d8e8SKurt Hackel 11606714d8e8SKurt Hackel for (i = 0; i < BITS_TO_LONGS(O2NM_MAX_NODES); i++) { 11616714d8e8SKurt Hackel p1 = *(iter->orig_bm + i); 11626714d8e8SKurt Hackel p2 = *(iter->cur_bm + i); 11636714d8e8SKurt Hackel iter->diff_bm[i] = (p1 & ~p2) | (p2 & ~p1); 11646714d8e8SKurt Hackel } 11656714d8e8SKurt Hackel } 11666714d8e8SKurt Hackel 11676714d8e8SKurt Hackel static int dlm_bitmap_diff_iter_next(struct dlm_bitmap_diff_iter *iter, 11686714d8e8SKurt Hackel enum dlm_node_state_change *state) 11696714d8e8SKurt Hackel { 11706714d8e8SKurt Hackel int bit; 11716714d8e8SKurt Hackel 11726714d8e8SKurt Hackel if (iter->curnode >= O2NM_MAX_NODES) 11736714d8e8SKurt Hackel return -ENOENT; 11746714d8e8SKurt Hackel 11756714d8e8SKurt Hackel bit = find_next_bit(iter->diff_bm, O2NM_MAX_NODES, 11766714d8e8SKurt Hackel iter->curnode+1); 11776714d8e8SKurt Hackel if (bit >= O2NM_MAX_NODES) { 11786714d8e8SKurt Hackel iter->curnode = O2NM_MAX_NODES; 11796714d8e8SKurt Hackel return -ENOENT; 11806714d8e8SKurt Hackel } 11816714d8e8SKurt Hackel 11826714d8e8SKurt Hackel /* if it was there in the original then this node died */ 11836714d8e8SKurt Hackel if (test_bit(bit, iter->orig_bm)) 11846714d8e8SKurt Hackel *state = NODE_DOWN; 11856714d8e8SKurt Hackel else 11866714d8e8SKurt Hackel *state = NODE_UP; 11876714d8e8SKurt Hackel 11886714d8e8SKurt Hackel iter->curnode = bit; 11896714d8e8SKurt Hackel return bit; 11906714d8e8SKurt Hackel } 11916714d8e8SKurt Hackel 11926714d8e8SKurt Hackel 11936714d8e8SKurt Hackel static int dlm_restart_lock_mastery(struct dlm_ctxt *dlm, 11946714d8e8SKurt Hackel struct dlm_lock_resource *res, 11956714d8e8SKurt Hackel struct dlm_master_list_entry *mle, 11966714d8e8SKurt Hackel int blocked) 11976714d8e8SKurt Hackel { 11986714d8e8SKurt Hackel struct dlm_bitmap_diff_iter bdi; 11996714d8e8SKurt Hackel enum dlm_node_state_change sc; 12006714d8e8SKurt Hackel int node; 12016714d8e8SKurt Hackel int ret = 0; 12026714d8e8SKurt Hackel 12036714d8e8SKurt Hackel mlog(0, "something happened such that the " 12046714d8e8SKurt Hackel "master process may need to be restarted!\n"); 12056714d8e8SKurt Hackel 12066714d8e8SKurt Hackel assert_spin_locked(&mle->spinlock); 12076714d8e8SKurt Hackel 12086714d8e8SKurt Hackel dlm_bitmap_diff_iter_init(&bdi, mle->vote_map, mle->node_map); 12096714d8e8SKurt Hackel node = dlm_bitmap_diff_iter_next(&bdi, &sc); 12106714d8e8SKurt Hackel while (node >= 0) { 12116714d8e8SKurt Hackel if (sc == NODE_UP) { 1212e2faea4cSKurt Hackel /* a node came up. clear any old vote from 1213e2faea4cSKurt Hackel * the response map and set it in the vote map 1214e2faea4cSKurt Hackel * then restart the mastery. */ 1215e2faea4cSKurt Hackel mlog(ML_NOTICE, "node %d up while restarting\n", node); 12166714d8e8SKurt Hackel 12176714d8e8SKurt Hackel /* redo the master request, but only for the new node */ 12186714d8e8SKurt Hackel mlog(0, "sending request to new node\n"); 12196714d8e8SKurt Hackel clear_bit(node, mle->response_map); 12206714d8e8SKurt Hackel set_bit(node, mle->vote_map); 12216714d8e8SKurt Hackel } else { 12226714d8e8SKurt Hackel mlog(ML_ERROR, "node down! %d\n", node); 12236714d8e8SKurt Hackel if (blocked) { 12246714d8e8SKurt Hackel int lowest = find_next_bit(mle->maybe_map, 12256714d8e8SKurt Hackel O2NM_MAX_NODES, 0); 12266714d8e8SKurt Hackel 12276714d8e8SKurt Hackel /* act like it was never there */ 12286714d8e8SKurt Hackel clear_bit(node, mle->maybe_map); 12296714d8e8SKurt Hackel 1230e7e69eb3SKurt Hackel if (node == lowest) { 1231e7e69eb3SKurt Hackel mlog(0, "expected master %u died" 1232e7e69eb3SKurt Hackel " while this node was blocked " 1233e7e69eb3SKurt Hackel "waiting on it!\n", node); 12346714d8e8SKurt Hackel lowest = find_next_bit(mle->maybe_map, 12356714d8e8SKurt Hackel O2NM_MAX_NODES, 12366714d8e8SKurt Hackel lowest+1); 12376714d8e8SKurt Hackel if (lowest < O2NM_MAX_NODES) { 1238e7e69eb3SKurt Hackel mlog(0, "%s:%.*s:still " 1239e7e69eb3SKurt Hackel "blocked. waiting on %u " 1240e7e69eb3SKurt Hackel "now\n", dlm->name, 1241e7e69eb3SKurt Hackel res->lockname.len, 1242e7e69eb3SKurt Hackel res->lockname.name, 1243e7e69eb3SKurt Hackel lowest); 1244e7e69eb3SKurt Hackel } else { 1245e7e69eb3SKurt Hackel /* mle is an MLE_BLOCK, but 1246e7e69eb3SKurt Hackel * there is now nothing left to 1247e7e69eb3SKurt Hackel * block on. we need to return 1248e7e69eb3SKurt Hackel * all the way back out and try 1249e7e69eb3SKurt Hackel * again with an MLE_MASTER. 1250e7e69eb3SKurt Hackel * dlm_do_local_recovery_cleanup 1251e7e69eb3SKurt Hackel * has already run, so the mle 1252e7e69eb3SKurt Hackel * refcount is ok */ 1253e7e69eb3SKurt Hackel mlog(0, "%s:%.*s: no " 1254e7e69eb3SKurt Hackel "longer blocking. try to " 1255e7e69eb3SKurt Hackel "master this here\n", 1256e7e69eb3SKurt Hackel dlm->name, 1257e7e69eb3SKurt Hackel res->lockname.len, 1258e7e69eb3SKurt Hackel res->lockname.name); 1259e7e69eb3SKurt Hackel mle->type = DLM_MLE_MASTER; 12607141514bSSunil Mushran mle->mleres = res; 1261e7e69eb3SKurt Hackel } 1262e7e69eb3SKurt Hackel } 12636714d8e8SKurt Hackel } 12646714d8e8SKurt Hackel 1265e7e69eb3SKurt Hackel /* now blank out everything, as if we had never 1266e7e69eb3SKurt Hackel * contacted anyone */ 1267e7e69eb3SKurt Hackel memset(mle->maybe_map, 0, sizeof(mle->maybe_map)); 1268e7e69eb3SKurt Hackel memset(mle->response_map, 0, sizeof(mle->response_map)); 1269e7e69eb3SKurt Hackel /* reset the vote_map to the current node_map */ 12706714d8e8SKurt Hackel memcpy(mle->vote_map, mle->node_map, 12716714d8e8SKurt Hackel sizeof(mle->node_map)); 1272e7e69eb3SKurt Hackel /* put myself into the maybe map */ 1273e7e69eb3SKurt Hackel if (mle->type != DLM_MLE_BLOCK) 12746714d8e8SKurt Hackel set_bit(dlm->node_num, mle->maybe_map); 12756714d8e8SKurt Hackel } 12766714d8e8SKurt Hackel ret = -EAGAIN; 12776714d8e8SKurt Hackel node = dlm_bitmap_diff_iter_next(&bdi, &sc); 12786714d8e8SKurt Hackel } 12796714d8e8SKurt Hackel return ret; 12806714d8e8SKurt Hackel } 12816714d8e8SKurt Hackel 12826714d8e8SKurt Hackel 12836714d8e8SKurt Hackel /* 12846714d8e8SKurt Hackel * DLM_MASTER_REQUEST_MSG 12856714d8e8SKurt Hackel * 12866714d8e8SKurt Hackel * returns: 0 on success, 12876714d8e8SKurt Hackel * -errno on a network error 12886714d8e8SKurt Hackel * 12896714d8e8SKurt Hackel * on error, the caller should assume the target node is "dead" 12906714d8e8SKurt Hackel * 12916714d8e8SKurt Hackel */ 12926714d8e8SKurt Hackel 1293ba2bf218SKurt Hackel static int dlm_do_master_request(struct dlm_lock_resource *res, 1294ba2bf218SKurt Hackel struct dlm_master_list_entry *mle, int to) 12956714d8e8SKurt Hackel { 12966714d8e8SKurt Hackel struct dlm_ctxt *dlm = mle->dlm; 12976714d8e8SKurt Hackel struct dlm_master_request request; 12986714d8e8SKurt Hackel int ret, response=0, resend; 12996714d8e8SKurt Hackel 13006714d8e8SKurt Hackel memset(&request, 0, sizeof(request)); 13016714d8e8SKurt Hackel request.node_idx = dlm->node_num; 13026714d8e8SKurt Hackel 13036714d8e8SKurt Hackel BUG_ON(mle->type == DLM_MLE_MIGRATION); 13046714d8e8SKurt Hackel 13057141514bSSunil Mushran request.namelen = (u8)mle->mnamelen; 13067141514bSSunil Mushran memcpy(request.name, mle->mname, request.namelen); 13076714d8e8SKurt Hackel 13086714d8e8SKurt Hackel again: 13096714d8e8SKurt Hackel ret = o2net_send_message(DLM_MASTER_REQUEST_MSG, dlm->key, &request, 13106714d8e8SKurt Hackel sizeof(request), to, &response); 13116714d8e8SKurt Hackel if (ret < 0) { 13126714d8e8SKurt Hackel if (ret == -ESRCH) { 13136714d8e8SKurt Hackel /* should never happen */ 13146714d8e8SKurt Hackel mlog(ML_ERROR, "TCP stack not ready!\n"); 13156714d8e8SKurt Hackel BUG(); 13166714d8e8SKurt Hackel } else if (ret == -EINVAL) { 13176714d8e8SKurt Hackel mlog(ML_ERROR, "bad args passed to o2net!\n"); 13186714d8e8SKurt Hackel BUG(); 13196714d8e8SKurt Hackel } else if (ret == -ENOMEM) { 13206714d8e8SKurt Hackel mlog(ML_ERROR, "out of memory while trying to send " 13216714d8e8SKurt Hackel "network message! retrying\n"); 13226714d8e8SKurt Hackel /* this is totally crude */ 13236714d8e8SKurt Hackel msleep(50); 13246714d8e8SKurt Hackel goto again; 13256714d8e8SKurt Hackel } else if (!dlm_is_host_down(ret)) { 13266714d8e8SKurt Hackel /* not a network error. bad. */ 13276714d8e8SKurt Hackel mlog_errno(ret); 13286714d8e8SKurt Hackel mlog(ML_ERROR, "unhandled error!"); 13296714d8e8SKurt Hackel BUG(); 13306714d8e8SKurt Hackel } 13316714d8e8SKurt Hackel /* all other errors should be network errors, 13326714d8e8SKurt Hackel * and likely indicate node death */ 13336714d8e8SKurt Hackel mlog(ML_ERROR, "link to %d went down!\n", to); 13346714d8e8SKurt Hackel goto out; 13356714d8e8SKurt Hackel } 13366714d8e8SKurt Hackel 13376714d8e8SKurt Hackel ret = 0; 13386714d8e8SKurt Hackel resend = 0; 13396714d8e8SKurt Hackel spin_lock(&mle->spinlock); 13406714d8e8SKurt Hackel switch (response) { 13416714d8e8SKurt Hackel case DLM_MASTER_RESP_YES: 13426714d8e8SKurt Hackel set_bit(to, mle->response_map); 13436714d8e8SKurt Hackel mlog(0, "node %u is the master, response=YES\n", to); 1344ba2bf218SKurt Hackel mlog(0, "%s:%.*s: master node %u now knows I have a " 1345ba2bf218SKurt Hackel "reference\n", dlm->name, res->lockname.len, 1346ba2bf218SKurt Hackel res->lockname.name, to); 13476714d8e8SKurt Hackel mle->master = to; 13486714d8e8SKurt Hackel break; 13496714d8e8SKurt Hackel case DLM_MASTER_RESP_NO: 13506714d8e8SKurt Hackel mlog(0, "node %u not master, response=NO\n", to); 13516714d8e8SKurt Hackel set_bit(to, mle->response_map); 13526714d8e8SKurt Hackel break; 13536714d8e8SKurt Hackel case DLM_MASTER_RESP_MAYBE: 13546714d8e8SKurt Hackel mlog(0, "node %u not master, response=MAYBE\n", to); 13556714d8e8SKurt Hackel set_bit(to, mle->response_map); 13566714d8e8SKurt Hackel set_bit(to, mle->maybe_map); 13576714d8e8SKurt Hackel break; 13586714d8e8SKurt Hackel case DLM_MASTER_RESP_ERROR: 13596714d8e8SKurt Hackel mlog(0, "node %u hit an error, resending\n", to); 13606714d8e8SKurt Hackel resend = 1; 13616714d8e8SKurt Hackel response = 0; 13626714d8e8SKurt Hackel break; 13636714d8e8SKurt Hackel default: 13646714d8e8SKurt Hackel mlog(ML_ERROR, "bad response! %u\n", response); 13656714d8e8SKurt Hackel BUG(); 13666714d8e8SKurt Hackel } 13676714d8e8SKurt Hackel spin_unlock(&mle->spinlock); 13686714d8e8SKurt Hackel if (resend) { 13696714d8e8SKurt Hackel /* this is also totally crude */ 13706714d8e8SKurt Hackel msleep(50); 13716714d8e8SKurt Hackel goto again; 13726714d8e8SKurt Hackel } 13736714d8e8SKurt Hackel 13746714d8e8SKurt Hackel out: 13756714d8e8SKurt Hackel return ret; 13766714d8e8SKurt Hackel } 13776714d8e8SKurt Hackel 13786714d8e8SKurt Hackel /* 13796714d8e8SKurt Hackel * locks that can be taken here: 13806714d8e8SKurt Hackel * dlm->spinlock 13816714d8e8SKurt Hackel * res->spinlock 13826714d8e8SKurt Hackel * mle->spinlock 13836714d8e8SKurt Hackel * dlm->master_list 13846714d8e8SKurt Hackel * 13856714d8e8SKurt Hackel * if possible, TRIM THIS DOWN!!! 13866714d8e8SKurt Hackel */ 1387d74c9803SKurt Hackel int dlm_master_request_handler(struct o2net_msg *msg, u32 len, void *data, 1388d74c9803SKurt Hackel void **ret_data) 13896714d8e8SKurt Hackel { 13906714d8e8SKurt Hackel u8 response = DLM_MASTER_RESP_MAYBE; 13916714d8e8SKurt Hackel struct dlm_ctxt *dlm = data; 13929c6510a5SKurt Hackel struct dlm_lock_resource *res = NULL; 13936714d8e8SKurt Hackel struct dlm_master_request *request = (struct dlm_master_request *) msg->buf; 13946714d8e8SKurt Hackel struct dlm_master_list_entry *mle = NULL, *tmpmle = NULL; 13956714d8e8SKurt Hackel char *name; 1396a3d33291SMark Fasheh unsigned int namelen, hash; 13976714d8e8SKurt Hackel int found, ret; 13986714d8e8SKurt Hackel int set_maybe; 13999c6510a5SKurt Hackel int dispatch_assert = 0; 14006714d8e8SKurt Hackel 14016714d8e8SKurt Hackel if (!dlm_grab(dlm)) 14026714d8e8SKurt Hackel return DLM_MASTER_RESP_NO; 14036714d8e8SKurt Hackel 14046714d8e8SKurt Hackel if (!dlm_domain_fully_joined(dlm)) { 14056714d8e8SKurt Hackel response = DLM_MASTER_RESP_NO; 14066714d8e8SKurt Hackel goto send_response; 14076714d8e8SKurt Hackel } 14086714d8e8SKurt Hackel 14096714d8e8SKurt Hackel name = request->name; 14106714d8e8SKurt Hackel namelen = request->namelen; 1411a3d33291SMark Fasheh hash = dlm_lockid_hash(name, namelen); 14126714d8e8SKurt Hackel 14136714d8e8SKurt Hackel if (namelen > DLM_LOCKID_NAME_MAX) { 14146714d8e8SKurt Hackel response = DLM_IVBUFLEN; 14156714d8e8SKurt Hackel goto send_response; 14166714d8e8SKurt Hackel } 14176714d8e8SKurt Hackel 14186714d8e8SKurt Hackel way_up_top: 14196714d8e8SKurt Hackel spin_lock(&dlm->spinlock); 1420a3d33291SMark Fasheh res = __dlm_lookup_lockres(dlm, name, namelen, hash); 14216714d8e8SKurt Hackel if (res) { 14226714d8e8SKurt Hackel spin_unlock(&dlm->spinlock); 14236714d8e8SKurt Hackel 14246714d8e8SKurt Hackel /* take care of the easy cases up front */ 14256714d8e8SKurt Hackel spin_lock(&res->spinlock); 14261cd04dbeSKurt Hackel if (res->state & (DLM_LOCK_RES_RECOVERING| 14271cd04dbeSKurt Hackel DLM_LOCK_RES_MIGRATING)) { 14286714d8e8SKurt Hackel spin_unlock(&res->spinlock); 14296714d8e8SKurt Hackel mlog(0, "returning DLM_MASTER_RESP_ERROR since res is " 14301cd04dbeSKurt Hackel "being recovered/migrated\n"); 14316714d8e8SKurt Hackel response = DLM_MASTER_RESP_ERROR; 14326714d8e8SKurt Hackel if (mle) 14336714d8e8SKurt Hackel kmem_cache_free(dlm_mle_cache, mle); 14346714d8e8SKurt Hackel goto send_response; 14356714d8e8SKurt Hackel } 14366714d8e8SKurt Hackel 14376714d8e8SKurt Hackel if (res->owner == dlm->node_num) { 14388d400b81SSunil Mushran dlm_lockres_set_refmap_bit(dlm, res, request->node_idx); 14396714d8e8SKurt Hackel spin_unlock(&res->spinlock); 14406714d8e8SKurt Hackel response = DLM_MASTER_RESP_YES; 14416714d8e8SKurt Hackel if (mle) 14426714d8e8SKurt Hackel kmem_cache_free(dlm_mle_cache, mle); 14436714d8e8SKurt Hackel 14446714d8e8SKurt Hackel /* this node is the owner. 14456714d8e8SKurt Hackel * there is some extra work that needs to 14466714d8e8SKurt Hackel * happen now. the requesting node has 14476714d8e8SKurt Hackel * caused all nodes up to this one to 14486714d8e8SKurt Hackel * create mles. this node now needs to 14496714d8e8SKurt Hackel * go back and clean those up. */ 14509c6510a5SKurt Hackel dispatch_assert = 1; 14516714d8e8SKurt Hackel goto send_response; 14526714d8e8SKurt Hackel } else if (res->owner != DLM_LOCK_RES_OWNER_UNKNOWN) { 14536714d8e8SKurt Hackel spin_unlock(&res->spinlock); 14546714d8e8SKurt Hackel // mlog(0, "node %u is the master\n", res->owner); 14556714d8e8SKurt Hackel response = DLM_MASTER_RESP_NO; 14566714d8e8SKurt Hackel if (mle) 14576714d8e8SKurt Hackel kmem_cache_free(dlm_mle_cache, mle); 14586714d8e8SKurt Hackel goto send_response; 14596714d8e8SKurt Hackel } 14606714d8e8SKurt Hackel 14616714d8e8SKurt Hackel /* ok, there is no owner. either this node is 14626714d8e8SKurt Hackel * being blocked, or it is actively trying to 14636714d8e8SKurt Hackel * master this lock. */ 14646714d8e8SKurt Hackel if (!(res->state & DLM_LOCK_RES_IN_PROGRESS)) { 14656714d8e8SKurt Hackel mlog(ML_ERROR, "lock with no owner should be " 14666714d8e8SKurt Hackel "in-progress!\n"); 14676714d8e8SKurt Hackel BUG(); 14686714d8e8SKurt Hackel } 14696714d8e8SKurt Hackel 14706714d8e8SKurt Hackel // mlog(0, "lockres is in progress...\n"); 14716714d8e8SKurt Hackel spin_lock(&dlm->master_lock); 14726714d8e8SKurt Hackel found = dlm_find_mle(dlm, &tmpmle, name, namelen); 14736714d8e8SKurt Hackel if (!found) { 14746714d8e8SKurt Hackel mlog(ML_ERROR, "no mle found for this lock!\n"); 14756714d8e8SKurt Hackel BUG(); 14766714d8e8SKurt Hackel } 14776714d8e8SKurt Hackel set_maybe = 1; 14786714d8e8SKurt Hackel spin_lock(&tmpmle->spinlock); 14796714d8e8SKurt Hackel if (tmpmle->type == DLM_MLE_BLOCK) { 14806714d8e8SKurt Hackel // mlog(0, "this node is waiting for " 14816714d8e8SKurt Hackel // "lockres to be mastered\n"); 14826714d8e8SKurt Hackel response = DLM_MASTER_RESP_NO; 14836714d8e8SKurt Hackel } else if (tmpmle->type == DLM_MLE_MIGRATION) { 14846714d8e8SKurt Hackel mlog(0, "node %u is master, but trying to migrate to " 14856714d8e8SKurt Hackel "node %u.\n", tmpmle->master, tmpmle->new_master); 14866714d8e8SKurt Hackel if (tmpmle->master == dlm->node_num) { 14876714d8e8SKurt Hackel mlog(ML_ERROR, "no owner on lockres, but this " 14886714d8e8SKurt Hackel "node is trying to migrate it to %u?!\n", 14896714d8e8SKurt Hackel tmpmle->new_master); 14906714d8e8SKurt Hackel BUG(); 14916714d8e8SKurt Hackel } else { 14926714d8e8SKurt Hackel /* the real master can respond on its own */ 14936714d8e8SKurt Hackel response = DLM_MASTER_RESP_NO; 14946714d8e8SKurt Hackel } 14956714d8e8SKurt Hackel } else if (tmpmle->master != DLM_LOCK_RES_OWNER_UNKNOWN) { 14966714d8e8SKurt Hackel set_maybe = 0; 14979c6510a5SKurt Hackel if (tmpmle->master == dlm->node_num) { 14986714d8e8SKurt Hackel response = DLM_MASTER_RESP_YES; 14999c6510a5SKurt Hackel /* this node will be the owner. 15009c6510a5SKurt Hackel * go back and clean the mles on any 15019c6510a5SKurt Hackel * other nodes */ 15029c6510a5SKurt Hackel dispatch_assert = 1; 15038d400b81SSunil Mushran dlm_lockres_set_refmap_bit(dlm, res, 1504ba2bf218SKurt Hackel request->node_idx); 15059c6510a5SKurt Hackel } else 15066714d8e8SKurt Hackel response = DLM_MASTER_RESP_NO; 15076714d8e8SKurt Hackel } else { 15086714d8e8SKurt Hackel // mlog(0, "this node is attempting to " 15096714d8e8SKurt Hackel // "master lockres\n"); 15106714d8e8SKurt Hackel response = DLM_MASTER_RESP_MAYBE; 15116714d8e8SKurt Hackel } 15126714d8e8SKurt Hackel if (set_maybe) 15136714d8e8SKurt Hackel set_bit(request->node_idx, tmpmle->maybe_map); 15146714d8e8SKurt Hackel spin_unlock(&tmpmle->spinlock); 15156714d8e8SKurt Hackel 15166714d8e8SKurt Hackel spin_unlock(&dlm->master_lock); 15176714d8e8SKurt Hackel spin_unlock(&res->spinlock); 15186714d8e8SKurt Hackel 15196714d8e8SKurt Hackel /* keep the mle attached to heartbeat events */ 15206714d8e8SKurt Hackel dlm_put_mle(tmpmle); 15216714d8e8SKurt Hackel if (mle) 15226714d8e8SKurt Hackel kmem_cache_free(dlm_mle_cache, mle); 15236714d8e8SKurt Hackel goto send_response; 15246714d8e8SKurt Hackel } 15256714d8e8SKurt Hackel 15266714d8e8SKurt Hackel /* 15276714d8e8SKurt Hackel * lockres doesn't exist on this node 15286714d8e8SKurt Hackel * if there is an MLE_BLOCK, return NO 15296714d8e8SKurt Hackel * if there is an MLE_MASTER, return MAYBE 15306714d8e8SKurt Hackel * otherwise, add an MLE_BLOCK, return NO 15316714d8e8SKurt Hackel */ 15326714d8e8SKurt Hackel spin_lock(&dlm->master_lock); 15336714d8e8SKurt Hackel found = dlm_find_mle(dlm, &tmpmle, name, namelen); 15346714d8e8SKurt Hackel if (!found) { 15356714d8e8SKurt Hackel /* this lockid has never been seen on this node yet */ 15366714d8e8SKurt Hackel // mlog(0, "no mle found\n"); 15376714d8e8SKurt Hackel if (!mle) { 15386714d8e8SKurt Hackel spin_unlock(&dlm->master_lock); 15396714d8e8SKurt Hackel spin_unlock(&dlm->spinlock); 15406714d8e8SKurt Hackel 15413914ed0cSJulia Lawall mle = kmem_cache_alloc(dlm_mle_cache, GFP_NOFS); 15426714d8e8SKurt Hackel if (!mle) { 15436714d8e8SKurt Hackel response = DLM_MASTER_RESP_ERROR; 15449c6510a5SKurt Hackel mlog_errno(-ENOMEM); 15456714d8e8SKurt Hackel goto send_response; 15466714d8e8SKurt Hackel } 15476714d8e8SKurt Hackel goto way_up_top; 15486714d8e8SKurt Hackel } 15496714d8e8SKurt Hackel 15506714d8e8SKurt Hackel // mlog(0, "this is second time thru, already allocated, " 15516714d8e8SKurt Hackel // "add the block.\n"); 155241b8c8a1SKurt Hackel dlm_init_mle(mle, DLM_MLE_BLOCK, dlm, NULL, name, namelen); 15536714d8e8SKurt Hackel set_bit(request->node_idx, mle->maybe_map); 15541c084577SSunil Mushran __dlm_insert_mle(dlm, mle); 15556714d8e8SKurt Hackel response = DLM_MASTER_RESP_NO; 15566714d8e8SKurt Hackel } else { 15576714d8e8SKurt Hackel // mlog(0, "mle was found\n"); 15586714d8e8SKurt Hackel set_maybe = 1; 15596714d8e8SKurt Hackel spin_lock(&tmpmle->spinlock); 15609c6510a5SKurt Hackel if (tmpmle->master == dlm->node_num) { 15619c6510a5SKurt Hackel mlog(ML_ERROR, "no lockres, but an mle with this node as master!\n"); 15629c6510a5SKurt Hackel BUG(); 15639c6510a5SKurt Hackel } 15646714d8e8SKurt Hackel if (tmpmle->type == DLM_MLE_BLOCK) 15656714d8e8SKurt Hackel response = DLM_MASTER_RESP_NO; 15666714d8e8SKurt Hackel else if (tmpmle->type == DLM_MLE_MIGRATION) { 15676714d8e8SKurt Hackel mlog(0, "migration mle was found (%u->%u)\n", 15686714d8e8SKurt Hackel tmpmle->master, tmpmle->new_master); 15696714d8e8SKurt Hackel /* real master can respond on its own */ 15706714d8e8SKurt Hackel response = DLM_MASTER_RESP_NO; 15716714d8e8SKurt Hackel } else 15726714d8e8SKurt Hackel response = DLM_MASTER_RESP_MAYBE; 15736714d8e8SKurt Hackel if (set_maybe) 15746714d8e8SKurt Hackel set_bit(request->node_idx, tmpmle->maybe_map); 15756714d8e8SKurt Hackel spin_unlock(&tmpmle->spinlock); 15766714d8e8SKurt Hackel } 15776714d8e8SKurt Hackel spin_unlock(&dlm->master_lock); 15786714d8e8SKurt Hackel spin_unlock(&dlm->spinlock); 15796714d8e8SKurt Hackel 15806714d8e8SKurt Hackel if (found) { 15816714d8e8SKurt Hackel /* keep the mle attached to heartbeat events */ 15826714d8e8SKurt Hackel dlm_put_mle(tmpmle); 15836714d8e8SKurt Hackel } 15846714d8e8SKurt Hackel send_response: 1585b31cfc02SSunil Mushran /* 1586b31cfc02SSunil Mushran * __dlm_lookup_lockres() grabbed a reference to this lockres. 1587b31cfc02SSunil Mushran * The reference is released by dlm_assert_master_worker() under 1588b31cfc02SSunil Mushran * the call to dlm_dispatch_assert_master(). If 1589b31cfc02SSunil Mushran * dlm_assert_master_worker() isn't called, we drop it here. 1590b31cfc02SSunil Mushran */ 15919c6510a5SKurt Hackel if (dispatch_assert) { 15929c6510a5SKurt Hackel if (response != DLM_MASTER_RESP_YES) 15939c6510a5SKurt Hackel mlog(ML_ERROR, "invalid response %d\n", response); 15949c6510a5SKurt Hackel if (!res) { 15959c6510a5SKurt Hackel mlog(ML_ERROR, "bad lockres while trying to assert!\n"); 15969c6510a5SKurt Hackel BUG(); 15979c6510a5SKurt Hackel } 15989c6510a5SKurt Hackel mlog(0, "%u is the owner of %.*s, cleaning everyone else\n", 15999c6510a5SKurt Hackel dlm->node_num, res->lockname.len, res->lockname.name); 16009c6510a5SKurt Hackel ret = dlm_dispatch_assert_master(dlm, res, 0, request->node_idx, 16019c6510a5SKurt Hackel DLM_ASSERT_MASTER_MLE_CLEANUP); 16029c6510a5SKurt Hackel if (ret < 0) { 16039c6510a5SKurt Hackel mlog(ML_ERROR, "failed to dispatch assert master work\n"); 16049c6510a5SKurt Hackel response = DLM_MASTER_RESP_ERROR; 1605b31cfc02SSunil Mushran dlm_lockres_put(res); 16069c6510a5SKurt Hackel } 1607b31cfc02SSunil Mushran } else { 1608b31cfc02SSunil Mushran if (res) 1609b31cfc02SSunil Mushran dlm_lockres_put(res); 16109c6510a5SKurt Hackel } 16119c6510a5SKurt Hackel 16126714d8e8SKurt Hackel dlm_put(dlm); 16136714d8e8SKurt Hackel return response; 16146714d8e8SKurt Hackel } 16156714d8e8SKurt Hackel 16166714d8e8SKurt Hackel /* 16176714d8e8SKurt Hackel * DLM_ASSERT_MASTER_MSG 16186714d8e8SKurt Hackel */ 16196714d8e8SKurt Hackel 16206714d8e8SKurt Hackel 16216714d8e8SKurt Hackel /* 16226714d8e8SKurt Hackel * NOTE: this can be used for debugging 16236714d8e8SKurt Hackel * can periodically run all locks owned by this node 16246714d8e8SKurt Hackel * and re-assert across the cluster... 16256714d8e8SKurt Hackel */ 162605488bbeSAdrian Bunk static int dlm_do_assert_master(struct dlm_ctxt *dlm, 1627ba2bf218SKurt Hackel struct dlm_lock_resource *res, 1628ba2bf218SKurt Hackel void *nodemap, u32 flags) 16296714d8e8SKurt Hackel { 16306714d8e8SKurt Hackel struct dlm_assert_master assert; 16316714d8e8SKurt Hackel int to, tmpret; 16326714d8e8SKurt Hackel struct dlm_node_iter iter; 16336714d8e8SKurt Hackel int ret = 0; 16349c6510a5SKurt Hackel int reassert; 1635ba2bf218SKurt Hackel const char *lockname = res->lockname.name; 1636ba2bf218SKurt Hackel unsigned int namelen = res->lockname.len; 16376714d8e8SKurt Hackel 16386714d8e8SKurt Hackel BUG_ON(namelen > O2NM_MAX_NAME_LEN); 1639f3f85464SSunil Mushran 1640f3f85464SSunil Mushran spin_lock(&res->spinlock); 1641f3f85464SSunil Mushran res->state |= DLM_LOCK_RES_SETREF_INPROG; 1642f3f85464SSunil Mushran spin_unlock(&res->spinlock); 1643f3f85464SSunil Mushran 16449c6510a5SKurt Hackel again: 16459c6510a5SKurt Hackel reassert = 0; 16466714d8e8SKurt Hackel 16476714d8e8SKurt Hackel /* note that if this nodemap is empty, it returns 0 */ 16486714d8e8SKurt Hackel dlm_node_iter_init(nodemap, &iter); 16496714d8e8SKurt Hackel while ((to = dlm_node_iter_next(&iter)) >= 0) { 16506714d8e8SKurt Hackel int r = 0; 1651a9ee4c8aSKurt Hackel struct dlm_master_list_entry *mle = NULL; 1652a9ee4c8aSKurt Hackel 16536714d8e8SKurt Hackel mlog(0, "sending assert master to %d (%.*s)\n", to, 16546714d8e8SKurt Hackel namelen, lockname); 16556714d8e8SKurt Hackel memset(&assert, 0, sizeof(assert)); 16566714d8e8SKurt Hackel assert.node_idx = dlm->node_num; 16576714d8e8SKurt Hackel assert.namelen = namelen; 16586714d8e8SKurt Hackel memcpy(assert.name, lockname, namelen); 16596714d8e8SKurt Hackel assert.flags = cpu_to_be32(flags); 16606714d8e8SKurt Hackel 16616714d8e8SKurt Hackel tmpret = o2net_send_message(DLM_ASSERT_MASTER_MSG, dlm->key, 16626714d8e8SKurt Hackel &assert, sizeof(assert), to, &r); 16636714d8e8SKurt Hackel if (tmpret < 0) { 1664a5196ec5SWengang Wang mlog(ML_ERROR, "Error %d when sending message %u (key " 1665a5196ec5SWengang Wang "0x%x) to node %u\n", tmpret, 1666a5196ec5SWengang Wang DLM_ASSERT_MASTER_MSG, dlm->key, to); 16676714d8e8SKurt Hackel if (!dlm_is_host_down(tmpret)) { 16683b3b84a8SKurt Hackel mlog(ML_ERROR, "unhandled error=%d!\n", tmpret); 16696714d8e8SKurt Hackel BUG(); 16706714d8e8SKurt Hackel } 16716714d8e8SKurt Hackel /* a node died. finish out the rest of the nodes. */ 16723b3b84a8SKurt Hackel mlog(0, "link to %d went down!\n", to); 16736714d8e8SKurt Hackel /* any nonzero status return will do */ 16746714d8e8SKurt Hackel ret = tmpret; 1675ba2bf218SKurt Hackel r = 0; 16766714d8e8SKurt Hackel } else if (r < 0) { 16776714d8e8SKurt Hackel /* ok, something horribly messed. kill thyself. */ 16786714d8e8SKurt Hackel mlog(ML_ERROR,"during assert master of %.*s to %u, " 16796714d8e8SKurt Hackel "got %d.\n", namelen, lockname, to, r); 1680a9ee4c8aSKurt Hackel spin_lock(&dlm->spinlock); 1681a9ee4c8aSKurt Hackel spin_lock(&dlm->master_lock); 1682a9ee4c8aSKurt Hackel if (dlm_find_mle(dlm, &mle, (char *)lockname, 1683a9ee4c8aSKurt Hackel namelen)) { 1684a9ee4c8aSKurt Hackel dlm_print_one_mle(mle); 1685a9ee4c8aSKurt Hackel __dlm_put_mle(mle); 1686a9ee4c8aSKurt Hackel } 1687a9ee4c8aSKurt Hackel spin_unlock(&dlm->master_lock); 1688a9ee4c8aSKurt Hackel spin_unlock(&dlm->spinlock); 16896714d8e8SKurt Hackel BUG(); 1690ba2bf218SKurt Hackel } 1691ba2bf218SKurt Hackel 1692ba2bf218SKurt Hackel if (r & DLM_ASSERT_RESPONSE_REASSERT && 1693ba2bf218SKurt Hackel !(r & DLM_ASSERT_RESPONSE_MASTERY_REF)) { 1694ba2bf218SKurt Hackel mlog(ML_ERROR, "%.*s: very strange, " 1695ba2bf218SKurt Hackel "master MLE but no lockres on %u\n", 1696ba2bf218SKurt Hackel namelen, lockname, to); 1697ba2bf218SKurt Hackel } 1698ba2bf218SKurt Hackel 1699ba2bf218SKurt Hackel if (r & DLM_ASSERT_RESPONSE_REASSERT) { 17009c6510a5SKurt Hackel mlog(0, "%.*s: node %u create mles on other " 17019c6510a5SKurt Hackel "nodes and requests a re-assert\n", 17029c6510a5SKurt Hackel namelen, lockname, to); 17039c6510a5SKurt Hackel reassert = 1; 17046714d8e8SKurt Hackel } 1705ba2bf218SKurt Hackel if (r & DLM_ASSERT_RESPONSE_MASTERY_REF) { 1706ba2bf218SKurt Hackel mlog(0, "%.*s: node %u has a reference to this " 1707ba2bf218SKurt Hackel "lockres, set the bit in the refmap\n", 1708ba2bf218SKurt Hackel namelen, lockname, to); 1709ba2bf218SKurt Hackel spin_lock(&res->spinlock); 17108d400b81SSunil Mushran dlm_lockres_set_refmap_bit(dlm, res, to); 1711ba2bf218SKurt Hackel spin_unlock(&res->spinlock); 1712ba2bf218SKurt Hackel } 17136714d8e8SKurt Hackel } 17146714d8e8SKurt Hackel 17159c6510a5SKurt Hackel if (reassert) 17169c6510a5SKurt Hackel goto again; 17179c6510a5SKurt Hackel 1718f3f85464SSunil Mushran spin_lock(&res->spinlock); 1719f3f85464SSunil Mushran res->state &= ~DLM_LOCK_RES_SETREF_INPROG; 1720f3f85464SSunil Mushran spin_unlock(&res->spinlock); 1721f3f85464SSunil Mushran wake_up(&res->wq); 1722f3f85464SSunil Mushran 17236714d8e8SKurt Hackel return ret; 17246714d8e8SKurt Hackel } 17256714d8e8SKurt Hackel 17266714d8e8SKurt Hackel /* 17276714d8e8SKurt Hackel * locks that can be taken here: 17286714d8e8SKurt Hackel * dlm->spinlock 17296714d8e8SKurt Hackel * res->spinlock 17306714d8e8SKurt Hackel * mle->spinlock 17316714d8e8SKurt Hackel * dlm->master_list 17326714d8e8SKurt Hackel * 17336714d8e8SKurt Hackel * if possible, TRIM THIS DOWN!!! 17346714d8e8SKurt Hackel */ 1735d74c9803SKurt Hackel int dlm_assert_master_handler(struct o2net_msg *msg, u32 len, void *data, 1736d74c9803SKurt Hackel void **ret_data) 17376714d8e8SKurt Hackel { 17386714d8e8SKurt Hackel struct dlm_ctxt *dlm = data; 17396714d8e8SKurt Hackel struct dlm_master_list_entry *mle = NULL; 17406714d8e8SKurt Hackel struct dlm_assert_master *assert = (struct dlm_assert_master *)msg->buf; 17416714d8e8SKurt Hackel struct dlm_lock_resource *res = NULL; 17426714d8e8SKurt Hackel char *name; 1743a3d33291SMark Fasheh unsigned int namelen, hash; 17446714d8e8SKurt Hackel u32 flags; 1745ba2bf218SKurt Hackel int master_request = 0, have_lockres_ref = 0; 17469c6510a5SKurt Hackel int ret = 0; 17476714d8e8SKurt Hackel 17486714d8e8SKurt Hackel if (!dlm_grab(dlm)) 17496714d8e8SKurt Hackel return 0; 17506714d8e8SKurt Hackel 17516714d8e8SKurt Hackel name = assert->name; 17526714d8e8SKurt Hackel namelen = assert->namelen; 1753a3d33291SMark Fasheh hash = dlm_lockid_hash(name, namelen); 17546714d8e8SKurt Hackel flags = be32_to_cpu(assert->flags); 17556714d8e8SKurt Hackel 17566714d8e8SKurt Hackel if (namelen > DLM_LOCKID_NAME_MAX) { 17576714d8e8SKurt Hackel mlog(ML_ERROR, "Invalid name length!"); 17586714d8e8SKurt Hackel goto done; 17596714d8e8SKurt Hackel } 17606714d8e8SKurt Hackel 17616714d8e8SKurt Hackel spin_lock(&dlm->spinlock); 17626714d8e8SKurt Hackel 17636714d8e8SKurt Hackel if (flags) 17646714d8e8SKurt Hackel mlog(0, "assert_master with flags: %u\n", flags); 17656714d8e8SKurt Hackel 17666714d8e8SKurt Hackel /* find the MLE */ 17676714d8e8SKurt Hackel spin_lock(&dlm->master_lock); 17686714d8e8SKurt Hackel if (!dlm_find_mle(dlm, &mle, name, namelen)) { 17696714d8e8SKurt Hackel /* not an error, could be master just re-asserting */ 17706714d8e8SKurt Hackel mlog(0, "just got an assert_master from %u, but no " 17716714d8e8SKurt Hackel "MLE for it! (%.*s)\n", assert->node_idx, 17726714d8e8SKurt Hackel namelen, name); 17736714d8e8SKurt Hackel } else { 17746714d8e8SKurt Hackel int bit = find_next_bit (mle->maybe_map, O2NM_MAX_NODES, 0); 17756714d8e8SKurt Hackel if (bit >= O2NM_MAX_NODES) { 17766714d8e8SKurt Hackel /* not necessarily an error, though less likely. 17776714d8e8SKurt Hackel * could be master just re-asserting. */ 1778aa852354SKurt Hackel mlog(0, "no bits set in the maybe_map, but %u " 17796714d8e8SKurt Hackel "is asserting! (%.*s)\n", assert->node_idx, 17806714d8e8SKurt Hackel namelen, name); 17816714d8e8SKurt Hackel } else if (bit != assert->node_idx) { 17826714d8e8SKurt Hackel if (flags & DLM_ASSERT_MASTER_MLE_CLEANUP) { 17836714d8e8SKurt Hackel mlog(0, "master %u was found, %u should " 17846714d8e8SKurt Hackel "back off\n", assert->node_idx, bit); 17856714d8e8SKurt Hackel } else { 17866714d8e8SKurt Hackel /* with the fix for bug 569, a higher node 17876714d8e8SKurt Hackel * number winning the mastery will respond 17886714d8e8SKurt Hackel * YES to mastery requests, but this node 17896714d8e8SKurt Hackel * had no way of knowing. let it pass. */ 1790aa852354SKurt Hackel mlog(0, "%u is the lowest node, " 17916714d8e8SKurt Hackel "%u is asserting. (%.*s) %u must " 17926714d8e8SKurt Hackel "have begun after %u won.\n", bit, 17936714d8e8SKurt Hackel assert->node_idx, namelen, name, bit, 17946714d8e8SKurt Hackel assert->node_idx); 17956714d8e8SKurt Hackel } 17966714d8e8SKurt Hackel } 17972d1a868cSKurt Hackel if (mle->type == DLM_MLE_MIGRATION) { 17982d1a868cSKurt Hackel if (flags & DLM_ASSERT_MASTER_MLE_CLEANUP) { 17992d1a868cSKurt Hackel mlog(0, "%s:%.*s: got cleanup assert" 18002d1a868cSKurt Hackel " from %u for migration\n", 18012d1a868cSKurt Hackel dlm->name, namelen, name, 18022d1a868cSKurt Hackel assert->node_idx); 18032d1a868cSKurt Hackel } else if (!(flags & DLM_ASSERT_MASTER_FINISH_MIGRATION)) { 18042d1a868cSKurt Hackel mlog(0, "%s:%.*s: got unrelated assert" 18052d1a868cSKurt Hackel " from %u for migration, ignoring\n", 18062d1a868cSKurt Hackel dlm->name, namelen, name, 18072d1a868cSKurt Hackel assert->node_idx); 18082d1a868cSKurt Hackel __dlm_put_mle(mle); 18092d1a868cSKurt Hackel spin_unlock(&dlm->master_lock); 18102d1a868cSKurt Hackel spin_unlock(&dlm->spinlock); 18112d1a868cSKurt Hackel goto done; 18122d1a868cSKurt Hackel } 18132d1a868cSKurt Hackel } 18146714d8e8SKurt Hackel } 18156714d8e8SKurt Hackel spin_unlock(&dlm->master_lock); 18166714d8e8SKurt Hackel 18176714d8e8SKurt Hackel /* ok everything checks out with the MLE 18186714d8e8SKurt Hackel * now check to see if there is a lockres */ 1819a3d33291SMark Fasheh res = __dlm_lookup_lockres(dlm, name, namelen, hash); 18206714d8e8SKurt Hackel if (res) { 18216714d8e8SKurt Hackel spin_lock(&res->spinlock); 18226714d8e8SKurt Hackel if (res->state & DLM_LOCK_RES_RECOVERING) { 18236714d8e8SKurt Hackel mlog(ML_ERROR, "%u asserting but %.*s is " 18246714d8e8SKurt Hackel "RECOVERING!\n", assert->node_idx, namelen, name); 18256714d8e8SKurt Hackel goto kill; 18266714d8e8SKurt Hackel } 18276714d8e8SKurt Hackel if (!mle) { 1828dc2ed195SKurt Hackel if (res->owner != DLM_LOCK_RES_OWNER_UNKNOWN && 1829dc2ed195SKurt Hackel res->owner != assert->node_idx) { 183053ecd25eSSunil Mushran mlog(ML_ERROR, "DIE! Mastery assert from %u, " 183153ecd25eSSunil Mushran "but current owner is %u! (%.*s)\n", 183253ecd25eSSunil Mushran assert->node_idx, res->owner, namelen, 183353ecd25eSSunil Mushran name); 183453ecd25eSSunil Mushran __dlm_print_one_lock_resource(res); 183553ecd25eSSunil Mushran BUG(); 18366714d8e8SKurt Hackel } 18376714d8e8SKurt Hackel } else if (mle->type != DLM_MLE_MIGRATION) { 18386714d8e8SKurt Hackel if (res->owner != DLM_LOCK_RES_OWNER_UNKNOWN) { 18396714d8e8SKurt Hackel /* owner is just re-asserting */ 18406714d8e8SKurt Hackel if (res->owner == assert->node_idx) { 18416714d8e8SKurt Hackel mlog(0, "owner %u re-asserting on " 18426714d8e8SKurt Hackel "lock %.*s\n", assert->node_idx, 18436714d8e8SKurt Hackel namelen, name); 18446714d8e8SKurt Hackel goto ok; 18456714d8e8SKurt Hackel } 18466714d8e8SKurt Hackel mlog(ML_ERROR, "got assert_master from " 18476714d8e8SKurt Hackel "node %u, but %u is the owner! " 18486714d8e8SKurt Hackel "(%.*s)\n", assert->node_idx, 18496714d8e8SKurt Hackel res->owner, namelen, name); 18506714d8e8SKurt Hackel goto kill; 18516714d8e8SKurt Hackel } 18526714d8e8SKurt Hackel if (!(res->state & DLM_LOCK_RES_IN_PROGRESS)) { 18536714d8e8SKurt Hackel mlog(ML_ERROR, "got assert from %u, but lock " 18546714d8e8SKurt Hackel "with no owner should be " 18556714d8e8SKurt Hackel "in-progress! (%.*s)\n", 18566714d8e8SKurt Hackel assert->node_idx, 18576714d8e8SKurt Hackel namelen, name); 18586714d8e8SKurt Hackel goto kill; 18596714d8e8SKurt Hackel } 18606714d8e8SKurt Hackel } else /* mle->type == DLM_MLE_MIGRATION */ { 18616714d8e8SKurt Hackel /* should only be getting an assert from new master */ 18626714d8e8SKurt Hackel if (assert->node_idx != mle->new_master) { 18636714d8e8SKurt Hackel mlog(ML_ERROR, "got assert from %u, but " 18646714d8e8SKurt Hackel "new master is %u, and old master " 18656714d8e8SKurt Hackel "was %u (%.*s)\n", 18666714d8e8SKurt Hackel assert->node_idx, mle->new_master, 18676714d8e8SKurt Hackel mle->master, namelen, name); 18686714d8e8SKurt Hackel goto kill; 18696714d8e8SKurt Hackel } 18706714d8e8SKurt Hackel 18716714d8e8SKurt Hackel } 18726714d8e8SKurt Hackel ok: 18736714d8e8SKurt Hackel spin_unlock(&res->spinlock); 18746714d8e8SKurt Hackel } 18756714d8e8SKurt Hackel 18766714d8e8SKurt Hackel // mlog(0, "woo! got an assert_master from node %u!\n", 18776714d8e8SKurt Hackel // assert->node_idx); 18786714d8e8SKurt Hackel if (mle) { 18799c6510a5SKurt Hackel int extra_ref = 0; 18809c6510a5SKurt Hackel int nn = -1; 1881a2bf0477SKurt Hackel int rr, err = 0; 18826714d8e8SKurt Hackel 18836714d8e8SKurt Hackel spin_lock(&mle->spinlock); 18849c6510a5SKurt Hackel if (mle->type == DLM_MLE_BLOCK || mle->type == DLM_MLE_MIGRATION) 18859c6510a5SKurt Hackel extra_ref = 1; 18869c6510a5SKurt Hackel else { 18879c6510a5SKurt Hackel /* MASTER mle: if any bits set in the response map 18889c6510a5SKurt Hackel * then the calling node needs to re-assert to clear 18899c6510a5SKurt Hackel * up nodes that this node contacted */ 18909c6510a5SKurt Hackel while ((nn = find_next_bit (mle->response_map, O2NM_MAX_NODES, 18919c6510a5SKurt Hackel nn+1)) < O2NM_MAX_NODES) { 1892728b9805SJunxiao Bi if (nn != dlm->node_num && nn != assert->node_idx) { 18939c6510a5SKurt Hackel master_request = 1; 1894728b9805SJunxiao Bi break; 1895728b9805SJunxiao Bi } 18969c6510a5SKurt Hackel } 18979c6510a5SKurt Hackel } 18986714d8e8SKurt Hackel mle->master = assert->node_idx; 18996714d8e8SKurt Hackel atomic_set(&mle->woken, 1); 19006714d8e8SKurt Hackel wake_up(&mle->wq); 19016714d8e8SKurt Hackel spin_unlock(&mle->spinlock); 19026714d8e8SKurt Hackel 1903a2bf0477SKurt Hackel if (res) { 1904a6fa3640SKurt Hackel int wake = 0; 1905a2bf0477SKurt Hackel spin_lock(&res->spinlock); 1906a2bf0477SKurt Hackel if (mle->type == DLM_MLE_MIGRATION) { 19076714d8e8SKurt Hackel mlog(0, "finishing off migration of lockres %.*s, " 19086714d8e8SKurt Hackel "from %u to %u\n", 19096714d8e8SKurt Hackel res->lockname.len, res->lockname.name, 19106714d8e8SKurt Hackel dlm->node_num, mle->new_master); 19116714d8e8SKurt Hackel res->state &= ~DLM_LOCK_RES_MIGRATING; 1912a6fa3640SKurt Hackel wake = 1; 19136714d8e8SKurt Hackel dlm_change_lockres_owner(dlm, res, mle->new_master); 19146714d8e8SKurt Hackel BUG_ON(res->state & DLM_LOCK_RES_DIRTY); 1915a2bf0477SKurt Hackel } else { 1916a2bf0477SKurt Hackel dlm_change_lockres_owner(dlm, res, mle->master); 1917a2bf0477SKurt Hackel } 19186714d8e8SKurt Hackel spin_unlock(&res->spinlock); 1919ba2bf218SKurt Hackel have_lockres_ref = 1; 1920a6fa3640SKurt Hackel if (wake) 1921a6fa3640SKurt Hackel wake_up(&res->wq); 19226714d8e8SKurt Hackel } 19236714d8e8SKurt Hackel 1924a2bf0477SKurt Hackel /* master is known, detach if not already detached. 1925a2bf0477SKurt Hackel * ensures that only one assert_master call will happen 1926a2bf0477SKurt Hackel * on this mle. */ 1927a2bf0477SKurt Hackel spin_lock(&dlm->master_lock); 1928a2bf0477SKurt Hackel 1929a2bf0477SKurt Hackel rr = atomic_read(&mle->mle_refs.refcount); 1930a2bf0477SKurt Hackel if (mle->inuse > 0) { 1931a2bf0477SKurt Hackel if (extra_ref && rr < 3) 1932a2bf0477SKurt Hackel err = 1; 1933a2bf0477SKurt Hackel else if (!extra_ref && rr < 2) 1934a2bf0477SKurt Hackel err = 1; 1935a2bf0477SKurt Hackel } else { 1936a2bf0477SKurt Hackel if (extra_ref && rr < 2) 1937a2bf0477SKurt Hackel err = 1; 1938a2bf0477SKurt Hackel else if (!extra_ref && rr < 1) 1939a2bf0477SKurt Hackel err = 1; 1940a2bf0477SKurt Hackel } 1941a2bf0477SKurt Hackel if (err) { 1942a2bf0477SKurt Hackel mlog(ML_ERROR, "%s:%.*s: got assert master from %u " 1943a2bf0477SKurt Hackel "that will mess up this node, refs=%d, extra=%d, " 1944a2bf0477SKurt Hackel "inuse=%d\n", dlm->name, namelen, name, 1945a2bf0477SKurt Hackel assert->node_idx, rr, extra_ref, mle->inuse); 1946a2bf0477SKurt Hackel dlm_print_one_mle(mle); 1947a2bf0477SKurt Hackel } 19481c084577SSunil Mushran __dlm_unlink_mle(dlm, mle); 1949a2bf0477SKurt Hackel __dlm_mle_detach_hb_events(dlm, mle); 1950a2bf0477SKurt Hackel __dlm_put_mle(mle); 19516714d8e8SKurt Hackel if (extra_ref) { 19526714d8e8SKurt Hackel /* the assert master message now balances the extra 19536714d8e8SKurt Hackel * ref given by the master / migration request message. 19546714d8e8SKurt Hackel * if this is the last put, it will be removed 19556714d8e8SKurt Hackel * from the list. */ 1956a2bf0477SKurt Hackel __dlm_put_mle(mle); 1957a2bf0477SKurt Hackel } 1958a2bf0477SKurt Hackel spin_unlock(&dlm->master_lock); 1959a2bf0477SKurt Hackel } else if (res) { 1960a2bf0477SKurt Hackel if (res->owner != assert->node_idx) { 1961a2bf0477SKurt Hackel mlog(0, "assert_master from %u, but current " 1962a2bf0477SKurt Hackel "owner is %u (%.*s), no mle\n", assert->node_idx, 1963a2bf0477SKurt Hackel res->owner, namelen, name); 19646714d8e8SKurt Hackel } 19656714d8e8SKurt Hackel } 196614741472SSrinivas Eeda spin_unlock(&dlm->spinlock); 19676714d8e8SKurt Hackel 19686714d8e8SKurt Hackel done: 19699c6510a5SKurt Hackel ret = 0; 19703b8118cfSKurt Hackel if (res) { 19713b8118cfSKurt Hackel spin_lock(&res->spinlock); 19723b8118cfSKurt Hackel res->state |= DLM_LOCK_RES_SETREF_INPROG; 19733b8118cfSKurt Hackel spin_unlock(&res->spinlock); 19743b8118cfSKurt Hackel *ret_data = (void *)res; 19753b8118cfSKurt Hackel } 19766714d8e8SKurt Hackel dlm_put(dlm); 19779c6510a5SKurt Hackel if (master_request) { 19789c6510a5SKurt Hackel mlog(0, "need to tell master to reassert\n"); 1979ba2bf218SKurt Hackel /* positive. negative would shoot down the node. */ 1980ba2bf218SKurt Hackel ret |= DLM_ASSERT_RESPONSE_REASSERT; 1981ba2bf218SKurt Hackel if (!have_lockres_ref) { 1982ba2bf218SKurt Hackel mlog(ML_ERROR, "strange, got assert from %u, MASTER " 1983ba2bf218SKurt Hackel "mle present here for %s:%.*s, but no lockres!\n", 1984ba2bf218SKurt Hackel assert->node_idx, dlm->name, namelen, name); 1985ba2bf218SKurt Hackel } 1986ba2bf218SKurt Hackel } 1987ba2bf218SKurt Hackel if (have_lockres_ref) { 1988ba2bf218SKurt Hackel /* let the master know we have a reference to the lockres */ 1989ba2bf218SKurt Hackel ret |= DLM_ASSERT_RESPONSE_MASTERY_REF; 1990ba2bf218SKurt Hackel mlog(0, "%s:%.*s: got assert from %u, need a ref\n", 1991ba2bf218SKurt Hackel dlm->name, namelen, name, assert->node_idx); 19929c6510a5SKurt Hackel } 19939c6510a5SKurt Hackel return ret; 19946714d8e8SKurt Hackel 19956714d8e8SKurt Hackel kill: 19966714d8e8SKurt Hackel /* kill the caller! */ 1997a9ee4c8aSKurt Hackel mlog(ML_ERROR, "Bad message received from another node. Dumping state " 1998a9ee4c8aSKurt Hackel "and killing the other node now! This node is OK and can continue.\n"); 1999a9ee4c8aSKurt Hackel __dlm_print_one_lock_resource(res); 20006714d8e8SKurt Hackel spin_unlock(&res->spinlock); 20016714d8e8SKurt Hackel spin_unlock(&dlm->spinlock); 20023b8118cfSKurt Hackel *ret_data = (void *)res; 20036714d8e8SKurt Hackel dlm_put(dlm); 20046714d8e8SKurt Hackel return -EINVAL; 20056714d8e8SKurt Hackel } 20066714d8e8SKurt Hackel 20073b8118cfSKurt Hackel void dlm_assert_master_post_handler(int status, void *data, void *ret_data) 20083b8118cfSKurt Hackel { 20093b8118cfSKurt Hackel struct dlm_lock_resource *res = (struct dlm_lock_resource *)ret_data; 20103b8118cfSKurt Hackel 20113b8118cfSKurt Hackel if (ret_data) { 20123b8118cfSKurt Hackel spin_lock(&res->spinlock); 20133b8118cfSKurt Hackel res->state &= ~DLM_LOCK_RES_SETREF_INPROG; 20143b8118cfSKurt Hackel spin_unlock(&res->spinlock); 20153b8118cfSKurt Hackel wake_up(&res->wq); 20163b8118cfSKurt Hackel dlm_lockres_put(res); 20173b8118cfSKurt Hackel } 20183b8118cfSKurt Hackel return; 20193b8118cfSKurt Hackel } 20203b8118cfSKurt Hackel 20216714d8e8SKurt Hackel int dlm_dispatch_assert_master(struct dlm_ctxt *dlm, 20226714d8e8SKurt Hackel struct dlm_lock_resource *res, 20236714d8e8SKurt Hackel int ignore_higher, u8 request_from, u32 flags) 20246714d8e8SKurt Hackel { 20256714d8e8SKurt Hackel struct dlm_work_item *item; 2026b24ae0b5SDan Carpenter item = kzalloc(sizeof(*item), GFP_ATOMIC); 20276714d8e8SKurt Hackel if (!item) 20286714d8e8SKurt Hackel return -ENOMEM; 20296714d8e8SKurt Hackel 20306714d8e8SKurt Hackel 20316714d8e8SKurt Hackel /* queue up work for dlm_assert_master_worker */ 20326714d8e8SKurt Hackel dlm_grab(dlm); /* get an extra ref for the work item */ 20336714d8e8SKurt Hackel dlm_init_work_item(dlm, item, dlm_assert_master_worker, NULL); 20346714d8e8SKurt Hackel item->u.am.lockres = res; /* already have a ref */ 20356714d8e8SKurt Hackel /* can optionally ignore node numbers higher than this node */ 20366714d8e8SKurt Hackel item->u.am.ignore_higher = ignore_higher; 20376714d8e8SKurt Hackel item->u.am.request_from = request_from; 20386714d8e8SKurt Hackel item->u.am.flags = flags; 20396714d8e8SKurt Hackel 20409c6510a5SKurt Hackel if (ignore_higher) 20419c6510a5SKurt Hackel mlog(0, "IGNORE HIGHER: %.*s\n", res->lockname.len, 20429c6510a5SKurt Hackel res->lockname.name); 20439c6510a5SKurt Hackel 20446714d8e8SKurt Hackel spin_lock(&dlm->work_lock); 20456714d8e8SKurt Hackel list_add_tail(&item->list, &dlm->work_list); 20466714d8e8SKurt Hackel spin_unlock(&dlm->work_lock); 20476714d8e8SKurt Hackel 20483156d267SKurt Hackel queue_work(dlm->dlm_worker, &dlm->dispatched_work); 20496714d8e8SKurt Hackel return 0; 20506714d8e8SKurt Hackel } 20516714d8e8SKurt Hackel 20526714d8e8SKurt Hackel static void dlm_assert_master_worker(struct dlm_work_item *item, void *data) 20536714d8e8SKurt Hackel { 20546714d8e8SKurt Hackel struct dlm_ctxt *dlm = data; 20556714d8e8SKurt Hackel int ret = 0; 20566714d8e8SKurt Hackel struct dlm_lock_resource *res; 20576714d8e8SKurt Hackel unsigned long nodemap[BITS_TO_LONGS(O2NM_MAX_NODES)]; 20586714d8e8SKurt Hackel int ignore_higher; 20596714d8e8SKurt Hackel int bit; 20606714d8e8SKurt Hackel u8 request_from; 20616714d8e8SKurt Hackel u32 flags; 20626714d8e8SKurt Hackel 20636714d8e8SKurt Hackel dlm = item->dlm; 20646714d8e8SKurt Hackel res = item->u.am.lockres; 20656714d8e8SKurt Hackel ignore_higher = item->u.am.ignore_higher; 20666714d8e8SKurt Hackel request_from = item->u.am.request_from; 20676714d8e8SKurt Hackel flags = item->u.am.flags; 20686714d8e8SKurt Hackel 20696714d8e8SKurt Hackel spin_lock(&dlm->spinlock); 20706714d8e8SKurt Hackel memcpy(nodemap, dlm->domain_map, sizeof(nodemap)); 20716714d8e8SKurt Hackel spin_unlock(&dlm->spinlock); 20726714d8e8SKurt Hackel 20736714d8e8SKurt Hackel clear_bit(dlm->node_num, nodemap); 20746714d8e8SKurt Hackel if (ignore_higher) { 20756714d8e8SKurt Hackel /* if is this just to clear up mles for nodes below 20766714d8e8SKurt Hackel * this node, do not send the message to the original 20776714d8e8SKurt Hackel * caller or any node number higher than this */ 20786714d8e8SKurt Hackel clear_bit(request_from, nodemap); 20796714d8e8SKurt Hackel bit = dlm->node_num; 20806714d8e8SKurt Hackel while (1) { 20816714d8e8SKurt Hackel bit = find_next_bit(nodemap, O2NM_MAX_NODES, 20826714d8e8SKurt Hackel bit+1); 20836714d8e8SKurt Hackel if (bit >= O2NM_MAX_NODES) 20846714d8e8SKurt Hackel break; 20856714d8e8SKurt Hackel clear_bit(bit, nodemap); 20866714d8e8SKurt Hackel } 20876714d8e8SKurt Hackel } 20886714d8e8SKurt Hackel 208936407488SKurt Hackel /* 209036407488SKurt Hackel * If we're migrating this lock to someone else, we are no 209136407488SKurt Hackel * longer allowed to assert out own mastery. OTOH, we need to 209236407488SKurt Hackel * prevent migration from starting while we're still asserting 209336407488SKurt Hackel * our dominance. The reserved ast delays migration. 209436407488SKurt Hackel */ 209536407488SKurt Hackel spin_lock(&res->spinlock); 209636407488SKurt Hackel if (res->state & DLM_LOCK_RES_MIGRATING) { 209736407488SKurt Hackel mlog(0, "Someone asked us to assert mastery, but we're " 209836407488SKurt Hackel "in the middle of migration. Skipping assert, " 209936407488SKurt Hackel "the new master will handle that.\n"); 210036407488SKurt Hackel spin_unlock(&res->spinlock); 210136407488SKurt Hackel goto put; 210236407488SKurt Hackel } else 210336407488SKurt Hackel __dlm_lockres_reserve_ast(res); 210436407488SKurt Hackel spin_unlock(&res->spinlock); 210536407488SKurt Hackel 21066714d8e8SKurt Hackel /* this call now finishes out the nodemap 21076714d8e8SKurt Hackel * even if one or more nodes die */ 21086714d8e8SKurt Hackel mlog(0, "worker about to master %.*s here, this=%u\n", 21096714d8e8SKurt Hackel res->lockname.len, res->lockname.name, dlm->node_num); 2110ba2bf218SKurt Hackel ret = dlm_do_assert_master(dlm, res, nodemap, flags); 21116714d8e8SKurt Hackel if (ret < 0) { 21126714d8e8SKurt Hackel /* no need to restart, we are done */ 21133b3b84a8SKurt Hackel if (!dlm_is_host_down(ret)) 21146714d8e8SKurt Hackel mlog_errno(ret); 21156714d8e8SKurt Hackel } 21166714d8e8SKurt Hackel 211736407488SKurt Hackel /* Ok, we've asserted ourselves. Let's let migration start. */ 211836407488SKurt Hackel dlm_lockres_release_ast(dlm, res); 211936407488SKurt Hackel 212036407488SKurt Hackel put: 21216714d8e8SKurt Hackel dlm_lockres_put(res); 21226714d8e8SKurt Hackel 21236714d8e8SKurt Hackel mlog(0, "finished with dlm_assert_master_worker\n"); 21246714d8e8SKurt Hackel } 21256714d8e8SKurt Hackel 2126c03872f5SKurt Hackel /* SPECIAL CASE for the $RECOVERY lock used by the recovery thread. 2127c03872f5SKurt Hackel * We cannot wait for node recovery to complete to begin mastering this 2128c03872f5SKurt Hackel * lockres because this lockres is used to kick off recovery! ;-) 2129c03872f5SKurt Hackel * So, do a pre-check on all living nodes to see if any of those nodes 2130c03872f5SKurt Hackel * think that $RECOVERY is currently mastered by a dead node. If so, 2131c03872f5SKurt Hackel * we wait a short time to allow that node to get notified by its own 2132c03872f5SKurt Hackel * heartbeat stack, then check again. All $RECOVERY lock resources 2133c03872f5SKurt Hackel * mastered by dead nodes are purged when the hearbeat callback is 2134c03872f5SKurt Hackel * fired, so we can know for sure that it is safe to continue once 2135c03872f5SKurt Hackel * the node returns a live node or no node. */ 2136c03872f5SKurt Hackel static int dlm_pre_master_reco_lockres(struct dlm_ctxt *dlm, 2137c03872f5SKurt Hackel struct dlm_lock_resource *res) 2138c03872f5SKurt Hackel { 2139c03872f5SKurt Hackel struct dlm_node_iter iter; 2140c03872f5SKurt Hackel int nodenum; 2141c03872f5SKurt Hackel int ret = 0; 2142c03872f5SKurt Hackel u8 master = DLM_LOCK_RES_OWNER_UNKNOWN; 2143c03872f5SKurt Hackel 2144c03872f5SKurt Hackel spin_lock(&dlm->spinlock); 2145c03872f5SKurt Hackel dlm_node_iter_init(dlm->domain_map, &iter); 2146c03872f5SKurt Hackel spin_unlock(&dlm->spinlock); 2147c03872f5SKurt Hackel 2148c03872f5SKurt Hackel while ((nodenum = dlm_node_iter_next(&iter)) >= 0) { 2149c03872f5SKurt Hackel /* do not send to self */ 2150c03872f5SKurt Hackel if (nodenum == dlm->node_num) 2151c03872f5SKurt Hackel continue; 2152c03872f5SKurt Hackel ret = dlm_do_master_requery(dlm, res, nodenum, &master); 2153c03872f5SKurt Hackel if (ret < 0) { 2154c03872f5SKurt Hackel mlog_errno(ret); 2155c03872f5SKurt Hackel if (!dlm_is_host_down(ret)) 2156c03872f5SKurt Hackel BUG(); 2157c03872f5SKurt Hackel /* host is down, so answer for that node would be 2158c03872f5SKurt Hackel * DLM_LOCK_RES_OWNER_UNKNOWN. continue. */ 2159f42a100bSKurt Hackel ret = 0; 2160c03872f5SKurt Hackel } 2161c03872f5SKurt Hackel 2162c03872f5SKurt Hackel if (master != DLM_LOCK_RES_OWNER_UNKNOWN) { 2163c03872f5SKurt Hackel /* check to see if this master is in the recovery map */ 2164c03872f5SKurt Hackel spin_lock(&dlm->spinlock); 2165c03872f5SKurt Hackel if (test_bit(master, dlm->recovery_map)) { 2166c03872f5SKurt Hackel mlog(ML_NOTICE, "%s: node %u has not seen " 2167c03872f5SKurt Hackel "node %u go down yet, and thinks the " 2168c03872f5SKurt Hackel "dead node is mastering the recovery " 2169c03872f5SKurt Hackel "lock. must wait.\n", dlm->name, 2170c03872f5SKurt Hackel nodenum, master); 2171c03872f5SKurt Hackel ret = -EAGAIN; 2172c03872f5SKurt Hackel } 2173c03872f5SKurt Hackel spin_unlock(&dlm->spinlock); 2174c03872f5SKurt Hackel mlog(0, "%s: reco lock master is %u\n", dlm->name, 2175c03872f5SKurt Hackel master); 2176c03872f5SKurt Hackel break; 2177c03872f5SKurt Hackel } 2178c03872f5SKurt Hackel } 2179c03872f5SKurt Hackel return ret; 2180c03872f5SKurt Hackel } 2181c03872f5SKurt Hackel 2182ba2bf218SKurt Hackel /* 2183ba2bf218SKurt Hackel * DLM_DEREF_LOCKRES_MSG 2184ba2bf218SKurt Hackel */ 2185ba2bf218SKurt Hackel 2186ba2bf218SKurt Hackel int dlm_drop_lockres_ref(struct dlm_ctxt *dlm, struct dlm_lock_resource *res) 2187ba2bf218SKurt Hackel { 2188ba2bf218SKurt Hackel struct dlm_deref_lockres deref; 2189ba2bf218SKurt Hackel int ret = 0, r; 2190ba2bf218SKurt Hackel const char *lockname; 2191ba2bf218SKurt Hackel unsigned int namelen; 2192ba2bf218SKurt Hackel 2193ba2bf218SKurt Hackel lockname = res->lockname.name; 2194ba2bf218SKurt Hackel namelen = res->lockname.len; 2195ba2bf218SKurt Hackel BUG_ON(namelen > O2NM_MAX_NAME_LEN); 2196ba2bf218SKurt Hackel 2197ba2bf218SKurt Hackel memset(&deref, 0, sizeof(deref)); 2198ba2bf218SKurt Hackel deref.node_idx = dlm->node_num; 2199ba2bf218SKurt Hackel deref.namelen = namelen; 2200ba2bf218SKurt Hackel memcpy(deref.name, lockname, namelen); 2201ba2bf218SKurt Hackel 2202ba2bf218SKurt Hackel ret = o2net_send_message(DLM_DEREF_LOCKRES_MSG, dlm->key, 2203ba2bf218SKurt Hackel &deref, sizeof(deref), res->owner, &r); 2204ba2bf218SKurt Hackel if (ret < 0) 22058decab3cSSunil Mushran mlog(ML_ERROR, "%s: res %.*s, error %d send DEREF to node %u\n", 22068decab3cSSunil Mushran dlm->name, namelen, lockname, ret, res->owner); 2207ba2bf218SKurt Hackel else if (r < 0) { 2208ba2bf218SKurt Hackel /* BAD. other node says I did not have a ref. */ 22098decab3cSSunil Mushran mlog(ML_ERROR, "%s: res %.*s, DEREF to node %u got %d\n", 22108decab3cSSunil Mushran dlm->name, namelen, lockname, res->owner, r); 2211ba2bf218SKurt Hackel dlm_print_one_lock_resource(res); 2212ba2bf218SKurt Hackel BUG(); 2213ba2bf218SKurt Hackel } 2214ba2bf218SKurt Hackel return ret; 2215ba2bf218SKurt Hackel } 2216ba2bf218SKurt Hackel 2217d74c9803SKurt Hackel int dlm_deref_lockres_handler(struct o2net_msg *msg, u32 len, void *data, 2218d74c9803SKurt Hackel void **ret_data) 2219ba2bf218SKurt Hackel { 2220ba2bf218SKurt Hackel struct dlm_ctxt *dlm = data; 2221ba2bf218SKurt Hackel struct dlm_deref_lockres *deref = (struct dlm_deref_lockres *)msg->buf; 2222ba2bf218SKurt Hackel struct dlm_lock_resource *res = NULL; 2223ba2bf218SKurt Hackel char *name; 2224ba2bf218SKurt Hackel unsigned int namelen; 2225ba2bf218SKurt Hackel int ret = -EINVAL; 2226ba2bf218SKurt Hackel u8 node; 2227ba2bf218SKurt Hackel unsigned int hash; 2228f3f85464SSunil Mushran struct dlm_work_item *item; 2229f3f85464SSunil Mushran int cleared = 0; 2230f3f85464SSunil Mushran int dispatch = 0; 2231ba2bf218SKurt Hackel 2232ba2bf218SKurt Hackel if (!dlm_grab(dlm)) 2233ba2bf218SKurt Hackel return 0; 2234ba2bf218SKurt Hackel 2235ba2bf218SKurt Hackel name = deref->name; 2236ba2bf218SKurt Hackel namelen = deref->namelen; 2237ba2bf218SKurt Hackel node = deref->node_idx; 2238ba2bf218SKurt Hackel 2239ba2bf218SKurt Hackel if (namelen > DLM_LOCKID_NAME_MAX) { 2240ba2bf218SKurt Hackel mlog(ML_ERROR, "Invalid name length!"); 2241ba2bf218SKurt Hackel goto done; 2242ba2bf218SKurt Hackel } 2243ba2bf218SKurt Hackel if (deref->node_idx >= O2NM_MAX_NODES) { 2244ba2bf218SKurt Hackel mlog(ML_ERROR, "Invalid node number: %u\n", node); 2245ba2bf218SKurt Hackel goto done; 2246ba2bf218SKurt Hackel } 2247ba2bf218SKurt Hackel 2248ba2bf218SKurt Hackel hash = dlm_lockid_hash(name, namelen); 2249ba2bf218SKurt Hackel 2250ba2bf218SKurt Hackel spin_lock(&dlm->spinlock); 2251ba2bf218SKurt Hackel res = __dlm_lookup_lockres_full(dlm, name, namelen, hash); 2252ba2bf218SKurt Hackel if (!res) { 2253ba2bf218SKurt Hackel spin_unlock(&dlm->spinlock); 2254ba2bf218SKurt Hackel mlog(ML_ERROR, "%s:%.*s: bad lockres name\n", 2255ba2bf218SKurt Hackel dlm->name, namelen, name); 2256ba2bf218SKurt Hackel goto done; 2257ba2bf218SKurt Hackel } 2258ba2bf218SKurt Hackel spin_unlock(&dlm->spinlock); 2259ba2bf218SKurt Hackel 2260ba2bf218SKurt Hackel spin_lock(&res->spinlock); 2261f3f85464SSunil Mushran if (res->state & DLM_LOCK_RES_SETREF_INPROG) 2262f3f85464SSunil Mushran dispatch = 1; 2263f3f85464SSunil Mushran else { 2264ba2bf218SKurt Hackel BUG_ON(res->state & DLM_LOCK_RES_DROPPING_REF); 2265ba2bf218SKurt Hackel if (test_bit(node, res->refmap)) { 22668d400b81SSunil Mushran dlm_lockres_clear_refmap_bit(dlm, res, node); 2267f3f85464SSunil Mushran cleared = 1; 2268f3f85464SSunil Mushran } 2269ba2bf218SKurt Hackel } 2270ba2bf218SKurt Hackel spin_unlock(&res->spinlock); 2271ba2bf218SKurt Hackel 2272f3f85464SSunil Mushran if (!dispatch) { 2273f3f85464SSunil Mushran if (cleared) 2274ba2bf218SKurt Hackel dlm_lockres_calc_usage(dlm, res); 2275f3f85464SSunil Mushran else { 2276f3f85464SSunil Mushran mlog(ML_ERROR, "%s:%.*s: node %u trying to drop ref " 2277f3f85464SSunil Mushran "but it is already dropped!\n", dlm->name, 2278f3f85464SSunil Mushran res->lockname.len, res->lockname.name, node); 22792af37ce8STao Ma dlm_print_one_lock_resource(res); 2280f3f85464SSunil Mushran } 2281f3f85464SSunil Mushran ret = 0; 2282f3f85464SSunil Mushran goto done; 2283f3f85464SSunil Mushran } 2284f3f85464SSunil Mushran 2285f3f85464SSunil Mushran item = kzalloc(sizeof(*item), GFP_NOFS); 2286f3f85464SSunil Mushran if (!item) { 2287f3f85464SSunil Mushran ret = -ENOMEM; 2288f3f85464SSunil Mushran mlog_errno(ret); 2289f3f85464SSunil Mushran goto done; 2290f3f85464SSunil Mushran } 2291f3f85464SSunil Mushran 2292f3f85464SSunil Mushran dlm_init_work_item(dlm, item, dlm_deref_lockres_worker, NULL); 2293f3f85464SSunil Mushran item->u.dl.deref_res = res; 2294f3f85464SSunil Mushran item->u.dl.deref_node = node; 2295f3f85464SSunil Mushran 2296f3f85464SSunil Mushran spin_lock(&dlm->work_lock); 2297f3f85464SSunil Mushran list_add_tail(&item->list, &dlm->work_list); 2298f3f85464SSunil Mushran spin_unlock(&dlm->work_lock); 2299f3f85464SSunil Mushran 2300f3f85464SSunil Mushran queue_work(dlm->dlm_worker, &dlm->dispatched_work); 2301f3f85464SSunil Mushran return 0; 2302f3f85464SSunil Mushran 2303ba2bf218SKurt Hackel done: 2304ba2bf218SKurt Hackel if (res) 2305ba2bf218SKurt Hackel dlm_lockres_put(res); 2306ba2bf218SKurt Hackel dlm_put(dlm); 2307f3f85464SSunil Mushran 2308ba2bf218SKurt Hackel return ret; 2309ba2bf218SKurt Hackel } 2310ba2bf218SKurt Hackel 2311f3f85464SSunil Mushran static void dlm_deref_lockres_worker(struct dlm_work_item *item, void *data) 2312f3f85464SSunil Mushran { 2313f3f85464SSunil Mushran struct dlm_ctxt *dlm; 2314f3f85464SSunil Mushran struct dlm_lock_resource *res; 2315f3f85464SSunil Mushran u8 node; 2316f3f85464SSunil Mushran u8 cleared = 0; 2317f3f85464SSunil Mushran 2318f3f85464SSunil Mushran dlm = item->dlm; 2319f3f85464SSunil Mushran res = item->u.dl.deref_res; 2320f3f85464SSunil Mushran node = item->u.dl.deref_node; 2321f3f85464SSunil Mushran 2322f3f85464SSunil Mushran spin_lock(&res->spinlock); 2323f3f85464SSunil Mushran BUG_ON(res->state & DLM_LOCK_RES_DROPPING_REF); 2324f3f85464SSunil Mushran if (test_bit(node, res->refmap)) { 2325f3f85464SSunil Mushran __dlm_wait_on_lockres_flags(res, DLM_LOCK_RES_SETREF_INPROG); 23268d400b81SSunil Mushran dlm_lockres_clear_refmap_bit(dlm, res, node); 2327f3f85464SSunil Mushran cleared = 1; 2328f3f85464SSunil Mushran } 2329f3f85464SSunil Mushran spin_unlock(&res->spinlock); 2330f3f85464SSunil Mushran 2331f3f85464SSunil Mushran if (cleared) { 2332f3f85464SSunil Mushran mlog(0, "%s:%.*s node %u ref dropped in dispatch\n", 2333f3f85464SSunil Mushran dlm->name, res->lockname.len, res->lockname.name, node); 2334f3f85464SSunil Mushran dlm_lockres_calc_usage(dlm, res); 2335f3f85464SSunil Mushran } else { 2336f3f85464SSunil Mushran mlog(ML_ERROR, "%s:%.*s: node %u trying to drop ref " 2337f3f85464SSunil Mushran "but it is already dropped!\n", dlm->name, 2338f3f85464SSunil Mushran res->lockname.len, res->lockname.name, node); 23392af37ce8STao Ma dlm_print_one_lock_resource(res); 2340f3f85464SSunil Mushran } 2341f3f85464SSunil Mushran 2342f3f85464SSunil Mushran dlm_lockres_put(res); 2343f3f85464SSunil Mushran } 2344f3f85464SSunil Mushran 23459f62e960SSunil Mushran /* 23469f62e960SSunil Mushran * A migrateable resource is one that is : 23479f62e960SSunil Mushran * 1. locally mastered, and, 23489f62e960SSunil Mushran * 2. zero local locks, and, 23499f62e960SSunil Mushran * 3. one or more non-local locks, or, one or more references 23509f62e960SSunil Mushran * Returns 1 if yes, 0 if not. 23512f5bf1f2SSunil Mushran */ 23522f5bf1f2SSunil Mushran static int dlm_is_lockres_migrateable(struct dlm_ctxt *dlm, 23539f62e960SSunil Mushran struct dlm_lock_resource *res) 23542f5bf1f2SSunil Mushran { 23559f62e960SSunil Mushran enum dlm_lockres_list idx; 23569f62e960SSunil Mushran int nonlocal = 0, node_ref; 2357800deef3SChristoph Hellwig struct list_head *queue; 23582f5bf1f2SSunil Mushran struct dlm_lock *lock; 23599f62e960SSunil Mushran u64 cookie; 23602f5bf1f2SSunil Mushran 23612f5bf1f2SSunil Mushran assert_spin_locked(&res->spinlock); 23622f5bf1f2SSunil Mushran 2363fae477b6SXue jiufei /* delay migration when the lockres is in MIGRATING state */ 2364fae477b6SXue jiufei if (res->state & DLM_LOCK_RES_MIGRATING) 2365fae477b6SXue jiufei return 0; 2366fae477b6SXue jiufei 23679f62e960SSunil Mushran if (res->owner != dlm->node_num) 23689f62e960SSunil Mushran return 0; 2369388c4bcbSSunil Mushran 23709f62e960SSunil Mushran for (idx = DLM_GRANTED_LIST; idx <= DLM_BLOCKED_LIST; idx++) { 23719f62e960SSunil Mushran queue = dlm_list_idx_to_ptr(res, idx); 2372800deef3SChristoph Hellwig list_for_each_entry(lock, queue, list) { 23739f62e960SSunil Mushran if (lock->ml.node != dlm->node_num) { 23749f62e960SSunil Mushran nonlocal++; 23759f62e960SSunil Mushran continue; 23769f62e960SSunil Mushran } 23779f62e960SSunil Mushran cookie = be64_to_cpu(lock->ml.cookie); 23789f62e960SSunil Mushran mlog(0, "%s: Not migrateable res %.*s, lock %u:%llu on " 23799f62e960SSunil Mushran "%s list\n", dlm->name, res->lockname.len, 23809f62e960SSunil Mushran res->lockname.name, 23819f62e960SSunil Mushran dlm_get_lock_cookie_node(cookie), 23829f62e960SSunil Mushran dlm_get_lock_cookie_seq(cookie), 23839f62e960SSunil Mushran dlm_list_in_text(idx)); 23849f62e960SSunil Mushran return 0; 23852f5bf1f2SSunil Mushran } 23862f5bf1f2SSunil Mushran } 23879f62e960SSunil Mushran 23889f62e960SSunil Mushran if (!nonlocal) { 23899f62e960SSunil Mushran node_ref = find_next_bit(res->refmap, O2NM_MAX_NODES, 0); 23909f62e960SSunil Mushran if (node_ref >= O2NM_MAX_NODES) 23919f62e960SSunil Mushran return 0; 23922f5bf1f2SSunil Mushran } 23932f5bf1f2SSunil Mushran 23949f62e960SSunil Mushran mlog(0, "%s: res %.*s, Migrateable\n", dlm->name, res->lockname.len, 23959f62e960SSunil Mushran res->lockname.name); 2396388c4bcbSSunil Mushran 23979f62e960SSunil Mushran return 1; 23982f5bf1f2SSunil Mushran } 23996714d8e8SKurt Hackel 24006714d8e8SKurt Hackel /* 24016714d8e8SKurt Hackel * DLM_MIGRATE_LOCKRES 24026714d8e8SKurt Hackel */ 24036714d8e8SKurt Hackel 24046714d8e8SKurt Hackel 2405faf0ec9fSAdrian Bunk static int dlm_migrate_lockres(struct dlm_ctxt *dlm, 240666effd3cSSunil Mushran struct dlm_lock_resource *res, u8 target) 24076714d8e8SKurt Hackel { 24086714d8e8SKurt Hackel struct dlm_master_list_entry *mle = NULL; 24096714d8e8SKurt Hackel struct dlm_master_list_entry *oldmle = NULL; 24106714d8e8SKurt Hackel struct dlm_migratable_lockres *mres = NULL; 24112f5bf1f2SSunil Mushran int ret = 0; 24126714d8e8SKurt Hackel const char *name; 24136714d8e8SKurt Hackel unsigned int namelen; 24146714d8e8SKurt Hackel int mle_added = 0; 24152f5bf1f2SSunil Mushran int wake = 0; 24166714d8e8SKurt Hackel 24176714d8e8SKurt Hackel if (!dlm_grab(dlm)) 24186714d8e8SKurt Hackel return -EINVAL; 24196714d8e8SKurt Hackel 242066effd3cSSunil Mushran BUG_ON(target == O2NM_MAX_NODES); 242166effd3cSSunil Mushran 24226714d8e8SKurt Hackel name = res->lockname.name; 24236714d8e8SKurt Hackel namelen = res->lockname.len; 24246714d8e8SKurt Hackel 242566effd3cSSunil Mushran mlog(0, "%s: Migrating %.*s to node %u\n", dlm->name, namelen, name, 242666effd3cSSunil Mushran target); 24276714d8e8SKurt Hackel 242866effd3cSSunil Mushran /* preallocate up front. if this fails, abort */ 24296714d8e8SKurt Hackel ret = -ENOMEM; 2430ad8100e0SKurt Hackel mres = (struct dlm_migratable_lockres *) __get_free_page(GFP_NOFS); 24316714d8e8SKurt Hackel if (!mres) { 24326714d8e8SKurt Hackel mlog_errno(ret); 24336714d8e8SKurt Hackel goto leave; 24346714d8e8SKurt Hackel } 24356714d8e8SKurt Hackel 24363914ed0cSJulia Lawall mle = kmem_cache_alloc(dlm_mle_cache, GFP_NOFS); 24376714d8e8SKurt Hackel if (!mle) { 24386714d8e8SKurt Hackel mlog_errno(ret); 24396714d8e8SKurt Hackel goto leave; 24406714d8e8SKurt Hackel } 24416714d8e8SKurt Hackel ret = 0; 24426714d8e8SKurt Hackel 24436714d8e8SKurt Hackel /* 24446714d8e8SKurt Hackel * clear any existing master requests and 24456714d8e8SKurt Hackel * add the migration mle to the list 24466714d8e8SKurt Hackel */ 244766effd3cSSunil Mushran spin_lock(&dlm->spinlock); 24486714d8e8SKurt Hackel spin_lock(&dlm->master_lock); 24496714d8e8SKurt Hackel ret = dlm_add_migration_mle(dlm, res, mle, &oldmle, name, 24506714d8e8SKurt Hackel namelen, target, dlm->node_num); 24516714d8e8SKurt Hackel spin_unlock(&dlm->master_lock); 24526714d8e8SKurt Hackel spin_unlock(&dlm->spinlock); 24536714d8e8SKurt Hackel 24546714d8e8SKurt Hackel if (ret == -EEXIST) { 24556714d8e8SKurt Hackel mlog(0, "another process is already migrating it\n"); 24566714d8e8SKurt Hackel goto fail; 24576714d8e8SKurt Hackel } 24586714d8e8SKurt Hackel mle_added = 1; 24596714d8e8SKurt Hackel 24606714d8e8SKurt Hackel /* 24616714d8e8SKurt Hackel * set the MIGRATING flag and flush asts 24626714d8e8SKurt Hackel * if we fail after this we need to re-dirty the lockres 24636714d8e8SKurt Hackel */ 24646714d8e8SKurt Hackel if (dlm_mark_lockres_migrating(dlm, res, target) < 0) { 24656714d8e8SKurt Hackel mlog(ML_ERROR, "tried to migrate %.*s to %u, but " 24666714d8e8SKurt Hackel "the target went down.\n", res->lockname.len, 24676714d8e8SKurt Hackel res->lockname.name, target); 24686714d8e8SKurt Hackel spin_lock(&res->spinlock); 24696714d8e8SKurt Hackel res->state &= ~DLM_LOCK_RES_MIGRATING; 2470a6fa3640SKurt Hackel wake = 1; 24716714d8e8SKurt Hackel spin_unlock(&res->spinlock); 24726714d8e8SKurt Hackel ret = -EINVAL; 24736714d8e8SKurt Hackel } 24746714d8e8SKurt Hackel 24756714d8e8SKurt Hackel fail: 24766714d8e8SKurt Hackel if (oldmle) { 24776714d8e8SKurt Hackel /* master is known, detach if not already detached */ 24786714d8e8SKurt Hackel dlm_mle_detach_hb_events(dlm, oldmle); 24796714d8e8SKurt Hackel dlm_put_mle(oldmle); 24806714d8e8SKurt Hackel } 24816714d8e8SKurt Hackel 24826714d8e8SKurt Hackel if (ret < 0) { 24836714d8e8SKurt Hackel if (mle_added) { 24846714d8e8SKurt Hackel dlm_mle_detach_hb_events(dlm, mle); 24856714d8e8SKurt Hackel dlm_put_mle(mle); 24866714d8e8SKurt Hackel } else if (mle) { 24876714d8e8SKurt Hackel kmem_cache_free(dlm_mle_cache, mle); 248866effd3cSSunil Mushran mle = NULL; 24896714d8e8SKurt Hackel } 24906714d8e8SKurt Hackel goto leave; 24916714d8e8SKurt Hackel } 24926714d8e8SKurt Hackel 24936714d8e8SKurt Hackel /* 24946714d8e8SKurt Hackel * at this point, we have a migration target, an mle 24956714d8e8SKurt Hackel * in the master list, and the MIGRATING flag set on 24966714d8e8SKurt Hackel * the lockres 24976714d8e8SKurt Hackel */ 24986714d8e8SKurt Hackel 24991cd04dbeSKurt Hackel /* now that remote nodes are spinning on the MIGRATING flag, 25001cd04dbeSKurt Hackel * ensure that all assert_master work is flushed. */ 25011cd04dbeSKurt Hackel flush_workqueue(dlm->dlm_worker); 25026714d8e8SKurt Hackel 25036714d8e8SKurt Hackel /* get an extra reference on the mle. 25046714d8e8SKurt Hackel * otherwise the assert_master from the new 25056714d8e8SKurt Hackel * master will destroy this. 25066714d8e8SKurt Hackel * also, make sure that all callers of dlm_get_mle 25076714d8e8SKurt Hackel * take both dlm->spinlock and dlm->master_lock */ 25086714d8e8SKurt Hackel spin_lock(&dlm->spinlock); 25096714d8e8SKurt Hackel spin_lock(&dlm->master_lock); 2510a2bf0477SKurt Hackel dlm_get_mle_inuse(mle); 25116714d8e8SKurt Hackel spin_unlock(&dlm->master_lock); 25126714d8e8SKurt Hackel spin_unlock(&dlm->spinlock); 25136714d8e8SKurt Hackel 25146714d8e8SKurt Hackel /* notify new node and send all lock state */ 25156714d8e8SKurt Hackel /* call send_one_lockres with migration flag. 25166714d8e8SKurt Hackel * this serves as notice to the target node that a 25176714d8e8SKurt Hackel * migration is starting. */ 25186714d8e8SKurt Hackel ret = dlm_send_one_lockres(dlm, res, mres, target, 25196714d8e8SKurt Hackel DLM_MRES_MIGRATION); 25206714d8e8SKurt Hackel 25216714d8e8SKurt Hackel if (ret < 0) { 25226714d8e8SKurt Hackel mlog(0, "migration to node %u failed with %d\n", 25236714d8e8SKurt Hackel target, ret); 25246714d8e8SKurt Hackel /* migration failed, detach and clean up mle */ 25256714d8e8SKurt Hackel dlm_mle_detach_hb_events(dlm, mle); 25266714d8e8SKurt Hackel dlm_put_mle(mle); 2527a2bf0477SKurt Hackel dlm_put_mle_inuse(mle); 2528a2bf0477SKurt Hackel spin_lock(&res->spinlock); 2529a2bf0477SKurt Hackel res->state &= ~DLM_LOCK_RES_MIGRATING; 2530a6fa3640SKurt Hackel wake = 1; 2531a2bf0477SKurt Hackel spin_unlock(&res->spinlock); 2532df016c66SSunil Mushran if (dlm_is_host_down(ret)) 2533df016c66SSunil Mushran dlm_wait_for_node_death(dlm, target, 2534df016c66SSunil Mushran DLM_NODE_DEATH_WAIT_MAX); 25356714d8e8SKurt Hackel goto leave; 25366714d8e8SKurt Hackel } 25376714d8e8SKurt Hackel 25386714d8e8SKurt Hackel /* at this point, the target sends a message to all nodes, 25396714d8e8SKurt Hackel * (using dlm_do_migrate_request). this node is skipped since 25406714d8e8SKurt Hackel * we had to put an mle in the list to begin the process. this 25416714d8e8SKurt Hackel * node now waits for target to do an assert master. this node 25426714d8e8SKurt Hackel * will be the last one notified, ensuring that the migration 25436714d8e8SKurt Hackel * is complete everywhere. if the target dies while this is 25446714d8e8SKurt Hackel * going on, some nodes could potentially see the target as the 25456714d8e8SKurt Hackel * master, so it is important that my recovery finds the migration 2546af901ca1SAndré Goddard Rosa * mle and sets the master to UNKNOWN. */ 25476714d8e8SKurt Hackel 25486714d8e8SKurt Hackel 25496714d8e8SKurt Hackel /* wait for new node to assert master */ 25506714d8e8SKurt Hackel while (1) { 25516714d8e8SKurt Hackel ret = wait_event_interruptible_timeout(mle->wq, 25526714d8e8SKurt Hackel (atomic_read(&mle->woken) == 1), 25536714d8e8SKurt Hackel msecs_to_jiffies(5000)); 25546714d8e8SKurt Hackel 25556714d8e8SKurt Hackel if (ret >= 0) { 25566714d8e8SKurt Hackel if (atomic_read(&mle->woken) == 1 || 25576714d8e8SKurt Hackel res->owner == target) 25586714d8e8SKurt Hackel break; 25596714d8e8SKurt Hackel 25601cd04dbeSKurt Hackel mlog(0, "%s:%.*s: timed out during migration\n", 25611cd04dbeSKurt Hackel dlm->name, res->lockname.len, res->lockname.name); 2562e2faea4cSKurt Hackel /* avoid hang during shutdown when migrating lockres 2563e2faea4cSKurt Hackel * to a node which also goes down */ 2564e2faea4cSKurt Hackel if (dlm_is_node_dead(dlm, target)) { 2565aa852354SKurt Hackel mlog(0, "%s:%.*s: expected migration " 2566aa852354SKurt Hackel "target %u is no longer up, restarting\n", 2567e2faea4cSKurt Hackel dlm->name, res->lockname.len, 2568e2faea4cSKurt Hackel res->lockname.name, target); 25691cd04dbeSKurt Hackel ret = -EINVAL; 25706714d8e8SKurt Hackel /* migration failed, detach and clean up mle */ 25716714d8e8SKurt Hackel dlm_mle_detach_hb_events(dlm, mle); 25726714d8e8SKurt Hackel dlm_put_mle(mle); 2573a2bf0477SKurt Hackel dlm_put_mle_inuse(mle); 2574a2bf0477SKurt Hackel spin_lock(&res->spinlock); 2575a2bf0477SKurt Hackel res->state &= ~DLM_LOCK_RES_MIGRATING; 2576a6fa3640SKurt Hackel wake = 1; 2577a2bf0477SKurt Hackel spin_unlock(&res->spinlock); 25786714d8e8SKurt Hackel goto leave; 25796714d8e8SKurt Hackel } 25801cd04dbeSKurt Hackel } else 25811cd04dbeSKurt Hackel mlog(0, "%s:%.*s: caught signal during migration\n", 25821cd04dbeSKurt Hackel dlm->name, res->lockname.len, res->lockname.name); 25836714d8e8SKurt Hackel } 25846714d8e8SKurt Hackel 25856714d8e8SKurt Hackel /* all done, set the owner, clear the flag */ 25866714d8e8SKurt Hackel spin_lock(&res->spinlock); 25876714d8e8SKurt Hackel dlm_set_lockres_owner(dlm, res, target); 25886714d8e8SKurt Hackel res->state &= ~DLM_LOCK_RES_MIGRATING; 25896714d8e8SKurt Hackel dlm_remove_nonlocal_locks(dlm, res); 25906714d8e8SKurt Hackel spin_unlock(&res->spinlock); 25916714d8e8SKurt Hackel wake_up(&res->wq); 25926714d8e8SKurt Hackel 25936714d8e8SKurt Hackel /* master is known, detach if not already detached */ 25946714d8e8SKurt Hackel dlm_mle_detach_hb_events(dlm, mle); 2595a2bf0477SKurt Hackel dlm_put_mle_inuse(mle); 25966714d8e8SKurt Hackel ret = 0; 25976714d8e8SKurt Hackel 25986714d8e8SKurt Hackel dlm_lockres_calc_usage(dlm, res); 25996714d8e8SKurt Hackel 26006714d8e8SKurt Hackel leave: 26016714d8e8SKurt Hackel /* re-dirty the lockres if we failed */ 26026714d8e8SKurt Hackel if (ret < 0) 26036714d8e8SKurt Hackel dlm_kick_thread(dlm, res); 26046714d8e8SKurt Hackel 2605a6fa3640SKurt Hackel /* wake up waiters if the MIGRATING flag got set 2606a6fa3640SKurt Hackel * but migration failed */ 2607a6fa3640SKurt Hackel if (wake) 2608a6fa3640SKurt Hackel wake_up(&res->wq); 2609a6fa3640SKurt Hackel 26106714d8e8SKurt Hackel if (mres) 26116714d8e8SKurt Hackel free_page((unsigned long)mres); 26126714d8e8SKurt Hackel 26136714d8e8SKurt Hackel dlm_put(dlm); 26146714d8e8SKurt Hackel 26159f62e960SSunil Mushran mlog(0, "%s: Migrating %.*s to %u, returns %d\n", dlm->name, namelen, 26169f62e960SSunil Mushran name, target, ret); 26176714d8e8SKurt Hackel return ret; 26186714d8e8SKurt Hackel } 26196714d8e8SKurt Hackel 2620ba2bf218SKurt Hackel #define DLM_MIGRATION_RETRY_MS 100 2621ba2bf218SKurt Hackel 26229f62e960SSunil Mushran /* 26239f62e960SSunil Mushran * Should be called only after beginning the domain leave process. 2624ba2bf218SKurt Hackel * There should not be any remaining locks on nonlocal lock resources, 2625ba2bf218SKurt Hackel * and there should be no local locks left on locally mastered resources. 2626ba2bf218SKurt Hackel * 2627ba2bf218SKurt Hackel * Called with the dlm spinlock held, may drop it to do migration, but 2628ba2bf218SKurt Hackel * will re-acquire before exit. 2629ba2bf218SKurt Hackel * 26309f62e960SSunil Mushran * Returns: 1 if dlm->spinlock was dropped/retaken, 0 if never dropped 26319f62e960SSunil Mushran */ 2632ba2bf218SKurt Hackel int dlm_empty_lockres(struct dlm_ctxt *dlm, struct dlm_lock_resource *res) 2633ba2bf218SKurt Hackel { 263466effd3cSSunil Mushran int ret; 2635ba2bf218SKurt Hackel int lock_dropped = 0; 263666effd3cSSunil Mushran u8 target = O2NM_MAX_NODES; 26379f62e960SSunil Mushran 26389f62e960SSunil Mushran assert_spin_locked(&dlm->spinlock); 2639ba2bf218SKurt Hackel 2640b36c3f84SSunil Mushran spin_lock(&res->spinlock); 264166effd3cSSunil Mushran if (dlm_is_lockres_migrateable(dlm, res)) 264266effd3cSSunil Mushran target = dlm_pick_migration_target(dlm, res); 2643b36c3f84SSunil Mushran spin_unlock(&res->spinlock); 264466effd3cSSunil Mushran 264566effd3cSSunil Mushran if (target == O2NM_MAX_NODES) 2646ba2bf218SKurt Hackel goto leave; 2647ba2bf218SKurt Hackel 2648ba2bf218SKurt Hackel /* Wheee! Migrate lockres here! Will sleep so drop spinlock. */ 2649ba2bf218SKurt Hackel spin_unlock(&dlm->spinlock); 2650ba2bf218SKurt Hackel lock_dropped = 1; 265166effd3cSSunil Mushran ret = dlm_migrate_lockres(dlm, res, target); 265266effd3cSSunil Mushran if (ret) 265366effd3cSSunil Mushran mlog(0, "%s: res %.*s, Migrate to node %u failed with %d\n", 265466effd3cSSunil Mushran dlm->name, res->lockname.len, res->lockname.name, 265566effd3cSSunil Mushran target, ret); 2656ba2bf218SKurt Hackel spin_lock(&dlm->spinlock); 2657ba2bf218SKurt Hackel leave: 2658ba2bf218SKurt Hackel return lock_dropped; 2659ba2bf218SKurt Hackel } 2660ba2bf218SKurt Hackel 26616714d8e8SKurt Hackel int dlm_lock_basts_flushed(struct dlm_ctxt *dlm, struct dlm_lock *lock) 26626714d8e8SKurt Hackel { 26636714d8e8SKurt Hackel int ret; 26646714d8e8SKurt Hackel spin_lock(&dlm->ast_lock); 26656714d8e8SKurt Hackel spin_lock(&lock->spinlock); 26666714d8e8SKurt Hackel ret = (list_empty(&lock->bast_list) && !lock->bast_pending); 26676714d8e8SKurt Hackel spin_unlock(&lock->spinlock); 26686714d8e8SKurt Hackel spin_unlock(&dlm->ast_lock); 26696714d8e8SKurt Hackel return ret; 26706714d8e8SKurt Hackel } 26716714d8e8SKurt Hackel 26726714d8e8SKurt Hackel static int dlm_migration_can_proceed(struct dlm_ctxt *dlm, 26736714d8e8SKurt Hackel struct dlm_lock_resource *res, 26746714d8e8SKurt Hackel u8 mig_target) 26756714d8e8SKurt Hackel { 26766714d8e8SKurt Hackel int can_proceed; 26776714d8e8SKurt Hackel spin_lock(&res->spinlock); 26786714d8e8SKurt Hackel can_proceed = !!(res->state & DLM_LOCK_RES_MIGRATING); 26796714d8e8SKurt Hackel spin_unlock(&res->spinlock); 26806714d8e8SKurt Hackel 26816714d8e8SKurt Hackel /* target has died, so make the caller break out of the 26826714d8e8SKurt Hackel * wait_event, but caller must recheck the domain_map */ 26836714d8e8SKurt Hackel spin_lock(&dlm->spinlock); 26846714d8e8SKurt Hackel if (!test_bit(mig_target, dlm->domain_map)) 26856714d8e8SKurt Hackel can_proceed = 1; 26866714d8e8SKurt Hackel spin_unlock(&dlm->spinlock); 26876714d8e8SKurt Hackel return can_proceed; 26886714d8e8SKurt Hackel } 26896714d8e8SKurt Hackel 2690faf0ec9fSAdrian Bunk static int dlm_lockres_is_dirty(struct dlm_ctxt *dlm, 2691faf0ec9fSAdrian Bunk struct dlm_lock_resource *res) 26926714d8e8SKurt Hackel { 26936714d8e8SKurt Hackel int ret; 26946714d8e8SKurt Hackel spin_lock(&res->spinlock); 26956714d8e8SKurt Hackel ret = !!(res->state & DLM_LOCK_RES_DIRTY); 26966714d8e8SKurt Hackel spin_unlock(&res->spinlock); 26976714d8e8SKurt Hackel return ret; 26986714d8e8SKurt Hackel } 26996714d8e8SKurt Hackel 27006714d8e8SKurt Hackel 27016714d8e8SKurt Hackel static int dlm_mark_lockres_migrating(struct dlm_ctxt *dlm, 27026714d8e8SKurt Hackel struct dlm_lock_resource *res, 27036714d8e8SKurt Hackel u8 target) 27046714d8e8SKurt Hackel { 27056714d8e8SKurt Hackel int ret = 0; 27066714d8e8SKurt Hackel 27076714d8e8SKurt Hackel mlog(0, "dlm_mark_lockres_migrating: %.*s, from %u to %u\n", 27086714d8e8SKurt Hackel res->lockname.len, res->lockname.name, dlm->node_num, 27096714d8e8SKurt Hackel target); 27106714d8e8SKurt Hackel /* need to set MIGRATING flag on lockres. this is done by 27116714d8e8SKurt Hackel * ensuring that all asts have been flushed for this lockres. */ 27126714d8e8SKurt Hackel spin_lock(&res->spinlock); 27136714d8e8SKurt Hackel BUG_ON(res->migration_pending); 27146714d8e8SKurt Hackel res->migration_pending = 1; 27156714d8e8SKurt Hackel /* strategy is to reserve an extra ast then release 27166714d8e8SKurt Hackel * it below, letting the release do all of the work */ 27176714d8e8SKurt Hackel __dlm_lockres_reserve_ast(res); 27186714d8e8SKurt Hackel spin_unlock(&res->spinlock); 27196714d8e8SKurt Hackel 2720ddc09c8dSKurt Hackel /* now flush all the pending asts */ 27216714d8e8SKurt Hackel dlm_kick_thread(dlm, res); 2722ddc09c8dSKurt Hackel /* before waiting on DIRTY, block processes which may 2723ddc09c8dSKurt Hackel * try to dirty the lockres before MIGRATING is set */ 2724ddc09c8dSKurt Hackel spin_lock(&res->spinlock); 2725ddc09c8dSKurt Hackel BUG_ON(res->state & DLM_LOCK_RES_BLOCK_DIRTY); 2726ddc09c8dSKurt Hackel res->state |= DLM_LOCK_RES_BLOCK_DIRTY; 2727ddc09c8dSKurt Hackel spin_unlock(&res->spinlock); 2728ddc09c8dSKurt Hackel /* now wait on any pending asts and the DIRTY state */ 27296714d8e8SKurt Hackel wait_event(dlm->ast_wq, !dlm_lockres_is_dirty(dlm, res)); 27306714d8e8SKurt Hackel dlm_lockres_release_ast(dlm, res); 27316714d8e8SKurt Hackel 27326714d8e8SKurt Hackel mlog(0, "about to wait on migration_wq, dirty=%s\n", 27336714d8e8SKurt Hackel res->state & DLM_LOCK_RES_DIRTY ? "yes" : "no"); 27346714d8e8SKurt Hackel /* if the extra ref we just put was the final one, this 27356714d8e8SKurt Hackel * will pass thru immediately. otherwise, we need to wait 27366714d8e8SKurt Hackel * for the last ast to finish. */ 27376714d8e8SKurt Hackel again: 27386714d8e8SKurt Hackel ret = wait_event_interruptible_timeout(dlm->migration_wq, 27396714d8e8SKurt Hackel dlm_migration_can_proceed(dlm, res, target), 27406714d8e8SKurt Hackel msecs_to_jiffies(1000)); 27416714d8e8SKurt Hackel if (ret < 0) { 27426714d8e8SKurt Hackel mlog(0, "woken again: migrating? %s, dead? %s\n", 27436714d8e8SKurt Hackel res->state & DLM_LOCK_RES_MIGRATING ? "yes":"no", 27446714d8e8SKurt Hackel test_bit(target, dlm->domain_map) ? "no":"yes"); 27456714d8e8SKurt Hackel } else { 27466714d8e8SKurt Hackel mlog(0, "all is well: migrating? %s, dead? %s\n", 27476714d8e8SKurt Hackel res->state & DLM_LOCK_RES_MIGRATING ? "yes":"no", 27486714d8e8SKurt Hackel test_bit(target, dlm->domain_map) ? "no":"yes"); 27496714d8e8SKurt Hackel } 27506714d8e8SKurt Hackel if (!dlm_migration_can_proceed(dlm, res, target)) { 27516714d8e8SKurt Hackel mlog(0, "trying again...\n"); 27526714d8e8SKurt Hackel goto again; 27536714d8e8SKurt Hackel } 27546714d8e8SKurt Hackel 2755a39953ddSWengang Wang ret = 0; 27566714d8e8SKurt Hackel /* did the target go down or die? */ 27576714d8e8SKurt Hackel spin_lock(&dlm->spinlock); 27586714d8e8SKurt Hackel if (!test_bit(target, dlm->domain_map)) { 27596714d8e8SKurt Hackel mlog(ML_ERROR, "aha. migration target %u just went down\n", 27606714d8e8SKurt Hackel target); 27616714d8e8SKurt Hackel ret = -EHOSTDOWN; 27626714d8e8SKurt Hackel } 27636714d8e8SKurt Hackel spin_unlock(&dlm->spinlock); 27646714d8e8SKurt Hackel 27656714d8e8SKurt Hackel /* 2766a39953ddSWengang Wang * if target is down, we need to clear DLM_LOCK_RES_BLOCK_DIRTY for 2767a39953ddSWengang Wang * another try; otherwise, we are sure the MIGRATING state is there, 2768a39953ddSWengang Wang * drop the unneded state which blocked threads trying to DIRTY 2769a39953ddSWengang Wang */ 2770a39953ddSWengang Wang spin_lock(&res->spinlock); 2771a39953ddSWengang Wang BUG_ON(!(res->state & DLM_LOCK_RES_BLOCK_DIRTY)); 2772a39953ddSWengang Wang res->state &= ~DLM_LOCK_RES_BLOCK_DIRTY; 2773a39953ddSWengang Wang if (!ret) 2774a39953ddSWengang Wang BUG_ON(!(res->state & DLM_LOCK_RES_MIGRATING)); 2775a39953ddSWengang Wang spin_unlock(&res->spinlock); 2776a39953ddSWengang Wang 2777a39953ddSWengang Wang /* 27786714d8e8SKurt Hackel * at this point: 27796714d8e8SKurt Hackel * 2780a39953ddSWengang Wang * o the DLM_LOCK_RES_MIGRATING flag is set if target not down 27816714d8e8SKurt Hackel * o there are no pending asts on this lockres 27826714d8e8SKurt Hackel * o all processes trying to reserve an ast on this 27836714d8e8SKurt Hackel * lockres must wait for the MIGRATING flag to clear 27846714d8e8SKurt Hackel */ 27856714d8e8SKurt Hackel return ret; 27866714d8e8SKurt Hackel } 27876714d8e8SKurt Hackel 27886714d8e8SKurt Hackel /* last step in the migration process. 27896714d8e8SKurt Hackel * original master calls this to free all of the dlm_lock 27906714d8e8SKurt Hackel * structures that used to be for other nodes. */ 27916714d8e8SKurt Hackel static void dlm_remove_nonlocal_locks(struct dlm_ctxt *dlm, 27926714d8e8SKurt Hackel struct dlm_lock_resource *res) 27936714d8e8SKurt Hackel { 27946714d8e8SKurt Hackel struct list_head *queue = &res->granted; 2795ba2bf218SKurt Hackel int i, bit; 2796800deef3SChristoph Hellwig struct dlm_lock *lock, *next; 27976714d8e8SKurt Hackel 27986714d8e8SKurt Hackel assert_spin_locked(&res->spinlock); 27996714d8e8SKurt Hackel 28006714d8e8SKurt Hackel BUG_ON(res->owner == dlm->node_num); 28016714d8e8SKurt Hackel 28026714d8e8SKurt Hackel for (i=0; i<3; i++) { 2803800deef3SChristoph Hellwig list_for_each_entry_safe(lock, next, queue, list) { 28046714d8e8SKurt Hackel if (lock->ml.node != dlm->node_num) { 28056714d8e8SKurt Hackel mlog(0, "putting lock for node %u\n", 28066714d8e8SKurt Hackel lock->ml.node); 28076714d8e8SKurt Hackel /* be extra careful */ 28086714d8e8SKurt Hackel BUG_ON(!list_empty(&lock->ast_list)); 28096714d8e8SKurt Hackel BUG_ON(!list_empty(&lock->bast_list)); 28106714d8e8SKurt Hackel BUG_ON(lock->ast_pending); 28116714d8e8SKurt Hackel BUG_ON(lock->bast_pending); 28128d400b81SSunil Mushran dlm_lockres_clear_refmap_bit(dlm, res, 28138d400b81SSunil Mushran lock->ml.node); 28146714d8e8SKurt Hackel list_del_init(&lock->list); 28156714d8e8SKurt Hackel dlm_lock_put(lock); 28162c5c54acSSunil Mushran /* In a normal unlock, we would have added a 28172c5c54acSSunil Mushran * DLM_UNLOCK_FREE_LOCK action. Force it. */ 28182c5c54acSSunil Mushran dlm_lock_put(lock); 28196714d8e8SKurt Hackel } 28206714d8e8SKurt Hackel } 28216714d8e8SKurt Hackel queue++; 28226714d8e8SKurt Hackel } 2823ba2bf218SKurt Hackel bit = 0; 2824ba2bf218SKurt Hackel while (1) { 2825ba2bf218SKurt Hackel bit = find_next_bit(res->refmap, O2NM_MAX_NODES, bit); 2826ba2bf218SKurt Hackel if (bit >= O2NM_MAX_NODES) 2827ba2bf218SKurt Hackel break; 2828ba2bf218SKurt Hackel /* do not clear the local node reference, if there is a 2829ba2bf218SKurt Hackel * process holding this, let it drop the ref itself */ 2830ba2bf218SKurt Hackel if (bit != dlm->node_num) { 2831ba2bf218SKurt Hackel mlog(0, "%s:%.*s: node %u had a ref to this " 2832ba2bf218SKurt Hackel "migrating lockres, clearing\n", dlm->name, 2833ba2bf218SKurt Hackel res->lockname.len, res->lockname.name, bit); 28348d400b81SSunil Mushran dlm_lockres_clear_refmap_bit(dlm, res, bit); 2835ba2bf218SKurt Hackel } 2836ba2bf218SKurt Hackel bit++; 2837ba2bf218SKurt Hackel } 28386714d8e8SKurt Hackel } 28396714d8e8SKurt Hackel 284066effd3cSSunil Mushran /* 284166effd3cSSunil Mushran * Pick a node to migrate the lock resource to. This function selects a 284266effd3cSSunil Mushran * potential target based first on the locks and then on refmap. It skips 284366effd3cSSunil Mushran * nodes that are in the process of exiting the domain. 284466effd3cSSunil Mushran */ 28456714d8e8SKurt Hackel static u8 dlm_pick_migration_target(struct dlm_ctxt *dlm, 28466714d8e8SKurt Hackel struct dlm_lock_resource *res) 28476714d8e8SKurt Hackel { 284866effd3cSSunil Mushran enum dlm_lockres_list idx; 28496714d8e8SKurt Hackel struct list_head *queue = &res->granted; 28506714d8e8SKurt Hackel struct dlm_lock *lock; 285166effd3cSSunil Mushran int noderef; 285266effd3cSSunil Mushran u8 nodenum = O2NM_MAX_NODES; 28536714d8e8SKurt Hackel 28546714d8e8SKurt Hackel assert_spin_locked(&dlm->spinlock); 285566effd3cSSunil Mushran assert_spin_locked(&res->spinlock); 28566714d8e8SKurt Hackel 285766effd3cSSunil Mushran /* Go through all the locks */ 285866effd3cSSunil Mushran for (idx = DLM_GRANTED_LIST; idx <= DLM_BLOCKED_LIST; idx++) { 285966effd3cSSunil Mushran queue = dlm_list_idx_to_ptr(res, idx); 2860800deef3SChristoph Hellwig list_for_each_entry(lock, queue, list) { 286166effd3cSSunil Mushran if (lock->ml.node == dlm->node_num) 286266effd3cSSunil Mushran continue; 286366effd3cSSunil Mushran if (test_bit(lock->ml.node, dlm->exit_domain_map)) 286466effd3cSSunil Mushran continue; 286566effd3cSSunil Mushran nodenum = lock->ml.node; 286666effd3cSSunil Mushran goto bail; 28676714d8e8SKurt Hackel } 28686714d8e8SKurt Hackel } 2869388c4bcbSSunil Mushran 287066effd3cSSunil Mushran /* Go thru the refmap */ 287166effd3cSSunil Mushran noderef = -1; 28726714d8e8SKurt Hackel while (1) { 287366effd3cSSunil Mushran noderef = find_next_bit(res->refmap, O2NM_MAX_NODES, 287466effd3cSSunil Mushran noderef + 1); 287566effd3cSSunil Mushran if (noderef >= O2NM_MAX_NODES) 28766714d8e8SKurt Hackel break; 287766effd3cSSunil Mushran if (noderef == dlm->node_num) 287866effd3cSSunil Mushran continue; 287966effd3cSSunil Mushran if (test_bit(noderef, dlm->exit_domain_map)) 288066effd3cSSunil Mushran continue; 288166effd3cSSunil Mushran nodenum = noderef; 288266effd3cSSunil Mushran goto bail; 288366effd3cSSunil Mushran } 288466effd3cSSunil Mushran 288566effd3cSSunil Mushran bail: 28866714d8e8SKurt Hackel return nodenum; 28876714d8e8SKurt Hackel } 28886714d8e8SKurt Hackel 28896714d8e8SKurt Hackel /* this is called by the new master once all lockres 28906714d8e8SKurt Hackel * data has been received */ 28916714d8e8SKurt Hackel static int dlm_do_migrate_request(struct dlm_ctxt *dlm, 28926714d8e8SKurt Hackel struct dlm_lock_resource *res, 28936714d8e8SKurt Hackel u8 master, u8 new_master, 28946714d8e8SKurt Hackel struct dlm_node_iter *iter) 28956714d8e8SKurt Hackel { 28966714d8e8SKurt Hackel struct dlm_migrate_request migrate; 28972b832564SSunil Mushran int ret, skip, status = 0; 28986714d8e8SKurt Hackel int nodenum; 28996714d8e8SKurt Hackel 29006714d8e8SKurt Hackel memset(&migrate, 0, sizeof(migrate)); 29016714d8e8SKurt Hackel migrate.namelen = res->lockname.len; 29026714d8e8SKurt Hackel memcpy(migrate.name, res->lockname.name, migrate.namelen); 29036714d8e8SKurt Hackel migrate.new_master = new_master; 29046714d8e8SKurt Hackel migrate.master = master; 29056714d8e8SKurt Hackel 29066714d8e8SKurt Hackel ret = 0; 29076714d8e8SKurt Hackel 29086714d8e8SKurt Hackel /* send message to all nodes, except the master and myself */ 29096714d8e8SKurt Hackel while ((nodenum = dlm_node_iter_next(iter)) >= 0) { 29106714d8e8SKurt Hackel if (nodenum == master || 29116714d8e8SKurt Hackel nodenum == new_master) 29126714d8e8SKurt Hackel continue; 29136714d8e8SKurt Hackel 29142b832564SSunil Mushran /* We could race exit domain. If exited, skip. */ 29152b832564SSunil Mushran spin_lock(&dlm->spinlock); 29162b832564SSunil Mushran skip = (!test_bit(nodenum, dlm->domain_map)); 29172b832564SSunil Mushran spin_unlock(&dlm->spinlock); 29182b832564SSunil Mushran if (skip) { 29192b832564SSunil Mushran clear_bit(nodenum, iter->node_map); 29202b832564SSunil Mushran continue; 29212b832564SSunil Mushran } 29222b832564SSunil Mushran 29236714d8e8SKurt Hackel ret = o2net_send_message(DLM_MIGRATE_REQUEST_MSG, dlm->key, 29246714d8e8SKurt Hackel &migrate, sizeof(migrate), nodenum, 29256714d8e8SKurt Hackel &status); 29262b832564SSunil Mushran if (ret < 0) { 29278decab3cSSunil Mushran mlog(ML_ERROR, "%s: res %.*s, Error %d send " 29288decab3cSSunil Mushran "MIGRATE_REQUEST to node %u\n", dlm->name, 29298decab3cSSunil Mushran migrate.namelen, migrate.name, ret, nodenum); 29302b832564SSunil Mushran if (!dlm_is_host_down(ret)) { 29312b832564SSunil Mushran mlog(ML_ERROR, "unhandled error=%d!\n", ret); 29322b832564SSunil Mushran BUG(); 29332b832564SSunil Mushran } 29342b832564SSunil Mushran clear_bit(nodenum, iter->node_map); 29352b832564SSunil Mushran ret = 0; 29362b832564SSunil Mushran } else if (status < 0) { 29376714d8e8SKurt Hackel mlog(0, "migrate request (node %u) returned %d!\n", 29386714d8e8SKurt Hackel nodenum, status); 29396714d8e8SKurt Hackel ret = status; 2940ba2bf218SKurt Hackel } else if (status == DLM_MIGRATE_RESPONSE_MASTERY_REF) { 2941ba2bf218SKurt Hackel /* during the migration request we short-circuited 2942ba2bf218SKurt Hackel * the mastery of the lockres. make sure we have 2943ba2bf218SKurt Hackel * a mastery ref for nodenum */ 2944ba2bf218SKurt Hackel mlog(0, "%s:%.*s: need ref for node %u\n", 2945ba2bf218SKurt Hackel dlm->name, res->lockname.len, res->lockname.name, 2946ba2bf218SKurt Hackel nodenum); 2947ba2bf218SKurt Hackel spin_lock(&res->spinlock); 29488d400b81SSunil Mushran dlm_lockres_set_refmap_bit(dlm, res, nodenum); 2949ba2bf218SKurt Hackel spin_unlock(&res->spinlock); 29506714d8e8SKurt Hackel } 29516714d8e8SKurt Hackel } 29526714d8e8SKurt Hackel 29536714d8e8SKurt Hackel if (ret < 0) 29546714d8e8SKurt Hackel mlog_errno(ret); 29556714d8e8SKurt Hackel 29566714d8e8SKurt Hackel mlog(0, "returning ret=%d\n", ret); 29576714d8e8SKurt Hackel return ret; 29586714d8e8SKurt Hackel } 29596714d8e8SKurt Hackel 29606714d8e8SKurt Hackel 29616714d8e8SKurt Hackel /* if there is an existing mle for this lockres, we now know who the master is. 29626714d8e8SKurt Hackel * (the one who sent us *this* message) we can clear it up right away. 29636714d8e8SKurt Hackel * since the process that put the mle on the list still has a reference to it, 29646714d8e8SKurt Hackel * we can unhash it now, set the master and wake the process. as a result, 29656714d8e8SKurt Hackel * we will have no mle in the list to start with. now we can add an mle for 29666714d8e8SKurt Hackel * the migration and this should be the only one found for those scanning the 29676714d8e8SKurt Hackel * list. */ 2968d74c9803SKurt Hackel int dlm_migrate_request_handler(struct o2net_msg *msg, u32 len, void *data, 2969d74c9803SKurt Hackel void **ret_data) 29706714d8e8SKurt Hackel { 29716714d8e8SKurt Hackel struct dlm_ctxt *dlm = data; 29726714d8e8SKurt Hackel struct dlm_lock_resource *res = NULL; 29736714d8e8SKurt Hackel struct dlm_migrate_request *migrate = (struct dlm_migrate_request *) msg->buf; 29746714d8e8SKurt Hackel struct dlm_master_list_entry *mle = NULL, *oldmle = NULL; 29756714d8e8SKurt Hackel const char *name; 2976a3d33291SMark Fasheh unsigned int namelen, hash; 29776714d8e8SKurt Hackel int ret = 0; 29786714d8e8SKurt Hackel 29796714d8e8SKurt Hackel if (!dlm_grab(dlm)) 29806714d8e8SKurt Hackel return -EINVAL; 29816714d8e8SKurt Hackel 29826714d8e8SKurt Hackel name = migrate->name; 29836714d8e8SKurt Hackel namelen = migrate->namelen; 2984a3d33291SMark Fasheh hash = dlm_lockid_hash(name, namelen); 29856714d8e8SKurt Hackel 29866714d8e8SKurt Hackel /* preallocate.. if this fails, abort */ 29873914ed0cSJulia Lawall mle = kmem_cache_alloc(dlm_mle_cache, GFP_NOFS); 29886714d8e8SKurt Hackel 29896714d8e8SKurt Hackel if (!mle) { 29906714d8e8SKurt Hackel ret = -ENOMEM; 29916714d8e8SKurt Hackel goto leave; 29926714d8e8SKurt Hackel } 29936714d8e8SKurt Hackel 29946714d8e8SKurt Hackel /* check for pre-existing lock */ 29956714d8e8SKurt Hackel spin_lock(&dlm->spinlock); 2996a3d33291SMark Fasheh res = __dlm_lookup_lockres(dlm, name, namelen, hash); 29976714d8e8SKurt Hackel if (res) { 29986714d8e8SKurt Hackel spin_lock(&res->spinlock); 29996714d8e8SKurt Hackel if (res->state & DLM_LOCK_RES_RECOVERING) { 30006714d8e8SKurt Hackel /* if all is working ok, this can only mean that we got 30016714d8e8SKurt Hackel * a migrate request from a node that we now see as 30026714d8e8SKurt Hackel * dead. what can we do here? drop it to the floor? */ 30036714d8e8SKurt Hackel spin_unlock(&res->spinlock); 30046714d8e8SKurt Hackel mlog(ML_ERROR, "Got a migrate request, but the " 30056714d8e8SKurt Hackel "lockres is marked as recovering!"); 30066714d8e8SKurt Hackel kmem_cache_free(dlm_mle_cache, mle); 30076714d8e8SKurt Hackel ret = -EINVAL; /* need a better solution */ 30086714d8e8SKurt Hackel goto unlock; 30096714d8e8SKurt Hackel } 30106714d8e8SKurt Hackel res->state |= DLM_LOCK_RES_MIGRATING; 30116714d8e8SKurt Hackel spin_unlock(&res->spinlock); 30126714d8e8SKurt Hackel } 30136714d8e8SKurt Hackel 30146d98c3ccSWengang Wang spin_lock(&dlm->master_lock); 30156714d8e8SKurt Hackel /* ignore status. only nonzero status would BUG. */ 30166714d8e8SKurt Hackel ret = dlm_add_migration_mle(dlm, res, mle, &oldmle, 30176714d8e8SKurt Hackel name, namelen, 30186714d8e8SKurt Hackel migrate->new_master, 30196714d8e8SKurt Hackel migrate->master); 30206714d8e8SKurt Hackel 30216714d8e8SKurt Hackel spin_unlock(&dlm->master_lock); 30226d98c3ccSWengang Wang unlock: 30236714d8e8SKurt Hackel spin_unlock(&dlm->spinlock); 30246714d8e8SKurt Hackel 30256714d8e8SKurt Hackel if (oldmle) { 30266714d8e8SKurt Hackel /* master is known, detach if not already detached */ 30276714d8e8SKurt Hackel dlm_mle_detach_hb_events(dlm, oldmle); 30286714d8e8SKurt Hackel dlm_put_mle(oldmle); 30296714d8e8SKurt Hackel } 30306714d8e8SKurt Hackel 30316714d8e8SKurt Hackel if (res) 30326714d8e8SKurt Hackel dlm_lockres_put(res); 30336714d8e8SKurt Hackel leave: 30346714d8e8SKurt Hackel dlm_put(dlm); 30356714d8e8SKurt Hackel return ret; 30366714d8e8SKurt Hackel } 30376714d8e8SKurt Hackel 30386714d8e8SKurt Hackel /* must be holding dlm->spinlock and dlm->master_lock 30396714d8e8SKurt Hackel * when adding a migration mle, we can clear any other mles 30406714d8e8SKurt Hackel * in the master list because we know with certainty that 30416714d8e8SKurt Hackel * the master is "master". so we remove any old mle from 30426714d8e8SKurt Hackel * the list after setting it's master field, and then add 30436714d8e8SKurt Hackel * the new migration mle. this way we can hold with the rule 30446714d8e8SKurt Hackel * of having only one mle for a given lock name at all times. */ 30456714d8e8SKurt Hackel static int dlm_add_migration_mle(struct dlm_ctxt *dlm, 30466714d8e8SKurt Hackel struct dlm_lock_resource *res, 30476714d8e8SKurt Hackel struct dlm_master_list_entry *mle, 30486714d8e8SKurt Hackel struct dlm_master_list_entry **oldmle, 30496714d8e8SKurt Hackel const char *name, unsigned int namelen, 30506714d8e8SKurt Hackel u8 new_master, u8 master) 30516714d8e8SKurt Hackel { 30526714d8e8SKurt Hackel int found; 30536714d8e8SKurt Hackel int ret = 0; 30546714d8e8SKurt Hackel 30556714d8e8SKurt Hackel *oldmle = NULL; 30566714d8e8SKurt Hackel 30576714d8e8SKurt Hackel assert_spin_locked(&dlm->spinlock); 30586714d8e8SKurt Hackel assert_spin_locked(&dlm->master_lock); 30596714d8e8SKurt Hackel 30606714d8e8SKurt Hackel /* caller is responsible for any ref taken here on oldmle */ 30616714d8e8SKurt Hackel found = dlm_find_mle(dlm, oldmle, (char *)name, namelen); 30626714d8e8SKurt Hackel if (found) { 30636714d8e8SKurt Hackel struct dlm_master_list_entry *tmp = *oldmle; 30646714d8e8SKurt Hackel spin_lock(&tmp->spinlock); 30656714d8e8SKurt Hackel if (tmp->type == DLM_MLE_MIGRATION) { 30666714d8e8SKurt Hackel if (master == dlm->node_num) { 30676714d8e8SKurt Hackel /* ah another process raced me to it */ 30686714d8e8SKurt Hackel mlog(0, "tried to migrate %.*s, but some " 30696714d8e8SKurt Hackel "process beat me to it\n", 30706714d8e8SKurt Hackel namelen, name); 30716714d8e8SKurt Hackel ret = -EEXIST; 30726714d8e8SKurt Hackel } else { 30736714d8e8SKurt Hackel /* bad. 2 NODES are trying to migrate! */ 30746714d8e8SKurt Hackel mlog(ML_ERROR, "migration error mle: " 30756714d8e8SKurt Hackel "master=%u new_master=%u // request: " 30766714d8e8SKurt Hackel "master=%u new_master=%u // " 30776714d8e8SKurt Hackel "lockres=%.*s\n", 30786714d8e8SKurt Hackel tmp->master, tmp->new_master, 30796714d8e8SKurt Hackel master, new_master, 30806714d8e8SKurt Hackel namelen, name); 30816714d8e8SKurt Hackel BUG(); 30826714d8e8SKurt Hackel } 30836714d8e8SKurt Hackel } else { 30846714d8e8SKurt Hackel /* this is essentially what assert_master does */ 30856714d8e8SKurt Hackel tmp->master = master; 30866714d8e8SKurt Hackel atomic_set(&tmp->woken, 1); 30876714d8e8SKurt Hackel wake_up(&tmp->wq); 30881c084577SSunil Mushran /* remove it so that only one mle will be found */ 30891c084577SSunil Mushran __dlm_unlink_mle(dlm, tmp); 3090ba2bf218SKurt Hackel __dlm_mle_detach_hb_events(dlm, tmp); 3091b9aaac5aSjiangyiwen if (tmp->type == DLM_MLE_MASTER) { 3092ba2bf218SKurt Hackel ret = DLM_MIGRATE_RESPONSE_MASTERY_REF; 3093ba2bf218SKurt Hackel mlog(0, "%s:%.*s: master=%u, newmaster=%u, " 3094b9aaac5aSjiangyiwen "telling master to get ref " 3095b9aaac5aSjiangyiwen "for cleared out mle during " 3096b9aaac5aSjiangyiwen "migration\n", dlm->name, 3097b9aaac5aSjiangyiwen namelen, name, master, 3098b9aaac5aSjiangyiwen new_master); 3099b9aaac5aSjiangyiwen } 31006714d8e8SKurt Hackel } 31016714d8e8SKurt Hackel spin_unlock(&tmp->spinlock); 31026714d8e8SKurt Hackel } 31036714d8e8SKurt Hackel 31046714d8e8SKurt Hackel /* now add a migration mle to the tail of the list */ 31056714d8e8SKurt Hackel dlm_init_mle(mle, DLM_MLE_MIGRATION, dlm, res, name, namelen); 31066714d8e8SKurt Hackel mle->new_master = new_master; 3107ba2bf218SKurt Hackel /* the new master will be sending an assert master for this. 3108ba2bf218SKurt Hackel * at that point we will get the refmap reference */ 31096714d8e8SKurt Hackel mle->master = master; 31106714d8e8SKurt Hackel /* do this for consistency with other mle types */ 31116714d8e8SKurt Hackel set_bit(new_master, mle->maybe_map); 31121c084577SSunil Mushran __dlm_insert_mle(dlm, mle); 31136714d8e8SKurt Hackel 31146714d8e8SKurt Hackel return ret; 31156714d8e8SKurt Hackel } 31166714d8e8SKurt Hackel 3117c2cd4a44SSunil Mushran /* 3118c2cd4a44SSunil Mushran * Sets the owner of the lockres, associated to the mle, to UNKNOWN 3119c2cd4a44SSunil Mushran */ 3120c2cd4a44SSunil Mushran static struct dlm_lock_resource *dlm_reset_mleres_owner(struct dlm_ctxt *dlm, 3121c2cd4a44SSunil Mushran struct dlm_master_list_entry *mle) 3122c2cd4a44SSunil Mushran { 3123c2cd4a44SSunil Mushran struct dlm_lock_resource *res; 3124c2cd4a44SSunil Mushran 3125c2cd4a44SSunil Mushran /* Find the lockres associated to the mle and set its owner to UNK */ 31267141514bSSunil Mushran res = __dlm_lookup_lockres(dlm, mle->mname, mle->mnamelen, 31277141514bSSunil Mushran mle->mnamehash); 3128c2cd4a44SSunil Mushran if (res) { 3129c2cd4a44SSunil Mushran spin_unlock(&dlm->master_lock); 3130c2cd4a44SSunil Mushran 3131c2cd4a44SSunil Mushran /* move lockres onto recovery list */ 3132c2cd4a44SSunil Mushran spin_lock(&res->spinlock); 3133c2cd4a44SSunil Mushran dlm_set_lockres_owner(dlm, res, DLM_LOCK_RES_OWNER_UNKNOWN); 3134c2cd4a44SSunil Mushran dlm_move_lockres_to_recovery_list(dlm, res); 3135c2cd4a44SSunil Mushran spin_unlock(&res->spinlock); 3136c2cd4a44SSunil Mushran dlm_lockres_put(res); 3137c2cd4a44SSunil Mushran 3138c2cd4a44SSunil Mushran /* about to get rid of mle, detach from heartbeat */ 3139c2cd4a44SSunil Mushran __dlm_mle_detach_hb_events(dlm, mle); 3140c2cd4a44SSunil Mushran 3141c2cd4a44SSunil Mushran /* dump the mle */ 3142c2cd4a44SSunil Mushran spin_lock(&dlm->master_lock); 3143c2cd4a44SSunil Mushran __dlm_put_mle(mle); 3144c2cd4a44SSunil Mushran spin_unlock(&dlm->master_lock); 3145c2cd4a44SSunil Mushran } 3146c2cd4a44SSunil Mushran 3147c2cd4a44SSunil Mushran return res; 3148c2cd4a44SSunil Mushran } 3149c2cd4a44SSunil Mushran 3150c2cd4a44SSunil Mushran static void dlm_clean_migration_mle(struct dlm_ctxt *dlm, 3151c2cd4a44SSunil Mushran struct dlm_master_list_entry *mle) 3152c2cd4a44SSunil Mushran { 3153c2cd4a44SSunil Mushran __dlm_mle_detach_hb_events(dlm, mle); 3154c2cd4a44SSunil Mushran 3155c2cd4a44SSunil Mushran spin_lock(&mle->spinlock); 3156c2cd4a44SSunil Mushran __dlm_unlink_mle(dlm, mle); 3157c2cd4a44SSunil Mushran atomic_set(&mle->woken, 1); 3158c2cd4a44SSunil Mushran spin_unlock(&mle->spinlock); 3159c2cd4a44SSunil Mushran 3160c2cd4a44SSunil Mushran wake_up(&mle->wq); 3161c2cd4a44SSunil Mushran } 3162c2cd4a44SSunil Mushran 3163c2cd4a44SSunil Mushran static void dlm_clean_block_mle(struct dlm_ctxt *dlm, 3164c2cd4a44SSunil Mushran struct dlm_master_list_entry *mle, u8 dead_node) 3165c2cd4a44SSunil Mushran { 3166c2cd4a44SSunil Mushran int bit; 3167c2cd4a44SSunil Mushran 3168c2cd4a44SSunil Mushran BUG_ON(mle->type != DLM_MLE_BLOCK); 3169c2cd4a44SSunil Mushran 3170c2cd4a44SSunil Mushran spin_lock(&mle->spinlock); 3171c2cd4a44SSunil Mushran bit = find_next_bit(mle->maybe_map, O2NM_MAX_NODES, 0); 3172c2cd4a44SSunil Mushran if (bit != dead_node) { 3173c2cd4a44SSunil Mushran mlog(0, "mle found, but dead node %u would not have been " 3174c2cd4a44SSunil Mushran "master\n", dead_node); 3175c2cd4a44SSunil Mushran spin_unlock(&mle->spinlock); 3176c2cd4a44SSunil Mushran } else { 3177c2cd4a44SSunil Mushran /* Must drop the refcount by one since the assert_master will 3178c2cd4a44SSunil Mushran * never arrive. This may result in the mle being unlinked and 3179c2cd4a44SSunil Mushran * freed, but there may still be a process waiting in the 3180c2cd4a44SSunil Mushran * dlmlock path which is fine. */ 3181c2cd4a44SSunil Mushran mlog(0, "node %u was expected master\n", dead_node); 3182c2cd4a44SSunil Mushran atomic_set(&mle->woken, 1); 3183c2cd4a44SSunil Mushran spin_unlock(&mle->spinlock); 3184c2cd4a44SSunil Mushran wake_up(&mle->wq); 3185c2cd4a44SSunil Mushran 3186c2cd4a44SSunil Mushran /* Do not need events any longer, so detach from heartbeat */ 3187c2cd4a44SSunil Mushran __dlm_mle_detach_hb_events(dlm, mle); 3188c2cd4a44SSunil Mushran __dlm_put_mle(mle); 3189c2cd4a44SSunil Mushran } 3190c2cd4a44SSunil Mushran } 31916714d8e8SKurt Hackel 31926714d8e8SKurt Hackel void dlm_clean_master_list(struct dlm_ctxt *dlm, u8 dead_node) 31936714d8e8SKurt Hackel { 31942ed6c750SSunil Mushran struct dlm_master_list_entry *mle; 31956714d8e8SKurt Hackel struct dlm_lock_resource *res; 31962ed6c750SSunil Mushran struct hlist_head *bucket; 3197df53cd3bSDong Fang struct hlist_node *tmp; 31982ed6c750SSunil Mushran unsigned int i; 31996714d8e8SKurt Hackel 3200ef6b689bSTao Ma mlog(0, "dlm=%s, dead node=%u\n", dlm->name, dead_node); 32016714d8e8SKurt Hackel top: 32026714d8e8SKurt Hackel assert_spin_locked(&dlm->spinlock); 32036714d8e8SKurt Hackel 32046714d8e8SKurt Hackel /* clean the master list */ 32056714d8e8SKurt Hackel spin_lock(&dlm->master_lock); 32062ed6c750SSunil Mushran for (i = 0; i < DLM_HASH_BUCKETS; i++) { 32072ed6c750SSunil Mushran bucket = dlm_master_hash(dlm, i); 3208df53cd3bSDong Fang hlist_for_each_entry_safe(mle, tmp, bucket, master_hash_node) { 32096714d8e8SKurt Hackel BUG_ON(mle->type != DLM_MLE_BLOCK && 32106714d8e8SKurt Hackel mle->type != DLM_MLE_MASTER && 32116714d8e8SKurt Hackel mle->type != DLM_MLE_MIGRATION); 32126714d8e8SKurt Hackel 321367ae1f06SSunil Mushran /* MASTER mles are initiated locally. The waiting 321467ae1f06SSunil Mushran * process will notice the node map change shortly. 321567ae1f06SSunil Mushran * Let that happen as normal. */ 32166714d8e8SKurt Hackel if (mle->type == DLM_MLE_MASTER) 32176714d8e8SKurt Hackel continue; 32186714d8e8SKurt Hackel 321967ae1f06SSunil Mushran /* BLOCK mles are initiated by other nodes. Need to 322067ae1f06SSunil Mushran * clean up if the dead node would have been the 322167ae1f06SSunil Mushran * master. */ 32226714d8e8SKurt Hackel if (mle->type == DLM_MLE_BLOCK) { 3223c2cd4a44SSunil Mushran dlm_clean_block_mle(dlm, mle, dead_node); 32246714d8e8SKurt Hackel continue; 32256714d8e8SKurt Hackel } 32266714d8e8SKurt Hackel 322767ae1f06SSunil Mushran /* Everything else is a MIGRATION mle */ 32286714d8e8SKurt Hackel 322967ae1f06SSunil Mushran /* The rule for MIGRATION mles is that the master 323067ae1f06SSunil Mushran * becomes UNKNOWN if *either* the original or the new 323167ae1f06SSunil Mushran * master dies. All UNKNOWN lockres' are sent to 323267ae1f06SSunil Mushran * whichever node becomes the recovery master. The new 323367ae1f06SSunil Mushran * master is responsible for determining if there is 323467ae1f06SSunil Mushran * still a master for this lockres, or if he needs to 323567ae1f06SSunil Mushran * take over mastery. Either way, this node should 323667ae1f06SSunil Mushran * expect another message to resolve this. */ 323767ae1f06SSunil Mushran 32386714d8e8SKurt Hackel if (mle->master != dead_node && 32396714d8e8SKurt Hackel mle->new_master != dead_node) 32406714d8e8SKurt Hackel continue; 32416714d8e8SKurt Hackel 324267ae1f06SSunil Mushran /* If we have reached this point, this mle needs to be 324367ae1f06SSunil Mushran * removed from the list and freed. */ 3244c2cd4a44SSunil Mushran dlm_clean_migration_mle(dlm, mle); 32456714d8e8SKurt Hackel 3246aa852354SKurt Hackel mlog(0, "%s: node %u died during migration from " 324767ae1f06SSunil Mushran "%u to %u!\n", dlm->name, dead_node, mle->master, 324867ae1f06SSunil Mushran mle->new_master); 3249c2cd4a44SSunil Mushran 3250c2cd4a44SSunil Mushran /* If we find a lockres associated with the mle, we've 3251c2cd4a44SSunil Mushran * hit this rare case that messes up our lock ordering. 3252c2cd4a44SSunil Mushran * If so, we need to drop the master lock so that we can 3253c2cd4a44SSunil Mushran * take the lockres lock, meaning that we will have to 32546714d8e8SKurt Hackel * restart from the head of list. */ 3255c2cd4a44SSunil Mushran res = dlm_reset_mleres_owner(dlm, mle); 3256c2cd4a44SSunil Mushran if (res) 32576714d8e8SKurt Hackel /* restart */ 32586714d8e8SKurt Hackel goto top; 32596714d8e8SKurt Hackel 326067ae1f06SSunil Mushran /* This may be the last reference */ 32616714d8e8SKurt Hackel __dlm_put_mle(mle); 32626714d8e8SKurt Hackel } 32632ed6c750SSunil Mushran } 32646714d8e8SKurt Hackel spin_unlock(&dlm->master_lock); 32656714d8e8SKurt Hackel } 32666714d8e8SKurt Hackel 32676714d8e8SKurt Hackel int dlm_finish_migration(struct dlm_ctxt *dlm, struct dlm_lock_resource *res, 32686714d8e8SKurt Hackel u8 old_master) 32696714d8e8SKurt Hackel { 32706714d8e8SKurt Hackel struct dlm_node_iter iter; 32716714d8e8SKurt Hackel int ret = 0; 32726714d8e8SKurt Hackel 32736714d8e8SKurt Hackel spin_lock(&dlm->spinlock); 32746714d8e8SKurt Hackel dlm_node_iter_init(dlm->domain_map, &iter); 32756714d8e8SKurt Hackel clear_bit(old_master, iter.node_map); 32766714d8e8SKurt Hackel clear_bit(dlm->node_num, iter.node_map); 32776714d8e8SKurt Hackel spin_unlock(&dlm->spinlock); 32786714d8e8SKurt Hackel 3279ba2bf218SKurt Hackel /* ownership of the lockres is changing. account for the 3280ba2bf218SKurt Hackel * mastery reference here since old_master will briefly have 3281ba2bf218SKurt Hackel * a reference after the migration completes */ 3282ba2bf218SKurt Hackel spin_lock(&res->spinlock); 32838d400b81SSunil Mushran dlm_lockres_set_refmap_bit(dlm, res, old_master); 3284ba2bf218SKurt Hackel spin_unlock(&res->spinlock); 3285ba2bf218SKurt Hackel 32866714d8e8SKurt Hackel mlog(0, "now time to do a migrate request to other nodes\n"); 32876714d8e8SKurt Hackel ret = dlm_do_migrate_request(dlm, res, old_master, 32886714d8e8SKurt Hackel dlm->node_num, &iter); 32896714d8e8SKurt Hackel if (ret < 0) { 32906714d8e8SKurt Hackel mlog_errno(ret); 32916714d8e8SKurt Hackel goto leave; 32926714d8e8SKurt Hackel } 32936714d8e8SKurt Hackel 32946714d8e8SKurt Hackel mlog(0, "doing assert master of %.*s to all except the original node\n", 32956714d8e8SKurt Hackel res->lockname.len, res->lockname.name); 32966714d8e8SKurt Hackel /* this call now finishes out the nodemap 32976714d8e8SKurt Hackel * even if one or more nodes die */ 3298ba2bf218SKurt Hackel ret = dlm_do_assert_master(dlm, res, iter.node_map, 32996714d8e8SKurt Hackel DLM_ASSERT_MASTER_FINISH_MIGRATION); 33006714d8e8SKurt Hackel if (ret < 0) { 33016714d8e8SKurt Hackel /* no longer need to retry. all living nodes contacted. */ 33026714d8e8SKurt Hackel mlog_errno(ret); 33036714d8e8SKurt Hackel ret = 0; 33046714d8e8SKurt Hackel } 33056714d8e8SKurt Hackel 33066714d8e8SKurt Hackel memset(iter.node_map, 0, sizeof(iter.node_map)); 33076714d8e8SKurt Hackel set_bit(old_master, iter.node_map); 33086714d8e8SKurt Hackel mlog(0, "doing assert master of %.*s back to %u\n", 33096714d8e8SKurt Hackel res->lockname.len, res->lockname.name, old_master); 3310ba2bf218SKurt Hackel ret = dlm_do_assert_master(dlm, res, iter.node_map, 33116714d8e8SKurt Hackel DLM_ASSERT_MASTER_FINISH_MIGRATION); 33126714d8e8SKurt Hackel if (ret < 0) { 33136714d8e8SKurt Hackel mlog(0, "assert master to original master failed " 33146714d8e8SKurt Hackel "with %d.\n", ret); 33156714d8e8SKurt Hackel /* the only nonzero status here would be because of 33166714d8e8SKurt Hackel * a dead original node. we're done. */ 33176714d8e8SKurt Hackel ret = 0; 33186714d8e8SKurt Hackel } 33196714d8e8SKurt Hackel 33206714d8e8SKurt Hackel /* all done, set the owner, clear the flag */ 33216714d8e8SKurt Hackel spin_lock(&res->spinlock); 33226714d8e8SKurt Hackel dlm_set_lockres_owner(dlm, res, dlm->node_num); 33236714d8e8SKurt Hackel res->state &= ~DLM_LOCK_RES_MIGRATING; 33246714d8e8SKurt Hackel spin_unlock(&res->spinlock); 33256714d8e8SKurt Hackel /* re-dirty it on the new master */ 33266714d8e8SKurt Hackel dlm_kick_thread(dlm, res); 33276714d8e8SKurt Hackel wake_up(&res->wq); 33286714d8e8SKurt Hackel leave: 33296714d8e8SKurt Hackel return ret; 33306714d8e8SKurt Hackel } 33316714d8e8SKurt Hackel 33326714d8e8SKurt Hackel /* 33336714d8e8SKurt Hackel * LOCKRES AST REFCOUNT 33346714d8e8SKurt Hackel * this is integral to migration 33356714d8e8SKurt Hackel */ 33366714d8e8SKurt Hackel 33376714d8e8SKurt Hackel /* for future intent to call an ast, reserve one ahead of time. 33386714d8e8SKurt Hackel * this should be called only after waiting on the lockres 33396714d8e8SKurt Hackel * with dlm_wait_on_lockres, and while still holding the 33406714d8e8SKurt Hackel * spinlock after the call. */ 33416714d8e8SKurt Hackel void __dlm_lockres_reserve_ast(struct dlm_lock_resource *res) 33426714d8e8SKurt Hackel { 33436714d8e8SKurt Hackel assert_spin_locked(&res->spinlock); 33446714d8e8SKurt Hackel if (res->state & DLM_LOCK_RES_MIGRATING) { 33456714d8e8SKurt Hackel __dlm_print_one_lock_resource(res); 33466714d8e8SKurt Hackel } 33476714d8e8SKurt Hackel BUG_ON(res->state & DLM_LOCK_RES_MIGRATING); 33486714d8e8SKurt Hackel 33496714d8e8SKurt Hackel atomic_inc(&res->asts_reserved); 33506714d8e8SKurt Hackel } 33516714d8e8SKurt Hackel 33526714d8e8SKurt Hackel /* 33536714d8e8SKurt Hackel * used to drop the reserved ast, either because it went unused, 33546714d8e8SKurt Hackel * or because the ast/bast was actually called. 33556714d8e8SKurt Hackel * 33566714d8e8SKurt Hackel * also, if there is a pending migration on this lockres, 33576714d8e8SKurt Hackel * and this was the last pending ast on the lockres, 33586714d8e8SKurt Hackel * atomically set the MIGRATING flag before we drop the lock. 33596714d8e8SKurt Hackel * this is how we ensure that migration can proceed with no 33606714d8e8SKurt Hackel * asts in progress. note that it is ok if the state of the 33616714d8e8SKurt Hackel * queues is such that a lock should be granted in the future 33626714d8e8SKurt Hackel * or that a bast should be fired, because the new master will 33636714d8e8SKurt Hackel * shuffle the lists on this lockres as soon as it is migrated. 33646714d8e8SKurt Hackel */ 33656714d8e8SKurt Hackel void dlm_lockres_release_ast(struct dlm_ctxt *dlm, 33666714d8e8SKurt Hackel struct dlm_lock_resource *res) 33676714d8e8SKurt Hackel { 33686714d8e8SKurt Hackel if (!atomic_dec_and_lock(&res->asts_reserved, &res->spinlock)) 33696714d8e8SKurt Hackel return; 33706714d8e8SKurt Hackel 33716714d8e8SKurt Hackel if (!res->migration_pending) { 33726714d8e8SKurt Hackel spin_unlock(&res->spinlock); 33736714d8e8SKurt Hackel return; 33746714d8e8SKurt Hackel } 33756714d8e8SKurt Hackel 33766714d8e8SKurt Hackel BUG_ON(res->state & DLM_LOCK_RES_MIGRATING); 33776714d8e8SKurt Hackel res->migration_pending = 0; 33786714d8e8SKurt Hackel res->state |= DLM_LOCK_RES_MIGRATING; 33796714d8e8SKurt Hackel spin_unlock(&res->spinlock); 33806714d8e8SKurt Hackel wake_up(&res->wq); 33816714d8e8SKurt Hackel wake_up(&dlm->migration_wq); 33826714d8e8SKurt Hackel } 33835dad6c39SSrinivas Eeda 33845dad6c39SSrinivas Eeda void dlm_force_free_mles(struct dlm_ctxt *dlm) 33855dad6c39SSrinivas Eeda { 33865dad6c39SSrinivas Eeda int i; 33875dad6c39SSrinivas Eeda struct hlist_head *bucket; 33885dad6c39SSrinivas Eeda struct dlm_master_list_entry *mle; 3389df53cd3bSDong Fang struct hlist_node *tmp; 33905dad6c39SSrinivas Eeda 33915dad6c39SSrinivas Eeda /* 33925dad6c39SSrinivas Eeda * We notified all other nodes that we are exiting the domain and 33935dad6c39SSrinivas Eeda * marked the dlm state to DLM_CTXT_LEAVING. If any mles are still 33945dad6c39SSrinivas Eeda * around we force free them and wake any processes that are waiting 33955dad6c39SSrinivas Eeda * on the mles 33965dad6c39SSrinivas Eeda */ 33975dad6c39SSrinivas Eeda spin_lock(&dlm->spinlock); 33985dad6c39SSrinivas Eeda spin_lock(&dlm->master_lock); 33995dad6c39SSrinivas Eeda 34005dad6c39SSrinivas Eeda BUG_ON(dlm->dlm_state != DLM_CTXT_LEAVING); 34015dad6c39SSrinivas Eeda BUG_ON((find_next_bit(dlm->domain_map, O2NM_MAX_NODES, 0) < O2NM_MAX_NODES)); 34025dad6c39SSrinivas Eeda 34035dad6c39SSrinivas Eeda for (i = 0; i < DLM_HASH_BUCKETS; i++) { 34045dad6c39SSrinivas Eeda bucket = dlm_master_hash(dlm, i); 3405df53cd3bSDong Fang hlist_for_each_entry_safe(mle, tmp, bucket, master_hash_node) { 34065dad6c39SSrinivas Eeda if (mle->type != DLM_MLE_BLOCK) { 34075dad6c39SSrinivas Eeda mlog(ML_ERROR, "bad mle: %p\n", mle); 34085dad6c39SSrinivas Eeda dlm_print_one_mle(mle); 34095dad6c39SSrinivas Eeda } 34105dad6c39SSrinivas Eeda atomic_set(&mle->woken, 1); 34115dad6c39SSrinivas Eeda wake_up(&mle->wq); 34125dad6c39SSrinivas Eeda 34135dad6c39SSrinivas Eeda __dlm_unlink_mle(dlm, mle); 34145dad6c39SSrinivas Eeda __dlm_mle_detach_hb_events(dlm, mle); 34155dad6c39SSrinivas Eeda __dlm_put_mle(mle); 34165dad6c39SSrinivas Eeda } 34175dad6c39SSrinivas Eeda } 34185dad6c39SSrinivas Eeda spin_unlock(&dlm->master_lock); 34195dad6c39SSrinivas Eeda spin_unlock(&dlm->spinlock); 34205dad6c39SSrinivas Eeda } 3421