xref: /freebsd/share/man/man9/taskqueue.9 (revision 9ba47352808d701431f0996993f3e31a9da87887)
182323455SDoug Rabson.\" -*- nroff -*-
282323455SDoug Rabson.\"
382323455SDoug Rabson.\" Copyright (c) 2000 Doug Rabson
482323455SDoug Rabson.\"
582323455SDoug Rabson.\" All rights reserved.
682323455SDoug Rabson.\"
782323455SDoug Rabson.\" This program is free software.
882323455SDoug Rabson.\"
982323455SDoug Rabson.\" Redistribution and use in source and binary forms, with or without
1082323455SDoug Rabson.\" modification, are permitted provided that the following conditions
1182323455SDoug Rabson.\" are met:
1282323455SDoug Rabson.\" 1. Redistributions of source code must retain the above copyright
1382323455SDoug Rabson.\"    notice, this list of conditions and the following disclaimer.
1482323455SDoug Rabson.\" 2. Redistributions in binary form must reproduce the above copyright
1582323455SDoug Rabson.\"    notice, this list of conditions and the following disclaimer in the
1682323455SDoug Rabson.\"    documentation and/or other materials provided with the distribution.
1782323455SDoug Rabson.\"
1882323455SDoug Rabson.\" THIS SOFTWARE IS PROVIDED BY THE DEVELOPERS ``AS IS'' AND ANY EXPRESS OR
1982323455SDoug Rabson.\" IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
2082323455SDoug Rabson.\" OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
2182323455SDoug Rabson.\" IN NO EVENT SHALL THE DEVELOPERS BE LIABLE FOR ANY DIRECT, INDIRECT,
2282323455SDoug Rabson.\" INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
2382323455SDoug Rabson.\" NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
2482323455SDoug Rabson.\" DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
2582323455SDoug Rabson.\" THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2682323455SDoug Rabson.\" (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
2782323455SDoug Rabson.\" THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
2882323455SDoug Rabson.\"
2982323455SDoug Rabson.\" $FreeBSD$
3082323455SDoug Rabson.\"
31e477e4feSPawel Jakub Dawidek.Dd August 18, 2009
3282323455SDoug Rabson.Dt TASKQUEUE 9
3382323455SDoug Rabson.Os
3482323455SDoug Rabson.Sh NAME
3582323455SDoug Rabson.Nm taskqueue
3682323455SDoug Rabson.Nd asynchronous task execution
3782323455SDoug Rabson.Sh SYNOPSIS
3832eef9aeSRuslan Ermilov.In sys/param.h
39f16b3c0dSChad David.In sys/kernel.h
40f16b3c0dSChad David.In sys/malloc.h
4132eef9aeSRuslan Ermilov.In sys/queue.h
4232eef9aeSRuslan Ermilov.In sys/taskqueue.h
4382323455SDoug Rabson.Bd -literal
44f674e945SBruce M Simpsontypedef void (*task_fn_t)(void *context, int pending);
4582323455SDoug Rabson
4682323455SDoug Rabsontypedef void (*taskqueue_enqueue_fn)(void *context);
4782323455SDoug Rabson
4882323455SDoug Rabsonstruct task {
4982323455SDoug Rabson	STAILQ_ENTRY(task)	ta_link;	/* link for queue */
50cf82599dSSam Leffler	u_short			ta_pending;	/* count times queued */
51cf82599dSSam Leffler	u_short			ta_priority;	/* priority of task in queue */
52f674e945SBruce M Simpson	task_fn_t		ta_func;	/* task handler */
5382323455SDoug Rabson	void			*ta_context;	/* argument for handler */
5482323455SDoug Rabson};
5582323455SDoug Rabson.Ed
5682323455SDoug Rabson.Ft struct taskqueue *
578f668ffaSOleksandr Tymoshenko.Fn taskqueue_create "const char *name" "int mflags" "taskqueue_enqueue_fn enqueue" "void *context"
582eb30874SOleksandr Tymoshenko.Ft struct taskqueue *
592eb30874SOleksandr Tymoshenko.Fn taskqueue_create_fast "const char *name" "int mflags" "taskqueue_enqueue_fn enqueue" "void *context"
6082323455SDoug Rabson.Ft void
6182323455SDoug Rabson.Fn taskqueue_free "struct taskqueue *queue"
6282323455SDoug Rabson.Ft int
6382323455SDoug Rabson.Fn taskqueue_enqueue "struct taskqueue *queue" "struct task *task"
6424b4e9d1SScott Long.Ft int
6524b4e9d1SScott Long.Fn taskqueue_enqueue_fast "struct taskqueue *queue" "struct task *task"
6682323455SDoug Rabson.Ft void
67fff7ff71SGleb Smirnoff.Fn taskqueue_drain "struct taskqueue *queue" "struct task *task"
68159ef108SPawel Jakub Dawidek.Ft int
69159ef108SPawel Jakub Dawidek.Fn taskqueue_member "struct taskqueue *queue" "struct thread *td"
70f16b3c0dSChad David.Fn TASK_INIT "struct task *task" "int priority" "task_fn_t *func" "void *context"
7182323455SDoug Rabson.Fn TASKQUEUE_DECLARE "name"
72f16b3c0dSChad David.Fn TASKQUEUE_DEFINE "name" "taskqueue_enqueue_fn enqueue" "void *context" "init"
732eb30874SOleksandr Tymoshenko.Fn TASKQUEUE_FAST_DEFINE "name" "taskqueue_enqueue_fn enqueue" "void *context" "init"
74227559d1SJohn-Mark Gurney.Fn TASKQUEUE_DEFINE_THREAD "name"
752eb30874SOleksandr Tymoshenko.Fn TASKQUEUE_FAST_DEFINE_THREAD "name"
7682323455SDoug Rabson.Sh DESCRIPTION
7782323455SDoug RabsonThese functions provide a simple interface for asynchronous execution
7882323455SDoug Rabsonof code.
7982323455SDoug Rabson.Pp
8082323455SDoug RabsonThe function
8182323455SDoug Rabson.Fn taskqueue_create
8282323455SDoug Rabsonis used to create new queues.
8382323455SDoug RabsonThe arguments to
8482323455SDoug Rabson.Fn taskqueue_create
85cf82599dSSam Lefflerinclude a name that should be unique,
8682323455SDoug Rabsona set of
8782323455SDoug Rabson.Xr malloc 9
88cf82599dSSam Lefflerflags that specify whether the call to
8982323455SDoug Rabson.Fn malloc
90cf82599dSSam Leffleris allowed to sleep,
91cf82599dSSam Lefflera function that is called from
9282323455SDoug Rabson.Fn taskqueue_enqueue
93cf82599dSSam Lefflerwhen a task is added to the queue,
94cf82599dSSam Lefflerand a pointer to the memory location where the identity of the
95cf82599dSSam Lefflerthread that services the queue is recorded.
9682323455SDoug Rabson.\" XXX	The rest of the sentence gets lots in relation to the first part.
97cf82599dSSam LefflerThe function called from
98cf82599dSSam Leffler.Fn taskqueue_enqueue
99cf82599dSSam Lefflermust arrange for the queue to be processed
10082323455SDoug Rabson(for instance by scheduling a software interrupt or waking a kernel
10182323455SDoug Rabsonthread).
102cf82599dSSam LefflerThe memory location where the thread identity is recorded is used
103cf82599dSSam Lefflerto signal the service thread(s) to terminate--when this value is set to
104cf82599dSSam Lefflerzero and the thread is signaled it will terminate.
1052eb30874SOleksandr TymoshenkoIf the queue is intended for use in fast interrupt handlers
1062eb30874SOleksandr Tymoshenko.Fn taskqueue_create_fast
1072eb30874SOleksandr Tymoshenkoshould be used in place of
1082eb30874SOleksandr Tymoshenko.Fn taskqueue_create .
10982323455SDoug Rabson.Pp
11082323455SDoug RabsonThe function
11182323455SDoug Rabson.Fn taskqueue_free
112e477e4feSPawel Jakub Dawidekshould be used to free the memory used by the queue.
113cf82599dSSam LefflerAny tasks that are on the queue will be executed at this time after
114cf82599dSSam Lefflerwhich the thread servicing the queue will be signaled that it should exit.
11582323455SDoug Rabson.Pp
11682323455SDoug RabsonTo add a task to the list of tasks queued on a taskqueue, call
11782323455SDoug Rabson.Fn taskqueue_enqueue
11882323455SDoug Rabsonwith pointers to the queue and task.
11982323455SDoug RabsonIf the task's
12082323455SDoug Rabson.Va ta_pending
12182323455SDoug Rabsonfield is non-zero,
12282323455SDoug Rabsonthen it is simply incremented to reflect the number of times the task
12382323455SDoug Rabsonwas enqueued.
12482323455SDoug RabsonOtherwise,
12582323455SDoug Rabsonthe task is added to the list before the first task which has a lower
12682323455SDoug Rabson.Va ta_priority
12782323455SDoug Rabsonvalue or at the end of the list if no tasks have a lower priority.
12882323455SDoug RabsonEnqueueing a task does not perform any memory allocation which makes
12982323455SDoug Rabsonit suitable for calling from an interrupt handler.
13082323455SDoug RabsonThis function will return
131b92a189eSRuslan Ermilov.Er EPIPE
13282323455SDoug Rabsonif the queue is being freed.
13382323455SDoug Rabson.Pp
13424b4e9d1SScott LongThe function
13524b4e9d1SScott Long.Fn taskqueue_enqueue_fast
13624b4e9d1SScott Longshould be used in place of
13724b4e9d1SScott Long.Fn taskqueue_enqueue
13824b4e9d1SScott Longwhen the enqueuing must happen from a fast interrupt handler.
13924b4e9d1SScott LongThis method uses spin locks to avoid the possibility of sleeping in the fast
14024b4e9d1SScott Longinterrupt context.
14124b4e9d1SScott Long.Pp
14282323455SDoug RabsonWhen a task is executed,
14382323455SDoug Rabsonfirst it is removed from the queue,
14482323455SDoug Rabsonthe value of
14582323455SDoug Rabson.Va ta_pending
14682323455SDoug Rabsonis recorded and then the field is zeroed.
14782323455SDoug RabsonThe function
14882323455SDoug Rabson.Va ta_func
14982323455SDoug Rabsonfrom the task structure is called with the value of the field
15082323455SDoug Rabson.Va ta_context
15182323455SDoug Rabsonas its first argument
15282323455SDoug Rabsonand the value of
15382323455SDoug Rabson.Va ta_pending
15482323455SDoug Rabsonas its second argument.
155f616cf33SJohn-Mark GurneyAfter the function
156f616cf33SJohn-Mark Gurney.Va ta_func
157f616cf33SJohn-Mark Gurneyreturns,
158f616cf33SJohn-Mark Gurney.Xr wakeup 9
159f616cf33SJohn-Mark Gurneyis called on the task pointer passed to
160f616cf33SJohn-Mark Gurney.Fn taskqueue_enqueue .
16182323455SDoug Rabson.Pp
162fff7ff71SGleb SmirnoffThe
163fff7ff71SGleb Smirnoff.Fn taskqueue_drain
164fff7ff71SGleb Smirnofffunction is used to wait for the task to finish.
165fff7ff71SGleb SmirnoffThere is no guarantee that the task will not be
166fff7ff71SGleb Smirnoffenqueued after call to
167fff7ff71SGleb Smirnoff.Fn taskqueue_drain .
168fff7ff71SGleb Smirnoff.Pp
169159ef108SPawel Jakub DawidekThe
170159ef108SPawel Jakub Dawidek.Fn taskqueue_member
171159ef108SPawel Jakub Dawidekfunction returns
172159ef108SPawel Jakub Dawidek.No 1
1739c1a8ce4SPawel Jakub Dawidekif the given thread
174159ef108SPawel Jakub Dawidek.Fa td
175*9ba47352SJoel Dahlis part of the given taskqueue
176159ef108SPawel Jakub Dawidek.Fa queue
177159ef108SPawel Jakub Dawidekand
178159ef108SPawel Jakub Dawidek.No 0
179159ef108SPawel Jakub Dawidekotherwise.
180159ef108SPawel Jakub Dawidek.Pp
18182323455SDoug RabsonA convenience macro,
18282323455SDoug Rabson.Fn TASK_INIT "task" "priority" "func" "context"
18382323455SDoug Rabsonis provided to initialise a
18482323455SDoug Rabson.Va task
18582323455SDoug Rabsonstructure.
18682323455SDoug RabsonThe values of
18782323455SDoug Rabson.Va priority ,
18882323455SDoug Rabson.Va func ,
18982323455SDoug Rabsonand
19082323455SDoug Rabson.Va context
19182323455SDoug Rabsonare simply copied into the task structure fields and the
19282323455SDoug Rabson.Va ta_pending
19382323455SDoug Rabsonfield is cleared.
19482323455SDoug Rabson.Pp
1952eb30874SOleksandr TymoshenkoFive macros
196227559d1SJohn-Mark Gurney.Fn TASKQUEUE_DECLARE "name" ,
197227559d1SJohn-Mark Gurney.Fn TASKQUEUE_DEFINE "name" "enqueue" "context" "init" ,
1982eb30874SOleksandr Tymoshenko.Fn TASKQUEUE_FAST_DEFINE "name" "enqueue" "context" "init" ,
19982323455SDoug Rabsonand
200227559d1SJohn-Mark Gurney.Fn TASKQUEUE_DEFINE_THREAD "name"
2012eb30874SOleksandr Tymoshenko.Fn TASKQUEUE_FAST_DEFINE_THREAD "name"
202227559d1SJohn-Mark Gurneyare used to declare a reference to a global queue, to define the
203c0854fb7SRuslan Ermilovimplementation of the queue, and declare a queue that uses its own thread.
20482323455SDoug RabsonThe
20582323455SDoug Rabson.Fn TASKQUEUE_DEFINE
20682323455SDoug Rabsonmacro arranges to call
20782323455SDoug Rabson.Fn taskqueue_create
20882323455SDoug Rabsonwith the values of its
20982323455SDoug Rabson.Va name ,
21082323455SDoug Rabson.Va enqueue
21182323455SDoug Rabsonand
21282323455SDoug Rabson.Va context
21382323455SDoug Rabsonarguments during system initialisation.
21482323455SDoug RabsonAfter calling
21582323455SDoug Rabson.Fn taskqueue_create ,
21682323455SDoug Rabsonthe
21782323455SDoug Rabson.Va init
21882323455SDoug Rabsonargument to the macro is executed as a C statement,
21982323455SDoug Rabsonallowing any further initialisation to be performed
22082323455SDoug Rabson(such as registering an interrupt handler etc.)
22182323455SDoug Rabson.Pp
222227559d1SJohn-Mark GurneyThe
223227559d1SJohn-Mark Gurney.Fn TASKQUEUE_DEFINE_THREAD
224c0854fb7SRuslan Ermilovmacro defines a new taskqueue with its own kernel thread to serve tasks.
225c0854fb7SRuslan ErmilovThe variable
226227559d1SJohn-Mark Gurney.Vt struct taskqueue *taskqueue_name
227227559d1SJohn-Mark Gurneyis used to enqueue tasks onto the queue.
2282eb30874SOleksandr Tymoshenko.Pp
2292eb30874SOleksandr Tymoshenko.Fn TASKQUEUE_FAST_DEFINE
2302eb30874SOleksandr Tymoshenkoand
2312eb30874SOleksandr Tymoshenko.Fn TASKQUEUE_FAST_DEFINE_THREAD
2322eb30874SOleksandr Tymoshenkoact just like
2332eb30874SOleksandr Tymoshenko.Fn TASKQUEUE_DEFINE
2342eb30874SOleksandr Tymoshenkoand
2352eb30874SOleksandr Tymoshenko.Fn TASKQUEUE_DEFINE_THREAD
2362eb30874SOleksandr Tymoshenkorespectively but taskqueue is created with
2372eb30874SOleksandr Tymoshenko.Fn taskqueue_create_fast .
2384c49b002SJoseph Koshy.Ss Predefined Task Queues
2394c49b002SJoseph KoshyThe system provides four global taskqueues,
2404c49b002SJoseph Koshy.Va taskqueue_fast ,
24182323455SDoug Rabson.Va taskqueue_swi ,
242cb32189eSKenneth D. Merry.Va taskqueue_swi_giant ,
243cb32189eSKenneth D. Merryand
244cb32189eSKenneth D. Merry.Va taskqueue_thread .
2454c49b002SJoseph KoshyThe
2464c49b002SJoseph Koshy.Va taskqueue_fast
2474c49b002SJoseph Koshyqueue is for swi handlers dispatched from fast interrupt handlers,
2484c49b002SJoseph Koshywhere sleep mutexes cannot be used.
249cb32189eSKenneth D. MerryThe swi taskqueues are run via a software interrupt mechanism.
2504c49b002SJoseph KoshyThe
2514c49b002SJoseph Koshy.Va taskqueue_swi
2524c49b002SJoseph Koshyqueue runs without the protection of the
2534c49b002SJoseph Koshy.Va Giant
2544c49b002SJoseph Koshykernel lock, and the
2554c49b002SJoseph Koshy.Va taskqueue_swi_giant
2564c49b002SJoseph Koshyqueue runs with the protection of the
2574c49b002SJoseph Koshy.Va Giant
258cb32189eSKenneth D. Merrykernel lock.
2594c49b002SJoseph KoshyThe thread taskqueue
2604c49b002SJoseph Koshy.Va taskqueue_thread
2614c49b002SJoseph Koshyruns in a kernel thread context, and tasks run from this thread do
2624c49b002SJoseph Koshynot run under the
2634c49b002SJoseph Koshy.Va Giant
2644c49b002SJoseph Koshykernel lock.
2654c49b002SJoseph KoshyIf the caller wants to run under
2664c49b002SJoseph Koshy.Va Giant ,
2674c49b002SJoseph Koshyhe should explicitly acquire and release
2684c49b002SJoseph Koshy.Va Giant
2694c49b002SJoseph Koshyin his taskqueue handler routine.
270bf7f20c2SRuslan Ermilov.Pp
271cb32189eSKenneth D. MerryTo use these queues,
27282323455SDoug Rabsoncall
27382323455SDoug Rabson.Fn taskqueue_enqueue
274cb32189eSKenneth D. Merrywith the value of the global taskqueue variable for the queue you wish to
275c0854fb7SRuslan Ermilovuse
276c0854fb7SRuslan Ermilov.Va ( taskqueue_swi ,
277cb32189eSKenneth D. Merry.Va taskqueue_swi_giant ,
278cb32189eSKenneth D. Merryor
279c0854fb7SRuslan Ermilov.Va taskqueue_thread ) .
2804c49b002SJoseph KoshyUse
2814c49b002SJoseph Koshy.Fn taskqueue_enqueue_fast
2824c49b002SJoseph Koshyfor the global taskqueue variable
2834c49b002SJoseph Koshy.Va taskqueue_fast .
28482323455SDoug Rabson.Pp
285e0254f10SKenneth D. MerryThe software interrupt queues can be used,
28682323455SDoug Rabsonfor instance, for implementing interrupt handlers which must perform a
28782323455SDoug Rabsonsignificant amount of processing in the handler.
28882323455SDoug RabsonThe hardware interrupt handler would perform minimal processing of the
28982323455SDoug Rabsoninterrupt and then enqueue a task to finish the work.
29082323455SDoug RabsonThis reduces to a minimum
29182323455SDoug Rabsonthe amount of time spent with interrupts disabled.
292cb32189eSKenneth D. Merry.Pp
293cb32189eSKenneth D. MerryThe thread queue can be used, for instance, by interrupt level routines
294cb32189eSKenneth D. Merrythat need to call kernel functions that do things that can only be done
295cb32189eSKenneth D. Merryfrom a thread context.
296cb32189eSKenneth D. Merry(e.g., call malloc with the M_WAITOK flag.)
297cf82599dSSam Leffler.Pp
298cf82599dSSam LefflerNote that tasks queued on shared taskqueues such as
299cf82599dSSam Leffler.Va taskqueue_swi
300cf82599dSSam Lefflermay be delayed an indeterminate amount of time before execution.
301cf82599dSSam LefflerIf queueing delays cannot be tolerated then a private taskqueue should
302cf82599dSSam Lefflerbe created with a dedicated processing thread.
3033bbf58f9SJoseph Koshy.Sh SEE ALSO
3043bbf58f9SJoseph Koshy.Xr ithread 9 ,
3053bbf58f9SJoseph Koshy.Xr kthread 9 ,
3063bbf58f9SJoseph Koshy.Xr swi 9
30782323455SDoug Rabson.Sh HISTORY
30882323455SDoug RabsonThis interface first appeared in
30982323455SDoug Rabson.Fx 5.0 .
31082323455SDoug RabsonThere is a similar facility called tqueue in the Linux kernel.
31182323455SDoug Rabson.Sh AUTHORS
312571dba6eSHiten PandyaThis manual page was written by
31382323455SDoug Rabson.An Doug Rabson .
314