blob: 053376c3946d5154381048b3b016e621de2d6d3c [file] [log] [blame]
Willy Tarreaubaaee002006-06-26 02:48:02 +02001/*
2 * Task management functions.
3 *
Willy Tarreau4726f532009-03-07 17:25:21 +01004 * Copyright 2000-2009 Willy Tarreau <w@1wt.eu>
Willy Tarreaubaaee002006-06-26 02:48:02 +02005 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version
9 * 2 of the License, or (at your option) any later version.
10 *
11 */
12
Willy Tarreau87bed622009-03-08 22:25:28 +010013#include <string.h>
14
Willy Tarreau2dd0d472006-06-29 17:53:05 +020015#include <common/config.h>
Willy Tarreauc6ca1a02007-05-13 19:43:47 +020016#include <common/memory.h>
Willy Tarreau2dd0d472006-06-29 17:53:05 +020017#include <common/mini-clist.h>
Willy Tarreau96bcfd72007-04-29 10:41:56 +020018#include <common/standard.h>
Willy Tarreaua6a6a932007-04-28 22:40:08 +020019#include <common/time.h>
Willy Tarreau8d388052017-11-05 13:34:20 +010020#include <eb32sctree.h>
Willy Tarreau45cb4fb2009-10-26 21:10:04 +010021#include <eb32tree.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020022
Willy Tarreaud825eef2007-05-12 22:35:00 +020023#include <proto/proxy.h>
Willy Tarreau87b09662015-04-03 00:22:06 +020024#include <proto/stream.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020025#include <proto/task.h>
26
Willy Tarreaubafbe012017-11-24 17:34:44 +010027struct pool_head *pool_head_task;
Willy Tarreau96bcfd72007-04-29 10:41:56 +020028
Thierry FOURNIERd6975962017-07-12 14:31:10 +020029/* 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 Tarreaubafbe012017-11-24 17:34:44 +010032struct pool_head *pool_head_notification;
Thierry FOURNIERd6975962017-07-12 14:31:10 +020033
Willy Tarreaua4613182009-03-21 18:13:21 +010034unsigned int nb_tasks = 0;
Christopher Faulet3911ee82017-11-14 10:26:53 +010035unsigned long active_tasks_mask = 0; /* Mask of threads with active tasks */
Christopher Faulet34c5cc92016-12-06 09:15:30 +010036unsigned int tasks_run_queue = 0;
37unsigned int tasks_run_queue_cur = 0; /* copy of the run queue size */
Willy Tarreauc7bdf092009-03-21 18:33:52 +010038unsigned int nb_tasks_cur = 0; /* copy of the tasks count */
Willy Tarreaue35c94a2009-03-21 10:01:42 +010039unsigned int niced_tasks = 0; /* number of niced tasks in the run queue */
Emeric Brun01948972017-03-30 15:37:25 +020040
Willy Tarreau6d1222c2017-11-26 10:08:06 +010041THREAD_LOCAL struct task *curr_task = NULL; /* task currently running or NULL */
42
Willy Tarreaua24d1d02017-11-26 10:19:16 +010043__decl_hathreads(HA_SPINLOCK_T __attribute__((aligned(64))) rq_lock); /* spin lock related to run queue */
44__decl_hathreads(HA_SPINLOCK_T __attribute__((aligned(64))) wq_lock); /* spin lock related to wait queue */
Willy Tarreau964c9362007-01-07 00:38:00 +010045
Willy Tarreaue35c94a2009-03-21 10:01:42 +010046static struct eb_root timers; /* sorted timers tree */
47static struct eb_root rqueue; /* tree constituting the run queue */
48static unsigned int rqueue_ticks; /* insertion count */
Willy Tarreau9789f7b2008-06-24 08:17:16 +020049
Willy Tarreau4726f532009-03-07 17:25:21 +010050/* Puts the task <t> in run queue at a position depending on t->nice. <t> is
51 * returned. The nice value assigns boosts in 32th of the run queue size. A
Christopher Faulet34c5cc92016-12-06 09:15:30 +010052 * nice value of -1024 sets the task to -tasks_run_queue*32, while a nice value
53 * of 1024 sets the task to tasks_run_queue*32. The state flags are cleared, so
54 * the caller will have to set its flags after this call.
Willy Tarreau4726f532009-03-07 17:25:21 +010055 * The task must not already be in the run queue. If unsure, use the safer
56 * task_wakeup() function.
Willy Tarreau91e99932008-06-30 07:51:00 +020057 */
Willy Tarreau4df82062008-08-29 15:26:14 +020058struct task *__task_wakeup(struct task *t)
Willy Tarreaue33aece2007-04-30 13:15:14 +020059{
Christopher Faulet34c5cc92016-12-06 09:15:30 +010060 tasks_run_queue++;
Christopher Faulet3911ee82017-11-14 10:26:53 +010061 active_tasks_mask |= t->thread_mask;
Willy Tarreau4726f532009-03-07 17:25:21 +010062 t->rq.key = ++rqueue_ticks;
Willy Tarreau91e99932008-06-30 07:51:00 +020063
64 if (likely(t->nice)) {
65 int offset;
66
67 niced_tasks++;
68 if (likely(t->nice > 0))
Christopher Faulet34c5cc92016-12-06 09:15:30 +010069 offset = (unsigned)((tasks_run_queue * (unsigned int)t->nice) / 32U);
Willy Tarreau91e99932008-06-30 07:51:00 +020070 else
Christopher Faulet34c5cc92016-12-06 09:15:30 +010071 offset = -(unsigned)((tasks_run_queue * (unsigned int)-t->nice) / 32U);
Willy Tarreau4726f532009-03-07 17:25:21 +010072 t->rq.key += offset;
Willy Tarreau91e99932008-06-30 07:51:00 +020073 }
74
Emeric Brun01948972017-03-30 15:37:25 +020075 /* reset flag to pending ones
76 * Note: __task_wakeup must not be called
77 * if task is running
78 */
79 t->state = t->pending_state;
Willy Tarreau8d388052017-11-05 13:34:20 +010080 eb32sc_insert(&rqueue, &t->rq, t->thread_mask);
Willy Tarreau58b458d2008-06-29 22:40:23 +020081 return t;
Willy Tarreaue33aece2007-04-30 13:15:14 +020082}
Willy Tarreaud825eef2007-05-12 22:35:00 +020083
Willy Tarreau96bcfd72007-04-29 10:41:56 +020084/*
Willy Tarreau531cf0c2009-03-08 16:35:27 +010085 * __task_queue()
Willy Tarreau96bcfd72007-04-29 10:41:56 +020086 *
87 * Inserts a task into the wait queue at the position given by its expiration
Willy Tarreau4726f532009-03-07 17:25:21 +010088 * date. It does not matter if the task was already in the wait queue or not,
Willy Tarreau531cf0c2009-03-08 16:35:27 +010089 * as it will be unlinked. The task must not have an infinite expiration timer.
Willy Tarreaue35c94a2009-03-21 10:01:42 +010090 * Last, tasks must not be queued further than the end of the tree, which is
91 * between <now_ms> and <now_ms> + 2^31 ms (now+24days in 32bit).
Willy Tarreau531cf0c2009-03-08 16:35:27 +010092 *
93 * This function should not be used directly, it is meant to be called by the
94 * inline version of task_queue() which performs a few cheap preliminary tests
95 * before deciding to call __task_queue().
Willy Tarreau96bcfd72007-04-29 10:41:56 +020096 */
Willy Tarreau531cf0c2009-03-08 16:35:27 +010097void __task_queue(struct task *task)
Willy Tarreau964c9362007-01-07 00:38:00 +010098{
Willy Tarreau531cf0c2009-03-08 16:35:27 +010099 if (likely(task_in_wq(task)))
Willy Tarreau4726f532009-03-07 17:25:21 +0100100 __task_unlink_wq(task);
Willy Tarreau4726f532009-03-07 17:25:21 +0100101
102 /* the task is not in the queue now */
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100103 task->wq.key = task->expire;
Willy Tarreau28c41a42008-06-29 17:00:59 +0200104#ifdef DEBUG_CHECK_INVALID_EXPIRATION_DATES
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100105 if (tick_is_lt(task->wq.key, now_ms))
Willy Tarreau28c41a42008-06-29 17:00:59 +0200106 /* we're queuing too far away or in the past (most likely) */
Willy Tarreau4726f532009-03-07 17:25:21 +0100107 return;
Willy Tarreau28c41a42008-06-29 17:00:59 +0200108#endif
Willy Tarreauce44f122008-07-05 18:16:19 +0200109
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100110 eb32_insert(&timers, &task->wq);
SaVaGe1d7a4202009-10-06 18:53:37 +0300111
Willy Tarreau4726f532009-03-07 17:25:21 +0100112 return;
Willy Tarreau964c9362007-01-07 00:38:00 +0100113}
114
Willy Tarreau96bcfd72007-04-29 10:41:56 +0200115/*
Willy Tarreau9789f7b2008-06-24 08:17:16 +0200116 * Extract all expired timers from the timer queue, and wakes up all
Thierry FOURNIER9cf7c4b2014-12-15 13:26:01 +0100117 * associated tasks. Returns the date of next event (or eternity).
Willy Tarreau96bcfd72007-04-29 10:41:56 +0200118 */
Thierry FOURNIER9cf7c4b2014-12-15 13:26:01 +0100119int wake_expired_tasks()
Willy Tarreaubaaee002006-06-26 02:48:02 +0200120{
Willy Tarreau96bcfd72007-04-29 10:41:56 +0200121 struct task *task;
Willy Tarreau9789f7b2008-06-24 08:17:16 +0200122 struct eb32_node *eb;
Willy Tarreaub992ba12017-11-05 19:09:27 +0100123 int ret = TICK_ETERNITY;
Willy Tarreaubaaee002006-06-26 02:48:02 +0200124
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100125 while (1) {
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100126 HA_SPIN_LOCK(TASK_WQ_LOCK, &wq_lock);
Emeric Brunc60def82017-09-27 14:59:38 +0200127 lookup_next:
Emeric Brun01948972017-03-30 15:37:25 +0200128 eb = eb32_lookup_ge(&timers, now_ms - TIMER_LOOK_BACK);
Emeric Brunc60def82017-09-27 14:59:38 +0200129 if (!eb) {
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100130 /* we might have reached the end of the tree, typically because
131 * <now_ms> is in the first half and we're first scanning the last
132 * half. Let's loop back to the beginning of the tree now.
133 */
134 eb = eb32_first(&timers);
Willy Tarreaub992ba12017-11-05 19:09:27 +0100135 if (likely(!eb))
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100136 break;
137 }
Willy Tarreaubaaee002006-06-26 02:48:02 +0200138
Willy Tarreaub992ba12017-11-05 19:09:27 +0100139 if (tick_is_lt(now_ms, eb->key)) {
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100140 /* timer not expired yet, revisit it later */
Willy Tarreaub992ba12017-11-05 19:09:27 +0100141 ret = eb->key;
142 break;
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100143 }
Willy Tarreaubaaee002006-06-26 02:48:02 +0200144
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100145 /* timer looks expired, detach it from the queue */
146 task = eb32_entry(eb, struct task, wq);
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100147 __task_unlink_wq(task);
Willy Tarreau41365222009-03-08 07:46:27 +0100148
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100149 /* It is possible that this task was left at an earlier place in the
150 * tree because a recent call to task_queue() has not moved it. This
151 * happens when the new expiration date is later than the old one.
152 * Since it is very unlikely that we reach a timeout anyway, it's a
153 * lot cheaper to proceed like this because we almost never update
154 * the tree. We may also find disabled expiration dates there. Since
155 * we have detached the task from the tree, we simply call task_queue
Willy Tarreau814c9782009-07-14 23:48:55 +0200156 * to take care of this. Note that we might occasionally requeue it at
157 * the same place, before <eb>, so we have to check if this happens,
158 * and adjust <eb>, otherwise we may skip it which is not what we want.
Willy Tarreau34e98ea2009-08-09 09:09:54 +0200159 * We may also not requeue the task (and not point eb at it) if its
160 * expiration time is not set.
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100161 */
162 if (!tick_is_expired(task->expire, now_ms)) {
Willy Tarreaub992ba12017-11-05 19:09:27 +0100163 if (tick_isset(task->expire))
164 __task_queue(task);
Emeric Brunc60def82017-09-27 14:59:38 +0200165 goto lookup_next;
Willy Tarreaubaaee002006-06-26 02:48:02 +0200166 }
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100167 task_wakeup(task, TASK_WOKEN_TIMER);
Willy Tarreau51753452017-11-23 18:36:50 +0100168 HA_SPIN_UNLOCK(TASK_WQ_LOCK, &wq_lock);
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100169 }
Willy Tarreau9789f7b2008-06-24 08:17:16 +0200170
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100171 HA_SPIN_UNLOCK(TASK_WQ_LOCK, &wq_lock);
Willy Tarreaub992ba12017-11-05 19:09:27 +0100172 return ret;
Willy Tarreaubaaee002006-06-26 02:48:02 +0200173}
174
Willy Tarreau58b458d2008-06-29 22:40:23 +0200175/* The run queue is chronologically sorted in a tree. An insertion counter is
176 * used to assign a position to each task. This counter may be combined with
177 * other variables (eg: nice value) to set the final position in the tree. The
178 * counter may wrap without a problem, of course. We then limit the number of
Christopher Faulet8a48f672017-11-14 10:38:36 +0100179 * tasks processed to 200 in any case, so that general latency remains low and
180 * so that task positions have a chance to be considered.
Willy Tarreau58b458d2008-06-29 22:40:23 +0200181 *
182 * The function adjusts <next> if a new event is closer.
Willy Tarreaubaaee002006-06-26 02:48:02 +0200183 */
Thierry FOURNIER9cf7c4b2014-12-15 13:26:01 +0100184void process_runnable_tasks()
Willy Tarreaubaaee002006-06-26 02:48:02 +0200185{
Willy Tarreau964c9362007-01-07 00:38:00 +0100186 struct task *t;
Emeric Brun01948972017-03-30 15:37:25 +0200187 int i;
188 int max_processed;
Willy Tarreau8d388052017-11-05 13:34:20 +0100189 struct eb32sc_node *rq_next;
Emeric Brun01948972017-03-30 15:37:25 +0200190 struct task *local_tasks[16];
191 int local_tasks_count;
Willy Tarreau9d4b56b2017-11-06 08:36:53 +0100192 int final_tasks_count;
Christopher Faulet3911ee82017-11-14 10:26:53 +0100193
Christopher Faulet34c5cc92016-12-06 09:15:30 +0100194 tasks_run_queue_cur = tasks_run_queue; /* keep a copy for reporting */
Willy Tarreauc7bdf092009-03-21 18:33:52 +0100195 nb_tasks_cur = nb_tasks;
Christopher Faulet8a48f672017-11-14 10:38:36 +0100196 max_processed = 200;
Willy Tarreauf0c531a2017-11-05 16:35:59 +0100197 if (unlikely(global.nbthread <= 1)) {
198 /* when no lock is needed, this loop is much faster */
Christopher Faulet8a48f672017-11-14 10:38:36 +0100199 if (!(active_tasks_mask & tid_bit))
200 return;
201
Christopher Faulet3911ee82017-11-14 10:26:53 +0100202 active_tasks_mask &= ~tid_bit;
Willy Tarreauf0c531a2017-11-05 16:35:59 +0100203 rq_next = eb32sc_lookup_ge(&rqueue, rqueue_ticks - TIMER_LOOK_BACK, tid_bit);
204 while (1) {
205 if (!rq_next) {
206 /* we might have reached the end of the tree, typically because
207 * <rqueue_ticks> is in the first half and we're first scanning
208 * the last half. Let's loop back to the beginning of the tree now.
209 */
210 rq_next = eb32sc_first(&rqueue, tid_bit);
211 if (!rq_next)
212 break;
213 }
214
215 t = eb32sc_entry(rq_next, struct task, rq);
216 rq_next = eb32sc_next(rq_next, tid_bit);
217 __task_unlink_rq(t);
218 t->state |= TASK_RUNNING;
219 t->pending_state = 0;
220
221 t->calls++;
Willy Tarreau6d1222c2017-11-26 10:08:06 +0100222 curr_task = t;
Willy Tarreauf0c531a2017-11-05 16:35:59 +0100223 /* This is an optimisation to help the processor's branch
224 * predictor take this most common call.
225 */
226 if (likely(t->process == process_stream))
227 t = process_stream(t);
228 else
229 t = t->process(t);
Willy Tarreau6d1222c2017-11-26 10:08:06 +0100230 curr_task = NULL;
Willy Tarreauf0c531a2017-11-05 16:35:59 +0100231
232 if (likely(t != NULL)) {
233 t->state &= ~TASK_RUNNING;
234 /* If there is a pending state
235 * we have to wake up the task
236 * immediatly, else we defer
237 * it into wait queue
238 */
239 if (t->pending_state)
240 __task_wakeup(t);
241 else
242 task_queue(t);
243 }
244
245 max_processed--;
Christopher Faulet3911ee82017-11-14 10:26:53 +0100246 if (max_processed <= 0) {
247 active_tasks_mask |= tid_bit;
Willy Tarreauf0c531a2017-11-05 16:35:59 +0100248 break;
Christopher Faulet3911ee82017-11-14 10:26:53 +0100249 }
Willy Tarreauf0c531a2017-11-05 16:35:59 +0100250 }
251 return;
252 }
253
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100254 HA_SPIN_LOCK(TASK_RQ_LOCK, &rq_lock);
Christopher Faulet8a48f672017-11-14 10:38:36 +0100255 if (!(active_tasks_mask & tid_bit)) {
256 HA_SPIN_UNLOCK(TASK_RQ_LOCK, &rq_lock);
257 return;
258 }
259
Christopher Faulet3911ee82017-11-14 10:26:53 +0100260 active_tasks_mask &= ~tid_bit;
261 while (1) {
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100262 /* Note: this loop is one of the fastest code path in
263 * the whole program. It should not be re-arranged
264 * without a good reason.
265 */
Willy Tarreau9e45b332017-11-08 14:05:19 +0100266
267 /* we have to restart looking up after every batch */
268 rq_next = eb32sc_lookup_ge(&rqueue, rqueue_ticks - TIMER_LOOK_BACK, tid_bit);
Willy Tarreauce4e0aa2017-11-05 23:57:00 +0100269 for (local_tasks_count = 0; local_tasks_count < 16; local_tasks_count++) {
270 if (unlikely(!rq_next)) {
271 /* either we just started or we reached the end
272 * of the tree, typically because <rqueue_ticks>
273 * is in the first half and we're first scanning
274 * the last half. Let's loop back to the beginning
275 * of the tree now.
276 */
Christopher Faulet919b7392017-11-14 10:17:48 +0100277 rq_next = eb32sc_first(&rqueue, tid_bit);
278 if (!rq_next)
279 break;
Emeric Brun01948972017-03-30 15:37:25 +0200280 }
Emeric Brun01948972017-03-30 15:37:25 +0200281
Willy Tarreau8d388052017-11-05 13:34:20 +0100282 t = eb32sc_entry(rq_next, struct task, rq);
283 rq_next = eb32sc_next(rq_next, tid_bit);
Willy Tarreauce4e0aa2017-11-05 23:57:00 +0100284
285 /* detach the task from the queue */
286 __task_unlink_rq(t);
287 local_tasks[local_tasks_count] = t;
288 t->state |= TASK_RUNNING;
289 t->pending_state = 0;
290 t->calls++;
291 max_processed--;
Willy Tarreaue35c94a2009-03-21 10:01:42 +0100292 }
Willy Tarreau58b458d2008-06-29 22:40:23 +0200293
Emeric Brun01948972017-03-30 15:37:25 +0200294 if (!local_tasks_count)
295 break;
Willy Tarreau58b458d2008-06-29 22:40:23 +0200296
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100297 HA_SPIN_UNLOCK(TASK_RQ_LOCK, &rq_lock);
Emeric Brun01948972017-03-30 15:37:25 +0200298
Willy Tarreau9d4b56b2017-11-06 08:36:53 +0100299 final_tasks_count = 0;
Emeric Brun01948972017-03-30 15:37:25 +0200300 for (i = 0; i < local_tasks_count ; i++) {
301 t = local_tasks[i];
302 /* This is an optimisation to help the processor's branch
303 * predictor take this most common call.
304 */
Willy Tarreau6d1222c2017-11-26 10:08:06 +0100305 curr_task = t;
Emeric Brun01948972017-03-30 15:37:25 +0200306 if (likely(t->process == process_stream))
307 t = process_stream(t);
308 else
309 t = t->process(t);
Willy Tarreau6d1222c2017-11-26 10:08:06 +0100310 curr_task = NULL;
Willy Tarreau9d4b56b2017-11-06 08:36:53 +0100311 if (t)
312 local_tasks[final_tasks_count++] = t;
Emeric Brun01948972017-03-30 15:37:25 +0200313 }
Willy Tarreau531cf0c2009-03-08 16:35:27 +0100314
Willy Tarreau9d4b56b2017-11-06 08:36:53 +0100315 for (i = 0; i < final_tasks_count ; i++) {
Emeric Brun01948972017-03-30 15:37:25 +0200316 t = local_tasks[i];
Willy Tarreau9d4b56b2017-11-06 08:36:53 +0100317 /* If there is a pending state
318 * we have to wake up the task
319 * immediatly, else we defer
320 * it into wait queue
321 */
Willy Tarreau51753452017-11-23 18:36:50 +0100322 HA_SPIN_LOCK(TASK_RQ_LOCK, &rq_lock);
323 t->state &= ~TASK_RUNNING;
324 if (t->pending_state) {
Willy Tarreau9d4b56b2017-11-06 08:36:53 +0100325 __task_wakeup(t);
Willy Tarreau51753452017-11-23 18:36:50 +0100326 HA_SPIN_UNLOCK(TASK_RQ_LOCK, &rq_lock);
327 }
328 else {
329 /* we must never hold the RQ lock before the WQ lock */
330 HA_SPIN_UNLOCK(TASK_RQ_LOCK, &rq_lock);
Willy Tarreau9d4b56b2017-11-06 08:36:53 +0100331 task_queue(t);
Willy Tarreau51753452017-11-23 18:36:50 +0100332 }
Willy Tarreau58b458d2008-06-29 22:40:23 +0200333 }
Willy Tarreauce4e0aa2017-11-05 23:57:00 +0100334
Willy Tarreau51753452017-11-23 18:36:50 +0100335 HA_SPIN_LOCK(TASK_RQ_LOCK, &rq_lock);
Christopher Faulet3911ee82017-11-14 10:26:53 +0100336 if (max_processed <= 0) {
337 active_tasks_mask |= tid_bit;
338 break;
339 }
340 }
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100341 HA_SPIN_UNLOCK(TASK_RQ_LOCK, &rq_lock);
Willy Tarreaubaaee002006-06-26 02:48:02 +0200342}
343
Willy Tarreau4726f532009-03-07 17:25:21 +0100344/* perform minimal intializations, report 0 in case of error, 1 if OK. */
345int init_task()
346{
347 memset(&timers, 0, sizeof(timers));
348 memset(&rqueue, 0, sizeof(rqueue));
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100349 HA_SPIN_INIT(&wq_lock);
350 HA_SPIN_INIT(&rq_lock);
Willy Tarreaubafbe012017-11-24 17:34:44 +0100351 pool_head_task = create_pool("task", sizeof(struct task), MEM_F_SHARED);
352 if (!pool_head_task)
Thierry FOURNIERd6975962017-07-12 14:31:10 +0200353 return 0;
Willy Tarreaubafbe012017-11-24 17:34:44 +0100354 pool_head_notification = create_pool("notification", sizeof(struct notification), MEM_F_SHARED);
355 if (!pool_head_notification)
Thierry FOURNIERd6975962017-07-12 14:31:10 +0200356 return 0;
357 return 1;
Willy Tarreau4726f532009-03-07 17:25:21 +0100358}
359
Willy Tarreaubaaee002006-06-26 02:48:02 +0200360/*
361 * Local variables:
362 * c-indent-level: 8
363 * c-basic-offset: 8
364 * End:
365 */