blob: 5f7ae61e86bf86b24a2dce24da0a32b59c051dfc [file] [log] [blame]
Willy Tarreaubaaee002006-06-26 02:48:02 +02001/*
Willy Tarreau24f4efa2010-08-27 17:56:48 +02002 * include/types/task.h
3 * Macros, variables and structures for task management.
4 *
5 * Copyright (C) 2000-2010 Willy Tarreau - w@1wt.eu
6 *
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation, version 2.1
10 * exclusively.
11 *
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with this library; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 */
Willy Tarreaubaaee002006-06-26 02:48:02 +020021
22#ifndef _TYPES_TASK_H
23#define _TYPES_TASK_H
24
Willy Tarreaubaaee002006-06-26 02:48:02 +020025#include <sys/time.h>
26
Willy Tarreaue3ba5f02006-06-29 18:54:54 +020027#include <common/config.h>
Willy Tarreau96bcfd72007-04-29 10:41:56 +020028#include <common/mini-clist.h>
Willy Tarreau8d388052017-11-05 13:34:20 +010029#include <eb32sctree.h>
Willy Tarreau45cb4fb2009-10-26 21:10:04 +010030#include <eb32tree.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020031
32/* values for task->state */
Willy Tarreauf0cea1e2018-07-26 16:13:00 +020033#define TASK_SLEEPING 0x0000 /* task sleeping */
34#define TASK_RUNNING 0x0001 /* the task is currently running */
Olivier Houchard76e45182018-07-26 16:19:58 +020035#define TASK_GLOBAL 0x0002 /* The task is currently in the global runqueue */
Willy Tarreau13afcb72019-01-27 17:41:27 +010036#define TASK_QUEUED 0x0004 /* The task has been (re-)added to the run queue */
Willy Tarreaudd0e89a2019-12-19 07:39:06 +010037#define TASK_SHARED_WQ 0x0008 /* The task's expiration may be updated by other
38 * threads, must be set before first queue/wakeup */
Willy Tarreauf0cea1e2018-07-26 16:13:00 +020039
40#define TASK_WOKEN_INIT 0x0100 /* woken up for initialisation purposes */
41#define TASK_WOKEN_TIMER 0x0200 /* woken up because of expired timer */
42#define TASK_WOKEN_IO 0x0400 /* woken up because of completed I/O */
43#define TASK_WOKEN_SIGNAL 0x0800 /* woken up by a system signal */
44#define TASK_WOKEN_MSG 0x1000 /* woken up by another task's message */
45#define TASK_WOKEN_RES 0x2000 /* woken up because of available resource */
46#define TASK_WOKEN_OTHER 0x4000 /* woken up for an unspecified reason */
Willy Tarreaufdccded2008-08-29 18:19:04 +020047
48/* use this to check a task state or to clean it up before queueing */
49#define TASK_WOKEN_ANY (TASK_WOKEN_OTHER|TASK_WOKEN_INIT|TASK_WOKEN_TIMER| \
50 TASK_WOKEN_IO|TASK_WOKEN_SIGNAL|TASK_WOKEN_MSG| \
51 TASK_WOKEN_RES)
Willy Tarreaubaaee002006-06-26 02:48:02 +020052
Willy Tarreaua62917b2020-01-30 18:37:28 +010053enum {
54 TL_URGENT = 0, /* urgent tasklets (I/O callbacks) */
55 TL_NORMAL = 1, /* normal tasks */
56 TL_BULK = 2, /* bulk task/tasklets, streaming I/Os */
57 TL_CLASSES /* must be last */
58};
59
Thierry FOURNIERd6975962017-07-12 14:31:10 +020060struct notification {
61 struct list purge_me; /* Part of the list of signals to be purged in the
62 case of the LUA execution stack crash. */
63 struct list wake_me; /* Part of list of signals to be targeted if an
64 event occurs. */
65 struct task *task; /* The task to be wake if an event occurs. */
Christopher Faulet9dcf9b62017-11-13 10:34:01 +010066 __decl_hathreads(HA_SPINLOCK_T lock);
Thierry FOURNIERd6975962017-07-12 14:31:10 +020067};
68
Willy Tarreau9634e862019-04-30 14:36:47 +020069/* force to split per-thread stuff into separate cache lines */
70struct task_per_thread {
71 struct eb_root timers; /* tree constituting the per-thread wait queue */
72 struct eb_root rqueue; /* tree constituting the per-thread run queue */
Olivier Houchard06910462019-10-11 16:35:01 +020073 struct mt_list shared_tasklet_list; /* Tasklet to be run, woken up by other threads */
Willy Tarreaua62917b2020-01-30 18:37:28 +010074 struct list tasklets[TL_CLASSES]; /* tasklets (and/or tasks) to run, by class */
75 int task_list_size; /* Number of tasks among the tasklets */
Willy Tarreau9634e862019-04-30 14:36:47 +020076 int rqueue_size; /* Number of elements in the per-thread run queue */
Willy Tarreaud022e9c2019-09-24 08:25:15 +020077 struct task *current; /* current task (not tasklet) */
Willy Tarreau9634e862019-04-30 14:36:47 +020078 __attribute__((aligned(64))) char end[0];
79};
80
Olivier Houchardb0bdae72018-05-18 18:45:28 +020081/* This part is common between struct task and struct tasklet so that tasks
82 * can be used as-is as tasklets.
83 */
84#define TASK_COMMON \
85 struct { \
86 unsigned short state; /* task state : bitfield of TASK_ */ \
87 short nice; /* task prio from -1024 to +1024, or -32768 for tasklets */ \
88 unsigned int calls; /* number of times process was called */ \
89 struct task *(*process)(struct task *t, void *ctx, unsigned short state); /* the function which processes the task */ \
90 void *context; /* the task's context */ \
91 }
92
Willy Tarreaubaaee002006-06-26 02:48:02 +020093/* The base for all tasks */
94struct task {
Olivier Houchardb0bdae72018-05-18 18:45:28 +020095 TASK_COMMON; /* must be at the beginning! */
Willy Tarreau8d388052017-11-05 13:34:20 +010096 struct eb32sc_node rq; /* ebtree node used to hold the task in the run queue */
Willy Tarreau05efc0f2013-12-07 01:01:39 +010097 struct eb32_node wq; /* ebtree node used to hold the task in the wait queue */
98 int expire; /* next expiration date for this task, in ticks */
Willy Tarreauf65610a2017-10-31 16:06:06 +010099 unsigned long thread_mask; /* mask of thread IDs authorized to process the task */
Willy Tarreau9efd7452018-05-31 14:48:54 +0200100 uint64_t call_date; /* date of the last task wakeup or call */
101 uint64_t lat_time; /* total latency time experienced */
Willy Tarreau247a8b12019-08-08 10:09:08 +0200102 uint64_t cpu_time; /* total CPU time consumed */
Willy Tarreaubaaee002006-06-26 02:48:02 +0200103};
104
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200105/* lightweight tasks, without priority, mainly used for I/Os */
106struct tasklet {
107 TASK_COMMON; /* must be at the beginning! */
Olivier Houchard06910462019-10-11 16:35:01 +0200108 struct list list;
Willy Tarreau8cdc1672019-10-18 06:43:53 +0200109 int tid; /* TID of the tasklet owner, <0 if local */
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200110};
111
112#define TASK_IS_TASKLET(t) ((t)->nice == -32768)
113
Willy Tarreau26c25062009-03-08 09:38:41 +0100114/*
115 * The task callback (->process) is responsible for updating ->expire. It must
116 * return a pointer to the task itself, except if the task has been deleted, in
117 * which case it returns NULL so that the scheduler knows it must not check the
118 * expire timer. The scheduler will requeue the task at the proper location.
119 */
120
Willy Tarreau64e60122019-07-12 08:31:17 +0200121
122/* A work_list is a thread-safe way to enqueue some work to be run on another
123 * thread. It consists of a list, a task and a general-purpose argument.
124 * A work is appended to the list by atomically adding a list element to the
125 * list and waking up the associated task, which is done using work_add(). The
126 * caller must be careful about how operations are run as it will definitely
127 * happen that the element being enqueued is processed by the other thread
128 * before the call returns. Some locking conventions between the caller and the
129 * callee might sometimes be necessary. The task is always woken up with reason
130 * TASK_WOKEN_OTHER and a context pointing to the work_list entry.
131 */
132struct work_list {
Olivier Houchard859dc802019-08-08 15:47:21 +0200133 struct mt_list head;
Willy Tarreau64e60122019-07-12 08:31:17 +0200134 struct task *task;
135 void *arg;
136};
137
Willy Tarreaubaaee002006-06-26 02:48:02 +0200138#endif /* _TYPES_TASK_H */
139
140/*
141 * Local variables:
142 * c-indent-level: 8
143 * c-basic-offset: 8
144 * End:
145 */