|
56
|
1
|
|
|
2 /*
|
|
|
3 * Copyright (C) Igor Sysoev
|
|
|
4 */
|
|
|
5
|
|
|
6
|
|
|
7 #include <ngx_config.h>
|
|
|
8 #include <ngx_core.h>
|
|
|
9
|
|
|
10
|
|
138
|
11 void *
|
|
|
12 ngx_hash_find(ngx_hash_t *hash, ngx_uint_t key, u_char *name, size_t len)
|
|
|
13 {
|
|
|
14 ngx_uint_t i;
|
|
|
15 ngx_hash_elt_t *elt;
|
|
|
16
|
|
|
17 #if 0
|
|
394
|
18 ngx_log_error(NGX_LOG_ALERT, ngx_cycle->log, 0, "hf:\"%*s\"", len, name);
|
|
138
|
19 #endif
|
|
|
20
|
|
|
21 elt = hash->buckets[key % hash->size];
|
|
|
22
|
|
|
23 if (elt == NULL) {
|
|
|
24 return NULL;
|
|
|
25 }
|
|
|
26
|
|
|
27 while (elt->value) {
|
|
|
28 if (len != (size_t) elt->len) {
|
|
|
29 goto next;
|
|
|
30 }
|
|
|
31
|
|
|
32 for (i = 0; i < len; i++) {
|
|
|
33 if (name[i] != elt->name[i]) {
|
|
|
34 goto next;
|
|
|
35 }
|
|
|
36 }
|
|
|
37
|
|
|
38 return elt->value;
|
|
|
39
|
|
|
40 next:
|
|
|
41
|
|
|
42 elt = (ngx_hash_elt_t *) ngx_align_ptr(&elt->name[0] + elt->len,
|
|
|
43 sizeof(void *));
|
|
|
44 continue;
|
|
|
45 }
|
|
|
46
|
|
|
47 return NULL;
|
|
|
48 }
|
|
|
49
|
|
|
50
|
|
|
51 void *
|
|
312
|
52 ngx_hash_find_wc_head(ngx_hash_wildcard_t *hwc, u_char *name, size_t len)
|
|
138
|
53 {
|
|
|
54 void *value;
|
|
|
55 ngx_uint_t i, n, key;
|
|
|
56
|
|
|
57 #if 0
|
|
394
|
58 ngx_log_error(NGX_LOG_ALERT, ngx_cycle->log, 0, "wch:\"%*s\"", len, name);
|
|
138
|
59 #endif
|
|
|
60
|
|
|
61 n = len;
|
|
|
62
|
|
|
63 while (n) {
|
|
|
64 if (name[n - 1] == '.') {
|
|
|
65 break;
|
|
|
66 }
|
|
|
67
|
|
|
68 n--;
|
|
|
69 }
|
|
|
70
|
|
|
71 key = 0;
|
|
|
72
|
|
|
73 for (i = n; i < len; i++) {
|
|
|
74 key = ngx_hash(key, name[i]);
|
|
|
75 }
|
|
|
76
|
|
|
77 #if 0
|
|
|
78 ngx_log_error(NGX_LOG_ALERT, ngx_cycle->log, 0, "key:\"%ui\"", key);
|
|
|
79 #endif
|
|
|
80
|
|
|
81 value = ngx_hash_find(&hwc->hash, key, &name[n], len - n);
|
|
|
82
|
|
394
|
83 #if 0
|
|
|
84 ngx_log_error(NGX_LOG_ALERT, ngx_cycle->log, 0, "value:\"%p\"", value);
|
|
|
85 #endif
|
|
|
86
|
|
138
|
87 if (value) {
|
|
140
|
88
|
|
|
89 /*
|
|
|
90 * the 2 low bits of value have the special meaning:
|
|
394
|
91 * 00 - value is data pointer for both "example.com"
|
|
|
92 * and "*.example.com";
|
|
|
93 * 01 - value is data pointer for "*.example.com" only;
|
|
|
94 * 10 - value is pointer to wildcard hash allowing
|
|
|
95 * both "example.com" and "*.example.com";
|
|
140
|
96 * 11 - value is pointer to wildcard hash allowing
|
|
394
|
97 * "*.example.com" only.
|
|
140
|
98 */
|
|
|
99
|
|
394
|
100 if ((uintptr_t) value & 2) {
|
|
|
101
|
|
|
102 if (n == 0) {
|
|
|
103
|
|
|
104 /* "example.com" */
|
|
|
105
|
|
|
106 if ((uintptr_t) value & 1) {
|
|
|
107 return NULL;
|
|
|
108 }
|
|
|
109
|
|
|
110 hwc = (ngx_hash_wildcard_t *)
|
|
|
111 ((uintptr_t) value & (uintptr_t) ~3);
|
|
|
112 return hwc->value;
|
|
|
113 }
|
|
140
|
114
|
|
|
115 hwc = (ngx_hash_wildcard_t *) ((uintptr_t) value & (uintptr_t) ~3);
|
|
|
116
|
|
312
|
117 value = ngx_hash_find_wc_head(hwc, name, n - 1);
|
|
138
|
118
|
|
|
119 if (value) {
|
|
|
120 return value;
|
|
|
121 }
|
|
|
122
|
|
|
123 return hwc->value;
|
|
|
124 }
|
|
|
125
|
|
394
|
126 if ((uintptr_t) value & 1) {
|
|
|
127
|
|
|
128 if (n == 0) {
|
|
|
129
|
|
|
130 /* "example.com" */
|
|
|
131
|
|
|
132 return NULL;
|
|
|
133 }
|
|
|
134
|
|
|
135 return (void *) ((uintptr_t) value & (uintptr_t) ~3);
|
|
|
136 }
|
|
|
137
|
|
138
|
138 return value;
|
|
|
139 }
|
|
|
140
|
|
|
141 return hwc->value;
|
|
|
142 }
|
|
|
143
|
|
|
144
|
|
312
|
145 void *
|
|
|
146 ngx_hash_find_wc_tail(ngx_hash_wildcard_t *hwc, u_char *name, size_t len)
|
|
|
147 {
|
|
|
148 void *value;
|
|
|
149 ngx_uint_t i, key;
|
|
|
150
|
|
|
151 #if 0
|
|
394
|
152 ngx_log_error(NGX_LOG_ALERT, ngx_cycle->log, 0, "wct:\"%*s\"", len, name);
|
|
312
|
153 #endif
|
|
|
154
|
|
|
155 key = 0;
|
|
|
156
|
|
|
157 for (i = 0; i < len; i++) {
|
|
|
158 if (name[i] == '.') {
|
|
|
159 break;
|
|
|
160 }
|
|
|
161
|
|
|
162 key = ngx_hash(key, name[i]);
|
|
|
163 }
|
|
|
164
|
|
|
165 if (i == len) {
|
|
|
166 return NULL;
|
|
|
167 }
|
|
|
168
|
|
|
169 #if 0
|
|
|
170 ngx_log_error(NGX_LOG_ALERT, ngx_cycle->log, 0, "key:\"%ui\"", key);
|
|
|
171 #endif
|
|
|
172
|
|
|
173 value = ngx_hash_find(&hwc->hash, key, name, i);
|
|
|
174
|
|
394
|
175 #if 0
|
|
|
176 ngx_log_error(NGX_LOG_ALERT, ngx_cycle->log, 0, "value:\"%p\"", value);
|
|
|
177 #endif
|
|
|
178
|
|
312
|
179 if (value) {
|
|
|
180
|
|
|
181 /*
|
|
|
182 * the 2 low bits of value have the special meaning:
|
|
394
|
183 * 00 - value is data pointer;
|
|
|
184 * 11 - value is pointer to wildcard hash allowing "example.*".
|
|
312
|
185 */
|
|
|
186
|
|
394
|
187 if ((uintptr_t) value & 2) {
|
|
312
|
188
|
|
|
189 i++;
|
|
|
190
|
|
|
191 hwc = (ngx_hash_wildcard_t *) ((uintptr_t) value & (uintptr_t) ~3);
|
|
|
192
|
|
|
193 value = ngx_hash_find_wc_tail(hwc, &name[i], len - i);
|
|
|
194
|
|
|
195 if (value) {
|
|
|
196 return value;
|
|
|
197 }
|
|
|
198
|
|
|
199 return hwc->value;
|
|
|
200 }
|
|
|
201
|
|
|
202 return value;
|
|
|
203 }
|
|
|
204
|
|
|
205 return hwc->value;
|
|
|
206 }
|
|
|
207
|
|
|
208
|
|
|
209 void *
|
|
|
210 ngx_hash_find_combined(ngx_hash_combined_t *hash, ngx_uint_t key, u_char *name,
|
|
|
211 size_t len)
|
|
|
212 {
|
|
|
213 void *value;
|
|
|
214
|
|
|
215 if (hash->hash.buckets) {
|
|
|
216 value = ngx_hash_find(&hash->hash, key, name, len);
|
|
|
217
|
|
|
218 if (value) {
|
|
|
219 return value;
|
|
|
220 }
|
|
|
221 }
|
|
|
222
|
|
400
|
223 if (len == 0) {
|
|
|
224 return NULL;
|
|
|
225 }
|
|
|
226
|
|
312
|
227 if (hash->wc_head && hash->wc_head->hash.buckets) {
|
|
|
228 value = ngx_hash_find_wc_head(hash->wc_head, name, len);
|
|
|
229
|
|
|
230 if (value) {
|
|
|
231 return value;
|
|
|
232 }
|
|
|
233 }
|
|
|
234
|
|
|
235 if (hash->wc_tail && hash->wc_tail->hash.buckets) {
|
|
|
236 value = ngx_hash_find_wc_tail(hash->wc_tail, name, len);
|
|
|
237
|
|
|
238 if (value) {
|
|
|
239 return value;
|
|
|
240 }
|
|
|
241 }
|
|
|
242
|
|
|
243 return NULL;
|
|
|
244 }
|
|
|
245
|
|
|
246
|
|
138
|
247 #define NGX_HASH_ELT_SIZE(name) \
|
|
570
|
248 (sizeof(void *) + ngx_align((name)->key.len + 2, sizeof(void *)))
|
|
138
|
249
|
|
56
|
250 ngx_int_t
|
|
138
|
251 ngx_hash_init(ngx_hash_init_t *hinit, ngx_hash_key_t *names, ngx_uint_t nelts)
|
|
|
252 {
|
|
|
253 u_char *elts;
|
|
144
|
254 size_t len;
|
|
|
255 u_short *test;
|
|
138
|
256 ngx_uint_t i, n, key, size, start, bucket_size;
|
|
|
257 ngx_hash_elt_t *elt, **buckets;
|
|
|
258
|
|
|
259 for (n = 0; n < nelts; n++) {
|
|
|
260 if (hinit->bucket_size < NGX_HASH_ELT_SIZE(&names[n]) + sizeof(void *))
|
|
|
261 {
|
|
|
262 ngx_log_error(NGX_LOG_EMERG, hinit->pool->log, 0,
|
|
144
|
263 "could not build the %s, you should "
|
|
138
|
264 "increase %s_bucket_size: %i",
|
|
|
265 hinit->name, hinit->name, hinit->bucket_size);
|
|
|
266 return NGX_ERROR;
|
|
|
267 }
|
|
|
268 }
|
|
|
269
|
|
144
|
270 test = ngx_alloc(hinit->max_size * sizeof(u_short), hinit->pool->log);
|
|
138
|
271 if (test == NULL) {
|
|
|
272 return NGX_ERROR;
|
|
|
273 }
|
|
|
274
|
|
180
|
275 bucket_size = hinit->bucket_size - sizeof(void *);
|
|
|
276
|
|
242
|
277 start = nelts / (bucket_size / (2 * sizeof(void *)));
|
|
138
|
278 start = start ? start : 1;
|
|
|
279
|
|
658
|
280 if (hinit->max_size > 10000 && nelts && hinit->max_size / nelts < 100) {
|
|
180
|
281 start = hinit->max_size - 1000;
|
|
|
282 }
|
|
138
|
283
|
|
|
284 for (size = start; size < hinit->max_size; size++) {
|
|
|
285
|
|
144
|
286 ngx_memzero(test, size * sizeof(u_short));
|
|
138
|
287
|
|
|
288 for (n = 0; n < nelts; n++) {
|
|
|
289 if (names[n].key.data == NULL) {
|
|
|
290 continue;
|
|
|
291 }
|
|
|
292
|
|
|
293 key = names[n].key_hash % size;
|
|
144
|
294 test[key] = (u_short) (test[key] + NGX_HASH_ELT_SIZE(&names[n]));
|
|
138
|
295
|
|
|
296 #if 0
|
|
|
297 ngx_log_error(NGX_LOG_ALERT, hinit->pool->log, 0,
|
|
|
298 "%ui: %ui %ui \"%V\"",
|
|
|
299 size, key, test[key], &names[n].key);
|
|
|
300 #endif
|
|
|
301
|
|
144
|
302 if (test[key] > (u_short) bucket_size) {
|
|
138
|
303 goto next;
|
|
|
304 }
|
|
|
305 }
|
|
|
306
|
|
|
307 goto found;
|
|
|
308
|
|
|
309 next:
|
|
|
310
|
|
|
311 continue;
|
|
|
312 }
|
|
|
313
|
|
|
314 ngx_log_error(NGX_LOG_EMERG, hinit->pool->log, 0,
|
|
144
|
315 "could not build the %s, you should increase "
|
|
138
|
316 "either %s_max_size: %i or %s_bucket_size: %i",
|
|
|
317 hinit->name, hinit->name, hinit->max_size,
|
|
|
318 hinit->name, hinit->bucket_size);
|
|
|
319
|
|
|
320 ngx_free(test);
|
|
|
321
|
|
|
322 return NGX_ERROR;
|
|
|
323
|
|
|
324 found:
|
|
|
325
|
|
|
326 for (i = 0; i < size; i++) {
|
|
|
327 test[i] = sizeof(void *);
|
|
|
328 }
|
|
|
329
|
|
|
330 for (n = 0; n < nelts; n++) {
|
|
|
331 if (names[n].key.data == NULL) {
|
|
|
332 continue;
|
|
|
333 }
|
|
|
334
|
|
|
335 key = names[n].key_hash % size;
|
|
144
|
336 test[key] = (u_short) (test[key] + NGX_HASH_ELT_SIZE(&names[n]));
|
|
138
|
337 }
|
|
|
338
|
|
|
339 len = 0;
|
|
|
340
|
|
|
341 for (i = 0; i < size; i++) {
|
|
|
342 if (test[i] == sizeof(void *)) {
|
|
|
343 continue;
|
|
|
344 }
|
|
|
345
|
|
144
|
346 test[i] = (u_short) (ngx_align(test[i], ngx_cacheline_size));
|
|
138
|
347
|
|
|
348 len += test[i];
|
|
|
349 }
|
|
|
350
|
|
|
351 if (hinit->hash == NULL) {
|
|
|
352 hinit->hash = ngx_pcalloc(hinit->pool, sizeof(ngx_hash_wildcard_t)
|
|
|
353 + size * sizeof(ngx_hash_elt_t *));
|
|
|
354 if (hinit->hash == NULL) {
|
|
|
355 ngx_free(test);
|
|
|
356 return NGX_ERROR;
|
|
|
357 }
|
|
|
358
|
|
|
359 buckets = (ngx_hash_elt_t **)
|
|
|
360 ((u_char *) hinit->hash + sizeof(ngx_hash_wildcard_t));
|
|
|
361
|
|
|
362 } else {
|
|
|
363 buckets = ngx_pcalloc(hinit->pool, size * sizeof(ngx_hash_elt_t *));
|
|
|
364 if (buckets == NULL) {
|
|
|
365 ngx_free(test);
|
|
|
366 return NGX_ERROR;
|
|
|
367 }
|
|
|
368 }
|
|
|
369
|
|
|
370 elts = ngx_palloc(hinit->pool, len + ngx_cacheline_size);
|
|
|
371 if (elts == NULL) {
|
|
|
372 ngx_free(test);
|
|
|
373 return NGX_ERROR;
|
|
|
374 }
|
|
|
375
|
|
|
376 elts = ngx_align_ptr(elts, ngx_cacheline_size);
|
|
|
377
|
|
|
378 for (i = 0; i < size; i++) {
|
|
|
379 if (test[i] == sizeof(void *)) {
|
|
|
380 continue;
|
|
|
381 }
|
|
|
382
|
|
|
383 buckets[i] = (ngx_hash_elt_t *) elts;
|
|
|
384 elts += test[i];
|
|
|
385
|
|
|
386 }
|
|
|
387
|
|
|
388 for (i = 0; i < size; i++) {
|
|
|
389 test[i] = 0;
|
|
|
390 }
|
|
|
391
|
|
|
392 for (n = 0; n < nelts; n++) {
|
|
|
393 if (names[n].key.data == NULL) {
|
|
|
394 continue;
|
|
|
395 }
|
|
|
396
|
|
|
397 key = names[n].key_hash % size;
|
|
|
398 elt = (ngx_hash_elt_t *) ((u_char *) buckets[key] + test[key]);
|
|
|
399
|
|
|
400 elt->value = names[n].value;
|
|
570
|
401 elt->len = (u_short) names[n].key.len;
|
|
138
|
402
|
|
392
|
403 ngx_strlow(elt->name, names[n].key.data, names[n].key.len);
|
|
138
|
404
|
|
144
|
405 test[key] = (u_short) (test[key] + NGX_HASH_ELT_SIZE(&names[n]));
|
|
138
|
406 }
|
|
|
407
|
|
|
408 for (i = 0; i < size; i++) {
|
|
|
409 if (buckets[i] == NULL) {
|
|
|
410 continue;
|
|
|
411 }
|
|
|
412
|
|
|
413 elt = (ngx_hash_elt_t *) ((u_char *) buckets[i] + test[i]);
|
|
|
414
|
|
|
415 elt->value = NULL;
|
|
|
416 }
|
|
|
417
|
|
|
418 ngx_free(test);
|
|
|
419
|
|
|
420 hinit->hash->buckets = buckets;
|
|
|
421 hinit->hash->size = size;
|
|
|
422
|
|
|
423 #if 0
|
|
|
424
|
|
|
425 for (i = 0; i < size; i++) {
|
|
|
426 ngx_str_t val;
|
|
|
427 ngx_uint_t key;
|
|
|
428
|
|
|
429 elt = buckets[i];
|
|
|
430
|
|
|
431 if (elt == NULL) {
|
|
|
432 ngx_log_error(NGX_LOG_ALERT, hinit->pool->log, 0,
|
|
|
433 "%ui: NULL", i);
|
|
|
434 continue;
|
|
|
435 }
|
|
|
436
|
|
|
437 while (elt->value) {
|
|
|
438 val.len = elt->len;
|
|
|
439 val.data = &elt->name[0];
|
|
|
440
|
|
|
441 key = hinit->key(val.data, val.len);
|
|
|
442
|
|
|
443 ngx_log_error(NGX_LOG_ALERT, hinit->pool->log, 0,
|
|
|
444 "%ui: %p \"%V\" %ui", i, elt, &val, key);
|
|
|
445
|
|
|
446 elt = (ngx_hash_elt_t *) ngx_align_ptr(&elt->name[0] + elt->len,
|
|
|
447 sizeof(void *));
|
|
|
448 }
|
|
|
449 }
|
|
|
450
|
|
|
451 #endif
|
|
|
452
|
|
|
453 return NGX_OK;
|
|
|
454 }
|
|
|
455
|
|
|
456
|
|
|
457 ngx_int_t
|
|
|
458 ngx_hash_wildcard_init(ngx_hash_init_t *hinit, ngx_hash_key_t *names,
|
|
|
459 ngx_uint_t nelts)
|
|
|
460 {
|
|
142
|
461 size_t len, dot_len;
|
|
140
|
462 ngx_uint_t i, n, dot;
|
|
138
|
463 ngx_array_t curr_names, next_names;
|
|
|
464 ngx_hash_key_t *name, *next_name;
|
|
|
465 ngx_hash_init_t h;
|
|
|
466 ngx_hash_wildcard_t *wdc;
|
|
|
467
|
|
|
468 if (ngx_array_init(&curr_names, hinit->temp_pool, nelts,
|
|
|
469 sizeof(ngx_hash_key_t))
|
|
|
470 != NGX_OK)
|
|
|
471 {
|
|
|
472 return NGX_ERROR;
|
|
|
473 }
|
|
|
474
|
|
|
475 if (ngx_array_init(&next_names, hinit->temp_pool, nelts,
|
|
|
476 sizeof(ngx_hash_key_t))
|
|
|
477 != NGX_OK)
|
|
|
478 {
|
|
|
479 return NGX_ERROR;
|
|
|
480 }
|
|
|
481
|
|
|
482 for (n = 0; n < nelts; n = i) {
|
|
|
483
|
|
|
484 #if 0
|
|
|
485 ngx_log_error(NGX_LOG_ALERT, hinit->pool->log, 0,
|
|
|
486 "wc0: \"%V\"", &names[n].key);
|
|
|
487 #endif
|
|
|
488
|
|
140
|
489 dot = 0;
|
|
|
490
|
|
138
|
491 for (len = 0; len < names[n].key.len; len++) {
|
|
|
492 if (names[n].key.data[len] == '.') {
|
|
140
|
493 dot = 1;
|
|
138
|
494 break;
|
|
|
495 }
|
|
|
496 }
|
|
|
497
|
|
|
498 name = ngx_array_push(&curr_names);
|
|
|
499 if (name == NULL) {
|
|
|
500 return NGX_ERROR;
|
|
|
501 }
|
|
|
502
|
|
140
|
503 name->key.len = len;
|
|
138
|
504 name->key.data = names[n].key.data;
|
|
|
505 name->key_hash = hinit->key(name->key.data, name->key.len);
|
|
|
506 name->value = names[n].value;
|
|
|
507
|
|
|
508 #if 0
|
|
|
509 ngx_log_error(NGX_LOG_ALERT, hinit->pool->log, 0,
|
|
142
|
510 "wc1: \"%V\" %ui", &name->key, dot);
|
|
138
|
511 #endif
|
|
|
512
|
|
142
|
513 dot_len = len + 1;
|
|
|
514
|
|
140
|
515 if (dot) {
|
|
|
516 len++;
|
|
|
517 }
|
|
|
518
|
|
138
|
519 next_names.nelts = 0;
|
|
|
520
|
|
|
521 if (names[n].key.len != len) {
|
|
|
522 next_name = ngx_array_push(&next_names);
|
|
|
523 if (next_name == NULL) {
|
|
|
524 return NGX_ERROR;
|
|
|
525 }
|
|
|
526
|
|
|
527 next_name->key.len = names[n].key.len - len;
|
|
|
528 next_name->key.data = names[n].key.data + len;
|
|
526
|
529 next_name->key_hash = 0;
|
|
138
|
530 next_name->value = names[n].value;
|
|
|
531
|
|
|
532 #if 0
|
|
|
533 ngx_log_error(NGX_LOG_ALERT, hinit->pool->log, 0,
|
|
|
534 "wc2: \"%V\"", &next_name->key);
|
|
|
535 #endif
|
|
|
536 }
|
|
|
537
|
|
|
538 for (i = n + 1; i < nelts; i++) {
|
|
|
539 if (ngx_strncmp(names[n].key.data, names[i].key.data, len) != 0) {
|
|
|
540 break;
|
|
|
541 }
|
|
|
542
|
|
142
|
543 if (!dot
|
|
|
544 && names[i].key.len > len
|
|
|
545 && names[i].key.data[len] != '.')
|
|
|
546 {
|
|
|
547 break;
|
|
|
548 }
|
|
|
549
|
|
138
|
550 next_name = ngx_array_push(&next_names);
|
|
|
551 if (next_name == NULL) {
|
|
|
552 return NGX_ERROR;
|
|
|
553 }
|
|
|
554
|
|
142
|
555 next_name->key.len = names[i].key.len - dot_len;
|
|
|
556 next_name->key.data = names[i].key.data + dot_len;
|
|
526
|
557 next_name->key_hash = 0;
|
|
138
|
558 next_name->value = names[i].value;
|
|
|
559
|
|
|
560 #if 0
|
|
|
561 ngx_log_error(NGX_LOG_ALERT, hinit->pool->log, 0,
|
|
140
|
562 "wc3: \"%V\"", &next_name->key);
|
|
138
|
563 #endif
|
|
|
564 }
|
|
|
565
|
|
|
566 if (next_names.nelts) {
|
|
142
|
567
|
|
138
|
568 h = *hinit;
|
|
|
569 h.hash = NULL;
|
|
|
570
|
|
|
571 if (ngx_hash_wildcard_init(&h, (ngx_hash_key_t *) next_names.elts,
|
|
|
572 next_names.nelts)
|
|
|
573 != NGX_OK)
|
|
|
574 {
|
|
|
575 return NGX_ERROR;
|
|
|
576 }
|
|
|
577
|
|
|
578 wdc = (ngx_hash_wildcard_t *) h.hash;
|
|
|
579
|
|
|
580 if (names[n].key.len == len) {
|
|
|
581 wdc->value = names[n].value;
|
|
|
582 }
|
|
|
583
|
|
446
|
584 name->value = (void *) ((uintptr_t) wdc | (dot ? 3 : 2));
|
|
394
|
585
|
|
|
586 } else if (dot) {
|
|
|
587 name->value = (void *) ((uintptr_t) name->value | 1);
|
|
138
|
588 }
|
|
|
589 }
|
|
|
590
|
|
|
591 if (ngx_hash_init(hinit, (ngx_hash_key_t *) curr_names.elts,
|
|
|
592 curr_names.nelts)
|
|
|
593 != NGX_OK)
|
|
|
594 {
|
|
|
595 return NGX_ERROR;
|
|
|
596 }
|
|
|
597
|
|
|
598 return NGX_OK;
|
|
|
599 }
|
|
|
600
|
|
|
601
|
|
|
602 ngx_uint_t
|
|
|
603 ngx_hash_key(u_char *data, size_t len)
|
|
|
604 {
|
|
|
605 ngx_uint_t i, key;
|
|
|
606
|
|
|
607 key = 0;
|
|
|
608
|
|
|
609 for (i = 0; i < len; i++) {
|
|
|
610 key = ngx_hash(key, data[i]);
|
|
|
611 }
|
|
|
612
|
|
|
613 return key;
|
|
|
614 }
|
|
|
615
|
|
|
616
|
|
|
617 ngx_uint_t
|
|
|
618 ngx_hash_key_lc(u_char *data, size_t len)
|
|
|
619 {
|
|
|
620 ngx_uint_t i, key;
|
|
|
621
|
|
|
622 key = 0;
|
|
|
623
|
|
|
624 for (i = 0; i < len; i++) {
|
|
|
625 key = ngx_hash(key, ngx_tolower(data[i]));
|
|
|
626 }
|
|
|
627
|
|
|
628 return key;
|
|
|
629 }
|
|
|
630
|
|
|
631
|
|
392
|
632 ngx_uint_t
|
|
|
633 ngx_hash_strlow(u_char *dst, u_char *src, size_t n)
|
|
|
634 {
|
|
|
635 ngx_uint_t key;
|
|
|
636
|
|
|
637 key = 0;
|
|
|
638
|
|
|
639 while (n--) {
|
|
|
640 *dst = ngx_tolower(*src);
|
|
|
641 key = ngx_hash(key, *dst);
|
|
|
642 dst++;
|
|
|
643 src++;
|
|
|
644 }
|
|
|
645
|
|
|
646 return key;
|
|
|
647 }
|
|
|
648
|
|
|
649
|
|
138
|
650 ngx_int_t
|
|
142
|
651 ngx_hash_keys_array_init(ngx_hash_keys_arrays_t *ha, ngx_uint_t type)
|
|
|
652 {
|
|
|
653 ngx_uint_t asize;
|
|
|
654
|
|
|
655 if (type == NGX_HASH_SMALL) {
|
|
|
656 asize = 4;
|
|
|
657 ha->hsize = 107;
|
|
|
658
|
|
|
659 } else {
|
|
|
660 asize = NGX_HASH_LARGE_ASIZE;
|
|
|
661 ha->hsize = NGX_HASH_LARGE_HSIZE;
|
|
|
662 }
|
|
|
663
|
|
|
664 if (ngx_array_init(&ha->keys, ha->temp_pool, asize, sizeof(ngx_hash_key_t))
|
|
|
665 != NGX_OK)
|
|
|
666 {
|
|
|
667 return NGX_ERROR;
|
|
|
668 }
|
|
|
669
|
|
312
|
670 if (ngx_array_init(&ha->dns_wc_head, ha->temp_pool, asize,
|
|
|
671 sizeof(ngx_hash_key_t))
|
|
|
672 != NGX_OK)
|
|
|
673 {
|
|
|
674 return NGX_ERROR;
|
|
|
675 }
|
|
|
676
|
|
|
677 if (ngx_array_init(&ha->dns_wc_tail, ha->temp_pool, asize,
|
|
142
|
678 sizeof(ngx_hash_key_t))
|
|
|
679 != NGX_OK)
|
|
|
680 {
|
|
|
681 return NGX_ERROR;
|
|
|
682 }
|
|
|
683
|
|
|
684 ha->keys_hash = ngx_pcalloc(ha->temp_pool, sizeof(ngx_array_t) * ha->hsize);
|
|
|
685 if (ha->keys_hash == NULL) {
|
|
|
686 return NGX_ERROR;
|
|
|
687 }
|
|
|
688
|
|
312
|
689 ha->dns_wc_head_hash = ngx_pcalloc(ha->temp_pool,
|
|
|
690 sizeof(ngx_array_t) * ha->hsize);
|
|
|
691 if (ha->dns_wc_head_hash == NULL) {
|
|
|
692 return NGX_ERROR;
|
|
|
693 }
|
|
|
694
|
|
|
695 ha->dns_wc_tail_hash = ngx_pcalloc(ha->temp_pool,
|
|
|
696 sizeof(ngx_array_t) * ha->hsize);
|
|
|
697 if (ha->dns_wc_tail_hash == NULL) {
|
|
142
|
698 return NGX_ERROR;
|
|
|
699 }
|
|
|
700
|
|
|
701 return NGX_OK;
|
|
|
702 }
|
|
|
703
|
|
|
704
|
|
|
705 ngx_int_t
|
|
|
706 ngx_hash_add_key(ngx_hash_keys_arrays_t *ha, ngx_str_t *key, void *value,
|
|
|
707 ngx_uint_t flags)
|
|
|
708 {
|
|
|
709 size_t len;
|
|
312
|
710 u_char *p;
|
|
142
|
711 ngx_str_t *name;
|
|
312
|
712 ngx_uint_t i, k, n, skip, last;
|
|
|
713 ngx_array_t *keys, *hwc;
|
|
142
|
714 ngx_hash_key_t *hk;
|
|
|
715
|
|
312
|
716 last = key->len;
|
|
|
717
|
|
|
718 if (flags & NGX_HASH_WILDCARD_KEY) {
|
|
142
|
719
|
|
312
|
720 /*
|
|
|
721 * supported wildcards:
|
|
|
722 * "*.example.com", ".example.com", and "www.example.*"
|
|
|
723 */
|
|
142
|
724
|
|
312
|
725 n = 0;
|
|
142
|
726
|
|
|
727 for (i = 0; i < key->len; i++) {
|
|
312
|
728
|
|
|
729 if (key->data[i] == '*') {
|
|
|
730 if (++n > 1) {
|
|
|
731 return NGX_DECLINED;
|
|
|
732 }
|
|
|
733 }
|
|
|
734
|
|
|
735 if (key->data[i] == '.' && key->data[i + 1] == '.') {
|
|
|
736 return NGX_DECLINED;
|
|
146
|
737 }
|
|
312
|
738 }
|
|
|
739
|
|
|
740 if (key->len > 1 && key->data[0] == '.') {
|
|
|
741 skip = 1;
|
|
|
742 goto wildcard;
|
|
|
743 }
|
|
|
744
|
|
|
745 if (key->len > 2) {
|
|
|
746
|
|
|
747 if (key->data[0] == '*' && key->data[1] == '.') {
|
|
|
748 skip = 2;
|
|
|
749 goto wildcard;
|
|
|
750 }
|
|
|
751
|
|
|
752 if (key->data[i - 2] == '.' && key->data[i - 1] == '*') {
|
|
|
753 skip = 0;
|
|
|
754 last -= 2;
|
|
|
755 goto wildcard;
|
|
|
756 }
|
|
142
|
757 }
|
|
|
758
|
|
312
|
759 if (n) {
|
|
|
760 return NGX_DECLINED;
|
|
|
761 }
|
|
|
762 }
|
|
|
763
|
|
|
764 /* exact hash */
|
|
|
765
|
|
|
766 k = 0;
|
|
|
767
|
|
|
768 for (i = 0; i < last; i++) {
|
|
|
769 if (!(flags & NGX_HASH_READONLY_KEY)) {
|
|
|
770 key->data[i] = ngx_tolower(key->data[i]);
|
|
|
771 }
|
|
|
772 k = ngx_hash(k, key->data[i]);
|
|
|
773 }
|
|
|
774
|
|
|
775 k %= ha->hsize;
|
|
|
776
|
|
|
777 /* check conflicts in exact hash */
|
|
|
778
|
|
|
779 name = ha->keys_hash[k].elts;
|
|
|
780
|
|
|
781 if (name) {
|
|
|
782 for (i = 0; i < ha->keys_hash[k].nelts; i++) {
|
|
|
783 if (last != name[i].len) {
|
|
|
784 continue;
|
|
|
785 }
|
|
|
786
|
|
|
787 if (ngx_strncmp(key->data, name[i].data, last) == 0) {
|
|
|
788 return NGX_BUSY;
|
|
|
789 }
|
|
|
790 }
|
|
142
|
791
|
|
312
|
792 } else {
|
|
|
793 if (ngx_array_init(&ha->keys_hash[k], ha->temp_pool, 4,
|
|
|
794 sizeof(ngx_str_t))
|
|
|
795 != NGX_OK)
|
|
|
796 {
|
|
|
797 return NGX_ERROR;
|
|
|
798 }
|
|
|
799 }
|
|
|
800
|
|
|
801 name = ngx_array_push(&ha->keys_hash[k]);
|
|
|
802 if (name == NULL) {
|
|
|
803 return NGX_ERROR;
|
|
|
804 }
|
|
|
805
|
|
|
806 *name = *key;
|
|
|
807
|
|
|
808 hk = ngx_array_push(&ha->keys);
|
|
|
809 if (hk == NULL) {
|
|
|
810 return NGX_ERROR;
|
|
|
811 }
|
|
|
812
|
|
|
813 hk->key = *key;
|
|
|
814 hk->key_hash = ngx_hash_key(key->data, last);
|
|
|
815 hk->value = value;
|
|
|
816
|
|
|
817 return NGX_OK;
|
|
|
818
|
|
|
819
|
|
|
820 wildcard:
|
|
|
821
|
|
|
822 /* wildcard hash */
|
|
|
823
|
|
392
|
824 k = ngx_hash_strlow(&key->data[skip], &key->data[skip], last - skip);
|
|
312
|
825
|
|
|
826 k %= ha->hsize;
|
|
|
827
|
|
|
828 if (skip == 1) {
|
|
|
829
|
|
|
830 /* check conflicts in exact hash for ".example.com" */
|
|
142
|
831
|
|
|
832 name = ha->keys_hash[k].elts;
|
|
|
833
|
|
|
834 if (name) {
|
|
312
|
835 len = last - skip;
|
|
|
836
|
|
142
|
837 for (i = 0; i < ha->keys_hash[k].nelts; i++) {
|
|
312
|
838 if (len != name[i].len) {
|
|
142
|
839 continue;
|
|
|
840 }
|
|
|
841
|
|
312
|
842 if (ngx_strncmp(&key->data[1], name[i].data, len) == 0) {
|
|
142
|
843 return NGX_BUSY;
|
|
|
844 }
|
|
|
845 }
|
|
|
846
|
|
|
847 } else {
|
|
|
848 if (ngx_array_init(&ha->keys_hash[k], ha->temp_pool, 4,
|
|
|
849 sizeof(ngx_str_t))
|
|
|
850 != NGX_OK)
|
|
|
851 {
|
|
|
852 return NGX_ERROR;
|
|
|
853 }
|
|
|
854 }
|
|
|
855
|
|
|
856 name = ngx_array_push(&ha->keys_hash[k]);
|
|
|
857 if (name == NULL) {
|
|
|
858 return NGX_ERROR;
|
|
|
859 }
|
|
|
860
|
|
312
|
861 name->len = last - 1;
|
|
382
|
862 name->data = ngx_pnalloc(ha->temp_pool, name->len);
|
|
312
|
863 if (name->data == NULL) {
|
|
142
|
864 return NGX_ERROR;
|
|
|
865 }
|
|
|
866
|
|
312
|
867 ngx_memcpy(name->data, &key->data[1], name->len);
|
|
|
868 }
|
|
142
|
869
|
|
|
870
|
|
312
|
871 if (skip) {
|
|
142
|
872
|
|
|
873 /*
|
|
|
874 * convert "*.example.com" to "com.example.\0"
|
|
|
875 * and ".example.com" to "com.example\0"
|
|
|
876 */
|
|
|
877
|
|
382
|
878 p = ngx_pnalloc(ha->temp_pool, last);
|
|
312
|
879 if (p == NULL) {
|
|
168
|
880 return NGX_ERROR;
|
|
|
881 }
|
|
|
882
|
|
142
|
883 len = 0;
|
|
|
884 n = 0;
|
|
|
885
|
|
312
|
886 for (i = last - 1; i; i--) {
|
|
142
|
887 if (key->data[i] == '.') {
|
|
312
|
888 ngx_memcpy(&p[n], &key->data[i + 1], len);
|
|
142
|
889 n += len;
|
|
312
|
890 p[n++] = '.';
|
|
142
|
891 len = 0;
|
|
|
892 continue;
|
|
|
893 }
|
|
|
894
|
|
|
895 len++;
|
|
|
896 }
|
|
|
897
|
|
|
898 if (len) {
|
|
312
|
899 ngx_memcpy(&p[n], &key->data[1], len);
|
|
142
|
900 n += len;
|
|
|
901 }
|
|
|
902
|
|
312
|
903 p[n] = '\0';
|
|
168
|
904
|
|
312
|
905 hwc = &ha->dns_wc_head;
|
|
|
906 keys = &ha->dns_wc_head_hash[k];
|
|
|
907
|
|
|
908 } else {
|
|
168
|
909
|
|
312
|
910 /* convert "www.example.*" to "www.example\0" */
|
|
168
|
911
|
|
312
|
912 last++;
|
|
|
913
|
|
382
|
914 p = ngx_pnalloc(ha->temp_pool, last);
|
|
330
|
915 if (p == NULL) {
|
|
|
916 return NGX_ERROR;
|
|
|
917 }
|
|
|
918
|
|
336
|
919 ngx_cpystrn(p, key->data, last);
|
|
330
|
920
|
|
312
|
921 hwc = &ha->dns_wc_tail;
|
|
|
922 keys = &ha->dns_wc_tail_hash[k];
|
|
|
923 }
|
|
142
|
924
|
|
|
925
|
|
312
|
926 hk = ngx_array_push(hwc);
|
|
|
927 if (hk == NULL) {
|
|
|
928 return NGX_ERROR;
|
|
|
929 }
|
|
142
|
930
|
|
312
|
931 hk->key.len = last - 1;
|
|
|
932 hk->key.data = p;
|
|
|
933 hk->key_hash = 0;
|
|
|
934 hk->value = value;
|
|
142
|
935
|
|
|
936
|
|
312
|
937 /* check conflicts in wildcard hash */
|
|
|
938
|
|
|
939 name = keys->elts;
|
|
142
|
940
|
|
312
|
941 if (name) {
|
|
|
942 len = last - skip;
|
|
|
943
|
|
|
944 for (i = 0; i < keys->nelts; i++) {
|
|
|
945 if (len != name[i].len) {
|
|
|
946 continue;
|
|
142
|
947 }
|
|
|
948
|
|
312
|
949 if (ngx_strncmp(key->data + skip, name[i].data, len) == 0) {
|
|
|
950 return NGX_BUSY;
|
|
142
|
951 }
|
|
|
952 }
|
|
|
953
|
|
312
|
954 } else {
|
|
|
955 if (ngx_array_init(keys, ha->temp_pool, 4, sizeof(ngx_str_t)) != NGX_OK)
|
|
|
956 {
|
|
142
|
957 return NGX_ERROR;
|
|
|
958 }
|
|
312
|
959 }
|
|
142
|
960
|
|
312
|
961 name = ngx_array_push(keys);
|
|
|
962 if (name == NULL) {
|
|
|
963 return NGX_ERROR;
|
|
|
964 }
|
|
168
|
965
|
|
312
|
966 name->len = last - skip;
|
|
382
|
967 name->data = ngx_pnalloc(ha->temp_pool, name->len);
|
|
312
|
968 if (name->data == NULL) {
|
|
|
969 return NGX_ERROR;
|
|
142
|
970 }
|
|
|
971
|
|
312
|
972 ngx_memcpy(name->data, key->data + skip, name->len);
|
|
|
973
|
|
142
|
974 return NGX_OK;
|
|
|
975 }
|
