Nicer words for slab hash.

git-svn-id: file:///svn/unbound/trunk@200 be551aaa-1e26-0410-a405-d3ace91eadb9
This commit is contained in:
Wouter Wijngaards 2007-03-27 10:01:39 +00:00
parent 4ad4cbdf74
commit ccf3d7190d
4 changed files with 7 additions and 2 deletions

View file

@ -3,6 +3,8 @@
- testbound can give config file and commandline options from the - testbound can give config file and commandline options from the
replay file to unbound. replay file to unbound.
- created test that checks if items drop out of the cache. - created test that checks if items drop out of the cache.
- added word 'partitioned hash table' to documentation on slab hash.
A slab hash is a partitioned hash table.
26 March 2007: Wouter 26 March 2007: Wouter
- config settings for slab hash message cache. - config settings for slab hash message cache.

View file

@ -125,7 +125,8 @@ setup_config(FILE* in, char* configfile, int* lineno,
char line[MAX_LINE_LEN]; char line[MAX_LINE_LEN];
char* parse; char* parse;
FILE* cfg; FILE* cfg;
sprintf(configfile, "/tmp/testbound_cfg_%u.tmp", (unsigned)getpid()); snprintf(configfile, MAX_LINE_LEN, "/tmp/testbound_cfg_%u.tmp",
(unsigned)getpid());
add_opts("-c", pass_argc, pass_argv); add_opts("-c", pass_argc, pass_argv);
add_opts(configfile, pass_argc, pass_argv); add_opts(configfile, pass_argc, pass_argv);
cfg = fopen(configfile, "w"); cfg = fopen(configfile, "w");
@ -194,7 +195,7 @@ main(int argc, char* argv[])
int init_optind = optind; int init_optind = optind;
char* init_optarg = optarg; char* init_optarg = optarg;
struct replay_scenario* scen = NULL; struct replay_scenario* scen = NULL;
char cfgfile[128]; char cfgfile[MAX_LINE_LEN];
log_init(NULL); log_init(NULL);
log_info("Start of %s testbound program.", PACKAGE_STRING); log_info("Start of %s testbound program.", PACKAGE_STRING);

View file

@ -37,6 +37,7 @@
* \file * \file
* *
* Implementation of hash table that consists of smaller hash tables. * Implementation of hash table that consists of smaller hash tables.
* This results in a partitioned lruhash table.
* It cannot grow, but that gives it the ability to have multiple * It cannot grow, but that gives it the ability to have multiple
* locks. Also this means there are multiple LRU lists. * locks. Also this means there are multiple LRU lists.
*/ */

View file

@ -47,6 +47,7 @@
/** /**
* Hash table formed from several smaller ones. * Hash table formed from several smaller ones.
* This results in a partitioned lruhash table.
* None of the data inside the slabhash may be altered. * None of the data inside the slabhash may be altered.
* Therefore, no locks are needed to access the structure. * Therefore, no locks are needed to access the structure.
*/ */