blob: 5db68b371db2cac54e37cc0a883259dbc61125cb [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * linux/net/sunrpc/sched.c
3 *
4 * Scheduling for synchronous and asynchronous RPC requests.
5 *
6 * Copyright (C) 1996 Olaf Kirch, <okir@monad.swb.de>
YOSHIFUJI Hideakicca51722007-02-09 15:38:13 -08007 *
Linus Torvalds1da177e2005-04-16 15:20:36 -07008 * TCP NFS related read + write fixes
9 * (C) 1999 Dave Airlie, University of Limerick, Ireland <airlied@linux.ie>
10 */
11
12#include <linux/module.h>
13
14#include <linux/sched.h>
15#include <linux/interrupt.h>
16#include <linux/slab.h>
17#include <linux/mempool.h>
18#include <linux/smp.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070019#include <linux/spinlock.h>
Arjan van de Ven4a3e2f72006-03-20 22:33:17 -080020#include <linux/mutex.h>
Jeff Laytond3103102011-12-01 22:44:39 +010021#include <linux/freezer.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070022
23#include <linux/sunrpc/clnt.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070024
Benny Halevy69518672009-09-10 12:25:04 +030025#include "sunrpc.h"
26
Jeff Laytonf895b252014-11-17 16:58:04 -050027#if IS_ENABLED(CONFIG_SUNRPC_DEBUG)
Linus Torvalds1da177e2005-04-16 15:20:36 -070028#define RPCDBG_FACILITY RPCDBG_SCHED
Linus Torvalds1da177e2005-04-16 15:20:36 -070029#endif
30
Trond Myklebust82b0a4c2012-01-20 14:52:23 -050031#define CREATE_TRACE_POINTS
32#include <trace/events/sunrpc.h>
33
Linus Torvalds1da177e2005-04-16 15:20:36 -070034/*
35 * RPC slabs and memory pools
36 */
37#define RPC_BUFFER_MAXSIZE (2048)
38#define RPC_BUFFER_POOLSIZE (8)
39#define RPC_TASK_POOLSIZE (8)
Christoph Lametere18b8902006-12-06 20:33:20 -080040static struct kmem_cache *rpc_task_slabp __read_mostly;
41static struct kmem_cache *rpc_buffer_slabp __read_mostly;
Eric Dumazetba899662005-08-26 12:05:31 -070042static mempool_t *rpc_task_mempool __read_mostly;
43static mempool_t *rpc_buffer_mempool __read_mostly;
Linus Torvalds1da177e2005-04-16 15:20:36 -070044
David Howells65f27f32006-11-22 14:55:48 +000045static void rpc_async_schedule(struct work_struct *);
Trond Myklebustbde8f002007-01-24 11:54:53 -080046static void rpc_release_task(struct rpc_task *task);
Trond Myklebust36df9aa2007-07-18 16:18:52 -040047static void __rpc_queue_timer_fn(unsigned long ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -070048
49/*
Linus Torvalds1da177e2005-04-16 15:20:36 -070050 * RPC tasks sit here while waiting for conditions to improve.
51 */
Trond Myklebusta4a87492007-07-18 13:24:19 -040052static struct rpc_wait_queue delay_queue;
Linus Torvalds1da177e2005-04-16 15:20:36 -070053
54/*
Linus Torvalds1da177e2005-04-16 15:20:36 -070055 * rpciod-related stuff
56 */
Trond Myklebust40a5f1b2016-05-27 10:39:50 -040057struct workqueue_struct *rpciod_workqueue __read_mostly;
58struct workqueue_struct *xprtiod_workqueue __read_mostly;
Linus Torvalds1da177e2005-04-16 15:20:36 -070059
60/*
Linus Torvalds1da177e2005-04-16 15:20:36 -070061 * Disable the timer for a given RPC task. Should be called with
62 * queue->lock and bh_disabled in order to avoid races within
63 * rpc_run_timer().
64 */
Trond Myklebust5d008372008-02-22 16:34:17 -050065static void
Trond Myklebusteb276c02008-02-22 17:27:59 -050066__rpc_disable_timer(struct rpc_wait_queue *queue, struct rpc_task *task)
Linus Torvalds1da177e2005-04-16 15:20:36 -070067{
Trond Myklebust36df9aa2007-07-18 16:18:52 -040068 if (task->tk_timeout == 0)
69 return;
Chuck Lever46121cf2007-01-31 12:14:08 -050070 dprintk("RPC: %5u disabling timer\n", task->tk_pid);
Linus Torvalds1da177e2005-04-16 15:20:36 -070071 task->tk_timeout = 0;
Trond Myklebust36df9aa2007-07-18 16:18:52 -040072 list_del(&task->u.tk_wait.timer_list);
Trond Myklebusteb276c02008-02-22 17:27:59 -050073 if (list_empty(&queue->timer_list.list))
74 del_timer(&queue->timer_list.timer);
Trond Myklebust36df9aa2007-07-18 16:18:52 -040075}
76
77static void
78rpc_set_queue_timer(struct rpc_wait_queue *queue, unsigned long expires)
79{
80 queue->timer_list.expires = expires;
81 mod_timer(&queue->timer_list.timer, expires);
Linus Torvalds1da177e2005-04-16 15:20:36 -070082}
83
84/*
Linus Torvalds1da177e2005-04-16 15:20:36 -070085 * Set up a timer for the current task.
86 */
Trond Myklebust5d008372008-02-22 16:34:17 -050087static void
Trond Myklebusteb276c02008-02-22 17:27:59 -050088__rpc_add_timer(struct rpc_wait_queue *queue, struct rpc_task *task)
Linus Torvalds1da177e2005-04-16 15:20:36 -070089{
90 if (!task->tk_timeout)
91 return;
92
Nicholas Mc Guire55cc1d72015-03-13 04:25:34 -040093 dprintk("RPC: %5u setting alarm for %u ms\n",
94 task->tk_pid, jiffies_to_msecs(task->tk_timeout));
Linus Torvalds1da177e2005-04-16 15:20:36 -070095
Trond Myklebusteb276c02008-02-22 17:27:59 -050096 task->u.tk_wait.expires = jiffies + task->tk_timeout;
97 if (list_empty(&queue->timer_list.list) || time_before(task->u.tk_wait.expires, queue->timer_list.expires))
98 rpc_set_queue_timer(queue, task->u.tk_wait.expires);
99 list_add(&task->u.tk_wait.timer_list, &queue->timer_list.list);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700100}
101
Trond Myklebustedd2e362013-01-27 14:20:49 -0500102static void rpc_rotate_queue_owner(struct rpc_wait_queue *queue)
103{
104 struct list_head *q = &queue->tasks[queue->priority];
105 struct rpc_task *task;
106
107 if (!list_empty(q)) {
108 task = list_first_entry(q, struct rpc_task, u.tk_wait.list);
109 if (task->tk_owner == queue->owner)
110 list_move_tail(&task->u.tk_wait.list, q);
111 }
112}
113
Trond Myklebustc05eecf2012-11-30 23:59:29 -0500114static void rpc_set_waitqueue_priority(struct rpc_wait_queue *queue, int priority)
115{
Trond Myklebustedd2e362013-01-27 14:20:49 -0500116 if (queue->priority != priority) {
117 /* Fairness: rotate the list when changing priority */
118 rpc_rotate_queue_owner(queue);
119 queue->priority = priority;
120 }
Trond Myklebustc05eecf2012-11-30 23:59:29 -0500121}
122
123static void rpc_set_waitqueue_owner(struct rpc_wait_queue *queue, pid_t pid)
124{
125 queue->owner = pid;
126 queue->nr = RPC_BATCH_COUNT;
127}
128
129static void rpc_reset_waitqueue_priority(struct rpc_wait_queue *queue)
130{
131 rpc_set_waitqueue_priority(queue, queue->maxpriority);
132 rpc_set_waitqueue_owner(queue, 0);
133}
134
Linus Torvalds1da177e2005-04-16 15:20:36 -0700135/*
136 * Add new request to a priority queue.
137 */
Trond Myklebust3b27bad2011-07-17 18:11:34 -0400138static void __rpc_add_wait_queue_priority(struct rpc_wait_queue *queue,
139 struct rpc_task *task,
140 unsigned char queue_priority)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700141{
142 struct list_head *q;
143 struct rpc_task *t;
144
145 INIT_LIST_HEAD(&task->u.tk_wait.links);
Trond Myklebust3b27bad2011-07-17 18:11:34 -0400146 if (unlikely(queue_priority > queue->maxpriority))
Trond Myklebustc05eecf2012-11-30 23:59:29 -0500147 queue_priority = queue->maxpriority;
148 if (queue_priority > queue->priority)
149 rpc_set_waitqueue_priority(queue, queue_priority);
150 q = &queue->tasks[queue_priority];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700151 list_for_each_entry(t, q, u.tk_wait.list) {
Trond Myklebust3ff75762007-07-14 15:40:00 -0400152 if (t->tk_owner == task->tk_owner) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700153 list_add_tail(&task->u.tk_wait.list, &t->u.tk_wait.links);
154 return;
155 }
156 }
157 list_add_tail(&task->u.tk_wait.list, q);
158}
159
160/*
161 * Add new request to wait queue.
162 *
163 * Swapper tasks always get inserted at the head of the queue.
164 * This should avoid many nasty memory deadlocks and hopefully
165 * improve overall performance.
166 * Everyone else gets appended to the queue to ensure proper FIFO behavior.
167 */
Trond Myklebust3b27bad2011-07-17 18:11:34 -0400168static void __rpc_add_wait_queue(struct rpc_wait_queue *queue,
169 struct rpc_task *task,
170 unsigned char queue_priority)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700171{
Weston Andros Adamson2bd4eef2012-10-23 10:43:47 -0400172 WARN_ON_ONCE(RPC_IS_QUEUED(task));
173 if (RPC_IS_QUEUED(task))
174 return;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700175
176 if (RPC_IS_PRIORITY(queue))
Trond Myklebust3b27bad2011-07-17 18:11:34 -0400177 __rpc_add_wait_queue_priority(queue, task, queue_priority);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700178 else if (RPC_IS_SWAPPER(task))
179 list_add(&task->u.tk_wait.list, &queue->tasks[0]);
180 else
181 list_add_tail(&task->u.tk_wait.list, &queue->tasks[0]);
Trond Myklebust96ef13b2008-02-22 15:46:41 -0500182 task->tk_waitqueue = queue;
Chuck Levere19b63d2006-03-20 13:44:15 -0500183 queue->qlen++;
Trond Myklebust1166fde62013-03-25 11:23:40 -0400184 /* barrier matches the read in rpc_wake_up_task_queue_locked() */
185 smp_wmb();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700186 rpc_set_queued(task);
187
Chuck Lever46121cf2007-01-31 12:14:08 -0500188 dprintk("RPC: %5u added to queue %p \"%s\"\n",
189 task->tk_pid, queue, rpc_qname(queue));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700190}
191
192/*
193 * Remove request from a priority queue.
194 */
195static void __rpc_remove_wait_queue_priority(struct rpc_task *task)
196{
197 struct rpc_task *t;
198
199 if (!list_empty(&task->u.tk_wait.links)) {
200 t = list_entry(task->u.tk_wait.links.next, struct rpc_task, u.tk_wait.list);
201 list_move(&t->u.tk_wait.list, &task->u.tk_wait.list);
202 list_splice_init(&task->u.tk_wait.links, &t->u.tk_wait.links);
203 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700204}
205
206/*
207 * Remove request from queue.
208 * Note: must be called with spin lock held.
209 */
Trond Myklebust96ef13b2008-02-22 15:46:41 -0500210static void __rpc_remove_wait_queue(struct rpc_wait_queue *queue, struct rpc_task *task)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700211{
Trond Myklebusteb276c02008-02-22 17:27:59 -0500212 __rpc_disable_timer(queue, task);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700213 if (RPC_IS_PRIORITY(queue))
214 __rpc_remove_wait_queue_priority(task);
Trond Myklebust36df9aa2007-07-18 16:18:52 -0400215 list_del(&task->u.tk_wait.list);
Chuck Levere19b63d2006-03-20 13:44:15 -0500216 queue->qlen--;
Chuck Lever46121cf2007-01-31 12:14:08 -0500217 dprintk("RPC: %5u removed from queue %p \"%s\"\n",
218 task->tk_pid, queue, rpc_qname(queue));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700219}
220
Trond Myklebust3ff75762007-07-14 15:40:00 -0400221static void __rpc_init_priority_wait_queue(struct rpc_wait_queue *queue, const char *qname, unsigned char nr_queues)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700222{
223 int i;
224
225 spin_lock_init(&queue->lock);
226 for (i = 0; i < ARRAY_SIZE(queue->tasks); i++)
227 INIT_LIST_HEAD(&queue->tasks[i]);
Trond Myklebust3ff75762007-07-14 15:40:00 -0400228 queue->maxpriority = nr_queues - 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700229 rpc_reset_waitqueue_priority(queue);
Trond Myklebust36df9aa2007-07-18 16:18:52 -0400230 queue->qlen = 0;
231 setup_timer(&queue->timer_list.timer, __rpc_queue_timer_fn, (unsigned long)queue);
232 INIT_LIST_HEAD(&queue->timer_list.list);
Trond Myklebust2f09c242012-02-08 22:01:15 -0500233 rpc_assign_waitqueue_name(queue, qname);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700234}
235
236void rpc_init_priority_wait_queue(struct rpc_wait_queue *queue, const char *qname)
237{
Trond Myklebust3ff75762007-07-14 15:40:00 -0400238 __rpc_init_priority_wait_queue(queue, qname, RPC_NR_PRIORITY);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700239}
Alexandros Batsakis689cf5c2009-12-14 21:27:56 -0800240EXPORT_SYMBOL_GPL(rpc_init_priority_wait_queue);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700241
242void rpc_init_wait_queue(struct rpc_wait_queue *queue, const char *qname)
243{
Trond Myklebust3ff75762007-07-14 15:40:00 -0400244 __rpc_init_priority_wait_queue(queue, qname, 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700245}
Trond Myklebuste8914c62007-07-14 15:39:59 -0400246EXPORT_SYMBOL_GPL(rpc_init_wait_queue);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700247
Trond Myklebustf6a1cc82008-02-22 17:06:55 -0500248void rpc_destroy_wait_queue(struct rpc_wait_queue *queue)
249{
Trond Myklebust36df9aa2007-07-18 16:18:52 -0400250 del_timer_sync(&queue->timer_list.timer);
Trond Myklebustf6a1cc82008-02-22 17:06:55 -0500251}
252EXPORT_SYMBOL_GPL(rpc_destroy_wait_queue);
253
Peter Zijlstradfd01f02015-12-13 22:11:16 +0100254static int rpc_wait_bit_killable(struct wait_bit_key *key, int mode)
Trond Myklebust44c28872006-01-03 09:55:06 +0100255{
Colin Cross416ad3c2013-05-06 23:50:06 +0000256 freezable_schedule_unsafe();
Peter Zijlstradfd01f02015-12-13 22:11:16 +0100257 if (signal_pending_state(mode, current))
258 return -ERESTARTSYS;
Trond Myklebust44c28872006-01-03 09:55:06 +0100259 return 0;
260}
261
Jeff Layton13067292014-11-17 16:58:05 -0500262#if IS_ENABLED(CONFIG_SUNRPC_DEBUG) || IS_ENABLED(CONFIG_TRACEPOINTS)
Trond Myklebustc44fe702007-06-16 14:17:01 -0400263static void rpc_task_set_debuginfo(struct rpc_task *task)
264{
265 static atomic_t rpc_pid;
266
Trond Myklebustc44fe702007-06-16 14:17:01 -0400267 task->tk_pid = atomic_inc_return(&rpc_pid);
268}
269#else
270static inline void rpc_task_set_debuginfo(struct rpc_task *task)
271{
272}
273#endif
274
Trond Myklebuste6b3c4d2006-11-11 22:18:03 -0500275static void rpc_set_active(struct rpc_task *task)
276{
Trond Myklebust82b0a4c2012-01-20 14:52:23 -0500277 trace_rpc_task_begin(task->tk_client, task, NULL);
278
Trond Myklebustc44fe702007-06-16 14:17:01 -0400279 rpc_task_set_debuginfo(task);
Trond Myklebust58f96122010-07-31 14:29:08 -0400280 set_bit(RPC_TASK_ACTIVE, &task->tk_runstate);
Trond Myklebuste6b3c4d2006-11-11 22:18:03 -0500281}
282
Trond Myklebust44c28872006-01-03 09:55:06 +0100283/*
284 * Mark an RPC call as having completed by clearing the 'active' bit
Trond Myklebustbf294b42011-02-21 11:05:41 -0800285 * and then waking up all tasks that were sleeping.
Trond Myklebust44c28872006-01-03 09:55:06 +0100286 */
Trond Myklebustbf294b42011-02-21 11:05:41 -0800287static int rpc_complete_task(struct rpc_task *task)
Trond Myklebust44c28872006-01-03 09:55:06 +0100288{
Trond Myklebustbf294b42011-02-21 11:05:41 -0800289 void *m = &task->tk_runstate;
290 wait_queue_head_t *wq = bit_waitqueue(m, RPC_TASK_ACTIVE);
291 struct wait_bit_key k = __WAIT_BIT_KEY_INITIALIZER(m, RPC_TASK_ACTIVE);
292 unsigned long flags;
293 int ret;
294
Trond Myklebust82b0a4c2012-01-20 14:52:23 -0500295 trace_rpc_task_complete(task->tk_client, task, NULL);
296
Trond Myklebustbf294b42011-02-21 11:05:41 -0800297 spin_lock_irqsave(&wq->lock, flags);
Trond Myklebuste6b3c4d2006-11-11 22:18:03 -0500298 clear_bit(RPC_TASK_ACTIVE, &task->tk_runstate);
Trond Myklebustbf294b42011-02-21 11:05:41 -0800299 ret = atomic_dec_and_test(&task->tk_count);
300 if (waitqueue_active(wq))
Andrea Arcangeliac5be6b2015-09-22 14:58:49 -0700301 __wake_up_locked_key(wq, TASK_NORMAL, &k);
Trond Myklebustbf294b42011-02-21 11:05:41 -0800302 spin_unlock_irqrestore(&wq->lock, flags);
303 return ret;
Trond Myklebust44c28872006-01-03 09:55:06 +0100304}
305
306/*
307 * Allow callers to wait for completion of an RPC call
Trond Myklebustbf294b42011-02-21 11:05:41 -0800308 *
309 * Note the use of out_of_line_wait_on_bit() rather than wait_on_bit()
310 * to enforce taking of the wq->lock and hence avoid races with
311 * rpc_complete_task().
Trond Myklebust44c28872006-01-03 09:55:06 +0100312 */
NeilBrownc1221322014-07-07 15:16:04 +1000313int __rpc_wait_for_completion_task(struct rpc_task *task, wait_bit_action_f *action)
Trond Myklebust44c28872006-01-03 09:55:06 +0100314{
315 if (action == NULL)
Matthew Wilcox150030b2007-12-06 16:24:39 -0500316 action = rpc_wait_bit_killable;
Trond Myklebustbf294b42011-02-21 11:05:41 -0800317 return out_of_line_wait_on_bit(&task->tk_runstate, RPC_TASK_ACTIVE,
Matthew Wilcox150030b2007-12-06 16:24:39 -0500318 action, TASK_KILLABLE);
Trond Myklebust44c28872006-01-03 09:55:06 +0100319}
Trond Myklebuste8914c62007-07-14 15:39:59 -0400320EXPORT_SYMBOL_GPL(__rpc_wait_for_completion_task);
Trond Myklebust44c28872006-01-03 09:55:06 +0100321
Linus Torvalds1da177e2005-04-16 15:20:36 -0700322/*
323 * Make an RPC task runnable.
324 *
Jeff Layton506026c2012-07-23 15:51:55 -0400325 * Note: If the task is ASYNC, and is being made runnable after sitting on an
326 * rpc_wait_queue, this must be called with the queue spinlock held to protect
327 * the wait queue operation.
Trond Myklebusta3c3cac2013-05-22 12:57:24 -0400328 * Note the ordering of rpc_test_and_set_running() and rpc_clear_queued(),
329 * which is needed to ensure that __rpc_execute() doesn't loop (due to the
330 * lockless RPC_IS_QUEUED() test) before we've had a chance to test
331 * the RPC_TASK_RUNNING flag.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700332 */
Trond Myklebustf1dc2372016-05-27 12:59:33 -0400333static void rpc_make_runnable(struct workqueue_struct *wq,
334 struct rpc_task *task)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700335{
Trond Myklebusta3c3cac2013-05-22 12:57:24 -0400336 bool need_wakeup = !rpc_test_and_set_running(task);
337
Linus Torvalds1da177e2005-04-16 15:20:36 -0700338 rpc_clear_queued(task);
Trond Myklebusta3c3cac2013-05-22 12:57:24 -0400339 if (!need_wakeup)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700340 return;
341 if (RPC_IS_ASYNC(task)) {
David Howells65f27f32006-11-22 14:55:48 +0000342 INIT_WORK(&task->u.tk_work, rpc_async_schedule);
Trond Myklebustf1dc2372016-05-27 12:59:33 -0400343 queue_work(wq, &task->u.tk_work);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700344 } else
Trond Myklebust96651ab2005-06-22 17:16:21 +0000345 wake_up_bit(&task->tk_runstate, RPC_TASK_QUEUED);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700346}
347
348/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700349 * Prepare for sleeping on a wait queue.
350 * By always appending tasks to the list we ensure FIFO behavior.
351 * NB: An RPC task will only receive interrupt-driven events as long
352 * as it's on a wait queue.
353 */
Trond Myklebust3b27bad2011-07-17 18:11:34 -0400354static void __rpc_sleep_on_priority(struct rpc_wait_queue *q,
355 struct rpc_task *task,
356 rpc_action action,
357 unsigned char queue_priority)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700358{
Chuck Lever46121cf2007-01-31 12:14:08 -0500359 dprintk("RPC: %5u sleep_on(queue \"%s\" time %lu)\n",
360 task->tk_pid, rpc_qname(q), jiffies);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700361
Trond Myklebust82b0a4c2012-01-20 14:52:23 -0500362 trace_rpc_task_sleep(task->tk_client, task, q);
363
Trond Myklebust3b27bad2011-07-17 18:11:34 -0400364 __rpc_add_wait_queue(q, task, queue_priority);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700365
Weston Andros Adamsonf50ad422012-10-23 10:43:46 -0400366 WARN_ON_ONCE(task->tk_callback != NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700367 task->tk_callback = action;
Trond Myklebusteb276c02008-02-22 17:27:59 -0500368 __rpc_add_timer(q, task);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700369}
370
371void rpc_sleep_on(struct rpc_wait_queue *q, struct rpc_task *task,
Trond Myklebust5d008372008-02-22 16:34:17 -0500372 rpc_action action)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700373{
Trond Myklebust58f96122010-07-31 14:29:08 -0400374 /* We shouldn't ever put an inactive task to sleep */
Weston Andros Adamsone454a7a2012-10-23 10:43:32 -0400375 WARN_ON_ONCE(!RPC_IS_ACTIVATED(task));
376 if (!RPC_IS_ACTIVATED(task)) {
377 task->tk_status = -EIO;
378 rpc_put_task_async(task);
379 return;
380 }
Trond Myklebuste6b3c4d2006-11-11 22:18:03 -0500381
Linus Torvalds1da177e2005-04-16 15:20:36 -0700382 /*
383 * Protect the queue operations.
384 */
385 spin_lock_bh(&q->lock);
Trond Myklebust3b27bad2011-07-17 18:11:34 -0400386 __rpc_sleep_on_priority(q, task, action, task->tk_priority);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700387 spin_unlock_bh(&q->lock);
388}
Trond Myklebuste8914c62007-07-14 15:39:59 -0400389EXPORT_SYMBOL_GPL(rpc_sleep_on);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700390
Trond Myklebust3b27bad2011-07-17 18:11:34 -0400391void rpc_sleep_on_priority(struct rpc_wait_queue *q, struct rpc_task *task,
392 rpc_action action, int priority)
393{
394 /* We shouldn't ever put an inactive task to sleep */
Weston Andros Adamsone454a7a2012-10-23 10:43:32 -0400395 WARN_ON_ONCE(!RPC_IS_ACTIVATED(task));
396 if (!RPC_IS_ACTIVATED(task)) {
397 task->tk_status = -EIO;
398 rpc_put_task_async(task);
399 return;
400 }
Trond Myklebust3b27bad2011-07-17 18:11:34 -0400401
402 /*
403 * Protect the queue operations.
404 */
405 spin_lock_bh(&q->lock);
406 __rpc_sleep_on_priority(q, task, action, priority - RPC_PRIORITY_LOW);
407 spin_unlock_bh(&q->lock);
408}
Trond Myklebust1e1093c2012-11-01 16:44:05 -0400409EXPORT_SYMBOL_GPL(rpc_sleep_on_priority);
Trond Myklebust3b27bad2011-07-17 18:11:34 -0400410
Linus Torvalds1da177e2005-04-16 15:20:36 -0700411/**
Trond Myklebustf1dc2372016-05-27 12:59:33 -0400412 * __rpc_do_wake_up_task_on_wq - wake up a single rpc_task
413 * @wq: workqueue on which to run task
Trond Myklebust96ef13b2008-02-22 15:46:41 -0500414 * @queue: wait queue
Linus Torvalds1da177e2005-04-16 15:20:36 -0700415 * @task: task to be woken up
416 *
417 * Caller must hold queue->lock, and have cleared the task queued flag.
418 */
Trond Myklebustf1dc2372016-05-27 12:59:33 -0400419static void __rpc_do_wake_up_task_on_wq(struct workqueue_struct *wq,
420 struct rpc_wait_queue *queue,
421 struct rpc_task *task)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700422{
Chuck Lever46121cf2007-01-31 12:14:08 -0500423 dprintk("RPC: %5u __rpc_wake_up_task (now %lu)\n",
424 task->tk_pid, jiffies);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700425
Linus Torvalds1da177e2005-04-16 15:20:36 -0700426 /* Has the task been executed yet? If not, we cannot wake it up! */
427 if (!RPC_IS_ACTIVATED(task)) {
428 printk(KERN_ERR "RPC: Inactive task (%p) being woken up!\n", task);
429 return;
430 }
431
Trond Myklebust82b0a4c2012-01-20 14:52:23 -0500432 trace_rpc_task_wakeup(task->tk_client, task, queue);
433
Trond Myklebust96ef13b2008-02-22 15:46:41 -0500434 __rpc_remove_wait_queue(queue, task);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700435
Trond Myklebustf1dc2372016-05-27 12:59:33 -0400436 rpc_make_runnable(wq, task);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700437
Chuck Lever46121cf2007-01-31 12:14:08 -0500438 dprintk("RPC: __rpc_wake_up_task done\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700439}
440
441/*
Trond Myklebust96ef13b2008-02-22 15:46:41 -0500442 * Wake up a queued task while the queue lock is being held
Linus Torvalds1da177e2005-04-16 15:20:36 -0700443 */
Trond Myklebustf1dc2372016-05-27 12:59:33 -0400444static void rpc_wake_up_task_on_wq_queue_locked(struct workqueue_struct *wq,
445 struct rpc_wait_queue *queue, struct rpc_task *task)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700446{
Trond Myklebust1166fde62013-03-25 11:23:40 -0400447 if (RPC_IS_QUEUED(task)) {
448 smp_rmb();
449 if (task->tk_waitqueue == queue)
Trond Myklebustf1dc2372016-05-27 12:59:33 -0400450 __rpc_do_wake_up_task_on_wq(wq, queue, task);
Trond Myklebust1166fde62013-03-25 11:23:40 -0400451 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700452}
453
454/*
Trond Myklebustf1dc2372016-05-27 12:59:33 -0400455 * Wake up a queued task while the queue lock is being held
456 */
457static void rpc_wake_up_task_queue_locked(struct rpc_wait_queue *queue, struct rpc_task *task)
458{
459 rpc_wake_up_task_on_wq_queue_locked(rpciod_workqueue, queue, task);
460}
461
462/*
Trond Myklebust96ef13b2008-02-22 15:46:41 -0500463 * Wake up a task on a specific queue
464 */
465void rpc_wake_up_queued_task(struct rpc_wait_queue *queue, struct rpc_task *task)
466{
Trond Myklebust5e4424a2008-02-25 21:53:49 -0800467 spin_lock_bh(&queue->lock);
Trond Myklebust96ef13b2008-02-22 15:46:41 -0500468 rpc_wake_up_task_queue_locked(queue, task);
Trond Myklebust5e4424a2008-02-25 21:53:49 -0800469 spin_unlock_bh(&queue->lock);
Trond Myklebust96ef13b2008-02-22 15:46:41 -0500470}
471EXPORT_SYMBOL_GPL(rpc_wake_up_queued_task);
472
473/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700474 * Wake up the next task on a priority queue.
475 */
Trond Myklebust961a8282012-01-17 22:57:37 -0500476static struct rpc_task *__rpc_find_next_queued_priority(struct rpc_wait_queue *queue)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700477{
478 struct list_head *q;
479 struct rpc_task *task;
480
481 /*
Trond Myklebust3ff75762007-07-14 15:40:00 -0400482 * Service a batch of tasks from a single owner.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700483 */
484 q = &queue->tasks[queue->priority];
485 if (!list_empty(q)) {
486 task = list_entry(q->next, struct rpc_task, u.tk_wait.list);
Trond Myklebust3ff75762007-07-14 15:40:00 -0400487 if (queue->owner == task->tk_owner) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700488 if (--queue->nr)
489 goto out;
490 list_move_tail(&task->u.tk_wait.list, q);
491 }
492 /*
493 * Check if we need to switch queues.
494 */
Trond Myklebustc05eecf2012-11-30 23:59:29 -0500495 goto new_owner;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700496 }
497
498 /*
499 * Service the next queue.
500 */
501 do {
502 if (q == &queue->tasks[0])
503 q = &queue->tasks[queue->maxpriority];
504 else
505 q = q - 1;
506 if (!list_empty(q)) {
507 task = list_entry(q->next, struct rpc_task, u.tk_wait.list);
508 goto new_queue;
509 }
510 } while (q != &queue->tasks[queue->priority]);
511
512 rpc_reset_waitqueue_priority(queue);
513 return NULL;
514
515new_queue:
516 rpc_set_waitqueue_priority(queue, (unsigned int)(q - &queue->tasks[0]));
Trond Myklebust3ff75762007-07-14 15:40:00 -0400517new_owner:
518 rpc_set_waitqueue_owner(queue, task->tk_owner);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700519out:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700520 return task;
521}
522
Trond Myklebust961a8282012-01-17 22:57:37 -0500523static struct rpc_task *__rpc_find_next_queued(struct rpc_wait_queue *queue)
524{
525 if (RPC_IS_PRIORITY(queue))
526 return __rpc_find_next_queued_priority(queue);
527 if (!list_empty(&queue->tasks[0]))
528 return list_first_entry(&queue->tasks[0], struct rpc_task, u.tk_wait.list);
529 return NULL;
530}
531
Linus Torvalds1da177e2005-04-16 15:20:36 -0700532/*
Trond Myklebust961a8282012-01-17 22:57:37 -0500533 * Wake up the first task on the wait queue.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700534 */
Trond Myklebustf1dc2372016-05-27 12:59:33 -0400535struct rpc_task *rpc_wake_up_first_on_wq(struct workqueue_struct *wq,
536 struct rpc_wait_queue *queue,
Trond Myklebust961a8282012-01-17 22:57:37 -0500537 bool (*func)(struct rpc_task *, void *), void *data)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700538{
539 struct rpc_task *task = NULL;
540
Trond Myklebust961a8282012-01-17 22:57:37 -0500541 dprintk("RPC: wake_up_first(%p \"%s\")\n",
Chuck Lever46121cf2007-01-31 12:14:08 -0500542 queue, rpc_qname(queue));
Trond Myklebust5e4424a2008-02-25 21:53:49 -0800543 spin_lock_bh(&queue->lock);
Trond Myklebust961a8282012-01-17 22:57:37 -0500544 task = __rpc_find_next_queued(queue);
545 if (task != NULL) {
546 if (func(task, data))
Trond Myklebustf1dc2372016-05-27 12:59:33 -0400547 rpc_wake_up_task_on_wq_queue_locked(wq, queue, task);
Trond Myklebust961a8282012-01-17 22:57:37 -0500548 else
549 task = NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700550 }
Trond Myklebust5e4424a2008-02-25 21:53:49 -0800551 spin_unlock_bh(&queue->lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700552
553 return task;
554}
Trond Myklebustf1dc2372016-05-27 12:59:33 -0400555
556/*
557 * Wake up the first task on the wait queue.
558 */
559struct rpc_task *rpc_wake_up_first(struct rpc_wait_queue *queue,
560 bool (*func)(struct rpc_task *, void *), void *data)
561{
562 return rpc_wake_up_first_on_wq(rpciod_workqueue, queue, func, data);
563}
Trond Myklebust961a8282012-01-17 22:57:37 -0500564EXPORT_SYMBOL_GPL(rpc_wake_up_first);
565
566static bool rpc_wake_up_next_func(struct rpc_task *task, void *data)
567{
568 return true;
569}
570
571/*
572 * Wake up the next task on the wait queue.
573*/
574struct rpc_task *rpc_wake_up_next(struct rpc_wait_queue *queue)
575{
576 return rpc_wake_up_first(queue, rpc_wake_up_next_func, NULL);
577}
Trond Myklebuste8914c62007-07-14 15:39:59 -0400578EXPORT_SYMBOL_GPL(rpc_wake_up_next);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700579
580/**
581 * rpc_wake_up - wake up all rpc_tasks
582 * @queue: rpc_wait_queue on which the tasks are sleeping
583 *
584 * Grabs queue->lock
585 */
586void rpc_wake_up(struct rpc_wait_queue *queue)
587{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700588 struct list_head *head;
Trond Myklebuste6d83d52006-03-13 21:20:48 -0800589
Trond Myklebust5e4424a2008-02-25 21:53:49 -0800590 spin_lock_bh(&queue->lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700591 head = &queue->tasks[queue->maxpriority];
592 for (;;) {
Trond Myklebust540a0f72012-03-19 13:39:35 -0400593 while (!list_empty(head)) {
594 struct rpc_task *task;
595 task = list_first_entry(head,
596 struct rpc_task,
597 u.tk_wait.list);
Trond Myklebust96ef13b2008-02-22 15:46:41 -0500598 rpc_wake_up_task_queue_locked(queue, task);
Trond Myklebust540a0f72012-03-19 13:39:35 -0400599 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700600 if (head == &queue->tasks[0])
601 break;
602 head--;
603 }
Trond Myklebust5e4424a2008-02-25 21:53:49 -0800604 spin_unlock_bh(&queue->lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700605}
Trond Myklebuste8914c62007-07-14 15:39:59 -0400606EXPORT_SYMBOL_GPL(rpc_wake_up);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700607
608/**
609 * rpc_wake_up_status - wake up all rpc_tasks and set their status value.
610 * @queue: rpc_wait_queue on which the tasks are sleeping
611 * @status: status value to set
612 *
613 * Grabs queue->lock
614 */
615void rpc_wake_up_status(struct rpc_wait_queue *queue, int status)
616{
617 struct list_head *head;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700618
Trond Myklebust5e4424a2008-02-25 21:53:49 -0800619 spin_lock_bh(&queue->lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700620 head = &queue->tasks[queue->maxpriority];
621 for (;;) {
Trond Myklebust540a0f72012-03-19 13:39:35 -0400622 while (!list_empty(head)) {
623 struct rpc_task *task;
624 task = list_first_entry(head,
625 struct rpc_task,
626 u.tk_wait.list);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700627 task->tk_status = status;
Trond Myklebust96ef13b2008-02-22 15:46:41 -0500628 rpc_wake_up_task_queue_locked(queue, task);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700629 }
630 if (head == &queue->tasks[0])
631 break;
632 head--;
633 }
Trond Myklebust5e4424a2008-02-25 21:53:49 -0800634 spin_unlock_bh(&queue->lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700635}
Trond Myklebuste8914c62007-07-14 15:39:59 -0400636EXPORT_SYMBOL_GPL(rpc_wake_up_status);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700637
Trond Myklebust36df9aa2007-07-18 16:18:52 -0400638static void __rpc_queue_timer_fn(unsigned long ptr)
639{
640 struct rpc_wait_queue *queue = (struct rpc_wait_queue *)ptr;
641 struct rpc_task *task, *n;
642 unsigned long expires, now, timeo;
643
644 spin_lock(&queue->lock);
645 expires = now = jiffies;
646 list_for_each_entry_safe(task, n, &queue->timer_list.list, u.tk_wait.timer_list) {
647 timeo = task->u.tk_wait.expires;
648 if (time_after_eq(now, timeo)) {
Trond Myklebust36df9aa2007-07-18 16:18:52 -0400649 dprintk("RPC: %5u timeout\n", task->tk_pid);
650 task->tk_status = -ETIMEDOUT;
651 rpc_wake_up_task_queue_locked(queue, task);
652 continue;
653 }
654 if (expires == now || time_after(expires, timeo))
655 expires = timeo;
656 }
657 if (!list_empty(&queue->timer_list.list))
658 rpc_set_queue_timer(queue, expires);
659 spin_unlock(&queue->lock);
660}
661
Trond Myklebust80147932006-08-31 18:24:08 -0400662static void __rpc_atrun(struct rpc_task *task)
663{
Trond Myklebust6bd14412014-03-20 12:53:54 -0400664 if (task->tk_status == -ETIMEDOUT)
665 task->tk_status = 0;
Trond Myklebust80147932006-08-31 18:24:08 -0400666}
667
Linus Torvalds1da177e2005-04-16 15:20:36 -0700668/*
669 * Run a task at a later time
670 */
Trond Myklebust80147932006-08-31 18:24:08 -0400671void rpc_delay(struct rpc_task *task, unsigned long delay)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700672{
673 task->tk_timeout = delay;
Trond Myklebust5d008372008-02-22 16:34:17 -0500674 rpc_sleep_on(&delay_queue, task, __rpc_atrun);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700675}
Trond Myklebuste8914c62007-07-14 15:39:59 -0400676EXPORT_SYMBOL_GPL(rpc_delay);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700677
Linus Torvalds1da177e2005-04-16 15:20:36 -0700678/*
Trond Myklebust4ce70ad2006-01-03 09:55:05 +0100679 * Helper to call task->tk_ops->rpc_call_prepare
680 */
Andy Adamsonaae20062009-04-01 09:22:40 -0400681void rpc_prepare_task(struct rpc_task *task)
Trond Myklebust4ce70ad2006-01-03 09:55:05 +0100682{
683 task->tk_ops->rpc_call_prepare(task, task->tk_calldata);
684}
685
Trond Myklebust7fdcf132011-12-01 14:00:15 -0500686static void
687rpc_init_task_statistics(struct rpc_task *task)
688{
689 /* Initialize retry counters */
690 task->tk_garb_retry = 2;
691 task->tk_cred_retry = 2;
692 task->tk_rebind_retry = 2;
693
694 /* starting timestamp */
695 task->tk_start = ktime_get();
696}
697
698static void
699rpc_reset_task_statistics(struct rpc_task *task)
700{
701 task->tk_timeouts = 0;
702 task->tk_flags &= ~(RPC_CALL_MAJORSEEN|RPC_TASK_KILLED|RPC_TASK_SENT);
703
704 rpc_init_task_statistics(task);
705}
706
Trond Myklebust4ce70ad2006-01-03 09:55:05 +0100707/*
Trond Myklebust963d8fe2006-01-03 09:55:04 +0100708 * Helper that calls task->tk_ops->rpc_call_done if it exists
Trond Myklebustd05fdb02005-06-22 17:16:19 +0000709 */
Trond Myklebustabbcf282006-01-03 09:55:03 +0100710void rpc_exit_task(struct rpc_task *task)
Trond Myklebustd05fdb02005-06-22 17:16:19 +0000711{
Trond Myklebustabbcf282006-01-03 09:55:03 +0100712 task->tk_action = NULL;
Trond Myklebust963d8fe2006-01-03 09:55:04 +0100713 if (task->tk_ops->rpc_call_done != NULL) {
714 task->tk_ops->rpc_call_done(task, task->tk_calldata);
Trond Myklebustd05fdb02005-06-22 17:16:19 +0000715 if (task->tk_action != NULL) {
Trond Myklebustabbcf282006-01-03 09:55:03 +0100716 WARN_ON(RPC_ASSASSINATED(task));
717 /* Always release the RPC slot and buffer memory */
718 xprt_release(task);
Trond Myklebust7fdcf132011-12-01 14:00:15 -0500719 rpc_reset_task_statistics(task);
Trond Myklebustd05fdb02005-06-22 17:16:19 +0000720 }
721 }
Trond Myklebustd05fdb02005-06-22 17:16:19 +0000722}
Trond Myklebustd9b6cd92010-07-31 14:29:08 -0400723
724void rpc_exit(struct rpc_task *task, int status)
725{
726 task->tk_status = status;
727 task->tk_action = rpc_exit_task;
728 if (RPC_IS_QUEUED(task))
729 rpc_wake_up_queued_task(task->tk_waitqueue, task);
730}
731EXPORT_SYMBOL_GPL(rpc_exit);
Trond Myklebustd05fdb02005-06-22 17:16:19 +0000732
Trond Myklebustbbd5a1f2006-10-18 16:01:05 -0400733void rpc_release_calldata(const struct rpc_call_ops *ops, void *calldata)
734{
Trond Myklebusta86dc492008-06-11 13:37:09 -0400735 if (ops->rpc_release != NULL)
Trond Myklebustbbd5a1f2006-10-18 16:01:05 -0400736 ops->rpc_release(calldata);
Trond Myklebustbbd5a1f2006-10-18 16:01:05 -0400737}
738
Trond Myklebustd05fdb02005-06-22 17:16:19 +0000739/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700740 * This is the RPC `scheduler' (or rather, the finite state machine).
741 */
Trond Myklebust2efef832007-02-03 13:38:41 -0800742static void __rpc_execute(struct rpc_task *task)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700743{
Trond Myklebusteb9b55a2009-03-10 20:33:16 -0400744 struct rpc_wait_queue *queue;
745 int task_is_async = RPC_IS_ASYNC(task);
746 int status = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700747
Chuck Lever46121cf2007-01-31 12:14:08 -0500748 dprintk("RPC: %5u __rpc_execute flags=0x%x\n",
749 task->tk_pid, task->tk_flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700750
Weston Andros Adamson2bd4eef2012-10-23 10:43:47 -0400751 WARN_ON_ONCE(RPC_IS_QUEUED(task));
752 if (RPC_IS_QUEUED(task))
753 return;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700754
Trond Myklebustd05fdb02005-06-22 17:16:19 +0000755 for (;;) {
Trond Myklebustb55c5982011-07-06 19:58:23 -0400756 void (*do_action)(struct rpc_task *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700757
758 /*
Trond Myklebustb55c5982011-07-06 19:58:23 -0400759 * Execute any pending callback first.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700760 */
Trond Myklebustb55c5982011-07-06 19:58:23 -0400761 do_action = task->tk_callback;
762 task->tk_callback = NULL;
763 if (do_action == NULL) {
Trond Myklebuste020c682011-03-15 19:56:30 -0400764 /*
765 * Perform the next FSM step.
Trond Myklebustb55c5982011-07-06 19:58:23 -0400766 * tk_action may be NULL if the task has been killed.
767 * In particular, note that rpc_killall_tasks may
768 * do this at any time, so beware when dereferencing.
Trond Myklebuste020c682011-03-15 19:56:30 -0400769 */
Trond Myklebustb55c5982011-07-06 19:58:23 -0400770 do_action = task->tk_action;
771 if (do_action == NULL)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700772 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700773 }
Trond Myklebust82b0a4c2012-01-20 14:52:23 -0500774 trace_rpc_task_run_action(task->tk_client, task, task->tk_action);
Trond Myklebustb55c5982011-07-06 19:58:23 -0400775 do_action(task);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700776
777 /*
778 * Lockless check for whether task is sleeping or not.
779 */
780 if (!RPC_IS_QUEUED(task))
781 continue;
Trond Myklebusteb9b55a2009-03-10 20:33:16 -0400782 /*
783 * The queue->lock protects against races with
784 * rpc_make_runnable().
785 *
786 * Note that once we clear RPC_TASK_RUNNING on an asynchronous
787 * rpc_task, rpc_make_runnable() can assign it to a
788 * different workqueue. We therefore cannot assume that the
789 * rpc_task pointer may still be dereferenced.
790 */
791 queue = task->tk_waitqueue;
792 spin_lock_bh(&queue->lock);
793 if (!RPC_IS_QUEUED(task)) {
794 spin_unlock_bh(&queue->lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700795 continue;
796 }
Trond Myklebusteb9b55a2009-03-10 20:33:16 -0400797 rpc_clear_running(task);
798 spin_unlock_bh(&queue->lock);
799 if (task_is_async)
800 return;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700801
802 /* sync task: sleep here */
Chuck Lever46121cf2007-01-31 12:14:08 -0500803 dprintk("RPC: %5u sync task going to sleep\n", task->tk_pid);
Trond Myklebust96651ab2005-06-22 17:16:21 +0000804 status = out_of_line_wait_on_bit(&task->tk_runstate,
Matthew Wilcox150030b2007-12-06 16:24:39 -0500805 RPC_TASK_QUEUED, rpc_wait_bit_killable,
806 TASK_KILLABLE);
Trond Myklebust96651ab2005-06-22 17:16:21 +0000807 if (status == -ERESTARTSYS) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700808 /*
809 * When a sync task receives a signal, it exits with
810 * -ERESTARTSYS. In order to catch any callbacks that
811 * clean up after sleeping on some queue, we don't
812 * break the loop here, but go around once more.
813 */
Chuck Lever46121cf2007-01-31 12:14:08 -0500814 dprintk("RPC: %5u got signal\n", task->tk_pid);
Trond Myklebust96651ab2005-06-22 17:16:21 +0000815 task->tk_flags |= RPC_TASK_KILLED;
816 rpc_exit(task, -ERESTARTSYS);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700817 }
Chuck Lever46121cf2007-01-31 12:14:08 -0500818 dprintk("RPC: %5u sync task resuming\n", task->tk_pid);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700819 }
820
Chuck Lever46121cf2007-01-31 12:14:08 -0500821 dprintk("RPC: %5u return %d, status %d\n", task->tk_pid, status,
822 task->tk_status);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700823 /* Release all resources associated with the task */
824 rpc_release_task(task);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700825}
826
827/*
828 * User-visible entry point to the scheduler.
829 *
830 * This may be called recursively if e.g. an async NFS task updates
831 * the attributes and finds that dirty pages must be flushed.
832 * NOTE: Upon exit of this function the task is guaranteed to be
833 * released. In particular note that tk_release() will have
834 * been called, so your task memory may have been freed.
835 */
Trond Myklebust2efef832007-02-03 13:38:41 -0800836void rpc_execute(struct rpc_task *task)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700837{
Trond Myklebusta76580f2013-05-20 23:00:18 -0400838 bool is_async = RPC_IS_ASYNC(task);
839
Trond Myklebust44c28872006-01-03 09:55:06 +0100840 rpc_set_active(task);
Trond Myklebustf1dc2372016-05-27 12:59:33 -0400841 rpc_make_runnable(rpciod_workqueue, task);
Trond Myklebusta76580f2013-05-20 23:00:18 -0400842 if (!is_async)
Trond Myklebustd6a1ed02010-07-31 14:29:08 -0400843 __rpc_execute(task);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700844}
845
David Howells65f27f32006-11-22 14:55:48 +0000846static void rpc_async_schedule(struct work_struct *work)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700847{
David Howells65f27f32006-11-22 14:55:48 +0000848 __rpc_execute(container_of(work, struct rpc_task, u.tk_work));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700849}
850
Chuck Lever02107142006-01-03 09:55:49 +0100851/**
Chuck Lever5fe6eaa2016-09-15 10:55:20 -0400852 * rpc_malloc - allocate RPC buffer resources
853 * @task: RPC task
854 *
855 * A single memory region is allocated, which is split between the
856 * RPC call and RPC reply that this task is being used for. When
857 * this RPC is retired, the memory is released by calling rpc_free.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700858 *
Chuck Leverc5a4dd82007-03-29 16:47:58 -0400859 * To prevent rpciod from hanging, this allocator never sleeps,
Chuck Lever5fe6eaa2016-09-15 10:55:20 -0400860 * returning -ENOMEM and suppressing warning if the request cannot
861 * be serviced immediately. The caller can arrange to sleep in a
862 * way that is safe for rpciod.
Chuck Leverc5a4dd82007-03-29 16:47:58 -0400863 *
864 * Most requests are 'small' (under 2KiB) and can be serviced from a
865 * mempool, ensuring that NFS reads and writes can always proceed,
866 * and that there is good locality of reference for these buffers.
867 *
Linus Torvalds1da177e2005-04-16 15:20:36 -0700868 * In order to avoid memory starvation triggering more writebacks of
Chuck Leverc5a4dd82007-03-29 16:47:58 -0400869 * NFS requests, we avoid using GFP_KERNEL.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700870 */
Chuck Lever5fe6eaa2016-09-15 10:55:20 -0400871int rpc_malloc(struct rpc_task *task)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700872{
Chuck Lever5fe6eaa2016-09-15 10:55:20 -0400873 struct rpc_rqst *rqst = task->tk_rqstp;
874 size_t size = rqst->rq_callsize + rqst->rq_rcvsize;
Chuck Leveraa3d1fa2007-05-08 18:23:28 -0400875 struct rpc_buffer *buf;
Trond Myklebustc4a7ca72015-01-23 14:50:56 -0500876 gfp_t gfp = GFP_NOIO | __GFP_NOWARN;
Mel Gormana564b8f2012-07-31 16:45:12 -0700877
878 if (RPC_IS_SWAPPER(task))
Trond Myklebustc4a7ca72015-01-23 14:50:56 -0500879 gfp = __GFP_MEMALLOC | GFP_NOWAIT | __GFP_NOWARN;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700880
Chuck Leveraa3d1fa2007-05-08 18:23:28 -0400881 size += sizeof(struct rpc_buffer);
Chuck Leverc5a4dd82007-03-29 16:47:58 -0400882 if (size <= RPC_BUFFER_MAXSIZE)
883 buf = mempool_alloc(rpc_buffer_mempool, gfp);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700884 else
Chuck Leverc5a4dd82007-03-29 16:47:58 -0400885 buf = kmalloc(size, gfp);
Peter Zijlstraddce40d2007-05-09 08:30:11 +0200886
887 if (!buf)
Chuck Lever5fe6eaa2016-09-15 10:55:20 -0400888 return -ENOMEM;
Peter Zijlstraddce40d2007-05-09 08:30:11 +0200889
Chuck Leveraa3d1fa2007-05-08 18:23:28 -0400890 buf->len = size;
Geert Uytterhoeven215d0672007-05-08 11:37:26 +0200891 dprintk("RPC: %5u allocated buffer of size %zu at %p\n",
Chuck Leverc5a4dd82007-03-29 16:47:58 -0400892 task->tk_pid, size, buf);
Chuck Lever5fe6eaa2016-09-15 10:55:20 -0400893 rqst->rq_buffer = buf->data;
Chuck Lever68778942016-09-15 10:55:37 -0400894 rqst->rq_rbuffer = (char *)rqst->rq_buffer + rqst->rq_callsize;
Chuck Lever5fe6eaa2016-09-15 10:55:20 -0400895 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700896}
\"Talpey, Thomas\12444802007-09-10 13:45:36 -0400897EXPORT_SYMBOL_GPL(rpc_malloc);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700898
Chuck Lever02107142006-01-03 09:55:49 +0100899/**
Chuck Lever3435c742016-09-15 10:55:29 -0400900 * rpc_free - free RPC buffer resources allocated via rpc_malloc
901 * @task: RPC task
Chuck Lever02107142006-01-03 09:55:49 +0100902 *
903 */
Chuck Lever3435c742016-09-15 10:55:29 -0400904void rpc_free(struct rpc_task *task)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700905{
Chuck Lever3435c742016-09-15 10:55:29 -0400906 void *buffer = task->tk_rqstp->rq_buffer;
Chuck Leveraa3d1fa2007-05-08 18:23:28 -0400907 size_t size;
908 struct rpc_buffer *buf;
Chuck Lever02107142006-01-03 09:55:49 +0100909
Chuck Leveraa3d1fa2007-05-08 18:23:28 -0400910 buf = container_of(buffer, struct rpc_buffer, data);
911 size = buf->len;
Chuck Leverc5a4dd82007-03-29 16:47:58 -0400912
Geert Uytterhoeven215d0672007-05-08 11:37:26 +0200913 dprintk("RPC: freeing buffer of size %zu at %p\n",
Chuck Leverc5a4dd82007-03-29 16:47:58 -0400914 size, buf);
Chuck Leveraa3d1fa2007-05-08 18:23:28 -0400915
Chuck Leverc5a4dd82007-03-29 16:47:58 -0400916 if (size <= RPC_BUFFER_MAXSIZE)
917 mempool_free(buf, rpc_buffer_mempool);
918 else
919 kfree(buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700920}
\"Talpey, Thomas\12444802007-09-10 13:45:36 -0400921EXPORT_SYMBOL_GPL(rpc_free);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700922
923/*
924 * Creation and deletion of RPC task structures
925 */
Trond Myklebust47fe0642007-10-25 18:42:55 -0400926static void rpc_init_task(struct rpc_task *task, const struct rpc_task_setup *task_setup_data)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700927{
928 memset(task, 0, sizeof(*task));
Trond Myklebust44c28872006-01-03 09:55:06 +0100929 atomic_set(&task->tk_count, 1);
Trond Myklebust84115e12007-07-14 15:39:59 -0400930 task->tk_flags = task_setup_data->flags;
931 task->tk_ops = task_setup_data->callback_ops;
932 task->tk_calldata = task_setup_data->callback_data;
Trond Myklebust6529eba2007-06-14 16:40:14 -0400933 INIT_LIST_HEAD(&task->tk_task);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700934
Trond Myklebust3ff75762007-07-14 15:40:00 -0400935 task->tk_priority = task_setup_data->priority - RPC_PRIORITY_LOW;
936 task->tk_owner = current->tgid;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700937
938 /* Initialize workqueue for async tasks */
Trond Myklebust32bfb5c2008-02-19 20:04:21 -0500939 task->tk_workqueue = task_setup_data->workqueue;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700940
Trond Myklebust9d614982016-01-30 18:13:05 -0500941 task->tk_xprt = xprt_get(task_setup_data->rpc_xprt);
942
Trond Myklebust84115e12007-07-14 15:39:59 -0400943 if (task->tk_ops->rpc_call_prepare != NULL)
944 task->tk_action = rpc_prepare_task;
Trond Myklebust963d8fe2006-01-03 09:55:04 +0100945
Trond Myklebust7fdcf132011-12-01 14:00:15 -0500946 rpc_init_task_statistics(task);
Chuck Leveref759a22006-03-20 13:44:17 -0500947
Chuck Lever46121cf2007-01-31 12:14:08 -0500948 dprintk("RPC: new task initialized, procpid %u\n",
Pavel Emelyanovba25f9d2007-10-18 23:40:40 -0700949 task_pid_nr(current));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700950}
951
952static struct rpc_task *
953rpc_alloc_task(void)
954{
Mel Gormana564b8f2012-07-31 16:45:12 -0700955 return (struct rpc_task *)mempool_alloc(rpc_task_mempool, GFP_NOIO);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700956}
957
Linus Torvalds1da177e2005-04-16 15:20:36 -0700958/*
Trond Myklebust90c57552007-06-09 19:49:36 -0400959 * Create a new task for the specified client.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700960 */
Trond Myklebust84115e12007-07-14 15:39:59 -0400961struct rpc_task *rpc_new_task(const struct rpc_task_setup *setup_data)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700962{
Trond Myklebuste8f5d772007-10-25 18:42:53 -0400963 struct rpc_task *task = setup_data->task;
964 unsigned short flags = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700965
Trond Myklebuste8f5d772007-10-25 18:42:53 -0400966 if (task == NULL) {
967 task = rpc_alloc_task();
Trond Myklebust19445b92010-04-16 16:41:10 -0400968 if (task == NULL) {
969 rpc_release_calldata(setup_data->callback_ops,
970 setup_data->callback_data);
971 return ERR_PTR(-ENOMEM);
972 }
Trond Myklebuste8f5d772007-10-25 18:42:53 -0400973 flags = RPC_TASK_DYNAMIC;
974 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700975
Trond Myklebust84115e12007-07-14 15:39:59 -0400976 rpc_init_task(task, setup_data);
Trond Myklebuste8f5d772007-10-25 18:42:53 -0400977 task->tk_flags |= flags;
Chuck Lever46121cf2007-01-31 12:14:08 -0500978 dprintk("RPC: allocated task %p\n", task);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700979 return task;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700980}
981
Trond Myklebustc6567ed2013-01-04 12:23:21 -0500982/*
983 * rpc_free_task - release rpc task and perform cleanups
984 *
985 * Note that we free up the rpc_task _after_ rpc_release_calldata()
986 * in order to work around a workqueue dependency issue.
987 *
988 * Tejun Heo states:
989 * "Workqueue currently considers two work items to be the same if they're
990 * on the same address and won't execute them concurrently - ie. it
991 * makes a work item which is queued again while being executed wait
992 * for the previous execution to complete.
993 *
994 * If a work function frees the work item, and then waits for an event
995 * which should be performed by another work item and *that* work item
996 * recycles the freed work item, it can create a false dependency loop.
997 * There really is no reliable way to detect this short of verifying
998 * every memory free."
999 *
1000 */
Trond Myklebust32bfb5c2008-02-19 20:04:21 -05001001static void rpc_free_task(struct rpc_task *task)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001002{
Trond Myklebustc6567ed2013-01-04 12:23:21 -05001003 unsigned short tk_flags = task->tk_flags;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001004
Trond Myklebustc6567ed2013-01-04 12:23:21 -05001005 rpc_release_calldata(task->tk_ops, task->tk_calldata);
1006
1007 if (tk_flags & RPC_TASK_DYNAMIC) {
Trond Myklebust5e4424a2008-02-25 21:53:49 -08001008 dprintk("RPC: %5u freeing task\n", task->tk_pid);
1009 mempool_free(task, rpc_task_mempool);
1010 }
Trond Myklebust32bfb5c2008-02-19 20:04:21 -05001011}
1012
1013static void rpc_async_release(struct work_struct *work)
1014{
1015 rpc_free_task(container_of(work, struct rpc_task, u.tk_work));
1016}
1017
Trond Myklebustbf294b42011-02-21 11:05:41 -08001018static void rpc_release_resources_task(struct rpc_task *task)
Trond Myklebust32bfb5c2008-02-19 20:04:21 -05001019{
Trond Myklebust87ed5002013-01-07 14:30:46 -05001020 xprt_release(task);
OGAWA Hirofumia271c5a2011-03-27 17:48:57 +02001021 if (task->tk_msg.rpc_cred) {
Trond Myklebusta17c2152010-07-31 14:29:08 -04001022 put_rpccred(task->tk_msg.rpc_cred);
OGAWA Hirofumia271c5a2011-03-27 17:48:57 +02001023 task->tk_msg.rpc_cred = NULL;
1024 }
Trond Myklebust58f96122010-07-31 14:29:08 -04001025 rpc_task_release_client(task);
Trond Myklebustbf294b42011-02-21 11:05:41 -08001026}
1027
1028static void rpc_final_put_task(struct rpc_task *task,
1029 struct workqueue_struct *q)
1030{
1031 if (q != NULL) {
Trond Myklebust32bfb5c2008-02-19 20:04:21 -05001032 INIT_WORK(&task->u.tk_work, rpc_async_release);
Trond Myklebustbf294b42011-02-21 11:05:41 -08001033 queue_work(q, &task->u.tk_work);
Trond Myklebust32bfb5c2008-02-19 20:04:21 -05001034 } else
1035 rpc_free_task(task);
Trond Myklebuste6b3c4d2006-11-11 22:18:03 -05001036}
Trond Myklebustbf294b42011-02-21 11:05:41 -08001037
1038static void rpc_do_put_task(struct rpc_task *task, struct workqueue_struct *q)
1039{
1040 if (atomic_dec_and_test(&task->tk_count)) {
1041 rpc_release_resources_task(task);
1042 rpc_final_put_task(task, q);
1043 }
1044}
1045
1046void rpc_put_task(struct rpc_task *task)
1047{
1048 rpc_do_put_task(task, NULL);
1049}
Trond Myklebuste8914c62007-07-14 15:39:59 -04001050EXPORT_SYMBOL_GPL(rpc_put_task);
Trond Myklebuste6b3c4d2006-11-11 22:18:03 -05001051
Trond Myklebustbf294b42011-02-21 11:05:41 -08001052void rpc_put_task_async(struct rpc_task *task)
1053{
1054 rpc_do_put_task(task, task->tk_workqueue);
1055}
1056EXPORT_SYMBOL_GPL(rpc_put_task_async);
1057
Trond Myklebustbde8f002007-01-24 11:54:53 -08001058static void rpc_release_task(struct rpc_task *task)
Trond Myklebuste6b3c4d2006-11-11 22:18:03 -05001059{
Chuck Lever46121cf2007-01-31 12:14:08 -05001060 dprintk("RPC: %5u release task\n", task->tk_pid);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001061
Weston Andros Adamson0a0c2a52012-10-23 10:43:49 -04001062 WARN_ON_ONCE(RPC_IS_QUEUED(task));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001063
Trond Myklebustbf294b42011-02-21 11:05:41 -08001064 rpc_release_resources_task(task);
Trond Myklebuste6b3c4d2006-11-11 22:18:03 -05001065
Trond Myklebustbf294b42011-02-21 11:05:41 -08001066 /*
1067 * Note: at this point we have been removed from rpc_clnt->cl_tasks,
1068 * so it should be safe to use task->tk_count as a test for whether
1069 * or not any other processes still hold references to our rpc_task.
1070 */
1071 if (atomic_read(&task->tk_count) != 1 + !RPC_IS_ASYNC(task)) {
1072 /* Wake up anyone who may be waiting for task completion */
1073 if (!rpc_complete_task(task))
1074 return;
1075 } else {
1076 if (!atomic_dec_and_test(&task->tk_count))
1077 return;
1078 }
1079 rpc_final_put_task(task, task->tk_workqueue);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001080}
1081
Trond Myklebustb247bbf2007-07-19 16:32:20 -04001082int rpciod_up(void)
1083{
1084 return try_module_get(THIS_MODULE) ? 0 : -EINVAL;
1085}
1086
1087void rpciod_down(void)
1088{
1089 module_put(THIS_MODULE);
1090}
1091
Linus Torvalds1da177e2005-04-16 15:20:36 -07001092/*
Trond Myklebustb247bbf2007-07-19 16:32:20 -04001093 * Start up the rpciod workqueue.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001094 */
Trond Myklebustb247bbf2007-07-19 16:32:20 -04001095static int rpciod_start(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001096{
1097 struct workqueue_struct *wq;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001098
Linus Torvalds1da177e2005-04-16 15:20:36 -07001099 /*
1100 * Create the rpciod thread and wait for it to start.
1101 */
Trond Myklebustab418d72007-06-14 17:08:36 -04001102 dprintk("RPC: creating workqueue rpciod\n");
Trond Myklebust40a5f1b2016-05-27 10:39:50 -04001103 wq = alloc_workqueue("rpciod", WQ_MEM_RECLAIM, 0);
1104 if (!wq)
1105 goto out_failed;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001106 rpciod_workqueue = wq;
Trond Myklebust40a5f1b2016-05-27 10:39:50 -04001107 /* Note: highpri because network receive is latency sensitive */
1108 wq = alloc_workqueue("xprtiod", WQ_MEM_RECLAIM | WQ_HIGHPRI, 0);
1109 if (!wq)
1110 goto free_rpciod;
1111 xprtiod_workqueue = wq;
1112 return 1;
1113free_rpciod:
1114 wq = rpciod_workqueue;
1115 rpciod_workqueue = NULL;
1116 destroy_workqueue(wq);
1117out_failed:
1118 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001119}
1120
Trond Myklebustb247bbf2007-07-19 16:32:20 -04001121static void rpciod_stop(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001122{
Trond Myklebustb247bbf2007-07-19 16:32:20 -04001123 struct workqueue_struct *wq = NULL;
Trond Myklebustab418d72007-06-14 17:08:36 -04001124
Trond Myklebustb247bbf2007-07-19 16:32:20 -04001125 if (rpciod_workqueue == NULL)
1126 return;
Trond Myklebustab418d72007-06-14 17:08:36 -04001127 dprintk("RPC: destroying workqueue rpciod\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -07001128
Trond Myklebustb247bbf2007-07-19 16:32:20 -04001129 wq = rpciod_workqueue;
1130 rpciod_workqueue = NULL;
1131 destroy_workqueue(wq);
Trond Myklebust40a5f1b2016-05-27 10:39:50 -04001132 wq = xprtiod_workqueue;
1133 xprtiod_workqueue = NULL;
1134 destroy_workqueue(wq);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001135}
1136
Linus Torvalds1da177e2005-04-16 15:20:36 -07001137void
1138rpc_destroy_mempool(void)
1139{
Trond Myklebustb247bbf2007-07-19 16:32:20 -04001140 rpciod_stop();
Julia Lawall17a96182015-09-13 14:15:07 +02001141 mempool_destroy(rpc_buffer_mempool);
1142 mempool_destroy(rpc_task_mempool);
1143 kmem_cache_destroy(rpc_task_slabp);
1144 kmem_cache_destroy(rpc_buffer_slabp);
Trond Myklebustf6a1cc82008-02-22 17:06:55 -05001145 rpc_destroy_wait_queue(&delay_queue);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001146}
1147
1148int
1149rpc_init_mempool(void)
1150{
Trond Myklebustf6a1cc82008-02-22 17:06:55 -05001151 /*
1152 * The following is not strictly a mempool initialisation,
1153 * but there is no harm in doing it here
1154 */
1155 rpc_init_wait_queue(&delay_queue, "delayq");
1156 if (!rpciod_start())
1157 goto err_nomem;
1158
Linus Torvalds1da177e2005-04-16 15:20:36 -07001159 rpc_task_slabp = kmem_cache_create("rpc_tasks",
1160 sizeof(struct rpc_task),
1161 0, SLAB_HWCACHE_ALIGN,
Paul Mundt20c2df82007-07-20 10:11:58 +09001162 NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001163 if (!rpc_task_slabp)
1164 goto err_nomem;
1165 rpc_buffer_slabp = kmem_cache_create("rpc_buffers",
1166 RPC_BUFFER_MAXSIZE,
1167 0, SLAB_HWCACHE_ALIGN,
Paul Mundt20c2df82007-07-20 10:11:58 +09001168 NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001169 if (!rpc_buffer_slabp)
1170 goto err_nomem;
Matthew Dobson93d23412006-03-26 01:37:50 -08001171 rpc_task_mempool = mempool_create_slab_pool(RPC_TASK_POOLSIZE,
1172 rpc_task_slabp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001173 if (!rpc_task_mempool)
1174 goto err_nomem;
Matthew Dobson93d23412006-03-26 01:37:50 -08001175 rpc_buffer_mempool = mempool_create_slab_pool(RPC_BUFFER_POOLSIZE,
1176 rpc_buffer_slabp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001177 if (!rpc_buffer_mempool)
1178 goto err_nomem;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001179 return 0;
1180err_nomem:
1181 rpc_destroy_mempool();
1182 return -ENOMEM;
1183}