Skip to content

D
Dnsmasq
Commit c5b2cbfe authored by Chen Wei's avatar Chen Wei
Browse files
Options

update doc

parent 1291b335
Hide whitespace changes
Inline Side-by-side
Showing with 49 additions and 22 deletions
README.md
View file @ c5b2cbfe
...@@ -20,21 +20,21 @@ of --ipsets and --server entries. ...@@ -20,21 +20,21 @@ of --ipsets and --server entries.
The lookup steps over domain name hierarchy top-down. All labels are stored in The lookup steps over domain name hierarchy top-down. All labels are stored in
open addressing hash tables. Sub-level labels that belong to different parent open addressing hash tables. Sub-level labels that belong to different parent
nodes are stored separately. e.g. yahoo, google, and twitter are in one hash nodes are stored separately. e.g. yahoo, google, and twitter are in one hash
table, while debian and freebsd are in another. table, while debian and freebsd are in another.
The hash table size is power of 2, two hash functions are used to compute hash The hash table size is power of 2, two hash functions are used to compute hash
bucket. For locating a particular label from hash table, two hash values are bucket. For locating a particular label from hash table, two hash values are
compared first, only if they are match, should the more expensive string compared first, only if they are match, should the more expensive string
comparison be used to confirm the search. comparison be used to confirm the search.
The search should take constant time regardless the size of --ipset and --server The search should take constant time regardless the size of --ipset and --server
rules. rules.
### Issues ### Issues
* `tcp_request` not working
[Contact me](mailto: weichen302@gmail.com) [Contact me](mailto: weichen302@gmail.com)
src/dict.c
View file @ c5b2cbfe
/* dict.c is Copyright (c) 2015 Chen Wei <weichen302@gmail.com> /* dict.c is Copyright (c) 2015 Chen Wei <weichen302@gmail.com>
Use a dictionary like structure to store config options for fast lookup Use cascade of open addressing hash tables to store config options that
involve domain names.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by root
the Free Software Foundation; version 2 dated June, 1991, or |
(at your option) version 3 dated 29 June, 2007. +---------------------+
com org
This program is distributed in the hope that it will be useful, | |
but WITHOUT ANY WARRANTY; without even the implied warranty of +------------------+ +-------------+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the yahoo google twitter debian freebsd
GNU General Public License for more details. | | | |
www mail +---------+ www
You should have received a copy of the GNU General Public License cn jp uk us
along with this program. If not, see <http://www.gnu.org/licenses/>. |
ftp
The lookup steps over domain name hierarchy top-down. All labels are stored
in open addressing hash tables. Sub-level labels that belong to different
parent nodes are stored separately. e.g. yahoo, google, and twitter are in
one hash table, while debian and freebsd are in another.
The hash table size is power of 2, two hash functions are used to compute
hash bucket. For locating a particular label from hash table, two hash
values are compared first, only if they are match, should the more
expensive string comparison be used to confirm the search.
The search should take constant time regardless the size of --ipset and
--server rules.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; version 2 dated June, 1991, or
(at your option) version 3 dated 29 June, 2007.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/ */
#include "dnsmasq.h" #include "dnsmasq.h"
...@@ -21,7 +49,6 @@ ...@@ -21,7 +49,6 @@
#define OPEN_ADDRESSING_MAXJUMP 7 /* no reason, just like 7 */ #define OPEN_ADDRESSING_MAXJUMP 7 /* no reason, just like 7 */
#define OPEN_ADDRESSING_DEFAULT_SLOT 4 #define OPEN_ADDRESSING_DEFAULT_SLOT 4
#define FNV1_32A_INIT ((uint32_t)0x811c9dc5) #define FNV1_32A_INIT ((uint32_t)0x811c9dc5)
#define FNV_32_PRIME ((uint32_t)0x01000193)
#define max(A, B) ((A) > (B) ? (A) : (B)) #define max(A, B) ((A) > (B) ? (A) : (B))
static char buf[MAXDNAME]; static char buf[MAXDNAME];
...@@ -497,7 +524,7 @@ void print_server_special_domains (struct dict_node *node, ...@@ -497,7 +524,7 @@ void print_server_special_domains (struct dict_node *node,
} }
buf[strlen (buf) - 1] = '\0'; buf[strlen (buf) - 1] = '\0';
port = prettyprint_addr (&obj->server->addr, ip_buf); port = prettyprint_addr (&obj->server->addr, ip_buf);
my_syslog(LOG_INFO, _("using nameserver %s#%d for domain %s"), my_syslog(LOG_INFO, _("using nameserver %s#%d for domain %s"),
ip_buf, port, buf); ip_buf, port, buf);
} }
} }
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment