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 | 45cb4fb | 2009-10-26 21:10:04 +0100 | [diff] [blame] | 20 | #include <eb32tree.h> |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 21 | |
Willy Tarreau | d825eef | 2007-05-12 22:35:00 +0200 | [diff] [blame] | 22 | #include <proto/proxy.h> |
Willy Tarreau | 87b0966 | 2015-04-03 00:22:06 +0200 | [diff] [blame] | 23 | #include <proto/stream.h> |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 24 | #include <proto/task.h> |
| 25 | |
Willy Tarreau | 9789f7b | 2008-06-24 08:17:16 +0200 | [diff] [blame] | 26 | struct pool_head *pool2_task; |
Willy Tarreau | 96bcfd7 | 2007-04-29 10:41:56 +0200 | [diff] [blame] | 27 | |
Willy Tarreau | a461318 | 2009-03-21 18:13:21 +0100 | [diff] [blame] | 28 | unsigned int nb_tasks = 0; |
Christopher Faulet | 34c5cc9 | 2016-12-06 09:15:30 +0100 | [diff] [blame] | 29 | unsigned int tasks_run_queue = 0; |
| 30 | 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] | 31 | unsigned int nb_tasks_cur = 0; /* copy of the tasks count */ |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 32 | 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] | 33 | |
Willy Tarreau | 964c936 | 2007-01-07 00:38:00 +0100 | [diff] [blame] | 34 | |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 35 | static struct eb_root timers; /* sorted timers tree */ |
| 36 | static struct eb_root rqueue; /* tree constituting the run queue */ |
| 37 | static unsigned int rqueue_ticks; /* insertion count */ |
Willy Tarreau | 9789f7b | 2008-06-24 08:17:16 +0200 | [diff] [blame] | 38 | |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 39 | /* Puts the task <t> in run queue at a position depending on t->nice. <t> is |
| 40 | * 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] | 41 | * nice value of -1024 sets the task to -tasks_run_queue*32, while a nice value |
| 42 | * of 1024 sets the task to tasks_run_queue*32. The state flags are cleared, so |
| 43 | * the caller will have to set its flags after this call. |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 44 | * The task must not already be in the run queue. If unsure, use the safer |
| 45 | * task_wakeup() function. |
Willy Tarreau | 91e9993 | 2008-06-30 07:51:00 +0200 | [diff] [blame] | 46 | */ |
Willy Tarreau | 4df8206 | 2008-08-29 15:26:14 +0200 | [diff] [blame] | 47 | struct task *__task_wakeup(struct task *t) |
Willy Tarreau | e33aece | 2007-04-30 13:15:14 +0200 | [diff] [blame] | 48 | { |
Christopher Faulet | 34c5cc9 | 2016-12-06 09:15:30 +0100 | [diff] [blame] | 49 | tasks_run_queue++; |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 50 | t->rq.key = ++rqueue_ticks; |
Willy Tarreau | 91e9993 | 2008-06-30 07:51:00 +0200 | [diff] [blame] | 51 | |
| 52 | if (likely(t->nice)) { |
| 53 | int offset; |
| 54 | |
| 55 | niced_tasks++; |
| 56 | if (likely(t->nice > 0)) |
Christopher Faulet | 34c5cc9 | 2016-12-06 09:15:30 +0100 | [diff] [blame] | 57 | offset = (unsigned)((tasks_run_queue * (unsigned int)t->nice) / 32U); |
Willy Tarreau | 91e9993 | 2008-06-30 07:51:00 +0200 | [diff] [blame] | 58 | else |
Christopher Faulet | 34c5cc9 | 2016-12-06 09:15:30 +0100 | [diff] [blame] | 59 | offset = -(unsigned)((tasks_run_queue * (unsigned int)-t->nice) / 32U); |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 60 | t->rq.key += offset; |
Willy Tarreau | 91e9993 | 2008-06-30 07:51:00 +0200 | [diff] [blame] | 61 | } |
| 62 | |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 63 | /* reset flag to pending ones |
| 64 | * Note: __task_wakeup must not be called |
| 65 | * if task is running |
| 66 | */ |
| 67 | t->state = t->pending_state; |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 68 | eb32_insert(&rqueue, &t->rq); |
Willy Tarreau | 58b458d | 2008-06-29 22:40:23 +0200 | [diff] [blame] | 69 | return t; |
Willy Tarreau | e33aece | 2007-04-30 13:15:14 +0200 | [diff] [blame] | 70 | } |
Willy Tarreau | d825eef | 2007-05-12 22:35:00 +0200 | [diff] [blame] | 71 | |
Willy Tarreau | 96bcfd7 | 2007-04-29 10:41:56 +0200 | [diff] [blame] | 72 | /* |
Willy Tarreau | 531cf0c | 2009-03-08 16:35:27 +0100 | [diff] [blame] | 73 | * __task_queue() |
Willy Tarreau | 96bcfd7 | 2007-04-29 10:41:56 +0200 | [diff] [blame] | 74 | * |
| 75 | * 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] | 76 | * 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] | 77 | * 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] | 78 | * Last, tasks must not be queued further than the end of the tree, which is |
| 79 | * 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] | 80 | * |
| 81 | * This function should not be used directly, it is meant to be called by the |
| 82 | * inline version of task_queue() which performs a few cheap preliminary tests |
| 83 | * before deciding to call __task_queue(). |
Willy Tarreau | 96bcfd7 | 2007-04-29 10:41:56 +0200 | [diff] [blame] | 84 | */ |
Willy Tarreau | 531cf0c | 2009-03-08 16:35:27 +0100 | [diff] [blame] | 85 | void __task_queue(struct task *task) |
Willy Tarreau | 964c936 | 2007-01-07 00:38:00 +0100 | [diff] [blame] | 86 | { |
Willy Tarreau | 531cf0c | 2009-03-08 16:35:27 +0100 | [diff] [blame] | 87 | if (likely(task_in_wq(task))) |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 88 | __task_unlink_wq(task); |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 89 | |
| 90 | /* the task is not in the queue now */ |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 91 | task->wq.key = task->expire; |
Willy Tarreau | 28c41a4 | 2008-06-29 17:00:59 +0200 | [diff] [blame] | 92 | #ifdef DEBUG_CHECK_INVALID_EXPIRATION_DATES |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 93 | if (tick_is_lt(task->wq.key, now_ms)) |
Willy Tarreau | 28c41a4 | 2008-06-29 17:00:59 +0200 | [diff] [blame] | 94 | /* we're queuing too far away or in the past (most likely) */ |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 95 | return; |
Willy Tarreau | 28c41a4 | 2008-06-29 17:00:59 +0200 | [diff] [blame] | 96 | #endif |
Willy Tarreau | ce44f12 | 2008-07-05 18:16:19 +0200 | [diff] [blame] | 97 | |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 98 | eb32_insert(&timers, &task->wq); |
SaVaGe | 1d7a420 | 2009-10-06 18:53:37 +0300 | [diff] [blame] | 99 | |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 100 | return; |
Willy Tarreau | 964c936 | 2007-01-07 00:38:00 +0100 | [diff] [blame] | 101 | } |
| 102 | |
Willy Tarreau | 96bcfd7 | 2007-04-29 10:41:56 +0200 | [diff] [blame] | 103 | /* |
Willy Tarreau | 9789f7b | 2008-06-24 08:17:16 +0200 | [diff] [blame] | 104 | * Extract all expired timers from the timer queue, and wakes up all |
Thierry FOURNIER | 9cf7c4b | 2014-12-15 13:26:01 +0100 | [diff] [blame] | 105 | * associated tasks. Returns the date of next event (or eternity). |
Willy Tarreau | 96bcfd7 | 2007-04-29 10:41:56 +0200 | [diff] [blame] | 106 | */ |
Thierry FOURNIER | 9cf7c4b | 2014-12-15 13:26:01 +0100 | [diff] [blame] | 107 | int wake_expired_tasks() |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 108 | { |
Willy Tarreau | 96bcfd7 | 2007-04-29 10:41:56 +0200 | [diff] [blame] | 109 | struct task *task; |
Willy Tarreau | 9789f7b | 2008-06-24 08:17:16 +0200 | [diff] [blame] | 110 | struct eb32_node *eb; |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 111 | |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 112 | while (1) { |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 113 | eb = eb32_lookup_ge(&timers, now_ms - TIMER_LOOK_BACK); |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 114 | if (unlikely(!eb)) { |
| 115 | /* we might have reached the end of the tree, typically because |
| 116 | * <now_ms> is in the first half and we're first scanning the last |
| 117 | * half. Let's loop back to the beginning of the tree now. |
| 118 | */ |
| 119 | eb = eb32_first(&timers); |
| 120 | if (likely(!eb)) |
| 121 | break; |
| 122 | } |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 123 | |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 124 | if (likely(tick_is_lt(now_ms, eb->key))) { |
| 125 | /* timer not expired yet, revisit it later */ |
Thierry FOURNIER | 9cf7c4b | 2014-12-15 13:26:01 +0100 | [diff] [blame] | 126 | return eb->key; |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 127 | } |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 128 | |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 129 | /* timer looks expired, detach it from the queue */ |
| 130 | task = eb32_entry(eb, struct task, wq); |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 131 | __task_unlink_wq(task); |
Willy Tarreau | 4136522 | 2009-03-08 07:46:27 +0100 | [diff] [blame] | 132 | |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 133 | /* It is possible that this task was left at an earlier place in the |
| 134 | * tree because a recent call to task_queue() has not moved it. This |
| 135 | * happens when the new expiration date is later than the old one. |
| 136 | * Since it is very unlikely that we reach a timeout anyway, it's a |
| 137 | * lot cheaper to proceed like this because we almost never update |
| 138 | * the tree. We may also find disabled expiration dates there. Since |
| 139 | * 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] | 140 | * to take care of this. Note that we might occasionally requeue it at |
| 141 | * the same place, before <eb>, so we have to check if this happens, |
| 142 | * 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] | 143 | * We may also not requeue the task (and not point eb at it) if its |
| 144 | * expiration time is not set. |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 145 | */ |
| 146 | if (!tick_is_expired(task->expire, now_ms)) { |
Willy Tarreau | 34e98ea | 2009-08-09 09:09:54 +0200 | [diff] [blame] | 147 | if (!tick_isset(task->expire)) |
| 148 | continue; |
| 149 | __task_queue(task); |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 150 | continue; |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 151 | } |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 152 | task_wakeup(task, TASK_WOKEN_TIMER); |
| 153 | } |
Willy Tarreau | 9789f7b | 2008-06-24 08:17:16 +0200 | [diff] [blame] | 154 | |
Thierry FOURNIER | 9cf7c4b | 2014-12-15 13:26:01 +0100 | [diff] [blame] | 155 | /* No task is expired */ |
| 156 | return TICK_ETERNITY; |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 157 | } |
| 158 | |
Willy Tarreau | 58b458d | 2008-06-29 22:40:23 +0200 | [diff] [blame] | 159 | /* The run queue is chronologically sorted in a tree. An insertion counter is |
| 160 | * used to assign a position to each task. This counter may be combined with |
| 161 | * other variables (eg: nice value) to set the final position in the tree. The |
| 162 | * counter may wrap without a problem, of course. We then limit the number of |
Willy Tarreau | 91e9993 | 2008-06-30 07:51:00 +0200 | [diff] [blame] | 163 | * tasks processed at once to 1/4 of the number of tasks in the queue, and to |
| 164 | * 200 max in any case, so that general latency remains low and so that task |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 165 | * positions have a chance to be considered. |
Willy Tarreau | 58b458d | 2008-06-29 22:40:23 +0200 | [diff] [blame] | 166 | * |
| 167 | * The function adjusts <next> if a new event is closer. |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 168 | */ |
Thierry FOURNIER | 9cf7c4b | 2014-12-15 13:26:01 +0100 | [diff] [blame] | 169 | void process_runnable_tasks() |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 170 | { |
Willy Tarreau | 964c936 | 2007-01-07 00:38:00 +0100 | [diff] [blame] | 171 | struct task *t; |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 172 | int i; |
| 173 | int max_processed; |
| 174 | struct eb32_node *rq_next; |
| 175 | int rewind; |
| 176 | struct task *local_tasks[16]; |
| 177 | int local_tasks_count; |
Christopher Faulet | 34c5cc9 | 2016-12-06 09:15:30 +0100 | [diff] [blame] | 178 | tasks_run_queue_cur = tasks_run_queue; /* keep a copy for reporting */ |
Willy Tarreau | c7bdf09 | 2009-03-21 18:33:52 +0100 | [diff] [blame] | 179 | nb_tasks_cur = nb_tasks; |
Christopher Faulet | 34c5cc9 | 2016-12-06 09:15:30 +0100 | [diff] [blame] | 180 | max_processed = tasks_run_queue; |
Christopher Faulet | 34c5cc9 | 2016-12-06 09:15:30 +0100 | [diff] [blame] | 181 | if (!tasks_run_queue) |
Willy Tarreau | 98c6121 | 2011-09-10 20:08:49 +0200 | [diff] [blame] | 182 | return; |
| 183 | |
Willy Tarreau | 91e9993 | 2008-06-30 07:51:00 +0200 | [diff] [blame] | 184 | if (max_processed > 200) |
| 185 | max_processed = 200; |
| 186 | |
| 187 | if (likely(niced_tasks)) |
Willy Tarreau | 218859a | 2009-03-21 11:53:09 +0100 | [diff] [blame] | 188 | max_processed = (max_processed + 3) / 4; |
Willy Tarreau | 96bcfd7 | 2007-04-29 10:41:56 +0200 | [diff] [blame] | 189 | |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 190 | while (max_processed > 0) { |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 191 | /* Note: this loop is one of the fastest code path in |
| 192 | * the whole program. It should not be re-arranged |
| 193 | * without a good reason. |
| 194 | */ |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 195 | |
| 196 | rewind = 0; |
| 197 | rq_next = eb32_lookup_ge(&rqueue, rqueue_ticks - TIMER_LOOK_BACK); |
| 198 | if (!rq_next) { |
| 199 | /* we might have reached the end of the tree, typically because |
| 200 | * <rqueue_ticks> is in the first half and we're first scanning |
| 201 | * the last half. Let's loop back to the beginning of the tree now. |
| 202 | */ |
| 203 | rq_next = eb32_first(&rqueue); |
Willy Tarreau | 501260b | 2015-02-23 16:07:01 +0100 | [diff] [blame] | 204 | if (!rq_next) { |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 205 | break; |
| 206 | } |
| 207 | rewind = 1; |
| 208 | } |
| 209 | |
| 210 | local_tasks_count = 0; |
| 211 | while (local_tasks_count < 16) { |
| 212 | t = eb32_entry(rq_next, struct task, rq); |
| 213 | rq_next = eb32_next(rq_next); |
| 214 | /* detach the task from the queue */ |
| 215 | __task_unlink_rq(t); |
| 216 | t->state |= TASK_RUNNING; |
| 217 | t->pending_state = 0; |
| 218 | t->calls++; |
| 219 | local_tasks[local_tasks_count++] = t; |
| 220 | if (!rq_next) { |
| 221 | if (rewind || !(rq_next = eb32_first(&rqueue))) { |
Willy Tarreau | 501260b | 2015-02-23 16:07:01 +0100 | [diff] [blame] | 222 | break; |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 223 | } |
| 224 | rewind = 1; |
Willy Tarreau | 501260b | 2015-02-23 16:07:01 +0100 | [diff] [blame] | 225 | } |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 226 | } |
Willy Tarreau | 58b458d | 2008-06-29 22:40:23 +0200 | [diff] [blame] | 227 | |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 228 | if (!local_tasks_count) |
| 229 | break; |
Willy Tarreau | 58b458d | 2008-06-29 22:40:23 +0200 | [diff] [blame] | 230 | |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 231 | |
| 232 | for (i = 0; i < local_tasks_count ; i++) { |
| 233 | t = local_tasks[i]; |
| 234 | /* This is an optimisation to help the processor's branch |
| 235 | * predictor take this most common call. |
| 236 | */ |
| 237 | if (likely(t->process == process_stream)) |
| 238 | t = process_stream(t); |
| 239 | else |
| 240 | t = t->process(t); |
| 241 | local_tasks[i] = t; |
| 242 | } |
Willy Tarreau | 531cf0c | 2009-03-08 16:35:27 +0100 | [diff] [blame] | 243 | |
Emeric Brun | 0194897 | 2017-03-30 15:37:25 +0200 | [diff] [blame] | 244 | max_processed -= local_tasks_count; |
| 245 | for (i = 0; i < local_tasks_count ; i++) { |
| 246 | t = local_tasks[i]; |
| 247 | if (likely(t != NULL)) { |
| 248 | t->state &= ~TASK_RUNNING; |
| 249 | /* If there is a pending state |
| 250 | * we have to wake up the task |
| 251 | * immediatly, else we defer |
| 252 | * it into wait queue |
| 253 | */ |
| 254 | if (t->pending_state) |
| 255 | __task_wakeup(t); |
| 256 | else |
| 257 | task_queue(t); |
| 258 | } |
Willy Tarreau | 58b458d | 2008-06-29 22:40:23 +0200 | [diff] [blame] | 259 | } |
Willy Tarreau | e35c94a | 2009-03-21 10:01:42 +0100 | [diff] [blame] | 260 | } |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 261 | } |
| 262 | |
Willy Tarreau | 4726f53 | 2009-03-07 17:25:21 +0100 | [diff] [blame] | 263 | /* perform minimal intializations, report 0 in case of error, 1 if OK. */ |
| 264 | int init_task() |
| 265 | { |
| 266 | memset(&timers, 0, sizeof(timers)); |
| 267 | memset(&rqueue, 0, sizeof(rqueue)); |
| 268 | pool2_task = create_pool("task", sizeof(struct task), MEM_F_SHARED); |
| 269 | return pool2_task != NULL; |
| 270 | } |
| 271 | |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 272 | /* |
| 273 | * Local variables: |
| 274 | * c-indent-level: 8 |
| 275 | * c-basic-offset: 8 |
| 276 | * End: |
| 277 | */ |