blob: 637e23551225e36e49eda61acaca3e2f2fb46f88 [file] [log] [blame]
Willy Tarreaubaaee002006-06-26 02:48:02 +02001/*
2 * Task management functions.
3 *
Willy Tarreau4726f532009-03-07 17:25:21 +01004 * Copyright 2000-2009 Willy Tarreau <w@1wt.eu>
Willy Tarreaubaaee002006-06-26 02:48:02 +02005 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version
9 * 2 of the License, or (at your option) any later version.
10 *
11 */
12
Willy Tarreau87bed622009-03-08 22:25:28 +010013#include <string.h>
14
Willy Tarreau2dd0d472006-06-29 17:53:05 +020015#include <common/config.h>
Willy Tarreauc6ca1a02007-05-13 19:43:47 +020016#include <common/memory.h>
Willy Tarreau2dd0d472006-06-29 17:53:05 +020017#include <common/mini-clist.h>
Willy Tarreau96bcfd72007-04-29 10:41:56 +020018#include <common/standard.h>
Willy Tarreaua6a6a932007-04-28 22:40:08 +020019#include <common/time.h>
Willy Tarreau8d388052017-11-05 13:34:20 +010020#include <eb32sctree.h>
Willy Tarreau45cb4fb2009-10-26 21:10:04 +010021#include <eb32tree.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020022
Willy Tarreaud825eef2007-05-12 22:35:00 +020023#include <proto/proxy.h>
Willy Tarreau87b09662015-04-03 00:22:06 +020024#include <proto/stream.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020025#include <proto/task.h>
Olivier Houchard79321b92018-07-26 17:55:11 +020026#include <proto/fd.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020027
Willy Tarreau8ceae722018-11-26 11:58:30 +010028DECLARE_POOL(pool_head_task, "task", sizeof(struct task));
29DECLARE_POOL(pool_head_tasklet, "tasklet", sizeof(struct tasklet));
Willy Tarreau96bcfd72007-04-29 10:41:56 +020030
Thierry FOURNIERd6975962017-07-12 14:31:10 +020031/* This is the memory pool containing all the signal structs. These
Joseph Herlantcf92b6d2018-11-15 14:19:23 -080032 * struct are used to store each required signal between two tasks.
Thierry FOURNIERd6975962017-07-12 14:31:10 +020033 */
Willy Tarreau8ceae722018-11-26 11:58:30 +010034DECLARE_POOL(pool_head_notification, "notification", sizeof(struct notification));
Thierry FOURNIERd6975962017-07-12 14:31:10 +020035
Willy Tarreaua4613182009-03-21 18:13:21 +010036unsigned int nb_tasks = 0;
Olivier Houchard9b03c0c2018-07-26 18:45:22 +020037volatile unsigned long active_tasks_mask = 0; /* Mask of threads with active tasks */
Olivier Houchardeba0c0b2018-07-26 18:53:28 +020038volatile unsigned long global_tasks_mask = 0; /* Mask of threads with tasks in the global runqueue */
Christopher Faulet34c5cc92016-12-06 09:15:30 +010039unsigned int tasks_run_queue = 0;
40unsigned int tasks_run_queue_cur = 0; /* copy of the run queue size */
Willy Tarreauc7bdf092009-03-21 18:33:52 +010041unsigned int nb_tasks_cur = 0; /* copy of the tasks count */
Willy Tarreaue35c94a2009-03-21 10:01:42 +010042unsigned int niced_tasks = 0; /* number of niced tasks in the run queue */
Emeric Brun01948972017-03-30 15:37:25 +020043
Willy Tarreau6d1222c2017-11-26 10:08:06 +010044THREAD_LOCAL struct task *curr_task = NULL; /* task currently running or NULL */
Olivier Houchard9b36cb42018-05-04 15:46:16 +020045THREAD_LOCAL struct eb32sc_node *rq_next = NULL; /* Next task to be potentially run */
Willy Tarreau6d1222c2017-11-26 10:08:06 +010046
Willy Tarreau86abe442018-11-25 20:12:18 +010047__decl_aligned_spinlock(rq_lock); /* spin lock related to run queue */
48__decl_aligned_spinlock(wq_lock); /* spin lock related to wait queue */
Willy Tarreau964c9362007-01-07 00:38:00 +010049
Olivier Houchardb1ca58b2018-06-06 14:22:03 +020050#ifdef USE_THREAD
Willy Tarreaub20aa9e2018-10-15 14:52:21 +020051struct eb_root timers; /* sorted timers tree, global */
Olivier Houchardf6e6dc12018-05-18 18:38:23 +020052struct eb_root rqueue; /* tree constituting the run queue */
Olivier Houchard77551ee2018-07-26 15:59:38 +020053int global_rqueue_size; /* Number of element sin the global runqueue */
Olivier Houchardb1ca58b2018-06-06 14:22:03 +020054#endif
Willy Tarreaub20aa9e2018-10-15 14:52:21 +020055
Willy Tarreaue35c94a2009-03-21 10:01:42 +010056static unsigned int rqueue_ticks; /* insertion count */
Willy Tarreau8d8747a2018-10-15 16:12:48 +020057
58struct task_per_thread task_per_thread[MAX_THREADS];
Willy Tarreau9789f7b2008-06-24 08:17:16 +020059
Willy Tarreau4726f532009-03-07 17:25:21 +010060/* Puts the task <t> in run queue at a position depending on t->nice. <t> is
61 * returned. The nice value assigns boosts in 32th of the run queue size. A
Christopher Faulet34c5cc92016-12-06 09:15:30 +010062 * nice value of -1024 sets the task to -tasks_run_queue*32, while a nice value
63 * of 1024 sets the task to tasks_run_queue*32. The state flags are cleared, so
64 * the caller will have to set its flags after this call.
Willy Tarreau4726f532009-03-07 17:25:21 +010065 * The task must not already be in the run queue. If unsure, use the safer
66 * task_wakeup() function.
Willy Tarreau91e99932008-06-30 07:51:00 +020067 */
Olivier Houchardf6e6dc12018-05-18 18:38:23 +020068void __task_wakeup(struct task *t, struct eb_root *root)
Willy Tarreaue33aece2007-04-30 13:15:14 +020069{
Olivier Houchardf6e6dc12018-05-18 18:38:23 +020070 void *expected = NULL;
71 int *rq_size;
72
Olivier Houchardb1ca58b2018-06-06 14:22:03 +020073#ifdef USE_THREAD
Olivier Houchardf6e6dc12018-05-18 18:38:23 +020074 if (root == &rqueue) {
75 rq_size = &global_rqueue_size;
76 HA_SPIN_LOCK(TASK_RQ_LOCK, &rq_lock);
Olivier Houchardb1ca58b2018-06-06 14:22:03 +020077 } else
78#endif
79 {
Willy Tarreau8d8747a2018-10-15 16:12:48 +020080 int nb = ((void *)root - (void *)&task_per_thread[0].rqueue) / sizeof(task_per_thread[0]);
81 rq_size = &task_per_thread[nb].rqueue_size;
Olivier Houchardf6e6dc12018-05-18 18:38:23 +020082 }
83 /* Make sure if the task isn't in the runqueue, nobody inserts it
84 * in the meanwhile.
85 */
86redo:
Olivier Houchard4c2832852019-03-08 18:48:47 +010087 if (unlikely(!_HA_ATOMIC_CAS(&t->rq.node.leaf_p, &expected, (void *)0x1))) {
Olivier Houchardb1ca58b2018-06-06 14:22:03 +020088#ifdef USE_THREAD
Olivier Houchardf6e6dc12018-05-18 18:38:23 +020089 if (root == &rqueue)
90 HA_SPIN_UNLOCK(TASK_RQ_LOCK, &rq_lock);
Olivier Houchardb1ca58b2018-06-06 14:22:03 +020091#endif
Olivier Houchardf6e6dc12018-05-18 18:38:23 +020092 return;
93 }
94 /* There's a small race condition, when running a task, the thread
95 * first sets TASK_RUNNING, and then unlink the task.
96 * If an another thread calls task_wakeup() for the same task,
97 * it may set t->state before TASK_RUNNING was set, and then try
98 * to set t->rq.nod.leaf_p after it was unlinked.
99 * To make sure it is not a problem, we check if TASK_RUNNING is set
100 * again. If it is, we unset t->rq.node.leaf_p.
101 * We then check for TASK_RUNNING a third time. If it is still there,
102 * then we can give up, the task will be re-queued later if it needs
103 * to be. If it's not there, and there is still something in t->state,
104 * then we have to requeue.
105 */
106 if (((volatile unsigned short)(t->state)) & TASK_RUNNING) {
107 unsigned short state;
108 t->rq.node.leaf_p = NULL;
Willy Tarreau155acff2019-02-04 10:26:53 +0100109 __ha_barrier_full();
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200110
111 state = (volatile unsigned short)(t->state);
112 if (unlikely(state != 0 && !(state & TASK_RUNNING)))
113 goto redo;
Olivier Houchardb1ca58b2018-06-06 14:22:03 +0200114#ifdef USE_THREAD
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200115 if (root == &rqueue)
116 HA_SPIN_UNLOCK(TASK_RQ_LOCK, &rq_lock);
Olivier Houchardb1ca58b2018-06-06 14:22:03 +0200117#endif
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200118 return;
119 }
Olivier Houchard4c2832852019-03-08 18:48:47 +0100120 _HA_ATOMIC_ADD(&tasks_run_queue, 1);
Olivier Houchardc4aac9e2018-07-26 15:25:49 +0200121#ifdef USE_THREAD
122 if (root == &rqueue) {
Olivier Houchard4c2832852019-03-08 18:48:47 +0100123 _HA_ATOMIC_OR(&global_tasks_mask, t->thread_mask);
Olivier Houchardd2b5d162019-03-08 13:47:21 +0100124 __ha_barrier_atomic_store();
Olivier Houchardc4aac9e2018-07-26 15:25:49 +0200125 }
126#endif
Olivier Houchard4c2832852019-03-08 18:48:47 +0100127 _HA_ATOMIC_OR(&active_tasks_mask, t->thread_mask);
128 t->rq.key = _HA_ATOMIC_ADD(&rqueue_ticks, 1);
Willy Tarreau91e99932008-06-30 07:51:00 +0200129
130 if (likely(t->nice)) {
131 int offset;
132
Olivier Houchard4c2832852019-03-08 18:48:47 +0100133 _HA_ATOMIC_ADD(&niced_tasks, 1);
Willy Tarreau91e99932008-06-30 07:51:00 +0200134 if (likely(t->nice > 0))
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200135 offset = (unsigned)((*rq_size * (unsigned int)t->nice) / 32U);
Willy Tarreau91e99932008-06-30 07:51:00 +0200136 else
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200137 offset = -(unsigned)((*rq_size * (unsigned int)-t->nice) / 32U);
Willy Tarreau4726f532009-03-07 17:25:21 +0100138 t->rq.key += offset;
Willy Tarreau91e99932008-06-30 07:51:00 +0200139 }
140
Willy Tarreau9efd7452018-05-31 14:48:54 +0200141 if (profiling & HA_PROF_TASKS)
142 t->call_date = now_mono_time();
143
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200144 eb32sc_insert(root, &t->rq, t->thread_mask);
Olivier Houchardb1ca58b2018-06-06 14:22:03 +0200145#ifdef USE_THREAD
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200146 if (root == &rqueue) {
147 global_rqueue_size++;
Olivier Houchard4c2832852019-03-08 18:48:47 +0100148 _HA_ATOMIC_OR(&t->state, TASK_GLOBAL);
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200149 HA_SPIN_UNLOCK(TASK_RQ_LOCK, &rq_lock);
Olivier Houchardb1ca58b2018-06-06 14:22:03 +0200150 } else
151#endif
152 {
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200153 int nb = ((void *)root - (void *)&task_per_thread[0].rqueue) / sizeof(task_per_thread[0]);
154 task_per_thread[nb].rqueue_size++;
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200155 }
Willy Tarreau85d9b842018-07-27 17:14:41 +0200156#ifdef USE_THREAD
Olivier Houchard79321b92018-07-26 17:55:11 +0200157 /* If all threads that are supposed to handle this task are sleeping,
158 * wake one.
159 */
160 if ((((t->thread_mask & all_threads_mask) & sleeping_thread_mask) ==
Olivier Houchard1b327902019-03-15 00:23:10 +0100161 (t->thread_mask & all_threads_mask))) {
162 unsigned long m = (t->thread_mask & all_threads_mask) &~ tid_bit;
163
164 m = (m & (m - 1)) ^ m; // keep lowest bit set
165 _HA_ATOMIC_AND(&sleeping_thread_mask, ~m);
166 wake_thread(my_ffsl(m) - 1);
167 }
Willy Tarreau85d9b842018-07-27 17:14:41 +0200168#endif
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200169 return;
Willy Tarreaue33aece2007-04-30 13:15:14 +0200170}
Willy Tarreaud825eef2007-05-12 22:35:00 +0200171
Willy Tarreau96bcfd72007-04-29 10:41:56 +0200172/*
Willy Tarreau531cf0c2009-03-08 16:35:27 +0100173 * __task_queue()
Willy Tarreau96bcfd72007-04-29 10:41:56 +0200174 *
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200175 * Inserts a task into wait queue <wq> at the position given by its expiration
Willy Tarreau4726f532009-03-07 17:25:21 +0100176 * date. It does not matter if the task was already in the wait queue or not,
Willy Tarreau531cf0c2009-03-08 16:35:27 +0100177 * as it will be unlinked. The task must not have an infinite expiration timer.
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100178 * Last, tasks must not be queued further than the end of the tree, which is
179 * between <now_ms> and <now_ms> + 2^31 ms (now+24days in 32bit).
Willy Tarreau531cf0c2009-03-08 16:35:27 +0100180 *
181 * This function should not be used directly, it is meant to be called by the
182 * inline version of task_queue() which performs a few cheap preliminary tests
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200183 * before deciding to call __task_queue(). Moreover this function doesn't care
184 * at all about locking so the caller must be careful when deciding whether to
185 * lock or not around this call.
Willy Tarreau96bcfd72007-04-29 10:41:56 +0200186 */
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200187void __task_queue(struct task *task, struct eb_root *wq)
Willy Tarreau964c9362007-01-07 00:38:00 +0100188{
Willy Tarreau531cf0c2009-03-08 16:35:27 +0100189 if (likely(task_in_wq(task)))
Willy Tarreau4726f532009-03-07 17:25:21 +0100190 __task_unlink_wq(task);
Willy Tarreau4726f532009-03-07 17:25:21 +0100191
192 /* the task is not in the queue now */
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100193 task->wq.key = task->expire;
Willy Tarreau28c41a42008-06-29 17:00:59 +0200194#ifdef DEBUG_CHECK_INVALID_EXPIRATION_DATES
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100195 if (tick_is_lt(task->wq.key, now_ms))
Willy Tarreau28c41a42008-06-29 17:00:59 +0200196 /* we're queuing too far away or in the past (most likely) */
Willy Tarreau4726f532009-03-07 17:25:21 +0100197 return;
Willy Tarreau28c41a42008-06-29 17:00:59 +0200198#endif
Willy Tarreauce44f122008-07-05 18:16:19 +0200199
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200200 eb32_insert(wq, &task->wq);
Willy Tarreau964c9362007-01-07 00:38:00 +0100201}
202
Willy Tarreau96bcfd72007-04-29 10:41:56 +0200203/*
Willy Tarreau9789f7b2008-06-24 08:17:16 +0200204 * Extract all expired timers from the timer queue, and wakes up all
Thierry FOURNIER9cf7c4b2014-12-15 13:26:01 +0100205 * associated tasks. Returns the date of next event (or eternity).
Willy Tarreau96bcfd72007-04-29 10:41:56 +0200206 */
Thierry FOURNIER9cf7c4b2014-12-15 13:26:01 +0100207int wake_expired_tasks()
Willy Tarreaubaaee002006-06-26 02:48:02 +0200208{
Willy Tarreau96bcfd72007-04-29 10:41:56 +0200209 struct task *task;
Willy Tarreau9789f7b2008-06-24 08:17:16 +0200210 struct eb32_node *eb;
Willy Tarreaub992ba12017-11-05 19:09:27 +0100211 int ret = TICK_ETERNITY;
Willy Tarreaubaaee002006-06-26 02:48:02 +0200212
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100213 while (1) {
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200214 lookup_next_local:
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200215 eb = eb32_lookup_ge(&task_per_thread[tid].timers, now_ms - TIMER_LOOK_BACK);
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200216 if (!eb) {
217 /* we might have reached the end of the tree, typically because
218 * <now_ms> is in the first half and we're first scanning the last
219 * half. Let's loop back to the beginning of the tree now.
220 */
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200221 eb = eb32_first(&task_per_thread[tid].timers);
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200222 if (likely(!eb))
223 break;
224 }
225
226 if (tick_is_lt(now_ms, eb->key)) {
227 /* timer not expired yet, revisit it later */
228 ret = eb->key;
229 break;
230 }
231
232 /* timer looks expired, detach it from the queue */
233 task = eb32_entry(eb, struct task, wq);
234 __task_unlink_wq(task);
235
236 /* It is possible that this task was left at an earlier place in the
237 * tree because a recent call to task_queue() has not moved it. This
238 * happens when the new expiration date is later than the old one.
239 * Since it is very unlikely that we reach a timeout anyway, it's a
240 * lot cheaper to proceed like this because we almost never update
241 * the tree. We may also find disabled expiration dates there. Since
242 * we have detached the task from the tree, we simply call task_queue
243 * to take care of this. Note that we might occasionally requeue it at
244 * the same place, before <eb>, so we have to check if this happens,
245 * and adjust <eb>, otherwise we may skip it which is not what we want.
246 * We may also not requeue the task (and not point eb at it) if its
247 * expiration time is not set.
248 */
249 if (!tick_is_expired(task->expire, now_ms)) {
250 if (tick_isset(task->expire))
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200251 __task_queue(task, &task_per_thread[tid].timers);
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200252 goto lookup_next_local;
253 }
254 task_wakeup(task, TASK_WOKEN_TIMER);
255 }
256
257#ifdef USE_THREAD
258 while (1) {
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100259 HA_SPIN_LOCK(TASK_WQ_LOCK, &wq_lock);
Emeric Brunc60def82017-09-27 14:59:38 +0200260 lookup_next:
Emeric Brun01948972017-03-30 15:37:25 +0200261 eb = eb32_lookup_ge(&timers, now_ms - TIMER_LOOK_BACK);
Emeric Brunc60def82017-09-27 14:59:38 +0200262 if (!eb) {
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100263 /* we might have reached the end of the tree, typically because
264 * <now_ms> is in the first half and we're first scanning the last
265 * half. Let's loop back to the beginning of the tree now.
266 */
267 eb = eb32_first(&timers);
Willy Tarreaub992ba12017-11-05 19:09:27 +0100268 if (likely(!eb))
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100269 break;
270 }
Willy Tarreaubaaee002006-06-26 02:48:02 +0200271
Willy Tarreaub992ba12017-11-05 19:09:27 +0100272 if (tick_is_lt(now_ms, eb->key)) {
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100273 /* timer not expired yet, revisit it later */
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200274 ret = tick_first(ret, eb->key);
Willy Tarreaub992ba12017-11-05 19:09:27 +0100275 break;
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100276 }
Willy Tarreaubaaee002006-06-26 02:48:02 +0200277
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100278 /* timer looks expired, detach it from the queue */
279 task = eb32_entry(eb, struct task, wq);
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100280 __task_unlink_wq(task);
Willy Tarreau41365222009-03-08 07:46:27 +0100281
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100282 /* It is possible that this task was left at an earlier place in the
283 * tree because a recent call to task_queue() has not moved it. This
284 * happens when the new expiration date is later than the old one.
285 * Since it is very unlikely that we reach a timeout anyway, it's a
286 * lot cheaper to proceed like this because we almost never update
287 * the tree. We may also find disabled expiration dates there. Since
288 * we have detached the task from the tree, we simply call task_queue
Willy Tarreau814c9782009-07-14 23:48:55 +0200289 * to take care of this. Note that we might occasionally requeue it at
290 * the same place, before <eb>, so we have to check if this happens,
291 * and adjust <eb>, otherwise we may skip it which is not what we want.
Willy Tarreau34e98ea2009-08-09 09:09:54 +0200292 * We may also not requeue the task (and not point eb at it) if its
293 * expiration time is not set.
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100294 */
295 if (!tick_is_expired(task->expire, now_ms)) {
Willy Tarreaub992ba12017-11-05 19:09:27 +0100296 if (tick_isset(task->expire))
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200297 __task_queue(task, &timers);
Emeric Brunc60def82017-09-27 14:59:38 +0200298 goto lookup_next;
Willy Tarreaubaaee002006-06-26 02:48:02 +0200299 }
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100300 task_wakeup(task, TASK_WOKEN_TIMER);
Willy Tarreau51753452017-11-23 18:36:50 +0100301 HA_SPIN_UNLOCK(TASK_WQ_LOCK, &wq_lock);
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100302 }
Willy Tarreau9789f7b2008-06-24 08:17:16 +0200303
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100304 HA_SPIN_UNLOCK(TASK_WQ_LOCK, &wq_lock);
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200305#endif
Willy Tarreaub992ba12017-11-05 19:09:27 +0100306 return ret;
Willy Tarreaubaaee002006-06-26 02:48:02 +0200307}
308
Willy Tarreau58b458d2008-06-29 22:40:23 +0200309/* The run queue is chronologically sorted in a tree. An insertion counter is
310 * used to assign a position to each task. This counter may be combined with
311 * other variables (eg: nice value) to set the final position in the tree. The
312 * counter may wrap without a problem, of course. We then limit the number of
Christopher Faulet8a48f672017-11-14 10:38:36 +0100313 * tasks processed to 200 in any case, so that general latency remains low and
314 * so that task positions have a chance to be considered.
Willy Tarreau58b458d2008-06-29 22:40:23 +0200315 *
316 * The function adjusts <next> if a new event is closer.
Willy Tarreaubaaee002006-06-26 02:48:02 +0200317 */
Thierry FOURNIER9cf7c4b2014-12-15 13:26:01 +0100318void process_runnable_tasks()
Willy Tarreaubaaee002006-06-26 02:48:02 +0200319{
Willy Tarreau964c9362007-01-07 00:38:00 +0100320 struct task *t;
Emeric Brun01948972017-03-30 15:37:25 +0200321 int max_processed;
Christopher Faulet3911ee82017-11-14 10:26:53 +0100322
Christopher Faulet34c5cc92016-12-06 09:15:30 +0100323 tasks_run_queue_cur = tasks_run_queue; /* keep a copy for reporting */
Willy Tarreauc7bdf092009-03-21 18:33:52 +0100324 nb_tasks_cur = nb_tasks;
Olivier Houchard1599b802018-05-24 18:59:04 +0200325 max_processed = global.tune.runqueue_depth;
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200326
Willy Tarreau1ee55fd2018-12-14 15:49:45 +0100327 if (likely(global_tasks_mask & tid_bit)) {
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200328 HA_SPIN_LOCK(TASK_RQ_LOCK, &rq_lock);
Willy Tarreaud80cb4e2018-01-20 19:30:13 +0100329 if (!(active_tasks_mask & tid_bit)) {
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200330 HA_SPIN_UNLOCK(TASK_RQ_LOCK, &rq_lock);
Willy Tarreaud80cb4e2018-01-20 19:30:13 +0100331 activity[tid].empty_rq++;
Christopher Faulet8a48f672017-11-14 10:38:36 +0100332 return;
Willy Tarreaud80cb4e2018-01-20 19:30:13 +0100333 }
Christopher Faulet8a48f672017-11-14 10:38:36 +0100334
Olivier Houchardb1ca58b2018-06-06 14:22:03 +0200335#ifdef USE_THREAD
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200336 /* Get some elements from the global run queue and put it in the
337 * local run queue. To try to keep a bit of fairness, just get as
338 * much elements from the global list as to have a bigger local queue
339 * than the average.
340 */
Willy Tarreau0b25d5e2018-10-10 16:39:22 +0200341 rq_next = eb32sc_lookup_ge(&rqueue, rqueue_ticks - TIMER_LOOK_BACK, tid_bit);
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200342 while ((task_per_thread[tid].task_list_size + task_per_thread[tid].rqueue_size) * global.nbthread <= tasks_run_queue) {
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200343 if (unlikely(!rq_next)) {
344 /* either we just started or we reached the end
345 * of the tree, typically because <rqueue_ticks>
346 * is in the first half and we're first scanning
347 * the last half. Let's loop back to the beginning
348 * of the tree now.
Willy Tarreauf0c531a2017-11-05 16:35:59 +0100349 */
350 rq_next = eb32sc_first(&rqueue, tid_bit);
Olivier Houchardc4aac9e2018-07-26 15:25:49 +0200351 if (!rq_next) {
Olivier Houchard4c2832852019-03-08 18:48:47 +0100352 _HA_ATOMIC_AND(&global_tasks_mask, ~tid_bit);
Willy Tarreauf0c531a2017-11-05 16:35:59 +0100353 break;
Olivier Houchardc4aac9e2018-07-26 15:25:49 +0200354 }
Willy Tarreauf0c531a2017-11-05 16:35:59 +0100355 }
356
357 t = eb32sc_entry(rq_next, struct task, rq);
358 rq_next = eb32sc_next(rq_next, tid_bit);
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200359
360 /* detach the task from the queue */
Willy Tarreauf0c531a2017-11-05 16:35:59 +0100361 __task_unlink_rq(t);
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200362 __task_wakeup(t, &task_per_thread[tid].rqueue);
Willy Tarreauf0c531a2017-11-05 16:35:59 +0100363 }
Olivier Houchardb1ca58b2018-06-06 14:22:03 +0200364#endif
Willy Tarreauf0c531a2017-11-05 16:35:59 +0100365
Christopher Faulet8a48f672017-11-14 10:38:36 +0100366 HA_SPIN_UNLOCK(TASK_RQ_LOCK, &rq_lock);
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200367 } else {
368 if (!(active_tasks_mask & tid_bit)) {
369 activity[tid].empty_rq++;
370 return;
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200371 }
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200372 }
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200373 /* Get some tasks from the run queue, make sure we don't
374 * get too much in the task list, but put a bit more than
375 * the max that will be run, to give a bit more fairness
376 */
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200377 rq_next = eb32sc_lookup_ge(&task_per_thread[tid].rqueue, rqueue_ticks - TIMER_LOOK_BACK, tid_bit);
378 while (max_processed + (max_processed / 10) > task_per_thread[tid].task_list_size) {
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100379 /* Note: this loop is one of the fastest code path in
380 * the whole program. It should not be re-arranged
381 * without a good reason.
382 */
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200383 if (unlikely(!rq_next)) {
384 /* either we just started or we reached the end
385 * of the tree, typically because <rqueue_ticks>
386 * is in the first half and we're first scanning
387 * the last half. Let's loop back to the beginning
388 * of the tree now.
Emeric Brun01948972017-03-30 15:37:25 +0200389 */
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200390 rq_next = eb32sc_first(&task_per_thread[tid].rqueue, tid_bit);
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200391 if (!rq_next)
392 break;
Emeric Brun01948972017-03-30 15:37:25 +0200393 }
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200394 t = eb32sc_entry(rq_next, struct task, rq);
395 rq_next = eb32sc_next(rq_next, tid_bit);
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200396 /* Make sure nobody re-adds the task in the runqueue */
Olivier Houchard4c2832852019-03-08 18:48:47 +0100397 _HA_ATOMIC_OR(&t->state, TASK_RUNNING);
Willy Tarreau531cf0c2009-03-08 16:35:27 +0100398
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200399 /* detach the task from the queue */
400 __task_unlink_rq(t);
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200401 /* And add it to the local task list */
402 task_insert_into_tasklet_list(t);
403 }
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200404 if (!(global_tasks_mask & tid_bit) && task_per_thread[tid].rqueue_size == 0) {
Olivier Houchard4c2832852019-03-08 18:48:47 +0100405 _HA_ATOMIC_AND(&active_tasks_mask, ~tid_bit);
Olivier Houchardd2b5d162019-03-08 13:47:21 +0100406 __ha_barrier_atomic_load();
Olivier Houchardc4aac9e2018-07-26 15:25:49 +0200407 if (global_tasks_mask & tid_bit)
Olivier Houchard4c2832852019-03-08 18:48:47 +0100408 _HA_ATOMIC_OR(&active_tasks_mask, tid_bit);
Olivier Houchardc4aac9e2018-07-26 15:25:49 +0200409 }
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200410 while (max_processed > 0 && !LIST_ISEMPTY(&task_per_thread[tid].task_list)) {
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200411 struct task *t;
412 unsigned short state;
413 void *ctx;
414 struct task *(*process)(struct task *t, void *ctx, unsigned short state);
415
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200416 t = (struct task *)LIST_ELEM(task_per_thread[tid].task_list.n, struct tasklet *, list);
Olivier Houchard4c2832852019-03-08 18:48:47 +0100417 state = _HA_ATOMIC_XCHG(&t->state, TASK_RUNNING);
Olivier Houchardd2b5d162019-03-08 13:47:21 +0100418 __ha_barrier_atomic_store();
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200419 task_remove_from_task_list(t);
420
421 ctx = t->context;
422 process = t->process;
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200423 t->calls++;
Willy Tarreau9efd7452018-05-31 14:48:54 +0200424
425 if (unlikely(!TASK_IS_TASKLET(t) && t->call_date)) {
426 uint64_t now_ns = now_mono_time();
427
428 t->lat_time += now_ns - t->call_date;
429 t->call_date = now_ns;
430 }
431
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200432 curr_task = (struct task *)t;
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200433 if (likely(process == process_stream))
434 t = process_stream(t, ctx, state);
435 else {
436 if (t->process != NULL)
Olivier Houchard9db0fed2018-06-14 15:40:47 +0200437 t = process(TASK_IS_TASKLET(t) ? NULL : t, ctx, state);
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200438 else {
439 __task_free(t);
440 t = NULL;
441 }
442 }
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200443 curr_task = NULL;
444 /* If there is a pending state we have to wake up the task
Joseph Herlantcf92b6d2018-11-15 14:19:23 -0800445 * immediately, else we defer it into wait queue
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200446 */
447 if (t != NULL) {
Willy Tarreau9efd7452018-05-31 14:48:54 +0200448 if (unlikely(!TASK_IS_TASKLET(t) && t->call_date)) {
449 t->cpu_time += now_mono_time() - t->call_date;
450 t->call_date = 0;
451 }
452
Olivier Houchard4c2832852019-03-08 18:48:47 +0100453 state = _HA_ATOMIC_AND(&t->state, ~TASK_RUNNING);
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200454 if (state)
Olivier Houchardb1ca58b2018-06-06 14:22:03 +0200455#ifdef USE_THREAD
Olivier Houchard19bdf242018-08-17 13:36:08 +0200456 __task_wakeup(t, ((t->thread_mask & all_threads_mask) == tid_bit) ?
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200457 &task_per_thread[tid].rqueue : &rqueue);
Olivier Houchardb1ca58b2018-06-06 14:22:03 +0200458#else
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200459 __task_wakeup(t, &task_per_thread[tid].rqueue);
Olivier Houchardb1ca58b2018-06-06 14:22:03 +0200460#endif
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200461 else
Willy Tarreau9d4b56b2017-11-06 08:36:53 +0100462 task_queue(t);
Willy Tarreau58b458d2008-06-29 22:40:23 +0200463 }
Willy Tarreauce4e0aa2017-11-05 23:57:00 +0100464
Olivier Houchard736ea412018-05-28 14:54:49 +0200465 max_processed--;
Christopher Faulet3911ee82017-11-14 10:26:53 +0100466 if (max_processed <= 0) {
Olivier Houchard4c2832852019-03-08 18:48:47 +0100467 _HA_ATOMIC_OR(&active_tasks_mask, tid_bit);
Willy Tarreaud80cb4e2018-01-20 19:30:13 +0100468 activity[tid].long_rq++;
Christopher Faulet3911ee82017-11-14 10:26:53 +0100469 break;
470 }
471 }
Willy Tarreaubaaee002006-06-26 02:48:02 +0200472}
473
William Lallemand27f3fa52018-12-06 14:05:20 +0100474/*
475 * Delete every tasks before running the master polling loop
476 */
477void mworker_cleantasks()
478{
479 struct task *t;
480 int i;
William Lallemandb5823392018-12-06 15:14:37 +0100481 struct eb32_node *tmp_wq = NULL;
482 struct eb32sc_node *tmp_rq = NULL;
William Lallemand27f3fa52018-12-06 14:05:20 +0100483
484#ifdef USE_THREAD
485 /* cleanup the global run queue */
William Lallemandb5823392018-12-06 15:14:37 +0100486 tmp_rq = eb32sc_first(&rqueue, MAX_THREADS_MASK);
487 while (tmp_rq) {
488 t = eb32sc_entry(tmp_rq, struct task, rq);
489 tmp_rq = eb32sc_next(tmp_rq, MAX_THREADS_MASK);
William Lallemand27f3fa52018-12-06 14:05:20 +0100490 task_delete(t);
491 task_free(t);
492 }
493 /* cleanup the timers queue */
William Lallemandb5823392018-12-06 15:14:37 +0100494 tmp_wq = eb32_first(&timers);
495 while (tmp_wq) {
496 t = eb32_entry(tmp_wq, struct task, wq);
497 tmp_wq = eb32_next(tmp_wq);
William Lallemand27f3fa52018-12-06 14:05:20 +0100498 task_delete(t);
499 task_free(t);
500 }
501#endif
502 /* clean the per thread run queue */
503 for (i = 0; i < global.nbthread; i++) {
William Lallemandb5823392018-12-06 15:14:37 +0100504 tmp_rq = eb32sc_first(&task_per_thread[i].rqueue, MAX_THREADS_MASK);
505 while (tmp_rq) {
506 t = eb32sc_entry(tmp_rq, struct task, rq);
507 tmp_rq = eb32sc_next(tmp_rq, MAX_THREADS_MASK);
William Lallemand27f3fa52018-12-06 14:05:20 +0100508 task_delete(t);
509 task_free(t);
510 }
511 /* cleanup the per thread timers queue */
William Lallemandb5823392018-12-06 15:14:37 +0100512 tmp_wq = eb32_first(&task_per_thread[i].timers);
513 while (tmp_wq) {
514 t = eb32_entry(tmp_wq, struct task, wq);
515 tmp_wq = eb32_next(tmp_wq);
William Lallemand27f3fa52018-12-06 14:05:20 +0100516 task_delete(t);
517 task_free(t);
518 }
519 }
520}
521
Willy Tarreaub6b3df32018-11-26 16:31:20 +0100522/* perform minimal intializations */
523static void init_task()
Willy Tarreau4726f532009-03-07 17:25:21 +0100524{
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200525 int i;
526
Olivier Houchardb1ca58b2018-06-06 14:22:03 +0200527#ifdef USE_THREAD
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200528 memset(&timers, 0, sizeof(timers));
Willy Tarreau4726f532009-03-07 17:25:21 +0100529 memset(&rqueue, 0, sizeof(rqueue));
Olivier Houchardb1ca58b2018-06-06 14:22:03 +0200530#endif
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200531 memset(&task_per_thread, 0, sizeof(task_per_thread));
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200532 for (i = 0; i < MAX_THREADS; i++) {
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200533 LIST_INIT(&task_per_thread[i].task_list);
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200534 }
Willy Tarreau4726f532009-03-07 17:25:21 +0100535}
536
Willy Tarreaub6b3df32018-11-26 16:31:20 +0100537INITCALL0(STG_PREPARE, init_task);
538
Willy Tarreaubaaee002006-06-26 02:48:02 +0200539/*
540 * Local variables:
541 * c-indent-level: 8
542 * c-basic-offset: 8
543 * End:
544 */