blob: 7a2ba2e4aab63f180ae8ee35c02e620e9cea27c6 [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 Tarreau13faf162020-03-04 07:44:06 +010025#ifdef USE_BACKTRACE
26#define _GNU_SOURCE
27#include <execinfo.h>
28#endif
29
Willy Tarreau050737f2010-01-14 11:40:12 +010030#include <string.h>
Willy Tarreau0ebb5112016-12-05 00:10:57 +010031#include <stdio.h>
Willy Tarreaufe944602007-10-25 10:34:16 +020032#include <time.h>
David Carlier5222d8e2017-11-03 12:00:26 +000033#include <stdarg.h>
Willy Tarreaue6e49cf2015-04-29 17:13:35 +020034#include <sys/time.h>
Willy Tarreau938b3032007-05-10 06:39:03 +020035#include <sys/types.h>
Willy Tarreaud50265a2012-09-04 14:18:33 +020036#include <sys/socket.h>
Willy Tarreaudd2f85e2012-09-02 22:34:23 +020037#include <sys/un.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020038#include <netinet/in.h>
Willy Tarreau5b4dd682015-07-21 23:47:18 +020039#include <arpa/inet.h>
Willy Tarreau4c7e4b72020-05-27 12:58:42 +020040#include <haproxy/api.h>
Willy Tarreauaea46352020-06-01 11:48:35 +020041#include <haproxy/intops.h>
Thierry FOURNIERe059ec92014-03-17 12:01:13 +010042#include <common/chunk.h>
Willy Tarreau16e01562016-08-09 16:46:18 +020043#include <common/namespace.h>
Willy Tarreau8d2b7772020-05-27 10:58:19 +020044#include <import/eb32tree.h>
45#include <import/eb32sctree.h>
William Lallemand2fe7dd02018-09-11 16:51:29 +020046#include <types/protocol.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020047
Thierry FOURNIER511e9472014-01-23 17:40:34 +010048/* size used for max length of decimal representation of long long int. */
49#define NB_LLMAX_STR (sizeof("-9223372036854775807")-1)
50
Willy Tarreau56adcf22012-12-23 18:00:29 +010051/* number of itoa_str entries */
Willy Tarreau59caa3b2018-12-14 13:59:42 +010052#define NB_ITOA_STR 16
William Lallemande7340ec2012-01-24 11:15:39 +010053
Willy Tarreau588297f2014-06-16 15:16:40 +020054/* maximum quoted string length (truncated above) */
55#define QSTR_SIZE 200
56#define NB_QSTR 10
57
Willy Tarreaubaaee002006-06-26 02:48:02 +020058/****** string-specific macros and functions ******/
59/* if a > max, then bound <a> to <max>. The macro returns the new <a> */
60#define UBOUND(a, max) ({ typeof(a) b = (max); if ((a) > b) (a) = b; (a); })
61
62/* if a < min, then bound <a> to <min>. The macro returns the new <a> */
63#define LBOUND(a, min) ({ typeof(a) b = (min); if ((a) < b) (a) = b; (a); })
64
65/* returns 1 only if only zero or one bit is set in X, which means that X is a
66 * power of 2, and 0 otherwise */
67#define POWEROF2(x) (((x) & ((x)-1)) == 0)
68
Willy Tarreau4d653a62020-06-03 17:49:00 +020069#define SWAP(a, b) do { typeof(a) t; t = a; a = b; b = t; } while(0)
70
71/* return an integer of type <ret> with only the highest bit set. <ret> may be
72 * both a variable or a type.
73 */
74#define MID_RANGE(ret) ((typeof(ret))1 << (8*sizeof(ret) - 1))
75
76/* return the largest possible integer of type <ret>, with all bits set */
77#define MAX_RANGE(ret) (~(typeof(ret))0)
78
Willy Tarreau32c24552019-08-19 17:39:33 +020079/* DEFNULL() returns either the argument as-is, or NULL if absent. This is for
80 * use in macros arguments.
81 */
82#define DEFNULL(...) _FIRST_ARG(NULL, ##__VA_ARGS__, NULL)
83#define _FIRST_ARG(a, b, ...) b
84
Willy Tarreau5b180202010-07-18 10:40:48 +020085/* operators to compare values. They're ordered that way so that the lowest bit
86 * serves as a negation for the test and contains all tests that are not equal.
87 */
88enum {
89 STD_OP_LE = 0, STD_OP_GT = 1,
90 STD_OP_EQ = 2, STD_OP_NE = 3,
91 STD_OP_GE = 4, STD_OP_LT = 5,
92};
93
Thierry FOURNIER9f95e402014-03-21 14:51:46 +010094enum http_scheme {
95 SCH_HTTP,
96 SCH_HTTPS,
97};
98
99struct split_url {
100 enum http_scheme scheme;
101 const char *host;
102 int host_len;
103};
104
Willy Tarreaufb4ba912019-08-29 09:32:21 +0200105/* generic structure associating a name and a value, for use in arrays */
106struct name_desc {
107 const char *name;
108 const char *desc;
109};
110
Christopher Faulet99bca652017-11-14 16:47:26 +0100111extern THREAD_LOCAL int itoa_idx; /* index of next itoa_str to use */
Willy Tarreau56adcf22012-12-23 18:00:29 +0100112
Willy Tarreau7d58a632007-01-13 23:06:06 +0100113/*
Willy Tarreaubaaee002006-06-26 02:48:02 +0200114 * copies at most <size-1> chars from <src> to <dst>. Last char is always
115 * set to 0, unless <size> is 0. The number of chars copied is returned
116 * (excluding the terminating zero).
117 * This code has been optimized for size and speed : on x86, it's 45 bytes
118 * long, uses only registers, and consumes only 4 cycles per char.
119 */
120extern int strlcpy2(char *dst, const char *src, int size);
121
122/*
Willy Tarreau72d759c2007-10-25 12:14:10 +0200123 * This function simply returns a locally allocated string containing
Willy Tarreaubaaee002006-06-26 02:48:02 +0200124 * the ascii representation for number 'n' in decimal.
125 */
Christopher Faulet99bca652017-11-14 16:47:26 +0100126extern THREAD_LOCAL char itoa_str[][171];
Emeric Brun3a7fce52010-01-04 14:54:38 +0100127extern char *ultoa_r(unsigned long n, char *buffer, int size);
Thierry FOURNIER763a5d82015-07-06 23:09:52 +0200128extern char *lltoa_r(long long int n, char *buffer, int size);
Thierry FOURNIER1480bd82015-06-06 19:14:59 +0200129extern char *sltoa_r(long n, char *buffer, int size);
Willy Tarreaue7239b52009-03-29 13:41:58 +0200130extern const char *ulltoh_r(unsigned long long n, char *buffer, int size);
Willy Tarreau72d759c2007-10-25 12:14:10 +0200131static inline const char *ultoa(unsigned long n)
132{
133 return ultoa_r(n, itoa_str[0], sizeof(itoa_str[0]));
134}
135
William Lallemande7340ec2012-01-24 11:15:39 +0100136/*
137 * unsigned long long ASCII representation
138 *
139 * return the last char '\0' or NULL if no enough
140 * space in dst
141 */
142char *ulltoa(unsigned long long n, char *dst, size_t size);
143
144
145/*
146 * unsigned long ASCII representation
147 *
148 * return the last char '\0' or NULL if no enough
149 * space in dst
150 */
151char *ultoa_o(unsigned long n, char *dst, size_t size);
152
153/*
154 * signed long ASCII representation
155 *
156 * return the last char '\0' or NULL if no enough
157 * space in dst
158 */
159char *ltoa_o(long int n, char *dst, size_t size);
160
161/*
162 * signed long long ASCII representation
163 *
164 * return the last char '\0' or NULL if no enough
165 * space in dst
166 */
167char *lltoa(long long n, char *dst, size_t size);
168
169/*
170 * write a ascii representation of a unsigned into dst,
171 * return a pointer to the last character
172 * Pad the ascii representation with '0', using size.
173 */
174char *utoa_pad(unsigned int n, char *dst, size_t size);
175
Willy Tarreaubaaee002006-06-26 02:48:02 +0200176/*
Willy Tarreau91092e52007-10-25 16:58:42 +0200177 * This function simply returns a locally allocated string containing the ascii
178 * representation for number 'n' in decimal, unless n is 0 in which case it
179 * returns the alternate string (or an empty string if the alternate string is
180 * NULL). It use is intended for limits reported in reports, where it's
181 * desirable not to display anything if there is no limit. Warning! it shares
182 * the same vector as ultoa_r().
183 */
184extern const char *limit_r(unsigned long n, char *buffer, int size, const char *alt);
185
Willy Tarreau56adcf22012-12-23 18:00:29 +0100186/* returns a locally allocated string containing the ASCII representation of
187 * the number 'n' in decimal. Up to NB_ITOA_STR calls may be used in the same
188 * function call (eg: printf), shared with the other similar functions making
189 * use of itoa_str[].
190 */
191static inline const char *U2A(unsigned long n)
192{
193 const char *ret = ultoa_r(n, itoa_str[itoa_idx], sizeof(itoa_str[0]));
194 if (++itoa_idx >= NB_ITOA_STR)
195 itoa_idx = 0;
196 return ret;
197}
198
199/* returns a locally allocated string containing the HTML representation of
200 * the number 'n' in decimal. Up to NB_ITOA_STR calls may be used in the same
201 * function call (eg: printf), shared with the other similar functions making
202 * use of itoa_str[].
Willy Tarreau91092e52007-10-25 16:58:42 +0200203 */
Willy Tarreau56adcf22012-12-23 18:00:29 +0100204static inline const char *U2H(unsigned long long n)
205{
206 const char *ret = ulltoh_r(n, itoa_str[itoa_idx], sizeof(itoa_str[0]));
207 if (++itoa_idx >= NB_ITOA_STR)
208 itoa_idx = 0;
209 return ret;
210}
211
Ioannis Cherouvim1ff76332018-10-24 10:05:19 +0300212/* returns a locally allocated string containing the ASCII representation of
Willy Tarreau56adcf22012-12-23 18:00:29 +0100213 * the number 'n' in decimal. Up to NB_ITOA_STR calls may be used in the same
214 * function call (eg: printf), shared with the other similar functions making
215 * use of itoa_str[].
216 */
217static inline const char *LIM2A(unsigned long n, const char *alt)
218{
219 const char *ret = limit_r(n, itoa_str[itoa_idx], sizeof(itoa_str[0]), alt);
220 if (++itoa_idx >= NB_ITOA_STR)
221 itoa_idx = 0;
222 return ret;
223}
Willy Tarreau91092e52007-10-25 16:58:42 +0200224
Willy Tarreau588297f2014-06-16 15:16:40 +0200225/* returns a locally allocated string containing the quoted encoding of the
226 * input string. The output may be truncated to QSTR_SIZE chars, but it is
227 * guaranteed that the string will always be properly terminated. Quotes are
228 * encoded by doubling them as is commonly done in CSV files. QSTR_SIZE must
229 * always be at least 4 chars.
230 */
231const char *qstr(const char *str);
232
233/* returns <str> or its quote-encoded equivalent if it contains at least one
234 * quote or a comma. This is aimed at build CSV-compatible strings.
235 */
236static inline const char *cstr(const char *str)
237{
238 const char *p = str;
239
240 while (*p) {
241 if (*p == ',' || *p == '"')
242 return qstr(str);
243 p++;
244 }
245 return str;
246}
247
Willy Tarreau91092e52007-10-25 16:58:42 +0200248/*
Willy Tarreaubaaee002006-06-26 02:48:02 +0200249 * Returns non-zero if character <s> is a hex digit (0-9, a-f, A-F), else zero.
250 */
251extern int ishex(char s);
252
253/*
Willy Tarreau2e74c3f2007-12-02 18:45:09 +0100254 * Checks <name> for invalid characters. Valid chars are [A-Za-z0-9_:.-]. If an
255 * invalid character is found, a pointer to it is returned. If everything is
256 * fine, NULL is returned.
257 */
258extern const char *invalid_char(const char *name);
259
260/*
Frédéric Lécailleb82f7422017-04-13 18:24:23 +0200261 * Checks <name> for invalid characters. Valid chars are [A-Za-z0-9_.-].
Krzysztof Piotr Oledzkiefe3b6f2008-05-23 23:49:32 +0200262 * If an invalid character is found, a pointer to it is returned.
263 * If everything is fine, NULL is returned.
264 */
265extern const char *invalid_domainchar(const char *name);
266
267/*
Frédéric Lécailleb82f7422017-04-13 18:24:23 +0200268 * Checks <name> for invalid characters. Valid chars are [A-Za-z_.-].
269 * If an invalid character is found, a pointer to it is returned.
270 * If everything is fine, NULL is returned.
271 */
272extern const char *invalid_prefix_char(const char *name);
273
Willy Tarreau36f586b2020-02-14 18:25:17 +0100274/* returns true if <c> is an identifier character, that is, a digit, a letter,
Willy Tarreaua71667c2020-02-17 06:34:11 +0100275 * or '-', '+', '_', ':' or '.'. This is usable for proxy names, server names,
276 * ACL names, sample fetch names, and converter names.
Willy Tarreau36f586b2020-02-14 18:25:17 +0100277 */
278static inline int is_idchar(char c)
279{
Willy Tarreau90807112020-02-25 08:16:33 +0100280 return isalnum((unsigned char)c) ||
Willy Tarreaua71667c2020-02-17 06:34:11 +0100281 c == '.' || c == '_' || c == '-' || c == '+' || c == ':';
Willy Tarreau36f586b2020-02-14 18:25:17 +0100282}
283
Frédéric Lécailleb82f7422017-04-13 18:24:23 +0200284/*
Willy Tarreaufab5a432011-03-04 15:31:53 +0100285 * converts <str> to a locally allocated struct sockaddr_storage *, and a
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200286 * port range consisting in two integers. The low and high end are always set
287 * even if the port is unspecified, in which case (0,0) is returned. The low
Willy Tarreaufab5a432011-03-04 15:31:53 +0100288 * port is set in the sockaddr. Thus, it is enough to check the size of the
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200289 * returned range to know if an array must be allocated or not. The format is
Willy Tarreaufab5a432011-03-04 15:31:53 +0100290 * "addr[:[port[-port]]]", where "addr" can be a dotted IPv4 address, an IPv6
291 * address, a host name, or empty or "*" to indicate INADDR_ANY. If an IPv6
292 * address wants to ignore port, it must be terminated by a trailing colon (':').
293 * The IPv6 '::' address is IN6ADDR_ANY, so in order to bind to a given port on
294 * IPv6, use ":::port". NULL is returned if the host part cannot be resolved.
Willy Tarreaud393a622013-03-04 18:22:00 +0100295 * If <pfx> is non-null, it is used as a string prefix before any path-based
Thierry FOURNIER7fe3be72015-09-26 20:03:36 +0200296 * address (typically the path to a unix socket). If use_dns is not true,
Joseph Herlant32b83272018-11-15 11:58:28 -0800297 * the function cannot accept the DNS resolution.
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200298 */
Willy Tarreau48ef4c92017-01-06 18:32:38 +0100299struct sockaddr_storage *str2sa_range(const char *str,
300 int *port, int *low, int *high,
301 char **err, const char *pfx,
302 char **fqdn, int resolve);
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200303
Willy Tarreau2937c0d2010-01-26 17:36:17 +0100304/* converts <str> to a struct in_addr containing a network mask. It can be
305 * passed in dotted form (255.255.255.0) or in CIDR form (24). It returns 1
Jarno Huuskonen577d5ac2017-05-21 17:32:21 +0300306 * if the conversion succeeds otherwise zero.
Willy Tarreau2937c0d2010-01-26 17:36:17 +0100307 */
308int str2mask(const char *str, struct in_addr *mask);
309
Tim Duesterhus47185172018-01-25 16:24:49 +0100310/* converts <str> to a struct in6_addr containing a network mask. It can be
Tim Duesterhus5e642862018-02-20 17:02:18 +0100311 * passed in quadruplet form (ffff:ffff::) or in CIDR form (64). It returns 1
Tim Duesterhus47185172018-01-25 16:24:49 +0100312 * if the conversion succeeds otherwise zero.
313 */
314int str2mask6(const char *str, struct in6_addr *mask);
315
Thierry FOURNIERb0504632013-12-14 15:39:02 +0100316/* convert <cidr> to struct in_addr <mask>. It returns 1 if the conversion
317 * succeeds otherwise non-zero.
318 */
319int cidr2dotted(int cidr, struct in_addr *mask);
320
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200321/*
Willy Tarreaud077a8e2007-05-08 18:28:09 +0200322 * converts <str> to two struct in_addr* which must be pre-allocated.
Willy Tarreaubaaee002006-06-26 02:48:02 +0200323 * The format is "addr[/mask]", where "addr" cannot be empty, and mask
Ilya Shipitsin77e3b4a2020-03-10 12:06:11 +0500324 * is optional and either in the dotted or CIDR notation.
Willy Tarreaubaaee002006-06-26 02:48:02 +0200325 * Note: "addr" can also be a hostname. Returns 1 if OK, 0 if error.
326 */
Thierry FOURNIERfc7ac7b2014-02-11 15:23:04 +0100327int str2net(const char *str, int resolve, struct in_addr *addr, struct in_addr *mask);
Willy Tarreaubaaee002006-06-26 02:48:02 +0200328
Thierry FOURNIER58639a02014-11-25 12:02:25 +0100329/* str2ip and str2ip2:
330 *
331 * converts <str> to a struct sockaddr_storage* provided by the caller. The
332 * caller must have zeroed <sa> first, and may have set sa->ss_family to force
333 * parse a specific address format. If the ss_family is 0 or AF_UNSPEC, then
334 * the function tries to guess the address family from the syntax. If the
335 * family is forced and the format doesn't match, an error is returned. The
336 * string is assumed to contain only an address, no port. The address can be a
337 * dotted IPv4 address, an IPv6 address, a host name, or empty or "*" to
338 * indicate INADDR_ANY. NULL is returned if the host part cannot be resolved.
339 * The return address will only have the address family and the address set,
340 * all other fields remain zero. The string is not supposed to be modified.
341 * The IPv6 '::' address is IN6ADDR_ANY.
342 *
343 * str2ip2:
344 *
345 * If <resolve> is set, this function try to resolve DNS, otherwise, it returns
346 * NULL result.
347 */
348struct sockaddr_storage *str2ip2(const char *str, struct sockaddr_storage *sa, int resolve);
349static inline struct sockaddr_storage *str2ip(const char *str, struct sockaddr_storage *sa)
350{
351 return str2ip2(str, sa, 1);
352}
353
Alexandre Cassen5eb1a902007-11-29 15:43:32 +0100354/*
Willy Tarreau6d20e282012-04-27 22:49:47 +0200355 * converts <str> to two struct in6_addr* which must be pre-allocated.
356 * The format is "addr[/mask]", where "addr" cannot be empty, and mask
Ilya Shipitsin77e3b4a2020-03-10 12:06:11 +0500357 * is an optional number of bits (128 being the default).
Willy Tarreau6d20e282012-04-27 22:49:47 +0200358 * Returns 1 if OK, 0 if error.
359 */
360int str62net(const char *str, struct in6_addr *addr, unsigned char *mask);
361
362/*
Willy Tarreau106f9792009-09-19 07:54:16 +0200363 * Parse IP address found in url.
364 */
David du Colombier6f5ccb12011-03-10 22:26:24 +0100365int url2ipv4(const char *addr, struct in_addr *dst);
Willy Tarreau106f9792009-09-19 07:54:16 +0200366
367/*
David du Colombier6f5ccb12011-03-10 22:26:24 +0100368 * Resolve destination server from URL. Convert <str> to a sockaddr_storage*.
Alexandre Cassen5eb1a902007-11-29 15:43:32 +0100369 */
Thierry FOURNIER9f95e402014-03-21 14:51:46 +0100370int url2sa(const char *url, int ulen, struct sockaddr_storage *addr, struct split_url *out);
Alexandre Cassen5eb1a902007-11-29 15:43:32 +0100371
Willy Tarreau631f01c2011-09-05 00:36:48 +0200372/* Tries to convert a sockaddr_storage address to text form. Upon success, the
373 * address family is returned so that it's easy for the caller to adapt to the
374 * output format. Zero is returned if the address family is not supported. -1
375 * is returned upon error, with errno set. AF_INET, AF_INET6 and AF_UNIX are
376 * supported.
377 */
Willy Tarreaud5ec4bf2019-04-25 17:48:16 +0200378int addr_to_str(const struct sockaddr_storage *addr, char *str, int size);
Willy Tarreau631f01c2011-09-05 00:36:48 +0200379
Simon Horman75ab8bd2014-06-16 09:39:41 +0900380/* Tries to convert a sockaddr_storage port to text form. Upon success, the
381 * address family is returned so that it's easy for the caller to adapt to the
382 * output format. Zero is returned if the address family is not supported. -1
383 * is returned upon error, with errno set. AF_INET, AF_INET6 and AF_UNIX are
384 * supported.
385 */
Willy Tarreaud5ec4bf2019-04-25 17:48:16 +0200386int port_to_str(const struct sockaddr_storage *addr, char *str, int size);
Simon Horman75ab8bd2014-06-16 09:39:41 +0900387
Willy Tarreau16e01562016-08-09 16:46:18 +0200388/* check if the given address is local to the system or not. It will return
389 * -1 when it's not possible to know, 0 when the address is not local, 1 when
390 * it is. We don't want to iterate over all interfaces for this (and it is not
391 * portable). So instead we try to bind in UDP to this address on a free non
392 * privileged port and to connect to the same address, port 0 (connect doesn't
393 * care). If it succeeds, we own the address. Note that non-inet addresses are
394 * considered local since they're most likely AF_UNIX.
395 */
396int addr_is_local(const struct netns_entry *ns,
397 const struct sockaddr_storage *orig);
398
Willy Tarreaubaaee002006-06-26 02:48:02 +0200399/* will try to encode the string <string> replacing all characters tagged in
400 * <map> with the hexadecimal representation of their ASCII-code (2 digits)
401 * prefixed by <escape>, and will store the result between <start> (included)
402 * and <stop> (excluded), and will always terminate the string with a '\0'
403 * before <stop>. The position of the '\0' is returned if the conversion
404 * completes. If bytes are missing between <start> and <stop>, then the
405 * conversion will be incomplete and truncated. If <stop> <= <start>, the '\0'
406 * cannot even be stored so we return <start> without writing the 0.
407 * The input string must also be zero-terminated.
408 */
409extern const char hextab[];
410char *encode_string(char *start, char *stop,
Willy Tarreau1bfd6022019-06-07 11:10:07 +0200411 const char escape, const long *map,
Willy Tarreaubaaee002006-06-26 02:48:02 +0200412 const char *string);
413
Thierry FOURNIERe059ec92014-03-17 12:01:13 +0100414/*
415 * Same behavior, except that it encodes chunk <chunk> instead of a string.
416 */
417char *encode_chunk(char *start, char *stop,
Willy Tarreau1bfd6022019-06-07 11:10:07 +0200418 const char escape, const long *map,
Willy Tarreau83061a82018-07-13 11:56:34 +0200419 const struct buffer *chunk);
Thierry FOURNIERe059ec92014-03-17 12:01:13 +0100420
Dragan Dosen0edd1092016-02-12 13:23:02 +0100421/*
422 * Tries to prefix characters tagged in the <map> with the <escape>
Dragan Dosen1a5d0602016-07-22 16:00:31 +0200423 * character. The input <string> must be zero-terminated. The result will
424 * be stored between <start> (included) and <stop> (excluded). This
425 * function will always try to terminate the resulting string with a '\0'
426 * before <stop>, and will return its position if the conversion
427 * completes.
428 */
429char *escape_string(char *start, char *stop,
Willy Tarreau1bfd6022019-06-07 11:10:07 +0200430 const char escape, const long *map,
Dragan Dosen1a5d0602016-07-22 16:00:31 +0200431 const char *string);
432
433/*
434 * Tries to prefix characters tagged in the <map> with the <escape>
Dragan Dosen0edd1092016-02-12 13:23:02 +0100435 * character. <chunk> contains the input to be escaped. The result will be
436 * stored between <start> (included) and <stop> (excluded). The function
437 * will always try to terminate the resulting string with a '\0' before
438 * <stop>, and will return its position if the conversion completes.
439 */
440char *escape_chunk(char *start, char *stop,
Willy Tarreau1bfd6022019-06-07 11:10:07 +0200441 const char escape, const long *map,
Willy Tarreau83061a82018-07-13 11:56:34 +0200442 const struct buffer *chunk);
Dragan Dosen0edd1092016-02-12 13:23:02 +0100443
Thierry FOURNIERe059ec92014-03-17 12:01:13 +0100444
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200445/* Check a string for using it in a CSV output format. If the string contains
446 * one of the following four char <">, <,>, CR or LF, the string is
447 * encapsulated between <"> and the <"> are escaped by a <""> sequence.
448 * <str> is the input string to be escaped. The function assumes that
449 * the input string is null-terminated.
450 *
451 * If <quote> is 0, the result is returned escaped but without double quote.
Willy Tarreau898529b2016-01-06 18:07:04 +0100452 * It is useful if the escaped string is used between double quotes in the
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200453 * format.
454 *
Willy Tarreau898529b2016-01-06 18:07:04 +0100455 * printf("..., \"%s\", ...\r\n", csv_enc(str, 0, &trash));
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200456 *
Willy Tarreau898529b2016-01-06 18:07:04 +0100457 * If <quote> is 1, the converter puts the quotes only if any character is
458 * escaped. If <quote> is 2, the converter always puts the quotes.
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200459 *
Willy Tarreau898529b2016-01-06 18:07:04 +0100460 * <output> is a struct chunk used for storing the output string.
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200461 *
Willy Tarreau898529b2016-01-06 18:07:04 +0100462 * The function returns the converted string on its output. If an error
463 * occurs, the function returns an empty string. This type of output is useful
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200464 * for using the function directly as printf() argument.
465 *
Willy Tarreau898529b2016-01-06 18:07:04 +0100466 * If the output buffer is too short to contain the input string, the result
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200467 * is truncated.
Willy Tarreau898529b2016-01-06 18:07:04 +0100468 *
469 * This function appends the encoding to the existing output chunk. Please
470 * use csv_enc() instead if you want to replace the output chunk.
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200471 */
Willy Tarreau83061a82018-07-13 11:56:34 +0200472const char *csv_enc_append(const char *str, int quote, struct buffer *output);
Willy Tarreau898529b2016-01-06 18:07:04 +0100473
474/* same as above but the output chunk is reset first */
Willy Tarreau83061a82018-07-13 11:56:34 +0200475static inline const char *csv_enc(const char *str, int quote,
476 struct buffer *output)
Willy Tarreau898529b2016-01-06 18:07:04 +0100477{
478 chunk_reset(output);
479 return csv_enc_append(str, quote, output);
480}
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200481
Willy Tarreaubf9c2fc2011-05-31 18:06:18 +0200482/* Decode an URL-encoded string in-place. The resulting string might
483 * be shorter. If some forbidden characters are found, the conversion is
484 * aborted, the string is truncated before the issue and non-zero is returned,
485 * otherwise the operation returns non-zero indicating success.
Willy Tarreau62ba9ba2020-04-23 17:54:47 +0200486 * If the 'in_form' argument is non-nul the string is assumed to be part of
487 * an "application/x-www-form-urlencoded" encoded string, and the '+' will be
488 * turned to a space. If it's zero, this will only be done after a question
489 * mark ('?').
Willy Tarreaubf9c2fc2011-05-31 18:06:18 +0200490 */
Willy Tarreau62ba9ba2020-04-23 17:54:47 +0200491int url_decode(char *string, int in_form);
Willy Tarreaubf9c2fc2011-05-31 18:06:18 +0200492
Willy Tarreaud54bbdc2009-09-07 11:00:31 +0200493unsigned int inetaddr_host(const char *text);
494unsigned int inetaddr_host_lim(const char *text, const char *stop);
Willy Tarreau74172752010-10-15 23:21:42 +0200495unsigned int inetaddr_host_lim_ret(char *text, char *stop, char **ret);
Willy Tarreau6911fa42007-03-04 18:06:08 +0100496
Krzysztof Piotr Oledzki3d5562b2009-10-10 20:11:17 +0200497static inline char *cut_crlf(char *s) {
498
Simon Horman5269cfb2013-02-13 17:48:00 +0900499 while (*s != '\r' && *s != '\n') {
Krzysztof Piotr Oledzki3d5562b2009-10-10 20:11:17 +0200500 char *p = s++;
501
502 if (!*p)
503 return p;
504 }
505
Simon Horman5269cfb2013-02-13 17:48:00 +0900506 *s++ = '\0';
Krzysztof Piotr Oledzki3d5562b2009-10-10 20:11:17 +0200507
508 return s;
509}
510
511static inline char *ltrim(char *s, char c) {
512
513 if (c)
514 while (*s == c)
515 s++;
516
517 return s;
518}
519
520static inline char *rtrim(char *s, char c) {
521
522 char *p = s + strlen(s);
523
524 while (p-- > s)
525 if (*p == c)
526 *p = '\0';
527 else
528 break;
529
530 return s;
531}
532
533static inline char *alltrim(char *s, char c) {
534
535 rtrim(s, c);
536
537 return ltrim(s, c);
538}
539
Willy Tarreaufe944602007-10-25 10:34:16 +0200540/* This function converts the time_t value <now> into a broken out struct tm
541 * which must be allocated by the caller. It is highly recommended to use this
Ilya Shipitsin77e3b4a2020-03-10 12:06:11 +0500542 * function instead of localtime() because that one requires a time_t* which
Willy Tarreaufe944602007-10-25 10:34:16 +0200543 * is not always compatible with tv_sec depending on OS/hardware combinations.
544 */
545static inline void get_localtime(const time_t now, struct tm *tm)
546{
547 localtime_r(&now, tm);
548}
549
Emeric Brun3a058f32009-06-30 18:26:00 +0200550/* This function converts the time_t value <now> into a broken out struct tm
551 * which must be allocated by the caller. It is highly recommended to use this
Ilya Shipitsin77e3b4a2020-03-10 12:06:11 +0500552 * function instead of gmtime() because that one requires a time_t* which
Emeric Brun3a058f32009-06-30 18:26:00 +0200553 * is not always compatible with tv_sec depending on OS/hardware combinations.
554 */
555static inline void get_gmtime(const time_t now, struct tm *tm)
556{
557 gmtime_r(&now, tm);
558}
559
Willy Tarreaucb1949b2017-07-19 19:05:29 +0200560/* Counts a number of elapsed days since 01/01/0000 based solely on elapsed
561 * years and assuming the regular rule for leap years applies. It's fake but
562 * serves as a temporary origin. It's worth remembering that it's the first
563 * year of each period that is leap and not the last one, so for instance year
564 * 1 sees 366 days since year 0 was leap. For this reason we have to apply
Ilya Shipitsin77e3b4a2020-03-10 12:06:11 +0500565 * modular arithmetic which is why we offset the year by 399 before
Willy Tarreaucb1949b2017-07-19 19:05:29 +0200566 * subtracting the excess at the end. No overflow here before ~11.7 million
567 * years.
568 */
569static inline unsigned int days_since_zero(unsigned int y)
570{
571 return y * 365 + (y + 399) / 4 - (y + 399) / 100 + (y + 399) / 400
572 - 399 / 4 + 399 / 100;
573}
574
575/* Returns the number of seconds since 01/01/1970 0:0:0 GMT for GMT date <tm>.
576 * It is meant as a portable replacement for timegm() for use with valid inputs.
577 * Returns undefined results for invalid dates (eg: months out of range 0..11).
578 */
579extern time_t my_timegm(const struct tm *tm);
580
Willy Tarreaua0d37b62007-12-02 22:00:35 +0100581/* This function parses a time value optionally followed by a unit suffix among
582 * "d", "h", "m", "s", "ms" or "us". It converts the value into the unit
583 * expected by the caller. The computation does its best to avoid overflows.
584 * The value is returned in <ret> if everything is fine, and a NULL is returned
585 * by the function. In case of error, a pointer to the error is returned and
586 * <ret> is left untouched.
587 */
588extern const char *parse_time_err(const char *text, unsigned *ret, unsigned unit_flags);
Emeric Brun39132b22010-01-04 14:57:24 +0100589extern const char *parse_size_err(const char *text, unsigned *ret);
Willy Tarreaua0d37b62007-12-02 22:00:35 +0100590
Willy Tarreau9faebe32019-06-07 19:00:37 +0200591/* special return values for the time parser */
592#define PARSE_TIME_UNDER ((char *)1)
593#define PARSE_TIME_OVER ((char *)2)
594
Willy Tarreaua0d37b62007-12-02 22:00:35 +0100595/* unit flags to pass to parse_time_err */
596#define TIME_UNIT_US 0x0000
597#define TIME_UNIT_MS 0x0001
598#define TIME_UNIT_S 0x0002
599#define TIME_UNIT_MIN 0x0003
600#define TIME_UNIT_HOUR 0x0004
601#define TIME_UNIT_DAY 0x0005
602#define TIME_UNIT_MASK 0x0007
603
William Lallemand421f5b52012-02-06 18:15:57 +0100604#define SEC 1
605#define MINUTE (60 * SEC)
606#define HOUR (60 * MINUTE)
607#define DAY (24 * HOUR)
608
Willy Tarreau126d4062013-12-03 17:50:47 +0100609/*
610 * Parse binary string written in hexadecimal (source) and store the decoded
Ilya Shipitsin77e3b4a2020-03-10 12:06:11 +0500611 * result into binstr and set binstrlen to the length of binstr. Memory for
Willy Tarreau126d4062013-12-03 17:50:47 +0100612 * binstr is allocated by the function. In case of error, returns 0 with an
613 * error message in err.
614 */
615int parse_binary(const char *source, char **binstr, int *binstrlen, char **err);
616
Willy Tarreau946ba592009-05-10 15:41:18 +0200617/* copies at most <n> characters from <src> and always terminates with '\0' */
618char *my_strndup(const char *src, int n);
619
Baptiste Assmannbb77c8e2013-10-06 23:24:13 +0200620/*
621 * search needle in haystack
622 * returns the pointer if found, returns NULL otherwise
623 */
624const void *my_memmem(const void *, size_t, const void *, size_t);
625
Christopher Faulet5eb96cb2020-04-15 10:23:01 +0200626/* get length of the initial segment consiting entirely of bytes within a given
627 * mask
628 */
629size_t my_memspn(const void *, size_t, const void *, size_t);
630
631/* get length of the initial segment consiting entirely of bytes not within a
632 * given mask
633 */
634size_t my_memcspn(const void *, size_t, const void *, size_t);
635
Willy Tarreau482b00d2009-10-04 22:48:42 +0200636/* This function returns the first unused key greater than or equal to <key> in
637 * ID tree <root>. Zero is returned if no place is found.
638 */
639unsigned int get_next_id(struct eb_root *root, unsigned int key);
640
Willy Tarreau9c1e15d2017-11-15 18:51:29 +0100641/* dump the full tree to <file> in DOT format for debugging purposes. Will
642 * optionally highlight node <subj> if found, depending on operation <op> :
643 * 0 : nothing
644 * >0 : insertion, node/leaf are surrounded in red
645 * <0 : removal, node/leaf are dashed with no background
646 * Will optionally add "desc" as a label on the graph if set and non-null.
647 */
648void eb32sc_to_file(FILE *file, struct eb_root *root, const struct eb32sc_node *subj,
649 int op, const char *desc);
Willy Tarreaued3cda02017-11-15 15:04:05 +0100650
Willy Tarreau348238b2010-01-18 15:05:57 +0100651/* This function compares a sample word possibly followed by blanks to another
652 * clean word. The compare is case-insensitive. 1 is returned if both are equal,
653 * otherwise zero. This intends to be used when checking HTTP headers for some
654 * values.
655 */
656int word_match(const char *sample, int slen, const char *word, int wlen);
657
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200658/* Convert a fixed-length string to an IP address. Returns 0 in case of error,
659 * or the number of chars read in case of success.
660 */
661int buf2ip(const char *buf, size_t len, struct in_addr *dst);
Thierry FOURNIERd559dd82013-11-22 16:16:59 +0100662int buf2ip6(const char *buf, size_t len, struct in6_addr *dst);
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200663
Willy Tarreauacf95772010-06-14 19:09:21 +0200664/* To be used to quote config arg positions. Returns the string at <ptr>
665 * surrounded by simple quotes if <ptr> is valid and non-empty, or "end of line"
666 * if ptr is NULL or empty. The string is locally allocated.
667 */
668const char *quote_arg(const char *ptr);
669
Willy Tarreau5b180202010-07-18 10:40:48 +0200670/* returns an operator among STD_OP_* for string <str> or < 0 if unknown */
671int get_std_op(const char *str);
672
Willy Tarreau422a0a52012-10-26 19:47:23 +0200673/* sets the address family to AF_UNSPEC so that is_addr() does not match */
674static inline void clear_addr(struct sockaddr_storage *addr)
675{
676 addr->ss_family = AF_UNSPEC;
677}
678
David du Colombier6f5ccb12011-03-10 22:26:24 +0100679/* returns non-zero if addr has a valid and non-null IPv4 or IPv6 address,
680 * otherwise zero.
681 */
Willy Tarreau18ca2d42014-05-09 22:40:55 +0200682static inline int is_inet_addr(const struct sockaddr_storage *addr)
David du Colombier6f5ccb12011-03-10 22:26:24 +0100683{
684 int i;
685
686 switch (addr->ss_family) {
687 case AF_INET:
David du Colombier64e9c902011-03-22 11:39:41 +0100688 return *(int *)&((struct sockaddr_in *)addr)->sin_addr;
David du Colombier6f5ccb12011-03-10 22:26:24 +0100689 case AF_INET6:
690 for (i = 0; i < sizeof(struct in6_addr) / sizeof(int); i++)
691 if (((int *)&((struct sockaddr_in6 *)addr)->sin6_addr)[i] != 0)
692 return ((int *)&((struct sockaddr_in6 *)addr)->sin6_addr)[i];
693 }
694 return 0;
695}
696
Willy Tarreau18ca2d42014-05-09 22:40:55 +0200697/* returns non-zero if addr has a valid and non-null IPv4 or IPv6 address,
698 * or is a unix address, otherwise returns zero.
699 */
700static inline int is_addr(const struct sockaddr_storage *addr)
701{
William Lallemand2fe7dd02018-09-11 16:51:29 +0200702 if (addr->ss_family == AF_UNIX || addr->ss_family == AF_CUST_SOCKPAIR)
Willy Tarreau18ca2d42014-05-09 22:40:55 +0200703 return 1;
704 else
705 return is_inet_addr(addr);
706}
707
David du Colombier11bcb6c2011-03-24 12:23:00 +0100708/* returns port in network byte order */
709static inline int get_net_port(struct sockaddr_storage *addr)
710{
711 switch (addr->ss_family) {
712 case AF_INET:
713 return ((struct sockaddr_in *)addr)->sin_port;
714 case AF_INET6:
715 return ((struct sockaddr_in6 *)addr)->sin6_port;
716 }
717 return 0;
718}
719
720/* returns port in host byte order */
721static inline int get_host_port(struct sockaddr_storage *addr)
722{
723 switch (addr->ss_family) {
724 case AF_INET:
725 return ntohs(((struct sockaddr_in *)addr)->sin_port);
726 case AF_INET6:
727 return ntohs(((struct sockaddr_in6 *)addr)->sin6_port);
728 }
729 return 0;
730}
731
Willy Tarreau1b4b7ce2011-04-05 16:56:50 +0200732/* returns address len for <addr>'s family, 0 for unknown families */
733static inline int get_addr_len(const struct sockaddr_storage *addr)
734{
735 switch (addr->ss_family) {
736 case AF_INET:
737 return sizeof(struct sockaddr_in);
738 case AF_INET6:
739 return sizeof(struct sockaddr_in6);
740 case AF_UNIX:
741 return sizeof(struct sockaddr_un);
742 }
743 return 0;
744}
745
David du Colombier11bcb6c2011-03-24 12:23:00 +0100746/* set port in host byte order */
747static inline int set_net_port(struct sockaddr_storage *addr, int port)
748{
749 switch (addr->ss_family) {
750 case AF_INET:
751 ((struct sockaddr_in *)addr)->sin_port = port;
Willy Tarreau4c0fcc22018-09-20 10:48:35 +0200752 break;
David du Colombier11bcb6c2011-03-24 12:23:00 +0100753 case AF_INET6:
754 ((struct sockaddr_in6 *)addr)->sin6_port = port;
Willy Tarreau4c0fcc22018-09-20 10:48:35 +0200755 break;
David du Colombier11bcb6c2011-03-24 12:23:00 +0100756 }
757 return 0;
758}
759
760/* set port in network byte order */
761static inline int set_host_port(struct sockaddr_storage *addr, int port)
762{
763 switch (addr->ss_family) {
764 case AF_INET:
765 ((struct sockaddr_in *)addr)->sin_port = htons(port);
Willy Tarreau4c0fcc22018-09-20 10:48:35 +0200766 break;
David du Colombier11bcb6c2011-03-24 12:23:00 +0100767 case AF_INET6:
768 ((struct sockaddr_in6 *)addr)->sin6_port = htons(port);
Willy Tarreau4c0fcc22018-09-20 10:48:35 +0200769 break;
David du Colombier11bcb6c2011-03-24 12:23:00 +0100770 }
771 return 0;
772}
773
Thierry Fournier70473a52016-02-17 17:12:14 +0100774/* Convert mask from bit length form to in_addr form.
775 * This function never fails.
776 */
777void len2mask4(int len, struct in_addr *addr);
778
779/* Convert mask from bit length form to in6_addr form.
780 * This function never fails.
781 */
782void len2mask6(int len, struct in6_addr *addr);
783
David du Colombier4f92d322011-03-24 11:09:31 +0100784/* Return true if IPv4 address is part of the network */
Willy Tarreaueec1d382016-07-13 11:59:39 +0200785extern 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 +0100786
787/* Return true if IPv6 address is part of the network */
Willy Tarreaueec1d382016-07-13 11:59:39 +0200788extern 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 +0100789
Joseph Herlant32b83272018-11-15 11:58:28 -0800790/* Map IPv4 address on IPv6 address, as specified in RFC 3513. */
David du Colombier4f92d322011-03-24 11:09:31 +0100791extern void v4tov6(struct in6_addr *sin6_addr, struct in_addr *sin_addr);
792
Joseph Herlant32b83272018-11-15 11:58:28 -0800793/* Map IPv6 address on IPv4 address, as specified in RFC 3513.
David du Colombier4f92d322011-03-24 11:09:31 +0100794 * Return true if conversion is possible and false otherwise.
795 */
796extern int v6tov4(struct in_addr *sin_addr, struct in6_addr *sin6_addr);
797
Baptiste Assmann08b24cf2016-01-23 23:39:12 +0100798/* compare two struct sockaddr_storage and return:
799 * 0 (true) if the addr is the same in both
800 * 1 (false) if the addr is not the same in both
801 */
802int ipcmp(struct sockaddr_storage *ss1, struct sockaddr_storage *ss2);
803
Baptiste Assmann08396c82016-01-31 00:27:17 +0100804/* copy ip from <source> into <dest>
805 * the caller must clear <dest> before calling.
806 * Returns a pointer to the destination
807 */
808struct sockaddr_storage *ipcpy(struct sockaddr_storage *source, struct sockaddr_storage *dest);
809
William Lallemand421f5b52012-02-06 18:15:57 +0100810char *human_time(int t, short hz_div);
811
812extern const char *monthname[];
813
814/* date2str_log: write a date in the format :
815 * sprintf(str, "%02d/%s/%04d:%02d:%02d:%02d.%03d",
816 * tm.tm_mday, monthname[tm.tm_mon], tm.tm_year+1900,
817 * tm.tm_hour, tm.tm_min, tm.tm_sec, (int)date.tv_usec/1000);
818 *
819 * without using sprintf. return a pointer to the last char written (\0) or
820 * NULL if there isn't enough space.
821 */
Willy Tarreauf16cb412018-09-04 19:08:48 +0200822char *date2str_log(char *dest, const struct tm *tm, const struct timeval *date, size_t size);
William Lallemand421f5b52012-02-06 18:15:57 +0100823
Benoit GARNIERb413c2a2016-03-27 11:08:03 +0200824/* Return the GMT offset for a specific local time.
Benoit GARNIERe2e5bde2016-03-27 03:04:16 +0200825 * Both t and tm must represent the same time.
Benoit GARNIERb413c2a2016-03-27 11:08:03 +0200826 * The string returned has the same format as returned by strftime(... "%z", tm).
827 * Offsets are kept in an internal cache for better performances.
828 */
Benoit GARNIERe2e5bde2016-03-27 03:04:16 +0200829const char *get_gmt_offset(time_t t, struct tm *tm);
Benoit GARNIERb413c2a2016-03-27 11:08:03 +0200830
William Lallemand421f5b52012-02-06 18:15:57 +0100831/* gmt2str_log: write a date in the format :
832 * "%02d/%s/%04d:%02d:%02d:%02d +0000" without using snprintf
833 * return a pointer to the last char written (\0) or
834 * NULL if there isn't enough space.
835 */
836char *gmt2str_log(char *dst, struct tm *tm, size_t size);
837
Yuxans Yao4e25b012012-10-19 10:36:09 +0800838/* localdate2str_log: write a date in the format :
839 * "%02d/%s/%04d:%02d:%02d:%02d +0000(local timezone)" without using snprintf
Benoit GARNIERe2e5bde2016-03-27 03:04:16 +0200840 * Both t and tm must represent the same time.
Yuxans Yao4e25b012012-10-19 10:36:09 +0800841 * return a pointer to the last char written (\0) or
842 * NULL if there isn't enough space.
843 */
Benoit GARNIERe2e5bde2016-03-27 03:04:16 +0200844char *localdate2str_log(char *dst, time_t t, struct tm *tm, size_t size);
Yuxans Yao4e25b012012-10-19 10:36:09 +0800845
Thierry Fournier93127942016-01-20 18:49:45 +0100846/* These 3 functions parses date string and fills the
Ilya Shipitsin77e3b4a2020-03-10 12:06:11 +0500847 * corresponding broken-down time in <tm>. In success case,
Thierry Fournier93127942016-01-20 18:49:45 +0100848 * it returns 1, otherwise, it returns 0.
849 */
850int parse_http_date(const char *date, int len, struct tm *tm);
851int parse_imf_date(const char *date, int len, struct tm *tm);
852int parse_rfc850_date(const char *date, int len, struct tm *tm);
853int parse_asctime_date(const char *date, int len, struct tm *tm);
854
Willy Tarreau9a7bea52012-04-27 11:16:50 +0200855/* Dynamically allocates a string of the proper length to hold the formatted
856 * output. NULL is returned on error. The caller is responsible for freeing the
857 * memory area using free(). The resulting string is returned in <out> if the
858 * pointer is not NULL. A previous version of <out> might be used to build the
859 * new string, and it will be freed before returning if it is not NULL, which
860 * makes it possible to build complex strings from iterative calls without
861 * having to care about freeing intermediate values, as in the example below :
862 *
863 * memprintf(&err, "invalid argument: '%s'", arg);
864 * ...
865 * memprintf(&err, "parser said : <%s>\n", *err);
866 * ...
867 * free(*err);
868 *
869 * This means that <err> must be initialized to NULL before first invocation.
870 * The return value also holds the allocated string, which eases error checking
871 * and immediate consumption. If the output pointer is not used, NULL must be
Willy Tarreaueb6cead2012-09-20 19:43:14 +0200872 * passed instead and it will be ignored. The returned message will then also
873 * be NULL so that the caller does not have to bother with freeing anything.
Willy Tarreau9a7bea52012-04-27 11:16:50 +0200874 *
875 * It is also convenient to use it without any free except the last one :
876 * err = NULL;
877 * if (!fct1(err)) report(*err);
878 * if (!fct2(err)) report(*err);
879 * if (!fct3(err)) report(*err);
880 * free(*err);
Christopher Faulet93a518f2017-10-24 11:25:33 +0200881 *
882 * memprintf relies on memvprintf. This last version can be called from any
883 * function with variadic arguments.
Willy Tarreau9a7bea52012-04-27 11:16:50 +0200884 */
Christopher Faulet93a518f2017-10-24 11:25:33 +0200885char *memvprintf(char **out, const char *format, va_list args)
886 __attribute__ ((format(printf, 2, 0)));
887
Willy Tarreau9a7bea52012-04-27 11:16:50 +0200888char *memprintf(char **out, const char *format, ...)
889 __attribute__ ((format(printf, 2, 3)));
890
Willy Tarreau21c705b2012-09-14 11:40:36 +0200891/* Used to add <level> spaces before each line of <out>, unless there is only one line.
892 * The input argument is automatically freed and reassigned. The result will have to be
893 * freed by the caller.
894 * Example of use :
895 * parse(cmd, &err); (callee: memprintf(&err, ...))
896 * fprintf(stderr, "Parser said: %s\n", indent_error(&err));
897 * free(err);
898 */
899char *indent_msg(char **out, int level);
Willy Tarreaua2c99112019-08-21 13:17:37 +0200900int append_prefixed_str(struct buffer *out, const char *in, const char *pfx, char eol, int first);
Willy Tarreau3d2f16f2012-05-13 00:21:17 +0200901
Willy Tarreau9d22e562019-03-29 18:49:09 +0100902/* removes environment variable <name> from the environment as found in
903 * environ. This is only provided as an alternative for systems without
904 * unsetenv() (old Solaris and AIX versions). THIS IS NOT THREAD SAFE.
Ilya Shipitsin77e3b4a2020-03-10 12:06:11 +0500905 * The principle is to scan environ for each occurrence of variable name
Willy Tarreau9d22e562019-03-29 18:49:09 +0100906 * <name> and to replace the matching pointers with the last pointer of
907 * the array (since variables are not ordered).
908 * It always returns 0 (success).
909 */
910int my_unsetenv(const char *name);
911
Willy Tarreaudad36a32013-03-11 01:20:04 +0100912/* Convert occurrences of environment variables in the input string to their
913 * corresponding value. A variable is identified as a series of alphanumeric
914 * characters or underscores following a '$' sign. The <in> string must be
915 * free()able. NULL returns NULL. The resulting string might be reallocated if
916 * some expansion is made.
917 */
918char *env_expand(char *in);
919
Willy Tarreau3d2f16f2012-05-13 00:21:17 +0200920/* debugging macro to emit messages using write() on fd #-1 so that strace sees
921 * them.
922 */
923#define fddebug(msg...) do { char *_m = NULL; memprintf(&_m, ##msg); if (_m) write(-1, _m, strlen(_m)); free(_m); } while (0)
924
Willy Tarreau0ebb5112016-12-05 00:10:57 +0100925/* displays a <len> long memory block at <buf>, assuming first byte of <buf>
Willy Tarreaued936c52017-04-27 18:03:20 +0200926 * has address <baseaddr>. String <pfx> may be placed as a prefix in front of
927 * each line. It may be NULL if unused. The output is emitted to file <out>.
Willy Tarreau0ebb5112016-12-05 00:10:57 +0100928 */
Willy Tarreaued936c52017-04-27 18:03:20 +0200929void debug_hexdump(FILE *out, const char *pfx, const char *buf, unsigned int baseaddr, int len);
Willy Tarreau0ebb5112016-12-05 00:10:57 +0100930
Willy Tarreau9eebd8a2019-08-08 16:53:40 +0200931/* this is used to emit call traces when building with TRACE=1 */
Willy Tarreau12963822017-10-24 10:54:08 +0200932__attribute__((format(printf, 1, 2)))
Willy Tarreau9eebd8a2019-08-08 16:53:40 +0200933void calltrace(char *fmt, ...);
Willy Tarreau12963822017-10-24 10:54:08 +0200934
de Lafond Guillaume88c278f2013-04-15 19:27:10 +0200935/* same as strstr() but case-insensitive */
936const char *strnistr(const char *str1, int len_str1, const char *str2, int len_str2);
937
Willy Tarreauab813a42018-09-10 18:41:28 +0200938/* after increasing a pointer value, it can exceed the first buffer
939 * size. This function transform the value of <ptr> according with
940 * the expected position. <chunks> is an array of the one or two
Joseph Herlant32b83272018-11-15 11:58:28 -0800941 * available chunks. The first value is the start of the first chunk,
Willy Tarreauab813a42018-09-10 18:41:28 +0200942 * the second value if the end+1 of the first chunks. The third value
943 * is NULL or the start of the second chunk and the fourth value is
944 * the end+1 of the second chunk. The function returns 1 if does a
945 * wrap, else returns 0.
946 */
947static inline int fix_pointer_if_wrap(const char **chunks, const char **ptr)
948{
949 if (*ptr < chunks[1])
950 return 0;
951 if (!chunks[2])
952 return 0;
953 *ptr = chunks[2] + ( *ptr - chunks[1] );
954 return 1;
955}
Willy Tarreaubb519c72014-01-28 23:04:39 +0100956
957/************************* Composite address manipulation *********************
958 * Composite addresses are simply unsigned long data in which the higher bits
959 * represent a pointer, and the two lower bits are flags. There are several
960 * places where we just want to associate one or two flags to a pointer (eg,
961 * to type it), and these functions permit this. The pointer is necessarily a
962 * 32-bit aligned pointer, as its two lower bits will be cleared and replaced
963 * with the flags.
964 *****************************************************************************/
965
966/* Masks the two lower bits of a composite address and converts it to a
967 * pointer. This is used to mix some bits with some aligned pointers to
968 * structs and to retrieve the original (32-bit aligned) pointer.
969 */
970static inline void *caddr_to_ptr(unsigned long caddr)
971{
972 return (void *)(caddr & ~3UL);
973}
974
975/* Only retrieves the two lower bits of a composite address. This is used to mix
976 * some bits with some aligned pointers to structs and to retrieve the original
977 * data (2 bits).
978 */
979static inline unsigned int caddr_to_data(unsigned long caddr)
980{
981 return (caddr & 3UL);
982}
983
984/* Combines the aligned pointer whose 2 lower bits will be masked with the bits
985 * from <data> to form a composite address. This is used to mix some bits with
986 * some aligned pointers to structs and to retrieve the original (32-bit aligned)
987 * pointer.
988 */
989static inline unsigned long caddr_from_ptr(void *ptr, unsigned int data)
990{
991 return (((unsigned long)ptr) & ~3UL) + (data & 3);
992}
993
994/* sets the 2 bits of <data> in the <caddr> composite address */
995static inline unsigned long caddr_set_flags(unsigned long caddr, unsigned int data)
996{
997 return caddr | (data & 3);
998}
999
1000/* clears the 2 bits of <data> in the <caddr> composite address */
1001static inline unsigned long caddr_clr_flags(unsigned long caddr, unsigned int data)
1002{
1003 return caddr & ~(unsigned long)(data & 3);
1004}
1005
Thierry FOURNIER317e1c42014-08-12 10:20:47 +02001006/* UTF-8 decoder status */
1007#define UTF8_CODE_OK 0x00
1008#define UTF8_CODE_OVERLONG 0x10
1009#define UTF8_CODE_INVRANGE 0x20
1010#define UTF8_CODE_BADSEQ 0x40
1011
1012unsigned char utf8_next(const char *s, int len, unsigned int *c);
1013
1014static inline unsigned char utf8_return_code(unsigned int code)
1015{
1016 return code & 0xf0;
1017}
1018
1019static inline unsigned char utf8_return_length(unsigned char code)
1020{
1021 return code & 0x0f;
1022}
1023
Willy Tarreaue6e49cf2015-04-29 17:13:35 +02001024/* returns a 64-bit a timestamp with the finest resolution available. The
1025 * unit is intentionally not specified. It's mostly used to compare dates.
1026 */
1027#if defined(__i386__) || defined(__x86_64__)
1028static inline unsigned long long rdtsc()
1029{
1030 unsigned int a, d;
1031 asm volatile("rdtsc" : "=a" (a), "=d" (d));
1032 return a + ((unsigned long long)d << 32);
1033}
1034#else
1035static inline unsigned long long rdtsc()
1036{
1037 struct timeval tv;
1038 gettimeofday(&tv, NULL);
1039 return tv.tv_sec * 1000000 + tv.tv_usec;
1040}
1041#endif
1042
Maxime de Roucydc887852016-05-13 23:52:54 +02001043/* append a copy of string <str> (in a wordlist) at the end of the list <li>
1044 * On failure : return 0 and <err> filled with an error message.
1045 * The caller is responsible for freeing the <err> and <str> copy
1046 * memory area using free()
1047 */
1048struct list;
1049int list_append_word(struct list *li, const char *str, char **err);
1050
Willy Tarreau83061a82018-07-13 11:56:34 +02001051int dump_text(struct buffer *out, const char *buf, int bsize);
1052int dump_binary(struct buffer *out, const char *buf, int bsize);
1053int dump_text_line(struct buffer *out, const char *buf, int bsize, int len,
Willy Tarreau97c2ae12016-11-22 18:00:20 +01001054 int *line, int ptr);
Willy Tarreau762fb3e2020-03-03 15:57:10 +01001055void dump_addr_and_bytes(struct buffer *buf, const char *pfx, const void *addr, int n);
Willy Tarreau37101052019-05-20 16:48:20 +02001056void dump_hex(struct buffer *out, const char *pfx, const void *buf, int len, int unsafe);
1057int may_access(const void *ptr);
Willy Tarreaueb8b1ca2020-03-03 17:09:08 +01001058void *resolve_sym_name(struct buffer *buf, const char *pfx, void *addr);
Willy Tarreaubb869862020-04-16 10:52:41 +02001059const char *get_exec_path();
Willy Tarreau97c2ae12016-11-22 18:00:20 +01001060
Willy Tarreau13faf162020-03-04 07:44:06 +01001061#if defined(USE_BACKTRACE)
1062/* Note that this may result in opening libgcc() on first call, so it may need
1063 * to have been called once before chrooting.
1064 */
1065static forceinline int my_backtrace(void **buffer, int max)
1066{
1067#ifdef HA_HAVE_WORKING_BACKTRACE
1068 return backtrace(buffer, max);
1069#else
1070 const struct frame {
1071 const struct frame *next;
1072 void *ra;
1073 } *frame;
1074 int count;
1075
1076 frame = __builtin_frame_address(0);
1077 for (count = 0; count < max && may_access(frame) && may_access(frame->ra);) {
1078 buffer[count++] = frame->ra;
1079 frame = frame->next;
1080 }
1081 return count;
1082#endif
1083}
1084#endif
1085
Hubert Verstraete2eae3a02016-06-28 22:41:00 +02001086/* same as realloc() except that ptr is also freed upon failure */
1087static inline void *my_realloc2(void *ptr, size_t size)
1088{
1089 void *ret;
1090
1091 ret = realloc(ptr, size);
1092 if (!ret && size)
1093 free(ptr);
1094 return ret;
1095}
1096
Frédéric Lécaille3b717162019-02-25 15:04:22 +01001097int parse_dotted_uints(const char *s, unsigned int **nums, size_t *sz);
1098
Willy Tarreau52bf8392020-03-08 00:42:37 +01001099/* PRNG */
Willy Tarreauee3bcdd2020-03-08 17:48:17 +01001100void ha_generate_uuid(struct buffer *output);
Willy Tarreau52bf8392020-03-08 00:42:37 +01001101void ha_random_seed(const unsigned char *seed, size_t len);
1102void ha_random_jump96(uint32_t dist);
1103uint64_t ha_random64();
1104
1105static inline uint32_t ha_random32()
1106{
1107 return ha_random64() >> 32;
1108}
1109
1110static inline int32_t ha_random()
1111{
1112 return ha_random32() >> 1;
1113}
1114
Lukas Tribusdcbc5c52016-09-12 21:42:07 +00001115/* HAP_STRING() makes a string from a literal while HAP_XSTRING() first
1116 * evaluates the argument and is suited to pass macros.
1117 *
1118 * They allow macros like PCRE_MAJOR to be defined without quotes, which
1119 * is convenient for applications that want to test its value.
1120 */
1121#define HAP_STRING(...) #__VA_ARGS__
1122#define HAP_XSTRING(...) HAP_STRING(__VA_ARGS__)
1123
Willy Tarreau2dd0d472006-06-29 17:53:05 +02001124#endif /* _COMMON_STANDARD_H */