xref: /linux/fs/dlm/requestqueue.c (revision 4875647a08e35f77274838d97ca8fa44158d50e2)
1e7fd4179SDavid Teigland /******************************************************************************
2e7fd4179SDavid Teigland *******************************************************************************
3e7fd4179SDavid Teigland **
4c36258b5SDavid Teigland **  Copyright (C) 2005-2007 Red Hat, Inc.  All rights reserved.
5e7fd4179SDavid Teigland **
6e7fd4179SDavid Teigland **  This copyrighted material is made available to anyone wishing to use,
7e7fd4179SDavid Teigland **  modify, copy, or redistribute it subject to the terms and conditions
8e7fd4179SDavid Teigland **  of the GNU General Public License v.2.
9e7fd4179SDavid Teigland **
10e7fd4179SDavid Teigland *******************************************************************************
11e7fd4179SDavid Teigland ******************************************************************************/
12e7fd4179SDavid Teigland 
13e7fd4179SDavid Teigland #include "dlm_internal.h"
14e7fd4179SDavid Teigland #include "member.h"
15e7fd4179SDavid Teigland #include "lock.h"
16e7fd4179SDavid Teigland #include "dir.h"
17e7fd4179SDavid Teigland #include "config.h"
18e7fd4179SDavid Teigland #include "requestqueue.h"
19e7fd4179SDavid Teigland 
20e7fd4179SDavid Teigland struct rq_entry {
21e7fd4179SDavid Teigland 	struct list_head list;
226d40c4a7SDavid Teigland 	uint32_t recover_seq;
23e7fd4179SDavid Teigland 	int nodeid;
248b0d8e03SAl Viro 	struct dlm_message request;
25e7fd4179SDavid Teigland };
26e7fd4179SDavid Teigland 
27e7fd4179SDavid Teigland /*
28e7fd4179SDavid Teigland  * Requests received while the lockspace is in recovery get added to the
29e7fd4179SDavid Teigland  * request queue and processed when recovery is complete.  This happens when
30e7fd4179SDavid Teigland  * the lockspace is suspended on some nodes before it is on others, or the
31e7fd4179SDavid Teigland  * lockspace is enabled on some while still suspended on others.
32e7fd4179SDavid Teigland  */
33e7fd4179SDavid Teigland 
348b0d8e03SAl Viro void dlm_add_requestqueue(struct dlm_ls *ls, int nodeid, struct dlm_message *ms)
35e7fd4179SDavid Teigland {
36e7fd4179SDavid Teigland 	struct rq_entry *e;
378b0d8e03SAl Viro 	int length = ms->m_header.h_length - sizeof(struct dlm_message);
38e7fd4179SDavid Teigland 
39573c24c4SDavid Teigland 	e = kmalloc(sizeof(struct rq_entry) + length, GFP_NOFS);
40e7fd4179SDavid Teigland 	if (!e) {
41c36258b5SDavid Teigland 		log_print("dlm_add_requestqueue: out of memory len %d", length);
42c36258b5SDavid Teigland 		return;
43e7fd4179SDavid Teigland 	}
44e7fd4179SDavid Teigland 
456d40c4a7SDavid Teigland 	e->recover_seq = ls->ls_recover_seq & 0xFFFFFFFF;
46e7fd4179SDavid Teigland 	e->nodeid = nodeid;
478b0d8e03SAl Viro 	memcpy(&e->request, ms, ms->m_header.h_length);
48e7fd4179SDavid Teigland 
4990135925SDavid Teigland 	mutex_lock(&ls->ls_requestqueue_mutex);
50e7fd4179SDavid Teigland 	list_add_tail(&e->list, &ls->ls_requestqueue);
5190135925SDavid Teigland 	mutex_unlock(&ls->ls_requestqueue_mutex);
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 
65e7fd4179SDavid Teigland int dlm_process_requestqueue(struct dlm_ls *ls)
66e7fd4179SDavid Teigland {
67e7fd4179SDavid Teigland 	struct rq_entry *e;
68*4875647aSDavid Teigland 	struct dlm_message *ms;
69e7fd4179SDavid Teigland 	int error = 0;
70e7fd4179SDavid Teigland 
7190135925SDavid Teigland 	mutex_lock(&ls->ls_requestqueue_mutex);
72e7fd4179SDavid Teigland 
73e7fd4179SDavid Teigland 	for (;;) {
74e7fd4179SDavid Teigland 		if (list_empty(&ls->ls_requestqueue)) {
7590135925SDavid Teigland 			mutex_unlock(&ls->ls_requestqueue_mutex);
76e7fd4179SDavid Teigland 			error = 0;
77e7fd4179SDavid Teigland 			break;
78e7fd4179SDavid Teigland 		}
79e7fd4179SDavid Teigland 		e = list_entry(ls->ls_requestqueue.next, struct rq_entry, list);
8090135925SDavid Teigland 		mutex_unlock(&ls->ls_requestqueue_mutex);
81e7fd4179SDavid Teigland 
82*4875647aSDavid Teigland 		ms = &e->request;
83*4875647aSDavid Teigland 
84*4875647aSDavid Teigland 		log_limit(ls, "dlm_process_requestqueue msg %d from %d "
85*4875647aSDavid Teigland 			  "lkid %x remid %x result %d seq %u",
86*4875647aSDavid Teigland 			  ms->m_type, ms->m_header.h_nodeid,
87*4875647aSDavid Teigland 			  ms->m_lkid, ms->m_remid, ms->m_result,
88*4875647aSDavid Teigland 			  e->recover_seq);
89*4875647aSDavid Teigland 
906d40c4a7SDavid Teigland 		dlm_receive_message_saved(ls, &e->request, e->recover_seq);
91e7fd4179SDavid Teigland 
9290135925SDavid Teigland 		mutex_lock(&ls->ls_requestqueue_mutex);
93e7fd4179SDavid Teigland 		list_del(&e->list);
94e7fd4179SDavid Teigland 		kfree(e);
95e7fd4179SDavid Teigland 
96e7fd4179SDavid Teigland 		if (dlm_locking_stopped(ls)) {
97e7fd4179SDavid Teigland 			log_debug(ls, "process_requestqueue abort running");
9890135925SDavid Teigland 			mutex_unlock(&ls->ls_requestqueue_mutex);
99e7fd4179SDavid Teigland 			error = -EINTR;
100e7fd4179SDavid Teigland 			break;
101e7fd4179SDavid Teigland 		}
102e7fd4179SDavid Teigland 		schedule();
103e7fd4179SDavid Teigland 	}
104e7fd4179SDavid Teigland 
105e7fd4179SDavid Teigland 	return error;
106e7fd4179SDavid Teigland }
107e7fd4179SDavid Teigland 
108e7fd4179SDavid Teigland /*
109e7fd4179SDavid Teigland  * After recovery is done, locking is resumed and dlm_recoverd takes all the
110c36258b5SDavid Teigland  * saved requests and processes them as they would have been by dlm_recv.  At
111c36258b5SDavid Teigland  * the same time, dlm_recv will start receiving new requests from remote nodes.
112c36258b5SDavid Teigland  * We want to delay dlm_recv processing new requests until dlm_recoverd has
113c36258b5SDavid Teigland  * finished processing the old saved requests.  We don't check for locking
114c36258b5SDavid Teigland  * stopped here because dlm_ls_stop won't stop locking until it's suspended us
115c36258b5SDavid Teigland  * (dlm_recv).
116e7fd4179SDavid Teigland  */
117e7fd4179SDavid Teigland 
118e7fd4179SDavid Teigland void dlm_wait_requestqueue(struct dlm_ls *ls)
119e7fd4179SDavid Teigland {
120e7fd4179SDavid Teigland 	for (;;) {
12190135925SDavid Teigland 		mutex_lock(&ls->ls_requestqueue_mutex);
122e7fd4179SDavid Teigland 		if (list_empty(&ls->ls_requestqueue))
123e7fd4179SDavid Teigland 			break;
12490135925SDavid Teigland 		mutex_unlock(&ls->ls_requestqueue_mutex);
125e7fd4179SDavid Teigland 		schedule();
126e7fd4179SDavid Teigland 	}
12790135925SDavid Teigland 	mutex_unlock(&ls->ls_requestqueue_mutex);
128e7fd4179SDavid Teigland }
129e7fd4179SDavid Teigland 
130e7fd4179SDavid Teigland static int purge_request(struct dlm_ls *ls, struct dlm_message *ms, int nodeid)
131e7fd4179SDavid Teigland {
132e7fd4179SDavid Teigland 	uint32_t type = ms->m_type;
133e7fd4179SDavid Teigland 
1342896ee37SDavid Teigland 	/* the ls is being cleaned up and freed by release_lockspace */
1352896ee37SDavid Teigland 	if (!ls->ls_count)
1362896ee37SDavid Teigland 		return 1;
1372896ee37SDavid Teigland 
138e7fd4179SDavid Teigland 	if (dlm_is_removed(ls, nodeid))
139e7fd4179SDavid Teigland 		return 1;
140e7fd4179SDavid Teigland 
141e7fd4179SDavid Teigland 	/* directory operations are always purged because the directory is
142e7fd4179SDavid Teigland 	   always rebuilt during recovery and the lookups resent */
143e7fd4179SDavid Teigland 
144e7fd4179SDavid Teigland 	if (type == DLM_MSG_REMOVE ||
145e7fd4179SDavid Teigland 	    type == DLM_MSG_LOOKUP ||
146e7fd4179SDavid Teigland 	    type == DLM_MSG_LOOKUP_REPLY)
147e7fd4179SDavid Teigland 		return 1;
148e7fd4179SDavid Teigland 
149e7fd4179SDavid Teigland 	if (!dlm_no_directory(ls))
150e7fd4179SDavid Teigland 		return 0;
151e7fd4179SDavid Teigland 
152e7fd4179SDavid Teigland 	return 1;
153e7fd4179SDavid Teigland }
154e7fd4179SDavid Teigland 
155e7fd4179SDavid Teigland void dlm_purge_requestqueue(struct dlm_ls *ls)
156e7fd4179SDavid Teigland {
157e7fd4179SDavid Teigland 	struct dlm_message *ms;
158e7fd4179SDavid Teigland 	struct rq_entry *e, *safe;
159e7fd4179SDavid Teigland 
16090135925SDavid Teigland 	mutex_lock(&ls->ls_requestqueue_mutex);
161e7fd4179SDavid Teigland 	list_for_each_entry_safe(e, safe, &ls->ls_requestqueue, list) {
1628b0d8e03SAl Viro 		ms =  &e->request;
163e7fd4179SDavid Teigland 
164e7fd4179SDavid Teigland 		if (purge_request(ls, ms, e->nodeid)) {
165e7fd4179SDavid Teigland 			list_del(&e->list);
166e7fd4179SDavid Teigland 			kfree(e);
167e7fd4179SDavid Teigland 		}
168e7fd4179SDavid Teigland 	}
16990135925SDavid Teigland 	mutex_unlock(&ls->ls_requestqueue_mutex);
170e7fd4179SDavid Teigland }
171e7fd4179SDavid Teigland 
172