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