0
|
1
|
|
2 /*
|
|
3 * Copyright (C) Igor Sysoev
|
|
4 */
|
|
5
|
|
6
|
|
7 #include <ngx_config.h>
|
|
8 #include <ngx_core.h>
|
|
9
|
|
10
|
416
|
11 static u_char *ngx_sprintf_num(u_char *buf, u_char *last, uint64_t ui64,
|
|
12 u_char zero, ngx_uint_t hexadecimal, ngx_uint_t width);
|
|
13
|
|
14
|
392
|
15 void
|
|
16 ngx_strlow(u_char *dst, u_char *src, size_t n)
|
|
17 {
|
540
|
18 while (n) {
|
392
|
19 *dst = ngx_tolower(*src);
|
|
20 dst++;
|
|
21 src++;
|
540
|
22 n--;
|
392
|
23 }
|
|
24 }
|
|
25
|
|
26
|
42
|
27 u_char *
|
|
28 ngx_cpystrn(u_char *dst, u_char *src, size_t n)
|
0
|
29 {
|
|
30 if (n == 0) {
|
|
31 return dst;
|
|
32 }
|
|
33
|
498
|
34 while (--n) {
|
0
|
35 *dst = *src;
|
|
36
|
|
37 if (*dst == '\0') {
|
|
38 return dst;
|
|
39 }
|
498
|
40
|
|
41 dst++;
|
|
42 src++;
|
0
|
43 }
|
|
44
|
|
45 *dst = '\0';
|
|
46
|
|
47 return dst;
|
|
48 }
|
|
49
|
|
50
|
42
|
51 u_char *
|
|
52 ngx_pstrdup(ngx_pool_t *pool, ngx_str_t *src)
|
34
|
53 {
|
|
54 u_char *dst;
|
|
55
|
382
|
56 dst = ngx_pnalloc(pool, src->len);
|
50
|
57 if (dst == NULL) {
|
34
|
58 return NULL;
|
|
59 }
|
|
60
|
|
61 ngx_memcpy(dst, src->data, src->len);
|
|
62
|
|
63 return dst;
|
|
64 }
|
|
65
|
|
66
|
4
|
67 /*
|
|
68 * supported formats:
|
22
|
69 * %[0][width][x][X]O off_t
|
10
|
70 * %[0][width]T time_t
|
|
71 * %[0][width][u][x|X]z ssize_t/size_t
|
|
72 * %[0][width][u][x|X]d int/u_int
|
|
73 * %[0][width][u][x|X]l long
|
|
74 * %[0][width|m][u][x|X]i ngx_int_t/ngx_uint_t
|
|
75 * %[0][width][u][x|X]D int32_t/uint32_t
|
|
76 * %[0][width][u][x|X]L int64_t/uint64_t
|
44
|
77 * %[0][width|m][u][x|X]A ngx_atomic_int_t/ngx_atomic_uint_t
|
570
|
78 * %[0][width][.width]f double, max valid number fits to %18.15f
|
10
|
79 * %P ngx_pid_t
|
106
|
80 * %M ngx_msec_t
|
10
|
81 * %r rlim_t
|
328
|
82 * %p void *
|
|
83 * %V ngx_str_t *
|
|
84 * %v ngx_variable_value_t *
|
10
|
85 * %s null-terminated string
|
358
|
86 * %*s length and string
|
10
|
87 * %Z '\0'
|
74
|
88 * %N '\n'
|
10
|
89 * %c char
|
|
90 * %% %
|
4
|
91 *
|
10
|
92 * reserved:
|
|
93 * %t ptrdiff_t
|
518
|
94 * %S null-terminated wchar string
|
10
|
95 * %C wchar
|
4
|
96 */
|
|
97
|
10
|
98
|
52
|
99 u_char * ngx_cdecl
|
42
|
100 ngx_sprintf(u_char *buf, const char *fmt, ...)
|
10
|
101 {
|
|
102 u_char *p;
|
|
103 va_list args;
|
|
104
|
|
105 va_start(args, fmt);
|
484
|
106 p = ngx_vslprintf(buf, (void *) -1, fmt, args);
|
10
|
107 va_end(args);
|
|
108
|
|
109 return p;
|
|
110 }
|
|
111
|
|
112
|
52
|
113 u_char * ngx_cdecl
|
42
|
114 ngx_snprintf(u_char *buf, size_t max, const char *fmt, ...)
|
4
|
115 {
|
10
|
116 u_char *p;
|
|
117 va_list args;
|
|
118
|
|
119 va_start(args, fmt);
|
484
|
120 p = ngx_vslprintf(buf, buf + max, fmt, args);
|
|
121 va_end(args);
|
|
122
|
|
123 return p;
|
|
124 }
|
|
125
|
|
126
|
|
127 u_char * ngx_cdecl
|
|
128 ngx_slprintf(u_char *buf, u_char *last, const char *fmt, ...)
|
|
129 {
|
|
130 u_char *p;
|
|
131 va_list args;
|
|
132
|
|
133 va_start(args, fmt);
|
|
134 p = ngx_vslprintf(buf, last, fmt, args);
|
10
|
135 va_end(args);
|
|
136
|
|
137 return p;
|
|
138 }
|
|
139
|
4
|
140
|
42
|
141 u_char *
|
484
|
142 ngx_vslprintf(u_char *buf, u_char *last, const char *fmt, va_list args)
|
10
|
143 {
|
484
|
144 u_char *p, zero;
|
320
|
145 int d;
|
570
|
146 double f, scale;
|
358
|
147 size_t len, slen;
|
320
|
148 int64_t i64;
|
|
149 uint64_t ui64;
|
|
150 ngx_msec_t ms;
|
540
|
151 ngx_uint_t width, sign, hex, max_width, frac_width, n;
|
328
|
152 ngx_str_t *v;
|
|
153 ngx_variable_value_t *vv;
|
4
|
154
|
10
|
155 while (*fmt && buf < last) {
|
|
156
|
|
157 /*
|
|
158 * "buf < last" means that we could copy at least one character:
|
|
159 * the plain character, "%%", "%c", and minus without the checking
|
|
160 */
|
|
161
|
4
|
162 if (*fmt == '%') {
|
|
163
|
10
|
164 i64 = 0;
|
|
165 ui64 = 0;
|
|
166
|
|
167 zero = (u_char) ((*++fmt == '0') ? '0' : ' ');
|
4
|
168 width = 0;
|
|
169 sign = 1;
|
416
|
170 hex = 0;
|
42
|
171 max_width = 0;
|
416
|
172 frac_width = 0;
|
364
|
173 slen = (size_t) -1;
|
4
|
174
|
|
175 while (*fmt >= '0' && *fmt <= '9') {
|
|
176 width = width * 10 + *fmt++ - '0';
|
|
177 }
|
|
178
|
|
179
|
|
180 for ( ;; ) {
|
|
181 switch (*fmt) {
|
|
182
|
|
183 case 'u':
|
|
184 sign = 0;
|
|
185 fmt++;
|
|
186 continue;
|
|
187
|
16
|
188 case 'm':
|
42
|
189 max_width = 1;
|
16
|
190 fmt++;
|
|
191 continue;
|
|
192
|
10
|
193 case 'X':
|
416
|
194 hex = 2;
|
10
|
195 sign = 0;
|
|
196 fmt++;
|
|
197 continue;
|
|
198
|
4
|
199 case 'x':
|
416
|
200 hex = 1;
|
10
|
201 sign = 0;
|
4
|
202 fmt++;
|
|
203 continue;
|
|
204
|
416
|
205 case '.':
|
|
206 fmt++;
|
|
207
|
|
208 while (*fmt >= '0' && *fmt <= '9') {
|
|
209 frac_width = frac_width * 10 + *fmt++ - '0';
|
|
210 }
|
|
211
|
|
212 break;
|
|
213
|
358
|
214 case '*':
|
364
|
215 slen = va_arg(args, size_t);
|
358
|
216 fmt++;
|
|
217 continue;
|
|
218
|
4
|
219 default:
|
|
220 break;
|
|
221 }
|
|
222
|
|
223 break;
|
|
224 }
|
|
225
|
|
226
|
|
227 switch (*fmt) {
|
|
228
|
10
|
229 case 'V':
|
328
|
230 v = va_arg(args, ngx_str_t *);
|
4
|
231
|
570
|
232 len = ngx_min(((size_t) (last - buf)), v->len);
|
320
|
233 buf = ngx_cpymem(buf, v->data, len);
|
10
|
234 fmt++;
|
4
|
235
|
10
|
236 continue;
|
4
|
237
|
328
|
238 case 'v':
|
|
239 vv = va_arg(args, ngx_variable_value_t *);
|
|
240
|
570
|
241 len = ngx_min(((size_t) (last - buf)), vv->len);
|
328
|
242 buf = ngx_cpymem(buf, vv->data, len);
|
|
243 fmt++;
|
|
244
|
|
245 continue;
|
|
246
|
4
|
247 case 's':
|
10
|
248 p = va_arg(args, u_char *);
|
4
|
249
|
364
|
250 if (slen == (size_t) -1) {
|
358
|
251 while (*p && buf < last) {
|
|
252 *buf++ = *p++;
|
|
253 }
|
|
254
|
|
255 } else {
|
570
|
256 len = ngx_min(((size_t) (last - buf)), slen);
|
364
|
257 buf = ngx_cpymem(buf, p, len);
|
4
|
258 }
|
358
|
259
|
4
|
260 fmt++;
|
|
261
|
|
262 continue;
|
|
263
|
10
|
264 case 'O':
|
|
265 i64 = (int64_t) va_arg(args, off_t);
|
|
266 sign = 1;
|
|
267 break;
|
|
268
|
|
269 case 'P':
|
|
270 i64 = (int64_t) va_arg(args, ngx_pid_t);
|
|
271 sign = 1;
|
|
272 break;
|
|
273
|
|
274 case 'T':
|
|
275 i64 = (int64_t) va_arg(args, time_t);
|
|
276 sign = 1;
|
|
277 break;
|
|
278
|
106
|
279 case 'M':
|
110
|
280 ms = (ngx_msec_t) va_arg(args, ngx_msec_t);
|
|
281 if ((ngx_msec_int_t) ms == -1) {
|
|
282 sign = 1;
|
|
283 i64 = -1;
|
|
284 } else {
|
|
285 sign = 0;
|
|
286 ui64 = (uint64_t) ms;
|
|
287 }
|
106
|
288 break;
|
|
289
|
10
|
290 case 'z':
|
|
291 if (sign) {
|
|
292 i64 = (int64_t) va_arg(args, ssize_t);
|
|
293 } else {
|
|
294 ui64 = (uint64_t) va_arg(args, size_t);
|
|
295 }
|
|
296 break;
|
|
297
|
|
298 case 'i':
|
|
299 if (sign) {
|
|
300 i64 = (int64_t) va_arg(args, ngx_int_t);
|
|
301 } else {
|
|
302 ui64 = (uint64_t) va_arg(args, ngx_uint_t);
|
|
303 }
|
42
|
304
|
|
305 if (max_width) {
|
|
306 width = NGX_INT_T_LEN;
|
|
307 }
|
|
308
|
10
|
309 break;
|
|
310
|
|
311 case 'd':
|
|
312 if (sign) {
|
|
313 i64 = (int64_t) va_arg(args, int);
|
|
314 } else {
|
|
315 ui64 = (uint64_t) va_arg(args, u_int);
|
|
316 }
|
|
317 break;
|
|
318
|
|
319 case 'l':
|
|
320 if (sign) {
|
|
321 i64 = (int64_t) va_arg(args, long);
|
|
322 } else {
|
|
323 ui64 = (uint64_t) va_arg(args, u_long);
|
|
324 }
|
|
325 break;
|
|
326
|
|
327 case 'D':
|
|
328 if (sign) {
|
|
329 i64 = (int64_t) va_arg(args, int32_t);
|
|
330 } else {
|
|
331 ui64 = (uint64_t) va_arg(args, uint32_t);
|
|
332 }
|
|
333 break;
|
|
334
|
|
335 case 'L':
|
|
336 if (sign) {
|
|
337 i64 = va_arg(args, int64_t);
|
|
338 } else {
|
|
339 ui64 = va_arg(args, uint64_t);
|
|
340 }
|
|
341 break;
|
|
342
|
42
|
343 case 'A':
|
|
344 if (sign) {
|
|
345 i64 = (int64_t) va_arg(args, ngx_atomic_int_t);
|
|
346 } else {
|
44
|
347 ui64 = (uint64_t) va_arg(args, ngx_atomic_uint_t);
|
42
|
348 }
|
|
349
|
|
350 if (max_width) {
|
|
351 width = NGX_ATOMIC_T_LEN;
|
|
352 }
|
|
353
|
|
354 break;
|
|
355
|
416
|
356 case 'f':
|
570
|
357 f = va_arg(args, double);
|
416
|
358
|
|
359 if (f < 0) {
|
|
360 *buf++ = '-';
|
|
361 f = -f;
|
|
362 }
|
|
363
|
|
364 ui64 = (int64_t) f;
|
|
365
|
|
366 buf = ngx_sprintf_num(buf, last, ui64, zero, 0, width);
|
|
367
|
|
368 if (frac_width) {
|
|
369
|
|
370 if (buf < last) {
|
|
371 *buf++ = '.';
|
|
372 }
|
|
373
|
|
374 scale = 1.0;
|
|
375
|
540
|
376 for (n = frac_width; n; n--) {
|
416
|
377 scale *= 10.0;
|
|
378 }
|
|
379
|
|
380 /*
|
|
381 * (int64_t) cast is required for msvc6:
|
|
382 * it can not convert uint64_t to double
|
|
383 */
|
570
|
384 ui64 = (uint64_t) ((f - (int64_t) ui64) * scale + 0.5);
|
416
|
385
|
|
386 buf = ngx_sprintf_num(buf, last, ui64, '0', 0, frac_width);
|
|
387 }
|
|
388
|
|
389 fmt++;
|
|
390
|
|
391 continue;
|
|
392
|
10
|
393 #if !(NGX_WIN32)
|
|
394 case 'r':
|
|
395 i64 = (int64_t) va_arg(args, rlim_t);
|
|
396 sign = 1;
|
|
397 break;
|
|
398 #endif
|
|
399
|
|
400 case 'p':
|
|
401 ui64 = (uintptr_t) va_arg(args, void *);
|
416
|
402 hex = 2;
|
10
|
403 sign = 0;
|
|
404 zero = '0';
|
162
|
405 width = NGX_PTR_SIZE * 2;
|
10
|
406 break;
|
|
407
|
6
|
408 case 'c':
|
10
|
409 d = va_arg(args, int);
|
6
|
410 *buf++ = (u_char) (d & 0xff);
|
|
411 fmt++;
|
|
412
|
|
413 continue;
|
|
414
|
10
|
415 case 'Z':
|
|
416 *buf++ = '\0';
|
|
417 fmt++;
|
|
418
|
|
419 continue;
|
|
420
|
74
|
421 case 'N':
|
|
422 #if (NGX_WIN32)
|
|
423 *buf++ = CR;
|
|
424 #endif
|
|
425 *buf++ = LF;
|
|
426 fmt++;
|
|
427
|
|
428 continue;
|
|
429
|
4
|
430 case '%':
|
|
431 *buf++ = '%';
|
|
432 fmt++;
|
|
433
|
|
434 continue;
|
|
435
|
|
436 default:
|
|
437 *buf++ = *fmt++;
|
|
438
|
|
439 continue;
|
|
440 }
|
|
441
|
10
|
442 if (sign) {
|
|
443 if (i64 < 0) {
|
|
444 *buf++ = '-';
|
|
445 ui64 = (uint64_t) -i64;
|
|
446
|
|
447 } else {
|
|
448 ui64 = (uint64_t) i64;
|
|
449 }
|
|
450 }
|
|
451
|
416
|
452 buf = ngx_sprintf_num(buf, last, ui64, zero, hex, width);
|
4
|
453
|
|
454 fmt++;
|
|
455
|
|
456 } else {
|
|
457 *buf++ = *fmt++;
|
|
458 }
|
|
459 }
|
|
460
|
|
461 return buf;
|
|
462 }
|
|
463
|
|
464
|
416
|
465 static u_char *
|
|
466 ngx_sprintf_num(u_char *buf, u_char *last, uint64_t ui64, u_char zero,
|
|
467 ngx_uint_t hexadecimal, ngx_uint_t width)
|
|
468 {
|
|
469 u_char *p, temp[NGX_INT64_LEN + 1];
|
|
470 /*
|
|
471 * we need temp[NGX_INT64_LEN] only,
|
|
472 * but icc issues the warning
|
|
473 */
|
|
474 size_t len;
|
|
475 uint32_t ui32;
|
|
476 static u_char hex[] = "0123456789abcdef";
|
|
477 static u_char HEX[] = "0123456789ABCDEF";
|
|
478
|
|
479 p = temp + NGX_INT64_LEN;
|
|
480
|
|
481 if (hexadecimal == 0) {
|
|
482
|
|
483 if (ui64 <= NGX_MAX_UINT32_VALUE) {
|
|
484
|
|
485 /*
|
|
486 * To divide 64-bit numbers and to find remainders
|
|
487 * on the x86 platform gcc and icc call the libc functions
|
|
488 * [u]divdi3() and [u]moddi3(), they call another function
|
|
489 * in its turn. On FreeBSD it is the qdivrem() function,
|
|
490 * its source code is about 170 lines of the code.
|
|
491 * The glibc counterpart is about 150 lines of the code.
|
|
492 *
|
|
493 * For 32-bit numbers and some divisors gcc and icc use
|
|
494 * a inlined multiplication and shifts. For example,
|
|
495 * unsigned "i32 / 10" is compiled to
|
|
496 *
|
|
497 * (i32 * 0xCCCCCCCD) >> 35
|
|
498 */
|
|
499
|
|
500 ui32 = (uint32_t) ui64;
|
|
501
|
|
502 do {
|
|
503 *--p = (u_char) (ui32 % 10 + '0');
|
|
504 } while (ui32 /= 10);
|
|
505
|
|
506 } else {
|
|
507 do {
|
|
508 *--p = (u_char) (ui64 % 10 + '0');
|
|
509 } while (ui64 /= 10);
|
|
510 }
|
|
511
|
|
512 } else if (hexadecimal == 1) {
|
|
513
|
|
514 do {
|
|
515
|
|
516 /* the "(uint32_t)" cast disables the BCC's warning */
|
|
517 *--p = hex[(uint32_t) (ui64 & 0xf)];
|
|
518
|
|
519 } while (ui64 >>= 4);
|
|
520
|
|
521 } else { /* hexadecimal == 2 */
|
|
522
|
|
523 do {
|
|
524
|
|
525 /* the "(uint32_t)" cast disables the BCC's warning */
|
|
526 *--p = HEX[(uint32_t) (ui64 & 0xf)];
|
|
527
|
|
528 } while (ui64 >>= 4);
|
|
529 }
|
|
530
|
|
531 /* zero or space padding */
|
|
532
|
|
533 len = (temp + NGX_INT64_LEN) - p;
|
|
534
|
|
535 while (len++ < width && buf < last) {
|
|
536 *buf++ = zero;
|
|
537 }
|
|
538
|
|
539 /* number safe copy */
|
|
540
|
|
541 len = (temp + NGX_INT64_LEN) - p;
|
|
542
|
|
543 if (buf + len > last) {
|
|
544 len = last - buf;
|
|
545 }
|
|
546
|
|
547 return ngx_cpymem(buf, p, len);
|
|
548 }
|
|
549
|
|
550
|
286
|
551 /*
|
340
|
552 * We use ngx_strcasecmp()/ngx_strncasecmp() for 7-bit ASCII strings only,
|
286
|
553 * and implement our own ngx_strcasecmp()/ngx_strncasecmp()
|
|
554 * to avoid libc locale overhead. Besides, we use the ngx_uint_t's
|
|
555 * instead of the u_char's, because they are slightly faster.
|
|
556 */
|
|
557
|
|
558 ngx_int_t
|
|
559 ngx_strcasecmp(u_char *s1, u_char *s2)
|
|
560 {
|
|
561 ngx_uint_t c1, c2;
|
|
562
|
|
563 for ( ;; ) {
|
|
564 c1 = (ngx_uint_t) *s1++;
|
|
565 c2 = (ngx_uint_t) *s2++;
|
|
566
|
526
|
567 c1 = (c1 >= 'A' && c1 <= 'Z') ? (c1 | 0x20) : c1;
|
|
568 c2 = (c2 >= 'A' && c2 <= 'Z') ? (c2 | 0x20) : c2;
|
286
|
569
|
|
570 if (c1 == c2) {
|
|
571
|
|
572 if (c1) {
|
|
573 continue;
|
|
574 }
|
|
575
|
|
576 return 0;
|
|
577 }
|
|
578
|
|
579 return c1 - c2;
|
|
580 }
|
|
581 }
|
|
582
|
|
583
|
|
584 ngx_int_t
|
|
585 ngx_strncasecmp(u_char *s1, u_char *s2, size_t n)
|
|
586 {
|
|
587 ngx_uint_t c1, c2;
|
|
588
|
|
589 while (n) {
|
|
590 c1 = (ngx_uint_t) *s1++;
|
|
591 c2 = (ngx_uint_t) *s2++;
|
|
592
|
526
|
593 c1 = (c1 >= 'A' && c1 <= 'Z') ? (c1 | 0x20) : c1;
|
|
594 c2 = (c2 >= 'A' && c2 <= 'Z') ? (c2 | 0x20) : c2;
|
286
|
595
|
|
596 if (c1 == c2) {
|
|
597
|
|
598 if (c1) {
|
|
599 n--;
|
|
600 continue;
|
|
601 }
|
|
602
|
|
603 return 0;
|
|
604 }
|
|
605
|
|
606 return c1 - c2;
|
|
607 }
|
|
608
|
|
609 return 0;
|
|
610 }
|
|
611
|
|
612
|
340
|
613 u_char *
|
|
614 ngx_strnstr(u_char *s1, char *s2, size_t len)
|
|
615 {
|
|
616 u_char c1, c2;
|
|
617 size_t n;
|
|
618
|
|
619 c2 = *(u_char *) s2++;
|
|
620
|
|
621 n = ngx_strlen(s2);
|
|
622
|
|
623 do {
|
|
624 do {
|
|
625 if (len-- == 0) {
|
|
626 return NULL;
|
|
627 }
|
|
628
|
|
629 c1 = *s1++;
|
|
630
|
|
631 if (c1 == 0) {
|
|
632 return NULL;
|
|
633 }
|
|
634
|
|
635 } while (c1 != c2);
|
|
636
|
|
637 if (n > len) {
|
|
638 return NULL;
|
|
639 }
|
|
640
|
|
641 } while (ngx_strncmp(s1, (u_char *) s2, n) != 0);
|
|
642
|
|
643 return --s1;
|
|
644 }
|
|
645
|
|
646
|
|
647 /*
|
|
648 * ngx_strstrn() and ngx_strcasestrn() are intended to search for static
|
|
649 * substring with known length in null-terminated string. The argument n
|
|
650 * must be length of the second substring - 1.
|
|
651 */
|
|
652
|
|
653 u_char *
|
|
654 ngx_strstrn(u_char *s1, char *s2, size_t n)
|
|
655 {
|
|
656 u_char c1, c2;
|
|
657
|
|
658 c2 = *(u_char *) s2++;
|
|
659
|
|
660 do {
|
|
661 do {
|
|
662 c1 = *s1++;
|
|
663
|
|
664 if (c1 == 0) {
|
|
665 return NULL;
|
|
666 }
|
|
667
|
|
668 } while (c1 != c2);
|
|
669
|
|
670 } while (ngx_strncmp(s1, (u_char *) s2, n) != 0);
|
|
671
|
|
672 return --s1;
|
|
673 }
|
|
674
|
|
675
|
|
676 u_char *
|
|
677 ngx_strcasestrn(u_char *s1, char *s2, size_t n)
|
|
678 {
|
|
679 ngx_uint_t c1, c2;
|
|
680
|
|
681 c2 = (ngx_uint_t) *s2++;
|
526
|
682 c2 = (c2 >= 'A' && c2 <= 'Z') ? (c2 | 0x20) : c2;
|
340
|
683
|
|
684 do {
|
|
685 do {
|
|
686 c1 = (ngx_uint_t) *s1++;
|
|
687
|
|
688 if (c1 == 0) {
|
|
689 return NULL;
|
|
690 }
|
|
691
|
526
|
692 c1 = (c1 >= 'A' && c1 <= 'Z') ? (c1 | 0x20) : c1;
|
340
|
693
|
|
694 } while (c1 != c2);
|
|
695
|
|
696 } while (ngx_strncasecmp(s1, (u_char *) s2, n) != 0);
|
|
697
|
|
698 return --s1;
|
|
699 }
|
|
700
|
|
701
|
472
|
702 /*
|
|
703 * ngx_strlcasestrn() is intended to search for static substring
|
|
704 * with known length in string until the argument last. The argument n
|
|
705 * must be length of the second substring - 1.
|
|
706 */
|
|
707
|
|
708 u_char *
|
|
709 ngx_strlcasestrn(u_char *s1, u_char *last, u_char *s2, size_t n)
|
|
710 {
|
|
711 ngx_uint_t c1, c2;
|
|
712
|
|
713 c2 = (ngx_uint_t) *s2++;
|
526
|
714 c2 = (c2 >= 'A' && c2 <= 'Z') ? (c2 | 0x20) : c2;
|
472
|
715 last -= n;
|
|
716
|
|
717 do {
|
|
718 do {
|
476
|
719 if (s1 >= last) {
|
472
|
720 return NULL;
|
|
721 }
|
|
722
|
|
723 c1 = (ngx_uint_t) *s1++;
|
|
724
|
526
|
725 c1 = (c1 >= 'A' && c1 <= 'Z') ? (c1 | 0x20) : c1;
|
472
|
726
|
|
727 } while (c1 != c2);
|
|
728
|
|
729 } while (ngx_strncasecmp(s1, s2, n) != 0);
|
|
730
|
|
731 return --s1;
|
|
732 }
|
|
733
|
|
734
|
42
|
735 ngx_int_t
|
|
736 ngx_rstrncmp(u_char *s1, u_char *s2, size_t n)
|
0
|
737 {
|
|
738 if (n == 0) {
|
|
739 return 0;
|
|
740 }
|
|
741
|
|
742 n--;
|
|
743
|
|
744 for ( ;; ) {
|
|
745 if (s1[n] != s2[n]) {
|
|
746 return s1[n] - s2[n];
|
|
747 }
|
|
748
|
|
749 if (n == 0) {
|
|
750 return 0;
|
|
751 }
|
|
752
|
|
753 n--;
|
|
754 }
|
|
755 }
|
|
756
|
|
757
|
42
|
758 ngx_int_t
|
|
759 ngx_rstrncasecmp(u_char *s1, u_char *s2, size_t n)
|
4
|
760 {
|
|
761 u_char c1, c2;
|
|
762
|
|
763 if (n == 0) {
|
|
764 return 0;
|
|
765 }
|
|
766
|
|
767 n--;
|
|
768
|
|
769 for ( ;; ) {
|
|
770 c1 = s1[n];
|
|
771 if (c1 >= 'a' && c1 <= 'z') {
|
|
772 c1 -= 'a' - 'A';
|
|
773 }
|
|
774
|
|
775 c2 = s2[n];
|
|
776 if (c2 >= 'a' && c2 <= 'z') {
|
|
777 c2 -= 'a' - 'A';
|
|
778 }
|
|
779
|
|
780 if (c1 != c2) {
|
|
781 return c1 - c2;
|
|
782 }
|
|
783
|
|
784 if (n == 0) {
|
|
785 return 0;
|
|
786 }
|
|
787
|
|
788 n--;
|
|
789 }
|
|
790 }
|
|
791
|
|
792
|
42
|
793 ngx_int_t
|
274
|
794 ngx_memn2cmp(u_char *s1, u_char *s2, size_t n1, size_t n2)
|
|
795 {
|
|
796 size_t n;
|
|
797 ngx_int_t m, z;
|
|
798
|
|
799 if (n1 <= n2) {
|
|
800 n = n1;
|
|
801 z = -1;
|
|
802
|
|
803 } else {
|
|
804 n = n2;
|
|
805 z = 1;
|
|
806 }
|
|
807
|
|
808 m = ngx_memcmp(s1, s2, n);
|
|
809
|
|
810 if (m || n1 == n2) {
|
|
811 return m;
|
|
812 }
|
|
813
|
|
814 return z;
|
|
815 }
|
|
816
|
|
817
|
|
818 ngx_int_t
|
526
|
819 ngx_dns_strcmp(u_char *s1, u_char *s2)
|
|
820 {
|
|
821 ngx_uint_t c1, c2;
|
|
822
|
|
823 for ( ;; ) {
|
|
824 c1 = (ngx_uint_t) *s1++;
|
|
825 c2 = (ngx_uint_t) *s2++;
|
|
826
|
|
827 c1 = (c1 >= 'A' && c1 <= 'Z') ? (c1 | 0x20) : c1;
|
|
828 c2 = (c2 >= 'A' && c2 <= 'Z') ? (c2 | 0x20) : c2;
|
|
829
|
|
830 if (c1 == c2) {
|
|
831
|
|
832 if (c1) {
|
|
833 continue;
|
|
834 }
|
|
835
|
|
836 return 0;
|
|
837 }
|
|
838
|
|
839 /* in ASCII '.' > '-', but we need '.' to be the lowest character */
|
|
840
|
|
841 c1 = (c1 == '.') ? ' ' : c1;
|
|
842 c2 = (c2 == '.') ? ' ' : c2;
|
|
843
|
|
844 return c1 - c2;
|
|
845 }
|
|
846 }
|
|
847
|
|
848
|
|
849 ngx_int_t
|
42
|
850 ngx_atoi(u_char *line, size_t n)
|
0
|
851 {
|
|
852 ngx_int_t value;
|
|
853
|
|
854 if (n == 0) {
|
|
855 return NGX_ERROR;
|
|
856 }
|
|
857
|
|
858 for (value = 0; n--; line++) {
|
|
859 if (*line < '0' || *line > '9') {
|
|
860 return NGX_ERROR;
|
|
861 }
|
|
862
|
|
863 value = value * 10 + (*line - '0');
|
|
864 }
|
|
865
|
|
866 if (value < 0) {
|
|
867 return NGX_ERROR;
|
|
868
|
|
869 } else {
|
|
870 return value;
|
|
871 }
|
|
872 }
|
|
873
|
|
874
|
570
|
875 /* parse a fixed point number, e.g., ngx_atofp("10.5", 4, 2) returns 1050 */
|
|
876
|
|
877 ngx_int_t
|
|
878 ngx_atofp(u_char *line, size_t n, size_t point)
|
|
879 {
|
|
880 ngx_int_t value;
|
|
881 ngx_uint_t dot;
|
|
882
|
|
883 if (n == 0) {
|
|
884 return NGX_ERROR;
|
|
885 }
|
|
886
|
|
887 dot = 0;
|
|
888
|
|
889 for (value = 0; n--; line++) {
|
|
890
|
|
891 if (point == 0) {
|
|
892 return NGX_ERROR;
|
|
893 }
|
|
894
|
|
895 if (*line == '.') {
|
|
896 if (dot) {
|
|
897 return NGX_ERROR;
|
|
898 }
|
|
899
|
|
900 dot = 1;
|
|
901 continue;
|
|
902 }
|
|
903
|
|
904 if (*line < '0' || *line > '9') {
|
|
905 return NGX_ERROR;
|
|
906 }
|
|
907
|
|
908 value = value * 10 + (*line - '0');
|
|
909 point -= dot;
|
|
910 }
|
|
911
|
|
912 while (point--) {
|
|
913 value = value * 10;
|
|
914 }
|
|
915
|
|
916 if (value < 0) {
|
|
917 return NGX_ERROR;
|
|
918
|
|
919 } else {
|
|
920 return value;
|
|
921 }
|
|
922 }
|
|
923
|
|
924
|
50
|
925 ssize_t
|
|
926 ngx_atosz(u_char *line, size_t n)
|
|
927 {
|
|
928 ssize_t value;
|
|
929
|
|
930 if (n == 0) {
|
|
931 return NGX_ERROR;
|
|
932 }
|
|
933
|
|
934 for (value = 0; n--; line++) {
|
|
935 if (*line < '0' || *line > '9') {
|
|
936 return NGX_ERROR;
|
|
937 }
|
|
938
|
|
939 value = value * 10 + (*line - '0');
|
|
940 }
|
|
941
|
|
942 if (value < 0) {
|
|
943 return NGX_ERROR;
|
|
944
|
|
945 } else {
|
|
946 return value;
|
|
947 }
|
|
948 }
|
|
949
|
|
950
|
|
951 off_t
|
|
952 ngx_atoof(u_char *line, size_t n)
|
|
953 {
|
|
954 off_t value;
|
|
955
|
|
956 if (n == 0) {
|
|
957 return NGX_ERROR;
|
|
958 }
|
|
959
|
|
960 for (value = 0; n--; line++) {
|
|
961 if (*line < '0' || *line > '9') {
|
|
962 return NGX_ERROR;
|
|
963 }
|
|
964
|
|
965 value = value * 10 + (*line - '0');
|
|
966 }
|
|
967
|
|
968 if (value < 0) {
|
|
969 return NGX_ERROR;
|
|
970
|
|
971 } else {
|
|
972 return value;
|
|
973 }
|
|
974 }
|
|
975
|
|
976
|
|
977 time_t
|
|
978 ngx_atotm(u_char *line, size_t n)
|
|
979 {
|
|
980 time_t value;
|
|
981
|
|
982 if (n == 0) {
|
|
983 return NGX_ERROR;
|
|
984 }
|
|
985
|
|
986 for (value = 0; n--; line++) {
|
|
987 if (*line < '0' || *line > '9') {
|
|
988 return NGX_ERROR;
|
|
989 }
|
|
990
|
|
991 value = value * 10 + (*line - '0');
|
|
992 }
|
|
993
|
|
994 if (value < 0) {
|
|
995 return NGX_ERROR;
|
|
996
|
|
997 } else {
|
|
998 return value;
|
|
999 }
|
|
1000 }
|
|
1001
|
|
1002
|
42
|
1003 ngx_int_t
|
|
1004 ngx_hextoi(u_char *line, size_t n)
|
0
|
1005 {
|
250
|
1006 u_char c, ch;
|
0
|
1007 ngx_int_t value;
|
|
1008
|
|
1009 if (n == 0) {
|
|
1010 return NGX_ERROR;
|
|
1011 }
|
|
1012
|
|
1013 for (value = 0; n--; line++) {
|
|
1014 ch = *line;
|
|
1015
|
|
1016 if (ch >= '0' && ch <= '9') {
|
|
1017 value = value * 16 + (ch - '0');
|
|
1018 continue;
|
|
1019 }
|
|
1020
|
250
|
1021 c = (u_char) (ch | 0x20);
|
0
|
1022
|
250
|
1023 if (c >= 'a' && c <= 'f') {
|
|
1024 value = value * 16 + (c - 'a' + 10);
|
0
|
1025 continue;
|
|
1026 }
|
|
1027
|
|
1028 return NGX_ERROR;
|
|
1029 }
|
|
1030
|
|
1031 if (value < 0) {
|
|
1032 return NGX_ERROR;
|
|
1033
|
|
1034 } else {
|
|
1035 return value;
|
|
1036 }
|
|
1037 }
|
|
1038
|
|
1039
|
356
|
1040 u_char *
|
|
1041 ngx_hex_dump(u_char *dst, u_char *src, size_t len)
|
0
|
1042 {
|
|
1043 static u_char hex[] = "0123456789abcdef";
|
|
1044
|
356
|
1045 while (len--) {
|
|
1046 *dst++ = hex[*src >> 4];
|
|
1047 *dst++ = hex[*src++ & 0xf];
|
0
|
1048 }
|
|
1049
|
356
|
1050 return dst;
|
0
|
1051 }
|
|
1052
|
|
1053
|
42
|
1054 void
|
|
1055 ngx_encode_base64(ngx_str_t *dst, ngx_str_t *src)
|
0
|
1056 {
|
|
1057 u_char *d, *s;
|
|
1058 size_t len;
|
|
1059 static u_char basis64[] =
|
|
1060 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
|
|
1061
|
|
1062 len = src->len;
|
|
1063 s = src->data;
|
|
1064 d = dst->data;
|
|
1065
|
|
1066 while (len > 2) {
|
|
1067 *d++ = basis64[(s[0] >> 2) & 0x3f];
|
|
1068 *d++ = basis64[((s[0] & 3) << 4) | (s[1] >> 4)];
|
|
1069 *d++ = basis64[((s[1] & 0x0f) << 2) | (s[2] >> 6)];
|
|
1070 *d++ = basis64[s[2] & 0x3f];
|
|
1071
|
|
1072 s += 3;
|
|
1073 len -= 3;
|
|
1074 }
|
|
1075
|
|
1076 if (len) {
|
|
1077 *d++ = basis64[(s[0] >> 2) & 0x3f];
|
|
1078
|
|
1079 if (len == 1) {
|
|
1080 *d++ = basis64[(s[0] & 3) << 4];
|
|
1081 *d++ = '=';
|
|
1082
|
|
1083 } else {
|
|
1084 *d++ = basis64[((s[0] & 3) << 4) | (s[1] >> 4)];
|
|
1085 *d++ = basis64[(s[1] & 0x0f) << 2];
|
|
1086 }
|
|
1087
|
|
1088 *d++ = '=';
|
|
1089 }
|
|
1090
|
|
1091 dst->len = d - dst->data;
|
|
1092 }
|
|
1093
|
|
1094
|
42
|
1095 ngx_int_t
|
|
1096 ngx_decode_base64(ngx_str_t *dst, ngx_str_t *src)
|
0
|
1097 {
|
|
1098 size_t len;
|
|
1099 u_char *d, *s;
|
254
|
1100 static u_char basis64[] = {
|
|
1101 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77,
|
|
1102 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77,
|
|
1103 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 62, 77, 77, 77, 63,
|
|
1104 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 77, 77, 77, 77, 77, 77,
|
|
1105 77, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
|
|
1106 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 77, 77, 77, 77, 77,
|
|
1107 77, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
|
|
1108 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 77, 77, 77, 77, 77,
|
0
|
1109
|
254
|
1110 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77,
|
|
1111 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77,
|
|
1112 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77,
|
|
1113 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77,
|
|
1114 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77,
|
|
1115 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77,
|
|
1116 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77,
|
|
1117 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77
|
|
1118 };
|
0
|
1119
|
|
1120 for (len = 0; len < src->len; len++) {
|
|
1121 if (src->data[len] == '=') {
|
|
1122 break;
|
|
1123 }
|
|
1124
|
|
1125 if (basis64[src->data[len]] == 77) {
|
|
1126 return NGX_ERROR;
|
|
1127 }
|
|
1128 }
|
|
1129
|
|
1130 if (len % 4 == 1) {
|
|
1131 return NGX_ERROR;
|
|
1132 }
|
|
1133
|
|
1134 s = src->data;
|
|
1135 d = dst->data;
|
|
1136
|
|
1137 while (len > 3) {
|
|
1138 *d++ = (u_char) (basis64[s[0]] << 2 | basis64[s[1]] >> 4);
|
|
1139 *d++ = (u_char) (basis64[s[1]] << 4 | basis64[s[2]] >> 2);
|
|
1140 *d++ = (u_char) (basis64[s[2]] << 6 | basis64[s[3]]);
|
|
1141
|
|
1142 s += 4;
|
|
1143 len -= 4;
|
|
1144 }
|
|
1145
|
|
1146 if (len > 1) {
|
|
1147 *d++ = (u_char) (basis64[s[0]] << 2 | basis64[s[1]] >> 4);
|
|
1148 }
|
|
1149
|
|
1150 if (len > 2) {
|
|
1151 *d++ = (u_char) (basis64[s[1]] << 4 | basis64[s[2]] >> 2);
|
|
1152 }
|
|
1153
|
|
1154 dst->len = d - dst->data;
|
|
1155
|
|
1156 return NGX_OK;
|
|
1157 }
|
|
1158
|
|
1159
|
206
|
1160 /*
|
390
|
1161 * ngx_utf8_decode() decodes two and more bytes UTF sequences only
|
206
|
1162 * the return values:
|
|
1163 * 0x80 - 0x10ffff valid character
|
390
|
1164 * 0x110000 - 0xfffffffd invalid sequence
|
206
|
1165 * 0xfffffffe incomplete sequence
|
|
1166 * 0xffffffff error
|
|
1167 */
|
|
1168
|
|
1169 uint32_t
|
390
|
1170 ngx_utf8_decode(u_char **p, size_t n)
|
206
|
1171 {
|
|
1172 size_t len;
|
|
1173 uint32_t u, i, valid;
|
|
1174
|
|
1175 u = **p;
|
|
1176
|
|
1177 if (u > 0xf0) {
|
|
1178
|
|
1179 u &= 0x07;
|
|
1180 valid = 0xffff;
|
|
1181 len = 3;
|
|
1182
|
|
1183 } else if (u > 0xe0) {
|
|
1184
|
|
1185 u &= 0x0f;
|
|
1186 valid = 0x7ff;
|
|
1187 len = 2;
|
|
1188
|
|
1189 } else if (u > 0xc0) {
|
|
1190
|
|
1191 u &= 0x1f;
|
|
1192 valid = 0x7f;
|
|
1193 len = 1;
|
|
1194
|
|
1195 } else {
|
|
1196 (*p)++;
|
|
1197 return 0xffffffff;
|
|
1198 }
|
|
1199
|
|
1200 if (n - 1 < len) {
|
|
1201 return 0xfffffffe;
|
|
1202 }
|
|
1203
|
|
1204 (*p)++;
|
|
1205
|
|
1206 while (len) {
|
|
1207 i = *(*p)++;
|
|
1208
|
|
1209 if (i < 0x80) {
|
|
1210 return 0xffffffff;
|
|
1211 }
|
|
1212
|
|
1213 u = (u << 6) | (i & 0x3f);
|
|
1214
|
|
1215 len--;
|
|
1216 }
|
|
1217
|
|
1218 if (u > valid) {
|
|
1219 return u;
|
|
1220 }
|
|
1221
|
|
1222 return 0xffffffff;
|
|
1223 }
|
|
1224
|
|
1225
|
72
|
1226 size_t
|
390
|
1227 ngx_utf8_length(u_char *p, size_t n)
|
72
|
1228 {
|
390
|
1229 u_char c, *last;
|
|
1230 size_t len;
|
72
|
1231
|
390
|
1232 last = p + n;
|
72
|
1233
|
390
|
1234 for (len = 0; p < last; len++) {
|
|
1235
|
|
1236 c = *p;
|
72
|
1237
|
|
1238 if (c < 0x80) {
|
390
|
1239 p++;
|
72
|
1240 continue;
|
|
1241 }
|
|
1242
|
390
|
1243 if (ngx_utf8_decode(&p, n) > 0x10ffff) {
|
|
1244 /* invalid UTF-8 */
|
|
1245 return n;
|
72
|
1246 }
|
|
1247 }
|
|
1248
|
|
1249 return len;
|
|
1250 }
|
|
1251
|
|
1252
|
76
|
1253 u_char *
|
390
|
1254 ngx_utf8_cpystrn(u_char *dst, u_char *src, size_t n, size_t len)
|
76
|
1255 {
|
390
|
1256 u_char c, *next;
|
76
|
1257
|
|
1258 if (n == 0) {
|
|
1259 return dst;
|
|
1260 }
|
|
1261
|
390
|
1262 while (--n) {
|
76
|
1263
|
|
1264 c = *src;
|
|
1265 *dst = c;
|
|
1266
|
|
1267 if (c < 0x80) {
|
390
|
1268
|
|
1269 if (c != '\0') {
|
|
1270 dst++;
|
|
1271 src++;
|
|
1272 len--;
|
|
1273
|
76
|
1274 continue;
|
|
1275 }
|
|
1276
|
|
1277 return dst;
|
|
1278 }
|
|
1279
|
390
|
1280 next = src;
|
76
|
1281
|
390
|
1282 if (ngx_utf8_decode(&next, len) > 0x10ffff) {
|
|
1283 /* invalid UTF-8 */
|
|
1284 break;
|
76
|
1285 }
|
|
1286
|
390
|
1287 while (src < next) {
|
560
|
1288 *dst++ = *src++;
|
390
|
1289 len--;
|
|
1290 }
|
76
|
1291 }
|
|
1292
|
|
1293 *dst = '\0';
|
|
1294
|
|
1295 return dst;
|
|
1296 }
|
|
1297
|
|
1298
|
42
|
1299 uintptr_t
|
|
1300 ngx_escape_uri(u_char *dst, u_char *src, size_t size, ngx_uint_t type)
|
0
|
1301 {
|
540
|
1302 ngx_uint_t n;
|
254
|
1303 uint32_t *escape;
|
|
1304 static u_char hex[] = "0123456789abcdef";
|
10
|
1305
|
254
|
1306 /* " ", "#", "%", "?", %00-%1F, %7F-%FF */
|
34
|
1307
|
254
|
1308 static uint32_t uri[] = {
|
|
1309 0xffffffff, /* 1111 1111 1111 1111 1111 1111 1111 1111 */
|
0
|
1310
|
254
|
1311 /* ?>=< ;:98 7654 3210 /.-, +*)( '&%$ #"! */
|
|
1312 0x80000029, /* 1000 0000 0000 0000 0000 0000 0010 1001 */
|
|
1313
|
|
1314 /* _^]\ [ZYX WVUT SRQP ONML KJIH GFED CBA@ */
|
|
1315 0x00000000, /* 0000 0000 0000 0000 0000 0000 0000 0000 */
|
2
|
1316
|
254
|
1317 /* ~}| {zyx wvut srqp onml kjih gfed cba` */
|
|
1318 0x80000000, /* 1000 0000 0000 0000 0000 0000 0000 0000 */
|
0
|
1319
|
254
|
1320 0xffffffff, /* 1111 1111 1111 1111 1111 1111 1111 1111 */
|
|
1321 0xffffffff, /* 1111 1111 1111 1111 1111 1111 1111 1111 */
|
|
1322 0xffffffff, /* 1111 1111 1111 1111 1111 1111 1111 1111 */
|
|
1323 0xffffffff /* 1111 1111 1111 1111 1111 1111 1111 1111 */
|
|
1324 };
|
2
|
1325
|
566
|
1326 /* " ", "#", "%", "&", "+", "?", %00-%1F, %7F-%FF */
|
34
|
1327
|
254
|
1328 static uint32_t args[] = {
|
|
1329 0xffffffff, /* 1111 1111 1111 1111 1111 1111 1111 1111 */
|
|
1330
|
|
1331 /* ?>=< ;:98 7654 3210 /.-, +*)( '&%$ #"! */
|
566
|
1332 0x80000869, /* 1000 0000 0000 0000 0000 1000 0110 1001 */
|
34
|
1333
|
254
|
1334 /* _^]\ [ZYX WVUT SRQP ONML KJIH GFED CBA@ */
|
|
1335 0x00000000, /* 0000 0000 0000 0000 0000 0000 0000 0000 */
|
34
|
1336
|
254
|
1337 /* ~}| {zyx wvut srqp onml kjih gfed cba` */
|
|
1338 0x80000000, /* 1000 0000 0000 0000 0000 0000 0000 0000 */
|
34
|
1339
|
254
|
1340 0xffffffff, /* 1111 1111 1111 1111 1111 1111 1111 1111 */
|
|
1341 0xffffffff, /* 1111 1111 1111 1111 1111 1111 1111 1111 */
|
|
1342 0xffffffff, /* 1111 1111 1111 1111 1111 1111 1111 1111 */
|
|
1343 0xffffffff /* 1111 1111 1111 1111 1111 1111 1111 1111 */
|
|
1344 };
|
34
|
1345
|
328
|
1346 /* " ", "#", """, "%", "'", %00-%1F, %7F-%FF */
|
34
|
1347
|
254
|
1348 static uint32_t html[] = {
|
|
1349 0xffffffff, /* 1111 1111 1111 1111 1111 1111 1111 1111 */
|
10
|
1350
|
254
|
1351 /* ?>=< ;:98 7654 3210 /.-, +*)( '&%$ #"! */
|
320
|
1352 0x000000ad, /* 0000 0000 0000 0000 0000 0000 1010 1101 */
|
254
|
1353
|
|
1354 /* _^]\ [ZYX WVUT SRQP ONML KJIH GFED CBA@ */
|
|
1355 0x00000000, /* 0000 0000 0000 0000 0000 0000 0000 0000 */
|
10
|
1356
|
254
|
1357 /* ~}| {zyx wvut srqp onml kjih gfed cba` */
|
|
1358 0x80000000, /* 1000 0000 0000 0000 0000 0000 0000 0000 */
|
10
|
1359
|
254
|
1360 0xffffffff, /* 1111 1111 1111 1111 1111 1111 1111 1111 */
|
|
1361 0xffffffff, /* 1111 1111 1111 1111 1111 1111 1111 1111 */
|
|
1362 0xffffffff, /* 1111 1111 1111 1111 1111 1111 1111 1111 */
|
|
1363 0xffffffff /* 1111 1111 1111 1111 1111 1111 1111 1111 */
|
|
1364 };
|
10
|
1365
|
328
|
1366 /* " ", """, "%", "'", %00-%1F, %7F-%FF */
|
10
|
1367
|
320
|
1368 static uint32_t refresh[] = {
|
|
1369 0xffffffff, /* 1111 1111 1111 1111 1111 1111 1111 1111 */
|
|
1370
|
|
1371 /* ?>=< ;:98 7654 3210 /.-, +*)( '&%$ #"! */
|
346
|
1372 0x00000085, /* 0000 0000 0000 0000 0000 0000 1000 0101 */
|
320
|
1373
|
|
1374 /* _^]\ [ZYX WVUT SRQP ONML KJIH GFED CBA@ */
|
|
1375 0x00000000, /* 0000 0000 0000 0000 0000 0000 0000 0000 */
|
|
1376
|
|
1377 /* ~}| {zyx wvut srqp onml kjih gfed cba` */
|
|
1378 0x80000000, /* 1000 0000 0000 0000 0000 0000 0000 0000 */
|
|
1379
|
|
1380 0xffffffff, /* 1111 1111 1111 1111 1111 1111 1111 1111 */
|
|
1381 0xffffffff, /* 1111 1111 1111 1111 1111 1111 1111 1111 */
|
|
1382 0xffffffff, /* 1111 1111 1111 1111 1111 1111 1111 1111 */
|
|
1383 0xffffffff /* 1111 1111 1111 1111 1111 1111 1111 1111 */
|
|
1384 };
|
|
1385
|
328
|
1386 /* " ", "%", %00-%1F */
|
322
|
1387
|
|
1388 static uint32_t memcached[] = {
|
|
1389 0xffffffff, /* 1111 1111 1111 1111 1111 1111 1111 1111 */
|
|
1390
|
|
1391 /* ?>=< ;:98 7654 3210 /.-, +*)( '&%$ #"! */
|
328
|
1392 0x00000021, /* 0000 0000 0000 0000 0000 0000 0010 0001 */
|
322
|
1393
|
|
1394 /* _^]\ [ZYX WVUT SRQP ONML KJIH GFED CBA@ */
|
|
1395 0x00000000, /* 0000 0000 0000 0000 0000 0000 0000 0000 */
|
|
1396
|
|
1397 /* ~}| {zyx wvut srqp onml kjih gfed cba` */
|
|
1398 0x00000000, /* 0000 0000 0000 0000 0000 0000 0000 0000 */
|
|
1399
|
|
1400 0x00000000, /* 0000 0000 0000 0000 0000 0000 0000 0000 */
|
|
1401 0x00000000, /* 0000 0000 0000 0000 0000 0000 0000 0000 */
|
|
1402 0x00000000, /* 0000 0000 0000 0000 0000 0000 0000 0000 */
|
|
1403 0x00000000, /* 0000 0000 0000 0000 0000 0000 0000 0000 */
|
|
1404 };
|
|
1405
|
328
|
1406 /* mail_auth is the same as memcached */
|
|
1407
|
|
1408 static uint32_t *map[] =
|
|
1409 { uri, args, html, refresh, memcached, memcached };
|
320
|
1410
|
|
1411
|
|
1412 escape = map[type];
|
10
|
1413
|
2
|
1414 if (dst == NULL) {
|
|
1415
|
|
1416 /* find the number of the characters to be escaped */
|
0
|
1417
|
526
|
1418 n = 0;
|
2
|
1419
|
540
|
1420 while (size) {
|
2
|
1421 if (escape[*src >> 5] & (1 << (*src & 0x1f))) {
|
|
1422 n++;
|
|
1423 }
|
|
1424 src++;
|
540
|
1425 size--;
|
2
|
1426 }
|
|
1427
|
34
|
1428 return (uintptr_t) n;
|
0
|
1429 }
|
|
1430
|
540
|
1431 while (size) {
|
2
|
1432 if (escape[*src >> 5] & (1 << (*src & 0x1f))) {
|
|
1433 *dst++ = '%';
|
|
1434 *dst++ = hex[*src >> 4];
|
|
1435 *dst++ = hex[*src & 0xf];
|
|
1436 src++;
|
0
|
1437
|
2
|
1438 } else {
|
|
1439 *dst++ = *src++;
|
|
1440 }
|
540
|
1441 size--;
|
0
|
1442 }
|
|
1443
|
34
|
1444 return (uintptr_t) dst;
|
0
|
1445 }
|
126
|
1446
|
|
1447
|
|
1448 void
|
150
|
1449 ngx_unescape_uri(u_char **dst, u_char **src, size_t size, ngx_uint_t type)
|
126
|
1450 {
|
|
1451 u_char *d, *s, ch, c, decoded;
|
|
1452 enum {
|
|
1453 sw_usual = 0,
|
|
1454 sw_quoted,
|
|
1455 sw_quoted_second
|
|
1456 } state;
|
|
1457
|
|
1458 d = *dst;
|
|
1459 s = *src;
|
|
1460
|
|
1461 state = 0;
|
|
1462 decoded = 0;
|
|
1463
|
|
1464 while (size--) {
|
|
1465
|
|
1466 ch = *s++;
|
|
1467
|
|
1468 switch (state) {
|
|
1469 case sw_usual:
|
342
|
1470 if (ch == '?'
|
|
1471 && (type & (NGX_UNESCAPE_URI|NGX_UNESCAPE_REDIRECT)))
|
|
1472 {
|
126
|
1473 *d++ = ch;
|
|
1474 goto done;
|
|
1475 }
|
|
1476
|
|
1477 if (ch == '%') {
|
|
1478 state = sw_quoted;
|
|
1479 break;
|
|
1480 }
|
|
1481
|
|
1482 *d++ = ch;
|
|
1483 break;
|
|
1484
|
|
1485 case sw_quoted:
|
|
1486
|
|
1487 if (ch >= '0' && ch <= '9') {
|
|
1488 decoded = (u_char) (ch - '0');
|
|
1489 state = sw_quoted_second;
|
|
1490 break;
|
|
1491 }
|
|
1492
|
|
1493 c = (u_char) (ch | 0x20);
|
|
1494 if (c >= 'a' && c <= 'f') {
|
|
1495 decoded = (u_char) (c - 'a' + 10);
|
|
1496 state = sw_quoted_second;
|
|
1497 break;
|
|
1498 }
|
|
1499
|
138
|
1500 /* the invalid quoted character */
|
126
|
1501
|
138
|
1502 state = sw_usual;
|
|
1503
|
|
1504 *d++ = ch;
|
126
|
1505
|
|
1506 break;
|
|
1507
|
|
1508 case sw_quoted_second:
|
|
1509
|
138
|
1510 state = sw_usual;
|
|
1511
|
126
|
1512 if (ch >= '0' && ch <= '9') {
|
|
1513 ch = (u_char) ((decoded << 4) + ch - '0');
|
|
1514
|
342
|
1515 if (type & NGX_UNESCAPE_REDIRECT) {
|
150
|
1516 if (ch > '%' && ch < 0x7f) {
|
|
1517 *d++ = ch;
|
|
1518 break;
|
|
1519 }
|
|
1520
|
|
1521 *d++ = '%'; *d++ = *(s - 2); *d++ = *(s - 1);
|
|
1522
|
126
|
1523 break;
|
|
1524 }
|
|
1525
|
150
|
1526 *d++ = ch;
|
126
|
1527
|
|
1528 break;
|
|
1529 }
|
|
1530
|
|
1531 c = (u_char) (ch | 0x20);
|
|
1532 if (c >= 'a' && c <= 'f') {
|
|
1533 ch = (u_char) ((decoded << 4) + c - 'a' + 10);
|
|
1534
|
342
|
1535 if (type & NGX_UNESCAPE_URI) {
|
|
1536 if (ch == '?') {
|
|
1537 *d++ = ch;
|
|
1538 goto done;
|
|
1539 }
|
|
1540
|
|
1541 *d++ = ch;
|
|
1542 break;
|
|
1543 }
|
|
1544
|
|
1545 if (type & NGX_UNESCAPE_REDIRECT) {
|
150
|
1546 if (ch == '?') {
|
|
1547 *d++ = ch;
|
|
1548 goto done;
|
|
1549 }
|
126
|
1550
|
150
|
1551 if (ch > '%' && ch < 0x7f) {
|
|
1552 *d++ = ch;
|
|
1553 break;
|
|
1554 }
|
|
1555
|
|
1556 *d++ = '%'; *d++ = *(s - 2); *d++ = *(s - 1);
|
126
|
1557 break;
|
|
1558 }
|
|
1559
|
150
|
1560 *d++ = ch;
|
126
|
1561
|
|
1562 break;
|
|
1563 }
|
|
1564
|
138
|
1565 /* the invalid quoted character */
|
126
|
1566
|
|
1567 break;
|
|
1568 }
|
|
1569 }
|
|
1570
|
|
1571 done:
|
|
1572
|
|
1573 *dst = d;
|
|
1574 *src = s;
|
|
1575 }
|
132
|
1576
|
|
1577
|
340
|
1578 uintptr_t
|
|
1579 ngx_escape_html(u_char *dst, u_char *src, size_t size)
|
|
1580 {
|
|
1581 u_char ch;
|
540
|
1582 ngx_uint_t len;
|
340
|
1583
|
|
1584 if (dst == NULL) {
|
|
1585
|
|
1586 len = 0;
|
|
1587
|
540
|
1588 while (size) {
|
340
|
1589 switch (*src++) {
|
|
1590
|
|
1591 case '<':
|
|
1592 len += sizeof("<") - 2;
|
|
1593 break;
|
|
1594
|
|
1595 case '>':
|
|
1596 len += sizeof(">") - 2;
|
|
1597 break;
|
|
1598
|
|
1599 case '&':
|
|
1600 len += sizeof("&") - 2;
|
|
1601 break;
|
|
1602
|
|
1603 default:
|
|
1604 break;
|
|
1605 }
|
540
|
1606 size--;
|
340
|
1607 }
|
|
1608
|
|
1609 return (uintptr_t) len;
|
|
1610 }
|
|
1611
|
540
|
1612 while (size) {
|
340
|
1613 ch = *src++;
|
|
1614
|
|
1615 switch (ch) {
|
|
1616
|
|
1617 case '<':
|
|
1618 *dst++ = '&'; *dst++ = 'l'; *dst++ = 't'; *dst++ = ';';
|
|
1619 break;
|
|
1620
|
|
1621 case '>':
|
|
1622 *dst++ = '&'; *dst++ = 'g'; *dst++ = 't'; *dst++ = ';';
|
|
1623 break;
|
|
1624
|
|
1625 case '&':
|
|
1626 *dst++ = '&'; *dst++ = 'a'; *dst++ = 'm'; *dst++ = 'p';
|
|
1627 *dst++ = ';';
|
|
1628 break;
|
|
1629
|
|
1630 default:
|
|
1631 *dst++ = ch;
|
|
1632 break;
|
|
1633 }
|
540
|
1634 size--;
|
340
|
1635 }
|
|
1636
|
|
1637 return (uintptr_t) dst;
|
|
1638 }
|
|
1639
|
|
1640
|
302
|
1641 /* ngx_sort() is implemented as insertion sort because we need stable sort */
|
|
1642
|
|
1643 void
|
|
1644 ngx_sort(void *base, size_t n, size_t size,
|
372
|
1645 ngx_int_t (*cmp)(const void *, const void *))
|
302
|
1646 {
|
372
|
1647 u_char *p1, *p2, *p;
|
|
1648
|
|
1649 p = ngx_alloc(size, ngx_cycle->log);
|
|
1650 if (p == NULL) {
|
|
1651 return;
|
|
1652 }
|
302
|
1653
|
|
1654 for (p1 = (u_char *) base + size;
|
|
1655 p1 < (u_char *) base + n * size;
|
|
1656 p1 += size)
|
|
1657 {
|
372
|
1658 ngx_memcpy(p, p1, size);
|
302
|
1659
|
|
1660 for (p2 = p1;
|
372
|
1661 p2 > (u_char *) base && cmp(p2 - size, p) > 0;
|
302
|
1662 p2 -= size)
|
|
1663 {
|
|
1664 ngx_memcpy(p2, p2 - size, size);
|
|
1665 }
|
|
1666
|
372
|
1667 ngx_memcpy(p2, p, size);
|
302
|
1668 }
|
372
|
1669
|
|
1670 ngx_free(p);
|
302
|
1671 }
|
|
1672
|
|
1673
|
132
|
1674 #if (NGX_MEMCPY_LIMIT)
|
|
1675
|
|
1676 void *
|
|
1677 ngx_memcpy(void *dst, void *src, size_t n)
|
|
1678 {
|
|
1679 if (n > NGX_MEMCPY_LIMIT) {
|
|
1680 ngx_log_error(NGX_LOG_ALERT, ngx_cycle->log, 0, "memcpy %uz bytes", n);
|
|
1681 ngx_debug_point();
|
|
1682 }
|
|
1683
|
|
1684 return memcpy(dst, src, n);
|
|
1685 }
|
|
1686
|
|
1687 #endif
|