Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 1 | /* |
Willy Tarreau | 7c3c541 | 2009-12-13 15:53:05 +0100 | [diff] [blame] | 2 | * include/proto/buffers.h |
| 3 | * Buffer management definitions, macros and inline functions. |
| 4 | * |
| 5 | * Copyright (C) 2000-2009 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 Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 21 | |
| 22 | #ifndef _PROTO_BUFFERS_H |
| 23 | #define _PROTO_BUFFERS_H |
| 24 | |
Willy Tarreau | 7341d94 | 2007-05-13 19:56:02 +0200 | [diff] [blame] | 25 | #include <stdio.h> |
Willy Tarreau | 0f77253 | 2006-12-23 20:51:41 +0100 | [diff] [blame] | 26 | #include <stdlib.h> |
Willy Tarreau | 7341d94 | 2007-05-13 19:56:02 +0200 | [diff] [blame] | 27 | #include <string.h> |
Willy Tarreau | 0f77253 | 2006-12-23 20:51:41 +0100 | [diff] [blame] | 28 | |
Willy Tarreau | e3ba5f0 | 2006-06-29 18:54:54 +0200 | [diff] [blame] | 29 | #include <common/config.h> |
Willy Tarreau | 7341d94 | 2007-05-13 19:56:02 +0200 | [diff] [blame] | 30 | #include <common/memory.h> |
Willy Tarreau | 0c303ee | 2008-07-07 00:09:58 +0200 | [diff] [blame] | 31 | #include <common/ticks.h> |
Willy Tarreau | fa64558 | 2007-06-03 15:59:52 +0200 | [diff] [blame] | 32 | #include <common/time.h> |
| 33 | |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 34 | #include <types/buffers.h> |
Willy Tarreau | 7c3c541 | 2009-12-13 15:53:05 +0100 | [diff] [blame] | 35 | #include <types/global.h> |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 36 | |
Willy Tarreau | 7341d94 | 2007-05-13 19:56:02 +0200 | [diff] [blame] | 37 | extern struct pool_head *pool2_buffer; |
| 38 | |
| 39 | /* perform minimal intializations, report 0 in case of error, 1 if OK. */ |
| 40 | int init_buffer(); |
| 41 | |
Willy Tarreau | 7c3c541 | 2009-12-13 15:53:05 +0100 | [diff] [blame] | 42 | /* Initialize all fields in the buffer. The BF_OUT_EMPTY flags is set. */ |
Willy Tarreau | 5446940 | 2006-07-29 16:59:06 +0200 | [diff] [blame] | 43 | static inline void buffer_init(struct buffer *buf) |
| 44 | { |
Willy Tarreau | f890dc9 | 2008-12-13 21:12:26 +0100 | [diff] [blame] | 45 | buf->send_max = 0; |
Willy Tarreau | 6b66f3e | 2008-12-14 17:31:54 +0100 | [diff] [blame] | 46 | buf->to_forward = 0; |
Willy Tarreau | e393fe2 | 2008-08-16 22:18:07 +0200 | [diff] [blame] | 47 | buf->l = buf->total = 0; |
Willy Tarreau | 3eba98a | 2009-01-25 13:56:13 +0100 | [diff] [blame] | 48 | buf->pipe = NULL; |
Willy Tarreau | 2df28e8 | 2008-08-17 15:20:19 +0200 | [diff] [blame] | 49 | buf->analysers = 0; |
Willy Tarreau | fa7e102 | 2008-10-19 07:30:41 +0200 | [diff] [blame] | 50 | buf->cons = NULL; |
Willy Tarreau | ba0b63d | 2009-09-20 08:09:44 +0200 | [diff] [blame] | 51 | buf->flags = BF_OUT_EMPTY; |
Willy Tarreau | 2df28e8 | 2008-08-17 15:20:19 +0200 | [diff] [blame] | 52 | buf->r = buf->lr = buf->w = buf->data; |
Willy Tarreau | 5446940 | 2006-07-29 16:59:06 +0200 | [diff] [blame] | 53 | } |
| 54 | |
Willy Tarreau | 7c3c541 | 2009-12-13 15:53:05 +0100 | [diff] [blame] | 55 | /* Return the max number of bytes the buffer can contain so that once all the |
| 56 | * pending bytes are forwarded, the buffer still has global.tune.maxrewrite |
| 57 | * bytes free. The result sits between buf->size - maxrewrite and buf->size. |
| 58 | */ |
| 59 | static inline int buffer_max_len(struct buffer *buf) |
| 60 | { |
| 61 | if (buf->to_forward == BUF_INFINITE_FORWARD || |
| 62 | buf->to_forward + buf->send_max >= global.tune.maxrewrite) |
| 63 | return buf->size; |
| 64 | else |
| 65 | return buf->size - global.tune.maxrewrite + buf->to_forward + buf->send_max; |
| 66 | } |
| 67 | |
Willy Tarreau | 2eb52f0 | 2008-09-04 09:14:08 +0200 | [diff] [blame] | 68 | /* Check buffer timeouts, and set the corresponding flags. The |
| 69 | * likely/unlikely have been optimized for fastest normal path. |
Willy Tarreau | dd80c6f | 2008-12-13 22:25:59 +0100 | [diff] [blame] | 70 | * The read/write timeouts are not set if there was activity on the buffer. |
| 71 | * That way, we don't have to update the timeout on every I/O. Note that the |
| 72 | * analyser timeout is always checked. |
Willy Tarreau | 2eb52f0 | 2008-09-04 09:14:08 +0200 | [diff] [blame] | 73 | */ |
| 74 | static inline void buffer_check_timeouts(struct buffer *b) |
| 75 | { |
Willy Tarreau | 86491c3 | 2008-12-14 09:04:47 +0100 | [diff] [blame] | 76 | if (likely(!(b->flags & (BF_SHUTR|BF_READ_TIMEOUT|BF_READ_ACTIVITY|BF_READ_NOEXP))) && |
Willy Tarreau | 2eb52f0 | 2008-09-04 09:14:08 +0200 | [diff] [blame] | 77 | unlikely(tick_is_expired(b->rex, now_ms))) |
| 78 | b->flags |= BF_READ_TIMEOUT; |
| 79 | |
Willy Tarreau | dd80c6f | 2008-12-13 22:25:59 +0100 | [diff] [blame] | 80 | if (likely(!(b->flags & (BF_SHUTW|BF_WRITE_TIMEOUT|BF_WRITE_ACTIVITY))) && |
Willy Tarreau | 2eb52f0 | 2008-09-04 09:14:08 +0200 | [diff] [blame] | 81 | unlikely(tick_is_expired(b->wex, now_ms))) |
| 82 | b->flags |= BF_WRITE_TIMEOUT; |
| 83 | |
| 84 | if (likely(!(b->flags & BF_ANA_TIMEOUT)) && |
| 85 | unlikely(tick_is_expired(b->analyse_exp, now_ms))) |
| 86 | b->flags |= BF_ANA_TIMEOUT; |
| 87 | } |
| 88 | |
Willy Tarreau | 0abebcc | 2009-01-08 00:09:41 +0100 | [diff] [blame] | 89 | /* Schedule <bytes> more bytes to be forwarded by the buffer without notifying |
| 90 | * the task. Any pending data in the buffer is scheduled to be sent as well, |
| 91 | * in the limit of the number of bytes to forward. This must be the only method |
| 92 | * to use to schedule bytes to be sent. Directly touching ->to_forward will |
| 93 | * cause lockups when send_max goes down to zero if nobody is ready to push the |
| 94 | * remaining data. |
| 95 | */ |
Willy Tarreau | 31971e5 | 2009-09-20 12:07:52 +0200 | [diff] [blame] | 96 | static inline void buffer_forward(struct buffer *buf, unsigned long bytes) |
Willy Tarreau | 0abebcc | 2009-01-08 00:09:41 +0100 | [diff] [blame] | 97 | { |
Willy Tarreau | 31971e5 | 2009-09-20 12:07:52 +0200 | [diff] [blame] | 98 | unsigned long data_left; |
Willy Tarreau | 0abebcc | 2009-01-08 00:09:41 +0100 | [diff] [blame] | 99 | |
Willy Tarreau | ba0b63d | 2009-09-20 08:09:44 +0200 | [diff] [blame] | 100 | if (!bytes) |
| 101 | return; |
Willy Tarreau | 0abebcc | 2009-01-08 00:09:41 +0100 | [diff] [blame] | 102 | data_left = buf->l - buf->send_max; |
Willy Tarreau | 91aa577 | 2009-09-15 20:32:30 +0200 | [diff] [blame] | 103 | if (data_left >= bytes) { |
| 104 | buf->send_max += bytes; |
Willy Tarreau | 2d028db | 2009-09-20 22:56:25 +0200 | [diff] [blame] | 105 | buf->flags &= ~BF_OUT_EMPTY; |
Willy Tarreau | 91aa577 | 2009-09-15 20:32:30 +0200 | [diff] [blame] | 106 | return; |
| 107 | } |
Willy Tarreau | 0abebcc | 2009-01-08 00:09:41 +0100 | [diff] [blame] | 108 | |
Willy Tarreau | 0abebcc | 2009-01-08 00:09:41 +0100 | [diff] [blame] | 109 | buf->send_max += data_left; |
Willy Tarreau | 2d028db | 2009-09-20 22:56:25 +0200 | [diff] [blame] | 110 | if (buf->send_max) |
| 111 | buf->flags &= ~BF_OUT_EMPTY; |
| 112 | |
Willy Tarreau | 7c3c541 | 2009-12-13 15:53:05 +0100 | [diff] [blame] | 113 | if (buf->to_forward != BUF_INFINITE_FORWARD) { |
| 114 | buf->to_forward += bytes - data_left; |
| 115 | if (bytes == BUF_INFINITE_FORWARD) |
| 116 | buf->to_forward = bytes; |
| 117 | } |
Willy Tarreau | 31971e5 | 2009-09-20 12:07:52 +0200 | [diff] [blame] | 118 | |
Willy Tarreau | 7c3c541 | 2009-12-13 15:53:05 +0100 | [diff] [blame] | 119 | if (buf->l < buffer_max_len(buf)) |
| 120 | buf->flags &= ~BF_FULL; |
| 121 | else |
| 122 | buf->flags |= BF_FULL; |
Willy Tarreau | 0abebcc | 2009-01-08 00:09:41 +0100 | [diff] [blame] | 123 | } |
| 124 | |
Willy Tarreau | e8a28bf | 2009-03-08 21:12:04 +0100 | [diff] [blame] | 125 | /* Schedule all remaining buffer data to be sent. send_max is not touched if it |
| 126 | * already covers those data. That permits doing a flush even after a forward, |
| 127 | * although not recommended. |
| 128 | */ |
| 129 | static inline void buffer_flush(struct buffer *buf) |
| 130 | { |
| 131 | if (buf->send_max < buf->l) |
| 132 | buf->send_max = buf->l; |
Willy Tarreau | ba0b63d | 2009-09-20 08:09:44 +0200 | [diff] [blame] | 133 | if (buf->send_max) |
| 134 | buf->flags &= ~BF_OUT_EMPTY; |
Willy Tarreau | e8a28bf | 2009-03-08 21:12:04 +0100 | [diff] [blame] | 135 | } |
| 136 | |
Willy Tarreau | 6f0aa47 | 2009-03-08 20:33:29 +0100 | [diff] [blame] | 137 | /* Erase any content from buffer <buf> and adjusts flags accordingly. Note |
Willy Tarreau | 0abebcc | 2009-01-08 00:09:41 +0100 | [diff] [blame] | 138 | * that any spliced data is not affected since we may not have any access to |
| 139 | * it. |
Willy Tarreau | e393fe2 | 2008-08-16 22:18:07 +0200 | [diff] [blame] | 140 | */ |
Willy Tarreau | 6f0aa47 | 2009-03-08 20:33:29 +0100 | [diff] [blame] | 141 | static inline void buffer_erase(struct buffer *buf) |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 142 | { |
Willy Tarreau | f890dc9 | 2008-12-13 21:12:26 +0100 | [diff] [blame] | 143 | buf->send_max = 0; |
Willy Tarreau | 6b66f3e | 2008-12-14 17:31:54 +0100 | [diff] [blame] | 144 | buf->to_forward = 0; |
Willy Tarreau | e09e0ce | 2007-03-18 16:31:29 +0100 | [diff] [blame] | 145 | buf->r = buf->lr = buf->w = buf->data; |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 146 | buf->l = 0; |
Willy Tarreau | ba0b63d | 2009-09-20 08:09:44 +0200 | [diff] [blame] | 147 | buf->flags &= ~(BF_FULL | BF_OUT_EMPTY); |
| 148 | if (!buf->pipe) |
| 149 | buf->flags |= BF_OUT_EMPTY; |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 150 | } |
| 151 | |
Willy Tarreau | 9cb8daa | 2009-09-15 21:22:24 +0200 | [diff] [blame] | 152 | /* Cut the "tail" of the buffer, which means strip it to the length of unsent |
| 153 | * data only, and kill any remaining unsent data. Any scheduled forwarding is |
| 154 | * stopped. This is mainly to be used to send error messages after existing |
| 155 | * data. |
| 156 | */ |
| 157 | static inline void buffer_cut_tail(struct buffer *buf) |
| 158 | { |
| 159 | if (!buf->send_max) |
| 160 | return buffer_erase(buf); |
| 161 | |
| 162 | buf->to_forward = 0; |
| 163 | if (buf->l == buf->send_max) |
| 164 | return; |
| 165 | |
| 166 | buf->l = buf->send_max; |
| 167 | buf->r = buf->w + buf->l; |
| 168 | if (buf->r >= buf->data + buf->size) |
| 169 | buf->r -= buf->size; |
| 170 | buf->lr = buf->r; |
Willy Tarreau | ba0b63d | 2009-09-20 08:09:44 +0200 | [diff] [blame] | 171 | buf->flags &= ~BF_FULL; |
Willy Tarreau | 7c3c541 | 2009-12-13 15:53:05 +0100 | [diff] [blame] | 172 | if (buf->l >= buffer_max_len(buf)) |
Willy Tarreau | 9cb8daa | 2009-09-15 21:22:24 +0200 | [diff] [blame] | 173 | buf->flags |= BF_FULL; |
| 174 | } |
| 175 | |
Willy Tarreau | d21e01c | 2009-12-27 15:45:38 +0100 | [diff] [blame] | 176 | /* Cut the <n> next unsent bytes of the buffer. The caller must ensure that <n> |
| 177 | * is smaller than the actual buffer's length. This is mainly used to remove |
| 178 | * empty lines at the beginning of a request or a response. |
| 179 | */ |
| 180 | static inline void buffer_ignore(struct buffer *buf, int n) |
| 181 | { |
| 182 | buf->l -= n; |
| 183 | buf->w += n; |
| 184 | if (buf->w >= buf->data + buf->size) |
| 185 | buf->w -= buf->size; |
| 186 | buf->flags &= ~BF_FULL; |
| 187 | if (buf->l >= buffer_max_len(buf)) |
| 188 | buf->flags |= BF_FULL; |
| 189 | } |
| 190 | |
Willy Tarreau | fa7e102 | 2008-10-19 07:30:41 +0200 | [diff] [blame] | 191 | /* marks the buffer as "shutdown" ASAP for reads */ |
| 192 | static inline void buffer_shutr_now(struct buffer *buf) |
| 193 | { |
Willy Tarreau | fe3718a | 2008-11-30 18:14:12 +0100 | [diff] [blame] | 194 | buf->flags |= BF_SHUTR_NOW; |
Willy Tarreau | fa7e102 | 2008-10-19 07:30:41 +0200 | [diff] [blame] | 195 | } |
| 196 | |
| 197 | /* marks the buffer as "shutdown" ASAP for writes */ |
| 198 | static inline void buffer_shutw_now(struct buffer *buf) |
| 199 | { |
| 200 | buf->flags |= BF_SHUTW_NOW; |
| 201 | } |
| 202 | |
| 203 | /* marks the buffer as "shutdown" ASAP in both directions */ |
| 204 | static inline void buffer_abort(struct buffer *buf) |
| 205 | { |
Willy Tarreau | fe3718a | 2008-11-30 18:14:12 +0100 | [diff] [blame] | 206 | buf->flags |= BF_SHUTR_NOW | BF_SHUTW_NOW; |
Willy Tarreau | fa7e102 | 2008-10-19 07:30:41 +0200 | [diff] [blame] | 207 | } |
| 208 | |
Willy Tarreau | 01bf867 | 2008-12-07 18:03:29 +0100 | [diff] [blame] | 209 | /* Installs <func> as a hijacker on the buffer <b> for session <s>. The hijack |
| 210 | * flag is set, and the function called once. The function is responsible for |
| 211 | * clearing the hijack bit. It is possible that the function clears the flag |
| 212 | * during this first call. |
| 213 | */ |
| 214 | static inline void buffer_install_hijacker(struct session *s, |
| 215 | struct buffer *b, |
| 216 | void (*func)(struct session *, struct buffer *)) |
Willy Tarreau | 72b179a | 2008-08-28 16:01:32 +0200 | [diff] [blame] | 217 | { |
Willy Tarreau | 01bf867 | 2008-12-07 18:03:29 +0100 | [diff] [blame] | 218 | b->hijacker = func; |
| 219 | b->flags |= BF_HIJACK; |
| 220 | func(s, b); |
Willy Tarreau | 72b179a | 2008-08-28 16:01:32 +0200 | [diff] [blame] | 221 | } |
| 222 | |
Willy Tarreau | 01bf867 | 2008-12-07 18:03:29 +0100 | [diff] [blame] | 223 | /* Releases the buffer from hijacking mode. Often used by the hijack function */ |
Willy Tarreau | 72b179a | 2008-08-28 16:01:32 +0200 | [diff] [blame] | 224 | static inline void buffer_stop_hijack(struct buffer *buf) |
| 225 | { |
| 226 | buf->flags &= ~BF_HIJACK; |
| 227 | } |
| 228 | |
Willy Tarreau | 520d95e | 2009-09-19 21:04:57 +0200 | [diff] [blame] | 229 | /* allow the consumer to try to establish a new connection. */ |
| 230 | static inline void buffer_auto_connect(struct buffer *buf) |
Willy Tarreau | 3da77c5 | 2008-08-29 09:58:42 +0200 | [diff] [blame] | 231 | { |
Willy Tarreau | 520d95e | 2009-09-19 21:04:57 +0200 | [diff] [blame] | 232 | buf->flags |= BF_AUTO_CONNECT; |
Willy Tarreau | 3da77c5 | 2008-08-29 09:58:42 +0200 | [diff] [blame] | 233 | } |
| 234 | |
Willy Tarreau | 520d95e | 2009-09-19 21:04:57 +0200 | [diff] [blame] | 235 | /* prevent the consumer from trying to establish a new connection, and also |
| 236 | * disable auto shutdown forwarding. |
| 237 | */ |
| 238 | static inline void buffer_dont_connect(struct buffer *buf) |
Willy Tarreau | 3da77c5 | 2008-08-29 09:58:42 +0200 | [diff] [blame] | 239 | { |
Willy Tarreau | 520d95e | 2009-09-19 21:04:57 +0200 | [diff] [blame] | 240 | buf->flags &= ~(BF_AUTO_CONNECT|BF_AUTO_CLOSE); |
Willy Tarreau | 3da77c5 | 2008-08-29 09:58:42 +0200 | [diff] [blame] | 241 | } |
| 242 | |
Willy Tarreau | 520d95e | 2009-09-19 21:04:57 +0200 | [diff] [blame] | 243 | /* allow the producer to forward shutdown requests */ |
| 244 | static inline void buffer_auto_close(struct buffer *buf) |
Willy Tarreau | 0a5d5dd | 2008-11-23 19:31:35 +0100 | [diff] [blame] | 245 | { |
Willy Tarreau | 520d95e | 2009-09-19 21:04:57 +0200 | [diff] [blame] | 246 | buf->flags |= BF_AUTO_CLOSE; |
Willy Tarreau | 0a5d5dd | 2008-11-23 19:31:35 +0100 | [diff] [blame] | 247 | } |
| 248 | |
Willy Tarreau | 520d95e | 2009-09-19 21:04:57 +0200 | [diff] [blame] | 249 | /* prevent the producer from forwarding shutdown requests */ |
| 250 | static inline void buffer_dont_close(struct buffer *buf) |
Willy Tarreau | 0a5d5dd | 2008-11-23 19:31:35 +0100 | [diff] [blame] | 251 | { |
Willy Tarreau | 520d95e | 2009-09-19 21:04:57 +0200 | [diff] [blame] | 252 | buf->flags &= ~BF_AUTO_CLOSE; |
Willy Tarreau | 0a5d5dd | 2008-11-23 19:31:35 +0100 | [diff] [blame] | 253 | } |
| 254 | |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 255 | /* returns the maximum number of bytes writable at once in this buffer */ |
Willy Tarreau | b17916e | 2006-10-15 15:17:57 +0200 | [diff] [blame] | 256 | static inline int buffer_max(const struct buffer *buf) |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 257 | { |
Willy Tarreau | a07a34e | 2009-08-16 23:27:46 +0200 | [diff] [blame] | 258 | if (buf->l == buf->size) |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 259 | return 0; |
| 260 | else if (buf->r >= buf->w) |
Willy Tarreau | a07a34e | 2009-08-16 23:27:46 +0200 | [diff] [blame] | 261 | return buf->data + buf->size - buf->r; |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 262 | else |
| 263 | return buf->w - buf->r; |
| 264 | } |
| 265 | |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 266 | /* |
| 267 | * Tries to realign the given buffer, and returns how many bytes can be written |
| 268 | * there at once without overwriting anything. |
| 269 | */ |
| 270 | static inline int buffer_realign(struct buffer *buf) |
| 271 | { |
| 272 | if (buf->l == 0) { |
| 273 | /* let's realign the buffer to optimize I/O */ |
Willy Tarreau | e09e0ce | 2007-03-18 16:31:29 +0100 | [diff] [blame] | 274 | buf->r = buf->w = buf->lr = buf->data; |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 275 | } |
| 276 | return buffer_max(buf); |
| 277 | } |
| 278 | |
Willy Tarreau | 2b7addc | 2009-08-31 07:37:22 +0200 | [diff] [blame] | 279 | /* |
| 280 | * Return the max amount of bytes that can be stuffed into the buffer at once. |
| 281 | * Note that this may be lower than the actual buffer size when the free space |
| 282 | * wraps after the end, so it's preferable to call this function again after |
| 283 | * writing. Also note that this function respects max_len. |
| 284 | */ |
| 285 | static inline int buffer_contig_space(struct buffer *buf) |
| 286 | { |
| 287 | int ret; |
| 288 | |
| 289 | if (buf->l == 0) { |
| 290 | buf->r = buf->w = buf->lr = buf->data; |
Willy Tarreau | 7c3c541 | 2009-12-13 15:53:05 +0100 | [diff] [blame] | 291 | ret = buffer_max_len(buf); |
Willy Tarreau | 2b7addc | 2009-08-31 07:37:22 +0200 | [diff] [blame] | 292 | } |
| 293 | else if (buf->r > buf->w) { |
Willy Tarreau | 7c3c541 | 2009-12-13 15:53:05 +0100 | [diff] [blame] | 294 | ret = buf->data + buffer_max_len(buf) - buf->r; |
Willy Tarreau | 2b7addc | 2009-08-31 07:37:22 +0200 | [diff] [blame] | 295 | } |
| 296 | else { |
| 297 | ret = buf->w - buf->r; |
Willy Tarreau | 7c3c541 | 2009-12-13 15:53:05 +0100 | [diff] [blame] | 298 | if (ret > buffer_max_len(buf)) |
| 299 | ret = buffer_max_len(buf); |
Willy Tarreau | 2b7addc | 2009-08-31 07:37:22 +0200 | [diff] [blame] | 300 | } |
| 301 | return ret; |
| 302 | } |
| 303 | |
Willy Tarreau | 4e33d86 | 2009-10-11 23:35:10 +0200 | [diff] [blame] | 304 | /* Return 1 if the buffer has less than 1/4 of its capacity free, otherwise 0 */ |
| 305 | static inline int buffer_almost_full(struct buffer *buf) |
| 306 | { |
| 307 | if (buffer_contig_space(buf) < buf->size / 4) |
| 308 | return 1; |
| 309 | return 0; |
| 310 | } |
| 311 | |
Willy Tarreau | 2b7addc | 2009-08-31 07:37:22 +0200 | [diff] [blame] | 312 | /* |
| 313 | * Return the max amount of bytes that can be read from the buffer at once. |
| 314 | * Note that this may be lower than the actual buffer length when the data |
| 315 | * wrap after the end, so it's preferable to call this function again after |
| 316 | * reading. Also note that this function respects the send_max limit. |
| 317 | */ |
| 318 | static inline int buffer_contig_data(struct buffer *buf) |
| 319 | { |
| 320 | int ret; |
| 321 | |
| 322 | if (!buf->send_max || !buf->l) |
| 323 | return 0; |
| 324 | |
| 325 | if (buf->r > buf->w) |
| 326 | ret = buf->r - buf->w; |
| 327 | else |
| 328 | ret = buf->data + buf->size - buf->w; |
| 329 | |
| 330 | /* limit the amount of outgoing data if required */ |
| 331 | if (ret > buf->send_max) |
| 332 | ret = buf->send_max; |
| 333 | |
| 334 | return ret; |
| 335 | } |
| 336 | |
| 337 | /* |
| 338 | * Advance the buffer's read pointer by <len> bytes. This is useful when data |
| 339 | * have been read directly from the buffer. It is illegal to call this function |
| 340 | * with <len> causing a wrapping at the end of the buffer. It's the caller's |
Willy Tarreau | 2e1dd3d | 2009-09-23 22:56:07 +0200 | [diff] [blame] | 341 | * responsibility to ensure that <len> is never larger than buf->send_max. |
Willy Tarreau | 2b7addc | 2009-08-31 07:37:22 +0200 | [diff] [blame] | 342 | */ |
| 343 | static inline void buffer_skip(struct buffer *buf, int len) |
| 344 | { |
| 345 | buf->w += len; |
Willy Tarreau | 2e1dd3d | 2009-09-23 22:56:07 +0200 | [diff] [blame] | 346 | if (buf->w >= buf->data + buf->size) |
| 347 | buf->w -= buf->size; /* wrap around the buffer */ |
Willy Tarreau | 2b7addc | 2009-08-31 07:37:22 +0200 | [diff] [blame] | 348 | |
| 349 | buf->l -= len; |
Willy Tarreau | ba0b63d | 2009-09-20 08:09:44 +0200 | [diff] [blame] | 350 | if (!buf->l) |
Willy Tarreau | 2b7addc | 2009-08-31 07:37:22 +0200 | [diff] [blame] | 351 | buf->r = buf->w = buf->lr = buf->data; |
Willy Tarreau | 2b7addc | 2009-08-31 07:37:22 +0200 | [diff] [blame] | 352 | |
Willy Tarreau | 7c3c541 | 2009-12-13 15:53:05 +0100 | [diff] [blame] | 353 | if (buf->l < buffer_max_len(buf)) |
Willy Tarreau | 2b7addc | 2009-08-31 07:37:22 +0200 | [diff] [blame] | 354 | buf->flags &= ~BF_FULL; |
| 355 | |
| 356 | buf->send_max -= len; |
Willy Tarreau | ba0b63d | 2009-09-20 08:09:44 +0200 | [diff] [blame] | 357 | if (!buf->send_max && !buf->pipe) |
| 358 | buf->flags |= BF_OUT_EMPTY; |
Willy Tarreau | fb0e920 | 2009-09-23 23:47:55 +0200 | [diff] [blame] | 359 | |
| 360 | /* notify that some data was written to the SI from the buffer */ |
| 361 | buf->flags |= BF_WRITE_PARTIAL; |
Willy Tarreau | 2b7addc | 2009-08-31 07:37:22 +0200 | [diff] [blame] | 362 | } |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 363 | |
Willy Tarreau | 4fe7a2e | 2009-09-01 06:41:32 +0200 | [diff] [blame] | 364 | /* |
| 365 | * Return one char from the buffer. If the buffer is empty and closed, return -1. |
| 366 | * If the buffer is just empty, return -2. The buffer's pointer is not advanced, |
| 367 | * it's up to the caller to call buffer_skip(buf, 1) when it has consumed the char. |
| 368 | * Also note that this function respects the send_max limit. |
| 369 | */ |
| 370 | static inline int buffer_si_peekchar(struct buffer *buf) |
| 371 | { |
| 372 | if (buf->send_max) |
| 373 | return *buf->w; |
| 374 | |
| 375 | if (buf->flags & (BF_SHUTW|BF_SHUTW_NOW)) |
| 376 | return -1; |
| 377 | else |
| 378 | return -2; |
| 379 | } |
| 380 | |
Willy Tarreau | c77e761 | 2009-09-13 14:58:00 +0200 | [diff] [blame] | 381 | /* Try to write character <c> into buffer <buf> after length controls. This |
Willy Tarreau | 9bcc91e | 2009-10-10 18:01:44 +0200 | [diff] [blame] | 382 | * work like buffer_feed2(buf, &c, 1). |
Willy Tarreau | c77e761 | 2009-09-13 14:58:00 +0200 | [diff] [blame] | 383 | * Returns non-zero in case of success, 0 if the buffer was full. |
| 384 | * The send limit is automatically adjusted with the amount of data written. |
| 385 | */ |
| 386 | static inline int buffer_si_putchar(struct buffer *buf, char c) |
| 387 | { |
| 388 | if (buf->flags & BF_FULL) |
| 389 | return 0; |
| 390 | |
Willy Tarreau | c77e761 | 2009-09-13 14:58:00 +0200 | [diff] [blame] | 391 | *buf->r = c; |
| 392 | |
| 393 | buf->l++; |
Willy Tarreau | 7c3c541 | 2009-12-13 15:53:05 +0100 | [diff] [blame] | 394 | if (buf->l >= buffer_max_len(buf)) |
Willy Tarreau | c77e761 | 2009-09-13 14:58:00 +0200 | [diff] [blame] | 395 | buf->flags |= BF_FULL; |
| 396 | |
| 397 | buf->r++; |
| 398 | if (buf->r - buf->data == buf->size) |
| 399 | buf->r -= buf->size; |
| 400 | |
Willy Tarreau | 31971e5 | 2009-09-20 12:07:52 +0200 | [diff] [blame] | 401 | if (buf->to_forward >= 1) { |
| 402 | if (buf->to_forward != BUF_INFINITE_FORWARD) |
| 403 | buf->to_forward--; |
Willy Tarreau | c77e761 | 2009-09-13 14:58:00 +0200 | [diff] [blame] | 404 | buf->send_max++; |
Willy Tarreau | ba0b63d | 2009-09-20 08:09:44 +0200 | [diff] [blame] | 405 | buf->flags &= ~BF_OUT_EMPTY; |
Willy Tarreau | c77e761 | 2009-09-13 14:58:00 +0200 | [diff] [blame] | 406 | } |
| 407 | |
| 408 | buf->total++; |
| 409 | return 1; |
| 410 | } |
| 411 | |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 412 | int buffer_write(struct buffer *buf, const char *msg, int len); |
Willy Tarreau | 9bcc91e | 2009-10-10 18:01:44 +0200 | [diff] [blame] | 413 | int buffer_feed2(struct buffer *buf, const char *str, int len); |
Willy Tarreau | 36a5c53 | 2009-09-03 07:13:50 +0200 | [diff] [blame] | 414 | int buffer_si_putchar(struct buffer *buf, char c); |
Willy Tarreau | 4fe7a2e | 2009-09-01 06:41:32 +0200 | [diff] [blame] | 415 | int buffer_si_peekline(struct buffer *buf, char *str, int len); |
Willy Tarreau | 4af6f3a | 2007-03-18 22:36:26 +0100 | [diff] [blame] | 416 | int buffer_replace(struct buffer *b, char *pos, char *end, const char *str); |
| 417 | int buffer_replace2(struct buffer *b, char *pos, char *end, const char *str, int len); |
| 418 | int buffer_insert_line2(struct buffer *b, char *pos, const char *str, int len); |
Willy Tarreau | 8d5d7f2 | 2007-01-21 19:16:41 +0100 | [diff] [blame] | 419 | void buffer_dump(FILE *o, struct buffer *b, int from, int to); |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 420 | |
Willy Tarreau | aeac319 | 2009-08-31 08:09:57 +0200 | [diff] [blame] | 421 | |
| 422 | /* writes the chunk <chunk> to buffer <buf>. Returns -1 in case of success, |
| 423 | * -2 if it is larger than the buffer size, or the number of bytes available |
| 424 | * otherwise. If the chunk has been written, its size is automatically reset |
| 425 | * to zero. The send limit is automatically adjusted with the amount of data |
| 426 | * written. |
| 427 | */ |
| 428 | static inline int buffer_write_chunk(struct buffer *buf, struct chunk *chunk) |
| 429 | { |
| 430 | int ret; |
| 431 | |
| 432 | ret = buffer_write(buf, chunk->str, chunk->len); |
| 433 | if (ret == -1) |
| 434 | chunk->len = 0; |
| 435 | return ret; |
| 436 | } |
| 437 | |
| 438 | /* Try to write chunk <chunk> into buffer <buf> after length controls. This is |
| 439 | * the equivalent of buffer_write_chunk() except that to_forward and send_max |
| 440 | * are updated and that max_len is respected. Returns -1 in case of success, |
| 441 | * -2 if it is larger than the buffer size, or the number of bytes available |
| 442 | * otherwise. If the chunk has been written, its size is automatically reset |
| 443 | * to zero. The send limit is automatically adjusted with the amount of data |
| 444 | * written. |
| 445 | */ |
| 446 | static inline int buffer_feed_chunk(struct buffer *buf, struct chunk *chunk) |
| 447 | { |
| 448 | int ret; |
| 449 | |
Willy Tarreau | 9bcc91e | 2009-10-10 18:01:44 +0200 | [diff] [blame] | 450 | ret = buffer_feed2(buf, chunk->str, chunk->len); |
Willy Tarreau | aeac319 | 2009-08-31 08:09:57 +0200 | [diff] [blame] | 451 | if (ret == -1) |
| 452 | chunk->len = 0; |
| 453 | return ret; |
| 454 | } |
| 455 | |
Willy Tarreau | 9bcc91e | 2009-10-10 18:01:44 +0200 | [diff] [blame] | 456 | /* Try to write string <str> into buffer <buf> after length controls. This is |
| 457 | * the equivalent of buffer_feed2() except that string length is measured by |
| 458 | * the function. Returns -1 in case of success, -2 if it is larger than the |
| 459 | * buffer size, or the number of bytes available otherwise. The send limit is |
| 460 | * automatically adjusted with the amount of data written. |
| 461 | */ |
| 462 | static inline int buffer_feed(struct buffer *buf, const char *str) |
| 463 | { |
| 464 | return buffer_feed2(buf, str, strlen(str)); |
| 465 | } |
| 466 | |
Krzysztof Piotr Oledzki | 78abe61 | 2009-09-27 13:23:20 +0200 | [diff] [blame] | 467 | static inline void chunk_init(struct chunk *chk, char *str, size_t size) { |
| 468 | chk->str = str; |
| 469 | chk->len = 0; |
| 470 | chk->size = size; |
| 471 | } |
| 472 | |
| 473 | /* report 0 in case of error, 1 if OK. */ |
Krzysztof Piotr Oledzki | 6f61b21 | 2009-10-04 23:34:15 +0200 | [diff] [blame] | 474 | static inline int chunk_initlen(struct chunk *chk, char *str, size_t size, int len) { |
Krzysztof Piotr Oledzki | 78abe61 | 2009-09-27 13:23:20 +0200 | [diff] [blame] | 475 | |
Krzysztof Piotr Oledzki | 6f61b21 | 2009-10-04 23:34:15 +0200 | [diff] [blame] | 476 | if (size && len > size) |
Krzysztof Piotr Oledzki | 78abe61 | 2009-09-27 13:23:20 +0200 | [diff] [blame] | 477 | return 0; |
| 478 | |
| 479 | chk->str = str; |
| 480 | chk->len = len; |
| 481 | chk->size = size; |
| 482 | |
| 483 | return 1; |
| 484 | } |
| 485 | |
| 486 | static inline void chunk_initstr(struct chunk *chk, char *str) { |
| 487 | chk->str = str; |
| 488 | chk->len = strlen(str); |
| 489 | chk->size = 0; /* mark it read-only */ |
| 490 | } |
| 491 | |
| 492 | static inline int chunk_strcpy(struct chunk *chk, const char *str) { |
| 493 | size_t len; |
| 494 | |
| 495 | len = strlen(str); |
| 496 | |
| 497 | if (unlikely(len > chk->size)) |
| 498 | return 0; |
| 499 | |
| 500 | chk->len = len; |
| 501 | memcpy(chk->str, str, len); |
| 502 | |
| 503 | return 1; |
| 504 | } |
| 505 | |
| 506 | int chunk_printf(struct chunk *chk, const char *fmt, ...) |
| 507 | __attribute__ ((format(printf, 2, 3))); |
| 508 | |
Krzysztof Piotr Oledzki | ba8d7d3 | 2009-10-10 21:06:03 +0200 | [diff] [blame] | 509 | int chunk_htmlencode(struct chunk *dst, struct chunk *src); |
| 510 | int chunk_asciiencode(struct chunk *dst, struct chunk *src, char qc); |
| 511 | |
Krzysztof Piotr Oledzki | 78abe61 | 2009-09-27 13:23:20 +0200 | [diff] [blame] | 512 | static inline void chunk_reset(struct chunk *chk) { |
| 513 | chk->str = NULL; |
| 514 | chk->len = -1; |
| 515 | chk->size = 0; |
| 516 | } |
| 517 | |
| 518 | static inline void chunk_destroy(struct chunk *chk) { |
| 519 | |
| 520 | if (!chk->size) |
| 521 | return; |
| 522 | |
| 523 | if (chk->str) |
| 524 | free(chk->str); |
| 525 | |
| 526 | chunk_reset(chk); |
| 527 | } |
| 528 | |
Willy Tarreau | 0f77253 | 2006-12-23 20:51:41 +0100 | [diff] [blame] | 529 | /* |
| 530 | * frees the destination chunk if already allocated, allocates a new string, |
| 531 | * and copies the source into it. The pointer to the destination string is |
| 532 | * returned, or NULL if the allocation fails or if any pointer is NULL.. |
| 533 | */ |
| 534 | static inline char *chunk_dup(struct chunk *dst, const struct chunk *src) { |
| 535 | if (!dst || !src || !src->str) |
| 536 | return NULL; |
| 537 | if (dst->str) |
| 538 | free(dst->str); |
| 539 | dst->len = src->len; |
| 540 | dst->str = (char *)malloc(dst->len); |
| 541 | memcpy(dst->str, src->str, dst->len); |
| 542 | return dst->str; |
| 543 | } |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 544 | |
| 545 | #endif /* _PROTO_BUFFERS_H */ |
| 546 | |
| 547 | /* |
| 548 | * Local variables: |
| 549 | * c-indent-level: 8 |
| 550 | * c-basic-offset: 8 |
| 551 | * End: |
| 552 | */ |