requestqueue.c 5.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /******************************************************************************
  3. *******************************************************************************
  4. **
  5. ** Copyright (C) 2005-2007 Red Hat, Inc. All rights reserved.
  6. **
  7. **
  8. *******************************************************************************
  9. ******************************************************************************/
  10. #include "dlm_internal.h"
  11. #include "member.h"
  12. #include "lock.h"
  13. #include "dir.h"
  14. #include "config.h"
  15. #include "requestqueue.h"
  16. #include "util.h"
  17. struct rq_entry {
  18. struct list_head list;
  19. uint32_t recover_seq;
  20. int nodeid;
  21. struct dlm_message request;
  22. };
  23. /*
  24. * Requests received while the lockspace is in recovery get added to the
  25. * request queue and processed when recovery is complete. This happens when
  26. * the lockspace is suspended on some nodes before it is on others, or the
  27. * lockspace is enabled on some while still suspended on others.
  28. */
  29. void dlm_add_requestqueue(struct dlm_ls *ls, int nodeid, struct dlm_message *ms)
  30. {
  31. struct rq_entry *e;
  32. int length = le16_to_cpu(ms->m_header.h_length) -
  33. sizeof(struct dlm_message);
  34. e = kmalloc(sizeof(struct rq_entry) + length, GFP_NOFS);
  35. if (!e) {
  36. log_print("dlm_add_requestqueue: out of memory len %d", length);
  37. return;
  38. }
  39. e->recover_seq = ls->ls_recover_seq & 0xFFFFFFFF;
  40. e->nodeid = nodeid;
  41. memcpy(&e->request, ms, le16_to_cpu(ms->m_header.h_length));
  42. atomic_inc(&ls->ls_requestqueue_cnt);
  43. mutex_lock(&ls->ls_requestqueue_mutex);
  44. list_add_tail(&e->list, &ls->ls_requestqueue);
  45. mutex_unlock(&ls->ls_requestqueue_mutex);
  46. }
  47. /*
  48. * Called by dlm_recoverd to process normal messages saved while recovery was
  49. * happening. Normal locking has been enabled before this is called. dlm_recv
  50. * upon receiving a message, will wait for all saved messages to be drained
  51. * here before processing the message it got. If a new dlm_ls_stop() arrives
  52. * while we're processing these saved messages, it may block trying to suspend
  53. * dlm_recv if dlm_recv is waiting for us in dlm_wait_requestqueue. In that
  54. * case, we don't abort since locking_stopped is still 0. If dlm_recv is not
  55. * waiting for us, then this processing may be aborted due to locking_stopped.
  56. */
  57. int dlm_process_requestqueue(struct dlm_ls *ls)
  58. {
  59. struct rq_entry *e;
  60. struct dlm_message *ms;
  61. int error = 0;
  62. mutex_lock(&ls->ls_requestqueue_mutex);
  63. for (;;) {
  64. if (list_empty(&ls->ls_requestqueue)) {
  65. mutex_unlock(&ls->ls_requestqueue_mutex);
  66. error = 0;
  67. break;
  68. }
  69. e = list_entry(ls->ls_requestqueue.next, struct rq_entry, list);
  70. mutex_unlock(&ls->ls_requestqueue_mutex);
  71. ms = &e->request;
  72. log_limit(ls, "dlm_process_requestqueue msg %d from %d "
  73. "lkid %x remid %x result %d seq %u",
  74. le32_to_cpu(ms->m_type),
  75. le32_to_cpu(ms->m_header.h_nodeid),
  76. le32_to_cpu(ms->m_lkid), le32_to_cpu(ms->m_remid),
  77. from_dlm_errno(le32_to_cpu(ms->m_result)),
  78. e->recover_seq);
  79. dlm_receive_message_saved(ls, &e->request, e->recover_seq);
  80. mutex_lock(&ls->ls_requestqueue_mutex);
  81. list_del(&e->list);
  82. if (atomic_dec_and_test(&ls->ls_requestqueue_cnt))
  83. wake_up(&ls->ls_requestqueue_wait);
  84. kfree(e);
  85. if (dlm_locking_stopped(ls)) {
  86. log_debug(ls, "process_requestqueue abort running");
  87. mutex_unlock(&ls->ls_requestqueue_mutex);
  88. error = -EINTR;
  89. break;
  90. }
  91. schedule();
  92. }
  93. return error;
  94. }
  95. /*
  96. * After recovery is done, locking is resumed and dlm_recoverd takes all the
  97. * saved requests and processes them as they would have been by dlm_recv. At
  98. * the same time, dlm_recv will start receiving new requests from remote nodes.
  99. * We want to delay dlm_recv processing new requests until dlm_recoverd has
  100. * finished processing the old saved requests. We don't check for locking
  101. * stopped here because dlm_ls_stop won't stop locking until it's suspended us
  102. * (dlm_recv).
  103. */
  104. void dlm_wait_requestqueue(struct dlm_ls *ls)
  105. {
  106. wait_event(ls->ls_requestqueue_wait,
  107. atomic_read(&ls->ls_requestqueue_cnt) == 0);
  108. }
  109. static int purge_request(struct dlm_ls *ls, struct dlm_message *ms, int nodeid)
  110. {
  111. __le32 type = ms->m_type;
  112. /* the ls is being cleaned up and freed by release_lockspace */
  113. if (!atomic_read(&ls->ls_count))
  114. return 1;
  115. if (dlm_is_removed(ls, nodeid))
  116. return 1;
  117. /* directory operations are always purged because the directory is
  118. always rebuilt during recovery and the lookups resent */
  119. if (type == cpu_to_le32(DLM_MSG_REMOVE) ||
  120. type == cpu_to_le32(DLM_MSG_LOOKUP) ||
  121. type == cpu_to_le32(DLM_MSG_LOOKUP_REPLY))
  122. return 1;
  123. if (!dlm_no_directory(ls))
  124. return 0;
  125. return 1;
  126. }
  127. void dlm_purge_requestqueue(struct dlm_ls *ls)
  128. {
  129. struct dlm_message *ms;
  130. struct rq_entry *e, *safe;
  131. mutex_lock(&ls->ls_requestqueue_mutex);
  132. list_for_each_entry_safe(e, safe, &ls->ls_requestqueue, list) {
  133. ms = &e->request;
  134. if (purge_request(ls, ms, e->nodeid)) {
  135. list_del(&e->list);
  136. if (atomic_dec_and_test(&ls->ls_requestqueue_cnt))
  137. wake_up(&ls->ls_requestqueue_wait);
  138. kfree(e);
  139. }
  140. }
  141. mutex_unlock(&ls->ls_requestqueue_mutex);
  142. }