blob: fc044fb6ae7c126d1b041db1edb277a4cd9ddd5f [file] [log] [blame]
Willy Tarreaubaaee002006-06-26 02:48:02 +02001/*
Willy Tarreaucc05fba2009-10-27 21:40:18 +01002 * include/common/standard.h
3 * This files contains some general purpose functions and macros.
4 *
Willy Tarreau348238b2010-01-18 15:05:57 +01005 * Copyright (C) 2000-2010 Willy Tarreau - w@1wt.eu
Willy Tarreaucc05fba2009-10-27 21:40:18 +01006 *
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation, version 2.1
10 * exclusively.
11 *
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with this library; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 */
Willy Tarreaubaaee002006-06-26 02:48:02 +020021
Willy Tarreau2dd0d472006-06-29 17:53:05 +020022#ifndef _COMMON_STANDARD_H
23#define _COMMON_STANDARD_H
Willy Tarreaubaaee002006-06-26 02:48:02 +020024
Willy Tarreau167d8b52007-04-09 22:16:12 +020025#include <limits.h>
Willy Tarreau050737f2010-01-14 11:40:12 +010026#include <string.h>
Willy Tarreaufe944602007-10-25 10:34:16 +020027#include <time.h>
Willy Tarreaue6e49cf2015-04-29 17:13:35 +020028#include <sys/time.h>
Willy Tarreau938b3032007-05-10 06:39:03 +020029#include <sys/types.h>
Willy Tarreaud50265a2012-09-04 14:18:33 +020030#include <sys/socket.h>
Willy Tarreaudd2f85e2012-09-02 22:34:23 +020031#include <sys/un.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020032#include <netinet/in.h>
Willy Tarreau5b4dd682015-07-21 23:47:18 +020033#include <arpa/inet.h>
Thierry FOURNIERe059ec92014-03-17 12:01:13 +010034#include <common/chunk.h>
Willy Tarreaue3ba5f02006-06-29 18:54:54 +020035#include <common/config.h>
Willy Tarreau45cb4fb2009-10-26 21:10:04 +010036#include <eb32tree.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020037
William Lallemande7340ec2012-01-24 11:15:39 +010038#ifndef LLONG_MAX
39# define LLONG_MAX 9223372036854775807LL
40# define LLONG_MIN (-LLONG_MAX - 1LL)
41#endif
42
43#ifndef ULLONG_MAX
44# define ULLONG_MAX (LLONG_MAX * 2ULL + 1)
45#endif
46
Willy Tarreaua9db57e2013-01-18 11:29:29 +010047#ifndef LONGBITS
48#define LONGBITS ((unsigned int)sizeof(long) * 8)
49#endif
50
Thierry FOURNIER511e9472014-01-23 17:40:34 +010051/* size used for max length of decimal representation of long long int. */
52#define NB_LLMAX_STR (sizeof("-9223372036854775807")-1)
53
Willy Tarreau56adcf22012-12-23 18:00:29 +010054/* number of itoa_str entries */
55#define NB_ITOA_STR 10
William Lallemande7340ec2012-01-24 11:15:39 +010056
Willy Tarreau588297f2014-06-16 15:16:40 +020057/* maximum quoted string length (truncated above) */
58#define QSTR_SIZE 200
59#define NB_QSTR 10
60
Willy Tarreaubaaee002006-06-26 02:48:02 +020061/****** string-specific macros and functions ******/
62/* if a > max, then bound <a> to <max>. The macro returns the new <a> */
63#define UBOUND(a, max) ({ typeof(a) b = (max); if ((a) > b) (a) = b; (a); })
64
65/* if a < min, then bound <a> to <min>. The macro returns the new <a> */
66#define LBOUND(a, min) ({ typeof(a) b = (min); if ((a) < b) (a) = b; (a); })
67
68/* returns 1 only if only zero or one bit is set in X, which means that X is a
69 * power of 2, and 0 otherwise */
70#define POWEROF2(x) (((x) & ((x)-1)) == 0)
71
Willy Tarreau5b180202010-07-18 10:40:48 +020072/* operators to compare values. They're ordered that way so that the lowest bit
73 * serves as a negation for the test and contains all tests that are not equal.
74 */
75enum {
76 STD_OP_LE = 0, STD_OP_GT = 1,
77 STD_OP_EQ = 2, STD_OP_NE = 3,
78 STD_OP_GE = 4, STD_OP_LT = 5,
79};
80
Thierry FOURNIER9f95e402014-03-21 14:51:46 +010081enum http_scheme {
82 SCH_HTTP,
83 SCH_HTTPS,
84};
85
86struct split_url {
87 enum http_scheme scheme;
88 const char *host;
89 int host_len;
90};
91
Willy Tarreau56adcf22012-12-23 18:00:29 +010092extern int itoa_idx; /* index of next itoa_str to use */
93
Willy Tarreau7d58a632007-01-13 23:06:06 +010094/*
Willy Tarreaubaaee002006-06-26 02:48:02 +020095 * copies at most <size-1> chars from <src> to <dst>. Last char is always
96 * set to 0, unless <size> is 0. The number of chars copied is returned
97 * (excluding the terminating zero).
98 * This code has been optimized for size and speed : on x86, it's 45 bytes
99 * long, uses only registers, and consumes only 4 cycles per char.
100 */
101extern int strlcpy2(char *dst, const char *src, int size);
102
103/*
Willy Tarreau72d759c2007-10-25 12:14:10 +0200104 * This function simply returns a locally allocated string containing
Willy Tarreaubaaee002006-06-26 02:48:02 +0200105 * the ascii representation for number 'n' in decimal.
106 */
Willy Tarreaue7239b52009-03-29 13:41:58 +0200107extern char itoa_str[][171];
Emeric Brun3a7fce52010-01-04 14:54:38 +0100108extern char *ultoa_r(unsigned long n, char *buffer, int size);
Thierry FOURNIER763a5d82015-07-06 23:09:52 +0200109extern char *lltoa_r(long long int n, char *buffer, int size);
Thierry FOURNIER1480bd82015-06-06 19:14:59 +0200110extern char *sltoa_r(long n, char *buffer, int size);
Willy Tarreaue7239b52009-03-29 13:41:58 +0200111extern const char *ulltoh_r(unsigned long long n, char *buffer, int size);
Willy Tarreau72d759c2007-10-25 12:14:10 +0200112static inline const char *ultoa(unsigned long n)
113{
114 return ultoa_r(n, itoa_str[0], sizeof(itoa_str[0]));
115}
116
William Lallemande7340ec2012-01-24 11:15:39 +0100117/*
118 * unsigned long long ASCII representation
119 *
120 * return the last char '\0' or NULL if no enough
121 * space in dst
122 */
123char *ulltoa(unsigned long long n, char *dst, size_t size);
124
125
126/*
127 * unsigned long ASCII representation
128 *
129 * return the last char '\0' or NULL if no enough
130 * space in dst
131 */
132char *ultoa_o(unsigned long n, char *dst, size_t size);
133
134/*
135 * signed long ASCII representation
136 *
137 * return the last char '\0' or NULL if no enough
138 * space in dst
139 */
140char *ltoa_o(long int n, char *dst, size_t size);
141
142/*
143 * signed long long ASCII representation
144 *
145 * return the last char '\0' or NULL if no enough
146 * space in dst
147 */
148char *lltoa(long long n, char *dst, size_t size);
149
150/*
151 * write a ascii representation of a unsigned into dst,
152 * return a pointer to the last character
153 * Pad the ascii representation with '0', using size.
154 */
155char *utoa_pad(unsigned int n, char *dst, size_t size);
156
Willy Tarreaubaaee002006-06-26 02:48:02 +0200157/*
Willy Tarreau91092e52007-10-25 16:58:42 +0200158 * This function simply returns a locally allocated string containing the ascii
159 * representation for number 'n' in decimal, unless n is 0 in which case it
160 * returns the alternate string (or an empty string if the alternate string is
161 * NULL). It use is intended for limits reported in reports, where it's
162 * desirable not to display anything if there is no limit. Warning! it shares
163 * the same vector as ultoa_r().
164 */
165extern const char *limit_r(unsigned long n, char *buffer, int size, const char *alt);
166
Willy Tarreau56adcf22012-12-23 18:00:29 +0100167/* returns a locally allocated string containing the ASCII representation of
168 * the number 'n' in decimal. Up to NB_ITOA_STR calls may be used in the same
169 * function call (eg: printf), shared with the other similar functions making
170 * use of itoa_str[].
171 */
172static inline const char *U2A(unsigned long n)
173{
174 const char *ret = ultoa_r(n, itoa_str[itoa_idx], sizeof(itoa_str[0]));
175 if (++itoa_idx >= NB_ITOA_STR)
176 itoa_idx = 0;
177 return ret;
178}
179
180/* returns a locally allocated string containing the HTML representation of
181 * the number 'n' in decimal. Up to NB_ITOA_STR calls may be used in the same
182 * function call (eg: printf), shared with the other similar functions making
183 * use of itoa_str[].
Willy Tarreau91092e52007-10-25 16:58:42 +0200184 */
Willy Tarreau56adcf22012-12-23 18:00:29 +0100185static inline const char *U2H(unsigned long long n)
186{
187 const char *ret = ulltoh_r(n, itoa_str[itoa_idx], sizeof(itoa_str[0]));
188 if (++itoa_idx >= NB_ITOA_STR)
189 itoa_idx = 0;
190 return ret;
191}
192
193/* returns a locally allocated string containing the HTML representation of
194 * the number 'n' in decimal. Up to NB_ITOA_STR calls may be used in the same
195 * function call (eg: printf), shared with the other similar functions making
196 * use of itoa_str[].
197 */
198static inline const char *LIM2A(unsigned long n, const char *alt)
199{
200 const char *ret = limit_r(n, itoa_str[itoa_idx], sizeof(itoa_str[0]), alt);
201 if (++itoa_idx >= NB_ITOA_STR)
202 itoa_idx = 0;
203 return ret;
204}
Willy Tarreau91092e52007-10-25 16:58:42 +0200205
Willy Tarreau588297f2014-06-16 15:16:40 +0200206/* returns a locally allocated string containing the quoted encoding of the
207 * input string. The output may be truncated to QSTR_SIZE chars, but it is
208 * guaranteed that the string will always be properly terminated. Quotes are
209 * encoded by doubling them as is commonly done in CSV files. QSTR_SIZE must
210 * always be at least 4 chars.
211 */
212const char *qstr(const char *str);
213
214/* returns <str> or its quote-encoded equivalent if it contains at least one
215 * quote or a comma. This is aimed at build CSV-compatible strings.
216 */
217static inline const char *cstr(const char *str)
218{
219 const char *p = str;
220
221 while (*p) {
222 if (*p == ',' || *p == '"')
223 return qstr(str);
224 p++;
225 }
226 return str;
227}
228
Willy Tarreau91092e52007-10-25 16:58:42 +0200229/*
Willy Tarreaubaaee002006-06-26 02:48:02 +0200230 * Returns non-zero if character <s> is a hex digit (0-9, a-f, A-F), else zero.
231 */
232extern int ishex(char s);
233
234/*
Willy Tarreauda3b7c32009-11-02 20:12:52 +0100235 * Return integer equivalent of character <c> for a hex digit (0-9, a-f, A-F),
Willy Tarreau3dd0c4e2012-10-26 00:58:22 +0200236 * otherwise -1. This compact form helps gcc produce efficient code.
Willy Tarreauda3b7c32009-11-02 20:12:52 +0100237 */
Willy Tarreau3dd0c4e2012-10-26 00:58:22 +0200238static inline int hex2i(int c)
239{
Willy Tarreau0161d622013-04-02 01:26:55 +0200240 if (unlikely((unsigned char)(c -= '0') > 9)) {
241 if (likely((unsigned char)(c -= 'A' - '0') > 5 &&
242 (unsigned char)(c -= 'a' - 'A') > 5))
Willy Tarreau3dd0c4e2012-10-26 00:58:22 +0200243 c = -11;
244 c += 10;
245 }
246 return c;
247}
248
Willy Tarreau3ca1a882015-01-15 18:43:49 +0100249/* rounds <i> down to the closest value having max 2 digits */
250unsigned int round_2dig(unsigned int i);
Willy Tarreauda3b7c32009-11-02 20:12:52 +0100251
252/*
Willy Tarreau2e74c3f2007-12-02 18:45:09 +0100253 * Checks <name> for invalid characters. Valid chars are [A-Za-z0-9_:.-]. If an
254 * invalid character is found, a pointer to it is returned. If everything is
255 * fine, NULL is returned.
256 */
257extern const char *invalid_char(const char *name);
258
259/*
Krzysztof Piotr Oledzkiefe3b6f2008-05-23 23:49:32 +0200260 * Checks <domainname> for invalid characters. Valid chars are [A-Za-z0-9_.-].
261 * If an invalid character is found, a pointer to it is returned.
262 * If everything is fine, NULL is returned.
263 */
264extern const char *invalid_domainchar(const char *name);
265
266/*
Willy Tarreaufab5a432011-03-04 15:31:53 +0100267 * converts <str> to a locally allocated struct sockaddr_storage *, and a
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200268 * port range consisting in two integers. The low and high end are always set
269 * even if the port is unspecified, in which case (0,0) is returned. The low
Willy Tarreaufab5a432011-03-04 15:31:53 +0100270 * port is set in the sockaddr. Thus, it is enough to check the size of the
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200271 * returned range to know if an array must be allocated or not. The format is
Willy Tarreaufab5a432011-03-04 15:31:53 +0100272 * "addr[:[port[-port]]]", where "addr" can be a dotted IPv4 address, an IPv6
273 * address, a host name, or empty or "*" to indicate INADDR_ANY. If an IPv6
274 * address wants to ignore port, it must be terminated by a trailing colon (':').
275 * The IPv6 '::' address is IN6ADDR_ANY, so in order to bind to a given port on
276 * IPv6, use ":::port". NULL is returned if the host part cannot be resolved.
Willy Tarreaud393a622013-03-04 18:22:00 +0100277 * If <pfx> is non-null, it is used as a string prefix before any path-based
278 * address (typically the path to a unix socket).
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200279 */
Willy Tarreaud393a622013-03-04 18:22:00 +0100280struct sockaddr_storage *str2sa_range(const char *str, int *low, int *high, char **err, const char *pfx);
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200281
Willy Tarreau2937c0d2010-01-26 17:36:17 +0100282/* converts <str> to a struct in_addr containing a network mask. It can be
283 * passed in dotted form (255.255.255.0) or in CIDR form (24). It returns 1
284 * if the conversion succeeds otherwise non-zero.
285 */
286int str2mask(const char *str, struct in_addr *mask);
287
Thierry FOURNIERb0504632013-12-14 15:39:02 +0100288/* convert <cidr> to struct in_addr <mask>. It returns 1 if the conversion
289 * succeeds otherwise non-zero.
290 */
291int cidr2dotted(int cidr, struct in_addr *mask);
292
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200293/*
Willy Tarreaud077a8e2007-05-08 18:28:09 +0200294 * converts <str> to two struct in_addr* which must be pre-allocated.
Willy Tarreaubaaee002006-06-26 02:48:02 +0200295 * The format is "addr[/mask]", where "addr" cannot be empty, and mask
296 * is optionnal and either in the dotted or CIDR notation.
297 * Note: "addr" can also be a hostname. Returns 1 if OK, 0 if error.
298 */
Thierry FOURNIERfc7ac7b2014-02-11 15:23:04 +0100299int str2net(const char *str, int resolve, struct in_addr *addr, struct in_addr *mask);
Willy Tarreaubaaee002006-06-26 02:48:02 +0200300
Thierry FOURNIER58639a02014-11-25 12:02:25 +0100301/* str2ip and str2ip2:
302 *
303 * converts <str> to a struct sockaddr_storage* provided by the caller. The
304 * caller must have zeroed <sa> first, and may have set sa->ss_family to force
305 * parse a specific address format. If the ss_family is 0 or AF_UNSPEC, then
306 * the function tries to guess the address family from the syntax. If the
307 * family is forced and the format doesn't match, an error is returned. The
308 * string is assumed to contain only an address, no port. The address can be a
309 * dotted IPv4 address, an IPv6 address, a host name, or empty or "*" to
310 * indicate INADDR_ANY. NULL is returned if the host part cannot be resolved.
311 * The return address will only have the address family and the address set,
312 * all other fields remain zero. The string is not supposed to be modified.
313 * The IPv6 '::' address is IN6ADDR_ANY.
314 *
315 * str2ip2:
316 *
317 * If <resolve> is set, this function try to resolve DNS, otherwise, it returns
318 * NULL result.
319 */
320struct sockaddr_storage *str2ip2(const char *str, struct sockaddr_storage *sa, int resolve);
321static inline struct sockaddr_storage *str2ip(const char *str, struct sockaddr_storage *sa)
322{
323 return str2ip2(str, sa, 1);
324}
325
Alexandre Cassen5eb1a902007-11-29 15:43:32 +0100326/*
Willy Tarreau6d20e282012-04-27 22:49:47 +0200327 * converts <str> to two struct in6_addr* which must be pre-allocated.
328 * The format is "addr[/mask]", where "addr" cannot be empty, and mask
329 * is an optionnal number of bits (128 being the default).
330 * Returns 1 if OK, 0 if error.
331 */
332int str62net(const char *str, struct in6_addr *addr, unsigned char *mask);
333
334/*
Willy Tarreau106f9792009-09-19 07:54:16 +0200335 * Parse IP address found in url.
336 */
David du Colombier6f5ccb12011-03-10 22:26:24 +0100337int url2ipv4(const char *addr, struct in_addr *dst);
Willy Tarreau106f9792009-09-19 07:54:16 +0200338
339/*
David du Colombier6f5ccb12011-03-10 22:26:24 +0100340 * Resolve destination server from URL. Convert <str> to a sockaddr_storage*.
Alexandre Cassen5eb1a902007-11-29 15:43:32 +0100341 */
Thierry FOURNIER9f95e402014-03-21 14:51:46 +0100342int url2sa(const char *url, int ulen, struct sockaddr_storage *addr, struct split_url *out);
Alexandre Cassen5eb1a902007-11-29 15:43:32 +0100343
Willy Tarreau631f01c2011-09-05 00:36:48 +0200344/* Tries to convert a sockaddr_storage address to text form. Upon success, the
345 * address family is returned so that it's easy for the caller to adapt to the
346 * output format. Zero is returned if the address family is not supported. -1
347 * is returned upon error, with errno set. AF_INET, AF_INET6 and AF_UNIX are
348 * supported.
349 */
350int addr_to_str(struct sockaddr_storage *addr, char *str, int size);
351
Simon Horman75ab8bd2014-06-16 09:39:41 +0900352/* Tries to convert a sockaddr_storage port to text form. Upon success, the
353 * address family is returned so that it's easy for the caller to adapt to the
354 * output format. Zero is returned if the address family is not supported. -1
355 * is returned upon error, with errno set. AF_INET, AF_INET6 and AF_UNIX are
356 * supported.
357 */
358int port_to_str(struct sockaddr_storage *addr, char *str, int size);
359
Willy Tarreaubaaee002006-06-26 02:48:02 +0200360/* will try to encode the string <string> replacing all characters tagged in
361 * <map> with the hexadecimal representation of their ASCII-code (2 digits)
362 * prefixed by <escape>, and will store the result between <start> (included)
363 * and <stop> (excluded), and will always terminate the string with a '\0'
364 * before <stop>. The position of the '\0' is returned if the conversion
365 * completes. If bytes are missing between <start> and <stop>, then the
366 * conversion will be incomplete and truncated. If <stop> <= <start>, the '\0'
367 * cannot even be stored so we return <start> without writing the 0.
368 * The input string must also be zero-terminated.
369 */
370extern const char hextab[];
371char *encode_string(char *start, char *stop,
372 const char escape, const fd_set *map,
373 const char *string);
374
Thierry FOURNIERe059ec92014-03-17 12:01:13 +0100375/*
376 * Same behavior, except that it encodes chunk <chunk> instead of a string.
377 */
378char *encode_chunk(char *start, char *stop,
379 const char escape, const fd_set *map,
380 const struct chunk *chunk);
381
382
Thierry FOURNIERddea6262015-05-28 16:00:28 +0200383/* Check a string for using it in a CSV output format. If the string contains
384 * one of the following four char <">, <,>, CR or LF, the string is
385 * encapsulated between <"> and the <"> are escaped by a <""> sequence.
386 * <str> is the input string to be escaped. The function assumes that
387 * the input string is null-terminated.
388 *
389 * If <quote> is 0, the result is returned escaped but without double quote.
390 * Is it useful if the escaped string is used between double quotes in the
391 * format.
392 *
393 * printf("..., \"%s\", ...\r\n", csv_enc(str, 0));
394 *
395 * If the <quote> is 1, the converter put the quotes only if any character is
396 * escaped. If the <quote> is 2, the converter put always the quotes.
397 *
398 * <output> is a struct chunk used for storing the output string if any
399 * change will be done.
400 *
401 * The function returns the converted string on this output. If an error
402 * occurs, the function return an empty string. This type of output is useful
403 * for using the function directly as printf() argument.
404 *
405 * If the output buffer is too short to conatin the input string, the result
406 * is truncated.
407 */
408const char *csv_enc(const char *str, int quote, struct chunk *output);
409
Willy Tarreaubf9c2fc2011-05-31 18:06:18 +0200410/* Decode an URL-encoded string in-place. The resulting string might
411 * be shorter. If some forbidden characters are found, the conversion is
412 * aborted, the string is truncated before the issue and non-zero is returned,
413 * otherwise the operation returns non-zero indicating success.
414 */
415int url_decode(char *string);
416
Willy Tarreau6911fa42007-03-04 18:06:08 +0100417/* This one is 6 times faster than strtoul() on athlon, but does
418 * no check at all.
419 */
420static inline unsigned int __str2ui(const char *s)
421{
422 unsigned int i = 0;
423 while (*s) {
424 i = i * 10 - '0';
425 i += (unsigned char)*s++;
426 }
427 return i;
428}
429
430/* This one is 5 times faster than strtoul() on athlon with checks.
431 * It returns the value of the number composed of all valid digits read.
432 */
433static inline unsigned int __str2uic(const char *s)
434{
435 unsigned int i = 0;
436 unsigned int j;
437 while (1) {
438 j = (*s++) - '0';
439 if (j > 9)
440 break;
441 i *= 10;
442 i += j;
443 }
444 return i;
445}
446
447/* This one is 28 times faster than strtoul() on athlon, but does
448 * no check at all!
449 */
450static inline unsigned int __strl2ui(const char *s, int len)
451{
452 unsigned int i = 0;
453 while (len-- > 0) {
454 i = i * 10 - '0';
455 i += (unsigned char)*s++;
456 }
457 return i;
458}
459
460/* This one is 7 times faster than strtoul() on athlon with checks.
461 * It returns the value of the number composed of all valid digits read.
462 */
463static inline unsigned int __strl2uic(const char *s, int len)
464{
465 unsigned int i = 0;
Willy Tarreau3f0c9762007-10-25 09:42:24 +0200466 unsigned int j, k;
Willy Tarreau6911fa42007-03-04 18:06:08 +0100467
468 while (len-- > 0) {
469 j = (*s++) - '0';
Willy Tarreau3f0c9762007-10-25 09:42:24 +0200470 k = i * 10;
Willy Tarreau6911fa42007-03-04 18:06:08 +0100471 if (j > 9)
472 break;
Willy Tarreau3f0c9762007-10-25 09:42:24 +0200473 i = k + j;
Willy Tarreau6911fa42007-03-04 18:06:08 +0100474 }
475 return i;
476}
477
Willy Tarreau4ec83cd2010-10-15 23:19:55 +0200478/* This function reads an unsigned integer from the string pointed to by <s>
479 * and returns it. The <s> pointer is adjusted to point to the first unread
480 * char. The function automatically stops at <end>.
481 */
482static inline unsigned int __read_uint(const char **s, const char *end)
483{
484 const char *ptr = *s;
485 unsigned int i = 0;
486 unsigned int j, k;
487
488 while (ptr < end) {
489 j = *ptr - '0';
490 k = i * 10;
491 if (j > 9)
492 break;
493 i = k + j;
494 ptr++;
495 }
496 *s = ptr;
497 return i;
498}
499
Thierry FOURNIER763a5d82015-07-06 23:09:52 +0200500unsigned long long int read_uint64(const char **s, const char *end);
501long long int read_int64(const char **s, const char *end);
502
Willy Tarreau6911fa42007-03-04 18:06:08 +0100503extern unsigned int str2ui(const char *s);
504extern unsigned int str2uic(const char *s);
505extern unsigned int strl2ui(const char *s, int len);
506extern unsigned int strl2uic(const char *s, int len);
507extern int strl2ic(const char *s, int len);
508extern int strl2irc(const char *s, int len, int *ret);
509extern int strl2llrc(const char *s, int len, long long *ret);
Thierry FOURNIER511e9472014-01-23 17:40:34 +0100510extern int strl2llrc_dotted(const char *text, int len, long long *ret);
Willy Tarreau4ec83cd2010-10-15 23:19:55 +0200511extern unsigned int read_uint(const char **s, const char *end);
Willy Tarreaud54bbdc2009-09-07 11:00:31 +0200512unsigned int inetaddr_host(const char *text);
513unsigned int inetaddr_host_lim(const char *text, const char *stop);
Willy Tarreau74172752010-10-15 23:21:42 +0200514unsigned int inetaddr_host_lim_ret(char *text, char *stop, char **ret);
Willy Tarreau6911fa42007-03-04 18:06:08 +0100515
Krzysztof Piotr Oledzki3d5562b2009-10-10 20:11:17 +0200516static inline char *cut_crlf(char *s) {
517
Simon Horman5269cfb2013-02-13 17:48:00 +0900518 while (*s != '\r' && *s != '\n') {
Krzysztof Piotr Oledzki3d5562b2009-10-10 20:11:17 +0200519 char *p = s++;
520
521 if (!*p)
522 return p;
523 }
524
Simon Horman5269cfb2013-02-13 17:48:00 +0900525 *s++ = '\0';
Krzysztof Piotr Oledzki3d5562b2009-10-10 20:11:17 +0200526
527 return s;
528}
529
530static inline char *ltrim(char *s, char c) {
531
532 if (c)
533 while (*s == c)
534 s++;
535
536 return s;
537}
538
539static inline char *rtrim(char *s, char c) {
540
541 char *p = s + strlen(s);
542
543 while (p-- > s)
544 if (*p == c)
545 *p = '\0';
546 else
547 break;
548
549 return s;
550}
551
552static inline char *alltrim(char *s, char c) {
553
554 rtrim(s, c);
555
556 return ltrim(s, c);
557}
558
Willy Tarreaufe944602007-10-25 10:34:16 +0200559/* This function converts the time_t value <now> into a broken out struct tm
560 * which must be allocated by the caller. It is highly recommended to use this
561 * function intead of localtime() because that one requires a time_t* which
562 * is not always compatible with tv_sec depending on OS/hardware combinations.
563 */
564static inline void get_localtime(const time_t now, struct tm *tm)
565{
566 localtime_r(&now, tm);
567}
568
Emeric Brun3a058f32009-06-30 18:26:00 +0200569/* This function converts the time_t value <now> into a broken out struct tm
570 * which must be allocated by the caller. It is highly recommended to use this
571 * function intead of gmtime() because that one requires a time_t* which
572 * is not always compatible with tv_sec depending on OS/hardware combinations.
573 */
574static inline void get_gmtime(const time_t now, struct tm *tm)
575{
576 gmtime_r(&now, tm);
577}
578
Willy Tarreaua0d37b62007-12-02 22:00:35 +0100579/* This function parses a time value optionally followed by a unit suffix among
580 * "d", "h", "m", "s", "ms" or "us". It converts the value into the unit
581 * expected by the caller. The computation does its best to avoid overflows.
582 * The value is returned in <ret> if everything is fine, and a NULL is returned
583 * by the function. In case of error, a pointer to the error is returned and
584 * <ret> is left untouched.
585 */
586extern const char *parse_time_err(const char *text, unsigned *ret, unsigned unit_flags);
Emeric Brun39132b22010-01-04 14:57:24 +0100587extern const char *parse_size_err(const char *text, unsigned *ret);
Willy Tarreaua0d37b62007-12-02 22:00:35 +0100588
589/* unit flags to pass to parse_time_err */
590#define TIME_UNIT_US 0x0000
591#define TIME_UNIT_MS 0x0001
592#define TIME_UNIT_S 0x0002
593#define TIME_UNIT_MIN 0x0003
594#define TIME_UNIT_HOUR 0x0004
595#define TIME_UNIT_DAY 0x0005
596#define TIME_UNIT_MASK 0x0007
597
William Lallemand421f5b52012-02-06 18:15:57 +0100598#define SEC 1
599#define MINUTE (60 * SEC)
600#define HOUR (60 * MINUTE)
601#define DAY (24 * HOUR)
602
Willy Tarreau7f062c42009-03-05 18:43:00 +0100603/* Multiply the two 32-bit operands and shift the 64-bit result right 32 bits.
604 * This is used to compute fixed ratios by setting one of the operands to
605 * (2^32*ratio).
606 */
607static inline unsigned int mul32hi(unsigned int a, unsigned int b)
608{
609 return ((unsigned long long)a * b) >> 32;
610}
611
Willy Tarreauf0d9eec2010-06-20 07:12:37 +0200612/* gcc does not know when it can safely divide 64 bits by 32 bits. Use this
613 * function when you know for sure that the result fits in 32 bits, because
614 * it is optimal on x86 and on 64bit processors.
615 */
616static inline unsigned int div64_32(unsigned long long o1, unsigned int o2)
617{
618 unsigned int result;
619#ifdef __i386__
620 asm("divl %2"
621 : "=a" (result)
622 : "A"(o1), "rm"(o2));
623#else
624 result = o1 / o2;
625#endif
626 return result;
627}
628
David Carliere6c39412015-07-02 07:00:17 +0000629/* Simple popcountl implementation. It returns the number of ones in a word */
630static inline unsigned int my_popcountl(unsigned long a)
Willy Tarreau37994f02012-11-19 12:11:07 +0100631{
632 unsigned int cnt;
633 for (cnt = 0; a; a >>= 1) {
634 if (a & 1)
635 cnt++;
636 }
637 return cnt;
638}
639
David Carliere6c39412015-07-02 07:00:17 +0000640/* Build a word with the <bits> lower bits set (reverse of my_popcountl) */
Willy Tarreaua9db57e2013-01-18 11:29:29 +0100641static inline unsigned long nbits(int bits)
642{
643 if (--bits < 0)
644 return 0;
645 else
646 return (2UL << bits) - 1;
647}
648
Willy Tarreau126d4062013-12-03 17:50:47 +0100649/*
650 * Parse binary string written in hexadecimal (source) and store the decoded
651 * result into binstr and set binstrlen to the lengh of binstr. Memory for
652 * binstr is allocated by the function. In case of error, returns 0 with an
653 * error message in err.
654 */
655int parse_binary(const char *source, char **binstr, int *binstrlen, char **err);
656
Willy Tarreau946ba592009-05-10 15:41:18 +0200657/* copies at most <n> characters from <src> and always terminates with '\0' */
658char *my_strndup(const char *src, int n);
659
Baptiste Assmannbb77c8e2013-10-06 23:24:13 +0200660/*
661 * search needle in haystack
662 * returns the pointer if found, returns NULL otherwise
663 */
664const void *my_memmem(const void *, size_t, const void *, size_t);
665
Willy Tarreau482b00d2009-10-04 22:48:42 +0200666/* This function returns the first unused key greater than or equal to <key> in
667 * ID tree <root>. Zero is returned if no place is found.
668 */
669unsigned int get_next_id(struct eb_root *root, unsigned int key);
670
Willy Tarreau348238b2010-01-18 15:05:57 +0100671/* This function compares a sample word possibly followed by blanks to another
672 * clean word. The compare is case-insensitive. 1 is returned if both are equal,
673 * otherwise zero. This intends to be used when checking HTTP headers for some
674 * values.
675 */
676int word_match(const char *sample, int slen, const char *word, int wlen);
677
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200678/* Convert a fixed-length string to an IP address. Returns 0 in case of error,
679 * or the number of chars read in case of success.
680 */
681int buf2ip(const char *buf, size_t len, struct in_addr *dst);
Thierry FOURNIERd559dd82013-11-22 16:16:59 +0100682int buf2ip6(const char *buf, size_t len, struct in6_addr *dst);
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200683
Willy Tarreauacf95772010-06-14 19:09:21 +0200684/* To be used to quote config arg positions. Returns the string at <ptr>
685 * surrounded by simple quotes if <ptr> is valid and non-empty, or "end of line"
686 * if ptr is NULL or empty. The string is locally allocated.
687 */
688const char *quote_arg(const char *ptr);
689
Willy Tarreau5b180202010-07-18 10:40:48 +0200690/* returns an operator among STD_OP_* for string <str> or < 0 if unknown */
691int get_std_op(const char *str);
692
Willy Tarreau4c14eaa2010-11-24 14:01:45 +0100693/* hash a 32-bit integer to another 32-bit integer */
694extern unsigned int full_hash(unsigned int a);
695static inline unsigned int __full_hash(unsigned int a)
696{
697 /* This function is one of Bob Jenkins' full avalanche hashing
698 * functions, which when provides quite a good distribution for little
699 * input variations. The result is quite suited to fit over a 32-bit
700 * space with enough variations so that a randomly picked number falls
701 * equally before any server position.
702 * Check http://burtleburtle.net/bob/hash/integer.html for more info.
703 */
704 a = (a+0x7ed55d16) + (a<<12);
705 a = (a^0xc761c23c) ^ (a>>19);
706 a = (a+0x165667b1) + (a<<5);
707 a = (a+0xd3a2646c) ^ (a<<9);
708 a = (a+0xfd7046c5) + (a<<3);
709 a = (a^0xb55a4f09) ^ (a>>16);
710
711 /* ensure values are better spread all around the tree by multiplying
712 * by a large prime close to 3/4 of the tree.
713 */
714 return a * 3221225473U;
715}
716
Willy Tarreau422a0a52012-10-26 19:47:23 +0200717/* sets the address family to AF_UNSPEC so that is_addr() does not match */
718static inline void clear_addr(struct sockaddr_storage *addr)
719{
720 addr->ss_family = AF_UNSPEC;
721}
722
David du Colombier6f5ccb12011-03-10 22:26:24 +0100723/* returns non-zero if addr has a valid and non-null IPv4 or IPv6 address,
724 * otherwise zero.
725 */
Willy Tarreau18ca2d42014-05-09 22:40:55 +0200726static inline int is_inet_addr(const struct sockaddr_storage *addr)
David du Colombier6f5ccb12011-03-10 22:26:24 +0100727{
728 int i;
729
730 switch (addr->ss_family) {
731 case AF_INET:
David du Colombier64e9c902011-03-22 11:39:41 +0100732 return *(int *)&((struct sockaddr_in *)addr)->sin_addr;
David du Colombier6f5ccb12011-03-10 22:26:24 +0100733 case AF_INET6:
734 for (i = 0; i < sizeof(struct in6_addr) / sizeof(int); i++)
735 if (((int *)&((struct sockaddr_in6 *)addr)->sin6_addr)[i] != 0)
736 return ((int *)&((struct sockaddr_in6 *)addr)->sin6_addr)[i];
737 }
738 return 0;
739}
740
Willy Tarreau18ca2d42014-05-09 22:40:55 +0200741/* returns non-zero if addr has a valid and non-null IPv4 or IPv6 address,
742 * or is a unix address, otherwise returns zero.
743 */
744static inline int is_addr(const struct sockaddr_storage *addr)
745{
746 if (addr->ss_family == AF_UNIX)
747 return 1;
748 else
749 return is_inet_addr(addr);
750}
751
David du Colombier11bcb6c2011-03-24 12:23:00 +0100752/* returns port in network byte order */
753static inline int get_net_port(struct sockaddr_storage *addr)
754{
755 switch (addr->ss_family) {
756 case AF_INET:
757 return ((struct sockaddr_in *)addr)->sin_port;
758 case AF_INET6:
759 return ((struct sockaddr_in6 *)addr)->sin6_port;
760 }
761 return 0;
762}
763
764/* returns port in host byte order */
765static inline int get_host_port(struct sockaddr_storage *addr)
766{
767 switch (addr->ss_family) {
768 case AF_INET:
769 return ntohs(((struct sockaddr_in *)addr)->sin_port);
770 case AF_INET6:
771 return ntohs(((struct sockaddr_in6 *)addr)->sin6_port);
772 }
773 return 0;
774}
775
Willy Tarreau1b4b7ce2011-04-05 16:56:50 +0200776/* returns address len for <addr>'s family, 0 for unknown families */
777static inline int get_addr_len(const struct sockaddr_storage *addr)
778{
779 switch (addr->ss_family) {
780 case AF_INET:
781 return sizeof(struct sockaddr_in);
782 case AF_INET6:
783 return sizeof(struct sockaddr_in6);
784 case AF_UNIX:
785 return sizeof(struct sockaddr_un);
786 }
787 return 0;
788}
789
David du Colombier11bcb6c2011-03-24 12:23:00 +0100790/* set port in host byte order */
791static inline int set_net_port(struct sockaddr_storage *addr, int port)
792{
793 switch (addr->ss_family) {
794 case AF_INET:
795 ((struct sockaddr_in *)addr)->sin_port = port;
796 case AF_INET6:
797 ((struct sockaddr_in6 *)addr)->sin6_port = port;
798 }
799 return 0;
800}
801
802/* set port in network byte order */
803static inline int set_host_port(struct sockaddr_storage *addr, int port)
804{
805 switch (addr->ss_family) {
806 case AF_INET:
807 ((struct sockaddr_in *)addr)->sin_port = htons(port);
808 case AF_INET6:
809 ((struct sockaddr_in6 *)addr)->sin6_port = htons(port);
810 }
811 return 0;
812}
813
David du Colombier4f92d322011-03-24 11:09:31 +0100814/* Return true if IPv4 address is part of the network */
815extern int in_net_ipv4(struct in_addr *addr, struct in_addr *mask, struct in_addr *net);
816
817/* Return true if IPv6 address is part of the network */
818extern int in_net_ipv6(struct in6_addr *addr, struct in6_addr *mask, struct in6_addr *net);
819
820/* Map IPv4 adress on IPv6 address, as specified in RFC 3513. */
821extern void v4tov6(struct in6_addr *sin6_addr, struct in_addr *sin_addr);
822
823/* Map IPv6 adress on IPv4 address, as specified in RFC 3513.
824 * Return true if conversion is possible and false otherwise.
825 */
826extern int v6tov4(struct in_addr *sin_addr, struct in6_addr *sin6_addr);
827
William Lallemand421f5b52012-02-06 18:15:57 +0100828char *human_time(int t, short hz_div);
829
830extern const char *monthname[];
831
Yuxans Yao4e25b012012-10-19 10:36:09 +0800832/* numeric timezone (that is, the hour and minute offset from UTC) */
833char localtimezone[6];
834
William Lallemand421f5b52012-02-06 18:15:57 +0100835/* date2str_log: write a date in the format :
836 * sprintf(str, "%02d/%s/%04d:%02d:%02d:%02d.%03d",
837 * tm.tm_mday, monthname[tm.tm_mon], tm.tm_year+1900,
838 * tm.tm_hour, tm.tm_min, tm.tm_sec, (int)date.tv_usec/1000);
839 *
840 * without using sprintf. return a pointer to the last char written (\0) or
841 * NULL if there isn't enough space.
842 */
843char *date2str_log(char *dest, struct tm *tm, struct timeval *date, size_t size);
844
845/* gmt2str_log: write a date in the format :
846 * "%02d/%s/%04d:%02d:%02d:%02d +0000" without using snprintf
847 * return a pointer to the last char written (\0) or
848 * NULL if there isn't enough space.
849 */
850char *gmt2str_log(char *dst, struct tm *tm, size_t size);
851
Yuxans Yao4e25b012012-10-19 10:36:09 +0800852/* localdate2str_log: write a date in the format :
853 * "%02d/%s/%04d:%02d:%02d:%02d +0000(local timezone)" without using snprintf
854 * return a pointer to the last char written (\0) or
855 * NULL if there isn't enough space.
856 */
857char *localdate2str_log(char *dst, struct tm *tm, size_t size);
858
Willy Tarreau9a7bea52012-04-27 11:16:50 +0200859/* Dynamically allocates a string of the proper length to hold the formatted
860 * output. NULL is returned on error. The caller is responsible for freeing the
861 * memory area using free(). The resulting string is returned in <out> if the
862 * pointer is not NULL. A previous version of <out> might be used to build the
863 * new string, and it will be freed before returning if it is not NULL, which
864 * makes it possible to build complex strings from iterative calls without
865 * having to care about freeing intermediate values, as in the example below :
866 *
867 * memprintf(&err, "invalid argument: '%s'", arg);
868 * ...
869 * memprintf(&err, "parser said : <%s>\n", *err);
870 * ...
871 * free(*err);
872 *
873 * This means that <err> must be initialized to NULL before first invocation.
874 * The return value also holds the allocated string, which eases error checking
875 * and immediate consumption. If the output pointer is not used, NULL must be
Willy Tarreaueb6cead2012-09-20 19:43:14 +0200876 * passed instead and it will be ignored. The returned message will then also
877 * be NULL so that the caller does not have to bother with freeing anything.
Willy Tarreau9a7bea52012-04-27 11:16:50 +0200878 *
879 * It is also convenient to use it without any free except the last one :
880 * err = NULL;
881 * if (!fct1(err)) report(*err);
882 * if (!fct2(err)) report(*err);
883 * if (!fct3(err)) report(*err);
884 * free(*err);
885 */
886char *memprintf(char **out, const char *format, ...)
887 __attribute__ ((format(printf, 2, 3)));
888
Willy Tarreau21c705b2012-09-14 11:40:36 +0200889/* Used to add <level> spaces before each line of <out>, unless there is only one line.
890 * The input argument is automatically freed and reassigned. The result will have to be
891 * freed by the caller.
892 * Example of use :
893 * parse(cmd, &err); (callee: memprintf(&err, ...))
894 * fprintf(stderr, "Parser said: %s\n", indent_error(&err));
895 * free(err);
896 */
897char *indent_msg(char **out, int level);
Willy Tarreau3d2f16f2012-05-13 00:21:17 +0200898
Willy Tarreaudad36a32013-03-11 01:20:04 +0100899/* Convert occurrences of environment variables in the input string to their
900 * corresponding value. A variable is identified as a series of alphanumeric
901 * characters or underscores following a '$' sign. The <in> string must be
902 * free()able. NULL returns NULL. The resulting string might be reallocated if
903 * some expansion is made.
904 */
905char *env_expand(char *in);
906
Willy Tarreau3d2f16f2012-05-13 00:21:17 +0200907/* debugging macro to emit messages using write() on fd #-1 so that strace sees
908 * them.
909 */
910#define fddebug(msg...) do { char *_m = NULL; memprintf(&_m, ##msg); if (_m) write(-1, _m, strlen(_m)); free(_m); } while (0)
911
Willy Tarreau89efaed2013-12-13 15:14:55 +0100912/* used from everywhere just to drain results we don't want to read and which
913 * recent versions of gcc increasingly and annoyingly complain about.
914 */
915extern int shut_your_big_mouth_gcc_int;
916
917/* used from everywhere just to drain results we don't want to read and which
918 * recent versions of gcc increasingly and annoyingly complain about.
919 */
920static inline void shut_your_big_mouth_gcc(int r)
921{
922 shut_your_big_mouth_gcc_int = r;
923}
924
de Lafond Guillaume88c278f2013-04-15 19:27:10 +0200925/* same as strstr() but case-insensitive */
926const char *strnistr(const char *str1, int len_str1, const char *str2, int len_str2);
927
Willy Tarreaubb519c72014-01-28 23:04:39 +0100928
929/************************* Composite address manipulation *********************
930 * Composite addresses are simply unsigned long data in which the higher bits
931 * represent a pointer, and the two lower bits are flags. There are several
932 * places where we just want to associate one or two flags to a pointer (eg,
933 * to type it), and these functions permit this. The pointer is necessarily a
934 * 32-bit aligned pointer, as its two lower bits will be cleared and replaced
935 * with the flags.
936 *****************************************************************************/
937
938/* Masks the two lower bits of a composite address and converts it to a
939 * pointer. This is used to mix some bits with some aligned pointers to
940 * structs and to retrieve the original (32-bit aligned) pointer.
941 */
942static inline void *caddr_to_ptr(unsigned long caddr)
943{
944 return (void *)(caddr & ~3UL);
945}
946
947/* Only retrieves the two lower bits of a composite address. This is used to mix
948 * some bits with some aligned pointers to structs and to retrieve the original
949 * data (2 bits).
950 */
951static inline unsigned int caddr_to_data(unsigned long caddr)
952{
953 return (caddr & 3UL);
954}
955
956/* Combines the aligned pointer whose 2 lower bits will be masked with the bits
957 * from <data> to form a composite address. This is used to mix some bits with
958 * some aligned pointers to structs and to retrieve the original (32-bit aligned)
959 * pointer.
960 */
961static inline unsigned long caddr_from_ptr(void *ptr, unsigned int data)
962{
963 return (((unsigned long)ptr) & ~3UL) + (data & 3);
964}
965
966/* sets the 2 bits of <data> in the <caddr> composite address */
967static inline unsigned long caddr_set_flags(unsigned long caddr, unsigned int data)
968{
969 return caddr | (data & 3);
970}
971
972/* clears the 2 bits of <data> in the <caddr> composite address */
973static inline unsigned long caddr_clr_flags(unsigned long caddr, unsigned int data)
974{
975 return caddr & ~(unsigned long)(data & 3);
976}
977
Thierry FOURNIER317e1c42014-08-12 10:20:47 +0200978/* UTF-8 decoder status */
979#define UTF8_CODE_OK 0x00
980#define UTF8_CODE_OVERLONG 0x10
981#define UTF8_CODE_INVRANGE 0x20
982#define UTF8_CODE_BADSEQ 0x40
983
984unsigned char utf8_next(const char *s, int len, unsigned int *c);
985
986static inline unsigned char utf8_return_code(unsigned int code)
987{
988 return code & 0xf0;
989}
990
991static inline unsigned char utf8_return_length(unsigned char code)
992{
993 return code & 0x0f;
994}
995
Willy Tarreau5b4dd682015-07-21 23:47:18 +0200996/* Turns 64-bit value <a> from host byte order to network byte order.
997 * The principle consists in letting the compiler detect we're playing
998 * with a union and simplify most or all operations. The asm-optimized
999 * htonl() version involving bswap (x86) / rev (arm) / other is a single
1000 * operation on little endian, or a NOP on big-endian. In both cases,
1001 * this lets the compiler "see" that we're rebuilding a 64-bit word from
1002 * two 32-bit quantities that fit into a 32-bit register. In big endian,
1003 * the whole code is optimized out. In little endian, with a decent compiler,
1004 * a few bswap and 2 shifts are left, which is the minimum acceptable.
1005 */
1006static inline unsigned long long htonll(unsigned long long a)
1007{
1008 union {
1009 struct {
1010 unsigned int w1;
1011 unsigned int w2;
1012 } by32;
1013 unsigned long long by64;
1014 } w = { .by64 = a };
1015 return ((unsigned long long)htonl(w.by32.w1) << 32) | htonl(w.by32.w2);
1016}
1017
1018/* Turns 64-bit value <a> from network byte order to host byte order. */
1019static inline unsigned long long ntohll(unsigned long long a)
1020{
1021 return htonll(a);
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
Willy Tarreau2dd0d472006-06-29 17:53:05 +02001043#endif /* _COMMON_STANDARD_H */