Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 1 | /* |
Willy Tarreau | cc05fba | 2009-10-27 21:40:18 +0100 | [diff] [blame] | 2 | * include/common/standard.h |
| 3 | * This files contains some general purpose functions and macros. |
| 4 | * |
Willy Tarreau | 348238b | 2010-01-18 15:05:57 +0100 | [diff] [blame] | 5 | * Copyright (C) 2000-2010 Willy Tarreau - w@1wt.eu |
Willy Tarreau | cc05fba | 2009-10-27 21:40:18 +0100 | [diff] [blame] | 6 | * |
| 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 Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 21 | |
Willy Tarreau | 2dd0d47 | 2006-06-29 17:53:05 +0200 | [diff] [blame] | 22 | #ifndef _COMMON_STANDARD_H |
| 23 | #define _COMMON_STANDARD_H |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 24 | |
Willy Tarreau | 167d8b5 | 2007-04-09 22:16:12 +0200 | [diff] [blame] | 25 | #include <limits.h> |
Willy Tarreau | 050737f | 2010-01-14 11:40:12 +0100 | [diff] [blame] | 26 | #include <string.h> |
Willy Tarreau | fe94460 | 2007-10-25 10:34:16 +0200 | [diff] [blame] | 27 | #include <time.h> |
Willy Tarreau | 938b303 | 2007-05-10 06:39:03 +0200 | [diff] [blame] | 28 | #include <sys/types.h> |
Willy Tarreau | d50265a | 2012-09-04 14:18:33 +0200 | [diff] [blame] | 29 | #include <sys/socket.h> |
Willy Tarreau | dd2f85e | 2012-09-02 22:34:23 +0200 | [diff] [blame] | 30 | #include <sys/un.h> |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 31 | #include <netinet/in.h> |
Willy Tarreau | e3ba5f0 | 2006-06-29 18:54:54 +0200 | [diff] [blame] | 32 | #include <common/config.h> |
Willy Tarreau | 45cb4fb | 2009-10-26 21:10:04 +0100 | [diff] [blame] | 33 | #include <eb32tree.h> |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 34 | |
William Lallemand | e7340ec | 2012-01-24 11:15:39 +0100 | [diff] [blame] | 35 | #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 | |
Willy Tarreau | 56adcf2 | 2012-12-23 18:00:29 +0100 | [diff] [blame] | 44 | /* number of itoa_str entries */ |
| 45 | #define NB_ITOA_STR 10 |
William Lallemand | e7340ec | 2012-01-24 11:15:39 +0100 | [diff] [blame] | 46 | |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 47 | /****** string-specific macros and functions ******/ |
| 48 | /* if a > max, then bound <a> to <max>. The macro returns the new <a> */ |
| 49 | #define UBOUND(a, max) ({ typeof(a) b = (max); if ((a) > b) (a) = b; (a); }) |
| 50 | |
| 51 | /* if a < min, then bound <a> to <min>. The macro returns the new <a> */ |
| 52 | #define LBOUND(a, min) ({ typeof(a) b = (min); if ((a) < b) (a) = b; (a); }) |
| 53 | |
| 54 | /* returns 1 only if only zero or one bit is set in X, which means that X is a |
| 55 | * power of 2, and 0 otherwise */ |
| 56 | #define POWEROF2(x) (((x) & ((x)-1)) == 0) |
| 57 | |
Willy Tarreau | 5b18020 | 2010-07-18 10:40:48 +0200 | [diff] [blame] | 58 | /* operators to compare values. They're ordered that way so that the lowest bit |
| 59 | * serves as a negation for the test and contains all tests that are not equal. |
| 60 | */ |
| 61 | enum { |
| 62 | STD_OP_LE = 0, STD_OP_GT = 1, |
| 63 | STD_OP_EQ = 2, STD_OP_NE = 3, |
| 64 | STD_OP_GE = 4, STD_OP_LT = 5, |
| 65 | }; |
| 66 | |
Willy Tarreau | 56adcf2 | 2012-12-23 18:00:29 +0100 | [diff] [blame] | 67 | extern int itoa_idx; /* index of next itoa_str to use */ |
| 68 | |
Willy Tarreau | 7d58a63 | 2007-01-13 23:06:06 +0100 | [diff] [blame] | 69 | /* |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 70 | * copies at most <size-1> chars from <src> to <dst>. Last char is always |
| 71 | * set to 0, unless <size> is 0. The number of chars copied is returned |
| 72 | * (excluding the terminating zero). |
| 73 | * This code has been optimized for size and speed : on x86, it's 45 bytes |
| 74 | * long, uses only registers, and consumes only 4 cycles per char. |
| 75 | */ |
| 76 | extern int strlcpy2(char *dst, const char *src, int size); |
| 77 | |
| 78 | /* |
Willy Tarreau | 72d759c | 2007-10-25 12:14:10 +0200 | [diff] [blame] | 79 | * This function simply returns a locally allocated string containing |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 80 | * the ascii representation for number 'n' in decimal. |
| 81 | */ |
Willy Tarreau | e7239b5 | 2009-03-29 13:41:58 +0200 | [diff] [blame] | 82 | extern char itoa_str[][171]; |
Emeric Brun | 3a7fce5 | 2010-01-04 14:54:38 +0100 | [diff] [blame] | 83 | extern char *ultoa_r(unsigned long n, char *buffer, int size); |
Willy Tarreau | e7239b5 | 2009-03-29 13:41:58 +0200 | [diff] [blame] | 84 | extern const char *ulltoh_r(unsigned long long n, char *buffer, int size); |
Willy Tarreau | 72d759c | 2007-10-25 12:14:10 +0200 | [diff] [blame] | 85 | static inline const char *ultoa(unsigned long n) |
| 86 | { |
| 87 | return ultoa_r(n, itoa_str[0], sizeof(itoa_str[0])); |
| 88 | } |
| 89 | |
William Lallemand | e7340ec | 2012-01-24 11:15:39 +0100 | [diff] [blame] | 90 | /* |
| 91 | * unsigned long long ASCII representation |
| 92 | * |
| 93 | * return the last char '\0' or NULL if no enough |
| 94 | * space in dst |
| 95 | */ |
| 96 | char *ulltoa(unsigned long long n, char *dst, size_t size); |
| 97 | |
| 98 | |
| 99 | /* |
| 100 | * unsigned long ASCII representation |
| 101 | * |
| 102 | * return the last char '\0' or NULL if no enough |
| 103 | * space in dst |
| 104 | */ |
| 105 | char *ultoa_o(unsigned long n, char *dst, size_t size); |
| 106 | |
| 107 | /* |
| 108 | * signed long ASCII representation |
| 109 | * |
| 110 | * return the last char '\0' or NULL if no enough |
| 111 | * space in dst |
| 112 | */ |
| 113 | char *ltoa_o(long int n, char *dst, size_t size); |
| 114 | |
| 115 | /* |
| 116 | * signed long long ASCII representation |
| 117 | * |
| 118 | * return the last char '\0' or NULL if no enough |
| 119 | * space in dst |
| 120 | */ |
| 121 | char *lltoa(long long n, char *dst, size_t size); |
| 122 | |
| 123 | /* |
| 124 | * write a ascii representation of a unsigned into dst, |
| 125 | * return a pointer to the last character |
| 126 | * Pad the ascii representation with '0', using size. |
| 127 | */ |
| 128 | char *utoa_pad(unsigned int n, char *dst, size_t size); |
| 129 | |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 130 | /* |
Willy Tarreau | 91092e5 | 2007-10-25 16:58:42 +0200 | [diff] [blame] | 131 | * This function simply returns a locally allocated string containing the ascii |
| 132 | * representation for number 'n' in decimal, unless n is 0 in which case it |
| 133 | * returns the alternate string (or an empty string if the alternate string is |
| 134 | * NULL). It use is intended for limits reported in reports, where it's |
| 135 | * desirable not to display anything if there is no limit. Warning! it shares |
| 136 | * the same vector as ultoa_r(). |
| 137 | */ |
| 138 | extern const char *limit_r(unsigned long n, char *buffer, int size, const char *alt); |
| 139 | |
Willy Tarreau | 56adcf2 | 2012-12-23 18:00:29 +0100 | [diff] [blame] | 140 | /* returns a locally allocated string containing the ASCII representation of |
| 141 | * the number 'n' in decimal. Up to NB_ITOA_STR calls may be used in the same |
| 142 | * function call (eg: printf), shared with the other similar functions making |
| 143 | * use of itoa_str[]. |
| 144 | */ |
| 145 | static inline const char *U2A(unsigned long n) |
| 146 | { |
| 147 | const char *ret = ultoa_r(n, itoa_str[itoa_idx], sizeof(itoa_str[0])); |
| 148 | if (++itoa_idx >= NB_ITOA_STR) |
| 149 | itoa_idx = 0; |
| 150 | return ret; |
| 151 | } |
| 152 | |
| 153 | /* returns a locally allocated string containing the HTML representation of |
| 154 | * the number 'n' in decimal. Up to NB_ITOA_STR calls may be used in the same |
| 155 | * function call (eg: printf), shared with the other similar functions making |
| 156 | * use of itoa_str[]. |
Willy Tarreau | 91092e5 | 2007-10-25 16:58:42 +0200 | [diff] [blame] | 157 | */ |
Willy Tarreau | 56adcf2 | 2012-12-23 18:00:29 +0100 | [diff] [blame] | 158 | static inline const char *U2H(unsigned long long n) |
| 159 | { |
| 160 | const char *ret = ulltoh_r(n, itoa_str[itoa_idx], sizeof(itoa_str[0])); |
| 161 | if (++itoa_idx >= NB_ITOA_STR) |
| 162 | itoa_idx = 0; |
| 163 | return ret; |
| 164 | } |
| 165 | |
| 166 | /* returns a locally allocated string containing the HTML representation of |
| 167 | * the number 'n' in decimal. Up to NB_ITOA_STR calls may be used in the same |
| 168 | * function call (eg: printf), shared with the other similar functions making |
| 169 | * use of itoa_str[]. |
| 170 | */ |
| 171 | static inline const char *LIM2A(unsigned long n, const char *alt) |
| 172 | { |
| 173 | const char *ret = limit_r(n, itoa_str[itoa_idx], sizeof(itoa_str[0]), alt); |
| 174 | if (++itoa_idx >= NB_ITOA_STR) |
| 175 | itoa_idx = 0; |
| 176 | return ret; |
| 177 | } |
Willy Tarreau | 91092e5 | 2007-10-25 16:58:42 +0200 | [diff] [blame] | 178 | |
| 179 | /* |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 180 | * Returns non-zero if character <s> is a hex digit (0-9, a-f, A-F), else zero. |
| 181 | */ |
| 182 | extern int ishex(char s); |
| 183 | |
| 184 | /* |
Willy Tarreau | da3b7c3 | 2009-11-02 20:12:52 +0100 | [diff] [blame] | 185 | * Return integer equivalent of character <c> for a hex digit (0-9, a-f, A-F), |
Willy Tarreau | 3dd0c4e | 2012-10-26 00:58:22 +0200 | [diff] [blame] | 186 | * otherwise -1. This compact form helps gcc produce efficient code. |
Willy Tarreau | da3b7c3 | 2009-11-02 20:12:52 +0100 | [diff] [blame] | 187 | */ |
Willy Tarreau | 3dd0c4e | 2012-10-26 00:58:22 +0200 | [diff] [blame] | 188 | static inline int hex2i(int c) |
| 189 | { |
Willy Tarreau | 0161d62 | 2013-04-02 01:26:55 +0200 | [diff] [blame] | 190 | if (unlikely((unsigned char)(c -= '0') > 9)) { |
| 191 | if (likely((unsigned char)(c -= 'A' - '0') > 5 && |
| 192 | (unsigned char)(c -= 'a' - 'A') > 5)) |
Willy Tarreau | 3dd0c4e | 2012-10-26 00:58:22 +0200 | [diff] [blame] | 193 | c = -11; |
| 194 | c += 10; |
| 195 | } |
| 196 | return c; |
| 197 | } |
| 198 | |
Willy Tarreau | da3b7c3 | 2009-11-02 20:12:52 +0100 | [diff] [blame] | 199 | |
| 200 | /* |
Willy Tarreau | 2e74c3f | 2007-12-02 18:45:09 +0100 | [diff] [blame] | 201 | * Checks <name> for invalid characters. Valid chars are [A-Za-z0-9_:.-]. If an |
| 202 | * invalid character is found, a pointer to it is returned. If everything is |
| 203 | * fine, NULL is returned. |
| 204 | */ |
| 205 | extern const char *invalid_char(const char *name); |
| 206 | |
| 207 | /* |
Krzysztof Piotr Oledzki | efe3b6f | 2008-05-23 23:49:32 +0200 | [diff] [blame] | 208 | * Checks <domainname> for invalid characters. Valid chars are [A-Za-z0-9_.-]. |
| 209 | * If an invalid character is found, a pointer to it is returned. |
| 210 | * If everything is fine, NULL is returned. |
| 211 | */ |
| 212 | extern const char *invalid_domainchar(const char *name); |
| 213 | |
| 214 | /* |
Willy Tarreau | fab5a43 | 2011-03-04 15:31:53 +0100 | [diff] [blame] | 215 | * converts <str> to a locally allocated struct sockaddr_storage *, and a |
Willy Tarreau | c6f4ce8 | 2009-06-10 11:09:37 +0200 | [diff] [blame] | 216 | * port range consisting in two integers. The low and high end are always set |
| 217 | * even if the port is unspecified, in which case (0,0) is returned. The low |
Willy Tarreau | fab5a43 | 2011-03-04 15:31:53 +0100 | [diff] [blame] | 218 | * port is set in the sockaddr. Thus, it is enough to check the size of the |
Willy Tarreau | c6f4ce8 | 2009-06-10 11:09:37 +0200 | [diff] [blame] | 219 | * returned range to know if an array must be allocated or not. The format is |
Willy Tarreau | fab5a43 | 2011-03-04 15:31:53 +0100 | [diff] [blame] | 220 | * "addr[:[port[-port]]]", where "addr" can be a dotted IPv4 address, an IPv6 |
| 221 | * 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. |
Willy Tarreau | d393a62 | 2013-03-04 18:22:00 +0100 | [diff] [blame] | 225 | * If <pfx> is non-null, it is used as a string prefix before any path-based |
| 226 | * address (typically the path to a unix socket). |
Willy Tarreau | c6f4ce8 | 2009-06-10 11:09:37 +0200 | [diff] [blame] | 227 | */ |
Willy Tarreau | d393a62 | 2013-03-04 18:22:00 +0100 | [diff] [blame] | 228 | struct sockaddr_storage *str2sa_range(const char *str, int *low, int *high, char **err, const char *pfx); |
Willy Tarreau | c6f4ce8 | 2009-06-10 11:09:37 +0200 | [diff] [blame] | 229 | |
Willy Tarreau | 2937c0d | 2010-01-26 17:36:17 +0100 | [diff] [blame] | 230 | /* converts <str> to a struct in_addr containing a network mask. It can be |
| 231 | * passed in dotted form (255.255.255.0) or in CIDR form (24). It returns 1 |
| 232 | * if the conversion succeeds otherwise non-zero. |
| 233 | */ |
| 234 | int str2mask(const char *str, struct in_addr *mask); |
| 235 | |
Willy Tarreau | c6f4ce8 | 2009-06-10 11:09:37 +0200 | [diff] [blame] | 236 | /* |
Willy Tarreau | d077a8e | 2007-05-08 18:28:09 +0200 | [diff] [blame] | 237 | * converts <str> to two struct in_addr* which must be pre-allocated. |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 238 | * The format is "addr[/mask]", where "addr" cannot be empty, and mask |
| 239 | * is optionnal and either in the dotted or CIDR notation. |
| 240 | * Note: "addr" can also be a hostname. Returns 1 if OK, 0 if error. |
| 241 | */ |
Willy Tarreau | d077a8e | 2007-05-08 18:28:09 +0200 | [diff] [blame] | 242 | int str2net(const char *str, struct in_addr *addr, struct in_addr *mask); |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 243 | |
Alexandre Cassen | 5eb1a90 | 2007-11-29 15:43:32 +0100 | [diff] [blame] | 244 | /* |
Willy Tarreau | 6d20e28 | 2012-04-27 22:49:47 +0200 | [diff] [blame] | 245 | * converts <str> to two struct in6_addr* which must be pre-allocated. |
| 246 | * The format is "addr[/mask]", where "addr" cannot be empty, and mask |
| 247 | * is an optionnal number of bits (128 being the default). |
| 248 | * Returns 1 if OK, 0 if error. |
| 249 | */ |
| 250 | int str62net(const char *str, struct in6_addr *addr, unsigned char *mask); |
| 251 | |
| 252 | /* |
Willy Tarreau | 106f979 | 2009-09-19 07:54:16 +0200 | [diff] [blame] | 253 | * Parse IP address found in url. |
| 254 | */ |
David du Colombier | 6f5ccb1 | 2011-03-10 22:26:24 +0100 | [diff] [blame] | 255 | int url2ipv4(const char *addr, struct in_addr *dst); |
Willy Tarreau | 106f979 | 2009-09-19 07:54:16 +0200 | [diff] [blame] | 256 | |
| 257 | /* |
David du Colombier | 6f5ccb1 | 2011-03-10 22:26:24 +0100 | [diff] [blame] | 258 | * Resolve destination server from URL. Convert <str> to a sockaddr_storage*. |
Alexandre Cassen | 5eb1a90 | 2007-11-29 15:43:32 +0100 | [diff] [blame] | 259 | */ |
David du Colombier | 6f5ccb1 | 2011-03-10 22:26:24 +0100 | [diff] [blame] | 260 | int url2sa(const char *url, int ulen, struct sockaddr_storage *addr); |
Alexandre Cassen | 5eb1a90 | 2007-11-29 15:43:32 +0100 | [diff] [blame] | 261 | |
Willy Tarreau | 631f01c | 2011-09-05 00:36:48 +0200 | [diff] [blame] | 262 | /* Tries to convert a sockaddr_storage address to text form. Upon success, the |
| 263 | * address family is returned so that it's easy for the caller to adapt to the |
| 264 | * output format. Zero is returned if the address family is not supported. -1 |
| 265 | * is returned upon error, with errno set. AF_INET, AF_INET6 and AF_UNIX are |
| 266 | * supported. |
| 267 | */ |
| 268 | int addr_to_str(struct sockaddr_storage *addr, char *str, int size); |
| 269 | |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 270 | /* will try to encode the string <string> replacing all characters tagged in |
| 271 | * <map> with the hexadecimal representation of their ASCII-code (2 digits) |
| 272 | * prefixed by <escape>, and will store the result between <start> (included) |
| 273 | * and <stop> (excluded), and will always terminate the string with a '\0' |
| 274 | * before <stop>. The position of the '\0' is returned if the conversion |
| 275 | * completes. If bytes are missing between <start> and <stop>, then the |
| 276 | * conversion will be incomplete and truncated. If <stop> <= <start>, the '\0' |
| 277 | * cannot even be stored so we return <start> without writing the 0. |
| 278 | * The input string must also be zero-terminated. |
| 279 | */ |
| 280 | extern const char hextab[]; |
| 281 | char *encode_string(char *start, char *stop, |
| 282 | const char escape, const fd_set *map, |
| 283 | const char *string); |
| 284 | |
Willy Tarreau | bf9c2fc | 2011-05-31 18:06:18 +0200 | [diff] [blame] | 285 | /* Decode an URL-encoded string in-place. The resulting string might |
| 286 | * be shorter. If some forbidden characters are found, the conversion is |
| 287 | * aborted, the string is truncated before the issue and non-zero is returned, |
| 288 | * otherwise the operation returns non-zero indicating success. |
| 289 | */ |
| 290 | int url_decode(char *string); |
| 291 | |
Willy Tarreau | 6911fa4 | 2007-03-04 18:06:08 +0100 | [diff] [blame] | 292 | /* This one is 6 times faster than strtoul() on athlon, but does |
| 293 | * no check at all. |
| 294 | */ |
| 295 | static inline unsigned int __str2ui(const char *s) |
| 296 | { |
| 297 | unsigned int i = 0; |
| 298 | while (*s) { |
| 299 | i = i * 10 - '0'; |
| 300 | i += (unsigned char)*s++; |
| 301 | } |
| 302 | return i; |
| 303 | } |
| 304 | |
| 305 | /* This one is 5 times faster than strtoul() on athlon with checks. |
| 306 | * It returns the value of the number composed of all valid digits read. |
| 307 | */ |
| 308 | static inline unsigned int __str2uic(const char *s) |
| 309 | { |
| 310 | unsigned int i = 0; |
| 311 | unsigned int j; |
| 312 | while (1) { |
| 313 | j = (*s++) - '0'; |
| 314 | if (j > 9) |
| 315 | break; |
| 316 | i *= 10; |
| 317 | i += j; |
| 318 | } |
| 319 | return i; |
| 320 | } |
| 321 | |
| 322 | /* This one is 28 times faster than strtoul() on athlon, but does |
| 323 | * no check at all! |
| 324 | */ |
| 325 | static inline unsigned int __strl2ui(const char *s, int len) |
| 326 | { |
| 327 | unsigned int i = 0; |
| 328 | while (len-- > 0) { |
| 329 | i = i * 10 - '0'; |
| 330 | i += (unsigned char)*s++; |
| 331 | } |
| 332 | return i; |
| 333 | } |
| 334 | |
| 335 | /* This one is 7 times faster than strtoul() on athlon with checks. |
| 336 | * It returns the value of the number composed of all valid digits read. |
| 337 | */ |
| 338 | static inline unsigned int __strl2uic(const char *s, int len) |
| 339 | { |
| 340 | unsigned int i = 0; |
Willy Tarreau | 3f0c976 | 2007-10-25 09:42:24 +0200 | [diff] [blame] | 341 | unsigned int j, k; |
Willy Tarreau | 6911fa4 | 2007-03-04 18:06:08 +0100 | [diff] [blame] | 342 | |
| 343 | while (len-- > 0) { |
| 344 | j = (*s++) - '0'; |
Willy Tarreau | 3f0c976 | 2007-10-25 09:42:24 +0200 | [diff] [blame] | 345 | k = i * 10; |
Willy Tarreau | 6911fa4 | 2007-03-04 18:06:08 +0100 | [diff] [blame] | 346 | if (j > 9) |
| 347 | break; |
Willy Tarreau | 3f0c976 | 2007-10-25 09:42:24 +0200 | [diff] [blame] | 348 | i = k + j; |
Willy Tarreau | 6911fa4 | 2007-03-04 18:06:08 +0100 | [diff] [blame] | 349 | } |
| 350 | return i; |
| 351 | } |
| 352 | |
Willy Tarreau | 4ec83cd | 2010-10-15 23:19:55 +0200 | [diff] [blame] | 353 | /* This function reads an unsigned integer from the string pointed to by <s> |
| 354 | * and returns it. The <s> pointer is adjusted to point to the first unread |
| 355 | * char. The function automatically stops at <end>. |
| 356 | */ |
| 357 | static inline unsigned int __read_uint(const char **s, const char *end) |
| 358 | { |
| 359 | const char *ptr = *s; |
| 360 | unsigned int i = 0; |
| 361 | unsigned int j, k; |
| 362 | |
| 363 | while (ptr < end) { |
| 364 | j = *ptr - '0'; |
| 365 | k = i * 10; |
| 366 | if (j > 9) |
| 367 | break; |
| 368 | i = k + j; |
| 369 | ptr++; |
| 370 | } |
| 371 | *s = ptr; |
| 372 | return i; |
| 373 | } |
| 374 | |
Willy Tarreau | 6911fa4 | 2007-03-04 18:06:08 +0100 | [diff] [blame] | 375 | extern unsigned int str2ui(const char *s); |
| 376 | extern unsigned int str2uic(const char *s); |
| 377 | extern unsigned int strl2ui(const char *s, int len); |
| 378 | extern unsigned int strl2uic(const char *s, int len); |
| 379 | extern int strl2ic(const char *s, int len); |
| 380 | extern int strl2irc(const char *s, int len, int *ret); |
| 381 | extern int strl2llrc(const char *s, int len, long long *ret); |
Willy Tarreau | 4ec83cd | 2010-10-15 23:19:55 +0200 | [diff] [blame] | 382 | extern unsigned int read_uint(const char **s, const char *end); |
Willy Tarreau | d54bbdc | 2009-09-07 11:00:31 +0200 | [diff] [blame] | 383 | unsigned int inetaddr_host(const char *text); |
| 384 | unsigned int inetaddr_host_lim(const char *text, const char *stop); |
Willy Tarreau | 7417275 | 2010-10-15 23:21:42 +0200 | [diff] [blame] | 385 | unsigned int inetaddr_host_lim_ret(char *text, char *stop, char **ret); |
Willy Tarreau | 6911fa4 | 2007-03-04 18:06:08 +0100 | [diff] [blame] | 386 | |
Krzysztof Piotr Oledzki | 3d5562b | 2009-10-10 20:11:17 +0200 | [diff] [blame] | 387 | static inline char *cut_crlf(char *s) { |
| 388 | |
Simon Horman | 5269cfb | 2013-02-13 17:48:00 +0900 | [diff] [blame] | 389 | while (*s != '\r' && *s != '\n') { |
Krzysztof Piotr Oledzki | 3d5562b | 2009-10-10 20:11:17 +0200 | [diff] [blame] | 390 | char *p = s++; |
| 391 | |
| 392 | if (!*p) |
| 393 | return p; |
| 394 | } |
| 395 | |
Simon Horman | 5269cfb | 2013-02-13 17:48:00 +0900 | [diff] [blame] | 396 | *s++ = '\0'; |
Krzysztof Piotr Oledzki | 3d5562b | 2009-10-10 20:11:17 +0200 | [diff] [blame] | 397 | |
| 398 | return s; |
| 399 | } |
| 400 | |
| 401 | static inline char *ltrim(char *s, char c) { |
| 402 | |
| 403 | if (c) |
| 404 | while (*s == c) |
| 405 | s++; |
| 406 | |
| 407 | return s; |
| 408 | } |
| 409 | |
| 410 | static inline char *rtrim(char *s, char c) { |
| 411 | |
| 412 | char *p = s + strlen(s); |
| 413 | |
| 414 | while (p-- > s) |
| 415 | if (*p == c) |
| 416 | *p = '\0'; |
| 417 | else |
| 418 | break; |
| 419 | |
| 420 | return s; |
| 421 | } |
| 422 | |
| 423 | static inline char *alltrim(char *s, char c) { |
| 424 | |
| 425 | rtrim(s, c); |
| 426 | |
| 427 | return ltrim(s, c); |
| 428 | } |
| 429 | |
Willy Tarreau | fe94460 | 2007-10-25 10:34:16 +0200 | [diff] [blame] | 430 | /* This function converts the time_t value <now> into a broken out struct tm |
| 431 | * which must be allocated by the caller. It is highly recommended to use this |
| 432 | * function intead of localtime() because that one requires a time_t* which |
| 433 | * is not always compatible with tv_sec depending on OS/hardware combinations. |
| 434 | */ |
| 435 | static inline void get_localtime(const time_t now, struct tm *tm) |
| 436 | { |
| 437 | localtime_r(&now, tm); |
| 438 | } |
| 439 | |
Emeric Brun | 3a058f3 | 2009-06-30 18:26:00 +0200 | [diff] [blame] | 440 | /* This function converts the time_t value <now> into a broken out struct tm |
| 441 | * which must be allocated by the caller. It is highly recommended to use this |
| 442 | * function intead of gmtime() because that one requires a time_t* which |
| 443 | * is not always compatible with tv_sec depending on OS/hardware combinations. |
| 444 | */ |
| 445 | static inline void get_gmtime(const time_t now, struct tm *tm) |
| 446 | { |
| 447 | gmtime_r(&now, tm); |
| 448 | } |
| 449 | |
Willy Tarreau | a0d37b6 | 2007-12-02 22:00:35 +0100 | [diff] [blame] | 450 | /* This function parses a time value optionally followed by a unit suffix among |
| 451 | * "d", "h", "m", "s", "ms" or "us". It converts the value into the unit |
| 452 | * expected by the caller. The computation does its best to avoid overflows. |
| 453 | * The value is returned in <ret> if everything is fine, and a NULL is returned |
| 454 | * by the function. In case of error, a pointer to the error is returned and |
| 455 | * <ret> is left untouched. |
| 456 | */ |
| 457 | extern const char *parse_time_err(const char *text, unsigned *ret, unsigned unit_flags); |
Emeric Brun | 39132b2 | 2010-01-04 14:57:24 +0100 | [diff] [blame] | 458 | extern const char *parse_size_err(const char *text, unsigned *ret); |
Willy Tarreau | a0d37b6 | 2007-12-02 22:00:35 +0100 | [diff] [blame] | 459 | |
| 460 | /* unit flags to pass to parse_time_err */ |
| 461 | #define TIME_UNIT_US 0x0000 |
| 462 | #define TIME_UNIT_MS 0x0001 |
| 463 | #define TIME_UNIT_S 0x0002 |
| 464 | #define TIME_UNIT_MIN 0x0003 |
| 465 | #define TIME_UNIT_HOUR 0x0004 |
| 466 | #define TIME_UNIT_DAY 0x0005 |
| 467 | #define TIME_UNIT_MASK 0x0007 |
| 468 | |
William Lallemand | 421f5b5 | 2012-02-06 18:15:57 +0100 | [diff] [blame] | 469 | #define SEC 1 |
| 470 | #define MINUTE (60 * SEC) |
| 471 | #define HOUR (60 * MINUTE) |
| 472 | #define DAY (24 * HOUR) |
| 473 | |
Willy Tarreau | 7f062c4 | 2009-03-05 18:43:00 +0100 | [diff] [blame] | 474 | /* Multiply the two 32-bit operands and shift the 64-bit result right 32 bits. |
| 475 | * This is used to compute fixed ratios by setting one of the operands to |
| 476 | * (2^32*ratio). |
| 477 | */ |
| 478 | static inline unsigned int mul32hi(unsigned int a, unsigned int b) |
| 479 | { |
| 480 | return ((unsigned long long)a * b) >> 32; |
| 481 | } |
| 482 | |
Willy Tarreau | f0d9eec | 2010-06-20 07:12:37 +0200 | [diff] [blame] | 483 | /* gcc does not know when it can safely divide 64 bits by 32 bits. Use this |
| 484 | * function when you know for sure that the result fits in 32 bits, because |
| 485 | * it is optimal on x86 and on 64bit processors. |
| 486 | */ |
| 487 | static inline unsigned int div64_32(unsigned long long o1, unsigned int o2) |
| 488 | { |
| 489 | unsigned int result; |
| 490 | #ifdef __i386__ |
| 491 | asm("divl %2" |
| 492 | : "=a" (result) |
| 493 | : "A"(o1), "rm"(o2)); |
| 494 | #else |
| 495 | result = o1 / o2; |
| 496 | #endif |
| 497 | return result; |
| 498 | } |
| 499 | |
Willy Tarreau | 37994f0 | 2012-11-19 12:11:07 +0100 | [diff] [blame] | 500 | /* Simple popcount implementation. It returns the number of ones in a word */ |
| 501 | static inline unsigned int popcount(unsigned int a) |
| 502 | { |
| 503 | unsigned int cnt; |
| 504 | for (cnt = 0; a; a >>= 1) { |
| 505 | if (a & 1) |
| 506 | cnt++; |
| 507 | } |
| 508 | return cnt; |
| 509 | } |
| 510 | |
Willy Tarreau | 126d406 | 2013-12-03 17:50:47 +0100 | [diff] [blame] | 511 | /* |
| 512 | * Parse binary string written in hexadecimal (source) and store the decoded |
| 513 | * result into binstr and set binstrlen to the lengh of binstr. Memory for |
| 514 | * binstr is allocated by the function. In case of error, returns 0 with an |
| 515 | * error message in err. |
| 516 | */ |
| 517 | int parse_binary(const char *source, char **binstr, int *binstrlen, char **err); |
| 518 | |
Willy Tarreau | 946ba59 | 2009-05-10 15:41:18 +0200 | [diff] [blame] | 519 | /* copies at most <n> characters from <src> and always terminates with '\0' */ |
| 520 | char *my_strndup(const char *src, int n); |
| 521 | |
Baptiste Assmann | bb77c8e | 2013-10-06 23:24:13 +0200 | [diff] [blame] | 522 | /* |
| 523 | * search needle in haystack |
| 524 | * returns the pointer if found, returns NULL otherwise |
| 525 | */ |
| 526 | const void *my_memmem(const void *, size_t, const void *, size_t); |
| 527 | |
Willy Tarreau | 482b00d | 2009-10-04 22:48:42 +0200 | [diff] [blame] | 528 | /* This function returns the first unused key greater than or equal to <key> in |
| 529 | * ID tree <root>. Zero is returned if no place is found. |
| 530 | */ |
| 531 | unsigned int get_next_id(struct eb_root *root, unsigned int key); |
| 532 | |
Willy Tarreau | 348238b | 2010-01-18 15:05:57 +0100 | [diff] [blame] | 533 | /* This function compares a sample word possibly followed by blanks to another |
| 534 | * clean word. The compare is case-insensitive. 1 is returned if both are equal, |
| 535 | * otherwise zero. This intends to be used when checking HTTP headers for some |
| 536 | * values. |
| 537 | */ |
| 538 | int word_match(const char *sample, int slen, const char *word, int wlen); |
| 539 | |
Willy Tarreau | f0b38bf | 2010-06-06 13:22:23 +0200 | [diff] [blame] | 540 | /* Convert a fixed-length string to an IP address. Returns 0 in case of error, |
| 541 | * or the number of chars read in case of success. |
| 542 | */ |
| 543 | int buf2ip(const char *buf, size_t len, struct in_addr *dst); |
Thierry FOURNIER | d559dd8 | 2013-11-22 16:16:59 +0100 | [diff] [blame] | 544 | int buf2ip6(const char *buf, size_t len, struct in6_addr *dst); |
Willy Tarreau | f0b38bf | 2010-06-06 13:22:23 +0200 | [diff] [blame] | 545 | |
Willy Tarreau | acf9577 | 2010-06-14 19:09:21 +0200 | [diff] [blame] | 546 | /* To be used to quote config arg positions. Returns the string at <ptr> |
| 547 | * surrounded by simple quotes if <ptr> is valid and non-empty, or "end of line" |
| 548 | * if ptr is NULL or empty. The string is locally allocated. |
| 549 | */ |
| 550 | const char *quote_arg(const char *ptr); |
| 551 | |
Willy Tarreau | 5b18020 | 2010-07-18 10:40:48 +0200 | [diff] [blame] | 552 | /* returns an operator among STD_OP_* for string <str> or < 0 if unknown */ |
| 553 | int get_std_op(const char *str); |
| 554 | |
Willy Tarreau | 4c14eaa | 2010-11-24 14:01:45 +0100 | [diff] [blame] | 555 | /* hash a 32-bit integer to another 32-bit integer */ |
| 556 | extern unsigned int full_hash(unsigned int a); |
| 557 | static inline unsigned int __full_hash(unsigned int a) |
| 558 | { |
| 559 | /* This function is one of Bob Jenkins' full avalanche hashing |
| 560 | * functions, which when provides quite a good distribution for little |
| 561 | * input variations. The result is quite suited to fit over a 32-bit |
| 562 | * space with enough variations so that a randomly picked number falls |
| 563 | * equally before any server position. |
| 564 | * Check http://burtleburtle.net/bob/hash/integer.html for more info. |
| 565 | */ |
| 566 | a = (a+0x7ed55d16) + (a<<12); |
| 567 | a = (a^0xc761c23c) ^ (a>>19); |
| 568 | a = (a+0x165667b1) + (a<<5); |
| 569 | a = (a+0xd3a2646c) ^ (a<<9); |
| 570 | a = (a+0xfd7046c5) + (a<<3); |
| 571 | a = (a^0xb55a4f09) ^ (a>>16); |
| 572 | |
| 573 | /* ensure values are better spread all around the tree by multiplying |
| 574 | * by a large prime close to 3/4 of the tree. |
| 575 | */ |
| 576 | return a * 3221225473U; |
| 577 | } |
| 578 | |
Willy Tarreau | 422a0a5 | 2012-10-26 19:47:23 +0200 | [diff] [blame] | 579 | /* sets the address family to AF_UNSPEC so that is_addr() does not match */ |
| 580 | static inline void clear_addr(struct sockaddr_storage *addr) |
| 581 | { |
| 582 | addr->ss_family = AF_UNSPEC; |
| 583 | } |
| 584 | |
David du Colombier | 6f5ccb1 | 2011-03-10 22:26:24 +0100 | [diff] [blame] | 585 | /* returns non-zero if addr has a valid and non-null IPv4 or IPv6 address, |
| 586 | * otherwise zero. |
| 587 | */ |
| 588 | static inline int is_addr(struct sockaddr_storage *addr) |
| 589 | { |
| 590 | int i; |
| 591 | |
| 592 | switch (addr->ss_family) { |
| 593 | case AF_INET: |
David du Colombier | 64e9c90 | 2011-03-22 11:39:41 +0100 | [diff] [blame] | 594 | return *(int *)&((struct sockaddr_in *)addr)->sin_addr; |
David du Colombier | 6f5ccb1 | 2011-03-10 22:26:24 +0100 | [diff] [blame] | 595 | case AF_INET6: |
| 596 | for (i = 0; i < sizeof(struct in6_addr) / sizeof(int); i++) |
| 597 | if (((int *)&((struct sockaddr_in6 *)addr)->sin6_addr)[i] != 0) |
| 598 | return ((int *)&((struct sockaddr_in6 *)addr)->sin6_addr)[i]; |
| 599 | } |
| 600 | return 0; |
| 601 | } |
| 602 | |
David du Colombier | 11bcb6c | 2011-03-24 12:23:00 +0100 | [diff] [blame] | 603 | /* returns port in network byte order */ |
| 604 | static inline int get_net_port(struct sockaddr_storage *addr) |
| 605 | { |
| 606 | switch (addr->ss_family) { |
| 607 | case AF_INET: |
| 608 | return ((struct sockaddr_in *)addr)->sin_port; |
| 609 | case AF_INET6: |
| 610 | return ((struct sockaddr_in6 *)addr)->sin6_port; |
| 611 | } |
| 612 | return 0; |
| 613 | } |
| 614 | |
| 615 | /* returns port in host byte order */ |
| 616 | static inline int get_host_port(struct sockaddr_storage *addr) |
| 617 | { |
| 618 | switch (addr->ss_family) { |
| 619 | case AF_INET: |
| 620 | return ntohs(((struct sockaddr_in *)addr)->sin_port); |
| 621 | case AF_INET6: |
| 622 | return ntohs(((struct sockaddr_in6 *)addr)->sin6_port); |
| 623 | } |
| 624 | return 0; |
| 625 | } |
| 626 | |
Willy Tarreau | 1b4b7ce | 2011-04-05 16:56:50 +0200 | [diff] [blame] | 627 | /* returns address len for <addr>'s family, 0 for unknown families */ |
| 628 | static inline int get_addr_len(const struct sockaddr_storage *addr) |
| 629 | { |
| 630 | switch (addr->ss_family) { |
| 631 | case AF_INET: |
| 632 | return sizeof(struct sockaddr_in); |
| 633 | case AF_INET6: |
| 634 | return sizeof(struct sockaddr_in6); |
| 635 | case AF_UNIX: |
| 636 | return sizeof(struct sockaddr_un); |
| 637 | } |
| 638 | return 0; |
| 639 | } |
| 640 | |
David du Colombier | 11bcb6c | 2011-03-24 12:23:00 +0100 | [diff] [blame] | 641 | /* set port in host byte order */ |
| 642 | static inline int set_net_port(struct sockaddr_storage *addr, int port) |
| 643 | { |
| 644 | switch (addr->ss_family) { |
| 645 | case AF_INET: |
| 646 | ((struct sockaddr_in *)addr)->sin_port = port; |
| 647 | case AF_INET6: |
| 648 | ((struct sockaddr_in6 *)addr)->sin6_port = port; |
| 649 | } |
| 650 | return 0; |
| 651 | } |
| 652 | |
| 653 | /* set port in network byte order */ |
| 654 | static inline int set_host_port(struct sockaddr_storage *addr, int port) |
| 655 | { |
| 656 | switch (addr->ss_family) { |
| 657 | case AF_INET: |
| 658 | ((struct sockaddr_in *)addr)->sin_port = htons(port); |
| 659 | case AF_INET6: |
| 660 | ((struct sockaddr_in6 *)addr)->sin6_port = htons(port); |
| 661 | } |
| 662 | return 0; |
| 663 | } |
| 664 | |
David du Colombier | 4f92d32 | 2011-03-24 11:09:31 +0100 | [diff] [blame] | 665 | /* Return true if IPv4 address is part of the network */ |
| 666 | extern int in_net_ipv4(struct in_addr *addr, struct in_addr *mask, struct in_addr *net); |
| 667 | |
| 668 | /* Return true if IPv6 address is part of the network */ |
| 669 | extern int in_net_ipv6(struct in6_addr *addr, struct in6_addr *mask, struct in6_addr *net); |
| 670 | |
| 671 | /* Map IPv4 adress on IPv6 address, as specified in RFC 3513. */ |
| 672 | extern void v4tov6(struct in6_addr *sin6_addr, struct in_addr *sin_addr); |
| 673 | |
| 674 | /* Map IPv6 adress on IPv4 address, as specified in RFC 3513. |
| 675 | * Return true if conversion is possible and false otherwise. |
| 676 | */ |
| 677 | extern int v6tov4(struct in_addr *sin_addr, struct in6_addr *sin6_addr); |
| 678 | |
William Lallemand | 421f5b5 | 2012-02-06 18:15:57 +0100 | [diff] [blame] | 679 | char *human_time(int t, short hz_div); |
| 680 | |
| 681 | extern const char *monthname[]; |
| 682 | |
Yuxans Yao | 4e25b01 | 2012-10-19 10:36:09 +0800 | [diff] [blame] | 683 | /* numeric timezone (that is, the hour and minute offset from UTC) */ |
| 684 | char localtimezone[6]; |
| 685 | |
William Lallemand | 421f5b5 | 2012-02-06 18:15:57 +0100 | [diff] [blame] | 686 | /* date2str_log: write a date in the format : |
| 687 | * sprintf(str, "%02d/%s/%04d:%02d:%02d:%02d.%03d", |
| 688 | * tm.tm_mday, monthname[tm.tm_mon], tm.tm_year+1900, |
| 689 | * tm.tm_hour, tm.tm_min, tm.tm_sec, (int)date.tv_usec/1000); |
| 690 | * |
| 691 | * without using sprintf. return a pointer to the last char written (\0) or |
| 692 | * NULL if there isn't enough space. |
| 693 | */ |
| 694 | char *date2str_log(char *dest, struct tm *tm, struct timeval *date, size_t size); |
| 695 | |
| 696 | /* gmt2str_log: write a date in the format : |
| 697 | * "%02d/%s/%04d:%02d:%02d:%02d +0000" without using snprintf |
| 698 | * return a pointer to the last char written (\0) or |
| 699 | * NULL if there isn't enough space. |
| 700 | */ |
| 701 | char *gmt2str_log(char *dst, struct tm *tm, size_t size); |
| 702 | |
Yuxans Yao | 4e25b01 | 2012-10-19 10:36:09 +0800 | [diff] [blame] | 703 | /* localdate2str_log: write a date in the format : |
| 704 | * "%02d/%s/%04d:%02d:%02d:%02d +0000(local timezone)" without using snprintf |
| 705 | * return a pointer to the last char written (\0) or |
| 706 | * NULL if there isn't enough space. |
| 707 | */ |
| 708 | char *localdate2str_log(char *dst, struct tm *tm, size_t size); |
| 709 | |
Willy Tarreau | 9a7bea5 | 2012-04-27 11:16:50 +0200 | [diff] [blame] | 710 | /* Dynamically allocates a string of the proper length to hold the formatted |
| 711 | * output. NULL is returned on error. The caller is responsible for freeing the |
| 712 | * memory area using free(). The resulting string is returned in <out> if the |
| 713 | * pointer is not NULL. A previous version of <out> might be used to build the |
| 714 | * new string, and it will be freed before returning if it is not NULL, which |
| 715 | * makes it possible to build complex strings from iterative calls without |
| 716 | * having to care about freeing intermediate values, as in the example below : |
| 717 | * |
| 718 | * memprintf(&err, "invalid argument: '%s'", arg); |
| 719 | * ... |
| 720 | * memprintf(&err, "parser said : <%s>\n", *err); |
| 721 | * ... |
| 722 | * free(*err); |
| 723 | * |
| 724 | * This means that <err> must be initialized to NULL before first invocation. |
| 725 | * The return value also holds the allocated string, which eases error checking |
| 726 | * and immediate consumption. If the output pointer is not used, NULL must be |
Willy Tarreau | eb6cead | 2012-09-20 19:43:14 +0200 | [diff] [blame] | 727 | * passed instead and it will be ignored. The returned message will then also |
| 728 | * be NULL so that the caller does not have to bother with freeing anything. |
Willy Tarreau | 9a7bea5 | 2012-04-27 11:16:50 +0200 | [diff] [blame] | 729 | * |
| 730 | * It is also convenient to use it without any free except the last one : |
| 731 | * err = NULL; |
| 732 | * if (!fct1(err)) report(*err); |
| 733 | * if (!fct2(err)) report(*err); |
| 734 | * if (!fct3(err)) report(*err); |
| 735 | * free(*err); |
| 736 | */ |
| 737 | char *memprintf(char **out, const char *format, ...) |
| 738 | __attribute__ ((format(printf, 2, 3))); |
| 739 | |
Willy Tarreau | 21c705b | 2012-09-14 11:40:36 +0200 | [diff] [blame] | 740 | /* Used to add <level> spaces before each line of <out>, unless there is only one line. |
| 741 | * The input argument is automatically freed and reassigned. The result will have to be |
| 742 | * freed by the caller. |
| 743 | * Example of use : |
| 744 | * parse(cmd, &err); (callee: memprintf(&err, ...)) |
| 745 | * fprintf(stderr, "Parser said: %s\n", indent_error(&err)); |
| 746 | * free(err); |
| 747 | */ |
| 748 | char *indent_msg(char **out, int level); |
Willy Tarreau | 3d2f16f | 2012-05-13 00:21:17 +0200 | [diff] [blame] | 749 | |
Willy Tarreau | dad36a3 | 2013-03-11 01:20:04 +0100 | [diff] [blame] | 750 | /* Convert occurrences of environment variables in the input string to their |
| 751 | * corresponding value. A variable is identified as a series of alphanumeric |
| 752 | * characters or underscores following a '$' sign. The <in> string must be |
| 753 | * free()able. NULL returns NULL. The resulting string might be reallocated if |
| 754 | * some expansion is made. |
| 755 | */ |
| 756 | char *env_expand(char *in); |
| 757 | |
Willy Tarreau | 3d2f16f | 2012-05-13 00:21:17 +0200 | [diff] [blame] | 758 | /* debugging macro to emit messages using write() on fd #-1 so that strace sees |
| 759 | * them. |
| 760 | */ |
| 761 | #define fddebug(msg...) do { char *_m = NULL; memprintf(&_m, ##msg); if (_m) write(-1, _m, strlen(_m)); free(_m); } while (0) |
| 762 | |
de Lafond Guillaume | 88c278f | 2013-04-15 19:27:10 +0200 | [diff] [blame] | 763 | /* same as strstr() but case-insensitive */ |
| 764 | const char *strnistr(const char *str1, int len_str1, const char *str2, int len_str2); |
| 765 | |
Willy Tarreau | 2dd0d47 | 2006-06-29 17:53:05 +0200 | [diff] [blame] | 766 | #endif /* _COMMON_STANDARD_H */ |