Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
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> | |
cca5172a | 7 | * |
1da177e4 LT |
8 | * 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> | |
1da177e4 | 19 | #include <linux/spinlock.h> |
4a3e2f71 | 20 | #include <linux/mutex.h> |
1da177e4 LT |
21 | |
22 | #include <linux/sunrpc/clnt.h> | |
1da177e4 | 23 | |
6951867b BH |
24 | #include "sunrpc.h" |
25 | ||
1da177e4 LT |
26 | #ifdef RPC_DEBUG |
27 | #define RPCDBG_FACILITY RPCDBG_SCHED | |
28 | #define RPC_TASK_MAGIC_ID 0xf00baa | |
1da177e4 LT |
29 | #endif |
30 | ||
31 | /* | |
32 | * RPC slabs and memory pools | |
33 | */ | |
34 | #define RPC_BUFFER_MAXSIZE (2048) | |
35 | #define RPC_BUFFER_POOLSIZE (8) | |
36 | #define RPC_TASK_POOLSIZE (8) | |
e18b890b CL |
37 | static struct kmem_cache *rpc_task_slabp __read_mostly; |
38 | static struct kmem_cache *rpc_buffer_slabp __read_mostly; | |
ba89966c ED |
39 | static mempool_t *rpc_task_mempool __read_mostly; |
40 | static mempool_t *rpc_buffer_mempool __read_mostly; | |
1da177e4 | 41 | |
65f27f38 | 42 | static void rpc_async_schedule(struct work_struct *); |
bde8f00c | 43 | static void rpc_release_task(struct rpc_task *task); |
36df9aae | 44 | static void __rpc_queue_timer_fn(unsigned long ptr); |
1da177e4 | 45 | |
1da177e4 LT |
46 | /* |
47 | * RPC tasks sit here while waiting for conditions to improve. | |
48 | */ | |
a4a87499 | 49 | static struct rpc_wait_queue delay_queue; |
1da177e4 | 50 | |
1da177e4 LT |
51 | /* |
52 | * rpciod-related stuff | |
53 | */ | |
24c5d9d7 | 54 | struct workqueue_struct *rpciod_workqueue; |
1da177e4 | 55 | |
1da177e4 LT |
56 | /* |
57 | * Disable the timer for a given RPC task. Should be called with | |
58 | * queue->lock and bh_disabled in order to avoid races within | |
59 | * rpc_run_timer(). | |
60 | */ | |
5d00837b | 61 | static void |
eb276c0e | 62 | __rpc_disable_timer(struct rpc_wait_queue *queue, struct rpc_task *task) |
1da177e4 | 63 | { |
36df9aae TM |
64 | if (task->tk_timeout == 0) |
65 | return; | |
46121cf7 | 66 | dprintk("RPC: %5u disabling timer\n", task->tk_pid); |
1da177e4 | 67 | task->tk_timeout = 0; |
36df9aae | 68 | list_del(&task->u.tk_wait.timer_list); |
eb276c0e TM |
69 | if (list_empty(&queue->timer_list.list)) |
70 | del_timer(&queue->timer_list.timer); | |
36df9aae TM |
71 | } |
72 | ||
73 | static void | |
74 | rpc_set_queue_timer(struct rpc_wait_queue *queue, unsigned long expires) | |
75 | { | |
76 | queue->timer_list.expires = expires; | |
77 | mod_timer(&queue->timer_list.timer, expires); | |
1da177e4 LT |
78 | } |
79 | ||
1da177e4 LT |
80 | /* |
81 | * Set up a timer for the current task. | |
82 | */ | |
5d00837b | 83 | static void |
eb276c0e | 84 | __rpc_add_timer(struct rpc_wait_queue *queue, struct rpc_task *task) |
1da177e4 LT |
85 | { |
86 | if (!task->tk_timeout) | |
87 | return; | |
88 | ||
46121cf7 | 89 | dprintk("RPC: %5u setting alarm for %lu ms\n", |
1da177e4 LT |
90 | task->tk_pid, task->tk_timeout * 1000 / HZ); |
91 | ||
eb276c0e TM |
92 | task->u.tk_wait.expires = jiffies + task->tk_timeout; |
93 | if (list_empty(&queue->timer_list.list) || time_before(task->u.tk_wait.expires, queue->timer_list.expires)) | |
94 | rpc_set_queue_timer(queue, task->u.tk_wait.expires); | |
95 | list_add(&task->u.tk_wait.timer_list, &queue->timer_list.list); | |
1da177e4 LT |
96 | } |
97 | ||
98 | /* | |
99 | * Add new request to a priority queue. | |
100 | */ | |
101 | static void __rpc_add_wait_queue_priority(struct rpc_wait_queue *queue, struct rpc_task *task) | |
102 | { | |
103 | struct list_head *q; | |
104 | struct rpc_task *t; | |
105 | ||
106 | INIT_LIST_HEAD(&task->u.tk_wait.links); | |
107 | q = &queue->tasks[task->tk_priority]; | |
108 | if (unlikely(task->tk_priority > queue->maxpriority)) | |
109 | q = &queue->tasks[queue->maxpriority]; | |
110 | list_for_each_entry(t, q, u.tk_wait.list) { | |
3ff7576d | 111 | if (t->tk_owner == task->tk_owner) { |
1da177e4 LT |
112 | list_add_tail(&task->u.tk_wait.list, &t->u.tk_wait.links); |
113 | return; | |
114 | } | |
115 | } | |
116 | list_add_tail(&task->u.tk_wait.list, q); | |
117 | } | |
118 | ||
119 | /* | |
120 | * Add new request to wait queue. | |
121 | * | |
122 | * Swapper tasks always get inserted at the head of the queue. | |
123 | * This should avoid many nasty memory deadlocks and hopefully | |
124 | * improve overall performance. | |
125 | * Everyone else gets appended to the queue to ensure proper FIFO behavior. | |
126 | */ | |
127 | static void __rpc_add_wait_queue(struct rpc_wait_queue *queue, struct rpc_task *task) | |
128 | { | |
129 | BUG_ON (RPC_IS_QUEUED(task)); | |
130 | ||
131 | if (RPC_IS_PRIORITY(queue)) | |
132 | __rpc_add_wait_queue_priority(queue, task); | |
133 | else if (RPC_IS_SWAPPER(task)) | |
134 | list_add(&task->u.tk_wait.list, &queue->tasks[0]); | |
135 | else | |
136 | list_add_tail(&task->u.tk_wait.list, &queue->tasks[0]); | |
96ef13b2 | 137 | task->tk_waitqueue = queue; |
e19b63da | 138 | queue->qlen++; |
1da177e4 LT |
139 | rpc_set_queued(task); |
140 | ||
46121cf7 CL |
141 | dprintk("RPC: %5u added to queue %p \"%s\"\n", |
142 | task->tk_pid, queue, rpc_qname(queue)); | |
1da177e4 LT |
143 | } |
144 | ||
145 | /* | |
146 | * Remove request from a priority queue. | |
147 | */ | |
148 | static void __rpc_remove_wait_queue_priority(struct rpc_task *task) | |
149 | { | |
150 | struct rpc_task *t; | |
151 | ||
152 | if (!list_empty(&task->u.tk_wait.links)) { | |
153 | t = list_entry(task->u.tk_wait.links.next, struct rpc_task, u.tk_wait.list); | |
154 | list_move(&t->u.tk_wait.list, &task->u.tk_wait.list); | |
155 | list_splice_init(&task->u.tk_wait.links, &t->u.tk_wait.links); | |
156 | } | |
1da177e4 LT |
157 | } |
158 | ||
159 | /* | |
160 | * Remove request from queue. | |
161 | * Note: must be called with spin lock held. | |
162 | */ | |
96ef13b2 | 163 | static void __rpc_remove_wait_queue(struct rpc_wait_queue *queue, struct rpc_task *task) |
1da177e4 | 164 | { |
eb276c0e | 165 | __rpc_disable_timer(queue, task); |
1da177e4 LT |
166 | if (RPC_IS_PRIORITY(queue)) |
167 | __rpc_remove_wait_queue_priority(task); | |
36df9aae | 168 | list_del(&task->u.tk_wait.list); |
e19b63da | 169 | queue->qlen--; |
46121cf7 CL |
170 | dprintk("RPC: %5u removed from queue %p \"%s\"\n", |
171 | task->tk_pid, queue, rpc_qname(queue)); | |
1da177e4 LT |
172 | } |
173 | ||
174 | static inline void rpc_set_waitqueue_priority(struct rpc_wait_queue *queue, int priority) | |
175 | { | |
176 | queue->priority = priority; | |
177 | queue->count = 1 << (priority * 2); | |
178 | } | |
179 | ||
3ff7576d | 180 | static inline void rpc_set_waitqueue_owner(struct rpc_wait_queue *queue, pid_t pid) |
1da177e4 | 181 | { |
3ff7576d | 182 | queue->owner = pid; |
1da177e4 LT |
183 | queue->nr = RPC_BATCH_COUNT; |
184 | } | |
185 | ||
186 | static inline void rpc_reset_waitqueue_priority(struct rpc_wait_queue *queue) | |
187 | { | |
188 | rpc_set_waitqueue_priority(queue, queue->maxpriority); | |
3ff7576d | 189 | rpc_set_waitqueue_owner(queue, 0); |
1da177e4 LT |
190 | } |
191 | ||
3ff7576d | 192 | static void __rpc_init_priority_wait_queue(struct rpc_wait_queue *queue, const char *qname, unsigned char nr_queues) |
1da177e4 LT |
193 | { |
194 | int i; | |
195 | ||
196 | spin_lock_init(&queue->lock); | |
197 | for (i = 0; i < ARRAY_SIZE(queue->tasks); i++) | |
198 | INIT_LIST_HEAD(&queue->tasks[i]); | |
3ff7576d | 199 | queue->maxpriority = nr_queues - 1; |
1da177e4 | 200 | rpc_reset_waitqueue_priority(queue); |
36df9aae TM |
201 | queue->qlen = 0; |
202 | setup_timer(&queue->timer_list.timer, __rpc_queue_timer_fn, (unsigned long)queue); | |
203 | INIT_LIST_HEAD(&queue->timer_list.list); | |
1da177e4 LT |
204 | #ifdef RPC_DEBUG |
205 | queue->name = qname; | |
206 | #endif | |
207 | } | |
208 | ||
209 | void rpc_init_priority_wait_queue(struct rpc_wait_queue *queue, const char *qname) | |
210 | { | |
3ff7576d | 211 | __rpc_init_priority_wait_queue(queue, qname, RPC_NR_PRIORITY); |
1da177e4 LT |
212 | } |
213 | ||
214 | void rpc_init_wait_queue(struct rpc_wait_queue *queue, const char *qname) | |
215 | { | |
3ff7576d | 216 | __rpc_init_priority_wait_queue(queue, qname, 1); |
1da177e4 | 217 | } |
e8914c65 | 218 | EXPORT_SYMBOL_GPL(rpc_init_wait_queue); |
1da177e4 | 219 | |
f6a1cc89 TM |
220 | void rpc_destroy_wait_queue(struct rpc_wait_queue *queue) |
221 | { | |
36df9aae | 222 | del_timer_sync(&queue->timer_list.timer); |
f6a1cc89 TM |
223 | } |
224 | EXPORT_SYMBOL_GPL(rpc_destroy_wait_queue); | |
225 | ||
150030b7 | 226 | static int rpc_wait_bit_killable(void *word) |
44c28873 | 227 | { |
150030b7 | 228 | if (fatal_signal_pending(current)) |
44c28873 TM |
229 | return -ERESTARTSYS; |
230 | schedule(); | |
231 | return 0; | |
232 | } | |
233 | ||
c44fe705 TM |
234 | #ifdef RPC_DEBUG |
235 | static void rpc_task_set_debuginfo(struct rpc_task *task) | |
236 | { | |
237 | static atomic_t rpc_pid; | |
238 | ||
239 | task->tk_magic = RPC_TASK_MAGIC_ID; | |
240 | task->tk_pid = atomic_inc_return(&rpc_pid); | |
241 | } | |
242 | #else | |
243 | static inline void rpc_task_set_debuginfo(struct rpc_task *task) | |
244 | { | |
245 | } | |
246 | #endif | |
247 | ||
e6b3c4db TM |
248 | static void rpc_set_active(struct rpc_task *task) |
249 | { | |
4bef61ff | 250 | struct rpc_clnt *clnt; |
e6b3c4db TM |
251 | if (test_and_set_bit(RPC_TASK_ACTIVE, &task->tk_runstate) != 0) |
252 | return; | |
c44fe705 | 253 | rpc_task_set_debuginfo(task); |
e6b3c4db | 254 | /* Add to global list of all tasks */ |
4bef61ff TM |
255 | clnt = task->tk_client; |
256 | if (clnt != NULL) { | |
257 | spin_lock(&clnt->cl_lock); | |
258 | list_add_tail(&task->tk_task, &clnt->cl_tasks); | |
259 | spin_unlock(&clnt->cl_lock); | |
260 | } | |
e6b3c4db TM |
261 | } |
262 | ||
44c28873 TM |
263 | /* |
264 | * Mark an RPC call as having completed by clearing the 'active' bit | |
265 | */ | |
e6b3c4db | 266 | static void rpc_mark_complete_task(struct rpc_task *task) |
44c28873 | 267 | { |
e6b3c4db TM |
268 | smp_mb__before_clear_bit(); |
269 | clear_bit(RPC_TASK_ACTIVE, &task->tk_runstate); | |
270 | smp_mb__after_clear_bit(); | |
44c28873 TM |
271 | wake_up_bit(&task->tk_runstate, RPC_TASK_ACTIVE); |
272 | } | |
273 | ||
274 | /* | |
275 | * Allow callers to wait for completion of an RPC call | |
276 | */ | |
277 | int __rpc_wait_for_completion_task(struct rpc_task *task, int (*action)(void *)) | |
278 | { | |
279 | if (action == NULL) | |
150030b7 | 280 | action = rpc_wait_bit_killable; |
44c28873 | 281 | return wait_on_bit(&task->tk_runstate, RPC_TASK_ACTIVE, |
150030b7 | 282 | action, TASK_KILLABLE); |
44c28873 | 283 | } |
e8914c65 | 284 | EXPORT_SYMBOL_GPL(__rpc_wait_for_completion_task); |
44c28873 | 285 | |
1da177e4 LT |
286 | /* |
287 | * Make an RPC task runnable. | |
288 | * | |
cca5172a | 289 | * Note: If the task is ASYNC, this must be called with |
1da177e4 LT |
290 | * the spinlock held to protect the wait queue operation. |
291 | */ | |
292 | static void rpc_make_runnable(struct rpc_task *task) | |
293 | { | |
1da177e4 | 294 | rpc_clear_queued(task); |
cc4dc59e CS |
295 | if (rpc_test_and_set_running(task)) |
296 | return; | |
1da177e4 LT |
297 | if (RPC_IS_ASYNC(task)) { |
298 | int status; | |
299 | ||
65f27f38 | 300 | INIT_WORK(&task->u.tk_work, rpc_async_schedule); |
32bfb5c0 | 301 | status = queue_work(rpciod_workqueue, &task->u.tk_work); |
1da177e4 LT |
302 | if (status < 0) { |
303 | printk(KERN_WARNING "RPC: failed to add task to queue: error: %d!\n", status); | |
304 | task->tk_status = status; | |
305 | return; | |
306 | } | |
307 | } else | |
96651ab3 | 308 | wake_up_bit(&task->tk_runstate, RPC_TASK_QUEUED); |
1da177e4 LT |
309 | } |
310 | ||
1da177e4 LT |
311 | /* |
312 | * Prepare for sleeping on a wait queue. | |
313 | * By always appending tasks to the list we ensure FIFO behavior. | |
314 | * NB: An RPC task will only receive interrupt-driven events as long | |
315 | * as it's on a wait queue. | |
316 | */ | |
317 | static void __rpc_sleep_on(struct rpc_wait_queue *q, struct rpc_task *task, | |
5d00837b | 318 | rpc_action action) |
1da177e4 | 319 | { |
46121cf7 CL |
320 | dprintk("RPC: %5u sleep_on(queue \"%s\" time %lu)\n", |
321 | task->tk_pid, rpc_qname(q), jiffies); | |
1da177e4 LT |
322 | |
323 | if (!RPC_IS_ASYNC(task) && !RPC_IS_ACTIVATED(task)) { | |
324 | printk(KERN_ERR "RPC: Inactive synchronous task put to sleep!\n"); | |
325 | return; | |
326 | } | |
327 | ||
1da177e4 LT |
328 | __rpc_add_wait_queue(q, task); |
329 | ||
330 | BUG_ON(task->tk_callback != NULL); | |
331 | task->tk_callback = action; | |
eb276c0e | 332 | __rpc_add_timer(q, task); |
1da177e4 LT |
333 | } |
334 | ||
335 | void rpc_sleep_on(struct rpc_wait_queue *q, struct rpc_task *task, | |
5d00837b | 336 | rpc_action action) |
1da177e4 | 337 | { |
e6b3c4db TM |
338 | /* Mark the task as being activated if so needed */ |
339 | rpc_set_active(task); | |
340 | ||
1da177e4 LT |
341 | /* |
342 | * Protect the queue operations. | |
343 | */ | |
344 | spin_lock_bh(&q->lock); | |
5d00837b | 345 | __rpc_sleep_on(q, task, action); |
1da177e4 LT |
346 | spin_unlock_bh(&q->lock); |
347 | } | |
e8914c65 | 348 | EXPORT_SYMBOL_GPL(rpc_sleep_on); |
1da177e4 LT |
349 | |
350 | /** | |
351 | * __rpc_do_wake_up_task - wake up a single rpc_task | |
96ef13b2 | 352 | * @queue: wait queue |
1da177e4 LT |
353 | * @task: task to be woken up |
354 | * | |
355 | * Caller must hold queue->lock, and have cleared the task queued flag. | |
356 | */ | |
96ef13b2 | 357 | static void __rpc_do_wake_up_task(struct rpc_wait_queue *queue, struct rpc_task *task) |
1da177e4 | 358 | { |
46121cf7 CL |
359 | dprintk("RPC: %5u __rpc_wake_up_task (now %lu)\n", |
360 | task->tk_pid, jiffies); | |
1da177e4 LT |
361 | |
362 | #ifdef RPC_DEBUG | |
363 | BUG_ON(task->tk_magic != RPC_TASK_MAGIC_ID); | |
364 | #endif | |
365 | /* Has the task been executed yet? If not, we cannot wake it up! */ | |
366 | if (!RPC_IS_ACTIVATED(task)) { | |
367 | printk(KERN_ERR "RPC: Inactive task (%p) being woken up!\n", task); | |
368 | return; | |
369 | } | |
370 | ||
96ef13b2 | 371 | __rpc_remove_wait_queue(queue, task); |
1da177e4 LT |
372 | |
373 | rpc_make_runnable(task); | |
374 | ||
46121cf7 | 375 | dprintk("RPC: __rpc_wake_up_task done\n"); |
1da177e4 LT |
376 | } |
377 | ||
378 | /* | |
96ef13b2 | 379 | * Wake up a queued task while the queue lock is being held |
1da177e4 | 380 | */ |
96ef13b2 | 381 | static void rpc_wake_up_task_queue_locked(struct rpc_wait_queue *queue, struct rpc_task *task) |
1da177e4 | 382 | { |
f5fb7b06 TM |
383 | if (RPC_IS_QUEUED(task) && task->tk_waitqueue == queue) |
384 | __rpc_do_wake_up_task(queue, task); | |
1da177e4 LT |
385 | } |
386 | ||
1da177e4 | 387 | /* |
96ef13b2 | 388 | * Wake up a task on a specific queue |
1da177e4 | 389 | */ |
96ef13b2 | 390 | void rpc_wake_up_queued_task(struct rpc_wait_queue *queue, struct rpc_task *task) |
1da177e4 | 391 | { |
5e4424af | 392 | spin_lock_bh(&queue->lock); |
96ef13b2 | 393 | rpc_wake_up_task_queue_locked(queue, task); |
5e4424af | 394 | spin_unlock_bh(&queue->lock); |
1da177e4 | 395 | } |
96ef13b2 TM |
396 | EXPORT_SYMBOL_GPL(rpc_wake_up_queued_task); |
397 | ||
398 | /* | |
399 | * Wake up the specified task | |
400 | */ | |
fda13939 | 401 | static void rpc_wake_up_task(struct rpc_task *task) |
96ef13b2 TM |
402 | { |
403 | rpc_wake_up_queued_task(task->tk_waitqueue, task); | |
404 | } | |
1da177e4 LT |
405 | |
406 | /* | |
407 | * Wake up the next task on a priority queue. | |
408 | */ | |
409 | static struct rpc_task * __rpc_wake_up_next_priority(struct rpc_wait_queue *queue) | |
410 | { | |
411 | struct list_head *q; | |
412 | struct rpc_task *task; | |
413 | ||
414 | /* | |
3ff7576d | 415 | * Service a batch of tasks from a single owner. |
1da177e4 LT |
416 | */ |
417 | q = &queue->tasks[queue->priority]; | |
418 | if (!list_empty(q)) { | |
419 | task = list_entry(q->next, struct rpc_task, u.tk_wait.list); | |
3ff7576d | 420 | if (queue->owner == task->tk_owner) { |
1da177e4 LT |
421 | if (--queue->nr) |
422 | goto out; | |
423 | list_move_tail(&task->u.tk_wait.list, q); | |
424 | } | |
425 | /* | |
426 | * Check if we need to switch queues. | |
427 | */ | |
428 | if (--queue->count) | |
3ff7576d | 429 | goto new_owner; |
1da177e4 LT |
430 | } |
431 | ||
432 | /* | |
433 | * Service the next queue. | |
434 | */ | |
435 | do { | |
436 | if (q == &queue->tasks[0]) | |
437 | q = &queue->tasks[queue->maxpriority]; | |
438 | else | |
439 | q = q - 1; | |
440 | if (!list_empty(q)) { | |
441 | task = list_entry(q->next, struct rpc_task, u.tk_wait.list); | |
442 | goto new_queue; | |
443 | } | |
444 | } while (q != &queue->tasks[queue->priority]); | |
445 | ||
446 | rpc_reset_waitqueue_priority(queue); | |
447 | return NULL; | |
448 | ||
449 | new_queue: | |
450 | rpc_set_waitqueue_priority(queue, (unsigned int)(q - &queue->tasks[0])); | |
3ff7576d TM |
451 | new_owner: |
452 | rpc_set_waitqueue_owner(queue, task->tk_owner); | |
1da177e4 | 453 | out: |
96ef13b2 | 454 | rpc_wake_up_task_queue_locked(queue, task); |
1da177e4 LT |
455 | return task; |
456 | } | |
457 | ||
458 | /* | |
459 | * Wake up the next task on the wait queue. | |
460 | */ | |
461 | struct rpc_task * rpc_wake_up_next(struct rpc_wait_queue *queue) | |
462 | { | |
463 | struct rpc_task *task = NULL; | |
464 | ||
46121cf7 CL |
465 | dprintk("RPC: wake_up_next(%p \"%s\")\n", |
466 | queue, rpc_qname(queue)); | |
5e4424af | 467 | spin_lock_bh(&queue->lock); |
1da177e4 LT |
468 | if (RPC_IS_PRIORITY(queue)) |
469 | task = __rpc_wake_up_next_priority(queue); | |
470 | else { | |
471 | task_for_first(task, &queue->tasks[0]) | |
96ef13b2 | 472 | rpc_wake_up_task_queue_locked(queue, task); |
1da177e4 | 473 | } |
5e4424af | 474 | spin_unlock_bh(&queue->lock); |
1da177e4 LT |
475 | |
476 | return task; | |
477 | } | |
e8914c65 | 478 | EXPORT_SYMBOL_GPL(rpc_wake_up_next); |
1da177e4 LT |
479 | |
480 | /** | |
481 | * rpc_wake_up - wake up all rpc_tasks | |
482 | * @queue: rpc_wait_queue on which the tasks are sleeping | |
483 | * | |
484 | * Grabs queue->lock | |
485 | */ | |
486 | void rpc_wake_up(struct rpc_wait_queue *queue) | |
487 | { | |
e6d83d55 | 488 | struct rpc_task *task, *next; |
1da177e4 | 489 | struct list_head *head; |
e6d83d55 | 490 | |
5e4424af | 491 | spin_lock_bh(&queue->lock); |
1da177e4 LT |
492 | head = &queue->tasks[queue->maxpriority]; |
493 | for (;;) { | |
e6d83d55 | 494 | list_for_each_entry_safe(task, next, head, u.tk_wait.list) |
96ef13b2 | 495 | rpc_wake_up_task_queue_locked(queue, task); |
1da177e4 LT |
496 | if (head == &queue->tasks[0]) |
497 | break; | |
498 | head--; | |
499 | } | |
5e4424af | 500 | spin_unlock_bh(&queue->lock); |
1da177e4 | 501 | } |
e8914c65 | 502 | EXPORT_SYMBOL_GPL(rpc_wake_up); |
1da177e4 LT |
503 | |
504 | /** | |
505 | * rpc_wake_up_status - wake up all rpc_tasks and set their status value. | |
506 | * @queue: rpc_wait_queue on which the tasks are sleeping | |
507 | * @status: status value to set | |
508 | * | |
509 | * Grabs queue->lock | |
510 | */ | |
511 | void rpc_wake_up_status(struct rpc_wait_queue *queue, int status) | |
512 | { | |
e6d83d55 | 513 | struct rpc_task *task, *next; |
1da177e4 | 514 | struct list_head *head; |
1da177e4 | 515 | |
5e4424af | 516 | spin_lock_bh(&queue->lock); |
1da177e4 LT |
517 | head = &queue->tasks[queue->maxpriority]; |
518 | for (;;) { | |
e6d83d55 | 519 | list_for_each_entry_safe(task, next, head, u.tk_wait.list) { |
1da177e4 | 520 | task->tk_status = status; |
96ef13b2 | 521 | rpc_wake_up_task_queue_locked(queue, task); |
1da177e4 LT |
522 | } |
523 | if (head == &queue->tasks[0]) | |
524 | break; | |
525 | head--; | |
526 | } | |
5e4424af | 527 | spin_unlock_bh(&queue->lock); |
1da177e4 | 528 | } |
e8914c65 | 529 | EXPORT_SYMBOL_GPL(rpc_wake_up_status); |
1da177e4 | 530 | |
36df9aae TM |
531 | static void __rpc_queue_timer_fn(unsigned long ptr) |
532 | { | |
533 | struct rpc_wait_queue *queue = (struct rpc_wait_queue *)ptr; | |
534 | struct rpc_task *task, *n; | |
535 | unsigned long expires, now, timeo; | |
536 | ||
537 | spin_lock(&queue->lock); | |
538 | expires = now = jiffies; | |
539 | list_for_each_entry_safe(task, n, &queue->timer_list.list, u.tk_wait.timer_list) { | |
540 | timeo = task->u.tk_wait.expires; | |
541 | if (time_after_eq(now, timeo)) { | |
36df9aae TM |
542 | dprintk("RPC: %5u timeout\n", task->tk_pid); |
543 | task->tk_status = -ETIMEDOUT; | |
544 | rpc_wake_up_task_queue_locked(queue, task); | |
545 | continue; | |
546 | } | |
547 | if (expires == now || time_after(expires, timeo)) | |
548 | expires = timeo; | |
549 | } | |
550 | if (!list_empty(&queue->timer_list.list)) | |
551 | rpc_set_queue_timer(queue, expires); | |
552 | spin_unlock(&queue->lock); | |
553 | } | |
554 | ||
8014793b TM |
555 | static void __rpc_atrun(struct rpc_task *task) |
556 | { | |
5d00837b | 557 | task->tk_status = 0; |
8014793b TM |
558 | } |
559 | ||
1da177e4 LT |
560 | /* |
561 | * Run a task at a later time | |
562 | */ | |
8014793b | 563 | void rpc_delay(struct rpc_task *task, unsigned long delay) |
1da177e4 LT |
564 | { |
565 | task->tk_timeout = delay; | |
5d00837b | 566 | rpc_sleep_on(&delay_queue, task, __rpc_atrun); |
1da177e4 | 567 | } |
e8914c65 | 568 | EXPORT_SYMBOL_GPL(rpc_delay); |
1da177e4 | 569 | |
4ce70ada TM |
570 | /* |
571 | * Helper to call task->tk_ops->rpc_call_prepare | |
572 | */ | |
aae2006e | 573 | void rpc_prepare_task(struct rpc_task *task) |
4ce70ada TM |
574 | { |
575 | task->tk_ops->rpc_call_prepare(task, task->tk_calldata); | |
576 | } | |
577 | ||
d05fdb0c | 578 | /* |
963d8fe5 | 579 | * Helper that calls task->tk_ops->rpc_call_done if it exists |
d05fdb0c | 580 | */ |
abbcf28f | 581 | void rpc_exit_task(struct rpc_task *task) |
d05fdb0c | 582 | { |
abbcf28f | 583 | task->tk_action = NULL; |
963d8fe5 TM |
584 | if (task->tk_ops->rpc_call_done != NULL) { |
585 | task->tk_ops->rpc_call_done(task, task->tk_calldata); | |
d05fdb0c | 586 | if (task->tk_action != NULL) { |
abbcf28f TM |
587 | WARN_ON(RPC_ASSASSINATED(task)); |
588 | /* Always release the RPC slot and buffer memory */ | |
589 | xprt_release(task); | |
d05fdb0c TM |
590 | } |
591 | } | |
d05fdb0c | 592 | } |
e8914c65 | 593 | EXPORT_SYMBOL_GPL(rpc_exit_task); |
d05fdb0c | 594 | |
bbd5a1f9 TM |
595 | void rpc_release_calldata(const struct rpc_call_ops *ops, void *calldata) |
596 | { | |
a86dc496 | 597 | if (ops->rpc_release != NULL) |
bbd5a1f9 | 598 | ops->rpc_release(calldata); |
bbd5a1f9 TM |
599 | } |
600 | ||
1da177e4 LT |
601 | /* |
602 | * This is the RPC `scheduler' (or rather, the finite state machine). | |
603 | */ | |
2efef837 | 604 | static void __rpc_execute(struct rpc_task *task) |
1da177e4 | 605 | { |
eb9b55ab TM |
606 | struct rpc_wait_queue *queue; |
607 | int task_is_async = RPC_IS_ASYNC(task); | |
608 | int status = 0; | |
1da177e4 | 609 | |
46121cf7 CL |
610 | dprintk("RPC: %5u __rpc_execute flags=0x%x\n", |
611 | task->tk_pid, task->tk_flags); | |
1da177e4 LT |
612 | |
613 | BUG_ON(RPC_IS_QUEUED(task)); | |
614 | ||
d05fdb0c | 615 | for (;;) { |
1da177e4 LT |
616 | |
617 | /* | |
618 | * Execute any pending callback. | |
619 | */ | |
a486aeda | 620 | if (task->tk_callback) { |
1da177e4 | 621 | void (*save_callback)(struct rpc_task *); |
cca5172a YH |
622 | |
623 | /* | |
a486aeda BF |
624 | * We set tk_callback to NULL before calling it, |
625 | * in case it sets the tk_callback field itself: | |
1da177e4 | 626 | */ |
a486aeda BF |
627 | save_callback = task->tk_callback; |
628 | task->tk_callback = NULL; | |
1da177e4 | 629 | save_callback(task); |
1da177e4 LT |
630 | } |
631 | ||
632 | /* | |
633 | * Perform the next FSM step. | |
634 | * tk_action may be NULL when the task has been killed | |
635 | * by someone else. | |
636 | */ | |
637 | if (!RPC_IS_QUEUED(task)) { | |
abbcf28f | 638 | if (task->tk_action == NULL) |
1da177e4 | 639 | break; |
abbcf28f | 640 | task->tk_action(task); |
1da177e4 LT |
641 | } |
642 | ||
643 | /* | |
644 | * Lockless check for whether task is sleeping or not. | |
645 | */ | |
646 | if (!RPC_IS_QUEUED(task)) | |
647 | continue; | |
eb9b55ab TM |
648 | /* |
649 | * The queue->lock protects against races with | |
650 | * rpc_make_runnable(). | |
651 | * | |
652 | * Note that once we clear RPC_TASK_RUNNING on an asynchronous | |
653 | * rpc_task, rpc_make_runnable() can assign it to a | |
654 | * different workqueue. We therefore cannot assume that the | |
655 | * rpc_task pointer may still be dereferenced. | |
656 | */ | |
657 | queue = task->tk_waitqueue; | |
658 | spin_lock_bh(&queue->lock); | |
659 | if (!RPC_IS_QUEUED(task)) { | |
660 | spin_unlock_bh(&queue->lock); | |
1da177e4 LT |
661 | continue; |
662 | } | |
eb9b55ab TM |
663 | rpc_clear_running(task); |
664 | spin_unlock_bh(&queue->lock); | |
665 | if (task_is_async) | |
666 | return; | |
1da177e4 LT |
667 | |
668 | /* sync task: sleep here */ | |
46121cf7 | 669 | dprintk("RPC: %5u sync task going to sleep\n", task->tk_pid); |
96651ab3 | 670 | status = out_of_line_wait_on_bit(&task->tk_runstate, |
150030b7 MW |
671 | RPC_TASK_QUEUED, rpc_wait_bit_killable, |
672 | TASK_KILLABLE); | |
96651ab3 | 673 | if (status == -ERESTARTSYS) { |
1da177e4 LT |
674 | /* |
675 | * When a sync task receives a signal, it exits with | |
676 | * -ERESTARTSYS. In order to catch any callbacks that | |
677 | * clean up after sleeping on some queue, we don't | |
678 | * break the loop here, but go around once more. | |
679 | */ | |
46121cf7 | 680 | dprintk("RPC: %5u got signal\n", task->tk_pid); |
96651ab3 TM |
681 | task->tk_flags |= RPC_TASK_KILLED; |
682 | rpc_exit(task, -ERESTARTSYS); | |
683 | rpc_wake_up_task(task); | |
1da177e4 LT |
684 | } |
685 | rpc_set_running(task); | |
46121cf7 | 686 | dprintk("RPC: %5u sync task resuming\n", task->tk_pid); |
1da177e4 LT |
687 | } |
688 | ||
46121cf7 CL |
689 | dprintk("RPC: %5u return %d, status %d\n", task->tk_pid, status, |
690 | task->tk_status); | |
1da177e4 LT |
691 | /* Release all resources associated with the task */ |
692 | rpc_release_task(task); | |
1da177e4 LT |
693 | } |
694 | ||
695 | /* | |
696 | * User-visible entry point to the scheduler. | |
697 | * | |
698 | * This may be called recursively if e.g. an async NFS task updates | |
699 | * the attributes and finds that dirty pages must be flushed. | |
700 | * NOTE: Upon exit of this function the task is guaranteed to be | |
701 | * released. In particular note that tk_release() will have | |
702 | * been called, so your task memory may have been freed. | |
703 | */ | |
2efef837 | 704 | void rpc_execute(struct rpc_task *task) |
1da177e4 | 705 | { |
44c28873 | 706 | rpc_set_active(task); |
1da177e4 | 707 | rpc_set_running(task); |
2efef837 | 708 | __rpc_execute(task); |
1da177e4 LT |
709 | } |
710 | ||
65f27f38 | 711 | static void rpc_async_schedule(struct work_struct *work) |
1da177e4 | 712 | { |
65f27f38 | 713 | __rpc_execute(container_of(work, struct rpc_task, u.tk_work)); |
1da177e4 LT |
714 | } |
715 | ||
02107148 CL |
716 | /** |
717 | * rpc_malloc - allocate an RPC buffer | |
718 | * @task: RPC task that will use this buffer | |
719 | * @size: requested byte size | |
1da177e4 | 720 | * |
c5a4dd8b CL |
721 | * To prevent rpciod from hanging, this allocator never sleeps, |
722 | * returning NULL if the request cannot be serviced immediately. | |
723 | * The caller can arrange to sleep in a way that is safe for rpciod. | |
724 | * | |
725 | * Most requests are 'small' (under 2KiB) and can be serviced from a | |
726 | * mempool, ensuring that NFS reads and writes can always proceed, | |
727 | * and that there is good locality of reference for these buffers. | |
728 | * | |
1da177e4 | 729 | * In order to avoid memory starvation triggering more writebacks of |
c5a4dd8b | 730 | * NFS requests, we avoid using GFP_KERNEL. |
1da177e4 | 731 | */ |
c5a4dd8b | 732 | void *rpc_malloc(struct rpc_task *task, size_t size) |
1da177e4 | 733 | { |
aa3d1fae | 734 | struct rpc_buffer *buf; |
c5a4dd8b | 735 | gfp_t gfp = RPC_IS_SWAPPER(task) ? GFP_ATOMIC : GFP_NOWAIT; |
1da177e4 | 736 | |
aa3d1fae | 737 | size += sizeof(struct rpc_buffer); |
c5a4dd8b CL |
738 | if (size <= RPC_BUFFER_MAXSIZE) |
739 | buf = mempool_alloc(rpc_buffer_mempool, gfp); | |
1da177e4 | 740 | else |
c5a4dd8b | 741 | buf = kmalloc(size, gfp); |
ddce40df PZ |
742 | |
743 | if (!buf) | |
744 | return NULL; | |
745 | ||
aa3d1fae | 746 | buf->len = size; |
215d0678 | 747 | dprintk("RPC: %5u allocated buffer of size %zu at %p\n", |
c5a4dd8b | 748 | task->tk_pid, size, buf); |
aa3d1fae | 749 | return &buf->data; |
1da177e4 | 750 | } |
12444809 | 751 | EXPORT_SYMBOL_GPL(rpc_malloc); |
1da177e4 | 752 | |
02107148 CL |
753 | /** |
754 | * rpc_free - free buffer allocated via rpc_malloc | |
c5a4dd8b | 755 | * @buffer: buffer to free |
02107148 CL |
756 | * |
757 | */ | |
c5a4dd8b | 758 | void rpc_free(void *buffer) |
1da177e4 | 759 | { |
aa3d1fae CL |
760 | size_t size; |
761 | struct rpc_buffer *buf; | |
02107148 | 762 | |
c5a4dd8b CL |
763 | if (!buffer) |
764 | return; | |
aa3d1fae CL |
765 | |
766 | buf = container_of(buffer, struct rpc_buffer, data); | |
767 | size = buf->len; | |
c5a4dd8b | 768 | |
215d0678 | 769 | dprintk("RPC: freeing buffer of size %zu at %p\n", |
c5a4dd8b | 770 | size, buf); |
aa3d1fae | 771 | |
c5a4dd8b CL |
772 | if (size <= RPC_BUFFER_MAXSIZE) |
773 | mempool_free(buf, rpc_buffer_mempool); | |
774 | else | |
775 | kfree(buf); | |
1da177e4 | 776 | } |
12444809 | 777 | EXPORT_SYMBOL_GPL(rpc_free); |
1da177e4 LT |
778 | |
779 | /* | |
780 | * Creation and deletion of RPC task structures | |
781 | */ | |
47fe0648 | 782 | static void rpc_init_task(struct rpc_task *task, const struct rpc_task_setup *task_setup_data) |
1da177e4 LT |
783 | { |
784 | memset(task, 0, sizeof(*task)); | |
44c28873 | 785 | atomic_set(&task->tk_count, 1); |
84115e1c TM |
786 | task->tk_flags = task_setup_data->flags; |
787 | task->tk_ops = task_setup_data->callback_ops; | |
788 | task->tk_calldata = task_setup_data->callback_data; | |
6529eba0 | 789 | INIT_LIST_HEAD(&task->tk_task); |
1da177e4 LT |
790 | |
791 | /* Initialize retry counters */ | |
792 | task->tk_garb_retry = 2; | |
793 | task->tk_cred_retry = 2; | |
794 | ||
3ff7576d TM |
795 | task->tk_priority = task_setup_data->priority - RPC_PRIORITY_LOW; |
796 | task->tk_owner = current->tgid; | |
1da177e4 LT |
797 | |
798 | /* Initialize workqueue for async tasks */ | |
32bfb5c0 | 799 | task->tk_workqueue = task_setup_data->workqueue; |
1da177e4 | 800 | |
84115e1c TM |
801 | task->tk_client = task_setup_data->rpc_client; |
802 | if (task->tk_client != NULL) { | |
803 | kref_get(&task->tk_client->cl_kref); | |
804 | if (task->tk_client->cl_softrtry) | |
1da177e4 | 805 | task->tk_flags |= RPC_TASK_SOFT; |
1da177e4 LT |
806 | } |
807 | ||
84115e1c TM |
808 | if (task->tk_ops->rpc_call_prepare != NULL) |
809 | task->tk_action = rpc_prepare_task; | |
963d8fe5 | 810 | |
b3ef8b3b | 811 | if (task_setup_data->rpc_message != NULL) { |
4ccda2cd TM |
812 | task->tk_msg.rpc_proc = task_setup_data->rpc_message->rpc_proc; |
813 | task->tk_msg.rpc_argp = task_setup_data->rpc_message->rpc_argp; | |
814 | task->tk_msg.rpc_resp = task_setup_data->rpc_message->rpc_resp; | |
b3ef8b3b | 815 | /* Bind the user cred */ |
4ccda2cd | 816 | rpcauth_bindcred(task, task_setup_data->rpc_message->rpc_cred, task_setup_data->flags); |
b3ef8b3b TM |
817 | if (task->tk_action == NULL) |
818 | rpc_call_start(task); | |
819 | } | |
820 | ||
ef759a2e CL |
821 | /* starting timestamp */ |
822 | task->tk_start = jiffies; | |
823 | ||
46121cf7 | 824 | dprintk("RPC: new task initialized, procpid %u\n", |
ba25f9dc | 825 | task_pid_nr(current)); |
1da177e4 LT |
826 | } |
827 | ||
828 | static struct rpc_task * | |
829 | rpc_alloc_task(void) | |
830 | { | |
831 | return (struct rpc_task *)mempool_alloc(rpc_task_mempool, GFP_NOFS); | |
832 | } | |
833 | ||
1da177e4 | 834 | /* |
90c5755f | 835 | * Create a new task for the specified client. |
1da177e4 | 836 | */ |
84115e1c | 837 | struct rpc_task *rpc_new_task(const struct rpc_task_setup *setup_data) |
1da177e4 | 838 | { |
e8f5d77c TM |
839 | struct rpc_task *task = setup_data->task; |
840 | unsigned short flags = 0; | |
841 | ||
842 | if (task == NULL) { | |
843 | task = rpc_alloc_task(); | |
844 | if (task == NULL) | |
845 | goto out; | |
846 | flags = RPC_TASK_DYNAMIC; | |
847 | } | |
1da177e4 | 848 | |
84115e1c | 849 | rpc_init_task(task, setup_data); |
1da177e4 | 850 | |
e8f5d77c | 851 | task->tk_flags |= flags; |
46121cf7 | 852 | dprintk("RPC: allocated task %p\n", task); |
1da177e4 LT |
853 | out: |
854 | return task; | |
1da177e4 LT |
855 | } |
856 | ||
32bfb5c0 | 857 | static void rpc_free_task(struct rpc_task *task) |
1da177e4 | 858 | { |
963d8fe5 TM |
859 | const struct rpc_call_ops *tk_ops = task->tk_ops; |
860 | void *calldata = task->tk_calldata; | |
1da177e4 | 861 | |
5e4424af TM |
862 | if (task->tk_flags & RPC_TASK_DYNAMIC) { |
863 | dprintk("RPC: %5u freeing task\n", task->tk_pid); | |
864 | mempool_free(task, rpc_task_mempool); | |
865 | } | |
32bfb5c0 TM |
866 | rpc_release_calldata(tk_ops, calldata); |
867 | } | |
868 | ||
869 | static void rpc_async_release(struct work_struct *work) | |
870 | { | |
871 | rpc_free_task(container_of(work, struct rpc_task, u.tk_work)); | |
872 | } | |
873 | ||
874 | void rpc_put_task(struct rpc_task *task) | |
875 | { | |
e6b3c4db TM |
876 | if (!atomic_dec_and_test(&task->tk_count)) |
877 | return; | |
878 | /* Release resources */ | |
879 | if (task->tk_rqstp) | |
880 | xprt_release(task); | |
881 | if (task->tk_msg.rpc_cred) | |
882 | rpcauth_unbindcred(task); | |
883 | if (task->tk_client) { | |
884 | rpc_release_client(task->tk_client); | |
885 | task->tk_client = NULL; | |
886 | } | |
32bfb5c0 TM |
887 | if (task->tk_workqueue != NULL) { |
888 | INIT_WORK(&task->u.tk_work, rpc_async_release); | |
889 | queue_work(task->tk_workqueue, &task->u.tk_work); | |
890 | } else | |
891 | rpc_free_task(task); | |
e6b3c4db | 892 | } |
e8914c65 | 893 | EXPORT_SYMBOL_GPL(rpc_put_task); |
e6b3c4db | 894 | |
bde8f00c | 895 | static void rpc_release_task(struct rpc_task *task) |
e6b3c4db | 896 | { |
1da177e4 LT |
897 | #ifdef RPC_DEBUG |
898 | BUG_ON(task->tk_magic != RPC_TASK_MAGIC_ID); | |
899 | #endif | |
46121cf7 | 900 | dprintk("RPC: %5u release task\n", task->tk_pid); |
1da177e4 | 901 | |
6529eba0 | 902 | if (!list_empty(&task->tk_task)) { |
4bef61ff | 903 | struct rpc_clnt *clnt = task->tk_client; |
6529eba0 | 904 | /* Remove from client task list */ |
4bef61ff | 905 | spin_lock(&clnt->cl_lock); |
6529eba0 | 906 | list_del(&task->tk_task); |
4bef61ff | 907 | spin_unlock(&clnt->cl_lock); |
6529eba0 | 908 | } |
1da177e4 | 909 | BUG_ON (RPC_IS_QUEUED(task)); |
1da177e4 | 910 | |
1da177e4 LT |
911 | #ifdef RPC_DEBUG |
912 | task->tk_magic = 0; | |
913 | #endif | |
e6b3c4db TM |
914 | /* Wake up anyone who is waiting for task completion */ |
915 | rpc_mark_complete_task(task); | |
916 | ||
917 | rpc_put_task(task); | |
1da177e4 LT |
918 | } |
919 | ||
1da177e4 LT |
920 | /* |
921 | * Kill all tasks for the given client. | |
922 | * XXX: kill their descendants as well? | |
923 | */ | |
4bef61ff | 924 | void rpc_killall_tasks(struct rpc_clnt *clnt) |
1da177e4 LT |
925 | { |
926 | struct rpc_task *rovr; | |
1da177e4 | 927 | |
1da177e4 | 928 | |
4bef61ff TM |
929 | if (list_empty(&clnt->cl_tasks)) |
930 | return; | |
931 | dprintk("RPC: killing all tasks for client %p\n", clnt); | |
932 | /* | |
933 | * Spin lock all_tasks to prevent changes... | |
934 | */ | |
935 | spin_lock(&clnt->cl_lock); | |
936 | list_for_each_entry(rovr, &clnt->cl_tasks, tk_task) { | |
1da177e4 LT |
937 | if (! RPC_IS_ACTIVATED(rovr)) |
938 | continue; | |
6529eba0 | 939 | if (!(rovr->tk_flags & RPC_TASK_KILLED)) { |
1da177e4 LT |
940 | rovr->tk_flags |= RPC_TASK_KILLED; |
941 | rpc_exit(rovr, -EIO); | |
942 | rpc_wake_up_task(rovr); | |
943 | } | |
944 | } | |
4bef61ff | 945 | spin_unlock(&clnt->cl_lock); |
1da177e4 | 946 | } |
e8914c65 | 947 | EXPORT_SYMBOL_GPL(rpc_killall_tasks); |
1da177e4 | 948 | |
b247bbf1 TM |
949 | int rpciod_up(void) |
950 | { | |
951 | return try_module_get(THIS_MODULE) ? 0 : -EINVAL; | |
952 | } | |
953 | ||
954 | void rpciod_down(void) | |
955 | { | |
956 | module_put(THIS_MODULE); | |
957 | } | |
958 | ||
1da177e4 | 959 | /* |
b247bbf1 | 960 | * Start up the rpciod workqueue. |
1da177e4 | 961 | */ |
b247bbf1 | 962 | static int rpciod_start(void) |
1da177e4 LT |
963 | { |
964 | struct workqueue_struct *wq; | |
ab418d70 | 965 | |
1da177e4 LT |
966 | /* |
967 | * Create the rpciod thread and wait for it to start. | |
968 | */ | |
ab418d70 | 969 | dprintk("RPC: creating workqueue rpciod\n"); |
1da177e4 | 970 | wq = create_workqueue("rpciod"); |
1da177e4 | 971 | rpciod_workqueue = wq; |
b247bbf1 | 972 | return rpciod_workqueue != NULL; |
1da177e4 LT |
973 | } |
974 | ||
b247bbf1 | 975 | static void rpciod_stop(void) |
1da177e4 | 976 | { |
b247bbf1 | 977 | struct workqueue_struct *wq = NULL; |
ab418d70 | 978 | |
b247bbf1 TM |
979 | if (rpciod_workqueue == NULL) |
980 | return; | |
ab418d70 | 981 | dprintk("RPC: destroying workqueue rpciod\n"); |
1da177e4 | 982 | |
b247bbf1 TM |
983 | wq = rpciod_workqueue; |
984 | rpciod_workqueue = NULL; | |
985 | destroy_workqueue(wq); | |
1da177e4 LT |
986 | } |
987 | ||
1da177e4 LT |
988 | void |
989 | rpc_destroy_mempool(void) | |
990 | { | |
b247bbf1 | 991 | rpciod_stop(); |
1da177e4 LT |
992 | if (rpc_buffer_mempool) |
993 | mempool_destroy(rpc_buffer_mempool); | |
994 | if (rpc_task_mempool) | |
995 | mempool_destroy(rpc_task_mempool); | |
1a1d92c1 AD |
996 | if (rpc_task_slabp) |
997 | kmem_cache_destroy(rpc_task_slabp); | |
998 | if (rpc_buffer_slabp) | |
999 | kmem_cache_destroy(rpc_buffer_slabp); | |
f6a1cc89 | 1000 | rpc_destroy_wait_queue(&delay_queue); |
1da177e4 LT |
1001 | } |
1002 | ||
1003 | int | |
1004 | rpc_init_mempool(void) | |
1005 | { | |
f6a1cc89 TM |
1006 | /* |
1007 | * The following is not strictly a mempool initialisation, | |
1008 | * but there is no harm in doing it here | |
1009 | */ | |
1010 | rpc_init_wait_queue(&delay_queue, "delayq"); | |
1011 | if (!rpciod_start()) | |
1012 | goto err_nomem; | |
1013 | ||
1da177e4 LT |
1014 | rpc_task_slabp = kmem_cache_create("rpc_tasks", |
1015 | sizeof(struct rpc_task), | |
1016 | 0, SLAB_HWCACHE_ALIGN, | |
20c2df83 | 1017 | NULL); |
1da177e4 LT |
1018 | if (!rpc_task_slabp) |
1019 | goto err_nomem; | |
1020 | rpc_buffer_slabp = kmem_cache_create("rpc_buffers", | |
1021 | RPC_BUFFER_MAXSIZE, | |
1022 | 0, SLAB_HWCACHE_ALIGN, | |
20c2df83 | 1023 | NULL); |
1da177e4 LT |
1024 | if (!rpc_buffer_slabp) |
1025 | goto err_nomem; | |
93d2341c MD |
1026 | rpc_task_mempool = mempool_create_slab_pool(RPC_TASK_POOLSIZE, |
1027 | rpc_task_slabp); | |
1da177e4 LT |
1028 | if (!rpc_task_mempool) |
1029 | goto err_nomem; | |
93d2341c MD |
1030 | rpc_buffer_mempool = mempool_create_slab_pool(RPC_BUFFER_POOLSIZE, |
1031 | rpc_buffer_slabp); | |
1da177e4 LT |
1032 | if (!rpc_buffer_mempool) |
1033 | goto err_nomem; | |
1034 | return 0; | |
1035 | err_nomem: | |
1036 | rpc_destroy_mempool(); | |
1037 | return -ENOMEM; | |
1038 | } |