dlmunlock.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697
  1. /* -*- mode: c; c-basic-offset: 8; -*-
  2. * vim: noexpandtab sw=8 ts=8 sts=0:
  3. *
  4. * dlmunlock.c
  5. *
  6. * underlying calls for unlocking locks
  7. *
  8. * Copyright (C) 2004 Oracle. All rights reserved.
  9. *
  10. * This program is free software; you can redistribute it and/or
  11. * modify it under the terms of the GNU General Public
  12. * License as published by the Free Software Foundation; either
  13. * version 2 of the License, or (at your option) any later version.
  14. *
  15. * This program is distributed in the hope that it will be useful,
  16. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  18. * General Public License for more details.
  19. *
  20. * You should have received a copy of the GNU General Public
  21. * License along with this program; if not, write to the
  22. * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  23. * Boston, MA 021110-1307, USA.
  24. *
  25. */
  26. #include <linux/module.h>
  27. #include <linux/fs.h>
  28. #include <linux/types.h>
  29. #include <linux/slab.h>
  30. #include <linux/highmem.h>
  31. #include <linux/utsname.h>
  32. #include <linux/init.h>
  33. #include <linux/sysctl.h>
  34. #include <linux/random.h>
  35. #include <linux/blkdev.h>
  36. #include <linux/socket.h>
  37. #include <linux/inet.h>
  38. #include <linux/spinlock.h>
  39. #include <linux/delay.h>
  40. #include "cluster/heartbeat.h"
  41. #include "cluster/nodemanager.h"
  42. #include "cluster/tcp.h"
  43. #include "dlmapi.h"
  44. #include "dlmcommon.h"
  45. #define MLOG_MASK_PREFIX ML_DLM
  46. #include "cluster/masklog.h"
  47. #define DLM_UNLOCK_FREE_LOCK 0x00000001
  48. #define DLM_UNLOCK_CALL_AST 0x00000002
  49. #define DLM_UNLOCK_REMOVE_LOCK 0x00000004
  50. #define DLM_UNLOCK_REGRANT_LOCK 0x00000008
  51. #define DLM_UNLOCK_CLEAR_CONVERT_TYPE 0x00000010
  52. static enum dlm_status dlm_get_cancel_actions(struct dlm_ctxt *dlm,
  53. struct dlm_lock_resource *res,
  54. struct dlm_lock *lock,
  55. struct dlm_lockstatus *lksb,
  56. int *actions);
  57. static enum dlm_status dlm_get_unlock_actions(struct dlm_ctxt *dlm,
  58. struct dlm_lock_resource *res,
  59. struct dlm_lock *lock,
  60. struct dlm_lockstatus *lksb,
  61. int *actions);
  62. static enum dlm_status dlm_send_remote_unlock_request(struct dlm_ctxt *dlm,
  63. struct dlm_lock_resource *res,
  64. struct dlm_lock *lock,
  65. struct dlm_lockstatus *lksb,
  66. int flags,
  67. u8 owner);
  68. /*
  69. * according to the spec:
  70. * http://opendlm.sourceforge.net/cvsmirror/opendlm/docs/dlmbook_final.pdf
  71. *
  72. * flags & LKM_CANCEL != 0: must be converting or blocked
  73. * flags & LKM_CANCEL == 0: must be granted
  74. *
  75. * So to unlock a converting lock, you must first cancel the
  76. * convert (passing LKM_CANCEL in flags), then call the unlock
  77. * again (with no LKM_CANCEL in flags).
  78. */
  79. /*
  80. * locking:
  81. * caller needs: none
  82. * taken: res->spinlock and lock->spinlock taken and dropped
  83. * held on exit: none
  84. * returns: DLM_NORMAL, DLM_NOLOCKMGR, status from network
  85. * all callers should have taken an extra ref on lock coming in
  86. */
  87. static enum dlm_status dlmunlock_common(struct dlm_ctxt *dlm,
  88. struct dlm_lock_resource *res,
  89. struct dlm_lock *lock,
  90. struct dlm_lockstatus *lksb,
  91. int flags, int *call_ast,
  92. int master_node)
  93. {
  94. enum dlm_status status;
  95. int actions = 0;
  96. int in_use;
  97. u8 owner;
  98. mlog(0, "master_node = %d, valblk = %d\n", master_node,
  99. flags & LKM_VALBLK);
  100. if (master_node)
  101. BUG_ON(res->owner != dlm->node_num);
  102. else
  103. BUG_ON(res->owner == dlm->node_num);
  104. spin_lock(&dlm->spinlock);
  105. /* We want to be sure that we're not freeing a lock
  106. * that still has AST's pending... */
  107. in_use = !list_empty(&lock->ast_list);
  108. spin_unlock(&dlm->spinlock);
  109. if (in_use) {
  110. mlog(ML_ERROR, "lockres %.*s: Someone is calling dlmunlock "
  111. "while waiting for an ast!", res->lockname.len,
  112. res->lockname.name);
  113. return DLM_BADPARAM;
  114. }
  115. spin_lock(&res->spinlock);
  116. if (res->state & DLM_LOCK_RES_IN_PROGRESS) {
  117. if (master_node) {
  118. mlog(ML_ERROR, "lockres in progress!\n");
  119. spin_unlock(&res->spinlock);
  120. return DLM_FORWARD;
  121. }
  122. /* ok for this to sleep if not in a network handler */
  123. __dlm_wait_on_lockres(res);
  124. res->state |= DLM_LOCK_RES_IN_PROGRESS;
  125. }
  126. spin_lock(&lock->spinlock);
  127. if (res->state & DLM_LOCK_RES_RECOVERING) {
  128. status = DLM_RECOVERING;
  129. goto leave;
  130. }
  131. /* see above for what the spec says about
  132. * LKM_CANCEL and the lock queue state */
  133. if (flags & LKM_CANCEL)
  134. status = dlm_get_cancel_actions(dlm, res, lock, lksb, &actions);
  135. else
  136. status = dlm_get_unlock_actions(dlm, res, lock, lksb, &actions);
  137. if (status != DLM_NORMAL)
  138. goto leave;
  139. /* By now this has been masked out of cancel requests. */
  140. if (flags & LKM_VALBLK) {
  141. /* make the final update to the lvb */
  142. if (master_node)
  143. memcpy(res->lvb, lksb->lvb, DLM_LVB_LEN);
  144. else
  145. flags |= LKM_PUT_LVB; /* let the send function
  146. * handle it. */
  147. }
  148. if (!master_node) {
  149. owner = res->owner;
  150. /* drop locks and send message */
  151. if (flags & LKM_CANCEL)
  152. lock->cancel_pending = 1;
  153. else
  154. lock->unlock_pending = 1;
  155. spin_unlock(&lock->spinlock);
  156. spin_unlock(&res->spinlock);
  157. status = dlm_send_remote_unlock_request(dlm, res, lock, lksb,
  158. flags, owner);
  159. spin_lock(&res->spinlock);
  160. spin_lock(&lock->spinlock);
  161. /* if the master told us the lock was already granted,
  162. * let the ast handle all of these actions */
  163. if (status == DLM_NORMAL &&
  164. lksb->status == DLM_CANCELGRANT) {
  165. actions &= ~(DLM_UNLOCK_REMOVE_LOCK|
  166. DLM_UNLOCK_REGRANT_LOCK|
  167. DLM_UNLOCK_CLEAR_CONVERT_TYPE);
  168. } else if (status == DLM_RECOVERING ||
  169. status == DLM_MIGRATING ||
  170. status == DLM_FORWARD) {
  171. /* must clear the actions because this unlock
  172. * is about to be retried. cannot free or do
  173. * any list manipulation. */
  174. mlog(0, "%s:%.*s: clearing actions, %s\n",
  175. dlm->name, res->lockname.len,
  176. res->lockname.name,
  177. status==DLM_RECOVERING?"recovering":
  178. (status==DLM_MIGRATING?"migrating":
  179. "forward"));
  180. actions = 0;
  181. }
  182. if (flags & LKM_CANCEL)
  183. lock->cancel_pending = 0;
  184. else
  185. lock->unlock_pending = 0;
  186. }
  187. /* get an extra ref on lock. if we are just switching
  188. * lists here, we dont want the lock to go away. */
  189. dlm_lock_get(lock);
  190. if (actions & DLM_UNLOCK_REMOVE_LOCK) {
  191. list_del_init(&lock->list);
  192. dlm_lock_put(lock);
  193. }
  194. if (actions & DLM_UNLOCK_REGRANT_LOCK) {
  195. dlm_lock_get(lock);
  196. list_add_tail(&lock->list, &res->granted);
  197. }
  198. if (actions & DLM_UNLOCK_CLEAR_CONVERT_TYPE) {
  199. mlog(0, "clearing convert_type at %smaster node\n",
  200. master_node ? "" : "non-");
  201. lock->ml.convert_type = LKM_IVMODE;
  202. }
  203. /* remove the extra ref on lock */
  204. dlm_lock_put(lock);
  205. leave:
  206. res->state &= ~DLM_LOCK_RES_IN_PROGRESS;
  207. if (!dlm_lock_on_list(&res->converting, lock))
  208. BUG_ON(lock->ml.convert_type != LKM_IVMODE);
  209. else
  210. BUG_ON(lock->ml.convert_type == LKM_IVMODE);
  211. spin_unlock(&lock->spinlock);
  212. spin_unlock(&res->spinlock);
  213. wake_up(&res->wq);
  214. /* let the caller's final dlm_lock_put handle the actual kfree */
  215. if (actions & DLM_UNLOCK_FREE_LOCK) {
  216. /* this should always be coupled with list removal */
  217. BUG_ON(!(actions & DLM_UNLOCK_REMOVE_LOCK));
  218. mlog(0, "lock %u:%llu should be gone now! refs=%d\n",
  219. dlm_get_lock_cookie_node(lock->ml.cookie),
  220. dlm_get_lock_cookie_seq(lock->ml.cookie),
  221. atomic_read(&lock->lock_refs.refcount)-1);
  222. dlm_lock_put(lock);
  223. }
  224. if (actions & DLM_UNLOCK_CALL_AST)
  225. *call_ast = 1;
  226. /* if cancel or unlock succeeded, lvb work is done */
  227. if (status == DLM_NORMAL)
  228. lksb->flags &= ~(DLM_LKSB_PUT_LVB|DLM_LKSB_GET_LVB);
  229. return status;
  230. }
  231. void dlm_commit_pending_unlock(struct dlm_lock_resource *res,
  232. struct dlm_lock *lock)
  233. {
  234. /* leave DLM_LKSB_PUT_LVB on the lksb so any final
  235. * update of the lvb will be sent to the new master */
  236. list_del_init(&lock->list);
  237. }
  238. void dlm_commit_pending_cancel(struct dlm_lock_resource *res,
  239. struct dlm_lock *lock)
  240. {
  241. list_move_tail(&lock->list, &res->granted);
  242. lock->ml.convert_type = LKM_IVMODE;
  243. }
  244. static inline enum dlm_status dlmunlock_master(struct dlm_ctxt *dlm,
  245. struct dlm_lock_resource *res,
  246. struct dlm_lock *lock,
  247. struct dlm_lockstatus *lksb,
  248. int flags,
  249. int *call_ast)
  250. {
  251. return dlmunlock_common(dlm, res, lock, lksb, flags, call_ast, 1);
  252. }
  253. static inline enum dlm_status dlmunlock_remote(struct dlm_ctxt *dlm,
  254. struct dlm_lock_resource *res,
  255. struct dlm_lock *lock,
  256. struct dlm_lockstatus *lksb,
  257. int flags, int *call_ast)
  258. {
  259. return dlmunlock_common(dlm, res, lock, lksb, flags, call_ast, 0);
  260. }
  261. /*
  262. * locking:
  263. * caller needs: none
  264. * taken: none
  265. * held on exit: none
  266. * returns: DLM_NORMAL, DLM_NOLOCKMGR, status from network
  267. */
  268. static enum dlm_status dlm_send_remote_unlock_request(struct dlm_ctxt *dlm,
  269. struct dlm_lock_resource *res,
  270. struct dlm_lock *lock,
  271. struct dlm_lockstatus *lksb,
  272. int flags,
  273. u8 owner)
  274. {
  275. struct dlm_unlock_lock unlock;
  276. int tmpret;
  277. enum dlm_status ret;
  278. int status = 0;
  279. struct kvec vec[2];
  280. size_t veclen = 1;
  281. mlog_entry("%.*s\n", res->lockname.len, res->lockname.name);
  282. if (owner == dlm->node_num) {
  283. /* ended up trying to contact ourself. this means
  284. * that the lockres had been remote but became local
  285. * via a migration. just retry it, now as local */
  286. mlog(0, "%s:%.*s: this node became the master due to a "
  287. "migration, re-evaluate now\n", dlm->name,
  288. res->lockname.len, res->lockname.name);
  289. return DLM_FORWARD;
  290. }
  291. memset(&unlock, 0, sizeof(unlock));
  292. unlock.node_idx = dlm->node_num;
  293. unlock.flags = cpu_to_be32(flags);
  294. unlock.cookie = lock->ml.cookie;
  295. unlock.namelen = res->lockname.len;
  296. memcpy(unlock.name, res->lockname.name, unlock.namelen);
  297. vec[0].iov_len = sizeof(struct dlm_unlock_lock);
  298. vec[0].iov_base = &unlock;
  299. if (flags & LKM_PUT_LVB) {
  300. /* extra data to send if we are updating lvb */
  301. vec[1].iov_len = DLM_LVB_LEN;
  302. vec[1].iov_base = lock->lksb->lvb;
  303. veclen++;
  304. }
  305. tmpret = o2net_send_message_vec(DLM_UNLOCK_LOCK_MSG, dlm->key,
  306. vec, veclen, owner, &status);
  307. if (tmpret >= 0) {
  308. // successfully sent and received
  309. if (status == DLM_CANCELGRANT)
  310. ret = DLM_NORMAL;
  311. else if (status == DLM_FORWARD) {
  312. mlog(0, "master was in-progress. retry\n");
  313. ret = DLM_FORWARD;
  314. } else
  315. ret = status;
  316. lksb->status = status;
  317. } else {
  318. mlog_errno(tmpret);
  319. if (dlm_is_host_down(tmpret)) {
  320. /* NOTE: this seems strange, but it is what we want.
  321. * when the master goes down during a cancel or
  322. * unlock, the recovery code completes the operation
  323. * as if the master had not died, then passes the
  324. * updated state to the recovery master. this thread
  325. * just needs to finish out the operation and call
  326. * the unlockast. */
  327. ret = DLM_NORMAL;
  328. } else {
  329. /* something bad. this will BUG in ocfs2 */
  330. ret = dlm_err_to_dlm_status(tmpret);
  331. }
  332. lksb->status = ret;
  333. }
  334. return ret;
  335. }
  336. /*
  337. * locking:
  338. * caller needs: none
  339. * taken: takes and drops res->spinlock
  340. * held on exit: none
  341. * returns: DLM_NORMAL, DLM_BADARGS, DLM_IVLOCKID,
  342. * return value from dlmunlock_master
  343. */
  344. int dlm_unlock_lock_handler(struct o2net_msg *msg, u32 len, void *data)
  345. {
  346. struct dlm_ctxt *dlm = data;
  347. struct dlm_unlock_lock *unlock = (struct dlm_unlock_lock *)msg->buf;
  348. struct dlm_lock_resource *res = NULL;
  349. struct list_head *iter;
  350. struct dlm_lock *lock = NULL;
  351. enum dlm_status status = DLM_NORMAL;
  352. int found = 0, i;
  353. struct dlm_lockstatus *lksb = NULL;
  354. int ignore;
  355. u32 flags;
  356. struct list_head *queue;
  357. flags = be32_to_cpu(unlock->flags);
  358. if (flags & LKM_GET_LVB) {
  359. mlog(ML_ERROR, "bad args! GET_LVB specified on unlock!\n");
  360. return DLM_BADARGS;
  361. }
  362. if ((flags & (LKM_PUT_LVB|LKM_CANCEL)) == (LKM_PUT_LVB|LKM_CANCEL)) {
  363. mlog(ML_ERROR, "bad args! cannot modify lvb on a CANCEL "
  364. "request!\n");
  365. return DLM_BADARGS;
  366. }
  367. if (unlock->namelen > DLM_LOCKID_NAME_MAX) {
  368. mlog(ML_ERROR, "Invalid name length in unlock handler!\n");
  369. return DLM_IVBUFLEN;
  370. }
  371. if (!dlm_grab(dlm))
  372. return DLM_REJECTED;
  373. mlog_bug_on_msg(!dlm_domain_fully_joined(dlm),
  374. "Domain %s not fully joined!\n", dlm->name);
  375. mlog(0, "lvb: %s\n", flags & LKM_PUT_LVB ? "put lvb" : "none");
  376. res = dlm_lookup_lockres(dlm, unlock->name, unlock->namelen);
  377. if (!res) {
  378. /* We assume here that a no lock resource simply means
  379. * it was migrated away and destroyed before the other
  380. * node could detect it. */
  381. mlog(0, "returning DLM_FORWARD -- res no longer exists\n");
  382. status = DLM_FORWARD;
  383. goto not_found;
  384. }
  385. queue=&res->granted;
  386. found = 0;
  387. spin_lock(&res->spinlock);
  388. if (res->state & DLM_LOCK_RES_RECOVERING) {
  389. spin_unlock(&res->spinlock);
  390. mlog(0, "returning DLM_RECOVERING\n");
  391. status = DLM_RECOVERING;
  392. goto leave;
  393. }
  394. if (res->state & DLM_LOCK_RES_MIGRATING) {
  395. spin_unlock(&res->spinlock);
  396. mlog(0, "returning DLM_MIGRATING\n");
  397. status = DLM_MIGRATING;
  398. goto leave;
  399. }
  400. if (res->owner != dlm->node_num) {
  401. spin_unlock(&res->spinlock);
  402. mlog(0, "returning DLM_FORWARD -- not master\n");
  403. status = DLM_FORWARD;
  404. goto leave;
  405. }
  406. for (i=0; i<3; i++) {
  407. list_for_each(iter, queue) {
  408. lock = list_entry(iter, struct dlm_lock, list);
  409. if (lock->ml.cookie == unlock->cookie &&
  410. lock->ml.node == unlock->node_idx) {
  411. dlm_lock_get(lock);
  412. found = 1;
  413. break;
  414. }
  415. }
  416. if (found)
  417. break;
  418. /* scan granted -> converting -> blocked queues */
  419. queue++;
  420. }
  421. spin_unlock(&res->spinlock);
  422. if (!found) {
  423. status = DLM_IVLOCKID;
  424. goto not_found;
  425. }
  426. /* lock was found on queue */
  427. lksb = lock->lksb;
  428. /* unlockast only called on originating node */
  429. if (flags & LKM_PUT_LVB) {
  430. lksb->flags |= DLM_LKSB_PUT_LVB;
  431. memcpy(&lksb->lvb[0], &unlock->lvb[0], DLM_LVB_LEN);
  432. }
  433. /* if this is in-progress, propagate the DLM_FORWARD
  434. * all the way back out */
  435. status = dlmunlock_master(dlm, res, lock, lksb, flags, &ignore);
  436. if (status == DLM_FORWARD)
  437. mlog(0, "lockres is in progress\n");
  438. if (flags & LKM_PUT_LVB)
  439. lksb->flags &= ~DLM_LKSB_PUT_LVB;
  440. dlm_lockres_calc_usage(dlm, res);
  441. dlm_kick_thread(dlm, res);
  442. not_found:
  443. if (!found)
  444. mlog(ML_ERROR, "failed to find lock to unlock! "
  445. "cookie=%u:%llu\n",
  446. dlm_get_lock_cookie_node(unlock->cookie),
  447. dlm_get_lock_cookie_seq(unlock->cookie));
  448. else {
  449. /* send the lksb->status back to the other node */
  450. status = lksb->status;
  451. dlm_lock_put(lock);
  452. }
  453. leave:
  454. if (res)
  455. dlm_lockres_put(res);
  456. dlm_put(dlm);
  457. return status;
  458. }
  459. static enum dlm_status dlm_get_cancel_actions(struct dlm_ctxt *dlm,
  460. struct dlm_lock_resource *res,
  461. struct dlm_lock *lock,
  462. struct dlm_lockstatus *lksb,
  463. int *actions)
  464. {
  465. enum dlm_status status;
  466. if (dlm_lock_on_list(&res->blocked, lock)) {
  467. /* cancel this outright */
  468. lksb->status = DLM_NORMAL;
  469. status = DLM_NORMAL;
  470. *actions = (DLM_UNLOCK_CALL_AST |
  471. DLM_UNLOCK_REMOVE_LOCK);
  472. } else if (dlm_lock_on_list(&res->converting, lock)) {
  473. /* cancel the request, put back on granted */
  474. lksb->status = DLM_NORMAL;
  475. status = DLM_NORMAL;
  476. *actions = (DLM_UNLOCK_CALL_AST |
  477. DLM_UNLOCK_REMOVE_LOCK |
  478. DLM_UNLOCK_REGRANT_LOCK |
  479. DLM_UNLOCK_CLEAR_CONVERT_TYPE);
  480. } else if (dlm_lock_on_list(&res->granted, lock)) {
  481. /* too late, already granted. DLM_CANCELGRANT */
  482. lksb->status = DLM_CANCELGRANT;
  483. status = DLM_NORMAL;
  484. *actions = DLM_UNLOCK_CALL_AST;
  485. } else {
  486. mlog(ML_ERROR, "lock to cancel is not on any list!\n");
  487. lksb->status = DLM_IVLOCKID;
  488. status = DLM_IVLOCKID;
  489. *actions = 0;
  490. }
  491. return status;
  492. }
  493. static enum dlm_status dlm_get_unlock_actions(struct dlm_ctxt *dlm,
  494. struct dlm_lock_resource *res,
  495. struct dlm_lock *lock,
  496. struct dlm_lockstatus *lksb,
  497. int *actions)
  498. {
  499. enum dlm_status status;
  500. /* unlock request */
  501. if (!dlm_lock_on_list(&res->granted, lock)) {
  502. lksb->status = DLM_DENIED;
  503. status = DLM_DENIED;
  504. dlm_error(status);
  505. *actions = 0;
  506. } else {
  507. /* unlock granted lock */
  508. lksb->status = DLM_NORMAL;
  509. status = DLM_NORMAL;
  510. *actions = (DLM_UNLOCK_FREE_LOCK |
  511. DLM_UNLOCK_CALL_AST |
  512. DLM_UNLOCK_REMOVE_LOCK);
  513. }
  514. return status;
  515. }
  516. /* there seems to be no point in doing this async
  517. * since (even for the remote case) there is really
  518. * no work to queue up... so just do it and fire the
  519. * unlockast by hand when done... */
  520. enum dlm_status dlmunlock(struct dlm_ctxt *dlm, struct dlm_lockstatus *lksb,
  521. int flags, dlm_astunlockfunc_t *unlockast, void *data)
  522. {
  523. enum dlm_status status;
  524. struct dlm_lock_resource *res;
  525. struct dlm_lock *lock = NULL;
  526. int call_ast, is_master;
  527. mlog_entry_void();
  528. if (!lksb) {
  529. dlm_error(DLM_BADARGS);
  530. return DLM_BADARGS;
  531. }
  532. if (flags & ~(LKM_CANCEL | LKM_VALBLK | LKM_INVVALBLK)) {
  533. dlm_error(DLM_BADPARAM);
  534. return DLM_BADPARAM;
  535. }
  536. if ((flags & (LKM_VALBLK | LKM_CANCEL)) == (LKM_VALBLK | LKM_CANCEL)) {
  537. mlog(0, "VALBLK given with CANCEL: ignoring VALBLK\n");
  538. flags &= ~LKM_VALBLK;
  539. }
  540. if (!lksb->lockid || !lksb->lockid->lockres) {
  541. dlm_error(DLM_BADPARAM);
  542. return DLM_BADPARAM;
  543. }
  544. lock = lksb->lockid;
  545. BUG_ON(!lock);
  546. dlm_lock_get(lock);
  547. res = lock->lockres;
  548. BUG_ON(!res);
  549. dlm_lockres_get(res);
  550. retry:
  551. call_ast = 0;
  552. /* need to retry up here because owner may have changed */
  553. mlog(0, "lock=%p res=%p\n", lock, res);
  554. spin_lock(&res->spinlock);
  555. is_master = (res->owner == dlm->node_num);
  556. spin_unlock(&res->spinlock);
  557. if (is_master) {
  558. status = dlmunlock_master(dlm, res, lock, lksb, flags,
  559. &call_ast);
  560. mlog(0, "done calling dlmunlock_master: returned %d, "
  561. "call_ast is %d\n", status, call_ast);
  562. } else {
  563. status = dlmunlock_remote(dlm, res, lock, lksb, flags,
  564. &call_ast);
  565. mlog(0, "done calling dlmunlock_remote: returned %d, "
  566. "call_ast is %d\n", status, call_ast);
  567. }
  568. if (status == DLM_RECOVERING ||
  569. status == DLM_MIGRATING ||
  570. status == DLM_FORWARD) {
  571. /* We want to go away for a tiny bit to allow recovery
  572. * / migration to complete on this resource. I don't
  573. * know of any wait queue we could sleep on as this
  574. * may be happening on another node. Perhaps the
  575. * proper solution is to queue up requests on the
  576. * other end? */
  577. /* do we want to yield(); ?? */
  578. msleep(50);
  579. mlog(0, "retrying unlock due to pending recovery/"
  580. "migration/in-progress\n");
  581. goto retry;
  582. }
  583. if (call_ast) {
  584. mlog(0, "calling unlockast(%p, %d)\n", data, lksb->status);
  585. if (is_master) {
  586. /* it is possible that there is one last bast
  587. * pending. make sure it is flushed, then
  588. * call the unlockast.
  589. * not an issue if this is a mastered remotely,
  590. * since this lock has been removed from the
  591. * lockres queues and cannot be found. */
  592. dlm_kick_thread(dlm, NULL);
  593. wait_event(dlm->ast_wq,
  594. dlm_lock_basts_flushed(dlm, lock));
  595. }
  596. (*unlockast)(data, lksb->status);
  597. }
  598. if (status == DLM_NORMAL) {
  599. mlog(0, "kicking the thread\n");
  600. dlm_kick_thread(dlm, res);
  601. } else
  602. dlm_error(status);
  603. dlm_lockres_calc_usage(dlm, res);
  604. dlm_lockres_put(res);
  605. dlm_lock_put(lock);
  606. mlog(0, "returning status=%d!\n", status);
  607. return status;
  608. }
  609. EXPORT_SYMBOL_GPL(dlmunlock);