blob: afdd2b85e48c703471eea3d9c4d9963c876fc465 [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 Tarreau0212fad2019-04-24 08:10:57 +020023#include <proto/fd.h>
24#include <proto/freq_ctr.h>
Willy Tarreaud825eef2007-05-12 22:35:00 +020025#include <proto/proxy.h>
Willy Tarreau87b09662015-04-03 00:22:06 +020026#include <proto/stream.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020027#include <proto/task.h>
28
Willy Tarreau8ceae722018-11-26 11:58:30 +010029DECLARE_POOL(pool_head_task, "task", sizeof(struct task));
30DECLARE_POOL(pool_head_tasklet, "tasklet", sizeof(struct tasklet));
Willy Tarreau96bcfd72007-04-29 10:41:56 +020031
Thierry FOURNIERd6975962017-07-12 14:31:10 +020032/* This is the memory pool containing all the signal structs. These
Joseph Herlantcf92b6d2018-11-15 14:19:23 -080033 * struct are used to store each required signal between two tasks.
Thierry FOURNIERd6975962017-07-12 14:31:10 +020034 */
Willy Tarreau8ceae722018-11-26 11:58:30 +010035DECLARE_POOL(pool_head_notification, "notification", sizeof(struct notification));
Thierry FOURNIERd6975962017-07-12 14:31:10 +020036
Willy Tarreaua4613182009-03-21 18:13:21 +010037unsigned int nb_tasks = 0;
Olivier Houchard9b03c0c2018-07-26 18:45:22 +020038volatile unsigned long active_tasks_mask = 0; /* Mask of threads with active tasks */
Olivier Houchardeba0c0b2018-07-26 18:53:28 +020039volatile unsigned long global_tasks_mask = 0; /* Mask of threads with tasks in the global runqueue */
Christopher Faulet34c5cc92016-12-06 09:15:30 +010040unsigned int tasks_run_queue = 0;
41unsigned int tasks_run_queue_cur = 0; /* copy of the run queue size */
Willy Tarreauc7bdf092009-03-21 18:33:52 +010042unsigned int nb_tasks_cur = 0; /* copy of the tasks count */
Willy Tarreaue35c94a2009-03-21 10:01:42 +010043unsigned int niced_tasks = 0; /* number of niced tasks in the run queue */
Emeric Brun01948972017-03-30 15:37:25 +020044
Willy Tarreau6d1222c2017-11-26 10:08:06 +010045THREAD_LOCAL struct task *curr_task = NULL; /* task currently running or NULL */
46
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 Houchardb1ca58b2018-06-06 14:22:03 +020070#ifdef USE_THREAD
Olivier Houchardf6e6dc12018-05-18 18:38:23 +020071 if (root == &rqueue) {
Olivier Houchardf6e6dc12018-05-18 18:38:23 +020072 HA_SPIN_LOCK(TASK_RQ_LOCK, &rq_lock);
Olivier Houchardf6e6dc12018-05-18 18:38:23 +020073 }
Willy Tarreau2d1fd0a2019-04-15 09:18:31 +020074#endif
Olivier Houchardf6e6dc12018-05-18 18:38:23 +020075 /* Make sure if the task isn't in the runqueue, nobody inserts it
76 * in the meanwhile.
77 */
Olivier Houchard4c2832852019-03-08 18:48:47 +010078 _HA_ATOMIC_ADD(&tasks_run_queue, 1);
Olivier Houchardc4aac9e2018-07-26 15:25:49 +020079#ifdef USE_THREAD
80 if (root == &rqueue) {
Olivier Houchardde82aea2019-04-17 19:10:22 +020081 global_tasks_mask |= t->thread_mask;
Olivier Houcharded1a6a02019-04-18 14:12:51 +020082 __ha_barrier_store();
Olivier Houchardc4aac9e2018-07-26 15:25:49 +020083 }
84#endif
Olivier Houchard4c2832852019-03-08 18:48:47 +010085 _HA_ATOMIC_OR(&active_tasks_mask, t->thread_mask);
86 t->rq.key = _HA_ATOMIC_ADD(&rqueue_ticks, 1);
Willy Tarreau91e99932008-06-30 07:51:00 +020087
88 if (likely(t->nice)) {
89 int offset;
90
Olivier Houchard4c2832852019-03-08 18:48:47 +010091 _HA_ATOMIC_ADD(&niced_tasks, 1);
Willy Tarreau2d1fd0a2019-04-15 09:18:31 +020092 offset = t->nice * (int)global.tune.runqueue_depth;
Willy Tarreau4726f532009-03-07 17:25:21 +010093 t->rq.key += offset;
Willy Tarreau91e99932008-06-30 07:51:00 +020094 }
95
Willy Tarreaud9add3a2019-04-25 08:57:41 +020096 if (task_profiling_mask & tid_bit)
Willy Tarreau9efd7452018-05-31 14:48:54 +020097 t->call_date = now_mono_time();
98
Olivier Houchardf6e6dc12018-05-18 18:38:23 +020099 eb32sc_insert(root, &t->rq, t->thread_mask);
Olivier Houchardb1ca58b2018-06-06 14:22:03 +0200100#ifdef USE_THREAD
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200101 if (root == &rqueue) {
102 global_rqueue_size++;
Olivier Houchard4c2832852019-03-08 18:48:47 +0100103 _HA_ATOMIC_OR(&t->state, TASK_GLOBAL);
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200104 HA_SPIN_UNLOCK(TASK_RQ_LOCK, &rq_lock);
Olivier Houchardb1ca58b2018-06-06 14:22:03 +0200105 } else
106#endif
107 {
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200108 int nb = ((void *)root - (void *)&task_per_thread[0].rqueue) / sizeof(task_per_thread[0]);
109 task_per_thread[nb].rqueue_size++;
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200110 }
Willy Tarreau85d9b842018-07-27 17:14:41 +0200111#ifdef USE_THREAD
Olivier Houchard79321b92018-07-26 17:55:11 +0200112 /* If all threads that are supposed to handle this task are sleeping,
113 * wake one.
114 */
115 if ((((t->thread_mask & all_threads_mask) & sleeping_thread_mask) ==
Olivier Houchard1b327902019-03-15 00:23:10 +0100116 (t->thread_mask & all_threads_mask))) {
117 unsigned long m = (t->thread_mask & all_threads_mask) &~ tid_bit;
118
119 m = (m & (m - 1)) ^ m; // keep lowest bit set
120 _HA_ATOMIC_AND(&sleeping_thread_mask, ~m);
121 wake_thread(my_ffsl(m) - 1);
122 }
Willy Tarreau85d9b842018-07-27 17:14:41 +0200123#endif
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200124 return;
Willy Tarreaue33aece2007-04-30 13:15:14 +0200125}
Willy Tarreaud825eef2007-05-12 22:35:00 +0200126
Willy Tarreau96bcfd72007-04-29 10:41:56 +0200127/*
Willy Tarreau531cf0c2009-03-08 16:35:27 +0100128 * __task_queue()
Willy Tarreau96bcfd72007-04-29 10:41:56 +0200129 *
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200130 * Inserts a task into wait queue <wq> at the position given by its expiration
Willy Tarreau4726f532009-03-07 17:25:21 +0100131 * date. It does not matter if the task was already in the wait queue or not,
Willy Tarreau531cf0c2009-03-08 16:35:27 +0100132 * as it will be unlinked. The task must not have an infinite expiration timer.
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100133 * Last, tasks must not be queued further than the end of the tree, which is
134 * between <now_ms> and <now_ms> + 2^31 ms (now+24days in 32bit).
Willy Tarreau531cf0c2009-03-08 16:35:27 +0100135 *
136 * This function should not be used directly, it is meant to be called by the
137 * inline version of task_queue() which performs a few cheap preliminary tests
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200138 * before deciding to call __task_queue(). Moreover this function doesn't care
139 * at all about locking so the caller must be careful when deciding whether to
140 * lock or not around this call.
Willy Tarreau96bcfd72007-04-29 10:41:56 +0200141 */
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200142void __task_queue(struct task *task, struct eb_root *wq)
Willy Tarreau964c9362007-01-07 00:38:00 +0100143{
Willy Tarreau531cf0c2009-03-08 16:35:27 +0100144 if (likely(task_in_wq(task)))
Willy Tarreau4726f532009-03-07 17:25:21 +0100145 __task_unlink_wq(task);
Willy Tarreau4726f532009-03-07 17:25:21 +0100146
147 /* the task is not in the queue now */
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100148 task->wq.key = task->expire;
Willy Tarreau28c41a42008-06-29 17:00:59 +0200149#ifdef DEBUG_CHECK_INVALID_EXPIRATION_DATES
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100150 if (tick_is_lt(task->wq.key, now_ms))
Willy Tarreau28c41a42008-06-29 17:00:59 +0200151 /* we're queuing too far away or in the past (most likely) */
Willy Tarreau4726f532009-03-07 17:25:21 +0100152 return;
Willy Tarreau28c41a42008-06-29 17:00:59 +0200153#endif
Willy Tarreauce44f122008-07-05 18:16:19 +0200154
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200155 eb32_insert(wq, &task->wq);
Willy Tarreau964c9362007-01-07 00:38:00 +0100156}
157
Willy Tarreau96bcfd72007-04-29 10:41:56 +0200158/*
Willy Tarreau9789f7b2008-06-24 08:17:16 +0200159 * Extract all expired timers from the timer queue, and wakes up all
Thierry FOURNIER9cf7c4b2014-12-15 13:26:01 +0100160 * associated tasks. Returns the date of next event (or eternity).
Willy Tarreau96bcfd72007-04-29 10:41:56 +0200161 */
Thierry FOURNIER9cf7c4b2014-12-15 13:26:01 +0100162int wake_expired_tasks()
Willy Tarreaubaaee002006-06-26 02:48:02 +0200163{
Willy Tarreau96bcfd72007-04-29 10:41:56 +0200164 struct task *task;
Willy Tarreau9789f7b2008-06-24 08:17:16 +0200165 struct eb32_node *eb;
Willy Tarreaub992ba12017-11-05 19:09:27 +0100166 int ret = TICK_ETERNITY;
Willy Tarreaubaaee002006-06-26 02:48:02 +0200167
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100168 while (1) {
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200169 lookup_next_local:
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200170 eb = eb32_lookup_ge(&task_per_thread[tid].timers, now_ms - TIMER_LOOK_BACK);
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200171 if (!eb) {
172 /* we might have reached the end of the tree, typically because
173 * <now_ms> is in the first half and we're first scanning the last
174 * half. Let's loop back to the beginning of the tree now.
175 */
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200176 eb = eb32_first(&task_per_thread[tid].timers);
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200177 if (likely(!eb))
178 break;
179 }
180
181 if (tick_is_lt(now_ms, eb->key)) {
182 /* timer not expired yet, revisit it later */
183 ret = eb->key;
184 break;
185 }
186
187 /* timer looks expired, detach it from the queue */
188 task = eb32_entry(eb, struct task, wq);
189 __task_unlink_wq(task);
190
191 /* It is possible that this task was left at an earlier place in the
192 * tree because a recent call to task_queue() has not moved it. This
193 * happens when the new expiration date is later than the old one.
194 * Since it is very unlikely that we reach a timeout anyway, it's a
195 * lot cheaper to proceed like this because we almost never update
196 * the tree. We may also find disabled expiration dates there. Since
197 * we have detached the task from the tree, we simply call task_queue
198 * to take care of this. Note that we might occasionally requeue it at
199 * the same place, before <eb>, so we have to check if this happens,
200 * and adjust <eb>, otherwise we may skip it which is not what we want.
201 * We may also not requeue the task (and not point eb at it) if its
202 * expiration time is not set.
203 */
204 if (!tick_is_expired(task->expire, now_ms)) {
205 if (tick_isset(task->expire))
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200206 __task_queue(task, &task_per_thread[tid].timers);
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200207 goto lookup_next_local;
208 }
209 task_wakeup(task, TASK_WOKEN_TIMER);
210 }
211
212#ifdef USE_THREAD
213 while (1) {
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100214 HA_SPIN_LOCK(TASK_WQ_LOCK, &wq_lock);
Emeric Brunc60def82017-09-27 14:59:38 +0200215 lookup_next:
Emeric Brun01948972017-03-30 15:37:25 +0200216 eb = eb32_lookup_ge(&timers, now_ms - TIMER_LOOK_BACK);
Emeric Brunc60def82017-09-27 14:59:38 +0200217 if (!eb) {
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100218 /* we might have reached the end of the tree, typically because
219 * <now_ms> is in the first half and we're first scanning the last
220 * half. Let's loop back to the beginning of the tree now.
221 */
222 eb = eb32_first(&timers);
Willy Tarreaub992ba12017-11-05 19:09:27 +0100223 if (likely(!eb))
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100224 break;
225 }
Willy Tarreaubaaee002006-06-26 02:48:02 +0200226
Willy Tarreaub992ba12017-11-05 19:09:27 +0100227 if (tick_is_lt(now_ms, eb->key)) {
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100228 /* timer not expired yet, revisit it later */
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200229 ret = tick_first(ret, eb->key);
Willy Tarreaub992ba12017-11-05 19:09:27 +0100230 break;
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100231 }
Willy Tarreaubaaee002006-06-26 02:48:02 +0200232
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100233 /* timer looks expired, detach it from the queue */
234 task = eb32_entry(eb, struct task, wq);
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100235 __task_unlink_wq(task);
Willy Tarreau41365222009-03-08 07:46:27 +0100236
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100237 /* It is possible that this task was left at an earlier place in the
238 * tree because a recent call to task_queue() has not moved it. This
239 * happens when the new expiration date is later than the old one.
240 * Since it is very unlikely that we reach a timeout anyway, it's a
241 * lot cheaper to proceed like this because we almost never update
242 * the tree. We may also find disabled expiration dates there. Since
243 * we have detached the task from the tree, we simply call task_queue
Willy Tarreau814c9782009-07-14 23:48:55 +0200244 * to take care of this. Note that we might occasionally requeue it at
245 * the same place, before <eb>, so we have to check if this happens,
246 * and adjust <eb>, otherwise we may skip it which is not what we want.
Willy Tarreau34e98ea2009-08-09 09:09:54 +0200247 * We may also not requeue the task (and not point eb at it) if its
248 * expiration time is not set.
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100249 */
250 if (!tick_is_expired(task->expire, now_ms)) {
Willy Tarreaub992ba12017-11-05 19:09:27 +0100251 if (tick_isset(task->expire))
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200252 __task_queue(task, &timers);
Emeric Brunc60def82017-09-27 14:59:38 +0200253 goto lookup_next;
Willy Tarreaubaaee002006-06-26 02:48:02 +0200254 }
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100255 task_wakeup(task, TASK_WOKEN_TIMER);
Willy Tarreau51753452017-11-23 18:36:50 +0100256 HA_SPIN_UNLOCK(TASK_WQ_LOCK, &wq_lock);
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100257 }
Willy Tarreau9789f7b2008-06-24 08:17:16 +0200258
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100259 HA_SPIN_UNLOCK(TASK_WQ_LOCK, &wq_lock);
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200260#endif
Willy Tarreaub992ba12017-11-05 19:09:27 +0100261 return ret;
Willy Tarreaubaaee002006-06-26 02:48:02 +0200262}
263
Willy Tarreau58b458d2008-06-29 22:40:23 +0200264/* The run queue is chronologically sorted in a tree. An insertion counter is
265 * used to assign a position to each task. This counter may be combined with
266 * other variables (eg: nice value) to set the final position in the tree. The
267 * counter may wrap without a problem, of course. We then limit the number of
Christopher Faulet8a48f672017-11-14 10:38:36 +0100268 * tasks processed to 200 in any case, so that general latency remains low and
Willy Tarreaucde79022019-04-12 18:03:41 +0200269 * so that task positions have a chance to be considered. The function scans
270 * both the global and local run queues and picks the most urgent task between
271 * the two. We need to grab the global runqueue lock to touch it so it's taken
272 * on the very first access to the global run queue and is released as soon as
273 * it reaches the end.
Willy Tarreau58b458d2008-06-29 22:40:23 +0200274 *
275 * The function adjusts <next> if a new event is closer.
Willy Tarreaubaaee002006-06-26 02:48:02 +0200276 */
Thierry FOURNIER9cf7c4b2014-12-15 13:26:01 +0100277void process_runnable_tasks()
Willy Tarreaubaaee002006-06-26 02:48:02 +0200278{
Willy Tarreaucde79022019-04-12 18:03:41 +0200279 struct eb32sc_node *lrq = NULL; // next local run queue entry
280 struct eb32sc_node *grq = NULL; // next global run queue entry
Willy Tarreau964c9362007-01-07 00:38:00 +0100281 struct task *t;
Emeric Brun01948972017-03-30 15:37:25 +0200282 int max_processed;
Christopher Faulet3911ee82017-11-14 10:26:53 +0100283
Willy Tarreaucde79022019-04-12 18:03:41 +0200284 if (!(active_tasks_mask & tid_bit)) {
285 activity[tid].empty_rq++;
286 return;
287 }
288
Christopher Faulet34c5cc92016-12-06 09:15:30 +0100289 tasks_run_queue_cur = tasks_run_queue; /* keep a copy for reporting */
Willy Tarreauc7bdf092009-03-21 18:33:52 +0100290 nb_tasks_cur = nb_tasks;
Olivier Houchard1599b802018-05-24 18:59:04 +0200291 max_processed = global.tune.runqueue_depth;
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200292
Willy Tarreauc8da0442019-04-15 09:33:42 +0200293 if (likely(niced_tasks))
294 max_processed = (max_processed + 3) / 4;
295
Willy Tarreaucde79022019-04-12 18:03:41 +0200296 /* Note: the grq lock is always held when grq is not null */
Christopher Faulet8a48f672017-11-14 10:38:36 +0100297
Willy Tarreaucde79022019-04-12 18:03:41 +0200298 while (task_per_thread[tid].task_list_size < max_processed) {
299 if ((global_tasks_mask & tid_bit) && !grq) {
Willy Tarreau3466e3c2019-04-15 18:52:40 +0200300#ifdef USE_THREAD
Willy Tarreaucde79022019-04-12 18:03:41 +0200301 HA_SPIN_LOCK(TASK_RQ_LOCK, &rq_lock);
302 grq = eb32sc_lookup_ge(&rqueue, rqueue_ticks - TIMER_LOOK_BACK, tid_bit);
303 if (unlikely(!grq)) {
304 grq = eb32sc_first(&rqueue, tid_bit);
305 if (!grq) {
Olivier Houchardde82aea2019-04-17 19:10:22 +0200306 global_tasks_mask &= ~tid_bit;
Willy Tarreaucde79022019-04-12 18:03:41 +0200307 HA_SPIN_UNLOCK(TASK_RQ_LOCK, &rq_lock);
Olivier Houchardc4aac9e2018-07-26 15:25:49 +0200308 }
Willy Tarreauf0c531a2017-11-05 16:35:59 +0100309 }
Willy Tarreau3466e3c2019-04-15 18:52:40 +0200310#endif
Willy Tarreaucde79022019-04-12 18:03:41 +0200311 }
Willy Tarreauf0c531a2017-11-05 16:35:59 +0100312
Willy Tarreaucde79022019-04-12 18:03:41 +0200313 /* If a global task is available for this thread, it's in grq
314 * now and the global RQ is locked.
315 */
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200316
Willy Tarreaucde79022019-04-12 18:03:41 +0200317 if (!lrq) {
318 lrq = eb32sc_lookup_ge(&task_per_thread[tid].rqueue, rqueue_ticks - TIMER_LOOK_BACK, tid_bit);
319 if (unlikely(!lrq))
320 lrq = eb32sc_first(&task_per_thread[tid].rqueue, tid_bit);
Willy Tarreauf0c531a2017-11-05 16:35:59 +0100321 }
Willy Tarreauf0c531a2017-11-05 16:35:59 +0100322
Willy Tarreaucde79022019-04-12 18:03:41 +0200323 if (!lrq && !grq)
324 break;
325
326 if (likely(!grq || (lrq && (int)(lrq->key - grq->key) <= 0))) {
327 t = eb32sc_entry(lrq, struct task, rq);
328 lrq = eb32sc_next(lrq, tid_bit);
329 __task_unlink_rq(t);
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200330 }
Willy Tarreau3466e3c2019-04-15 18:52:40 +0200331#ifdef USE_THREAD
Willy Tarreaucde79022019-04-12 18:03:41 +0200332 else {
333 t = eb32sc_entry(grq, struct task, rq);
334 grq = eb32sc_next(grq, tid_bit);
335 __task_unlink_rq(t);
336 if (unlikely(!grq)) {
337 grq = eb32sc_first(&rqueue, tid_bit);
338 if (!grq) {
Olivier Houchardde82aea2019-04-17 19:10:22 +0200339 global_tasks_mask &= ~tid_bit;
Willy Tarreaucde79022019-04-12 18:03:41 +0200340 HA_SPIN_UNLOCK(TASK_RQ_LOCK, &rq_lock);
Willy Tarreaucde79022019-04-12 18:03:41 +0200341 }
342 }
Emeric Brun01948972017-03-30 15:37:25 +0200343 }
Willy Tarreau3466e3c2019-04-15 18:52:40 +0200344#endif
Willy Tarreaucde79022019-04-12 18:03:41 +0200345
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200346 /* And add it to the local task list */
347 task_insert_into_tasklet_list(t);
Willy Tarreaubc13bec2019-04-30 14:55:18 +0200348 activity[tid].tasksw++;
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200349 }
Willy Tarreaucde79022019-04-12 18:03:41 +0200350
351 /* release the rqueue lock */
352 if (grq) {
353 HA_SPIN_UNLOCK(TASK_RQ_LOCK, &rq_lock);
354 grq = NULL;
355 }
356
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200357 if (!(global_tasks_mask & tid_bit) && task_per_thread[tid].rqueue_size == 0) {
Olivier Houchard4c2832852019-03-08 18:48:47 +0100358 _HA_ATOMIC_AND(&active_tasks_mask, ~tid_bit);
Olivier Houchardd2b5d162019-03-08 13:47:21 +0100359 __ha_barrier_atomic_load();
Olivier Houchardc4aac9e2018-07-26 15:25:49 +0200360 if (global_tasks_mask & tid_bit)
Olivier Houchard4c2832852019-03-08 18:48:47 +0100361 _HA_ATOMIC_OR(&active_tasks_mask, tid_bit);
Olivier Houchardc4aac9e2018-07-26 15:25:49 +0200362 }
Willy Tarreaucde79022019-04-12 18:03:41 +0200363
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200364 while (max_processed > 0 && !LIST_ISEMPTY(&task_per_thread[tid].task_list)) {
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200365 struct task *t;
366 unsigned short state;
367 void *ctx;
368 struct task *(*process)(struct task *t, void *ctx, unsigned short state);
369
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200370 t = (struct task *)LIST_ELEM(task_per_thread[tid].task_list.n, struct tasklet *, list);
Olivier Houchard4c2832852019-03-08 18:48:47 +0100371 state = _HA_ATOMIC_XCHG(&t->state, TASK_RUNNING);
Olivier Houchardd2b5d162019-03-08 13:47:21 +0100372 __ha_barrier_atomic_store();
Willy Tarreaue73256f2019-03-25 18:02:54 +0100373 __task_remove_from_tasklet_list(t);
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200374
Willy Tarreaubc13bec2019-04-30 14:55:18 +0200375 activity[tid].ctxsw++;
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200376 ctx = t->context;
377 process = t->process;
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200378 t->calls++;
Willy Tarreau9efd7452018-05-31 14:48:54 +0200379
380 if (unlikely(!TASK_IS_TASKLET(t) && t->call_date)) {
381 uint64_t now_ns = now_mono_time();
382
383 t->lat_time += now_ns - t->call_date;
384 t->call_date = now_ns;
385 }
386
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200387 curr_task = (struct task *)t;
Willy Tarreau01f34892019-05-17 11:46:04 +0200388 __ha_barrier_store();
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200389 if (likely(process == process_stream))
390 t = process_stream(t, ctx, state);
Willy Tarreau03dd0292019-04-17 22:32:27 +0200391 else if (process != NULL)
392 t = process(TASK_IS_TASKLET(t) ? NULL : t, ctx, state);
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200393 else {
Willy Tarreau03dd0292019-04-17 22:32:27 +0200394 __task_free(t);
Olivier Houchard1cfac372019-04-17 22:53:41 +0200395 curr_task = NULL;
Willy Tarreau01f34892019-05-17 11:46:04 +0200396 __ha_barrier_store();
Olivier Houchard1cfac372019-04-17 22:53:41 +0200397 /* We don't want max_processed to be decremented if
398 * we're just freeing a destroyed task, we should only
399 * do so if we really ran a task.
400 */
401 continue;
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200402 }
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200403 curr_task = NULL;
Willy Tarreau01f34892019-05-17 11:46:04 +0200404 __ha_barrier_store();
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200405 /* If there is a pending state we have to wake up the task
Joseph Herlantcf92b6d2018-11-15 14:19:23 -0800406 * immediately, else we defer it into wait queue
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200407 */
408 if (t != NULL) {
Willy Tarreau9efd7452018-05-31 14:48:54 +0200409 if (unlikely(!TASK_IS_TASKLET(t) && t->call_date)) {
410 t->cpu_time += now_mono_time() - t->call_date;
411 t->call_date = 0;
412 }
413
Olivier Houchard4c2832852019-03-08 18:48:47 +0100414 state = _HA_ATOMIC_AND(&t->state, ~TASK_RUNNING);
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200415 if (state)
Willy Tarreaub0380072019-04-17 11:47:18 +0200416 task_wakeup(t, 0);
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200417 else
Willy Tarreau9d4b56b2017-11-06 08:36:53 +0100418 task_queue(t);
Willy Tarreau58b458d2008-06-29 22:40:23 +0200419 }
Willy Tarreauce4e0aa2017-11-05 23:57:00 +0100420
Olivier Houchard736ea412018-05-28 14:54:49 +0200421 max_processed--;
Willy Tarreaucde79022019-04-12 18:03:41 +0200422 }
423
424 if (!LIST_ISEMPTY(&task_per_thread[tid].task_list)) {
425 _HA_ATOMIC_OR(&active_tasks_mask, tid_bit);
426 activity[tid].long_rq++;
Christopher Faulet3911ee82017-11-14 10:26:53 +0100427 }
Willy Tarreaubaaee002006-06-26 02:48:02 +0200428}
429
William Lallemand27f3fa52018-12-06 14:05:20 +0100430/*
431 * Delete every tasks before running the master polling loop
432 */
433void mworker_cleantasks()
434{
435 struct task *t;
436 int i;
William Lallemandb5823392018-12-06 15:14:37 +0100437 struct eb32_node *tmp_wq = NULL;
438 struct eb32sc_node *tmp_rq = NULL;
William Lallemand27f3fa52018-12-06 14:05:20 +0100439
440#ifdef USE_THREAD
441 /* cleanup the global run queue */
William Lallemandb5823392018-12-06 15:14:37 +0100442 tmp_rq = eb32sc_first(&rqueue, MAX_THREADS_MASK);
443 while (tmp_rq) {
444 t = eb32sc_entry(tmp_rq, struct task, rq);
445 tmp_rq = eb32sc_next(tmp_rq, MAX_THREADS_MASK);
Olivier Houchard3f795f72019-04-17 22:51:06 +0200446 task_destroy(t);
William Lallemand27f3fa52018-12-06 14:05:20 +0100447 }
448 /* cleanup the timers queue */
William Lallemandb5823392018-12-06 15:14:37 +0100449 tmp_wq = eb32_first(&timers);
450 while (tmp_wq) {
451 t = eb32_entry(tmp_wq, struct task, wq);
452 tmp_wq = eb32_next(tmp_wq);
Olivier Houchard3f795f72019-04-17 22:51:06 +0200453 task_destroy(t);
William Lallemand27f3fa52018-12-06 14:05:20 +0100454 }
455#endif
456 /* clean the per thread run queue */
457 for (i = 0; i < global.nbthread; i++) {
William Lallemandb5823392018-12-06 15:14:37 +0100458 tmp_rq = eb32sc_first(&task_per_thread[i].rqueue, MAX_THREADS_MASK);
459 while (tmp_rq) {
460 t = eb32sc_entry(tmp_rq, struct task, rq);
461 tmp_rq = eb32sc_next(tmp_rq, MAX_THREADS_MASK);
Olivier Houchard3f795f72019-04-17 22:51:06 +0200462 task_destroy(t);
William Lallemand27f3fa52018-12-06 14:05:20 +0100463 }
464 /* cleanup the per thread timers queue */
William Lallemandb5823392018-12-06 15:14:37 +0100465 tmp_wq = eb32_first(&task_per_thread[i].timers);
466 while (tmp_wq) {
467 t = eb32_entry(tmp_wq, struct task, wq);
468 tmp_wq = eb32_next(tmp_wq);
Olivier Houchard3f795f72019-04-17 22:51:06 +0200469 task_destroy(t);
William Lallemand27f3fa52018-12-06 14:05:20 +0100470 }
471 }
472}
473
Willy Tarreaub6b3df32018-11-26 16:31:20 +0100474/* perform minimal intializations */
475static void init_task()
Willy Tarreau4726f532009-03-07 17:25:21 +0100476{
Olivier Houchardf6e6dc12018-05-18 18:38:23 +0200477 int i;
478
Olivier Houchardb1ca58b2018-06-06 14:22:03 +0200479#ifdef USE_THREAD
Willy Tarreaub20aa9e2018-10-15 14:52:21 +0200480 memset(&timers, 0, sizeof(timers));
Willy Tarreau4726f532009-03-07 17:25:21 +0100481 memset(&rqueue, 0, sizeof(rqueue));
Olivier Houchardb1ca58b2018-06-06 14:22:03 +0200482#endif
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200483 memset(&task_per_thread, 0, sizeof(task_per_thread));
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200484 for (i = 0; i < MAX_THREADS; i++) {
Willy Tarreau8d8747a2018-10-15 16:12:48 +0200485 LIST_INIT(&task_per_thread[i].task_list);
Olivier Houchardb0bdae72018-05-18 18:45:28 +0200486 }
Willy Tarreau4726f532009-03-07 17:25:21 +0100487}
488
Willy Tarreaub6b3df32018-11-26 16:31:20 +0100489INITCALL0(STG_PREPARE, init_task);
490
Willy Tarreaubaaee002006-06-26 02:48:02 +0200491/*
492 * Local variables:
493 * c-indent-level: 8
494 * c-basic-offset: 8
495 * End:
496 */