Test the case of unflattened nodups.

Addresses #764.


git-svn-id: file:///svn/tokudb@3933 c7de825b-a66e-492c-adef-691d508d4ae1

newbrt/tests/Makefile

@@ -58,6 +58,7 @@ REGRESSION_TESTS = \
 	fifo-test \
 	list-test \
 	keyrange \
+	keyrange-unflat \
 	log-test \
 	log-test2 \
 	log-test3 \

newbrt/tests/keyrange-unflat.c

+/* -*- mode: C; c-basic-offset: 4 -*- */
+#ident "Copyright (c) 2008 Tokutek Inc.  All rights reserved."
+
+#include "brt.h"
+#include "test.h"
+#include "toku_assert.h"
+#include "key.h"
+
+#include <unistd.h>
+
+static TOKUTXN const null_txn = 0;
+static DB * const null_db = 0;
+
+static void test_flat (void) {
+    char fname[]= __FILE__ ".brt";
+    const u_int64_t limit=20000;
+    u_int64_t permute[limit];
+    unlink(fname);
+    CACHETABLE ct;
+    // set the cachetable to size 1 so that things won't fit.
+    int r = toku_brt_create_cachetable(&ct, 1, ZERO_LSN, NULL_LOGGER);                                assert(r==0);
+    BRT t;
+    r = toku_open_brt(fname, 0, 1, &t, 1<<12, ct, null_txn, toku_default_compare_fun, null_db);   assert(r==0);
+    u_int64_t i;
+    // permute the numbers from 0 (inclusive) to limit (exclusive)
+    permute[0]=0;
+    for (i=1; i<limit; i++) {
+	permute[i]=i;
+	int ra = random()%(i+1);
+	permute[i]=permute[ra];
+	permute[ra]=i;
+    }
+    for (i=0; i<limit; i++) {
+	char key[100],val[100];
+	u_int64_t ri = permute[i];
+	snprintf(key, 100, "%08llu", (unsigned long long)2*ri+1);
+	snprintf(val, 100, "%08llu", (unsigned long long)2*ri+1);
+	DBT k,v;
+	r = toku_brt_insert(t, toku_fill_dbt(&k, key, 1+strlen(key)), toku_fill_dbt(&v,val, 1+strlen(val)), null_txn);
+	assert(r == 0);
+    }
+    // Don't flatten it.
+    // search for the items that are there and those that aren't.
+    // 
+    u_int64_t prevless=0;
+    u_int64_t prevgreater=limit;
+    for (i=0; i<2*limit+1; i++) {
+	char key[100];
+	snprintf(key, 100, "%08llu", (unsigned long long)i);
+	DBT k;
+	u_int64_t less,equal,greater;
+	r = toku_brt_keyrange(t, toku_fill_dbt(&k, key, 1+strlen(key)), &less, &equal, &greater);
+	assert(r == 0);
+	//printf("key %llu/%llu %llu %llu %llu\n", (unsigned long long)2*i, (unsigned long long)2*limit, (unsigned long long)less, (unsigned long long)equal, (unsigned long long)greater);
+	assert(equal==0 || equal==1);
+	assert(less>=prevless);	      prevless    = less;
+	assert(greater<=prevgreater); prevgreater = greater;
+    }
+    r = toku_close_brt(t, 0);          assert(r==0);
+    r = toku_cachetable_close(&ct);    assert(r==0);
+}
+
+int main (int argc , const char *argv[]) {
+    default_parse_args(argc, argv);
+
+    test_flat();
+    toku_malloc_cleanup();
+    if (verbose) printf("test ok\n");
+    return 0;
+}
+