blob: 2f2a91353b5ef311472c62de854cf4a4a1770ab4 [file] [log] [blame]
Willy Tarreaubaaee002006-06-26 02:48:02 +02001/*
Willy Tarreauc7e42382012-08-24 19:22:53 +02002 * include/proto/channel.h
3 * Channel management definitions, macros and inline functions.
Willy Tarreau7c3c5412009-12-13 15:53:05 +01004 *
Willy Tarreau9dab5fc2012-05-07 11:56:55 +02005 * Copyright (C) 2000-2012 Willy Tarreau - w@1wt.eu
Willy Tarreau7c3c5412009-12-13 15:53:05 +01006 *
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
Willy Tarreauc7e42382012-08-24 19:22:53 +020022#ifndef _PROTO_CHANNEL_H
23#define _PROTO_CHANNEL_H
Willy Tarreaubaaee002006-06-26 02:48:02 +020024
Willy Tarreau7341d942007-05-13 19:56:02 +020025#include <stdio.h>
Willy Tarreau0f772532006-12-23 20:51:41 +010026#include <stdlib.h>
Willy Tarreau7341d942007-05-13 19:56:02 +020027#include <string.h>
Willy Tarreau0f772532006-12-23 20:51:41 +010028
Willy Tarreaue3ba5f02006-06-29 18:54:54 +020029#include <common/config.h>
Willy Tarreauc7e42382012-08-24 19:22:53 +020030#include <common/chunk.h>
Willy Tarreau7341d942007-05-13 19:56:02 +020031#include <common/memory.h>
Willy Tarreau0c303ee2008-07-07 00:09:58 +020032#include <common/ticks.h>
Willy Tarreaufa645582007-06-03 15:59:52 +020033#include <common/time.h>
34
Willy Tarreau7c3c5412009-12-13 15:53:05 +010035#include <types/global.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020036
Willy Tarreau8263d2b2012-08-28 00:06:31 +020037extern struct pool_head *pool2_channel;
Willy Tarreau7341d942007-05-13 19:56:02 +020038
39/* perform minimal intializations, report 0 in case of error, 1 if OK. */
Willy Tarreau8263d2b2012-08-28 00:06:31 +020040int init_channel();
Willy Tarreau7341d942007-05-13 19:56:02 +020041
Willy Tarreau8263d2b2012-08-28 00:06:31 +020042unsigned long long channel_forward(struct channel *buf, unsigned long long bytes);
43
44/* SI-to-channel functions working with buffers */
Willy Tarreau7421efb2012-07-02 15:11:27 +020045int bi_putblk(struct channel *buf, const char *str, int len);
46int bi_putchr(struct channel *buf, char c);
Willy Tarreau8263d2b2012-08-28 00:06:31 +020047int bo_inject(struct channel *buf, const char *msg, int len);
Willy Tarreau7421efb2012-07-02 15:11:27 +020048int bo_getline(struct channel *buf, char *str, int len);
49int bo_getblk(struct channel *buf, char *blk, int len, int offset);
Willy Tarreau74b08c92010-09-08 17:04:31 +020050
Willy Tarreau8263d2b2012-08-28 00:06:31 +020051/* Initialize all fields in the channel. */
52static inline void channel_init(struct channel *buf)
Willy Tarreau54469402006-07-29 16:59:06 +020053{
Willy Tarreau572bf902012-07-02 17:01:20 +020054 buf->buf.o = 0;
55 buf->buf.i = 0;
56 buf->buf.p = buf->buf.data;
Willy Tarreau6b66f3e2008-12-14 17:31:54 +010057 buf->to_forward = 0;
Willy Tarreau02d6cfc2012-03-01 18:19:58 +010058 buf->total = 0;
Willy Tarreau3eba98a2009-01-25 13:56:13 +010059 buf->pipe = NULL;
Willy Tarreau2df28e82008-08-17 15:20:19 +020060 buf->analysers = 0;
Willy Tarreaufa7e1022008-10-19 07:30:41 +020061 buf->cons = NULL;
Willy Tarreau8e21bb92012-08-24 22:40:29 +020062 buf->flags = 0;
Willy Tarreau54469402006-07-29 16:59:06 +020063}
64
Willy Tarreau8263d2b2012-08-28 00:06:31 +020065/*********************************************************************/
66/* These functions are used to compute various channel content sizes */
67/*********************************************************************/
Willy Tarreau4b517ca2011-11-25 20:33:58 +010068
Willy Tarreau8e21bb92012-08-24 22:40:29 +020069/* Reports non-zero if the channel is empty, which means both its
70 * buffer and pipe are empty. The construct looks strange but is
71 * jump-less and much more efficient on both 32 and 64-bit than
72 * the boolean test.
73 */
74static inline unsigned int channel_is_empty(struct channel *c)
75{
76 return !(c->buf.o | (long)c->pipe);
77}
78
Willy Tarreau9dab5fc2012-05-07 11:56:55 +020079/* Returns non-zero if the buffer input is considered full. The reserved space
80 * is taken into account if ->to_forward indicates that an end of transfer is
81 * close to happen. The test is optimized to avoid as many operations as
82 * possible for the fast case and to be used as an "if" condition.
Willy Tarreau4b517ca2011-11-25 20:33:58 +010083 */
Willy Tarreauad1cc3d2012-08-27 18:54:20 +020084static inline int channel_full(const struct channel *b)
Willy Tarreau4b517ca2011-11-25 20:33:58 +010085{
Willy Tarreau572bf902012-07-02 17:01:20 +020086 int rem = b->buf.size;
Willy Tarreau9dab5fc2012-05-07 11:56:55 +020087
Willy Tarreau572bf902012-07-02 17:01:20 +020088 rem -= b->buf.o;
89 rem -= b->buf.i;
Willy Tarreau9dab5fc2012-05-07 11:56:55 +020090 if (!rem)
91 return 1; /* buffer already full */
92
Willy Tarreau572bf902012-07-02 17:01:20 +020093 if (b->to_forward >= b->buf.size ||
Willy Tarreau03cdb7c2012-08-27 23:14:58 +020094 (CHN_INFINITE_FORWARD < MAX_RANGE(typeof(b->buf.size)) && // just there to ensure gcc
95 b->to_forward == CHN_INFINITE_FORWARD)) // avoids the useless second
Willy Tarreau9dab5fc2012-05-07 11:56:55 +020096 return 0; // test whenever possible
97
98 rem -= global.tune.maxrewrite;
Willy Tarreau572bf902012-07-02 17:01:20 +020099 rem += b->buf.o;
Willy Tarreau9dab5fc2012-05-07 11:56:55 +0200100 rem += b->to_forward;
101 return rem <= 0;
Willy Tarreau4b517ca2011-11-25 20:33:58 +0100102}
103
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200104/* Returns true if the channel's input is already closed */
105static inline int channel_input_closed(struct channel *buf)
Willy Tarreau74b08c92010-09-08 17:04:31 +0200106{
Willy Tarreau03cdb7c2012-08-27 23:14:58 +0200107 return ((buf->flags & CF_SHUTR) != 0);
Willy Tarreau74b08c92010-09-08 17:04:31 +0200108}
109
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200110/* Returns true if the channel's output is already closed */
111static inline int channel_output_closed(struct channel *buf)
Willy Tarreau74b08c92010-09-08 17:04:31 +0200112{
Willy Tarreau03cdb7c2012-08-27 23:14:58 +0200113 return ((buf->flags & CF_SHUTW) != 0);
Willy Tarreau74b08c92010-09-08 17:04:31 +0200114}
115
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200116/* Check channel timeouts, and set the corresponding flags. The likely/unlikely
117 * have been optimized for fastest normal path. The read/write timeouts are not
118 * set if there was activity on the channel. That way, we don't have to update
119 * the timeout on every I/O. Note that the analyser timeout is always checked.
Willy Tarreau2eb52f02008-09-04 09:14:08 +0200120 */
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200121static inline void channel_check_timeouts(struct channel *b)
Willy Tarreau2eb52f02008-09-04 09:14:08 +0200122{
Willy Tarreau03cdb7c2012-08-27 23:14:58 +0200123 if (likely(!(b->flags & (CF_SHUTR|CF_READ_TIMEOUT|CF_READ_ACTIVITY|CF_READ_NOEXP))) &&
Willy Tarreau2eb52f02008-09-04 09:14:08 +0200124 unlikely(tick_is_expired(b->rex, now_ms)))
Willy Tarreau03cdb7c2012-08-27 23:14:58 +0200125 b->flags |= CF_READ_TIMEOUT;
Willy Tarreau2eb52f02008-09-04 09:14:08 +0200126
Willy Tarreau03cdb7c2012-08-27 23:14:58 +0200127 if (likely(!(b->flags & (CF_SHUTW|CF_WRITE_TIMEOUT|CF_WRITE_ACTIVITY))) &&
Willy Tarreau2eb52f02008-09-04 09:14:08 +0200128 unlikely(tick_is_expired(b->wex, now_ms)))
Willy Tarreau03cdb7c2012-08-27 23:14:58 +0200129 b->flags |= CF_WRITE_TIMEOUT;
Willy Tarreau2eb52f02008-09-04 09:14:08 +0200130
Willy Tarreau03cdb7c2012-08-27 23:14:58 +0200131 if (likely(!(b->flags & CF_ANA_TIMEOUT)) &&
Willy Tarreau2eb52f02008-09-04 09:14:08 +0200132 unlikely(tick_is_expired(b->analyse_exp, now_ms)))
Willy Tarreau03cdb7c2012-08-27 23:14:58 +0200133 b->flags |= CF_ANA_TIMEOUT;
Willy Tarreau2eb52f02008-09-04 09:14:08 +0200134}
135
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200136/* Erase any content from channel <buf> and adjusts flags accordingly. Note
Willy Tarreau0abebcc2009-01-08 00:09:41 +0100137 * that any spliced data is not affected since we may not have any access to
138 * it.
Willy Tarreaue393fe22008-08-16 22:18:07 +0200139 */
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200140static inline void channel_erase(struct channel *buf)
Willy Tarreaubaaee002006-06-26 02:48:02 +0200141{
Willy Tarreau572bf902012-07-02 17:01:20 +0200142 buf->buf.o = 0;
143 buf->buf.i = 0;
Willy Tarreau6b66f3e2008-12-14 17:31:54 +0100144 buf->to_forward = 0;
Willy Tarreau572bf902012-07-02 17:01:20 +0200145 buf->buf.p = buf->buf.data;
Willy Tarreaubaaee002006-06-26 02:48:02 +0200146}
147
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200148/* marks the channel as "shutdown" ASAP for reads */
149static inline void channel_shutr_now(struct channel *buf)
Willy Tarreaufa7e1022008-10-19 07:30:41 +0200150{
Willy Tarreau03cdb7c2012-08-27 23:14:58 +0200151 buf->flags |= CF_SHUTR_NOW;
Willy Tarreaufa7e1022008-10-19 07:30:41 +0200152}
153
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200154/* marks the channel as "shutdown" ASAP for writes */
155static inline void channel_shutw_now(struct channel *buf)
Willy Tarreaufa7e1022008-10-19 07:30:41 +0200156{
Willy Tarreau03cdb7c2012-08-27 23:14:58 +0200157 buf->flags |= CF_SHUTW_NOW;
Willy Tarreaufa7e1022008-10-19 07:30:41 +0200158}
159
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200160/* marks the channel as "shutdown" ASAP in both directions */
161static inline void channel_abort(struct channel *buf)
Willy Tarreaufa7e1022008-10-19 07:30:41 +0200162{
Willy Tarreau03cdb7c2012-08-27 23:14:58 +0200163 buf->flags |= CF_SHUTR_NOW | CF_SHUTW_NOW;
164 buf->flags &= ~CF_AUTO_CONNECT;
Willy Tarreaufa7e1022008-10-19 07:30:41 +0200165}
166
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200167/* Installs <func> as a hijacker on the channel <b> for session <s>. The hijack
Willy Tarreau01bf8672008-12-07 18:03:29 +0100168 * flag is set, and the function called once. The function is responsible for
169 * clearing the hijack bit. It is possible that the function clears the flag
170 * during this first call.
171 */
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200172static inline void channel_install_hijacker(struct session *s,
Willy Tarreau7421efb2012-07-02 15:11:27 +0200173 struct channel *b,
174 void (*func)(struct session *, struct channel *))
Willy Tarreau72b179a2008-08-28 16:01:32 +0200175{
Willy Tarreau01bf8672008-12-07 18:03:29 +0100176 b->hijacker = func;
Willy Tarreau03cdb7c2012-08-27 23:14:58 +0200177 b->flags |= CF_HIJACK;
Willy Tarreau01bf8672008-12-07 18:03:29 +0100178 func(s, b);
Willy Tarreau72b179a2008-08-28 16:01:32 +0200179}
180
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200181/* Releases the channel from hijacking mode. Often used by the hijack function */
182static inline void channel_stop_hijacker(struct channel *buf)
Willy Tarreau72b179a2008-08-28 16:01:32 +0200183{
Willy Tarreau03cdb7c2012-08-27 23:14:58 +0200184 buf->flags &= ~CF_HIJACK;
Willy Tarreau72b179a2008-08-28 16:01:32 +0200185}
186
Willy Tarreau520d95e2009-09-19 21:04:57 +0200187/* allow the consumer to try to establish a new connection. */
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200188static inline void channel_auto_connect(struct channel *buf)
Willy Tarreau3da77c52008-08-29 09:58:42 +0200189{
Willy Tarreau03cdb7c2012-08-27 23:14:58 +0200190 buf->flags |= CF_AUTO_CONNECT;
Willy Tarreau3da77c52008-08-29 09:58:42 +0200191}
192
Willy Tarreau520d95e2009-09-19 21:04:57 +0200193/* prevent the consumer from trying to establish a new connection, and also
194 * disable auto shutdown forwarding.
195 */
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200196static inline void channel_dont_connect(struct channel *buf)
Willy Tarreau3da77c52008-08-29 09:58:42 +0200197{
Willy Tarreau03cdb7c2012-08-27 23:14:58 +0200198 buf->flags &= ~(CF_AUTO_CONNECT|CF_AUTO_CLOSE);
Willy Tarreau3da77c52008-08-29 09:58:42 +0200199}
200
Willy Tarreau520d95e2009-09-19 21:04:57 +0200201/* allow the producer to forward shutdown requests */
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200202static inline void channel_auto_close(struct channel *buf)
Willy Tarreau0a5d5dd2008-11-23 19:31:35 +0100203{
Willy Tarreau03cdb7c2012-08-27 23:14:58 +0200204 buf->flags |= CF_AUTO_CLOSE;
Willy Tarreau0a5d5dd2008-11-23 19:31:35 +0100205}
206
Willy Tarreau520d95e2009-09-19 21:04:57 +0200207/* prevent the producer from forwarding shutdown requests */
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200208static inline void channel_dont_close(struct channel *buf)
Willy Tarreau0a5d5dd2008-11-23 19:31:35 +0100209{
Willy Tarreau03cdb7c2012-08-27 23:14:58 +0200210 buf->flags &= ~CF_AUTO_CLOSE;
Willy Tarreau0a5d5dd2008-11-23 19:31:35 +0100211}
212
Willy Tarreau90deb182010-01-07 00:20:41 +0100213/* allow the producer to read / poll the input */
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200214static inline void channel_auto_read(struct channel *buf)
Willy Tarreau90deb182010-01-07 00:20:41 +0100215{
Willy Tarreau03cdb7c2012-08-27 23:14:58 +0200216 buf->flags &= ~CF_DONT_READ;
Willy Tarreau90deb182010-01-07 00:20:41 +0100217}
218
219/* prevent the producer from read / poll the input */
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200220static inline void channel_dont_read(struct channel *buf)
Willy Tarreau90deb182010-01-07 00:20:41 +0100221{
Willy Tarreau03cdb7c2012-08-27 23:14:58 +0200222 buf->flags |= CF_DONT_READ;
Willy Tarreau90deb182010-01-07 00:20:41 +0100223}
224
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200225
226/*************************************************/
227/* Buffer operations in the context of a channel */
228/*************************************************/
229
230
231/* Return the number of reserved bytes in the channel's visible
232 * buffer, which ensures that once all pending data are forwarded, the
233 * buffer still has global.tune.maxrewrite bytes free. The result is
234 * between 0 and global.tune.maxrewrite, which is itself smaller than
235 * any buf->size.
236 */
237static inline int buffer_reserved(const struct channel *buf)
238{
239 int ret = global.tune.maxrewrite - buf->to_forward - buf->buf.o;
240
241 if (buf->to_forward == CHN_INFINITE_FORWARD)
242 return 0;
243 if (ret <= 0)
244 return 0;
245 return ret;
246}
247
248/* Return the max number of bytes the buffer can contain so that once all the
249 * pending bytes are forwarded, the buffer still has global.tune.maxrewrite
250 * bytes free. The result sits between buf->size - maxrewrite and buf->size.
251 */
252static inline int buffer_max_len(const struct channel *buf)
253{
254 return buf->buf.size - buffer_reserved(buf);
255}
256
257/* Return the amount of bytes that can be written into the buffer at once,
258 * excluding reserved space, which is preserved.
259 */
260static inline int buffer_contig_space_res(const struct channel *chn)
261{
262 return buffer_contig_space_with_res(&chn->buf, buffer_reserved(chn));
263}
264
265/* Returns the amount of space available at the input of the buffer, taking the
266 * reserved space into account if ->to_forward indicates that an end of transfer
267 * is close to happen. The test is optimized to avoid as many operations as
268 * possible for the fast case.
269 */
270static inline int bi_avail(const struct channel *b)
271{
272 int rem = b->buf.size;
273 int rem2;
274
275 rem -= b->buf.o;
276 rem -= b->buf.i;
277 if (!rem)
278 return rem; /* buffer already full */
279
280 if (b->to_forward >= b->buf.size ||
281 (CHN_INFINITE_FORWARD < MAX_RANGE(typeof(b->buf.size)) && // just there to ensure gcc
282 b->to_forward == CHN_INFINITE_FORWARD)) // avoids the useless second
283 return rem; // test whenever possible
284
285 rem2 = rem - global.tune.maxrewrite;
286 rem2 += b->buf.o;
287 rem2 += b->to_forward;
288
289 if (rem > rem2)
290 rem = rem2;
291 if (rem > 0)
292 return rem;
293 return 0;
294}
295
296/* Cut the "tail" of the channel's buffer, which means strip it to the length
297 * of unsent data only, and kill any remaining unsent data. Any scheduled
298 * forwarding is stopped. This is mainly to be used to send error messages
299 * after existing data.
300 */
301static inline void bi_erase(struct channel *buf)
302{
303 if (!buf->buf.o)
304 return channel_erase(buf);
305
306 buf->to_forward = 0;
307 if (!buf->buf.i)
308 return;
309
310 buf->buf.i = 0;
311}
312
Willy Tarreaubaaee002006-06-26 02:48:02 +0200313/*
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200314 * Advance the channel buffer's read pointer by <len> bytes. This is useful
315 * when data have been read directly from the buffer. It is illegal to call
316 * this function with <len> causing a wrapping at the end of the buffer. It's
317 * the caller's responsibility to ensure that <len> is never larger than
318 * buf->o. Channel flag WRITE_PARTIAL is set.
Willy Tarreau2b7addc2009-08-31 07:37:22 +0200319 */
Willy Tarreau7421efb2012-07-02 15:11:27 +0200320static inline void bo_skip(struct channel *buf, int len)
Willy Tarreau2b7addc2009-08-31 07:37:22 +0200321{
Willy Tarreau572bf902012-07-02 17:01:20 +0200322 buf->buf.o -= len;
Willy Tarreau9dab5fc2012-05-07 11:56:55 +0200323
Willy Tarreau572bf902012-07-02 17:01:20 +0200324 if (buffer_len(&buf->buf) == 0)
325 buf->buf.p = buf->buf.data;
Willy Tarreau2b7addc2009-08-31 07:37:22 +0200326
Willy Tarreaufb0e9202009-09-23 23:47:55 +0200327 /* notify that some data was written to the SI from the buffer */
Willy Tarreau03cdb7c2012-08-27 23:14:58 +0200328 buf->flags |= CF_WRITE_PARTIAL;
Willy Tarreau2b7addc2009-08-31 07:37:22 +0200329}
Willy Tarreaubaaee002006-06-26 02:48:02 +0200330
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200331/* Tries to copy chunk <chunk> into the channel's buffer after length controls.
332 * The buf->o and to_forward pointers are updated. If the channel's input is
Willy Tarreau74b08c92010-09-08 17:04:31 +0200333 * closed, -2 is returned. If the block is too large for this buffer, -3 is
334 * returned. If there is not enough room left in the buffer, -1 is returned.
335 * Otherwise the number of bytes copied is returned (0 being a valid number).
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200336 * Channel flag READ_PARTIAL is updated if some data can be transferred. The
Willy Tarreauf941cf22012-08-27 20:53:34 +0200337 * chunk's length is updated with the number of bytes sent.
Willy Tarreauaeac3192009-08-31 08:09:57 +0200338 */
Willy Tarreau7421efb2012-07-02 15:11:27 +0200339static inline int bi_putchk(struct channel *buf, struct chunk *chunk)
Willy Tarreauaeac3192009-08-31 08:09:57 +0200340{
341 int ret;
342
Willy Tarreau9dab5fc2012-05-07 11:56:55 +0200343 ret = bi_putblk(buf, chunk->str, chunk->len);
Willy Tarreau74b08c92010-09-08 17:04:31 +0200344 if (ret > 0)
345 chunk->len -= ret;
Willy Tarreauaeac3192009-08-31 08:09:57 +0200346 return ret;
347}
348
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200349/* Tries to copy string <str> at once into the channel's buffer after length
350 * controls. The buf->o and to_forward pointers are updated. If the channel's
351 * input is closed, -2 is returned. If the block is too large for this buffer,
352 * -3 is returned. If there is not enough room left in the buffer, -1 is
353 * returned. Otherwise the number of bytes copied is returned (0 being a valid
354 * number). Channel flag READ_PARTIAL is updated if some data can be
355 * transferred.
Willy Tarreau74b08c92010-09-08 17:04:31 +0200356 */
Willy Tarreau7421efb2012-07-02 15:11:27 +0200357static inline int bi_putstr(struct channel *buf, const char *str)
Willy Tarreau74b08c92010-09-08 17:04:31 +0200358{
Willy Tarreau9dab5fc2012-05-07 11:56:55 +0200359 return bi_putblk(buf, str, strlen(str));
Willy Tarreau74b08c92010-09-08 17:04:31 +0200360}
361
362/*
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200363 * Return one char from the channel's buffer. If the buffer is empty and the
364 * channel is closed, return -2. If the buffer is just empty, return -1. The
365 * buffer's pointer is not advanced, it's up to the caller to call bo_skip(buf,
366 * 1) when it has consumed the char. Also note that this function respects the
367 * buf->o limit.
Willy Tarreau74b08c92010-09-08 17:04:31 +0200368 */
Willy Tarreau7421efb2012-07-02 15:11:27 +0200369static inline int bo_getchr(struct channel *buf)
Willy Tarreau74b08c92010-09-08 17:04:31 +0200370{
371 /* closed or empty + imminent close = -2; empty = -1 */
Willy Tarreau03cdb7c2012-08-27 23:14:58 +0200372 if (unlikely((buf->flags & CF_SHUTW) || channel_is_empty(buf))) {
373 if (buf->flags & (CF_SHUTW|CF_SHUTW_NOW))
Willy Tarreau74b08c92010-09-08 17:04:31 +0200374 return -2;
375 return -1;
376 }
Willy Tarreau572bf902012-07-02 17:01:20 +0200377 return *buffer_wrap_sub(&buf->buf, buf->buf.p - buf->buf.o);
Willy Tarreau74b08c92010-09-08 17:04:31 +0200378}
379
Willy Tarreaubaaee002006-06-26 02:48:02 +0200380
Willy Tarreauc7e42382012-08-24 19:22:53 +0200381#endif /* _PROTO_CHANNEL_H */
Willy Tarreaubaaee002006-06-26 02:48:02 +0200382
383/*
384 * Local variables:
385 * c-indent-level: 8
386 * c-basic-offset: 8
387 * End:
388 */