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