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