commit 8372b7f1d0975eb7da0e69c13b6177043d3d0640
author njn <njn@a5019735-40e9-0310-863c-91ae7b9d1cf9> Wed May 14 12:42:14 2003 +0000
committer njn <njn@a5019735-40e9-0310-863c-91ae7b9d1cf9> Wed May 14 12:42:14 2003 +0000
tree 525810f2e32cb3f81a4b482ebfc5c3afa82beb5c
parent cbc40945c4cc0d4b17c11c93147fe4391449b7fa

wibble


git-svn-id: svn://svn.valgrind.org/valgrind/trunk@1632 a5019735-40e9-0310-863c-91ae7b9d1cf9

coregrind/vg_hashtable.c

diff --git a/coregrind/vg_hashtable.c b/coregrind/vg_hashtable.c
index d3083e9..42e7b17 100644
--- a/coregrind/vg_hashtable.c
+++ b/coregrind/vg_hashtable.c
@@ -113,7 +113,7 @@
 
    bigN = hi - lo + 1; if (bigN < 2) return;
    hp = 0; while (hp < 14 && incs[hp] < bigN) hp++; hp--;
-   sk_assert(0 <= hp && hp < 14);
+   vg_assert(0 <= hp && hp < 14);
 
    for (; hp >= 0; hp--) {
       h = incs[hp];
@@ -161,13 +161,13 @@
          arr[j++] = node;
       }
    }
-   sk_assert(j == *n_shadows);
+   vg_assert(j == *n_shadows);
 
    sort_hash_array(arr, *n_shadows);
 
    /* Sanity check; assert that the blocks are now in order */
    for (i = 0; i < *n_shadows-1; i++) {
-      sk_assert( arr[i]->key < arr[i+1]->key );
+      vg_assert( arr[i]->key < arr[i+1]->key );
    }
 
    return arr;