blob: d4da40c730896c52a365a5145df144e1f35ac005 [file] [log] [blame]
Willy Tarreaubaaee002006-06-26 02:48:02 +02001/*
Willy Tarreauf8e8b762012-01-20 15:57:05 +01002 * include/proto/queue.h
3 * This file defines everything related to queues.
4 *
5 * Copyright (C) 2000-2012 Willy Tarreau - w@1wt.eu
6 *
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation, version 2.1
10 * exclusively.
11 *
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with this library; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 */
Willy Tarreaubaaee002006-06-26 02:48:02 +020021
22#ifndef _PROTO_QUEUE_H
23#define _PROTO_QUEUE_H
24
Willy Tarreau4c7e4b72020-05-27 12:58:42 +020025#include <haproxy/api.h>
Willy Tarreaud0ef4392020-06-02 09:38:52 +020026#include <haproxy/pool.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020027
28#include <types/proxy.h>
29#include <types/queue.h>
Willy Tarreau87b09662015-04-03 00:22:06 +020030#include <types/stream.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020031#include <types/server.h>
32#include <types/task.h>
33
Willy Tarreauf8e8b762012-01-20 15:57:05 +010034#include <proto/backend.h>
35
Willy Tarreaubafbe012017-11-24 17:34:44 +010036extern struct pool_head *pool_head_pendconn;
Willy Tarreaue4d7e552007-05-13 20:19:55 +020037
Willy Tarreau87b09662015-04-03 00:22:06 +020038struct pendconn *pendconn_add(struct stream *strm);
Christopher Faulet5cd4bbd2018-03-14 16:18:06 +010039int pendconn_dequeue(struct stream *strm);
Willy Tarreau7c669d72008-06-20 15:04:11 +020040void process_srv_queue(struct server *s);
Willy Tarreaub17916e2006-10-15 15:17:57 +020041unsigned int srv_dynamic_maxconn(const struct server *s);
Willy Tarreau4aac7db2014-05-16 11:48:10 +020042int pendconn_redistribute(struct server *s);
43int pendconn_grab_from_px(struct server *s);
Willy Tarreau9624fae2018-07-25 08:04:20 +020044void pendconn_unlink(struct pendconn *p);
45
46/* Removes the pendconn from the server/proxy queue. It supports being called
47 * with NULL for pendconn and with a pendconn not in the list. It is the
48 * function to be used by default when unsure. Do not call it with server
49 * or proxy locks held however.
50 */
51static inline void pendconn_cond_unlink(struct pendconn *p)
52{
Patrick Hemmer0355dab2018-05-11 12:52:31 -040053 if (p && p->node.node.leaf_p)
Willy Tarreau9624fae2018-07-25 08:04:20 +020054 pendconn_unlink(p);
55}
Willy Tarreaubaaee002006-06-26 02:48:02 +020056
Willy Tarreaud0ad4a82018-07-25 11:13:53 +020057/* Releases the pendconn associated to stream <s> if it has any, and decreases
58 * the pending count if needed. The connection might have been queued to a
59 * specific server as well as to the proxy. The stream also gets marked
60 * unqueued.
61 *
62 * This function must be called by the stream itself, so in the context of
63 * process_stream, without any lock held among the pendconn, the server's queue
64 * nor the proxy's queue.
65 */
66static inline void pendconn_free(struct stream *s)
67{
68 struct pendconn *p = s->pend_pos;
69
70 if (p) {
71 pendconn_cond_unlink(p);
72 s->pend_pos = NULL;
73 pool_free(pool_head_pendconn, p);
74 }
75}
76
Willy Tarreauc35362a2014-04-25 13:58:37 +020077/* Returns 0 if all slots are full on a server, or 1 if there are slots available. */
78static inline int server_has_room(const struct server *s) {
79 return !s->maxconn || s->cur_sess < srv_dynamic_maxconn(s);
80}
81
Willy Tarreaubaaee002006-06-26 02:48:02 +020082/* returns 0 if nothing has to be done for server <s> regarding queued connections,
Willy Tarreau922a8062008-12-04 09:33:58 +010083 * and non-zero otherwise. If the server is down, we only check its own queue. Suited
84 * for and if/else usage.
Willy Tarreaubaaee002006-06-26 02:48:02 +020085 */
Willy Tarreaub17916e2006-10-15 15:17:57 +020086static inline int may_dequeue_tasks(const struct server *s, const struct proxy *p) {
Emeric Brun52a91d32017-08-31 14:41:55 +020087 return (s && (s->nbpend || (p->nbpend && srv_currently_usable(s))) &&
Willy Tarreau7c669d72008-06-20 15:04:11 +020088 (!s->maxconn || s->cur_sess < srv_dynamic_maxconn(s)));
Willy Tarreaubaaee002006-06-26 02:48:02 +020089}
90
Patrick Hemmer268a7072018-05-11 12:52:31 -040091static inline int queue_limit_class(int class)
92{
93 if (class < -0x7ff)
94 return -0x7ff;
95 if (class > 0x7ff)
96 return 0x7ff;
97 return class;
98}
99
100static inline int queue_limit_offset(int offset)
101{
102 if (offset < -0x7ffff)
103 return -0x7ffff;
104 if (offset > 0x7ffff)
105 return 0x7ffff;
106 return offset;
107}
108
109
Willy Tarreaubaaee002006-06-26 02:48:02 +0200110#endif /* _PROTO_QUEUE_H */
111
112/*
113 * Local variables:
114 * c-indent-level: 8
115 * c-basic-offset: 8
116 * End:
117 */