|
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
|
|
|
223 if (hash->wc_head && hash->wc_head->hash.buckets) {
|
|
|
224 value = ngx_hash_find_wc_head(hash->wc_head, name, len);
|
|
|
225
|
|
|
226 if (value) {
|
|
|
227 return value;
|
|
|
228 }
|
|
|
229 }
|
|
|
230
|
|
|
231 if (hash->wc_tail && hash->wc_tail->hash.buckets) {
|
|
|
232 value = ngx_hash_find_wc_tail(hash->wc_tail, name, len);
|
|
|
233
|
|
|
234 if (value) {
|
|
|
235 return value;
|
|
|
236 }
|
|
|
237 }
|
|
|
238
|
|
|
239 return NULL;
|
|
|
240 }
|
|
|
241
|
|
|
242
|
|
138
|
243 #define NGX_HASH_ELT_SIZE(name) \
|
|
144
|
244 (sizeof(void *) + ngx_align((name)->key.len + 1, sizeof(void *)))
|
|
138
|
245
|
|
56
|
246 ngx_int_t
|
|
138
|
247 ngx_hash_init(ngx_hash_init_t *hinit, ngx_hash_key_t *names, ngx_uint_t nelts)
|
|
|
248 {
|
|
|
249 u_char *elts;
|
|
144
|
250 size_t len;
|
|
|
251 u_short *test;
|
|
138
|
252 ngx_uint_t i, n, key, size, start, bucket_size;
|
|
|
253 ngx_hash_elt_t *elt, **buckets;
|
|
|
254
|
|
|
255 for (n = 0; n < nelts; n++) {
|
|
|
256 if (names[n].key.len >= 255) {
|
|
|
257 ngx_log_error(NGX_LOG_EMERG, hinit->pool->log, 0,
|
|
|
258 "the \"%V\" value to hash is to long: %uz bytes, "
|
|
|
259 "the maximum length can be 255 bytes only",
|
|
|
260 &names[n].key, names[n].key.len);
|
|
|
261 return NGX_ERROR;
|
|
|
262 }
|
|
|
263
|
|
|
264 if (hinit->bucket_size < NGX_HASH_ELT_SIZE(&names[n]) + sizeof(void *))
|
|
|
265 {
|
|
|
266 ngx_log_error(NGX_LOG_EMERG, hinit->pool->log, 0,
|
|
144
|
267 "could not build the %s, you should "
|
|
138
|
268 "increase %s_bucket_size: %i",
|
|
|
269 hinit->name, hinit->name, hinit->bucket_size);
|
|
|
270 return NGX_ERROR;
|
|
|
271 }
|
|
|
272 }
|
|
|
273
|
|
144
|
274 test = ngx_alloc(hinit->max_size * sizeof(u_short), hinit->pool->log);
|
|
138
|
275 if (test == NULL) {
|
|
|
276 return NGX_ERROR;
|
|
|
277 }
|
|
|
278
|
|
180
|
279 bucket_size = hinit->bucket_size - sizeof(void *);
|
|
|
280
|
|
242
|
281 start = nelts / (bucket_size / (2 * sizeof(void *)));
|
|
138
|
282 start = start ? start : 1;
|
|
|
283
|
|
180
|
284 if (hinit->max_size > 10000 && hinit->max_size / nelts < 100) {
|
|
|
285 start = hinit->max_size - 1000;
|
|
|
286 }
|
|
138
|
287
|
|
|
288 for (size = start; size < hinit->max_size; size++) {
|
|
|
289
|
|
144
|
290 ngx_memzero(test, size * sizeof(u_short));
|
|
138
|
291
|
|
|
292 for (n = 0; n < nelts; n++) {
|
|
|
293 if (names[n].key.data == NULL) {
|
|
|
294 continue;
|
|
|
295 }
|
|
|
296
|
|
|
297 key = names[n].key_hash % size;
|
|
144
|
298 test[key] = (u_short) (test[key] + NGX_HASH_ELT_SIZE(&names[n]));
|
|
138
|
299
|
|
|
300 #if 0
|
|
|
301 ngx_log_error(NGX_LOG_ALERT, hinit->pool->log, 0,
|
|
|
302 "%ui: %ui %ui \"%V\"",
|
|
|
303 size, key, test[key], &names[n].key);
|
|
|
304 #endif
|
|
|
305
|
|
144
|
306 if (test[key] > (u_short) bucket_size) {
|
|
138
|
307 goto next;
|
|
|
308 }
|
|
|
309 }
|
|
|
310
|
|
|
311 goto found;
|
|
|
312
|
|
|
313 next:
|
|
|
314
|
|
|
315 continue;
|
|
|
316 }
|
|
|
317
|
|
|
318 ngx_log_error(NGX_LOG_EMERG, hinit->pool->log, 0,
|
|
144
|
319 "could not build the %s, you should increase "
|
|
138
|
320 "either %s_max_size: %i or %s_bucket_size: %i",
|
|
|
321 hinit->name, hinit->name, hinit->max_size,
|
|
|
322 hinit->name, hinit->bucket_size);
|
|
|
323
|
|
|
324 ngx_free(test);
|
|
|
325
|
|
|
326 return NGX_ERROR;
|
|
|
327
|
|
|
328 found:
|
|
|
329
|
|
|
330 for (i = 0; i < size; i++) {
|
|
|
331 test[i] = sizeof(void *);
|
|
|
332 }
|
|
|
333
|
|
|
334 for (n = 0; n < nelts; n++) {
|
|
|
335 if (names[n].key.data == NULL) {
|
|
|
336 continue;
|
|
|
337 }
|
|
|
338
|
|
|
339 key = names[n].key_hash % size;
|
|
144
|
340 test[key] = (u_short) (test[key] + NGX_HASH_ELT_SIZE(&names[n]));
|
|
138
|
341 }
|
|
|
342
|
|
|
343 len = 0;
|
|
|
344
|
|
|
345 for (i = 0; i < size; i++) {
|
|
|
346 if (test[i] == sizeof(void *)) {
|
|
|
347 continue;
|
|
|
348 }
|
|
|
349
|
|
144
|
350 test[i] = (u_short) (ngx_align(test[i], ngx_cacheline_size));
|
|
138
|
351
|
|
|
352 len += test[i];
|
|
|
353 }
|
|
|
354
|
|
|
355 if (hinit->hash == NULL) {
|
|
|
356 hinit->hash = ngx_pcalloc(hinit->pool, sizeof(ngx_hash_wildcard_t)
|
|
|
357 + size * sizeof(ngx_hash_elt_t *));
|
|
|
358 if (hinit->hash == NULL) {
|
|
|
359 ngx_free(test);
|
|
|
360 return NGX_ERROR;
|
|
|
361 }
|
|
|
362
|
|
|
363 buckets = (ngx_hash_elt_t **)
|
|
|
364 ((u_char *) hinit->hash + sizeof(ngx_hash_wildcard_t));
|
|
|
365
|
|
|
366 } else {
|
|
|
367 buckets = ngx_pcalloc(hinit->pool, size * sizeof(ngx_hash_elt_t *));
|
|
|
368 if (buckets == NULL) {
|
|
|
369 ngx_free(test);
|
|
|
370 return NGX_ERROR;
|
|
|
371 }
|
|
|
372 }
|
|
|
373
|
|
|
374 elts = ngx_palloc(hinit->pool, len + ngx_cacheline_size);
|
|
|
375 if (elts == NULL) {
|
|
|
376 ngx_free(test);
|
|
|
377 return NGX_ERROR;
|
|
|
378 }
|
|
|
379
|
|
|
380 elts = ngx_align_ptr(elts, ngx_cacheline_size);
|
|
|
381
|
|
|
382 for (i = 0; i < size; i++) {
|
|
|
383 if (test[i] == sizeof(void *)) {
|
|
|
384 continue;
|
|
|
385 }
|
|
|
386
|
|
|
387 buckets[i] = (ngx_hash_elt_t *) elts;
|
|
|
388 elts += test[i];
|
|
|
389
|
|
|
390 }
|
|
|
391
|
|
|
392 for (i = 0; i < size; i++) {
|
|
|
393 test[i] = 0;
|
|
|
394 }
|
|
|
395
|
|
|
396 for (n = 0; n < nelts; n++) {
|
|
|
397 if (names[n].key.data == NULL) {
|
|
|
398 continue;
|
|
|
399 }
|
|
|
400
|
|
|
401 key = names[n].key_hash % size;
|
|
|
402 elt = (ngx_hash_elt_t *) ((u_char *) buckets[key] + test[key]);
|
|
|
403
|
|
|
404 elt->value = names[n].value;
|
|
|
405 elt->len = (u_char) names[n].key.len;
|
|
|
406
|
|
392
|
407 ngx_strlow(elt->name, names[n].key.data, names[n].key.len);
|
|
138
|
408
|
|
144
|
409 test[key] = (u_short) (test[key] + NGX_HASH_ELT_SIZE(&names[n]));
|
|
138
|
410 }
|
|
|
411
|
|
|
412 for (i = 0; i < size; i++) {
|
|
|
413 if (buckets[i] == NULL) {
|
|
|
414 continue;
|
|
|
415 }
|
|
|
416
|
|
|
417 elt = (ngx_hash_elt_t *) ((u_char *) buckets[i] + test[i]);
|
|
|
418
|
|
|
419 elt->value = NULL;
|
|
|
420 }
|
|
|
421
|
|
|
422 ngx_free(test);
|
|
|
423
|
|
|
424 hinit->hash->buckets = buckets;
|
|
|
425 hinit->hash->size = size;
|
|
|
426
|
|
|
427 #if 0
|
|
|
428
|
|
|
429 for (i = 0; i < size; i++) {
|
|
|
430 ngx_str_t val;
|
|
|
431 ngx_uint_t key;
|
|
|
432
|
|
|
433 elt = buckets[i];
|
|
|
434
|
|
|
435 if (elt == NULL) {
|
|
|
436 ngx_log_error(NGX_LOG_ALERT, hinit->pool->log, 0,
|
|
|
437 "%ui: NULL", i);
|
|
|
438 continue;
|
|
|
439 }
|
|
|
440
|
|
|
441 while (elt->value) {
|
|
|
442 val.len = elt->len;
|
|
|
443 val.data = &elt->name[0];
|
|
|
444
|
|
|
445 key = hinit->key(val.data, val.len);
|
|
|
446
|
|
|
447 ngx_log_error(NGX_LOG_ALERT, hinit->pool->log, 0,
|
|
|
448 "%ui: %p \"%V\" %ui", i, elt, &val, key);
|
|
|
449
|
|
|
450 elt = (ngx_hash_elt_t *) ngx_align_ptr(&elt->name[0] + elt->len,
|
|
|
451 sizeof(void *));
|
|
|
452 }
|
|
|
453 }
|
|
|
454
|
|
|
455 #endif
|
|
|
456
|
|
|
457 return NGX_OK;
|
|
|
458 }
|
|
|
459
|
|
|
460
|
|
|
461 ngx_int_t
|
|
|
462 ngx_hash_wildcard_init(ngx_hash_init_t *hinit, ngx_hash_key_t *names,
|
|
|
463 ngx_uint_t nelts)
|
|
|
464 {
|
|
142
|
465 size_t len, dot_len;
|
|
140
|
466 ngx_uint_t i, n, dot;
|
|
138
|
467 ngx_array_t curr_names, next_names;
|
|
|
468 ngx_hash_key_t *name, *next_name;
|
|
|
469 ngx_hash_init_t h;
|
|
|
470 ngx_hash_wildcard_t *wdc;
|
|
|
471
|
|
|
472 if (ngx_array_init(&curr_names, hinit->temp_pool, nelts,
|
|
|
473 sizeof(ngx_hash_key_t))
|
|
|
474 != NGX_OK)
|
|
|
475 {
|
|
|
476 return NGX_ERROR;
|
|
|
477 }
|
|
|
478
|
|
|
479 if (ngx_array_init(&next_names, hinit->temp_pool, nelts,
|
|
|
480 sizeof(ngx_hash_key_t))
|
|
|
481 != NGX_OK)
|
|
|
482 {
|
|
|
483 return NGX_ERROR;
|
|
|
484 }
|
|
|
485
|
|
|
486 for (n = 0; n < nelts; n = i) {
|
|
|
487
|
|
|
488 #if 0
|
|
|
489 ngx_log_error(NGX_LOG_ALERT, hinit->pool->log, 0,
|
|
|
490 "wc0: \"%V\"", &names[n].key);
|
|
|
491 #endif
|
|
|
492
|
|
140
|
493 dot = 0;
|
|
|
494
|
|
138
|
495 for (len = 0; len < names[n].key.len; len++) {
|
|
|
496 if (names[n].key.data[len] == '.') {
|
|
140
|
497 dot = 1;
|
|
138
|
498 break;
|
|
|
499 }
|
|
|
500 }
|
|
|
501
|
|
|
502 name = ngx_array_push(&curr_names);
|
|
|
503 if (name == NULL) {
|
|
|
504 return NGX_ERROR;
|
|
|
505 }
|
|
|
506
|
|
140
|
507 name->key.len = len;
|
|
138
|
508 name->key.data = names[n].key.data;
|
|
|
509 name->key_hash = hinit->key(name->key.data, name->key.len);
|
|
|
510 name->value = names[n].value;
|
|
|
511
|
|
|
512 #if 0
|
|
|
513 ngx_log_error(NGX_LOG_ALERT, hinit->pool->log, 0,
|
|
142
|
514 "wc1: \"%V\" %ui", &name->key, dot);
|
|
138
|
515 #endif
|
|
|
516
|
|
142
|
517 dot_len = len + 1;
|
|
|
518
|
|
140
|
519 if (dot) {
|
|
|
520 len++;
|
|
|
521 }
|
|
|
522
|
|
138
|
523 next_names.nelts = 0;
|
|
|
524
|
|
|
525 if (names[n].key.len != len) {
|
|
|
526 next_name = ngx_array_push(&next_names);
|
|
|
527 if (next_name == NULL) {
|
|
|
528 return NGX_ERROR;
|
|
|
529 }
|
|
|
530
|
|
|
531 next_name->key.len = names[n].key.len - len;
|
|
|
532 next_name->key.data = names[n].key.data + len;
|
|
|
533 next_name->key_hash= 0;
|
|
|
534 next_name->value = names[n].value;
|
|
|
535
|
|
|
536 #if 0
|
|
|
537 ngx_log_error(NGX_LOG_ALERT, hinit->pool->log, 0,
|
|
|
538 "wc2: \"%V\"", &next_name->key);
|
|
|
539 #endif
|
|
|
540 }
|
|
|
541
|
|
|
542 for (i = n + 1; i < nelts; i++) {
|
|
|
543 if (ngx_strncmp(names[n].key.data, names[i].key.data, len) != 0) {
|
|
|
544 break;
|
|
|
545 }
|
|
|
546
|
|
142
|
547 if (!dot
|
|
|
548 && names[i].key.len > len
|
|
|
549 && names[i].key.data[len] != '.')
|
|
|
550 {
|
|
|
551 break;
|
|
|
552 }
|
|
|
553
|
|
138
|
554 next_name = ngx_array_push(&next_names);
|
|
|
555 if (next_name == NULL) {
|
|
|
556 return NGX_ERROR;
|
|
|
557 }
|
|
|
558
|
|
142
|
559 next_name->key.len = names[i].key.len - dot_len;
|
|
|
560 next_name->key.data = names[i].key.data + dot_len;
|
|
138
|
561 next_name->key_hash= 0;
|
|
|
562 next_name->value = names[i].value;
|
|
|
563
|
|
|
564 #if 0
|
|
|
565 ngx_log_error(NGX_LOG_ALERT, hinit->pool->log, 0,
|
|
140
|
566 "wc3: \"%V\"", &next_name->key);
|
|
138
|
567 #endif
|
|
|
568 }
|
|
|
569
|
|
|
570 if (next_names.nelts) {
|
|
142
|
571
|
|
138
|
572 h = *hinit;
|
|
|
573 h.hash = NULL;
|
|
|
574
|
|
|
575 if (ngx_hash_wildcard_init(&h, (ngx_hash_key_t *) next_names.elts,
|
|
|
576 next_names.nelts)
|
|
|
577 != NGX_OK)
|
|
|
578 {
|
|
|
579 return NGX_ERROR;
|
|
|
580 }
|
|
|
581
|
|
|
582 wdc = (ngx_hash_wildcard_t *) h.hash;
|
|
|
583
|
|
|
584 if (names[n].key.len == len) {
|
|
|
585 wdc->value = names[n].value;
|
|
|
586 }
|
|
|
587
|
|
394
|
588 name->value = (void *) ((uintptr_t) wdc | (dot ? 3 : 1));
|
|
|
589
|
|
|
590 } else if (dot) {
|
|
|
591 name->value = (void *) ((uintptr_t) name->value | 1);
|
|
138
|
592 }
|
|
|
593 }
|
|
|
594
|
|
|
595 if (ngx_hash_init(hinit, (ngx_hash_key_t *) curr_names.elts,
|
|
|
596 curr_names.nelts)
|
|
|
597 != NGX_OK)
|
|
|
598 {
|
|
|
599 return NGX_ERROR;
|
|
|
600 }
|
|
|
601
|
|
|
602 return NGX_OK;
|
|
|
603 }
|
|
|
604
|
|
|
605
|
|
|
606 ngx_uint_t
|
|
|
607 ngx_hash_key(u_char *data, size_t len)
|
|
|
608 {
|
|
|
609 ngx_uint_t i, key;
|
|
|
610
|
|
|
611 key = 0;
|
|
|
612
|
|
|
613 for (i = 0; i < len; i++) {
|
|
|
614 key = ngx_hash(key, data[i]);
|
|
|
615 }
|
|
|
616
|
|
|
617 return key;
|
|
|
618 }
|
|
|
619
|
|
|
620
|
|
|
621 ngx_uint_t
|
|
|
622 ngx_hash_key_lc(u_char *data, size_t len)
|
|
|
623 {
|
|
|
624 ngx_uint_t i, key;
|
|
|
625
|
|
|
626 key = 0;
|
|
|
627
|
|
|
628 for (i = 0; i < len; i++) {
|
|
|
629 key = ngx_hash(key, ngx_tolower(data[i]));
|
|
|
630 }
|
|
|
631
|
|
|
632 return key;
|
|
|
633 }
|
|
|
634
|
|
|
635
|
|
392
|
636 ngx_uint_t
|
|
|
637 ngx_hash_strlow(u_char *dst, u_char *src, size_t n)
|
|
|
638 {
|
|
|
639 ngx_uint_t key;
|
|
|
640
|
|
|
641 key = 0;
|
|
|
642
|
|
|
643 while (n--) {
|
|
|
644 *dst = ngx_tolower(*src);
|
|
|
645 key = ngx_hash(key, *dst);
|
|
|
646 dst++;
|
|
|
647 src++;
|
|
|
648 }
|
|
|
649
|
|
|
650 return key;
|
|
|
651 }
|
|
|
652
|
|
|
653
|
|
138
|
654 ngx_int_t
|
|
142
|
655 ngx_hash_keys_array_init(ngx_hash_keys_arrays_t *ha, ngx_uint_t type)
|
|
|
656 {
|
|
|
657 ngx_uint_t asize;
|
|
|
658
|
|
|
659 if (type == NGX_HASH_SMALL) {
|
|
|
660 asize = 4;
|
|
|
661 ha->hsize = 107;
|
|
|
662
|
|
|
663 } else {
|
|
|
664 asize = NGX_HASH_LARGE_ASIZE;
|
|
|
665 ha->hsize = NGX_HASH_LARGE_HSIZE;
|
|
|
666 }
|
|
|
667
|
|
|
668 if (ngx_array_init(&ha->keys, ha->temp_pool, asize, sizeof(ngx_hash_key_t))
|
|
|
669 != NGX_OK)
|
|
|
670 {
|
|
|
671 return NGX_ERROR;
|
|
|
672 }
|
|
|
673
|
|
312
|
674 if (ngx_array_init(&ha->dns_wc_head, ha->temp_pool, asize,
|
|
|
675 sizeof(ngx_hash_key_t))
|
|
|
676 != NGX_OK)
|
|
|
677 {
|
|
|
678 return NGX_ERROR;
|
|
|
679 }
|
|
|
680
|
|
|
681 if (ngx_array_init(&ha->dns_wc_tail, ha->temp_pool, asize,
|
|
142
|
682 sizeof(ngx_hash_key_t))
|
|
|
683 != NGX_OK)
|
|
|
684 {
|
|
|
685 return NGX_ERROR;
|
|
|
686 }
|
|
|
687
|
|
|
688 ha->keys_hash = ngx_pcalloc(ha->temp_pool, sizeof(ngx_array_t) * ha->hsize);
|
|
|
689 if (ha->keys_hash == NULL) {
|
|
|
690 return NGX_ERROR;
|
|
|
691 }
|
|
|
692
|
|
312
|
693 ha->dns_wc_head_hash = ngx_pcalloc(ha->temp_pool,
|
|
|
694 sizeof(ngx_array_t) * ha->hsize);
|
|
|
695 if (ha->dns_wc_head_hash == NULL) {
|
|
|
696 return NGX_ERROR;
|
|
|
697 }
|
|
|
698
|
|
|
699 ha->dns_wc_tail_hash = ngx_pcalloc(ha->temp_pool,
|
|
|
700 sizeof(ngx_array_t) * ha->hsize);
|
|
|
701 if (ha->dns_wc_tail_hash == NULL) {
|
|
142
|
702 return NGX_ERROR;
|
|
|
703 }
|
|
|
704
|
|
|
705 return NGX_OK;
|
|
|
706 }
|
|
|
707
|
|
|
708
|
|
|
709 ngx_int_t
|
|
|
710 ngx_hash_add_key(ngx_hash_keys_arrays_t *ha, ngx_str_t *key, void *value,
|
|
|
711 ngx_uint_t flags)
|
|
|
712 {
|
|
|
713 size_t len;
|
|
312
|
714 u_char *p;
|
|
142
|
715 ngx_str_t *name;
|
|
312
|
716 ngx_uint_t i, k, n, skip, last;
|
|
|
717 ngx_array_t *keys, *hwc;
|
|
142
|
718 ngx_hash_key_t *hk;
|
|
|
719
|
|
312
|
720 last = key->len;
|
|
|
721
|
|
|
722 if (flags & NGX_HASH_WILDCARD_KEY) {
|
|
142
|
723
|
|
312
|
724 /*
|
|
|
725 * supported wildcards:
|
|
|
726 * "*.example.com", ".example.com", and "www.example.*"
|
|
|
727 */
|
|
142
|
728
|
|
312
|
729 n = 0;
|
|
142
|
730
|
|
|
731 for (i = 0; i < key->len; i++) {
|
|
312
|
732
|
|
|
733 if (key->data[i] == '*') {
|
|
|
734 if (++n > 1) {
|
|
|
735 return NGX_DECLINED;
|
|
|
736 }
|
|
|
737 }
|
|
|
738
|
|
|
739 if (key->data[i] == '.' && key->data[i + 1] == '.') {
|
|
|
740 return NGX_DECLINED;
|
|
146
|
741 }
|
|
312
|
742 }
|
|
|
743
|
|
|
744 if (key->len > 1 && key->data[0] == '.') {
|
|
|
745 skip = 1;
|
|
|
746 goto wildcard;
|
|
|
747 }
|
|
|
748
|
|
|
749 if (key->len > 2) {
|
|
|
750
|
|
|
751 if (key->data[0] == '*' && key->data[1] == '.') {
|
|
|
752 skip = 2;
|
|
|
753 goto wildcard;
|
|
|
754 }
|
|
|
755
|
|
|
756 if (key->data[i - 2] == '.' && key->data[i - 1] == '*') {
|
|
|
757 skip = 0;
|
|
|
758 last -= 2;
|
|
|
759 goto wildcard;
|
|
|
760 }
|
|
142
|
761 }
|
|
|
762
|
|
312
|
763 if (n) {
|
|
|
764 return NGX_DECLINED;
|
|
|
765 }
|
|
|
766 }
|
|
|
767
|
|
|
768 /* exact hash */
|
|
|
769
|
|
|
770 k = 0;
|
|
|
771
|
|
|
772 for (i = 0; i < last; i++) {
|
|
|
773 if (!(flags & NGX_HASH_READONLY_KEY)) {
|
|
|
774 key->data[i] = ngx_tolower(key->data[i]);
|
|
|
775 }
|
|
|
776 k = ngx_hash(k, key->data[i]);
|
|
|
777 }
|
|
|
778
|
|
|
779 k %= ha->hsize;
|
|
|
780
|
|
|
781 /* check conflicts in exact hash */
|
|
|
782
|
|
|
783 name = ha->keys_hash[k].elts;
|
|
|
784
|
|
|
785 if (name) {
|
|
|
786 for (i = 0; i < ha->keys_hash[k].nelts; i++) {
|
|
|
787 if (last != name[i].len) {
|
|
|
788 continue;
|
|
|
789 }
|
|
|
790
|
|
|
791 if (ngx_strncmp(key->data, name[i].data, last) == 0) {
|
|
|
792 return NGX_BUSY;
|
|
|
793 }
|
|
|
794 }
|
|
142
|
795
|
|
312
|
796 } else {
|
|
|
797 if (ngx_array_init(&ha->keys_hash[k], ha->temp_pool, 4,
|
|
|
798 sizeof(ngx_str_t))
|
|
|
799 != NGX_OK)
|
|
|
800 {
|
|
|
801 return NGX_ERROR;
|
|
|
802 }
|
|
|
803 }
|
|
|
804
|
|
|
805 name = ngx_array_push(&ha->keys_hash[k]);
|
|
|
806 if (name == NULL) {
|
|
|
807 return NGX_ERROR;
|
|
|
808 }
|
|
|
809
|
|
|
810 *name = *key;
|
|
|
811
|
|
|
812 hk = ngx_array_push(&ha->keys);
|
|
|
813 if (hk == NULL) {
|
|
|
814 return NGX_ERROR;
|
|
|
815 }
|
|
|
816
|
|
|
817 hk->key = *key;
|
|
|
818 hk->key_hash = ngx_hash_key(key->data, last);
|
|
|
819 hk->value = value;
|
|
|
820
|
|
|
821 return NGX_OK;
|
|
|
822
|
|
|
823
|
|
|
824 wildcard:
|
|
|
825
|
|
|
826 /* wildcard hash */
|
|
|
827
|
|
392
|
828 k = ngx_hash_strlow(&key->data[skip], &key->data[skip], last - skip);
|
|
312
|
829
|
|
|
830 k %= ha->hsize;
|
|
|
831
|
|
|
832 if (skip == 1) {
|
|
|
833
|
|
|
834 /* check conflicts in exact hash for ".example.com" */
|
|
142
|
835
|
|
|
836 name = ha->keys_hash[k].elts;
|
|
|
837
|
|
|
838 if (name) {
|
|
312
|
839 len = last - skip;
|
|
|
840
|
|
142
|
841 for (i = 0; i < ha->keys_hash[k].nelts; i++) {
|
|
312
|
842 if (len != name[i].len) {
|
|
142
|
843 continue;
|
|
|
844 }
|
|
|
845
|
|
312
|
846 if (ngx_strncmp(&key->data[1], name[i].data, len) == 0) {
|
|
142
|
847 return NGX_BUSY;
|
|
|
848 }
|
|
|
849 }
|
|
|
850
|
|
|
851 } else {
|
|
|
852 if (ngx_array_init(&ha->keys_hash[k], ha->temp_pool, 4,
|
|
|
853 sizeof(ngx_str_t))
|
|
|
854 != NGX_OK)
|
|
|
855 {
|
|
|
856 return NGX_ERROR;
|
|
|
857 }
|
|
|
858 }
|
|
|
859
|
|
|
860 name = ngx_array_push(&ha->keys_hash[k]);
|
|
|
861 if (name == NULL) {
|
|
|
862 return NGX_ERROR;
|
|
|
863 }
|
|
|
864
|
|
312
|
865 name->len = last - 1;
|
|
382
|
866 name->data = ngx_pnalloc(ha->temp_pool, name->len);
|
|
312
|
867 if (name->data == NULL) {
|
|
142
|
868 return NGX_ERROR;
|
|
|
869 }
|
|
|
870
|
|
312
|
871 ngx_memcpy(name->data, &key->data[1], name->len);
|
|
|
872 }
|
|
142
|
873
|
|
|
874
|
|
312
|
875 if (skip) {
|
|
142
|
876
|
|
|
877 /*
|
|
|
878 * convert "*.example.com" to "com.example.\0"
|
|
|
879 * and ".example.com" to "com.example\0"
|
|
|
880 */
|
|
|
881
|
|
382
|
882 p = ngx_pnalloc(ha->temp_pool, last);
|
|
312
|
883 if (p == NULL) {
|
|
168
|
884 return NGX_ERROR;
|
|
|
885 }
|
|
|
886
|
|
142
|
887 len = 0;
|
|
|
888 n = 0;
|
|
|
889
|
|
312
|
890 for (i = last - 1; i; i--) {
|
|
142
|
891 if (key->data[i] == '.') {
|
|
312
|
892 ngx_memcpy(&p[n], &key->data[i + 1], len);
|
|
142
|
893 n += len;
|
|
312
|
894 p[n++] = '.';
|
|
142
|
895 len = 0;
|
|
|
896 continue;
|
|
|
897 }
|
|
|
898
|
|
|
899 len++;
|
|
|
900 }
|
|
|
901
|
|
|
902 if (len) {
|
|
312
|
903 ngx_memcpy(&p[n], &key->data[1], len);
|
|
142
|
904 n += len;
|
|
|
905 }
|
|
|
906
|
|
312
|
907 p[n] = '\0';
|
|
168
|
908
|
|
312
|
909 hwc = &ha->dns_wc_head;
|
|
|
910 keys = &ha->dns_wc_head_hash[k];
|
|
|
911
|
|
|
912 } else {
|
|
168
|
913
|
|
312
|
914 /* convert "www.example.*" to "www.example\0" */
|
|
168
|
915
|
|
312
|
916 last++;
|
|
|
917
|
|
382
|
918 p = ngx_pnalloc(ha->temp_pool, last);
|
|
330
|
919 if (p == NULL) {
|
|
|
920 return NGX_ERROR;
|
|
|
921 }
|
|
|
922
|
|
336
|
923 ngx_cpystrn(p, key->data, last);
|
|
330
|
924
|
|
312
|
925 hwc = &ha->dns_wc_tail;
|
|
|
926 keys = &ha->dns_wc_tail_hash[k];
|
|
|
927 }
|
|
142
|
928
|
|
|
929
|
|
312
|
930 hk = ngx_array_push(hwc);
|
|
|
931 if (hk == NULL) {
|
|
|
932 return NGX_ERROR;
|
|
|
933 }
|
|
142
|
934
|
|
312
|
935 hk->key.len = last - 1;
|
|
|
936 hk->key.data = p;
|
|
|
937 hk->key_hash = 0;
|
|
|
938 hk->value = value;
|
|
142
|
939
|
|
|
940
|
|
312
|
941 /* check conflicts in wildcard hash */
|
|
|
942
|
|
|
943 name = keys->elts;
|
|
142
|
944
|
|
312
|
945 if (name) {
|
|
|
946 len = last - skip;
|
|
|
947
|
|
|
948 for (i = 0; i < keys->nelts; i++) {
|
|
|
949 if (len != name[i].len) {
|
|
|
950 continue;
|
|
142
|
951 }
|
|
|
952
|
|
312
|
953 if (ngx_strncmp(key->data + skip, name[i].data, len) == 0) {
|
|
|
954 return NGX_BUSY;
|
|
142
|
955 }
|
|
|
956 }
|
|
|
957
|
|
312
|
958 } else {
|
|
|
959 if (ngx_array_init(keys, ha->temp_pool, 4, sizeof(ngx_str_t)) != NGX_OK)
|
|
|
960 {
|
|
142
|
961 return NGX_ERROR;
|
|
|
962 }
|
|
312
|
963 }
|
|
142
|
964
|
|
312
|
965 name = ngx_array_push(keys);
|
|
|
966 if (name == NULL) {
|
|
|
967 return NGX_ERROR;
|
|
|
968 }
|
|
168
|
969
|
|
312
|
970 name->len = last - skip;
|
|
382
|
971 name->data = ngx_pnalloc(ha->temp_pool, name->len);
|
|
312
|
972 if (name->data == NULL) {
|
|
|
973 return NGX_ERROR;
|
|
142
|
974 }
|
|
|
975
|
|
312
|
976 ngx_memcpy(name->data, key->data + skip, name->len);
|
|
|
977
|
|
142
|
978 return NGX_OK;
|
|
|
979 }
|
