blob: be719f71438b9d4b801dca7f6c88e60e811a9372 [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>
Willy Tarreaue6e49cf2015-04-29 17:13:35 +020029#include <sys/time.h>
Willy Tarreau938b3032007-05-10 06:39:03 +020030#include <sys/types.h>
Willy Tarreaud50265a2012-09-04 14:18:33 +020031#include <sys/socket.h>
Willy Tarreaudd2f85e2012-09-02 22:34:23 +020032#include <sys/un.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020033#include <netinet/in.h>
Willy Tarreau5b4dd682015-07-21 23:47:18 +020034#include <arpa/inet.h>
Thierry FOURNIERe059ec92014-03-17 12:01:13 +010035#include <common/chunk.h>
Willy Tarreaue3ba5f02006-06-29 18:54:54 +020036#include <common/config.h>
Willy Tarreau16e01562016-08-09 16:46:18 +020037#include <common/namespace.h>
Willy Tarreau45cb4fb2009-10-26 21:10:04 +010038#include <eb32tree.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020039
William Lallemande7340ec2012-01-24 11:15:39 +010040#ifndef LLONG_MAX
41# define LLONG_MAX 9223372036854775807LL
42# define LLONG_MIN (-LLONG_MAX - 1LL)
43#endif
44
45#ifndef ULLONG_MAX
46# define ULLONG_MAX (LLONG_MAX * 2ULL + 1)
47#endif
48
Willy Tarreaua9db57e2013-01-18 11:29:29 +010049#ifndef LONGBITS
50#define LONGBITS ((unsigned int)sizeof(long) * 8)
51#endif
52
Thierry FOURNIER511e9472014-01-23 17:40:34 +010053/* size used for max length of decimal representation of long long int. */
54#define NB_LLMAX_STR (sizeof("-9223372036854775807")-1)
55
Willy Tarreau56adcf22012-12-23 18:00:29 +010056/* number of itoa_str entries */
57#define NB_ITOA_STR 10
William Lallemande7340ec2012-01-24 11:15:39 +010058
Willy Tarreau588297f2014-06-16 15:16:40 +020059/* maximum quoted string length (truncated above) */
60#define QSTR_SIZE 200
61#define NB_QSTR 10
62
Willy Tarreaubaaee002006-06-26 02:48:02 +020063/****** string-specific macros and functions ******/
64/* if a > max, then bound <a> to <max>. The macro returns the new <a> */
65#define UBOUND(a, max) ({ typeof(a) b = (max); if ((a) > b) (a) = b; (a); })
66
67/* if a < min, then bound <a> to <min>. The macro returns the new <a> */
68#define LBOUND(a, min) ({ typeof(a) b = (min); if ((a) < b) (a) = b; (a); })
69
70/* returns 1 only if only zero or one bit is set in X, which means that X is a
71 * power of 2, and 0 otherwise */
72#define POWEROF2(x) (((x) & ((x)-1)) == 0)
73
Willy Tarreau5b180202010-07-18 10:40:48 +020074/* operators to compare values. They're ordered that way so that the lowest bit
75 * serves as a negation for the test and contains all tests that are not equal.
76 */
77enum {
78 STD_OP_LE = 0, STD_OP_GT = 1,
79 STD_OP_EQ = 2, STD_OP_NE = 3,
80 STD_OP_GE = 4, STD_OP_LT = 5,
81};
82
Thierry FOURNIER9f95e402014-03-21 14:51:46 +010083enum http_scheme {
84 SCH_HTTP,
85 SCH_HTTPS,
86};
87
88struct split_url {
89 enum http_scheme scheme;
90 const char *host;
91 int host_len;
92};
93
Willy Tarreau56adcf22012-12-23 18:00:29 +010094extern int itoa_idx; /* index of next itoa_str to use */
95
Willy Tarreau7d58a632007-01-13 23:06:06 +010096/*
Willy Tarreaubaaee002006-06-26 02:48:02 +020097 * copies at most <size-1> chars from <src> to <dst>. Last char is always
98 * set to 0, unless <size> is 0. The number of chars copied is returned
99 * (excluding the terminating zero).
100 * This code has been optimized for size and speed : on x86, it's 45 bytes
101 * long, uses only registers, and consumes only 4 cycles per char.
102 */
103extern int strlcpy2(char *dst, const char *src, int size);
104
105/*
Willy Tarreau72d759c2007-10-25 12:14:10 +0200106 * This function simply returns a locally allocated string containing
Willy Tarreaubaaee002006-06-26 02:48:02 +0200107 * the ascii representation for number 'n' in decimal.
108 */
Willy Tarreaue7239b52009-03-29 13:41:58 +0200109extern char itoa_str[][171];
Emeric Brun3a7fce52010-01-04 14:54:38 +0100110extern char *ultoa_r(unsigned long n, char *buffer, int size);
Thierry FOURNIER763a5d82015-07-06 23:09:52 +0200111extern char *lltoa_r(long long int n, char *buffer, int size);
Thierry FOURNIER1480bd82015-06-06 19:14:59 +0200112extern char *sltoa_r(long n, char *buffer, int size);
Willy Tarreaue7239b52009-03-29 13:41:58 +0200113extern const char *ulltoh_r(unsigned long long n, char *buffer, int size);
Willy Tarreau72d759c2007-10-25 12:14:10 +0200114static inline const char *ultoa(unsigned long n)
115{
116 return ultoa_r(n, itoa_str[0], sizeof(itoa_str[0]));
117}
118
William Lallemande7340ec2012-01-24 11:15:39 +0100119/*
120 * unsigned long long ASCII representation
121 *
122 * return the last char '\0' or NULL if no enough
123 * space in dst
124 */
125char *ulltoa(unsigned long long n, char *dst, size_t size);
126
127
128/*
129 * unsigned long ASCII representation
130 *
131 * return the last char '\0' or NULL if no enough
132 * space in dst
133 */
134char *ultoa_o(unsigned long n, char *dst, size_t size);
135
136/*
137 * signed long ASCII representation
138 *
139 * return the last char '\0' or NULL if no enough
140 * space in dst
141 */
142char *ltoa_o(long int n, char *dst, size_t size);
143
144/*
145 * signed long long ASCII representation
146 *
147 * return the last char '\0' or NULL if no enough
148 * space in dst
149 */
150char *lltoa(long long n, char *dst, size_t size);
151
152/*
153 * write a ascii representation of a unsigned into dst,
154 * return a pointer to the last character
155 * Pad the ascii representation with '0', using size.
156 */
157char *utoa_pad(unsigned int n, char *dst, size_t size);
158
Willy Tarreaubaaee002006-06-26 02:48:02 +0200159/*
Willy Tarreau91092e52007-10-25 16:58:42 +0200160 * This function simply returns a locally allocated string containing the ascii
161 * representation for number 'n' in decimal, unless n is 0 in which case it
162 * returns the alternate string (or an empty string if the alternate string is
163 * NULL). It use is intended for limits reported in reports, where it's
164 * desirable not to display anything if there is no limit. Warning! it shares
165 * the same vector as ultoa_r().
166 */
167extern const char *limit_r(unsigned long n, char *buffer, int size, const char *alt);
168
Willy Tarreau56adcf22012-12-23 18:00:29 +0100169/* returns a locally allocated string containing the ASCII representation of
170 * the number 'n' in decimal. Up to NB_ITOA_STR calls may be used in the same
171 * function call (eg: printf), shared with the other similar functions making
172 * use of itoa_str[].
173 */
174static inline const char *U2A(unsigned long n)
175{
176 const char *ret = ultoa_r(n, itoa_str[itoa_idx], sizeof(itoa_str[0]));
177 if (++itoa_idx >= NB_ITOA_STR)
178 itoa_idx = 0;
179 return ret;
180}
181
182/* returns a locally allocated string containing the HTML representation of
183 * the number 'n' in decimal. Up to NB_ITOA_STR calls may be used in the same
184 * function call (eg: printf), shared with the other similar functions making
185 * use of itoa_str[].
Willy Tarreau91092e52007-10-25 16:58:42 +0200186 */
Willy Tarreau56adcf22012-12-23 18:00:29 +0100187static inline const char *U2H(unsigned long long n)
188{
189 const char *ret = ulltoh_r(n, itoa_str[itoa_idx], sizeof(itoa_str[0]));
190 if (++itoa_idx >= NB_ITOA_STR)
191 itoa_idx = 0;
192 return ret;
193}
194
195/* returns a locally allocated string containing the HTML representation of
196 * the number 'n' in decimal. Up to NB_ITOA_STR calls may be used in the same
197 * function call (eg: printf), shared with the other similar functions making
198 * use of itoa_str[].
199 */
200static inline const char *LIM2A(unsigned long n, const char *alt)
201{
202 const char *ret = limit_r(n, itoa_str[itoa_idx], sizeof(itoa_str[0]), alt);
203 if (++itoa_idx >= NB_ITOA_STR)
204 itoa_idx = 0;
205 return ret;
206}
Willy Tarreau91092e52007-10-25 16:58:42 +0200207
Willy Tarreau588297f2014-06-16 15:16:40 +0200208/* returns a locally allocated string containing the quoted encoding of the
209 * input string. The output may be truncated to QSTR_SIZE chars, but it is
210 * guaranteed that the string will always be properly terminated. Quotes are
211 * encoded by doubling them as is commonly done in CSV files. QSTR_SIZE must
212 * always be at least 4 chars.
213 */
214const char *qstr(const char *str);
215
216/* returns <str> or its quote-encoded equivalent if it contains at least one
217 * quote or a comma. This is aimed at build CSV-compatible strings.
218 */
219static inline const char *cstr(const char *str)
220{
221 const char *p = str;
222
223 while (*p) {
224 if (*p == ',' || *p == '"')
225 return qstr(str);
226 p++;
227 }
228 return str;
229}
230
Willy Tarreau91092e52007-10-25 16:58:42 +0200231/*
Willy Tarreaubaaee002006-06-26 02:48:02 +0200232 * Returns non-zero if character <s> is a hex digit (0-9, a-f, A-F), else zero.
233 */
234extern int ishex(char s);
235
236/*
Willy Tarreauda3b7c32009-11-02 20:12:52 +0100237 * Return integer equivalent of character <c> for a hex digit (0-9, a-f, A-F),
Willy Tarreau3dd0c4e2012-10-26 00:58:22 +0200238 * otherwise -1. This compact form helps gcc produce efficient code.
Willy Tarreauda3b7c32009-11-02 20:12:52 +0100239 */
Willy Tarreau3dd0c4e2012-10-26 00:58:22 +0200240static inline int hex2i(int c)
241{
Willy Tarreau0161d622013-04-02 01:26:55 +0200242 if (unlikely((unsigned char)(c -= '0') > 9)) {
243 if (likely((unsigned char)(c -= 'A' - '0') > 5 &&
244 (unsigned char)(c -= 'a' - 'A') > 5))
Willy Tarreau3dd0c4e2012-10-26 00:58:22 +0200245 c = -11;
246 c += 10;
247 }
248 return c;
249}
250
Willy Tarreau3ca1a882015-01-15 18:43:49 +0100251/* rounds <i> down to the closest value having max 2 digits */
252unsigned int round_2dig(unsigned int i);
Willy Tarreauda3b7c32009-11-02 20:12:52 +0100253
254/*
Willy Tarreau2e74c3f2007-12-02 18:45:09 +0100255 * Checks <name> for invalid characters. Valid chars are [A-Za-z0-9_:.-]. If an
256 * invalid character is found, a pointer to it is returned. If everything is
257 * fine, NULL is returned.
258 */
259extern const char *invalid_char(const char *name);
260
261/*
Krzysztof Piotr Oledzkiefe3b6f2008-05-23 23:49:32 +0200262 * Checks <domainname> for invalid characters. Valid chars are [A-Za-z0-9_.-].
263 * If an invalid character is found, a pointer to it is returned.
264 * If everything is fine, NULL is returned.
265 */
266extern const char *invalid_domainchar(const char *name);
267
268/*
Willy Tarreaufab5a432011-03-04 15:31:53 +0100269 * converts <str> to a locally allocated struct sockaddr_storage *, and a
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200270 * port range consisting in two integers. The low and high end are always set
271 * even if the port is unspecified, in which case (0,0) is returned. The low
Willy Tarreaufab5a432011-03-04 15:31:53 +0100272 * port is set in the sockaddr. Thus, it is enough to check the size of the
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200273 * returned range to know if an array must be allocated or not. The format is
Willy Tarreaufab5a432011-03-04 15:31:53 +0100274 * "addr[:[port[-port]]]", where "addr" can be a dotted IPv4 address, an IPv6
275 * address, a host name, or empty or "*" to indicate INADDR_ANY. If an IPv6
276 * address wants to ignore port, it must be terminated by a trailing colon (':').
277 * The IPv6 '::' address is IN6ADDR_ANY, so in order to bind to a given port on
278 * IPv6, use ":::port". NULL is returned if the host part cannot be resolved.
Willy Tarreaud393a622013-03-04 18:22:00 +0100279 * If <pfx> is non-null, it is used as a string prefix before any path-based
Thierry FOURNIER7fe3be72015-09-26 20:03:36 +0200280 * address (typically the path to a unix socket). If use_dns is not true,
281 * the funtion cannot accept the DNS resolution.
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200282 */
Willy Tarreau48ef4c92017-01-06 18:32:38 +0100283struct sockaddr_storage *str2sa_range(const char *str,
284 int *port, int *low, int *high,
285 char **err, const char *pfx,
286 char **fqdn, int resolve);
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200287
Willy Tarreau2937c0d2010-01-26 17:36:17 +0100288/* converts <str> to a struct in_addr containing a network mask. It can be
289 * passed in dotted form (255.255.255.0) or in CIDR form (24). It returns 1
290 * if the conversion succeeds otherwise non-zero.
291 */
292int str2mask(const char *str, struct in_addr *mask);
293
Thierry FOURNIERb0504632013-12-14 15:39:02 +0100294/* convert <cidr> to struct in_addr <mask>. It returns 1 if the conversion
295 * succeeds otherwise non-zero.
296 */
297int cidr2dotted(int cidr, struct in_addr *mask);
298
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200299/*
Willy Tarreaud077a8e2007-05-08 18:28:09 +0200300 * converts <str> to two struct in_addr* which must be pre-allocated.
Willy Tarreaubaaee002006-06-26 02:48:02 +0200301 * The format is "addr[/mask]", where "addr" cannot be empty, and mask
302 * is optionnal and either in the dotted or CIDR notation.
303 * Note: "addr" can also be a hostname. Returns 1 if OK, 0 if error.
304 */
Thierry FOURNIERfc7ac7b2014-02-11 15:23:04 +0100305int str2net(const char *str, int resolve, struct in_addr *addr, struct in_addr *mask);
Willy Tarreaubaaee002006-06-26 02:48:02 +0200306
Thierry FOURNIER58639a02014-11-25 12:02:25 +0100307/* str2ip and str2ip2:
308 *
309 * converts <str> to a struct sockaddr_storage* provided by the caller. The
310 * caller must have zeroed <sa> first, and may have set sa->ss_family to force
311 * parse a specific address format. If the ss_family is 0 or AF_UNSPEC, then
312 * the function tries to guess the address family from the syntax. If the
313 * family is forced and the format doesn't match, an error is returned. The
314 * string is assumed to contain only an address, no port. The address can be a
315 * dotted IPv4 address, an IPv6 address, a host name, or empty or "*" to
316 * indicate INADDR_ANY. NULL is returned if the host part cannot be resolved.
317 * The return address will only have the address family and the address set,
318 * all other fields remain zero. The string is not supposed to be modified.
319 * The IPv6 '::' address is IN6ADDR_ANY.
320 *
321 * str2ip2:
322 *
323 * If <resolve> is set, this function try to resolve DNS, otherwise, it returns
324 * NULL result.
325 */
326struct sockaddr_storage *str2ip2(const char *str, struct sockaddr_storage *sa, int resolve);
327static inline struct sockaddr_storage *str2ip(const char *str, struct sockaddr_storage *sa)
328{
329 return str2ip2(str, sa, 1);
330}
331
Alexandre Cassen5eb1a902007-11-29 15:43:32 +0100332/*
Willy Tarreau6d20e282012-04-27 22:49:47 +0200333 * converts <str> to two struct in6_addr* which must be pre-allocated.
334 * The format is "addr[/mask]", where "addr" cannot be empty, and mask
335 * is an optionnal number of bits (128 being the default).
336 * Returns 1 if OK, 0 if error.
337 */
338int str62net(const char *str, struct in6_addr *addr, unsigned char *mask);
339
340/*
Willy Tarreau106f9792009-09-19 07:54:16 +0200341 * Parse IP address found in url.
342 */
David du Colombier6f5ccb12011-03-10 22:26:24 +0100343int url2ipv4(const char *addr, struct in_addr *dst);
Willy Tarreau106f9792009-09-19 07:54:16 +0200344
345/*
David du Colombier6f5ccb12011-03-10 22:26:24 +0100346 * Resolve destination server from URL. Convert <str> to a sockaddr_storage*.
Alexandre Cassen5eb1a902007-11-29 15:43:32 +0100347 */
Thierry FOURNIER9f95e402014-03-21 14:51:46 +0100348int url2sa(const char *url, int ulen, struct sockaddr_storage *addr, struct split_url *out);
Alexandre Cassen5eb1a902007-11-29 15:43:32 +0100349
Willy Tarreau631f01c2011-09-05 00:36:48 +0200350/* Tries to convert a sockaddr_storage address 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 addr_to_str(struct sockaddr_storage *addr, char *str, int size);
357
Simon Horman75ab8bd2014-06-16 09:39:41 +0900358/* Tries to convert a sockaddr_storage port to text form. Upon success, the
359 * address family is returned so that it's easy for the caller to adapt to the
360 * output format. Zero is returned if the address family is not supported. -1
361 * is returned upon error, with errno set. AF_INET, AF_INET6 and AF_UNIX are
362 * supported.
363 */
364int port_to_str(struct sockaddr_storage *addr, char *str, int size);
365
Willy Tarreau16e01562016-08-09 16:46:18 +0200366/* check if the given address is local to the system or not. It will return
367 * -1 when it's not possible to know, 0 when the address is not local, 1 when
368 * it is. We don't want to iterate over all interfaces for this (and it is not
369 * portable). So instead we try to bind in UDP to this address on a free non
370 * privileged port and to connect to the same address, port 0 (connect doesn't
371 * care). If it succeeds, we own the address. Note that non-inet addresses are
372 * considered local since they're most likely AF_UNIX.
373 */
374int addr_is_local(const struct netns_entry *ns,
375 const struct sockaddr_storage *orig);
376
Willy Tarreaubaaee002006-06-26 02:48:02 +0200377/* will try to encode the string <string> replacing all characters tagged in
378 * <map> with the hexadecimal representation of their ASCII-code (2 digits)
379 * prefixed by <escape>, and will store the result between <start> (included)
380 * and <stop> (excluded), and will always terminate the string with a '\0'
381 * before <stop>. The position of the '\0' is returned if the conversion
382 * completes. If bytes are missing between <start> and <stop>, then the
383 * conversion will be incomplete and truncated. If <stop> <= <start>, the '\0'
384 * cannot even be stored so we return <start> without writing the 0.
385 * The input string must also be zero-terminated.
386 */
387extern const char hextab[];
388char *encode_string(char *start, char *stop,
389 const char escape, const fd_set *map,
390 const char *string);
391
Thierry FOURNIERe059ec92014-03-17 12:01:13 +0100392/*
393 * Same behavior, except that it encodes chunk <chunk> instead of a string.
394 */
395char *encode_chunk(char *start, char *stop,
396 const char escape, const fd_set *map,
397 const struct chunk *chunk);
398
Dragan Dosen0edd1092016-02-12 13:23:02 +0100399/*
400 * Tries to prefix characters tagged in the <map> with the <escape>
Dragan Dosen1a5d0602016-07-22 16:00:31 +0200401 * character. The input <string> must be zero-terminated. The result will
402 * be stored between <start> (included) and <stop> (excluded). This
403 * function will always try to terminate the resulting string with a '\0'
404 * before <stop>, and will return its position if the conversion
405 * completes.
406 */
407char *escape_string(char *start, char *stop,
408 const char escape, const fd_set *map,
409 const char *string);
410
411/*
412 * Tries to prefix characters tagged in the <map> with the <escape>
Dragan Dosen0edd1092016-02-12 13:23:02 +0100413 * character. <chunk> contains the input to be escaped. The result will be
414 * stored between <start> (included) and <stop> (excluded). The function
415 * will always try to terminate the resulting string with a '\0' before
416 * <stop>, and will return its position if the conversion completes.
417 */
418char *escape_chunk(char *start, char *stop,
419 const char escape, const fd_set *map,
420 const struct chunk *chunk);
421
Thierry FOURNIERe059ec92014-03-17 12:01:13 +0100422
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200423/* Check a string for using it in a CSV output format. If the string contains
424 * one of the following four char <">, <,>, CR or LF, the string is
425 * encapsulated between <"> and the <"> are escaped by a <""> sequence.
426 * <str> is the input string to be escaped. The function assumes that
427 * the input string is null-terminated.
428 *
429 * If <quote> is 0, the result is returned escaped but without double quote.
Willy Tarreau898529b2016-01-06 18:07:04 +0100430 * It is useful if the escaped string is used between double quotes in the
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200431 * format.
432 *
Willy Tarreau898529b2016-01-06 18:07:04 +0100433 * printf("..., \"%s\", ...\r\n", csv_enc(str, 0, &trash));
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200434 *
Willy Tarreau898529b2016-01-06 18:07:04 +0100435 * If <quote> is 1, the converter puts the quotes only if any character is
436 * escaped. If <quote> is 2, the converter always puts the quotes.
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200437 *
Willy Tarreau898529b2016-01-06 18:07:04 +0100438 * <output> is a struct chunk used for storing the output string.
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200439 *
Willy Tarreau898529b2016-01-06 18:07:04 +0100440 * The function returns the converted string on its output. If an error
441 * occurs, the function returns an empty string. This type of output is useful
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200442 * for using the function directly as printf() argument.
443 *
Willy Tarreau898529b2016-01-06 18:07:04 +0100444 * If the output buffer is too short to contain the input string, the result
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200445 * is truncated.
Willy Tarreau898529b2016-01-06 18:07:04 +0100446 *
447 * This function appends the encoding to the existing output chunk. Please
448 * use csv_enc() instead if you want to replace the output chunk.
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200449 */
Willy Tarreau898529b2016-01-06 18:07:04 +0100450const char *csv_enc_append(const char *str, int quote, struct chunk *output);
451
452/* same as above but the output chunk is reset first */
453static inline const char *csv_enc(const char *str, int quote, struct chunk *output)
454{
455 chunk_reset(output);
456 return csv_enc_append(str, quote, output);
457}
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200458
Willy Tarreaubf9c2fc2011-05-31 18:06:18 +0200459/* Decode an URL-encoded string in-place. The resulting string might
460 * be shorter. If some forbidden characters are found, the conversion is
461 * aborted, the string is truncated before the issue and non-zero is returned,
462 * otherwise the operation returns non-zero indicating success.
463 */
464int url_decode(char *string);
465
Willy Tarreau6911fa42007-03-04 18:06:08 +0100466/* This one is 6 times faster than strtoul() on athlon, but does
467 * no check at all.
468 */
469static inline unsigned int __str2ui(const char *s)
470{
471 unsigned int i = 0;
472 while (*s) {
473 i = i * 10 - '0';
474 i += (unsigned char)*s++;
475 }
476 return i;
477}
478
479/* This one is 5 times faster than strtoul() on athlon with checks.
480 * It returns the value of the number composed of all valid digits read.
481 */
482static inline unsigned int __str2uic(const char *s)
483{
484 unsigned int i = 0;
485 unsigned int j;
486 while (1) {
487 j = (*s++) - '0';
488 if (j > 9)
489 break;
490 i *= 10;
491 i += j;
492 }
493 return i;
494}
495
496/* This one is 28 times faster than strtoul() on athlon, but does
497 * no check at all!
498 */
499static inline unsigned int __strl2ui(const char *s, int len)
500{
501 unsigned int i = 0;
502 while (len-- > 0) {
503 i = i * 10 - '0';
504 i += (unsigned char)*s++;
505 }
506 return i;
507}
508
509/* This one is 7 times faster than strtoul() on athlon with checks.
510 * It returns the value of the number composed of all valid digits read.
511 */
512static inline unsigned int __strl2uic(const char *s, int len)
513{
514 unsigned int i = 0;
Willy Tarreau3f0c9762007-10-25 09:42:24 +0200515 unsigned int j, k;
Willy Tarreau6911fa42007-03-04 18:06:08 +0100516
517 while (len-- > 0) {
518 j = (*s++) - '0';
Willy Tarreau3f0c9762007-10-25 09:42:24 +0200519 k = i * 10;
Willy Tarreau6911fa42007-03-04 18:06:08 +0100520 if (j > 9)
521 break;
Willy Tarreau3f0c9762007-10-25 09:42:24 +0200522 i = k + j;
Willy Tarreau6911fa42007-03-04 18:06:08 +0100523 }
524 return i;
525}
526
Willy Tarreau4ec83cd2010-10-15 23:19:55 +0200527/* This function reads an unsigned integer from the string pointed to by <s>
528 * and returns it. The <s> pointer is adjusted to point to the first unread
529 * char. The function automatically stops at <end>.
530 */
531static inline unsigned int __read_uint(const char **s, const char *end)
532{
533 const char *ptr = *s;
534 unsigned int i = 0;
535 unsigned int j, k;
536
537 while (ptr < end) {
538 j = *ptr - '0';
539 k = i * 10;
540 if (j > 9)
541 break;
542 i = k + j;
543 ptr++;
544 }
545 *s = ptr;
546 return i;
547}
548
Thierry FOURNIER763a5d82015-07-06 23:09:52 +0200549unsigned long long int read_uint64(const char **s, const char *end);
550long long int read_int64(const char **s, const char *end);
551
Willy Tarreau6911fa42007-03-04 18:06:08 +0100552extern unsigned int str2ui(const char *s);
553extern unsigned int str2uic(const char *s);
554extern unsigned int strl2ui(const char *s, int len);
555extern unsigned int strl2uic(const char *s, int len);
556extern int strl2ic(const char *s, int len);
557extern int strl2irc(const char *s, int len, int *ret);
558extern int strl2llrc(const char *s, int len, long long *ret);
Thierry FOURNIER511e9472014-01-23 17:40:34 +0100559extern int strl2llrc_dotted(const char *text, int len, long long *ret);
Willy Tarreau4ec83cd2010-10-15 23:19:55 +0200560extern unsigned int read_uint(const char **s, const char *end);
Willy Tarreaud54bbdc2009-09-07 11:00:31 +0200561unsigned int inetaddr_host(const char *text);
562unsigned int inetaddr_host_lim(const char *text, const char *stop);
Willy Tarreau74172752010-10-15 23:21:42 +0200563unsigned int inetaddr_host_lim_ret(char *text, char *stop, char **ret);
Willy Tarreau6911fa42007-03-04 18:06:08 +0100564
Krzysztof Piotr Oledzki3d5562b2009-10-10 20:11:17 +0200565static inline char *cut_crlf(char *s) {
566
Simon Horman5269cfb2013-02-13 17:48:00 +0900567 while (*s != '\r' && *s != '\n') {
Krzysztof Piotr Oledzki3d5562b2009-10-10 20:11:17 +0200568 char *p = s++;
569
570 if (!*p)
571 return p;
572 }
573
Simon Horman5269cfb2013-02-13 17:48:00 +0900574 *s++ = '\0';
Krzysztof Piotr Oledzki3d5562b2009-10-10 20:11:17 +0200575
576 return s;
577}
578
579static inline char *ltrim(char *s, char c) {
580
581 if (c)
582 while (*s == c)
583 s++;
584
585 return s;
586}
587
588static inline char *rtrim(char *s, char c) {
589
590 char *p = s + strlen(s);
591
592 while (p-- > s)
593 if (*p == c)
594 *p = '\0';
595 else
596 break;
597
598 return s;
599}
600
601static inline char *alltrim(char *s, char c) {
602
603 rtrim(s, c);
604
605 return ltrim(s, c);
606}
607
Willy Tarreaufe944602007-10-25 10:34:16 +0200608/* This function converts the time_t value <now> into a broken out struct tm
609 * which must be allocated by the caller. It is highly recommended to use this
610 * function intead of localtime() because that one requires a time_t* which
611 * is not always compatible with tv_sec depending on OS/hardware combinations.
612 */
613static inline void get_localtime(const time_t now, struct tm *tm)
614{
615 localtime_r(&now, tm);
616}
617
Emeric Brun3a058f32009-06-30 18:26:00 +0200618/* This function converts the time_t value <now> into a broken out struct tm
619 * which must be allocated by the caller. It is highly recommended to use this
620 * function intead of gmtime() because that one requires a time_t* which
621 * is not always compatible with tv_sec depending on OS/hardware combinations.
622 */
623static inline void get_gmtime(const time_t now, struct tm *tm)
624{
625 gmtime_r(&now, tm);
626}
627
Willy Tarreaua0d37b62007-12-02 22:00:35 +0100628/* This function parses a time value optionally followed by a unit suffix among
629 * "d", "h", "m", "s", "ms" or "us". It converts the value into the unit
630 * expected by the caller. The computation does its best to avoid overflows.
631 * The value is returned in <ret> if everything is fine, and a NULL is returned
632 * by the function. In case of error, a pointer to the error is returned and
633 * <ret> is left untouched.
634 */
635extern const char *parse_time_err(const char *text, unsigned *ret, unsigned unit_flags);
Emeric Brun39132b22010-01-04 14:57:24 +0100636extern const char *parse_size_err(const char *text, unsigned *ret);
Willy Tarreaua0d37b62007-12-02 22:00:35 +0100637
638/* unit flags to pass to parse_time_err */
639#define TIME_UNIT_US 0x0000
640#define TIME_UNIT_MS 0x0001
641#define TIME_UNIT_S 0x0002
642#define TIME_UNIT_MIN 0x0003
643#define TIME_UNIT_HOUR 0x0004
644#define TIME_UNIT_DAY 0x0005
645#define TIME_UNIT_MASK 0x0007
646
William Lallemand421f5b52012-02-06 18:15:57 +0100647#define SEC 1
648#define MINUTE (60 * SEC)
649#define HOUR (60 * MINUTE)
650#define DAY (24 * HOUR)
651
Willy Tarreau7f062c42009-03-05 18:43:00 +0100652/* Multiply the two 32-bit operands and shift the 64-bit result right 32 bits.
653 * This is used to compute fixed ratios by setting one of the operands to
654 * (2^32*ratio).
655 */
656static inline unsigned int mul32hi(unsigned int a, unsigned int b)
657{
658 return ((unsigned long long)a * b) >> 32;
659}
660
Willy Tarreauf0d9eec2010-06-20 07:12:37 +0200661/* gcc does not know when it can safely divide 64 bits by 32 bits. Use this
662 * function when you know for sure that the result fits in 32 bits, because
663 * it is optimal on x86 and on 64bit processors.
664 */
665static inline unsigned int div64_32(unsigned long long o1, unsigned int o2)
666{
667 unsigned int result;
668#ifdef __i386__
669 asm("divl %2"
670 : "=a" (result)
671 : "A"(o1), "rm"(o2));
672#else
673 result = o1 / o2;
674#endif
675 return result;
676}
677
David Carliere6c39412015-07-02 07:00:17 +0000678/* Simple popcountl implementation. It returns the number of ones in a word */
679static inline unsigned int my_popcountl(unsigned long a)
Willy Tarreau37994f02012-11-19 12:11:07 +0100680{
681 unsigned int cnt;
682 for (cnt = 0; a; a >>= 1) {
683 if (a & 1)
684 cnt++;
685 }
686 return cnt;
687}
688
David Carliere6c39412015-07-02 07:00:17 +0000689/* Build a word with the <bits> lower bits set (reverse of my_popcountl) */
Willy Tarreaua9db57e2013-01-18 11:29:29 +0100690static inline unsigned long nbits(int bits)
691{
692 if (--bits < 0)
693 return 0;
694 else
695 return (2UL << bits) - 1;
696}
697
Willy Tarreau126d4062013-12-03 17:50:47 +0100698/*
699 * Parse binary string written in hexadecimal (source) and store the decoded
700 * result into binstr and set binstrlen to the lengh of binstr. Memory for
701 * binstr is allocated by the function. In case of error, returns 0 with an
702 * error message in err.
703 */
704int parse_binary(const char *source, char **binstr, int *binstrlen, char **err);
705
Willy Tarreau946ba592009-05-10 15:41:18 +0200706/* copies at most <n> characters from <src> and always terminates with '\0' */
707char *my_strndup(const char *src, int n);
708
Baptiste Assmannbb77c8e2013-10-06 23:24:13 +0200709/*
710 * search needle in haystack
711 * returns the pointer if found, returns NULL otherwise
712 */
713const void *my_memmem(const void *, size_t, const void *, size_t);
714
Willy Tarreau482b00d2009-10-04 22:48:42 +0200715/* This function returns the first unused key greater than or equal to <key> in
716 * ID tree <root>. Zero is returned if no place is found.
717 */
718unsigned int get_next_id(struct eb_root *root, unsigned int key);
719
Willy Tarreau348238b2010-01-18 15:05:57 +0100720/* This function compares a sample word possibly followed by blanks to another
721 * clean word. The compare is case-insensitive. 1 is returned if both are equal,
722 * otherwise zero. This intends to be used when checking HTTP headers for some
723 * values.
724 */
725int word_match(const char *sample, int slen, const char *word, int wlen);
726
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200727/* Convert a fixed-length string to an IP address. Returns 0 in case of error,
728 * or the number of chars read in case of success.
729 */
730int buf2ip(const char *buf, size_t len, struct in_addr *dst);
Thierry FOURNIERd559dd82013-11-22 16:16:59 +0100731int buf2ip6(const char *buf, size_t len, struct in6_addr *dst);
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200732
Willy Tarreauacf95772010-06-14 19:09:21 +0200733/* To be used to quote config arg positions. Returns the string at <ptr>
734 * surrounded by simple quotes if <ptr> is valid and non-empty, or "end of line"
735 * if ptr is NULL or empty. The string is locally allocated.
736 */
737const char *quote_arg(const char *ptr);
738
Willy Tarreau5b180202010-07-18 10:40:48 +0200739/* returns an operator among STD_OP_* for string <str> or < 0 if unknown */
740int get_std_op(const char *str);
741
Willy Tarreau4c14eaa2010-11-24 14:01:45 +0100742/* hash a 32-bit integer to another 32-bit integer */
743extern unsigned int full_hash(unsigned int a);
744static inline unsigned int __full_hash(unsigned int a)
745{
746 /* This function is one of Bob Jenkins' full avalanche hashing
747 * functions, which when provides quite a good distribution for little
748 * input variations. The result is quite suited to fit over a 32-bit
749 * space with enough variations so that a randomly picked number falls
750 * equally before any server position.
751 * Check http://burtleburtle.net/bob/hash/integer.html for more info.
752 */
753 a = (a+0x7ed55d16) + (a<<12);
754 a = (a^0xc761c23c) ^ (a>>19);
755 a = (a+0x165667b1) + (a<<5);
756 a = (a+0xd3a2646c) ^ (a<<9);
757 a = (a+0xfd7046c5) + (a<<3);
758 a = (a^0xb55a4f09) ^ (a>>16);
759
760 /* ensure values are better spread all around the tree by multiplying
761 * by a large prime close to 3/4 of the tree.
762 */
763 return a * 3221225473U;
764}
765
Willy Tarreau422a0a52012-10-26 19:47:23 +0200766/* sets the address family to AF_UNSPEC so that is_addr() does not match */
767static inline void clear_addr(struct sockaddr_storage *addr)
768{
769 addr->ss_family = AF_UNSPEC;
770}
771
David du Colombier6f5ccb12011-03-10 22:26:24 +0100772/* returns non-zero if addr has a valid and non-null IPv4 or IPv6 address,
773 * otherwise zero.
774 */
Willy Tarreau18ca2d42014-05-09 22:40:55 +0200775static inline int is_inet_addr(const struct sockaddr_storage *addr)
David du Colombier6f5ccb12011-03-10 22:26:24 +0100776{
777 int i;
778
779 switch (addr->ss_family) {
780 case AF_INET:
David du Colombier64e9c902011-03-22 11:39:41 +0100781 return *(int *)&((struct sockaddr_in *)addr)->sin_addr;
David du Colombier6f5ccb12011-03-10 22:26:24 +0100782 case AF_INET6:
783 for (i = 0; i < sizeof(struct in6_addr) / sizeof(int); i++)
784 if (((int *)&((struct sockaddr_in6 *)addr)->sin6_addr)[i] != 0)
785 return ((int *)&((struct sockaddr_in6 *)addr)->sin6_addr)[i];
786 }
787 return 0;
788}
789
Willy Tarreau18ca2d42014-05-09 22:40:55 +0200790/* returns non-zero if addr has a valid and non-null IPv4 or IPv6 address,
791 * or is a unix address, otherwise returns zero.
792 */
793static inline int is_addr(const struct sockaddr_storage *addr)
794{
795 if (addr->ss_family == AF_UNIX)
796 return 1;
797 else
798 return is_inet_addr(addr);
799}
800
David du Colombier11bcb6c2011-03-24 12:23:00 +0100801/* returns port in network byte order */
802static inline int get_net_port(struct sockaddr_storage *addr)
803{
804 switch (addr->ss_family) {
805 case AF_INET:
806 return ((struct sockaddr_in *)addr)->sin_port;
807 case AF_INET6:
808 return ((struct sockaddr_in6 *)addr)->sin6_port;
809 }
810 return 0;
811}
812
813/* returns port in host byte order */
814static inline int get_host_port(struct sockaddr_storage *addr)
815{
816 switch (addr->ss_family) {
817 case AF_INET:
818 return ntohs(((struct sockaddr_in *)addr)->sin_port);
819 case AF_INET6:
820 return ntohs(((struct sockaddr_in6 *)addr)->sin6_port);
821 }
822 return 0;
823}
824
Willy Tarreau1b4b7ce2011-04-05 16:56:50 +0200825/* returns address len for <addr>'s family, 0 for unknown families */
826static inline int get_addr_len(const struct sockaddr_storage *addr)
827{
828 switch (addr->ss_family) {
829 case AF_INET:
830 return sizeof(struct sockaddr_in);
831 case AF_INET6:
832 return sizeof(struct sockaddr_in6);
833 case AF_UNIX:
834 return sizeof(struct sockaddr_un);
835 }
836 return 0;
837}
838
David du Colombier11bcb6c2011-03-24 12:23:00 +0100839/* set port in host byte order */
840static inline int set_net_port(struct sockaddr_storage *addr, int port)
841{
842 switch (addr->ss_family) {
843 case AF_INET:
844 ((struct sockaddr_in *)addr)->sin_port = port;
845 case AF_INET6:
846 ((struct sockaddr_in6 *)addr)->sin6_port = port;
847 }
848 return 0;
849}
850
851/* set port in network byte order */
852static inline int set_host_port(struct sockaddr_storage *addr, int port)
853{
854 switch (addr->ss_family) {
855 case AF_INET:
856 ((struct sockaddr_in *)addr)->sin_port = htons(port);
857 case AF_INET6:
858 ((struct sockaddr_in6 *)addr)->sin6_port = htons(port);
859 }
860 return 0;
861}
862
Thierry Fournier70473a52016-02-17 17:12:14 +0100863/* Convert mask from bit length form to in_addr form.
864 * This function never fails.
865 */
866void len2mask4(int len, struct in_addr *addr);
867
868/* Convert mask from bit length form to in6_addr form.
869 * This function never fails.
870 */
871void len2mask6(int len, struct in6_addr *addr);
872
David du Colombier4f92d322011-03-24 11:09:31 +0100873/* Return true if IPv4 address is part of the network */
Willy Tarreaueec1d382016-07-13 11:59:39 +0200874extern 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 +0100875
876/* Return true if IPv6 address is part of the network */
Willy Tarreaueec1d382016-07-13 11:59:39 +0200877extern 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 +0100878
879/* Map IPv4 adress on IPv6 address, as specified in RFC 3513. */
880extern void v4tov6(struct in6_addr *sin6_addr, struct in_addr *sin_addr);
881
882/* Map IPv6 adress on IPv4 address, as specified in RFC 3513.
883 * Return true if conversion is possible and false otherwise.
884 */
885extern int v6tov4(struct in_addr *sin_addr, struct in6_addr *sin6_addr);
886
Baptiste Assmann08b24cf2016-01-23 23:39:12 +0100887/* compare two struct sockaddr_storage and return:
888 * 0 (true) if the addr is the same in both
889 * 1 (false) if the addr is not the same in both
890 */
891int ipcmp(struct sockaddr_storage *ss1, struct sockaddr_storage *ss2);
892
Baptiste Assmann08396c82016-01-31 00:27:17 +0100893/* copy ip from <source> into <dest>
894 * the caller must clear <dest> before calling.
895 * Returns a pointer to the destination
896 */
897struct sockaddr_storage *ipcpy(struct sockaddr_storage *source, struct sockaddr_storage *dest);
898
William Lallemand421f5b52012-02-06 18:15:57 +0100899char *human_time(int t, short hz_div);
900
901extern const char *monthname[];
902
903/* date2str_log: write a date in the format :
904 * sprintf(str, "%02d/%s/%04d:%02d:%02d:%02d.%03d",
905 * tm.tm_mday, monthname[tm.tm_mon], tm.tm_year+1900,
906 * tm.tm_hour, tm.tm_min, tm.tm_sec, (int)date.tv_usec/1000);
907 *
908 * without using sprintf. return a pointer to the last char written (\0) or
909 * NULL if there isn't enough space.
910 */
911char *date2str_log(char *dest, struct tm *tm, struct timeval *date, size_t size);
912
Benoit GARNIERb413c2a2016-03-27 11:08:03 +0200913/* Return the GMT offset for a specific local time.
Benoit GARNIERe2e5bde2016-03-27 03:04:16 +0200914 * Both t and tm must represent the same time.
Benoit GARNIERb413c2a2016-03-27 11:08:03 +0200915 * The string returned has the same format as returned by strftime(... "%z", tm).
916 * Offsets are kept in an internal cache for better performances.
917 */
Benoit GARNIERe2e5bde2016-03-27 03:04:16 +0200918const char *get_gmt_offset(time_t t, struct tm *tm);
Benoit GARNIERb413c2a2016-03-27 11:08:03 +0200919
William Lallemand421f5b52012-02-06 18:15:57 +0100920/* gmt2str_log: write a date in the format :
921 * "%02d/%s/%04d:%02d:%02d:%02d +0000" without using snprintf
922 * return a pointer to the last char written (\0) or
923 * NULL if there isn't enough space.
924 */
925char *gmt2str_log(char *dst, struct tm *tm, size_t size);
926
Yuxans Yao4e25b012012-10-19 10:36:09 +0800927/* localdate2str_log: write a date in the format :
928 * "%02d/%s/%04d:%02d:%02d:%02d +0000(local timezone)" without using snprintf
Benoit GARNIERe2e5bde2016-03-27 03:04:16 +0200929 * Both t and tm must represent the same time.
Yuxans Yao4e25b012012-10-19 10:36:09 +0800930 * return a pointer to the last char written (\0) or
931 * NULL if there isn't enough space.
932 */
Benoit GARNIERe2e5bde2016-03-27 03:04:16 +0200933char *localdate2str_log(char *dst, time_t t, struct tm *tm, size_t size);
Yuxans Yao4e25b012012-10-19 10:36:09 +0800934
Thierry Fournier93127942016-01-20 18:49:45 +0100935/* These 3 functions parses date string and fills the
936 * corresponding broken-down time in <tm>. In succes case,
937 * it returns 1, otherwise, it returns 0.
938 */
939int parse_http_date(const char *date, int len, struct tm *tm);
940int parse_imf_date(const char *date, int len, struct tm *tm);
941int parse_rfc850_date(const char *date, int len, struct tm *tm);
942int parse_asctime_date(const char *date, int len, struct tm *tm);
943
Willy Tarreau9a7bea52012-04-27 11:16:50 +0200944/* Dynamically allocates a string of the proper length to hold the formatted
945 * output. NULL is returned on error. The caller is responsible for freeing the
946 * memory area using free(). The resulting string is returned in <out> if the
947 * pointer is not NULL. A previous version of <out> might be used to build the
948 * new string, and it will be freed before returning if it is not NULL, which
949 * makes it possible to build complex strings from iterative calls without
950 * having to care about freeing intermediate values, as in the example below :
951 *
952 * memprintf(&err, "invalid argument: '%s'", arg);
953 * ...
954 * memprintf(&err, "parser said : <%s>\n", *err);
955 * ...
956 * free(*err);
957 *
958 * This means that <err> must be initialized to NULL before first invocation.
959 * The return value also holds the allocated string, which eases error checking
960 * and immediate consumption. If the output pointer is not used, NULL must be
Willy Tarreaueb6cead2012-09-20 19:43:14 +0200961 * passed instead and it will be ignored. The returned message will then also
962 * be NULL so that the caller does not have to bother with freeing anything.
Willy Tarreau9a7bea52012-04-27 11:16:50 +0200963 *
964 * It is also convenient to use it without any free except the last one :
965 * err = NULL;
966 * if (!fct1(err)) report(*err);
967 * if (!fct2(err)) report(*err);
968 * if (!fct3(err)) report(*err);
969 * free(*err);
970 */
971char *memprintf(char **out, const char *format, ...)
972 __attribute__ ((format(printf, 2, 3)));
973
Willy Tarreau21c705b2012-09-14 11:40:36 +0200974/* Used to add <level> spaces before each line of <out>, unless there is only one line.
975 * The input argument is automatically freed and reassigned. The result will have to be
976 * freed by the caller.
977 * Example of use :
978 * parse(cmd, &err); (callee: memprintf(&err, ...))
979 * fprintf(stderr, "Parser said: %s\n", indent_error(&err));
980 * free(err);
981 */
982char *indent_msg(char **out, int level);
Willy Tarreau3d2f16f2012-05-13 00:21:17 +0200983
Willy Tarreaudad36a32013-03-11 01:20:04 +0100984/* Convert occurrences of environment variables in the input string to their
985 * corresponding value. A variable is identified as a series of alphanumeric
986 * characters or underscores following a '$' sign. The <in> string must be
987 * free()able. NULL returns NULL. The resulting string might be reallocated if
988 * some expansion is made.
989 */
990char *env_expand(char *in);
991
Willy Tarreau3d2f16f2012-05-13 00:21:17 +0200992/* debugging macro to emit messages using write() on fd #-1 so that strace sees
993 * them.
994 */
995#define fddebug(msg...) do { char *_m = NULL; memprintf(&_m, ##msg); if (_m) write(-1, _m, strlen(_m)); free(_m); } while (0)
996
Willy Tarreau0ebb5112016-12-05 00:10:57 +0100997/* displays a <len> long memory block at <buf>, assuming first byte of <buf>
998 * has address <baseaddr>. The output is emitted to file <out>.
999 */
1000void debug_hexdump(FILE *out, char *buf, unsigned int baseaddr, int len);
1001
Willy Tarreau89efaed2013-12-13 15:14:55 +01001002/* used from everywhere just to drain results we don't want to read and which
1003 * recent versions of gcc increasingly and annoyingly complain about.
1004 */
1005extern int shut_your_big_mouth_gcc_int;
1006
1007/* used from everywhere just to drain results we don't want to read and which
1008 * recent versions of gcc increasingly and annoyingly complain about.
1009 */
1010static inline void shut_your_big_mouth_gcc(int r)
1011{
1012 shut_your_big_mouth_gcc_int = r;
1013}
1014
de Lafond Guillaume88c278f2013-04-15 19:27:10 +02001015/* same as strstr() but case-insensitive */
1016const char *strnistr(const char *str1, int len_str1, const char *str2, int len_str2);
1017
Willy Tarreaubb519c72014-01-28 23:04:39 +01001018
1019/************************* Composite address manipulation *********************
1020 * Composite addresses are simply unsigned long data in which the higher bits
1021 * represent a pointer, and the two lower bits are flags. There are several
1022 * places where we just want to associate one or two flags to a pointer (eg,
1023 * to type it), and these functions permit this. The pointer is necessarily a
1024 * 32-bit aligned pointer, as its two lower bits will be cleared and replaced
1025 * with the flags.
1026 *****************************************************************************/
1027
1028/* Masks the two lower bits of a composite address and converts it to a
1029 * pointer. This is used to mix some bits with some aligned pointers to
1030 * structs and to retrieve the original (32-bit aligned) pointer.
1031 */
1032static inline void *caddr_to_ptr(unsigned long caddr)
1033{
1034 return (void *)(caddr & ~3UL);
1035}
1036
1037/* Only retrieves the two lower bits of a composite address. This is used to mix
1038 * some bits with some aligned pointers to structs and to retrieve the original
1039 * data (2 bits).
1040 */
1041static inline unsigned int caddr_to_data(unsigned long caddr)
1042{
1043 return (caddr & 3UL);
1044}
1045
1046/* Combines the aligned pointer whose 2 lower bits will be masked with the bits
1047 * from <data> to form a composite address. This is used to mix some bits with
1048 * some aligned pointers to structs and to retrieve the original (32-bit aligned)
1049 * pointer.
1050 */
1051static inline unsigned long caddr_from_ptr(void *ptr, unsigned int data)
1052{
1053 return (((unsigned long)ptr) & ~3UL) + (data & 3);
1054}
1055
1056/* sets the 2 bits of <data> in the <caddr> composite address */
1057static inline unsigned long caddr_set_flags(unsigned long caddr, unsigned int data)
1058{
1059 return caddr | (data & 3);
1060}
1061
1062/* clears the 2 bits of <data> in the <caddr> composite address */
1063static inline unsigned long caddr_clr_flags(unsigned long caddr, unsigned int data)
1064{
1065 return caddr & ~(unsigned long)(data & 3);
1066}
1067
Thierry FOURNIER317e1c42014-08-12 10:20:47 +02001068/* UTF-8 decoder status */
1069#define UTF8_CODE_OK 0x00
1070#define UTF8_CODE_OVERLONG 0x10
1071#define UTF8_CODE_INVRANGE 0x20
1072#define UTF8_CODE_BADSEQ 0x40
1073
1074unsigned char utf8_next(const char *s, int len, unsigned int *c);
1075
1076static inline unsigned char utf8_return_code(unsigned int code)
1077{
1078 return code & 0xf0;
1079}
1080
1081static inline unsigned char utf8_return_length(unsigned char code)
1082{
1083 return code & 0x0f;
1084}
1085
Willy Tarreau5b4dd682015-07-21 23:47:18 +02001086/* Turns 64-bit value <a> from host byte order to network byte order.
1087 * The principle consists in letting the compiler detect we're playing
1088 * with a union and simplify most or all operations. The asm-optimized
1089 * htonl() version involving bswap (x86) / rev (arm) / other is a single
1090 * operation on little endian, or a NOP on big-endian. In both cases,
1091 * this lets the compiler "see" that we're rebuilding a 64-bit word from
1092 * two 32-bit quantities that fit into a 32-bit register. In big endian,
1093 * the whole code is optimized out. In little endian, with a decent compiler,
1094 * a few bswap and 2 shifts are left, which is the minimum acceptable.
1095 */
Willy Tarreau5f6e9052016-05-20 06:29:59 +02001096static inline unsigned long long my_htonll(unsigned long long a)
Willy Tarreau5b4dd682015-07-21 23:47:18 +02001097{
1098 union {
1099 struct {
1100 unsigned int w1;
1101 unsigned int w2;
1102 } by32;
1103 unsigned long long by64;
1104 } w = { .by64 = a };
1105 return ((unsigned long long)htonl(w.by32.w1) << 32) | htonl(w.by32.w2);
1106}
1107
1108/* Turns 64-bit value <a> from network byte order to host byte order. */
Willy Tarreau5f6e9052016-05-20 06:29:59 +02001109static inline unsigned long long my_ntohll(unsigned long long a)
Willy Tarreau5b4dd682015-07-21 23:47:18 +02001110{
Willy Tarreau5f6e9052016-05-20 06:29:59 +02001111 return my_htonll(a);
Willy Tarreau5b4dd682015-07-21 23:47:18 +02001112}
1113
Willy Tarreaue6e49cf2015-04-29 17:13:35 +02001114/* returns a 64-bit a timestamp with the finest resolution available. The
1115 * unit is intentionally not specified. It's mostly used to compare dates.
1116 */
1117#if defined(__i386__) || defined(__x86_64__)
1118static inline unsigned long long rdtsc()
1119{
1120 unsigned int a, d;
1121 asm volatile("rdtsc" : "=a" (a), "=d" (d));
1122 return a + ((unsigned long long)d << 32);
1123}
1124#else
1125static inline unsigned long long rdtsc()
1126{
1127 struct timeval tv;
1128 gettimeofday(&tv, NULL);
1129 return tv.tv_sec * 1000000 + tv.tv_usec;
1130}
1131#endif
1132
Maxime de Roucydc887852016-05-13 23:52:54 +02001133/* append a copy of string <str> (in a wordlist) at the end of the list <li>
1134 * On failure : return 0 and <err> filled with an error message.
1135 * The caller is responsible for freeing the <err> and <str> copy
1136 * memory area using free()
1137 */
1138struct list;
1139int list_append_word(struct list *li, const char *str, char **err);
1140
Willy Tarreau97c2ae12016-11-22 18:00:20 +01001141int dump_text(struct chunk *out, const char *buf, int bsize);
1142int dump_binary(struct chunk *out, const char *buf, int bsize);
1143int dump_text_line(struct chunk *out, const char *buf, int bsize, int len,
1144 int *line, int ptr);
1145
Hubert Verstraete2eae3a02016-06-28 22:41:00 +02001146/* same as realloc() except that ptr is also freed upon failure */
1147static inline void *my_realloc2(void *ptr, size_t size)
1148{
1149 void *ret;
1150
1151 ret = realloc(ptr, size);
1152 if (!ret && size)
1153 free(ptr);
1154 return ret;
1155}
1156
Lukas Tribusdcbc5c52016-09-12 21:42:07 +00001157/* HAP_STRING() makes a string from a literal while HAP_XSTRING() first
1158 * evaluates the argument and is suited to pass macros.
1159 *
1160 * They allow macros like PCRE_MAJOR to be defined without quotes, which
1161 * is convenient for applications that want to test its value.
1162 */
1163#define HAP_STRING(...) #__VA_ARGS__
1164#define HAP_XSTRING(...) HAP_STRING(__VA_ARGS__)
1165
Willy Tarreau2dd0d472006-06-29 17:53:05 +02001166#endif /* _COMMON_STANDARD_H */