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.\" 31cf82599dSSam Leffler.Dd Apr 30, 2005 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 * 57cf82599dSSam Leffler.Fn taskqueue_create "const char *name" "int mflags" "taskqueue_enqueue_fn enqueue" "void *context" "struct proc **" 5882323455SDoug Rabson.Ft void 5982323455SDoug Rabson.Fn taskqueue_free "struct taskqueue *queue" 6082323455SDoug Rabson.Ft struct taskqueue * 6182323455SDoug Rabson.Fn taskqueue_find "const char *name" 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 6782323455SDoug Rabson.Fn taskqueue_run "struct taskqueue *queue" 684c49b002SJoseph Koshy.Ft void 694c49b002SJoseph Koshy.Fn taskqueue_run_fast "struct taskqueue *queue" 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" 73227559d1SJohn-Mark Gurney.Fn TASKQUEUE_DEFINE_THREAD "name" 7482323455SDoug Rabson.Sh DESCRIPTION 7582323455SDoug RabsonThese functions provide a simple interface for asynchronous execution 7682323455SDoug Rabsonof code. 7782323455SDoug Rabson.Pp 7882323455SDoug RabsonThe function 7982323455SDoug Rabson.Fn taskqueue_create 8082323455SDoug Rabsonis used to create new queues. 8182323455SDoug RabsonThe arguments to 8282323455SDoug Rabson.Fn taskqueue_create 83cf82599dSSam Lefflerinclude a name that should be unique, 8482323455SDoug Rabsona set of 8582323455SDoug Rabson.Xr malloc 9 86cf82599dSSam Lefflerflags that specify whether the call to 8782323455SDoug Rabson.Fn malloc 88cf82599dSSam Leffleris allowed to sleep, 89cf82599dSSam Lefflera function that is called from 9082323455SDoug Rabson.Fn taskqueue_enqueue 91cf82599dSSam Lefflerwhen a task is added to the queue, 92cf82599dSSam Lefflerand a pointer to the memory location where the identity of the 93cf82599dSSam Lefflerthread that services the queue is recorded. 9482323455SDoug Rabson.\" XXX The rest of the sentence gets lots in relation to the first part. 95cf82599dSSam LefflerThe function called from 96cf82599dSSam Leffler.Fn taskqueue_enqueue 97cf82599dSSam Lefflermust arrange for the queue to be processed 9882323455SDoug Rabson(for instance by scheduling a software interrupt or waking a kernel 9982323455SDoug Rabsonthread). 100cf82599dSSam LefflerThe memory location where the thread identity is recorded is used 101cf82599dSSam Lefflerto signal the service thread(s) to terminate--when this value is set to 102cf82599dSSam Lefflerzero and the thread is signaled it will terminate. 10382323455SDoug Rabson.Pp 10482323455SDoug RabsonThe function 10582323455SDoug Rabson.Fn taskqueue_free 10682323455SDoug Rabsonshould be used to remove the queue from the global list of queues 10782323455SDoug Rabsonand free the memory used by the queue. 108cf82599dSSam LefflerAny tasks that are on the queue will be executed at this time after 109cf82599dSSam Lefflerwhich the thread servicing the queue will be signaled that it should exit. 11082323455SDoug Rabson.Pp 11182323455SDoug RabsonThe system maintains a list of all queues which can be searched using 11282323455SDoug Rabson.Fn taskqueue_find . 11382323455SDoug RabsonThe first queue whose name matches is returned, otherwise 11482323455SDoug Rabson.Dv NULL . 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 RabsonTo execute all the tasks on a queue, 14382323455SDoug Rabsoncall 1444c49b002SJoseph Koshy.Fn taskqueue_run 1454c49b002SJoseph Koshyor 1464c49b002SJoseph Koshy.Fn taskqueue_run_fast 1474c49b002SJoseph Koshydepending on the flavour of the queue. 14882323455SDoug RabsonWhen a task is executed, 14982323455SDoug Rabsonfirst it is removed from the queue, 15082323455SDoug Rabsonthe value of 15182323455SDoug Rabson.Va ta_pending 15282323455SDoug Rabsonis recorded and then the field is zeroed. 15382323455SDoug RabsonThe function 15482323455SDoug Rabson.Va ta_func 15582323455SDoug Rabsonfrom the task structure is called with the value of the field 15682323455SDoug Rabson.Va ta_context 15782323455SDoug Rabsonas its first argument 15882323455SDoug Rabsonand the value of 15982323455SDoug Rabson.Va ta_pending 16082323455SDoug Rabsonas its second argument. 16182323455SDoug Rabson.Pp 16282323455SDoug RabsonA convenience macro, 16382323455SDoug Rabson.Fn TASK_INIT "task" "priority" "func" "context" 16482323455SDoug Rabsonis provided to initialise a 16582323455SDoug Rabson.Va task 16682323455SDoug Rabsonstructure. 16782323455SDoug RabsonThe values of 16882323455SDoug Rabson.Va priority , 16982323455SDoug Rabson.Va func , 17082323455SDoug Rabsonand 17182323455SDoug Rabson.Va context 17282323455SDoug Rabsonare simply copied into the task structure fields and the 17382323455SDoug Rabson.Va ta_pending 17482323455SDoug Rabsonfield is cleared. 17582323455SDoug Rabson.Pp 176227559d1SJohn-Mark GurneyThree macros 177227559d1SJohn-Mark Gurney.Fn TASKQUEUE_DECLARE "name" , 178227559d1SJohn-Mark Gurney.Fn TASKQUEUE_DEFINE "name" "enqueue" "context" "init" , 17982323455SDoug Rabsonand 180227559d1SJohn-Mark Gurney.Fn TASKQUEUE_DEFINE_THREAD "name" 181227559d1SJohn-Mark Gurneyare used to declare a reference to a global queue, to define the 182c0854fb7SRuslan Ermilovimplementation of the queue, and declare a queue that uses its own thread. 18382323455SDoug RabsonThe 18482323455SDoug Rabson.Fn TASKQUEUE_DEFINE 18582323455SDoug Rabsonmacro arranges to call 18682323455SDoug Rabson.Fn taskqueue_create 18782323455SDoug Rabsonwith the values of its 18882323455SDoug Rabson.Va name , 18982323455SDoug Rabson.Va enqueue 19082323455SDoug Rabsonand 19182323455SDoug Rabson.Va context 19282323455SDoug Rabsonarguments during system initialisation. 19382323455SDoug RabsonAfter calling 19482323455SDoug Rabson.Fn taskqueue_create , 19582323455SDoug Rabsonthe 19682323455SDoug Rabson.Va init 19782323455SDoug Rabsonargument to the macro is executed as a C statement, 19882323455SDoug Rabsonallowing any further initialisation to be performed 19982323455SDoug Rabson(such as registering an interrupt handler etc.) 20082323455SDoug Rabson.Pp 201227559d1SJohn-Mark GurneyThe 202227559d1SJohn-Mark Gurney.Fn TASKQUEUE_DEFINE_THREAD 203c0854fb7SRuslan Ermilovmacro defines a new taskqueue with its own kernel thread to serve tasks. 204c0854fb7SRuslan ErmilovThe variable 205227559d1SJohn-Mark Gurney.Vt struct proc *taskqueue_name_proc 206227559d1SJohn-Mark Gurneyis defined which contains the kernel thread serving the tasks. 207227559d1SJohn-Mark GurneyThe variable 208227559d1SJohn-Mark Gurney.Vt struct taskqueue *taskqueue_name 209227559d1SJohn-Mark Gurneyis used to enqueue tasks onto the queue. 2104c49b002SJoseph Koshy.Ss Predefined Task Queues 2114c49b002SJoseph KoshyThe system provides four global taskqueues, 2124c49b002SJoseph Koshy.Va taskqueue_fast , 21382323455SDoug Rabson.Va taskqueue_swi , 214cb32189eSKenneth D. Merry.Va taskqueue_swi_giant , 215cb32189eSKenneth D. Merryand 216cb32189eSKenneth D. Merry.Va taskqueue_thread . 2174c49b002SJoseph KoshyThe 2184c49b002SJoseph Koshy.Va taskqueue_fast 2194c49b002SJoseph Koshyqueue is for swi handlers dispatched from fast interrupt handlers, 2204c49b002SJoseph Koshywhere sleep mutexes cannot be used. 221cb32189eSKenneth D. MerryThe swi taskqueues are run via a software interrupt mechanism. 2224c49b002SJoseph KoshyThe 2234c49b002SJoseph Koshy.Va taskqueue_swi 2244c49b002SJoseph Koshyqueue runs without the protection of the 2254c49b002SJoseph Koshy.Va Giant 2264c49b002SJoseph Koshykernel lock, and the 2274c49b002SJoseph Koshy.Va taskqueue_swi_giant 2284c49b002SJoseph Koshyqueue runs with the protection of the 2294c49b002SJoseph Koshy.Va Giant 230cb32189eSKenneth D. Merrykernel lock. 2314c49b002SJoseph KoshyThe thread taskqueue 2324c49b002SJoseph Koshy.Va taskqueue_thread 2334c49b002SJoseph Koshyruns in a kernel thread context, and tasks run from this thread do 2344c49b002SJoseph Koshynot run under the 2354c49b002SJoseph Koshy.Va Giant 2364c49b002SJoseph Koshykernel lock. 2374c49b002SJoseph KoshyIf the caller wants to run under 2384c49b002SJoseph Koshy.Va Giant , 2394c49b002SJoseph Koshyhe should explicitly acquire and release 2404c49b002SJoseph Koshy.Va Giant 2414c49b002SJoseph Koshyin his taskqueue handler routine. 242bf7f20c2SRuslan Ermilov.Pp 243cb32189eSKenneth D. MerryTo use these queues, 24482323455SDoug Rabsoncall 24582323455SDoug Rabson.Fn taskqueue_enqueue 246cb32189eSKenneth D. Merrywith the value of the global taskqueue variable for the queue you wish to 247c0854fb7SRuslan Ermilovuse 248c0854fb7SRuslan Ermilov.Va ( taskqueue_swi , 249cb32189eSKenneth D. Merry.Va taskqueue_swi_giant , 250cb32189eSKenneth D. Merryor 251c0854fb7SRuslan Ermilov.Va taskqueue_thread ) . 2524c49b002SJoseph KoshyUse 2534c49b002SJoseph Koshy.Fn taskqueue_enqueue_fast 2544c49b002SJoseph Koshyfor the global taskqueue variable 2554c49b002SJoseph Koshy.Va taskqueue_fast . 25682323455SDoug Rabson.Pp 257e0254f10SKenneth D. MerryThe software interrupt queues can be used, 25882323455SDoug Rabsonfor instance, for implementing interrupt handlers which must perform a 25982323455SDoug Rabsonsignificant amount of processing in the handler. 26082323455SDoug RabsonThe hardware interrupt handler would perform minimal processing of the 26182323455SDoug Rabsoninterrupt and then enqueue a task to finish the work. 26282323455SDoug RabsonThis reduces to a minimum 26382323455SDoug Rabsonthe amount of time spent with interrupts disabled. 264cb32189eSKenneth D. Merry.Pp 265cb32189eSKenneth D. MerryThe thread queue can be used, for instance, by interrupt level routines 266cb32189eSKenneth D. Merrythat need to call kernel functions that do things that can only be done 267cb32189eSKenneth D. Merryfrom a thread context. 268cb32189eSKenneth D. Merry(e.g., call malloc with the M_WAITOK flag.) 269cf82599dSSam Leffler.Pp 270cf82599dSSam LefflerNote that tasks queued on shared taskqueues such as 271cf82599dSSam Leffler.Va taskqueue_swi 272cf82599dSSam Lefflermay be delayed an indeterminate amount of time before execution. 273cf82599dSSam LefflerIf queueing delays cannot be tolerated then a private taskqueue should 274cf82599dSSam Lefflerbe created with a dedicated processing thread. 2753bbf58f9SJoseph Koshy.Sh SEE ALSO 2763bbf58f9SJoseph Koshy.Xr ithread 9 , 2773bbf58f9SJoseph Koshy.Xr kthread 9 , 2783bbf58f9SJoseph Koshy.Xr swi 9 27982323455SDoug Rabson.Sh HISTORY 28082323455SDoug RabsonThis interface first appeared in 28182323455SDoug Rabson.Fx 5.0 . 28282323455SDoug RabsonThere is a similar facility called tqueue in the Linux kernel. 28382323455SDoug Rabson.Sh AUTHORS 28482323455SDoug RabsonThis man page was written by 28582323455SDoug Rabson.An Doug Rabson . 2864c49b002SJoseph Koshy.Sh BUGS 2874c49b002SJoseph KoshyThere is no 2884c49b002SJoseph Koshy.Fn taskqueue_create_fast . 289