#include <types/http_ana.h>
#include <types/stream.h>
#include <types/stream_interface.h>
-#include <types/task.h>
+#include <haproxy/task-t.h>
// 1 bit per flag, no hole permitted here
#define SHOW_AS_ANA 0x00000001
#include <proto/stats.h>
#include <proto/stream.h>
#include <proto/stream_interface.h>
-#include <proto/task.h>
+#include <haproxy/task.h>
/* Prometheus exporter applet states (appctx->st0) */
enum {
#include <types/connection.h>
#include <haproxy/proto_udp-t.h>
-#include <types/task.h>
+#include <haproxy/task-t.h>
extern struct pool_head *dns_requester_pool;
/*
- * include/types/task.h
+ * include/haproxy/task-t.h
* Macros, variables and structures for task management.
*
* Copyright (C) 2000-2010 Willy Tarreau - w@1wt.eu
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
-#ifndef _TYPES_TASK_H
-#define _TYPES_TASK_H
+#ifndef _HAPROXY_TASK_T_H
+#define _HAPROXY_TASK_T_H
#include <sys/time.h>
-#include <haproxy/api-t.h>
-#include <haproxy/list-t.h>
#include <import/eb32sctree.h>
#include <import/eb32tree.h>
+#include <haproxy/list-t.h>
+#include <haproxy/thread-t.h>
+#include <haproxy/api-t.h>
+
/* values for task->state */
#define TASK_SLEEPING 0x0000 /* task sleeping */
#define TASK_RUNNING 0x0001 /* the task is currently running */
int tid; /* TID of the tasklet owner, <0 if local */
};
-#define TASK_IS_TASKLET(t) ((t)->nice == -32768)
-
/*
* The task callback (->process) is responsible for updating ->expire. It must
* return a pointer to the task itself, except if the task has been deleted, in
void *arg;
};
-#endif /* _TYPES_TASK_H */
+#endif /* _HAPROXY_TASK_T_H */
/*
* Local variables:
/*
- * include/proto/task.h
+ * include/haproxy/task.h
* Functions for task management.
*
- * Copyright (C) 2000-2010 Willy Tarreau - w@1wt.eu
+ * Copyright (C) 2000-2020 Willy Tarreau - w@1wt.eu
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
-#ifndef _PROTO_TASK_H
-#define _PROTO_TASK_H
+#ifndef _HAPROXY_TASK_H
+#define _HAPROXY_TASK_H
#include <sys/time.h>
+#include <import/eb32sctree.h>
+#include <import/eb32tree.h>
+
#include <haproxy/api.h>
-#include <haproxy/pool.h>
+#include <haproxy/fd.h>
#include <haproxy/global.h>
#include <haproxy/intops.h>
#include <haproxy/list.h>
-#include <haproxy/ticks.h>
+#include <haproxy/pool.h>
+#include <haproxy/task-t.h>
#include <haproxy/thread.h>
+#include <haproxy/ticks.h>
-#include <import/eb32sctree.h>
-#include <import/eb32tree.h>
-
-#include <types/task.h>
-
-#include <haproxy/fd.h>
/* Principle of the wait queue.
*
/* The farthest we can look back in a timer tree */
#define TIMER_LOOK_BACK (1U << 31)
+/* tasklets are recognized with nice==-32768 */
+#define TASK_IS_TASKLET(t) ((t)->nice == -32768)
+
+
/* a few exported variables */
extern unsigned int nb_tasks; /* total number of tasks */
extern volatile unsigned long global_tasks_mask; /* Mask of threads with tasks in the global runqueue */
extern struct pool_head *pool_head_tasklet;
extern struct pool_head *pool_head_notification;
extern THREAD_LOCAL struct task_per_thread *sched; /* current's thread scheduler context */
+
#ifdef USE_THREAD
extern struct eb_root timers; /* sorted timers tree, global */
extern struct eb_root rqueue; /* tree constituting the run queue */
__decl_thread(extern HA_SPINLOCK_T rq_lock); /* spin lock related to run queue */
__decl_thread(extern HA_RWLOCK_T wq_lock); /* RW lock related to the wait queue */
-static inline struct task *task_unlink_wq(struct task *t);
-static inline void task_queue(struct task *task);
+void __task_wakeup(struct task *t, struct eb_root *);
+void __task_queue(struct task *task, struct eb_root *wq);
+
+struct work_list *work_list_create(int nbthread,
+ struct task *(*fct)(struct task *, void *, unsigned short),
+ void *arg);
+void work_list_destroy(struct work_list *work, int nbthread);
+int run_tasks_from_list(struct list *list, int max);
+
+/*
+ * This does 3 things :
+ * - wake up all expired tasks
+ * - call all runnable tasks
+ * - return the date of next event in <next> or eternity.
+ */
+
+void process_runnable_tasks();
+
+/*
+ * Extract all expired timers from the timer queue, and wakes up all
+ * associated tasks.
+ */
+void wake_expired_tasks();
+
+/* Checks the next timer for the current thread by looking into its own timer
+ * list and the global one. It may return TICK_ETERNITY if no timer is present.
+ * Note that the next timer might very well be slightly in the past.
+ */
+int next_timer_expiry();
+
+/*
+ * Delete every tasks before running the master polling loop
+ */
+void mworker_cleantasks();
+
+
/* return 0 if task is in run queue, otherwise non-zero */
static inline int task_in_rq(struct task *t)
return t->wq.node.leaf_p != NULL;
}
+/* returns true if the current thread has some work to do */
+static inline int thread_has_tasks(void)
+{
+ return (!!(global_tasks_mask & tid_bit) |
+ (sched->rqueue_size > 0) |
+ !LIST_ISEMPTY(&sched->tasklets[TL_URGENT]) |
+ !LIST_ISEMPTY(&sched->tasklets[TL_NORMAL]) |
+ !LIST_ISEMPTY(&sched->tasklets[TL_BULK]) |
+ !MT_LIST_ISEMPTY(&sched->shared_tasklet_list));
+}
+
/* puts the task <t> in run queue with reason flags <f>, and returns <t> */
/* This will put the task in the local runqueue if the task is only runnable
* by the current thread, in the global runqueue otherwies.
*/
-void __task_wakeup(struct task *t, struct eb_root *);
static inline void task_wakeup(struct task *t, unsigned int f)
{
unsigned short state;
}
}
-/* change the thread affinity of a task to <thread_mask>.
- * This may only be done from within the running task itself or during its
- * initialization. It will unqueue and requeue the task from the wait queue
- * if it was in it. This is safe against a concurrent task_queue() call because
- * task_queue() itself will unlink again if needed after taking into account
- * the new thread_mask.
- */
-static inline void task_set_affinity(struct task *t, unsigned long thread_mask)
-{
- if (unlikely(task_in_wq(t))) {
- task_unlink_wq(t);
- t->thread_mask = thread_mask;
- task_queue(t);
- }
- else
- t->thread_mask = thread_mask;
-}
-
/*
* Unlink the task from the wait queue, and possibly update the last_timer
* pointer. A pointer to the task itself is returned. The task *must* already
return t;
}
+/* Place <task> into the wait queue, where it may already be. If the expiration
+ * timer is infinite, do nothing and rely on wake_expired_task to clean up.
+ * If the task uses a shared wait queue, it's queued into the global wait queue,
+ * protected by the global wq_lock, otherwise by it necessarily belongs to the
+ * current thread'sand is queued without locking.
+ */
+static inline void task_queue(struct task *task)
+{
+ /* If we already have a place in the wait queue no later than the
+ * timeout we're trying to set, we'll stay there, because it is very
+ * unlikely that we will reach the timeout anyway. If the timeout
+ * has been disabled, it's useless to leave the queue as well. We'll
+ * rely on wake_expired_tasks() to catch the node and move it to the
+ * proper place should it ever happen. Finally we only add the task
+ * to the queue if it was not there or if it was further than what
+ * we want.
+ */
+ if (!tick_isset(task->expire))
+ return;
+
+#ifdef USE_THREAD
+ if (task->state & TASK_SHARED_WQ) {
+ HA_RWLOCK_WRLOCK(TASK_WQ_LOCK, &wq_lock);
+ if (!task_in_wq(task) || tick_is_lt(task->expire, task->wq.key))
+ __task_queue(task, &timers);
+ HA_RWLOCK_WRUNLOCK(TASK_WQ_LOCK, &wq_lock);
+ } else
+#endif
+ {
+ BUG_ON((task->thread_mask & tid_bit) == 0); // should have TASK_SHARED_WQ
+ if (!task_in_wq(task) || tick_is_lt(task->expire, task->wq.key))
+ __task_queue(task, &sched->timers);
+ }
+}
+
+/* change the thread affinity of a task to <thread_mask>.
+ * This may only be done from within the running task itself or during its
+ * initialization. It will unqueue and requeue the task from the wait queue
+ * if it was in it. This is safe against a concurrent task_queue() call because
+ * task_queue() itself will unlink again if needed after taking into account
+ * the new thread_mask.
+ */
+static inline void task_set_affinity(struct task *t, unsigned long thread_mask)
+{
+ if (unlikely(task_in_wq(t))) {
+ task_unlink_wq(t);
+ t->thread_mask = thread_mask;
+ task_queue(t);
+ }
+ else
+ t->thread_mask = thread_mask;
+}
+
/*
* Unlink the task from the run queue. The tasks_run_queue size and number of
* niced tasks are updated too. A pointer to the task itself is returned. The
tl->tid = tid;
}
-void __task_queue(struct task *task, struct eb_root *wq);
-
-/* Place <task> into the wait queue, where it may already be. If the expiration
- * timer is infinite, do nothing and rely on wake_expired_task to clean up.
- * If the task uses a shared wait queue, it's queued into the global wait queue,
- * protected by the global wq_lock, otherwise by it necessarily belongs to the
- * current thread'sand is queued without locking.
- */
-static inline void task_queue(struct task *task)
-{
- /* If we already have a place in the wait queue no later than the
- * timeout we're trying to set, we'll stay there, because it is very
- * unlikely that we will reach the timeout anyway. If the timeout
- * has been disabled, it's useless to leave the queue as well. We'll
- * rely on wake_expired_tasks() to catch the node and move it to the
- * proper place should it ever happen. Finally we only add the task
- * to the queue if it was not there or if it was further than what
- * we want.
- */
- if (!tick_isset(task->expire))
- return;
-
-#ifdef USE_THREAD
- if (task->state & TASK_SHARED_WQ) {
- HA_RWLOCK_WRLOCK(TASK_WQ_LOCK, &wq_lock);
- if (!task_in_wq(task) || tick_is_lt(task->expire, task->wq.key))
- __task_queue(task, &timers);
- HA_RWLOCK_WRUNLOCK(TASK_WQ_LOCK, &wq_lock);
- } else
-#endif
- {
- BUG_ON((task->thread_mask & tid_bit) == 0); // should have TASK_SHARED_WQ
- if (!task_in_wq(task) || tick_is_lt(task->expire, task->wq.key))
- __task_queue(task, &sched->timers);
- }
-}
-
/* Ensure <task> will be woken up at most at <when>. If the task is already in
* the run queue (but not running), nothing is done. It may be used that way
* with a delay : task_schedule(task, tick_add(now_ms, delay));
return !LIST_ISEMPTY(wake);
}
-static inline int thread_has_tasks(void)
-{
- return (!!(global_tasks_mask & tid_bit) |
- (sched->rqueue_size > 0) |
- !LIST_ISEMPTY(&sched->tasklets[TL_URGENT]) |
- !LIST_ISEMPTY(&sched->tasklets[TL_NORMAL]) |
- !LIST_ISEMPTY(&sched->tasklets[TL_BULK]) |
- !MT_LIST_ISEMPTY(&sched->shared_tasklet_list));
-}
-
/* adds list item <item> to work list <work> and wake up the associated task */
static inline void work_list_add(struct work_list *work, struct mt_list *item)
{
task_wakeup(work->task, TASK_WOKEN_OTHER);
}
-struct work_list *work_list_create(int nbthread,
- struct task *(*fct)(struct task *, void *, unsigned short),
- void *arg);
-
-void work_list_destroy(struct work_list *work, int nbthread);
-int run_tasks_from_list(struct list *list, int max);
-
-/*
- * This does 3 things :
- * - wake up all expired tasks
- * - call all runnable tasks
- * - return the date of next event in <next> or eternity.
- */
-
-void process_runnable_tasks();
-
-/*
- * Extract all expired timers from the timer queue, and wakes up all
- * associated tasks.
- */
-void wake_expired_tasks();
-
-/* Checks the next timer for the current thread by looking into its own timer
- * list and the global one. It may return TICK_ETERNITY if no timer is present.
- * Note that the next timer might very well be slightly in the past.
- */
-int next_timer_expiry();
-
-/*
- * Delete every tasks before running the master polling loop
- */
-void mworker_cleantasks();
-
-#endif /* _PROTO_TASK_H */
+#endif /* _HAPROXY_TASK_H */
/*
* Local variables:
#include <haproxy/pool.h>
#include <haproxy/list.h>
#include <types/applet.h>
-#include <proto/task.h>
+#include <haproxy/task.h>
extern unsigned int nb_applets;
extern struct pool_head *pool_head_appctx;
#include <types/stream_interface.h>
#include <proto/stream.h>
-#include <proto/task.h>
+#include <haproxy/task.h>
/* perform minimal intializations, report 0 in case of error, 1 if OK. */
int init_channel();
#include <types/connection.h>
#include <haproxy/fd.h>
#include <proto/session.h>
-#include <proto/task.h>
+#include <haproxy/task.h>
extern struct pool_head *pool_head_connection;
extern struct pool_head *pool_head_connstream;
#define _PROTO_PROTO_TCP_H
#include <haproxy/api.h>
-#include <types/task.h>
#include <proto/stick_table.h>
int tcp_bind_socket(int fd, int flags, struct sockaddr_storage *local, struct sockaddr_storage *remote);
#include <types/queue.h>
#include <types/stream.h>
#include <types/server.h>
-#include <types/task.h>
#include <proto/backend.h>
#include <haproxy/thread.h>
#include <types/signal.h>
-#include <types/task.h>
+#include <haproxy/task-t.h>
extern int signal_queue_len;
extern struct signal_descriptor signal_state[];
#include <haproxy/obj_type.h>
#include <proto/queue.h>
#include <proto/stick_table.h>
-#include <proto/task.h>
+#include <haproxy/task.h>
#include <proto/trace.h>
extern struct trace_source trace_strm;
#include <haproxy/action-t.h>
#include <haproxy/api.h>
-#include <types/task.h>
#include <proto/stick_table.h>
int tcp_inspect_request(struct stream *s, struct channel *req, int an_bit);
#include <types/connection.h>
#include <haproxy/sample-t.h>
#include <types/session.h>
-#include <types/task.h>
+#include <haproxy/task-t.h>
/* enum used by check->result. Must remain in this order, as some code uses
* result >= CHK_RES_PASSED to declare success.
#include <haproxy/freq_ctr-t.h>
#include <types/queue.h>
#include <types/ssl_sock.h>
-#include <types/task.h>
+#include <haproxy/task-t.h>
#include <types/checks.h>
#include <haproxy/vars-t.h>
#include <types/stick_table.h>
-#include <types/task.h>
+#include <haproxy/task-t.h>
struct sess_srv_list {
void *target;
#include <types/proxy.h>
#include <haproxy/sample-t.h>
#include <types/stream.h>
-#include <types/task.h>
+#include <haproxy/task-t.h>
/* Type of list of messages */
#define SPOE_MSGS_BY_EVENT 0x01
#include <types/server.h>
#include <types/session.h>
#include <types/stream_interface.h>
-#include <types/task.h>
+#include <haproxy/task-t.h>
#include <types/stick_table.h>
/* Various Stream Flags, bits values 0x01 to 0x100 (shift 0) */
#include <haproxy/obj_type.h>
#include <haproxy/pool.h>
#include <haproxy/list.h>
+#include <haproxy/task.h>
#include <haproxy/tools.h>
#include <proto/log.h>
#include <proto/proxy.h>
#include <proto/stick_table.h>
-#include <proto/task.h>
/* Find and check the target table used by an action track-sc*. This
#include <haproxy/api.h>
#include <haproxy/list.h>
+#include <haproxy/task.h>
#include <proto/applet.h>
#include <proto/channel.h>
#include <proto/stream.h>
#include <proto/stream_interface.h>
-#include <proto/task.h>
unsigned int nb_applets = 0;
#include <haproxy/lb_fwrr.h>
#include <haproxy/obj_type.h>
#include <haproxy/payload.h>
+#include <haproxy/task.h>
#include <haproxy/ticks.h>
#include <haproxy/time.h>
#include <haproxy/namespace.h>
#include <proto/stream.h>
#include <proto/stream_interface.h>
#include <proto/ssl_sock.h>
-#include <proto/task.h>
#define TRACE_SOURCE &trace_strm
#include <haproxy/time.h>
#include <common/uri_auth.h>
#include <haproxy/namespace.h>
+#include <haproxy/task.h>
#include <haproxy/thread.h>
#include <types/filters.h>
#include <proto/server.h>
#include <proto/stream.h>
#include <proto/stick_table.h>
-#include <proto/task.h>
#include <proto/tcp_rules.h>
#include <proto/connection.h>
#include <haproxy/http_htx.h>
#include <haproxy/h1.h>
#include <haproxy/htx.h>
+#include <haproxy/task.h>
#include <haproxy/vars.h>
#include <haproxy/global.h>
#include <proto/server.h>
#include <proto/signal.h>
#include <proto/stream_interface.h>
-#include <proto/task.h>
#include <proto/log.h>
#include <haproxy/proto_udp.h>
#include <proto/ssl_sock.h>
#include <haproxy/mworker-t.h>
#include <haproxy/pattern-t.h>
#include <haproxy/sample-t.h>
+#include <haproxy/task.h>
#include <haproxy/tools.h>
#include <haproxy/ticks.h>
#include <haproxy/time.h>
#include <proto/stream.h>
#include <proto/server.h>
#include <proto/stream_interface.h>
-#include <proto/task.h>
#define PAYLOAD_PATTERN "<<"
#include <haproxy/buf.h>
#include <haproxy/debug.h>
#include <haproxy/hlua.h>
+#include <haproxy/task.h>
#include <haproxy/thread.h>
#include <import/ist.h>
#include <haproxy/net_helper.h>
#include <proto/cli.h>
#include <haproxy/fd.h>
#include <proto/stream_interface.h>
-#include <proto/task.h>
/* mask of threads still having to dump, used to respect ordering. Only used
* when USE_THREAD_DUMP is set.
#include <haproxy/errors.h>
#include <haproxy/http_rules.h>
#include <haproxy/sample.h>
+#include <haproxy/task.h>
#include <haproxy/time.h>
#include <haproxy/ticks.h>
#include <haproxy/net_helper.h>
#include <proto/http_ana.h>
#include <proto/log.h>
#include <proto/server.h>
-#include <proto/task.h>
#include <haproxy/proto_udp.h>
#include <proto/proxy.h>
#include <proto/stream_interface.h>
#include <haproxy/sample.h>
#include <haproxy/thread.h>
#include <haproxy/pool.h>
+#include <haproxy/task.h>
#include <haproxy/time.h>
#include <haproxy/vars.h>
#include <proto/spoe.h>
#include <proto/stream.h>
#include <proto/stream_interface.h>
-#include <proto/task.h>
#include <proto/tcp_rules.h>
#if defined(DEBUG_SPOE) || defined(DEBUG_FULL)
#include <haproxy/chunk.h>
#include <haproxy/frontend.h>
#include <haproxy/sample.h>
+#include <haproxy/task.h>
#include <haproxy/tools.h>
#include <haproxy/time.h>
#include <proto/proxy.h>
#include <proto/stream.h>
#include <proto/stream_interface.h>
-#include <proto/task.h>
/* Finish a stream accept() for a proxy (TCP or HTTP). It returns a negative
* value in case of a critical failure which must cause the listener to be
#include <haproxy/time.h>
#include <common/uri_auth.h>
#include <haproxy/version.h>
+#include <haproxy/task.h>
#include <haproxy/thread.h>
#include <haproxy/vars.h>
#include <proto/session.h>
#include <proto/stream.h>
#include <proto/signal.h>
-#include <proto/task.h>
#include <proto/ssl_sock.h>
/* array of init calls for older platforms */
#include <haproxy/pattern.h>
#include <haproxy/payload.h>
#include <haproxy/sample.h>
+#include <haproxy/task.h>
#include <haproxy/tools.h>
#include <haproxy/vars.h>
#include <proto/session.h>
#include <proto/stream.h>
#include <proto/stream_interface.h>
-#include <proto/task.h>
#include <proto/tcp_rules.h>
/* Lua uses longjmp to perform yield or throwing errors. This
#include <haproxy/global.h>
#include <haproxy/list.h>
#include <haproxy/listener.h>
+#include <haproxy/task.h>
#include <haproxy/tools.h>
#include <haproxy/time.h>
#include <haproxy/proto_sockpair.h>
#include <haproxy/sample.h>
#include <proto/stream.h>
-#include <proto/task.h>
/* List head of all known bind keywords */
static struct bind_kw_list bind_keywords = {
#include <haproxy/api.h>
#include <haproxy/buf.h>
+#include <haproxy/task.h>
#include <proto/connection.h>
#include <proto/stream.h>
-#include <proto/task.h>
struct mux_pt_ctx {
struct conn_stream *cs;
#include <haproxy/frontend.h>
#include <haproxy/net_helper.h>
#include <haproxy/obj_type-t.h>
+#include <haproxy/task.h>
#include <haproxy/time.h>
#include <haproxy/tools.h>
#include <haproxy/thread.h>
#include <proto/signal.h>
#include <proto/stick_table.h>
#include <proto/stream_interface.h>
-#include <proto/task.h>
/*******************************/
#include <haproxy/freq_ctr.h>
#include <proto/log.h>
#include <haproxy/protocol.h>
-#include <proto/task.h>
static void sockpair_add_listener(struct listener *listener, int port);
static int sockpair_bind_listener(struct listener *listener, char *errmsg, int errlen);
#include <proto/proto_tcp.h>
#include <proto/proxy.h>
#include <proto/server.h>
-#include <proto/task.h>
#include <proto/tcp_rules.h>
static int tcp_bind_listeners(struct protocol *proto, char *errmsg, int errlen);
#include <haproxy/fd.h>
#include <proto/log.h>
#include <haproxy/protocol.h>
-#include <proto/task.h>
static int uxst_bind_listener(struct listener *listener, char *errmsg, int errlen);
static int uxst_bind_listeners(struct protocol *proto, char *errmsg, int errlen);
#include <haproxy/listener.h>
#include <haproxy/obj_type-t.h>
#include <haproxy/pool.h>
+#include <haproxy/task.h>
#include <haproxy/time.h>
#include <import/eb32tree.h>
#include <proto/signal.h>
#include <proto/stream.h>
#include <proto/stream_interface.h>
-#include <proto/task.h>
int listeners; /* # of proxy listeners, set by cfgparse */
#include <haproxy/http_rules.h>
#include <haproxy/pool.h>
#include <haproxy/sample.h>
+#include <haproxy/task.h>
#include <haproxy/time.h>
#include <haproxy/thread.h>
#include <import/eb32tree.h>
#include <proto/server.h>
#include <proto/stream.h>
#include <proto/stream_interface.h>
-#include <proto/task.h>
#include <proto/tcp_rules.h>
#include <proto/log.h>
#include <haproxy/pipe.h>
#include <proto/stream_interface.h>
-#include <proto/task.h>
#if defined(USE_LINUX_SPLICE)
#include <haproxy/global.h>
#include <haproxy/namespace.h>
#include <haproxy/sample.h>
+#include <haproxy/task.h>
#include <haproxy/time.h>
#include <types/applet.h>
#include <proto/stream.h>
#include <proto/stream_interface.h>
#include <proto/stats.h>
-#include <proto/task.h>
#include <netinet/tcp.h>
#include <import/ebsttree.h>
#include <signal.h>
#include <string.h>
+#include <haproxy/task.h>
#include <proto/signal.h>
#include <proto/log.h>
-#include <proto/task.h>
/* Principle : we keep an in-order list of the first occurrence of all received
* signals. All occurrences of a same signal are grouped though. The signal
#include <haproxy/ssl_ckch.h>
#include <haproxy/ssl_crtlist.h>
#include <haproxy/ssl_utils.h>
+#include <haproxy/task.h>
#include <haproxy/tools.h>
#include <haproxy/ticks.h>
#include <haproxy/time.h>
#include <proto/proxy.h>
#include <proto/ssl_sock.h>
#include <proto/stream.h>
-#include <proto/task.h>
/* ***** READ THIS before adding code here! *****
*
#include <haproxy/listener.h>
#include <haproxy/map-t.h>
#include <haproxy/pattern-t.h>
+#include <haproxy/task.h>
#include <haproxy/tools.h>
#include <haproxy/ticks.h>
#include <haproxy/time.h>
#include <proto/stream.h>
#include <proto/server.h>
#include <proto/stream_interface.h>
-#include <proto/task.h>
/* status codes available for the stats admin page (strictly 4 chars length) */
const char *stat_status_codes[STAT_STATUS_SIZE] = {
#include <haproxy/pool.h>
#include <haproxy/list.h>
#include <haproxy/net_helper.h>
+#include <haproxy/task.h>
#include <haproxy/tools.h>
#include <haproxy/time.h>
#include <proto/stream.h>
#include <proto/stream_interface.h>
#include <proto/stick_table.h>
-#include <proto/task.h>
#include <proto/peers.h>
#include <proto/tcp_rules.h>
#include <haproxy/thread.h>
#include <haproxy/htx.h>
#include <haproxy/pool.h>
+#include <haproxy/task.h>
#include <haproxy/vars.h>
#include <types/applet.h>
#include <proto/server.h>
#include <proto/stick_table.h>
#include <proto/stream_interface.h>
-#include <proto/task.h>
#include <proto/tcp_rules.h>
DECLARE_POOL(pool_head_stream, "stream", sizeof(struct stream));
#include <haproxy/tools.h>
#include <haproxy/ticks.h>
#include <haproxy/time.h>
+#include <haproxy/task.h>
#include <proto/applet.h>
#include <proto/channel.h>
#include <proto/proxy.h>
#include <proto/stream.h>
#include <proto/stream_interface.h>
-#include <proto/task.h>
#include <haproxy/pipe-t.h>
#include <haproxy/api.h>
#include <haproxy/pool.h>
#include <haproxy/list.h>
+#include <haproxy/task.h>
#include <haproxy/tools.h>
#include <haproxy/time.h>
#include <import/eb32sctree.h>
#include <haproxy/freq_ctr.h>
#include <proto/proxy.h>
#include <proto/stream.h>
-#include <proto/task.h>
DECLARE_POOL(pool_head_task, "task", sizeof(struct task));
DECLARE_POOL(pool_head_tasklet, "tasklet", sizeof(struct tasklet));
#include <haproxy/hlua.h>
#include <haproxy/listener.h>
#include <haproxy/namespace.h>
+#include <haproxy/task.h>
#include <haproxy/tools.h>
#include <proto/applet.h>
#include <haproxy/proto_udp.h>
#include <proto/ssl_sock.h>
#include <proto/stream_interface.h>
-#include <proto/task.h>
/* This macro returns false if the test __x is false. Many
* of the following parsing function must be abort the processing