WEBDIENSTE/unbound
1
0
Fork 0
mirror of https://github.com/NLnetLabs/unbound.git synced 2026-09-24 02:34:56 +02:00
Code Issues Packages Projects Releases Wiki Activity

Lint complained, fixup array lookup using hash value.

Browse Source 
git-svn-id: file:///svn/unbound/trunk@177 be551aaa-1e26-0410-a405-d3ace91eadb9
This commit is contained in:
Wouter Wijngaards
2007-03-14 10:47:11 +00:00
parent 3f61aca920
commit 1e129d341a
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files
util/storage/lruhash.c
+4 -4
View File
@@ -195,7 +195,7 @@ bin_split(struct lruhash* table, struct lruhash_bin* newa,
{
size_t i;
struct lruhash_entry *p, *np;
int newbin;
struct lruhash_bin* newbin;
/* move entries to new table. Notice that since hash x is mapped to
* bin x & mask, and new mask uses one more bit, so all entries in
* one bin will go into the old bin or bin | newbit */
@@ -209,9 +209,9 @@ bin_split(struct lruhash* table, struct lruhash_bin* newa,
while(p) {
np = p->overflow_next;
/* link into correct new bin */
newbin = p->hash & newmask;
p->overflow_next = newa[newbin].overflow_list;
newa[newbin].overflow_list = p;
newbin = &newa[p->hash & newmask];
p->overflow_next = newbin->overflow_list;
newbin->overflow_list = p;
p=np;
}
}