12522fe45SThomas Gleixner // SPDX-License-Identifier: GPL-2.0-only
2e7fd4179SDavid Teigland /******************************************************************************
3e7fd4179SDavid Teigland *******************************************************************************
4e7fd4179SDavid Teigland **
5c36258b5SDavid Teigland ** Copyright (C) 2005-2007 Red Hat, Inc. All rights reserved.
6e7fd4179SDavid Teigland **
7e7fd4179SDavid Teigland **
8e7fd4179SDavid Teigland *******************************************************************************
9e7fd4179SDavid Teigland ******************************************************************************/
10e7fd4179SDavid Teigland
11e7fd4179SDavid Teigland #include "dlm_internal.h"
12e7fd4179SDavid Teigland #include "member.h"
13e7fd4179SDavid Teigland #include "lock.h"
14e7fd4179SDavid Teigland #include "dir.h"
15e7fd4179SDavid Teigland #include "config.h"
16e7fd4179SDavid Teigland #include "requestqueue.h"
1700e99ccdSAlexander Aring #include "util.h"
18e7fd4179SDavid Teigland
19e7fd4179SDavid Teigland struct rq_entry {
20e7fd4179SDavid Teigland struct list_head list;
216d40c4a7SDavid Teigland uint32_t recover_seq;
22e7fd4179SDavid Teigland int nodeid;
238b0d8e03SAl Viro struct dlm_message request;
24e7fd4179SDavid Teigland };
25e7fd4179SDavid Teigland
26e7fd4179SDavid Teigland /*
27e7fd4179SDavid Teigland * Requests received while the lockspace is in recovery get added to the
28e7fd4179SDavid Teigland * request queue and processed when recovery is complete. This happens when
29e7fd4179SDavid Teigland * the lockspace is suspended on some nodes before it is on others, or the
30e7fd4179SDavid Teigland * lockspace is enabled on some while still suspended on others.
31e7fd4179SDavid Teigland */
32e7fd4179SDavid Teigland
dlm_add_requestqueue(struct dlm_ls * ls,int nodeid,const struct dlm_message * ms)3311519351SAlexander Aring void dlm_add_requestqueue(struct dlm_ls *ls, int nodeid,
3411519351SAlexander Aring const struct dlm_message *ms)
35e7fd4179SDavid Teigland {
36e7fd4179SDavid Teigland struct rq_entry *e;
373428785aSAlexander Aring int length = le16_to_cpu(ms->m_header.h_length) -
383428785aSAlexander Aring sizeof(struct dlm_message);
39e7fd4179SDavid Teigland
40455597a5SAlexander Aring e = kmalloc(sizeof(struct rq_entry) + length, GFP_ATOMIC);
41e7fd4179SDavid Teigland if (!e) {
42c36258b5SDavid Teigland log_print("dlm_add_requestqueue: out of memory len %d", length);
43c36258b5SDavid Teigland return;
44e7fd4179SDavid Teigland }
45e7fd4179SDavid Teigland
466d40c4a7SDavid Teigland e->recover_seq = ls->ls_recover_seq & 0xFFFFFFFF;
47e7fd4179SDavid Teigland e->nodeid = nodeid;
48f217d7ccSAlexander Aring memcpy(&e->request, ms, sizeof(*ms));
49f217d7ccSAlexander Aring memcpy(&e->request.m_extra, ms->m_extra, length);
50e7fd4179SDavid Teigland
51e7fd4179SDavid Teigland list_add_tail(&e->list, &ls->ls_requestqueue);
52e7fd4179SDavid Teigland }
53e7fd4179SDavid Teigland
54c36258b5SDavid Teigland /*
55c36258b5SDavid Teigland * Called by dlm_recoverd to process normal messages saved while recovery was
56c36258b5SDavid Teigland * happening. Normal locking has been enabled before this is called. dlm_recv
57c36258b5SDavid Teigland * upon receiving a message, will wait for all saved messages to be drained
58c36258b5SDavid Teigland * here before processing the message it got. If a new dlm_ls_stop() arrives
59c36258b5SDavid Teigland * while we're processing these saved messages, it may block trying to suspend
60c36258b5SDavid Teigland * dlm_recv if dlm_recv is waiting for us in dlm_wait_requestqueue. In that
61c36258b5SDavid Teigland * case, we don't abort since locking_stopped is still 0. If dlm_recv is not
62c36258b5SDavid Teigland * waiting for us, then this processing may be aborted due to locking_stopped.
63c36258b5SDavid Teigland */
64c36258b5SDavid Teigland
dlm_process_requestqueue(struct dlm_ls * ls)65e7fd4179SDavid Teigland int dlm_process_requestqueue(struct dlm_ls *ls)
66e7fd4179SDavid Teigland {
67e7fd4179SDavid Teigland struct rq_entry *e;
684875647aSDavid Teigland struct dlm_message *ms;
69e7fd4179SDavid Teigland int error = 0;
70e7fd4179SDavid Teigland
71*578acf9aSAlexander Aring write_lock_bh(&ls->ls_requestqueue_lock);
72e7fd4179SDavid Teigland for (;;) {
73e7fd4179SDavid Teigland if (list_empty(&ls->ls_requestqueue)) {
74c288745fSAlexander Aring clear_bit(LSFL_RECV_MSG_BLOCKED, &ls->ls_flags);
75e7fd4179SDavid Teigland error = 0;
76e7fd4179SDavid Teigland break;
77e7fd4179SDavid Teigland }
78c288745fSAlexander Aring e = list_first_entry(&ls->ls_requestqueue, struct rq_entry, list);
79e7fd4179SDavid Teigland
804875647aSDavid Teigland ms = &e->request;
814875647aSDavid Teigland
824875647aSDavid Teigland log_limit(ls, "dlm_process_requestqueue msg %d from %d "
834875647aSDavid Teigland "lkid %x remid %x result %d seq %u",
8400e99ccdSAlexander Aring le32_to_cpu(ms->m_type),
8500e99ccdSAlexander Aring le32_to_cpu(ms->m_header.h_nodeid),
8600e99ccdSAlexander Aring le32_to_cpu(ms->m_lkid), le32_to_cpu(ms->m_remid),
8700e99ccdSAlexander Aring from_dlm_errno(le32_to_cpu(ms->m_result)),
884875647aSDavid Teigland e->recover_seq);
894875647aSDavid Teigland
906d40c4a7SDavid Teigland dlm_receive_message_saved(ls, &e->request, e->recover_seq);
91e7fd4179SDavid Teigland list_del(&e->list);
92e7fd4179SDavid Teigland kfree(e);
93e7fd4179SDavid Teigland
94e7fd4179SDavid Teigland if (dlm_locking_stopped(ls)) {
95e7fd4179SDavid Teigland log_debug(ls, "process_requestqueue abort running");
96e7fd4179SDavid Teigland error = -EINTR;
97e7fd4179SDavid Teigland break;
98e7fd4179SDavid Teigland }
99*578acf9aSAlexander Aring write_unlock_bh(&ls->ls_requestqueue_lock);
100e7fd4179SDavid Teigland schedule();
101*578acf9aSAlexander Aring write_lock_bh(&ls->ls_requestqueue_lock);
102e7fd4179SDavid Teigland }
103*578acf9aSAlexander Aring write_unlock_bh(&ls->ls_requestqueue_lock);
104e7fd4179SDavid Teigland
105e7fd4179SDavid Teigland return error;
106e7fd4179SDavid Teigland }
107e7fd4179SDavid Teigland
purge_request(struct dlm_ls * ls,struct dlm_message * ms,int nodeid)108e7fd4179SDavid Teigland static int purge_request(struct dlm_ls *ls, struct dlm_message *ms, int nodeid)
109e7fd4179SDavid Teigland {
11000e99ccdSAlexander Aring __le32 type = ms->m_type;
111e7fd4179SDavid Teigland
1122896ee37SDavid Teigland /* the ls is being cleaned up and freed by release_lockspace */
1133cb5977cSAlexander Aring if (!atomic_read(&ls->ls_count))
1142896ee37SDavid Teigland return 1;
1152896ee37SDavid Teigland
116e7fd4179SDavid Teigland if (dlm_is_removed(ls, nodeid))
117e7fd4179SDavid Teigland return 1;
118e7fd4179SDavid Teigland
119e7fd4179SDavid Teigland /* directory operations are always purged because the directory is
120e7fd4179SDavid Teigland always rebuilt during recovery and the lookups resent */
121e7fd4179SDavid Teigland
12200e99ccdSAlexander Aring if (type == cpu_to_le32(DLM_MSG_REMOVE) ||
12300e99ccdSAlexander Aring type == cpu_to_le32(DLM_MSG_LOOKUP) ||
12400e99ccdSAlexander Aring type == cpu_to_le32(DLM_MSG_LOOKUP_REPLY))
125e7fd4179SDavid Teigland return 1;
126e7fd4179SDavid Teigland
127e7fd4179SDavid Teigland if (!dlm_no_directory(ls))
128e7fd4179SDavid Teigland return 0;
129e7fd4179SDavid Teigland
130e7fd4179SDavid Teigland return 1;
131e7fd4179SDavid Teigland }
132e7fd4179SDavid Teigland
dlm_purge_requestqueue(struct dlm_ls * ls)133e7fd4179SDavid Teigland void dlm_purge_requestqueue(struct dlm_ls *ls)
134e7fd4179SDavid Teigland {
135e7fd4179SDavid Teigland struct dlm_message *ms;
136e7fd4179SDavid Teigland struct rq_entry *e, *safe;
137e7fd4179SDavid Teigland
138*578acf9aSAlexander Aring write_lock_bh(&ls->ls_requestqueue_lock);
139e7fd4179SDavid Teigland list_for_each_entry_safe(e, safe, &ls->ls_requestqueue, list) {
1408b0d8e03SAl Viro ms = &e->request;
141e7fd4179SDavid Teigland
142e7fd4179SDavid Teigland if (purge_request(ls, ms, e->nodeid)) {
143e7fd4179SDavid Teigland list_del(&e->list);
144e7fd4179SDavid Teigland kfree(e);
145e7fd4179SDavid Teigland }
146e7fd4179SDavid Teigland }
147*578acf9aSAlexander Aring write_unlock_bh(&ls->ls_requestqueue_lock);
148e7fd4179SDavid Teigland }
149e7fd4179SDavid Teigland
150