blob: dbb219a09c6500d335507195bf989b9085adefd7 [file] [log] [blame]
Willy Tarreaubaaee002006-06-26 02:48:02 +02001/*
Willy Tarreaucc05fba2009-10-27 21:40:18 +01002 * include/common/standard.h
3 * This files contains some general purpose functions and macros.
4 *
Willy Tarreau348238b2010-01-18 15:05:57 +01005 * Copyright (C) 2000-2010 Willy Tarreau - w@1wt.eu
Willy Tarreaucc05fba2009-10-27 21:40:18 +01006 *
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation, version 2.1
10 * exclusively.
11 *
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with this library; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 */
Willy Tarreaubaaee002006-06-26 02:48:02 +020021
Willy Tarreau2dd0d472006-06-29 17:53:05 +020022#ifndef _COMMON_STANDARD_H
23#define _COMMON_STANDARD_H
Willy Tarreaubaaee002006-06-26 02:48:02 +020024
Willy Tarreau167d8b52007-04-09 22:16:12 +020025#include <limits.h>
Willy Tarreau050737f2010-01-14 11:40:12 +010026#include <string.h>
Willy Tarreaufe944602007-10-25 10:34:16 +020027#include <time.h>
Willy Tarreau938b3032007-05-10 06:39:03 +020028#include <sys/types.h>
Willy Tarreaud50265a2012-09-04 14:18:33 +020029#include <sys/socket.h>
Willy Tarreaudd2f85e2012-09-02 22:34:23 +020030#include <sys/un.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020031#include <netinet/in.h>
Willy Tarreaue3ba5f02006-06-29 18:54:54 +020032#include <common/config.h>
Willy Tarreau45cb4fb2009-10-26 21:10:04 +010033#include <eb32tree.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020034
William Lallemande7340ec2012-01-24 11:15:39 +010035#ifndef LLONG_MAX
36# define LLONG_MAX 9223372036854775807LL
37# define LLONG_MIN (-LLONG_MAX - 1LL)
38#endif
39
40#ifndef ULLONG_MAX
41# define ULLONG_MAX (LLONG_MAX * 2ULL + 1)
42#endif
43
44
Willy Tarreaubaaee002006-06-26 02:48:02 +020045/****** string-specific macros and functions ******/
46/* if a > max, then bound <a> to <max>. The macro returns the new <a> */
47#define UBOUND(a, max) ({ typeof(a) b = (max); if ((a) > b) (a) = b; (a); })
48
49/* if a < min, then bound <a> to <min>. The macro returns the new <a> */
50#define LBOUND(a, min) ({ typeof(a) b = (min); if ((a) < b) (a) = b; (a); })
51
52/* returns 1 only if only zero or one bit is set in X, which means that X is a
53 * power of 2, and 0 otherwise */
54#define POWEROF2(x) (((x) & ((x)-1)) == 0)
55
Willy Tarreau5b180202010-07-18 10:40:48 +020056/* operators to compare values. They're ordered that way so that the lowest bit
57 * serves as a negation for the test and contains all tests that are not equal.
58 */
59enum {
60 STD_OP_LE = 0, STD_OP_GT = 1,
61 STD_OP_EQ = 2, STD_OP_NE = 3,
62 STD_OP_GE = 4, STD_OP_LT = 5,
63};
64
Willy Tarreau7d58a632007-01-13 23:06:06 +010065/*
Willy Tarreaubaaee002006-06-26 02:48:02 +020066 * copies at most <size-1> chars from <src> to <dst>. Last char is always
67 * set to 0, unless <size> is 0. The number of chars copied is returned
68 * (excluding the terminating zero).
69 * This code has been optimized for size and speed : on x86, it's 45 bytes
70 * long, uses only registers, and consumes only 4 cycles per char.
71 */
72extern int strlcpy2(char *dst, const char *src, int size);
73
74/*
Willy Tarreau72d759c2007-10-25 12:14:10 +020075 * This function simply returns a locally allocated string containing
Willy Tarreaubaaee002006-06-26 02:48:02 +020076 * the ascii representation for number 'n' in decimal.
77 */
Willy Tarreaue7239b52009-03-29 13:41:58 +020078extern char itoa_str[][171];
Emeric Brun3a7fce52010-01-04 14:54:38 +010079extern char *ultoa_r(unsigned long n, char *buffer, int size);
Willy Tarreaue7239b52009-03-29 13:41:58 +020080extern const char *ulltoh_r(unsigned long long n, char *buffer, int size);
Willy Tarreau72d759c2007-10-25 12:14:10 +020081static inline const char *ultoa(unsigned long n)
82{
83 return ultoa_r(n, itoa_str[0], sizeof(itoa_str[0]));
84}
85
William Lallemande7340ec2012-01-24 11:15:39 +010086/*
87 * unsigned long long ASCII representation
88 *
89 * return the last char '\0' or NULL if no enough
90 * space in dst
91 */
92char *ulltoa(unsigned long long n, char *dst, size_t size);
93
94
95/*
96 * unsigned long ASCII representation
97 *
98 * return the last char '\0' or NULL if no enough
99 * space in dst
100 */
101char *ultoa_o(unsigned long n, char *dst, size_t size);
102
103/*
104 * signed long ASCII representation
105 *
106 * return the last char '\0' or NULL if no enough
107 * space in dst
108 */
109char *ltoa_o(long int n, char *dst, size_t size);
110
111/*
112 * signed long long ASCII representation
113 *
114 * return the last char '\0' or NULL if no enough
115 * space in dst
116 */
117char *lltoa(long long n, char *dst, size_t size);
118
119/*
120 * write a ascii representation of a unsigned into dst,
121 * return a pointer to the last character
122 * Pad the ascii representation with '0', using size.
123 */
124char *utoa_pad(unsigned int n, char *dst, size_t size);
125
Willy Tarreau72d759c2007-10-25 12:14:10 +0200126/* Fast macros to convert up to 10 different parameters inside a same call of
127 * expression.
128 */
129#define U2A0(n) ({ ultoa_r((n), itoa_str[0], sizeof(itoa_str[0])); })
130#define U2A1(n) ({ ultoa_r((n), itoa_str[1], sizeof(itoa_str[1])); })
131#define U2A2(n) ({ ultoa_r((n), itoa_str[2], sizeof(itoa_str[2])); })
132#define U2A3(n) ({ ultoa_r((n), itoa_str[3], sizeof(itoa_str[3])); })
133#define U2A4(n) ({ ultoa_r((n), itoa_str[4], sizeof(itoa_str[4])); })
134#define U2A5(n) ({ ultoa_r((n), itoa_str[5], sizeof(itoa_str[5])); })
135#define U2A6(n) ({ ultoa_r((n), itoa_str[6], sizeof(itoa_str[6])); })
136#define U2A7(n) ({ ultoa_r((n), itoa_str[7], sizeof(itoa_str[7])); })
137#define U2A8(n) ({ ultoa_r((n), itoa_str[8], sizeof(itoa_str[8])); })
138#define U2A9(n) ({ ultoa_r((n), itoa_str[9], sizeof(itoa_str[9])); })
Willy Tarreaubaaee002006-06-26 02:48:02 +0200139
Willy Tarreaue7239b52009-03-29 13:41:58 +0200140/* The same macros provide HTML encoding of numbers */
141#define U2H0(n) ({ ulltoh_r((n), itoa_str[0], sizeof(itoa_str[0])); })
142#define U2H1(n) ({ ulltoh_r((n), itoa_str[1], sizeof(itoa_str[1])); })
143#define U2H2(n) ({ ulltoh_r((n), itoa_str[2], sizeof(itoa_str[2])); })
144#define U2H3(n) ({ ulltoh_r((n), itoa_str[3], sizeof(itoa_str[3])); })
145#define U2H4(n) ({ ulltoh_r((n), itoa_str[4], sizeof(itoa_str[4])); })
146#define U2H5(n) ({ ulltoh_r((n), itoa_str[5], sizeof(itoa_str[5])); })
147#define U2H6(n) ({ ulltoh_r((n), itoa_str[6], sizeof(itoa_str[6])); })
148#define U2H7(n) ({ ulltoh_r((n), itoa_str[7], sizeof(itoa_str[7])); })
149#define U2H8(n) ({ ulltoh_r((n), itoa_str[8], sizeof(itoa_str[8])); })
150#define U2H9(n) ({ ulltoh_r((n), itoa_str[9], sizeof(itoa_str[9])); })
151
Willy Tarreaubaaee002006-06-26 02:48:02 +0200152/*
Willy Tarreau91092e52007-10-25 16:58:42 +0200153 * This function simply returns a locally allocated string containing the ascii
154 * representation for number 'n' in decimal, unless n is 0 in which case it
155 * returns the alternate string (or an empty string if the alternate string is
156 * NULL). It use is intended for limits reported in reports, where it's
157 * desirable not to display anything if there is no limit. Warning! it shares
158 * the same vector as ultoa_r().
159 */
160extern const char *limit_r(unsigned long n, char *buffer, int size, const char *alt);
161
162/* Fast macros to convert up to 10 different parameters inside a same call of
163 * expression. Warning! they share the same vectors as U2A*!
164 */
165#define LIM2A0(n, alt) ({ limit_r((n), itoa_str[0], sizeof(itoa_str[0]), (alt)); })
166#define LIM2A1(n, alt) ({ limit_r((n), itoa_str[1], sizeof(itoa_str[1]), (alt)); })
167#define LIM2A2(n, alt) ({ limit_r((n), itoa_str[2], sizeof(itoa_str[2]), (alt)); })
168#define LIM2A3(n, alt) ({ limit_r((n), itoa_str[3], sizeof(itoa_str[3]), (alt)); })
169#define LIM2A4(n, alt) ({ limit_r((n), itoa_str[4], sizeof(itoa_str[4]), (alt)); })
170#define LIM2A5(n, alt) ({ limit_r((n), itoa_str[5], sizeof(itoa_str[5]), (alt)); })
171#define LIM2A6(n, alt) ({ limit_r((n), itoa_str[6], sizeof(itoa_str[6]), (alt)); })
172#define LIM2A7(n, alt) ({ limit_r((n), itoa_str[7], sizeof(itoa_str[7]), (alt)); })
173#define LIM2A8(n, alt) ({ limit_r((n), itoa_str[8], sizeof(itoa_str[8]), (alt)); })
174#define LIM2A9(n, alt) ({ limit_r((n), itoa_str[9], sizeof(itoa_str[9]), (alt)); })
175
176/*
Willy Tarreaubaaee002006-06-26 02:48:02 +0200177 * Returns non-zero if character <s> is a hex digit (0-9, a-f, A-F), else zero.
178 */
179extern int ishex(char s);
180
181/*
Willy Tarreauda3b7c32009-11-02 20:12:52 +0100182 * Return integer equivalent of character <c> for a hex digit (0-9, a-f, A-F),
183 * otherwise -1.
184 */
185extern int hex2i(int c);
186
187/*
Willy Tarreau2e74c3f2007-12-02 18:45:09 +0100188 * Checks <name> for invalid characters. Valid chars are [A-Za-z0-9_:.-]. If an
189 * invalid character is found, a pointer to it is returned. If everything is
190 * fine, NULL is returned.
191 */
192extern const char *invalid_char(const char *name);
193
194/*
Krzysztof Piotr Oledzkiefe3b6f2008-05-23 23:49:32 +0200195 * Checks <domainname> for invalid characters. Valid chars are [A-Za-z0-9_.-].
196 * If an invalid character is found, a pointer to it is returned.
197 * If everything is fine, NULL is returned.
198 */
199extern const char *invalid_domainchar(const char *name);
200
201/*
Robert Tsai81ae1952007-12-05 10:47:29 +0100202 * converts <str> to a struct sockaddr_un* which is locally allocated.
203 * The format is "/path", where "/path" is a path to a UNIX domain socket.
204 */
Willy Tarreaucaf720d2008-03-07 10:07:04 +0100205struct sockaddr_un *str2sun(const char *str);
Robert Tsai81ae1952007-12-05 10:47:29 +0100206
207/*
Willy Tarreaufab5a432011-03-04 15:31:53 +0100208 * converts <str> to a struct sockaddr_storage* which is locally allocated. The
209 * string is assumed to contain only an address, no port. The address can be a
210 * dotted IPv4 address, an IPv6 address, a host name, or empty or "*" to
211 * indicate INADDR_ANY. NULL is returned if the host part cannot be resolved.
212 * The return address will only have the address family and the address set,
213 * all other fields remain zero. The string is not supposed to be modified.
214 * The IPv6 '::' address is IN6ADDR_ANY.
Willy Tarreaubaaee002006-06-26 02:48:02 +0200215 */
Willy Tarreaufab5a432011-03-04 15:31:53 +0100216struct sockaddr_storage *str2ip(const char *str);
Willy Tarreaubaaee002006-06-26 02:48:02 +0200217
218/*
Willy Tarreaufab5a432011-03-04 15:31:53 +0100219 * converts <str> to a locally allocated struct sockaddr_storage *.
220 * The format is "addr[:[port]]", where "addr" can be a dotted IPv4 address, an
221 * IPv6 address, a host name, or empty or "*" to indicate INADDR_ANY. If an IPv6
222 * address wants to ignore port, it must be terminated by a trailing colon (':').
223 * The IPv6 '::' address is IN6ADDR_ANY, so in order to bind to a given port on
224 * IPv6, use ":::port". NULL is returned if the host part cannot be resolved.
225 */
226struct sockaddr_storage *str2sa(const char *str);
227
228/*
229 * converts <str> to a locally allocated struct sockaddr_storage *, and a
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200230 * port range consisting in two integers. The low and high end are always set
231 * even if the port is unspecified, in which case (0,0) is returned. The low
Willy Tarreaufab5a432011-03-04 15:31:53 +0100232 * port is set in the sockaddr. Thus, it is enough to check the size of the
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200233 * returned range to know if an array must be allocated or not. The format is
Willy Tarreaufab5a432011-03-04 15:31:53 +0100234 * "addr[:[port[-port]]]", where "addr" can be a dotted IPv4 address, an IPv6
235 * address, a host name, or empty or "*" to indicate INADDR_ANY. If an IPv6
236 * address wants to ignore port, it must be terminated by a trailing colon (':').
237 * The IPv6 '::' address is IN6ADDR_ANY, so in order to bind to a given port on
238 * IPv6, use ":::port". NULL is returned if the host part cannot be resolved.
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200239 */
Willy Tarreaufab5a432011-03-04 15:31:53 +0100240struct sockaddr_storage *str2sa_range(const char *str, int *low, int *high);
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200241
Willy Tarreau2937c0d2010-01-26 17:36:17 +0100242/* converts <str> to a struct in_addr containing a network mask. It can be
243 * passed in dotted form (255.255.255.0) or in CIDR form (24). It returns 1
244 * if the conversion succeeds otherwise non-zero.
245 */
246int str2mask(const char *str, struct in_addr *mask);
247
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200248/*
Willy Tarreaud077a8e2007-05-08 18:28:09 +0200249 * converts <str> to two struct in_addr* which must be pre-allocated.
Willy Tarreaubaaee002006-06-26 02:48:02 +0200250 * The format is "addr[/mask]", where "addr" cannot be empty, and mask
251 * is optionnal and either in the dotted or CIDR notation.
252 * Note: "addr" can also be a hostname. Returns 1 if OK, 0 if error.
253 */
Willy Tarreaud077a8e2007-05-08 18:28:09 +0200254int str2net(const char *str, struct in_addr *addr, struct in_addr *mask);
Willy Tarreaubaaee002006-06-26 02:48:02 +0200255
Alexandre Cassen5eb1a902007-11-29 15:43:32 +0100256/*
Willy Tarreau6d20e282012-04-27 22:49:47 +0200257 * converts <str> to two struct in6_addr* which must be pre-allocated.
258 * The format is "addr[/mask]", where "addr" cannot be empty, and mask
259 * is an optionnal number of bits (128 being the default).
260 * Returns 1 if OK, 0 if error.
261 */
262int str62net(const char *str, struct in6_addr *addr, unsigned char *mask);
263
264/*
Willy Tarreau106f9792009-09-19 07:54:16 +0200265 * Parse IP address found in url.
266 */
David du Colombier6f5ccb12011-03-10 22:26:24 +0100267int url2ipv4(const char *addr, struct in_addr *dst);
Willy Tarreau106f9792009-09-19 07:54:16 +0200268
269/*
David du Colombier6f5ccb12011-03-10 22:26:24 +0100270 * Resolve destination server from URL. Convert <str> to a sockaddr_storage*.
Alexandre Cassen5eb1a902007-11-29 15:43:32 +0100271 */
David du Colombier6f5ccb12011-03-10 22:26:24 +0100272int url2sa(const char *url, int ulen, struct sockaddr_storage *addr);
Alexandre Cassen5eb1a902007-11-29 15:43:32 +0100273
Willy Tarreau631f01c2011-09-05 00:36:48 +0200274/* Tries to convert a sockaddr_storage address to text form. Upon success, the
275 * address family is returned so that it's easy for the caller to adapt to the
276 * output format. Zero is returned if the address family is not supported. -1
277 * is returned upon error, with errno set. AF_INET, AF_INET6 and AF_UNIX are
278 * supported.
279 */
280int addr_to_str(struct sockaddr_storage *addr, char *str, int size);
281
Willy Tarreaubaaee002006-06-26 02:48:02 +0200282/* will try to encode the string <string> replacing all characters tagged in
283 * <map> with the hexadecimal representation of their ASCII-code (2 digits)
284 * prefixed by <escape>, and will store the result between <start> (included)
285 * and <stop> (excluded), and will always terminate the string with a '\0'
286 * before <stop>. The position of the '\0' is returned if the conversion
287 * completes. If bytes are missing between <start> and <stop>, then the
288 * conversion will be incomplete and truncated. If <stop> <= <start>, the '\0'
289 * cannot even be stored so we return <start> without writing the 0.
290 * The input string must also be zero-terminated.
291 */
292extern const char hextab[];
293char *encode_string(char *start, char *stop,
294 const char escape, const fd_set *map,
295 const char *string);
296
Willy Tarreaubf9c2fc2011-05-31 18:06:18 +0200297/* Decode an URL-encoded string in-place. The resulting string might
298 * be shorter. If some forbidden characters are found, the conversion is
299 * aborted, the string is truncated before the issue and non-zero is returned,
300 * otherwise the operation returns non-zero indicating success.
301 */
302int url_decode(char *string);
303
Willy Tarreau6911fa42007-03-04 18:06:08 +0100304/* This one is 6 times faster than strtoul() on athlon, but does
305 * no check at all.
306 */
307static inline unsigned int __str2ui(const char *s)
308{
309 unsigned int i = 0;
310 while (*s) {
311 i = i * 10 - '0';
312 i += (unsigned char)*s++;
313 }
314 return i;
315}
316
317/* This one is 5 times faster than strtoul() on athlon with checks.
318 * It returns the value of the number composed of all valid digits read.
319 */
320static inline unsigned int __str2uic(const char *s)
321{
322 unsigned int i = 0;
323 unsigned int j;
324 while (1) {
325 j = (*s++) - '0';
326 if (j > 9)
327 break;
328 i *= 10;
329 i += j;
330 }
331 return i;
332}
333
334/* This one is 28 times faster than strtoul() on athlon, but does
335 * no check at all!
336 */
337static inline unsigned int __strl2ui(const char *s, int len)
338{
339 unsigned int i = 0;
340 while (len-- > 0) {
341 i = i * 10 - '0';
342 i += (unsigned char)*s++;
343 }
344 return i;
345}
346
347/* This one is 7 times faster than strtoul() on athlon with checks.
348 * It returns the value of the number composed of all valid digits read.
349 */
350static inline unsigned int __strl2uic(const char *s, int len)
351{
352 unsigned int i = 0;
Willy Tarreau3f0c9762007-10-25 09:42:24 +0200353 unsigned int j, k;
Willy Tarreau6911fa42007-03-04 18:06:08 +0100354
355 while (len-- > 0) {
356 j = (*s++) - '0';
Willy Tarreau3f0c9762007-10-25 09:42:24 +0200357 k = i * 10;
Willy Tarreau6911fa42007-03-04 18:06:08 +0100358 if (j > 9)
359 break;
Willy Tarreau3f0c9762007-10-25 09:42:24 +0200360 i = k + j;
Willy Tarreau6911fa42007-03-04 18:06:08 +0100361 }
362 return i;
363}
364
Willy Tarreau4ec83cd2010-10-15 23:19:55 +0200365/* This function reads an unsigned integer from the string pointed to by <s>
366 * and returns it. The <s> pointer is adjusted to point to the first unread
367 * char. The function automatically stops at <end>.
368 */
369static inline unsigned int __read_uint(const char **s, const char *end)
370{
371 const char *ptr = *s;
372 unsigned int i = 0;
373 unsigned int j, k;
374
375 while (ptr < end) {
376 j = *ptr - '0';
377 k = i * 10;
378 if (j > 9)
379 break;
380 i = k + j;
381 ptr++;
382 }
383 *s = ptr;
384 return i;
385}
386
Willy Tarreau6911fa42007-03-04 18:06:08 +0100387extern unsigned int str2ui(const char *s);
388extern unsigned int str2uic(const char *s);
389extern unsigned int strl2ui(const char *s, int len);
390extern unsigned int strl2uic(const char *s, int len);
391extern int strl2ic(const char *s, int len);
392extern int strl2irc(const char *s, int len, int *ret);
393extern int strl2llrc(const char *s, int len, long long *ret);
Willy Tarreau4ec83cd2010-10-15 23:19:55 +0200394extern unsigned int read_uint(const char **s, const char *end);
Willy Tarreaud54bbdc2009-09-07 11:00:31 +0200395unsigned int inetaddr_host(const char *text);
396unsigned int inetaddr_host_lim(const char *text, const char *stop);
Willy Tarreau74172752010-10-15 23:21:42 +0200397unsigned int inetaddr_host_lim_ret(char *text, char *stop, char **ret);
Willy Tarreau6911fa42007-03-04 18:06:08 +0100398
Krzysztof Piotr Oledzki3d5562b2009-10-10 20:11:17 +0200399static inline char *cut_crlf(char *s) {
400
401 while (*s != '\r' || *s == '\n') {
402 char *p = s++;
403
404 if (!*p)
405 return p;
406 }
407
408 *s++ = 0;
409
410 return s;
411}
412
413static inline char *ltrim(char *s, char c) {
414
415 if (c)
416 while (*s == c)
417 s++;
418
419 return s;
420}
421
422static inline char *rtrim(char *s, char c) {
423
424 char *p = s + strlen(s);
425
426 while (p-- > s)
427 if (*p == c)
428 *p = '\0';
429 else
430 break;
431
432 return s;
433}
434
435static inline char *alltrim(char *s, char c) {
436
437 rtrim(s, c);
438
439 return ltrim(s, c);
440}
441
Willy Tarreaufe944602007-10-25 10:34:16 +0200442/* This function converts the time_t value <now> into a broken out struct tm
443 * which must be allocated by the caller. It is highly recommended to use this
444 * function intead of localtime() because that one requires a time_t* which
445 * is not always compatible with tv_sec depending on OS/hardware combinations.
446 */
447static inline void get_localtime(const time_t now, struct tm *tm)
448{
449 localtime_r(&now, tm);
450}
451
Emeric Brun3a058f32009-06-30 18:26:00 +0200452/* This function converts the time_t value <now> into a broken out struct tm
453 * which must be allocated by the caller. It is highly recommended to use this
454 * function intead of gmtime() because that one requires a time_t* which
455 * is not always compatible with tv_sec depending on OS/hardware combinations.
456 */
457static inline void get_gmtime(const time_t now, struct tm *tm)
458{
459 gmtime_r(&now, tm);
460}
461
Willy Tarreaua0d37b62007-12-02 22:00:35 +0100462/* This function parses a time value optionally followed by a unit suffix among
463 * "d", "h", "m", "s", "ms" or "us". It converts the value into the unit
464 * expected by the caller. The computation does its best to avoid overflows.
465 * The value is returned in <ret> if everything is fine, and a NULL is returned
466 * by the function. In case of error, a pointer to the error is returned and
467 * <ret> is left untouched.
468 */
469extern const char *parse_time_err(const char *text, unsigned *ret, unsigned unit_flags);
Emeric Brun39132b22010-01-04 14:57:24 +0100470extern const char *parse_size_err(const char *text, unsigned *ret);
Willy Tarreaua0d37b62007-12-02 22:00:35 +0100471
472/* unit flags to pass to parse_time_err */
473#define TIME_UNIT_US 0x0000
474#define TIME_UNIT_MS 0x0001
475#define TIME_UNIT_S 0x0002
476#define TIME_UNIT_MIN 0x0003
477#define TIME_UNIT_HOUR 0x0004
478#define TIME_UNIT_DAY 0x0005
479#define TIME_UNIT_MASK 0x0007
480
William Lallemand421f5b52012-02-06 18:15:57 +0100481#define SEC 1
482#define MINUTE (60 * SEC)
483#define HOUR (60 * MINUTE)
484#define DAY (24 * HOUR)
485
Willy Tarreau7f062c42009-03-05 18:43:00 +0100486/* Multiply the two 32-bit operands and shift the 64-bit result right 32 bits.
487 * This is used to compute fixed ratios by setting one of the operands to
488 * (2^32*ratio).
489 */
490static inline unsigned int mul32hi(unsigned int a, unsigned int b)
491{
492 return ((unsigned long long)a * b) >> 32;
493}
494
Willy Tarreauf0d9eec2010-06-20 07:12:37 +0200495/* gcc does not know when it can safely divide 64 bits by 32 bits. Use this
496 * function when you know for sure that the result fits in 32 bits, because
497 * it is optimal on x86 and on 64bit processors.
498 */
499static inline unsigned int div64_32(unsigned long long o1, unsigned int o2)
500{
501 unsigned int result;
502#ifdef __i386__
503 asm("divl %2"
504 : "=a" (result)
505 : "A"(o1), "rm"(o2));
506#else
507 result = o1 / o2;
508#endif
509 return result;
510}
511
Willy Tarreau946ba592009-05-10 15:41:18 +0200512/* copies at most <n> characters from <src> and always terminates with '\0' */
513char *my_strndup(const char *src, int n);
514
Willy Tarreau482b00d2009-10-04 22:48:42 +0200515/* This function returns the first unused key greater than or equal to <key> in
516 * ID tree <root>. Zero is returned if no place is found.
517 */
518unsigned int get_next_id(struct eb_root *root, unsigned int key);
519
Willy Tarreau348238b2010-01-18 15:05:57 +0100520/* This function compares a sample word possibly followed by blanks to another
521 * clean word. The compare is case-insensitive. 1 is returned if both are equal,
522 * otherwise zero. This intends to be used when checking HTTP headers for some
523 * values.
524 */
525int word_match(const char *sample, int slen, const char *word, int wlen);
526
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200527/* Convert a fixed-length string to an IP address. Returns 0 in case of error,
528 * or the number of chars read in case of success.
529 */
530int buf2ip(const char *buf, size_t len, struct in_addr *dst);
531
Willy Tarreauacf95772010-06-14 19:09:21 +0200532/* To be used to quote config arg positions. Returns the string at <ptr>
533 * surrounded by simple quotes if <ptr> is valid and non-empty, or "end of line"
534 * if ptr is NULL or empty. The string is locally allocated.
535 */
536const char *quote_arg(const char *ptr);
537
Willy Tarreau5b180202010-07-18 10:40:48 +0200538/* returns an operator among STD_OP_* for string <str> or < 0 if unknown */
539int get_std_op(const char *str);
540
Willy Tarreau4c14eaa2010-11-24 14:01:45 +0100541/* hash a 32-bit integer to another 32-bit integer */
542extern unsigned int full_hash(unsigned int a);
543static inline unsigned int __full_hash(unsigned int a)
544{
545 /* This function is one of Bob Jenkins' full avalanche hashing
546 * functions, which when provides quite a good distribution for little
547 * input variations. The result is quite suited to fit over a 32-bit
548 * space with enough variations so that a randomly picked number falls
549 * equally before any server position.
550 * Check http://burtleburtle.net/bob/hash/integer.html for more info.
551 */
552 a = (a+0x7ed55d16) + (a<<12);
553 a = (a^0xc761c23c) ^ (a>>19);
554 a = (a+0x165667b1) + (a<<5);
555 a = (a+0xd3a2646c) ^ (a<<9);
556 a = (a+0xfd7046c5) + (a<<3);
557 a = (a^0xb55a4f09) ^ (a>>16);
558
559 /* ensure values are better spread all around the tree by multiplying
560 * by a large prime close to 3/4 of the tree.
561 */
562 return a * 3221225473U;
563}
564
David du Colombier6f5ccb12011-03-10 22:26:24 +0100565/* returns non-zero if addr has a valid and non-null IPv4 or IPv6 address,
566 * otherwise zero.
567 */
568static inline int is_addr(struct sockaddr_storage *addr)
569{
570 int i;
571
572 switch (addr->ss_family) {
573 case AF_INET:
David du Colombier64e9c902011-03-22 11:39:41 +0100574 return *(int *)&((struct sockaddr_in *)addr)->sin_addr;
David du Colombier6f5ccb12011-03-10 22:26:24 +0100575 case AF_INET6:
576 for (i = 0; i < sizeof(struct in6_addr) / sizeof(int); i++)
577 if (((int *)&((struct sockaddr_in6 *)addr)->sin6_addr)[i] != 0)
578 return ((int *)&((struct sockaddr_in6 *)addr)->sin6_addr)[i];
579 }
580 return 0;
581}
582
David du Colombier11bcb6c2011-03-24 12:23:00 +0100583/* returns port in network byte order */
584static inline int get_net_port(struct sockaddr_storage *addr)
585{
586 switch (addr->ss_family) {
587 case AF_INET:
588 return ((struct sockaddr_in *)addr)->sin_port;
589 case AF_INET6:
590 return ((struct sockaddr_in6 *)addr)->sin6_port;
591 }
592 return 0;
593}
594
595/* returns port in host byte order */
596static inline int get_host_port(struct sockaddr_storage *addr)
597{
598 switch (addr->ss_family) {
599 case AF_INET:
600 return ntohs(((struct sockaddr_in *)addr)->sin_port);
601 case AF_INET6:
602 return ntohs(((struct sockaddr_in6 *)addr)->sin6_port);
603 }
604 return 0;
605}
606
Willy Tarreau1b4b7ce2011-04-05 16:56:50 +0200607/* returns address len for <addr>'s family, 0 for unknown families */
608static inline int get_addr_len(const struct sockaddr_storage *addr)
609{
610 switch (addr->ss_family) {
611 case AF_INET:
612 return sizeof(struct sockaddr_in);
613 case AF_INET6:
614 return sizeof(struct sockaddr_in6);
615 case AF_UNIX:
616 return sizeof(struct sockaddr_un);
617 }
618 return 0;
619}
620
David du Colombier11bcb6c2011-03-24 12:23:00 +0100621/* set port in host byte order */
622static inline int set_net_port(struct sockaddr_storage *addr, int port)
623{
624 switch (addr->ss_family) {
625 case AF_INET:
626 ((struct sockaddr_in *)addr)->sin_port = port;
627 case AF_INET6:
628 ((struct sockaddr_in6 *)addr)->sin6_port = port;
629 }
630 return 0;
631}
632
633/* set port in network byte order */
634static inline int set_host_port(struct sockaddr_storage *addr, int port)
635{
636 switch (addr->ss_family) {
637 case AF_INET:
638 ((struct sockaddr_in *)addr)->sin_port = htons(port);
639 case AF_INET6:
640 ((struct sockaddr_in6 *)addr)->sin6_port = htons(port);
641 }
642 return 0;
643}
644
David du Colombier4f92d322011-03-24 11:09:31 +0100645/* Return true if IPv4 address is part of the network */
646extern int in_net_ipv4(struct in_addr *addr, struct in_addr *mask, struct in_addr *net);
647
648/* Return true if IPv6 address is part of the network */
649extern int in_net_ipv6(struct in6_addr *addr, struct in6_addr *mask, struct in6_addr *net);
650
651/* Map IPv4 adress on IPv6 address, as specified in RFC 3513. */
652extern void v4tov6(struct in6_addr *sin6_addr, struct in_addr *sin_addr);
653
654/* Map IPv6 adress on IPv4 address, as specified in RFC 3513.
655 * Return true if conversion is possible and false otherwise.
656 */
657extern int v6tov4(struct in_addr *sin_addr, struct in6_addr *sin6_addr);
658
William Lallemand421f5b52012-02-06 18:15:57 +0100659char *human_time(int t, short hz_div);
660
661extern const char *monthname[];
662
663/* date2str_log: write a date in the format :
664 * sprintf(str, "%02d/%s/%04d:%02d:%02d:%02d.%03d",
665 * tm.tm_mday, monthname[tm.tm_mon], tm.tm_year+1900,
666 * tm.tm_hour, tm.tm_min, tm.tm_sec, (int)date.tv_usec/1000);
667 *
668 * without using sprintf. return a pointer to the last char written (\0) or
669 * NULL if there isn't enough space.
670 */
671char *date2str_log(char *dest, struct tm *tm, struct timeval *date, size_t size);
672
673/* gmt2str_log: write a date in the format :
674 * "%02d/%s/%04d:%02d:%02d:%02d +0000" without using snprintf
675 * return a pointer to the last char written (\0) or
676 * NULL if there isn't enough space.
677 */
678char *gmt2str_log(char *dst, struct tm *tm, size_t size);
679
Willy Tarreau9a7bea52012-04-27 11:16:50 +0200680/* Dynamically allocates a string of the proper length to hold the formatted
681 * output. NULL is returned on error. The caller is responsible for freeing the
682 * memory area using free(). The resulting string is returned in <out> if the
683 * pointer is not NULL. A previous version of <out> might be used to build the
684 * new string, and it will be freed before returning if it is not NULL, which
685 * makes it possible to build complex strings from iterative calls without
686 * having to care about freeing intermediate values, as in the example below :
687 *
688 * memprintf(&err, "invalid argument: '%s'", arg);
689 * ...
690 * memprintf(&err, "parser said : <%s>\n", *err);
691 * ...
692 * free(*err);
693 *
694 * This means that <err> must be initialized to NULL before first invocation.
695 * The return value also holds the allocated string, which eases error checking
696 * and immediate consumption. If the output pointer is not used, NULL must be
Willy Tarreaueb6cead2012-09-20 19:43:14 +0200697 * passed instead and it will be ignored. The returned message will then also
698 * be NULL so that the caller does not have to bother with freeing anything.
Willy Tarreau9a7bea52012-04-27 11:16:50 +0200699 *
700 * It is also convenient to use it without any free except the last one :
701 * err = NULL;
702 * if (!fct1(err)) report(*err);
703 * if (!fct2(err)) report(*err);
704 * if (!fct3(err)) report(*err);
705 * free(*err);
706 */
707char *memprintf(char **out, const char *format, ...)
708 __attribute__ ((format(printf, 2, 3)));
709
Willy Tarreau21c705b2012-09-14 11:40:36 +0200710/* Used to add <level> spaces before each line of <out>, unless there is only one line.
711 * The input argument is automatically freed and reassigned. The result will have to be
712 * freed by the caller.
713 * Example of use :
714 * parse(cmd, &err); (callee: memprintf(&err, ...))
715 * fprintf(stderr, "Parser said: %s\n", indent_error(&err));
716 * free(err);
717 */
718char *indent_msg(char **out, int level);
Willy Tarreau3d2f16f2012-05-13 00:21:17 +0200719
720/* debugging macro to emit messages using write() on fd #-1 so that strace sees
721 * them.
722 */
723#define fddebug(msg...) do { char *_m = NULL; memprintf(&_m, ##msg); if (_m) write(-1, _m, strlen(_m)); free(_m); } while (0)
724
Willy Tarreau2dd0d472006-06-29 17:53:05 +0200725#endif /* _COMMON_STANDARD_H */