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