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