Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 1 | /* |
Willy Tarreau | 2dd0d47 | 2006-06-29 17:53:05 +0200 | [diff] [blame] | 2 | include/common/standard.h |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 3 | This files contains some general purpose functions and macros. |
| 4 | |
Willy Tarreau | 70bcfb7 | 2008-01-27 02:21:53 +0100 | [diff] [blame] | 5 | Copyright (C) 2000-2008 Willy Tarreau - w@1wt.eu |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [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 | */ |
| 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 | fe94460 | 2007-10-25 10:34:16 +0200 | [diff] [blame] | 26 | #include <time.h> |
Willy Tarreau | 938b303 | 2007-05-10 06:39:03 +0200 | [diff] [blame] | 27 | #include <sys/types.h> |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 28 | #include <netinet/in.h> |
Willy Tarreau | e3ba5f0 | 2006-06-29 18:54:54 +0200 | [diff] [blame] | 29 | #include <common/config.h> |
Willy Tarreau | ca28d1e | 2007-01-24 18:20:50 +0100 | [diff] [blame] | 30 | #include <proto/fd.h> |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 31 | |
| 32 | /****** string-specific macros and functions ******/ |
| 33 | /* if a > max, then bound <a> to <max>. The macro returns the new <a> */ |
| 34 | #define UBOUND(a, max) ({ typeof(a) b = (max); if ((a) > b) (a) = b; (a); }) |
| 35 | |
| 36 | /* if a < min, then bound <a> to <min>. The macro returns the new <a> */ |
| 37 | #define LBOUND(a, min) ({ typeof(a) b = (min); if ((a) < b) (a) = b; (a); }) |
| 38 | |
| 39 | /* returns 1 only if only zero or one bit is set in X, which means that X is a |
| 40 | * power of 2, and 0 otherwise */ |
| 41 | #define POWEROF2(x) (((x) & ((x)-1)) == 0) |
| 42 | |
Willy Tarreau | 7d58a63 | 2007-01-13 23:06:06 +0100 | [diff] [blame] | 43 | /* |
| 44 | * Gcc >= 3 provides the ability for the programme to give hints to the |
| 45 | * compiler about what branch of an if is most likely to be taken. This |
| 46 | * helps the compiler produce the most compact critical paths, which is |
| 47 | * generally better for the cache and to reduce the number of jumps. |
| 48 | */ |
Willy Tarreau | 70bcfb7 | 2008-01-27 02:21:53 +0100 | [diff] [blame] | 49 | #if !defined(likely) |
Willy Tarreau | 7d58a63 | 2007-01-13 23:06:06 +0100 | [diff] [blame] | 50 | #if __GNUC__ < 3 |
| 51 | #define __builtin_expect(x,y) (x) |
Willy Tarreau | 70bcfb7 | 2008-01-27 02:21:53 +0100 | [diff] [blame] | 52 | #define likely(x) (x) |
| 53 | #define unlikely(x) (x) |
| 54 | #elif __GNUC__ < 4 |
| 55 | /* gcc 3.x does the best job at this */ |
Willy Tarreau | 7d58a63 | 2007-01-13 23:06:06 +0100 | [diff] [blame] | 56 | #define likely(x) (__builtin_expect((x) != 0, 1)) |
| 57 | #define unlikely(x) (__builtin_expect((x) != 0, 0)) |
Willy Tarreau | 70bcfb7 | 2008-01-27 02:21:53 +0100 | [diff] [blame] | 58 | #else |
| 59 | /* GCC 4.x is stupid, it performs the comparison then compares it to 1, |
| 60 | * so we cheat in a dirty way to prevent it from doing this. This will |
| 61 | * only work with ints and booleans though. |
| 62 | */ |
| 63 | #define likely(x) (x) |
| 64 | #define unlikely(x) (__builtin_expect((x), 0)) |
| 65 | #endif |
| 66 | #endif |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 67 | |
| 68 | /* |
| 69 | * copies at most <size-1> chars from <src> to <dst>. Last char is always |
| 70 | * set to 0, unless <size> is 0. The number of chars copied is returned |
| 71 | * (excluding the terminating zero). |
| 72 | * This code has been optimized for size and speed : on x86, it's 45 bytes |
| 73 | * long, uses only registers, and consumes only 4 cycles per char. |
| 74 | */ |
| 75 | extern int strlcpy2(char *dst, const char *src, int size); |
| 76 | |
| 77 | /* |
Willy Tarreau | 72d759c | 2007-10-25 12:14:10 +0200 | [diff] [blame] | 78 | * This function simply returns a locally allocated string containing |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 79 | * the ascii representation for number 'n' in decimal. |
| 80 | */ |
Willy Tarreau | 72d759c | 2007-10-25 12:14:10 +0200 | [diff] [blame] | 81 | extern char itoa_str[][21]; |
| 82 | extern const char *ultoa_r(unsigned long n, char *buffer, int size); |
| 83 | static inline const char *ultoa(unsigned long n) |
| 84 | { |
| 85 | return ultoa_r(n, itoa_str[0], sizeof(itoa_str[0])); |
| 86 | } |
| 87 | |
| 88 | /* Fast macros to convert up to 10 different parameters inside a same call of |
| 89 | * expression. |
| 90 | */ |
| 91 | #define U2A0(n) ({ ultoa_r((n), itoa_str[0], sizeof(itoa_str[0])); }) |
| 92 | #define U2A1(n) ({ ultoa_r((n), itoa_str[1], sizeof(itoa_str[1])); }) |
| 93 | #define U2A2(n) ({ ultoa_r((n), itoa_str[2], sizeof(itoa_str[2])); }) |
| 94 | #define U2A3(n) ({ ultoa_r((n), itoa_str[3], sizeof(itoa_str[3])); }) |
| 95 | #define U2A4(n) ({ ultoa_r((n), itoa_str[4], sizeof(itoa_str[4])); }) |
| 96 | #define U2A5(n) ({ ultoa_r((n), itoa_str[5], sizeof(itoa_str[5])); }) |
| 97 | #define U2A6(n) ({ ultoa_r((n), itoa_str[6], sizeof(itoa_str[6])); }) |
| 98 | #define U2A7(n) ({ ultoa_r((n), itoa_str[7], sizeof(itoa_str[7])); }) |
| 99 | #define U2A8(n) ({ ultoa_r((n), itoa_str[8], sizeof(itoa_str[8])); }) |
| 100 | #define U2A9(n) ({ ultoa_r((n), itoa_str[9], sizeof(itoa_str[9])); }) |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 101 | |
| 102 | /* |
Willy Tarreau | 91092e5 | 2007-10-25 16:58:42 +0200 | [diff] [blame] | 103 | * This function simply returns a locally allocated string containing the ascii |
| 104 | * representation for number 'n' in decimal, unless n is 0 in which case it |
| 105 | * returns the alternate string (or an empty string if the alternate string is |
| 106 | * NULL). It use is intended for limits reported in reports, where it's |
| 107 | * desirable not to display anything if there is no limit. Warning! it shares |
| 108 | * the same vector as ultoa_r(). |
| 109 | */ |
| 110 | extern const char *limit_r(unsigned long n, char *buffer, int size, const char *alt); |
| 111 | |
| 112 | /* Fast macros to convert up to 10 different parameters inside a same call of |
| 113 | * expression. Warning! they share the same vectors as U2A*! |
| 114 | */ |
| 115 | #define LIM2A0(n, alt) ({ limit_r((n), itoa_str[0], sizeof(itoa_str[0]), (alt)); }) |
| 116 | #define LIM2A1(n, alt) ({ limit_r((n), itoa_str[1], sizeof(itoa_str[1]), (alt)); }) |
| 117 | #define LIM2A2(n, alt) ({ limit_r((n), itoa_str[2], sizeof(itoa_str[2]), (alt)); }) |
| 118 | #define LIM2A3(n, alt) ({ limit_r((n), itoa_str[3], sizeof(itoa_str[3]), (alt)); }) |
| 119 | #define LIM2A4(n, alt) ({ limit_r((n), itoa_str[4], sizeof(itoa_str[4]), (alt)); }) |
| 120 | #define LIM2A5(n, alt) ({ limit_r((n), itoa_str[5], sizeof(itoa_str[5]), (alt)); }) |
| 121 | #define LIM2A6(n, alt) ({ limit_r((n), itoa_str[6], sizeof(itoa_str[6]), (alt)); }) |
| 122 | #define LIM2A7(n, alt) ({ limit_r((n), itoa_str[7], sizeof(itoa_str[7]), (alt)); }) |
| 123 | #define LIM2A8(n, alt) ({ limit_r((n), itoa_str[8], sizeof(itoa_str[8]), (alt)); }) |
| 124 | #define LIM2A9(n, alt) ({ limit_r((n), itoa_str[9], sizeof(itoa_str[9]), (alt)); }) |
| 125 | |
| 126 | /* |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 127 | * Returns non-zero if character <s> is a hex digit (0-9, a-f, A-F), else zero. |
| 128 | */ |
| 129 | extern int ishex(char s); |
| 130 | |
| 131 | /* |
Willy Tarreau | 2e74c3f | 2007-12-02 18:45:09 +0100 | [diff] [blame] | 132 | * Checks <name> for invalid characters. Valid chars are [A-Za-z0-9_:.-]. If an |
| 133 | * invalid character is found, a pointer to it is returned. If everything is |
| 134 | * fine, NULL is returned. |
| 135 | */ |
| 136 | extern const char *invalid_char(const char *name); |
| 137 | |
| 138 | /* |
Robert Tsai | 81ae195 | 2007-12-05 10:47:29 +0100 | [diff] [blame] | 139 | * converts <str> to a struct sockaddr_un* which is locally allocated. |
| 140 | * The format is "/path", where "/path" is a path to a UNIX domain socket. |
| 141 | */ |
| 142 | struct sockaddr_un *str2sun(char *str); |
| 143 | |
| 144 | /* |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 145 | * converts <str> to a struct sockaddr_in* which is locally allocated. |
| 146 | * The format is "addr:port", where "addr" can be a dotted IPv4 address, |
| 147 | * a host name, or empty or "*" to indicate INADDR_ANY. |
| 148 | */ |
| 149 | struct sockaddr_in *str2sa(char *str); |
| 150 | |
| 151 | /* |
Willy Tarreau | d077a8e | 2007-05-08 18:28:09 +0200 | [diff] [blame] | 152 | * converts <str> to two struct in_addr* which must be pre-allocated. |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 153 | * The format is "addr[/mask]", where "addr" cannot be empty, and mask |
| 154 | * is optionnal and either in the dotted or CIDR notation. |
| 155 | * Note: "addr" can also be a hostname. Returns 1 if OK, 0 if error. |
| 156 | */ |
Willy Tarreau | d077a8e | 2007-05-08 18:28:09 +0200 | [diff] [blame] | 157 | 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] | 158 | |
Alexandre Cassen | 5eb1a90 | 2007-11-29 15:43:32 +0100 | [diff] [blame] | 159 | /* |
| 160 | * Resolve destination server from URL. Convert <str> to a sockaddr_in*. |
| 161 | */ |
| 162 | int url2sa(const char *url, int ulen, struct sockaddr_in *addr); |
| 163 | |
Willy Tarreau | baaee00 | 2006-06-26 02:48:02 +0200 | [diff] [blame] | 164 | /* will try to encode the string <string> replacing all characters tagged in |
| 165 | * <map> with the hexadecimal representation of their ASCII-code (2 digits) |
| 166 | * prefixed by <escape>, and will store the result between <start> (included) |
| 167 | * and <stop> (excluded), and will always terminate the string with a '\0' |
| 168 | * before <stop>. The position of the '\0' is returned if the conversion |
| 169 | * completes. If bytes are missing between <start> and <stop>, then the |
| 170 | * conversion will be incomplete and truncated. If <stop> <= <start>, the '\0' |
| 171 | * cannot even be stored so we return <start> without writing the 0. |
| 172 | * The input string must also be zero-terminated. |
| 173 | */ |
| 174 | extern const char hextab[]; |
| 175 | char *encode_string(char *start, char *stop, |
| 176 | const char escape, const fd_set *map, |
| 177 | const char *string); |
| 178 | |
Willy Tarreau | 6911fa4 | 2007-03-04 18:06:08 +0100 | [diff] [blame] | 179 | /* This one is 6 times faster than strtoul() on athlon, but does |
| 180 | * no check at all. |
| 181 | */ |
| 182 | static inline unsigned int __str2ui(const char *s) |
| 183 | { |
| 184 | unsigned int i = 0; |
| 185 | while (*s) { |
| 186 | i = i * 10 - '0'; |
| 187 | i += (unsigned char)*s++; |
| 188 | } |
| 189 | return i; |
| 190 | } |
| 191 | |
| 192 | /* This one is 5 times faster than strtoul() on athlon with checks. |
| 193 | * It returns the value of the number composed of all valid digits read. |
| 194 | */ |
| 195 | static inline unsigned int __str2uic(const char *s) |
| 196 | { |
| 197 | unsigned int i = 0; |
| 198 | unsigned int j; |
| 199 | while (1) { |
| 200 | j = (*s++) - '0'; |
| 201 | if (j > 9) |
| 202 | break; |
| 203 | i *= 10; |
| 204 | i += j; |
| 205 | } |
| 206 | return i; |
| 207 | } |
| 208 | |
| 209 | /* This one is 28 times faster than strtoul() on athlon, but does |
| 210 | * no check at all! |
| 211 | */ |
| 212 | static inline unsigned int __strl2ui(const char *s, int len) |
| 213 | { |
| 214 | unsigned int i = 0; |
| 215 | while (len-- > 0) { |
| 216 | i = i * 10 - '0'; |
| 217 | i += (unsigned char)*s++; |
| 218 | } |
| 219 | return i; |
| 220 | } |
| 221 | |
| 222 | /* This one is 7 times faster than strtoul() on athlon with checks. |
| 223 | * It returns the value of the number composed of all valid digits read. |
| 224 | */ |
| 225 | static inline unsigned int __strl2uic(const char *s, int len) |
| 226 | { |
| 227 | unsigned int i = 0; |
Willy Tarreau | 3f0c976 | 2007-10-25 09:42:24 +0200 | [diff] [blame] | 228 | unsigned int j, k; |
Willy Tarreau | 6911fa4 | 2007-03-04 18:06:08 +0100 | [diff] [blame] | 229 | |
| 230 | while (len-- > 0) { |
| 231 | j = (*s++) - '0'; |
Willy Tarreau | 3f0c976 | 2007-10-25 09:42:24 +0200 | [diff] [blame] | 232 | k = i * 10; |
Willy Tarreau | 6911fa4 | 2007-03-04 18:06:08 +0100 | [diff] [blame] | 233 | if (j > 9) |
| 234 | break; |
Willy Tarreau | 3f0c976 | 2007-10-25 09:42:24 +0200 | [diff] [blame] | 235 | i = k + j; |
Willy Tarreau | 6911fa4 | 2007-03-04 18:06:08 +0100 | [diff] [blame] | 236 | } |
| 237 | return i; |
| 238 | } |
| 239 | |
| 240 | extern unsigned int str2ui(const char *s); |
| 241 | extern unsigned int str2uic(const char *s); |
| 242 | extern unsigned int strl2ui(const char *s, int len); |
| 243 | extern unsigned int strl2uic(const char *s, int len); |
| 244 | extern int strl2ic(const char *s, int len); |
| 245 | extern int strl2irc(const char *s, int len, int *ret); |
| 246 | extern int strl2llrc(const char *s, int len, long long *ret); |
| 247 | |
Willy Tarreau | fe94460 | 2007-10-25 10:34:16 +0200 | [diff] [blame] | 248 | /* This function converts the time_t value <now> into a broken out struct tm |
| 249 | * which must be allocated by the caller. It is highly recommended to use this |
| 250 | * function intead of localtime() because that one requires a time_t* which |
| 251 | * is not always compatible with tv_sec depending on OS/hardware combinations. |
| 252 | */ |
| 253 | static inline void get_localtime(const time_t now, struct tm *tm) |
| 254 | { |
| 255 | localtime_r(&now, tm); |
| 256 | } |
| 257 | |
Willy Tarreau | a0d37b6 | 2007-12-02 22:00:35 +0100 | [diff] [blame] | 258 | /* This function parses a time value optionally followed by a unit suffix among |
| 259 | * "d", "h", "m", "s", "ms" or "us". It converts the value into the unit |
| 260 | * expected by the caller. The computation does its best to avoid overflows. |
| 261 | * The value is returned in <ret> if everything is fine, and a NULL is returned |
| 262 | * by the function. In case of error, a pointer to the error is returned and |
| 263 | * <ret> is left untouched. |
| 264 | */ |
| 265 | extern const char *parse_time_err(const char *text, unsigned *ret, unsigned unit_flags); |
| 266 | |
| 267 | /* unit flags to pass to parse_time_err */ |
| 268 | #define TIME_UNIT_US 0x0000 |
| 269 | #define TIME_UNIT_MS 0x0001 |
| 270 | #define TIME_UNIT_S 0x0002 |
| 271 | #define TIME_UNIT_MIN 0x0003 |
| 272 | #define TIME_UNIT_HOUR 0x0004 |
| 273 | #define TIME_UNIT_DAY 0x0005 |
| 274 | #define TIME_UNIT_MASK 0x0007 |
| 275 | |
Willy Tarreau | 2dd0d47 | 2006-06-29 17:53:05 +0200 | [diff] [blame] | 276 | #endif /* _COMMON_STANDARD_H */ |