Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 1 | /* |
| 2 | * Task management functions. |
| 3 | * |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 4 | * Copyright 2000-2009 Willy Tarreau <w@1wt.eu> |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 5 | * |
| 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 Tarreau | 87bed62 | 2009-03-08 22:25:28 +0100 | [diff] [blame] | 13 | #include <string.h> |
| 14 | |
Willy Tarreau | b255105 | 2020-06-09 09:07:15 +0200 | [diff] [blame] | 15 | #include <import/eb32sctree.h> |
| 16 | #include <import/eb32tree.h> |
| 17 | |
Willy Tarreau | 4c7e4b7 | 2020-05-27 12:58:42 +0200 | [diff] [blame] | 18 | #include <haproxy/api.h> |
Willy Tarreau | e7723bd | 2020-06-24 11:11:02 +0200 | [diff] [blame] | 19 | #include <haproxy/cfgparse.h> |
Willy Tarreau | b255105 | 2020-06-09 09:07:15 +0200 | [diff] [blame] | 20 | #include <haproxy/fd.h> |
| 21 | #include <haproxy/freq_ctr.h> |
Willy Tarreau | 853b297 | 2020-05-27 18:01:47 +0200 | [diff] [blame] | 22 | #include <haproxy/list.h> |
Willy Tarreau | b255105 | 2020-06-09 09:07:15 +0200 | [diff] [blame] | 23 | #include <haproxy/pool.h> |
Willy Tarreau | dfd3de8 | 2020-06-04 23:46:14 +0200 | [diff] [blame] | 24 | #include <haproxy/stream.h> |
Willy Tarreau | cea0e1b | 2020-06-04 17:25:40 +0200 | [diff] [blame] | 25 | #include <haproxy/task.h> |
Willy Tarreau | 92b4f13 | 2020-06-01 11:05:15 +0200 | [diff] [blame] | 26 | #include <haproxy/time.h> |
Willy Tarreau | b255105 | 2020-06-09 09:07:15 +0200 | [diff] [blame] | 27 | #include <haproxy/tools.h> |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 28 | |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 29 | |
Willy Tarreau | 8ceae72 | 2018-11-26 11:58:30 +0100 | [diff] [blame] | 30 | DECLARE_POOL(pool_head_task, "task", sizeof(struct task)); |
| 31 | DECLARE_POOL(pool_head_tasklet, "tasklet", sizeof(struct tasklet)); |
Willy Tarreau | 96bcfd7 | 2007-04-29 10:41:56 +0200 | [diff] [blame] | 32 | |
Thierry FOURNIER | d697596 | 2017-07-12 14:31:10 +0200 | [diff] [blame] | 33 | /* This is the memory pool containing all the signal structs. These |
Joseph Herlant | cf92b6d | 2018-11-15 14:19:23 -0800 | [diff] [blame] | 34 | * struct are used to store each required signal between two tasks. |
Thierry FOURNIER | d697596 | 2017-07-12 14:31:10 +0200 | [diff] [blame] | 35 | */ |
Willy Tarreau | 8ceae72 | 2018-11-26 11:58:30 +0100 | [diff] [blame] | 36 | DECLARE_POOL(pool_head_notification, "notification", sizeof(struct notification)); |
Thierry FOURNIER | d697596 | 2017-07-12 14:31:10 +0200 | [diff] [blame] | 37 | |
Willy Tarreau | a461318 | 2009-03-21 18:13:21 +0100 | [diff] [blame] | 38 | unsigned int nb_tasks = 0; |
Olivier Houchard | eba0c0b | 2018-07-26 18:53:28 +0200 | [diff] [blame] | 39 | volatile unsigned long global_tasks_mask = 0; /* Mask of threads with tasks in the global runqueue */ |
Christopher Faulet | 34c5cc9 | 2016-12-06 09:15:30 +0100 | [diff] [blame] | 40 | unsigned int tasks_run_queue = 0; |
| 41 | unsigned int tasks_run_queue_cur = 0; /* copy of the run queue size */ |
Willy Tarreau | c7bdf09 | 2009-03-21 18:33:52 +0100 | [diff] [blame] | 42 | unsigned int nb_tasks_cur = 0; /* copy of the tasks count */ |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 43 | unsigned int niced_tasks = 0; /* number of niced tasks in the run queue */ |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 44 | |
Willy Tarreau | d022e9c | 2019-09-24 08:25:15 +0200 | [diff] [blame] | 45 | THREAD_LOCAL struct task_per_thread *sched = &task_per_thread[0]; /* scheduler context for the current thread */ |
Willy Tarreau | 6d1222c | 2017-11-26 10:08:06 +0100 | [diff] [blame] | 46 | |
Willy Tarreau | 86abe44 | 2018-11-25 20:12:18 +0100 | [diff] [blame] | 47 | __decl_aligned_spinlock(rq_lock); /* spin lock related to run queue */ |
Willy Tarreau | ef28dc1 | 2019-05-28 18:48:07 +0200 | [diff] [blame] | 48 | __decl_aligned_rwlock(wq_lock); /* RW lock related to the wait queue */ |
Willy Tarreau | 964c936 | 2007-01-07 00:38:00 +0100 | [diff] [blame] | 49 | |
Olivier Houchard | b1ca58b | 2018-06-06 14:22:03 +0200 | [diff] [blame] | 50 | #ifdef USE_THREAD |
Willy Tarreau | b20aa9e | 2018-10-15 14:52:21 +0200 | [diff] [blame] | 51 | struct eb_root timers; /* sorted timers tree, global */ |
Olivier Houchard | f6e6dc1 | 2018-05-18 18:38:23 +0200 | [diff] [blame] | 52 | struct eb_root rqueue; /* tree constituting the run queue */ |
Olivier Houchard | 77551ee | 2018-07-26 15:59:38 +0200 | [diff] [blame] | 53 | int global_rqueue_size; /* Number of element sin the global runqueue */ |
Olivier Houchard | b1ca58b | 2018-06-06 14:22:03 +0200 | [diff] [blame] | 54 | #endif |
Willy Tarreau | b20aa9e | 2018-10-15 14:52:21 +0200 | [diff] [blame] | 55 | |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 56 | static unsigned int rqueue_ticks; /* insertion count */ |
Willy Tarreau | 8d8747a | 2018-10-15 16:12:48 +0200 | [diff] [blame] | 57 | |
| 58 | struct task_per_thread task_per_thread[MAX_THREADS]; |
Willy Tarreau | 9789f7b | 2008-06-24 08:17:16 +0200 | [diff] [blame] | 59 | |
Willy Tarreau | eb8c2c6 | 2020-06-30 11:48:48 +0200 | [diff] [blame] | 60 | |
| 61 | /* Flags the task <t> for immediate destruction and puts it into its first |
| 62 | * thread's shared tasklet list if not yet queued/running. This will bypass |
| 63 | * the priority scheduling and make the task show up as fast as possible in |
| 64 | * the other thread's queue. Note that this operation isn't idempotent and is |
| 65 | * not supposed to be run on the same task from multiple threads at once. It's |
| 66 | * the caller's responsibility to make sure it is the only one able to kill the |
| 67 | * task. |
| 68 | */ |
| 69 | void task_kill(struct task *t) |
| 70 | { |
| 71 | unsigned short state = t->state; |
| 72 | unsigned int thr; |
| 73 | |
| 74 | BUG_ON(state & TASK_KILLED); |
| 75 | |
| 76 | while (1) { |
| 77 | while (state & (TASK_RUNNING | TASK_QUEUED)) { |
| 78 | /* task already in the queue and about to be executed, |
| 79 | * or even currently running. Just add the flag and be |
| 80 | * done with it, the process loop will detect it and kill |
| 81 | * it. The CAS will fail if we arrive too late. |
| 82 | */ |
| 83 | if (_HA_ATOMIC_CAS(&t->state, &state, state | TASK_KILLED)) |
| 84 | return; |
| 85 | } |
| 86 | |
| 87 | /* We'll have to wake it up, but we must also secure it so that |
| 88 | * it doesn't vanish under us. TASK_QUEUED guarantees nobody will |
| 89 | * add past us. |
| 90 | */ |
| 91 | if (_HA_ATOMIC_CAS(&t->state, &state, state | TASK_QUEUED | TASK_KILLED)) { |
| 92 | /* Bypass the tree and go directly into the shared tasklet list. |
| 93 | * Note: that's a task so it must be accounted for as such. Pick |
| 94 | * the task's first thread for the job. |
| 95 | */ |
| 96 | thr = my_ffsl(t->thread_mask) - 1; |
Willy Tarreau | 54d3117 | 2020-07-02 14:14:00 +0200 | [diff] [blame] | 97 | |
| 98 | /* Beware: tasks that have never run don't have their ->list empty yet! */ |
Willy Tarreau | 950954f | 2020-07-10 08:32:10 +0200 | [diff] [blame] | 99 | MT_LIST_ADDQ(&task_per_thread[thr].shared_tasklet_list, |
Willy Tarreau | 4f58926 | 2020-07-02 17:17:42 +0200 | [diff] [blame] | 100 | (struct mt_list *)&((struct tasklet *)t)->list); |
Willy Tarreau | 54d3117 | 2020-07-02 14:14:00 +0200 | [diff] [blame] | 101 | _HA_ATOMIC_ADD(&tasks_run_queue, 1); |
| 102 | _HA_ATOMIC_ADD(&task_per_thread[thr].task_list_size, 1); |
| 103 | if (sleeping_thread_mask & (1UL << thr)) { |
| 104 | _HA_ATOMIC_AND(&sleeping_thread_mask, ~(1UL << thr)); |
| 105 | wake_thread(thr); |
Willy Tarreau | eb8c2c6 | 2020-06-30 11:48:48 +0200 | [diff] [blame] | 106 | } |
Willy Tarreau | 54d3117 | 2020-07-02 14:14:00 +0200 | [diff] [blame] | 107 | return; |
Willy Tarreau | eb8c2c6 | 2020-06-30 11:48:48 +0200 | [diff] [blame] | 108 | } |
| 109 | } |
| 110 | } |
| 111 | |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 112 | /* Puts the task <t> in run queue at a position depending on t->nice. <t> is |
| 113 | * returned. The nice value assigns boosts in 32th of the run queue size. A |
Christopher Faulet | 34c5cc9 | 2016-12-06 09:15:30 +0100 | [diff] [blame] | 114 | * nice value of -1024 sets the task to -tasks_run_queue*32, while a nice value |
| 115 | * of 1024 sets the task to tasks_run_queue*32. The state flags are cleared, so |
| 116 | * the caller will have to set its flags after this call. |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 117 | * The task must not already be in the run queue. If unsure, use the safer |
| 118 | * task_wakeup() function. |
Willy Tarreau | 91e9993 | 2008-06-30 07:51:00 +0200 | [diff] [blame] | 119 | */ |
Olivier Houchard | f6e6dc1 | 2018-05-18 18:38:23 +0200 | [diff] [blame] | 120 | void __task_wakeup(struct task *t, struct eb_root *root) |
Willy Tarreau | e33aece | 2007-04-30 13:15:14 +0200 | [diff] [blame] | 121 | { |
Olivier Houchard | b1ca58b | 2018-06-06 14:22:03 +0200 | [diff] [blame] | 122 | #ifdef USE_THREAD |
Olivier Houchard | f6e6dc1 | 2018-05-18 18:38:23 +0200 | [diff] [blame] | 123 | if (root == &rqueue) { |
Olivier Houchard | f6e6dc1 | 2018-05-18 18:38:23 +0200 | [diff] [blame] | 124 | HA_SPIN_LOCK(TASK_RQ_LOCK, &rq_lock); |
Olivier Houchard | f6e6dc1 | 2018-05-18 18:38:23 +0200 | [diff] [blame] | 125 | } |
Willy Tarreau | 2d1fd0a | 2019-04-15 09:18:31 +0200 | [diff] [blame] | 126 | #endif |
Olivier Houchard | f6e6dc1 | 2018-05-18 18:38:23 +0200 | [diff] [blame] | 127 | /* Make sure if the task isn't in the runqueue, nobody inserts it |
| 128 | * in the meanwhile. |
| 129 | */ |
Olivier Houchard | 4c283285 | 2019-03-08 18:48:47 +0100 | [diff] [blame] | 130 | _HA_ATOMIC_ADD(&tasks_run_queue, 1); |
Olivier Houchard | c4aac9e | 2018-07-26 15:25:49 +0200 | [diff] [blame] | 131 | #ifdef USE_THREAD |
| 132 | if (root == &rqueue) { |
Olivier Houchard | de82aea | 2019-04-17 19:10:22 +0200 | [diff] [blame] | 133 | global_tasks_mask |= t->thread_mask; |
Olivier Houchard | ed1a6a0 | 2019-04-18 14:12:51 +0200 | [diff] [blame] | 134 | __ha_barrier_store(); |
Olivier Houchard | c4aac9e | 2018-07-26 15:25:49 +0200 | [diff] [blame] | 135 | } |
| 136 | #endif |
Olivier Houchard | 4c283285 | 2019-03-08 18:48:47 +0100 | [diff] [blame] | 137 | t->rq.key = _HA_ATOMIC_ADD(&rqueue_ticks, 1); |
Willy Tarreau | 91e9993 | 2008-06-30 07:51:00 +0200 | [diff] [blame] | 138 | |
| 139 | if (likely(t->nice)) { |
| 140 | int offset; |
| 141 | |
Olivier Houchard | 4c283285 | 2019-03-08 18:48:47 +0100 | [diff] [blame] | 142 | _HA_ATOMIC_ADD(&niced_tasks, 1); |
Willy Tarreau | 2d1fd0a | 2019-04-15 09:18:31 +0200 | [diff] [blame] | 143 | offset = t->nice * (int)global.tune.runqueue_depth; |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 144 | t->rq.key += offset; |
Willy Tarreau | 91e9993 | 2008-06-30 07:51:00 +0200 | [diff] [blame] | 145 | } |
| 146 | |
Willy Tarreau | d9add3a | 2019-04-25 08:57:41 +0200 | [diff] [blame] | 147 | if (task_profiling_mask & tid_bit) |
Willy Tarreau | 9efd745 | 2018-05-31 14:48:54 +0200 | [diff] [blame] | 148 | t->call_date = now_mono_time(); |
| 149 | |
Olivier Houchard | f6e6dc1 | 2018-05-18 18:38:23 +0200 | [diff] [blame] | 150 | eb32sc_insert(root, &t->rq, t->thread_mask); |
Olivier Houchard | b1ca58b | 2018-06-06 14:22:03 +0200 | [diff] [blame] | 151 | #ifdef USE_THREAD |
Olivier Houchard | f6e6dc1 | 2018-05-18 18:38:23 +0200 | [diff] [blame] | 152 | if (root == &rqueue) { |
| 153 | global_rqueue_size++; |
Olivier Houchard | 4c283285 | 2019-03-08 18:48:47 +0100 | [diff] [blame] | 154 | _HA_ATOMIC_OR(&t->state, TASK_GLOBAL); |
Olivier Houchard | f6e6dc1 | 2018-05-18 18:38:23 +0200 | [diff] [blame] | 155 | HA_SPIN_UNLOCK(TASK_RQ_LOCK, &rq_lock); |
Olivier Houchard | b1ca58b | 2018-06-06 14:22:03 +0200 | [diff] [blame] | 156 | } else |
| 157 | #endif |
| 158 | { |
Willy Tarreau | 8d8747a | 2018-10-15 16:12:48 +0200 | [diff] [blame] | 159 | int nb = ((void *)root - (void *)&task_per_thread[0].rqueue) / sizeof(task_per_thread[0]); |
| 160 | task_per_thread[nb].rqueue_size++; |
Olivier Houchard | f6e6dc1 | 2018-05-18 18:38:23 +0200 | [diff] [blame] | 161 | } |
Willy Tarreau | 85d9b84 | 2018-07-27 17:14:41 +0200 | [diff] [blame] | 162 | #ifdef USE_THREAD |
Olivier Houchard | 79321b9 | 2018-07-26 17:55:11 +0200 | [diff] [blame] | 163 | /* If all threads that are supposed to handle this task are sleeping, |
| 164 | * wake one. |
| 165 | */ |
| 166 | if ((((t->thread_mask & all_threads_mask) & sleeping_thread_mask) == |
Olivier Houchard | 1b32790 | 2019-03-15 00:23:10 +0100 | [diff] [blame] | 167 | (t->thread_mask & all_threads_mask))) { |
| 168 | unsigned long m = (t->thread_mask & all_threads_mask) &~ tid_bit; |
| 169 | |
| 170 | m = (m & (m - 1)) ^ m; // keep lowest bit set |
| 171 | _HA_ATOMIC_AND(&sleeping_thread_mask, ~m); |
| 172 | wake_thread(my_ffsl(m) - 1); |
| 173 | } |
Willy Tarreau | 85d9b84 | 2018-07-27 17:14:41 +0200 | [diff] [blame] | 174 | #endif |
Olivier Houchard | f6e6dc1 | 2018-05-18 18:38:23 +0200 | [diff] [blame] | 175 | return; |
Willy Tarreau | e33aece | 2007-04-30 13:15:14 +0200 | [diff] [blame] | 176 | } |
Willy Tarreau | d825eef | 2007-05-12 22:35:00 +0200 | [diff] [blame] | 177 | |
Willy Tarreau | 96bcfd7 | 2007-04-29 10:41:56 +0200 | [diff] [blame] | 178 | /* |
Willy Tarreau | 531cf0c | 2009-03-08 16:35:27 +0100 | [diff] [blame] | 179 | * __task_queue() |
Willy Tarreau | 96bcfd7 | 2007-04-29 10:41:56 +0200 | [diff] [blame] | 180 | * |
Willy Tarreau | b20aa9e | 2018-10-15 14:52:21 +0200 | [diff] [blame] | 181 | * Inserts a task into wait queue <wq> at the position given by its expiration |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 182 | * date. It does not matter if the task was already in the wait queue or not, |
Willy Tarreau | 531cf0c | 2009-03-08 16:35:27 +0100 | [diff] [blame] | 183 | * as it will be unlinked. The task must not have an infinite expiration timer. |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 184 | * Last, tasks must not be queued further than the end of the tree, which is |
| 185 | * between <now_ms> and <now_ms> + 2^31 ms (now+24days in 32bit). |
Willy Tarreau | 531cf0c | 2009-03-08 16:35:27 +0100 | [diff] [blame] | 186 | * |
| 187 | * This function should not be used directly, it is meant to be called by the |
| 188 | * inline version of task_queue() which performs a few cheap preliminary tests |
Willy Tarreau | b20aa9e | 2018-10-15 14:52:21 +0200 | [diff] [blame] | 189 | * before deciding to call __task_queue(). Moreover this function doesn't care |
| 190 | * at all about locking so the caller must be careful when deciding whether to |
| 191 | * lock or not around this call. |
Willy Tarreau | 96bcfd7 | 2007-04-29 10:41:56 +0200 | [diff] [blame] | 192 | */ |
Willy Tarreau | b20aa9e | 2018-10-15 14:52:21 +0200 | [diff] [blame] | 193 | void __task_queue(struct task *task, struct eb_root *wq) |
Willy Tarreau | 964c936 | 2007-01-07 00:38:00 +0100 | [diff] [blame] | 194 | { |
Willy Tarreau | e5d79bc | 2020-07-22 14:29:42 +0200 | [diff] [blame] | 195 | #ifdef USE_THREAD |
| 196 | BUG_ON((wq == &timers && !(task->state & TASK_SHARED_WQ)) || |
| 197 | (wq == &sched->timers && (task->state & TASK_SHARED_WQ)) || |
| 198 | (wq != &timers && wq != &sched->timers)); |
| 199 | #endif |
| 200 | |
Willy Tarreau | 531cf0c | 2009-03-08 16:35:27 +0100 | [diff] [blame] | 201 | if (likely(task_in_wq(task))) |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 202 | __task_unlink_wq(task); |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 203 | |
| 204 | /* the task is not in the queue now */ |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 205 | task->wq.key = task->expire; |
Willy Tarreau | 28c41a4 | 2008-06-29 17:00:59 +0200 | [diff] [blame] | 206 | #ifdef DEBUG_CHECK_INVALID_EXPIRATION_DATES |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 207 | if (tick_is_lt(task->wq.key, now_ms)) |
Willy Tarreau | 28c41a4 | 2008-06-29 17:00:59 +0200 | [diff] [blame] | 208 | /* we're queuing too far away or in the past (most likely) */ |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 209 | return; |
Willy Tarreau | 28c41a4 | 2008-06-29 17:00:59 +0200 | [diff] [blame] | 210 | #endif |
Willy Tarreau | ce44f12 | 2008-07-05 18:16:19 +0200 | [diff] [blame] | 211 | |
Willy Tarreau | b20aa9e | 2018-10-15 14:52:21 +0200 | [diff] [blame] | 212 | eb32_insert(wq, &task->wq); |
Willy Tarreau | 964c936 | 2007-01-07 00:38:00 +0100 | [diff] [blame] | 213 | } |
| 214 | |
Willy Tarreau | 96bcfd7 | 2007-04-29 10:41:56 +0200 | [diff] [blame] | 215 | /* |
Willy Tarreau | 9789f7b | 2008-06-24 08:17:16 +0200 | [diff] [blame] | 216 | * Extract all expired timers from the timer queue, and wakes up all |
Willy Tarreau | c49ba52 | 2019-12-11 08:12:23 +0100 | [diff] [blame] | 217 | * associated tasks. |
Willy Tarreau | 96bcfd7 | 2007-04-29 10:41:56 +0200 | [diff] [blame] | 218 | */ |
Willy Tarreau | c49ba52 | 2019-12-11 08:12:23 +0100 | [diff] [blame] | 219 | void wake_expired_tasks() |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 220 | { |
Willy Tarreau | d022e9c | 2019-09-24 08:25:15 +0200 | [diff] [blame] | 221 | struct task_per_thread * const tt = sched; // thread's tasks |
Willy Tarreau | 3cfaa8d | 2020-10-16 09:26:22 +0200 | [diff] [blame] | 222 | int max_processed = global.tune.runqueue_depth; |
Willy Tarreau | 96bcfd7 | 2007-04-29 10:41:56 +0200 | [diff] [blame] | 223 | struct task *task; |
Willy Tarreau | 9789f7b | 2008-06-24 08:17:16 +0200 | [diff] [blame] | 224 | struct eb32_node *eb; |
Willy Tarreau | af613e8 | 2020-06-05 08:40:51 +0200 | [diff] [blame] | 225 | __decl_thread(int key); |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 226 | |
Willy Tarreau | 3cfaa8d | 2020-10-16 09:26:22 +0200 | [diff] [blame] | 227 | while (max_processed-- > 0) { |
Willy Tarreau | b20aa9e | 2018-10-15 14:52:21 +0200 | [diff] [blame] | 228 | lookup_next_local: |
Willy Tarreau | 4c1e1ad | 2019-09-24 07:19:08 +0200 | [diff] [blame] | 229 | eb = eb32_lookup_ge(&tt->timers, now_ms - TIMER_LOOK_BACK); |
Willy Tarreau | b20aa9e | 2018-10-15 14:52:21 +0200 | [diff] [blame] | 230 | if (!eb) { |
| 231 | /* we might have reached the end of the tree, typically because |
| 232 | * <now_ms> is in the first half and we're first scanning the last |
| 233 | * half. Let's loop back to the beginning of the tree now. |
| 234 | */ |
Willy Tarreau | 4c1e1ad | 2019-09-24 07:19:08 +0200 | [diff] [blame] | 235 | eb = eb32_first(&tt->timers); |
Willy Tarreau | b20aa9e | 2018-10-15 14:52:21 +0200 | [diff] [blame] | 236 | if (likely(!eb)) |
| 237 | break; |
| 238 | } |
| 239 | |
Willy Tarreau | b20aa9e | 2018-10-15 14:52:21 +0200 | [diff] [blame] | 240 | /* It is possible that this task was left at an earlier place in the |
| 241 | * tree because a recent call to task_queue() has not moved it. This |
| 242 | * happens when the new expiration date is later than the old one. |
| 243 | * Since it is very unlikely that we reach a timeout anyway, it's a |
| 244 | * lot cheaper to proceed like this because we almost never update |
| 245 | * the tree. We may also find disabled expiration dates there. Since |
| 246 | * we have detached the task from the tree, we simply call task_queue |
| 247 | * to take care of this. Note that we might occasionally requeue it at |
| 248 | * the same place, before <eb>, so we have to check if this happens, |
| 249 | * and adjust <eb>, otherwise we may skip it which is not what we want. |
| 250 | * We may also not requeue the task (and not point eb at it) if its |
Willy Tarreau | 77015ab | 2020-06-19 11:50:27 +0200 | [diff] [blame] | 251 | * expiration time is not set. We also make sure we leave the real |
| 252 | * expiration date for the next task in the queue so that when calling |
| 253 | * next_timer_expiry() we're guaranteed to see the next real date and |
| 254 | * not the next apparent date. This is in order to avoid useless |
| 255 | * wakeups. |
Willy Tarreau | b20aa9e | 2018-10-15 14:52:21 +0200 | [diff] [blame] | 256 | */ |
Willy Tarreau | 77015ab | 2020-06-19 11:50:27 +0200 | [diff] [blame] | 257 | |
| 258 | task = eb32_entry(eb, struct task, wq); |
| 259 | if (tick_is_expired(task->expire, now_ms)) { |
| 260 | /* expired task, wake it up */ |
| 261 | __task_unlink_wq(task); |
| 262 | task_wakeup(task, TASK_WOKEN_TIMER); |
| 263 | } |
| 264 | else if (task->expire != eb->key) { |
| 265 | /* task is not expired but its key doesn't match so let's |
| 266 | * update it and skip to next apparently expired task. |
| 267 | */ |
| 268 | __task_unlink_wq(task); |
Willy Tarreau | b20aa9e | 2018-10-15 14:52:21 +0200 | [diff] [blame] | 269 | if (tick_isset(task->expire)) |
Willy Tarreau | 4c1e1ad | 2019-09-24 07:19:08 +0200 | [diff] [blame] | 270 | __task_queue(task, &tt->timers); |
Willy Tarreau | b20aa9e | 2018-10-15 14:52:21 +0200 | [diff] [blame] | 271 | } |
Willy Tarreau | 77015ab | 2020-06-19 11:50:27 +0200 | [diff] [blame] | 272 | else { |
| 273 | /* task not expired and correctly placed */ |
| 274 | break; |
| 275 | } |
Willy Tarreau | b20aa9e | 2018-10-15 14:52:21 +0200 | [diff] [blame] | 276 | } |
| 277 | |
| 278 | #ifdef USE_THREAD |
Willy Tarreau | 1e928c0 | 2019-05-28 18:57:25 +0200 | [diff] [blame] | 279 | if (eb_is_empty(&timers)) |
| 280 | goto leave; |
| 281 | |
| 282 | HA_RWLOCK_RDLOCK(TASK_WQ_LOCK, &wq_lock); |
| 283 | eb = eb32_lookup_ge(&timers, now_ms - TIMER_LOOK_BACK); |
| 284 | if (!eb) { |
| 285 | eb = eb32_first(&timers); |
| 286 | if (likely(!eb)) { |
| 287 | HA_RWLOCK_RDUNLOCK(TASK_WQ_LOCK, &wq_lock); |
| 288 | goto leave; |
| 289 | } |
| 290 | } |
| 291 | key = eb->key; |
Willy Tarreau | 1e928c0 | 2019-05-28 18:57:25 +0200 | [diff] [blame] | 292 | |
Willy Tarreau | d48ed66 | 2020-10-16 09:31:41 +0200 | [diff] [blame] | 293 | if (tick_is_lt(now_ms, key)) { |
| 294 | HA_RWLOCK_RDUNLOCK(TASK_WQ_LOCK, &wq_lock); |
Willy Tarreau | 1e928c0 | 2019-05-28 18:57:25 +0200 | [diff] [blame] | 295 | goto leave; |
Willy Tarreau | d48ed66 | 2020-10-16 09:31:41 +0200 | [diff] [blame] | 296 | } |
Willy Tarreau | 1e928c0 | 2019-05-28 18:57:25 +0200 | [diff] [blame] | 297 | |
| 298 | /* There's really something of interest here, let's visit the queue */ |
| 299 | |
Willy Tarreau | d48ed66 | 2020-10-16 09:31:41 +0200 | [diff] [blame] | 300 | if (HA_RWLOCK_TRYRDTOSK(TASK_WQ_LOCK, &wq_lock)) { |
| 301 | /* if we failed to grab the lock it means another thread is |
| 302 | * already doing the same here, so let it do the job. |
| 303 | */ |
| 304 | HA_RWLOCK_RDUNLOCK(TASK_WQ_LOCK, &wq_lock); |
| 305 | goto leave; |
| 306 | } |
| 307 | |
Willy Tarreau | b20aa9e | 2018-10-15 14:52:21 +0200 | [diff] [blame] | 308 | while (1) { |
Emeric Brun | c60def8 | 2017-09-27 14:59:38 +0200 | [diff] [blame] | 309 | lookup_next: |
Willy Tarreau | 3cfaa8d | 2020-10-16 09:26:22 +0200 | [diff] [blame] | 310 | if (max_processed-- <= 0) |
| 311 | break; |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 312 | eb = eb32_lookup_ge(&timers, now_ms - TIMER_LOOK_BACK); |
Emeric Brun | c60def8 | 2017-09-27 14:59:38 +0200 | [diff] [blame] | 313 | if (!eb) { |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 314 | /* we might have reached the end of the tree, typically because |
| 315 | * <now_ms> is in the first half and we're first scanning the last |
| 316 | * half. Let's loop back to the beginning of the tree now. |
| 317 | */ |
| 318 | eb = eb32_first(&timers); |
Willy Tarreau | b992ba1 | 2017-11-05 19:09:27 +0100 | [diff] [blame] | 319 | if (likely(!eb)) |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 320 | break; |
| 321 | } |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 322 | |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 323 | task = eb32_entry(eb, struct task, wq); |
Willy Tarreau | 77015ab | 2020-06-19 11:50:27 +0200 | [diff] [blame] | 324 | if (tick_is_expired(task->expire, now_ms)) { |
| 325 | /* expired task, wake it up */ |
Willy Tarreau | d48ed66 | 2020-10-16 09:31:41 +0200 | [diff] [blame] | 326 | HA_RWLOCK_SKTOWR(TASK_WQ_LOCK, &wq_lock); |
Willy Tarreau | 77015ab | 2020-06-19 11:50:27 +0200 | [diff] [blame] | 327 | __task_unlink_wq(task); |
Willy Tarreau | d48ed66 | 2020-10-16 09:31:41 +0200 | [diff] [blame] | 328 | HA_RWLOCK_WRTOSK(TASK_WQ_LOCK, &wq_lock); |
Willy Tarreau | 77015ab | 2020-06-19 11:50:27 +0200 | [diff] [blame] | 329 | task_wakeup(task, TASK_WOKEN_TIMER); |
| 330 | } |
| 331 | else if (task->expire != eb->key) { |
| 332 | /* task is not expired but its key doesn't match so let's |
| 333 | * update it and skip to next apparently expired task. |
| 334 | */ |
Willy Tarreau | d48ed66 | 2020-10-16 09:31:41 +0200 | [diff] [blame] | 335 | HA_RWLOCK_SKTOWR(TASK_WQ_LOCK, &wq_lock); |
Willy Tarreau | 77015ab | 2020-06-19 11:50:27 +0200 | [diff] [blame] | 336 | __task_unlink_wq(task); |
Willy Tarreau | b992ba1 | 2017-11-05 19:09:27 +0100 | [diff] [blame] | 337 | if (tick_isset(task->expire)) |
Willy Tarreau | 783afbe | 2020-07-22 14:12:45 +0200 | [diff] [blame] | 338 | __task_queue(task, &timers); |
Willy Tarreau | d48ed66 | 2020-10-16 09:31:41 +0200 | [diff] [blame] | 339 | HA_RWLOCK_WRTOSK(TASK_WQ_LOCK, &wq_lock); |
Emeric Brun | c60def8 | 2017-09-27 14:59:38 +0200 | [diff] [blame] | 340 | goto lookup_next; |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 341 | } |
Willy Tarreau | 77015ab | 2020-06-19 11:50:27 +0200 | [diff] [blame] | 342 | else { |
| 343 | /* task not expired and correctly placed */ |
| 344 | break; |
| 345 | } |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 346 | } |
Willy Tarreau | 9789f7b | 2008-06-24 08:17:16 +0200 | [diff] [blame] | 347 | |
Willy Tarreau | d48ed66 | 2020-10-16 09:31:41 +0200 | [diff] [blame] | 348 | HA_RWLOCK_SKUNLOCK(TASK_WQ_LOCK, &wq_lock); |
Willy Tarreau | b20aa9e | 2018-10-15 14:52:21 +0200 | [diff] [blame] | 349 | #endif |
Willy Tarreau | 1e928c0 | 2019-05-28 18:57:25 +0200 | [diff] [blame] | 350 | leave: |
Willy Tarreau | c49ba52 | 2019-12-11 08:12:23 +0100 | [diff] [blame] | 351 | return; |
| 352 | } |
| 353 | |
| 354 | /* Checks the next timer for the current thread by looking into its own timer |
| 355 | * list and the global one. It may return TICK_ETERNITY if no timer is present. |
Ilya Shipitsin | 856aabc | 2020-04-16 23:51:34 +0500 | [diff] [blame] | 356 | * Note that the next timer might very well be slightly in the past. |
Willy Tarreau | c49ba52 | 2019-12-11 08:12:23 +0100 | [diff] [blame] | 357 | */ |
| 358 | int next_timer_expiry() |
| 359 | { |
| 360 | struct task_per_thread * const tt = sched; // thread's tasks |
| 361 | struct eb32_node *eb; |
| 362 | int ret = TICK_ETERNITY; |
Willy Tarreau | 6ce0232 | 2020-08-21 05:48:34 +0200 | [diff] [blame] | 363 | __decl_thread(int key = TICK_ETERNITY); |
Willy Tarreau | c49ba52 | 2019-12-11 08:12:23 +0100 | [diff] [blame] | 364 | |
| 365 | /* first check in the thread-local timers */ |
| 366 | eb = eb32_lookup_ge(&tt->timers, now_ms - TIMER_LOOK_BACK); |
| 367 | if (!eb) { |
| 368 | /* we might have reached the end of the tree, typically because |
| 369 | * <now_ms> is in the first half and we're first scanning the last |
| 370 | * half. Let's loop back to the beginning of the tree now. |
| 371 | */ |
| 372 | eb = eb32_first(&tt->timers); |
| 373 | } |
| 374 | |
| 375 | if (eb) |
| 376 | ret = eb->key; |
| 377 | |
| 378 | #ifdef USE_THREAD |
| 379 | if (!eb_is_empty(&timers)) { |
| 380 | HA_RWLOCK_RDLOCK(TASK_WQ_LOCK, &wq_lock); |
| 381 | eb = eb32_lookup_ge(&timers, now_ms - TIMER_LOOK_BACK); |
| 382 | if (!eb) |
| 383 | eb = eb32_first(&timers); |
| 384 | if (eb) |
| 385 | key = eb->key; |
| 386 | HA_RWLOCK_RDUNLOCK(TASK_WQ_LOCK, &wq_lock); |
| 387 | if (eb) |
| 388 | ret = tick_first(ret, key); |
| 389 | } |
| 390 | #endif |
Willy Tarreau | b992ba1 | 2017-11-05 19:09:27 +0100 | [diff] [blame] | 391 | return ret; |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 392 | } |
| 393 | |
Willy Tarreau | 59153fe | 2020-06-24 10:17:29 +0200 | [diff] [blame] | 394 | /* Walks over tasklet lists sched->tasklets[0..TL_CLASSES-1] and run at most |
| 395 | * budget[TL_*] of them. Returns the number of entries effectively processed |
| 396 | * (tasks and tasklets merged). The count of tasks in the list for the current |
| 397 | * thread is adjusted. |
Willy Tarreau | 4ffa0b5 | 2020-01-30 18:13:13 +0100 | [diff] [blame] | 398 | */ |
Willy Tarreau | 59153fe | 2020-06-24 10:17:29 +0200 | [diff] [blame] | 399 | unsigned int run_tasks_from_lists(unsigned int budgets[]) |
Willy Tarreau | 4ffa0b5 | 2020-01-30 18:13:13 +0100 | [diff] [blame] | 400 | { |
| 401 | struct task *(*process)(struct task *t, void *ctx, unsigned short state); |
Willy Tarreau | ba48d5c | 2020-06-24 09:54:24 +0200 | [diff] [blame] | 402 | struct list *tl_queues = sched->tasklets; |
Willy Tarreau | 4ffa0b5 | 2020-01-30 18:13:13 +0100 | [diff] [blame] | 403 | struct task *t; |
Willy Tarreau | e7723bd | 2020-06-24 11:11:02 +0200 | [diff] [blame] | 404 | uint8_t budget_mask = (1 << TL_CLASSES) - 1; |
Willy Tarreau | 59153fe | 2020-06-24 10:17:29 +0200 | [diff] [blame] | 405 | unsigned int done = 0; |
| 406 | unsigned int queue; |
Willy Tarreau | 4ffa0b5 | 2020-01-30 18:13:13 +0100 | [diff] [blame] | 407 | unsigned short state; |
| 408 | void *ctx; |
Willy Tarreau | 59153fe | 2020-06-24 10:17:29 +0200 | [diff] [blame] | 409 | |
| 410 | for (queue = 0; queue < TL_CLASSES;) { |
| 411 | sched->current_queue = queue; |
Willy Tarreau | 4ffa0b5 | 2020-01-30 18:13:13 +0100 | [diff] [blame] | 412 | |
Willy Tarreau | e7723bd | 2020-06-24 11:11:02 +0200 | [diff] [blame] | 413 | /* global.tune.sched.low-latency is set */ |
| 414 | if (global.tune.options & GTUNE_SCHED_LOW_LATENCY) { |
| 415 | if (unlikely(sched->tl_class_mask & budget_mask & ((1 << queue) - 1))) { |
| 416 | /* a lower queue index has tasks again and still has a |
| 417 | * budget to run them. Let's switch to it now. |
| 418 | */ |
| 419 | queue = (sched->tl_class_mask & 1) ? 0 : |
| 420 | (sched->tl_class_mask & 2) ? 1 : 2; |
| 421 | continue; |
| 422 | } |
| 423 | |
| 424 | if (unlikely(queue > TL_URGENT && |
| 425 | budget_mask & (1 << TL_URGENT) && |
| 426 | !MT_LIST_ISEMPTY(&sched->shared_tasklet_list))) { |
| 427 | /* an urgent tasklet arrived from another thread */ |
| 428 | break; |
| 429 | } |
| 430 | |
| 431 | if (unlikely(queue > TL_NORMAL && |
| 432 | budget_mask & (1 << TL_NORMAL) && |
| 433 | ((sched->rqueue_size > 0) || |
| 434 | (global_tasks_mask & tid_bit)))) { |
| 435 | /* a task was woken up by a bulk tasklet or another thread */ |
| 436 | break; |
| 437 | } |
| 438 | } |
| 439 | |
Willy Tarreau | ba48d5c | 2020-06-24 09:54:24 +0200 | [diff] [blame] | 440 | if (LIST_ISEMPTY(&tl_queues[queue])) { |
| 441 | sched->tl_class_mask &= ~(1 << queue); |
Willy Tarreau | 59153fe | 2020-06-24 10:17:29 +0200 | [diff] [blame] | 442 | queue++; |
| 443 | continue; |
Willy Tarreau | ba48d5c | 2020-06-24 09:54:24 +0200 | [diff] [blame] | 444 | } |
| 445 | |
Willy Tarreau | 59153fe | 2020-06-24 10:17:29 +0200 | [diff] [blame] | 446 | if (!budgets[queue]) { |
Willy Tarreau | e7723bd | 2020-06-24 11:11:02 +0200 | [diff] [blame] | 447 | budget_mask &= ~(1 << queue); |
Willy Tarreau | 59153fe | 2020-06-24 10:17:29 +0200 | [diff] [blame] | 448 | queue++; |
| 449 | continue; |
| 450 | } |
Willy Tarreau | ba48d5c | 2020-06-24 09:54:24 +0200 | [diff] [blame] | 451 | |
Willy Tarreau | 59153fe | 2020-06-24 10:17:29 +0200 | [diff] [blame] | 452 | budgets[queue]--; |
Willy Tarreau | ba48d5c | 2020-06-24 09:54:24 +0200 | [diff] [blame] | 453 | t = (struct task *)LIST_ELEM(tl_queues[queue].n, struct tasklet *, list); |
Willy Tarreau | 8a6049c | 2020-06-30 11:48:48 +0200 | [diff] [blame] | 454 | state = t->state & (TASK_SHARED_WQ|TASK_SELF_WAKING|TASK_KILLED); |
Willy Tarreau | 4ffa0b5 | 2020-01-30 18:13:13 +0100 | [diff] [blame] | 455 | |
| 456 | ti->flags &= ~TI_FL_STUCK; // this thread is still running |
| 457 | activity[tid].ctxsw++; |
| 458 | ctx = t->context; |
| 459 | process = t->process; |
| 460 | t->calls++; |
Willy Tarreau | d23d413 | 2020-01-31 10:39:03 +0100 | [diff] [blame] | 461 | sched->current = t; |
Willy Tarreau | 4ffa0b5 | 2020-01-30 18:13:13 +0100 | [diff] [blame] | 462 | |
| 463 | if (TASK_IS_TASKLET(t)) { |
Willy Tarreau | 952c264 | 2020-01-31 16:39:30 +0100 | [diff] [blame] | 464 | state = _HA_ATOMIC_XCHG(&t->state, state); |
| 465 | __ha_barrier_atomic_store(); |
| 466 | __tasklet_remove_from_tasklet_list((struct tasklet *)t); |
Olivier Houchard | c62d9ab | 2020-03-17 18:15:04 +0100 | [diff] [blame] | 467 | process(t, ctx, state); |
Willy Tarreau | 4ffa0b5 | 2020-01-30 18:13:13 +0100 | [diff] [blame] | 468 | done++; |
Willy Tarreau | d23d413 | 2020-01-31 10:39:03 +0100 | [diff] [blame] | 469 | sched->current = NULL; |
| 470 | __ha_barrier_store(); |
Willy Tarreau | 4ffa0b5 | 2020-01-30 18:13:13 +0100 | [diff] [blame] | 471 | continue; |
| 472 | } |
| 473 | |
Willy Tarreau | 952c264 | 2020-01-31 16:39:30 +0100 | [diff] [blame] | 474 | state = _HA_ATOMIC_XCHG(&t->state, state | TASK_RUNNING); |
| 475 | __ha_barrier_atomic_store(); |
| 476 | __tasklet_remove_from_tasklet_list((struct tasklet *)t); |
| 477 | |
Willy Tarreau | 4ffa0b5 | 2020-01-30 18:13:13 +0100 | [diff] [blame] | 478 | /* OK then this is a regular task */ |
| 479 | |
Willy Tarreau | d99177f | 2020-06-30 11:48:48 +0200 | [diff] [blame] | 480 | _HA_ATOMIC_SUB(&task_per_thread[tid].task_list_size, 1); |
Willy Tarreau | 4ffa0b5 | 2020-01-30 18:13:13 +0100 | [diff] [blame] | 481 | if (unlikely(t->call_date)) { |
| 482 | uint64_t now_ns = now_mono_time(); |
| 483 | |
| 484 | t->lat_time += now_ns - t->call_date; |
| 485 | t->call_date = now_ns; |
| 486 | } |
| 487 | |
Willy Tarreau | 4ffa0b5 | 2020-01-30 18:13:13 +0100 | [diff] [blame] | 488 | __ha_barrier_store(); |
Willy Tarreau | 8a6049c | 2020-06-30 11:48:48 +0200 | [diff] [blame] | 489 | |
| 490 | /* Note for below: if TASK_KILLED arrived before we've read the state, we |
| 491 | * directly free the task. Otherwise it will be seen after processing and |
| 492 | * it's freed on the exit path. |
| 493 | */ |
| 494 | if (likely(!(state & TASK_KILLED) && process == process_stream)) |
Willy Tarreau | 4ffa0b5 | 2020-01-30 18:13:13 +0100 | [diff] [blame] | 495 | t = process_stream(t, ctx, state); |
Willy Tarreau | 8a6049c | 2020-06-30 11:48:48 +0200 | [diff] [blame] | 496 | else if (!(state & TASK_KILLED) && process != NULL) |
Willy Tarreau | 4ffa0b5 | 2020-01-30 18:13:13 +0100 | [diff] [blame] | 497 | t = process(t, ctx, state); |
| 498 | else { |
Willy Tarreau | 273aea4 | 2020-07-17 14:37:51 +0200 | [diff] [blame] | 499 | task_unlink_wq(t); |
Willy Tarreau | 4ffa0b5 | 2020-01-30 18:13:13 +0100 | [diff] [blame] | 500 | __task_free(t); |
| 501 | sched->current = NULL; |
| 502 | __ha_barrier_store(); |
| 503 | /* We don't want max_processed to be decremented if |
| 504 | * we're just freeing a destroyed task, we should only |
| 505 | * do so if we really ran a task. |
| 506 | */ |
| 507 | continue; |
| 508 | } |
| 509 | sched->current = NULL; |
| 510 | __ha_barrier_store(); |
| 511 | /* If there is a pending state we have to wake up the task |
| 512 | * immediately, else we defer it into wait queue |
| 513 | */ |
| 514 | if (t != NULL) { |
| 515 | if (unlikely(t->call_date)) { |
| 516 | t->cpu_time += now_mono_time() - t->call_date; |
| 517 | t->call_date = 0; |
| 518 | } |
| 519 | |
| 520 | state = _HA_ATOMIC_AND(&t->state, ~TASK_RUNNING); |
Willy Tarreau | 8a6049c | 2020-06-30 11:48:48 +0200 | [diff] [blame] | 521 | if (unlikely(state & TASK_KILLED)) { |
Willy Tarreau | 273aea4 | 2020-07-17 14:37:51 +0200 | [diff] [blame] | 522 | task_unlink_wq(t); |
Willy Tarreau | 8a6049c | 2020-06-30 11:48:48 +0200 | [diff] [blame] | 523 | __task_free(t); |
| 524 | } |
| 525 | else if (state & TASK_WOKEN_ANY) |
Willy Tarreau | 4ffa0b5 | 2020-01-30 18:13:13 +0100 | [diff] [blame] | 526 | task_wakeup(t, 0); |
| 527 | else |
| 528 | task_queue(t); |
| 529 | } |
| 530 | done++; |
| 531 | } |
Willy Tarreau | ba48d5c | 2020-06-24 09:54:24 +0200 | [diff] [blame] | 532 | sched->current_queue = -1; |
Willy Tarreau | 116ef22 | 2020-06-23 16:35:38 +0200 | [diff] [blame] | 533 | |
Willy Tarreau | 4ffa0b5 | 2020-01-30 18:13:13 +0100 | [diff] [blame] | 534 | return done; |
| 535 | } |
| 536 | |
Willy Tarreau | 58b458d | 2008-06-29 22:40:23 +0200 | [diff] [blame] | 537 | /* The run queue is chronologically sorted in a tree. An insertion counter is |
| 538 | * used to assign a position to each task. This counter may be combined with |
| 539 | * other variables (eg: nice value) to set the final position in the tree. The |
| 540 | * counter may wrap without a problem, of course. We then limit the number of |
Christopher Faulet | 8a48f67 | 2017-11-14 10:38:36 +0100 | [diff] [blame] | 541 | * tasks processed to 200 in any case, so that general latency remains low and |
Willy Tarreau | cde7902 | 2019-04-12 18:03:41 +0200 | [diff] [blame] | 542 | * so that task positions have a chance to be considered. The function scans |
| 543 | * both the global and local run queues and picks the most urgent task between |
| 544 | * the two. We need to grab the global runqueue lock to touch it so it's taken |
| 545 | * on the very first access to the global run queue and is released as soon as |
| 546 | * it reaches the end. |
Willy Tarreau | 58b458d | 2008-06-29 22:40:23 +0200 | [diff] [blame] | 547 | * |
| 548 | * The function adjusts <next> if a new event is closer. |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 549 | */ |
Thierry FOURNIER | 9cf7c4b | 2014-12-15 13:26:01 +0100 | [diff] [blame] | 550 | void process_runnable_tasks() |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 551 | { |
Willy Tarreau | d022e9c | 2019-09-24 08:25:15 +0200 | [diff] [blame] | 552 | struct task_per_thread * const tt = sched; |
Willy Tarreau | 3ef7a19 | 2020-06-24 07:21:08 +0200 | [diff] [blame] | 553 | struct eb32sc_node *lrq; // next local run queue entry |
| 554 | struct eb32sc_node *grq; // next global run queue entry |
Willy Tarreau | 964c936 | 2007-01-07 00:38:00 +0100 | [diff] [blame] | 555 | struct task *t; |
Willy Tarreau | 3ef7a19 | 2020-06-24 07:21:08 +0200 | [diff] [blame] | 556 | const unsigned int default_weights[TL_CLASSES] = { |
| 557 | [TL_URGENT] = 64, // ~50% of CPU bandwidth for I/O |
| 558 | [TL_NORMAL] = 48, // ~37% of CPU bandwidth for tasks |
| 559 | [TL_BULK] = 16, // ~13% of CPU bandwidth for self-wakers |
| 560 | }; |
| 561 | unsigned int max[TL_CLASSES]; // max to be run per class |
| 562 | unsigned int max_total; // sum of max above |
Olivier Houchard | 0691046 | 2019-10-11 16:35:01 +0200 | [diff] [blame] | 563 | struct mt_list *tmp_list; |
Willy Tarreau | 3ef7a19 | 2020-06-24 07:21:08 +0200 | [diff] [blame] | 564 | unsigned int queue; |
| 565 | int max_processed; |
Christopher Faulet | 3911ee8 | 2017-11-14 10:26:53 +0100 | [diff] [blame] | 566 | |
Willy Tarreau | e6a02fa | 2019-05-22 07:06:44 +0200 | [diff] [blame] | 567 | ti->flags &= ~TI_FL_STUCK; // this thread is still running |
| 568 | |
Willy Tarreau | 3ef7a19 | 2020-06-24 07:21:08 +0200 | [diff] [blame] | 569 | if (!thread_has_tasks()) { |
| 570 | activity[tid].empty_rq++; |
| 571 | return; |
| 572 | } |
| 573 | |
Willy Tarreau | 5c8be27 | 2020-06-19 12:17:55 +0200 | [diff] [blame] | 574 | tasks_run_queue_cur = tasks_run_queue; /* keep a copy for reporting */ |
| 575 | nb_tasks_cur = nb_tasks; |
| 576 | max_processed = global.tune.runqueue_depth; |
| 577 | |
| 578 | if (likely(niced_tasks)) |
| 579 | max_processed = (max_processed + 3) / 4; |
| 580 | |
Willy Tarreau | 5c8be27 | 2020-06-19 12:17:55 +0200 | [diff] [blame] | 581 | not_done_yet: |
Willy Tarreau | 3ef7a19 | 2020-06-24 07:21:08 +0200 | [diff] [blame] | 582 | max[TL_URGENT] = max[TL_NORMAL] = max[TL_BULK] = 0; |
Willy Tarreau | cde7902 | 2019-04-12 18:03:41 +0200 | [diff] [blame] | 583 | |
Willy Tarreau | 3ef7a19 | 2020-06-24 07:21:08 +0200 | [diff] [blame] | 584 | /* urgent tasklets list gets a default weight of ~50% */ |
Willy Tarreau | 49f90bf | 2020-06-24 09:39:48 +0200 | [diff] [blame] | 585 | if ((tt->tl_class_mask & (1 << TL_URGENT)) || |
Willy Tarreau | 3ef7a19 | 2020-06-24 07:21:08 +0200 | [diff] [blame] | 586 | !MT_LIST_ISEMPTY(&tt->shared_tasklet_list)) |
| 587 | max[TL_URGENT] = default_weights[TL_URGENT]; |
Willy Tarreau | a62917b | 2020-01-30 18:37:28 +0100 | [diff] [blame] | 588 | |
Willy Tarreau | 3ef7a19 | 2020-06-24 07:21:08 +0200 | [diff] [blame] | 589 | /* normal tasklets list gets a default weight of ~37% */ |
Willy Tarreau | 49f90bf | 2020-06-24 09:39:48 +0200 | [diff] [blame] | 590 | if ((tt->tl_class_mask & (1 << TL_NORMAL)) || |
Willy Tarreau | 3ef7a19 | 2020-06-24 07:21:08 +0200 | [diff] [blame] | 591 | (sched->rqueue_size > 0) || (global_tasks_mask & tid_bit)) |
| 592 | max[TL_NORMAL] = default_weights[TL_NORMAL]; |
Willy Tarreau | a62917b | 2020-01-30 18:37:28 +0100 | [diff] [blame] | 593 | |
Willy Tarreau | 3ef7a19 | 2020-06-24 07:21:08 +0200 | [diff] [blame] | 594 | /* bulk tasklets list gets a default weight of ~13% */ |
Willy Tarreau | 49f90bf | 2020-06-24 09:39:48 +0200 | [diff] [blame] | 595 | if ((tt->tl_class_mask & (1 << TL_BULK))) |
Willy Tarreau | 3ef7a19 | 2020-06-24 07:21:08 +0200 | [diff] [blame] | 596 | max[TL_BULK] = default_weights[TL_BULK]; |
| 597 | |
| 598 | /* Now compute a fair share of the weights. Total may slightly exceed |
Willy Tarreau | 1553b66 | 2020-06-30 13:46:21 +0200 | [diff] [blame] | 599 | * 100% due to rounding, this is not a problem. Note that while in |
| 600 | * theory the sum cannot be NULL as we cannot get there without tasklets |
| 601 | * to process, in practice it seldom happens when multiple writers |
Willy Tarreau | de4db17 | 2020-07-10 08:10:29 +0200 | [diff] [blame] | 602 | * conflict and rollback on MT_LIST_TRY_ADDQ(shared_tasklet_list), causing |
Willy Tarreau | 1553b66 | 2020-06-30 13:46:21 +0200 | [diff] [blame] | 603 | * a first MT_LIST_ISEMPTY() to succeed for thread_has_task() and the |
| 604 | * one above to finally fail. This is extremely rare and not a problem. |
Willy Tarreau | 3ef7a19 | 2020-06-24 07:21:08 +0200 | [diff] [blame] | 605 | */ |
| 606 | max_total = max[TL_URGENT] + max[TL_NORMAL] + max[TL_BULK]; |
Willy Tarreau | 1553b66 | 2020-06-30 13:46:21 +0200 | [diff] [blame] | 607 | if (!max_total) |
| 608 | return; |
| 609 | |
Willy Tarreau | 3ef7a19 | 2020-06-24 07:21:08 +0200 | [diff] [blame] | 610 | for (queue = 0; queue < TL_CLASSES; queue++) |
| 611 | max[queue] = ((unsigned)max_processed * max[queue] + max_total - 1) / max_total; |
| 612 | |
| 613 | lrq = grq = NULL; |
Christopher Faulet | 8a48f67 | 2017-11-14 10:38:36 +0100 | [diff] [blame] | 614 | |
Willy Tarreau | 3ef7a19 | 2020-06-24 07:21:08 +0200 | [diff] [blame] | 615 | /* pick up to max[TL_NORMAL] regular tasks from prio-ordered run queues */ |
| 616 | /* Note: the grq lock is always held when grq is not null */ |
| 617 | while (tt->task_list_size < max[TL_NORMAL]) { |
Willy Tarreau | cde7902 | 2019-04-12 18:03:41 +0200 | [diff] [blame] | 618 | if ((global_tasks_mask & tid_bit) && !grq) { |
Willy Tarreau | 3466e3c | 2019-04-15 18:52:40 +0200 | [diff] [blame] | 619 | #ifdef USE_THREAD |
Willy Tarreau | cde7902 | 2019-04-12 18:03:41 +0200 | [diff] [blame] | 620 | HA_SPIN_LOCK(TASK_RQ_LOCK, &rq_lock); |
| 621 | grq = eb32sc_lookup_ge(&rqueue, rqueue_ticks - TIMER_LOOK_BACK, tid_bit); |
| 622 | if (unlikely(!grq)) { |
| 623 | grq = eb32sc_first(&rqueue, tid_bit); |
| 624 | if (!grq) { |
Olivier Houchard | de82aea | 2019-04-17 19:10:22 +0200 | [diff] [blame] | 625 | global_tasks_mask &= ~tid_bit; |
Willy Tarreau | cde7902 | 2019-04-12 18:03:41 +0200 | [diff] [blame] | 626 | HA_SPIN_UNLOCK(TASK_RQ_LOCK, &rq_lock); |
Olivier Houchard | c4aac9e | 2018-07-26 15:25:49 +0200 | [diff] [blame] | 627 | } |
Willy Tarreau | f0c531a | 2017-11-05 16:35:59 +0100 | [diff] [blame] | 628 | } |
Willy Tarreau | 3466e3c | 2019-04-15 18:52:40 +0200 | [diff] [blame] | 629 | #endif |
Willy Tarreau | cde7902 | 2019-04-12 18:03:41 +0200 | [diff] [blame] | 630 | } |
Willy Tarreau | f0c531a | 2017-11-05 16:35:59 +0100 | [diff] [blame] | 631 | |
Willy Tarreau | cde7902 | 2019-04-12 18:03:41 +0200 | [diff] [blame] | 632 | /* If a global task is available for this thread, it's in grq |
| 633 | * now and the global RQ is locked. |
| 634 | */ |
Olivier Houchard | f6e6dc1 | 2018-05-18 18:38:23 +0200 | [diff] [blame] | 635 | |
Willy Tarreau | cde7902 | 2019-04-12 18:03:41 +0200 | [diff] [blame] | 636 | if (!lrq) { |
Willy Tarreau | 4c1e1ad | 2019-09-24 07:19:08 +0200 | [diff] [blame] | 637 | lrq = eb32sc_lookup_ge(&tt->rqueue, rqueue_ticks - TIMER_LOOK_BACK, tid_bit); |
Willy Tarreau | cde7902 | 2019-04-12 18:03:41 +0200 | [diff] [blame] | 638 | if (unlikely(!lrq)) |
Willy Tarreau | 4c1e1ad | 2019-09-24 07:19:08 +0200 | [diff] [blame] | 639 | lrq = eb32sc_first(&tt->rqueue, tid_bit); |
Willy Tarreau | f0c531a | 2017-11-05 16:35:59 +0100 | [diff] [blame] | 640 | } |
Willy Tarreau | f0c531a | 2017-11-05 16:35:59 +0100 | [diff] [blame] | 641 | |
Willy Tarreau | cde7902 | 2019-04-12 18:03:41 +0200 | [diff] [blame] | 642 | if (!lrq && !grq) |
| 643 | break; |
| 644 | |
| 645 | if (likely(!grq || (lrq && (int)(lrq->key - grq->key) <= 0))) { |
| 646 | t = eb32sc_entry(lrq, struct task, rq); |
| 647 | lrq = eb32sc_next(lrq, tid_bit); |
| 648 | __task_unlink_rq(t); |
Olivier Houchard | f6e6dc1 | 2018-05-18 18:38:23 +0200 | [diff] [blame] | 649 | } |
Willy Tarreau | 3466e3c | 2019-04-15 18:52:40 +0200 | [diff] [blame] | 650 | #ifdef USE_THREAD |
Willy Tarreau | cde7902 | 2019-04-12 18:03:41 +0200 | [diff] [blame] | 651 | else { |
| 652 | t = eb32sc_entry(grq, struct task, rq); |
| 653 | grq = eb32sc_next(grq, tid_bit); |
| 654 | __task_unlink_rq(t); |
| 655 | if (unlikely(!grq)) { |
| 656 | grq = eb32sc_first(&rqueue, tid_bit); |
| 657 | if (!grq) { |
Olivier Houchard | de82aea | 2019-04-17 19:10:22 +0200 | [diff] [blame] | 658 | global_tasks_mask &= ~tid_bit; |
Willy Tarreau | cde7902 | 2019-04-12 18:03:41 +0200 | [diff] [blame] | 659 | HA_SPIN_UNLOCK(TASK_RQ_LOCK, &rq_lock); |
Willy Tarreau | cde7902 | 2019-04-12 18:03:41 +0200 | [diff] [blame] | 660 | } |
| 661 | } |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 662 | } |
Willy Tarreau | 3466e3c | 2019-04-15 18:52:40 +0200 | [diff] [blame] | 663 | #endif |
Willy Tarreau | cde7902 | 2019-04-12 18:03:41 +0200 | [diff] [blame] | 664 | |
Olivier Houchard | ff1e9f3 | 2019-09-20 17:18:35 +0200 | [diff] [blame] | 665 | /* Make sure the entry doesn't appear to be in a list */ |
Olivier Houchard | 0691046 | 2019-10-11 16:35:01 +0200 | [diff] [blame] | 666 | LIST_INIT(&((struct tasklet *)t)->list); |
Olivier Houchard | b0bdae7 | 2018-05-18 18:45:28 +0200 | [diff] [blame] | 667 | /* And add it to the local task list */ |
Willy Tarreau | a62917b | 2020-01-30 18:37:28 +0100 | [diff] [blame] | 668 | tasklet_insert_into_tasklet_list(&tt->tasklets[TL_NORMAL], (struct tasklet *)t); |
Willy Tarreau | 49f90bf | 2020-06-24 09:39:48 +0200 | [diff] [blame] | 669 | tt->tl_class_mask |= 1 << TL_NORMAL; |
Willy Tarreau | d99177f | 2020-06-30 11:48:48 +0200 | [diff] [blame] | 670 | _HA_ATOMIC_ADD(&tt->task_list_size, 1); |
Willy Tarreau | bc13bec | 2019-04-30 14:55:18 +0200 | [diff] [blame] | 671 | activity[tid].tasksw++; |
Olivier Houchard | b0bdae7 | 2018-05-18 18:45:28 +0200 | [diff] [blame] | 672 | } |
Willy Tarreau | cde7902 | 2019-04-12 18:03:41 +0200 | [diff] [blame] | 673 | |
| 674 | /* release the rqueue lock */ |
| 675 | if (grq) { |
| 676 | HA_SPIN_UNLOCK(TASK_RQ_LOCK, &rq_lock); |
| 677 | grq = NULL; |
| 678 | } |
| 679 | |
Willy Tarreau | 3ef7a19 | 2020-06-24 07:21:08 +0200 | [diff] [blame] | 680 | /* Merge the list of tasklets waken up by other threads to the |
| 681 | * main list. |
| 682 | */ |
| 683 | tmp_list = MT_LIST_BEHEAD(&tt->shared_tasklet_list); |
Willy Tarreau | 49f90bf | 2020-06-24 09:39:48 +0200 | [diff] [blame] | 684 | if (tmp_list) { |
Willy Tarreau | 3ef7a19 | 2020-06-24 07:21:08 +0200 | [diff] [blame] | 685 | LIST_SPLICE_END_DETACHED(&tt->tasklets[TL_URGENT], (struct list *)tmp_list); |
Willy Tarreau | 49f90bf | 2020-06-24 09:39:48 +0200 | [diff] [blame] | 686 | if (!LIST_ISEMPTY(&tt->tasklets[TL_URGENT])) |
| 687 | tt->tl_class_mask |= 1 << TL_URGENT; |
| 688 | } |
Willy Tarreau | cde7902 | 2019-04-12 18:03:41 +0200 | [diff] [blame] | 689 | |
Willy Tarreau | 3ef7a19 | 2020-06-24 07:21:08 +0200 | [diff] [blame] | 690 | /* execute tasklets in each queue */ |
Willy Tarreau | 59153fe | 2020-06-24 10:17:29 +0200 | [diff] [blame] | 691 | max_processed -= run_tasks_from_lists(max); |
Willy Tarreau | a62917b | 2020-01-30 18:37:28 +0100 | [diff] [blame] | 692 | |
Willy Tarreau | 5c8be27 | 2020-06-19 12:17:55 +0200 | [diff] [blame] | 693 | /* some tasks may have woken other ones up */ |
Willy Tarreau | 0c0c85e | 2020-06-23 11:32:35 +0200 | [diff] [blame] | 694 | if (max_processed > 0 && thread_has_tasks()) |
Willy Tarreau | 5c8be27 | 2020-06-19 12:17:55 +0200 | [diff] [blame] | 695 | goto not_done_yet; |
| 696 | |
Willy Tarreau | 49f90bf | 2020-06-24 09:39:48 +0200 | [diff] [blame] | 697 | if (tt->tl_class_mask) |
Willy Tarreau | cde7902 | 2019-04-12 18:03:41 +0200 | [diff] [blame] | 698 | activity[tid].long_rq++; |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 699 | } |
| 700 | |
Willy Tarreau | 64e6012 | 2019-07-12 08:31:17 +0200 | [diff] [blame] | 701 | /* create a work list array for <nbthread> threads, using tasks made of |
| 702 | * function <fct>. The context passed to the function will be the pointer to |
| 703 | * the thread's work list, which will contain a copy of argument <arg>. The |
| 704 | * wake up reason will be TASK_WOKEN_OTHER. The pointer to the work_list array |
| 705 | * is returned on success, otherwise NULL on failure. |
| 706 | */ |
| 707 | struct work_list *work_list_create(int nbthread, |
| 708 | struct task *(*fct)(struct task *, void *, unsigned short), |
| 709 | void *arg) |
| 710 | { |
| 711 | struct work_list *wl; |
| 712 | int i; |
| 713 | |
| 714 | wl = calloc(nbthread, sizeof(*wl)); |
| 715 | if (!wl) |
| 716 | goto fail; |
| 717 | |
| 718 | for (i = 0; i < nbthread; i++) { |
Olivier Houchard | 859dc80 | 2019-08-08 15:47:21 +0200 | [diff] [blame] | 719 | MT_LIST_INIT(&wl[i].head); |
Willy Tarreau | 64e6012 | 2019-07-12 08:31:17 +0200 | [diff] [blame] | 720 | wl[i].task = task_new(1UL << i); |
| 721 | if (!wl[i].task) |
| 722 | goto fail; |
| 723 | wl[i].task->process = fct; |
| 724 | wl[i].task->context = &wl[i]; |
| 725 | wl[i].arg = arg; |
| 726 | } |
| 727 | return wl; |
| 728 | |
| 729 | fail: |
| 730 | work_list_destroy(wl, nbthread); |
| 731 | return NULL; |
| 732 | } |
| 733 | |
| 734 | /* destroy work list <work> */ |
| 735 | void work_list_destroy(struct work_list *work, int nbthread) |
| 736 | { |
| 737 | int t; |
| 738 | |
| 739 | if (!work) |
| 740 | return; |
| 741 | for (t = 0; t < nbthread; t++) |
| 742 | task_destroy(work[t].task); |
| 743 | free(work); |
| 744 | } |
| 745 | |
William Lallemand | 27f3fa5 | 2018-12-06 14:05:20 +0100 | [diff] [blame] | 746 | /* |
| 747 | * Delete every tasks before running the master polling loop |
| 748 | */ |
| 749 | void mworker_cleantasks() |
| 750 | { |
| 751 | struct task *t; |
| 752 | int i; |
William Lallemand | b582339 | 2018-12-06 15:14:37 +0100 | [diff] [blame] | 753 | struct eb32_node *tmp_wq = NULL; |
| 754 | struct eb32sc_node *tmp_rq = NULL; |
William Lallemand | 27f3fa5 | 2018-12-06 14:05:20 +0100 | [diff] [blame] | 755 | |
| 756 | #ifdef USE_THREAD |
| 757 | /* cleanup the global run queue */ |
William Lallemand | b582339 | 2018-12-06 15:14:37 +0100 | [diff] [blame] | 758 | tmp_rq = eb32sc_first(&rqueue, MAX_THREADS_MASK); |
| 759 | while (tmp_rq) { |
| 760 | t = eb32sc_entry(tmp_rq, struct task, rq); |
| 761 | tmp_rq = eb32sc_next(tmp_rq, MAX_THREADS_MASK); |
Olivier Houchard | 3f795f7 | 2019-04-17 22:51:06 +0200 | [diff] [blame] | 762 | task_destroy(t); |
William Lallemand | 27f3fa5 | 2018-12-06 14:05:20 +0100 | [diff] [blame] | 763 | } |
| 764 | /* cleanup the timers queue */ |
William Lallemand | b582339 | 2018-12-06 15:14:37 +0100 | [diff] [blame] | 765 | tmp_wq = eb32_first(&timers); |
| 766 | while (tmp_wq) { |
| 767 | t = eb32_entry(tmp_wq, struct task, wq); |
| 768 | tmp_wq = eb32_next(tmp_wq); |
Olivier Houchard | 3f795f7 | 2019-04-17 22:51:06 +0200 | [diff] [blame] | 769 | task_destroy(t); |
William Lallemand | 27f3fa5 | 2018-12-06 14:05:20 +0100 | [diff] [blame] | 770 | } |
| 771 | #endif |
| 772 | /* clean the per thread run queue */ |
| 773 | for (i = 0; i < global.nbthread; i++) { |
William Lallemand | b582339 | 2018-12-06 15:14:37 +0100 | [diff] [blame] | 774 | tmp_rq = eb32sc_first(&task_per_thread[i].rqueue, MAX_THREADS_MASK); |
| 775 | while (tmp_rq) { |
| 776 | t = eb32sc_entry(tmp_rq, struct task, rq); |
| 777 | tmp_rq = eb32sc_next(tmp_rq, MAX_THREADS_MASK); |
Olivier Houchard | 3f795f7 | 2019-04-17 22:51:06 +0200 | [diff] [blame] | 778 | task_destroy(t); |
William Lallemand | 27f3fa5 | 2018-12-06 14:05:20 +0100 | [diff] [blame] | 779 | } |
| 780 | /* cleanup the per thread timers queue */ |
William Lallemand | b582339 | 2018-12-06 15:14:37 +0100 | [diff] [blame] | 781 | tmp_wq = eb32_first(&task_per_thread[i].timers); |
| 782 | while (tmp_wq) { |
| 783 | t = eb32_entry(tmp_wq, struct task, wq); |
| 784 | tmp_wq = eb32_next(tmp_wq); |
Olivier Houchard | 3f795f7 | 2019-04-17 22:51:06 +0200 | [diff] [blame] | 785 | task_destroy(t); |
William Lallemand | 27f3fa5 | 2018-12-06 14:05:20 +0100 | [diff] [blame] | 786 | } |
| 787 | } |
| 788 | } |
| 789 | |
Willy Tarreau | b6b3df3 | 2018-11-26 16:31:20 +0100 | [diff] [blame] | 790 | /* perform minimal intializations */ |
| 791 | static void init_task() |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 792 | { |
Olivier Houchard | f6e6dc1 | 2018-05-18 18:38:23 +0200 | [diff] [blame] | 793 | int i; |
| 794 | |
Olivier Houchard | b1ca58b | 2018-06-06 14:22:03 +0200 | [diff] [blame] | 795 | #ifdef USE_THREAD |
Willy Tarreau | b20aa9e | 2018-10-15 14:52:21 +0200 | [diff] [blame] | 796 | memset(&timers, 0, sizeof(timers)); |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 797 | memset(&rqueue, 0, sizeof(rqueue)); |
Olivier Houchard | b1ca58b | 2018-06-06 14:22:03 +0200 | [diff] [blame] | 798 | #endif |
Willy Tarreau | 8d8747a | 2018-10-15 16:12:48 +0200 | [diff] [blame] | 799 | memset(&task_per_thread, 0, sizeof(task_per_thread)); |
Olivier Houchard | b0bdae7 | 2018-05-18 18:45:28 +0200 | [diff] [blame] | 800 | for (i = 0; i < MAX_THREADS; i++) { |
Willy Tarreau | a62917b | 2020-01-30 18:37:28 +0100 | [diff] [blame] | 801 | LIST_INIT(&task_per_thread[i].tasklets[TL_URGENT]); |
| 802 | LIST_INIT(&task_per_thread[i].tasklets[TL_NORMAL]); |
| 803 | LIST_INIT(&task_per_thread[i].tasklets[TL_BULK]); |
Olivier Houchard | 0691046 | 2019-10-11 16:35:01 +0200 | [diff] [blame] | 804 | MT_LIST_INIT(&task_per_thread[i].shared_tasklet_list); |
Olivier Houchard | b0bdae7 | 2018-05-18 18:45:28 +0200 | [diff] [blame] | 805 | } |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 806 | } |
| 807 | |
Willy Tarreau | e7723bd | 2020-06-24 11:11:02 +0200 | [diff] [blame] | 808 | /* config parser for global "tune.sched.low-latency", accepts "on" or "off" */ |
| 809 | static int cfg_parse_tune_sched_low_latency(char **args, int section_type, struct proxy *curpx, |
| 810 | struct proxy *defpx, const char *file, int line, |
| 811 | char **err) |
| 812 | { |
| 813 | if (too_many_args(1, args, err, NULL)) |
| 814 | return -1; |
| 815 | |
| 816 | if (strcmp(args[1], "on") == 0) |
| 817 | global.tune.options |= GTUNE_SCHED_LOW_LATENCY; |
| 818 | else if (strcmp(args[1], "off") == 0) |
| 819 | global.tune.options &= ~GTUNE_SCHED_LOW_LATENCY; |
| 820 | else { |
| 821 | memprintf(err, "'%s' expects either 'on' or 'off' but got '%s'.", args[0], args[1]); |
| 822 | return -1; |
| 823 | } |
| 824 | return 0; |
| 825 | } |
| 826 | |
| 827 | /* config keyword parsers */ |
| 828 | static struct cfg_kw_list cfg_kws = {ILH, { |
| 829 | { CFG_GLOBAL, "tune.sched.low-latency", cfg_parse_tune_sched_low_latency }, |
| 830 | { 0, NULL, NULL } |
| 831 | }}; |
| 832 | |
| 833 | INITCALL1(STG_REGISTER, cfg_register_keywords, &cfg_kws); |
Willy Tarreau | b6b3df3 | 2018-11-26 16:31:20 +0100 | [diff] [blame] | 834 | INITCALL0(STG_PREPARE, init_task); |
| 835 | |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 836 | /* |
| 837 | * Local variables: |
| 838 | * c-indent-level: 8 |
| 839 | * c-basic-offset: 8 |
| 840 | * End: |
| 841 | */ |