recoverd.c 7.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333
  1. /******************************************************************************
  2. *******************************************************************************
  3. **
  4. ** Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
  5. ** Copyright (C) 2004-2011 Red Hat, Inc. All rights reserved.
  6. **
  7. ** This copyrighted material is made available to anyone wishing to use,
  8. ** modify, copy, or redistribute it subject to the terms and conditions
  9. ** of the GNU General Public License v.2.
  10. **
  11. *******************************************************************************
  12. ******************************************************************************/
  13. #include "dlm_internal.h"
  14. #include "lockspace.h"
  15. #include "member.h"
  16. #include "dir.h"
  17. #include "ast.h"
  18. #include "recover.h"
  19. #include "lowcomms.h"
  20. #include "lock.h"
  21. #include "requestqueue.h"
  22. #include "recoverd.h"
  23. /* If the start for which we're re-enabling locking (seq) has been superseded
  24. by a newer stop (ls_recover_seq), we need to leave locking disabled.
  25. We suspend dlm_recv threads here to avoid the race where dlm_recv a) sees
  26. locking stopped and b) adds a message to the requestqueue, but dlm_recoverd
  27. enables locking and clears the requestqueue between a and b. */
  28. static int enable_locking(struct dlm_ls *ls, uint64_t seq)
  29. {
  30. int error = -EINTR;
  31. down_write(&ls->ls_recv_active);
  32. spin_lock(&ls->ls_recover_lock);
  33. if (ls->ls_recover_seq == seq) {
  34. set_bit(LSFL_RUNNING, &ls->ls_flags);
  35. /* unblocks processes waiting to enter the dlm */
  36. up_write(&ls->ls_in_recovery);
  37. error = 0;
  38. }
  39. spin_unlock(&ls->ls_recover_lock);
  40. up_write(&ls->ls_recv_active);
  41. return error;
  42. }
  43. static int ls_recover(struct dlm_ls *ls, struct dlm_recover *rv)
  44. {
  45. unsigned long start;
  46. int error, neg = 0;
  47. log_debug(ls, "dlm_recover %llu", (unsigned long long)rv->seq);
  48. mutex_lock(&ls->ls_recoverd_active);
  49. dlm_callback_suspend(ls);
  50. dlm_clear_toss(ls);
  51. /*
  52. * This list of root rsb's will be the basis of most of the recovery
  53. * routines.
  54. */
  55. dlm_create_root_list(ls);
  56. /*
  57. * Add or remove nodes from the lockspace's ls_nodes list.
  58. */
  59. error = dlm_recover_members(ls, rv, &neg);
  60. if (error) {
  61. log_debug(ls, "dlm_recover_members error %d", error);
  62. goto fail;
  63. }
  64. dlm_recover_dir_nodeid(ls);
  65. ls->ls_recover_dir_sent_res = 0;
  66. ls->ls_recover_dir_sent_msg = 0;
  67. ls->ls_recover_locks_in = 0;
  68. dlm_set_recover_status(ls, DLM_RS_NODES);
  69. error = dlm_recover_members_wait(ls);
  70. if (error) {
  71. log_debug(ls, "dlm_recover_members_wait error %d", error);
  72. goto fail;
  73. }
  74. start = jiffies;
  75. /*
  76. * Rebuild our own share of the directory by collecting from all other
  77. * nodes their master rsb names that hash to us.
  78. */
  79. error = dlm_recover_directory(ls);
  80. if (error) {
  81. log_debug(ls, "dlm_recover_directory error %d", error);
  82. goto fail;
  83. }
  84. dlm_set_recover_status(ls, DLM_RS_DIR);
  85. error = dlm_recover_directory_wait(ls);
  86. if (error) {
  87. log_debug(ls, "dlm_recover_directory_wait error %d", error);
  88. goto fail;
  89. }
  90. log_debug(ls, "dlm_recover_directory %u out %u messages",
  91. ls->ls_recover_dir_sent_res, ls->ls_recover_dir_sent_msg);
  92. /*
  93. * We may have outstanding operations that are waiting for a reply from
  94. * a failed node. Mark these to be resent after recovery. Unlock and
  95. * cancel ops can just be completed.
  96. */
  97. dlm_recover_waiters_pre(ls);
  98. error = dlm_recovery_stopped(ls);
  99. if (error)
  100. goto fail;
  101. if (neg || dlm_no_directory(ls)) {
  102. /*
  103. * Clear lkb's for departed nodes.
  104. */
  105. dlm_recover_purge(ls);
  106. /*
  107. * Get new master nodeid's for rsb's that were mastered on
  108. * departed nodes.
  109. */
  110. error = dlm_recover_masters(ls);
  111. if (error) {
  112. log_debug(ls, "dlm_recover_masters error %d", error);
  113. goto fail;
  114. }
  115. /*
  116. * Send our locks on remastered rsb's to the new masters.
  117. */
  118. error = dlm_recover_locks(ls);
  119. if (error) {
  120. log_debug(ls, "dlm_recover_locks error %d", error);
  121. goto fail;
  122. }
  123. dlm_set_recover_status(ls, DLM_RS_LOCKS);
  124. error = dlm_recover_locks_wait(ls);
  125. if (error) {
  126. log_debug(ls, "dlm_recover_locks_wait error %d", error);
  127. goto fail;
  128. }
  129. log_debug(ls, "dlm_recover_locks %u in",
  130. ls->ls_recover_locks_in);
  131. /*
  132. * Finalize state in master rsb's now that all locks can be
  133. * checked. This includes conversion resolution and lvb
  134. * settings.
  135. */
  136. dlm_recover_rsbs(ls);
  137. } else {
  138. /*
  139. * Other lockspace members may be going through the "neg" steps
  140. * while also adding us to the lockspace, in which case they'll
  141. * be doing the recover_locks (RS_LOCKS) barrier.
  142. */
  143. dlm_set_recover_status(ls, DLM_RS_LOCKS);
  144. error = dlm_recover_locks_wait(ls);
  145. if (error) {
  146. log_debug(ls, "dlm_recover_locks_wait error %d", error);
  147. goto fail;
  148. }
  149. }
  150. dlm_release_root_list(ls);
  151. /*
  152. * Purge directory-related requests that are saved in requestqueue.
  153. * All dir requests from before recovery are invalid now due to the dir
  154. * rebuild and will be resent by the requesting nodes.
  155. */
  156. dlm_purge_requestqueue(ls);
  157. dlm_set_recover_status(ls, DLM_RS_DONE);
  158. error = dlm_recover_done_wait(ls);
  159. if (error) {
  160. log_debug(ls, "dlm_recover_done_wait error %d", error);
  161. goto fail;
  162. }
  163. dlm_clear_members_gone(ls);
  164. dlm_adjust_timeouts(ls);
  165. dlm_callback_resume(ls);
  166. error = enable_locking(ls, rv->seq);
  167. if (error) {
  168. log_debug(ls, "enable_locking error %d", error);
  169. goto fail;
  170. }
  171. error = dlm_process_requestqueue(ls);
  172. if (error) {
  173. log_debug(ls, "dlm_process_requestqueue error %d", error);
  174. goto fail;
  175. }
  176. error = dlm_recover_waiters_post(ls);
  177. if (error) {
  178. log_debug(ls, "dlm_recover_waiters_post error %d", error);
  179. goto fail;
  180. }
  181. dlm_recover_grant(ls);
  182. log_debug(ls, "dlm_recover %llu generation %u done: %u ms",
  183. (unsigned long long)rv->seq, ls->ls_generation,
  184. jiffies_to_msecs(jiffies - start));
  185. mutex_unlock(&ls->ls_recoverd_active);
  186. dlm_lsop_recover_done(ls);
  187. return 0;
  188. fail:
  189. dlm_release_root_list(ls);
  190. log_debug(ls, "dlm_recover %llu error %d",
  191. (unsigned long long)rv->seq, error);
  192. mutex_unlock(&ls->ls_recoverd_active);
  193. return error;
  194. }
  195. /* The dlm_ls_start() that created the rv we take here may already have been
  196. stopped via dlm_ls_stop(); in that case we need to leave the RECOVERY_STOP
  197. flag set. */
  198. static void do_ls_recovery(struct dlm_ls *ls)
  199. {
  200. struct dlm_recover *rv = NULL;
  201. spin_lock(&ls->ls_recover_lock);
  202. rv = ls->ls_recover_args;
  203. ls->ls_recover_args = NULL;
  204. if (rv && ls->ls_recover_seq == rv->seq)
  205. clear_bit(LSFL_RECOVERY_STOP, &ls->ls_flags);
  206. spin_unlock(&ls->ls_recover_lock);
  207. if (rv) {
  208. ls_recover(ls, rv);
  209. kfree(rv->nodes);
  210. kfree(rv);
  211. }
  212. }
  213. static int dlm_recoverd(void *arg)
  214. {
  215. struct dlm_ls *ls;
  216. ls = dlm_find_lockspace_local(arg);
  217. if (!ls) {
  218. log_print("dlm_recoverd: no lockspace %p", arg);
  219. return -1;
  220. }
  221. while (!kthread_should_stop()) {
  222. set_current_state(TASK_INTERRUPTIBLE);
  223. if (!test_bit(LSFL_WORK, &ls->ls_flags))
  224. schedule();
  225. set_current_state(TASK_RUNNING);
  226. if (test_and_clear_bit(LSFL_WORK, &ls->ls_flags))
  227. do_ls_recovery(ls);
  228. }
  229. dlm_put_lockspace(ls);
  230. return 0;
  231. }
  232. void dlm_recoverd_kick(struct dlm_ls *ls)
  233. {
  234. set_bit(LSFL_WORK, &ls->ls_flags);
  235. wake_up_process(ls->ls_recoverd_task);
  236. }
  237. int dlm_recoverd_start(struct dlm_ls *ls)
  238. {
  239. struct task_struct *p;
  240. int error = 0;
  241. p = kthread_run(dlm_recoverd, ls, "dlm_recoverd");
  242. if (IS_ERR(p))
  243. error = PTR_ERR(p);
  244. else
  245. ls->ls_recoverd_task = p;
  246. return error;
  247. }
  248. void dlm_recoverd_stop(struct dlm_ls *ls)
  249. {
  250. kthread_stop(ls->ls_recoverd_task);
  251. }
  252. void dlm_recoverd_suspend(struct dlm_ls *ls)
  253. {
  254. wake_up(&ls->ls_wait_general);
  255. mutex_lock(&ls->ls_recoverd_active);
  256. }
  257. void dlm_recoverd_resume(struct dlm_ls *ls)
  258. {
  259. mutex_unlock(&ls->ls_recoverd_active);
  260. }