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