2006-06-26 00:48:02 +00:00
|
|
|
/*
|
2012-01-20 14:57:05 +00:00
|
|
|
* 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
|
|
|
|
*/
|
2006-06-26 00:48:02 +00:00
|
|
|
|
|
|
|
#ifndef _PROTO_QUEUE_H
|
|
|
|
#define _PROTO_QUEUE_H
|
|
|
|
|
2006-06-29 16:54:54 +00:00
|
|
|
#include <common/config.h>
|
2006-06-29 15:53:05 +00:00
|
|
|
#include <common/memory.h>
|
|
|
|
#include <common/mini-clist.h>
|
2006-06-26 00:48:02 +00:00
|
|
|
|
|
|
|
#include <types/proxy.h>
|
|
|
|
#include <types/queue.h>
|
REORG/MAJOR: session: rename the "session" entity to "stream"
With HTTP/2, we'll have to support multiplexed streams. A stream is in
fact the largest part of what we currently call a session, it has buffers,
logs, etc.
In order to catch any error, this commit removes any reference to the
struct session and tries to rename most "session" occurrences in function
names to "stream" and "sess" to "strm" when that's related to a session.
The files stream.{c,h} were added and session.{c,h} removed.
The session will be reintroduced later and a few parts of the stream
will progressively be moved overthere. It will more or less contain
only what we need in an embryonic session.
Sample fetch functions and converters will have to change a bit so
that they'll use an L5 (session) instead of what's currently called
"L4" which is in fact L6 for now.
Once all changes are completed, we should see approximately this :
L7 - http_txn
L6 - stream
L5 - session
L4 - connection | applet
There will be at most one http_txn per stream, and a same session will
possibly be referenced by multiple streams. A connection will point to
a session and to a stream. The session will hold all the information
we need to keep even when we don't yet have a stream.
Some more cleanup is needed because some code was already far from
being clean. The server queue management still refers to sessions at
many places while comments talk about connections. This will have to
be cleaned up once we have a server-side connection pool manager.
Stream flags "SN_*" still need to be renamed, it doesn't seem like
any of them will need to move to the session.
2015-04-02 22:22:06 +00:00
|
|
|
#include <types/stream.h>
|
2006-06-26 00:48:02 +00:00
|
|
|
#include <types/server.h>
|
|
|
|
#include <types/task.h>
|
|
|
|
|
2012-01-20 14:57:05 +00:00
|
|
|
#include <proto/backend.h>
|
|
|
|
|
2017-11-24 16:34:44 +00:00
|
|
|
extern struct pool_head *pool_head_pendconn;
|
2007-05-13 18:19:55 +00:00
|
|
|
|
REORG/MAJOR: session: rename the "session" entity to "stream"
With HTTP/2, we'll have to support multiplexed streams. A stream is in
fact the largest part of what we currently call a session, it has buffers,
logs, etc.
In order to catch any error, this commit removes any reference to the
struct session and tries to rename most "session" occurrences in function
names to "stream" and "sess" to "strm" when that's related to a session.
The files stream.{c,h} were added and session.{c,h} removed.
The session will be reintroduced later and a few parts of the stream
will progressively be moved overthere. It will more or less contain
only what we need in an embryonic session.
Sample fetch functions and converters will have to change a bit so
that they'll use an L5 (session) instead of what's currently called
"L4" which is in fact L6 for now.
Once all changes are completed, we should see approximately this :
L7 - http_txn
L6 - stream
L5 - session
L4 - connection | applet
There will be at most one http_txn per stream, and a same session will
possibly be referenced by multiple streams. A connection will point to
a session and to a stream. The session will hold all the information
we need to keep even when we don't yet have a stream.
Some more cleanup is needed because some code was already far from
being clean. The server queue management still refers to sessions at
many places while comments talk about connections. This will have to
be cleaned up once we have a server-side connection pool manager.
Stream flags "SN_*" still need to be renamed, it doesn't seem like
any of them will need to move to the session.
2015-04-02 22:22:06 +00:00
|
|
|
struct pendconn *pendconn_add(struct stream *strm);
|
BUG/MAJOR: threads/queue: Fix thread-safety issues on the queues management
The management of the servers and the proxies queues was not thread-safe at
all. First, the accesses to <strm>->pend_pos were not protected. So it was
possible to release it on a thread (for instance because the stream is released)
and to use it in same time on another one (because we redispatch pending
connections for a server). Then, the accesses to stream's information (flags and
target) from anywhere is forbidden. To be safe, The stream's state must always
be updated in the context of process_stream.
So to fix these issues, the queue module has been refactored. A lock has been
added in the pendconn structure. And now, when we try to dequeue a pending
connection, we start by unlinking it from the server/proxy queue and we wake up
the stream. Then, it is the stream reponsibility to really dequeue it (or
release it). This way, we are sure that only the stream can create and release
its <pend_pos> field.
However, be careful. This new implementation should be thread-safe
(hopefully...). But it is not optimal and in some situations, it could be really
slower in multi-threaded mode than in single-threaded one. The problem is that,
when we try to dequeue pending connections, we process it from the older one to
the newer one independently to the thread's affinity. So we need to wait the
other threads' wakeup to really process them. If threads are blocked in the
poller, this will add a significant latency. This problem happens when maxconn
values are very low.
This patch must be backported in 1.8.
2018-03-14 15:18:06 +00:00
|
|
|
int pendconn_dequeue(struct stream *strm);
|
[BUG] fix the dequeuing logic to ensure that all requests get served
The dequeuing logic was completely wrong. First, a task was assigned
to all servers to process the queue, but this task was never scheduled
and was only woken up on session free. Second, there was no reservation
of server entries when a task was assigned a server. This means that
as long as the task was not connected to the server, its presence was
not accounted for. This was causing trouble when detecting whether or
not a server had reached maxconn. Third, during a redispatch, a session
could lose its place at the server's and get blocked because another
session at the same moment would have stolen the entry. Fourth, the
redispatch option did not work when maxqueue was reached for a server,
and it was not possible to do so without indefinitely hanging a session.
The root cause of all those problems was the lack of pre-reservation of
connections at the server's, and the lack of tracking of servers during
a redispatch. Everything relied on combinations of flags which could
appear similarly in quite distinct situations.
This patch is a major rework but there was no other solution, as the
internal logic was deeply flawed. The resulting code is cleaner, more
understandable, uses less magics and is overall more robust.
As an added bonus, "option redispatch" now works when maxqueue has
been reached on a server.
2008-06-20 13:04:11 +00:00
|
|
|
void process_srv_queue(struct server *s);
|
2006-10-15 13:17:57 +00:00
|
|
|
unsigned int srv_dynamic_maxconn(const struct server *s);
|
2014-05-16 09:48:10 +00:00
|
|
|
int pendconn_redistribute(struct server *s);
|
|
|
|
int pendconn_grab_from_px(struct server *s);
|
2018-07-25 06:04:20 +00:00
|
|
|
void pendconn_unlink(struct pendconn *p);
|
|
|
|
|
|
|
|
/* Removes the pendconn from the server/proxy queue. It supports being called
|
|
|
|
* with NULL for pendconn and with a pendconn not in the list. It is the
|
|
|
|
* function to be used by default when unsure. Do not call it with server
|
|
|
|
* or proxy locks held however.
|
|
|
|
*/
|
|
|
|
static inline void pendconn_cond_unlink(struct pendconn *p)
|
|
|
|
{
|
2018-05-11 16:52:31 +00:00
|
|
|
if (p && p->node.node.leaf_p)
|
2018-07-25 06:04:20 +00:00
|
|
|
pendconn_unlink(p);
|
|
|
|
}
|
2006-06-26 00:48:02 +00:00
|
|
|
|
2018-07-25 09:13:53 +00:00
|
|
|
/* Releases the pendconn associated to stream <s> if it has any, and decreases
|
|
|
|
* the pending count if needed. The connection might have been queued to a
|
|
|
|
* specific server as well as to the proxy. The stream also gets marked
|
|
|
|
* unqueued.
|
|
|
|
*
|
|
|
|
* This function must be called by the stream itself, so in the context of
|
|
|
|
* process_stream, without any lock held among the pendconn, the server's queue
|
|
|
|
* nor the proxy's queue.
|
|
|
|
*/
|
|
|
|
static inline void pendconn_free(struct stream *s)
|
|
|
|
{
|
|
|
|
struct pendconn *p = s->pend_pos;
|
|
|
|
|
|
|
|
if (p) {
|
|
|
|
pendconn_cond_unlink(p);
|
|
|
|
s->pend_pos = NULL;
|
|
|
|
pool_free(pool_head_pendconn, p);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-04-25 11:58:37 +00:00
|
|
|
/* 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);
|
|
|
|
}
|
|
|
|
|
2006-06-26 00:48:02 +00:00
|
|
|
/* returns 0 if nothing has to be done for server <s> regarding queued connections,
|
2008-12-04 08:33:58 +00:00
|
|
|
* and non-zero otherwise. If the server is down, we only check its own queue. Suited
|
|
|
|
* for and if/else usage.
|
2006-06-26 00:48:02 +00:00
|
|
|
*/
|
2006-10-15 13:17:57 +00:00
|
|
|
static inline int may_dequeue_tasks(const struct server *s, const struct proxy *p) {
|
2017-08-31 12:41:55 +00:00
|
|
|
return (s && (s->nbpend || (p->nbpend && srv_currently_usable(s))) &&
|
[BUG] fix the dequeuing logic to ensure that all requests get served
The dequeuing logic was completely wrong. First, a task was assigned
to all servers to process the queue, but this task was never scheduled
and was only woken up on session free. Second, there was no reservation
of server entries when a task was assigned a server. This means that
as long as the task was not connected to the server, its presence was
not accounted for. This was causing trouble when detecting whether or
not a server had reached maxconn. Third, during a redispatch, a session
could lose its place at the server's and get blocked because another
session at the same moment would have stolen the entry. Fourth, the
redispatch option did not work when maxqueue was reached for a server,
and it was not possible to do so without indefinitely hanging a session.
The root cause of all those problems was the lack of pre-reservation of
connections at the server's, and the lack of tracking of servers during
a redispatch. Everything relied on combinations of flags which could
appear similarly in quite distinct situations.
This patch is a major rework but there was no other solution, as the
internal logic was deeply flawed. The resulting code is cleaner, more
understandable, uses less magics and is overall more robust.
As an added bonus, "option redispatch" now works when maxqueue has
been reached on a server.
2008-06-20 13:04:11 +00:00
|
|
|
(!s->maxconn || s->cur_sess < srv_dynamic_maxconn(s)));
|
2006-06-26 00:48:02 +00:00
|
|
|
}
|
|
|
|
|
2018-05-11 16:52:31 +00:00
|
|
|
static inline int queue_limit_class(int class)
|
|
|
|
{
|
|
|
|
if (class < -0x7ff)
|
|
|
|
return -0x7ff;
|
|
|
|
if (class > 0x7ff)
|
|
|
|
return 0x7ff;
|
|
|
|
return class;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int queue_limit_offset(int offset)
|
|
|
|
{
|
|
|
|
if (offset < -0x7ffff)
|
|
|
|
return -0x7ffff;
|
|
|
|
if (offset > 0x7ffff)
|
|
|
|
return 0x7ffff;
|
|
|
|
return offset;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-06-26 00:48:02 +00:00
|
|
|
#endif /* _PROTO_QUEUE_H */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Local variables:
|
|
|
|
* c-indent-level: 8
|
|
|
|
* c-basic-offset: 8
|
|
|
|
* End:
|
|
|
|
*/
|