From: Wouter Wijngaards <wouter@nlnetlabs.nl>
Date: Wed, 21 Mar 2007 14:38:47 +0000 (+0000)
Subject: Make lint happy and lock verify less verbose.
X-Git-Tag: release-0.2~42
X-Git-Url: http://git.ipfire.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=bd2bad94ce8c9602cde177a358d4bbd0f5fbba76;p=thirdparty%2Funbound.git

Make lint happy and lock verify less verbose.


git-svn-id: file:///svn/unbound/trunk@185 be551aaa-1e26-0410-a405-d3ace91eadb9
---

diff --git a/testcode/lock_verify.c b/testcode/lock_verify.c
index 2c47e534f..25cf563ad 100644
--- a/testcode/lock_verify.c
+++ b/testcode/lock_verify.c
@@ -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);
 	}
 }
diff --git a/util/storage/lruhash.c b/util/storage/lruhash.c
index 4375896d3..d4e8f1039 100644
--- a/util/storage/lruhash.c
+++ b/util/storage/lruhash.c
@@ -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;