diff --git a/src/tests/test_dup_insert.c b/src/tests/test_dup_insert.c index 06075c65457..3187839ade5 100644 --- a/src/tests/test_dup_insert.c +++ b/src/tests/test_dup_insert.c @@ -37,6 +37,10 @@ void expect(DBC *cursor, int k, int v) { free(val.data); } +static int mycmp(const void *a, const void *b) { + return memcmp(a, b, sizeof (int)); +} + /* verify that key insertions are stored in insert order */ void test_insert(int n, int dup_mode) { if (verbose) printf("test_insert:%d %d\n", n, dup_mode); @@ -66,9 +70,6 @@ void test_insert(int n, int dup_mode) { int sortvalues[n]; for (i=0; i<n; i++) sortvalues[i] = values[i]; - int mycmp(const void *a, const void *b) { - return memcmp(a, b, sizeof (int)); - } qsort(sortvalues, n, sizeof sortvalues[0], mycmp); /* insert n-1 unique keys {0, 1, n-1} - {n/2} */ @@ -165,9 +166,6 @@ void test_nonleaf_insert(int n, int dup_mode) { int sortvalues[n]; for (i=0; i<n; i++) sortvalues[i] = values[i]; - int mycmp(const void *a, const void *b) { - return memcmp(a, b, sizeof (int)); - } qsort(sortvalues, n, sizeof sortvalues[0], mycmp); /* insert n-1 unique keys {0, 1, n-1} - {n/2} */ diff --git a/src/tests/test_dupsort_delete.c b/src/tests/test_dupsort_delete.c index 1ae228c1820..866f39a99f9 100644 --- a/src/tests/test_dupsort_delete.c +++ b/src/tests/test_dupsort_delete.c @@ -32,6 +32,10 @@ void expect_cursor_get(DBC *cursor, int op, int expectr) { assert(r == expectr); } +static int mycmp(const void *a, const void *b) { + return memcmp(a, b, sizeof (int)); +} + void test_dupsort_delete(int n) { if (verbose) printf("test_dupsort_delete:%d\n", n); @@ -56,9 +60,6 @@ void test_dupsort_delete(int n) { int sortvalues[n]; for (i=0; i<n; i++) sortvalues[i] = values[i]; - int mycmp(const void *a, const void *b) { - return memcmp(a, b, sizeof (int)); - } qsort(sortvalues, n, sizeof sortvalues[0], mycmp); for (i=0; i<n; i++) {