blob: df2444d3350b413e6b5b5c34487f172da5788c63 [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 Tarreaufe944602007-10-25 10:34:16 +020027#include <time.h>
Willy Tarreaue6e49cf2015-04-29 17:13:35 +020028#include <sys/time.h>
Willy Tarreau938b3032007-05-10 06:39:03 +020029#include <sys/types.h>
Willy Tarreaud50265a2012-09-04 14:18:33 +020030#include <sys/socket.h>
Willy Tarreaudd2f85e2012-09-02 22:34:23 +020031#include <sys/un.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020032#include <netinet/in.h>
Thierry FOURNIERe059ec92014-03-17 12:01:13 +010033#include <common/chunk.h>
Willy Tarreaue3ba5f02006-06-29 18:54:54 +020034#include <common/config.h>
Willy Tarreau45cb4fb2009-10-26 21:10:04 +010035#include <eb32tree.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020036
William Lallemande7340ec2012-01-24 11:15:39 +010037#ifndef LLONG_MAX
38# define LLONG_MAX 9223372036854775807LL
39# define LLONG_MIN (-LLONG_MAX - 1LL)
40#endif
41
42#ifndef ULLONG_MAX
43# define ULLONG_MAX (LLONG_MAX * 2ULL + 1)
44#endif
45
Willy Tarreaua9db57e2013-01-18 11:29:29 +010046#ifndef LONGBITS
47#define LONGBITS ((unsigned int)sizeof(long) * 8)
48#endif
49
Thierry FOURNIER511e9472014-01-23 17:40:34 +010050/* size used for max length of decimal representation of long long int. */
51#define NB_LLMAX_STR (sizeof("-9223372036854775807")-1)
52
Willy Tarreau56adcf22012-12-23 18:00:29 +010053/* number of itoa_str entries */
54#define NB_ITOA_STR 10
William Lallemande7340ec2012-01-24 11:15:39 +010055
Willy Tarreau588297f2014-06-16 15:16:40 +020056/* maximum quoted string length (truncated above) */
57#define QSTR_SIZE 200
58#define NB_QSTR 10
59
Willy Tarreaubaaee002006-06-26 02:48:02 +020060/****** string-specific macros and functions ******/
61/* if a > max, then bound <a> to <max>. The macro returns the new <a> */
62#define UBOUND(a, max) ({ typeof(a) b = (max); if ((a) > b) (a) = b; (a); })
63
64/* if a < min, then bound <a> to <min>. The macro returns the new <a> */
65#define LBOUND(a, min) ({ typeof(a) b = (min); if ((a) < b) (a) = b; (a); })
66
67/* returns 1 only if only zero or one bit is set in X, which means that X is a
68 * power of 2, and 0 otherwise */
69#define POWEROF2(x) (((x) & ((x)-1)) == 0)
70
Willy Tarreau5b180202010-07-18 10:40:48 +020071/* operators to compare values. They're ordered that way so that the lowest bit
72 * serves as a negation for the test and contains all tests that are not equal.
73 */
74enum {
75 STD_OP_LE = 0, STD_OP_GT = 1,
76 STD_OP_EQ = 2, STD_OP_NE = 3,
77 STD_OP_GE = 4, STD_OP_LT = 5,
78};
79
Thierry FOURNIER9f95e402014-03-21 14:51:46 +010080enum http_scheme {
81 SCH_HTTP,
82 SCH_HTTPS,
83};
84
85struct split_url {
86 enum http_scheme scheme;
87 const char *host;
88 int host_len;
89};
90
Willy Tarreau56adcf22012-12-23 18:00:29 +010091extern int itoa_idx; /* index of next itoa_str to use */
92
Willy Tarreau7d58a632007-01-13 23:06:06 +010093/*
Willy Tarreaubaaee002006-06-26 02:48:02 +020094 * copies at most <size-1> chars from <src> to <dst>. Last char is always
95 * set to 0, unless <size> is 0. The number of chars copied is returned
96 * (excluding the terminating zero).
97 * This code has been optimized for size and speed : on x86, it's 45 bytes
98 * long, uses only registers, and consumes only 4 cycles per char.
99 */
100extern int strlcpy2(char *dst, const char *src, int size);
101
102/*
Willy Tarreau72d759c2007-10-25 12:14:10 +0200103 * This function simply returns a locally allocated string containing
Willy Tarreaubaaee002006-06-26 02:48:02 +0200104 * the ascii representation for number 'n' in decimal.
105 */
Willy Tarreaue7239b52009-03-29 13:41:58 +0200106extern char itoa_str[][171];
Emeric Brun3a7fce52010-01-04 14:54:38 +0100107extern char *ultoa_r(unsigned long n, char *buffer, int size);
Thierry FOURNIER1480bd82015-06-06 19:14:59 +0200108extern char *sltoa_r(long n, char *buffer, int size);
Willy Tarreaue7239b52009-03-29 13:41:58 +0200109extern const char *ulltoh_r(unsigned long long n, char *buffer, int size);
Willy Tarreau72d759c2007-10-25 12:14:10 +0200110static inline const char *ultoa(unsigned long n)
111{
112 return ultoa_r(n, itoa_str[0], sizeof(itoa_str[0]));
113}
114
William Lallemande7340ec2012-01-24 11:15:39 +0100115/*
116 * unsigned long long ASCII representation
117 *
118 * return the last char '\0' or NULL if no enough
119 * space in dst
120 */
121char *ulltoa(unsigned long long n, char *dst, size_t size);
122
123
124/*
125 * unsigned long ASCII representation
126 *
127 * return the last char '\0' or NULL if no enough
128 * space in dst
129 */
130char *ultoa_o(unsigned long n, char *dst, size_t size);
131
132/*
133 * signed long ASCII representation
134 *
135 * return the last char '\0' or NULL if no enough
136 * space in dst
137 */
138char *ltoa_o(long int n, char *dst, size_t size);
139
140/*
141 * signed long long ASCII representation
142 *
143 * return the last char '\0' or NULL if no enough
144 * space in dst
145 */
146char *lltoa(long long n, char *dst, size_t size);
147
148/*
149 * write a ascii representation of a unsigned into dst,
150 * return a pointer to the last character
151 * Pad the ascii representation with '0', using size.
152 */
153char *utoa_pad(unsigned int n, char *dst, size_t size);
154
Willy Tarreaubaaee002006-06-26 02:48:02 +0200155/*
Willy Tarreau91092e52007-10-25 16:58:42 +0200156 * This function simply returns a locally allocated string containing the ascii
157 * representation for number 'n' in decimal, unless n is 0 in which case it
158 * returns the alternate string (or an empty string if the alternate string is
159 * NULL). It use is intended for limits reported in reports, where it's
160 * desirable not to display anything if there is no limit. Warning! it shares
161 * the same vector as ultoa_r().
162 */
163extern const char *limit_r(unsigned long n, char *buffer, int size, const char *alt);
164
Willy Tarreau56adcf22012-12-23 18:00:29 +0100165/* returns a locally allocated string containing the ASCII representation of
166 * the number 'n' in decimal. Up to NB_ITOA_STR calls may be used in the same
167 * function call (eg: printf), shared with the other similar functions making
168 * use of itoa_str[].
169 */
170static inline const char *U2A(unsigned long n)
171{
172 const char *ret = ultoa_r(n, itoa_str[itoa_idx], sizeof(itoa_str[0]));
173 if (++itoa_idx >= NB_ITOA_STR)
174 itoa_idx = 0;
175 return ret;
176}
177
178/* returns a locally allocated string containing the HTML representation of
179 * the number 'n' in decimal. Up to NB_ITOA_STR calls may be used in the same
180 * function call (eg: printf), shared with the other similar functions making
181 * use of itoa_str[].
Willy Tarreau91092e52007-10-25 16:58:42 +0200182 */
Willy Tarreau56adcf22012-12-23 18:00:29 +0100183static inline const char *U2H(unsigned long long n)
184{
185 const char *ret = ulltoh_r(n, itoa_str[itoa_idx], sizeof(itoa_str[0]));
186 if (++itoa_idx >= NB_ITOA_STR)
187 itoa_idx = 0;
188 return ret;
189}
190
191/* returns a locally allocated string containing the HTML representation of
192 * the number 'n' in decimal. Up to NB_ITOA_STR calls may be used in the same
193 * function call (eg: printf), shared with the other similar functions making
194 * use of itoa_str[].
195 */
196static inline const char *LIM2A(unsigned long n, const char *alt)
197{
198 const char *ret = limit_r(n, itoa_str[itoa_idx], sizeof(itoa_str[0]), alt);
199 if (++itoa_idx >= NB_ITOA_STR)
200 itoa_idx = 0;
201 return ret;
202}
Willy Tarreau91092e52007-10-25 16:58:42 +0200203
Willy Tarreau588297f2014-06-16 15:16:40 +0200204/* returns a locally allocated string containing the quoted encoding of the
205 * input string. The output may be truncated to QSTR_SIZE chars, but it is
206 * guaranteed that the string will always be properly terminated. Quotes are
207 * encoded by doubling them as is commonly done in CSV files. QSTR_SIZE must
208 * always be at least 4 chars.
209 */
210const char *qstr(const char *str);
211
212/* returns <str> or its quote-encoded equivalent if it contains at least one
213 * quote or a comma. This is aimed at build CSV-compatible strings.
214 */
215static inline const char *cstr(const char *str)
216{
217 const char *p = str;
218
219 while (*p) {
220 if (*p == ',' || *p == '"')
221 return qstr(str);
222 p++;
223 }
224 return str;
225}
226
Willy Tarreau91092e52007-10-25 16:58:42 +0200227/*
Willy Tarreaubaaee002006-06-26 02:48:02 +0200228 * Returns non-zero if character <s> is a hex digit (0-9, a-f, A-F), else zero.
229 */
230extern int ishex(char s);
231
232/*
Willy Tarreauda3b7c32009-11-02 20:12:52 +0100233 * Return integer equivalent of character <c> for a hex digit (0-9, a-f, A-F),
Willy Tarreau3dd0c4e2012-10-26 00:58:22 +0200234 * otherwise -1. This compact form helps gcc produce efficient code.
Willy Tarreauda3b7c32009-11-02 20:12:52 +0100235 */
Willy Tarreau3dd0c4e2012-10-26 00:58:22 +0200236static inline int hex2i(int c)
237{
Willy Tarreau0161d622013-04-02 01:26:55 +0200238 if (unlikely((unsigned char)(c -= '0') > 9)) {
239 if (likely((unsigned char)(c -= 'A' - '0') > 5 &&
240 (unsigned char)(c -= 'a' - 'A') > 5))
Willy Tarreau3dd0c4e2012-10-26 00:58:22 +0200241 c = -11;
242 c += 10;
243 }
244 return c;
245}
246
Willy Tarreau3ca1a882015-01-15 18:43:49 +0100247/* rounds <i> down to the closest value having max 2 digits */
248unsigned int round_2dig(unsigned int i);
Willy Tarreauda3b7c32009-11-02 20:12:52 +0100249
250/*
Willy Tarreau2e74c3f2007-12-02 18:45:09 +0100251 * Checks <name> for invalid characters. Valid chars are [A-Za-z0-9_:.-]. If an
252 * invalid character is found, a pointer to it is returned. If everything is
253 * fine, NULL is returned.
254 */
255extern const char *invalid_char(const char *name);
256
257/*
Krzysztof Piotr Oledzkiefe3b6f2008-05-23 23:49:32 +0200258 * Checks <domainname> for invalid characters. Valid chars are [A-Za-z0-9_.-].
259 * If an invalid character is found, a pointer to it is returned.
260 * If everything is fine, NULL is returned.
261 */
262extern const char *invalid_domainchar(const char *name);
263
264/*
Willy Tarreaufab5a432011-03-04 15:31:53 +0100265 * converts <str> to a locally allocated struct sockaddr_storage *, and a
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200266 * port range consisting in two integers. The low and high end are always set
267 * even if the port is unspecified, in which case (0,0) is returned. The low
Willy Tarreaufab5a432011-03-04 15:31:53 +0100268 * port is set in the sockaddr. Thus, it is enough to check the size of the
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200269 * returned range to know if an array must be allocated or not. The format is
Willy Tarreaufab5a432011-03-04 15:31:53 +0100270 * "addr[:[port[-port]]]", where "addr" can be a dotted IPv4 address, an IPv6
271 * address, a host name, or empty or "*" to indicate INADDR_ANY. If an IPv6
272 * address wants to ignore port, it must be terminated by a trailing colon (':').
273 * The IPv6 '::' address is IN6ADDR_ANY, so in order to bind to a given port on
274 * IPv6, use ":::port". NULL is returned if the host part cannot be resolved.
Willy Tarreaud393a622013-03-04 18:22:00 +0100275 * If <pfx> is non-null, it is used as a string prefix before any path-based
276 * address (typically the path to a unix socket).
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200277 */
Willy Tarreaud393a622013-03-04 18:22:00 +0100278struct sockaddr_storage *str2sa_range(const char *str, int *low, int *high, char **err, const char *pfx);
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200279
Willy Tarreau2937c0d2010-01-26 17:36:17 +0100280/* converts <str> to a struct in_addr containing a network mask. It can be
281 * passed in dotted form (255.255.255.0) or in CIDR form (24). It returns 1
282 * if the conversion succeeds otherwise non-zero.
283 */
284int str2mask(const char *str, struct in_addr *mask);
285
Thierry FOURNIERb0504632013-12-14 15:39:02 +0100286/* convert <cidr> to struct in_addr <mask>. It returns 1 if the conversion
287 * succeeds otherwise non-zero.
288 */
289int cidr2dotted(int cidr, struct in_addr *mask);
290
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200291/*
Willy Tarreaud077a8e2007-05-08 18:28:09 +0200292 * converts <str> to two struct in_addr* which must be pre-allocated.
Willy Tarreaubaaee002006-06-26 02:48:02 +0200293 * The format is "addr[/mask]", where "addr" cannot be empty, and mask
294 * is optionnal and either in the dotted or CIDR notation.
295 * Note: "addr" can also be a hostname. Returns 1 if OK, 0 if error.
296 */
Thierry FOURNIERfc7ac7b2014-02-11 15:23:04 +0100297int str2net(const char *str, int resolve, struct in_addr *addr, struct in_addr *mask);
Willy Tarreaubaaee002006-06-26 02:48:02 +0200298
Thierry FOURNIER58639a02014-11-25 12:02:25 +0100299/* str2ip and str2ip2:
300 *
301 * converts <str> to a struct sockaddr_storage* provided by the caller. The
302 * caller must have zeroed <sa> first, and may have set sa->ss_family to force
303 * parse a specific address format. If the ss_family is 0 or AF_UNSPEC, then
304 * the function tries to guess the address family from the syntax. If the
305 * family is forced and the format doesn't match, an error is returned. The
306 * string is assumed to contain only an address, no port. The address can be a
307 * dotted IPv4 address, an IPv6 address, a host name, or empty or "*" to
308 * indicate INADDR_ANY. NULL is returned if the host part cannot be resolved.
309 * The return address will only have the address family and the address set,
310 * all other fields remain zero. The string is not supposed to be modified.
311 * The IPv6 '::' address is IN6ADDR_ANY.
312 *
313 * str2ip2:
314 *
315 * If <resolve> is set, this function try to resolve DNS, otherwise, it returns
316 * NULL result.
317 */
318struct sockaddr_storage *str2ip2(const char *str, struct sockaddr_storage *sa, int resolve);
319static inline struct sockaddr_storage *str2ip(const char *str, struct sockaddr_storage *sa)
320{
321 return str2ip2(str, sa, 1);
322}
323
Alexandre Cassen5eb1a902007-11-29 15:43:32 +0100324/*
Willy Tarreau6d20e282012-04-27 22:49:47 +0200325 * converts <str> to two struct in6_addr* which must be pre-allocated.
326 * The format is "addr[/mask]", where "addr" cannot be empty, and mask
327 * is an optionnal number of bits (128 being the default).
328 * Returns 1 if OK, 0 if error.
329 */
330int str62net(const char *str, struct in6_addr *addr, unsigned char *mask);
331
332/*
Willy Tarreau106f9792009-09-19 07:54:16 +0200333 * Parse IP address found in url.
334 */
David du Colombier6f5ccb12011-03-10 22:26:24 +0100335int url2ipv4(const char *addr, struct in_addr *dst);
Willy Tarreau106f9792009-09-19 07:54:16 +0200336
337/*
David du Colombier6f5ccb12011-03-10 22:26:24 +0100338 * Resolve destination server from URL. Convert <str> to a sockaddr_storage*.
Alexandre Cassen5eb1a902007-11-29 15:43:32 +0100339 */
Thierry FOURNIER9f95e402014-03-21 14:51:46 +0100340int url2sa(const char *url, int ulen, struct sockaddr_storage *addr, struct split_url *out);
Alexandre Cassen5eb1a902007-11-29 15:43:32 +0100341
Willy Tarreau631f01c2011-09-05 00:36:48 +0200342/* Tries to convert a sockaddr_storage address to text form. Upon success, the
343 * address family is returned so that it's easy for the caller to adapt to the
344 * output format. Zero is returned if the address family is not supported. -1
345 * is returned upon error, with errno set. AF_INET, AF_INET6 and AF_UNIX are
346 * supported.
347 */
348int addr_to_str(struct sockaddr_storage *addr, char *str, int size);
349
Simon Horman75ab8bd2014-06-16 09:39:41 +0900350/* Tries to convert a sockaddr_storage port to text form. Upon success, the
351 * address family is returned so that it's easy for the caller to adapt to the
352 * output format. Zero is returned if the address family is not supported. -1
353 * is returned upon error, with errno set. AF_INET, AF_INET6 and AF_UNIX are
354 * supported.
355 */
356int port_to_str(struct sockaddr_storage *addr, char *str, int size);
357
Willy Tarreaubaaee002006-06-26 02:48:02 +0200358/* will try to encode the string <string> replacing all characters tagged in
359 * <map> with the hexadecimal representation of their ASCII-code (2 digits)
360 * prefixed by <escape>, and will store the result between <start> (included)
361 * and <stop> (excluded), and will always terminate the string with a '\0'
362 * before <stop>. The position of the '\0' is returned if the conversion
363 * completes. If bytes are missing between <start> and <stop>, then the
364 * conversion will be incomplete and truncated. If <stop> <= <start>, the '\0'
365 * cannot even be stored so we return <start> without writing the 0.
366 * The input string must also be zero-terminated.
367 */
368extern const char hextab[];
369char *encode_string(char *start, char *stop,
370 const char escape, const fd_set *map,
371 const char *string);
372
Thierry FOURNIERe059ec92014-03-17 12:01:13 +0100373/*
374 * Same behavior, except that it encodes chunk <chunk> instead of a string.
375 */
376char *encode_chunk(char *start, char *stop,
377 const char escape, const fd_set *map,
378 const struct chunk *chunk);
379
380
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200381/* Check a string for using it in a CSV output format. If the string contains
382 * one of the following four char <">, <,>, CR or LF, the string is
383 * encapsulated between <"> and the <"> are escaped by a <""> sequence.
384 * <str> is the input string to be escaped. The function assumes that
385 * the input string is null-terminated.
386 *
387 * If <quote> is 0, the result is returned escaped but without double quote.
388 * Is it useful if the escaped string is used between double quotes in the
389 * format.
390 *
391 * printf("..., \"%s\", ...\r\n", csv_enc(str, 0));
392 *
393 * If the <quote> is 1, the converter put the quotes only if any character is
394 * escaped. If the <quote> is 2, the converter put always the quotes.
395 *
396 * <output> is a struct chunk used for storing the output string if any
397 * change will be done.
398 *
399 * The function returns the converted string on this output. If an error
400 * occurs, the function return an empty string. This type of output is useful
401 * for using the function directly as printf() argument.
402 *
403 * If the output buffer is too short to conatin the input string, the result
404 * is truncated.
405 */
406const char *csv_enc(const char *str, int quote, struct chunk *output);
407
Willy Tarreaubf9c2fc2011-05-31 18:06:18 +0200408/* Decode an URL-encoded string in-place. The resulting string might
409 * be shorter. If some forbidden characters are found, the conversion is
410 * aborted, the string is truncated before the issue and non-zero is returned,
411 * otherwise the operation returns non-zero indicating success.
412 */
413int url_decode(char *string);
414
Willy Tarreau6911fa42007-03-04 18:06:08 +0100415/* This one is 6 times faster than strtoul() on athlon, but does
416 * no check at all.
417 */
418static inline unsigned int __str2ui(const char *s)
419{
420 unsigned int i = 0;
421 while (*s) {
422 i = i * 10 - '0';
423 i += (unsigned char)*s++;
424 }
425 return i;
426}
427
428/* This one is 5 times faster than strtoul() on athlon with checks.
429 * It returns the value of the number composed of all valid digits read.
430 */
431static inline unsigned int __str2uic(const char *s)
432{
433 unsigned int i = 0;
434 unsigned int j;
435 while (1) {
436 j = (*s++) - '0';
437 if (j > 9)
438 break;
439 i *= 10;
440 i += j;
441 }
442 return i;
443}
444
445/* This one is 28 times faster than strtoul() on athlon, but does
446 * no check at all!
447 */
448static inline unsigned int __strl2ui(const char *s, int len)
449{
450 unsigned int i = 0;
451 while (len-- > 0) {
452 i = i * 10 - '0';
453 i += (unsigned char)*s++;
454 }
455 return i;
456}
457
458/* This one is 7 times faster than strtoul() on athlon with checks.
459 * It returns the value of the number composed of all valid digits read.
460 */
461static inline unsigned int __strl2uic(const char *s, int len)
462{
463 unsigned int i = 0;
Willy Tarreau3f0c9762007-10-25 09:42:24 +0200464 unsigned int j, k;
Willy Tarreau6911fa42007-03-04 18:06:08 +0100465
466 while (len-- > 0) {
467 j = (*s++) - '0';
Willy Tarreau3f0c9762007-10-25 09:42:24 +0200468 k = i * 10;
Willy Tarreau6911fa42007-03-04 18:06:08 +0100469 if (j > 9)
470 break;
Willy Tarreau3f0c9762007-10-25 09:42:24 +0200471 i = k + j;
Willy Tarreau6911fa42007-03-04 18:06:08 +0100472 }
473 return i;
474}
475
Willy Tarreau4ec83cd2010-10-15 23:19:55 +0200476/* This function reads an unsigned integer from the string pointed to by <s>
477 * and returns it. The <s> pointer is adjusted to point to the first unread
478 * char. The function automatically stops at <end>.
479 */
480static inline unsigned int __read_uint(const char **s, const char *end)
481{
482 const char *ptr = *s;
483 unsigned int i = 0;
484 unsigned int j, k;
485
486 while (ptr < end) {
487 j = *ptr - '0';
488 k = i * 10;
489 if (j > 9)
490 break;
491 i = k + j;
492 ptr++;
493 }
494 *s = ptr;
495 return i;
496}
497
Willy Tarreau6911fa42007-03-04 18:06:08 +0100498extern unsigned int str2ui(const char *s);
499extern unsigned int str2uic(const char *s);
500extern unsigned int strl2ui(const char *s, int len);
501extern unsigned int strl2uic(const char *s, int len);
502extern int strl2ic(const char *s, int len);
503extern int strl2irc(const char *s, int len, int *ret);
504extern int strl2llrc(const char *s, int len, long long *ret);
Thierry FOURNIER511e9472014-01-23 17:40:34 +0100505extern int strl2llrc_dotted(const char *text, int len, long long *ret);
Willy Tarreau4ec83cd2010-10-15 23:19:55 +0200506extern unsigned int read_uint(const char **s, const char *end);
Willy Tarreaud54bbdc2009-09-07 11:00:31 +0200507unsigned int inetaddr_host(const char *text);
508unsigned int inetaddr_host_lim(const char *text, const char *stop);
Willy Tarreau74172752010-10-15 23:21:42 +0200509unsigned int inetaddr_host_lim_ret(char *text, char *stop, char **ret);
Willy Tarreau6911fa42007-03-04 18:06:08 +0100510
Krzysztof Piotr Oledzki3d5562b2009-10-10 20:11:17 +0200511static inline char *cut_crlf(char *s) {
512
Simon Horman5269cfb2013-02-13 17:48:00 +0900513 while (*s != '\r' && *s != '\n') {
Krzysztof Piotr Oledzki3d5562b2009-10-10 20:11:17 +0200514 char *p = s++;
515
516 if (!*p)
517 return p;
518 }
519
Simon Horman5269cfb2013-02-13 17:48:00 +0900520 *s++ = '\0';
Krzysztof Piotr Oledzki3d5562b2009-10-10 20:11:17 +0200521
522 return s;
523}
524
525static inline char *ltrim(char *s, char c) {
526
527 if (c)
528 while (*s == c)
529 s++;
530
531 return s;
532}
533
534static inline char *rtrim(char *s, char c) {
535
536 char *p = s + strlen(s);
537
538 while (p-- > s)
539 if (*p == c)
540 *p = '\0';
541 else
542 break;
543
544 return s;
545}
546
547static inline char *alltrim(char *s, char c) {
548
549 rtrim(s, c);
550
551 return ltrim(s, c);
552}
553
Willy Tarreaufe944602007-10-25 10:34:16 +0200554/* This function converts the time_t value <now> into a broken out struct tm
555 * which must be allocated by the caller. It is highly recommended to use this
556 * function intead of localtime() because that one requires a time_t* which
557 * is not always compatible with tv_sec depending on OS/hardware combinations.
558 */
559static inline void get_localtime(const time_t now, struct tm *tm)
560{
561 localtime_r(&now, tm);
562}
563
Emeric Brun3a058f32009-06-30 18:26:00 +0200564/* This function converts the time_t value <now> into a broken out struct tm
565 * which must be allocated by the caller. It is highly recommended to use this
566 * function intead of gmtime() because that one requires a time_t* which
567 * is not always compatible with tv_sec depending on OS/hardware combinations.
568 */
569static inline void get_gmtime(const time_t now, struct tm *tm)
570{
571 gmtime_r(&now, tm);
572}
573
Willy Tarreaua0d37b62007-12-02 22:00:35 +0100574/* This function parses a time value optionally followed by a unit suffix among
575 * "d", "h", "m", "s", "ms" or "us". It converts the value into the unit
576 * expected by the caller. The computation does its best to avoid overflows.
577 * The value is returned in <ret> if everything is fine, and a NULL is returned
578 * by the function. In case of error, a pointer to the error is returned and
579 * <ret> is left untouched.
580 */
581extern const char *parse_time_err(const char *text, unsigned *ret, unsigned unit_flags);
Emeric Brun39132b22010-01-04 14:57:24 +0100582extern const char *parse_size_err(const char *text, unsigned *ret);
Willy Tarreaua0d37b62007-12-02 22:00:35 +0100583
584/* unit flags to pass to parse_time_err */
585#define TIME_UNIT_US 0x0000
586#define TIME_UNIT_MS 0x0001
587#define TIME_UNIT_S 0x0002
588#define TIME_UNIT_MIN 0x0003
589#define TIME_UNIT_HOUR 0x0004
590#define TIME_UNIT_DAY 0x0005
591#define TIME_UNIT_MASK 0x0007
592
William Lallemand421f5b52012-02-06 18:15:57 +0100593#define SEC 1
594#define MINUTE (60 * SEC)
595#define HOUR (60 * MINUTE)
596#define DAY (24 * HOUR)
597
Willy Tarreau7f062c42009-03-05 18:43:00 +0100598/* Multiply the two 32-bit operands and shift the 64-bit result right 32 bits.
599 * This is used to compute fixed ratios by setting one of the operands to
600 * (2^32*ratio).
601 */
602static inline unsigned int mul32hi(unsigned int a, unsigned int b)
603{
604 return ((unsigned long long)a * b) >> 32;
605}
606
Willy Tarreauf0d9eec2010-06-20 07:12:37 +0200607/* gcc does not know when it can safely divide 64 bits by 32 bits. Use this
608 * function when you know for sure that the result fits in 32 bits, because
609 * it is optimal on x86 and on 64bit processors.
610 */
611static inline unsigned int div64_32(unsigned long long o1, unsigned int o2)
612{
613 unsigned int result;
614#ifdef __i386__
615 asm("divl %2"
616 : "=a" (result)
617 : "A"(o1), "rm"(o2));
618#else
619 result = o1 / o2;
620#endif
621 return result;
622}
623
Willy Tarreau37994f02012-11-19 12:11:07 +0100624/* Simple popcount implementation. It returns the number of ones in a word */
Willy Tarreaua9db57e2013-01-18 11:29:29 +0100625static inline unsigned int popcount(unsigned long a)
Willy Tarreau37994f02012-11-19 12:11:07 +0100626{
627 unsigned int cnt;
628 for (cnt = 0; a; a >>= 1) {
629 if (a & 1)
630 cnt++;
631 }
632 return cnt;
633}
634
Willy Tarreaua9db57e2013-01-18 11:29:29 +0100635/* Build a word with the <bits> lower bits set (reverse of popcount) */
636static inline unsigned long nbits(int bits)
637{
638 if (--bits < 0)
639 return 0;
640 else
641 return (2UL << bits) - 1;
642}
643
Willy Tarreau126d4062013-12-03 17:50:47 +0100644/*
645 * Parse binary string written in hexadecimal (source) and store the decoded
646 * result into binstr and set binstrlen to the lengh of binstr. Memory for
647 * binstr is allocated by the function. In case of error, returns 0 with an
648 * error message in err.
649 */
650int parse_binary(const char *source, char **binstr, int *binstrlen, char **err);
651
Willy Tarreau946ba592009-05-10 15:41:18 +0200652/* copies at most <n> characters from <src> and always terminates with '\0' */
653char *my_strndup(const char *src, int n);
654
Baptiste Assmannbb77c8e2013-10-06 23:24:13 +0200655/*
656 * search needle in haystack
657 * returns the pointer if found, returns NULL otherwise
658 */
659const void *my_memmem(const void *, size_t, const void *, size_t);
660
Willy Tarreau482b00d2009-10-04 22:48:42 +0200661/* This function returns the first unused key greater than or equal to <key> in
662 * ID tree <root>. Zero is returned if no place is found.
663 */
664unsigned int get_next_id(struct eb_root *root, unsigned int key);
665
Willy Tarreau348238b2010-01-18 15:05:57 +0100666/* This function compares a sample word possibly followed by blanks to another
667 * clean word. The compare is case-insensitive. 1 is returned if both are equal,
668 * otherwise zero. This intends to be used when checking HTTP headers for some
669 * values.
670 */
671int word_match(const char *sample, int slen, const char *word, int wlen);
672
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200673/* Convert a fixed-length string to an IP address. Returns 0 in case of error,
674 * or the number of chars read in case of success.
675 */
676int buf2ip(const char *buf, size_t len, struct in_addr *dst);
Thierry FOURNIERd559dd82013-11-22 16:16:59 +0100677int buf2ip6(const char *buf, size_t len, struct in6_addr *dst);
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200678
Willy Tarreauacf95772010-06-14 19:09:21 +0200679/* To be used to quote config arg positions. Returns the string at <ptr>
680 * surrounded by simple quotes if <ptr> is valid and non-empty, or "end of line"
681 * if ptr is NULL or empty. The string is locally allocated.
682 */
683const char *quote_arg(const char *ptr);
684
Willy Tarreau5b180202010-07-18 10:40:48 +0200685/* returns an operator among STD_OP_* for string <str> or < 0 if unknown */
686int get_std_op(const char *str);
687
Willy Tarreau4c14eaa2010-11-24 14:01:45 +0100688/* hash a 32-bit integer to another 32-bit integer */
689extern unsigned int full_hash(unsigned int a);
690static inline unsigned int __full_hash(unsigned int a)
691{
692 /* This function is one of Bob Jenkins' full avalanche hashing
693 * functions, which when provides quite a good distribution for little
694 * input variations. The result is quite suited to fit over a 32-bit
695 * space with enough variations so that a randomly picked number falls
696 * equally before any server position.
697 * Check http://burtleburtle.net/bob/hash/integer.html for more info.
698 */
699 a = (a+0x7ed55d16) + (a<<12);
700 a = (a^0xc761c23c) ^ (a>>19);
701 a = (a+0x165667b1) + (a<<5);
702 a = (a+0xd3a2646c) ^ (a<<9);
703 a = (a+0xfd7046c5) + (a<<3);
704 a = (a^0xb55a4f09) ^ (a>>16);
705
706 /* ensure values are better spread all around the tree by multiplying
707 * by a large prime close to 3/4 of the tree.
708 */
709 return a * 3221225473U;
710}
711
Willy Tarreau422a0a52012-10-26 19:47:23 +0200712/* sets the address family to AF_UNSPEC so that is_addr() does not match */
713static inline void clear_addr(struct sockaddr_storage *addr)
714{
715 addr->ss_family = AF_UNSPEC;
716}
717
David du Colombier6f5ccb12011-03-10 22:26:24 +0100718/* returns non-zero if addr has a valid and non-null IPv4 or IPv6 address,
719 * otherwise zero.
720 */
Willy Tarreau18ca2d42014-05-09 22:40:55 +0200721static inline int is_inet_addr(const struct sockaddr_storage *addr)
David du Colombier6f5ccb12011-03-10 22:26:24 +0100722{
723 int i;
724
725 switch (addr->ss_family) {
726 case AF_INET:
David du Colombier64e9c902011-03-22 11:39:41 +0100727 return *(int *)&((struct sockaddr_in *)addr)->sin_addr;
David du Colombier6f5ccb12011-03-10 22:26:24 +0100728 case AF_INET6:
729 for (i = 0; i < sizeof(struct in6_addr) / sizeof(int); i++)
730 if (((int *)&((struct sockaddr_in6 *)addr)->sin6_addr)[i] != 0)
731 return ((int *)&((struct sockaddr_in6 *)addr)->sin6_addr)[i];
732 }
733 return 0;
734}
735
Willy Tarreau18ca2d42014-05-09 22:40:55 +0200736/* returns non-zero if addr has a valid and non-null IPv4 or IPv6 address,
737 * or is a unix address, otherwise returns zero.
738 */
739static inline int is_addr(const struct sockaddr_storage *addr)
740{
741 if (addr->ss_family == AF_UNIX)
742 return 1;
743 else
744 return is_inet_addr(addr);
745}
746
David du Colombier11bcb6c2011-03-24 12:23:00 +0100747/* returns port in network byte order */
748static inline int get_net_port(struct sockaddr_storage *addr)
749{
750 switch (addr->ss_family) {
751 case AF_INET:
752 return ((struct sockaddr_in *)addr)->sin_port;
753 case AF_INET6:
754 return ((struct sockaddr_in6 *)addr)->sin6_port;
755 }
756 return 0;
757}
758
759/* returns port in host byte order */
760static inline int get_host_port(struct sockaddr_storage *addr)
761{
762 switch (addr->ss_family) {
763 case AF_INET:
764 return ntohs(((struct sockaddr_in *)addr)->sin_port);
765 case AF_INET6:
766 return ntohs(((struct sockaddr_in6 *)addr)->sin6_port);
767 }
768 return 0;
769}
770
Willy Tarreau1b4b7ce2011-04-05 16:56:50 +0200771/* returns address len for <addr>'s family, 0 for unknown families */
772static inline int get_addr_len(const struct sockaddr_storage *addr)
773{
774 switch (addr->ss_family) {
775 case AF_INET:
776 return sizeof(struct sockaddr_in);
777 case AF_INET6:
778 return sizeof(struct sockaddr_in6);
779 case AF_UNIX:
780 return sizeof(struct sockaddr_un);
781 }
782 return 0;
783}
784
David du Colombier11bcb6c2011-03-24 12:23:00 +0100785/* set port in host byte order */
786static inline int set_net_port(struct sockaddr_storage *addr, int port)
787{
788 switch (addr->ss_family) {
789 case AF_INET:
790 ((struct sockaddr_in *)addr)->sin_port = port;
791 case AF_INET6:
792 ((struct sockaddr_in6 *)addr)->sin6_port = port;
793 }
794 return 0;
795}
796
797/* set port in network byte order */
798static inline int set_host_port(struct sockaddr_storage *addr, int port)
799{
800 switch (addr->ss_family) {
801 case AF_INET:
802 ((struct sockaddr_in *)addr)->sin_port = htons(port);
803 case AF_INET6:
804 ((struct sockaddr_in6 *)addr)->sin6_port = htons(port);
805 }
806 return 0;
807}
808
David du Colombier4f92d322011-03-24 11:09:31 +0100809/* Return true if IPv4 address is part of the network */
810extern int in_net_ipv4(struct in_addr *addr, struct in_addr *mask, struct in_addr *net);
811
812/* Return true if IPv6 address is part of the network */
813extern int in_net_ipv6(struct in6_addr *addr, struct in6_addr *mask, struct in6_addr *net);
814
815/* Map IPv4 adress on IPv6 address, as specified in RFC 3513. */
816extern void v4tov6(struct in6_addr *sin6_addr, struct in_addr *sin_addr);
817
818/* Map IPv6 adress on IPv4 address, as specified in RFC 3513.
819 * Return true if conversion is possible and false otherwise.
820 */
821extern int v6tov4(struct in_addr *sin_addr, struct in6_addr *sin6_addr);
822
William Lallemand421f5b52012-02-06 18:15:57 +0100823char *human_time(int t, short hz_div);
824
825extern const char *monthname[];
826
Yuxans Yao4e25b012012-10-19 10:36:09 +0800827/* numeric timezone (that is, the hour and minute offset from UTC) */
828char localtimezone[6];
829
William Lallemand421f5b52012-02-06 18:15:57 +0100830/* date2str_log: write a date in the format :
831 * sprintf(str, "%02d/%s/%04d:%02d:%02d:%02d.%03d",
832 * tm.tm_mday, monthname[tm.tm_mon], tm.tm_year+1900,
833 * tm.tm_hour, tm.tm_min, tm.tm_sec, (int)date.tv_usec/1000);
834 *
835 * without using sprintf. return a pointer to the last char written (\0) or
836 * NULL if there isn't enough space.
837 */
838char *date2str_log(char *dest, struct tm *tm, struct timeval *date, size_t size);
839
840/* gmt2str_log: write a date in the format :
841 * "%02d/%s/%04d:%02d:%02d:%02d +0000" without using snprintf
842 * return a pointer to the last char written (\0) or
843 * NULL if there isn't enough space.
844 */
845char *gmt2str_log(char *dst, struct tm *tm, size_t size);
846
Yuxans Yao4e25b012012-10-19 10:36:09 +0800847/* localdate2str_log: write a date in the format :
848 * "%02d/%s/%04d:%02d:%02d:%02d +0000(local timezone)" without using snprintf
849 * return a pointer to the last char written (\0) or
850 * NULL if there isn't enough space.
851 */
852char *localdate2str_log(char *dst, struct tm *tm, size_t size);
853
Willy Tarreau9a7bea52012-04-27 11:16:50 +0200854/* Dynamically allocates a string of the proper length to hold the formatted
855 * output. NULL is returned on error. The caller is responsible for freeing the
856 * memory area using free(). The resulting string is returned in <out> if the
857 * pointer is not NULL. A previous version of <out> might be used to build the
858 * new string, and it will be freed before returning if it is not NULL, which
859 * makes it possible to build complex strings from iterative calls without
860 * having to care about freeing intermediate values, as in the example below :
861 *
862 * memprintf(&err, "invalid argument: '%s'", arg);
863 * ...
864 * memprintf(&err, "parser said : <%s>\n", *err);
865 * ...
866 * free(*err);
867 *
868 * This means that <err> must be initialized to NULL before first invocation.
869 * The return value also holds the allocated string, which eases error checking
870 * and immediate consumption. If the output pointer is not used, NULL must be
Willy Tarreaueb6cead2012-09-20 19:43:14 +0200871 * passed instead and it will be ignored. The returned message will then also
872 * be NULL so that the caller does not have to bother with freeing anything.
Willy Tarreau9a7bea52012-04-27 11:16:50 +0200873 *
874 * It is also convenient to use it without any free except the last one :
875 * err = NULL;
876 * if (!fct1(err)) report(*err);
877 * if (!fct2(err)) report(*err);
878 * if (!fct3(err)) report(*err);
879 * free(*err);
880 */
881char *memprintf(char **out, const char *format, ...)
882 __attribute__ ((format(printf, 2, 3)));
883
Willy Tarreau21c705b2012-09-14 11:40:36 +0200884/* Used to add <level> spaces before each line of <out>, unless there is only one line.
885 * The input argument is automatically freed and reassigned. The result will have to be
886 * freed by the caller.
887 * Example of use :
888 * parse(cmd, &err); (callee: memprintf(&err, ...))
889 * fprintf(stderr, "Parser said: %s\n", indent_error(&err));
890 * free(err);
891 */
892char *indent_msg(char **out, int level);
Willy Tarreau3d2f16f2012-05-13 00:21:17 +0200893
Willy Tarreaudad36a32013-03-11 01:20:04 +0100894/* Convert occurrences of environment variables in the input string to their
895 * corresponding value. A variable is identified as a series of alphanumeric
896 * characters or underscores following a '$' sign. The <in> string must be
897 * free()able. NULL returns NULL. The resulting string might be reallocated if
898 * some expansion is made.
899 */
900char *env_expand(char *in);
901
Willy Tarreau3d2f16f2012-05-13 00:21:17 +0200902/* debugging macro to emit messages using write() on fd #-1 so that strace sees
903 * them.
904 */
905#define fddebug(msg...) do { char *_m = NULL; memprintf(&_m, ##msg); if (_m) write(-1, _m, strlen(_m)); free(_m); } while (0)
906
Willy Tarreau89efaed2013-12-13 15:14:55 +0100907/* used from everywhere just to drain results we don't want to read and which
908 * recent versions of gcc increasingly and annoyingly complain about.
909 */
910extern int shut_your_big_mouth_gcc_int;
911
912/* used from everywhere just to drain results we don't want to read and which
913 * recent versions of gcc increasingly and annoyingly complain about.
914 */
915static inline void shut_your_big_mouth_gcc(int r)
916{
917 shut_your_big_mouth_gcc_int = r;
918}
919
de Lafond Guillaume88c278f2013-04-15 19:27:10 +0200920/* same as strstr() but case-insensitive */
921const char *strnistr(const char *str1, int len_str1, const char *str2, int len_str2);
922
Willy Tarreaubb519c72014-01-28 23:04:39 +0100923
924/************************* Composite address manipulation *********************
925 * Composite addresses are simply unsigned long data in which the higher bits
926 * represent a pointer, and the two lower bits are flags. There are several
927 * places where we just want to associate one or two flags to a pointer (eg,
928 * to type it), and these functions permit this. The pointer is necessarily a
929 * 32-bit aligned pointer, as its two lower bits will be cleared and replaced
930 * with the flags.
931 *****************************************************************************/
932
933/* Masks the two lower bits of a composite address and converts it to a
934 * pointer. This is used to mix some bits with some aligned pointers to
935 * structs and to retrieve the original (32-bit aligned) pointer.
936 */
937static inline void *caddr_to_ptr(unsigned long caddr)
938{
939 return (void *)(caddr & ~3UL);
940}
941
942/* Only retrieves the two lower bits of a composite address. This is used to mix
943 * some bits with some aligned pointers to structs and to retrieve the original
944 * data (2 bits).
945 */
946static inline unsigned int caddr_to_data(unsigned long caddr)
947{
948 return (caddr & 3UL);
949}
950
951/* Combines the aligned pointer whose 2 lower bits will be masked with the bits
952 * from <data> to form a composite address. This is used to mix some bits with
953 * some aligned pointers to structs and to retrieve the original (32-bit aligned)
954 * pointer.
955 */
956static inline unsigned long caddr_from_ptr(void *ptr, unsigned int data)
957{
958 return (((unsigned long)ptr) & ~3UL) + (data & 3);
959}
960
961/* sets the 2 bits of <data> in the <caddr> composite address */
962static inline unsigned long caddr_set_flags(unsigned long caddr, unsigned int data)
963{
964 return caddr | (data & 3);
965}
966
967/* clears the 2 bits of <data> in the <caddr> composite address */
968static inline unsigned long caddr_clr_flags(unsigned long caddr, unsigned int data)
969{
970 return caddr & ~(unsigned long)(data & 3);
971}
972
Thierry FOURNIER317e1c42014-08-12 10:20:47 +0200973/* UTF-8 decoder status */
974#define UTF8_CODE_OK 0x00
975#define UTF8_CODE_OVERLONG 0x10
976#define UTF8_CODE_INVRANGE 0x20
977#define UTF8_CODE_BADSEQ 0x40
978
979unsigned char utf8_next(const char *s, int len, unsigned int *c);
980
981static inline unsigned char utf8_return_code(unsigned int code)
982{
983 return code & 0xf0;
984}
985
986static inline unsigned char utf8_return_length(unsigned char code)
987{
988 return code & 0x0f;
989}
990
Willy Tarreaue6e49cf2015-04-29 17:13:35 +0200991/* returns a 64-bit a timestamp with the finest resolution available. The
992 * unit is intentionally not specified. It's mostly used to compare dates.
993 */
994#if defined(__i386__) || defined(__x86_64__)
995static inline unsigned long long rdtsc()
996{
997 unsigned int a, d;
998 asm volatile("rdtsc" : "=a" (a), "=d" (d));
999 return a + ((unsigned long long)d << 32);
1000}
1001#else
1002static inline unsigned long long rdtsc()
1003{
1004 struct timeval tv;
1005 gettimeofday(&tv, NULL);
1006 return tv.tv_sec * 1000000 + tv.tv_usec;
1007}
1008#endif
1009
Willy Tarreau2dd0d472006-06-29 17:53:05 +02001010#endif /* _COMMON_STANDARD_H */