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