blob: 28918476528a287ec984da694c94ebb6c3f837a7 [file] [log] [blame]
Willy Tarreaubaaee002006-06-26 02:48:02 +02001/*
2 * General purpose functions.
3 *
Willy Tarreau348238b2010-01-18 15:05:57 +01004 * Copyright 2000-2010 Willy Tarreau <w@1wt.eu>
Willy Tarreaubaaee002006-06-26 02:48:02 +02005 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version
9 * 2 of the License, or (at your option) any later version.
10 *
11 */
12
Willy Tarreau2e74c3f2007-12-02 18:45:09 +010013#include <ctype.h>
Willy Tarreau16e01562016-08-09 16:46:18 +020014#include <errno.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020015#include <netdb.h>
Willy Tarreau9a7bea52012-04-27 11:16:50 +020016#include <stdarg.h>
Willy Tarreaudd2f85e2012-09-02 22:34:23 +020017#include <stdio.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020018#include <stdlib.h>
19#include <string.h>
Thierry Fournier93127942016-01-20 18:49:45 +010020#include <time.h>
Willy Tarreau16e01562016-08-09 16:46:18 +020021#include <unistd.h>
Willy Tarreau127f9662007-12-06 00:53:51 +010022#include <sys/socket.h>
Willy Tarreau37101052019-05-20 16:48:20 +020023#include <sys/stat.h>
24#include <sys/types.h>
Willy Tarreau127f9662007-12-06 00:53:51 +010025#include <sys/un.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020026#include <netinet/in.h>
27#include <arpa/inet.h>
28
Thierry FOURNIERe059ec92014-03-17 12:01:13 +010029#include <common/chunk.h>
Willy Tarreaue3ba5f02006-06-29 18:54:54 +020030#include <common/config.h>
Willy Tarreau2dd0d472006-06-29 17:53:05 +020031#include <common/standard.h>
Thierry Fournier93127942016-01-20 18:49:45 +010032#include <common/tools.h>
Thierry FOURNIER9f95e402014-03-21 14:51:46 +010033#include <types/global.h>
Baptiste Assmanna68ca962015-04-14 01:15:08 +020034#include <proto/dns.h>
Willy Tarreau45cb4fb2009-10-26 21:10:04 +010035#include <eb32tree.h>
Willy Tarreaued3cda02017-11-15 15:04:05 +010036#include <eb32sctree.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020037
Thierry Fournier93127942016-01-20 18:49:45 +010038/* This macro returns false if the test __x is false. Many
39 * of the following parsing function must be abort the processing
40 * if it returns 0, so this macro is useful for writing light code.
41 */
42#define RET0_UNLESS(__x) do { if (!(__x)) return 0; } while (0)
43
Willy Tarreau56adcf22012-12-23 18:00:29 +010044/* enough to store NB_ITOA_STR integers of :
Willy Tarreau72d759c2007-10-25 12:14:10 +020045 * 2^64-1 = 18446744073709551615 or
46 * -2^63 = -9223372036854775808
Willy Tarreaue7239b52009-03-29 13:41:58 +020047 *
48 * The HTML version needs room for adding the 25 characters
49 * '<span class="rls"></span>' around digits at positions 3N+1 in order
50 * to add spacing at up to 6 positions : 18 446 744 073 709 551 615
Willy Tarreau72d759c2007-10-25 12:14:10 +020051 */
Christopher Faulet99bca652017-11-14 16:47:26 +010052THREAD_LOCAL char itoa_str[NB_ITOA_STR][171];
53THREAD_LOCAL int itoa_idx = 0; /* index of next itoa_str to use */
Willy Tarreaubaaee002006-06-26 02:48:02 +020054
Willy Tarreau588297f2014-06-16 15:16:40 +020055/* sometimes we'll need to quote strings (eg: in stats), and we don't expect
56 * to quote strings larger than a max configuration line.
57 */
Christopher Faulet99bca652017-11-14 16:47:26 +010058THREAD_LOCAL char quoted_str[NB_QSTR][QSTR_SIZE + 1];
59THREAD_LOCAL int quoted_idx = 0;
Willy Tarreau588297f2014-06-16 15:16:40 +020060
Willy Tarreaubaaee002006-06-26 02:48:02 +020061/*
William Lallemande7340ec2012-01-24 11:15:39 +010062 * unsigned long long ASCII representation
63 *
64 * return the last char '\0' or NULL if no enough
65 * space in dst
66 */
67char *ulltoa(unsigned long long n, char *dst, size_t size)
68{
69 int i = 0;
70 char *res;
71
72 switch(n) {
73 case 1ULL ... 9ULL:
74 i = 0;
75 break;
76
77 case 10ULL ... 99ULL:
78 i = 1;
79 break;
80
81 case 100ULL ... 999ULL:
82 i = 2;
83 break;
84
85 case 1000ULL ... 9999ULL:
86 i = 3;
87 break;
88
89 case 10000ULL ... 99999ULL:
90 i = 4;
91 break;
92
93 case 100000ULL ... 999999ULL:
94 i = 5;
95 break;
96
97 case 1000000ULL ... 9999999ULL:
98 i = 6;
99 break;
100
101 case 10000000ULL ... 99999999ULL:
102 i = 7;
103 break;
104
105 case 100000000ULL ... 999999999ULL:
106 i = 8;
107 break;
108
109 case 1000000000ULL ... 9999999999ULL:
110 i = 9;
111 break;
112
113 case 10000000000ULL ... 99999999999ULL:
114 i = 10;
115 break;
116
117 case 100000000000ULL ... 999999999999ULL:
118 i = 11;
119 break;
120
121 case 1000000000000ULL ... 9999999999999ULL:
122 i = 12;
123 break;
124
125 case 10000000000000ULL ... 99999999999999ULL:
126 i = 13;
127 break;
128
129 case 100000000000000ULL ... 999999999999999ULL:
130 i = 14;
131 break;
132
133 case 1000000000000000ULL ... 9999999999999999ULL:
134 i = 15;
135 break;
136
137 case 10000000000000000ULL ... 99999999999999999ULL:
138 i = 16;
139 break;
140
141 case 100000000000000000ULL ... 999999999999999999ULL:
142 i = 17;
143 break;
144
145 case 1000000000000000000ULL ... 9999999999999999999ULL:
146 i = 18;
147 break;
148
149 case 10000000000000000000ULL ... ULLONG_MAX:
150 i = 19;
151 break;
152 }
153 if (i + 2 > size) // (i + 1) + '\0'
154 return NULL; // too long
155 res = dst + i + 1;
156 *res = '\0';
157 for (; i >= 0; i--) {
158 dst[i] = n % 10ULL + '0';
159 n /= 10ULL;
160 }
161 return res;
162}
163
164/*
165 * unsigned long ASCII representation
166 *
167 * return the last char '\0' or NULL if no enough
168 * space in dst
169 */
170char *ultoa_o(unsigned long n, char *dst, size_t size)
171{
172 int i = 0;
173 char *res;
174
175 switch (n) {
176 case 0U ... 9UL:
177 i = 0;
178 break;
179
180 case 10U ... 99UL:
181 i = 1;
182 break;
183
184 case 100U ... 999UL:
185 i = 2;
186 break;
187
188 case 1000U ... 9999UL:
189 i = 3;
190 break;
191
192 case 10000U ... 99999UL:
193 i = 4;
194 break;
195
196 case 100000U ... 999999UL:
197 i = 5;
198 break;
199
200 case 1000000U ... 9999999UL:
201 i = 6;
202 break;
203
204 case 10000000U ... 99999999UL:
205 i = 7;
206 break;
207
208 case 100000000U ... 999999999UL:
209 i = 8;
210 break;
211#if __WORDSIZE == 32
212
213 case 1000000000ULL ... ULONG_MAX:
214 i = 9;
215 break;
216
217#elif __WORDSIZE == 64
218
219 case 1000000000ULL ... 9999999999UL:
220 i = 9;
221 break;
222
223 case 10000000000ULL ... 99999999999UL:
224 i = 10;
225 break;
226
227 case 100000000000ULL ... 999999999999UL:
228 i = 11;
229 break;
230
231 case 1000000000000ULL ... 9999999999999UL:
232 i = 12;
233 break;
234
235 case 10000000000000ULL ... 99999999999999UL:
236 i = 13;
237 break;
238
239 case 100000000000000ULL ... 999999999999999UL:
240 i = 14;
241 break;
242
243 case 1000000000000000ULL ... 9999999999999999UL:
244 i = 15;
245 break;
246
247 case 10000000000000000ULL ... 99999999999999999UL:
248 i = 16;
249 break;
250
251 case 100000000000000000ULL ... 999999999999999999UL:
252 i = 17;
253 break;
254
255 case 1000000000000000000ULL ... 9999999999999999999UL:
256 i = 18;
257 break;
258
259 case 10000000000000000000ULL ... ULONG_MAX:
260 i = 19;
261 break;
262
263#endif
264 }
265 if (i + 2 > size) // (i + 1) + '\0'
266 return NULL; // too long
267 res = dst + i + 1;
268 *res = '\0';
269 for (; i >= 0; i--) {
270 dst[i] = n % 10U + '0';
271 n /= 10U;
272 }
273 return res;
274}
275
276/*
277 * signed long ASCII representation
278 *
279 * return the last char '\0' or NULL if no enough
280 * space in dst
281 */
282char *ltoa_o(long int n, char *dst, size_t size)
283{
284 char *pos = dst;
285
286 if (n < 0) {
287 if (size < 3)
288 return NULL; // min size is '-' + digit + '\0' but another test in ultoa
289 *pos = '-';
290 pos++;
291 dst = ultoa_o(-n, pos, size - 1);
292 } else {
293 dst = ultoa_o(n, dst, size);
294 }
295 return dst;
296}
297
298/*
299 * signed long long ASCII representation
300 *
301 * return the last char '\0' or NULL if no enough
302 * space in dst
303 */
304char *lltoa(long long n, char *dst, size_t size)
305{
306 char *pos = dst;
307
308 if (n < 0) {
309 if (size < 3)
310 return NULL; // min size is '-' + digit + '\0' but another test in ulltoa
311 *pos = '-';
312 pos++;
313 dst = ulltoa(-n, pos, size - 1);
314 } else {
315 dst = ulltoa(n, dst, size);
316 }
317 return dst;
318}
319
320/*
321 * write a ascii representation of a unsigned into dst,
322 * return a pointer to the last character
323 * Pad the ascii representation with '0', using size.
324 */
325char *utoa_pad(unsigned int n, char *dst, size_t size)
326{
327 int i = 0;
328 char *ret;
329
330 switch(n) {
331 case 0U ... 9U:
332 i = 0;
333 break;
334
335 case 10U ... 99U:
336 i = 1;
337 break;
338
339 case 100U ... 999U:
340 i = 2;
341 break;
342
343 case 1000U ... 9999U:
344 i = 3;
345 break;
346
347 case 10000U ... 99999U:
348 i = 4;
349 break;
350
351 case 100000U ... 999999U:
352 i = 5;
353 break;
354
355 case 1000000U ... 9999999U:
356 i = 6;
357 break;
358
359 case 10000000U ... 99999999U:
360 i = 7;
361 break;
362
363 case 100000000U ... 999999999U:
364 i = 8;
365 break;
366
367 case 1000000000U ... 4294967295U:
368 i = 9;
369 break;
370 }
371 if (i + 2 > size) // (i + 1) + '\0'
372 return NULL; // too long
373 if (i < size)
374 i = size - 2; // padding - '\0'
375
376 ret = dst + i + 1;
377 *ret = '\0';
378 for (; i >= 0; i--) {
379 dst[i] = n % 10U + '0';
380 n /= 10U;
381 }
382 return ret;
383}
384
385/*
Willy Tarreaubaaee002006-06-26 02:48:02 +0200386 * copies at most <size-1> chars from <src> to <dst>. Last char is always
387 * set to 0, unless <size> is 0. The number of chars copied is returned
388 * (excluding the terminating zero).
389 * This code has been optimized for size and speed : on x86, it's 45 bytes
390 * long, uses only registers, and consumes only 4 cycles per char.
391 */
392int strlcpy2(char *dst, const char *src, int size)
393{
394 char *orig = dst;
395 if (size) {
396 while (--size && (*dst = *src)) {
397 src++; dst++;
398 }
399 *dst = 0;
400 }
401 return dst - orig;
402}
403
404/*
Willy Tarreau72d759c2007-10-25 12:14:10 +0200405 * This function simply returns a locally allocated string containing
Willy Tarreaubaaee002006-06-26 02:48:02 +0200406 * the ascii representation for number 'n' in decimal.
407 */
Emeric Brun3a7fce52010-01-04 14:54:38 +0100408char *ultoa_r(unsigned long n, char *buffer, int size)
Willy Tarreaubaaee002006-06-26 02:48:02 +0200409{
410 char *pos;
411
Willy Tarreau72d759c2007-10-25 12:14:10 +0200412 pos = buffer + size - 1;
Willy Tarreaubaaee002006-06-26 02:48:02 +0200413 *pos-- = '\0';
414
415 do {
416 *pos-- = '0' + n % 10;
417 n /= 10;
Willy Tarreau72d759c2007-10-25 12:14:10 +0200418 } while (n && pos >= buffer);
Willy Tarreaubaaee002006-06-26 02:48:02 +0200419 return pos + 1;
420}
421
Willy Tarreau91092e52007-10-25 16:58:42 +0200422/*
Willy Tarreaue7239b52009-03-29 13:41:58 +0200423 * This function simply returns a locally allocated string containing
Thierry FOURNIER763a5d82015-07-06 23:09:52 +0200424 * the ascii representation for number 'n' in decimal.
425 */
426char *lltoa_r(long long int in, char *buffer, int size)
427{
428 char *pos;
429 int neg = 0;
430 unsigned long long int n;
431
432 pos = buffer + size - 1;
433 *pos-- = '\0';
434
435 if (in < 0) {
436 neg = 1;
437 n = -in;
438 }
439 else
440 n = in;
441
442 do {
443 *pos-- = '0' + n % 10;
444 n /= 10;
445 } while (n && pos >= buffer);
446 if (neg && pos > buffer)
447 *pos-- = '-';
448 return pos + 1;
449}
450
451/*
452 * This function simply returns a locally allocated string containing
Thierry FOURNIER1480bd82015-06-06 19:14:59 +0200453 * the ascii representation for signed number 'n' in decimal.
454 */
455char *sltoa_r(long n, char *buffer, int size)
456{
457 char *pos;
458
459 if (n >= 0)
460 return ultoa_r(n, buffer, size);
461
462 pos = ultoa_r(-n, buffer + 1, size - 1) - 1;
463 *pos = '-';
464 return pos;
465}
466
467/*
468 * This function simply returns a locally allocated string containing
Willy Tarreaue7239b52009-03-29 13:41:58 +0200469 * the ascii representation for number 'n' in decimal, formatted for
470 * HTML output with tags to create visual grouping by 3 digits. The
471 * output needs to support at least 171 characters.
472 */
473const char *ulltoh_r(unsigned long long n, char *buffer, int size)
474{
475 char *start;
476 int digit = 0;
477
478 start = buffer + size;
479 *--start = '\0';
480
481 do {
482 if (digit == 3 && start >= buffer + 7)
483 memcpy(start -= 7, "</span>", 7);
484
485 if (start >= buffer + 1) {
486 *--start = '0' + n % 10;
487 n /= 10;
488 }
489
490 if (digit == 3 && start >= buffer + 18)
491 memcpy(start -= 18, "<span class=\"rls\">", 18);
492
493 if (digit++ == 3)
494 digit = 1;
495 } while (n && start > buffer);
496 return start;
497}
498
499/*
Willy Tarreau91092e52007-10-25 16:58:42 +0200500 * This function simply returns a locally allocated string containing the ascii
501 * representation for number 'n' in decimal, unless n is 0 in which case it
502 * returns the alternate string (or an empty string if the alternate string is
503 * NULL). It use is intended for limits reported in reports, where it's
504 * desirable not to display anything if there is no limit. Warning! it shares
505 * the same vector as ultoa_r().
506 */
507const char *limit_r(unsigned long n, char *buffer, int size, const char *alt)
508{
509 return (n) ? ultoa_r(n, buffer, size) : (alt ? alt : "");
510}
511
Willy Tarreau588297f2014-06-16 15:16:40 +0200512/* returns a locally allocated string containing the quoted encoding of the
513 * input string. The output may be truncated to QSTR_SIZE chars, but it is
514 * guaranteed that the string will always be properly terminated. Quotes are
515 * encoded by doubling them as is commonly done in CSV files. QSTR_SIZE must
516 * always be at least 4 chars.
517 */
518const char *qstr(const char *str)
519{
520 char *ret = quoted_str[quoted_idx];
521 char *p, *end;
522
523 if (++quoted_idx >= NB_QSTR)
524 quoted_idx = 0;
525
526 p = ret;
527 end = ret + QSTR_SIZE;
528
529 *p++ = '"';
530
531 /* always keep 3 chars to support passing "" and the ending " */
532 while (*str && p < end - 3) {
533 if (*str == '"') {
534 *p++ = '"';
535 *p++ = '"';
536 }
537 else
538 *p++ = *str;
539 str++;
540 }
541 *p++ = '"';
542 return ret;
543}
544
Robert Tsai81ae1952007-12-05 10:47:29 +0100545/*
Willy Tarreaubaaee002006-06-26 02:48:02 +0200546 * Returns non-zero if character <s> is a hex digit (0-9, a-f, A-F), else zero.
547 *
548 * It looks like this one would be a good candidate for inlining, but this is
549 * not interesting because it around 35 bytes long and often called multiple
550 * times within the same function.
551 */
552int ishex(char s)
553{
554 s -= '0';
555 if ((unsigned char)s <= 9)
556 return 1;
557 s -= 'A' - '0';
558 if ((unsigned char)s <= 5)
559 return 1;
560 s -= 'a' - 'A';
561 if ((unsigned char)s <= 5)
562 return 1;
563 return 0;
564}
565
Willy Tarreau3ca1a882015-01-15 18:43:49 +0100566/* rounds <i> down to the closest value having max 2 digits */
567unsigned int round_2dig(unsigned int i)
568{
569 unsigned int mul = 1;
570
571 while (i >= 100) {
572 i /= 10;
573 mul *= 10;
574 }
575 return i * mul;
576}
577
Willy Tarreau2e74c3f2007-12-02 18:45:09 +0100578/*
579 * Checks <name> for invalid characters. Valid chars are [A-Za-z0-9_:.-]. If an
580 * invalid character is found, a pointer to it is returned. If everything is
581 * fine, NULL is returned.
582 */
583const char *invalid_char(const char *name)
584{
585 if (!*name)
586 return name;
587
588 while (*name) {
Willy Tarreau90807112020-02-25 08:16:33 +0100589 if (!isalnum((unsigned char)*name) && *name != '.' && *name != ':' &&
Willy Tarreau2e74c3f2007-12-02 18:45:09 +0100590 *name != '_' && *name != '-')
591 return name;
592 name++;
593 }
594 return NULL;
595}
Willy Tarreaubaaee002006-06-26 02:48:02 +0200596
597/*
Frédéric Lécailleb82f7422017-04-13 18:24:23 +0200598 * Checks <name> for invalid characters. Valid chars are [_.-] and those
599 * accepted by <f> function.
Krzysztof Piotr Oledzkiefe3b6f2008-05-23 23:49:32 +0200600 * If an invalid character is found, a pointer to it is returned.
601 * If everything is fine, NULL is returned.
602 */
Frédéric Lécailleb82f7422017-04-13 18:24:23 +0200603static inline const char *__invalid_char(const char *name, int (*f)(int)) {
Krzysztof Piotr Oledzkiefe3b6f2008-05-23 23:49:32 +0200604
605 if (!*name)
606 return name;
607
608 while (*name) {
Willy Tarreau90807112020-02-25 08:16:33 +0100609 if (!f((unsigned char)*name) && *name != '.' &&
Krzysztof Piotr Oledzkiefe3b6f2008-05-23 23:49:32 +0200610 *name != '_' && *name != '-')
611 return name;
612
613 name++;
614 }
615
616 return NULL;
617}
618
619/*
Frédéric Lécailleb82f7422017-04-13 18:24:23 +0200620 * Checks <name> for invalid characters. Valid chars are [A-Za-z0-9_.-].
621 * If an invalid character is found, a pointer to it is returned.
622 * If everything is fine, NULL is returned.
623 */
624const char *invalid_domainchar(const char *name) {
625 return __invalid_char(name, isalnum);
626}
627
628/*
629 * Checks <name> for invalid characters. Valid chars are [A-Za-z_.-].
630 * If an invalid character is found, a pointer to it is returned.
631 * If everything is fine, NULL is returned.
632 */
633const char *invalid_prefix_char(const char *name) {
Thierry Fournierf7b7c3e2018-03-26 11:54:39 +0200634 return __invalid_char(name, isalnum);
Frédéric Lécailleb82f7422017-04-13 18:24:23 +0200635}
636
637/*
Willy Tarreauc120c8d2013-03-10 19:27:44 +0100638 * converts <str> to a struct sockaddr_storage* provided by the caller. The
Willy Tarreau24709282013-03-10 21:32:12 +0100639 * caller must have zeroed <sa> first, and may have set sa->ss_family to force
640 * parse a specific address format. If the ss_family is 0 or AF_UNSPEC, then
641 * the function tries to guess the address family from the syntax. If the
642 * family is forced and the format doesn't match, an error is returned. The
Willy Tarreaufab5a432011-03-04 15:31:53 +0100643 * string is assumed to contain only an address, no port. The address can be a
644 * dotted IPv4 address, an IPv6 address, a host name, or empty or "*" to
645 * indicate INADDR_ANY. NULL is returned if the host part cannot be resolved.
646 * The return address will only have the address family and the address set,
647 * all other fields remain zero. The string is not supposed to be modified.
Thierry FOURNIER58639a02014-11-25 12:02:25 +0100648 * The IPv6 '::' address is IN6ADDR_ANY. If <resolve> is non-zero, the hostname
649 * is resolved, otherwise only IP addresses are resolved, and anything else
Willy Tarreauecde7df2016-11-02 22:37:03 +0100650 * returns NULL. If the address contains a port, this one is preserved.
Willy Tarreaubaaee002006-06-26 02:48:02 +0200651 */
Thierry FOURNIER58639a02014-11-25 12:02:25 +0100652struct sockaddr_storage *str2ip2(const char *str, struct sockaddr_storage *sa, int resolve)
Willy Tarreaubaaee002006-06-26 02:48:02 +0200653{
Willy Tarreaufab5a432011-03-04 15:31:53 +0100654 struct hostent *he;
mildisff5d5102015-10-26 18:50:08 +0100655 /* max IPv6 length, including brackets and terminating NULL */
656 char tmpip[48];
Willy Tarreauecde7df2016-11-02 22:37:03 +0100657 int port = get_host_port(sa);
mildisff5d5102015-10-26 18:50:08 +0100658
659 /* check IPv6 with square brackets */
660 if (str[0] == '[') {
661 size_t iplength = strlen(str);
662
663 if (iplength < 4) {
664 /* minimal size is 4 when using brackets "[::]" */
665 goto fail;
666 }
667 else if (iplength >= sizeof(tmpip)) {
668 /* IPv6 literal can not be larger than tmpip */
669 goto fail;
670 }
671 else {
672 if (str[iplength - 1] != ']') {
673 /* if address started with bracket, it should end with bracket */
674 goto fail;
675 }
676 else {
677 memcpy(tmpip, str + 1, iplength - 2);
678 tmpip[iplength - 2] = '\0';
679 str = tmpip;
680 }
681 }
682 }
Willy Tarreaufab5a432011-03-04 15:31:53 +0100683
Willy Tarreaufab5a432011-03-04 15:31:53 +0100684 /* Any IPv6 address */
685 if (str[0] == ':' && str[1] == ':' && !str[2]) {
Willy Tarreau24709282013-03-10 21:32:12 +0100686 if (!sa->ss_family || sa->ss_family == AF_UNSPEC)
687 sa->ss_family = AF_INET6;
688 else if (sa->ss_family != AF_INET6)
689 goto fail;
Willy Tarreauecde7df2016-11-02 22:37:03 +0100690 set_host_port(sa, port);
Willy Tarreauc120c8d2013-03-10 19:27:44 +0100691 return sa;
Willy Tarreaufab5a432011-03-04 15:31:53 +0100692 }
693
Willy Tarreau24709282013-03-10 21:32:12 +0100694 /* Any address for the family, defaults to IPv4 */
Willy Tarreaufab5a432011-03-04 15:31:53 +0100695 if (!str[0] || (str[0] == '*' && !str[1])) {
Willy Tarreau24709282013-03-10 21:32:12 +0100696 if (!sa->ss_family || sa->ss_family == AF_UNSPEC)
697 sa->ss_family = AF_INET;
Willy Tarreauecde7df2016-11-02 22:37:03 +0100698 set_host_port(sa, port);
Willy Tarreauc120c8d2013-03-10 19:27:44 +0100699 return sa;
Willy Tarreaufab5a432011-03-04 15:31:53 +0100700 }
701
702 /* check for IPv6 first */
Willy Tarreau24709282013-03-10 21:32:12 +0100703 if ((!sa->ss_family || sa->ss_family == AF_UNSPEC || sa->ss_family == AF_INET6) &&
704 inet_pton(AF_INET6, str, &((struct sockaddr_in6 *)sa)->sin6_addr)) {
Willy Tarreauc120c8d2013-03-10 19:27:44 +0100705 sa->ss_family = AF_INET6;
Willy Tarreauecde7df2016-11-02 22:37:03 +0100706 set_host_port(sa, port);
Willy Tarreauc120c8d2013-03-10 19:27:44 +0100707 return sa;
Willy Tarreaufab5a432011-03-04 15:31:53 +0100708 }
709
710 /* then check for IPv4 */
Willy Tarreau24709282013-03-10 21:32:12 +0100711 if ((!sa->ss_family || sa->ss_family == AF_UNSPEC || sa->ss_family == AF_INET) &&
712 inet_pton(AF_INET, str, &((struct sockaddr_in *)sa)->sin_addr)) {
Willy Tarreauc120c8d2013-03-10 19:27:44 +0100713 sa->ss_family = AF_INET;
Willy Tarreauecde7df2016-11-02 22:37:03 +0100714 set_host_port(sa, port);
Willy Tarreauc120c8d2013-03-10 19:27:44 +0100715 return sa;
Willy Tarreaufab5a432011-03-04 15:31:53 +0100716 }
717
Thierry FOURNIER58639a02014-11-25 12:02:25 +0100718 if (!resolve)
719 return NULL;
720
Baptiste Assmanna68ca962015-04-14 01:15:08 +0200721 if (!dns_hostname_validation(str, NULL))
722 return NULL;
723
David du Colombierd5f43282011-03-17 10:40:16 +0100724#ifdef USE_GETADDRINFO
Nenad Merdanovic88afe032014-04-14 15:56:58 +0200725 if (global.tune.options & GTUNE_USE_GAI) {
David du Colombierd5f43282011-03-17 10:40:16 +0100726 struct addrinfo hints, *result;
Tim Duesterhus7d58b4d2018-01-21 22:11:17 +0100727 int success = 0;
David du Colombierd5f43282011-03-17 10:40:16 +0100728
729 memset(&result, 0, sizeof(result));
730 memset(&hints, 0, sizeof(hints));
Willy Tarreau24709282013-03-10 21:32:12 +0100731 hints.ai_family = sa->ss_family ? sa->ss_family : AF_UNSPEC;
David du Colombierd5f43282011-03-17 10:40:16 +0100732 hints.ai_socktype = SOCK_DGRAM;
Dmitry Sivachenkoeab7f392015-10-02 01:01:58 +0200733 hints.ai_flags = 0;
David du Colombierd5f43282011-03-17 10:40:16 +0100734 hints.ai_protocol = 0;
735
736 if (getaddrinfo(str, NULL, &hints, &result) == 0) {
Willy Tarreau24709282013-03-10 21:32:12 +0100737 if (!sa->ss_family || sa->ss_family == AF_UNSPEC)
738 sa->ss_family = result->ai_family;
Tim Duesterhus7d58b4d2018-01-21 22:11:17 +0100739 else if (sa->ss_family != result->ai_family) {
740 freeaddrinfo(result);
Willy Tarreau24709282013-03-10 21:32:12 +0100741 goto fail;
Tim Duesterhus7d58b4d2018-01-21 22:11:17 +0100742 }
Willy Tarreau24709282013-03-10 21:32:12 +0100743
David du Colombierd5f43282011-03-17 10:40:16 +0100744 switch (result->ai_family) {
745 case AF_INET:
Willy Tarreauc120c8d2013-03-10 19:27:44 +0100746 memcpy((struct sockaddr_in *)sa, result->ai_addr, result->ai_addrlen);
Willy Tarreauecde7df2016-11-02 22:37:03 +0100747 set_host_port(sa, port);
Tim Duesterhus7d58b4d2018-01-21 22:11:17 +0100748 success = 1;
749 break;
David du Colombierd5f43282011-03-17 10:40:16 +0100750 case AF_INET6:
Willy Tarreauc120c8d2013-03-10 19:27:44 +0100751 memcpy((struct sockaddr_in6 *)sa, result->ai_addr, result->ai_addrlen);
Willy Tarreauecde7df2016-11-02 22:37:03 +0100752 set_host_port(sa, port);
Tim Duesterhus7d58b4d2018-01-21 22:11:17 +0100753 success = 1;
754 break;
David du Colombierd5f43282011-03-17 10:40:16 +0100755 }
756 }
757
Sean Carey58ea0392013-02-15 23:39:18 +0100758 if (result)
759 freeaddrinfo(result);
Tim Duesterhus7d58b4d2018-01-21 22:11:17 +0100760
761 if (success)
762 return sa;
Willy Tarreaufab5a432011-03-04 15:31:53 +0100763 }
David du Colombierd5f43282011-03-17 10:40:16 +0100764#endif
Nenad Merdanovic88afe032014-04-14 15:56:58 +0200765 /* try to resolve an IPv4/IPv6 hostname */
766 he = gethostbyname(str);
767 if (he) {
768 if (!sa->ss_family || sa->ss_family == AF_UNSPEC)
769 sa->ss_family = he->h_addrtype;
770 else if (sa->ss_family != he->h_addrtype)
771 goto fail;
772
773 switch (sa->ss_family) {
774 case AF_INET:
775 ((struct sockaddr_in *)sa)->sin_addr = *(struct in_addr *) *(he->h_addr_list);
Willy Tarreauecde7df2016-11-02 22:37:03 +0100776 set_host_port(sa, port);
Nenad Merdanovic88afe032014-04-14 15:56:58 +0200777 return sa;
778 case AF_INET6:
779 ((struct sockaddr_in6 *)sa)->sin6_addr = *(struct in6_addr *) *(he->h_addr_list);
Willy Tarreauecde7df2016-11-02 22:37:03 +0100780 set_host_port(sa, port);
Nenad Merdanovic88afe032014-04-14 15:56:58 +0200781 return sa;
782 }
783 }
784
David du Colombierd5f43282011-03-17 10:40:16 +0100785 /* unsupported address family */
Willy Tarreau24709282013-03-10 21:32:12 +0100786 fail:
Willy Tarreaufab5a432011-03-04 15:31:53 +0100787 return NULL;
788}
789
790/*
Willy Tarreaud4448bc2013-02-20 15:55:15 +0100791 * Converts <str> to a locally allocated struct sockaddr_storage *, and a port
792 * range or offset consisting in two integers that the caller will have to
793 * check to find the relevant input format. The following format are supported :
794 *
795 * String format | address | port | low | high
796 * addr | <addr> | 0 | 0 | 0
797 * addr: | <addr> | 0 | 0 | 0
798 * addr:port | <addr> | <port> | <port> | <port>
799 * addr:pl-ph | <addr> | <pl> | <pl> | <ph>
800 * addr:+port | <addr> | <port> | 0 | <port>
801 * addr:-port | <addr> |-<port> | <port> | 0
802 *
803 * The detection of a port range or increment by the caller is made by
804 * comparing <low> and <high>. If both are equal, then port 0 means no port
805 * was specified. The caller may pass NULL for <low> and <high> if it is not
806 * interested in retrieving port ranges.
807 *
808 * Note that <addr> above may also be :
809 * - empty ("") => family will be AF_INET and address will be INADDR_ANY
810 * - "*" => family will be AF_INET and address will be INADDR_ANY
811 * - "::" => family will be AF_INET6 and address will be IN6ADDR_ANY
812 * - a host name => family and address will depend on host name resolving.
813 *
Willy Tarreau24709282013-03-10 21:32:12 +0100814 * A prefix may be passed in before the address above to force the family :
815 * - "ipv4@" => force address to resolve as IPv4 and fail if not possible.
816 * - "ipv6@" => force address to resolve as IPv6 and fail if not possible.
817 * - "unix@" => force address to be a path to a UNIX socket even if the
818 * path does not start with a '/'
Willy Tarreauccfccef2014-05-10 01:49:15 +0200819 * - 'abns@' -> force address to belong to the abstract namespace (Linux
820 * only). These sockets are just like Unix sockets but without
821 * the need for an underlying file system. The address is a
822 * string. Technically it's like a Unix socket with a zero in
823 * the first byte of the address.
Willy Tarreau40aa0702013-03-10 23:51:38 +0100824 * - "fd@" => an integer must follow, and is a file descriptor number.
Willy Tarreau24709282013-03-10 21:32:12 +0100825 *
mildisff5d5102015-10-26 18:50:08 +0100826 * IPv6 addresses can be declared with or without square brackets. When using
827 * square brackets for IPv6 addresses, the port separator (colon) is optional.
828 * If not using square brackets, and in order to avoid any ambiguity with
829 * IPv6 addresses, the last colon ':' is mandatory even when no port is specified.
830 * NULL is returned if the address cannot be parsed. The <low> and <high> ports
831 * are always initialized if non-null, even for non-IP families.
Willy Tarreaud393a622013-03-04 18:22:00 +0100832 *
833 * If <pfx> is non-null, it is used as a string prefix before any path-based
834 * address (typically the path to a unix socket).
Willy Tarreau40aa0702013-03-10 23:51:38 +0100835 *
Willy Tarreau72b8c1f2015-09-08 15:50:19 +0200836 * if <fqdn> is non-null, it will be filled with :
837 * - a pointer to the FQDN of the server name to resolve if there's one, and
838 * that the caller will have to free(),
839 * - NULL if there was an explicit address that doesn't require resolution.
840 *
Willy Tarreauceccdd72016-11-02 22:27:10 +0100841 * Hostnames are only resolved if <resolve> is non-null. Note that if <resolve>
842 * is null, <fqdn> is still honnored so it is possible for the caller to know
843 * whether a resolution failed by setting <resolve> to null and checking if
844 * <fqdn> was filled, indicating the need for a resolution.
Thierry FOURNIER7fe3be72015-09-26 20:03:36 +0200845 *
Willy Tarreau40aa0702013-03-10 23:51:38 +0100846 * When a file descriptor is passed, its value is put into the s_addr part of
847 * the address when cast to sockaddr_in and the address family is AF_UNSPEC.
Willy Tarreaufab5a432011-03-04 15:31:53 +0100848 */
Willy Tarreau48ef4c92017-01-06 18:32:38 +0100849struct sockaddr_storage *str2sa_range(const char *str, int *port, int *low, int *high, char **err, const char *pfx, char **fqdn, int resolve)
Willy Tarreaufab5a432011-03-04 15:31:53 +0100850{
Christopher Faulet1bc04c72017-10-29 20:14:08 +0100851 static THREAD_LOCAL struct sockaddr_storage ss;
David du Colombier6f5ccb12011-03-10 22:26:24 +0100852 struct sockaddr_storage *ret = NULL;
Willy Tarreau24709282013-03-10 21:32:12 +0100853 char *back, *str2;
Willy Tarreaud4448bc2013-02-20 15:55:15 +0100854 char *port1, *port2;
855 int portl, porth, porta;
Willy Tarreauccfccef2014-05-10 01:49:15 +0200856 int abstract = 0;
Willy Tarreaud4448bc2013-02-20 15:55:15 +0100857
858 portl = porth = porta = 0;
Willy Tarreau72b8c1f2015-09-08 15:50:19 +0200859 if (fqdn)
860 *fqdn = NULL;
Willy Tarreaubaaee002006-06-26 02:48:02 +0200861
Willy Tarreaudad36a32013-03-11 01:20:04 +0100862 str2 = back = env_expand(strdup(str));
Willy Tarreaudf350f12013-03-01 20:22:54 +0100863 if (str2 == NULL) {
864 memprintf(err, "out of memory in '%s'\n", __FUNCTION__);
Willy Tarreaud5191e72010-02-09 20:50:45 +0100865 goto out;
Willy Tarreaudf350f12013-03-01 20:22:54 +0100866 }
Willy Tarreaubaaee002006-06-26 02:48:02 +0200867
Willy Tarreau9f69f462015-09-08 16:01:25 +0200868 if (!*str2) {
869 memprintf(err, "'%s' resolves to an empty address (environment variable missing?)\n", str);
870 goto out;
871 }
872
Willy Tarreau24709282013-03-10 21:32:12 +0100873 memset(&ss, 0, sizeof(ss));
874
875 if (strncmp(str2, "unix@", 5) == 0) {
876 str2 += 5;
Willy Tarreauccfccef2014-05-10 01:49:15 +0200877 abstract = 0;
Willy Tarreau24709282013-03-10 21:32:12 +0100878 ss.ss_family = AF_UNIX;
879 }
Willy Tarreauccfccef2014-05-10 01:49:15 +0200880 else if (strncmp(str2, "abns@", 5) == 0) {
881 str2 += 5;
882 abstract = 1;
883 ss.ss_family = AF_UNIX;
884 }
Willy Tarreau24709282013-03-10 21:32:12 +0100885 else if (strncmp(str2, "ipv4@", 5) == 0) {
886 str2 += 5;
887 ss.ss_family = AF_INET;
888 }
889 else if (strncmp(str2, "ipv6@", 5) == 0) {
890 str2 += 5;
891 ss.ss_family = AF_INET6;
892 }
893 else if (*str2 == '/') {
894 ss.ss_family = AF_UNIX;
895 }
896 else
897 ss.ss_family = AF_UNSPEC;
898
William Lallemand2fe7dd02018-09-11 16:51:29 +0200899 if (ss.ss_family == AF_UNSPEC && strncmp(str2, "sockpair@", 9) == 0) {
900 char *endptr;
901
902 str2 += 9;
903
904 ((struct sockaddr_in *)&ss)->sin_addr.s_addr = strtol(str2, &endptr, 10);
Willy Tarreau0205a4e2018-12-15 15:40:12 +0100905 ((struct sockaddr_in *)&ss)->sin_port = 0;
William Lallemand2fe7dd02018-09-11 16:51:29 +0200906
907 if (!*str2 || *endptr) {
908 memprintf(err, "file descriptor '%s' is not a valid integer in '%s'\n", str2, str);
909 goto out;
910 }
911
912 ss.ss_family = AF_CUST_SOCKPAIR;
913
914 }
915 else if (ss.ss_family == AF_UNSPEC && strncmp(str2, "fd@", 3) == 0) {
Willy Tarreau40aa0702013-03-10 23:51:38 +0100916 char *endptr;
917
918 str2 += 3;
919 ((struct sockaddr_in *)&ss)->sin_addr.s_addr = strtol(str2, &endptr, 10);
Willy Tarreau0205a4e2018-12-15 15:40:12 +0100920 ((struct sockaddr_in *)&ss)->sin_port = 0;
Willy Tarreau40aa0702013-03-10 23:51:38 +0100921
922 if (!*str2 || *endptr) {
Willy Tarreaudad36a32013-03-11 01:20:04 +0100923 memprintf(err, "file descriptor '%s' is not a valid integer in '%s'\n", str2, str);
Willy Tarreau40aa0702013-03-10 23:51:38 +0100924 goto out;
925 }
926
927 /* we return AF_UNSPEC if we use a file descriptor number */
928 ss.ss_family = AF_UNSPEC;
929 }
930 else if (ss.ss_family == AF_UNIX) {
Willy Tarreau8daa9202019-06-16 18:16:33 +0200931 struct sockaddr_un *un = (struct sockaddr_un *)&ss;
Willy Tarreau15586382013-03-04 19:48:14 +0100932 int prefix_path_len;
933 int max_path_len;
Willy Tarreau94ef3f32014-04-14 14:49:00 +0200934 int adr_len;
Willy Tarreau15586382013-03-04 19:48:14 +0100935
936 /* complete unix socket path name during startup or soft-restart is
937 * <unix_bind_prefix><path>.<pid>.<bak|tmp>
938 */
Willy Tarreauccfccef2014-05-10 01:49:15 +0200939 prefix_path_len = (pfx && !abstract) ? strlen(pfx) : 0;
Willy Tarreau8daa9202019-06-16 18:16:33 +0200940 max_path_len = (sizeof(un->sun_path) - 1) -
Willy Tarreau327ea5a2020-02-11 06:43:37 +0100941 (abstract ? 0 : prefix_path_len + 1 + 5 + 1 + 3);
Willy Tarreau15586382013-03-04 19:48:14 +0100942
Willy Tarreau94ef3f32014-04-14 14:49:00 +0200943 adr_len = strlen(str2);
944 if (adr_len > max_path_len) {
Willy Tarreau15586382013-03-04 19:48:14 +0100945 memprintf(err, "socket path '%s' too long (max %d)\n", str, max_path_len);
946 goto out;
947 }
948
Willy Tarreauccfccef2014-05-10 01:49:15 +0200949 /* when abstract==1, we skip the first zero and copy all bytes except the trailing zero */
Willy Tarreau8daa9202019-06-16 18:16:33 +0200950 memset(un->sun_path, 0, sizeof(un->sun_path));
Willy Tarreau94ef3f32014-04-14 14:49:00 +0200951 if (prefix_path_len)
Willy Tarreau8daa9202019-06-16 18:16:33 +0200952 memcpy(un->sun_path, pfx, prefix_path_len);
953 memcpy(un->sun_path + prefix_path_len + abstract, str2, adr_len + 1 - abstract);
Willy Tarreau15586382013-03-04 19:48:14 +0100954 }
Willy Tarreau24709282013-03-10 21:32:12 +0100955 else { /* IPv4 and IPv6 */
mildisff5d5102015-10-26 18:50:08 +0100956 char *end = str2 + strlen(str2);
957 char *chr;
Willy Tarreau72b8c1f2015-09-08 15:50:19 +0200958
mildisff5d5102015-10-26 18:50:08 +0100959 /* search for : or ] whatever comes first */
960 for (chr = end-1; chr > str2; chr--) {
961 if (*chr == ']' || *chr == ':')
962 break;
963 }
964
965 if (*chr == ':') {
966 /* Found a colon before a closing-bracket, must be a port separator.
967 * This guarantee backward compatibility.
968 */
969 *chr++ = '\0';
970 port1 = chr;
971 }
972 else {
973 /* Either no colon and no closing-bracket
974 * or directly ending with a closing-bracket.
975 * However, no port.
976 */
Willy Tarreauc120c8d2013-03-10 19:27:44 +0100977 port1 = "";
mildisff5d5102015-10-26 18:50:08 +0100978 }
Willy Tarreaubaaee002006-06-26 02:48:02 +0200979
Willy Tarreau90807112020-02-25 08:16:33 +0100980 if (isdigit((unsigned char)*port1)) { /* single port or range */
Willy Tarreauc120c8d2013-03-10 19:27:44 +0100981 port2 = strchr(port1, '-');
982 if (port2)
983 *port2++ = '\0';
984 else
985 port2 = port1;
986 portl = atoi(port1);
987 porth = atoi(port2);
988 porta = portl;
989 }
990 else if (*port1 == '-') { /* negative offset */
991 portl = atoi(port1 + 1);
992 porta = -portl;
993 }
994 else if (*port1 == '+') { /* positive offset */
995 porth = atoi(port1 + 1);
996 porta = porth;
997 }
998 else if (*port1) { /* other any unexpected char */
Willy Tarreaudad36a32013-03-11 01:20:04 +0100999 memprintf(err, "invalid character '%c' in port number '%s' in '%s'\n", *port1, port1, str);
Willy Tarreauc120c8d2013-03-10 19:27:44 +01001000 goto out;
1001 }
Willy Tarreauceccdd72016-11-02 22:27:10 +01001002
1003 /* first try to parse the IP without resolving. If it fails, it
1004 * tells us we need to keep a copy of the FQDN to resolve later
1005 * and to enable DNS. In this case we can proceed if <fqdn> is
1006 * set or if resolve is set, otherwise it's an error.
1007 */
1008 if (str2ip2(str2, &ss, 0) == NULL) {
Willy Tarreau7b760c92017-01-06 19:23:20 +01001009 if ((!resolve && !fqdn) ||
Willy Tarreauceccdd72016-11-02 22:27:10 +01001010 (resolve && str2ip2(str2, &ss, 1) == NULL)) {
1011 memprintf(err, "invalid address: '%s' in '%s'\n", str2, str);
1012 goto out;
1013 }
Willy Tarreau72b8c1f2015-09-08 15:50:19 +02001014
Willy Tarreauceccdd72016-11-02 22:27:10 +01001015 if (fqdn) {
1016 if (str2 != back)
1017 memmove(back, str2, strlen(str2) + 1);
1018 *fqdn = back;
1019 back = NULL;
1020 }
Willy Tarreau72b8c1f2015-09-08 15:50:19 +02001021 }
Willy Tarreauceccdd72016-11-02 22:27:10 +01001022 set_host_port(&ss, porta);
Willy Tarreaue4c58c82013-03-06 15:28:17 +01001023 }
Willy Tarreaufab5a432011-03-04 15:31:53 +01001024
Willy Tarreauc120c8d2013-03-10 19:27:44 +01001025 ret = &ss;
Willy Tarreaud5191e72010-02-09 20:50:45 +01001026 out:
Willy Tarreau48ef4c92017-01-06 18:32:38 +01001027 if (port)
1028 *port = porta;
Willy Tarreaud4448bc2013-02-20 15:55:15 +01001029 if (low)
1030 *low = portl;
1031 if (high)
1032 *high = porth;
Willy Tarreau24709282013-03-10 21:32:12 +01001033 free(back);
Willy Tarreaud5191e72010-02-09 20:50:45 +01001034 return ret;
Willy Tarreauc6f4ce82009-06-10 11:09:37 +02001035}
1036
Willy Tarreau2937c0d2010-01-26 17:36:17 +01001037/* converts <str> to a struct in_addr containing a network mask. It can be
1038 * passed in dotted form (255.255.255.0) or in CIDR form (24). It returns 1
Jarno Huuskonen577d5ac2017-05-21 17:32:21 +03001039 * if the conversion succeeds otherwise zero.
Willy Tarreau2937c0d2010-01-26 17:36:17 +01001040 */
1041int str2mask(const char *str, struct in_addr *mask)
1042{
1043 if (strchr(str, '.') != NULL) { /* dotted notation */
1044 if (!inet_pton(AF_INET, str, mask))
1045 return 0;
1046 }
1047 else { /* mask length */
1048 char *err;
1049 unsigned long len = strtol(str, &err, 10);
1050
1051 if (!*str || (err && *err) || (unsigned)len > 32)
1052 return 0;
Tim Duesterhus8575f722018-01-25 16:24:48 +01001053
1054 len2mask4(len, mask);
Willy Tarreau2937c0d2010-01-26 17:36:17 +01001055 }
1056 return 1;
1057}
1058
Tim Duesterhus47185172018-01-25 16:24:49 +01001059/* converts <str> to a struct in6_addr containing a network mask. It can be
Tim Duesterhus5e642862018-02-20 17:02:18 +01001060 * passed in quadruplet form (ffff:ffff::) or in CIDR form (64). It returns 1
Tim Duesterhus47185172018-01-25 16:24:49 +01001061 * if the conversion succeeds otherwise zero.
1062 */
1063int str2mask6(const char *str, struct in6_addr *mask)
1064{
1065 if (strchr(str, ':') != NULL) { /* quadruplet notation */
1066 if (!inet_pton(AF_INET6, str, mask))
1067 return 0;
1068 }
1069 else { /* mask length */
1070 char *err;
1071 unsigned long len = strtol(str, &err, 10);
1072
1073 if (!*str || (err && *err) || (unsigned)len > 128)
1074 return 0;
1075
1076 len2mask6(len, mask);
1077 }
1078 return 1;
1079}
1080
Thierry FOURNIERb0504632013-12-14 15:39:02 +01001081/* convert <cidr> to struct in_addr <mask>. It returns 1 if the conversion
1082 * succeeds otherwise zero.
1083 */
1084int cidr2dotted(int cidr, struct in_addr *mask) {
1085
1086 if (cidr < 0 || cidr > 32)
1087 return 0;
1088
1089 mask->s_addr = cidr ? htonl(~0UL << (32 - cidr)) : 0;
1090 return 1;
1091}
1092
Thierry Fournier70473a52016-02-17 17:12:14 +01001093/* Convert mask from bit length form to in_addr form.
1094 * This function never fails.
1095 */
1096void len2mask4(int len, struct in_addr *addr)
1097{
1098 if (len >= 32) {
1099 addr->s_addr = 0xffffffff;
1100 return;
1101 }
1102 if (len <= 0) {
1103 addr->s_addr = 0x00000000;
1104 return;
1105 }
1106 addr->s_addr = 0xffffffff << (32 - len);
1107 addr->s_addr = htonl(addr->s_addr);
1108}
1109
1110/* Convert mask from bit length form to in6_addr form.
1111 * This function never fails.
1112 */
1113void len2mask6(int len, struct in6_addr *addr)
1114{
1115 len2mask4(len, (struct in_addr *)&addr->s6_addr[0]); /* msb */
1116 len -= 32;
1117 len2mask4(len, (struct in_addr *)&addr->s6_addr[4]);
1118 len -= 32;
1119 len2mask4(len, (struct in_addr *)&addr->s6_addr[8]);
1120 len -= 32;
1121 len2mask4(len, (struct in_addr *)&addr->s6_addr[12]); /* lsb */
1122}
1123
Willy Tarreauc6f4ce82009-06-10 11:09:37 +02001124/*
Willy Tarreaud077a8e2007-05-08 18:28:09 +02001125 * converts <str> to two struct in_addr* which must be pre-allocated.
Willy Tarreaubaaee002006-06-26 02:48:02 +02001126 * The format is "addr[/mask]", where "addr" cannot be empty, and mask
1127 * is optionnal and either in the dotted or CIDR notation.
1128 * Note: "addr" can also be a hostname. Returns 1 if OK, 0 if error.
1129 */
Thierry FOURNIERfc7ac7b2014-02-11 15:23:04 +01001130int str2net(const char *str, int resolve, struct in_addr *addr, struct in_addr *mask)
Willy Tarreaubaaee002006-06-26 02:48:02 +02001131{
Willy Tarreau8aeae4a2007-06-17 11:42:08 +02001132 __label__ out_free, out_err;
1133 char *c, *s;
1134 int ret_val;
Willy Tarreaubaaee002006-06-26 02:48:02 +02001135
Willy Tarreau8aeae4a2007-06-17 11:42:08 +02001136 s = strdup(str);
1137 if (!s)
1138 return 0;
1139
Willy Tarreaubaaee002006-06-26 02:48:02 +02001140 memset(mask, 0, sizeof(*mask));
1141 memset(addr, 0, sizeof(*addr));
Willy Tarreaubaaee002006-06-26 02:48:02 +02001142
Willy Tarreau8aeae4a2007-06-17 11:42:08 +02001143 if ((c = strrchr(s, '/')) != NULL) {
Willy Tarreaubaaee002006-06-26 02:48:02 +02001144 *c++ = '\0';
1145 /* c points to the mask */
Willy Tarreau2937c0d2010-01-26 17:36:17 +01001146 if (!str2mask(c, mask))
1147 goto out_err;
Willy Tarreaubaaee002006-06-26 02:48:02 +02001148 }
1149 else {
Willy Tarreauebd61602006-12-30 11:54:15 +01001150 mask->s_addr = ~0U;
Willy Tarreaubaaee002006-06-26 02:48:02 +02001151 }
Willy Tarreau8aeae4a2007-06-17 11:42:08 +02001152 if (!inet_pton(AF_INET, s, addr)) {
Willy Tarreaubaaee002006-06-26 02:48:02 +02001153 struct hostent *he;
1154
Thierry FOURNIERfc7ac7b2014-02-11 15:23:04 +01001155 if (!resolve)
1156 goto out_err;
1157
Willy Tarreau8aeae4a2007-06-17 11:42:08 +02001158 if ((he = gethostbyname(s)) == NULL) {
1159 goto out_err;
Willy Tarreaubaaee002006-06-26 02:48:02 +02001160 }
1161 else
1162 *addr = *(struct in_addr *) *(he->h_addr_list);
1163 }
Willy Tarreau8aeae4a2007-06-17 11:42:08 +02001164
1165 ret_val = 1;
1166 out_free:
1167 free(s);
1168 return ret_val;
1169 out_err:
1170 ret_val = 0;
1171 goto out_free;
Willy Tarreaubaaee002006-06-26 02:48:02 +02001172}
1173
Alexandre Cassen5eb1a902007-11-29 15:43:32 +01001174
1175/*
Willy Tarreau6d20e282012-04-27 22:49:47 +02001176 * converts <str> to two struct in6_addr* which must be pre-allocated.
1177 * The format is "addr[/mask]", where "addr" cannot be empty, and mask
1178 * is an optionnal number of bits (128 being the default).
1179 * Returns 1 if OK, 0 if error.
1180 */
1181int str62net(const char *str, struct in6_addr *addr, unsigned char *mask)
1182{
1183 char *c, *s;
1184 int ret_val = 0;
1185 char *err;
1186 unsigned long len = 128;
1187
1188 s = strdup(str);
1189 if (!s)
1190 return 0;
1191
1192 memset(mask, 0, sizeof(*mask));
1193 memset(addr, 0, sizeof(*addr));
1194
1195 if ((c = strrchr(s, '/')) != NULL) {
1196 *c++ = '\0'; /* c points to the mask */
1197 if (!*c)
1198 goto out_free;
1199
1200 len = strtoul(c, &err, 10);
1201 if ((err && *err) || (unsigned)len > 128)
1202 goto out_free;
1203 }
1204 *mask = len; /* OK we have a valid mask in <len> */
1205
1206 if (!inet_pton(AF_INET6, s, addr))
1207 goto out_free;
1208
1209 ret_val = 1;
1210 out_free:
1211 free(s);
1212 return ret_val;
1213}
1214
1215
1216/*
David du Colombier6f5ccb12011-03-10 22:26:24 +01001217 * Parse IPv4 address found in url.
Alexandre Cassen5eb1a902007-11-29 15:43:32 +01001218 */
David du Colombier6f5ccb12011-03-10 22:26:24 +01001219int url2ipv4(const char *addr, struct in_addr *dst)
Alexandre Cassen5eb1a902007-11-29 15:43:32 +01001220{
1221 int saw_digit, octets, ch;
1222 u_char tmp[4], *tp;
1223 const char *cp = addr;
1224
1225 saw_digit = 0;
1226 octets = 0;
1227 *(tp = tmp) = 0;
1228
1229 while (*addr) {
1230 unsigned char digit = (ch = *addr++) - '0';
1231 if (digit > 9 && ch != '.')
1232 break;
1233 if (digit <= 9) {
1234 u_int new = *tp * 10 + digit;
1235 if (new > 255)
1236 return 0;
1237 *tp = new;
1238 if (!saw_digit) {
1239 if (++octets > 4)
1240 return 0;
1241 saw_digit = 1;
1242 }
1243 } else if (ch == '.' && saw_digit) {
1244 if (octets == 4)
1245 return 0;
1246 *++tp = 0;
1247 saw_digit = 0;
1248 } else
1249 return 0;
1250 }
1251
1252 if (octets < 4)
1253 return 0;
1254
1255 memcpy(&dst->s_addr, tmp, 4);
1256 return addr-cp-1;
1257}
1258
1259/*
Thierry FOURNIER9f95e402014-03-21 14:51:46 +01001260 * Resolve destination server from URL. Convert <str> to a sockaddr_storage.
1261 * <out> contain the code of the dectected scheme, the start and length of
1262 * the hostname. Actually only http and https are supported. <out> can be NULL.
1263 * This function returns the consumed length. It is useful if you parse complete
1264 * url like http://host:port/path, because the consumed length corresponds to
1265 * the first character of the path. If the conversion fails, it returns -1.
1266 *
1267 * This function tries to resolve the DNS name if haproxy is in starting mode.
1268 * So, this function may be used during the configuration parsing.
Alexandre Cassen5eb1a902007-11-29 15:43:32 +01001269 */
Thierry FOURNIER9f95e402014-03-21 14:51:46 +01001270int url2sa(const char *url, int ulen, struct sockaddr_storage *addr, struct split_url *out)
Alexandre Cassen5eb1a902007-11-29 15:43:32 +01001271{
1272 const char *curr = url, *cp = url;
Thierry FOURNIER9f95e402014-03-21 14:51:46 +01001273 const char *end;
Alexandre Cassen5eb1a902007-11-29 15:43:32 +01001274 int ret, url_code = 0;
Thierry FOURNIER9f95e402014-03-21 14:51:46 +01001275 unsigned long long int http_code = 0;
1276 int default_port;
1277 struct hostent *he;
1278 char *p;
Alexandre Cassen5eb1a902007-11-29 15:43:32 +01001279
1280 /* Firstly, try to find :// pattern */
1281 while (curr < url+ulen && url_code != 0x3a2f2f) {
1282 url_code = ((url_code & 0xffff) << 8);
1283 url_code += (unsigned char)*curr++;
1284 }
1285
1286 /* Secondly, if :// pattern is found, verify parsed stuff
1287 * before pattern is matching our http pattern.
1288 * If so parse ip address and port in uri.
1289 *
1290 * WARNING: Current code doesn't support dynamic async dns resolver.
1291 */
Thierry FOURNIER9f95e402014-03-21 14:51:46 +01001292 if (url_code != 0x3a2f2f)
1293 return -1;
1294
1295 /* Copy scheme, and utrn to lower case. */
1296 while (cp < curr - 3)
1297 http_code = (http_code << 8) + *cp++;
1298 http_code |= 0x2020202020202020ULL; /* Turn everything to lower case */
Alexandre Cassen5eb1a902007-11-29 15:43:32 +01001299
Thierry FOURNIER9f95e402014-03-21 14:51:46 +01001300 /* HTTP or HTTPS url matching */
1301 if (http_code == 0x2020202068747470ULL) {
1302 default_port = 80;
1303 if (out)
1304 out->scheme = SCH_HTTP;
1305 }
1306 else if (http_code == 0x2020206874747073ULL) {
1307 default_port = 443;
1308 if (out)
1309 out->scheme = SCH_HTTPS;
1310 }
1311 else
1312 return -1;
1313
1314 /* If the next char is '[', the host address is IPv6. */
1315 if (*curr == '[') {
1316 curr++;
1317
1318 /* Check trash size */
1319 if (trash.size < ulen)
1320 return -1;
1321
1322 /* Look for ']' and copy the address in a trash buffer. */
Willy Tarreau843b7cb2018-07-13 10:54:26 +02001323 p = trash.area;
Thierry FOURNIER9f95e402014-03-21 14:51:46 +01001324 for (end = curr;
1325 end < url + ulen && *end != ']';
1326 end++, p++)
1327 *p = *end;
1328 if (*end != ']')
1329 return -1;
1330 *p = '\0';
1331
1332 /* Update out. */
1333 if (out) {
1334 out->host = curr;
1335 out->host_len = end - curr;
1336 }
1337
1338 /* Try IPv6 decoding. */
Willy Tarreau843b7cb2018-07-13 10:54:26 +02001339 if (!inet_pton(AF_INET6, trash.area, &((struct sockaddr_in6 *)addr)->sin6_addr))
Thierry FOURNIER9f95e402014-03-21 14:51:46 +01001340 return -1;
1341 end++;
1342
1343 /* Decode port. */
1344 if (*end == ':') {
1345 end++;
1346 default_port = read_uint(&end, url + ulen);
1347 }
1348 ((struct sockaddr_in6 *)addr)->sin6_port = htons(default_port);
1349 ((struct sockaddr_in6 *)addr)->sin6_family = AF_INET6;
1350 return end - url;
1351 }
1352 else {
1353 /* We are looking for IP address. If you want to parse and
1354 * resolve hostname found in url, you can use str2sa_range(), but
1355 * be warned this can slow down global daemon performances
1356 * while handling lagging dns responses.
1357 */
1358 ret = url2ipv4(curr, &((struct sockaddr_in *)addr)->sin_addr);
1359 if (ret) {
1360 /* Update out. */
1361 if (out) {
1362 out->host = curr;
1363 out->host_len = ret;
1364 }
1365
1366 curr += ret;
1367
1368 /* Decode port. */
1369 if (*curr == ':') {
1370 curr++;
1371 default_port = read_uint(&curr, url + ulen);
1372 }
1373 ((struct sockaddr_in *)addr)->sin_port = htons(default_port);
1374
1375 /* Set family. */
1376 ((struct sockaddr_in *)addr)->sin_family = AF_INET;
1377 return curr - url;
1378 }
1379 else if (global.mode & MODE_STARTING) {
1380 /* The IPv4 and IPv6 decoding fails, maybe the url contain name. Try to execute
1381 * synchronous DNS request only if HAProxy is in the start state.
Alexandre Cassen5eb1a902007-11-29 15:43:32 +01001382 */
Thierry FOURNIER9f95e402014-03-21 14:51:46 +01001383
1384 /* look for : or / or end */
1385 for (end = curr;
1386 end < url + ulen && *end != '/' && *end != ':';
1387 end++);
Willy Tarreau843b7cb2018-07-13 10:54:26 +02001388 memcpy(trash.area, curr, end - curr);
1389 trash.area[end - curr] = '\0';
Thierry FOURNIER9f95e402014-03-21 14:51:46 +01001390
1391 /* try to resolve an IPv4/IPv6 hostname */
Willy Tarreau843b7cb2018-07-13 10:54:26 +02001392 he = gethostbyname(trash.area);
Thierry FOURNIER9f95e402014-03-21 14:51:46 +01001393 if (!he)
Alexandre Cassen5eb1a902007-11-29 15:43:32 +01001394 return -1;
Thierry FOURNIER9f95e402014-03-21 14:51:46 +01001395
1396 /* Update out. */
1397 if (out) {
1398 out->host = curr;
1399 out->host_len = end - curr;
1400 }
1401
1402 /* Decode port. */
1403 if (*end == ':') {
1404 end++;
1405 default_port = read_uint(&end, url + ulen);
1406 }
1407
1408 /* Copy IP address, set port and family. */
1409 switch (he->h_addrtype) {
1410 case AF_INET:
1411 ((struct sockaddr_in *)addr)->sin_addr = *(struct in_addr *) *(he->h_addr_list);
1412 ((struct sockaddr_in *)addr)->sin_port = htons(default_port);
1413 ((struct sockaddr_in *)addr)->sin_family = AF_INET;
1414 return end - url;
1415
1416 case AF_INET6:
1417 ((struct sockaddr_in6 *)addr)->sin6_addr = *(struct in6_addr *) *(he->h_addr_list);
1418 ((struct sockaddr_in6 *)addr)->sin6_port = htons(default_port);
1419 ((struct sockaddr_in6 *)addr)->sin6_family = AF_INET6;
1420 return end - url;
1421 }
Alexandre Cassen5eb1a902007-11-29 15:43:32 +01001422 }
Alexandre Cassen5eb1a902007-11-29 15:43:32 +01001423 }
Alexandre Cassen5eb1a902007-11-29 15:43:32 +01001424 return -1;
1425}
1426
Willy Tarreau631f01c2011-09-05 00:36:48 +02001427/* Tries to convert a sockaddr_storage address to text form. Upon success, the
1428 * address family is returned so that it's easy for the caller to adapt to the
1429 * output format. Zero is returned if the address family is not supported. -1
1430 * is returned upon error, with errno set. AF_INET, AF_INET6 and AF_UNIX are
1431 * supported.
1432 */
Willy Tarreaud5ec4bf2019-04-25 17:48:16 +02001433int addr_to_str(const struct sockaddr_storage *addr, char *str, int size)
Willy Tarreau631f01c2011-09-05 00:36:48 +02001434{
1435
Willy Tarreaud5ec4bf2019-04-25 17:48:16 +02001436 const void *ptr;
Willy Tarreau631f01c2011-09-05 00:36:48 +02001437
1438 if (size < 5)
1439 return 0;
1440 *str = '\0';
1441
1442 switch (addr->ss_family) {
1443 case AF_INET:
1444 ptr = &((struct sockaddr_in *)addr)->sin_addr;
1445 break;
1446 case AF_INET6:
1447 ptr = &((struct sockaddr_in6 *)addr)->sin6_addr;
1448 break;
1449 case AF_UNIX:
1450 memcpy(str, "unix", 5);
1451 return addr->ss_family;
1452 default:
1453 return 0;
1454 }
1455
1456 if (inet_ntop(addr->ss_family, ptr, str, size))
1457 return addr->ss_family;
1458
1459 /* failed */
1460 return -1;
1461}
1462
Simon Horman75ab8bd2014-06-16 09:39:41 +09001463/* Tries to convert a sockaddr_storage port to text form. Upon success, the
1464 * address family is returned so that it's easy for the caller to adapt to the
1465 * output format. Zero is returned if the address family is not supported. -1
1466 * is returned upon error, with errno set. AF_INET, AF_INET6 and AF_UNIX are
1467 * supported.
1468 */
Willy Tarreaud5ec4bf2019-04-25 17:48:16 +02001469int port_to_str(const struct sockaddr_storage *addr, char *str, int size)
Simon Horman75ab8bd2014-06-16 09:39:41 +09001470{
1471
1472 uint16_t port;
1473
1474
Willy Tarreaud7dad1b2017-01-06 16:46:22 +01001475 if (size < 6)
Simon Horman75ab8bd2014-06-16 09:39:41 +09001476 return 0;
1477 *str = '\0';
1478
1479 switch (addr->ss_family) {
1480 case AF_INET:
1481 port = ((struct sockaddr_in *)addr)->sin_port;
1482 break;
1483 case AF_INET6:
1484 port = ((struct sockaddr_in6 *)addr)->sin6_port;
1485 break;
1486 case AF_UNIX:
1487 memcpy(str, "unix", 5);
1488 return addr->ss_family;
1489 default:
1490 return 0;
1491 }
1492
1493 snprintf(str, size, "%u", ntohs(port));
1494 return addr->ss_family;
1495}
1496
Willy Tarreau16e01562016-08-09 16:46:18 +02001497/* check if the given address is local to the system or not. It will return
1498 * -1 when it's not possible to know, 0 when the address is not local, 1 when
1499 * it is. We don't want to iterate over all interfaces for this (and it is not
1500 * portable). So instead we try to bind in UDP to this address on a free non
1501 * privileged port and to connect to the same address, port 0 (connect doesn't
1502 * care). If it succeeds, we own the address. Note that non-inet addresses are
1503 * considered local since they're most likely AF_UNIX.
1504 */
1505int addr_is_local(const struct netns_entry *ns,
1506 const struct sockaddr_storage *orig)
1507{
1508 struct sockaddr_storage addr;
1509 int result;
1510 int fd;
1511
1512 if (!is_inet_addr(orig))
1513 return 1;
1514
1515 memcpy(&addr, orig, sizeof(addr));
1516 set_host_port(&addr, 0);
1517
1518 fd = my_socketat(ns, addr.ss_family, SOCK_DGRAM, IPPROTO_UDP);
1519 if (fd < 0)
1520 return -1;
1521
1522 result = -1;
1523 if (bind(fd, (struct sockaddr *)&addr, get_addr_len(&addr)) == 0) {
1524 if (connect(fd, (struct sockaddr *)&addr, get_addr_len(&addr)) == -1)
1525 result = 0; // fail, non-local address
1526 else
1527 result = 1; // success, local address
1528 }
1529 else {
1530 if (errno == EADDRNOTAVAIL)
1531 result = 0; // definitely not local :-)
1532 }
1533 close(fd);
1534
1535 return result;
1536}
1537
Willy Tarreaubaaee002006-06-26 02:48:02 +02001538/* will try to encode the string <string> replacing all characters tagged in
1539 * <map> with the hexadecimal representation of their ASCII-code (2 digits)
1540 * prefixed by <escape>, and will store the result between <start> (included)
1541 * and <stop> (excluded), and will always terminate the string with a '\0'
1542 * before <stop>. The position of the '\0' is returned if the conversion
1543 * completes. If bytes are missing between <start> and <stop>, then the
1544 * conversion will be incomplete and truncated. If <stop> <= <start>, the '\0'
1545 * cannot even be stored so we return <start> without writing the 0.
1546 * The input string must also be zero-terminated.
1547 */
1548const char hextab[16] = "0123456789ABCDEF";
1549char *encode_string(char *start, char *stop,
Willy Tarreau1bfd6022019-06-07 11:10:07 +02001550 const char escape, const long *map,
Willy Tarreaubaaee002006-06-26 02:48:02 +02001551 const char *string)
1552{
1553 if (start < stop) {
1554 stop--; /* reserve one byte for the final '\0' */
1555 while (start < stop && *string != '\0') {
Willy Tarreau1bfd6022019-06-07 11:10:07 +02001556 if (!ha_bit_test((unsigned char)(*string), map))
Willy Tarreaubaaee002006-06-26 02:48:02 +02001557 *start++ = *string;
1558 else {
1559 if (start + 3 >= stop)
1560 break;
1561 *start++ = escape;
1562 *start++ = hextab[(*string >> 4) & 15];
1563 *start++ = hextab[*string & 15];
1564 }
1565 string++;
1566 }
1567 *start = '\0';
1568 }
1569 return start;
1570}
1571
Thierry FOURNIERe059ec92014-03-17 12:01:13 +01001572/*
1573 * Same behavior as encode_string() above, except that it encodes chunk
1574 * <chunk> instead of a string.
1575 */
1576char *encode_chunk(char *start, char *stop,
Willy Tarreau1bfd6022019-06-07 11:10:07 +02001577 const char escape, const long *map,
Willy Tarreau83061a82018-07-13 11:56:34 +02001578 const struct buffer *chunk)
Thierry FOURNIERe059ec92014-03-17 12:01:13 +01001579{
Willy Tarreau843b7cb2018-07-13 10:54:26 +02001580 char *str = chunk->area;
1581 char *end = chunk->area + chunk->data;
Thierry FOURNIERe059ec92014-03-17 12:01:13 +01001582
1583 if (start < stop) {
1584 stop--; /* reserve one byte for the final '\0' */
1585 while (start < stop && str < end) {
Willy Tarreau1bfd6022019-06-07 11:10:07 +02001586 if (!ha_bit_test((unsigned char)(*str), map))
Thierry FOURNIERe059ec92014-03-17 12:01:13 +01001587 *start++ = *str;
1588 else {
1589 if (start + 3 >= stop)
1590 break;
1591 *start++ = escape;
1592 *start++ = hextab[(*str >> 4) & 15];
1593 *start++ = hextab[*str & 15];
1594 }
1595 str++;
1596 }
1597 *start = '\0';
1598 }
1599 return start;
1600}
1601
Dragan Dosen0edd1092016-02-12 13:23:02 +01001602/*
1603 * Tries to prefix characters tagged in the <map> with the <escape>
Dragan Dosen1a5d0602016-07-22 16:00:31 +02001604 * character. The input <string> must be zero-terminated. The result will
1605 * be stored between <start> (included) and <stop> (excluded). This
1606 * function will always try to terminate the resulting string with a '\0'
1607 * before <stop>, and will return its position if the conversion
1608 * completes.
1609 */
1610char *escape_string(char *start, char *stop,
Willy Tarreau1bfd6022019-06-07 11:10:07 +02001611 const char escape, const long *map,
Dragan Dosen1a5d0602016-07-22 16:00:31 +02001612 const char *string)
1613{
1614 if (start < stop) {
1615 stop--; /* reserve one byte for the final '\0' */
1616 while (start < stop && *string != '\0') {
Willy Tarreau1bfd6022019-06-07 11:10:07 +02001617 if (!ha_bit_test((unsigned char)(*string), map))
Dragan Dosen1a5d0602016-07-22 16:00:31 +02001618 *start++ = *string;
1619 else {
1620 if (start + 2 >= stop)
1621 break;
1622 *start++ = escape;
1623 *start++ = *string;
1624 }
1625 string++;
1626 }
1627 *start = '\0';
1628 }
1629 return start;
1630}
1631
1632/*
1633 * Tries to prefix characters tagged in the <map> with the <escape>
Dragan Dosen0edd1092016-02-12 13:23:02 +01001634 * character. <chunk> contains the input to be escaped. The result will be
1635 * stored between <start> (included) and <stop> (excluded). The function
1636 * will always try to terminate the resulting string with a '\0' before
1637 * <stop>, and will return its position if the conversion completes.
1638 */
1639char *escape_chunk(char *start, char *stop,
Willy Tarreau1bfd6022019-06-07 11:10:07 +02001640 const char escape, const long *map,
Willy Tarreau83061a82018-07-13 11:56:34 +02001641 const struct buffer *chunk)
Dragan Dosen0edd1092016-02-12 13:23:02 +01001642{
Willy Tarreau843b7cb2018-07-13 10:54:26 +02001643 char *str = chunk->area;
1644 char *end = chunk->area + chunk->data;
Dragan Dosen0edd1092016-02-12 13:23:02 +01001645
1646 if (start < stop) {
1647 stop--; /* reserve one byte for the final '\0' */
1648 while (start < stop && str < end) {
Willy Tarreau1bfd6022019-06-07 11:10:07 +02001649 if (!ha_bit_test((unsigned char)(*str), map))
Dragan Dosen0edd1092016-02-12 13:23:02 +01001650 *start++ = *str;
1651 else {
1652 if (start + 2 >= stop)
1653 break;
1654 *start++ = escape;
1655 *start++ = *str;
1656 }
1657 str++;
1658 }
1659 *start = '\0';
1660 }
1661 return start;
1662}
1663
Thierry FOURNIERddea6262015-05-28 16:00:28 +02001664/* Check a string for using it in a CSV output format. If the string contains
1665 * one of the following four char <">, <,>, CR or LF, the string is
1666 * encapsulated between <"> and the <"> are escaped by a <""> sequence.
1667 * <str> is the input string to be escaped. The function assumes that
1668 * the input string is null-terminated.
1669 *
1670 * If <quote> is 0, the result is returned escaped but without double quote.
Willy Tarreau898529b2016-01-06 18:07:04 +01001671 * It is useful if the escaped string is used between double quotes in the
Thierry FOURNIERddea6262015-05-28 16:00:28 +02001672 * format.
1673 *
Willy Tarreau898529b2016-01-06 18:07:04 +01001674 * printf("..., \"%s\", ...\r\n", csv_enc(str, 0, &trash));
Thierry FOURNIERddea6262015-05-28 16:00:28 +02001675 *
Willy Tarreaub631c292016-01-08 10:04:08 +01001676 * If <quote> is 1, the converter puts the quotes only if any reserved character
1677 * is present. If <quote> is 2, the converter always puts the quotes.
Thierry FOURNIERddea6262015-05-28 16:00:28 +02001678 *
Willy Tarreau83061a82018-07-13 11:56:34 +02001679 * <output> is a struct buffer used for storing the output string.
Thierry FOURNIERddea6262015-05-28 16:00:28 +02001680 *
Willy Tarreau898529b2016-01-06 18:07:04 +01001681 * The function returns the converted string on its output. If an error
1682 * occurs, the function returns an empty string. This type of output is useful
Thierry FOURNIERddea6262015-05-28 16:00:28 +02001683 * for using the function directly as printf() argument.
1684 *
1685 * If the output buffer is too short to contain the input string, the result
1686 * is truncated.
Willy Tarreau898529b2016-01-06 18:07:04 +01001687 *
Willy Tarreaub631c292016-01-08 10:04:08 +01001688 * This function appends the encoding to the existing output chunk, and it
1689 * guarantees that it starts immediately at the first available character of
1690 * the chunk. Please use csv_enc() instead if you want to replace the output
1691 * chunk.
Thierry FOURNIERddea6262015-05-28 16:00:28 +02001692 */
Willy Tarreau83061a82018-07-13 11:56:34 +02001693const char *csv_enc_append(const char *str, int quote, struct buffer *output)
Thierry FOURNIERddea6262015-05-28 16:00:28 +02001694{
Willy Tarreau843b7cb2018-07-13 10:54:26 +02001695 char *end = output->area + output->size;
1696 char *out = output->area + output->data;
Willy Tarreau898529b2016-01-06 18:07:04 +01001697 char *ptr = out;
Thierry FOURNIERddea6262015-05-28 16:00:28 +02001698
Willy Tarreaub631c292016-01-08 10:04:08 +01001699 if (quote == 1) {
1700 /* automatic quoting: first verify if we'll have to quote the string */
1701 if (!strpbrk(str, "\n\r,\""))
1702 quote = 0;
1703 }
1704
1705 if (quote)
1706 *ptr++ = '"';
1707
Willy Tarreau898529b2016-01-06 18:07:04 +01001708 while (*str && ptr < end - 2) { /* -2 for reserving space for <"> and \0. */
1709 *ptr = *str;
Thierry FOURNIERddea6262015-05-28 16:00:28 +02001710 if (*str == '"') {
Willy Tarreau898529b2016-01-06 18:07:04 +01001711 ptr++;
1712 if (ptr >= end - 2) {
1713 ptr--;
Thierry FOURNIERddea6262015-05-28 16:00:28 +02001714 break;
1715 }
Willy Tarreau898529b2016-01-06 18:07:04 +01001716 *ptr = '"';
Thierry FOURNIERddea6262015-05-28 16:00:28 +02001717 }
Willy Tarreau898529b2016-01-06 18:07:04 +01001718 ptr++;
Thierry FOURNIERddea6262015-05-28 16:00:28 +02001719 str++;
1720 }
1721
Willy Tarreaub631c292016-01-08 10:04:08 +01001722 if (quote)
1723 *ptr++ = '"';
Thierry FOURNIERddea6262015-05-28 16:00:28 +02001724
Willy Tarreau898529b2016-01-06 18:07:04 +01001725 *ptr = '\0';
Willy Tarreau843b7cb2018-07-13 10:54:26 +02001726 output->data = ptr - output->area;
Willy Tarreau898529b2016-01-06 18:07:04 +01001727 return out;
Thierry FOURNIERddea6262015-05-28 16:00:28 +02001728}
1729
Willy Tarreaubf9c2fc2011-05-31 18:06:18 +02001730/* Decode an URL-encoded string in-place. The resulting string might
1731 * be shorter. If some forbidden characters are found, the conversion is
Thierry FOURNIER5068d962013-10-04 16:27:27 +02001732 * aborted, the string is truncated before the issue and a negative value is
1733 * returned, otherwise the operation returns the length of the decoded string.
Willy Tarreaubf9c2fc2011-05-31 18:06:18 +02001734 */
1735int url_decode(char *string)
1736{
1737 char *in, *out;
Thierry FOURNIER5068d962013-10-04 16:27:27 +02001738 int ret = -1;
Willy Tarreaubf9c2fc2011-05-31 18:06:18 +02001739
1740 in = string;
1741 out = string;
1742 while (*in) {
1743 switch (*in) {
1744 case '+' :
1745 *out++ = ' ';
1746 break;
1747 case '%' :
1748 if (!ishex(in[1]) || !ishex(in[2]))
1749 goto end;
1750 *out++ = (hex2i(in[1]) << 4) + hex2i(in[2]);
1751 in += 2;
1752 break;
1753 default:
1754 *out++ = *in;
1755 break;
1756 }
1757 in++;
1758 }
Thierry FOURNIER5068d962013-10-04 16:27:27 +02001759 ret = out - string; /* success */
Willy Tarreaubf9c2fc2011-05-31 18:06:18 +02001760 end:
1761 *out = 0;
1762 return ret;
1763}
Willy Tarreaubaaee002006-06-26 02:48:02 +02001764
Willy Tarreau6911fa42007-03-04 18:06:08 +01001765unsigned int str2ui(const char *s)
1766{
1767 return __str2ui(s);
1768}
1769
1770unsigned int str2uic(const char *s)
1771{
1772 return __str2uic(s);
1773}
1774
1775unsigned int strl2ui(const char *s, int len)
1776{
1777 return __strl2ui(s, len);
1778}
1779
1780unsigned int strl2uic(const char *s, int len)
1781{
1782 return __strl2uic(s, len);
1783}
1784
Willy Tarreau4ec83cd2010-10-15 23:19:55 +02001785unsigned int read_uint(const char **s, const char *end)
1786{
1787 return __read_uint(s, end);
1788}
1789
Thierry FOURNIER763a5d82015-07-06 23:09:52 +02001790/* This function reads an unsigned integer from the string pointed to by <s> and
1791 * returns it. The <s> pointer is adjusted to point to the first unread char. The
1792 * function automatically stops at <end>. If the number overflows, the 2^64-1
1793 * value is returned.
1794 */
1795unsigned long long int read_uint64(const char **s, const char *end)
1796{
1797 const char *ptr = *s;
1798 unsigned long long int i = 0, tmp;
1799 unsigned int j;
1800
1801 while (ptr < end) {
1802
1803 /* read next char */
1804 j = *ptr - '0';
1805 if (j > 9)
1806 goto read_uint64_end;
1807
1808 /* add char to the number and check overflow. */
1809 tmp = i * 10;
1810 if (tmp / 10 != i) {
1811 i = ULLONG_MAX;
1812 goto read_uint64_eat;
1813 }
1814 if (ULLONG_MAX - tmp < j) {
1815 i = ULLONG_MAX;
1816 goto read_uint64_eat;
1817 }
1818 i = tmp + j;
1819 ptr++;
1820 }
1821read_uint64_eat:
1822 /* eat each numeric char */
1823 while (ptr < end) {
1824 if ((unsigned int)(*ptr - '0') > 9)
1825 break;
1826 ptr++;
1827 }
1828read_uint64_end:
1829 *s = ptr;
1830 return i;
1831}
1832
1833/* This function reads an integer from the string pointed to by <s> and returns
1834 * it. The <s> pointer is adjusted to point to the first unread char. The function
1835 * automatically stops at <end>. Il the number is bigger than 2^63-2, the 2^63-1
1836 * value is returned. If the number is lowest than -2^63-1, the -2^63 value is
1837 * returned.
1838 */
1839long long int read_int64(const char **s, const char *end)
1840{
1841 unsigned long long int i = 0;
1842 int neg = 0;
1843
1844 /* Look for minus char. */
1845 if (**s == '-') {
1846 neg = 1;
1847 (*s)++;
1848 }
1849 else if (**s == '+')
1850 (*s)++;
1851
1852 /* convert as positive number. */
1853 i = read_uint64(s, end);
1854
1855 if (neg) {
1856 if (i > 0x8000000000000000ULL)
1857 return LLONG_MIN;
1858 return -i;
1859 }
1860 if (i > 0x7fffffffffffffffULL)
1861 return LLONG_MAX;
1862 return i;
1863}
1864
Willy Tarreau6911fa42007-03-04 18:06:08 +01001865/* This one is 7 times faster than strtol() on athlon with checks.
1866 * It returns the value of the number composed of all valid digits read,
1867 * and can process negative numbers too.
1868 */
1869int strl2ic(const char *s, int len)
1870{
1871 int i = 0;
Willy Tarreau3f0c9762007-10-25 09:42:24 +02001872 int j, k;
Willy Tarreau6911fa42007-03-04 18:06:08 +01001873
1874 if (len > 0) {
1875 if (*s != '-') {
1876 /* positive number */
1877 while (len-- > 0) {
1878 j = (*s++) - '0';
Willy Tarreau3f0c9762007-10-25 09:42:24 +02001879 k = i * 10;
Willy Tarreau6911fa42007-03-04 18:06:08 +01001880 if (j > 9)
1881 break;
Willy Tarreau3f0c9762007-10-25 09:42:24 +02001882 i = k + j;
Willy Tarreau6911fa42007-03-04 18:06:08 +01001883 }
1884 } else {
1885 /* negative number */
1886 s++;
1887 while (--len > 0) {
1888 j = (*s++) - '0';
Willy Tarreau3f0c9762007-10-25 09:42:24 +02001889 k = i * 10;
Willy Tarreau6911fa42007-03-04 18:06:08 +01001890 if (j > 9)
1891 break;
Willy Tarreau3f0c9762007-10-25 09:42:24 +02001892 i = k - j;
Willy Tarreau6911fa42007-03-04 18:06:08 +01001893 }
1894 }
1895 }
1896 return i;
1897}
1898
1899
1900/* This function reads exactly <len> chars from <s> and converts them to a
1901 * signed integer which it stores into <ret>. It accurately detects any error
1902 * (truncated string, invalid chars, overflows). It is meant to be used in
1903 * applications designed for hostile environments. It returns zero when the
1904 * number has successfully been converted, non-zero otherwise. When an error
1905 * is returned, the <ret> value is left untouched. It is yet 5 to 40 times
1906 * faster than strtol().
1907 */
1908int strl2irc(const char *s, int len, int *ret)
1909{
1910 int i = 0;
1911 int j;
1912
1913 if (!len)
1914 return 1;
1915
1916 if (*s != '-') {
1917 /* positive number */
1918 while (len-- > 0) {
1919 j = (*s++) - '0';
1920 if (j > 9) return 1; /* invalid char */
1921 if (i > INT_MAX / 10) return 1; /* check for multiply overflow */
1922 i = i * 10;
1923 if (i + j < i) return 1; /* check for addition overflow */
1924 i = i + j;
1925 }
1926 } else {
1927 /* negative number */
1928 s++;
1929 while (--len > 0) {
1930 j = (*s++) - '0';
1931 if (j > 9) return 1; /* invalid char */
1932 if (i < INT_MIN / 10) return 1; /* check for multiply overflow */
1933 i = i * 10;
1934 if (i - j > i) return 1; /* check for subtract overflow */
1935 i = i - j;
1936 }
1937 }
1938 *ret = i;
1939 return 0;
1940}
1941
1942
1943/* This function reads exactly <len> chars from <s> and converts them to a
1944 * signed integer which it stores into <ret>. It accurately detects any error
1945 * (truncated string, invalid chars, overflows). It is meant to be used in
1946 * applications designed for hostile environments. It returns zero when the
1947 * number has successfully been converted, non-zero otherwise. When an error
1948 * is returned, the <ret> value is left untouched. It is about 3 times slower
1949 * than str2irc().
1950 */
Willy Tarreau6911fa42007-03-04 18:06:08 +01001951
1952int strl2llrc(const char *s, int len, long long *ret)
1953{
1954 long long i = 0;
1955 int j;
1956
1957 if (!len)
1958 return 1;
1959
1960 if (*s != '-') {
1961 /* positive number */
1962 while (len-- > 0) {
1963 j = (*s++) - '0';
1964 if (j > 9) return 1; /* invalid char */
1965 if (i > LLONG_MAX / 10LL) return 1; /* check for multiply overflow */
1966 i = i * 10LL;
1967 if (i + j < i) return 1; /* check for addition overflow */
1968 i = i + j;
1969 }
1970 } else {
1971 /* negative number */
1972 s++;
1973 while (--len > 0) {
1974 j = (*s++) - '0';
1975 if (j > 9) return 1; /* invalid char */
1976 if (i < LLONG_MIN / 10LL) return 1; /* check for multiply overflow */
1977 i = i * 10LL;
1978 if (i - j > i) return 1; /* check for subtract overflow */
1979 i = i - j;
1980 }
1981 }
1982 *ret = i;
1983 return 0;
1984}
1985
Thierry FOURNIER511e9472014-01-23 17:40:34 +01001986/* This function is used with pat_parse_dotted_ver(). It converts a string
1987 * composed by two number separated by a dot. Each part must contain in 16 bits
1988 * because internally they will be represented as a 32-bit quantity stored in
1989 * a 64-bit integer. It returns zero when the number has successfully been
1990 * converted, non-zero otherwise. When an error is returned, the <ret> value
1991 * is left untouched.
1992 *
1993 * "1.3" -> 0x0000000000010003
1994 * "65535.65535" -> 0x00000000ffffffff
1995 */
1996int strl2llrc_dotted(const char *text, int len, long long *ret)
1997{
1998 const char *end = &text[len];
1999 const char *p;
2000 long long major, minor;
2001
2002 /* Look for dot. */
2003 for (p = text; p < end; p++)
2004 if (*p == '.')
2005 break;
2006
2007 /* Convert major. */
2008 if (strl2llrc(text, p - text, &major) != 0)
2009 return 1;
2010
2011 /* Check major. */
2012 if (major >= 65536)
2013 return 1;
2014
2015 /* Convert minor. */
2016 minor = 0;
2017 if (p < end)
2018 if (strl2llrc(p + 1, end - (p + 1), &minor) != 0)
2019 return 1;
2020
2021 /* Check minor. */
2022 if (minor >= 65536)
2023 return 1;
2024
2025 /* Compose value. */
2026 *ret = (major << 16) | (minor & 0xffff);
2027 return 0;
2028}
2029
Willy Tarreaua0d37b62007-12-02 22:00:35 +01002030/* This function parses a time value optionally followed by a unit suffix among
2031 * "d", "h", "m", "s", "ms" or "us". It converts the value into the unit
2032 * expected by the caller. The computation does its best to avoid overflows.
2033 * The value is returned in <ret> if everything is fine, and a NULL is returned
2034 * by the function. In case of error, a pointer to the error is returned and
2035 * <ret> is left untouched. Values are automatically rounded up when needed.
Willy Tarreau9faebe32019-06-07 19:00:37 +02002036 * Values resulting in values larger than or equal to 2^31 after conversion are
2037 * reported as an overflow as value PARSE_TIME_OVER. Non-null values resulting
2038 * in an underflow are reported as an underflow as value PARSE_TIME_UNDER.
Willy Tarreaua0d37b62007-12-02 22:00:35 +01002039 */
2040const char *parse_time_err(const char *text, unsigned *ret, unsigned unit_flags)
2041{
Willy Tarreau9faebe32019-06-07 19:00:37 +02002042 unsigned long long imult, idiv;
2043 unsigned long long omult, odiv;
2044 unsigned long long value, result;
Willy Tarreaua0d37b62007-12-02 22:00:35 +01002045
2046 omult = odiv = 1;
2047
2048 switch (unit_flags & TIME_UNIT_MASK) {
2049 case TIME_UNIT_US: omult = 1000000; break;
2050 case TIME_UNIT_MS: omult = 1000; break;
2051 case TIME_UNIT_S: break;
2052 case TIME_UNIT_MIN: odiv = 60; break;
2053 case TIME_UNIT_HOUR: odiv = 3600; break;
2054 case TIME_UNIT_DAY: odiv = 86400; break;
2055 default: break;
2056 }
2057
2058 value = 0;
2059
2060 while (1) {
2061 unsigned int j;
2062
2063 j = *text - '0';
2064 if (j > 9)
2065 break;
2066 text++;
2067 value *= 10;
2068 value += j;
2069 }
2070
2071 imult = idiv = 1;
2072 switch (*text) {
2073 case '\0': /* no unit = default unit */
2074 imult = omult = idiv = odiv = 1;
2075 break;
2076 case 's': /* second = unscaled unit */
2077 break;
2078 case 'u': /* microsecond : "us" */
2079 if (text[1] == 's') {
2080 idiv = 1000000;
2081 text++;
2082 }
2083 break;
2084 case 'm': /* millisecond : "ms" or minute: "m" */
2085 if (text[1] == 's') {
2086 idiv = 1000;
2087 text++;
2088 } else
2089 imult = 60;
2090 break;
2091 case 'h': /* hour : "h" */
2092 imult = 3600;
2093 break;
2094 case 'd': /* day : "d" */
2095 imult = 86400;
2096 break;
2097 default:
2098 return text;
2099 break;
2100 }
2101
2102 if (omult % idiv == 0) { omult /= idiv; idiv = 1; }
2103 if (idiv % omult == 0) { idiv /= omult; omult = 1; }
2104 if (imult % odiv == 0) { imult /= odiv; odiv = 1; }
2105 if (odiv % imult == 0) { odiv /= imult; imult = 1; }
2106
Willy Tarreau9faebe32019-06-07 19:00:37 +02002107 result = (value * (imult * omult) + (idiv * odiv - 1)) / (idiv * odiv);
2108 if (result >= 0x80000000)
2109 return PARSE_TIME_OVER;
2110 if (!result && value)
2111 return PARSE_TIME_UNDER;
2112 *ret = result;
Willy Tarreaua0d37b62007-12-02 22:00:35 +01002113 return NULL;
2114}
Willy Tarreau6911fa42007-03-04 18:06:08 +01002115
Emeric Brun39132b22010-01-04 14:57:24 +01002116/* this function converts the string starting at <text> to an unsigned int
2117 * stored in <ret>. If an error is detected, the pointer to the unexpected
Joseph Herlant32b83272018-11-15 11:58:28 -08002118 * character is returned. If the conversion is successful, NULL is returned.
Emeric Brun39132b22010-01-04 14:57:24 +01002119 */
2120const char *parse_size_err(const char *text, unsigned *ret) {
2121 unsigned value = 0;
2122
2123 while (1) {
2124 unsigned int j;
2125
2126 j = *text - '0';
2127 if (j > 9)
2128 break;
2129 if (value > ~0U / 10)
2130 return text;
2131 value *= 10;
2132 if (value > (value + j))
2133 return text;
2134 value += j;
2135 text++;
2136 }
2137
2138 switch (*text) {
2139 case '\0':
2140 break;
2141 case 'K':
2142 case 'k':
2143 if (value > ~0U >> 10)
2144 return text;
2145 value = value << 10;
2146 break;
2147 case 'M':
2148 case 'm':
2149 if (value > ~0U >> 20)
2150 return text;
2151 value = value << 20;
2152 break;
2153 case 'G':
2154 case 'g':
2155 if (value > ~0U >> 30)
2156 return text;
2157 value = value << 30;
2158 break;
2159 default:
2160 return text;
2161 }
2162
Godbach58048a22015-01-28 17:36:16 +08002163 if (*text != '\0' && *++text != '\0')
2164 return text;
2165
Emeric Brun39132b22010-01-04 14:57:24 +01002166 *ret = value;
2167 return NULL;
2168}
2169
Willy Tarreau126d4062013-12-03 17:50:47 +01002170/*
2171 * Parse binary string written in hexadecimal (source) and store the decoded
2172 * result into binstr and set binstrlen to the lengh of binstr. Memory for
2173 * binstr is allocated by the function. In case of error, returns 0 with an
Thierry FOURNIERee330af2014-01-21 11:36:14 +01002174 * error message in err. In succes case, it returns the consumed length.
Willy Tarreau126d4062013-12-03 17:50:47 +01002175 */
2176int parse_binary(const char *source, char **binstr, int *binstrlen, char **err)
2177{
2178 int len;
2179 const char *p = source;
2180 int i,j;
Thierry FOURNIER9645d422013-12-06 19:59:28 +01002181 int alloc;
Willy Tarreau126d4062013-12-03 17:50:47 +01002182
2183 len = strlen(source);
2184 if (len % 2) {
2185 memprintf(err, "an even number of hex digit is expected");
2186 return 0;
2187 }
2188
2189 len = len >> 1;
Thierry FOURNIER9645d422013-12-06 19:59:28 +01002190
Willy Tarreau126d4062013-12-03 17:50:47 +01002191 if (!*binstr) {
Thierry FOURNIER9645d422013-12-06 19:59:28 +01002192 *binstr = calloc(len, sizeof(char));
2193 if (!*binstr) {
2194 memprintf(err, "out of memory while loading string pattern");
2195 return 0;
2196 }
2197 alloc = 1;
Willy Tarreau126d4062013-12-03 17:50:47 +01002198 }
Thierry FOURNIER9645d422013-12-06 19:59:28 +01002199 else {
2200 if (*binstrlen < len) {
Joseph Herlant76dbe782018-11-15 12:01:22 -08002201 memprintf(err, "no space available in the buffer. expect %d, provides %d",
Thierry FOURNIER9645d422013-12-06 19:59:28 +01002202 len, *binstrlen);
2203 return 0;
2204 }
2205 alloc = 0;
2206 }
2207 *binstrlen = len;
Willy Tarreau126d4062013-12-03 17:50:47 +01002208
2209 i = j = 0;
2210 while (j < len) {
2211 if (!ishex(p[i++]))
2212 goto bad_input;
2213 if (!ishex(p[i++]))
2214 goto bad_input;
2215 (*binstr)[j++] = (hex2i(p[i-2]) << 4) + hex2i(p[i-1]);
2216 }
Thierry FOURNIERee330af2014-01-21 11:36:14 +01002217 return len << 1;
Willy Tarreau126d4062013-12-03 17:50:47 +01002218
2219bad_input:
2220 memprintf(err, "an hex digit is expected (found '%c')", p[i-1]);
Andreas Seltenreich93f91c32016-03-03 20:40:37 +01002221 if (alloc) {
2222 free(*binstr);
2223 *binstr = NULL;
2224 }
Willy Tarreau126d4062013-12-03 17:50:47 +01002225 return 0;
2226}
2227
Willy Tarreau946ba592009-05-10 15:41:18 +02002228/* copies at most <n> characters from <src> and always terminates with '\0' */
2229char *my_strndup(const char *src, int n)
2230{
2231 int len = 0;
2232 char *ret;
2233
2234 while (len < n && src[len])
2235 len++;
2236
Vincent Bernat3c2f2f22016-04-03 13:48:42 +02002237 ret = malloc(len + 1);
Willy Tarreau946ba592009-05-10 15:41:18 +02002238 if (!ret)
2239 return ret;
2240 memcpy(ret, src, len);
2241 ret[len] = '\0';
2242 return ret;
2243}
2244
Baptiste Assmannbb77c8e2013-10-06 23:24:13 +02002245/*
2246 * search needle in haystack
2247 * returns the pointer if found, returns NULL otherwise
2248 */
2249const void *my_memmem(const void *haystack, size_t haystacklen, const void *needle, size_t needlelen)
2250{
2251 const void *c = NULL;
2252 unsigned char f;
2253
2254 if ((haystack == NULL) || (needle == NULL) || (haystacklen < needlelen))
2255 return NULL;
2256
2257 f = *(char *)needle;
2258 c = haystack;
2259 while ((c = memchr(c, f, haystacklen - (c - haystack))) != NULL) {
2260 if ((haystacklen - (c - haystack)) < needlelen)
2261 return NULL;
2262
2263 if (memcmp(c, needle, needlelen) == 0)
2264 return c;
2265 ++c;
2266 }
2267 return NULL;
2268}
2269
Willy Tarreau482b00d2009-10-04 22:48:42 +02002270/* This function returns the first unused key greater than or equal to <key> in
2271 * ID tree <root>. Zero is returned if no place is found.
2272 */
2273unsigned int get_next_id(struct eb_root *root, unsigned int key)
2274{
2275 struct eb32_node *used;
2276
2277 do {
2278 used = eb32_lookup_ge(root, key);
2279 if (!used || used->key > key)
2280 return key; /* key is available */
2281 key++;
2282 } while (key);
2283 return key;
2284}
2285
Willy Tarreau9c1e15d2017-11-15 18:51:29 +01002286/* dump the full tree to <file> in DOT format for debugging purposes. Will
2287 * optionally highlight node <subj> if found, depending on operation <op> :
2288 * 0 : nothing
2289 * >0 : insertion, node/leaf are surrounded in red
2290 * <0 : removal, node/leaf are dashed with no background
2291 * Will optionally add "desc" as a label on the graph if set and non-null.
2292 */
2293void eb32sc_to_file(FILE *file, struct eb_root *root, const struct eb32sc_node *subj, int op, const char *desc)
Willy Tarreaued3cda02017-11-15 15:04:05 +01002294{
2295 struct eb32sc_node *node;
2296 unsigned long scope = -1;
2297
Willy Tarreau9c1e15d2017-11-15 18:51:29 +01002298 fprintf(file, "digraph ebtree {\n");
2299
2300 if (desc && *desc) {
2301 fprintf(file,
2302 " fontname=\"fixed\";\n"
2303 " fontsize=8;\n"
2304 " label=\"%s\";\n", desc);
2305 }
2306
Willy Tarreaued3cda02017-11-15 15:04:05 +01002307 fprintf(file,
Willy Tarreau6c7f4de2017-11-15 17:49:54 +01002308 " node [fontname=\"fixed\" fontsize=8 shape=\"box\" style=\"filled\" color=\"black\" fillcolor=\"white\"];\n"
2309 " edge [fontname=\"fixed\" fontsize=8 style=\"solid\" color=\"magenta\" dir=\"forward\"];\n"
Willy Tarreaued3cda02017-11-15 15:04:05 +01002310 " \"%lx_n\" [label=\"root\\n%lx\"]\n", (long)eb_root_to_node(root), (long)root
2311 );
2312
Willy Tarreau6c7f4de2017-11-15 17:49:54 +01002313 fprintf(file, " \"%lx_n\" -> \"%lx_%c\" [taillabel=\"L\"];\n",
Willy Tarreaued3cda02017-11-15 15:04:05 +01002314 (long)eb_root_to_node(root),
2315 (long)eb_root_to_node(eb_clrtag(root->b[0])),
Willy Tarreaued3cda02017-11-15 15:04:05 +01002316 eb_gettag(root->b[0]) == EB_LEAF ? 'l' : 'n');
2317
2318 node = eb32sc_first(root, scope);
2319 while (node) {
2320 if (node->node.node_p) {
2321 /* node part is used */
Willy Tarreau9c1e15d2017-11-15 18:51:29 +01002322 fprintf(file, " \"%lx_n\" [label=\"%lx\\nkey=%u\\nscope=%lx\\nbit=%d\" fillcolor=\"lightskyblue1\" %s];\n",
2323 (long)node, (long)node, node->key, node->node_s, node->node.bit,
2324 (node == subj) ? (op < 0 ? "color=\"red\" style=\"dashed\"" : op > 0 ? "color=\"red\"" : "") : "");
Willy Tarreaued3cda02017-11-15 15:04:05 +01002325
Willy Tarreau6c7f4de2017-11-15 17:49:54 +01002326 fprintf(file, " \"%lx_n\" -> \"%lx_n\" [taillabel=\"%c\"];\n",
Willy Tarreaued3cda02017-11-15 15:04:05 +01002327 (long)node,
2328 (long)eb_root_to_node(eb_clrtag(node->node.node_p)),
Willy Tarreau6c7f4de2017-11-15 17:49:54 +01002329 eb_gettag(node->node.node_p) ? 'R' : 'L');
Willy Tarreaued3cda02017-11-15 15:04:05 +01002330
Willy Tarreau6c7f4de2017-11-15 17:49:54 +01002331 fprintf(file, " \"%lx_n\" -> \"%lx_%c\" [taillabel=\"L\"];\n",
Willy Tarreaued3cda02017-11-15 15:04:05 +01002332 (long)node,
2333 (long)eb_root_to_node(eb_clrtag(node->node.branches.b[0])),
Willy Tarreaued3cda02017-11-15 15:04:05 +01002334 eb_gettag(node->node.branches.b[0]) == EB_LEAF ? 'l' : 'n');
2335
Willy Tarreau6c7f4de2017-11-15 17:49:54 +01002336 fprintf(file, " \"%lx_n\" -> \"%lx_%c\" [taillabel=\"R\"];\n",
Willy Tarreaued3cda02017-11-15 15:04:05 +01002337 (long)node,
2338 (long)eb_root_to_node(eb_clrtag(node->node.branches.b[1])),
Willy Tarreaued3cda02017-11-15 15:04:05 +01002339 eb_gettag(node->node.branches.b[1]) == EB_LEAF ? 'l' : 'n');
2340 }
2341
Willy Tarreau9c1e15d2017-11-15 18:51:29 +01002342 fprintf(file, " \"%lx_l\" [label=\"%lx\\nkey=%u\\nscope=%lx\\npfx=%u\" fillcolor=\"yellow\" %s];\n",
2343 (long)node, (long)node, node->key, node->leaf_s, node->node.pfx,
2344 (node == subj) ? (op < 0 ? "color=\"red\" style=\"dashed\"" : op > 0 ? "color=\"red\"" : "") : "");
Willy Tarreaued3cda02017-11-15 15:04:05 +01002345
Willy Tarreau6c7f4de2017-11-15 17:49:54 +01002346 fprintf(file, " \"%lx_l\" -> \"%lx_n\" [taillabel=\"%c\"];\n",
Willy Tarreaued3cda02017-11-15 15:04:05 +01002347 (long)node,
2348 (long)eb_root_to_node(eb_clrtag(node->node.leaf_p)),
Willy Tarreau6c7f4de2017-11-15 17:49:54 +01002349 eb_gettag(node->node.leaf_p) ? 'R' : 'L');
Willy Tarreaued3cda02017-11-15 15:04:05 +01002350 node = eb32sc_next(node, scope);
2351 }
2352 fprintf(file, "}\n");
2353}
2354
Willy Tarreau348238b2010-01-18 15:05:57 +01002355/* This function compares a sample word possibly followed by blanks to another
2356 * clean word. The compare is case-insensitive. 1 is returned if both are equal,
2357 * otherwise zero. This intends to be used when checking HTTP headers for some
2358 * values. Note that it validates a word followed only by blanks but does not
2359 * validate a word followed by blanks then other chars.
2360 */
2361int word_match(const char *sample, int slen, const char *word, int wlen)
2362{
2363 if (slen < wlen)
2364 return 0;
2365
2366 while (wlen) {
2367 char c = *sample ^ *word;
2368 if (c && c != ('A' ^ 'a'))
2369 return 0;
2370 sample++;
2371 word++;
2372 slen--;
2373 wlen--;
2374 }
2375
2376 while (slen) {
2377 if (*sample != ' ' && *sample != '\t')
2378 return 0;
2379 sample++;
2380 slen--;
2381 }
2382 return 1;
2383}
Willy Tarreau482b00d2009-10-04 22:48:42 +02002384
Willy Tarreaud54bbdc2009-09-07 11:00:31 +02002385/* Converts any text-formatted IPv4 address to a host-order IPv4 address. It
2386 * is particularly fast because it avoids expensive operations such as
2387 * multiplies, which are optimized away at the end. It requires a properly
2388 * formated address though (3 points).
2389 */
2390unsigned int inetaddr_host(const char *text)
2391{
2392 const unsigned int ascii_zero = ('0' << 24) | ('0' << 16) | ('0' << 8) | '0';
2393 register unsigned int dig100, dig10, dig1;
2394 int s;
2395 const char *p, *d;
2396
2397 dig1 = dig10 = dig100 = ascii_zero;
2398 s = 24;
2399
2400 p = text;
2401 while (1) {
2402 if (((unsigned)(*p - '0')) <= 9) {
2403 p++;
2404 continue;
2405 }
2406
2407 /* here, we have a complete byte between <text> and <p> (exclusive) */
2408 if (p == text)
2409 goto end;
2410
2411 d = p - 1;
2412 dig1 |= (unsigned int)(*d << s);
2413 if (d == text)
2414 goto end;
2415
2416 d--;
2417 dig10 |= (unsigned int)(*d << s);
2418 if (d == text)
2419 goto end;
2420
2421 d--;
2422 dig100 |= (unsigned int)(*d << s);
2423 end:
2424 if (!s || *p != '.')
2425 break;
2426
2427 s -= 8;
2428 text = ++p;
2429 }
2430
2431 dig100 -= ascii_zero;
2432 dig10 -= ascii_zero;
2433 dig1 -= ascii_zero;
2434 return ((dig100 * 10) + dig10) * 10 + dig1;
2435}
2436
2437/*
2438 * Idem except the first unparsed character has to be passed in <stop>.
2439 */
2440unsigned int inetaddr_host_lim(const char *text, const char *stop)
2441{
2442 const unsigned int ascii_zero = ('0' << 24) | ('0' << 16) | ('0' << 8) | '0';
2443 register unsigned int dig100, dig10, dig1;
2444 int s;
2445 const char *p, *d;
2446
2447 dig1 = dig10 = dig100 = ascii_zero;
2448 s = 24;
2449
2450 p = text;
2451 while (1) {
2452 if (((unsigned)(*p - '0')) <= 9 && p < stop) {
2453 p++;
2454 continue;
2455 }
2456
2457 /* here, we have a complete byte between <text> and <p> (exclusive) */
2458 if (p == text)
2459 goto end;
2460
2461 d = p - 1;
2462 dig1 |= (unsigned int)(*d << s);
2463 if (d == text)
2464 goto end;
2465
2466 d--;
2467 dig10 |= (unsigned int)(*d << s);
2468 if (d == text)
2469 goto end;
2470
2471 d--;
2472 dig100 |= (unsigned int)(*d << s);
2473 end:
2474 if (!s || p == stop || *p != '.')
2475 break;
2476
2477 s -= 8;
2478 text = ++p;
2479 }
2480
2481 dig100 -= ascii_zero;
2482 dig10 -= ascii_zero;
2483 dig1 -= ascii_zero;
2484 return ((dig100 * 10) + dig10) * 10 + dig1;
2485}
2486
2487/*
2488 * Idem except the pointer to first unparsed byte is returned into <ret> which
2489 * must not be NULL.
2490 */
Willy Tarreau74172752010-10-15 23:21:42 +02002491unsigned int inetaddr_host_lim_ret(char *text, char *stop, char **ret)
Willy Tarreaud54bbdc2009-09-07 11:00:31 +02002492{
2493 const unsigned int ascii_zero = ('0' << 24) | ('0' << 16) | ('0' << 8) | '0';
2494 register unsigned int dig100, dig10, dig1;
2495 int s;
Willy Tarreau74172752010-10-15 23:21:42 +02002496 char *p, *d;
Willy Tarreaud54bbdc2009-09-07 11:00:31 +02002497
2498 dig1 = dig10 = dig100 = ascii_zero;
2499 s = 24;
2500
2501 p = text;
2502 while (1) {
2503 if (((unsigned)(*p - '0')) <= 9 && p < stop) {
2504 p++;
2505 continue;
2506 }
2507
2508 /* here, we have a complete byte between <text> and <p> (exclusive) */
2509 if (p == text)
2510 goto end;
2511
2512 d = p - 1;
2513 dig1 |= (unsigned int)(*d << s);
2514 if (d == text)
2515 goto end;
2516
2517 d--;
2518 dig10 |= (unsigned int)(*d << s);
2519 if (d == text)
2520 goto end;
2521
2522 d--;
2523 dig100 |= (unsigned int)(*d << s);
2524 end:
2525 if (!s || p == stop || *p != '.')
2526 break;
2527
2528 s -= 8;
2529 text = ++p;
2530 }
2531
2532 *ret = p;
2533 dig100 -= ascii_zero;
2534 dig10 -= ascii_zero;
2535 dig1 -= ascii_zero;
2536 return ((dig100 * 10) + dig10) * 10 + dig1;
2537}
2538
Willy Tarreauf0b38bf2010-06-06 13:22:23 +02002539/* Convert a fixed-length string to an IP address. Returns 0 in case of error,
2540 * or the number of chars read in case of success. Maybe this could be replaced
2541 * by one of the functions above. Also, apparently this function does not support
2542 * hosts above 255 and requires exactly 4 octets.
Willy Tarreau075415a2013-12-12 11:29:39 +01002543 * The destination is only modified on success.
Willy Tarreauf0b38bf2010-06-06 13:22:23 +02002544 */
2545int buf2ip(const char *buf, size_t len, struct in_addr *dst)
2546{
2547 const char *addr;
2548 int saw_digit, octets, ch;
2549 u_char tmp[4], *tp;
2550 const char *cp = buf;
2551
2552 saw_digit = 0;
2553 octets = 0;
2554 *(tp = tmp) = 0;
2555
2556 for (addr = buf; addr - buf < len; addr++) {
2557 unsigned char digit = (ch = *addr) - '0';
2558
2559 if (digit > 9 && ch != '.')
2560 break;
2561
2562 if (digit <= 9) {
2563 u_int new = *tp * 10 + digit;
2564
2565 if (new > 255)
2566 return 0;
2567
2568 *tp = new;
2569
2570 if (!saw_digit) {
2571 if (++octets > 4)
2572 return 0;
2573 saw_digit = 1;
2574 }
2575 } else if (ch == '.' && saw_digit) {
2576 if (octets == 4)
2577 return 0;
2578
2579 *++tp = 0;
2580 saw_digit = 0;
2581 } else
2582 return 0;
2583 }
2584
2585 if (octets < 4)
2586 return 0;
2587
2588 memcpy(&dst->s_addr, tmp, 4);
2589 return addr - cp;
2590}
2591
Thierry FOURNIERd559dd82013-11-22 16:16:59 +01002592/* This function converts the string in <buf> of the len <len> to
2593 * struct in6_addr <dst> which must be allocated by the caller.
2594 * This function returns 1 in success case, otherwise zero.
Willy Tarreau075415a2013-12-12 11:29:39 +01002595 * The destination is only modified on success.
Thierry FOURNIERd559dd82013-11-22 16:16:59 +01002596 */
Thierry FOURNIERd559dd82013-11-22 16:16:59 +01002597int buf2ip6(const char *buf, size_t len, struct in6_addr *dst)
2598{
Thierry FOURNIERcd659912013-12-11 12:33:54 +01002599 char null_term_ip6[INET6_ADDRSTRLEN + 1];
Willy Tarreau075415a2013-12-12 11:29:39 +01002600 struct in6_addr out;
Thierry FOURNIERd559dd82013-11-22 16:16:59 +01002601
Thierry FOURNIERcd659912013-12-11 12:33:54 +01002602 if (len > INET6_ADDRSTRLEN)
Thierry FOURNIERd559dd82013-11-22 16:16:59 +01002603 return 0;
2604
2605 memcpy(null_term_ip6, buf, len);
2606 null_term_ip6[len] = '\0';
2607
Willy Tarreau075415a2013-12-12 11:29:39 +01002608 if (!inet_pton(AF_INET6, null_term_ip6, &out))
Thierry FOURNIERd559dd82013-11-22 16:16:59 +01002609 return 0;
2610
Willy Tarreau075415a2013-12-12 11:29:39 +01002611 *dst = out;
Thierry FOURNIERd559dd82013-11-22 16:16:59 +01002612 return 1;
2613}
2614
Willy Tarreauacf95772010-06-14 19:09:21 +02002615/* To be used to quote config arg positions. Returns the short string at <ptr>
2616 * surrounded by simple quotes if <ptr> is valid and non-empty, or "end of line"
2617 * if ptr is NULL or empty. The string is locally allocated.
2618 */
2619const char *quote_arg(const char *ptr)
2620{
Christopher Faulet1bc04c72017-10-29 20:14:08 +01002621 static THREAD_LOCAL char val[32];
Willy Tarreauacf95772010-06-14 19:09:21 +02002622 int i;
2623
2624 if (!ptr || !*ptr)
2625 return "end of line";
2626 val[0] = '\'';
Willy Tarreaude2dd6b2013-01-24 02:14:42 +01002627 for (i = 1; i < sizeof(val) - 2 && *ptr; i++)
Willy Tarreauacf95772010-06-14 19:09:21 +02002628 val[i] = *ptr++;
2629 val[i++] = '\'';
2630 val[i] = '\0';
2631 return val;
2632}
2633
Willy Tarreau5b180202010-07-18 10:40:48 +02002634/* returns an operator among STD_OP_* for string <str> or < 0 if unknown */
2635int get_std_op(const char *str)
2636{
2637 int ret = -1;
2638
2639 if (*str == 'e' && str[1] == 'q')
2640 ret = STD_OP_EQ;
2641 else if (*str == 'n' && str[1] == 'e')
2642 ret = STD_OP_NE;
2643 else if (*str == 'l') {
2644 if (str[1] == 'e') ret = STD_OP_LE;
2645 else if (str[1] == 't') ret = STD_OP_LT;
2646 }
2647 else if (*str == 'g') {
2648 if (str[1] == 'e') ret = STD_OP_GE;
2649 else if (str[1] == 't') ret = STD_OP_GT;
2650 }
2651
2652 if (ret == -1 || str[2] != '\0')
2653 return -1;
2654 return ret;
2655}
2656
Willy Tarreau4c14eaa2010-11-24 14:01:45 +01002657/* hash a 32-bit integer to another 32-bit integer */
2658unsigned int full_hash(unsigned int a)
2659{
2660 return __full_hash(a);
2661}
2662
Willy Tarreauf3241112019-02-26 09:56:22 +01002663/* Return the bit position in mask <m> of the nth bit set of rank <r>, between
2664 * 0 and LONGBITS-1 included, starting from the left. For example ranks 0,1,2,3
2665 * for mask 0x55 will be 6, 4, 2 and 0 respectively. This algorithm is based on
2666 * a popcount variant and is described here :
2667 * https://graphics.stanford.edu/~seander/bithacks.html
2668 */
2669unsigned int mask_find_rank_bit(unsigned int r, unsigned long m)
2670{
2671 unsigned long a, b, c, d;
2672 unsigned int s;
2673 unsigned int t;
2674
2675 a = m - ((m >> 1) & ~0UL/3);
2676 b = (a & ~0UL/5) + ((a >> 2) & ~0UL/5);
2677 c = (b + (b >> 4)) & ~0UL/0x11;
2678 d = (c + (c >> 8)) & ~0UL/0x101;
2679
2680 r++; // make r be 1..64
2681
2682 t = 0;
2683 s = LONGBITS;
2684 if (s > 32) {
Willy Tarreau9b6be3b2019-03-18 16:31:18 +01002685 unsigned long d2 = (d >> 16) >> 16;
2686 t = d2 + (d2 >> 16);
Willy Tarreauf3241112019-02-26 09:56:22 +01002687 s -= ((t - r) & 256) >> 3; r -= (t & ((t - r) >> 8));
2688 }
2689
2690 t = (d >> (s - 16)) & 0xff;
2691 s -= ((t - r) & 256) >> 4; r -= (t & ((t - r) >> 8));
2692 t = (c >> (s - 8)) & 0xf;
2693 s -= ((t - r) & 256) >> 5; r -= (t & ((t - r) >> 8));
2694 t = (b >> (s - 4)) & 0x7;
2695 s -= ((t - r) & 256) >> 6; r -= (t & ((t - r) >> 8));
2696 t = (a >> (s - 2)) & 0x3;
2697 s -= ((t - r) & 256) >> 7; r -= (t & ((t - r) >> 8));
2698 t = (m >> (s - 1)) & 0x1;
2699 s -= ((t - r) & 256) >> 8;
2700
2701 return s - 1;
2702}
2703
2704/* Same as mask_find_rank_bit() above but makes use of pre-computed bitmaps
2705 * based on <m>, in <a..d>. These ones must be updated whenever <m> changes
2706 * using mask_prep_rank_map() below.
2707 */
2708unsigned int mask_find_rank_bit_fast(unsigned int r, unsigned long m,
2709 unsigned long a, unsigned long b,
2710 unsigned long c, unsigned long d)
2711{
2712 unsigned int s;
2713 unsigned int t;
2714
2715 r++; // make r be 1..64
2716
2717 t = 0;
2718 s = LONGBITS;
2719 if (s > 32) {
Willy Tarreau9b6be3b2019-03-18 16:31:18 +01002720 unsigned long d2 = (d >> 16) >> 16;
2721 t = d2 + (d2 >> 16);
Willy Tarreauf3241112019-02-26 09:56:22 +01002722 s -= ((t - r) & 256) >> 3; r -= (t & ((t - r) >> 8));
2723 }
2724
2725 t = (d >> (s - 16)) & 0xff;
2726 s -= ((t - r) & 256) >> 4; r -= (t & ((t - r) >> 8));
2727 t = (c >> (s - 8)) & 0xf;
2728 s -= ((t - r) & 256) >> 5; r -= (t & ((t - r) >> 8));
2729 t = (b >> (s - 4)) & 0x7;
2730 s -= ((t - r) & 256) >> 6; r -= (t & ((t - r) >> 8));
2731 t = (a >> (s - 2)) & 0x3;
2732 s -= ((t - r) & 256) >> 7; r -= (t & ((t - r) >> 8));
2733 t = (m >> (s - 1)) & 0x1;
2734 s -= ((t - r) & 256) >> 8;
2735
2736 return s - 1;
2737}
2738
2739/* Prepare the bitmaps used by the fast implementation of the find_rank_bit()
2740 * above.
2741 */
2742void mask_prep_rank_map(unsigned long m,
2743 unsigned long *a, unsigned long *b,
2744 unsigned long *c, unsigned long *d)
2745{
2746 *a = m - ((m >> 1) & ~0UL/3);
2747 *b = (*a & ~0UL/5) + ((*a >> 2) & ~0UL/5);
2748 *c = (*b + (*b >> 4)) & ~0UL/0x11;
2749 *d = (*c + (*c >> 8)) & ~0UL/0x101;
2750}
2751
David du Colombier4f92d322011-03-24 11:09:31 +01002752/* Return non-zero if IPv4 address is part of the network,
Willy Tarreaueec1d382016-07-13 11:59:39 +02002753 * otherwise zero. Note that <addr> may not necessarily be aligned
2754 * while the two other ones must.
David du Colombier4f92d322011-03-24 11:09:31 +01002755 */
Willy Tarreaueec1d382016-07-13 11:59:39 +02002756int in_net_ipv4(const void *addr, const struct in_addr *mask, const struct in_addr *net)
David du Colombier4f92d322011-03-24 11:09:31 +01002757{
Willy Tarreaueec1d382016-07-13 11:59:39 +02002758 struct in_addr addr_copy;
2759
2760 memcpy(&addr_copy, addr, sizeof(addr_copy));
2761 return((addr_copy.s_addr & mask->s_addr) == (net->s_addr & mask->s_addr));
David du Colombier4f92d322011-03-24 11:09:31 +01002762}
2763
2764/* Return non-zero if IPv6 address is part of the network,
Willy Tarreaueec1d382016-07-13 11:59:39 +02002765 * otherwise zero. Note that <addr> may not necessarily be aligned
2766 * while the two other ones must.
David du Colombier4f92d322011-03-24 11:09:31 +01002767 */
Willy Tarreaueec1d382016-07-13 11:59:39 +02002768int in_net_ipv6(const void *addr, const struct in6_addr *mask, const struct in6_addr *net)
David du Colombier4f92d322011-03-24 11:09:31 +01002769{
2770 int i;
Willy Tarreaueec1d382016-07-13 11:59:39 +02002771 struct in6_addr addr_copy;
David du Colombier4f92d322011-03-24 11:09:31 +01002772
Willy Tarreaueec1d382016-07-13 11:59:39 +02002773 memcpy(&addr_copy, addr, sizeof(addr_copy));
David du Colombier4f92d322011-03-24 11:09:31 +01002774 for (i = 0; i < sizeof(struct in6_addr) / sizeof(int); i++)
Willy Tarreaueec1d382016-07-13 11:59:39 +02002775 if (((((int *)&addr_copy)[i] & ((int *)mask)[i])) !=
David du Colombier4f92d322011-03-24 11:09:31 +01002776 (((int *)net)[i] & ((int *)mask)[i]))
2777 return 0;
2778 return 1;
2779}
2780
2781/* RFC 4291 prefix */
2782const char rfc4291_pfx[] = { 0x00, 0x00, 0x00, 0x00,
2783 0x00, 0x00, 0x00, 0x00,
2784 0x00, 0x00, 0xFF, 0xFF };
2785
Joseph Herlant32b83272018-11-15 11:58:28 -08002786/* Map IPv4 address on IPv6 address, as specified in RFC 3513.
Thierry FOURNIER4a04dc32013-11-28 16:33:15 +01002787 * Input and output may overlap.
2788 */
David du Colombier4f92d322011-03-24 11:09:31 +01002789void v4tov6(struct in6_addr *sin6_addr, struct in_addr *sin_addr)
2790{
Thierry FOURNIER4a04dc32013-11-28 16:33:15 +01002791 struct in_addr tmp_addr;
2792
2793 tmp_addr.s_addr = sin_addr->s_addr;
David du Colombier4f92d322011-03-24 11:09:31 +01002794 memcpy(sin6_addr->s6_addr, rfc4291_pfx, sizeof(rfc4291_pfx));
Thierry FOURNIER4a04dc32013-11-28 16:33:15 +01002795 memcpy(sin6_addr->s6_addr+12, &tmp_addr.s_addr, 4);
David du Colombier4f92d322011-03-24 11:09:31 +01002796}
2797
Joseph Herlant32b83272018-11-15 11:58:28 -08002798/* Map IPv6 address on IPv4 address, as specified in RFC 3513.
David du Colombier4f92d322011-03-24 11:09:31 +01002799 * Return true if conversion is possible and false otherwise.
2800 */
2801int v6tov4(struct in_addr *sin_addr, struct in6_addr *sin6_addr)
2802{
2803 if (memcmp(sin6_addr->s6_addr, rfc4291_pfx, sizeof(rfc4291_pfx)) == 0) {
2804 memcpy(&(sin_addr->s_addr), &(sin6_addr->s6_addr[12]),
2805 sizeof(struct in_addr));
2806 return 1;
2807 }
2808
2809 return 0;
2810}
2811
Baptiste Assmann08b24cf2016-01-23 23:39:12 +01002812/* compare two struct sockaddr_storage and return:
2813 * 0 (true) if the addr is the same in both
2814 * 1 (false) if the addr is not the same in both
2815 * -1 (unable) if one of the addr is not AF_INET*
2816 */
2817int ipcmp(struct sockaddr_storage *ss1, struct sockaddr_storage *ss2)
2818{
2819 if ((ss1->ss_family != AF_INET) && (ss1->ss_family != AF_INET6))
2820 return -1;
2821
2822 if ((ss2->ss_family != AF_INET) && (ss2->ss_family != AF_INET6))
2823 return -1;
2824
2825 if (ss1->ss_family != ss2->ss_family)
2826 return 1;
2827
2828 switch (ss1->ss_family) {
2829 case AF_INET:
2830 return memcmp(&((struct sockaddr_in *)ss1)->sin_addr,
2831 &((struct sockaddr_in *)ss2)->sin_addr,
2832 sizeof(struct in_addr)) != 0;
2833 case AF_INET6:
2834 return memcmp(&((struct sockaddr_in6 *)ss1)->sin6_addr,
2835 &((struct sockaddr_in6 *)ss2)->sin6_addr,
2836 sizeof(struct in6_addr)) != 0;
2837 }
2838
2839 return 1;
2840}
2841
Baptiste Assmann08396c82016-01-31 00:27:17 +01002842/* copy IP address from <source> into <dest>
Willy Tarreaudc3a9e82016-11-04 18:47:01 +01002843 * The caller must allocate and clear <dest> before calling.
2844 * The source must be in either AF_INET or AF_INET6 family, or the destination
2845 * address will be undefined. If the destination address used to hold a port,
2846 * it is preserved, so that this function can be used to switch to another
2847 * address family with no risk. Returns a pointer to the destination.
Baptiste Assmann08396c82016-01-31 00:27:17 +01002848 */
2849struct sockaddr_storage *ipcpy(struct sockaddr_storage *source, struct sockaddr_storage *dest)
2850{
Willy Tarreaudc3a9e82016-11-04 18:47:01 +01002851 int prev_port;
2852
2853 prev_port = get_net_port(dest);
2854 memset(dest, 0, sizeof(*dest));
Baptiste Assmann08396c82016-01-31 00:27:17 +01002855 dest->ss_family = source->ss_family;
2856
2857 /* copy new addr and apply it */
2858 switch (source->ss_family) {
2859 case AF_INET:
2860 ((struct sockaddr_in *)dest)->sin_addr.s_addr = ((struct sockaddr_in *)source)->sin_addr.s_addr;
Willy Tarreaudc3a9e82016-11-04 18:47:01 +01002861 ((struct sockaddr_in *)dest)->sin_port = prev_port;
Baptiste Assmann08396c82016-01-31 00:27:17 +01002862 break;
2863 case AF_INET6:
2864 memcpy(((struct sockaddr_in6 *)dest)->sin6_addr.s6_addr, ((struct sockaddr_in6 *)source)->sin6_addr.s6_addr, sizeof(struct in6_addr));
Willy Tarreaudc3a9e82016-11-04 18:47:01 +01002865 ((struct sockaddr_in6 *)dest)->sin6_port = prev_port;
Baptiste Assmann08396c82016-01-31 00:27:17 +01002866 break;
2867 }
2868
2869 return dest;
2870}
2871
William Lallemand421f5b52012-02-06 18:15:57 +01002872char *human_time(int t, short hz_div) {
2873 static char rv[sizeof("24855d23h")+1]; // longest of "23h59m" and "59m59s"
2874 char *p = rv;
Willy Tarreau761b3d52014-04-14 14:53:06 +02002875 char *end = rv + sizeof(rv);
William Lallemand421f5b52012-02-06 18:15:57 +01002876 int cnt=2; // print two numbers
2877
2878 if (unlikely(t < 0 || hz_div <= 0)) {
Willy Tarreau761b3d52014-04-14 14:53:06 +02002879 snprintf(p, end - p, "?");
William Lallemand421f5b52012-02-06 18:15:57 +01002880 return rv;
2881 }
2882
2883 if (unlikely(hz_div > 1))
2884 t /= hz_div;
2885
2886 if (t >= DAY) {
Willy Tarreau761b3d52014-04-14 14:53:06 +02002887 p += snprintf(p, end - p, "%dd", t / DAY);
William Lallemand421f5b52012-02-06 18:15:57 +01002888 cnt--;
2889 }
2890
2891 if (cnt && t % DAY / HOUR) {
Willy Tarreau761b3d52014-04-14 14:53:06 +02002892 p += snprintf(p, end - p, "%dh", t % DAY / HOUR);
William Lallemand421f5b52012-02-06 18:15:57 +01002893 cnt--;
2894 }
2895
2896 if (cnt && t % HOUR / MINUTE) {
Willy Tarreau761b3d52014-04-14 14:53:06 +02002897 p += snprintf(p, end - p, "%dm", t % HOUR / MINUTE);
William Lallemand421f5b52012-02-06 18:15:57 +01002898 cnt--;
2899 }
2900
2901 if ((cnt && t % MINUTE) || !t) // also display '0s'
Willy Tarreau761b3d52014-04-14 14:53:06 +02002902 p += snprintf(p, end - p, "%ds", t % MINUTE / SEC);
William Lallemand421f5b52012-02-06 18:15:57 +01002903
2904 return rv;
2905}
2906
2907const char *monthname[12] = {
2908 "Jan", "Feb", "Mar", "Apr", "May", "Jun",
2909 "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"
2910};
2911
2912/* date2str_log: write a date in the format :
2913 * sprintf(str, "%02d/%s/%04d:%02d:%02d:%02d.%03d",
2914 * tm.tm_mday, monthname[tm.tm_mon], tm.tm_year+1900,
2915 * tm.tm_hour, tm.tm_min, tm.tm_sec, (int)date.tv_usec/1000);
2916 *
2917 * without using sprintf. return a pointer to the last char written (\0) or
2918 * NULL if there isn't enough space.
2919 */
Willy Tarreauf16cb412018-09-04 19:08:48 +02002920char *date2str_log(char *dst, const struct tm *tm, const struct timeval *date, size_t size)
William Lallemand421f5b52012-02-06 18:15:57 +01002921{
2922
2923 if (size < 25) /* the size is fixed: 24 chars + \0 */
2924 return NULL;
2925
2926 dst = utoa_pad((unsigned int)tm->tm_mday, dst, 3); // day
Willy Tarreau4eee38a2019-02-12 11:26:29 +01002927 if (!dst)
2928 return NULL;
William Lallemand421f5b52012-02-06 18:15:57 +01002929 *dst++ = '/';
Willy Tarreau4eee38a2019-02-12 11:26:29 +01002930
William Lallemand421f5b52012-02-06 18:15:57 +01002931 memcpy(dst, monthname[tm->tm_mon], 3); // month
2932 dst += 3;
2933 *dst++ = '/';
Willy Tarreau4eee38a2019-02-12 11:26:29 +01002934
William Lallemand421f5b52012-02-06 18:15:57 +01002935 dst = utoa_pad((unsigned int)tm->tm_year+1900, dst, 5); // year
Willy Tarreau4eee38a2019-02-12 11:26:29 +01002936 if (!dst)
2937 return NULL;
William Lallemand421f5b52012-02-06 18:15:57 +01002938 *dst++ = ':';
Willy Tarreau4eee38a2019-02-12 11:26:29 +01002939
William Lallemand421f5b52012-02-06 18:15:57 +01002940 dst = utoa_pad((unsigned int)tm->tm_hour, dst, 3); // hour
Willy Tarreau4eee38a2019-02-12 11:26:29 +01002941 if (!dst)
2942 return NULL;
William Lallemand421f5b52012-02-06 18:15:57 +01002943 *dst++ = ':';
Willy Tarreau4eee38a2019-02-12 11:26:29 +01002944
William Lallemand421f5b52012-02-06 18:15:57 +01002945 dst = utoa_pad((unsigned int)tm->tm_min, dst, 3); // minutes
Willy Tarreau4eee38a2019-02-12 11:26:29 +01002946 if (!dst)
2947 return NULL;
William Lallemand421f5b52012-02-06 18:15:57 +01002948 *dst++ = ':';
Willy Tarreau4eee38a2019-02-12 11:26:29 +01002949
William Lallemand421f5b52012-02-06 18:15:57 +01002950 dst = utoa_pad((unsigned int)tm->tm_sec, dst, 3); // secondes
Willy Tarreau4eee38a2019-02-12 11:26:29 +01002951 if (!dst)
2952 return NULL;
William Lallemand421f5b52012-02-06 18:15:57 +01002953 *dst++ = '.';
Willy Tarreau4eee38a2019-02-12 11:26:29 +01002954
Willy Tarreau7d9421d2020-02-29 09:08:02 +01002955 dst = utoa_pad((unsigned int)(date->tv_usec/1000)%1000, dst, 4); // milliseconds
Willy Tarreau4eee38a2019-02-12 11:26:29 +01002956 if (!dst)
2957 return NULL;
William Lallemand421f5b52012-02-06 18:15:57 +01002958 *dst = '\0';
2959
2960 return dst;
2961}
2962
Benoit GARNIERe2e5bde2016-03-27 03:04:16 +02002963/* Base year used to compute leap years */
2964#define TM_YEAR_BASE 1900
2965
2966/* Return the difference in seconds between two times (leap seconds are ignored).
2967 * Retrieved from glibc 2.18 source code.
2968 */
2969static int my_tm_diff(const struct tm *a, const struct tm *b)
2970{
2971 /* Compute intervening leap days correctly even if year is negative.
2972 * Take care to avoid int overflow in leap day calculations,
2973 * but it's OK to assume that A and B are close to each other.
2974 */
2975 int a4 = (a->tm_year >> 2) + (TM_YEAR_BASE >> 2) - ! (a->tm_year & 3);
2976 int b4 = (b->tm_year >> 2) + (TM_YEAR_BASE >> 2) - ! (b->tm_year & 3);
2977 int a100 = a4 / 25 - (a4 % 25 < 0);
2978 int b100 = b4 / 25 - (b4 % 25 < 0);
2979 int a400 = a100 >> 2;
2980 int b400 = b100 >> 2;
2981 int intervening_leap_days = (a4 - b4) - (a100 - b100) + (a400 - b400);
2982 int years = a->tm_year - b->tm_year;
2983 int days = (365 * years + intervening_leap_days
2984 + (a->tm_yday - b->tm_yday));
2985 return (60 * (60 * (24 * days + (a->tm_hour - b->tm_hour))
2986 + (a->tm_min - b->tm_min))
2987 + (a->tm_sec - b->tm_sec));
2988}
2989
Benoit GARNIERb413c2a2016-03-27 11:08:03 +02002990/* Return the GMT offset for a specific local time.
Benoit GARNIERe2e5bde2016-03-27 03:04:16 +02002991 * Both t and tm must represent the same time.
Benoit GARNIERb413c2a2016-03-27 11:08:03 +02002992 * The string returned has the same format as returned by strftime(... "%z", tm).
2993 * Offsets are kept in an internal cache for better performances.
2994 */
Benoit GARNIERe2e5bde2016-03-27 03:04:16 +02002995const char *get_gmt_offset(time_t t, struct tm *tm)
Benoit GARNIERb413c2a2016-03-27 11:08:03 +02002996{
2997 /* Cache offsets from GMT (depending on whether DST is active or not) */
Christopher Faulet1bc04c72017-10-29 20:14:08 +01002998 static THREAD_LOCAL char gmt_offsets[2][5+1] = { "", "" };
Benoit GARNIERb413c2a2016-03-27 11:08:03 +02002999
Benoit GARNIERb413c2a2016-03-27 11:08:03 +02003000 char *gmt_offset;
Benoit GARNIERe2e5bde2016-03-27 03:04:16 +02003001 struct tm tm_gmt;
3002 int diff;
3003 int isdst = tm->tm_isdst;
Benoit GARNIERb413c2a2016-03-27 11:08:03 +02003004
Benoit GARNIERe2e5bde2016-03-27 03:04:16 +02003005 /* Pretend DST not active if its status is unknown */
3006 if (isdst < 0)
3007 isdst = 0;
Benoit GARNIERb413c2a2016-03-27 11:08:03 +02003008
Benoit GARNIERe2e5bde2016-03-27 03:04:16 +02003009 /* Fetch the offset and initialize it if needed */
3010 gmt_offset = gmt_offsets[isdst & 0x01];
3011 if (unlikely(!*gmt_offset)) {
3012 get_gmtime(t, &tm_gmt);
3013 diff = my_tm_diff(tm, &tm_gmt);
3014 if (diff < 0) {
3015 diff = -diff;
3016 *gmt_offset = '-';
3017 } else {
3018 *gmt_offset = '+';
3019 }
Willy Tarreaue112c8a2019-10-29 10:16:11 +01003020 diff %= 86400U;
Benoit GARNIERe2e5bde2016-03-27 03:04:16 +02003021 diff /= 60; /* Convert to minutes */
3022 snprintf(gmt_offset+1, 4+1, "%02d%02d", diff/60, diff%60);
3023 }
Benoit GARNIERb413c2a2016-03-27 11:08:03 +02003024
Willy Tarreaue112c8a2019-10-29 10:16:11 +01003025 return gmt_offset;
Benoit GARNIERb413c2a2016-03-27 11:08:03 +02003026}
3027
William Lallemand421f5b52012-02-06 18:15:57 +01003028/* gmt2str_log: write a date in the format :
3029 * "%02d/%s/%04d:%02d:%02d:%02d +0000" without using snprintf
3030 * return a pointer to the last char written (\0) or
3031 * NULL if there isn't enough space.
3032 */
3033char *gmt2str_log(char *dst, struct tm *tm, size_t size)
3034{
Yuxans Yao4e25b012012-10-19 10:36:09 +08003035 if (size < 27) /* the size is fixed: 26 chars + \0 */
William Lallemand421f5b52012-02-06 18:15:57 +01003036 return NULL;
3037
3038 dst = utoa_pad((unsigned int)tm->tm_mday, dst, 3); // day
Willy Tarreau4eee38a2019-02-12 11:26:29 +01003039 if (!dst)
3040 return NULL;
William Lallemand421f5b52012-02-06 18:15:57 +01003041 *dst++ = '/';
Willy Tarreau4eee38a2019-02-12 11:26:29 +01003042
William Lallemand421f5b52012-02-06 18:15:57 +01003043 memcpy(dst, monthname[tm->tm_mon], 3); // month
3044 dst += 3;
3045 *dst++ = '/';
Willy Tarreau4eee38a2019-02-12 11:26:29 +01003046
William Lallemand421f5b52012-02-06 18:15:57 +01003047 dst = utoa_pad((unsigned int)tm->tm_year+1900, dst, 5); // year
Willy Tarreau4eee38a2019-02-12 11:26:29 +01003048 if (!dst)
3049 return NULL;
William Lallemand421f5b52012-02-06 18:15:57 +01003050 *dst++ = ':';
Willy Tarreau4eee38a2019-02-12 11:26:29 +01003051
William Lallemand421f5b52012-02-06 18:15:57 +01003052 dst = utoa_pad((unsigned int)tm->tm_hour, dst, 3); // hour
Willy Tarreau4eee38a2019-02-12 11:26:29 +01003053 if (!dst)
3054 return NULL;
William Lallemand421f5b52012-02-06 18:15:57 +01003055 *dst++ = ':';
Willy Tarreau4eee38a2019-02-12 11:26:29 +01003056
William Lallemand421f5b52012-02-06 18:15:57 +01003057 dst = utoa_pad((unsigned int)tm->tm_min, dst, 3); // minutes
Willy Tarreau4eee38a2019-02-12 11:26:29 +01003058 if (!dst)
3059 return NULL;
William Lallemand421f5b52012-02-06 18:15:57 +01003060 *dst++ = ':';
Willy Tarreau4eee38a2019-02-12 11:26:29 +01003061
William Lallemand421f5b52012-02-06 18:15:57 +01003062 dst = utoa_pad((unsigned int)tm->tm_sec, dst, 3); // secondes
Willy Tarreau4eee38a2019-02-12 11:26:29 +01003063 if (!dst)
3064 return NULL;
William Lallemand421f5b52012-02-06 18:15:57 +01003065 *dst++ = ' ';
3066 *dst++ = '+';
3067 *dst++ = '0';
3068 *dst++ = '0';
3069 *dst++ = '0';
3070 *dst++ = '0';
3071 *dst = '\0';
3072
3073 return dst;
3074}
3075
Yuxans Yao4e25b012012-10-19 10:36:09 +08003076/* localdate2str_log: write a date in the format :
3077 * "%02d/%s/%04d:%02d:%02d:%02d +0000(local timezone)" without using snprintf
Benoit GARNIERe2e5bde2016-03-27 03:04:16 +02003078 * Both t and tm must represent the same time.
3079 * return a pointer to the last char written (\0) or
3080 * NULL if there isn't enough space.
Yuxans Yao4e25b012012-10-19 10:36:09 +08003081 */
Benoit GARNIERe2e5bde2016-03-27 03:04:16 +02003082char *localdate2str_log(char *dst, time_t t, struct tm *tm, size_t size)
Yuxans Yao4e25b012012-10-19 10:36:09 +08003083{
Benoit GARNIERb413c2a2016-03-27 11:08:03 +02003084 const char *gmt_offset;
Yuxans Yao4e25b012012-10-19 10:36:09 +08003085 if (size < 27) /* the size is fixed: 26 chars + \0 */
3086 return NULL;
3087
Benoit GARNIERe2e5bde2016-03-27 03:04:16 +02003088 gmt_offset = get_gmt_offset(t, tm);
Benoit GARNIERb413c2a2016-03-27 11:08:03 +02003089
Yuxans Yao4e25b012012-10-19 10:36:09 +08003090 dst = utoa_pad((unsigned int)tm->tm_mday, dst, 3); // day
Willy Tarreau4eee38a2019-02-12 11:26:29 +01003091 if (!dst)
3092 return NULL;
Yuxans Yao4e25b012012-10-19 10:36:09 +08003093 *dst++ = '/';
Willy Tarreau4eee38a2019-02-12 11:26:29 +01003094
Yuxans Yao4e25b012012-10-19 10:36:09 +08003095 memcpy(dst, monthname[tm->tm_mon], 3); // month
3096 dst += 3;
3097 *dst++ = '/';
Willy Tarreau4eee38a2019-02-12 11:26:29 +01003098
Yuxans Yao4e25b012012-10-19 10:36:09 +08003099 dst = utoa_pad((unsigned int)tm->tm_year+1900, dst, 5); // year
Willy Tarreau4eee38a2019-02-12 11:26:29 +01003100 if (!dst)
3101 return NULL;
Yuxans Yao4e25b012012-10-19 10:36:09 +08003102 *dst++ = ':';
Willy Tarreau4eee38a2019-02-12 11:26:29 +01003103
Yuxans Yao4e25b012012-10-19 10:36:09 +08003104 dst = utoa_pad((unsigned int)tm->tm_hour, dst, 3); // hour
Willy Tarreau4eee38a2019-02-12 11:26:29 +01003105 if (!dst)
3106 return NULL;
Yuxans Yao4e25b012012-10-19 10:36:09 +08003107 *dst++ = ':';
Willy Tarreau4eee38a2019-02-12 11:26:29 +01003108
Yuxans Yao4e25b012012-10-19 10:36:09 +08003109 dst = utoa_pad((unsigned int)tm->tm_min, dst, 3); // minutes
Willy Tarreau4eee38a2019-02-12 11:26:29 +01003110 if (!dst)
3111 return NULL;
Yuxans Yao4e25b012012-10-19 10:36:09 +08003112 *dst++ = ':';
Willy Tarreau4eee38a2019-02-12 11:26:29 +01003113
Yuxans Yao4e25b012012-10-19 10:36:09 +08003114 dst = utoa_pad((unsigned int)tm->tm_sec, dst, 3); // secondes
Willy Tarreau4eee38a2019-02-12 11:26:29 +01003115 if (!dst)
3116 return NULL;
Yuxans Yao4e25b012012-10-19 10:36:09 +08003117 *dst++ = ' ';
Willy Tarreau4eee38a2019-02-12 11:26:29 +01003118
Benoit GARNIERb413c2a2016-03-27 11:08:03 +02003119 memcpy(dst, gmt_offset, 5); // Offset from local time to GMT
Yuxans Yao4e25b012012-10-19 10:36:09 +08003120 dst += 5;
3121 *dst = '\0';
3122
3123 return dst;
3124}
3125
Willy Tarreaucb1949b2017-07-19 19:05:29 +02003126/* Returns the number of seconds since 01/01/1970 0:0:0 GMT for GMT date <tm>.
3127 * It is meant as a portable replacement for timegm() for use with valid inputs.
3128 * Returns undefined results for invalid dates (eg: months out of range 0..11).
3129 */
3130time_t my_timegm(const struct tm *tm)
3131{
3132 /* Each month has 28, 29, 30 or 31 days, or 28+N. The date in the year
3133 * is thus (current month - 1)*28 + cumulated_N[month] to count the
3134 * sum of the extra N days for elapsed months. The sum of all these N
3135 * days doesn't exceed 30 for a complete year (366-12*28) so it fits
3136 * in a 5-bit word. This means that with 60 bits we can represent a
3137 * matrix of all these values at once, which is fast and efficient to
3138 * access. The extra February day for leap years is not counted here.
3139 *
3140 * Jan : none = 0 (0)
3141 * Feb : Jan = 3 (3)
3142 * Mar : Jan..Feb = 3 (3 + 0)
3143 * Apr : Jan..Mar = 6 (3 + 0 + 3)
3144 * May : Jan..Apr = 8 (3 + 0 + 3 + 2)
3145 * Jun : Jan..May = 11 (3 + 0 + 3 + 2 + 3)
3146 * Jul : Jan..Jun = 13 (3 + 0 + 3 + 2 + 3 + 2)
3147 * Aug : Jan..Jul = 16 (3 + 0 + 3 + 2 + 3 + 2 + 3)
3148 * Sep : Jan..Aug = 19 (3 + 0 + 3 + 2 + 3 + 2 + 3 + 3)
3149 * Oct : Jan..Sep = 21 (3 + 0 + 3 + 2 + 3 + 2 + 3 + 3 + 2)
3150 * Nov : Jan..Oct = 24 (3 + 0 + 3 + 2 + 3 + 2 + 3 + 3 + 2 + 3)
3151 * Dec : Jan..Nov = 26 (3 + 0 + 3 + 2 + 3 + 2 + 3 + 3 + 2 + 3 + 2)
3152 */
3153 uint64_t extra =
3154 ( 0ULL << 0*5) + ( 3ULL << 1*5) + ( 3ULL << 2*5) + /* Jan, Feb, Mar, */
3155 ( 6ULL << 3*5) + ( 8ULL << 4*5) + (11ULL << 5*5) + /* Apr, May, Jun, */
3156 (13ULL << 6*5) + (16ULL << 7*5) + (19ULL << 8*5) + /* Jul, Aug, Sep, */
3157 (21ULL << 9*5) + (24ULL << 10*5) + (26ULL << 11*5); /* Oct, Nov, Dec, */
3158
3159 unsigned int y = tm->tm_year + 1900;
3160 unsigned int m = tm->tm_mon;
3161 unsigned long days = 0;
3162
3163 /* days since 1/1/1970 for full years */
3164 days += days_since_zero(y) - days_since_zero(1970);
3165
3166 /* days for full months in the current year */
3167 days += 28 * m + ((extra >> (m * 5)) & 0x1f);
3168
3169 /* count + 1 after March for leap years. A leap year is a year multiple
3170 * of 4, unless it's multiple of 100 without being multiple of 400. 2000
3171 * is leap, 1900 isn't, 1904 is.
3172 */
3173 if ((m > 1) && !(y & 3) && ((y % 100) || !(y % 400)))
3174 days++;
3175
3176 days += tm->tm_mday - 1;
3177 return days * 86400ULL + tm->tm_hour * 3600 + tm->tm_min * 60 + tm->tm_sec;
3178}
3179
Thierry Fournier93127942016-01-20 18:49:45 +01003180/* This function check a char. It returns true and updates
3181 * <date> and <len> pointer to the new position if the
3182 * character is found.
3183 */
3184static inline int parse_expect_char(const char **date, int *len, char c)
3185{
3186 if (*len < 1 || **date != c)
3187 return 0;
3188 (*len)--;
3189 (*date)++;
3190 return 1;
3191}
3192
3193/* This function expects a string <str> of len <l>. It return true and updates.
3194 * <date> and <len> if the string matches, otherwise, it returns false.
3195 */
3196static inline int parse_strcmp(const char **date, int *len, char *str, int l)
3197{
3198 if (*len < l || strncmp(*date, str, l) != 0)
3199 return 0;
3200 (*len) -= l;
3201 (*date) += l;
3202 return 1;
3203}
3204
3205/* This macro converts 3 chars name in integer. */
3206#define STR2I3(__a, __b, __c) ((__a) * 65536 + (__b) * 256 + (__c))
3207
3208/* day-name = %x4D.6F.6E ; "Mon", case-sensitive
3209 * / %x54.75.65 ; "Tue", case-sensitive
3210 * / %x57.65.64 ; "Wed", case-sensitive
3211 * / %x54.68.75 ; "Thu", case-sensitive
3212 * / %x46.72.69 ; "Fri", case-sensitive
3213 * / %x53.61.74 ; "Sat", case-sensitive
3214 * / %x53.75.6E ; "Sun", case-sensitive
3215 *
3216 * This array must be alphabetically sorted
3217 */
3218static inline int parse_http_dayname(const char **date, int *len, struct tm *tm)
3219{
3220 if (*len < 3)
3221 return 0;
3222 switch (STR2I3((*date)[0], (*date)[1], (*date)[2])) {
3223 case STR2I3('M','o','n'): tm->tm_wday = 1; break;
3224 case STR2I3('T','u','e'): tm->tm_wday = 2; break;
3225 case STR2I3('W','e','d'): tm->tm_wday = 3; break;
3226 case STR2I3('T','h','u'): tm->tm_wday = 4; break;
3227 case STR2I3('F','r','i'): tm->tm_wday = 5; break;
3228 case STR2I3('S','a','t'): tm->tm_wday = 6; break;
3229 case STR2I3('S','u','n'): tm->tm_wday = 7; break;
3230 default: return 0;
3231 }
3232 *len -= 3;
3233 *date += 3;
3234 return 1;
3235}
3236
3237/* month = %x4A.61.6E ; "Jan", case-sensitive
3238 * / %x46.65.62 ; "Feb", case-sensitive
3239 * / %x4D.61.72 ; "Mar", case-sensitive
3240 * / %x41.70.72 ; "Apr", case-sensitive
3241 * / %x4D.61.79 ; "May", case-sensitive
3242 * / %x4A.75.6E ; "Jun", case-sensitive
3243 * / %x4A.75.6C ; "Jul", case-sensitive
3244 * / %x41.75.67 ; "Aug", case-sensitive
3245 * / %x53.65.70 ; "Sep", case-sensitive
3246 * / %x4F.63.74 ; "Oct", case-sensitive
3247 * / %x4E.6F.76 ; "Nov", case-sensitive
3248 * / %x44.65.63 ; "Dec", case-sensitive
3249 *
3250 * This array must be alphabetically sorted
3251 */
3252static inline int parse_http_monthname(const char **date, int *len, struct tm *tm)
3253{
3254 if (*len < 3)
3255 return 0;
3256 switch (STR2I3((*date)[0], (*date)[1], (*date)[2])) {
3257 case STR2I3('J','a','n'): tm->tm_mon = 0; break;
3258 case STR2I3('F','e','b'): tm->tm_mon = 1; break;
3259 case STR2I3('M','a','r'): tm->tm_mon = 2; break;
3260 case STR2I3('A','p','r'): tm->tm_mon = 3; break;
3261 case STR2I3('M','a','y'): tm->tm_mon = 4; break;
3262 case STR2I3('J','u','n'): tm->tm_mon = 5; break;
3263 case STR2I3('J','u','l'): tm->tm_mon = 6; break;
3264 case STR2I3('A','u','g'): tm->tm_mon = 7; break;
3265 case STR2I3('S','e','p'): tm->tm_mon = 8; break;
3266 case STR2I3('O','c','t'): tm->tm_mon = 9; break;
3267 case STR2I3('N','o','v'): tm->tm_mon = 10; break;
3268 case STR2I3('D','e','c'): tm->tm_mon = 11; break;
3269 default: return 0;
3270 }
3271 *len -= 3;
3272 *date += 3;
3273 return 1;
3274}
3275
3276/* day-name-l = %x4D.6F.6E.64.61.79 ; "Monday", case-sensitive
3277 * / %x54.75.65.73.64.61.79 ; "Tuesday", case-sensitive
3278 * / %x57.65.64.6E.65.73.64.61.79 ; "Wednesday", case-sensitive
3279 * / %x54.68.75.72.73.64.61.79 ; "Thursday", case-sensitive
3280 * / %x46.72.69.64.61.79 ; "Friday", case-sensitive
3281 * / %x53.61.74.75.72.64.61.79 ; "Saturday", case-sensitive
3282 * / %x53.75.6E.64.61.79 ; "Sunday", case-sensitive
3283 *
3284 * This array must be alphabetically sorted
3285 */
3286static inline int parse_http_ldayname(const char **date, int *len, struct tm *tm)
3287{
3288 if (*len < 6) /* Minimum length. */
3289 return 0;
3290 switch (STR2I3((*date)[0], (*date)[1], (*date)[2])) {
3291 case STR2I3('M','o','n'):
3292 RET0_UNLESS(parse_strcmp(date, len, "Monday", 6));
3293 tm->tm_wday = 1;
3294 return 1;
3295 case STR2I3('T','u','e'):
3296 RET0_UNLESS(parse_strcmp(date, len, "Tuesday", 7));
3297 tm->tm_wday = 2;
3298 return 1;
3299 case STR2I3('W','e','d'):
3300 RET0_UNLESS(parse_strcmp(date, len, "Wednesday", 9));
3301 tm->tm_wday = 3;
3302 return 1;
3303 case STR2I3('T','h','u'):
3304 RET0_UNLESS(parse_strcmp(date, len, "Thursday", 8));
3305 tm->tm_wday = 4;
3306 return 1;
3307 case STR2I3('F','r','i'):
3308 RET0_UNLESS(parse_strcmp(date, len, "Friday", 6));
3309 tm->tm_wday = 5;
3310 return 1;
3311 case STR2I3('S','a','t'):
3312 RET0_UNLESS(parse_strcmp(date, len, "Saturday", 8));
3313 tm->tm_wday = 6;
3314 return 1;
3315 case STR2I3('S','u','n'):
3316 RET0_UNLESS(parse_strcmp(date, len, "Sunday", 6));
3317 tm->tm_wday = 7;
3318 return 1;
3319 }
3320 return 0;
3321}
3322
3323/* This function parses exactly 1 digit and returns the numeric value in "digit". */
3324static inline int parse_digit(const char **date, int *len, int *digit)
3325{
3326 if (*len < 1 || **date < '0' || **date > '9')
3327 return 0;
3328 *digit = (**date - '0');
3329 (*date)++;
3330 (*len)--;
3331 return 1;
3332}
3333
3334/* This function parses exactly 2 digits and returns the numeric value in "digit". */
3335static inline int parse_2digit(const char **date, int *len, int *digit)
3336{
3337 int value;
3338
3339 RET0_UNLESS(parse_digit(date, len, &value));
3340 (*digit) = value * 10;
3341 RET0_UNLESS(parse_digit(date, len, &value));
3342 (*digit) += value;
3343
3344 return 1;
3345}
3346
3347/* This function parses exactly 4 digits and returns the numeric value in "digit". */
3348static inline int parse_4digit(const char **date, int *len, int *digit)
3349{
3350 int value;
3351
3352 RET0_UNLESS(parse_digit(date, len, &value));
3353 (*digit) = value * 1000;
3354
3355 RET0_UNLESS(parse_digit(date, len, &value));
3356 (*digit) += value * 100;
3357
3358 RET0_UNLESS(parse_digit(date, len, &value));
3359 (*digit) += value * 10;
3360
3361 RET0_UNLESS(parse_digit(date, len, &value));
3362 (*digit) += value;
3363
3364 return 1;
3365}
3366
3367/* time-of-day = hour ":" minute ":" second
3368 * ; 00:00:00 - 23:59:60 (leap second)
3369 *
3370 * hour = 2DIGIT
3371 * minute = 2DIGIT
3372 * second = 2DIGIT
3373 */
3374static inline int parse_http_time(const char **date, int *len, struct tm *tm)
3375{
3376 RET0_UNLESS(parse_2digit(date, len, &tm->tm_hour)); /* hour 2DIGIT */
3377 RET0_UNLESS(parse_expect_char(date, len, ':')); /* expect ":" */
3378 RET0_UNLESS(parse_2digit(date, len, &tm->tm_min)); /* min 2DIGIT */
3379 RET0_UNLESS(parse_expect_char(date, len, ':')); /* expect ":" */
3380 RET0_UNLESS(parse_2digit(date, len, &tm->tm_sec)); /* sec 2DIGIT */
3381 return 1;
3382}
3383
3384/* From RFC7231
3385 * https://tools.ietf.org/html/rfc7231#section-7.1.1.1
3386 *
3387 * IMF-fixdate = day-name "," SP date1 SP time-of-day SP GMT
3388 * ; fixed length/zone/capitalization subset of the format
3389 * ; see Section 3.3 of [RFC5322]
3390 *
3391 *
3392 * date1 = day SP month SP year
3393 * ; e.g., 02 Jun 1982
3394 *
3395 * day = 2DIGIT
3396 * year = 4DIGIT
3397 *
3398 * GMT = %x47.4D.54 ; "GMT", case-sensitive
3399 *
3400 * time-of-day = hour ":" minute ":" second
3401 * ; 00:00:00 - 23:59:60 (leap second)
3402 *
3403 * hour = 2DIGIT
3404 * minute = 2DIGIT
3405 * second = 2DIGIT
3406 *
3407 * DIGIT = decimal 0-9
3408 */
3409int parse_imf_date(const char *date, int len, struct tm *tm)
3410{
David Carlier327298c2016-11-20 10:42:38 +00003411 /* tm_gmtoff, if present, ought to be zero'ed */
3412 memset(tm, 0, sizeof(*tm));
3413
Thierry Fournier93127942016-01-20 18:49:45 +01003414 RET0_UNLESS(parse_http_dayname(&date, &len, tm)); /* day-name */
3415 RET0_UNLESS(parse_expect_char(&date, &len, ',')); /* expect "," */
3416 RET0_UNLESS(parse_expect_char(&date, &len, ' ')); /* expect SP */
3417 RET0_UNLESS(parse_2digit(&date, &len, &tm->tm_mday)); /* day 2DIGIT */
3418 RET0_UNLESS(parse_expect_char(&date, &len, ' ')); /* expect SP */
3419 RET0_UNLESS(parse_http_monthname(&date, &len, tm)); /* Month */
3420 RET0_UNLESS(parse_expect_char(&date, &len, ' ')); /* expect SP */
3421 RET0_UNLESS(parse_4digit(&date, &len, &tm->tm_year)); /* year = 4DIGIT */
3422 tm->tm_year -= 1900;
3423 RET0_UNLESS(parse_expect_char(&date, &len, ' ')); /* expect SP */
3424 RET0_UNLESS(parse_http_time(&date, &len, tm)); /* Parse time. */
3425 RET0_UNLESS(parse_expect_char(&date, &len, ' ')); /* expect SP */
3426 RET0_UNLESS(parse_strcmp(&date, &len, "GMT", 3)); /* GMT = %x47.4D.54 ; "GMT", case-sensitive */
3427 tm->tm_isdst = -1;
Thierry Fournier93127942016-01-20 18:49:45 +01003428 return 1;
3429}
3430
3431/* From RFC7231
3432 * https://tools.ietf.org/html/rfc7231#section-7.1.1.1
3433 *
3434 * rfc850-date = day-name-l "," SP date2 SP time-of-day SP GMT
3435 * date2 = day "-" month "-" 2DIGIT
3436 * ; e.g., 02-Jun-82
3437 *
3438 * day = 2DIGIT
3439 */
3440int parse_rfc850_date(const char *date, int len, struct tm *tm)
3441{
3442 int year;
3443
David Carlier327298c2016-11-20 10:42:38 +00003444 /* tm_gmtoff, if present, ought to be zero'ed */
3445 memset(tm, 0, sizeof(*tm));
3446
Thierry Fournier93127942016-01-20 18:49:45 +01003447 RET0_UNLESS(parse_http_ldayname(&date, &len, tm)); /* Read the day name */
3448 RET0_UNLESS(parse_expect_char(&date, &len, ',')); /* expect "," */
3449 RET0_UNLESS(parse_expect_char(&date, &len, ' ')); /* expect SP */
3450 RET0_UNLESS(parse_2digit(&date, &len, &tm->tm_mday)); /* day 2DIGIT */
3451 RET0_UNLESS(parse_expect_char(&date, &len, '-')); /* expect "-" */
3452 RET0_UNLESS(parse_http_monthname(&date, &len, tm)); /* Month */
3453 RET0_UNLESS(parse_expect_char(&date, &len, '-')); /* expect "-" */
3454
3455 /* year = 2DIGIT
3456 *
3457 * Recipients of a timestamp value in rfc850-(*date) format, which uses a
3458 * two-digit year, MUST interpret a timestamp that appears to be more
3459 * than 50 years in the future as representing the most recent year in
3460 * the past that had the same last two digits.
3461 */
3462 RET0_UNLESS(parse_2digit(&date, &len, &tm->tm_year));
3463
3464 /* expect SP */
3465 if (!parse_expect_char(&date, &len, ' ')) {
3466 /* Maybe we have the date with 4 digits. */
3467 RET0_UNLESS(parse_2digit(&date, &len, &year));
3468 tm->tm_year = (tm->tm_year * 100 + year) - 1900;
3469 /* expect SP */
3470 RET0_UNLESS(parse_expect_char(&date, &len, ' '));
3471 } else {
3472 /* I fix 60 as pivot: >60: +1900, <60: +2000. Note that the
3473 * tm_year is the number of year since 1900, so for +1900, we
3474 * do nothing, and for +2000, we add 100.
3475 */
3476 if (tm->tm_year <= 60)
3477 tm->tm_year += 100;
3478 }
3479
3480 RET0_UNLESS(parse_http_time(&date, &len, tm)); /* Parse time. */
3481 RET0_UNLESS(parse_expect_char(&date, &len, ' ')); /* expect SP */
3482 RET0_UNLESS(parse_strcmp(&date, &len, "GMT", 3)); /* GMT = %x47.4D.54 ; "GMT", case-sensitive */
3483 tm->tm_isdst = -1;
Thierry Fournier93127942016-01-20 18:49:45 +01003484
3485 return 1;
3486}
3487
3488/* From RFC7231
3489 * https://tools.ietf.org/html/rfc7231#section-7.1.1.1
3490 *
3491 * asctime-date = day-name SP date3 SP time-of-day SP year
3492 * date3 = month SP ( 2DIGIT / ( SP 1DIGIT ))
3493 * ; e.g., Jun 2
3494 *
3495 * HTTP-date is case sensitive. A sender MUST NOT generate additional
3496 * whitespace in an HTTP-date beyond that specifically included as SP in
3497 * the grammar.
3498 */
3499int parse_asctime_date(const char *date, int len, struct tm *tm)
3500{
David Carlier327298c2016-11-20 10:42:38 +00003501 /* tm_gmtoff, if present, ought to be zero'ed */
3502 memset(tm, 0, sizeof(*tm));
3503
Thierry Fournier93127942016-01-20 18:49:45 +01003504 RET0_UNLESS(parse_http_dayname(&date, &len, tm)); /* day-name */
3505 RET0_UNLESS(parse_expect_char(&date, &len, ' ')); /* expect SP */
3506 RET0_UNLESS(parse_http_monthname(&date, &len, tm)); /* expect month */
3507 RET0_UNLESS(parse_expect_char(&date, &len, ' ')); /* expect SP */
3508
3509 /* expect SP and 1DIGIT or 2DIGIT */
3510 if (parse_expect_char(&date, &len, ' '))
3511 RET0_UNLESS(parse_digit(&date, &len, &tm->tm_mday));
3512 else
3513 RET0_UNLESS(parse_2digit(&date, &len, &tm->tm_mday));
3514
3515 RET0_UNLESS(parse_expect_char(&date, &len, ' ')); /* expect SP */
3516 RET0_UNLESS(parse_http_time(&date, &len, tm)); /* Parse time. */
3517 RET0_UNLESS(parse_expect_char(&date, &len, ' ')); /* expect SP */
3518 RET0_UNLESS(parse_4digit(&date, &len, &tm->tm_year)); /* year = 4DIGIT */
3519 tm->tm_year -= 1900;
3520 tm->tm_isdst = -1;
Thierry Fournier93127942016-01-20 18:49:45 +01003521 return 1;
3522}
3523
3524/* From RFC7231
3525 * https://tools.ietf.org/html/rfc7231#section-7.1.1.1
3526 *
3527 * HTTP-date = IMF-fixdate / obs-date
3528 * obs-date = rfc850-date / asctime-date
3529 *
3530 * parses an HTTP date in the RFC format and is accepted
3531 * alternatives. <date> is the strinf containing the date,
3532 * len is the len of the string. <tm> is filled with the
3533 * parsed time. We must considers this time as GMT.
3534 */
3535int parse_http_date(const char *date, int len, struct tm *tm)
3536{
3537 if (parse_imf_date(date, len, tm))
3538 return 1;
3539
3540 if (parse_rfc850_date(date, len, tm))
3541 return 1;
3542
3543 if (parse_asctime_date(date, len, tm))
3544 return 1;
3545
3546 return 0;
3547}
3548
Willy Tarreau9a7bea52012-04-27 11:16:50 +02003549/* Dynamically allocates a string of the proper length to hold the formatted
3550 * output. NULL is returned on error. The caller is responsible for freeing the
3551 * memory area using free(). The resulting string is returned in <out> if the
3552 * pointer is not NULL. A previous version of <out> might be used to build the
3553 * new string, and it will be freed before returning if it is not NULL, which
3554 * makes it possible to build complex strings from iterative calls without
3555 * having to care about freeing intermediate values, as in the example below :
3556 *
3557 * memprintf(&err, "invalid argument: '%s'", arg);
3558 * ...
3559 * memprintf(&err, "parser said : <%s>\n", *err);
3560 * ...
3561 * free(*err);
3562 *
3563 * This means that <err> must be initialized to NULL before first invocation.
3564 * The return value also holds the allocated string, which eases error checking
3565 * and immediate consumption. If the output pointer is not used, NULL must be
Willy Tarreaueb6cead2012-09-20 19:43:14 +02003566 * passed instead and it will be ignored. The returned message will then also
3567 * be NULL so that the caller does not have to bother with freeing anything.
Willy Tarreau9a7bea52012-04-27 11:16:50 +02003568 *
3569 * It is also convenient to use it without any free except the last one :
3570 * err = NULL;
3571 * if (!fct1(err)) report(*err);
3572 * if (!fct2(err)) report(*err);
3573 * if (!fct3(err)) report(*err);
3574 * free(*err);
Christopher Faulet93a518f2017-10-24 11:25:33 +02003575 *
3576 * memprintf relies on memvprintf. This last version can be called from any
3577 * function with variadic arguments.
Willy Tarreau9a7bea52012-04-27 11:16:50 +02003578 */
Christopher Faulet93a518f2017-10-24 11:25:33 +02003579char *memvprintf(char **out, const char *format, va_list orig_args)
Willy Tarreau9a7bea52012-04-27 11:16:50 +02003580{
3581 va_list args;
3582 char *ret = NULL;
3583 int allocated = 0;
3584 int needed = 0;
3585
Willy Tarreaueb6cead2012-09-20 19:43:14 +02003586 if (!out)
3587 return NULL;
3588
Willy Tarreau9a7bea52012-04-27 11:16:50 +02003589 do {
Willy Tarreaue0609f52019-03-29 19:13:23 +01003590 char buf1;
3591
Willy Tarreau9a7bea52012-04-27 11:16:50 +02003592 /* vsnprintf() will return the required length even when the
3593 * target buffer is NULL. We do this in a loop just in case
3594 * intermediate evaluations get wrong.
3595 */
Christopher Faulet93a518f2017-10-24 11:25:33 +02003596 va_copy(args, orig_args);
Willy Tarreaue0609f52019-03-29 19:13:23 +01003597 needed = vsnprintf(ret ? ret : &buf1, allocated, format, args);
Willy Tarreau9a7bea52012-04-27 11:16:50 +02003598 va_end(args);
Willy Tarreau1b2fed62013-04-01 22:48:54 +02003599 if (needed < allocated) {
3600 /* Note: on Solaris 8, the first iteration always
3601 * returns -1 if allocated is zero, so we force a
3602 * retry.
3603 */
3604 if (!allocated)
3605 needed = 0;
3606 else
3607 break;
3608 }
Willy Tarreau9a7bea52012-04-27 11:16:50 +02003609
Willy Tarreau1b2fed62013-04-01 22:48:54 +02003610 allocated = needed + 1;
Hubert Verstraete831962e2016-06-28 22:44:26 +02003611 ret = my_realloc2(ret, allocated);
Willy Tarreau9a7bea52012-04-27 11:16:50 +02003612 } while (ret);
3613
3614 if (needed < 0) {
3615 /* an error was encountered */
3616 free(ret);
3617 ret = NULL;
3618 }
3619
3620 if (out) {
3621 free(*out);
3622 *out = ret;
3623 }
3624
3625 return ret;
3626}
William Lallemand421f5b52012-02-06 18:15:57 +01003627
Christopher Faulet93a518f2017-10-24 11:25:33 +02003628char *memprintf(char **out, const char *format, ...)
3629{
3630 va_list args;
3631 char *ret = NULL;
3632
3633 va_start(args, format);
3634 ret = memvprintf(out, format, args);
3635 va_end(args);
3636
3637 return ret;
3638}
3639
Willy Tarreau21c705b2012-09-14 11:40:36 +02003640/* Used to add <level> spaces before each line of <out>, unless there is only one line.
3641 * The input argument is automatically freed and reassigned. The result will have to be
Willy Tarreau70eec382012-10-10 08:56:47 +02003642 * freed by the caller. It also supports being passed a NULL which results in the same
3643 * output.
Willy Tarreau21c705b2012-09-14 11:40:36 +02003644 * Example of use :
3645 * parse(cmd, &err); (callee: memprintf(&err, ...))
3646 * fprintf(stderr, "Parser said: %s\n", indent_error(&err));
3647 * free(err);
3648 */
3649char *indent_msg(char **out, int level)
3650{
3651 char *ret, *in, *p;
3652 int needed = 0;
3653 int lf = 0;
3654 int lastlf = 0;
3655 int len;
3656
Willy Tarreau70eec382012-10-10 08:56:47 +02003657 if (!out || !*out)
3658 return NULL;
3659
Willy Tarreau21c705b2012-09-14 11:40:36 +02003660 in = *out - 1;
3661 while ((in = strchr(in + 1, '\n')) != NULL) {
3662 lastlf = in - *out;
3663 lf++;
3664 }
3665
3666 if (!lf) /* single line, no LF, return it as-is */
3667 return *out;
3668
3669 len = strlen(*out);
3670
3671 if (lf == 1 && lastlf == len - 1) {
3672 /* single line, LF at end, strip it and return as-is */
3673 (*out)[lastlf] = 0;
3674 return *out;
3675 }
3676
3677 /* OK now we have at least one LF, we need to process the whole string
3678 * as a multi-line string. What we'll do :
3679 * - prefix with an LF if there is none
3680 * - add <level> spaces before each line
3681 * This means at most ( 1 + level + (len-lf) + lf*<1+level) ) =
3682 * 1 + level + len + lf * level = 1 + level * (lf + 1) + len.
3683 */
3684
3685 needed = 1 + level * (lf + 1) + len + 1;
3686 p = ret = malloc(needed);
3687 in = *out;
3688
3689 /* skip initial LFs */
3690 while (*in == '\n')
3691 in++;
3692
3693 /* copy each line, prefixed with LF and <level> spaces, and without the trailing LF */
3694 while (*in) {
3695 *p++ = '\n';
3696 memset(p, ' ', level);
3697 p += level;
3698 do {
3699 *p++ = *in++;
3700 } while (*in && *in != '\n');
3701 if (*in)
3702 in++;
3703 }
3704 *p = 0;
3705
3706 free(*out);
3707 *out = ret;
3708
3709 return ret;
3710}
3711
Willy Tarreaua2c99112019-08-21 13:17:37 +02003712/* makes a copy of message <in> into <out>, with each line prefixed with <pfx>
3713 * and end of lines replaced with <eol> if not 0. The first line to indent has
3714 * to be indicated in <first> (starts at zero), so that it is possible to skip
3715 * indenting the first line if it has to be appended after an existing message.
3716 * Empty strings are never indented, and NULL strings are considered empty both
3717 * for <in> and <pfx>. It returns non-zero if an EOL was appended as the last
3718 * character, non-zero otherwise.
3719 */
3720int append_prefixed_str(struct buffer *out, const char *in, const char *pfx, char eol, int first)
3721{
3722 int bol, lf;
3723 int pfxlen = pfx ? strlen(pfx) : 0;
3724
3725 if (!in)
3726 return 0;
3727
3728 bol = 1;
3729 lf = 0;
3730 while (*in) {
3731 if (bol && pfxlen) {
3732 if (first > 0)
3733 first--;
3734 else
3735 b_putblk(out, pfx, pfxlen);
3736 bol = 0;
3737 }
3738
3739 lf = (*in == '\n');
3740 bol |= lf;
3741 b_putchr(out, (lf && eol) ? eol : *in);
3742 in++;
3743 }
3744 return lf;
3745}
3746
Willy Tarreau9d22e562019-03-29 18:49:09 +01003747/* removes environment variable <name> from the environment as found in
3748 * environ. This is only provided as an alternative for systems without
3749 * unsetenv() (old Solaris and AIX versions). THIS IS NOT THREAD SAFE.
3750 * The principle is to scan environ for each occurence of variable name
3751 * <name> and to replace the matching pointers with the last pointer of
3752 * the array (since variables are not ordered).
3753 * It always returns 0 (success).
3754 */
3755int my_unsetenv(const char *name)
3756{
3757 extern char **environ;
3758 char **p = environ;
3759 int vars;
3760 int next;
3761 int len;
3762
3763 len = strlen(name);
3764 for (vars = 0; p[vars]; vars++)
3765 ;
3766 next = 0;
3767 while (next < vars) {
3768 if (strncmp(p[next], name, len) != 0 || p[next][len] != '=') {
3769 next++;
3770 continue;
3771 }
3772 if (next < vars - 1)
3773 p[next] = p[vars - 1];
3774 p[--vars] = NULL;
3775 }
3776 return 0;
3777}
3778
Willy Tarreaudad36a32013-03-11 01:20:04 +01003779/* Convert occurrences of environment variables in the input string to their
3780 * corresponding value. A variable is identified as a series of alphanumeric
3781 * characters or underscores following a '$' sign. The <in> string must be
3782 * free()able. NULL returns NULL. The resulting string might be reallocated if
3783 * some expansion is made. Variable names may also be enclosed into braces if
3784 * needed (eg: to concatenate alphanum characters).
3785 */
3786char *env_expand(char *in)
3787{
3788 char *txt_beg;
3789 char *out;
3790 char *txt_end;
3791 char *var_beg;
3792 char *var_end;
3793 char *value;
3794 char *next;
3795 int out_len;
3796 int val_len;
3797
3798 if (!in)
3799 return in;
3800
3801 value = out = NULL;
3802 out_len = 0;
3803
3804 txt_beg = in;
3805 do {
3806 /* look for next '$' sign in <in> */
3807 for (txt_end = txt_beg; *txt_end && *txt_end != '$'; txt_end++);
3808
3809 if (!*txt_end && !out) /* end and no expansion performed */
3810 return in;
3811
3812 val_len = 0;
3813 next = txt_end;
3814 if (*txt_end == '$') {
3815 char save;
3816
3817 var_beg = txt_end + 1;
3818 if (*var_beg == '{')
3819 var_beg++;
3820
3821 var_end = var_beg;
Willy Tarreau90807112020-02-25 08:16:33 +01003822 while (isalnum((unsigned char)*var_end) || *var_end == '_') {
Willy Tarreaudad36a32013-03-11 01:20:04 +01003823 var_end++;
3824 }
3825
3826 next = var_end;
3827 if (*var_end == '}' && (var_beg > txt_end + 1))
3828 next++;
3829
3830 /* get value of the variable name at this location */
3831 save = *var_end;
3832 *var_end = '\0';
3833 value = getenv(var_beg);
3834 *var_end = save;
3835 val_len = value ? strlen(value) : 0;
3836 }
3837
Hubert Verstraete831962e2016-06-28 22:44:26 +02003838 out = my_realloc2(out, out_len + (txt_end - txt_beg) + val_len + 1);
Willy Tarreaudad36a32013-03-11 01:20:04 +01003839 if (txt_end > txt_beg) {
3840 memcpy(out + out_len, txt_beg, txt_end - txt_beg);
3841 out_len += txt_end - txt_beg;
3842 }
3843 if (val_len) {
3844 memcpy(out + out_len, value, val_len);
3845 out_len += val_len;
3846 }
3847 out[out_len] = 0;
3848 txt_beg = next;
3849 } while (*txt_beg);
3850
3851 /* here we know that <out> was allocated and that we don't need <in> anymore */
3852 free(in);
3853 return out;
3854}
3855
de Lafond Guillaume88c278f2013-04-15 19:27:10 +02003856
3857/* same as strstr() but case-insensitive and with limit length */
3858const char *strnistr(const char *str1, int len_str1, const char *str2, int len_str2)
3859{
3860 char *pptr, *sptr, *start;
Willy Tarreauc8746532014-05-28 23:05:07 +02003861 unsigned int slen, plen;
3862 unsigned int tmp1, tmp2;
de Lafond Guillaume88c278f2013-04-15 19:27:10 +02003863
3864 if (str1 == NULL || len_str1 == 0) // search pattern into an empty string => search is not found
3865 return NULL;
3866
3867 if (str2 == NULL || len_str2 == 0) // pattern is empty => every str1 match
3868 return str1;
3869
3870 if (len_str1 < len_str2) // pattern is longer than string => search is not found
3871 return NULL;
3872
3873 for (tmp1 = 0, start = (char *)str1, pptr = (char *)str2, slen = len_str1, plen = len_str2; slen >= plen; start++, slen--) {
3874 while (toupper(*start) != toupper(*str2)) {
3875 start++;
3876 slen--;
3877 tmp1++;
3878
3879 if (tmp1 >= len_str1)
3880 return NULL;
3881
3882 /* if pattern longer than string */
3883 if (slen < plen)
3884 return NULL;
3885 }
3886
3887 sptr = start;
3888 pptr = (char *)str2;
3889
3890 tmp2 = 0;
3891 while (toupper(*sptr) == toupper(*pptr)) {
3892 sptr++;
3893 pptr++;
3894 tmp2++;
3895
3896 if (*pptr == '\0' || tmp2 == len_str2) /* end of pattern found */
3897 return start;
3898 if (*sptr == '\0' || tmp2 == len_str1) /* end of string found and the pattern is not fully found */
3899 return NULL;
3900 }
3901 }
3902 return NULL;
3903}
3904
Thierry FOURNIER317e1c42014-08-12 10:20:47 +02003905/* This function read the next valid utf8 char.
3906 * <s> is the byte srray to be decode, <len> is its length.
3907 * The function returns decoded char encoded like this:
3908 * The 4 msb are the return code (UTF8_CODE_*), the 4 lsb
3909 * are the length read. The decoded character is stored in <c>.
3910 */
3911unsigned char utf8_next(const char *s, int len, unsigned int *c)
3912{
3913 const unsigned char *p = (unsigned char *)s;
3914 int dec;
3915 unsigned char code = UTF8_CODE_OK;
3916
3917 if (len < 1)
3918 return UTF8_CODE_OK;
3919
3920 /* Check the type of UTF8 sequence
3921 *
3922 * 0... .... 0x00 <= x <= 0x7f : 1 byte: ascii char
3923 * 10.. .... 0x80 <= x <= 0xbf : invalid sequence
3924 * 110. .... 0xc0 <= x <= 0xdf : 2 bytes
3925 * 1110 .... 0xe0 <= x <= 0xef : 3 bytes
3926 * 1111 0... 0xf0 <= x <= 0xf7 : 4 bytes
3927 * 1111 10.. 0xf8 <= x <= 0xfb : 5 bytes
3928 * 1111 110. 0xfc <= x <= 0xfd : 6 bytes
3929 * 1111 111. 0xfe <= x <= 0xff : invalid sequence
3930 */
3931 switch (*p) {
3932 case 0x00 ... 0x7f:
3933 *c = *p;
3934 return UTF8_CODE_OK | 1;
3935
3936 case 0x80 ... 0xbf:
3937 *c = *p;
3938 return UTF8_CODE_BADSEQ | 1;
3939
3940 case 0xc0 ... 0xdf:
3941 if (len < 2) {
3942 *c = *p;
3943 return UTF8_CODE_BADSEQ | 1;
3944 }
3945 *c = *p & 0x1f;
3946 dec = 1;
3947 break;
3948
3949 case 0xe0 ... 0xef:
3950 if (len < 3) {
3951 *c = *p;
3952 return UTF8_CODE_BADSEQ | 1;
3953 }
3954 *c = *p & 0x0f;
3955 dec = 2;
3956 break;
3957
3958 case 0xf0 ... 0xf7:
3959 if (len < 4) {
3960 *c = *p;
3961 return UTF8_CODE_BADSEQ | 1;
3962 }
3963 *c = *p & 0x07;
3964 dec = 3;
3965 break;
3966
3967 case 0xf8 ... 0xfb:
3968 if (len < 5) {
3969 *c = *p;
3970 return UTF8_CODE_BADSEQ | 1;
3971 }
3972 *c = *p & 0x03;
3973 dec = 4;
3974 break;
3975
3976 case 0xfc ... 0xfd:
3977 if (len < 6) {
3978 *c = *p;
3979 return UTF8_CODE_BADSEQ | 1;
3980 }
3981 *c = *p & 0x01;
3982 dec = 5;
3983 break;
3984
3985 case 0xfe ... 0xff:
3986 default:
3987 *c = *p;
3988 return UTF8_CODE_BADSEQ | 1;
3989 }
3990
3991 p++;
3992
3993 while (dec > 0) {
3994
3995 /* need 0x10 for the 2 first bits */
3996 if ( ( *p & 0xc0 ) != 0x80 )
3997 return UTF8_CODE_BADSEQ | ((p-(unsigned char *)s)&0xffff);
3998
3999 /* add data at char */
4000 *c = ( *c << 6 ) | ( *p & 0x3f );
4001
4002 dec--;
4003 p++;
4004 }
4005
4006 /* Check ovelong encoding.
4007 * 1 byte : 5 + 6 : 11 : 0x80 ... 0x7ff
4008 * 2 bytes : 4 + 6 + 6 : 16 : 0x800 ... 0xffff
4009 * 3 bytes : 3 + 6 + 6 + 6 : 21 : 0x10000 ... 0x1fffff
4010 */
Thierry FOURNIER9e7ec082015-03-12 19:32:38 +01004011 if (( *c <= 0x7f && (p-(unsigned char *)s) > 1) ||
Thierry FOURNIER317e1c42014-08-12 10:20:47 +02004012 (*c >= 0x80 && *c <= 0x7ff && (p-(unsigned char *)s) > 2) ||
4013 (*c >= 0x800 && *c <= 0xffff && (p-(unsigned char *)s) > 3) ||
4014 (*c >= 0x10000 && *c <= 0x1fffff && (p-(unsigned char *)s) > 4))
4015 code |= UTF8_CODE_OVERLONG;
4016
4017 /* Check invalid UTF8 range. */
4018 if ((*c >= 0xd800 && *c <= 0xdfff) ||
4019 (*c >= 0xfffe && *c <= 0xffff))
4020 code |= UTF8_CODE_INVRANGE;
4021
4022 return code | ((p-(unsigned char *)s)&0x0f);
4023}
4024
Maxime de Roucydc887852016-05-13 23:52:54 +02004025/* append a copy of string <str> (in a wordlist) at the end of the list <li>
4026 * On failure : return 0 and <err> filled with an error message.
4027 * The caller is responsible for freeing the <err> and <str> copy
4028 * memory area using free()
4029 */
4030int list_append_word(struct list *li, const char *str, char **err)
4031{
4032 struct wordlist *wl;
4033
4034 wl = calloc(1, sizeof(*wl));
4035 if (!wl) {
4036 memprintf(err, "out of memory");
4037 goto fail_wl;
4038 }
4039
4040 wl->s = strdup(str);
4041 if (!wl->s) {
4042 memprintf(err, "out of memory");
4043 goto fail_wl_s;
4044 }
4045
4046 LIST_ADDQ(li, &wl->list);
4047
4048 return 1;
4049
4050fail_wl_s:
4051 free(wl->s);
4052fail_wl:
4053 free(wl);
4054 return 0;
4055}
4056
Willy Tarreau37101052019-05-20 16:48:20 +02004057/* indicates if a memory location may safely be read or not. The trick consists
4058 * in performing a harmless syscall using this location as an input and letting
4059 * the operating system report whether it's OK or not. For this we have the
4060 * stat() syscall, which will return EFAULT when the memory location supposed
4061 * to contain the file name is not readable. If it is readable it will then
4062 * either return 0 if the area contains an existing file name, or -1 with
4063 * another code. This must not be abused, and some audit systems might detect
4064 * this as abnormal activity. It's used only for unsafe dumps.
4065 */
4066int may_access(const void *ptr)
4067{
4068 struct stat buf;
4069
4070 if (stat(ptr, &buf) == 0)
4071 return 1;
4072 if (errno == EFAULT)
4073 return 0;
4074 return 1;
4075}
4076
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004077/* print a string of text buffer to <out>. The format is :
4078 * Non-printable chars \t, \n, \r and \e are * encoded in C format.
4079 * Other non-printable chars are encoded "\xHH". Space, '\', and '=' are also escaped.
4080 * Print stopped if null char or <bsize> is reached, or if no more place in the chunk.
4081 */
Willy Tarreau83061a82018-07-13 11:56:34 +02004082int dump_text(struct buffer *out, const char *buf, int bsize)
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004083{
4084 unsigned char c;
4085 int ptr = 0;
4086
4087 while (buf[ptr] && ptr < bsize) {
4088 c = buf[ptr];
Willy Tarreau90807112020-02-25 08:16:33 +01004089 if (isprint((unsigned char)c) && isascii((unsigned char)c) && c != '\\' && c != ' ' && c != '=') {
Willy Tarreau843b7cb2018-07-13 10:54:26 +02004090 if (out->data > out->size - 1)
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004091 break;
Willy Tarreau843b7cb2018-07-13 10:54:26 +02004092 out->area[out->data++] = c;
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004093 }
4094 else if (c == '\t' || c == '\n' || c == '\r' || c == '\e' || c == '\\' || c == ' ' || c == '=') {
Willy Tarreau843b7cb2018-07-13 10:54:26 +02004095 if (out->data > out->size - 2)
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004096 break;
Willy Tarreau843b7cb2018-07-13 10:54:26 +02004097 out->area[out->data++] = '\\';
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004098 switch (c) {
4099 case ' ': c = ' '; break;
4100 case '\t': c = 't'; break;
4101 case '\n': c = 'n'; break;
4102 case '\r': c = 'r'; break;
4103 case '\e': c = 'e'; break;
4104 case '\\': c = '\\'; break;
4105 case '=': c = '='; break;
4106 }
Willy Tarreau843b7cb2018-07-13 10:54:26 +02004107 out->area[out->data++] = c;
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004108 }
4109 else {
Willy Tarreau843b7cb2018-07-13 10:54:26 +02004110 if (out->data > out->size - 4)
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004111 break;
Willy Tarreau843b7cb2018-07-13 10:54:26 +02004112 out->area[out->data++] = '\\';
4113 out->area[out->data++] = 'x';
4114 out->area[out->data++] = hextab[(c >> 4) & 0xF];
4115 out->area[out->data++] = hextab[c & 0xF];
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004116 }
4117 ptr++;
4118 }
4119
4120 return ptr;
4121}
4122
4123/* print a buffer in hexa.
4124 * Print stopped if <bsize> is reached, or if no more place in the chunk.
4125 */
Willy Tarreau83061a82018-07-13 11:56:34 +02004126int dump_binary(struct buffer *out, const char *buf, int bsize)
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004127{
4128 unsigned char c;
4129 int ptr = 0;
4130
4131 while (ptr < bsize) {
4132 c = buf[ptr];
4133
Willy Tarreau843b7cb2018-07-13 10:54:26 +02004134 if (out->data > out->size - 2)
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004135 break;
Willy Tarreau843b7cb2018-07-13 10:54:26 +02004136 out->area[out->data++] = hextab[(c >> 4) & 0xF];
4137 out->area[out->data++] = hextab[c & 0xF];
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004138
4139 ptr++;
4140 }
4141 return ptr;
4142}
4143
Willy Tarreau9fc5dcb2019-05-20 16:13:40 +02004144/* Appends into buffer <out> a hex dump of memory area <buf> for <len> bytes,
4145 * prepending each line with prefix <pfx>. The output is *not* initialized.
4146 * The output will not wrap pas the buffer's end so it is more optimal if the
4147 * caller makes sure the buffer is aligned first. A trailing zero will always
4148 * be appended (and not counted) if there is room for it. The caller must make
Willy Tarreau37101052019-05-20 16:48:20 +02004149 * sure that the area is dumpable first. If <unsafe> is non-null, the memory
4150 * locations are checked first for being readable.
Willy Tarreau9fc5dcb2019-05-20 16:13:40 +02004151 */
Willy Tarreau37101052019-05-20 16:48:20 +02004152void dump_hex(struct buffer *out, const char *pfx, const void *buf, int len, int unsafe)
Willy Tarreau9fc5dcb2019-05-20 16:13:40 +02004153{
4154 const unsigned char *d = buf;
4155 int i, j, start;
4156
4157 d = (const unsigned char *)(((unsigned long)buf) & -16);
4158 start = ((unsigned long)buf) & 15;
4159
4160 for (i = 0; i < start + len; i += 16) {
4161 chunk_appendf(out, (sizeof(void *) == 4) ? "%s%8p: " : "%s%16p: ", pfx, d + i);
4162
Willy Tarreau37101052019-05-20 16:48:20 +02004163 // 0: unchecked, 1: checked safe, 2: danger
4164 unsafe = !!unsafe;
4165 if (unsafe && !may_access(d + i))
4166 unsafe = 2;
4167
Willy Tarreau9fc5dcb2019-05-20 16:13:40 +02004168 for (j = 0; j < 16; j++) {
Willy Tarreau37101052019-05-20 16:48:20 +02004169 if ((i + j < start) || (i + j >= start + len))
Willy Tarreau9fc5dcb2019-05-20 16:13:40 +02004170 chunk_strcat(out, "'' ");
Willy Tarreau37101052019-05-20 16:48:20 +02004171 else if (unsafe > 1)
4172 chunk_strcat(out, "** ");
4173 else
4174 chunk_appendf(out, "%02x ", d[i + j]);
Willy Tarreau9fc5dcb2019-05-20 16:13:40 +02004175
4176 if (j == 7)
4177 chunk_strcat(out, "- ");
4178 }
4179 chunk_strcat(out, " ");
4180 for (j = 0; j < 16; j++) {
Willy Tarreau37101052019-05-20 16:48:20 +02004181 if ((i + j < start) || (i + j >= start + len))
Willy Tarreau9fc5dcb2019-05-20 16:13:40 +02004182 chunk_strcat(out, "'");
Willy Tarreau37101052019-05-20 16:48:20 +02004183 else if (unsafe > 1)
4184 chunk_strcat(out, "*");
Willy Tarreau90807112020-02-25 08:16:33 +01004185 else if (isprint((unsigned char)d[i + j]))
Willy Tarreau37101052019-05-20 16:48:20 +02004186 chunk_appendf(out, "%c", d[i + j]);
4187 else
4188 chunk_strcat(out, ".");
Willy Tarreau9fc5dcb2019-05-20 16:13:40 +02004189 }
4190 chunk_strcat(out, "\n");
4191 }
4192}
4193
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004194/* print a line of text buffer (limited to 70 bytes) to <out>. The format is :
4195 * <2 spaces> <offset=5 digits> <space or plus> <space> <70 chars max> <\n>
4196 * which is 60 chars per line. Non-printable chars \t, \n, \r and \e are
4197 * encoded in C format. Other non-printable chars are encoded "\xHH". Original
4198 * lines are respected within the limit of 70 output chars. Lines that are
4199 * continuation of a previous truncated line begin with "+" instead of " "
4200 * after the offset. The new pointer is returned.
4201 */
Willy Tarreau83061a82018-07-13 11:56:34 +02004202int dump_text_line(struct buffer *out, const char *buf, int bsize, int len,
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004203 int *line, int ptr)
4204{
4205 int end;
4206 unsigned char c;
4207
Willy Tarreau843b7cb2018-07-13 10:54:26 +02004208 end = out->data + 80;
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004209 if (end > out->size)
4210 return ptr;
4211
4212 chunk_appendf(out, " %05d%c ", ptr, (ptr == *line) ? ' ' : '+');
4213
4214 while (ptr < len && ptr < bsize) {
4215 c = buf[ptr];
Willy Tarreau90807112020-02-25 08:16:33 +01004216 if (isprint((unsigned char)c) && isascii((unsigned char)c) && c != '\\') {
Willy Tarreau843b7cb2018-07-13 10:54:26 +02004217 if (out->data > end - 2)
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004218 break;
Willy Tarreau843b7cb2018-07-13 10:54:26 +02004219 out->area[out->data++] = c;
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004220 } else if (c == '\t' || c == '\n' || c == '\r' || c == '\e' || c == '\\') {
Willy Tarreau843b7cb2018-07-13 10:54:26 +02004221 if (out->data > end - 3)
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004222 break;
Willy Tarreau843b7cb2018-07-13 10:54:26 +02004223 out->area[out->data++] = '\\';
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004224 switch (c) {
4225 case '\t': c = 't'; break;
4226 case '\n': c = 'n'; break;
4227 case '\r': c = 'r'; break;
4228 case '\e': c = 'e'; break;
4229 case '\\': c = '\\'; break;
4230 }
Willy Tarreau843b7cb2018-07-13 10:54:26 +02004231 out->area[out->data++] = c;
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004232 } else {
Willy Tarreau843b7cb2018-07-13 10:54:26 +02004233 if (out->data > end - 5)
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004234 break;
Willy Tarreau843b7cb2018-07-13 10:54:26 +02004235 out->area[out->data++] = '\\';
4236 out->area[out->data++] = 'x';
4237 out->area[out->data++] = hextab[(c >> 4) & 0xF];
4238 out->area[out->data++] = hextab[c & 0xF];
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004239 }
4240 if (buf[ptr++] == '\n') {
4241 /* we had a line break, let's return now */
Willy Tarreau843b7cb2018-07-13 10:54:26 +02004242 out->area[out->data++] = '\n';
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004243 *line = ptr;
4244 return ptr;
4245 }
4246 }
4247 /* we have an incomplete line, we return it as-is */
Willy Tarreau843b7cb2018-07-13 10:54:26 +02004248 out->area[out->data++] = '\n';
Willy Tarreau97c2ae12016-11-22 18:00:20 +01004249 return ptr;
4250}
4251
Willy Tarreau0ebb5112016-12-05 00:10:57 +01004252/* displays a <len> long memory block at <buf>, assuming first byte of <buf>
Willy Tarreaued936c52017-04-27 18:03:20 +02004253 * has address <baseaddr>. String <pfx> may be placed as a prefix in front of
4254 * each line. It may be NULL if unused. The output is emitted to file <out>.
Willy Tarreau0ebb5112016-12-05 00:10:57 +01004255 */
Willy Tarreaued936c52017-04-27 18:03:20 +02004256void debug_hexdump(FILE *out, const char *pfx, const char *buf,
4257 unsigned int baseaddr, int len)
Willy Tarreau0ebb5112016-12-05 00:10:57 +01004258{
Willy Tarreau73459792017-04-11 07:58:08 +02004259 unsigned int i;
4260 int b, j;
Willy Tarreau0ebb5112016-12-05 00:10:57 +01004261
4262 for (i = 0; i < (len + (baseaddr & 15)); i += 16) {
4263 b = i - (baseaddr & 15);
Willy Tarreaued936c52017-04-27 18:03:20 +02004264 fprintf(out, "%s%08x: ", pfx ? pfx : "", i + (baseaddr & ~15));
Willy Tarreau0ebb5112016-12-05 00:10:57 +01004265 for (j = 0; j < 8; j++) {
4266 if (b + j >= 0 && b + j < len)
4267 fprintf(out, "%02x ", (unsigned char)buf[b + j]);
4268 else
4269 fprintf(out, " ");
4270 }
4271
4272 if (b + j >= 0 && b + j < len)
4273 fputc('-', out);
4274 else
4275 fputc(' ', out);
4276
4277 for (j = 8; j < 16; j++) {
4278 if (b + j >= 0 && b + j < len)
4279 fprintf(out, " %02x", (unsigned char)buf[b + j]);
4280 else
4281 fprintf(out, " ");
4282 }
4283
4284 fprintf(out, " ");
4285 for (j = 0; j < 16; j++) {
4286 if (b + j >= 0 && b + j < len) {
4287 if (isprint((unsigned char)buf[b + j]))
4288 fputc((unsigned char)buf[b + j], out);
4289 else
4290 fputc('.', out);
4291 }
4292 else
4293 fputc(' ', out);
4294 }
4295 fputc('\n', out);
4296 }
4297}
4298
Frédéric Lécaille3b717162019-02-25 15:04:22 +01004299/*
4300 * Allocate an array of unsigned int with <nums> as address from <str> string
4301 * made of integer sepereated by dot characters.
4302 *
4303 * First, initializes the value with <sz> as address to 0 and initializes the
4304 * array with <nums> as address to NULL. Then allocates the array with <nums> as
4305 * address updating <sz> pointed value to the size of this array.
4306 *
4307 * Returns 1 if succeeded, 0 if not.
4308 */
4309int parse_dotted_uints(const char *str, unsigned int **nums, size_t *sz)
4310{
4311 unsigned int *n;
4312 const char *s, *end;
4313
4314 s = str;
4315 *sz = 0;
4316 end = str + strlen(str);
4317 *nums = n = NULL;
4318
4319 while (1) {
4320 unsigned int r;
4321
4322 if (s >= end)
4323 break;
4324
4325 r = read_uint(&s, end);
4326 /* Expected characters after having read an uint: '\0' or '.',
4327 * if '.', must not be terminal.
4328 */
4329 if (*s != '\0'&& (*s++ != '.' || s == end))
4330 return 0;
4331
Frédéric Lécaille12a71842019-02-26 18:19:48 +01004332 n = my_realloc2(n, (*sz + 1) * sizeof *n);
Frédéric Lécaille3b717162019-02-25 15:04:22 +01004333 if (!n)
4334 return 0;
4335
4336 n[(*sz)++] = r;
4337 }
4338 *nums = n;
4339
4340 return 1;
4341}
4342
Willy Tarreau4d589e72019-08-23 19:02:26 +02004343
4344/* returns the number of bytes needed to encode <v> as a varint. An inline
4345 * version exists for use with constants (__varint_bytes()).
4346 */
4347int varint_bytes(uint64_t v)
4348{
4349 int len = 1;
4350
4351 if (v >= 240) {
4352 v = (v - 240) >> 4;
4353 while (1) {
4354 len++;
4355 if (v < 128)
4356 break;
4357 v = (v - 128) >> 7;
4358 }
4359 }
4360 return len;
4361}
4362
Willy Tarreau12963822017-10-24 10:54:08 +02004363/* do nothing, just a placeholder for debugging calls, the real one is in trace.c */
Willy Tarreau42a66212019-06-04 16:02:26 +02004364#ifndef USE_OBSOLETE_LINKER
Willy Tarreau12963822017-10-24 10:54:08 +02004365__attribute__((weak,format(printf, 1, 2)))
Willy Tarreau42a66212019-06-04 16:02:26 +02004366#endif
Willy Tarreau12963822017-10-24 10:54:08 +02004367void trace(char *msg, ...)
4368{
4369}
4370
Willy Tarreaubaaee002006-06-26 02:48:02 +02004371/*
4372 * Local variables:
4373 * c-indent-level: 8
4374 * c-basic-offset: 8
4375 * End:
4376 */