upstream/unbound
1
0
Fork 0
mirror of https://github.com/NLnetLabs/unbound.git synced 2026-02-03 20:29:28 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

Make lint happy and lock verify less verbose.

Browse source 
git-svn-id: file:///svn/unbound/trunk@185 be551aaa-1e26-0410-a405-d3ace91eadb9
This commit is contained in:
Wouter Wijngaards 2007-03-21 14:38:47 +00:00
parent 98235df888
commit bd2bad94ce
2 changed files with 4 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

5
testcode/lock_verify.c
View file

@ -337,10 +337,11 @@ static void check_order(rbtree_t* all_locks)
struct order_lock* lock;
int i=0;
RBTREE_FOR(lock, struct order_lock*, all_locks) {
if(1) printf("[%d/%d] Checking lock %d %d %s %d\n",
i++, (int)all_locks->count,
if(i % 100 == 0) printf("[%d/%d] Checking lock %d %d %s %d\n",
i, (int)all_locks->count,
lock->id.thr, lock->id.instance,
lock->create_file, lock->create_line);
i++;
check_order_lock(lock);
}
}

2
util/storage/lruhash.c
View file

@ -395,7 +395,7 @@ lruhash_status(struct lruhash* table, const char* id, int extended)
(unsigned)table->size, table->size_mask);
if(extended) {
size_t i;
int min=table->size*2, max=-2;
int min=(int)table->size*2, max=-2;
for(i=0; i<table->size; i++) {
int here = 0;
struct lruhash_entry *en;