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