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