summaryrefslogtreecommitdiffstats
path: root/test
diff options
context:
space:
mode:
authorQuincey Koziol <koziol@hdfgroup.org>2005-02-11 23:36:08 (GMT)
committerQuincey Koziol <koziol@hdfgroup.org>2005-02-11 23:36:08 (GMT)
commit7316f0e7e71c85f8133ecfb9cb906cdd357ab491 (patch)
treef970db66aea8dddb3f7ba37f3a67e3238d1a6cea /test
parent610bf8a815f55b990769af170ac379e8cfe0c308 (diff)
downloadhdf5-7316f0e7e71c85f8133ecfb9cb906cdd357ab491.zip
hdf5-7316f0e7e71c85f8133ecfb9cb906cdd357ab491.tar.gz
hdf5-7316f0e7e71c85f8133ecfb9cb906cdd357ab491.tar.bz2
[svn-r9995] Purpose:
New feature & bug fix Description: Allow root node to split, forming a level 2 B-tree Fix error where wrong record was being copied up to parent node for a 2 node redistribution on the "right" side of the B-tree. Platforms tested: FreeBSD 4.11 (sleipnir) w/parallel Solaris 2.9 (shanti)
Diffstat (limited to 'test')
-rw-r--r--test/btree2.c78
1 files changed, 77 insertions, 1 deletions
diff --git a/test/btree2.c b/test/btree2.c
index 6ab6ed6..365dacf 100644
--- a/test/btree2.c
+++ b/test/btree2.c
@@ -651,6 +651,81 @@ error:
/*-------------------------------------------------------------------------
+ * Function: test_insert_make_level2
+ *
+ * Purpose: Basic tests for the B-tree v2 code. This test inserts enough
+ * records to make a level 2 B-tree
+ *
+ * Return: Success: 0
+ *
+ * Failure: 1
+ *
+ * Programmer: Quincey Koziol
+ * Friday, February 11, 2005
+ *
+ * Modifications:
+ *
+ *-------------------------------------------------------------------------
+ */
+static int
+test_insert_make_level2(hid_t fapl)
+{
+ hid_t file=-1;
+ char filename[1024];
+ H5F_t *f=NULL;
+ hsize_t record; /* Record to insert into tree */
+ haddr_t bt2_addr; /* Address of B-tree created */
+ unsigned u; /* Local index variable */
+
+ h5_fixname(FILENAME[0], fapl, filename, sizeof filename);
+
+ /* Create the file to work on */
+ if ((file=H5Fcreate(filename, H5F_ACC_TRUNC, H5P_DEFAULT, fapl))<0) TEST_ERROR;
+
+ /* Get a pointer to the internal file object */
+ if (NULL==(f=H5I_object(file))) {
+ H5Eprint_stack(H5E_DEFAULT, stdout);
+ goto error;
+ }
+
+ /*
+ * Create v2 B-tree
+ */
+ if (H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/)<0) {
+ H5_FAILED();
+ H5Eprint_stack(H5E_DEFAULT, stdout);
+ goto error;
+ }
+
+ /*
+ * Test inserting many records into v2 B-tree
+ */
+ TESTING("B-tree many - make level 2 B-tree");
+
+ /* Insert enough records to force root to split into 2 leaves */
+ for(u=0; u<INSERT_SPLIT_ROOT_NREC*11; u++) {
+ record=u;
+ if (H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)<0) {
+ H5_FAILED();
+ H5Eprint_stack(H5E_DEFAULT, stdout);
+ goto error;
+ }
+ }
+ PASSED();
+
+ if (H5Fclose(file)<0) TEST_ERROR;
+
+ return 0;
+
+error:
+ H5E_BEGIN_TRY {
+ H5Fclose(file);
+ } H5E_END_TRY;
+ return 1;
+} /* test_insert_make_level2() */
+
+
+/*-------------------------------------------------------------------------
* Function: main
*
* Purpose: Test the B-tree v2 code
@@ -683,10 +758,11 @@ main(void)
nerrors += test_insert_level1_2leaf_split(fapl);
nerrors += test_insert_level1_3leaf_redistrib(fapl);
nerrors += test_insert_level1_3leaf_split(fapl);
+ nerrors += test_insert_make_level2(fapl);
if (nerrors) goto error;
puts("All v2 B-tree tests passed.");
-#ifdef QAK
+#ifndef QAK
h5_cleanup(FILENAME, fapl);
#else /* QAK */
HDfprintf(stderr,"Uncomment cleanup!\n");