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