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 2c47e534fa4872b949a7f0e50dd05eef20bd9af7..25cf563addd8ab3671520378a2fcae1b16681c6c 100644 (file)
--- 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 4375896d3ed32440c4b6bca105bc84be1afef8d4..d4e8f10393f84266e545d4f05b7582a9e4d21778 100644 (file)
--- 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;