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