blob: 769aec661127a6491dbf394227128abd71b49cd4 [file] [log] [blame]
Willy Tarreaubaaee002006-06-26 02:48:02 +02001/*
Willy Tarreaucc05fba2009-10-27 21:40:18 +01002 * include/common/standard.h
3 * This files contains some general purpose functions and macros.
4 *
Willy Tarreau348238b2010-01-18 15:05:57 +01005 * Copyright (C) 2000-2010 Willy Tarreau - w@1wt.eu
Willy Tarreaucc05fba2009-10-27 21:40:18 +01006 *
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation, version 2.1
10 * exclusively.
11 *
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with this library; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 */
Willy Tarreaubaaee002006-06-26 02:48:02 +020021
Willy Tarreau2dd0d472006-06-29 17:53:05 +020022#ifndef _COMMON_STANDARD_H
23#define _COMMON_STANDARD_H
Willy Tarreaubaaee002006-06-26 02:48:02 +020024
Willy Tarreau167d8b52007-04-09 22:16:12 +020025#include <limits.h>
Willy Tarreau050737f2010-01-14 11:40:12 +010026#include <string.h>
Willy Tarreaufe944602007-10-25 10:34:16 +020027#include <time.h>
Willy Tarreau938b3032007-05-10 06:39:03 +020028#include <sys/types.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020029#include <netinet/in.h>
Willy Tarreaue3ba5f02006-06-29 18:54:54 +020030#include <common/config.h>
Willy Tarreau45cb4fb2009-10-26 21:10:04 +010031#include <eb32tree.h>
Willy Tarreauca28d1e2007-01-24 18:20:50 +010032#include <proto/fd.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020033
34/****** string-specific macros and functions ******/
35/* if a > max, then bound <a> to <max>. The macro returns the new <a> */
36#define UBOUND(a, max) ({ typeof(a) b = (max); if ((a) > b) (a) = b; (a); })
37
38/* if a < min, then bound <a> to <min>. The macro returns the new <a> */
39#define LBOUND(a, min) ({ typeof(a) b = (min); if ((a) < b) (a) = b; (a); })
40
41/* returns 1 only if only zero or one bit is set in X, which means that X is a
42 * power of 2, and 0 otherwise */
43#define POWEROF2(x) (((x) & ((x)-1)) == 0)
44
Willy Tarreau5b180202010-07-18 10:40:48 +020045/* operators to compare values. They're ordered that way so that the lowest bit
46 * serves as a negation for the test and contains all tests that are not equal.
47 */
48enum {
49 STD_OP_LE = 0, STD_OP_GT = 1,
50 STD_OP_EQ = 2, STD_OP_NE = 3,
51 STD_OP_GE = 4, STD_OP_LT = 5,
52};
53
Willy Tarreau7d58a632007-01-13 23:06:06 +010054/*
Willy Tarreaubaaee002006-06-26 02:48:02 +020055 * copies at most <size-1> chars from <src> to <dst>. Last char is always
56 * set to 0, unless <size> is 0. The number of chars copied is returned
57 * (excluding the terminating zero).
58 * This code has been optimized for size and speed : on x86, it's 45 bytes
59 * long, uses only registers, and consumes only 4 cycles per char.
60 */
61extern int strlcpy2(char *dst, const char *src, int size);
62
63/*
Willy Tarreau72d759c2007-10-25 12:14:10 +020064 * This function simply returns a locally allocated string containing
Willy Tarreaubaaee002006-06-26 02:48:02 +020065 * the ascii representation for number 'n' in decimal.
66 */
Willy Tarreaue7239b52009-03-29 13:41:58 +020067extern char itoa_str[][171];
Emeric Brun3a7fce52010-01-04 14:54:38 +010068extern char *ultoa_r(unsigned long n, char *buffer, int size);
Willy Tarreaue7239b52009-03-29 13:41:58 +020069extern const char *ulltoh_r(unsigned long long n, char *buffer, int size);
Willy Tarreau72d759c2007-10-25 12:14:10 +020070static inline const char *ultoa(unsigned long n)
71{
72 return ultoa_r(n, itoa_str[0], sizeof(itoa_str[0]));
73}
74
75/* Fast macros to convert up to 10 different parameters inside a same call of
76 * expression.
77 */
78#define U2A0(n) ({ ultoa_r((n), itoa_str[0], sizeof(itoa_str[0])); })
79#define U2A1(n) ({ ultoa_r((n), itoa_str[1], sizeof(itoa_str[1])); })
80#define U2A2(n) ({ ultoa_r((n), itoa_str[2], sizeof(itoa_str[2])); })
81#define U2A3(n) ({ ultoa_r((n), itoa_str[3], sizeof(itoa_str[3])); })
82#define U2A4(n) ({ ultoa_r((n), itoa_str[4], sizeof(itoa_str[4])); })
83#define U2A5(n) ({ ultoa_r((n), itoa_str[5], sizeof(itoa_str[5])); })
84#define U2A6(n) ({ ultoa_r((n), itoa_str[6], sizeof(itoa_str[6])); })
85#define U2A7(n) ({ ultoa_r((n), itoa_str[7], sizeof(itoa_str[7])); })
86#define U2A8(n) ({ ultoa_r((n), itoa_str[8], sizeof(itoa_str[8])); })
87#define U2A9(n) ({ ultoa_r((n), itoa_str[9], sizeof(itoa_str[9])); })
Willy Tarreaubaaee002006-06-26 02:48:02 +020088
Willy Tarreaue7239b52009-03-29 13:41:58 +020089/* The same macros provide HTML encoding of numbers */
90#define U2H0(n) ({ ulltoh_r((n), itoa_str[0], sizeof(itoa_str[0])); })
91#define U2H1(n) ({ ulltoh_r((n), itoa_str[1], sizeof(itoa_str[1])); })
92#define U2H2(n) ({ ulltoh_r((n), itoa_str[2], sizeof(itoa_str[2])); })
93#define U2H3(n) ({ ulltoh_r((n), itoa_str[3], sizeof(itoa_str[3])); })
94#define U2H4(n) ({ ulltoh_r((n), itoa_str[4], sizeof(itoa_str[4])); })
95#define U2H5(n) ({ ulltoh_r((n), itoa_str[5], sizeof(itoa_str[5])); })
96#define U2H6(n) ({ ulltoh_r((n), itoa_str[6], sizeof(itoa_str[6])); })
97#define U2H7(n) ({ ulltoh_r((n), itoa_str[7], sizeof(itoa_str[7])); })
98#define U2H8(n) ({ ulltoh_r((n), itoa_str[8], sizeof(itoa_str[8])); })
99#define U2H9(n) ({ ulltoh_r((n), itoa_str[9], sizeof(itoa_str[9])); })
100
Willy Tarreaubaaee002006-06-26 02:48:02 +0200101/*
Willy Tarreau91092e52007-10-25 16:58:42 +0200102 * This function simply returns a locally allocated string containing the ascii
103 * representation for number 'n' in decimal, unless n is 0 in which case it
104 * returns the alternate string (or an empty string if the alternate string is
105 * NULL). It use is intended for limits reported in reports, where it's
106 * desirable not to display anything if there is no limit. Warning! it shares
107 * the same vector as ultoa_r().
108 */
109extern const char *limit_r(unsigned long n, char *buffer, int size, const char *alt);
110
111/* Fast macros to convert up to 10 different parameters inside a same call of
112 * expression. Warning! they share the same vectors as U2A*!
113 */
114#define LIM2A0(n, alt) ({ limit_r((n), itoa_str[0], sizeof(itoa_str[0]), (alt)); })
115#define LIM2A1(n, alt) ({ limit_r((n), itoa_str[1], sizeof(itoa_str[1]), (alt)); })
116#define LIM2A2(n, alt) ({ limit_r((n), itoa_str[2], sizeof(itoa_str[2]), (alt)); })
117#define LIM2A3(n, alt) ({ limit_r((n), itoa_str[3], sizeof(itoa_str[3]), (alt)); })
118#define LIM2A4(n, alt) ({ limit_r((n), itoa_str[4], sizeof(itoa_str[4]), (alt)); })
119#define LIM2A5(n, alt) ({ limit_r((n), itoa_str[5], sizeof(itoa_str[5]), (alt)); })
120#define LIM2A6(n, alt) ({ limit_r((n), itoa_str[6], sizeof(itoa_str[6]), (alt)); })
121#define LIM2A7(n, alt) ({ limit_r((n), itoa_str[7], sizeof(itoa_str[7]), (alt)); })
122#define LIM2A8(n, alt) ({ limit_r((n), itoa_str[8], sizeof(itoa_str[8]), (alt)); })
123#define LIM2A9(n, alt) ({ limit_r((n), itoa_str[9], sizeof(itoa_str[9]), (alt)); })
124
125/*
Willy Tarreaubaaee002006-06-26 02:48:02 +0200126 * Returns non-zero if character <s> is a hex digit (0-9, a-f, A-F), else zero.
127 */
128extern int ishex(char s);
129
130/*
Willy Tarreauda3b7c32009-11-02 20:12:52 +0100131 * Return integer equivalent of character <c> for a hex digit (0-9, a-f, A-F),
132 * otherwise -1.
133 */
134extern int hex2i(int c);
135
136/*
Willy Tarreau2e74c3f2007-12-02 18:45:09 +0100137 * Checks <name> for invalid characters. Valid chars are [A-Za-z0-9_:.-]. If an
138 * invalid character is found, a pointer to it is returned. If everything is
139 * fine, NULL is returned.
140 */
141extern const char *invalid_char(const char *name);
142
143/*
Krzysztof Piotr Oledzkiefe3b6f2008-05-23 23:49:32 +0200144 * Checks <domainname> for invalid characters. Valid chars are [A-Za-z0-9_.-].
145 * If an invalid character is found, a pointer to it is returned.
146 * If everything is fine, NULL is returned.
147 */
148extern const char *invalid_domainchar(const char *name);
149
150/*
Robert Tsai81ae1952007-12-05 10:47:29 +0100151 * converts <str> to a struct sockaddr_un* which is locally allocated.
152 * The format is "/path", where "/path" is a path to a UNIX domain socket.
153 */
Willy Tarreaucaf720d2008-03-07 10:07:04 +0100154struct sockaddr_un *str2sun(const char *str);
Robert Tsai81ae1952007-12-05 10:47:29 +0100155
156/*
Willy Tarreaufab5a432011-03-04 15:31:53 +0100157 * converts <str> to a struct sockaddr_storage* which is locally allocated. The
158 * string is assumed to contain only an address, no port. The address can be a
159 * dotted IPv4 address, an IPv6 address, a host name, or empty or "*" to
160 * indicate INADDR_ANY. NULL is returned if the host part cannot be resolved.
161 * The return address will only have the address family and the address set,
162 * all other fields remain zero. The string is not supposed to be modified.
163 * The IPv6 '::' address is IN6ADDR_ANY.
Willy Tarreaubaaee002006-06-26 02:48:02 +0200164 */
Willy Tarreaufab5a432011-03-04 15:31:53 +0100165struct sockaddr_storage *str2ip(const char *str);
Willy Tarreaubaaee002006-06-26 02:48:02 +0200166
167/*
Willy Tarreaufab5a432011-03-04 15:31:53 +0100168 * converts <str> to a locally allocated struct sockaddr_storage *.
169 * The format is "addr[:[port]]", where "addr" can be a dotted IPv4 address, an
170 * IPv6 address, a host name, or empty or "*" to indicate INADDR_ANY. If an IPv6
171 * address wants to ignore port, it must be terminated by a trailing colon (':').
172 * The IPv6 '::' address is IN6ADDR_ANY, so in order to bind to a given port on
173 * IPv6, use ":::port". NULL is returned if the host part cannot be resolved.
174 */
175struct sockaddr_storage *str2sa(const char *str);
176
177/*
178 * converts <str> to a locally allocated struct sockaddr_storage *, and a
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200179 * port range consisting in two integers. The low and high end are always set
180 * even if the port is unspecified, in which case (0,0) is returned. The low
Willy Tarreaufab5a432011-03-04 15:31:53 +0100181 * port is set in the sockaddr. Thus, it is enough to check the size of the
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200182 * returned range to know if an array must be allocated or not. The format is
Willy Tarreaufab5a432011-03-04 15:31:53 +0100183 * "addr[:[port[-port]]]", where "addr" can be a dotted IPv4 address, an IPv6
184 * address, a host name, or empty or "*" to indicate INADDR_ANY. If an IPv6
185 * address wants to ignore port, it must be terminated by a trailing colon (':').
186 * The IPv6 '::' address is IN6ADDR_ANY, so in order to bind to a given port on
187 * IPv6, use ":::port". NULL is returned if the host part cannot be resolved.
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200188 */
Willy Tarreaufab5a432011-03-04 15:31:53 +0100189struct sockaddr_storage *str2sa_range(const char *str, int *low, int *high);
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200190
Willy Tarreau2937c0d2010-01-26 17:36:17 +0100191/* converts <str> to a struct in_addr containing a network mask. It can be
192 * passed in dotted form (255.255.255.0) or in CIDR form (24). It returns 1
193 * if the conversion succeeds otherwise non-zero.
194 */
195int str2mask(const char *str, struct in_addr *mask);
196
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200197/*
Willy Tarreaud077a8e2007-05-08 18:28:09 +0200198 * converts <str> to two struct in_addr* which must be pre-allocated.
Willy Tarreaubaaee002006-06-26 02:48:02 +0200199 * The format is "addr[/mask]", where "addr" cannot be empty, and mask
200 * is optionnal and either in the dotted or CIDR notation.
201 * Note: "addr" can also be a hostname. Returns 1 if OK, 0 if error.
202 */
Willy Tarreaud077a8e2007-05-08 18:28:09 +0200203int str2net(const char *str, struct in_addr *addr, struct in_addr *mask);
Willy Tarreaubaaee002006-06-26 02:48:02 +0200204
Alexandre Cassen5eb1a902007-11-29 15:43:32 +0100205/*
Willy Tarreau106f9792009-09-19 07:54:16 +0200206 * Parse IP address found in url.
207 */
David du Colombier6f5ccb12011-03-10 22:26:24 +0100208int url2ipv4(const char *addr, struct in_addr *dst);
Willy Tarreau106f9792009-09-19 07:54:16 +0200209
210/*
David du Colombier6f5ccb12011-03-10 22:26:24 +0100211 * Resolve destination server from URL. Convert <str> to a sockaddr_storage*.
Alexandre Cassen5eb1a902007-11-29 15:43:32 +0100212 */
David du Colombier6f5ccb12011-03-10 22:26:24 +0100213int url2sa(const char *url, int ulen, struct sockaddr_storage *addr);
Alexandre Cassen5eb1a902007-11-29 15:43:32 +0100214
Willy Tarreaubaaee002006-06-26 02:48:02 +0200215/* will try to encode the string <string> replacing all characters tagged in
216 * <map> with the hexadecimal representation of their ASCII-code (2 digits)
217 * prefixed by <escape>, and will store the result between <start> (included)
218 * and <stop> (excluded), and will always terminate the string with a '\0'
219 * before <stop>. The position of the '\0' is returned if the conversion
220 * completes. If bytes are missing between <start> and <stop>, then the
221 * conversion will be incomplete and truncated. If <stop> <= <start>, the '\0'
222 * cannot even be stored so we return <start> without writing the 0.
223 * The input string must also be zero-terminated.
224 */
225extern const char hextab[];
226char *encode_string(char *start, char *stop,
227 const char escape, const fd_set *map,
228 const char *string);
229
Willy Tarreaubf9c2fc2011-05-31 18:06:18 +0200230/* Decode an URL-encoded string in-place. The resulting string might
231 * be shorter. If some forbidden characters are found, the conversion is
232 * aborted, the string is truncated before the issue and non-zero is returned,
233 * otherwise the operation returns non-zero indicating success.
234 */
235int url_decode(char *string);
236
Willy Tarreau6911fa42007-03-04 18:06:08 +0100237/* This one is 6 times faster than strtoul() on athlon, but does
238 * no check at all.
239 */
240static inline unsigned int __str2ui(const char *s)
241{
242 unsigned int i = 0;
243 while (*s) {
244 i = i * 10 - '0';
245 i += (unsigned char)*s++;
246 }
247 return i;
248}
249
250/* This one is 5 times faster than strtoul() on athlon with checks.
251 * It returns the value of the number composed of all valid digits read.
252 */
253static inline unsigned int __str2uic(const char *s)
254{
255 unsigned int i = 0;
256 unsigned int j;
257 while (1) {
258 j = (*s++) - '0';
259 if (j > 9)
260 break;
261 i *= 10;
262 i += j;
263 }
264 return i;
265}
266
267/* This one is 28 times faster than strtoul() on athlon, but does
268 * no check at all!
269 */
270static inline unsigned int __strl2ui(const char *s, int len)
271{
272 unsigned int i = 0;
273 while (len-- > 0) {
274 i = i * 10 - '0';
275 i += (unsigned char)*s++;
276 }
277 return i;
278}
279
280/* This one is 7 times faster than strtoul() on athlon with checks.
281 * It returns the value of the number composed of all valid digits read.
282 */
283static inline unsigned int __strl2uic(const char *s, int len)
284{
285 unsigned int i = 0;
Willy Tarreau3f0c9762007-10-25 09:42:24 +0200286 unsigned int j, k;
Willy Tarreau6911fa42007-03-04 18:06:08 +0100287
288 while (len-- > 0) {
289 j = (*s++) - '0';
Willy Tarreau3f0c9762007-10-25 09:42:24 +0200290 k = i * 10;
Willy Tarreau6911fa42007-03-04 18:06:08 +0100291 if (j > 9)
292 break;
Willy Tarreau3f0c9762007-10-25 09:42:24 +0200293 i = k + j;
Willy Tarreau6911fa42007-03-04 18:06:08 +0100294 }
295 return i;
296}
297
Willy Tarreau4ec83cd2010-10-15 23:19:55 +0200298/* This function reads an unsigned integer from the string pointed to by <s>
299 * and returns it. The <s> pointer is adjusted to point to the first unread
300 * char. The function automatically stops at <end>.
301 */
302static inline unsigned int __read_uint(const char **s, const char *end)
303{
304 const char *ptr = *s;
305 unsigned int i = 0;
306 unsigned int j, k;
307
308 while (ptr < end) {
309 j = *ptr - '0';
310 k = i * 10;
311 if (j > 9)
312 break;
313 i = k + j;
314 ptr++;
315 }
316 *s = ptr;
317 return i;
318}
319
Willy Tarreau6911fa42007-03-04 18:06:08 +0100320extern unsigned int str2ui(const char *s);
321extern unsigned int str2uic(const char *s);
322extern unsigned int strl2ui(const char *s, int len);
323extern unsigned int strl2uic(const char *s, int len);
324extern int strl2ic(const char *s, int len);
325extern int strl2irc(const char *s, int len, int *ret);
326extern int strl2llrc(const char *s, int len, long long *ret);
Willy Tarreau4ec83cd2010-10-15 23:19:55 +0200327extern unsigned int read_uint(const char **s, const char *end);
Willy Tarreaud54bbdc2009-09-07 11:00:31 +0200328unsigned int inetaddr_host(const char *text);
329unsigned int inetaddr_host_lim(const char *text, const char *stop);
Willy Tarreau74172752010-10-15 23:21:42 +0200330unsigned int inetaddr_host_lim_ret(char *text, char *stop, char **ret);
Willy Tarreau6911fa42007-03-04 18:06:08 +0100331
Krzysztof Piotr Oledzki3d5562b2009-10-10 20:11:17 +0200332static inline char *cut_crlf(char *s) {
333
334 while (*s != '\r' || *s == '\n') {
335 char *p = s++;
336
337 if (!*p)
338 return p;
339 }
340
341 *s++ = 0;
342
343 return s;
344}
345
346static inline char *ltrim(char *s, char c) {
347
348 if (c)
349 while (*s == c)
350 s++;
351
352 return s;
353}
354
355static inline char *rtrim(char *s, char c) {
356
357 char *p = s + strlen(s);
358
359 while (p-- > s)
360 if (*p == c)
361 *p = '\0';
362 else
363 break;
364
365 return s;
366}
367
368static inline char *alltrim(char *s, char c) {
369
370 rtrim(s, c);
371
372 return ltrim(s, c);
373}
374
Willy Tarreaufe944602007-10-25 10:34:16 +0200375/* This function converts the time_t value <now> into a broken out struct tm
376 * which must be allocated by the caller. It is highly recommended to use this
377 * function intead of localtime() because that one requires a time_t* which
378 * is not always compatible with tv_sec depending on OS/hardware combinations.
379 */
380static inline void get_localtime(const time_t now, struct tm *tm)
381{
382 localtime_r(&now, tm);
383}
384
Emeric Brun3a058f32009-06-30 18:26:00 +0200385/* This function converts the time_t value <now> into a broken out struct tm
386 * which must be allocated by the caller. It is highly recommended to use this
387 * function intead of gmtime() because that one requires a time_t* which
388 * is not always compatible with tv_sec depending on OS/hardware combinations.
389 */
390static inline void get_gmtime(const time_t now, struct tm *tm)
391{
392 gmtime_r(&now, tm);
393}
394
Willy Tarreaua0d37b62007-12-02 22:00:35 +0100395/* This function parses a time value optionally followed by a unit suffix among
396 * "d", "h", "m", "s", "ms" or "us". It converts the value into the unit
397 * expected by the caller. The computation does its best to avoid overflows.
398 * The value is returned in <ret> if everything is fine, and a NULL is returned
399 * by the function. In case of error, a pointer to the error is returned and
400 * <ret> is left untouched.
401 */
402extern const char *parse_time_err(const char *text, unsigned *ret, unsigned unit_flags);
Emeric Brun39132b22010-01-04 14:57:24 +0100403extern const char *parse_size_err(const char *text, unsigned *ret);
Willy Tarreaua0d37b62007-12-02 22:00:35 +0100404
405/* unit flags to pass to parse_time_err */
406#define TIME_UNIT_US 0x0000
407#define TIME_UNIT_MS 0x0001
408#define TIME_UNIT_S 0x0002
409#define TIME_UNIT_MIN 0x0003
410#define TIME_UNIT_HOUR 0x0004
411#define TIME_UNIT_DAY 0x0005
412#define TIME_UNIT_MASK 0x0007
413
Willy Tarreau7f062c42009-03-05 18:43:00 +0100414/* Multiply the two 32-bit operands and shift the 64-bit result right 32 bits.
415 * This is used to compute fixed ratios by setting one of the operands to
416 * (2^32*ratio).
417 */
418static inline unsigned int mul32hi(unsigned int a, unsigned int b)
419{
420 return ((unsigned long long)a * b) >> 32;
421}
422
Willy Tarreauf0d9eec2010-06-20 07:12:37 +0200423/* gcc does not know when it can safely divide 64 bits by 32 bits. Use this
424 * function when you know for sure that the result fits in 32 bits, because
425 * it is optimal on x86 and on 64bit processors.
426 */
427static inline unsigned int div64_32(unsigned long long o1, unsigned int o2)
428{
429 unsigned int result;
430#ifdef __i386__
431 asm("divl %2"
432 : "=a" (result)
433 : "A"(o1), "rm"(o2));
434#else
435 result = o1 / o2;
436#endif
437 return result;
438}
439
Willy Tarreau946ba592009-05-10 15:41:18 +0200440/* copies at most <n> characters from <src> and always terminates with '\0' */
441char *my_strndup(const char *src, int n);
442
Willy Tarreau482b00d2009-10-04 22:48:42 +0200443/* This function returns the first unused key greater than or equal to <key> in
444 * ID tree <root>. Zero is returned if no place is found.
445 */
446unsigned int get_next_id(struct eb_root *root, unsigned int key);
447
Willy Tarreau348238b2010-01-18 15:05:57 +0100448/* This function compares a sample word possibly followed by blanks to another
449 * clean word. The compare is case-insensitive. 1 is returned if both are equal,
450 * otherwise zero. This intends to be used when checking HTTP headers for some
451 * values.
452 */
453int word_match(const char *sample, int slen, const char *word, int wlen);
454
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200455/* Convert a fixed-length string to an IP address. Returns 0 in case of error,
456 * or the number of chars read in case of success.
457 */
458int buf2ip(const char *buf, size_t len, struct in_addr *dst);
459
Willy Tarreauacf95772010-06-14 19:09:21 +0200460/* To be used to quote config arg positions. Returns the string at <ptr>
461 * surrounded by simple quotes if <ptr> is valid and non-empty, or "end of line"
462 * if ptr is NULL or empty. The string is locally allocated.
463 */
464const char *quote_arg(const char *ptr);
465
Willy Tarreau5b180202010-07-18 10:40:48 +0200466/* returns an operator among STD_OP_* for string <str> or < 0 if unknown */
467int get_std_op(const char *str);
468
Willy Tarreau4c14eaa2010-11-24 14:01:45 +0100469/* hash a 32-bit integer to another 32-bit integer */
470extern unsigned int full_hash(unsigned int a);
471static inline unsigned int __full_hash(unsigned int a)
472{
473 /* This function is one of Bob Jenkins' full avalanche hashing
474 * functions, which when provides quite a good distribution for little
475 * input variations. The result is quite suited to fit over a 32-bit
476 * space with enough variations so that a randomly picked number falls
477 * equally before any server position.
478 * Check http://burtleburtle.net/bob/hash/integer.html for more info.
479 */
480 a = (a+0x7ed55d16) + (a<<12);
481 a = (a^0xc761c23c) ^ (a>>19);
482 a = (a+0x165667b1) + (a<<5);
483 a = (a+0xd3a2646c) ^ (a<<9);
484 a = (a+0xfd7046c5) + (a<<3);
485 a = (a^0xb55a4f09) ^ (a>>16);
486
487 /* ensure values are better spread all around the tree by multiplying
488 * by a large prime close to 3/4 of the tree.
489 */
490 return a * 3221225473U;
491}
492
David du Colombier6f5ccb12011-03-10 22:26:24 +0100493/* returns non-zero if addr has a valid and non-null IPv4 or IPv6 address,
494 * otherwise zero.
495 */
496static inline int is_addr(struct sockaddr_storage *addr)
497{
498 int i;
499
500 switch (addr->ss_family) {
501 case AF_INET:
David du Colombier64e9c902011-03-22 11:39:41 +0100502 return *(int *)&((struct sockaddr_in *)addr)->sin_addr;
David du Colombier6f5ccb12011-03-10 22:26:24 +0100503 case AF_INET6:
504 for (i = 0; i < sizeof(struct in6_addr) / sizeof(int); i++)
505 if (((int *)&((struct sockaddr_in6 *)addr)->sin6_addr)[i] != 0)
506 return ((int *)&((struct sockaddr_in6 *)addr)->sin6_addr)[i];
507 }
508 return 0;
509}
510
David du Colombier11bcb6c2011-03-24 12:23:00 +0100511/* returns port in network byte order */
512static inline int get_net_port(struct sockaddr_storage *addr)
513{
514 switch (addr->ss_family) {
515 case AF_INET:
516 return ((struct sockaddr_in *)addr)->sin_port;
517 case AF_INET6:
518 return ((struct sockaddr_in6 *)addr)->sin6_port;
519 }
520 return 0;
521}
522
523/* returns port in host byte order */
524static inline int get_host_port(struct sockaddr_storage *addr)
525{
526 switch (addr->ss_family) {
527 case AF_INET:
528 return ntohs(((struct sockaddr_in *)addr)->sin_port);
529 case AF_INET6:
530 return ntohs(((struct sockaddr_in6 *)addr)->sin6_port);
531 }
532 return 0;
533}
534
Willy Tarreau1b4b7ce2011-04-05 16:56:50 +0200535/* returns address len for <addr>'s family, 0 for unknown families */
536static inline int get_addr_len(const struct sockaddr_storage *addr)
537{
538 switch (addr->ss_family) {
539 case AF_INET:
540 return sizeof(struct sockaddr_in);
541 case AF_INET6:
542 return sizeof(struct sockaddr_in6);
543 case AF_UNIX:
544 return sizeof(struct sockaddr_un);
545 }
546 return 0;
547}
548
David du Colombier11bcb6c2011-03-24 12:23:00 +0100549/* set port in host byte order */
550static inline int set_net_port(struct sockaddr_storage *addr, int port)
551{
552 switch (addr->ss_family) {
553 case AF_INET:
554 ((struct sockaddr_in *)addr)->sin_port = port;
555 case AF_INET6:
556 ((struct sockaddr_in6 *)addr)->sin6_port = port;
557 }
558 return 0;
559}
560
561/* set port in network byte order */
562static inline int set_host_port(struct sockaddr_storage *addr, int port)
563{
564 switch (addr->ss_family) {
565 case AF_INET:
566 ((struct sockaddr_in *)addr)->sin_port = htons(port);
567 case AF_INET6:
568 ((struct sockaddr_in6 *)addr)->sin6_port = htons(port);
569 }
570 return 0;
571}
572
David du Colombier4f92d322011-03-24 11:09:31 +0100573/* Return true if IPv4 address is part of the network */
574extern int in_net_ipv4(struct in_addr *addr, struct in_addr *mask, struct in_addr *net);
575
576/* Return true if IPv6 address is part of the network */
577extern int in_net_ipv6(struct in6_addr *addr, struct in6_addr *mask, struct in6_addr *net);
578
579/* Map IPv4 adress on IPv6 address, as specified in RFC 3513. */
580extern void v4tov6(struct in6_addr *sin6_addr, struct in_addr *sin_addr);
581
582/* Map IPv6 adress on IPv4 address, as specified in RFC 3513.
583 * Return true if conversion is possible and false otherwise.
584 */
585extern int v6tov4(struct in_addr *sin_addr, struct in6_addr *sin6_addr);
586
Willy Tarreau2dd0d472006-06-29 17:53:05 +0200587#endif /* _COMMON_STANDARD_H */