2 * linux/net/sunrpc/sched.c
4 * Scheduling for synchronous and asynchronous RPC requests.
6 * Copyright (C) 1996 Olaf Kirch, <okir@monad.swb.de>
8 * TCP NFS related read + write fixes
9 * (C) 1999 Dave Airlie, University of Limerick, Ireland <airlied@linux.ie>
12 #include <linux/module.h>
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>
21 #include <linux/mutex.h>
23 #include <linux/sunrpc/clnt.h>
26 #define RPCDBG_FACILITY RPCDBG_SCHED
27 #define RPC_TASK_MAGIC_ID 0xf00baa
31 * RPC slabs and memory pools
33 #define RPC_BUFFER_MAXSIZE (2048)
34 #define RPC_BUFFER_POOLSIZE (8)
35 #define RPC_TASK_POOLSIZE (8)
36 static struct kmem_cache
*rpc_task_slabp __read_mostly
;
37 static struct kmem_cache
*rpc_buffer_slabp __read_mostly
;
38 static mempool_t
*rpc_task_mempool __read_mostly
;
39 static mempool_t
*rpc_buffer_mempool __read_mostly
;
41 static void rpc_async_schedule(struct work_struct
*);
42 static void rpc_release_task(struct rpc_task
*task
);
43 static void __rpc_queue_timer_fn(unsigned long ptr
);
46 * RPC tasks sit here while waiting for conditions to improve.
48 static struct rpc_wait_queue delay_queue
;
51 * rpciod-related stuff
53 struct workqueue_struct
*rpciod_workqueue
;
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
61 __rpc_disable_timer(struct rpc_wait_queue
*queue
, struct rpc_task
*task
)
63 if (task
->tk_timeout
== 0)
65 dprintk("RPC: %5u disabling timer\n", task
->tk_pid
);
67 list_del(&task
->u
.tk_wait
.timer_list
);
68 if (list_empty(&queue
->timer_list
.list
))
69 del_timer(&queue
->timer_list
.timer
);
73 rpc_set_queue_timer(struct rpc_wait_queue
*queue
, unsigned long expires
)
75 queue
->timer_list
.expires
= expires
;
76 mod_timer(&queue
->timer_list
.timer
, expires
);
80 * Set up a timer for the current task.
83 __rpc_add_timer(struct rpc_wait_queue
*queue
, struct rpc_task
*task
)
85 if (!task
->tk_timeout
)
88 dprintk("RPC: %5u setting alarm for %lu ms\n",
89 task
->tk_pid
, task
->tk_timeout
* 1000 / HZ
);
91 task
->u
.tk_wait
.expires
= jiffies
+ task
->tk_timeout
;
92 if (list_empty(&queue
->timer_list
.list
) || time_before(task
->u
.tk_wait
.expires
, queue
->timer_list
.expires
))
93 rpc_set_queue_timer(queue
, task
->u
.tk_wait
.expires
);
94 list_add(&task
->u
.tk_wait
.timer_list
, &queue
->timer_list
.list
);
98 * Add new request to a priority queue.
100 static void __rpc_add_wait_queue_priority(struct rpc_wait_queue
*queue
, struct rpc_task
*task
)
105 INIT_LIST_HEAD(&task
->u
.tk_wait
.links
);
106 q
= &queue
->tasks
[task
->tk_priority
];
107 if (unlikely(task
->tk_priority
> queue
->maxpriority
))
108 q
= &queue
->tasks
[queue
->maxpriority
];
109 list_for_each_entry(t
, q
, u
.tk_wait
.list
) {
110 if (t
->tk_owner
== task
->tk_owner
) {
111 list_add_tail(&task
->u
.tk_wait
.list
, &t
->u
.tk_wait
.links
);
115 list_add_tail(&task
->u
.tk_wait
.list
, q
);
119 * Add new request to wait queue.
121 * Swapper tasks always get inserted at the head of the queue.
122 * This should avoid many nasty memory deadlocks and hopefully
123 * improve overall performance.
124 * Everyone else gets appended to the queue to ensure proper FIFO behavior.
126 static void __rpc_add_wait_queue(struct rpc_wait_queue
*queue
, struct rpc_task
*task
)
128 BUG_ON (RPC_IS_QUEUED(task
));
130 if (RPC_IS_PRIORITY(queue
))
131 __rpc_add_wait_queue_priority(queue
, task
);
132 else if (RPC_IS_SWAPPER(task
))
133 list_add(&task
->u
.tk_wait
.list
, &queue
->tasks
[0]);
135 list_add_tail(&task
->u
.tk_wait
.list
, &queue
->tasks
[0]);
136 task
->tk_waitqueue
= queue
;
138 rpc_set_queued(task
);
140 dprintk("RPC: %5u added to queue %p \"%s\"\n",
141 task
->tk_pid
, queue
, rpc_qname(queue
));
145 * Remove request from a priority queue.
147 static void __rpc_remove_wait_queue_priority(struct rpc_task
*task
)
151 if (!list_empty(&task
->u
.tk_wait
.links
)) {
152 t
= list_entry(task
->u
.tk_wait
.links
.next
, struct rpc_task
, u
.tk_wait
.list
);
153 list_move(&t
->u
.tk_wait
.list
, &task
->u
.tk_wait
.list
);
154 list_splice_init(&task
->u
.tk_wait
.links
, &t
->u
.tk_wait
.links
);
159 * Remove request from queue.
160 * Note: must be called with spin lock held.
162 static void __rpc_remove_wait_queue(struct rpc_wait_queue
*queue
, struct rpc_task
*task
)
164 __rpc_disable_timer(queue
, task
);
165 if (RPC_IS_PRIORITY(queue
))
166 __rpc_remove_wait_queue_priority(task
);
167 list_del(&task
->u
.tk_wait
.list
);
169 dprintk("RPC: %5u removed from queue %p \"%s\"\n",
170 task
->tk_pid
, queue
, rpc_qname(queue
));
173 static inline void rpc_set_waitqueue_priority(struct rpc_wait_queue
*queue
, int priority
)
175 queue
->priority
= priority
;
176 queue
->count
= 1 << (priority
* 2);
179 static inline void rpc_set_waitqueue_owner(struct rpc_wait_queue
*queue
, pid_t pid
)
182 queue
->nr
= RPC_BATCH_COUNT
;
185 static inline void rpc_reset_waitqueue_priority(struct rpc_wait_queue
*queue
)
187 rpc_set_waitqueue_priority(queue
, queue
->maxpriority
);
188 rpc_set_waitqueue_owner(queue
, 0);
191 static void __rpc_init_priority_wait_queue(struct rpc_wait_queue
*queue
, const char *qname
, unsigned char nr_queues
)
195 spin_lock_init(&queue
->lock
);
196 for (i
= 0; i
< ARRAY_SIZE(queue
->tasks
); i
++)
197 INIT_LIST_HEAD(&queue
->tasks
[i
]);
198 queue
->maxpriority
= nr_queues
- 1;
199 rpc_reset_waitqueue_priority(queue
);
201 setup_timer(&queue
->timer_list
.timer
, __rpc_queue_timer_fn
, (unsigned long)queue
);
202 INIT_LIST_HEAD(&queue
->timer_list
.list
);
208 void rpc_init_priority_wait_queue(struct rpc_wait_queue
*queue
, const char *qname
)
210 __rpc_init_priority_wait_queue(queue
, qname
, RPC_NR_PRIORITY
);
213 void rpc_init_wait_queue(struct rpc_wait_queue
*queue
, const char *qname
)
215 __rpc_init_priority_wait_queue(queue
, qname
, 1);
217 EXPORT_SYMBOL_GPL(rpc_init_wait_queue
);
219 void rpc_destroy_wait_queue(struct rpc_wait_queue
*queue
)
221 del_timer_sync(&queue
->timer_list
.timer
);
223 EXPORT_SYMBOL_GPL(rpc_destroy_wait_queue
);
225 static int rpc_wait_bit_killable(void *word
)
227 if (fatal_signal_pending(current
))
234 static void rpc_task_set_debuginfo(struct rpc_task
*task
)
236 static atomic_t rpc_pid
;
238 task
->tk_magic
= RPC_TASK_MAGIC_ID
;
239 task
->tk_pid
= atomic_inc_return(&rpc_pid
);
242 static inline void rpc_task_set_debuginfo(struct rpc_task
*task
)
247 static void rpc_set_active(struct rpc_task
*task
)
249 struct rpc_clnt
*clnt
;
250 if (test_and_set_bit(RPC_TASK_ACTIVE
, &task
->tk_runstate
) != 0)
252 rpc_task_set_debuginfo(task
);
253 /* Add to global list of all tasks */
254 clnt
= task
->tk_client
;
256 spin_lock(&clnt
->cl_lock
);
257 list_add_tail(&task
->tk_task
, &clnt
->cl_tasks
);
258 spin_unlock(&clnt
->cl_lock
);
263 * Mark an RPC call as having completed by clearing the 'active' bit
265 static void rpc_mark_complete_task(struct rpc_task
*task
)
267 smp_mb__before_clear_bit();
268 clear_bit(RPC_TASK_ACTIVE
, &task
->tk_runstate
);
269 smp_mb__after_clear_bit();
270 wake_up_bit(&task
->tk_runstate
, RPC_TASK_ACTIVE
);
274 * Allow callers to wait for completion of an RPC call
276 int __rpc_wait_for_completion_task(struct rpc_task
*task
, int (*action
)(void *))
279 action
= rpc_wait_bit_killable
;
280 return wait_on_bit(&task
->tk_runstate
, RPC_TASK_ACTIVE
,
281 action
, TASK_KILLABLE
);
283 EXPORT_SYMBOL_GPL(__rpc_wait_for_completion_task
);
286 * Make an RPC task runnable.
288 * Note: If the task is ASYNC, this must be called with
289 * the spinlock held to protect the wait queue operation.
291 static void rpc_make_runnable(struct rpc_task
*task
)
293 rpc_clear_queued(task
);
294 if (rpc_test_and_set_running(task
))
296 /* We might have raced */
297 if (RPC_IS_QUEUED(task
)) {
298 rpc_clear_running(task
);
301 if (RPC_IS_ASYNC(task
)) {
304 INIT_WORK(&task
->u
.tk_work
, rpc_async_schedule
);
305 status
= queue_work(rpciod_workqueue
, &task
->u
.tk_work
);
307 printk(KERN_WARNING
"RPC: failed to add task to queue: error: %d!\n", status
);
308 task
->tk_status
= status
;
312 wake_up_bit(&task
->tk_runstate
, RPC_TASK_QUEUED
);
316 * Prepare for sleeping on a wait queue.
317 * By always appending tasks to the list we ensure FIFO behavior.
318 * NB: An RPC task will only receive interrupt-driven events as long
319 * as it's on a wait queue.
321 static void __rpc_sleep_on(struct rpc_wait_queue
*q
, struct rpc_task
*task
,
324 dprintk("RPC: %5u sleep_on(queue \"%s\" time %lu)\n",
325 task
->tk_pid
, rpc_qname(q
), jiffies
);
327 if (!RPC_IS_ASYNC(task
) && !RPC_IS_ACTIVATED(task
)) {
328 printk(KERN_ERR
"RPC: Inactive synchronous task put to sleep!\n");
332 __rpc_add_wait_queue(q
, task
);
334 BUG_ON(task
->tk_callback
!= NULL
);
335 task
->tk_callback
= action
;
336 __rpc_add_timer(q
, task
);
339 void rpc_sleep_on(struct rpc_wait_queue
*q
, struct rpc_task
*task
,
342 /* Mark the task as being activated if so needed */
343 rpc_set_active(task
);
346 * Protect the queue operations.
348 spin_lock_bh(&q
->lock
);
349 __rpc_sleep_on(q
, task
, action
);
350 spin_unlock_bh(&q
->lock
);
352 EXPORT_SYMBOL_GPL(rpc_sleep_on
);
355 * __rpc_do_wake_up_task - wake up a single rpc_task
357 * @task: task to be woken up
359 * Caller must hold queue->lock, and have cleared the task queued flag.
361 static void __rpc_do_wake_up_task(struct rpc_wait_queue
*queue
, struct rpc_task
*task
)
363 dprintk("RPC: %5u __rpc_wake_up_task (now %lu)\n",
364 task
->tk_pid
, jiffies
);
367 BUG_ON(task
->tk_magic
!= RPC_TASK_MAGIC_ID
);
369 /* Has the task been executed yet? If not, we cannot wake it up! */
370 if (!RPC_IS_ACTIVATED(task
)) {
371 printk(KERN_ERR
"RPC: Inactive task (%p) being woken up!\n", task
);
375 __rpc_remove_wait_queue(queue
, task
);
377 rpc_make_runnable(task
);
379 dprintk("RPC: __rpc_wake_up_task done\n");
383 * Wake up a queued task while the queue lock is being held
385 static void rpc_wake_up_task_queue_locked(struct rpc_wait_queue
*queue
, struct rpc_task
*task
)
387 if (RPC_IS_QUEUED(task
) && task
->tk_waitqueue
== queue
)
388 __rpc_do_wake_up_task(queue
, task
);
392 * Wake up a task on a specific queue
394 void rpc_wake_up_queued_task(struct rpc_wait_queue
*queue
, struct rpc_task
*task
)
396 spin_lock_bh(&queue
->lock
);
397 rpc_wake_up_task_queue_locked(queue
, task
);
398 spin_unlock_bh(&queue
->lock
);
400 EXPORT_SYMBOL_GPL(rpc_wake_up_queued_task
);
403 * Wake up the specified task
405 static void rpc_wake_up_task(struct rpc_task
*task
)
407 rpc_wake_up_queued_task(task
->tk_waitqueue
, task
);
411 * Wake up the next task on a priority queue.
413 static struct rpc_task
* __rpc_wake_up_next_priority(struct rpc_wait_queue
*queue
)
416 struct rpc_task
*task
;
419 * Service a batch of tasks from a single owner.
421 q
= &queue
->tasks
[queue
->priority
];
422 if (!list_empty(q
)) {
423 task
= list_entry(q
->next
, struct rpc_task
, u
.tk_wait
.list
);
424 if (queue
->owner
== task
->tk_owner
) {
427 list_move_tail(&task
->u
.tk_wait
.list
, q
);
430 * Check if we need to switch queues.
437 * Service the next queue.
440 if (q
== &queue
->tasks
[0])
441 q
= &queue
->tasks
[queue
->maxpriority
];
444 if (!list_empty(q
)) {
445 task
= list_entry(q
->next
, struct rpc_task
, u
.tk_wait
.list
);
448 } while (q
!= &queue
->tasks
[queue
->priority
]);
450 rpc_reset_waitqueue_priority(queue
);
454 rpc_set_waitqueue_priority(queue
, (unsigned int)(q
- &queue
->tasks
[0]));
456 rpc_set_waitqueue_owner(queue
, task
->tk_owner
);
458 rpc_wake_up_task_queue_locked(queue
, task
);
463 * Wake up the next task on the wait queue.
465 struct rpc_task
* rpc_wake_up_next(struct rpc_wait_queue
*queue
)
467 struct rpc_task
*task
= NULL
;
469 dprintk("RPC: wake_up_next(%p \"%s\")\n",
470 queue
, rpc_qname(queue
));
471 spin_lock_bh(&queue
->lock
);
472 if (RPC_IS_PRIORITY(queue
))
473 task
= __rpc_wake_up_next_priority(queue
);
475 task_for_first(task
, &queue
->tasks
[0])
476 rpc_wake_up_task_queue_locked(queue
, task
);
478 spin_unlock_bh(&queue
->lock
);
482 EXPORT_SYMBOL_GPL(rpc_wake_up_next
);
485 * rpc_wake_up - wake up all rpc_tasks
486 * @queue: rpc_wait_queue on which the tasks are sleeping
490 void rpc_wake_up(struct rpc_wait_queue
*queue
)
492 struct rpc_task
*task
, *next
;
493 struct list_head
*head
;
495 spin_lock_bh(&queue
->lock
);
496 head
= &queue
->tasks
[queue
->maxpriority
];
498 list_for_each_entry_safe(task
, next
, head
, u
.tk_wait
.list
)
499 rpc_wake_up_task_queue_locked(queue
, task
);
500 if (head
== &queue
->tasks
[0])
504 spin_unlock_bh(&queue
->lock
);
506 EXPORT_SYMBOL_GPL(rpc_wake_up
);
509 * rpc_wake_up_status - wake up all rpc_tasks and set their status value.
510 * @queue: rpc_wait_queue on which the tasks are sleeping
511 * @status: status value to set
515 void rpc_wake_up_status(struct rpc_wait_queue
*queue
, int status
)
517 struct rpc_task
*task
, *next
;
518 struct list_head
*head
;
520 spin_lock_bh(&queue
->lock
);
521 head
= &queue
->tasks
[queue
->maxpriority
];
523 list_for_each_entry_safe(task
, next
, head
, u
.tk_wait
.list
) {
524 task
->tk_status
= status
;
525 rpc_wake_up_task_queue_locked(queue
, task
);
527 if (head
== &queue
->tasks
[0])
531 spin_unlock_bh(&queue
->lock
);
533 EXPORT_SYMBOL_GPL(rpc_wake_up_status
);
535 static void __rpc_queue_timer_fn(unsigned long ptr
)
537 struct rpc_wait_queue
*queue
= (struct rpc_wait_queue
*)ptr
;
538 struct rpc_task
*task
, *n
;
539 unsigned long expires
, now
, timeo
;
541 spin_lock(&queue
->lock
);
542 expires
= now
= jiffies
;
543 list_for_each_entry_safe(task
, n
, &queue
->timer_list
.list
, u
.tk_wait
.timer_list
) {
544 timeo
= task
->u
.tk_wait
.expires
;
545 if (time_after_eq(now
, timeo
)) {
546 dprintk("RPC: %5u timeout\n", task
->tk_pid
);
547 task
->tk_status
= -ETIMEDOUT
;
548 rpc_wake_up_task_queue_locked(queue
, task
);
551 if (expires
== now
|| time_after(expires
, timeo
))
554 if (!list_empty(&queue
->timer_list
.list
))
555 rpc_set_queue_timer(queue
, expires
);
556 spin_unlock(&queue
->lock
);
559 static void __rpc_atrun(struct rpc_task
*task
)
565 * Run a task at a later time
567 void rpc_delay(struct rpc_task
*task
, unsigned long delay
)
569 task
->tk_timeout
= delay
;
570 rpc_sleep_on(&delay_queue
, task
, __rpc_atrun
);
572 EXPORT_SYMBOL_GPL(rpc_delay
);
575 * Helper to call task->tk_ops->rpc_call_prepare
577 static void rpc_prepare_task(struct rpc_task
*task
)
580 task
->tk_ops
->rpc_call_prepare(task
, task
->tk_calldata
);
585 * Helper that calls task->tk_ops->rpc_call_done if it exists
587 void rpc_exit_task(struct rpc_task
*task
)
589 task
->tk_action
= NULL
;
590 if (task
->tk_ops
->rpc_call_done
!= NULL
) {
592 task
->tk_ops
->rpc_call_done(task
, task
->tk_calldata
);
594 if (task
->tk_action
!= NULL
) {
595 WARN_ON(RPC_ASSASSINATED(task
));
596 /* Always release the RPC slot and buffer memory */
601 EXPORT_SYMBOL_GPL(rpc_exit_task
);
603 void rpc_release_calldata(const struct rpc_call_ops
*ops
, void *calldata
)
605 if (ops
->rpc_release
!= NULL
) {
607 ops
->rpc_release(calldata
);
613 * This is the RPC `scheduler' (or rather, the finite state machine).
615 static void __rpc_execute(struct rpc_task
*task
)
619 dprintk("RPC: %5u __rpc_execute flags=0x%x\n",
620 task
->tk_pid
, task
->tk_flags
);
622 BUG_ON(RPC_IS_QUEUED(task
));
627 * Execute any pending callback.
629 if (task
->tk_callback
) {
630 void (*save_callback
)(struct rpc_task
*);
633 * We set tk_callback to NULL before calling it,
634 * in case it sets the tk_callback field itself:
636 save_callback
= task
->tk_callback
;
637 task
->tk_callback
= NULL
;
642 * Perform the next FSM step.
643 * tk_action may be NULL when the task has been killed
646 if (!RPC_IS_QUEUED(task
)) {
647 if (task
->tk_action
== NULL
)
649 task
->tk_action(task
);
653 * Lockless check for whether task is sleeping or not.
655 if (!RPC_IS_QUEUED(task
))
657 rpc_clear_running(task
);
658 if (RPC_IS_ASYNC(task
)) {
659 /* Careful! we may have raced... */
660 if (RPC_IS_QUEUED(task
))
662 if (rpc_test_and_set_running(task
))
667 /* sync task: sleep here */
668 dprintk("RPC: %5u sync task going to sleep\n", task
->tk_pid
);
669 status
= out_of_line_wait_on_bit(&task
->tk_runstate
,
670 RPC_TASK_QUEUED
, rpc_wait_bit_killable
,
672 if (status
== -ERESTARTSYS
) {
674 * When a sync task receives a signal, it exits with
675 * -ERESTARTSYS. In order to catch any callbacks that
676 * clean up after sleeping on some queue, we don't
677 * break the loop here, but go around once more.
679 dprintk("RPC: %5u got signal\n", task
->tk_pid
);
680 task
->tk_flags
|= RPC_TASK_KILLED
;
681 rpc_exit(task
, -ERESTARTSYS
);
682 rpc_wake_up_task(task
);
684 rpc_set_running(task
);
685 dprintk("RPC: %5u sync task resuming\n", task
->tk_pid
);
688 dprintk("RPC: %5u return %d, status %d\n", task
->tk_pid
, status
,
690 /* Release all resources associated with the task */
691 rpc_release_task(task
);
695 * User-visible entry point to the scheduler.
697 * This may be called recursively if e.g. an async NFS task updates
698 * the attributes and finds that dirty pages must be flushed.
699 * NOTE: Upon exit of this function the task is guaranteed to be
700 * released. In particular note that tk_release() will have
701 * been called, so your task memory may have been freed.
703 void rpc_execute(struct rpc_task
*task
)
705 rpc_set_active(task
);
706 rpc_set_running(task
);
710 static void rpc_async_schedule(struct work_struct
*work
)
712 __rpc_execute(container_of(work
, struct rpc_task
, u
.tk_work
));
721 * rpc_malloc - allocate an RPC buffer
722 * @task: RPC task that will use this buffer
723 * @size: requested byte size
725 * To prevent rpciod from hanging, this allocator never sleeps,
726 * returning NULL if the request cannot be serviced immediately.
727 * The caller can arrange to sleep in a way that is safe for rpciod.
729 * Most requests are 'small' (under 2KiB) and can be serviced from a
730 * mempool, ensuring that NFS reads and writes can always proceed,
731 * and that there is good locality of reference for these buffers.
733 * In order to avoid memory starvation triggering more writebacks of
734 * NFS requests, we avoid using GFP_KERNEL.
736 void *rpc_malloc(struct rpc_task
*task
, size_t size
)
738 struct rpc_buffer
*buf
;
739 gfp_t gfp
= RPC_IS_SWAPPER(task
) ? GFP_ATOMIC
: GFP_NOWAIT
;
741 size
+= sizeof(struct rpc_buffer
);
742 if (size
<= RPC_BUFFER_MAXSIZE
)
743 buf
= mempool_alloc(rpc_buffer_mempool
, gfp
);
745 buf
= kmalloc(size
, gfp
);
751 dprintk("RPC: %5u allocated buffer of size %zu at %p\n",
752 task
->tk_pid
, size
, buf
);
755 EXPORT_SYMBOL_GPL(rpc_malloc
);
758 * rpc_free - free buffer allocated via rpc_malloc
759 * @buffer: buffer to free
762 void rpc_free(void *buffer
)
765 struct rpc_buffer
*buf
;
770 buf
= container_of(buffer
, struct rpc_buffer
, data
);
773 dprintk("RPC: freeing buffer of size %zu at %p\n",
776 if (size
<= RPC_BUFFER_MAXSIZE
)
777 mempool_free(buf
, rpc_buffer_mempool
);
781 EXPORT_SYMBOL_GPL(rpc_free
);
784 * Creation and deletion of RPC task structures
786 static void rpc_init_task(struct rpc_task
*task
, const struct rpc_task_setup
*task_setup_data
)
788 memset(task
, 0, sizeof(*task
));
789 atomic_set(&task
->tk_count
, 1);
790 task
->tk_flags
= task_setup_data
->flags
;
791 task
->tk_ops
= task_setup_data
->callback_ops
;
792 task
->tk_calldata
= task_setup_data
->callback_data
;
793 INIT_LIST_HEAD(&task
->tk_task
);
795 /* Initialize retry counters */
796 task
->tk_garb_retry
= 2;
797 task
->tk_cred_retry
= 2;
799 task
->tk_priority
= task_setup_data
->priority
- RPC_PRIORITY_LOW
;
800 task
->tk_owner
= current
->tgid
;
802 /* Initialize workqueue for async tasks */
803 task
->tk_workqueue
= task_setup_data
->workqueue
;
805 task
->tk_client
= task_setup_data
->rpc_client
;
806 if (task
->tk_client
!= NULL
) {
807 kref_get(&task
->tk_client
->cl_kref
);
808 if (task
->tk_client
->cl_softrtry
)
809 task
->tk_flags
|= RPC_TASK_SOFT
;
812 if (task
->tk_ops
->rpc_call_prepare
!= NULL
)
813 task
->tk_action
= rpc_prepare_task
;
815 if (task_setup_data
->rpc_message
!= NULL
) {
816 task
->tk_msg
.rpc_proc
= task_setup_data
->rpc_message
->rpc_proc
;
817 task
->tk_msg
.rpc_argp
= task_setup_data
->rpc_message
->rpc_argp
;
818 task
->tk_msg
.rpc_resp
= task_setup_data
->rpc_message
->rpc_resp
;
819 /* Bind the user cred */
820 rpcauth_bindcred(task
, task_setup_data
->rpc_message
->rpc_cred
, task_setup_data
->flags
);
821 if (task
->tk_action
== NULL
)
822 rpc_call_start(task
);
825 /* starting timestamp */
826 task
->tk_start
= jiffies
;
828 dprintk("RPC: new task initialized, procpid %u\n",
829 task_pid_nr(current
));
832 static struct rpc_task
*
835 return (struct rpc_task
*)mempool_alloc(rpc_task_mempool
, GFP_NOFS
);
839 * Create a new task for the specified client.
841 struct rpc_task
*rpc_new_task(const struct rpc_task_setup
*setup_data
)
843 struct rpc_task
*task
= setup_data
->task
;
844 unsigned short flags
= 0;
847 task
= rpc_alloc_task();
850 flags
= RPC_TASK_DYNAMIC
;
853 rpc_init_task(task
, setup_data
);
855 task
->tk_flags
|= flags
;
856 dprintk("RPC: allocated task %p\n", task
);
861 static void rpc_free_task(struct rpc_task
*task
)
863 const struct rpc_call_ops
*tk_ops
= task
->tk_ops
;
864 void *calldata
= task
->tk_calldata
;
866 if (task
->tk_flags
& RPC_TASK_DYNAMIC
) {
867 dprintk("RPC: %5u freeing task\n", task
->tk_pid
);
868 mempool_free(task
, rpc_task_mempool
);
870 rpc_release_calldata(tk_ops
, calldata
);
873 static void rpc_async_release(struct work_struct
*work
)
875 rpc_free_task(container_of(work
, struct rpc_task
, u
.tk_work
));
878 void rpc_put_task(struct rpc_task
*task
)
880 if (!atomic_dec_and_test(&task
->tk_count
))
882 /* Release resources */
885 if (task
->tk_msg
.rpc_cred
)
886 rpcauth_unbindcred(task
);
887 if (task
->tk_client
) {
888 rpc_release_client(task
->tk_client
);
889 task
->tk_client
= NULL
;
891 if (task
->tk_workqueue
!= NULL
) {
892 INIT_WORK(&task
->u
.tk_work
, rpc_async_release
);
893 queue_work(task
->tk_workqueue
, &task
->u
.tk_work
);
897 EXPORT_SYMBOL_GPL(rpc_put_task
);
899 static void rpc_release_task(struct rpc_task
*task
)
902 BUG_ON(task
->tk_magic
!= RPC_TASK_MAGIC_ID
);
904 dprintk("RPC: %5u release task\n", task
->tk_pid
);
906 if (!list_empty(&task
->tk_task
)) {
907 struct rpc_clnt
*clnt
= task
->tk_client
;
908 /* Remove from client task list */
909 spin_lock(&clnt
->cl_lock
);
910 list_del(&task
->tk_task
);
911 spin_unlock(&clnt
->cl_lock
);
913 BUG_ON (RPC_IS_QUEUED(task
));
918 /* Wake up anyone who is waiting for task completion */
919 rpc_mark_complete_task(task
);
925 * Kill all tasks for the given client.
926 * XXX: kill their descendants as well?
928 void rpc_killall_tasks(struct rpc_clnt
*clnt
)
930 struct rpc_task
*rovr
;
933 if (list_empty(&clnt
->cl_tasks
))
935 dprintk("RPC: killing all tasks for client %p\n", clnt
);
937 * Spin lock all_tasks to prevent changes...
939 spin_lock(&clnt
->cl_lock
);
940 list_for_each_entry(rovr
, &clnt
->cl_tasks
, tk_task
) {
941 if (! RPC_IS_ACTIVATED(rovr
))
943 if (!(rovr
->tk_flags
& RPC_TASK_KILLED
)) {
944 rovr
->tk_flags
|= RPC_TASK_KILLED
;
945 rpc_exit(rovr
, -EIO
);
946 rpc_wake_up_task(rovr
);
949 spin_unlock(&clnt
->cl_lock
);
951 EXPORT_SYMBOL_GPL(rpc_killall_tasks
);
955 return try_module_get(THIS_MODULE
) ? 0 : -EINVAL
;
958 void rpciod_down(void)
960 module_put(THIS_MODULE
);
964 * Start up the rpciod workqueue.
966 static int rpciod_start(void)
968 struct workqueue_struct
*wq
;
971 * Create the rpciod thread and wait for it to start.
973 dprintk("RPC: creating workqueue rpciod\n");
974 wq
= create_workqueue("rpciod");
975 rpciod_workqueue
= wq
;
976 return rpciod_workqueue
!= NULL
;
979 static void rpciod_stop(void)
981 struct workqueue_struct
*wq
= NULL
;
983 if (rpciod_workqueue
== NULL
)
985 dprintk("RPC: destroying workqueue rpciod\n");
987 wq
= rpciod_workqueue
;
988 rpciod_workqueue
= NULL
;
989 destroy_workqueue(wq
);
993 rpc_destroy_mempool(void)
996 if (rpc_buffer_mempool
)
997 mempool_destroy(rpc_buffer_mempool
);
998 if (rpc_task_mempool
)
999 mempool_destroy(rpc_task_mempool
);
1001 kmem_cache_destroy(rpc_task_slabp
);
1002 if (rpc_buffer_slabp
)
1003 kmem_cache_destroy(rpc_buffer_slabp
);
1004 rpc_destroy_wait_queue(&delay_queue
);
1008 rpc_init_mempool(void)
1011 * The following is not strictly a mempool initialisation,
1012 * but there is no harm in doing it here
1014 rpc_init_wait_queue(&delay_queue
, "delayq");
1015 if (!rpciod_start())
1018 rpc_task_slabp
= kmem_cache_create("rpc_tasks",
1019 sizeof(struct rpc_task
),
1020 0, SLAB_HWCACHE_ALIGN
,
1022 if (!rpc_task_slabp
)
1024 rpc_buffer_slabp
= kmem_cache_create("rpc_buffers",
1026 0, SLAB_HWCACHE_ALIGN
,
1028 if (!rpc_buffer_slabp
)
1030 rpc_task_mempool
= mempool_create_slab_pool(RPC_TASK_POOLSIZE
,
1032 if (!rpc_task_mempool
)
1034 rpc_buffer_mempool
= mempool_create_slab_pool(RPC_BUFFER_POOLSIZE
,
1036 if (!rpc_buffer_mempool
)
1040 rpc_destroy_mempool();