blob: 09ea0e3a2ddbc1ff6f870f1014717acb790bc0fd [file] [log] [blame]
Willy Tarreaubaaee002006-06-26 02:48:02 +02001/*
Willy Tarreauc7e42382012-08-24 19:22:53 +02002 * Channel management functions.
Willy Tarreaubaaee002006-06-26 02:48:02 +02003 *
Willy Tarreaua27dc192014-11-27 22:10:04 +01004 * Copyright 2000-2014 Willy Tarreau <w@1wt.eu>
Willy Tarreaubaaee002006-06-26 02:48:02 +02005 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version
9 * 2 of the License, or (at your option) any later version.
10 *
11 */
12
Krzysztof Piotr Oledzkiba8d7d32009-10-10 21:06:03 +020013#include <ctype.h>
Willy Tarreauc0dde7a2007-01-01 21:38:07 +010014#include <stdarg.h>
15#include <stdio.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020016#include <string.h>
Willy Tarreaue3ba5f02006-06-29 18:54:54 +020017
18#include <common/config.h>
Willy Tarreauc7e42382012-08-24 19:22:53 +020019#include <common/buffer.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020020
Willy Tarreau9b28e032012-10-12 23:49:43 +020021#include <proto/channel.h>
Willy Tarreauc7e42382012-08-24 19:22:53 +020022
Willy Tarreau7341d942007-05-13 19:56:02 +020023
Willy Tarreau8263d2b2012-08-28 00:06:31 +020024/* Schedule up to <bytes> more bytes to be forwarded via the channel without
25 * notifying the owner task. Any data pending in the buffer are scheduled to be
Willy Tarreau8bf242b2016-05-04 14:05:58 +020026 * sent as well, within the limit of the number of bytes to forward. This must
27 * be the only method to use to schedule bytes to be forwarded. If the requested
Willy Tarreau8263d2b2012-08-28 00:06:31 +020028 * number is too large, it is automatically adjusted. The number of bytes taken
29 * into account is returned. Directly touching ->to_forward will cause lockups
30 * when buf->o goes down to zero if nobody is ready to push the remaining data.
Willy Tarreau0bc34932011-03-28 16:25:58 +020031 */
Willy Tarreau55a69062012-10-26 00:21:52 +020032unsigned long long __channel_forward(struct channel *chn, unsigned long long bytes)
Willy Tarreau0bc34932011-03-28 16:25:58 +020033{
Willy Tarreau8bf242b2016-05-04 14:05:58 +020034 unsigned int budget;
Willy Tarreau02d6cfc2012-03-01 18:19:58 +010035 unsigned int forwarded;
Willy Tarreau0bc34932011-03-28 16:25:58 +020036
Willy Tarreau8bf242b2016-05-04 14:05:58 +020037 /* This is more of a safety measure as it's not supposed to happen in
38 * regular code paths.
Willy Tarreau0bc34932011-03-28 16:25:58 +020039 */
Willy Tarreau8bf242b2016-05-04 14:05:58 +020040 if (unlikely(chn->to_forward == CHN_INFINITE_FORWARD)) {
Willy Tarreaucd9e60d2018-06-19 07:33:28 +020041 c_adv(chn, ci_data(chn));
Willy Tarreau02d6cfc2012-03-01 18:19:58 +010042 return bytes;
43 }
44
Willy Tarreau8bf242b2016-05-04 14:05:58 +020045 /* Bound the transferred size to a 32-bit count since all our values
46 * are 32-bit, and we don't want to reach CHN_INFINITE_FORWARD.
47 */
48 budget = MIN(bytes, CHN_INFINITE_FORWARD - 1);
Willy Tarreau0bc34932011-03-28 16:25:58 +020049
Willy Tarreau8bf242b2016-05-04 14:05:58 +020050 /* transfer as much as we can of buf->i */
Willy Tarreaucd9e60d2018-06-19 07:33:28 +020051 forwarded = MIN(ci_data(chn), budget);
Willy Tarreaubcbd3932018-06-06 07:13:22 +020052 c_adv(chn, forwarded);
Willy Tarreau8bf242b2016-05-04 14:05:58 +020053 budget -= forwarded;
Willy Tarreau0bc34932011-03-28 16:25:58 +020054
Willy Tarreau8bf242b2016-05-04 14:05:58 +020055 if (!budget)
56 return forwarded;
57
58 /* Now we must ensure chn->to_forward sats below CHN_INFINITE_FORWARD,
59 * which also implies it won't overflow. It's less operations in 64-bit.
60 */
61 bytes = (unsigned long long)chn->to_forward + budget;
62 if (bytes >= CHN_INFINITE_FORWARD)
63 bytes = CHN_INFINITE_FORWARD - 1;
64 budget = bytes - chn->to_forward;
65
66 chn->to_forward += budget;
67 forwarded += budget;
68 return forwarded;
Willy Tarreau0bc34932011-03-28 16:25:58 +020069}
Willy Tarreaubaaee002006-06-26 02:48:02 +020070
Willy Tarreau8263d2b2012-08-28 00:06:31 +020071/* writes <len> bytes from message <msg> to the channel's buffer. Returns -1 in
72 * case of success, -2 if the message is larger than the buffer size, or the
73 * number of bytes available otherwise. The send limit is automatically
74 * adjusted to the amount of data written. FIXME-20060521: handle unaligned
75 * data. Note: this function appends data to the buffer's output and possibly
76 * overwrites any pending input data which are assumed not to exist.
Willy Tarreaubaaee002006-06-26 02:48:02 +020077 */
Willy Tarreau06d80a92017-10-19 14:32:15 +020078int co_inject(struct channel *chn, const char *msg, int len)
Willy Tarreaubaaee002006-06-26 02:48:02 +020079{
80 int max;
81
Willy Tarreauaeac3192009-08-31 08:09:57 +020082 if (len == 0)
83 return -1;
Willy Tarreaubaaee002006-06-26 02:48:02 +020084
Willy Tarreaucd9e60d2018-06-19 07:33:28 +020085 if (len < 0 || len > c_size(chn)) {
Willy Tarreau078e2942009-08-18 07:19:39 +020086 /* we can't write this chunk and will never be able to, because
87 * it is larger than the buffer. This must be reported as an
88 * error. Then we return -2 so that writers that don't care can
89 * ignore it and go on, and others can check for this value.
90 */
91 return -2;
92 }
93
Willy Tarreaud5b343b2018-06-06 06:42:46 +020094 c_realign_if_empty(chn);
Willy Tarreauc9fa0482018-07-10 17:43:27 +020095 max = b_contig_space(&chn->buf);
Willy Tarreaubaaee002006-06-26 02:48:02 +020096 if (len > max)
97 return max;
98
Christopher Faulet9316c422020-01-07 10:01:57 +010099 memcpy(co_tail(chn), msg, len);
Willy Tarreauc9fa0482018-07-10 17:43:27 +0200100 b_add(&chn->buf, len);
Olivier Houchardacd14032018-06-28 18:17:23 +0200101 c_adv(chn, len);
Willy Tarreau974ced62012-10-12 23:11:02 +0200102 chn->total += len;
Krzysztof Piotr Oledzki8e4b21d2008-04-20 21:34:47 +0200103 return -1;
Willy Tarreaubaaee002006-06-26 02:48:02 +0200104}
105
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200106/* Tries to copy character <c> into the channel's buffer after some length
Willy Tarreau974ced62012-10-12 23:11:02 +0200107 * controls. The chn->o and to_forward pointers are updated. If the channel
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200108 * input is closed, -2 is returned. If there is not enough room left in the
109 * buffer, -1 is returned. Otherwise the number of bytes copied is returned
110 * (1). Channel flag READ_PARTIAL is updated if some data can be transferred.
Willy Tarreauc0dde7a2007-01-01 21:38:07 +0100111 */
Willy Tarreau06d80a92017-10-19 14:32:15 +0200112int ci_putchr(struct channel *chn, char c)
Willy Tarreauc0dde7a2007-01-01 21:38:07 +0100113{
Willy Tarreau974ced62012-10-12 23:11:02 +0200114 if (unlikely(channel_input_closed(chn)))
Willy Tarreau74b08c92010-09-08 17:04:31 +0200115 return -2;
Willy Tarreauc0dde7a2007-01-01 21:38:07 +0100116
Willy Tarreaubc18da12015-03-13 14:00:47 +0100117 if (!channel_may_recv(chn))
Krzysztof Piotr Oledzki8e4b21d2008-04-20 21:34:47 +0200118 return -1;
Willy Tarreauc0dde7a2007-01-01 21:38:07 +0100119
Willy Tarreau8f9c72d2018-06-07 18:46:28 +0200120 *ci_tail(chn) = c;
Willy Tarreau74b08c92010-09-08 17:04:31 +0200121
Willy Tarreauc9fa0482018-07-10 17:43:27 +0200122 b_add(&chn->buf, 1);
Willy Tarreau974ced62012-10-12 23:11:02 +0200123 chn->flags |= CF_READ_PARTIAL;
Willy Tarreau74b08c92010-09-08 17:04:31 +0200124
Willy Tarreau974ced62012-10-12 23:11:02 +0200125 if (chn->to_forward >= 1) {
126 if (chn->to_forward != CHN_INFINITE_FORWARD)
127 chn->to_forward--;
Willy Tarreaubcbd3932018-06-06 07:13:22 +0200128 c_adv(chn, 1);
Willy Tarreau74b08c92010-09-08 17:04:31 +0200129 }
130
Willy Tarreau974ced62012-10-12 23:11:02 +0200131 chn->total++;
Willy Tarreau74b08c92010-09-08 17:04:31 +0200132 return 1;
133}
134
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200135/* Tries to copy block <blk> at once into the channel's buffer after length
Willy Tarreau974ced62012-10-12 23:11:02 +0200136 * controls. The chn->o and to_forward pointers are updated. If the channel
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200137 * input is closed, -2 is returned. If the block is too large for this buffer,
138 * -3 is returned. If there is not enough room left in the buffer, -1 is
139 * returned. Otherwise the number of bytes copied is returned (0 being a valid
140 * number). Channel flag READ_PARTIAL is updated if some data can be
Willy Tarreaubc18da12015-03-13 14:00:47 +0100141 * transferred.
Willy Tarreau74b08c92010-09-08 17:04:31 +0200142 */
Willy Tarreau06d80a92017-10-19 14:32:15 +0200143int ci_putblk(struct channel *chn, const char *blk, int len)
Willy Tarreau74b08c92010-09-08 17:04:31 +0200144{
145 int max;
146
Willy Tarreau974ced62012-10-12 23:11:02 +0200147 if (unlikely(channel_input_closed(chn)))
Willy Tarreau74b08c92010-09-08 17:04:31 +0200148 return -2;
149
Willy Tarreau320ec2a2016-02-25 16:15:19 +0100150 if (len < 0)
151 return -3;
152
Willy Tarreau3f5096d2015-01-14 20:21:43 +0100153 max = channel_recv_limit(chn);
Willy Tarreaucd9e60d2018-06-19 07:33:28 +0200154 if (unlikely(len > max - c_data(chn))) {
Willy Tarreau591fedc2010-08-10 15:28:21 +0200155 /* we can't write this chunk right now because the buffer is
156 * almost full or because the block is too large. Return the
157 * available space or -2 if impossible.
Willy Tarreau078e2942009-08-18 07:19:39 +0200158 */
Willy Tarreau591fedc2010-08-10 15:28:21 +0200159 if (len > max)
Willy Tarreau74b08c92010-09-08 17:04:31 +0200160 return -3;
Willy Tarreau078e2942009-08-18 07:19:39 +0200161
Willy Tarreau74b08c92010-09-08 17:04:31 +0200162 return -1;
Willy Tarreau591fedc2010-08-10 15:28:21 +0200163 }
Willy Tarreauc0dde7a2007-01-01 21:38:07 +0100164
Willy Tarreau74b08c92010-09-08 17:04:31 +0200165 if (unlikely(len == 0))
166 return 0;
167
Willy Tarreau591fedc2010-08-10 15:28:21 +0200168 /* OK so the data fits in the buffer in one or two blocks */
Willy Tarreauc9fa0482018-07-10 17:43:27 +0200169 max = b_contig_space(&chn->buf);
Willy Tarreau8f9c72d2018-06-07 18:46:28 +0200170 memcpy(ci_tail(chn), blk, MIN(len, max));
Willy Tarreauaeac3192009-08-31 08:09:57 +0200171 if (len > max)
Willy Tarreaucd9e60d2018-06-19 07:33:28 +0200172 memcpy(c_orig(chn), blk + max, len - max);
Willy Tarreauc0dde7a2007-01-01 21:38:07 +0100173
Willy Tarreauc9fa0482018-07-10 17:43:27 +0200174 b_add(&chn->buf, len);
Christopher Faulete6458292019-01-02 14:24:35 +0100175 channel_add_input(chn, len);
Willy Tarreau74b08c92010-09-08 17:04:31 +0200176 return len;
Willy Tarreauc0dde7a2007-01-01 21:38:07 +0100177}
178
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200179/* Gets one text line out of a channel's buffer from a stream interface.
Willy Tarreau4fe7a2e2009-09-01 06:41:32 +0200180 * Return values :
181 * >0 : number of bytes read. Includes the \n if present before len or end.
Willy Tarreau74b08c92010-09-08 17:04:31 +0200182 * =0 : no '\n' before end found. <str> is left undefined.
183 * <0 : no more bytes readable because output is shut.
Willy Tarreau06d80a92017-10-19 14:32:15 +0200184 * The channel status is not changed. The caller must call co_skip() to
Willy Tarreau4fe7a2e2009-09-01 06:41:32 +0200185 * update it. The '\n' is waited for as long as neither the buffer nor the
186 * output are full. If either of them is full, the string may be returned
187 * as is, without the '\n'.
188 */
Willy Tarreau41ab8682017-10-19 14:58:40 +0200189int co_getline(const struct channel *chn, char *str, int len)
Willy Tarreau4fe7a2e2009-09-01 06:41:32 +0200190{
191 int ret, max;
192 char *p;
193
194 ret = 0;
195 max = len;
Willy Tarreau74b08c92010-09-08 17:04:31 +0200196
197 /* closed or empty + imminent close = -1; empty = 0 */
Willy Tarreau974ced62012-10-12 23:11:02 +0200198 if (unlikely((chn->flags & CF_SHUTW) || channel_is_empty(chn))) {
199 if (chn->flags & (CF_SHUTW|CF_SHUTW_NOW))
Willy Tarreau4fe7a2e2009-09-01 06:41:32 +0200200 ret = -1;
201 goto out;
202 }
203
Willy Tarreaucd9e60d2018-06-19 07:33:28 +0200204 p = co_head(chn);
Willy Tarreau4fe7a2e2009-09-01 06:41:32 +0200205
Willy Tarreaucd9e60d2018-06-19 07:33:28 +0200206 if (max > co_data(chn)) {
207 max = co_data(chn);
Willy Tarreau2e1dd3d2009-09-23 22:56:07 +0200208 str[max-1] = 0;
Willy Tarreau4fe7a2e2009-09-01 06:41:32 +0200209 }
210 while (max) {
211 *str++ = *p;
212 ret++;
213 max--;
214
215 if (*p == '\n')
216 break;
Willy Tarreauc9fa0482018-07-10 17:43:27 +0200217 p = b_next(&chn->buf, p);
Willy Tarreau4fe7a2e2009-09-01 06:41:32 +0200218 }
Willy Tarreau82de2b62013-12-10 18:58:23 +0100219 if (ret > 0 && ret < len &&
Willy Tarreaucd9e60d2018-06-19 07:33:28 +0200220 (ret < co_data(chn) || channel_may_recv(chn)) &&
Willy Tarreau2e1dd3d2009-09-23 22:56:07 +0200221 *(str-1) != '\n' &&
Willy Tarreau974ced62012-10-12 23:11:02 +0200222 !(chn->flags & (CF_SHUTW|CF_SHUTW_NOW)))
Willy Tarreau4fe7a2e2009-09-01 06:41:32 +0200223 ret = 0;
224 out:
225 if (max)
226 *str = 0;
227 return ret;
228}
229
Willy Tarreau8263d2b2012-08-28 00:06:31 +0200230/* Gets one full block of data at once from a channel's buffer, optionally from
231 * a specific offset. Return values :
Willy Tarreau74b08c92010-09-08 17:04:31 +0200232 * >0 : number of bytes read, equal to requested size.
233 * =0 : not enough data available. <blk> is left undefined.
234 * <0 : no more bytes readable because output is shut.
Willy Tarreau06d80a92017-10-19 14:32:15 +0200235 * The channel status is not changed. The caller must call co_skip() to
Willy Tarreau74b08c92010-09-08 17:04:31 +0200236 * update it.
237 */
Willy Tarreau41ab8682017-10-19 14:58:40 +0200238int co_getblk(const struct channel *chn, char *blk, int len, int offset)
Willy Tarreau74b08c92010-09-08 17:04:31 +0200239{
Willy Tarreau974ced62012-10-12 23:11:02 +0200240 if (chn->flags & CF_SHUTW)
Willy Tarreau74b08c92010-09-08 17:04:31 +0200241 return -1;
242
Willy Tarreau90ed3832018-06-15 14:20:26 +0200243 if (len + offset > co_data(chn)) {
Willy Tarreau974ced62012-10-12 23:11:02 +0200244 if (chn->flags & (CF_SHUTW|CF_SHUTW_NOW))
Willy Tarreau74b08c92010-09-08 17:04:31 +0200245 return -1;
246 return 0;
247 }
248
Willy Tarreauc9fa0482018-07-10 17:43:27 +0200249 return b_getblk(&chn->buf, blk, len, offset);
Willy Tarreau74b08c92010-09-08 17:04:31 +0200250}
251
Thierry FOURNIERca16b032015-02-16 19:26:48 +0100252/* Gets one or two blocks of data at once from a channel's output buffer.
253 * Return values :
254 * >0 : number of blocks filled (1 or 2). blk1 is always filled before blk2.
255 * =0 : not enough data available. <blk*> are left undefined.
256 * <0 : no more bytes readable because output is shut.
Willy Tarreau06d80a92017-10-19 14:32:15 +0200257 * The channel status is not changed. The caller must call co_skip() to
Thierry FOURNIERca16b032015-02-16 19:26:48 +0100258 * update it. Unused buffers are left in an undefined state.
259 */
Willy Tarreau55f3ce12018-07-18 11:49:27 +0200260int co_getblk_nc(const struct channel *chn, const char **blk1, size_t *len1, const char **blk2, size_t *len2)
Thierry FOURNIERca16b032015-02-16 19:26:48 +0100261{
Willy Tarreaucd9e60d2018-06-19 07:33:28 +0200262 if (unlikely(co_data(chn) == 0)) {
Christopher Fauletfffd1a82020-07-16 11:43:46 +0200263 if (chn->flags & (CF_SHUTW|CF_SHUTW_NOW))
Thierry FOURNIERca16b032015-02-16 19:26:48 +0100264 return -1;
265 return 0;
266 }
267
Willy Tarreauc9fa0482018-07-10 17:43:27 +0200268 return b_getblk_nc(&chn->buf, blk1, len1, blk2, len2, 0, co_data(chn));
Thierry FOURNIERca16b032015-02-16 19:26:48 +0100269}
270
271/* Gets one text line out of a channel's output buffer from a stream interface.
272 * Return values :
273 * >0 : number of blocks returned (1 or 2). blk1 is always filled before blk2.
274 * =0 : not enough data available.
275 * <0 : no more bytes readable because output is shut.
276 * The '\n' is waited for as long as neither the buffer nor the output are
277 * full. If either of them is full, the string may be returned as is, without
278 * the '\n'. Unused buffers are left in an undefined state.
279 */
Willy Tarreau41ab8682017-10-19 14:58:40 +0200280int co_getline_nc(const struct channel *chn,
Willy Tarreau55f3ce12018-07-18 11:49:27 +0200281 const char **blk1, size_t *len1,
282 const char **blk2, size_t *len2)
Thierry FOURNIERca16b032015-02-16 19:26:48 +0100283{
284 int retcode;
285 int l;
286
Willy Tarreau06d80a92017-10-19 14:32:15 +0200287 retcode = co_getblk_nc(chn, blk1, len1, blk2, len2);
Tim Duesterhus45be38c2018-04-24 19:20:43 +0200288 if (unlikely(retcode <= 0))
Thierry FOURNIERca16b032015-02-16 19:26:48 +0100289 return retcode;
290
291 for (l = 0; l < *len1 && (*blk1)[l] != '\n'; l++);
292 if (l < *len1 && (*blk1)[l] == '\n') {
293 *len1 = l + 1;
294 return 1;
295 }
296
297 if (retcode >= 2) {
298 for (l = 0; l < *len2 && (*blk2)[l] != '\n'; l++);
299 if (l < *len2 && (*blk2)[l] == '\n') {
300 *len2 = l + 1;
301 return 2;
302 }
303 }
304
Christopher Fauletfffd1a82020-07-16 11:43:46 +0200305 if (chn->flags & (CF_SHUTW|CF_SHUTW_NOW)) {
Thierry FOURNIERca16b032015-02-16 19:26:48 +0100306 /* If we have found no LF and the buffer is shut, then
307 * the resulting string is made of the concatenation of
308 * the pending blocks (1 or 2).
309 */
310 return retcode;
311 }
312
313 /* No LF yet and not shut yet */
314 return 0;
315}
316
317/* Gets one full block of data at once from a channel's input buffer.
318 * This function can return the data slitted in one or two blocks.
319 * Return values :
320 * >0 : number of blocks returned (1 or 2). blk1 is always filled before blk2.
321 * =0 : not enough data available.
322 * <0 : no more bytes readable because input is shut.
323 */
Willy Tarreau41ab8682017-10-19 14:58:40 +0200324int ci_getblk_nc(const struct channel *chn,
Willy Tarreau55f3ce12018-07-18 11:49:27 +0200325 char **blk1, size_t *len1,
326 char **blk2, size_t *len2)
Thierry FOURNIERca16b032015-02-16 19:26:48 +0100327{
Willy Tarreaucd9e60d2018-06-19 07:33:28 +0200328 if (unlikely(ci_data(chn) == 0)) {
Thierry FOURNIERca16b032015-02-16 19:26:48 +0100329 if (chn->flags & CF_SHUTR)
330 return -1;
331 return 0;
332 }
333
Willy Tarreaucd9e60d2018-06-19 07:33:28 +0200334 if (unlikely(ci_head(chn) + ci_data(chn) > c_wrap(chn))) {
335 *blk1 = ci_head(chn);
336 *len1 = c_wrap(chn) - ci_head(chn);
337 *blk2 = c_orig(chn);
338 *len2 = ci_data(chn) - *len1;
Thierry FOURNIERca16b032015-02-16 19:26:48 +0100339 return 2;
340 }
341
Willy Tarreaucd9e60d2018-06-19 07:33:28 +0200342 *blk1 = ci_head(chn);
343 *len1 = ci_data(chn);
Thierry FOURNIERca16b032015-02-16 19:26:48 +0100344 return 1;
345}
346
347/* Gets one text line out of a channel's input buffer from a stream interface.
348 * Return values :
349 * >0 : number of blocks returned (1 or 2). blk1 is always filled before blk2.
350 * =0 : not enough data available.
351 * <0 : no more bytes readable because output is shut.
352 * The '\n' is waited for as long as neither the buffer nor the input are
353 * full. If either of them is full, the string may be returned as is, without
354 * the '\n'. Unused buffers are left in an undefined state.
355 */
Willy Tarreau41ab8682017-10-19 14:58:40 +0200356int ci_getline_nc(const struct channel *chn,
Willy Tarreau55f3ce12018-07-18 11:49:27 +0200357 char **blk1, size_t *len1,
358 char **blk2, size_t *len2)
Thierry FOURNIERca16b032015-02-16 19:26:48 +0100359{
360 int retcode;
361 int l;
362
Willy Tarreau06d80a92017-10-19 14:32:15 +0200363 retcode = ci_getblk_nc(chn, blk1, len1, blk2, len2);
Thierry FOURNIER / OZON.IO500d11e2016-11-12 17:39:58 +0100364 if (unlikely(retcode <= 0))
Thierry FOURNIERca16b032015-02-16 19:26:48 +0100365 return retcode;
366
367 for (l = 0; l < *len1 && (*blk1)[l] != '\n'; l++);
368 if (l < *len1 && (*blk1)[l] == '\n') {
369 *len1 = l + 1;
370 return 1;
371 }
372
373 if (retcode >= 2) {
374 for (l = 0; l < *len2 && (*blk2)[l] != '\n'; l++);
375 if (l < *len2 && (*blk2)[l] == '\n') {
376 *len2 = l + 1;
377 return 2;
378 }
379 }
380
381 if (chn->flags & CF_SHUTW) {
382 /* If we have found no LF and the buffer is shut, then
383 * the resulting string is made of the concatenation of
384 * the pending blocks (1 or 2).
385 */
386 return retcode;
387 }
388
389 /* No LF yet and not shut yet */
390 return 0;
391}
392
Willy Tarreau4d893d42018-07-12 15:43:32 +0200393/* Inserts <str> followed by "\r\n" at position <pos> relative to channel <c>'s
394 * input head. The <len> argument informs about the length of string <str> so
395 * that we don't have to measure it. <str> must be a valid pointer and must not
396 * include the trailing "\r\n".
397 *
398 * The number of bytes added is returned on success. 0 is returned on failure.
399 */
400int ci_insert_line2(struct channel *c, int pos, const char *str, int len)
401{
Willy Tarreauc9fa0482018-07-10 17:43:27 +0200402 struct buffer *b = &c->buf;
Willy Tarreau4d893d42018-07-12 15:43:32 +0200403 char *dst = c_ptr(c, pos);
404 int delta;
405
406 delta = len + 2;
407
Olivier Houchard363c7452018-09-26 15:09:58 +0200408 if (__b_tail(b) + delta >= b_wrap(b))
Willy Tarreau4d893d42018-07-12 15:43:32 +0200409 return 0; /* no space left */
410
411 if (b_data(b) &&
412 b_tail(b) + delta > b_head(b) &&
413 b_head(b) >= b_tail(b))
414 return 0; /* no space left before wrapping data */
415
416 /* first, protect the end of the buffer */
417 memmove(dst + delta, dst, b_tail(b) - dst);
418
419 /* now, copy str over dst */
420 memcpy(dst, str, len);
421 dst[len] = '\r';
422 dst[len + 1] = '\n';
423
424 b_add(b, delta);
425 return delta;
426}
427
Krzysztof Piotr Oledzkiba8d7d32009-10-10 21:06:03 +0200428/*
Willy Tarreaubaaee002006-06-26 02:48:02 +0200429 * Local variables:
430 * c-indent-level: 8
431 * c-basic-offset: 8
432 * End:
433 */