recoverd.c 8.8 KB

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