Update and clean Tomato RAF files
[tomato.git] / release / src / router / nginx / src / core / ngx_hash.c
blobb532945027cbaadbbf5bc7097b2a02ba3751dad3
2 /*
3 * Copyright (C) Igor Sysoev
4 * Copyright (C) Nginx, Inc.
5 */
8 #include <ngx_config.h>
9 #include <ngx_core.h>
12 void *
13 ngx_hash_find(ngx_hash_t *hash, ngx_uint_t key, u_char *name, size_t len)
15 ngx_uint_t i;
16 ngx_hash_elt_t *elt;
18 #if 0
19 ngx_log_error(NGX_LOG_ALERT, ngx_cycle->log, 0, "hf:\"%*s\"", len, name);
20 #endif
22 elt = hash->buckets[key % hash->size];
24 if (elt == NULL) {
25 return NULL;
28 while (elt->value) {
29 if (len != (size_t) elt->len) {
30 goto next;
33 for (i = 0; i < len; i++) {
34 if (name[i] != elt->name[i]) {
35 goto next;
39 return elt->value;
41 next:
43 elt = (ngx_hash_elt_t *) ngx_align_ptr(&elt->name[0] + elt->len,
44 sizeof(void *));
45 continue;
48 return NULL;
52 void *
53 ngx_hash_find_wc_head(ngx_hash_wildcard_t *hwc, u_char *name, size_t len)
55 void *value;
56 ngx_uint_t i, n, key;
58 #if 0
59 ngx_log_error(NGX_LOG_ALERT, ngx_cycle->log, 0, "wch:\"%*s\"", len, name);
60 #endif
62 n = len;
64 while (n) {
65 if (name[n - 1] == '.') {
66 break;
69 n--;
72 key = 0;
74 for (i = n; i < len; i++) {
75 key = ngx_hash(key, name[i]);
78 #if 0
79 ngx_log_error(NGX_LOG_ALERT, ngx_cycle->log, 0, "key:\"%ui\"", key);
80 #endif
82 value = ngx_hash_find(&hwc->hash, key, &name[n], len - n);
84 #if 0
85 ngx_log_error(NGX_LOG_ALERT, ngx_cycle->log, 0, "value:\"%p\"", value);
86 #endif
88 if (value) {
91 * the 2 low bits of value have the special meaning:
92 * 00 - value is data pointer for both "example.com"
93 * and "*.example.com";
94 * 01 - value is data pointer for "*.example.com" only;
95 * 10 - value is pointer to wildcard hash allowing
96 * both "example.com" and "*.example.com";
97 * 11 - value is pointer to wildcard hash allowing
98 * "*.example.com" only.
101 if ((uintptr_t) value & 2) {
103 if (n == 0) {
105 /* "example.com" */
107 if ((uintptr_t) value & 1) {
108 return NULL;
111 hwc = (ngx_hash_wildcard_t *)
112 ((uintptr_t) value & (uintptr_t) ~3);
113 return hwc->value;
116 hwc = (ngx_hash_wildcard_t *) ((uintptr_t) value & (uintptr_t) ~3);
118 value = ngx_hash_find_wc_head(hwc, name, n - 1);
120 if (value) {
121 return value;
124 return hwc->value;
127 if ((uintptr_t) value & 1) {
129 if (n == 0) {
131 /* "example.com" */
133 return NULL;
136 return (void *) ((uintptr_t) value & (uintptr_t) ~3);
139 return value;
142 return hwc->value;
146 void *
147 ngx_hash_find_wc_tail(ngx_hash_wildcard_t *hwc, u_char *name, size_t len)
149 void *value;
150 ngx_uint_t i, key;
152 #if 0
153 ngx_log_error(NGX_LOG_ALERT, ngx_cycle->log, 0, "wct:\"%*s\"", len, name);
154 #endif
156 key = 0;
158 for (i = 0; i < len; i++) {
159 if (name[i] == '.') {
160 break;
163 key = ngx_hash(key, name[i]);
166 if (i == len) {
167 return NULL;
170 #if 0
171 ngx_log_error(NGX_LOG_ALERT, ngx_cycle->log, 0, "key:\"%ui\"", key);
172 #endif
174 value = ngx_hash_find(&hwc->hash, key, name, i);
176 #if 0
177 ngx_log_error(NGX_LOG_ALERT, ngx_cycle->log, 0, "value:\"%p\"", value);
178 #endif
180 if (value) {
183 * the 2 low bits of value have the special meaning:
184 * 00 - value is data pointer;
185 * 11 - value is pointer to wildcard hash allowing "example.*".
188 if ((uintptr_t) value & 2) {
190 i++;
192 hwc = (ngx_hash_wildcard_t *) ((uintptr_t) value & (uintptr_t) ~3);
194 value = ngx_hash_find_wc_tail(hwc, &name[i], len - i);
196 if (value) {
197 return value;
200 return hwc->value;
203 return value;
206 return hwc->value;
210 void *
211 ngx_hash_find_combined(ngx_hash_combined_t *hash, ngx_uint_t key, u_char *name,
212 size_t len)
214 void *value;
216 if (hash->hash.buckets) {
217 value = ngx_hash_find(&hash->hash, key, name, len);
219 if (value) {
220 return value;
224 if (len == 0) {
225 return NULL;
228 if (hash->wc_head && hash->wc_head->hash.buckets) {
229 value = ngx_hash_find_wc_head(hash->wc_head, name, len);
231 if (value) {
232 return value;
236 if (hash->wc_tail && hash->wc_tail->hash.buckets) {
237 value = ngx_hash_find_wc_tail(hash->wc_tail, name, len);
239 if (value) {
240 return value;
244 return NULL;
248 #define NGX_HASH_ELT_SIZE(name) \
249 (sizeof(void *) + ngx_align((name)->key.len + 2, sizeof(void *)))
251 ngx_int_t
252 ngx_hash_init(ngx_hash_init_t *hinit, ngx_hash_key_t *names, ngx_uint_t nelts)
254 u_char *elts;
255 size_t len;
256 u_short *test;
257 ngx_uint_t i, n, key, size, start, bucket_size;
258 ngx_hash_elt_t *elt, **buckets;
260 for (n = 0; n < nelts; n++) {
261 if (hinit->bucket_size < NGX_HASH_ELT_SIZE(&names[n]) + sizeof(void *))
263 ngx_log_error(NGX_LOG_EMERG, hinit->pool->log, 0,
264 "could not build the %s, you should "
265 "increase %s_bucket_size: %i",
266 hinit->name, hinit->name, hinit->bucket_size);
267 return NGX_ERROR;
271 test = ngx_alloc(hinit->max_size * sizeof(u_short), hinit->pool->log);
272 if (test == NULL) {
273 return NGX_ERROR;
276 bucket_size = hinit->bucket_size - sizeof(void *);
278 start = nelts / (bucket_size / (2 * sizeof(void *)));
279 start = start ? start : 1;
281 if (hinit->max_size > 10000 && nelts && hinit->max_size / nelts < 100) {
282 start = hinit->max_size - 1000;
285 for (size = start; size < hinit->max_size; size++) {
287 ngx_memzero(test, size * sizeof(u_short));
289 for (n = 0; n < nelts; n++) {
290 if (names[n].key.data == NULL) {
291 continue;
294 key = names[n].key_hash % size;
295 test[key] = (u_short) (test[key] + NGX_HASH_ELT_SIZE(&names[n]));
297 #if 0
298 ngx_log_error(NGX_LOG_ALERT, hinit->pool->log, 0,
299 "%ui: %ui %ui \"%V\"",
300 size, key, test[key], &names[n].key);
301 #endif
303 if (test[key] > (u_short) bucket_size) {
304 goto next;
308 goto found;
310 next:
312 continue;
315 ngx_log_error(NGX_LOG_EMERG, hinit->pool->log, 0,
316 "could not build the %s, you should increase "
317 "either %s_max_size: %i or %s_bucket_size: %i",
318 hinit->name, hinit->name, hinit->max_size,
319 hinit->name, hinit->bucket_size);
321 ngx_free(test);
323 return NGX_ERROR;
325 found:
327 for (i = 0; i < size; i++) {
328 test[i] = sizeof(void *);
331 for (n = 0; n < nelts; n++) {
332 if (names[n].key.data == NULL) {
333 continue;
336 key = names[n].key_hash % size;
337 test[key] = (u_short) (test[key] + NGX_HASH_ELT_SIZE(&names[n]));
340 len = 0;
342 for (i = 0; i < size; i++) {
343 if (test[i] == sizeof(void *)) {
344 continue;
347 test[i] = (u_short) (ngx_align(test[i], ngx_cacheline_size));
349 len += test[i];
352 if (hinit->hash == NULL) {
353 hinit->hash = ngx_pcalloc(hinit->pool, sizeof(ngx_hash_wildcard_t)
354 + size * sizeof(ngx_hash_elt_t *));
355 if (hinit->hash == NULL) {
356 ngx_free(test);
357 return NGX_ERROR;
360 buckets = (ngx_hash_elt_t **)
361 ((u_char *) hinit->hash + sizeof(ngx_hash_wildcard_t));
363 } else {
364 buckets = ngx_pcalloc(hinit->pool, size * sizeof(ngx_hash_elt_t *));
365 if (buckets == NULL) {
366 ngx_free(test);
367 return NGX_ERROR;
371 elts = ngx_palloc(hinit->pool, len + ngx_cacheline_size);
372 if (elts == NULL) {
373 ngx_free(test);
374 return NGX_ERROR;
377 elts = ngx_align_ptr(elts, ngx_cacheline_size);
379 for (i = 0; i < size; i++) {
380 if (test[i] == sizeof(void *)) {
381 continue;
384 buckets[i] = (ngx_hash_elt_t *) elts;
385 elts += test[i];
389 for (i = 0; i < size; i++) {
390 test[i] = 0;
393 for (n = 0; n < nelts; n++) {
394 if (names[n].key.data == NULL) {
395 continue;
398 key = names[n].key_hash % size;
399 elt = (ngx_hash_elt_t *) ((u_char *) buckets[key] + test[key]);
401 elt->value = names[n].value;
402 elt->len = (u_short) names[n].key.len;
404 ngx_strlow(elt->name, names[n].key.data, names[n].key.len);
406 test[key] = (u_short) (test[key] + NGX_HASH_ELT_SIZE(&names[n]));
409 for (i = 0; i < size; i++) {
410 if (buckets[i] == NULL) {
411 continue;
414 elt = (ngx_hash_elt_t *) ((u_char *) buckets[i] + test[i]);
416 elt->value = NULL;
419 ngx_free(test);
421 hinit->hash->buckets = buckets;
422 hinit->hash->size = size;
424 #if 0
426 for (i = 0; i < size; i++) {
427 ngx_str_t val;
428 ngx_uint_t key;
430 elt = buckets[i];
432 if (elt == NULL) {
433 ngx_log_error(NGX_LOG_ALERT, hinit->pool->log, 0,
434 "%ui: NULL", i);
435 continue;
438 while (elt->value) {
439 val.len = elt->len;
440 val.data = &elt->name[0];
442 key = hinit->key(val.data, val.len);
444 ngx_log_error(NGX_LOG_ALERT, hinit->pool->log, 0,
445 "%ui: %p \"%V\" %ui", i, elt, &val, key);
447 elt = (ngx_hash_elt_t *) ngx_align_ptr(&elt->name[0] + elt->len,
448 sizeof(void *));
452 #endif
454 return NGX_OK;
458 ngx_int_t
459 ngx_hash_wildcard_init(ngx_hash_init_t *hinit, ngx_hash_key_t *names,
460 ngx_uint_t nelts)
462 size_t len, dot_len;
463 ngx_uint_t i, n, dot;
464 ngx_array_t curr_names, next_names;
465 ngx_hash_key_t *name, *next_name;
466 ngx_hash_init_t h;
467 ngx_hash_wildcard_t *wdc;
469 if (ngx_array_init(&curr_names, hinit->temp_pool, nelts,
470 sizeof(ngx_hash_key_t))
471 != NGX_OK)
473 return NGX_ERROR;
476 if (ngx_array_init(&next_names, hinit->temp_pool, nelts,
477 sizeof(ngx_hash_key_t))
478 != NGX_OK)
480 return NGX_ERROR;
483 for (n = 0; n < nelts; n = i) {
485 #if 0
486 ngx_log_error(NGX_LOG_ALERT, hinit->pool->log, 0,
487 "wc0: \"%V\"", &names[n].key);
488 #endif
490 dot = 0;
492 for (len = 0; len < names[n].key.len; len++) {
493 if (names[n].key.data[len] == '.') {
494 dot = 1;
495 break;
499 name = ngx_array_push(&curr_names);
500 if (name == NULL) {
501 return NGX_ERROR;
504 name->key.len = len;
505 name->key.data = names[n].key.data;
506 name->key_hash = hinit->key(name->key.data, name->key.len);
507 name->value = names[n].value;
509 #if 0
510 ngx_log_error(NGX_LOG_ALERT, hinit->pool->log, 0,
511 "wc1: \"%V\" %ui", &name->key, dot);
512 #endif
514 dot_len = len + 1;
516 if (dot) {
517 len++;
520 next_names.nelts = 0;
522 if (names[n].key.len != len) {
523 next_name = ngx_array_push(&next_names);
524 if (next_name == NULL) {
525 return NGX_ERROR;
528 next_name->key.len = names[n].key.len - len;
529 next_name->key.data = names[n].key.data + len;
530 next_name->key_hash = 0;
531 next_name->value = names[n].value;
533 #if 0
534 ngx_log_error(NGX_LOG_ALERT, hinit->pool->log, 0,
535 "wc2: \"%V\"", &next_name->key);
536 #endif
539 for (i = n + 1; i < nelts; i++) {
540 if (ngx_strncmp(names[n].key.data, names[i].key.data, len) != 0) {
541 break;
544 if (!dot
545 && names[i].key.len > len
546 && names[i].key.data[len] != '.')
548 break;
551 next_name = ngx_array_push(&next_names);
552 if (next_name == NULL) {
553 return NGX_ERROR;
556 next_name->key.len = names[i].key.len - dot_len;
557 next_name->key.data = names[i].key.data + dot_len;
558 next_name->key_hash = 0;
559 next_name->value = names[i].value;
561 #if 0
562 ngx_log_error(NGX_LOG_ALERT, hinit->pool->log, 0,
563 "wc3: \"%V\"", &next_name->key);
564 #endif
567 if (next_names.nelts) {
569 h = *hinit;
570 h.hash = NULL;
572 if (ngx_hash_wildcard_init(&h, (ngx_hash_key_t *) next_names.elts,
573 next_names.nelts)
574 != NGX_OK)
576 return NGX_ERROR;
579 wdc = (ngx_hash_wildcard_t *) h.hash;
581 if (names[n].key.len == len) {
582 wdc->value = names[n].value;
585 name->value = (void *) ((uintptr_t) wdc | (dot ? 3 : 2));
587 } else if (dot) {
588 name->value = (void *) ((uintptr_t) name->value | 1);
592 if (ngx_hash_init(hinit, (ngx_hash_key_t *) curr_names.elts,
593 curr_names.nelts)
594 != NGX_OK)
596 return NGX_ERROR;
599 return NGX_OK;
603 ngx_uint_t
604 ngx_hash_key(u_char *data, size_t len)
606 ngx_uint_t i, key;
608 key = 0;
610 for (i = 0; i < len; i++) {
611 key = ngx_hash(key, data[i]);
614 return key;
618 ngx_uint_t
619 ngx_hash_key_lc(u_char *data, size_t len)
621 ngx_uint_t i, key;
623 key = 0;
625 for (i = 0; i < len; i++) {
626 key = ngx_hash(key, ngx_tolower(data[i]));
629 return key;
633 ngx_uint_t
634 ngx_hash_strlow(u_char *dst, u_char *src, size_t n)
636 ngx_uint_t key;
638 key = 0;
640 while (n--) {
641 *dst = ngx_tolower(*src);
642 key = ngx_hash(key, *dst);
643 dst++;
644 src++;
647 return key;
651 ngx_int_t
652 ngx_hash_keys_array_init(ngx_hash_keys_arrays_t *ha, ngx_uint_t type)
654 ngx_uint_t asize;
656 if (type == NGX_HASH_SMALL) {
657 asize = 4;
658 ha->hsize = 107;
660 } else {
661 asize = NGX_HASH_LARGE_ASIZE;
662 ha->hsize = NGX_HASH_LARGE_HSIZE;
665 if (ngx_array_init(&ha->keys, ha->temp_pool, asize, sizeof(ngx_hash_key_t))
666 != NGX_OK)
668 return NGX_ERROR;
671 if (ngx_array_init(&ha->dns_wc_head, ha->temp_pool, asize,
672 sizeof(ngx_hash_key_t))
673 != NGX_OK)
675 return NGX_ERROR;
678 if (ngx_array_init(&ha->dns_wc_tail, ha->temp_pool, asize,
679 sizeof(ngx_hash_key_t))
680 != NGX_OK)
682 return NGX_ERROR;
685 ha->keys_hash = ngx_pcalloc(ha->temp_pool, sizeof(ngx_array_t) * ha->hsize);
686 if (ha->keys_hash == NULL) {
687 return NGX_ERROR;
690 ha->dns_wc_head_hash = ngx_pcalloc(ha->temp_pool,
691 sizeof(ngx_array_t) * ha->hsize);
692 if (ha->dns_wc_head_hash == NULL) {
693 return NGX_ERROR;
696 ha->dns_wc_tail_hash = ngx_pcalloc(ha->temp_pool,
697 sizeof(ngx_array_t) * ha->hsize);
698 if (ha->dns_wc_tail_hash == NULL) {
699 return NGX_ERROR;
702 return NGX_OK;
706 ngx_int_t
707 ngx_hash_add_key(ngx_hash_keys_arrays_t *ha, ngx_str_t *key, void *value,
708 ngx_uint_t flags)
710 size_t len;
711 u_char *p;
712 ngx_str_t *name;
713 ngx_uint_t i, k, n, skip, last;
714 ngx_array_t *keys, *hwc;
715 ngx_hash_key_t *hk;
717 last = key->len;
719 if (flags & NGX_HASH_WILDCARD_KEY) {
722 * supported wildcards:
723 * "*.example.com", ".example.com", and "www.example.*"
726 n = 0;
728 for (i = 0; i < key->len; i++) {
730 if (key->data[i] == '*') {
731 if (++n > 1) {
732 return NGX_DECLINED;
736 if (key->data[i] == '.' && key->data[i + 1] == '.') {
737 return NGX_DECLINED;
741 if (key->len > 1 && key->data[0] == '.') {
742 skip = 1;
743 goto wildcard;
746 if (key->len > 2) {
748 if (key->data[0] == '*' && key->data[1] == '.') {
749 skip = 2;
750 goto wildcard;
753 if (key->data[i - 2] == '.' && key->data[i - 1] == '*') {
754 skip = 0;
755 last -= 2;
756 goto wildcard;
760 if (n) {
761 return NGX_DECLINED;
765 /* exact hash */
767 k = 0;
769 for (i = 0; i < last; i++) {
770 if (!(flags & NGX_HASH_READONLY_KEY)) {
771 key->data[i] = ngx_tolower(key->data[i]);
773 k = ngx_hash(k, key->data[i]);
776 k %= ha->hsize;
778 /* check conflicts in exact hash */
780 name = ha->keys_hash[k].elts;
782 if (name) {
783 for (i = 0; i < ha->keys_hash[k].nelts; i++) {
784 if (last != name[i].len) {
785 continue;
788 if (ngx_strncmp(key->data, name[i].data, last) == 0) {
789 return NGX_BUSY;
793 } else {
794 if (ngx_array_init(&ha->keys_hash[k], ha->temp_pool, 4,
795 sizeof(ngx_str_t))
796 != NGX_OK)
798 return NGX_ERROR;
802 name = ngx_array_push(&ha->keys_hash[k]);
803 if (name == NULL) {
804 return NGX_ERROR;
807 *name = *key;
809 hk = ngx_array_push(&ha->keys);
810 if (hk == NULL) {
811 return NGX_ERROR;
814 hk->key = *key;
815 hk->key_hash = ngx_hash_key(key->data, last);
816 hk->value = value;
818 return NGX_OK;
821 wildcard:
823 /* wildcard hash */
825 k = ngx_hash_strlow(&key->data[skip], &key->data[skip], last - skip);
827 k %= ha->hsize;
829 if (skip == 1) {
831 /* check conflicts in exact hash for ".example.com" */
833 name = ha->keys_hash[k].elts;
835 if (name) {
836 len = last - skip;
838 for (i = 0; i < ha->keys_hash[k].nelts; i++) {
839 if (len != name[i].len) {
840 continue;
843 if (ngx_strncmp(&key->data[1], name[i].data, len) == 0) {
844 return NGX_BUSY;
848 } else {
849 if (ngx_array_init(&ha->keys_hash[k], ha->temp_pool, 4,
850 sizeof(ngx_str_t))
851 != NGX_OK)
853 return NGX_ERROR;
857 name = ngx_array_push(&ha->keys_hash[k]);
858 if (name == NULL) {
859 return NGX_ERROR;
862 name->len = last - 1;
863 name->data = ngx_pnalloc(ha->temp_pool, name->len);
864 if (name->data == NULL) {
865 return NGX_ERROR;
868 ngx_memcpy(name->data, &key->data[1], name->len);
872 if (skip) {
875 * convert "*.example.com" to "com.example.\0"
876 * and ".example.com" to "com.example\0"
879 p = ngx_pnalloc(ha->temp_pool, last);
880 if (p == NULL) {
881 return NGX_ERROR;
884 len = 0;
885 n = 0;
887 for (i = last - 1; i; i--) {
888 if (key->data[i] == '.') {
889 ngx_memcpy(&p[n], &key->data[i + 1], len);
890 n += len;
891 p[n++] = '.';
892 len = 0;
893 continue;
896 len++;
899 if (len) {
900 ngx_memcpy(&p[n], &key->data[1], len);
901 n += len;
904 p[n] = '\0';
906 hwc = &ha->dns_wc_head;
907 keys = &ha->dns_wc_head_hash[k];
909 } else {
911 /* convert "www.example.*" to "www.example\0" */
913 last++;
915 p = ngx_pnalloc(ha->temp_pool, last);
916 if (p == NULL) {
917 return NGX_ERROR;
920 ngx_cpystrn(p, key->data, last);
922 hwc = &ha->dns_wc_tail;
923 keys = &ha->dns_wc_tail_hash[k];
927 /* check conflicts in wildcard hash */
929 name = keys->elts;
931 if (name) {
932 len = last - skip;
934 for (i = 0; i < keys->nelts; i++) {
935 if (len != name[i].len) {
936 continue;
939 if (ngx_strncmp(key->data + skip, name[i].data, len) == 0) {
940 return NGX_BUSY;
944 } else {
945 if (ngx_array_init(keys, ha->temp_pool, 4, sizeof(ngx_str_t)) != NGX_OK)
947 return NGX_ERROR;
951 name = ngx_array_push(keys);
952 if (name == NULL) {
953 return NGX_ERROR;
956 name->len = last - skip;
957 name->data = ngx_pnalloc(ha->temp_pool, name->len);
958 if (name->data == NULL) {
959 return NGX_ERROR;
962 ngx_memcpy(name->data, key->data + skip, name->len);
965 /* add to wildcard hash */
967 hk = ngx_array_push(hwc);
968 if (hk == NULL) {
969 return NGX_ERROR;
972 hk->key.len = last - 1;
973 hk->key.data = p;
974 hk->key_hash = 0;
975 hk->value = value;
977 return NGX_OK;