/* * include/proto/queue.h * This file defines everything related to queues. * * Copyright (C) 2000-2012 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 * License as published by the Free Software Foundation, version 2.1 * exclusively. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA */ #ifndef _PROTO_QUEUE_H #define _PROTO_QUEUE_H #include #include #include #include #include #include #include #include #include extern struct pool_head *pool_head_pendconn; int init_pendconn(); struct pendconn *pendconn_add(struct stream *strm); void pendconn_free(struct pendconn *p); void process_srv_queue(struct server *s); unsigned int srv_dynamic_maxconn(const struct server *s); int pendconn_redistribute(struct server *s); int pendconn_grab_from_px(struct server *s); /* Returns 0 if all slots are full on a server, or 1 if there are slots available. */ static inline int server_has_room(const struct server *s) { return !s->maxconn || s->cur_sess < srv_dynamic_maxconn(s); } /* returns 0 if nothing has to be done for server regarding queued connections, * and non-zero otherwise. If the server is down, we only check its own queue. Suited * for and if/else usage. */ static inline int may_dequeue_tasks(const struct server *s, const struct proxy *p) { return (s && (s->nbpend || (p->nbpend && srv_currently_usable(s))) && (!s->maxconn || s->cur_sess < srv_dynamic_maxconn(s))); } #endif /* _PROTO_QUEUE_H */ /* * Local variables: * c-indent-level: 8 * c-basic-offset: 8 * End: */