blob: 81b1ddaf2ef50ccb7b271eec4bfa4ce9f144654e [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 Tarreaue3ba5f02006-06-29 18:54:54 +020025#include <common/config.h>
Willy Tarreau2dd0d472006-06-29 17:53:05 +020026#include <common/memory.h>
27#include <common/mini-clist.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020028
29#include <types/proxy.h>
30#include <types/queue.h>
Willy Tarreau87b09662015-04-03 00:22:06 +020031#include <types/stream.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020032#include <types/server.h>
33#include <types/task.h>
34
Willy Tarreauf8e8b762012-01-20 15:57:05 +010035#include <proto/backend.h>
36
Willy Tarreaue4d7e552007-05-13 20:19:55 +020037extern struct pool_head *pool2_pendconn;
38
39int init_pendconn();
Willy Tarreau87b09662015-04-03 00:22:06 +020040struct pendconn *pendconn_add(struct stream *strm);
Willy Tarreaubaaee002006-06-26 02:48:02 +020041void pendconn_free(struct pendconn *p);
Willy Tarreau7c669d72008-06-20 15:04:11 +020042void process_srv_queue(struct server *s);
Willy Tarreaub17916e2006-10-15 15:17:57 +020043unsigned int srv_dynamic_maxconn(const struct server *s);
Willy Tarreau4aac7db2014-05-16 11:48:10 +020044int pendconn_redistribute(struct server *s);
45int pendconn_grab_from_px(struct server *s);
Willy Tarreaubaaee002006-06-26 02:48:02 +020046
Willy Tarreauc35362a2014-04-25 13:58:37 +020047/* Returns 0 if all slots are full on a server, or 1 if there are slots available. */
48static inline int server_has_room(const struct server *s) {
49 return !s->maxconn || s->cur_sess < srv_dynamic_maxconn(s);
50}
51
Willy Tarreaubaaee002006-06-26 02:48:02 +020052/* returns 0 if nothing has to be done for server <s> regarding queued connections,
Willy Tarreau922a8062008-12-04 09:33:58 +010053 * and non-zero otherwise. If the server is down, we only check its own queue. Suited
54 * for and if/else usage.
Willy Tarreaubaaee002006-06-26 02:48:02 +020055 */
Willy Tarreaub17916e2006-10-15 15:17:57 +020056static inline int may_dequeue_tasks(const struct server *s, const struct proxy *p) {
Willy Tarreau87eb1d62014-05-13 18:51:40 +020057 return (s && (s->nbpend || (p->nbpend && srv_is_usable(s))) &&
Willy Tarreau7c669d72008-06-20 15:04:11 +020058 (!s->maxconn || s->cur_sess < srv_dynamic_maxconn(s)));
Willy Tarreaubaaee002006-06-26 02:48:02 +020059}
60
61#endif /* _PROTO_QUEUE_H */
62
63/*
64 * Local variables:
65 * c-indent-level: 8
66 * c-basic-offset: 8
67 * End:
68 */