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 | 2dd0d47 | 2006-06-29 17:53:05 +0200 | [diff] [blame] | 15 | #include <common/config.h> |
Willy Tarreau | c6ca1a0 | 2007-05-13 19:43:47 +0200 | [diff] [blame] | 16 | #include <common/memory.h> |
Willy Tarreau | 2dd0d47 | 2006-06-29 17:53:05 +0200 | [diff] [blame] | 17 | #include <common/mini-clist.h> |
Willy Tarreau | 96bcfd7 | 2007-04-29 10:41:56 +0200 | [diff] [blame] | 18 | #include <common/standard.h> |
Willy Tarreau | a6a6a93 | 2007-04-28 22:40:08 +0200 | [diff] [blame] | 19 | #include <common/time.h> |
Willy Tarreau | 8d38805 | 2017-11-05 13:34:20 +0100 | [diff] [blame] | 20 | #include <eb32sctree.h> |
Willy Tarreau | 45cb4fb | 2009-10-26 21:10:04 +0100 | [diff] [blame] | 21 | #include <eb32tree.h> |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 22 | |
Willy Tarreau | d825eef | 2007-05-12 22:35:00 +0200 | [diff] [blame] | 23 | #include <proto/proxy.h> |
Willy Tarreau | 87b0966 | 2015-04-03 00:22:06 +0200 | [diff] [blame] | 24 | #include <proto/stream.h> |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 25 | #include <proto/task.h> |
| 26 | |
Willy Tarreau | bafbe01 | 2017-11-24 17:34:44 +0100 | [diff] [blame] | 27 | struct pool_head *pool_head_task; |
Willy Tarreau | 96bcfd7 | 2007-04-29 10:41:56 +0200 | [diff] [blame] | 28 | |
Thierry FOURNIER | d697596 | 2017-07-12 14:31:10 +0200 | [diff] [blame] | 29 | /* This is the memory pool containing all the signal structs. These |
| 30 | * struct are used to store each requiered signal between two tasks. |
| 31 | */ |
Willy Tarreau | bafbe01 | 2017-11-24 17:34:44 +0100 | [diff] [blame] | 32 | struct pool_head *pool_head_notification; |
Thierry FOURNIER | d697596 | 2017-07-12 14:31:10 +0200 | [diff] [blame] | 33 | |
Willy Tarreau | a461318 | 2009-03-21 18:13:21 +0100 | [diff] [blame] | 34 | unsigned int nb_tasks = 0; |
Christopher Faulet | 3911ee8 | 2017-11-14 10:26:53 +0100 | [diff] [blame] | 35 | unsigned long active_tasks_mask = 0; /* Mask of threads with active tasks */ |
Christopher Faulet | 34c5cc9 | 2016-12-06 09:15:30 +0100 | [diff] [blame] | 36 | unsigned int tasks_run_queue = 0; |
| 37 | 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] | 38 | unsigned int nb_tasks_cur = 0; /* copy of the tasks count */ |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 39 | 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] | 40 | |
Willy Tarreau | 6d1222c | 2017-11-26 10:08:06 +0100 | [diff] [blame] | 41 | THREAD_LOCAL struct task *curr_task = NULL; /* task currently running or NULL */ |
Olivier Houchard | 9b36cb4 | 2018-05-04 15:46:16 +0200 | [diff] [blame] | 42 | THREAD_LOCAL struct eb32sc_node *rq_next = NULL; /* Next task to be potentially run */ |
Willy Tarreau | 6d1222c | 2017-11-26 10:08:06 +0100 | [diff] [blame] | 43 | |
Willy Tarreau | a24d1d0 | 2017-11-26 10:19:16 +0100 | [diff] [blame] | 44 | __decl_hathreads(HA_SPINLOCK_T __attribute__((aligned(64))) rq_lock); /* spin lock related to run queue */ |
| 45 | __decl_hathreads(HA_SPINLOCK_T __attribute__((aligned(64))) wq_lock); /* spin lock related to wait queue */ |
Willy Tarreau | 964c936 | 2007-01-07 00:38:00 +0100 | [diff] [blame] | 46 | |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 47 | static struct eb_root timers; /* sorted timers tree */ |
| 48 | static struct eb_root rqueue; /* tree constituting the run queue */ |
| 49 | static unsigned int rqueue_ticks; /* insertion count */ |
Willy Tarreau | 9789f7b | 2008-06-24 08:17:16 +0200 | [diff] [blame] | 50 | |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 51 | /* Puts the task <t> in run queue at a position depending on t->nice. <t> is |
| 52 | * 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] | 53 | * nice value of -1024 sets the task to -tasks_run_queue*32, while a nice value |
| 54 | * of 1024 sets the task to tasks_run_queue*32. The state flags are cleared, so |
| 55 | * the caller will have to set its flags after this call. |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 56 | * The task must not already be in the run queue. If unsure, use the safer |
| 57 | * task_wakeup() function. |
Willy Tarreau | 91e9993 | 2008-06-30 07:51:00 +0200 | [diff] [blame] | 58 | */ |
Willy Tarreau | 4df8206 | 2008-08-29 15:26:14 +0200 | [diff] [blame] | 59 | struct task *__task_wakeup(struct task *t) |
Willy Tarreau | e33aece | 2007-04-30 13:15:14 +0200 | [diff] [blame] | 60 | { |
Christopher Faulet | 34c5cc9 | 2016-12-06 09:15:30 +0100 | [diff] [blame] | 61 | tasks_run_queue++; |
Christopher Faulet | 3911ee8 | 2017-11-14 10:26:53 +0100 | [diff] [blame] | 62 | active_tasks_mask |= t->thread_mask; |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 63 | t->rq.key = ++rqueue_ticks; |
Willy Tarreau | 91e9993 | 2008-06-30 07:51:00 +0200 | [diff] [blame] | 64 | |
| 65 | if (likely(t->nice)) { |
| 66 | int offset; |
| 67 | |
| 68 | niced_tasks++; |
| 69 | if (likely(t->nice > 0)) |
Christopher Faulet | 34c5cc9 | 2016-12-06 09:15:30 +0100 | [diff] [blame] | 70 | offset = (unsigned)((tasks_run_queue * (unsigned int)t->nice) / 32U); |
Willy Tarreau | 91e9993 | 2008-06-30 07:51:00 +0200 | [diff] [blame] | 71 | else |
Christopher Faulet | 34c5cc9 | 2016-12-06 09:15:30 +0100 | [diff] [blame] | 72 | offset = -(unsigned)((tasks_run_queue * (unsigned int)-t->nice) / 32U); |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 73 | t->rq.key += offset; |
Willy Tarreau | 91e9993 | 2008-06-30 07:51:00 +0200 | [diff] [blame] | 74 | } |
| 75 | |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 76 | /* reset flag to pending ones |
| 77 | * Note: __task_wakeup must not be called |
| 78 | * if task is running |
| 79 | */ |
| 80 | t->state = t->pending_state; |
Willy Tarreau | 8d38805 | 2017-11-05 13:34:20 +0100 | [diff] [blame] | 81 | eb32sc_insert(&rqueue, &t->rq, t->thread_mask); |
Willy Tarreau | 58b458d | 2008-06-29 22:40:23 +0200 | [diff] [blame] | 82 | return t; |
Willy Tarreau | e33aece | 2007-04-30 13:15:14 +0200 | [diff] [blame] | 83 | } |
Willy Tarreau | d825eef | 2007-05-12 22:35:00 +0200 | [diff] [blame] | 84 | |
Willy Tarreau | 96bcfd7 | 2007-04-29 10:41:56 +0200 | [diff] [blame] | 85 | /* |
Willy Tarreau | 531cf0c | 2009-03-08 16:35:27 +0100 | [diff] [blame] | 86 | * __task_queue() |
Willy Tarreau | 96bcfd7 | 2007-04-29 10:41:56 +0200 | [diff] [blame] | 87 | * |
| 88 | * Inserts a task into the wait queue at the position given by its expiration |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 89 | * 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] | 90 | * 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] | 91 | * Last, tasks must not be queued further than the end of the tree, which is |
| 92 | * 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] | 93 | * |
| 94 | * This function should not be used directly, it is meant to be called by the |
| 95 | * inline version of task_queue() which performs a few cheap preliminary tests |
| 96 | * before deciding to call __task_queue(). |
Willy Tarreau | 96bcfd7 | 2007-04-29 10:41:56 +0200 | [diff] [blame] | 97 | */ |
Willy Tarreau | 531cf0c | 2009-03-08 16:35:27 +0100 | [diff] [blame] | 98 | void __task_queue(struct task *task) |
Willy Tarreau | 964c936 | 2007-01-07 00:38:00 +0100 | [diff] [blame] | 99 | { |
Willy Tarreau | 531cf0c | 2009-03-08 16:35:27 +0100 | [diff] [blame] | 100 | if (likely(task_in_wq(task))) |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 101 | __task_unlink_wq(task); |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 102 | |
| 103 | /* the task is not in the queue now */ |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 104 | task->wq.key = task->expire; |
Willy Tarreau | 28c41a4 | 2008-06-29 17:00:59 +0200 | [diff] [blame] | 105 | #ifdef DEBUG_CHECK_INVALID_EXPIRATION_DATES |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 106 | if (tick_is_lt(task->wq.key, now_ms)) |
Willy Tarreau | 28c41a4 | 2008-06-29 17:00:59 +0200 | [diff] [blame] | 107 | /* we're queuing too far away or in the past (most likely) */ |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 108 | return; |
Willy Tarreau | 28c41a4 | 2008-06-29 17:00:59 +0200 | [diff] [blame] | 109 | #endif |
Willy Tarreau | ce44f12 | 2008-07-05 18:16:19 +0200 | [diff] [blame] | 110 | |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 111 | eb32_insert(&timers, &task->wq); |
SaVaGe | 1d7a420 | 2009-10-06 18:53:37 +0300 | [diff] [blame] | 112 | |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 113 | return; |
Willy Tarreau | 964c936 | 2007-01-07 00:38:00 +0100 | [diff] [blame] | 114 | } |
| 115 | |
Willy Tarreau | 96bcfd7 | 2007-04-29 10:41:56 +0200 | [diff] [blame] | 116 | /* |
Willy Tarreau | 9789f7b | 2008-06-24 08:17:16 +0200 | [diff] [blame] | 117 | * Extract all expired timers from the timer queue, and wakes up all |
Thierry FOURNIER | 9cf7c4b | 2014-12-15 13:26:01 +0100 | [diff] [blame] | 118 | * associated tasks. Returns the date of next event (or eternity). |
Willy Tarreau | 96bcfd7 | 2007-04-29 10:41:56 +0200 | [diff] [blame] | 119 | */ |
Thierry FOURNIER | 9cf7c4b | 2014-12-15 13:26:01 +0100 | [diff] [blame] | 120 | int wake_expired_tasks() |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 121 | { |
Willy Tarreau | 96bcfd7 | 2007-04-29 10:41:56 +0200 | [diff] [blame] | 122 | struct task *task; |
Willy Tarreau | 9789f7b | 2008-06-24 08:17:16 +0200 | [diff] [blame] | 123 | struct eb32_node *eb; |
Willy Tarreau | b992ba1 | 2017-11-05 19:09:27 +0100 | [diff] [blame] | 124 | int ret = TICK_ETERNITY; |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 125 | |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 126 | while (1) { |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 127 | HA_SPIN_LOCK(TASK_WQ_LOCK, &wq_lock); |
Emeric Brun | c60def8 | 2017-09-27 14:59:38 +0200 | [diff] [blame] | 128 | lookup_next: |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 129 | eb = eb32_lookup_ge(&timers, now_ms - TIMER_LOOK_BACK); |
Emeric Brun | c60def8 | 2017-09-27 14:59:38 +0200 | [diff] [blame] | 130 | if (!eb) { |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 131 | /* we might have reached the end of the tree, typically because |
| 132 | * <now_ms> is in the first half and we're first scanning the last |
| 133 | * half. Let's loop back to the beginning of the tree now. |
| 134 | */ |
| 135 | eb = eb32_first(&timers); |
Willy Tarreau | b992ba1 | 2017-11-05 19:09:27 +0100 | [diff] [blame] | 136 | if (likely(!eb)) |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 137 | break; |
| 138 | } |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 139 | |
Willy Tarreau | b992ba1 | 2017-11-05 19:09:27 +0100 | [diff] [blame] | 140 | if (tick_is_lt(now_ms, eb->key)) { |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 141 | /* timer not expired yet, revisit it later */ |
Willy Tarreau | b992ba1 | 2017-11-05 19:09:27 +0100 | [diff] [blame] | 142 | ret = eb->key; |
| 143 | break; |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 144 | } |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 145 | |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 146 | /* timer looks expired, detach it from the queue */ |
| 147 | task = eb32_entry(eb, struct task, wq); |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 148 | __task_unlink_wq(task); |
Willy Tarreau | 4136522 | 2009-03-08 07:46:27 +0100 | [diff] [blame] | 149 | |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 150 | /* It is possible that this task was left at an earlier place in the |
| 151 | * tree because a recent call to task_queue() has not moved it. This |
| 152 | * happens when the new expiration date is later than the old one. |
| 153 | * Since it is very unlikely that we reach a timeout anyway, it's a |
| 154 | * lot cheaper to proceed like this because we almost never update |
| 155 | * the tree. We may also find disabled expiration dates there. Since |
| 156 | * we have detached the task from the tree, we simply call task_queue |
Willy Tarreau | 814c978 | 2009-07-14 23:48:55 +0200 | [diff] [blame] | 157 | * to take care of this. Note that we might occasionally requeue it at |
| 158 | * the same place, before <eb>, so we have to check if this happens, |
| 159 | * and adjust <eb>, otherwise we may skip it which is not what we want. |
Willy Tarreau | 34e98ea | 2009-08-09 09:09:54 +0200 | [diff] [blame] | 160 | * We may also not requeue the task (and not point eb at it) if its |
| 161 | * expiration time is not set. |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 162 | */ |
| 163 | if (!tick_is_expired(task->expire, now_ms)) { |
Willy Tarreau | b992ba1 | 2017-11-05 19:09:27 +0100 | [diff] [blame] | 164 | if (tick_isset(task->expire)) |
| 165 | __task_queue(task); |
Emeric Brun | c60def8 | 2017-09-27 14:59:38 +0200 | [diff] [blame] | 166 | goto lookup_next; |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 167 | } |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 168 | task_wakeup(task, TASK_WOKEN_TIMER); |
Willy Tarreau | 5175345 | 2017-11-23 18:36:50 +0100 | [diff] [blame] | 169 | HA_SPIN_UNLOCK(TASK_WQ_LOCK, &wq_lock); |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 170 | } |
Willy Tarreau | 9789f7b | 2008-06-24 08:17:16 +0200 | [diff] [blame] | 171 | |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 172 | HA_SPIN_UNLOCK(TASK_WQ_LOCK, &wq_lock); |
Willy Tarreau | b992ba1 | 2017-11-05 19:09:27 +0100 | [diff] [blame] | 173 | return ret; |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 174 | } |
| 175 | |
Willy Tarreau | 58b458d | 2008-06-29 22:40:23 +0200 | [diff] [blame] | 176 | /* The run queue is chronologically sorted in a tree. An insertion counter is |
| 177 | * used to assign a position to each task. This counter may be combined with |
| 178 | * other variables (eg: nice value) to set the final position in the tree. The |
| 179 | * 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] | 180 | * tasks processed to 200 in any case, so that general latency remains low and |
| 181 | * so that task positions have a chance to be considered. |
Willy Tarreau | 58b458d | 2008-06-29 22:40:23 +0200 | [diff] [blame] | 182 | * |
| 183 | * The function adjusts <next> if a new event is closer. |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 184 | */ |
Thierry FOURNIER | 9cf7c4b | 2014-12-15 13:26:01 +0100 | [diff] [blame] | 185 | void process_runnable_tasks() |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 186 | { |
Willy Tarreau | 964c936 | 2007-01-07 00:38:00 +0100 | [diff] [blame] | 187 | struct task *t; |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 188 | int i; |
| 189 | int max_processed; |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 190 | struct task *local_tasks[16]; |
| 191 | int local_tasks_count; |
Willy Tarreau | 9d4b56b | 2017-11-06 08:36:53 +0100 | [diff] [blame] | 192 | int final_tasks_count; |
Christopher Faulet | 3911ee8 | 2017-11-14 10:26:53 +0100 | [diff] [blame] | 193 | |
Christopher Faulet | 34c5cc9 | 2016-12-06 09:15:30 +0100 | [diff] [blame] | 194 | tasks_run_queue_cur = tasks_run_queue; /* keep a copy for reporting */ |
Willy Tarreau | c7bdf09 | 2009-03-21 18:33:52 +0100 | [diff] [blame] | 195 | nb_tasks_cur = nb_tasks; |
Christopher Faulet | 8a48f67 | 2017-11-14 10:38:36 +0100 | [diff] [blame] | 196 | max_processed = 200; |
Willy Tarreau | f0c531a | 2017-11-05 16:35:59 +0100 | [diff] [blame] | 197 | if (unlikely(global.nbthread <= 1)) { |
| 198 | /* when no lock is needed, this loop is much faster */ |
Willy Tarreau | d80cb4e | 2018-01-20 19:30:13 +0100 | [diff] [blame] | 199 | if (!(active_tasks_mask & tid_bit)) { |
| 200 | activity[tid].empty_rq++; |
Christopher Faulet | 8a48f67 | 2017-11-14 10:38:36 +0100 | [diff] [blame] | 201 | return; |
Willy Tarreau | d80cb4e | 2018-01-20 19:30:13 +0100 | [diff] [blame] | 202 | } |
Christopher Faulet | 8a48f67 | 2017-11-14 10:38:36 +0100 | [diff] [blame] | 203 | |
Christopher Faulet | 3911ee8 | 2017-11-14 10:26:53 +0100 | [diff] [blame] | 204 | active_tasks_mask &= ~tid_bit; |
Willy Tarreau | f0c531a | 2017-11-05 16:35:59 +0100 | [diff] [blame] | 205 | rq_next = eb32sc_lookup_ge(&rqueue, rqueue_ticks - TIMER_LOOK_BACK, tid_bit); |
| 206 | while (1) { |
| 207 | if (!rq_next) { |
| 208 | /* we might have reached the end of the tree, typically because |
| 209 | * <rqueue_ticks> is in the first half and we're first scanning |
| 210 | * the last half. Let's loop back to the beginning of the tree now. |
| 211 | */ |
| 212 | rq_next = eb32sc_first(&rqueue, tid_bit); |
| 213 | if (!rq_next) |
| 214 | break; |
| 215 | } |
| 216 | |
| 217 | t = eb32sc_entry(rq_next, struct task, rq); |
| 218 | rq_next = eb32sc_next(rq_next, tid_bit); |
| 219 | __task_unlink_rq(t); |
| 220 | t->state |= TASK_RUNNING; |
| 221 | t->pending_state = 0; |
| 222 | |
| 223 | t->calls++; |
Willy Tarreau | 6d1222c | 2017-11-26 10:08:06 +0100 | [diff] [blame] | 224 | curr_task = t; |
Willy Tarreau | f0c531a | 2017-11-05 16:35:59 +0100 | [diff] [blame] | 225 | /* This is an optimisation to help the processor's branch |
| 226 | * predictor take this most common call. |
| 227 | */ |
| 228 | if (likely(t->process == process_stream)) |
| 229 | t = process_stream(t); |
Olivier Houchard | 9b36cb4 | 2018-05-04 15:46:16 +0200 | [diff] [blame] | 230 | else { |
| 231 | if (t->process != NULL) |
| 232 | t = t->process(t); |
| 233 | else { |
| 234 | __task_free(t); |
| 235 | t = NULL; |
| 236 | } |
| 237 | } |
Willy Tarreau | 6d1222c | 2017-11-26 10:08:06 +0100 | [diff] [blame] | 238 | curr_task = NULL; |
Willy Tarreau | f0c531a | 2017-11-05 16:35:59 +0100 | [diff] [blame] | 239 | |
| 240 | if (likely(t != NULL)) { |
| 241 | t->state &= ~TASK_RUNNING; |
| 242 | /* If there is a pending state |
| 243 | * we have to wake up the task |
| 244 | * immediatly, else we defer |
| 245 | * it into wait queue |
| 246 | */ |
| 247 | if (t->pending_state) |
| 248 | __task_wakeup(t); |
| 249 | else |
| 250 | task_queue(t); |
| 251 | } |
| 252 | |
| 253 | max_processed--; |
Christopher Faulet | 3911ee8 | 2017-11-14 10:26:53 +0100 | [diff] [blame] | 254 | if (max_processed <= 0) { |
| 255 | active_tasks_mask |= tid_bit; |
Willy Tarreau | d80cb4e | 2018-01-20 19:30:13 +0100 | [diff] [blame] | 256 | activity[tid].long_rq++; |
Willy Tarreau | f0c531a | 2017-11-05 16:35:59 +0100 | [diff] [blame] | 257 | break; |
Christopher Faulet | 3911ee8 | 2017-11-14 10:26:53 +0100 | [diff] [blame] | 258 | } |
Willy Tarreau | f0c531a | 2017-11-05 16:35:59 +0100 | [diff] [blame] | 259 | } |
| 260 | return; |
| 261 | } |
| 262 | |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 263 | HA_SPIN_LOCK(TASK_RQ_LOCK, &rq_lock); |
Christopher Faulet | 8a48f67 | 2017-11-14 10:38:36 +0100 | [diff] [blame] | 264 | if (!(active_tasks_mask & tid_bit)) { |
| 265 | HA_SPIN_UNLOCK(TASK_RQ_LOCK, &rq_lock); |
Willy Tarreau | d80cb4e | 2018-01-20 19:30:13 +0100 | [diff] [blame] | 266 | activity[tid].empty_rq++; |
Christopher Faulet | 8a48f67 | 2017-11-14 10:38:36 +0100 | [diff] [blame] | 267 | return; |
| 268 | } |
| 269 | |
Christopher Faulet | 3911ee8 | 2017-11-14 10:26:53 +0100 | [diff] [blame] | 270 | active_tasks_mask &= ~tid_bit; |
| 271 | while (1) { |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 272 | /* Note: this loop is one of the fastest code path in |
| 273 | * the whole program. It should not be re-arranged |
| 274 | * without a good reason. |
| 275 | */ |
Willy Tarreau | 9e45b33 | 2017-11-08 14:05:19 +0100 | [diff] [blame] | 276 | |
| 277 | /* we have to restart looking up after every batch */ |
| 278 | rq_next = eb32sc_lookup_ge(&rqueue, rqueue_ticks - TIMER_LOOK_BACK, tid_bit); |
Willy Tarreau | ce4e0aa | 2017-11-05 23:57:00 +0100 | [diff] [blame] | 279 | for (local_tasks_count = 0; local_tasks_count < 16; local_tasks_count++) { |
| 280 | if (unlikely(!rq_next)) { |
| 281 | /* either we just started or we reached the end |
| 282 | * of the tree, typically because <rqueue_ticks> |
| 283 | * is in the first half and we're first scanning |
| 284 | * the last half. Let's loop back to the beginning |
| 285 | * of the tree now. |
| 286 | */ |
Christopher Faulet | 919b739 | 2017-11-14 10:17:48 +0100 | [diff] [blame] | 287 | rq_next = eb32sc_first(&rqueue, tid_bit); |
| 288 | if (!rq_next) |
| 289 | break; |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 290 | } |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 291 | |
Willy Tarreau | 8d38805 | 2017-11-05 13:34:20 +0100 | [diff] [blame] | 292 | t = eb32sc_entry(rq_next, struct task, rq); |
| 293 | rq_next = eb32sc_next(rq_next, tid_bit); |
Willy Tarreau | ce4e0aa | 2017-11-05 23:57:00 +0100 | [diff] [blame] | 294 | |
| 295 | /* detach the task from the queue */ |
| 296 | __task_unlink_rq(t); |
| 297 | local_tasks[local_tasks_count] = t; |
| 298 | t->state |= TASK_RUNNING; |
| 299 | t->pending_state = 0; |
| 300 | t->calls++; |
| 301 | max_processed--; |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 302 | } |
Willy Tarreau | 58b458d | 2008-06-29 22:40:23 +0200 | [diff] [blame] | 303 | |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 304 | if (!local_tasks_count) |
| 305 | break; |
Willy Tarreau | 58b458d | 2008-06-29 22:40:23 +0200 | [diff] [blame] | 306 | |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 307 | HA_SPIN_UNLOCK(TASK_RQ_LOCK, &rq_lock); |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 308 | |
Willy Tarreau | 9d4b56b | 2017-11-06 08:36:53 +0100 | [diff] [blame] | 309 | final_tasks_count = 0; |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 310 | for (i = 0; i < local_tasks_count ; i++) { |
| 311 | t = local_tasks[i]; |
| 312 | /* This is an optimisation to help the processor's branch |
| 313 | * predictor take this most common call. |
| 314 | */ |
Willy Tarreau | 6d1222c | 2017-11-26 10:08:06 +0100 | [diff] [blame] | 315 | curr_task = t; |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 316 | if (likely(t->process == process_stream)) |
| 317 | t = process_stream(t); |
Olivier Houchard | 9b36cb4 | 2018-05-04 15:46:16 +0200 | [diff] [blame] | 318 | else { |
| 319 | if (t->process != NULL) |
| 320 | t = t->process(t); |
| 321 | else { |
| 322 | __task_free(t); |
| 323 | t = NULL; |
| 324 | } |
| 325 | } |
Willy Tarreau | 6d1222c | 2017-11-26 10:08:06 +0100 | [diff] [blame] | 326 | curr_task = NULL; |
Willy Tarreau | 9d4b56b | 2017-11-06 08:36:53 +0100 | [diff] [blame] | 327 | if (t) |
| 328 | local_tasks[final_tasks_count++] = t; |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 329 | } |
Willy Tarreau | 531cf0c | 2009-03-08 16:35:27 +0100 | [diff] [blame] | 330 | |
Willy Tarreau | 9d4b56b | 2017-11-06 08:36:53 +0100 | [diff] [blame] | 331 | for (i = 0; i < final_tasks_count ; i++) { |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 332 | t = local_tasks[i]; |
Willy Tarreau | 9d4b56b | 2017-11-06 08:36:53 +0100 | [diff] [blame] | 333 | /* If there is a pending state |
| 334 | * we have to wake up the task |
| 335 | * immediatly, else we defer |
| 336 | * it into wait queue |
| 337 | */ |
Willy Tarreau | 5175345 | 2017-11-23 18:36:50 +0100 | [diff] [blame] | 338 | HA_SPIN_LOCK(TASK_RQ_LOCK, &rq_lock); |
| 339 | t->state &= ~TASK_RUNNING; |
| 340 | if (t->pending_state) { |
Willy Tarreau | 9d4b56b | 2017-11-06 08:36:53 +0100 | [diff] [blame] | 341 | __task_wakeup(t); |
Willy Tarreau | 5175345 | 2017-11-23 18:36:50 +0100 | [diff] [blame] | 342 | HA_SPIN_UNLOCK(TASK_RQ_LOCK, &rq_lock); |
| 343 | } |
| 344 | else { |
| 345 | /* we must never hold the RQ lock before the WQ lock */ |
| 346 | HA_SPIN_UNLOCK(TASK_RQ_LOCK, &rq_lock); |
Willy Tarreau | 9d4b56b | 2017-11-06 08:36:53 +0100 | [diff] [blame] | 347 | task_queue(t); |
Willy Tarreau | 5175345 | 2017-11-23 18:36:50 +0100 | [diff] [blame] | 348 | } |
Willy Tarreau | 58b458d | 2008-06-29 22:40:23 +0200 | [diff] [blame] | 349 | } |
Willy Tarreau | ce4e0aa | 2017-11-05 23:57:00 +0100 | [diff] [blame] | 350 | |
Willy Tarreau | 5175345 | 2017-11-23 18:36:50 +0100 | [diff] [blame] | 351 | HA_SPIN_LOCK(TASK_RQ_LOCK, &rq_lock); |
Christopher Faulet | 3911ee8 | 2017-11-14 10:26:53 +0100 | [diff] [blame] | 352 | if (max_processed <= 0) { |
| 353 | active_tasks_mask |= tid_bit; |
Willy Tarreau | d80cb4e | 2018-01-20 19:30:13 +0100 | [diff] [blame] | 354 | activity[tid].long_rq++; |
Christopher Faulet | 3911ee8 | 2017-11-14 10:26:53 +0100 | [diff] [blame] | 355 | break; |
| 356 | } |
| 357 | } |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 358 | HA_SPIN_UNLOCK(TASK_RQ_LOCK, &rq_lock); |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 359 | } |
| 360 | |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 361 | /* perform minimal intializations, report 0 in case of error, 1 if OK. */ |
| 362 | int init_task() |
| 363 | { |
| 364 | memset(&timers, 0, sizeof(timers)); |
| 365 | memset(&rqueue, 0, sizeof(rqueue)); |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 366 | HA_SPIN_INIT(&wq_lock); |
| 367 | HA_SPIN_INIT(&rq_lock); |
Willy Tarreau | bafbe01 | 2017-11-24 17:34:44 +0100 | [diff] [blame] | 368 | pool_head_task = create_pool("task", sizeof(struct task), MEM_F_SHARED); |
| 369 | if (!pool_head_task) |
Thierry FOURNIER | d697596 | 2017-07-12 14:31:10 +0200 | [diff] [blame] | 370 | return 0; |
Willy Tarreau | bafbe01 | 2017-11-24 17:34:44 +0100 | [diff] [blame] | 371 | pool_head_notification = create_pool("notification", sizeof(struct notification), MEM_F_SHARED); |
| 372 | if (!pool_head_notification) |
Thierry FOURNIER | d697596 | 2017-07-12 14:31:10 +0200 | [diff] [blame] | 373 | return 0; |
| 374 | return 1; |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 375 | } |
| 376 | |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 377 | /* |
| 378 | * Local variables: |
| 379 | * c-indent-level: 8 |
| 380 | * c-basic-offset: 8 |
| 381 | * End: |
| 382 | */ |