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 | * |
Willy Tarreau | b97f199 | 2010-02-25 23:54:31 +0100 | [diff] [blame] | 5 | * Copyright (C) 2000-2010 Willy Tarreau - w@1wt.eu |
Willy Tarreau | 7c3c541 | 2009-12-13 15:53:05 +0100 | [diff] [blame] | 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 | 74b08c9 | 2010-09-08 17:04:31 +0200 | [diff] [blame] | 42 | /* SI-to-buffer functions : buffer_{get,put}_{char,block,string,chunk} */ |
| 43 | int buffer_write(struct buffer *buf, const char *msg, int len); |
| 44 | int buffer_put_block(struct buffer *buf, const char *str, int len); |
| 45 | int buffer_put_char(struct buffer *buf, char c); |
| 46 | int buffer_get_line(struct buffer *buf, char *str, int len); |
| 47 | int buffer_get_block(struct buffer *buf, char *blk, int len, int offset); |
Willy Tarreau | 74b08c9 | 2010-09-08 17:04:31 +0200 | [diff] [blame] | 48 | int buffer_replace2(struct buffer *b, char *pos, char *end, const char *str, int len); |
| 49 | int buffer_insert_line2(struct buffer *b, char *pos, const char *str, int len); |
| 50 | void buffer_dump(FILE *o, struct buffer *b, int from, int to); |
| 51 | void buffer_bounce_realign(struct buffer *buf); |
Willy Tarreau | 0bc3493 | 2011-03-28 16:25:58 +0200 | [diff] [blame] | 52 | unsigned long long buffer_forward(struct buffer *buf, unsigned long long bytes); |
Willy Tarreau | 74b08c9 | 2010-09-08 17:04:31 +0200 | [diff] [blame] | 53 | |
Willy Tarreau | 7c3c541 | 2009-12-13 15:53:05 +0100 | [diff] [blame] | 54 | /* 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] | 55 | static inline void buffer_init(struct buffer *buf) |
| 56 | { |
Willy Tarreau | 2e046c6 | 2012-03-01 16:08:30 +0100 | [diff] [blame] | 57 | buf->o = 0; |
Willy Tarreau | 02d6cfc | 2012-03-01 18:19:58 +0100 | [diff] [blame] | 58 | buf->i = 0; |
Willy Tarreau | 6b66f3e | 2008-12-14 17:31:54 +0100 | [diff] [blame] | 59 | buf->to_forward = 0; |
Willy Tarreau | 02d6cfc | 2012-03-01 18:19:58 +0100 | [diff] [blame] | 60 | buf->total = 0; |
Willy Tarreau | 3eba98a | 2009-01-25 13:56:13 +0100 | [diff] [blame] | 61 | buf->pipe = NULL; |
Willy Tarreau | 2df28e8 | 2008-08-17 15:20:19 +0200 | [diff] [blame] | 62 | buf->analysers = 0; |
Willy Tarreau | fa7e102 | 2008-10-19 07:30:41 +0200 | [diff] [blame] | 63 | buf->cons = NULL; |
Willy Tarreau | ba0b63d | 2009-09-20 08:09:44 +0200 | [diff] [blame] | 64 | buf->flags = BF_OUT_EMPTY; |
Willy Tarreau | 363a5bb | 2012-03-02 20:14:45 +0100 | [diff] [blame^] | 65 | buf->lr = buf->p = buf->data; |
Willy Tarreau | 5446940 | 2006-07-29 16:59:06 +0200 | [diff] [blame] | 66 | } |
| 67 | |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 68 | /*****************************************************************/ |
| 69 | /* These functions are used to compute various buffer area sizes */ |
| 70 | /*****************************************************************/ |
| 71 | |
Willy Tarreau | 02d6cfc | 2012-03-01 18:19:58 +0100 | [diff] [blame] | 72 | /* Return the buffer's length in bytes by summing the input and the output */ |
| 73 | static inline int buffer_len(const struct buffer *buf) |
| 74 | { |
| 75 | return buf->i + buf->o; |
| 76 | } |
| 77 | |
| 78 | /* Return non-zero only if the buffer is not empty */ |
| 79 | static inline int buffer_not_empty(const struct buffer *buf) |
| 80 | { |
| 81 | return buf->i | buf->o; |
| 82 | } |
| 83 | |
| 84 | /* Return non-zero only if the buffer is empty */ |
| 85 | static inline int buffer_empty(const struct buffer *buf) |
| 86 | { |
| 87 | return !buffer_not_empty(buf); |
| 88 | } |
| 89 | |
Willy Tarreau | 7fd758b | 2012-03-02 10:38:01 +0100 | [diff] [blame] | 90 | /* Normalizes a pointer after a subtract */ |
| 91 | static inline char *buffer_wrap_sub(const struct buffer *buf, char *ptr) |
| 92 | { |
| 93 | if (ptr < buf->data) |
| 94 | ptr += buf->size; |
| 95 | return ptr; |
| 96 | } |
| 97 | |
| 98 | /* Normalizes a pointer after an addition */ |
| 99 | static inline char *buffer_wrap_add(const struct buffer *buf, char *ptr) |
| 100 | { |
| 101 | if (ptr - buf->size >= buf->data) |
| 102 | ptr -= buf->size; |
| 103 | return ptr; |
| 104 | } |
| 105 | |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 106 | /* Return the number of reserved bytes in the buffer, which ensures that once |
| 107 | * all pending data are forwarded, the buffer still has global.tune.maxrewrite |
| 108 | * bytes free. The result is between 0 and global.maxrewrite, which is itself |
| 109 | * smaller than any buf->size. |
| 110 | */ |
| 111 | static inline int buffer_reserved(const struct buffer *buf) |
| 112 | { |
Willy Tarreau | 2e046c6 | 2012-03-01 16:08:30 +0100 | [diff] [blame] | 113 | int ret = global.tune.maxrewrite - buf->to_forward - buf->o; |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 114 | |
| 115 | if (buf->to_forward == BUF_INFINITE_FORWARD) |
| 116 | return 0; |
| 117 | if (ret <= 0) |
| 118 | return 0; |
| 119 | return ret; |
| 120 | } |
| 121 | |
Willy Tarreau | 7c3c541 | 2009-12-13 15:53:05 +0100 | [diff] [blame] | 122 | /* Return the max number of bytes the buffer can contain so that once all the |
| 123 | * pending bytes are forwarded, the buffer still has global.tune.maxrewrite |
| 124 | * bytes free. The result sits between buf->size - maxrewrite and buf->size. |
| 125 | */ |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 126 | static inline int buffer_max_len(const struct buffer *buf) |
| 127 | { |
| 128 | return buf->size - buffer_reserved(buf); |
| 129 | } |
| 130 | |
| 131 | /* Return the maximum amount of bytes that can be written into the buffer, |
| 132 | * including reserved space which may be overwritten. |
| 133 | */ |
| 134 | static inline int buffer_total_space(const struct buffer *buf) |
| 135 | { |
Willy Tarreau | 02d6cfc | 2012-03-01 18:19:58 +0100 | [diff] [blame] | 136 | return buf->size - buffer_len(buf); |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 137 | } |
| 138 | |
| 139 | /* Return the maximum amount of bytes that can be written into the buffer, |
Willy Tarreau | fe4b1f9 | 2011-11-28 13:40:49 +0100 | [diff] [blame] | 140 | * excluding the reserved space, which is preserved. 0 may be returned if |
| 141 | * the reserved space was already reached or used. |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 142 | */ |
| 143 | static inline int buffer_total_space_res(const struct buffer *buf) |
Willy Tarreau | 7c3c541 | 2009-12-13 15:53:05 +0100 | [diff] [blame] | 144 | { |
Willy Tarreau | 02d6cfc | 2012-03-01 18:19:58 +0100 | [diff] [blame] | 145 | int len = buffer_max_len(buf) - buffer_len(buf); |
Willy Tarreau | fe4b1f9 | 2011-11-28 13:40:49 +0100 | [diff] [blame] | 146 | return len < 0 ? 0 : len; |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 147 | } |
| 148 | |
| 149 | /* Returns the number of contiguous bytes between <start> and <start>+<count>, |
| 150 | * and enforces a limit on buf->data + buf->size. <start> must be within the |
| 151 | * buffer. |
| 152 | */ |
| 153 | static inline int buffer_contig_area(const struct buffer *buf, const char *start, int count) |
| 154 | { |
| 155 | if (count > buf->data - start + buf->size) |
| 156 | count = buf->data - start + buf->size; |
| 157 | return count; |
| 158 | } |
| 159 | |
| 160 | /* Return the amount of bytes that can be written into the buffer at once, |
Willy Tarreau | 363a5bb | 2012-03-02 20:14:45 +0100 | [diff] [blame^] | 161 | * including reserved space which may be overwritten. |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 162 | */ |
Willy Tarreau | 18dd41d | 2012-03-10 08:55:07 +0100 | [diff] [blame] | 163 | static inline int buffer_contig_space(const struct buffer *buf) |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 164 | { |
Willy Tarreau | 363a5bb | 2012-03-02 20:14:45 +0100 | [diff] [blame^] | 165 | const char *left, *right; |
| 166 | |
| 167 | if (buf->data + buf->o <= buf->p) |
| 168 | right = buf->data + buf->size; |
| 169 | else |
| 170 | right = buf->p + buf->size - buf->o; |
| 171 | |
| 172 | left = buffer_wrap_add(buf, buf->p + buf->i); |
| 173 | return right - left; |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 174 | } |
| 175 | |
Willy Tarreau | 363a5bb | 2012-03-02 20:14:45 +0100 | [diff] [blame^] | 176 | |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 177 | /* Return the amount of bytes that can be written into the buffer at once, |
Willy Tarreau | 363a5bb | 2012-03-02 20:14:45 +0100 | [diff] [blame^] | 178 | * excluding the amount of reserved space passed in <res>, which is |
| 179 | * preserved. |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 180 | */ |
Willy Tarreau | 363a5bb | 2012-03-02 20:14:45 +0100 | [diff] [blame^] | 181 | static inline int buffer_contig_space_with_res(const struct buffer *buf, int res) |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 182 | { |
| 183 | /* Proceed differently if the buffer is full, partially used or empty. |
| 184 | * The hard situation is when it's partially used and either data or |
| 185 | * reserved space wraps at the end. |
| 186 | */ |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 187 | int spare = buf->size - res; |
| 188 | |
Willy Tarreau | 02d6cfc | 2012-03-01 18:19:58 +0100 | [diff] [blame] | 189 | if (buffer_len(buf) >= spare) |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 190 | spare = 0; |
Willy Tarreau | 02d6cfc | 2012-03-01 18:19:58 +0100 | [diff] [blame] | 191 | else if (buffer_len(buf)) { |
Willy Tarreau | 363a5bb | 2012-03-02 20:14:45 +0100 | [diff] [blame^] | 192 | spare = buffer_contig_space(buf) - res; |
| 193 | if (spare < 0) |
| 194 | spare = 0; |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 195 | } |
| 196 | return spare; |
| 197 | } |
| 198 | |
Willy Tarreau | 363a5bb | 2012-03-02 20:14:45 +0100 | [diff] [blame^] | 199 | |
| 200 | /* Return the amount of bytes that can be written into the buffer at once, |
| 201 | * excluding reserved space, which is preserved. |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 202 | */ |
Willy Tarreau | 363a5bb | 2012-03-02 20:14:45 +0100 | [diff] [blame^] | 203 | static inline int buffer_contig_space_res(const struct buffer *buf) |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 204 | { |
Willy Tarreau | 363a5bb | 2012-03-02 20:14:45 +0100 | [diff] [blame^] | 205 | return buffer_contig_space_with_res(buf, buffer_reserved(buf)); |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 206 | } |
| 207 | |
| 208 | /* Normalizes a pointer which is supposed to be relative to the beginning of a |
| 209 | * buffer, so that wrapping is correctly handled. The intent is to use this |
| 210 | * when increasing a pointer. Note that the wrapping test is only performed |
Willy Tarreau | 7173025 | 2011-11-28 16:04:29 +0100 | [diff] [blame] | 211 | * once, so the original pointer must be between ->data-size and ->data+2*size-1, |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 212 | * otherwise an invalid pointer might be returned. |
| 213 | */ |
Willy Tarreau | 18dd41d | 2012-03-10 08:55:07 +0100 | [diff] [blame] | 214 | static inline const char *buffer_pointer(const struct buffer *buf, const char *ptr) |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 215 | { |
Willy Tarreau | 7173025 | 2011-11-28 16:04:29 +0100 | [diff] [blame] | 216 | if (ptr < buf->data) |
| 217 | ptr += buf->size; |
| 218 | else if (ptr - buf->size >= buf->data) |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 219 | ptr -= buf->size; |
| 220 | return ptr; |
| 221 | } |
| 222 | |
| 223 | /* Returns the distance between two pointers, taking into account the ability |
| 224 | * to wrap around the buffer's end. |
| 225 | */ |
Willy Tarreau | 18dd41d | 2012-03-10 08:55:07 +0100 | [diff] [blame] | 226 | static inline int buffer_count(const struct buffer *buf, const char *from, const char *to) |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 227 | { |
| 228 | int count = to - from; |
| 229 | if (count < 0) |
| 230 | count += buf->size; |
| 231 | return count; |
| 232 | } |
| 233 | |
| 234 | /* returns the amount of pending bytes in the buffer. It is the amount of bytes |
| 235 | * that is not scheduled to be sent. |
| 236 | */ |
| 237 | static inline int buffer_pending(const struct buffer *buf) |
| 238 | { |
Willy Tarreau | 02d6cfc | 2012-03-01 18:19:58 +0100 | [diff] [blame] | 239 | return buf->i; |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 240 | } |
| 241 | |
| 242 | /* Returns the size of the working area which the caller knows ends at <end>. |
| 243 | * If <end> equals buf->r (modulo size), then it means that the free area which |
| 244 | * follows is part of the working area. Otherwise, the working area stops at |
Willy Tarreau | 89fa706 | 2012-03-02 16:13:16 +0100 | [diff] [blame] | 245 | * <end>. It always starts at buf->p. The work area includes the |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 246 | * reserved area. |
| 247 | */ |
Willy Tarreau | 18dd41d | 2012-03-10 08:55:07 +0100 | [diff] [blame] | 248 | static inline int buffer_work_area(const struct buffer *buf, const char *end) |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 249 | { |
| 250 | end = buffer_pointer(buf, end); |
Willy Tarreau | 363a5bb | 2012-03-02 20:14:45 +0100 | [diff] [blame^] | 251 | if (end == buffer_wrap_add(buf, buf->p + buf->i)) |
| 252 | /* pointer exactly at end, lets push forwards */ |
Willy Tarreau | 89fa706 | 2012-03-02 16:13:16 +0100 | [diff] [blame] | 253 | end = buffer_wrap_sub(buf, buf->p - buf->o); |
| 254 | return buffer_count(buf, buf->p, end); |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 255 | } |
| 256 | |
| 257 | /* Return 1 if the buffer has less than 1/4 of its capacity free, otherwise 0 */ |
| 258 | static inline int buffer_almost_full(const struct buffer *buf) |
| 259 | { |
| 260 | if (buffer_total_space(buf) < buf->size / 4) |
| 261 | return 1; |
| 262 | return 0; |
| 263 | } |
| 264 | |
Willy Tarreau | 74b08c9 | 2010-09-08 17:04:31 +0200 | [diff] [blame] | 265 | /* Returns true if the buffer's input is already closed */ |
| 266 | static inline int buffer_input_closed(struct buffer *buf) |
| 267 | { |
| 268 | return ((buf->flags & BF_SHUTR) != 0); |
| 269 | } |
| 270 | |
| 271 | /* Returns true if the buffer's output is already closed */ |
| 272 | static inline int buffer_output_closed(struct buffer *buf) |
| 273 | { |
| 274 | return ((buf->flags & BF_SHUTW) != 0); |
| 275 | } |
| 276 | |
Willy Tarreau | 2eb52f0 | 2008-09-04 09:14:08 +0200 | [diff] [blame] | 277 | /* Check buffer timeouts, and set the corresponding flags. The |
| 278 | * likely/unlikely have been optimized for fastest normal path. |
Willy Tarreau | dd80c6f | 2008-12-13 22:25:59 +0100 | [diff] [blame] | 279 | * The read/write timeouts are not set if there was activity on the buffer. |
| 280 | * That way, we don't have to update the timeout on every I/O. Note that the |
| 281 | * analyser timeout is always checked. |
Willy Tarreau | 2eb52f0 | 2008-09-04 09:14:08 +0200 | [diff] [blame] | 282 | */ |
| 283 | static inline void buffer_check_timeouts(struct buffer *b) |
| 284 | { |
Willy Tarreau | 86491c3 | 2008-12-14 09:04:47 +0100 | [diff] [blame] | 285 | 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] | 286 | unlikely(tick_is_expired(b->rex, now_ms))) |
| 287 | b->flags |= BF_READ_TIMEOUT; |
| 288 | |
Willy Tarreau | dd80c6f | 2008-12-13 22:25:59 +0100 | [diff] [blame] | 289 | if (likely(!(b->flags & (BF_SHUTW|BF_WRITE_TIMEOUT|BF_WRITE_ACTIVITY))) && |
Willy Tarreau | 2eb52f0 | 2008-09-04 09:14:08 +0200 | [diff] [blame] | 290 | unlikely(tick_is_expired(b->wex, now_ms))) |
| 291 | b->flags |= BF_WRITE_TIMEOUT; |
| 292 | |
| 293 | if (likely(!(b->flags & BF_ANA_TIMEOUT)) && |
| 294 | unlikely(tick_is_expired(b->analyse_exp, now_ms))) |
| 295 | b->flags |= BF_ANA_TIMEOUT; |
| 296 | } |
| 297 | |
Willy Tarreau | 2e046c6 | 2012-03-01 16:08:30 +0100 | [diff] [blame] | 298 | /* Schedule all remaining buffer data to be sent. ->o is not touched if it |
Willy Tarreau | e8a28bf | 2009-03-08 21:12:04 +0100 | [diff] [blame] | 299 | * already covers those data. That permits doing a flush even after a forward, |
| 300 | * although not recommended. |
| 301 | */ |
| 302 | static inline void buffer_flush(struct buffer *buf) |
| 303 | { |
Willy Tarreau | 363a5bb | 2012-03-02 20:14:45 +0100 | [diff] [blame^] | 304 | buf->p = buffer_wrap_add(buf, buf->p + buf->i); |
Willy Tarreau | 02d6cfc | 2012-03-01 18:19:58 +0100 | [diff] [blame] | 305 | buf->o += buf->i; |
| 306 | buf->i = 0; |
Willy Tarreau | 2e046c6 | 2012-03-01 16:08:30 +0100 | [diff] [blame] | 307 | if (buf->o) |
Willy Tarreau | ba0b63d | 2009-09-20 08:09:44 +0200 | [diff] [blame] | 308 | buf->flags &= ~BF_OUT_EMPTY; |
Willy Tarreau | e8a28bf | 2009-03-08 21:12:04 +0100 | [diff] [blame] | 309 | } |
| 310 | |
Willy Tarreau | 6f0aa47 | 2009-03-08 20:33:29 +0100 | [diff] [blame] | 311 | /* Erase any content from buffer <buf> and adjusts flags accordingly. Note |
Willy Tarreau | 0abebcc | 2009-01-08 00:09:41 +0100 | [diff] [blame] | 312 | * that any spliced data is not affected since we may not have any access to |
| 313 | * it. |
Willy Tarreau | e393fe2 | 2008-08-16 22:18:07 +0200 | [diff] [blame] | 314 | */ |
Willy Tarreau | 6f0aa47 | 2009-03-08 20:33:29 +0100 | [diff] [blame] | 315 | static inline void buffer_erase(struct buffer *buf) |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 316 | { |
Willy Tarreau | 2e046c6 | 2012-03-01 16:08:30 +0100 | [diff] [blame] | 317 | buf->o = 0; |
Willy Tarreau | 02d6cfc | 2012-03-01 18:19:58 +0100 | [diff] [blame] | 318 | buf->i = 0; |
Willy Tarreau | 6b66f3e | 2008-12-14 17:31:54 +0100 | [diff] [blame] | 319 | buf->to_forward = 0; |
Willy Tarreau | 363a5bb | 2012-03-02 20:14:45 +0100 | [diff] [blame^] | 320 | buf->lr = buf->p = buf->data; |
Willy Tarreau | ba0b63d | 2009-09-20 08:09:44 +0200 | [diff] [blame] | 321 | buf->flags &= ~(BF_FULL | BF_OUT_EMPTY); |
| 322 | if (!buf->pipe) |
| 323 | buf->flags |= BF_OUT_EMPTY; |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 324 | } |
| 325 | |
Willy Tarreau | 9cb8daa | 2009-09-15 21:22:24 +0200 | [diff] [blame] | 326 | /* Cut the "tail" of the buffer, which means strip it to the length of unsent |
| 327 | * data only, and kill any remaining unsent data. Any scheduled forwarding is |
| 328 | * stopped. This is mainly to be used to send error messages after existing |
| 329 | * data. |
| 330 | */ |
| 331 | static inline void buffer_cut_tail(struct buffer *buf) |
| 332 | { |
Willy Tarreau | 2e046c6 | 2012-03-01 16:08:30 +0100 | [diff] [blame] | 333 | if (!buf->o) |
Willy Tarreau | 9cb8daa | 2009-09-15 21:22:24 +0200 | [diff] [blame] | 334 | return buffer_erase(buf); |
| 335 | |
| 336 | buf->to_forward = 0; |
Willy Tarreau | 02d6cfc | 2012-03-01 18:19:58 +0100 | [diff] [blame] | 337 | if (!buf->i) |
Willy Tarreau | 9cb8daa | 2009-09-15 21:22:24 +0200 | [diff] [blame] | 338 | return; |
| 339 | |
Willy Tarreau | 02d6cfc | 2012-03-01 18:19:58 +0100 | [diff] [blame] | 340 | buf->i = 0; |
Willy Tarreau | 363a5bb | 2012-03-02 20:14:45 +0100 | [diff] [blame^] | 341 | buf->lr = buf->p; |
Willy Tarreau | ba0b63d | 2009-09-20 08:09:44 +0200 | [diff] [blame] | 342 | buf->flags &= ~BF_FULL; |
Willy Tarreau | 02d6cfc | 2012-03-01 18:19:58 +0100 | [diff] [blame] | 343 | if (buffer_len(buf) >= buffer_max_len(buf)) |
Willy Tarreau | 9cb8daa | 2009-09-15 21:22:24 +0200 | [diff] [blame] | 344 | buf->flags |= BF_FULL; |
| 345 | } |
| 346 | |
Willy Tarreau | d21e01c | 2009-12-27 15:45:38 +0100 | [diff] [blame] | 347 | /* Cut the <n> next unsent bytes of the buffer. The caller must ensure that <n> |
| 348 | * is smaller than the actual buffer's length. This is mainly used to remove |
| 349 | * empty lines at the beginning of a request or a response. |
| 350 | */ |
| 351 | static inline void buffer_ignore(struct buffer *buf, int n) |
| 352 | { |
Willy Tarreau | 02d6cfc | 2012-03-01 18:19:58 +0100 | [diff] [blame] | 353 | buf->i -= n; |
Willy Tarreau | 89fa706 | 2012-03-02 16:13:16 +0100 | [diff] [blame] | 354 | buf->p = buffer_wrap_add(buf, buf->p + n); |
Willy Tarreau | d21e01c | 2009-12-27 15:45:38 +0100 | [diff] [blame] | 355 | buf->flags &= ~BF_FULL; |
Willy Tarreau | 02d6cfc | 2012-03-01 18:19:58 +0100 | [diff] [blame] | 356 | if (buffer_len(buf) >= buffer_max_len(buf)) |
Willy Tarreau | d21e01c | 2009-12-27 15:45:38 +0100 | [diff] [blame] | 357 | buf->flags |= BF_FULL; |
| 358 | } |
| 359 | |
Willy Tarreau | fa7e102 | 2008-10-19 07:30:41 +0200 | [diff] [blame] | 360 | /* marks the buffer as "shutdown" ASAP for reads */ |
| 361 | static inline void buffer_shutr_now(struct buffer *buf) |
| 362 | { |
Willy Tarreau | fe3718a | 2008-11-30 18:14:12 +0100 | [diff] [blame] | 363 | buf->flags |= BF_SHUTR_NOW; |
Willy Tarreau | fa7e102 | 2008-10-19 07:30:41 +0200 | [diff] [blame] | 364 | } |
| 365 | |
| 366 | /* marks the buffer as "shutdown" ASAP for writes */ |
| 367 | static inline void buffer_shutw_now(struct buffer *buf) |
| 368 | { |
| 369 | buf->flags |= BF_SHUTW_NOW; |
| 370 | } |
| 371 | |
| 372 | /* marks the buffer as "shutdown" ASAP in both directions */ |
| 373 | static inline void buffer_abort(struct buffer *buf) |
| 374 | { |
Willy Tarreau | fe3718a | 2008-11-30 18:14:12 +0100 | [diff] [blame] | 375 | buf->flags |= BF_SHUTR_NOW | BF_SHUTW_NOW; |
Willy Tarreau | e459976 | 2010-03-21 23:25:09 +0100 | [diff] [blame] | 376 | buf->flags &= ~BF_AUTO_CONNECT; |
Willy Tarreau | fa7e102 | 2008-10-19 07:30:41 +0200 | [diff] [blame] | 377 | } |
| 378 | |
Willy Tarreau | 01bf867 | 2008-12-07 18:03:29 +0100 | [diff] [blame] | 379 | /* Installs <func> as a hijacker on the buffer <b> for session <s>. The hijack |
| 380 | * flag is set, and the function called once. The function is responsible for |
| 381 | * clearing the hijack bit. It is possible that the function clears the flag |
| 382 | * during this first call. |
| 383 | */ |
| 384 | static inline void buffer_install_hijacker(struct session *s, |
| 385 | struct buffer *b, |
| 386 | void (*func)(struct session *, struct buffer *)) |
Willy Tarreau | 72b179a | 2008-08-28 16:01:32 +0200 | [diff] [blame] | 387 | { |
Willy Tarreau | 01bf867 | 2008-12-07 18:03:29 +0100 | [diff] [blame] | 388 | b->hijacker = func; |
| 389 | b->flags |= BF_HIJACK; |
| 390 | func(s, b); |
Willy Tarreau | 72b179a | 2008-08-28 16:01:32 +0200 | [diff] [blame] | 391 | } |
| 392 | |
Willy Tarreau | 01bf867 | 2008-12-07 18:03:29 +0100 | [diff] [blame] | 393 | /* Releases the buffer from hijacking mode. Often used by the hijack function */ |
Willy Tarreau | 72b179a | 2008-08-28 16:01:32 +0200 | [diff] [blame] | 394 | static inline void buffer_stop_hijack(struct buffer *buf) |
| 395 | { |
| 396 | buf->flags &= ~BF_HIJACK; |
| 397 | } |
| 398 | |
Willy Tarreau | 520d95e | 2009-09-19 21:04:57 +0200 | [diff] [blame] | 399 | /* allow the consumer to try to establish a new connection. */ |
| 400 | static inline void buffer_auto_connect(struct buffer *buf) |
Willy Tarreau | 3da77c5 | 2008-08-29 09:58:42 +0200 | [diff] [blame] | 401 | { |
Willy Tarreau | 520d95e | 2009-09-19 21:04:57 +0200 | [diff] [blame] | 402 | buf->flags |= BF_AUTO_CONNECT; |
Willy Tarreau | 3da77c5 | 2008-08-29 09:58:42 +0200 | [diff] [blame] | 403 | } |
| 404 | |
Willy Tarreau | 520d95e | 2009-09-19 21:04:57 +0200 | [diff] [blame] | 405 | /* prevent the consumer from trying to establish a new connection, and also |
| 406 | * disable auto shutdown forwarding. |
| 407 | */ |
| 408 | static inline void buffer_dont_connect(struct buffer *buf) |
Willy Tarreau | 3da77c5 | 2008-08-29 09:58:42 +0200 | [diff] [blame] | 409 | { |
Willy Tarreau | 520d95e | 2009-09-19 21:04:57 +0200 | [diff] [blame] | 410 | buf->flags &= ~(BF_AUTO_CONNECT|BF_AUTO_CLOSE); |
Willy Tarreau | 3da77c5 | 2008-08-29 09:58:42 +0200 | [diff] [blame] | 411 | } |
| 412 | |
Willy Tarreau | 520d95e | 2009-09-19 21:04:57 +0200 | [diff] [blame] | 413 | /* allow the producer to forward shutdown requests */ |
| 414 | static inline void buffer_auto_close(struct buffer *buf) |
Willy Tarreau | 0a5d5dd | 2008-11-23 19:31:35 +0100 | [diff] [blame] | 415 | { |
Willy Tarreau | 520d95e | 2009-09-19 21:04:57 +0200 | [diff] [blame] | 416 | buf->flags |= BF_AUTO_CLOSE; |
Willy Tarreau | 0a5d5dd | 2008-11-23 19:31:35 +0100 | [diff] [blame] | 417 | } |
| 418 | |
Willy Tarreau | 520d95e | 2009-09-19 21:04:57 +0200 | [diff] [blame] | 419 | /* prevent the producer from forwarding shutdown requests */ |
| 420 | static inline void buffer_dont_close(struct buffer *buf) |
Willy Tarreau | 0a5d5dd | 2008-11-23 19:31:35 +0100 | [diff] [blame] | 421 | { |
Willy Tarreau | 520d95e | 2009-09-19 21:04:57 +0200 | [diff] [blame] | 422 | buf->flags &= ~BF_AUTO_CLOSE; |
Willy Tarreau | 0a5d5dd | 2008-11-23 19:31:35 +0100 | [diff] [blame] | 423 | } |
| 424 | |
Willy Tarreau | 90deb18 | 2010-01-07 00:20:41 +0100 | [diff] [blame] | 425 | /* allow the producer to read / poll the input */ |
| 426 | static inline void buffer_auto_read(struct buffer *buf) |
| 427 | { |
| 428 | buf->flags &= ~BF_DONT_READ; |
| 429 | } |
| 430 | |
| 431 | /* prevent the producer from read / poll the input */ |
| 432 | static inline void buffer_dont_read(struct buffer *buf) |
| 433 | { |
| 434 | buf->flags |= BF_DONT_READ; |
| 435 | } |
| 436 | |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 437 | /* |
| 438 | * Tries to realign the given buffer, and returns how many bytes can be written |
| 439 | * there at once without overwriting anything. |
| 440 | */ |
| 441 | static inline int buffer_realign(struct buffer *buf) |
| 442 | { |
Willy Tarreau | 02d6cfc | 2012-03-01 18:19:58 +0100 | [diff] [blame] | 443 | if (!(buf->i | buf->o)) { |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 444 | /* let's realign the buffer to optimize I/O */ |
Willy Tarreau | 363a5bb | 2012-03-02 20:14:45 +0100 | [diff] [blame^] | 445 | buf->p = buf->lr = buf->data; |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 446 | } |
Willy Tarreau | 4b517ca | 2011-11-25 20:33:58 +0100 | [diff] [blame] | 447 | return buffer_contig_space(buf); |
Willy Tarreau | 2b7addc | 2009-08-31 07:37:22 +0200 | [diff] [blame] | 448 | } |
| 449 | |
| 450 | /* |
| 451 | * Advance the buffer's read pointer by <len> bytes. This is useful when data |
| 452 | * have been read directly from the buffer. It is illegal to call this function |
| 453 | * with <len> causing a wrapping at the end of the buffer. It's the caller's |
Willy Tarreau | 2e046c6 | 2012-03-01 16:08:30 +0100 | [diff] [blame] | 454 | * responsibility to ensure that <len> is never larger than buf->o. |
Willy Tarreau | 2b7addc | 2009-08-31 07:37:22 +0200 | [diff] [blame] | 455 | */ |
| 456 | static inline void buffer_skip(struct buffer *buf, int len) |
| 457 | { |
Willy Tarreau | 02d6cfc | 2012-03-01 18:19:58 +0100 | [diff] [blame] | 458 | buf->o -= len; |
| 459 | if (buffer_len(buf) == 0) |
Willy Tarreau | 363a5bb | 2012-03-02 20:14:45 +0100 | [diff] [blame^] | 460 | buf->p = buf->lr = buf->data; |
Willy Tarreau | 2b7addc | 2009-08-31 07:37:22 +0200 | [diff] [blame] | 461 | |
Willy Tarreau | 02d6cfc | 2012-03-01 18:19:58 +0100 | [diff] [blame] | 462 | if (buffer_len(buf) < buffer_max_len(buf)) |
Willy Tarreau | 2b7addc | 2009-08-31 07:37:22 +0200 | [diff] [blame] | 463 | buf->flags &= ~BF_FULL; |
| 464 | |
Willy Tarreau | 2e046c6 | 2012-03-01 16:08:30 +0100 | [diff] [blame] | 465 | if (!buf->o && !buf->pipe) |
Willy Tarreau | ba0b63d | 2009-09-20 08:09:44 +0200 | [diff] [blame] | 466 | buf->flags |= BF_OUT_EMPTY; |
Willy Tarreau | fb0e920 | 2009-09-23 23:47:55 +0200 | [diff] [blame] | 467 | |
| 468 | /* notify that some data was written to the SI from the buffer */ |
| 469 | buf->flags |= BF_WRITE_PARTIAL; |
Willy Tarreau | 2b7addc | 2009-08-31 07:37:22 +0200 | [diff] [blame] | 470 | } |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 471 | |
Willy Tarreau | aeac319 | 2009-08-31 08:09:57 +0200 | [diff] [blame] | 472 | /* writes the chunk <chunk> to buffer <buf>. Returns -1 in case of success, |
| 473 | * -2 if it is larger than the buffer size, or the number of bytes available |
| 474 | * otherwise. If the chunk has been written, its size is automatically reset |
| 475 | * to zero. The send limit is automatically adjusted with the amount of data |
| 476 | * written. |
| 477 | */ |
| 478 | static inline int buffer_write_chunk(struct buffer *buf, struct chunk *chunk) |
| 479 | { |
| 480 | int ret; |
| 481 | |
| 482 | ret = buffer_write(buf, chunk->str, chunk->len); |
| 483 | if (ret == -1) |
| 484 | chunk->len = 0; |
| 485 | return ret; |
| 486 | } |
| 487 | |
Willy Tarreau | 74b08c9 | 2010-09-08 17:04:31 +0200 | [diff] [blame] | 488 | /* Tries to copy chunk <chunk> into buffer <buf> after length controls. |
Willy Tarreau | 2e046c6 | 2012-03-01 16:08:30 +0100 | [diff] [blame] | 489 | * The ->o and to_forward pointers are updated. If the buffer's input is |
Willy Tarreau | 74b08c9 | 2010-09-08 17:04:31 +0200 | [diff] [blame] | 490 | * closed, -2 is returned. If the block is too large for this buffer, -3 is |
| 491 | * returned. If there is not enough room left in the buffer, -1 is returned. |
| 492 | * Otherwise the number of bytes copied is returned (0 being a valid number). |
| 493 | * Buffer flags FULL, EMPTY and READ_PARTIAL are updated if some data can be |
| 494 | * transferred. The chunk's length is updated with the number of bytes sent. |
Willy Tarreau | aeac319 | 2009-08-31 08:09:57 +0200 | [diff] [blame] | 495 | */ |
Willy Tarreau | 74b08c9 | 2010-09-08 17:04:31 +0200 | [diff] [blame] | 496 | static inline int buffer_put_chunk(struct buffer *buf, struct chunk *chunk) |
Willy Tarreau | aeac319 | 2009-08-31 08:09:57 +0200 | [diff] [blame] | 497 | { |
| 498 | int ret; |
| 499 | |
Willy Tarreau | 74b08c9 | 2010-09-08 17:04:31 +0200 | [diff] [blame] | 500 | ret = buffer_put_block(buf, chunk->str, chunk->len); |
| 501 | if (ret > 0) |
| 502 | chunk->len -= ret; |
Willy Tarreau | aeac319 | 2009-08-31 08:09:57 +0200 | [diff] [blame] | 503 | return ret; |
| 504 | } |
| 505 | |
Willy Tarreau | 74b08c9 | 2010-09-08 17:04:31 +0200 | [diff] [blame] | 506 | /* Tries to copy string <str> at once into buffer <buf> after length controls. |
Willy Tarreau | 2e046c6 | 2012-03-01 16:08:30 +0100 | [diff] [blame] | 507 | * The ->o and to_forward pointers are updated. If the buffer's input is |
Willy Tarreau | 74b08c9 | 2010-09-08 17:04:31 +0200 | [diff] [blame] | 508 | * closed, -2 is returned. If the block is too large for this buffer, -3 is |
| 509 | * returned. If there is not enough room left in the buffer, -1 is returned. |
| 510 | * Otherwise the number of bytes copied is returned (0 being a valid number). |
| 511 | * Buffer flags FULL, EMPTY and READ_PARTIAL are updated if some data can be |
| 512 | * transferred. |
| 513 | */ |
| 514 | static inline int buffer_put_string(struct buffer *buf, const char *str) |
| 515 | { |
| 516 | return buffer_put_block(buf, str, strlen(str)); |
| 517 | } |
| 518 | |
| 519 | /* |
| 520 | * Return one char from the buffer. If the buffer is empty and closed, return -2. |
| 521 | * If the buffer is just empty, return -1. The buffer's pointer is not advanced, |
| 522 | * it's up to the caller to call buffer_skip(buf, 1) when it has consumed the char. |
Willy Tarreau | 2e046c6 | 2012-03-01 16:08:30 +0100 | [diff] [blame] | 523 | * Also note that this function respects the ->o limit. |
Willy Tarreau | 74b08c9 | 2010-09-08 17:04:31 +0200 | [diff] [blame] | 524 | */ |
| 525 | static inline int buffer_get_char(struct buffer *buf) |
| 526 | { |
| 527 | /* closed or empty + imminent close = -2; empty = -1 */ |
| 528 | if (unlikely(buf->flags & (BF_OUT_EMPTY|BF_SHUTW))) { |
| 529 | if (buf->flags & (BF_SHUTW|BF_SHUTW_NOW)) |
| 530 | return -2; |
| 531 | return -1; |
| 532 | } |
Willy Tarreau | 89fa706 | 2012-03-02 16:13:16 +0100 | [diff] [blame] | 533 | return *buffer_wrap_sub(buf, buf->p - buf->o); |
Willy Tarreau | 74b08c9 | 2010-09-08 17:04:31 +0200 | [diff] [blame] | 534 | } |
| 535 | |
| 536 | |
| 537 | /* DEPRECATED, just provided for compatibility, use buffer_put_chunk() instead !!! |
| 538 | * returns >= 0 if the buffer is too small to hold the message, -1 if the |
| 539 | * transfer was OK, -2 in case of failure. |
| 540 | */ |
| 541 | static inline int buffer_feed_chunk(struct buffer *buf, struct chunk *msg) |
| 542 | { |
| 543 | int ret = buffer_put_chunk(buf, msg); |
| 544 | if (ret >= 0) /* transfer OK */ |
| 545 | return -1; |
| 546 | if (ret == -1) /* missing room */ |
| 547 | return 1; |
| 548 | /* failure */ |
| 549 | return -2; |
| 550 | } |
| 551 | |
| 552 | /* DEPRECATED, just provided for compatibility, use buffer_put_string() instead !!! |
| 553 | * returns >= 0 if the buffer is too small to hold the message, -1 if the |
| 554 | * transfer was OK, -2 in case of failure. |
Willy Tarreau | 9bcc91e | 2009-10-10 18:01:44 +0200 | [diff] [blame] | 555 | */ |
| 556 | static inline int buffer_feed(struct buffer *buf, const char *str) |
| 557 | { |
Willy Tarreau | 74b08c9 | 2010-09-08 17:04:31 +0200 | [diff] [blame] | 558 | int ret = buffer_put_string(buf, str); |
| 559 | if (ret >= 0) /* transfer OK */ |
| 560 | return -1; |
| 561 | if (ret == -1) /* missing room */ |
| 562 | return 1; |
| 563 | /* failure */ |
| 564 | return -2; |
Willy Tarreau | 9bcc91e | 2009-10-10 18:01:44 +0200 | [diff] [blame] | 565 | } |
| 566 | |
Willy Tarreau | 19ae56b | 2011-11-28 10:36:13 +0100 | [diff] [blame] | 567 | |
| 568 | /* This function writes the string <str> at position <pos> which must be in |
| 569 | * buffer <b>, and moves <end> just after the end of <str>. <b>'s parameters |
| 570 | * (l, r, lr) are updated to be valid after the shift. the shift value |
| 571 | * (positive or negative) is returned. If there's no space left, the move is |
Willy Tarreau | 2e046c6 | 2012-03-01 16:08:30 +0100 | [diff] [blame] | 572 | * not done. The function does not adjust ->o nor BF_OUT_EMPTY because |
Willy Tarreau | 19ae56b | 2011-11-28 10:36:13 +0100 | [diff] [blame] | 573 | * it does not make sense to use it on data scheduled to be sent. |
| 574 | */ |
| 575 | static inline int buffer_replace(struct buffer *b, char *pos, char *end, const char *str) |
| 576 | { |
| 577 | return buffer_replace2(b, pos, end, str, strlen(str)); |
| 578 | } |
| 579 | |
Willy Tarreau | 74b08c9 | 2010-09-08 17:04:31 +0200 | [diff] [blame] | 580 | /* |
| 581 | * |
| 582 | * Functions below are used to manage chunks |
| 583 | * |
| 584 | */ |
| 585 | |
Krzysztof Piotr Oledzki | 78abe61 | 2009-09-27 13:23:20 +0200 | [diff] [blame] | 586 | static inline void chunk_init(struct chunk *chk, char *str, size_t size) { |
| 587 | chk->str = str; |
| 588 | chk->len = 0; |
| 589 | chk->size = size; |
| 590 | } |
| 591 | |
| 592 | /* report 0 in case of error, 1 if OK. */ |
Krzysztof Piotr Oledzki | 6f61b21 | 2009-10-04 23:34:15 +0200 | [diff] [blame] | 593 | 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] | 594 | |
Krzysztof Piotr Oledzki | 6f61b21 | 2009-10-04 23:34:15 +0200 | [diff] [blame] | 595 | if (size && len > size) |
Krzysztof Piotr Oledzki | 78abe61 | 2009-09-27 13:23:20 +0200 | [diff] [blame] | 596 | return 0; |
| 597 | |
| 598 | chk->str = str; |
| 599 | chk->len = len; |
| 600 | chk->size = size; |
| 601 | |
| 602 | return 1; |
| 603 | } |
| 604 | |
| 605 | static inline void chunk_initstr(struct chunk *chk, char *str) { |
| 606 | chk->str = str; |
| 607 | chk->len = strlen(str); |
| 608 | chk->size = 0; /* mark it read-only */ |
| 609 | } |
| 610 | |
| 611 | static inline int chunk_strcpy(struct chunk *chk, const char *str) { |
| 612 | size_t len; |
| 613 | |
| 614 | len = strlen(str); |
| 615 | |
| 616 | if (unlikely(len > chk->size)) |
| 617 | return 0; |
| 618 | |
| 619 | chk->len = len; |
| 620 | memcpy(chk->str, str, len); |
| 621 | |
| 622 | return 1; |
| 623 | } |
| 624 | |
| 625 | int chunk_printf(struct chunk *chk, const char *fmt, ...) |
| 626 | __attribute__ ((format(printf, 2, 3))); |
| 627 | |
Krzysztof Piotr Oledzki | ba8d7d3 | 2009-10-10 21:06:03 +0200 | [diff] [blame] | 628 | int chunk_htmlencode(struct chunk *dst, struct chunk *src); |
| 629 | int chunk_asciiencode(struct chunk *dst, struct chunk *src, char qc); |
| 630 | |
Krzysztof Piotr Oledzki | 78abe61 | 2009-09-27 13:23:20 +0200 | [diff] [blame] | 631 | static inline void chunk_reset(struct chunk *chk) { |
| 632 | chk->str = NULL; |
| 633 | chk->len = -1; |
| 634 | chk->size = 0; |
| 635 | } |
| 636 | |
| 637 | static inline void chunk_destroy(struct chunk *chk) { |
| 638 | |
| 639 | if (!chk->size) |
| 640 | return; |
| 641 | |
| 642 | if (chk->str) |
| 643 | free(chk->str); |
| 644 | |
| 645 | chunk_reset(chk); |
| 646 | } |
| 647 | |
Willy Tarreau | 0f77253 | 2006-12-23 20:51:41 +0100 | [diff] [blame] | 648 | /* |
| 649 | * frees the destination chunk if already allocated, allocates a new string, |
| 650 | * and copies the source into it. The pointer to the destination string is |
| 651 | * returned, or NULL if the allocation fails or if any pointer is NULL.. |
| 652 | */ |
| 653 | static inline char *chunk_dup(struct chunk *dst, const struct chunk *src) { |
| 654 | if (!dst || !src || !src->str) |
| 655 | return NULL; |
| 656 | if (dst->str) |
| 657 | free(dst->str); |
| 658 | dst->len = src->len; |
| 659 | dst->str = (char *)malloc(dst->len); |
| 660 | memcpy(dst->str, src->str, dst->len); |
| 661 | return dst->str; |
| 662 | } |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 663 | |
| 664 | #endif /* _PROTO_BUFFERS_H */ |
| 665 | |
| 666 | /* |
| 667 | * Local variables: |
| 668 | * c-indent-level: 8 |
| 669 | * c-basic-offset: 8 |
| 670 | * End: |
| 671 | */ |