blob: e88a79ddf440fb0c5f030338ce1696e98eeaed58 [file] [log] [blame]
Willy Tarreaubaaee002006-06-26 02:48:02 +02001/*
Willy Tarreaucc05fba2009-10-27 21:40:18 +01002 * include/common/standard.h
3 * This files contains some general purpose functions and macros.
4 *
Willy Tarreau348238b2010-01-18 15:05:57 +01005 * Copyright (C) 2000-2010 Willy Tarreau - w@1wt.eu
Willy Tarreaucc05fba2009-10-27 21:40:18 +01006 *
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation, version 2.1
10 * exclusively.
11 *
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with this library; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 */
Willy Tarreaubaaee002006-06-26 02:48:02 +020021
Willy Tarreau2dd0d472006-06-29 17:53:05 +020022#ifndef _COMMON_STANDARD_H
23#define _COMMON_STANDARD_H
Willy Tarreaubaaee002006-06-26 02:48:02 +020024
Willy Tarreau167d8b52007-04-09 22:16:12 +020025#include <limits.h>
Willy Tarreau050737f2010-01-14 11:40:12 +010026#include <string.h>
Willy Tarreau0ebb5112016-12-05 00:10:57 +010027#include <stdio.h>
Willy Tarreaufe944602007-10-25 10:34:16 +020028#include <time.h>
David Carlier5222d8e2017-11-03 12:00:26 +000029#include <stdarg.h>
Willy Tarreaue6e49cf2015-04-29 17:13:35 +020030#include <sys/time.h>
Willy Tarreau938b3032007-05-10 06:39:03 +020031#include <sys/types.h>
Willy Tarreaud50265a2012-09-04 14:18:33 +020032#include <sys/socket.h>
Willy Tarreaudd2f85e2012-09-02 22:34:23 +020033#include <sys/un.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020034#include <netinet/in.h>
Willy Tarreau5b4dd682015-07-21 23:47:18 +020035#include <arpa/inet.h>
Thierry FOURNIERe059ec92014-03-17 12:01:13 +010036#include <common/chunk.h>
Willy Tarreaue3ba5f02006-06-29 18:54:54 +020037#include <common/config.h>
Willy Tarreau16e01562016-08-09 16:46:18 +020038#include <common/namespace.h>
Willy Tarreau45cb4fb2009-10-26 21:10:04 +010039#include <eb32tree.h>
Willy Tarreau9c1e15d2017-11-15 18:51:29 +010040#include <eb32sctree.h>
William Lallemand2fe7dd02018-09-11 16:51:29 +020041#include <types/protocol.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020042
Thierry FOURNIER511e9472014-01-23 17:40:34 +010043/* size used for max length of decimal representation of long long int. */
44#define NB_LLMAX_STR (sizeof("-9223372036854775807")-1)
45
Willy Tarreau56adcf22012-12-23 18:00:29 +010046/* number of itoa_str entries */
Willy Tarreau59caa3b2018-12-14 13:59:42 +010047#define NB_ITOA_STR 16
William Lallemande7340ec2012-01-24 11:15:39 +010048
Willy Tarreau588297f2014-06-16 15:16:40 +020049/* maximum quoted string length (truncated above) */
50#define QSTR_SIZE 200
51#define NB_QSTR 10
52
Willy Tarreaubaaee002006-06-26 02:48:02 +020053/****** string-specific macros and functions ******/
54/* if a > max, then bound <a> to <max>. The macro returns the new <a> */
55#define UBOUND(a, max) ({ typeof(a) b = (max); if ((a) > b) (a) = b; (a); })
56
57/* if a < min, then bound <a> to <min>. The macro returns the new <a> */
58#define LBOUND(a, min) ({ typeof(a) b = (min); if ((a) < b) (a) = b; (a); })
59
60/* returns 1 only if only zero or one bit is set in X, which means that X is a
61 * power of 2, and 0 otherwise */
62#define POWEROF2(x) (((x) & ((x)-1)) == 0)
63
Willy Tarreau5b180202010-07-18 10:40:48 +020064/* operators to compare values. They're ordered that way so that the lowest bit
65 * serves as a negation for the test and contains all tests that are not equal.
66 */
67enum {
68 STD_OP_LE = 0, STD_OP_GT = 1,
69 STD_OP_EQ = 2, STD_OP_NE = 3,
70 STD_OP_GE = 4, STD_OP_LT = 5,
71};
72
Thierry FOURNIER9f95e402014-03-21 14:51:46 +010073enum http_scheme {
74 SCH_HTTP,
75 SCH_HTTPS,
76};
77
78struct split_url {
79 enum http_scheme scheme;
80 const char *host;
81 int host_len;
82};
83
Christopher Faulet99bca652017-11-14 16:47:26 +010084extern THREAD_LOCAL int itoa_idx; /* index of next itoa_str to use */
Willy Tarreau56adcf22012-12-23 18:00:29 +010085
Willy Tarreau7d58a632007-01-13 23:06:06 +010086/*
Willy Tarreaubaaee002006-06-26 02:48:02 +020087 * copies at most <size-1> chars from <src> to <dst>. Last char is always
88 * set to 0, unless <size> is 0. The number of chars copied is returned
89 * (excluding the terminating zero).
90 * This code has been optimized for size and speed : on x86, it's 45 bytes
91 * long, uses only registers, and consumes only 4 cycles per char.
92 */
93extern int strlcpy2(char *dst, const char *src, int size);
94
95/*
Willy Tarreau72d759c2007-10-25 12:14:10 +020096 * This function simply returns a locally allocated string containing
Willy Tarreaubaaee002006-06-26 02:48:02 +020097 * the ascii representation for number 'n' in decimal.
98 */
Christopher Faulet99bca652017-11-14 16:47:26 +010099extern THREAD_LOCAL char itoa_str[][171];
Emeric Brun3a7fce52010-01-04 14:54:38 +0100100extern char *ultoa_r(unsigned long n, char *buffer, int size);
Thierry FOURNIER763a5d82015-07-06 23:09:52 +0200101extern char *lltoa_r(long long int n, char *buffer, int size);
Thierry FOURNIER1480bd82015-06-06 19:14:59 +0200102extern char *sltoa_r(long n, char *buffer, int size);
Willy Tarreaue7239b52009-03-29 13:41:58 +0200103extern const char *ulltoh_r(unsigned long long n, char *buffer, int size);
Willy Tarreau72d759c2007-10-25 12:14:10 +0200104static inline const char *ultoa(unsigned long n)
105{
106 return ultoa_r(n, itoa_str[0], sizeof(itoa_str[0]));
107}
108
William Lallemande7340ec2012-01-24 11:15:39 +0100109/*
110 * unsigned long long ASCII representation
111 *
112 * return the last char '\0' or NULL if no enough
113 * space in dst
114 */
115char *ulltoa(unsigned long long n, char *dst, size_t size);
116
117
118/*
119 * unsigned long ASCII representation
120 *
121 * return the last char '\0' or NULL if no enough
122 * space in dst
123 */
124char *ultoa_o(unsigned long n, char *dst, size_t size);
125
126/*
127 * signed long ASCII representation
128 *
129 * return the last char '\0' or NULL if no enough
130 * space in dst
131 */
132char *ltoa_o(long int n, char *dst, size_t size);
133
134/*
135 * signed long long ASCII representation
136 *
137 * return the last char '\0' or NULL if no enough
138 * space in dst
139 */
140char *lltoa(long long n, char *dst, size_t size);
141
142/*
143 * write a ascii representation of a unsigned into dst,
144 * return a pointer to the last character
145 * Pad the ascii representation with '0', using size.
146 */
147char *utoa_pad(unsigned int n, char *dst, size_t size);
148
Willy Tarreaubaaee002006-06-26 02:48:02 +0200149/*
Willy Tarreau91092e52007-10-25 16:58:42 +0200150 * This function simply returns a locally allocated string containing the ascii
151 * representation for number 'n' in decimal, unless n is 0 in which case it
152 * returns the alternate string (or an empty string if the alternate string is
153 * NULL). It use is intended for limits reported in reports, where it's
154 * desirable not to display anything if there is no limit. Warning! it shares
155 * the same vector as ultoa_r().
156 */
157extern const char *limit_r(unsigned long n, char *buffer, int size, const char *alt);
158
Willy Tarreau56adcf22012-12-23 18:00:29 +0100159/* returns a locally allocated string containing the ASCII representation of
160 * the number 'n' in decimal. Up to NB_ITOA_STR calls may be used in the same
161 * function call (eg: printf), shared with the other similar functions making
162 * use of itoa_str[].
163 */
164static inline const char *U2A(unsigned long n)
165{
166 const char *ret = ultoa_r(n, itoa_str[itoa_idx], sizeof(itoa_str[0]));
167 if (++itoa_idx >= NB_ITOA_STR)
168 itoa_idx = 0;
169 return ret;
170}
171
172/* returns a locally allocated string containing the HTML representation of
173 * the number 'n' in decimal. Up to NB_ITOA_STR calls may be used in the same
174 * function call (eg: printf), shared with the other similar functions making
175 * use of itoa_str[].
Willy Tarreau91092e52007-10-25 16:58:42 +0200176 */
Willy Tarreau56adcf22012-12-23 18:00:29 +0100177static inline const char *U2H(unsigned long long n)
178{
179 const char *ret = ulltoh_r(n, itoa_str[itoa_idx], sizeof(itoa_str[0]));
180 if (++itoa_idx >= NB_ITOA_STR)
181 itoa_idx = 0;
182 return ret;
183}
184
Ioannis Cherouvim1ff76332018-10-24 10:05:19 +0300185/* returns a locally allocated string containing the ASCII representation of
Willy Tarreau56adcf22012-12-23 18:00:29 +0100186 * the number 'n' in decimal. Up to NB_ITOA_STR calls may be used in the same
187 * function call (eg: printf), shared with the other similar functions making
188 * use of itoa_str[].
189 */
190static inline const char *LIM2A(unsigned long n, const char *alt)
191{
192 const char *ret = limit_r(n, itoa_str[itoa_idx], sizeof(itoa_str[0]), alt);
193 if (++itoa_idx >= NB_ITOA_STR)
194 itoa_idx = 0;
195 return ret;
196}
Willy Tarreau91092e52007-10-25 16:58:42 +0200197
Thierry FOURNIER6ab2bae2017-04-19 11:49:44 +0200198/* Encode the integer <i> into a varint (variable-length integer). The encoded
199 * value is copied in <*buf>. Here is the encoding format:
200 *
201 * 0 <= X < 240 : 1 byte (7.875 bits) [ XXXX XXXX ]
202 * 240 <= X < 2288 : 2 bytes (11 bits) [ 1111 XXXX ] [ 0XXX XXXX ]
203 * 2288 <= X < 264432 : 3 bytes (18 bits) [ 1111 XXXX ] [ 1XXX XXXX ] [ 0XXX XXXX ]
204 * 264432 <= X < 33818864 : 4 bytes (25 bits) [ 1111 XXXX ] [ 1XXX XXXX ]*2 [ 0XXX XXXX ]
205 * 33818864 <= X < 4328786160 : 5 bytes (32 bits) [ 1111 XXXX ] [ 1XXX XXXX ]*3 [ 0XXX XXXX ]
206 * ...
207 *
208 * On success, it returns the number of written bytes and <*buf> is moved after
209 * the encoded value. Otherwise, it returns -1. */
210static inline int
211encode_varint(uint64_t i, char **buf, char *end)
212{
213 unsigned char *p = (unsigned char *)*buf;
214 int r;
215
216 if (p >= (unsigned char *)end)
217 return -1;
218
219 if (i < 240) {
220 *p++ = i;
221 *buf = (char *)p;
222 return 1;
223 }
224
225 *p++ = (unsigned char)i | 240;
226 i = (i - 240) >> 4;
227 while (i >= 128) {
228 if (p >= (unsigned char *)end)
229 return -1;
230 *p++ = (unsigned char)i | 128;
231 i = (i - 128) >> 7;
232 }
233
234 if (p >= (unsigned char *)end)
235 return -1;
236 *p++ = (unsigned char)i;
237
238 r = ((char *)p - *buf);
239 *buf = (char *)p;
240 return r;
241}
242
243/* Decode a varint from <*buf> and save the decoded value in <*i>. See
244 * 'spoe_encode_varint' for details about varint.
245 * On success, it returns the number of read bytes and <*buf> is moved after the
246 * varint. Otherwise, it returns -1. */
247static inline int
248decode_varint(char **buf, char *end, uint64_t *i)
249{
250 unsigned char *p = (unsigned char *)*buf;
251 int r;
252
253 if (p >= (unsigned char *)end)
254 return -1;
255
256 *i = *p++;
257 if (*i < 240) {
258 *buf = (char *)p;
259 return 1;
260 }
261
262 r = 4;
263 do {
264 if (p >= (unsigned char *)end)
265 return -1;
266 *i += (uint64_t)*p << r;
267 r += 7;
268 } while (*p++ >= 128);
269
270 r = ((char *)p - *buf);
271 *buf = (char *)p;
272 return r;
273}
274
Willy Tarreau588297f2014-06-16 15:16:40 +0200275/* returns a locally allocated string containing the quoted encoding of the
276 * input string. The output may be truncated to QSTR_SIZE chars, but it is
277 * guaranteed that the string will always be properly terminated. Quotes are
278 * encoded by doubling them as is commonly done in CSV files. QSTR_SIZE must
279 * always be at least 4 chars.
280 */
281const char *qstr(const char *str);
282
283/* returns <str> or its quote-encoded equivalent if it contains at least one
284 * quote or a comma. This is aimed at build CSV-compatible strings.
285 */
286static inline const char *cstr(const char *str)
287{
288 const char *p = str;
289
290 while (*p) {
291 if (*p == ',' || *p == '"')
292 return qstr(str);
293 p++;
294 }
295 return str;
296}
297
Willy Tarreau91092e52007-10-25 16:58:42 +0200298/*
Willy Tarreaubaaee002006-06-26 02:48:02 +0200299 * Returns non-zero if character <s> is a hex digit (0-9, a-f, A-F), else zero.
300 */
301extern int ishex(char s);
302
303/*
Willy Tarreauda3b7c32009-11-02 20:12:52 +0100304 * Return integer equivalent of character <c> for a hex digit (0-9, a-f, A-F),
Willy Tarreau3dd0c4e2012-10-26 00:58:22 +0200305 * otherwise -1. This compact form helps gcc produce efficient code.
Willy Tarreauda3b7c32009-11-02 20:12:52 +0100306 */
Willy Tarreau3dd0c4e2012-10-26 00:58:22 +0200307static inline int hex2i(int c)
308{
Willy Tarreauaa398602017-11-10 11:19:54 +0100309 if ((unsigned char)(c -= '0') > 9) {
310 if ((unsigned char)(c -= 'A' - '0') > 5 &&
311 (unsigned char)(c -= 'a' - 'A') > 5)
Willy Tarreau3dd0c4e2012-10-26 00:58:22 +0200312 c = -11;
313 c += 10;
314 }
315 return c;
316}
317
Willy Tarreau3ca1a882015-01-15 18:43:49 +0100318/* rounds <i> down to the closest value having max 2 digits */
319unsigned int round_2dig(unsigned int i);
Willy Tarreauda3b7c32009-11-02 20:12:52 +0100320
321/*
Willy Tarreau2e74c3f2007-12-02 18:45:09 +0100322 * Checks <name> for invalid characters. Valid chars are [A-Za-z0-9_:.-]. If an
323 * invalid character is found, a pointer to it is returned. If everything is
324 * fine, NULL is returned.
325 */
326extern const char *invalid_char(const char *name);
327
328/*
Frédéric Lécailleb82f7422017-04-13 18:24:23 +0200329 * Checks <name> for invalid characters. Valid chars are [A-Za-z0-9_.-].
Krzysztof Piotr Oledzkiefe3b6f2008-05-23 23:49:32 +0200330 * If an invalid character is found, a pointer to it is returned.
331 * If everything is fine, NULL is returned.
332 */
333extern const char *invalid_domainchar(const char *name);
334
335/*
Frédéric Lécailleb82f7422017-04-13 18:24:23 +0200336 * Checks <name> for invalid characters. Valid chars are [A-Za-z_.-].
337 * If an invalid character is found, a pointer to it is returned.
338 * If everything is fine, NULL is returned.
339 */
340extern const char *invalid_prefix_char(const char *name);
341
342/*
Willy Tarreaufab5a432011-03-04 15:31:53 +0100343 * converts <str> to a locally allocated struct sockaddr_storage *, and a
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200344 * port range consisting in two integers. The low and high end are always set
345 * even if the port is unspecified, in which case (0,0) is returned. The low
Willy Tarreaufab5a432011-03-04 15:31:53 +0100346 * port is set in the sockaddr. Thus, it is enough to check the size of the
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200347 * returned range to know if an array must be allocated or not. The format is
Willy Tarreaufab5a432011-03-04 15:31:53 +0100348 * "addr[:[port[-port]]]", where "addr" can be a dotted IPv4 address, an IPv6
349 * address, a host name, or empty or "*" to indicate INADDR_ANY. If an IPv6
350 * address wants to ignore port, it must be terminated by a trailing colon (':').
351 * The IPv6 '::' address is IN6ADDR_ANY, so in order to bind to a given port on
352 * IPv6, use ":::port". NULL is returned if the host part cannot be resolved.
Willy Tarreaud393a622013-03-04 18:22:00 +0100353 * If <pfx> is non-null, it is used as a string prefix before any path-based
Thierry FOURNIER7fe3be72015-09-26 20:03:36 +0200354 * address (typically the path to a unix socket). If use_dns is not true,
Joseph Herlant32b83272018-11-15 11:58:28 -0800355 * the function cannot accept the DNS resolution.
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200356 */
Willy Tarreau48ef4c92017-01-06 18:32:38 +0100357struct sockaddr_storage *str2sa_range(const char *str,
358 int *port, int *low, int *high,
359 char **err, const char *pfx,
360 char **fqdn, int resolve);
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200361
Willy Tarreau2937c0d2010-01-26 17:36:17 +0100362/* converts <str> to a struct in_addr containing a network mask. It can be
363 * passed in dotted form (255.255.255.0) or in CIDR form (24). It returns 1
Jarno Huuskonen577d5ac2017-05-21 17:32:21 +0300364 * if the conversion succeeds otherwise zero.
Willy Tarreau2937c0d2010-01-26 17:36:17 +0100365 */
366int str2mask(const char *str, struct in_addr *mask);
367
Tim Duesterhus47185172018-01-25 16:24:49 +0100368/* converts <str> to a struct in6_addr containing a network mask. It can be
Tim Duesterhus5e642862018-02-20 17:02:18 +0100369 * passed in quadruplet form (ffff:ffff::) or in CIDR form (64). It returns 1
Tim Duesterhus47185172018-01-25 16:24:49 +0100370 * if the conversion succeeds otherwise zero.
371 */
372int str2mask6(const char *str, struct in6_addr *mask);
373
Thierry FOURNIERb0504632013-12-14 15:39:02 +0100374/* convert <cidr> to struct in_addr <mask>. It returns 1 if the conversion
375 * succeeds otherwise non-zero.
376 */
377int cidr2dotted(int cidr, struct in_addr *mask);
378
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200379/*
Willy Tarreaud077a8e2007-05-08 18:28:09 +0200380 * converts <str> to two struct in_addr* which must be pre-allocated.
Willy Tarreaubaaee002006-06-26 02:48:02 +0200381 * The format is "addr[/mask]", where "addr" cannot be empty, and mask
382 * is optionnal and either in the dotted or CIDR notation.
383 * Note: "addr" can also be a hostname. Returns 1 if OK, 0 if error.
384 */
Thierry FOURNIERfc7ac7b2014-02-11 15:23:04 +0100385int str2net(const char *str, int resolve, struct in_addr *addr, struct in_addr *mask);
Willy Tarreaubaaee002006-06-26 02:48:02 +0200386
Thierry FOURNIER58639a02014-11-25 12:02:25 +0100387/* str2ip and str2ip2:
388 *
389 * converts <str> to a struct sockaddr_storage* provided by the caller. The
390 * caller must have zeroed <sa> first, and may have set sa->ss_family to force
391 * parse a specific address format. If the ss_family is 0 or AF_UNSPEC, then
392 * the function tries to guess the address family from the syntax. If the
393 * family is forced and the format doesn't match, an error is returned. The
394 * string is assumed to contain only an address, no port. The address can be a
395 * dotted IPv4 address, an IPv6 address, a host name, or empty or "*" to
396 * indicate INADDR_ANY. NULL is returned if the host part cannot be resolved.
397 * The return address will only have the address family and the address set,
398 * all other fields remain zero. The string is not supposed to be modified.
399 * The IPv6 '::' address is IN6ADDR_ANY.
400 *
401 * str2ip2:
402 *
403 * If <resolve> is set, this function try to resolve DNS, otherwise, it returns
404 * NULL result.
405 */
406struct sockaddr_storage *str2ip2(const char *str, struct sockaddr_storage *sa, int resolve);
407static inline struct sockaddr_storage *str2ip(const char *str, struct sockaddr_storage *sa)
408{
409 return str2ip2(str, sa, 1);
410}
411
Alexandre Cassen5eb1a902007-11-29 15:43:32 +0100412/*
Willy Tarreau6d20e282012-04-27 22:49:47 +0200413 * converts <str> to two struct in6_addr* which must be pre-allocated.
414 * The format is "addr[/mask]", where "addr" cannot be empty, and mask
415 * is an optionnal number of bits (128 being the default).
416 * Returns 1 if OK, 0 if error.
417 */
418int str62net(const char *str, struct in6_addr *addr, unsigned char *mask);
419
420/*
Willy Tarreau106f9792009-09-19 07:54:16 +0200421 * Parse IP address found in url.
422 */
David du Colombier6f5ccb12011-03-10 22:26:24 +0100423int url2ipv4(const char *addr, struct in_addr *dst);
Willy Tarreau106f9792009-09-19 07:54:16 +0200424
425/*
David du Colombier6f5ccb12011-03-10 22:26:24 +0100426 * Resolve destination server from URL. Convert <str> to a sockaddr_storage*.
Alexandre Cassen5eb1a902007-11-29 15:43:32 +0100427 */
Thierry FOURNIER9f95e402014-03-21 14:51:46 +0100428int url2sa(const char *url, int ulen, struct sockaddr_storage *addr, struct split_url *out);
Alexandre Cassen5eb1a902007-11-29 15:43:32 +0100429
Willy Tarreau631f01c2011-09-05 00:36:48 +0200430/* Tries to convert a sockaddr_storage address to text form. Upon success, the
431 * address family is returned so that it's easy for the caller to adapt to the
432 * output format. Zero is returned if the address family is not supported. -1
433 * is returned upon error, with errno set. AF_INET, AF_INET6 and AF_UNIX are
434 * supported.
435 */
Willy Tarreaud5ec4bf2019-04-25 17:48:16 +0200436int addr_to_str(const struct sockaddr_storage *addr, char *str, int size);
Willy Tarreau631f01c2011-09-05 00:36:48 +0200437
Simon Horman75ab8bd2014-06-16 09:39:41 +0900438/* Tries to convert a sockaddr_storage port to text form. Upon success, the
439 * address family is returned so that it's easy for the caller to adapt to the
440 * output format. Zero is returned if the address family is not supported. -1
441 * is returned upon error, with errno set. AF_INET, AF_INET6 and AF_UNIX are
442 * supported.
443 */
Willy Tarreaud5ec4bf2019-04-25 17:48:16 +0200444int port_to_str(const struct sockaddr_storage *addr, char *str, int size);
Simon Horman75ab8bd2014-06-16 09:39:41 +0900445
Willy Tarreau16e01562016-08-09 16:46:18 +0200446/* check if the given address is local to the system or not. It will return
447 * -1 when it's not possible to know, 0 when the address is not local, 1 when
448 * it is. We don't want to iterate over all interfaces for this (and it is not
449 * portable). So instead we try to bind in UDP to this address on a free non
450 * privileged port and to connect to the same address, port 0 (connect doesn't
451 * care). If it succeeds, we own the address. Note that non-inet addresses are
452 * considered local since they're most likely AF_UNIX.
453 */
454int addr_is_local(const struct netns_entry *ns,
455 const struct sockaddr_storage *orig);
456
Willy Tarreaubaaee002006-06-26 02:48:02 +0200457/* will try to encode the string <string> replacing all characters tagged in
458 * <map> with the hexadecimal representation of their ASCII-code (2 digits)
459 * prefixed by <escape>, and will store the result between <start> (included)
460 * and <stop> (excluded), and will always terminate the string with a '\0'
461 * before <stop>. The position of the '\0' is returned if the conversion
462 * completes. If bytes are missing between <start> and <stop>, then the
463 * conversion will be incomplete and truncated. If <stop> <= <start>, the '\0'
464 * cannot even be stored so we return <start> without writing the 0.
465 * The input string must also be zero-terminated.
466 */
467extern const char hextab[];
468char *encode_string(char *start, char *stop,
469 const char escape, const fd_set *map,
470 const char *string);
471
Thierry FOURNIERe059ec92014-03-17 12:01:13 +0100472/*
473 * Same behavior, except that it encodes chunk <chunk> instead of a string.
474 */
475char *encode_chunk(char *start, char *stop,
476 const char escape, const fd_set *map,
Willy Tarreau83061a82018-07-13 11:56:34 +0200477 const struct buffer *chunk);
Thierry FOURNIERe059ec92014-03-17 12:01:13 +0100478
Dragan Dosen0edd1092016-02-12 13:23:02 +0100479/*
480 * Tries to prefix characters tagged in the <map> with the <escape>
Dragan Dosen1a5d0602016-07-22 16:00:31 +0200481 * character. The input <string> must be zero-terminated. The result will
482 * be stored between <start> (included) and <stop> (excluded). This
483 * function will always try to terminate the resulting string with a '\0'
484 * before <stop>, and will return its position if the conversion
485 * completes.
486 */
487char *escape_string(char *start, char *stop,
488 const char escape, const fd_set *map,
489 const char *string);
490
491/*
492 * Tries to prefix characters tagged in the <map> with the <escape>
Dragan Dosen0edd1092016-02-12 13:23:02 +0100493 * character. <chunk> contains the input to be escaped. The result will be
494 * stored between <start> (included) and <stop> (excluded). The function
495 * will always try to terminate the resulting string with a '\0' before
496 * <stop>, and will return its position if the conversion completes.
497 */
498char *escape_chunk(char *start, char *stop,
499 const char escape, const fd_set *map,
Willy Tarreau83061a82018-07-13 11:56:34 +0200500 const struct buffer *chunk);
Dragan Dosen0edd1092016-02-12 13:23:02 +0100501
Thierry FOURNIERe059ec92014-03-17 12:01:13 +0100502
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200503/* Check a string for using it in a CSV output format. If the string contains
504 * one of the following four char <">, <,>, CR or LF, the string is
505 * encapsulated between <"> and the <"> are escaped by a <""> sequence.
506 * <str> is the input string to be escaped. The function assumes that
507 * the input string is null-terminated.
508 *
509 * If <quote> is 0, the result is returned escaped but without double quote.
Willy Tarreau898529b2016-01-06 18:07:04 +0100510 * It is useful if the escaped string is used between double quotes in the
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200511 * format.
512 *
Willy Tarreau898529b2016-01-06 18:07:04 +0100513 * printf("..., \"%s\", ...\r\n", csv_enc(str, 0, &trash));
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200514 *
Willy Tarreau898529b2016-01-06 18:07:04 +0100515 * If <quote> is 1, the converter puts the quotes only if any character is
516 * escaped. If <quote> is 2, the converter always puts the quotes.
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200517 *
Willy Tarreau898529b2016-01-06 18:07:04 +0100518 * <output> is a struct chunk used for storing the output string.
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200519 *
Willy Tarreau898529b2016-01-06 18:07:04 +0100520 * The function returns the converted string on its output. If an error
521 * occurs, the function returns an empty string. This type of output is useful
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200522 * for using the function directly as printf() argument.
523 *
Willy Tarreau898529b2016-01-06 18:07:04 +0100524 * If the output buffer is too short to contain the input string, the result
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200525 * is truncated.
Willy Tarreau898529b2016-01-06 18:07:04 +0100526 *
527 * This function appends the encoding to the existing output chunk. Please
528 * use csv_enc() instead if you want to replace the output chunk.
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200529 */
Willy Tarreau83061a82018-07-13 11:56:34 +0200530const char *csv_enc_append(const char *str, int quote, struct buffer *output);
Willy Tarreau898529b2016-01-06 18:07:04 +0100531
532/* same as above but the output chunk is reset first */
Willy Tarreau83061a82018-07-13 11:56:34 +0200533static inline const char *csv_enc(const char *str, int quote,
534 struct buffer *output)
Willy Tarreau898529b2016-01-06 18:07:04 +0100535{
536 chunk_reset(output);
537 return csv_enc_append(str, quote, output);
538}
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200539
Willy Tarreaubf9c2fc2011-05-31 18:06:18 +0200540/* Decode an URL-encoded string in-place. The resulting string might
541 * be shorter. If some forbidden characters are found, the conversion is
542 * aborted, the string is truncated before the issue and non-zero is returned,
543 * otherwise the operation returns non-zero indicating success.
544 */
545int url_decode(char *string);
546
Willy Tarreau6911fa42007-03-04 18:06:08 +0100547/* This one is 6 times faster than strtoul() on athlon, but does
548 * no check at all.
549 */
550static inline unsigned int __str2ui(const char *s)
551{
552 unsigned int i = 0;
553 while (*s) {
554 i = i * 10 - '0';
555 i += (unsigned char)*s++;
556 }
557 return i;
558}
559
560/* This one is 5 times faster than strtoul() on athlon with checks.
561 * It returns the value of the number composed of all valid digits read.
562 */
563static inline unsigned int __str2uic(const char *s)
564{
565 unsigned int i = 0;
566 unsigned int j;
567 while (1) {
568 j = (*s++) - '0';
569 if (j > 9)
570 break;
571 i *= 10;
572 i += j;
573 }
574 return i;
575}
576
577/* This one is 28 times faster than strtoul() on athlon, but does
578 * no check at all!
579 */
580static inline unsigned int __strl2ui(const char *s, int len)
581{
582 unsigned int i = 0;
583 while (len-- > 0) {
584 i = i * 10 - '0';
585 i += (unsigned char)*s++;
586 }
587 return i;
588}
589
590/* This one is 7 times faster than strtoul() on athlon with checks.
591 * It returns the value of the number composed of all valid digits read.
592 */
593static inline unsigned int __strl2uic(const char *s, int len)
594{
595 unsigned int i = 0;
Willy Tarreau3f0c9762007-10-25 09:42:24 +0200596 unsigned int j, k;
Willy Tarreau6911fa42007-03-04 18:06:08 +0100597
598 while (len-- > 0) {
599 j = (*s++) - '0';
Willy Tarreau3f0c9762007-10-25 09:42:24 +0200600 k = i * 10;
Willy Tarreau6911fa42007-03-04 18:06:08 +0100601 if (j > 9)
602 break;
Willy Tarreau3f0c9762007-10-25 09:42:24 +0200603 i = k + j;
Willy Tarreau6911fa42007-03-04 18:06:08 +0100604 }
605 return i;
606}
607
Willy Tarreau4ec83cd2010-10-15 23:19:55 +0200608/* This function reads an unsigned integer from the string pointed to by <s>
609 * and returns it. The <s> pointer is adjusted to point to the first unread
610 * char. The function automatically stops at <end>.
611 */
612static inline unsigned int __read_uint(const char **s, const char *end)
613{
614 const char *ptr = *s;
615 unsigned int i = 0;
616 unsigned int j, k;
617
618 while (ptr < end) {
619 j = *ptr - '0';
620 k = i * 10;
621 if (j > 9)
622 break;
623 i = k + j;
624 ptr++;
625 }
626 *s = ptr;
627 return i;
628}
629
Thierry FOURNIER763a5d82015-07-06 23:09:52 +0200630unsigned long long int read_uint64(const char **s, const char *end);
631long long int read_int64(const char **s, const char *end);
632
Willy Tarreau6911fa42007-03-04 18:06:08 +0100633extern unsigned int str2ui(const char *s);
634extern unsigned int str2uic(const char *s);
635extern unsigned int strl2ui(const char *s, int len);
636extern unsigned int strl2uic(const char *s, int len);
637extern int strl2ic(const char *s, int len);
638extern int strl2irc(const char *s, int len, int *ret);
639extern int strl2llrc(const char *s, int len, long long *ret);
Thierry FOURNIER511e9472014-01-23 17:40:34 +0100640extern int strl2llrc_dotted(const char *text, int len, long long *ret);
Willy Tarreau4ec83cd2010-10-15 23:19:55 +0200641extern unsigned int read_uint(const char **s, const char *end);
Willy Tarreaud54bbdc2009-09-07 11:00:31 +0200642unsigned int inetaddr_host(const char *text);
643unsigned int inetaddr_host_lim(const char *text, const char *stop);
Willy Tarreau74172752010-10-15 23:21:42 +0200644unsigned int inetaddr_host_lim_ret(char *text, char *stop, char **ret);
Willy Tarreau6911fa42007-03-04 18:06:08 +0100645
Krzysztof Piotr Oledzki3d5562b2009-10-10 20:11:17 +0200646static inline char *cut_crlf(char *s) {
647
Simon Horman5269cfb2013-02-13 17:48:00 +0900648 while (*s != '\r' && *s != '\n') {
Krzysztof Piotr Oledzki3d5562b2009-10-10 20:11:17 +0200649 char *p = s++;
650
651 if (!*p)
652 return p;
653 }
654
Simon Horman5269cfb2013-02-13 17:48:00 +0900655 *s++ = '\0';
Krzysztof Piotr Oledzki3d5562b2009-10-10 20:11:17 +0200656
657 return s;
658}
659
660static inline char *ltrim(char *s, char c) {
661
662 if (c)
663 while (*s == c)
664 s++;
665
666 return s;
667}
668
669static inline char *rtrim(char *s, char c) {
670
671 char *p = s + strlen(s);
672
673 while (p-- > s)
674 if (*p == c)
675 *p = '\0';
676 else
677 break;
678
679 return s;
680}
681
682static inline char *alltrim(char *s, char c) {
683
684 rtrim(s, c);
685
686 return ltrim(s, c);
687}
688
Willy Tarreaufe944602007-10-25 10:34:16 +0200689/* This function converts the time_t value <now> into a broken out struct tm
690 * which must be allocated by the caller. It is highly recommended to use this
691 * function intead of localtime() because that one requires a time_t* which
692 * is not always compatible with tv_sec depending on OS/hardware combinations.
693 */
694static inline void get_localtime(const time_t now, struct tm *tm)
695{
696 localtime_r(&now, tm);
697}
698
Emeric Brun3a058f32009-06-30 18:26:00 +0200699/* This function converts the time_t value <now> into a broken out struct tm
700 * which must be allocated by the caller. It is highly recommended to use this
701 * function intead of gmtime() because that one requires a time_t* which
702 * is not always compatible with tv_sec depending on OS/hardware combinations.
703 */
704static inline void get_gmtime(const time_t now, struct tm *tm)
705{
706 gmtime_r(&now, tm);
707}
708
Willy Tarreaucb1949b2017-07-19 19:05:29 +0200709/* Counts a number of elapsed days since 01/01/0000 based solely on elapsed
710 * years and assuming the regular rule for leap years applies. It's fake but
711 * serves as a temporary origin. It's worth remembering that it's the first
712 * year of each period that is leap and not the last one, so for instance year
713 * 1 sees 366 days since year 0 was leap. For this reason we have to apply
714 * modular arithmetics which is why we offset the year by 399 before
715 * subtracting the excess at the end. No overflow here before ~11.7 million
716 * years.
717 */
718static inline unsigned int days_since_zero(unsigned int y)
719{
720 return y * 365 + (y + 399) / 4 - (y + 399) / 100 + (y + 399) / 400
721 - 399 / 4 + 399 / 100;
722}
723
724/* Returns the number of seconds since 01/01/1970 0:0:0 GMT for GMT date <tm>.
725 * It is meant as a portable replacement for timegm() for use with valid inputs.
726 * Returns undefined results for invalid dates (eg: months out of range 0..11).
727 */
728extern time_t my_timegm(const struct tm *tm);
729
Willy Tarreaua0d37b62007-12-02 22:00:35 +0100730/* This function parses a time value optionally followed by a unit suffix among
731 * "d", "h", "m", "s", "ms" or "us". It converts the value into the unit
732 * expected by the caller. The computation does its best to avoid overflows.
733 * The value is returned in <ret> if everything is fine, and a NULL is returned
734 * by the function. In case of error, a pointer to the error is returned and
735 * <ret> is left untouched.
736 */
737extern const char *parse_time_err(const char *text, unsigned *ret, unsigned unit_flags);
Emeric Brun39132b22010-01-04 14:57:24 +0100738extern const char *parse_size_err(const char *text, unsigned *ret);
Willy Tarreaua0d37b62007-12-02 22:00:35 +0100739
740/* unit flags to pass to parse_time_err */
741#define TIME_UNIT_US 0x0000
742#define TIME_UNIT_MS 0x0001
743#define TIME_UNIT_S 0x0002
744#define TIME_UNIT_MIN 0x0003
745#define TIME_UNIT_HOUR 0x0004
746#define TIME_UNIT_DAY 0x0005
747#define TIME_UNIT_MASK 0x0007
748
William Lallemand421f5b52012-02-06 18:15:57 +0100749#define SEC 1
750#define MINUTE (60 * SEC)
751#define HOUR (60 * MINUTE)
752#define DAY (24 * HOUR)
753
Willy Tarreau7f062c42009-03-05 18:43:00 +0100754/* Multiply the two 32-bit operands and shift the 64-bit result right 32 bits.
755 * This is used to compute fixed ratios by setting one of the operands to
756 * (2^32*ratio).
757 */
758static inline unsigned int mul32hi(unsigned int a, unsigned int b)
759{
760 return ((unsigned long long)a * b) >> 32;
761}
762
Willy Tarreauf0d9eec2010-06-20 07:12:37 +0200763/* gcc does not know when it can safely divide 64 bits by 32 bits. Use this
764 * function when you know for sure that the result fits in 32 bits, because
765 * it is optimal on x86 and on 64bit processors.
766 */
767static inline unsigned int div64_32(unsigned long long o1, unsigned int o2)
768{
769 unsigned int result;
770#ifdef __i386__
771 asm("divl %2"
772 : "=a" (result)
773 : "A"(o1), "rm"(o2));
774#else
775 result = o1 / o2;
776#endif
777 return result;
778}
779
Willy Tarreaucafa56e2019-02-02 20:17:31 +0100780/* Simple popcountl implementation. It returns the number of ones in a word.
781 * Described here : https://graphics.stanford.edu/~seander/bithacks.html
782 */
David Carliere6c39412015-07-02 07:00:17 +0000783static inline unsigned int my_popcountl(unsigned long a)
Willy Tarreau37994f02012-11-19 12:11:07 +0100784{
Willy Tarreaucafa56e2019-02-02 20:17:31 +0100785 a = a - ((a >> 1) & ~0UL/3);
786 a = (a & ~0UL/15*3) + ((a >> 2) & ~0UL/15*3);
787 a = (a + (a >> 4)) & ~0UL/255*15;
788 return (unsigned long)(a * (~0UL/255)) >> (sizeof(unsigned long) - 1) * 8;
Willy Tarreau37994f02012-11-19 12:11:07 +0100789}
790
Willy Tarreau98d334b2018-10-15 09:33:41 +0200791/* returns non-zero if <a> has at least 2 bits set */
792static inline unsigned long atleast2(unsigned long a)
793{
794 return a & (a - 1);
795}
796
Christopher Fauletff813182017-11-22 15:00:13 +0100797/* Simple ffs implementation. It returns the position of the lowest bit set to
Willy Tarreaud87a67f2019-03-05 12:04:55 +0100798 * one, starting at 1. It is illegal to call it with a==0 (undefined result).
Willy Tarreau27346b02018-10-10 19:05:56 +0200799 */
Christopher Fauletff813182017-11-22 15:00:13 +0100800static inline unsigned int my_ffsl(unsigned long a)
801{
Willy Tarreau27346b02018-10-10 19:05:56 +0200802 unsigned long cnt;
Christopher Fauletff813182017-11-22 15:00:13 +0100803
Willy Tarreau27346b02018-10-10 19:05:56 +0200804#if defined(__x86_64__)
Willy Tarreauce487aa2018-10-29 16:09:57 +0100805 __asm__("bsf %1,%0\n" : "=r" (cnt) : "rm" (a));
Willy Tarreau27346b02018-10-10 19:05:56 +0200806 cnt++;
807#else
Christopher Fauletff813182017-11-22 15:00:13 +0100808
809 cnt = 1;
810#if LONG_MAX > 0x7FFFFFFFL /* 64bits */
811 if (!(a & 0xFFFFFFFFUL)) {
812 a >>= 32;
813 cnt += 32;
814 }
815#endif
816 if (!(a & 0XFFFFU)) {
817 a >>= 16;
818 cnt += 16;
819 }
820 if (!(a & 0XFF)) {
821 a >>= 8;
822 cnt += 8;
823 }
824 if (!(a & 0xf)) {
825 a >>= 4;
826 cnt += 4;
827 }
828 if (!(a & 0x3)) {
829 a >>= 2;
830 cnt += 2;
831 }
832 if (!(a & 0x1)) {
833 a >>= 1;
834 cnt += 1;
835 }
Willy Tarreau27346b02018-10-10 19:05:56 +0200836#endif /* x86_64 */
Christopher Fauletff813182017-11-22 15:00:13 +0100837
838 return cnt;
839}
840
Willy Tarreaud87a67f2019-03-05 12:04:55 +0100841/* Simple fls implementation. It returns the position of the highest bit set to
842 * one, starting at 1. It is illegal to call it with a==0 (undefined result).
843 */
844static inline unsigned int my_flsl(unsigned long a)
845{
846 unsigned long cnt;
847
848#if defined(__x86_64__)
849 __asm__("bsr %1,%0\n" : "=r" (cnt) : "rm" (a));
850 cnt++;
851#else
852
853 cnt = 1;
854#if LONG_MAX > 0x7FFFFFFFUL /* 64bits */
855 if (a & 0xFFFFFFFF00000000UL) {
856 a >>= 32;
857 cnt += 32;
858 }
859#endif
860 if (a & 0XFFFF0000U) {
861 a >>= 16;
862 cnt += 16;
863 }
864 if (a & 0XFF00) {
865 a >>= 8;
866 cnt += 8;
867 }
868 if (a & 0xf0) {
869 a >>= 4;
870 cnt += 4;
871 }
872 if (a & 0xc) {
873 a >>= 2;
874 cnt += 2;
875 }
876 if (a & 0x2) {
877 a >>= 1;
878 cnt += 1;
879 }
880#endif /* x86_64 */
881
882 return cnt;
883}
884
David Carliere6c39412015-07-02 07:00:17 +0000885/* Build a word with the <bits> lower bits set (reverse of my_popcountl) */
Willy Tarreaua9db57e2013-01-18 11:29:29 +0100886static inline unsigned long nbits(int bits)
887{
888 if (--bits < 0)
889 return 0;
890 else
891 return (2UL << bits) - 1;
892}
893
Willy Tarreau126d4062013-12-03 17:50:47 +0100894/*
895 * Parse binary string written in hexadecimal (source) and store the decoded
896 * result into binstr and set binstrlen to the lengh of binstr. Memory for
897 * binstr is allocated by the function. In case of error, returns 0 with an
898 * error message in err.
899 */
900int parse_binary(const char *source, char **binstr, int *binstrlen, char **err);
901
Willy Tarreau946ba592009-05-10 15:41:18 +0200902/* copies at most <n> characters from <src> and always terminates with '\0' */
903char *my_strndup(const char *src, int n);
904
Baptiste Assmannbb77c8e2013-10-06 23:24:13 +0200905/*
906 * search needle in haystack
907 * returns the pointer if found, returns NULL otherwise
908 */
909const void *my_memmem(const void *, size_t, const void *, size_t);
910
Willy Tarreau482b00d2009-10-04 22:48:42 +0200911/* This function returns the first unused key greater than or equal to <key> in
912 * ID tree <root>. Zero is returned if no place is found.
913 */
914unsigned int get_next_id(struct eb_root *root, unsigned int key);
915
Willy Tarreau9c1e15d2017-11-15 18:51:29 +0100916/* dump the full tree to <file> in DOT format for debugging purposes. Will
917 * optionally highlight node <subj> if found, depending on operation <op> :
918 * 0 : nothing
919 * >0 : insertion, node/leaf are surrounded in red
920 * <0 : removal, node/leaf are dashed with no background
921 * Will optionally add "desc" as a label on the graph if set and non-null.
922 */
923void eb32sc_to_file(FILE *file, struct eb_root *root, const struct eb32sc_node *subj,
924 int op, const char *desc);
Willy Tarreaued3cda02017-11-15 15:04:05 +0100925
Willy Tarreau348238b2010-01-18 15:05:57 +0100926/* This function compares a sample word possibly followed by blanks to another
927 * clean word. The compare is case-insensitive. 1 is returned if both are equal,
928 * otherwise zero. This intends to be used when checking HTTP headers for some
929 * values.
930 */
931int word_match(const char *sample, int slen, const char *word, int wlen);
932
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200933/* Convert a fixed-length string to an IP address. Returns 0 in case of error,
934 * or the number of chars read in case of success.
935 */
936int buf2ip(const char *buf, size_t len, struct in_addr *dst);
Thierry FOURNIERd559dd82013-11-22 16:16:59 +0100937int buf2ip6(const char *buf, size_t len, struct in6_addr *dst);
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200938
Willy Tarreauacf95772010-06-14 19:09:21 +0200939/* To be used to quote config arg positions. Returns the string at <ptr>
940 * surrounded by simple quotes if <ptr> is valid and non-empty, or "end of line"
941 * if ptr is NULL or empty. The string is locally allocated.
942 */
943const char *quote_arg(const char *ptr);
944
Willy Tarreau5b180202010-07-18 10:40:48 +0200945/* returns an operator among STD_OP_* for string <str> or < 0 if unknown */
946int get_std_op(const char *str);
947
Willy Tarreau4c14eaa2010-11-24 14:01:45 +0100948/* hash a 32-bit integer to another 32-bit integer */
949extern unsigned int full_hash(unsigned int a);
950static inline unsigned int __full_hash(unsigned int a)
951{
952 /* This function is one of Bob Jenkins' full avalanche hashing
953 * functions, which when provides quite a good distribution for little
954 * input variations. The result is quite suited to fit over a 32-bit
955 * space with enough variations so that a randomly picked number falls
956 * equally before any server position.
957 * Check http://burtleburtle.net/bob/hash/integer.html for more info.
958 */
959 a = (a+0x7ed55d16) + (a<<12);
960 a = (a^0xc761c23c) ^ (a>>19);
961 a = (a+0x165667b1) + (a<<5);
962 a = (a+0xd3a2646c) ^ (a<<9);
963 a = (a+0xfd7046c5) + (a<<3);
964 a = (a^0xb55a4f09) ^ (a>>16);
965
966 /* ensure values are better spread all around the tree by multiplying
967 * by a large prime close to 3/4 of the tree.
968 */
969 return a * 3221225473U;
970}
971
Willy Tarreauf3241112019-02-26 09:56:22 +0100972/* Return the bit position in mask <m> of the nth bit set of rank <r>, between
973 * 0 and LONGBITS-1 included, starting from the left. For example ranks 0,1,2,3
974 * for mask 0x55 will be 6, 4, 2 and 0 respectively. This algorithm is based on
975 * a popcount variant and is described here :
976 * https://graphics.stanford.edu/~seander/bithacks.html
977 */
978unsigned int mask_find_rank_bit(unsigned int r, unsigned long m);
979unsigned int mask_find_rank_bit_fast(unsigned int r, unsigned long m,
980 unsigned long a, unsigned long b,
981 unsigned long c, unsigned long d);
982void mask_prep_rank_map(unsigned long m,
983 unsigned long *a, unsigned long *b,
984 unsigned long *c, unsigned long *d);
985
Willy Tarreau422a0a52012-10-26 19:47:23 +0200986/* sets the address family to AF_UNSPEC so that is_addr() does not match */
987static inline void clear_addr(struct sockaddr_storage *addr)
988{
989 addr->ss_family = AF_UNSPEC;
990}
991
David du Colombier6f5ccb12011-03-10 22:26:24 +0100992/* returns non-zero if addr has a valid and non-null IPv4 or IPv6 address,
993 * otherwise zero.
994 */
Willy Tarreau18ca2d42014-05-09 22:40:55 +0200995static inline int is_inet_addr(const struct sockaddr_storage *addr)
David du Colombier6f5ccb12011-03-10 22:26:24 +0100996{
997 int i;
998
999 switch (addr->ss_family) {
1000 case AF_INET:
David du Colombier64e9c902011-03-22 11:39:41 +01001001 return *(int *)&((struct sockaddr_in *)addr)->sin_addr;
David du Colombier6f5ccb12011-03-10 22:26:24 +01001002 case AF_INET6:
1003 for (i = 0; i < sizeof(struct in6_addr) / sizeof(int); i++)
1004 if (((int *)&((struct sockaddr_in6 *)addr)->sin6_addr)[i] != 0)
1005 return ((int *)&((struct sockaddr_in6 *)addr)->sin6_addr)[i];
1006 }
1007 return 0;
1008}
1009
Willy Tarreau18ca2d42014-05-09 22:40:55 +02001010/* returns non-zero if addr has a valid and non-null IPv4 or IPv6 address,
1011 * or is a unix address, otherwise returns zero.
1012 */
1013static inline int is_addr(const struct sockaddr_storage *addr)
1014{
William Lallemand2fe7dd02018-09-11 16:51:29 +02001015 if (addr->ss_family == AF_UNIX || addr->ss_family == AF_CUST_SOCKPAIR)
Willy Tarreau18ca2d42014-05-09 22:40:55 +02001016 return 1;
1017 else
1018 return is_inet_addr(addr);
1019}
1020
David du Colombier11bcb6c2011-03-24 12:23:00 +01001021/* returns port in network byte order */
1022static inline int get_net_port(struct sockaddr_storage *addr)
1023{
1024 switch (addr->ss_family) {
1025 case AF_INET:
1026 return ((struct sockaddr_in *)addr)->sin_port;
1027 case AF_INET6:
1028 return ((struct sockaddr_in6 *)addr)->sin6_port;
1029 }
1030 return 0;
1031}
1032
1033/* returns port in host byte order */
1034static inline int get_host_port(struct sockaddr_storage *addr)
1035{
1036 switch (addr->ss_family) {
1037 case AF_INET:
1038 return ntohs(((struct sockaddr_in *)addr)->sin_port);
1039 case AF_INET6:
1040 return ntohs(((struct sockaddr_in6 *)addr)->sin6_port);
1041 }
1042 return 0;
1043}
1044
Willy Tarreau1b4b7ce2011-04-05 16:56:50 +02001045/* returns address len for <addr>'s family, 0 for unknown families */
1046static inline int get_addr_len(const struct sockaddr_storage *addr)
1047{
1048 switch (addr->ss_family) {
1049 case AF_INET:
1050 return sizeof(struct sockaddr_in);
1051 case AF_INET6:
1052 return sizeof(struct sockaddr_in6);
1053 case AF_UNIX:
1054 return sizeof(struct sockaddr_un);
1055 }
1056 return 0;
1057}
1058
David du Colombier11bcb6c2011-03-24 12:23:00 +01001059/* set port in host byte order */
1060static inline int set_net_port(struct sockaddr_storage *addr, int port)
1061{
1062 switch (addr->ss_family) {
1063 case AF_INET:
1064 ((struct sockaddr_in *)addr)->sin_port = port;
Willy Tarreau4c0fcc22018-09-20 10:48:35 +02001065 break;
David du Colombier11bcb6c2011-03-24 12:23:00 +01001066 case AF_INET6:
1067 ((struct sockaddr_in6 *)addr)->sin6_port = port;
Willy Tarreau4c0fcc22018-09-20 10:48:35 +02001068 break;
David du Colombier11bcb6c2011-03-24 12:23:00 +01001069 }
1070 return 0;
1071}
1072
1073/* set port in network byte order */
1074static inline int set_host_port(struct sockaddr_storage *addr, int port)
1075{
1076 switch (addr->ss_family) {
1077 case AF_INET:
1078 ((struct sockaddr_in *)addr)->sin_port = htons(port);
Willy Tarreau4c0fcc22018-09-20 10:48:35 +02001079 break;
David du Colombier11bcb6c2011-03-24 12:23:00 +01001080 case AF_INET6:
1081 ((struct sockaddr_in6 *)addr)->sin6_port = htons(port);
Willy Tarreau4c0fcc22018-09-20 10:48:35 +02001082 break;
David du Colombier11bcb6c2011-03-24 12:23:00 +01001083 }
1084 return 0;
1085}
1086
Thierry Fournier70473a52016-02-17 17:12:14 +01001087/* Convert mask from bit length form to in_addr form.
1088 * This function never fails.
1089 */
1090void len2mask4(int len, struct in_addr *addr);
1091
1092/* Convert mask from bit length form to in6_addr form.
1093 * This function never fails.
1094 */
1095void len2mask6(int len, struct in6_addr *addr);
1096
David du Colombier4f92d322011-03-24 11:09:31 +01001097/* Return true if IPv4 address is part of the network */
Willy Tarreaueec1d382016-07-13 11:59:39 +02001098extern int in_net_ipv4(const void *addr, const struct in_addr *mask, const struct in_addr *net);
David du Colombier4f92d322011-03-24 11:09:31 +01001099
1100/* Return true if IPv6 address is part of the network */
Willy Tarreaueec1d382016-07-13 11:59:39 +02001101extern int in_net_ipv6(const void *addr, const struct in6_addr *mask, const struct in6_addr *net);
David du Colombier4f92d322011-03-24 11:09:31 +01001102
Joseph Herlant32b83272018-11-15 11:58:28 -08001103/* Map IPv4 address on IPv6 address, as specified in RFC 3513. */
David du Colombier4f92d322011-03-24 11:09:31 +01001104extern void v4tov6(struct in6_addr *sin6_addr, struct in_addr *sin_addr);
1105
Joseph Herlant32b83272018-11-15 11:58:28 -08001106/* Map IPv6 address on IPv4 address, as specified in RFC 3513.
David du Colombier4f92d322011-03-24 11:09:31 +01001107 * Return true if conversion is possible and false otherwise.
1108 */
1109extern int v6tov4(struct in_addr *sin_addr, struct in6_addr *sin6_addr);
1110
Baptiste Assmann08b24cf2016-01-23 23:39:12 +01001111/* compare two struct sockaddr_storage and return:
1112 * 0 (true) if the addr is the same in both
1113 * 1 (false) if the addr is not the same in both
1114 */
1115int ipcmp(struct sockaddr_storage *ss1, struct sockaddr_storage *ss2);
1116
Baptiste Assmann08396c82016-01-31 00:27:17 +01001117/* copy ip from <source> into <dest>
1118 * the caller must clear <dest> before calling.
1119 * Returns a pointer to the destination
1120 */
1121struct sockaddr_storage *ipcpy(struct sockaddr_storage *source, struct sockaddr_storage *dest);
1122
William Lallemand421f5b52012-02-06 18:15:57 +01001123char *human_time(int t, short hz_div);
1124
1125extern const char *monthname[];
1126
1127/* date2str_log: write a date in the format :
1128 * sprintf(str, "%02d/%s/%04d:%02d:%02d:%02d.%03d",
1129 * tm.tm_mday, monthname[tm.tm_mon], tm.tm_year+1900,
1130 * tm.tm_hour, tm.tm_min, tm.tm_sec, (int)date.tv_usec/1000);
1131 *
1132 * without using sprintf. return a pointer to the last char written (\0) or
1133 * NULL if there isn't enough space.
1134 */
Willy Tarreauf16cb412018-09-04 19:08:48 +02001135char *date2str_log(char *dest, const struct tm *tm, const struct timeval *date, size_t size);
William Lallemand421f5b52012-02-06 18:15:57 +01001136
Benoit GARNIERb413c2a2016-03-27 11:08:03 +02001137/* Return the GMT offset for a specific local time.
Benoit GARNIERe2e5bde2016-03-27 03:04:16 +02001138 * Both t and tm must represent the same time.
Benoit GARNIERb413c2a2016-03-27 11:08:03 +02001139 * The string returned has the same format as returned by strftime(... "%z", tm).
1140 * Offsets are kept in an internal cache for better performances.
1141 */
Benoit GARNIERe2e5bde2016-03-27 03:04:16 +02001142const char *get_gmt_offset(time_t t, struct tm *tm);
Benoit GARNIERb413c2a2016-03-27 11:08:03 +02001143
William Lallemand421f5b52012-02-06 18:15:57 +01001144/* gmt2str_log: write a date in the format :
1145 * "%02d/%s/%04d:%02d:%02d:%02d +0000" without using snprintf
1146 * return a pointer to the last char written (\0) or
1147 * NULL if there isn't enough space.
1148 */
1149char *gmt2str_log(char *dst, struct tm *tm, size_t size);
1150
Yuxans Yao4e25b012012-10-19 10:36:09 +08001151/* localdate2str_log: write a date in the format :
1152 * "%02d/%s/%04d:%02d:%02d:%02d +0000(local timezone)" without using snprintf
Benoit GARNIERe2e5bde2016-03-27 03:04:16 +02001153 * Both t and tm must represent the same time.
Yuxans Yao4e25b012012-10-19 10:36:09 +08001154 * return a pointer to the last char written (\0) or
1155 * NULL if there isn't enough space.
1156 */
Benoit GARNIERe2e5bde2016-03-27 03:04:16 +02001157char *localdate2str_log(char *dst, time_t t, struct tm *tm, size_t size);
Yuxans Yao4e25b012012-10-19 10:36:09 +08001158
Thierry Fournier93127942016-01-20 18:49:45 +01001159/* These 3 functions parses date string and fills the
1160 * corresponding broken-down time in <tm>. In succes case,
1161 * it returns 1, otherwise, it returns 0.
1162 */
1163int parse_http_date(const char *date, int len, struct tm *tm);
1164int parse_imf_date(const char *date, int len, struct tm *tm);
1165int parse_rfc850_date(const char *date, int len, struct tm *tm);
1166int parse_asctime_date(const char *date, int len, struct tm *tm);
1167
Willy Tarreau9a7bea52012-04-27 11:16:50 +02001168/* Dynamically allocates a string of the proper length to hold the formatted
1169 * output. NULL is returned on error. The caller is responsible for freeing the
1170 * memory area using free(). The resulting string is returned in <out> if the
1171 * pointer is not NULL. A previous version of <out> might be used to build the
1172 * new string, and it will be freed before returning if it is not NULL, which
1173 * makes it possible to build complex strings from iterative calls without
1174 * having to care about freeing intermediate values, as in the example below :
1175 *
1176 * memprintf(&err, "invalid argument: '%s'", arg);
1177 * ...
1178 * memprintf(&err, "parser said : <%s>\n", *err);
1179 * ...
1180 * free(*err);
1181 *
1182 * This means that <err> must be initialized to NULL before first invocation.
1183 * The return value also holds the allocated string, which eases error checking
1184 * and immediate consumption. If the output pointer is not used, NULL must be
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001185 * passed instead and it will be ignored. The returned message will then also
1186 * be NULL so that the caller does not have to bother with freeing anything.
Willy Tarreau9a7bea52012-04-27 11:16:50 +02001187 *
1188 * It is also convenient to use it without any free except the last one :
1189 * err = NULL;
1190 * if (!fct1(err)) report(*err);
1191 * if (!fct2(err)) report(*err);
1192 * if (!fct3(err)) report(*err);
1193 * free(*err);
Christopher Faulet93a518f2017-10-24 11:25:33 +02001194 *
1195 * memprintf relies on memvprintf. This last version can be called from any
1196 * function with variadic arguments.
Willy Tarreau9a7bea52012-04-27 11:16:50 +02001197 */
Christopher Faulet93a518f2017-10-24 11:25:33 +02001198char *memvprintf(char **out, const char *format, va_list args)
1199 __attribute__ ((format(printf, 2, 0)));
1200
Willy Tarreau9a7bea52012-04-27 11:16:50 +02001201char *memprintf(char **out, const char *format, ...)
1202 __attribute__ ((format(printf, 2, 3)));
1203
Willy Tarreau21c705b2012-09-14 11:40:36 +02001204/* Used to add <level> spaces before each line of <out>, unless there is only one line.
1205 * The input argument is automatically freed and reassigned. The result will have to be
1206 * freed by the caller.
1207 * Example of use :
1208 * parse(cmd, &err); (callee: memprintf(&err, ...))
1209 * fprintf(stderr, "Parser said: %s\n", indent_error(&err));
1210 * free(err);
1211 */
1212char *indent_msg(char **out, int level);
Willy Tarreau3d2f16f2012-05-13 00:21:17 +02001213
Willy Tarreau9d22e562019-03-29 18:49:09 +01001214/* removes environment variable <name> from the environment as found in
1215 * environ. This is only provided as an alternative for systems without
1216 * unsetenv() (old Solaris and AIX versions). THIS IS NOT THREAD SAFE.
1217 * The principle is to scan environ for each occurence of variable name
1218 * <name> and to replace the matching pointers with the last pointer of
1219 * the array (since variables are not ordered).
1220 * It always returns 0 (success).
1221 */
1222int my_unsetenv(const char *name);
1223
Willy Tarreaudad36a32013-03-11 01:20:04 +01001224/* Convert occurrences of environment variables in the input string to their
1225 * corresponding value. A variable is identified as a series of alphanumeric
1226 * characters or underscores following a '$' sign. The <in> string must be
1227 * free()able. NULL returns NULL. The resulting string might be reallocated if
1228 * some expansion is made.
1229 */
1230char *env_expand(char *in);
1231
Willy Tarreau3d2f16f2012-05-13 00:21:17 +02001232/* debugging macro to emit messages using write() on fd #-1 so that strace sees
1233 * them.
1234 */
1235#define fddebug(msg...) do { char *_m = NULL; memprintf(&_m, ##msg); if (_m) write(-1, _m, strlen(_m)); free(_m); } while (0)
1236
Willy Tarreau0ebb5112016-12-05 00:10:57 +01001237/* displays a <len> long memory block at <buf>, assuming first byte of <buf>
Willy Tarreaued936c52017-04-27 18:03:20 +02001238 * has address <baseaddr>. String <pfx> may be placed as a prefix in front of
1239 * each line. It may be NULL if unused. The output is emitted to file <out>.
Willy Tarreau0ebb5112016-12-05 00:10:57 +01001240 */
Willy Tarreaued936c52017-04-27 18:03:20 +02001241void debug_hexdump(FILE *out, const char *pfx, const char *buf, unsigned int baseaddr, int len);
Willy Tarreau0ebb5112016-12-05 00:10:57 +01001242
Willy Tarreau12963822017-10-24 10:54:08 +02001243/* this is used to emit traces when building with TRACE=1 */
1244__attribute__((format(printf, 1, 2)))
1245void trace(char *fmt, ...);
1246
Willy Tarreau89efaed2013-12-13 15:14:55 +01001247/* used from everywhere just to drain results we don't want to read and which
1248 * recent versions of gcc increasingly and annoyingly complain about.
1249 */
1250extern int shut_your_big_mouth_gcc_int;
1251
1252/* used from everywhere just to drain results we don't want to read and which
1253 * recent versions of gcc increasingly and annoyingly complain about.
1254 */
1255static inline void shut_your_big_mouth_gcc(int r)
1256{
1257 shut_your_big_mouth_gcc_int = r;
1258}
1259
de Lafond Guillaume88c278f2013-04-15 19:27:10 +02001260/* same as strstr() but case-insensitive */
1261const char *strnistr(const char *str1, int len_str1, const char *str2, int len_str2);
1262
Willy Tarreauab813a42018-09-10 18:41:28 +02001263/* after increasing a pointer value, it can exceed the first buffer
1264 * size. This function transform the value of <ptr> according with
1265 * the expected position. <chunks> is an array of the one or two
Joseph Herlant32b83272018-11-15 11:58:28 -08001266 * available chunks. The first value is the start of the first chunk,
Willy Tarreauab813a42018-09-10 18:41:28 +02001267 * the second value if the end+1 of the first chunks. The third value
1268 * is NULL or the start of the second chunk and the fourth value is
1269 * the end+1 of the second chunk. The function returns 1 if does a
1270 * wrap, else returns 0.
1271 */
1272static inline int fix_pointer_if_wrap(const char **chunks, const char **ptr)
1273{
1274 if (*ptr < chunks[1])
1275 return 0;
1276 if (!chunks[2])
1277 return 0;
1278 *ptr = chunks[2] + ( *ptr - chunks[1] );
1279 return 1;
1280}
Willy Tarreaubb519c72014-01-28 23:04:39 +01001281
1282/************************* Composite address manipulation *********************
1283 * Composite addresses are simply unsigned long data in which the higher bits
1284 * represent a pointer, and the two lower bits are flags. There are several
1285 * places where we just want to associate one or two flags to a pointer (eg,
1286 * to type it), and these functions permit this. The pointer is necessarily a
1287 * 32-bit aligned pointer, as its two lower bits will be cleared and replaced
1288 * with the flags.
1289 *****************************************************************************/
1290
1291/* Masks the two lower bits of a composite address and converts it to a
1292 * pointer. This is used to mix some bits with some aligned pointers to
1293 * structs and to retrieve the original (32-bit aligned) pointer.
1294 */
1295static inline void *caddr_to_ptr(unsigned long caddr)
1296{
1297 return (void *)(caddr & ~3UL);
1298}
1299
1300/* Only retrieves the two lower bits of a composite address. This is used to mix
1301 * some bits with some aligned pointers to structs and to retrieve the original
1302 * data (2 bits).
1303 */
1304static inline unsigned int caddr_to_data(unsigned long caddr)
1305{
1306 return (caddr & 3UL);
1307}
1308
1309/* Combines the aligned pointer whose 2 lower bits will be masked with the bits
1310 * from <data> to form a composite address. This is used to mix some bits with
1311 * some aligned pointers to structs and to retrieve the original (32-bit aligned)
1312 * pointer.
1313 */
1314static inline unsigned long caddr_from_ptr(void *ptr, unsigned int data)
1315{
1316 return (((unsigned long)ptr) & ~3UL) + (data & 3);
1317}
1318
1319/* sets the 2 bits of <data> in the <caddr> composite address */
1320static inline unsigned long caddr_set_flags(unsigned long caddr, unsigned int data)
1321{
1322 return caddr | (data & 3);
1323}
1324
1325/* clears the 2 bits of <data> in the <caddr> composite address */
1326static inline unsigned long caddr_clr_flags(unsigned long caddr, unsigned int data)
1327{
1328 return caddr & ~(unsigned long)(data & 3);
1329}
1330
Thierry FOURNIER317e1c42014-08-12 10:20:47 +02001331/* UTF-8 decoder status */
1332#define UTF8_CODE_OK 0x00
1333#define UTF8_CODE_OVERLONG 0x10
1334#define UTF8_CODE_INVRANGE 0x20
1335#define UTF8_CODE_BADSEQ 0x40
1336
1337unsigned char utf8_next(const char *s, int len, unsigned int *c);
1338
1339static inline unsigned char utf8_return_code(unsigned int code)
1340{
1341 return code & 0xf0;
1342}
1343
1344static inline unsigned char utf8_return_length(unsigned char code)
1345{
1346 return code & 0x0f;
1347}
1348
Willy Tarreau5b4dd682015-07-21 23:47:18 +02001349/* Turns 64-bit value <a> from host byte order to network byte order.
1350 * The principle consists in letting the compiler detect we're playing
1351 * with a union and simplify most or all operations. The asm-optimized
1352 * htonl() version involving bswap (x86) / rev (arm) / other is a single
1353 * operation on little endian, or a NOP on big-endian. In both cases,
1354 * this lets the compiler "see" that we're rebuilding a 64-bit word from
1355 * two 32-bit quantities that fit into a 32-bit register. In big endian,
1356 * the whole code is optimized out. In little endian, with a decent compiler,
1357 * a few bswap and 2 shifts are left, which is the minimum acceptable.
1358 */
Willy Tarreau5f6e9052016-05-20 06:29:59 +02001359static inline unsigned long long my_htonll(unsigned long long a)
Willy Tarreau5b4dd682015-07-21 23:47:18 +02001360{
Willy Tarreau36eb3a32017-09-20 08:18:49 +02001361#if defined(__x86_64__)
Willy Tarreaudea7c5c2017-10-18 11:39:33 +02001362 __asm__ volatile("bswap %0" : "=r"(a) : "0"(a));
Willy Tarreau36eb3a32017-09-20 08:18:49 +02001363 return a;
1364#else
Willy Tarreau5b4dd682015-07-21 23:47:18 +02001365 union {
1366 struct {
1367 unsigned int w1;
1368 unsigned int w2;
1369 } by32;
1370 unsigned long long by64;
1371 } w = { .by64 = a };
1372 return ((unsigned long long)htonl(w.by32.w1) << 32) | htonl(w.by32.w2);
Willy Tarreau36eb3a32017-09-20 08:18:49 +02001373#endif
Willy Tarreau5b4dd682015-07-21 23:47:18 +02001374}
1375
1376/* Turns 64-bit value <a> from network byte order to host byte order. */
Willy Tarreau5f6e9052016-05-20 06:29:59 +02001377static inline unsigned long long my_ntohll(unsigned long long a)
Willy Tarreau5b4dd682015-07-21 23:47:18 +02001378{
Willy Tarreau5f6e9052016-05-20 06:29:59 +02001379 return my_htonll(a);
Willy Tarreau5b4dd682015-07-21 23:47:18 +02001380}
1381
Willy Tarreaue6e49cf2015-04-29 17:13:35 +02001382/* returns a 64-bit a timestamp with the finest resolution available. The
1383 * unit is intentionally not specified. It's mostly used to compare dates.
1384 */
1385#if defined(__i386__) || defined(__x86_64__)
1386static inline unsigned long long rdtsc()
1387{
1388 unsigned int a, d;
1389 asm volatile("rdtsc" : "=a" (a), "=d" (d));
1390 return a + ((unsigned long long)d << 32);
1391}
1392#else
1393static inline unsigned long long rdtsc()
1394{
1395 struct timeval tv;
1396 gettimeofday(&tv, NULL);
1397 return tv.tv_sec * 1000000 + tv.tv_usec;
1398}
1399#endif
1400
Maxime de Roucydc887852016-05-13 23:52:54 +02001401/* append a copy of string <str> (in a wordlist) at the end of the list <li>
1402 * On failure : return 0 and <err> filled with an error message.
1403 * The caller is responsible for freeing the <err> and <str> copy
1404 * memory area using free()
1405 */
1406struct list;
1407int list_append_word(struct list *li, const char *str, char **err);
1408
Willy Tarreau83061a82018-07-13 11:56:34 +02001409int dump_text(struct buffer *out, const char *buf, int bsize);
1410int dump_binary(struct buffer *out, const char *buf, int bsize);
1411int dump_text_line(struct buffer *out, const char *buf, int bsize, int len,
Willy Tarreau97c2ae12016-11-22 18:00:20 +01001412 int *line, int ptr);
Willy Tarreau37101052019-05-20 16:48:20 +02001413void dump_hex(struct buffer *out, const char *pfx, const void *buf, int len, int unsafe);
1414int may_access(const void *ptr);
Willy Tarreau97c2ae12016-11-22 18:00:20 +01001415
Hubert Verstraete2eae3a02016-06-28 22:41:00 +02001416/* same as realloc() except that ptr is also freed upon failure */
1417static inline void *my_realloc2(void *ptr, size_t size)
1418{
1419 void *ret;
1420
1421 ret = realloc(ptr, size);
1422 if (!ret && size)
1423 free(ptr);
1424 return ret;
1425}
1426
Frédéric Lécaille3b717162019-02-25 15:04:22 +01001427int parse_dotted_uints(const char *s, unsigned int **nums, size_t *sz);
1428
Lukas Tribusdcbc5c52016-09-12 21:42:07 +00001429/* HAP_STRING() makes a string from a literal while HAP_XSTRING() first
1430 * evaluates the argument and is suited to pass macros.
1431 *
1432 * They allow macros like PCRE_MAJOR to be defined without quotes, which
1433 * is convenient for applications that want to test its value.
1434 */
1435#define HAP_STRING(...) #__VA_ARGS__
1436#define HAP_XSTRING(...) HAP_STRING(__VA_ARGS__)
1437
Willy Tarreau2dd0d472006-06-29 17:53:05 +02001438#endif /* _COMMON_STANDARD_H */