mirror of
https://github.com/HDFGroup/hdf5.git
synced 2024-12-21 07:51:46 +08:00
0e51a4244e
Correct a minor error in file free space allocation which was affecting
the 'multi' VFD and preventing some tests from fully working with it.
Wholesale revisitation of all the places where tests were disabled
with various VFDs and remove or correct all these so that _only_ the tests
which _really_ can't work with particular VFDs are skipped during a
'make check-vfd' test.
Tested on:
Mac OS X/32 10.5.5 (amazon) in debug mode
Mac OS X/32 10.5.5 (amazon) w/C++ & FORTRAN, w/threadsafe,
in production mode
FreeBSD/32 6.3 (duty) in debug mode
FreeBSD/64 6.3 (liberty) w/C++ & FORTRAN, in debug mode
Linux/32 2.6 (kagiso) w/PGI compilers, w/C++ & FORTRAN, w/threadsafe,
in debug mode
Linux/64-amd64 2.6 (smirom) w/Intel compilers w/default API=1.6.x,
w/C++ & FORTRAN, in production mode
Solaris/32 2.10 (linew) w/deprecated symbols disabled, w/C++ & FORTRAN,
w/szip filter, in production mode
Linux/64-ia64 2.6 (cobalt) w/Intel compilers, w/C++ & FORTRAN,
in production mode
Linux/64-ia64 2.4 (tg-login3) w/parallel, w/FORTRAN, in production mode
Linux/64-amd64 2.6 (abe) w/parallel, w/FORTRAN, in production mode
7584 lines
258 KiB
C
7584 lines
258 KiB
C
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
||
* Copyright by The HDF Group. *
|
||
* Copyright by the Board of Trustees of the University of Illinois. *
|
||
* All rights reserved. *
|
||
* *
|
||
* This file is part of HDF5. The full HDF5 copyright notice, including *
|
||
* terms governing use, modification, and redistribution, is contained in *
|
||
* the files COPYING and Copyright.html. COPYING can be found at the root *
|
||
* of the source code distribution tree; Copyright.html can be found at the *
|
||
* root level of an installed copy of the electronic HDF5 document set and *
|
||
* is linked from the top-level documents page. It can also be found at *
|
||
* http://hdfgroup.org/HDF5/doc/Copyright.html. If you do not have *
|
||
* access to either file, you may request a copy from help@hdfgroup.org. *
|
||
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
|
||
|
||
/* Programmer: Quincey Koziol <koziol@ncsa.uiuc.edu>
|
||
* Tuesday, February 1, 2005
|
||
*/
|
||
#include "h5test.h"
|
||
|
||
/*
|
||
* This file needs to access private datatypes from the H5B2 package.
|
||
* This file also needs to access the v2 B-tree testing code.
|
||
*/
|
||
#define H5B2_PACKAGE
|
||
#define H5B2_TESTING
|
||
#include "H5B2pkg.h"
|
||
|
||
/* Other private headers that this test requires */
|
||
#include "H5Iprivate.h"
|
||
|
||
const char *FILENAME[] = {
|
||
"btree2",
|
||
NULL
|
||
};
|
||
|
||
#define INSERT_SPLIT_ROOT_NREC 63
|
||
#define INSERT_MANY (1000*1000)
|
||
#define FIND_MANY (INSERT_MANY/100)
|
||
#define FIND_NEIGHBOR 2000
|
||
#define DELETE_SMALL 20
|
||
#define DELETE_MEDIUM 200
|
||
#define DELETE_LARGE 2000
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: iter_cb
|
||
*
|
||
* Purpose: v2 B-tree iterator callback
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Wednesday, February 16, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static int
|
||
iter_cb(const void *_record, void *_op_data)
|
||
{
|
||
const hsize_t *record = (const hsize_t *)_record;
|
||
hsize_t *idx = (hsize_t *)_op_data;
|
||
|
||
if(*record != *idx)
|
||
return(H5_ITER_ERROR);
|
||
|
||
(*idx)++;
|
||
return(H5_ITER_CONT);
|
||
} /* end iter_cb() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: find_cb
|
||
*
|
||
* Purpose: v2 B-tree find callback
|
||
*
|
||
* Return: Success: TRUE/FALSE
|
||
*
|
||
* Failure: FAIL
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Thursday, February 24, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static int
|
||
find_cb(const void *_record, void *_op_data)
|
||
{
|
||
const hsize_t *record = (const hsize_t *)_record;
|
||
hsize_t *search = (hsize_t *)_op_data;
|
||
|
||
if(*record != *search)
|
||
return(FALSE);
|
||
|
||
return(TRUE);
|
||
} /* end find_cb() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: find_dec_cb
|
||
*
|
||
* Purpose: v2 B-tree find callback for indexing in decreasing order
|
||
*
|
||
* Note: Currently hard-wired to "insert_lots" test
|
||
*
|
||
* Return: Success: 0
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Tuesday, November 7, 2006
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static int
|
||
find_dec_cb(const void *_record, void *_op_data)
|
||
{
|
||
const hsize_t *record = (const hsize_t *)_record;
|
||
hsize_t *search = (hsize_t *)_op_data;
|
||
|
||
if(*record != (INSERT_MANY - (*search + 1)))
|
||
return(-1);
|
||
|
||
return(0);
|
||
} /* end find_dec_cb() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: neighbor_cb
|
||
*
|
||
* Purpose: v2 B-tree neighbor callback
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Tuesday, March 8, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static int
|
||
neighbor_cb(const void *_record, void *_op_data)
|
||
{
|
||
const hsize_t *record = (const hsize_t *)_record;
|
||
hsize_t *search = (hsize_t *)_op_data;
|
||
|
||
*search = *record;
|
||
|
||
return(0);
|
||
} /* end neighbor_cb() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: modify_cb
|
||
*
|
||
* Purpose: v2 B-tree modify callback
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Friday, March 10, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static int
|
||
modify_cb(void *_record, void *_op_data, hbool_t *changed)
|
||
{
|
||
hsize_t *record = (hsize_t *)_record;
|
||
hsize_t *modify = (hsize_t *)_op_data;
|
||
|
||
*record = *modify;
|
||
*changed = TRUE;
|
||
|
||
return(0);
|
||
} /* end modify_cb() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: remove_cb
|
||
*
|
||
* Purpose: v2 B-tree remove callback
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Tuesday, August 8, 2006
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static int
|
||
remove_cb(const void *_record, void *_op_data)
|
||
{
|
||
const hsize_t *record = (const hsize_t *)_record;
|
||
hsize_t *rrecord = (hsize_t *)_op_data;
|
||
|
||
*rrecord = *record;
|
||
|
||
return(0);
|
||
} /* end remove_cb() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_insert_basic
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Thursday, February 3, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_insert_basic(hid_t fapl)
|
||
{
|
||
hid_t file = -1; /* File ID */
|
||
char filename[1024]; /* Filename to use */
|
||
H5F_t *f = NULL; /* Internal file object pointer */
|
||
hsize_t record; /* Record to insert into tree */
|
||
hsize_t idx; /* Index within B-tree, for iterator */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
herr_t ret; /* Generic error return value */
|
||
|
||
/* Set the filename to use for this test (dependent on fapl) */
|
||
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 = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
/*
|
||
* Test v2 B-tree creation
|
||
*/
|
||
TESTING("B-tree creation");
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(!H5F_addr_defined(bt2_addr))
|
||
FAIL_STACK_ERROR
|
||
PASSED();
|
||
|
||
/* Attempt to iterate over a B-tree with no records */
|
||
idx = 0;
|
||
if(H5B2_iterate(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, iter_cb, &idx) < 0)
|
||
FAIL_STACK_ERROR
|
||
/* Make certain that the index hasn't changed */
|
||
if(idx != 0)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to find record in B-tree with no records */
|
||
idx = 0;
|
||
if(H5B2_find(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &idx, find_cb, NULL) != FALSE)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to index record in B-tree with no records */
|
||
idx = 0;
|
||
H5E_BEGIN_TRY {
|
||
ret = H5B2_index(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5_ITER_INC, (hsize_t)0, find_cb, NULL);
|
||
} H5E_END_TRY;
|
||
/* Should fail */
|
||
if(ret != FAIL)
|
||
TEST_ERROR
|
||
|
||
/*
|
||
* Test inserting record into v2 B-tree
|
||
*/
|
||
TESTING("B-tree insert: several records");
|
||
record = 42;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Attempt to find non-existant record in B-tree with 1 record */
|
||
/* (Should not be found, but not fail) */
|
||
idx = 41;
|
||
if(H5B2_find(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &idx, find_cb, &idx) != FALSE)
|
||
TEST_ERROR
|
||
|
||
/* Try again with NULL 'op' */
|
||
/* (Should not be found, but not fail) */
|
||
if(H5B2_find(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &idx, NULL, NULL) != FALSE)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to find existant record in B-tree with 1 record */
|
||
idx = 42;
|
||
if(H5B2_find(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &idx, find_cb, &idx) != TRUE)
|
||
TEST_ERROR
|
||
|
||
/* Try again with NULL 'op' */
|
||
if(H5B2_find(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &idx, NULL, NULL) != TRUE)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to index non-existant record in B-tree with 1 record */
|
||
idx = 0;
|
||
H5E_BEGIN_TRY {
|
||
ret = H5B2_index(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5_ITER_INC, (hsize_t)1, find_cb, NULL);
|
||
} H5E_END_TRY;
|
||
/* Should fail */
|
||
if(ret != FAIL)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to index existing record in B-tree with 1 record */
|
||
idx = 42;
|
||
if(H5B2_index(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5_ITER_INC, (hsize_t)0, find_cb, &idx)<0)
|
||
TEST_ERROR
|
||
|
||
/*
|
||
* Test inserting second record into v2 B-tree, before all other records
|
||
*/
|
||
record = 34;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/*
|
||
* Test inserting third record into v2 B-tree, after all other records
|
||
*/
|
||
record = 56;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/*
|
||
* Test inserting fourth record into v2 B-tree, in the middle of other records
|
||
*/
|
||
record = 38;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Attempt to find non-existant record in level-0 B-tree with several records */
|
||
/* (Should not be found, but not fail) */
|
||
idx = 41;
|
||
if(H5B2_find(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &idx, find_cb, &idx) != FALSE)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to find existant record in level-0 B-tree with several record */
|
||
idx = 56;
|
||
if(H5B2_find(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &idx, find_cb, &idx) != TRUE)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to index non-existant record in B-tree with several records */
|
||
idx = 0;
|
||
H5E_BEGIN_TRY {
|
||
ret = H5B2_index(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5_ITER_INC, (hsize_t)4, find_cb, NULL);
|
||
} H5E_END_TRY;
|
||
/* Should fail */
|
||
if(ret != FAIL)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to index existing record in B-tree with several records */
|
||
idx = 34;
|
||
if(H5B2_index(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5_ITER_INC, (hsize_t)0, find_cb, &idx)<0)
|
||
TEST_ERROR
|
||
idx = 38;
|
||
if(H5B2_index(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5_ITER_INC, (hsize_t)1, find_cb, &idx)<0)
|
||
TEST_ERROR
|
||
idx = 42;
|
||
if(H5B2_index(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5_ITER_INC, (hsize_t)2, find_cb, &idx)<0)
|
||
TEST_ERROR
|
||
idx = 56;
|
||
if(H5B2_index(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5_ITER_INC, (hsize_t)3, find_cb, &idx)<0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
/* Close the file */
|
||
if(H5Fclose(file)<0)
|
||
TEST_ERROR
|
||
|
||
/* All tests passed */
|
||
return(0);
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return(1);
|
||
} /* test_insert_basic() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_insert_split_root
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code. This test inserts enough
|
||
* records to split the root node and force the tree to depth 1.
|
||
* It also continues to add a few more records to each of the
|
||
* left and right leaf nodes after the split
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Thursday, February 3, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_insert_split_root(hid_t fapl)
|
||
{
|
||
hid_t file=-1;
|
||
char filename[1024];
|
||
H5F_t *f=NULL;
|
||
hsize_t record; /* Record to insert into tree */
|
||
hsize_t idx; /* Index within B-tree, for iterator */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
H5B2_stat_t bt2_stat; /* Statistics about B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
unsigned u; /* Local index variable */
|
||
herr_t ret; /* Generic error return value */
|
||
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
/*
|
||
* Test inserting enough records into v2 B-tree to split the root node
|
||
*/
|
||
TESTING("B-tree insert: split root");
|
||
|
||
/*
|
||
* Test v2 B-tree creation
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Insert records to fill root leaf node */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC - 1); u++) {
|
||
record = u + 2;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 0)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != (INSERT_SPLIT_ROOT_NREC - 1))
|
||
TEST_ERROR
|
||
record = 33;
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
/* Insert record to split root leaf node */
|
||
record = INSERT_SPLIT_ROOT_NREC + 1;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 1)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != INSERT_SPLIT_ROOT_NREC)
|
||
TEST_ERROR
|
||
record = 33;
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
|
||
/* Insert a couple more records, on the left side of the B-tree */
|
||
record=0;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
record=1;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 1)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != (INSERT_SPLIT_ROOT_NREC + 2))
|
||
TEST_ERROR
|
||
record = 33;
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
|
||
/* Iterate over B-tree to check records have been inserted correctly */
|
||
idx = 0;
|
||
if(H5B2_iterate(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, iter_cb, &idx) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the index is correct */
|
||
if(idx != (INSERT_SPLIT_ROOT_NREC+2))
|
||
TEST_ERROR
|
||
|
||
/* Attempt to find non-existant record in level-1 B-tree */
|
||
/* (Should not be found, but not fail) */
|
||
idx = INSERT_SPLIT_ROOT_NREC + 10;
|
||
if(H5B2_find(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &idx, find_cb, &idx) != FALSE)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to find existant record in root of level-1 B-tree */
|
||
idx = 33;
|
||
if(H5B2_find(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &idx, find_cb, &idx) != TRUE)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Attempt to find existant record in leaf of level-1 B-tree */
|
||
idx = 56;
|
||
if(H5B2_find(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &idx, find_cb, &idx) != TRUE)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Attempt to index non-existant record in level-1 B-tree */
|
||
idx = 0;
|
||
H5E_BEGIN_TRY {
|
||
ret = H5B2_index(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5_ITER_INC, (hsize_t)(INSERT_SPLIT_ROOT_NREC+2), find_cb, NULL);
|
||
} H5E_END_TRY;
|
||
/* Should fail */
|
||
if(ret != FAIL)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to index existing record in root of level-1 B-tree */
|
||
idx = 33;
|
||
if(H5B2_index(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5_ITER_INC, (hsize_t)33, find_cb, &idx) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Attempt to index existing record in left leaf of level-1 B-tree */
|
||
idx = 0;
|
||
if(H5B2_index(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5_ITER_INC, (hsize_t)0, find_cb, &idx) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Attempt to index existing record in right leaf of level-1 B-tree */
|
||
idx = 50;
|
||
if(H5B2_index(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5_ITER_INC, (hsize_t)50, find_cb, &idx) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
PASSED();
|
||
|
||
if(H5Fclose(file) < 0)
|
||
TEST_ERROR
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_insert_split_root() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_insert_level1_2leaf_redistrib
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code. This test inserts enough
|
||
* records to split the root node and force the tree to depth 1.
|
||
* It continues to add a more records to the each of the
|
||
* left and right leaf nodes after the split to force a 2 node
|
||
* redistribution
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Tuesday, February 8, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_insert_level1_2leaf_redistrib(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 */
|
||
H5B2_stat_t bt2_stat; /* Statistics about B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
/*
|
||
* Test inserting many records into v2 B-tree
|
||
*/
|
||
TESTING("B-tree insert: redistribute 2 leaves in level 1 B-tree (l->r)");
|
||
|
||
/*
|
||
* Create v2 B-tree
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Insert enough records to force root to split into 2 leaves */
|
||
for(u = 0; u < INSERT_SPLIT_ROOT_NREC; u++) {
|
||
record = u + (INSERT_SPLIT_ROOT_NREC/2) + 1;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 1)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != INSERT_SPLIT_ROOT_NREC)
|
||
TEST_ERROR
|
||
record = INSERT_SPLIT_ROOT_NREC;
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
|
||
/* Force redistribution from left node into right node */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC / 2) + 1; u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 1)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != (INSERT_SPLIT_ROOT_NREC + (INSERT_SPLIT_ROOT_NREC / 2) + 1))
|
||
TEST_ERROR
|
||
record = (INSERT_SPLIT_ROOT_NREC / 2) + (INSERT_SPLIT_ROOT_NREC / 4) + 1;
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
/*
|
||
* Test inserting many records into v2 B-tree
|
||
*/
|
||
TESTING("B-tree insert: redistribute 2 leaves in level 1 B-tree (r->l)");
|
||
|
||
/*
|
||
* Create v2 B-tree
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Insert enough records to force root to split into 2 leaves */
|
||
for(u = 0; u < INSERT_SPLIT_ROOT_NREC; u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 1)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != INSERT_SPLIT_ROOT_NREC)
|
||
TEST_ERROR
|
||
record = (INSERT_SPLIT_ROOT_NREC / 2);
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
|
||
/* Force redistribution from left node into right node */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC / 2) + 1; u++) {
|
||
record = u + INSERT_SPLIT_ROOT_NREC;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 1)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != (INSERT_SPLIT_ROOT_NREC + (INSERT_SPLIT_ROOT_NREC / 2) + 1))
|
||
TEST_ERROR
|
||
record = (INSERT_SPLIT_ROOT_NREC / 2) + (INSERT_SPLIT_ROOT_NREC / 4) + 1;
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_insert_level1_2leaf_redistrib() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_insert_level1_side_split
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code. This test inserts enough
|
||
* records to split the root node and force the tree to depth 1.
|
||
* It continues to add a more records to the each of the
|
||
* left and right leaf nodes after the split to force a 2 node
|
||
* split, adding another node to the B-tree
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Tuesday, February 9, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_insert_level1_side_split(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 */
|
||
H5B2_stat_t bt2_stat; /* Statistics about B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
/*
|
||
* Test inserting many records into v2 B-tree
|
||
*/
|
||
TESTING("B-tree insert: split side leaf into 2 leaves in level 1 B-tree (l->r)");
|
||
|
||
/*
|
||
* Create v2 B-tree
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Insert enough records to force root to split into 2 leaves */
|
||
for(u = 0; u < INSERT_SPLIT_ROOT_NREC; u++) {
|
||
record = u + INSERT_SPLIT_ROOT_NREC;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 1)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != INSERT_SPLIT_ROOT_NREC)
|
||
TEST_ERROR
|
||
record = INSERT_SPLIT_ROOT_NREC + (INSERT_SPLIT_ROOT_NREC / 2);
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
|
||
/* Force left node to split */
|
||
for(u = 0; u < INSERT_SPLIT_ROOT_NREC; u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 1)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != (2 * INSERT_SPLIT_ROOT_NREC))
|
||
TEST_ERROR
|
||
record = 31;
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 63;
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
/*
|
||
* Test inserting many records into v2 B-tree
|
||
*/
|
||
TESTING("B-tree insert: split side leaf into 2 leaves in level 1 B-tree (r->l)");
|
||
|
||
/*
|
||
* Create v2 B-tree
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Insert enough records to force root to split into 2 leaves */
|
||
for(u = 0; u < INSERT_SPLIT_ROOT_NREC; u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 1)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != INSERT_SPLIT_ROOT_NREC)
|
||
TEST_ERROR
|
||
record = (INSERT_SPLIT_ROOT_NREC / 2);
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
|
||
/* Force right node to split */
|
||
for(u = 0; u < INSERT_SPLIT_ROOT_NREC; u++) {
|
||
record = u + INSERT_SPLIT_ROOT_NREC;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 1)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != (2 * INSERT_SPLIT_ROOT_NREC))
|
||
TEST_ERROR
|
||
record = 62;
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 94;
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_insert_level1_side_split() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_insert_level1_3leaf_redistrib
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code. This test inserts enough
|
||
* records to split the root node and force the tree to depth 1.
|
||
* It continues to add a more records to the each of the
|
||
* left and right leaf nodes after the split to force a 2 node
|
||
* split, adding another node to the B-tree, then continues to
|
||
* add records until a 3 node redistribution occurs
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Thursday, February 10, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_insert_level1_3leaf_redistrib(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 */
|
||
H5B2_stat_t bt2_stat; /* Statistics about B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
hsize_t idx; /* Index within B-tree, for iterator */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
/*
|
||
* Test inserting many records into v2 B-tree
|
||
*/
|
||
TESTING("B-tree insert: redistribute 3 leaves in level 1 B-tree");
|
||
|
||
/*
|
||
* Create v2 B-tree
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Insert enough records to force root to split into 2 leaves */
|
||
for(u = 0; u < INSERT_SPLIT_ROOT_NREC; u++) {
|
||
record = u + (INSERT_SPLIT_ROOT_NREC + (INSERT_SPLIT_ROOT_NREC / 2) + 1);
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 1)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != INSERT_SPLIT_ROOT_NREC)
|
||
TEST_ERROR
|
||
record = (2 * INSERT_SPLIT_ROOT_NREC);
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
|
||
/* Force left node to split */
|
||
for(u = 0; u < INSERT_SPLIT_ROOT_NREC; u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 1)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != (2 * INSERT_SPLIT_ROOT_NREC))
|
||
TEST_ERROR
|
||
record = (INSERT_SPLIT_ROOT_NREC / 2);
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = (INSERT_SPLIT_ROOT_NREC + (INSERT_SPLIT_ROOT_NREC / 2) + 1);
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
|
||
/* Insert records to force middle node to redistribute */
|
||
for(u = 0; u < ((INSERT_SPLIT_ROOT_NREC / 2) + 1); u++) {
|
||
record = u + INSERT_SPLIT_ROOT_NREC;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 1)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != ((2 * INSERT_SPLIT_ROOT_NREC) + (INSERT_SPLIT_ROOT_NREC / 2) + 1))
|
||
TEST_ERROR
|
||
record = 52;
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 105;
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
|
||
/* Iterate over B-tree to check records have been inserted correctly */
|
||
idx = 0;
|
||
if(H5B2_iterate(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, iter_cb, &idx) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the index is correct */
|
||
if(idx != ((INSERT_SPLIT_ROOT_NREC * 2) + (INSERT_SPLIT_ROOT_NREC / 2) + 1))
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_insert_level1_3leaf_redistrib() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_insert_level1_middle_split
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code. This test inserts enough
|
||
* records to split the root node and force the tree to depth 1.
|
||
* It continues to add a more records to the each of the
|
||
* left and right leaf nodes after the split to force a 2 node
|
||
* split, adding another node to the B-tree, then continues to
|
||
* add records until a 3 node split occurs
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Thursday, February 10, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_insert_level1_middle_split(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 */
|
||
H5B2_stat_t bt2_stat; /* Statistics about B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
hsize_t idx; /* Index within B-tree, for iterator */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
/*
|
||
* Test inserting many records into v2 B-tree
|
||
*/
|
||
TESTING("B-tree insert: split middle leaf into 2 leaves in level 1 B-tree");
|
||
|
||
/*
|
||
* Create v2 B-tree
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Insert enough records to force root to split into 2 leaves */
|
||
for(u = 0; u < INSERT_SPLIT_ROOT_NREC; u++) {
|
||
record = u + (INSERT_SPLIT_ROOT_NREC * 2);
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 1)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != INSERT_SPLIT_ROOT_NREC)
|
||
TEST_ERROR
|
||
record = (2 * INSERT_SPLIT_ROOT_NREC) + (INSERT_SPLIT_ROOT_NREC / 2);
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
|
||
/* Force split from left node into right node */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC * 2); u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 1)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != (3 * INSERT_SPLIT_ROOT_NREC))
|
||
TEST_ERROR
|
||
record = 62;
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 94;
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 126;
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
|
||
/* Iterate over B-tree to check records have been inserted correctly */
|
||
idx = 0;
|
||
if(H5B2_iterate(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, iter_cb, &idx) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the index is correct */
|
||
if(idx != (INSERT_SPLIT_ROOT_NREC * 3))
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
STACK_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_insert_level1_middle_split() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* 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
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
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 */
|
||
H5B2_stat_t bt2_stat; /* Statistics about B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
hsize_t idx; /* Index within B-tree, for iterator */
|
||
unsigned u; /* Local index variable */
|
||
herr_t ret; /* Generic error return value */
|
||
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
/*
|
||
* Test inserting many records into v2 B-tree
|
||
*/
|
||
TESTING("B-tree insert: make level 2 B-tree");
|
||
|
||
/*
|
||
* Create v2 B-tree
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Insert enough records to force root to split into 2 internal nodes */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC * 9); u++) {
|
||
record = u + 2;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
for(; u < ((INSERT_SPLIT_ROOT_NREC * 29) + 1); u++) {
|
||
record = u + 4;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != ((INSERT_SPLIT_ROOT_NREC * 29) + 1))
|
||
TEST_ERROR
|
||
record = 948;
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
|
||
/* Add some extra records to left-most leaf */
|
||
record = 0;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
record = 1;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Add some extra records to middle leaf */
|
||
record = (INSERT_SPLIT_ROOT_NREC * 9) + 2;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
record = (INSERT_SPLIT_ROOT_NREC * 9) + 3;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
|
||
/* Iterate over B-tree to check records have been inserted correctly */
|
||
idx = 0;
|
||
if(H5B2_iterate(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, iter_cb, &idx) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the index is correct */
|
||
if(idx != ((INSERT_SPLIT_ROOT_NREC * 29) + 5))
|
||
TEST_ERROR
|
||
|
||
/* Attempt to find non-existant record in level-2 B-tree */
|
||
/* (Should not be found, but not fail) */
|
||
idx = INSERT_SPLIT_ROOT_NREC * 30;
|
||
if(H5B2_find(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &idx, find_cb, &idx) != FALSE)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to find existant record in root of level-2 B-tree */
|
||
idx = 948;
|
||
if(H5B2_find(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &idx, find_cb, &idx) != TRUE)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Check with B-tree */
|
||
record = 948;
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to find existant record in internal node of level-2 B-tree */
|
||
idx = 505;
|
||
if(H5B2_find(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &idx, find_cb, &idx) != TRUE)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Check with B-tree */
|
||
record = 505;
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to find existant record in leaf of level-2 B-tree */
|
||
idx = 555;
|
||
if(H5B2_find(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &idx, find_cb, &idx) != TRUE)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Check with B-tree */
|
||
record = 555;
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to index non-existant record in level-2 B-tree */
|
||
idx = 0;
|
||
H5E_BEGIN_TRY {
|
||
ret = H5B2_index(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5_ITER_INC, (hsize_t)(INSERT_SPLIT_ROOT_NREC * 30), find_cb, NULL);
|
||
} H5E_END_TRY;
|
||
/* Should fail */
|
||
if(ret != FAIL)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to index existing record in root of level-2 B-tree */
|
||
idx = 948;
|
||
if(H5B2_index(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5_ITER_INC, (hsize_t)948, find_cb, &idx) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Attempt to index existing record in internal node of level-2 B-tree */
|
||
idx = 505;
|
||
if(H5B2_index(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5_ITER_INC, (hsize_t)505, find_cb, &idx) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Attempt to index existing record in leaf of level-2 B-tree */
|
||
idx = 555;
|
||
if(H5B2_index(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5_ITER_INC, (hsize_t)555, find_cb, &idx) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_insert_make_level2() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_insert_level2_leaf_redistrib
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code. This test inserts enough
|
||
* records to make a level 2 B-tree and then adds enough more
|
||
* records to force the leaves to redistribute
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Thursday, February 17, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_insert_level2_leaf_redistrib(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 */
|
||
H5B2_stat_t bt2_stat; /* Statistics about B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
hsize_t idx; /* Index within B-tree, for iterator */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
/*
|
||
* Test inserting many records into v2 B-tree
|
||
*/
|
||
TESTING("B-tree insert: redistrib right-most leaf in level 2 B-tree");
|
||
|
||
/*
|
||
* Create v2 B-tree
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Insert enough records to force root to split into 2 internal nodes */
|
||
/* And fill rightmost leaf */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC * 8); u++) {
|
||
record = u + (INSERT_SPLIT_ROOT_NREC / 2) + 1;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
for(; u < ((INSERT_SPLIT_ROOT_NREC * 29) + (INSERT_SPLIT_ROOT_NREC / 2)); u++) {
|
||
record = u + INSERT_SPLIT_ROOT_NREC + 1;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != ((INSERT_SPLIT_ROOT_NREC * 29) + (INSERT_SPLIT_ROOT_NREC / 2)))
|
||
TEST_ERROR
|
||
record = 1008; /* Record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 1859; /* Right-most record in right internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 1921; /* Right-most record in right-most leaf */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
/* Insert record to force redistribution of rightmost leaf */
|
||
record = u + INSERT_SPLIT_ROOT_NREC + 1;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != ((INSERT_SPLIT_ROOT_NREC * 29) + (INSERT_SPLIT_ROOT_NREC / 2) + 1))
|
||
TEST_ERROR
|
||
record = 1008; /* Record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 1875; /* Right-most record in right internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 1922; /* Right-most record in right-most leaf */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
TESTING("B-tree insert: redistrib left-most leaf in level 2 B-tree");
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != ((INSERT_SPLIT_ROOT_NREC * 29) + (INSERT_SPLIT_ROOT_NREC / 2) + 1))
|
||
TEST_ERROR
|
||
record = 1008; /* Record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 94; /* Left-most record in left internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 32; /* Left-most record in left-most leaf */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
/* Add more records to left-most leaf, to force a 2->1 split and then a
|
||
* 2 node redistribution on left leaf
|
||
*/
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC / 2) + 1; u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != ((INSERT_SPLIT_ROOT_NREC * 30) + 1))
|
||
TEST_ERROR
|
||
record = 1008; /* Record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 47; /* Left-most record in left internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 0;
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
TESTING("B-tree insert: redistrib middle leaf in level 2 B-tree");
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != ((INSERT_SPLIT_ROOT_NREC * 30) + 1))
|
||
TEST_ERROR
|
||
record = 1008; /* Record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 535; /* Record in middle node before insertion point */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 630; /* Record in middle node after insertion point */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 568; /* Record in leaf node just after insertion point */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
/* Add more records to middle leaf, to force a split and a 3 node redistribution on middle leaf */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC / 2) + 1; u++) {
|
||
record = u + (INSERT_SPLIT_ROOT_NREC * 8) + (INSERT_SPLIT_ROOT_NREC / 2) + 1;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != ((INSERT_SPLIT_ROOT_NREC * 30) + (INSERT_SPLIT_ROOT_NREC / 2) + 2))
|
||
TEST_ERROR
|
||
record = 1008; /* Record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 524; /* Record in middle node before insertion point */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 577; /* Record in middle node after insertion point */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 568; /* Record in leaf node just after insertion point */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
/* Iterate over B-tree to check records have been inserted correctly */
|
||
idx = 0;
|
||
if(H5B2_iterate(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, iter_cb, &idx) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the index is correct */
|
||
if(idx != ((INSERT_SPLIT_ROOT_NREC * 30) + (INSERT_SPLIT_ROOT_NREC / 2) + 2))
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
STACK_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_insert_level2_leaf_redistrib() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_insert_level2_leaf_split
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code. This test inserts enough
|
||
* records to make a level 2 B-tree and then adds enough more
|
||
* records to force leaves to split.
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Thursday, February 17, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_insert_level2_leaf_split(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 */
|
||
H5B2_stat_t bt2_stat; /* Statistics about B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
hsize_t idx; /* Index within B-tree, for iterator */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
/*
|
||
* Test inserting many records into v2 B-tree
|
||
*/
|
||
TESTING("B-tree insert: split right-most leaf in level 2 B-tree");
|
||
|
||
/*
|
||
* Create v2 B-tree
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Insert enough records to force root to split into 2 internal nodes */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC * 8); u++) {
|
||
record = u + 1;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
for(; u < ((INSERT_SPLIT_ROOT_NREC * 29) + (INSERT_SPLIT_ROOT_NREC / 2)); u++) {
|
||
record = u + 2;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != ((INSERT_SPLIT_ROOT_NREC * 29) + (INSERT_SPLIT_ROOT_NREC / 2)))
|
||
TEST_ERROR
|
||
record = 946; /* Record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 1797; /* Right-most record in right internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 1859; /* Right-most record in right-most leaf */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
/* Insert enough records to force right-most leaf to split */
|
||
for(u = 0; u < ((INSERT_SPLIT_ROOT_NREC / 2) + 1); u++) {
|
||
record = u + (INSERT_SPLIT_ROOT_NREC * 29) + (INSERT_SPLIT_ROOT_NREC / 2) + 2;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != (INSERT_SPLIT_ROOT_NREC * 30))
|
||
TEST_ERROR
|
||
record = 946; /* Record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 1828; /* Next-to-right-most record in right-most internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 1860; /* Right-most record in right-most internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 1891; /* Right-most record in right-most leaf */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
TESTING("B-tree insert: split left-most leaf in level 2 B-tree");
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != (INSERT_SPLIT_ROOT_NREC * 30))
|
||
TEST_ERROR
|
||
record = 946; /* Record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 63; /* Left-most record in left-most internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 1; /* Left-most record in left-most leaf */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
/* Add another record to left-most leaf, to force a 1->2 node split on left leaf */
|
||
record = 0;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != ((INSERT_SPLIT_ROOT_NREC * 30) + 1))
|
||
TEST_ERROR
|
||
record = 946; /* Record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 63; /* Next-to-left-most record in left internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 32; /* Left-most record in left internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 0; /* Left-most record in left-most leaf */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
TESTING("B-tree insert: split middle leaf in level 2 B-tree");
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != ((INSERT_SPLIT_ROOT_NREC * 30) + 1))
|
||
TEST_ERROR
|
||
record = 946; /* Record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 504; /* Record in internal node just before insertion point */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 568; /* Record in internal node just after insertion point */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 506; /* Record in leaf node just after insertion point */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
/* Add another record to middle leaf, to force a node split on middle leaf */
|
||
record = (INSERT_SPLIT_ROOT_NREC * 8) + 1;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != ((INSERT_SPLIT_ROOT_NREC * 30) + 2))
|
||
TEST_ERROR
|
||
record = 946; /* Record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 504; /* Left-most record of split in left internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 537; /* Middle record of split in left internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 568; /* Right-most record of split in left internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 506; /* Record in leaf node just after insertion point */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
/* Iterate over B-tree to check records have been inserted correctly */
|
||
idx = 0;
|
||
if(H5B2_iterate(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, iter_cb, &idx) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the index is correct */
|
||
if(idx != ((INSERT_SPLIT_ROOT_NREC * 30) + 2))
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_insert_level2_leaf_split() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_insert_level2_2internal_redistrib
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code. This test inserts enough
|
||
* records to make a level 2 B-tree and then adds enough more
|
||
* records to force the left-most and right-most internal nodes to
|
||
* redistribute.
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Friday, February 18, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_insert_level2_2internal_redistrib(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 */
|
||
H5B2_stat_t bt2_stat; /* Statistics about B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
hsize_t idx; /* Index within B-tree, for iterator */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
/*
|
||
* Test inserting many records into v2 B-tree
|
||
*/
|
||
TESTING("B-tree insert: redist. 2 internal (r->l) in level 2 B-tree");
|
||
|
||
/*
|
||
* Create v2 B-tree
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Insert enough records to force root to split into 2 internal nodes */
|
||
/* And fill up right internal node, to just before to redistribute it */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC * 44); u++) {
|
||
record = u + (INSERT_SPLIT_ROOT_NREC * 6) - 4;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != (INSERT_SPLIT_ROOT_NREC * 44))
|
||
TEST_ERROR
|
||
record = 1318; /* Record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 3114; /* Right-most record in right internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 3145; /* Right-most record in right leaf node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
/* Insert record to redistribute right-most internal node */
|
||
record = u + (INSERT_SPLIT_ROOT_NREC * 6) - 4;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != ((INSERT_SPLIT_ROOT_NREC * 44) + 1))
|
||
TEST_ERROR
|
||
record = 1822; /* Record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 3114; /* Right-most record in right internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 3146; /* Right-most record in right leaf node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
TESTING("B-tree insert: redist. 2 internal (l->r) in level 2 B-tree");
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != ((INSERT_SPLIT_ROOT_NREC * 44) + 1))
|
||
TEST_ERROR
|
||
record = 1822; /* Record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 436; /* Left-most record in left internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 374; /* Left-most record in left leaf node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
/* Force left-most internal node to redistribute */
|
||
for(u = 0; u < ((INSERT_SPLIT_ROOT_NREC * 6) - 4); u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != ((INSERT_SPLIT_ROOT_NREC * 50) - 3))
|
||
TEST_ERROR
|
||
record = 1570; /* Record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 61; /* Left-most record in left internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 0; /* Left-most record in left leaf node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
|
||
/* Iterate over B-tree to check records have been inserted correctly */
|
||
idx = 0;
|
||
if(H5B2_iterate(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, iter_cb, &idx) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the index is correct */
|
||
if(idx != ((INSERT_SPLIT_ROOT_NREC * 50) - 3))
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_insert_level2_2internal_redistrib() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_insert_level2_2internal_split
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code. This test inserts enough
|
||
* records to make a level 2 B-tree and then adds enough more
|
||
* records to force the left-most and right-most internal nodes to
|
||
* split.
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Friday, February 18, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_insert_level2_2internal_split(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 */
|
||
H5B2_stat_t bt2_stat; /* Statistics about B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
hsize_t idx; /* Index within B-tree, for iterator */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
/*
|
||
* Test inserting many records into v2 B-tree
|
||
*/
|
||
TESTING("B-tree insert: split side internal node to 2 in level 2 B-tree (r->l)");
|
||
|
||
/*
|
||
* Create v2 B-tree
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Insert enough records to force root to split into 2 internal nodes */
|
||
/* (And fill up two child internal nodes) */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC * 59); u++) {
|
||
record = u + (INSERT_SPLIT_ROOT_NREC * 14) - (INSERT_SPLIT_ROOT_NREC / 4) + 3;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != (INSERT_SPLIT_ROOT_NREC * 59))
|
||
TEST_ERROR
|
||
record = 2759; /* Record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 4555; /* Right-most record in right internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 4586; /* Right-most record in right leaf node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
/* Insert record to split right-most internal node */
|
||
record = u + (INSERT_SPLIT_ROOT_NREC * 14) - (INSERT_SPLIT_ROOT_NREC / 4) + 3;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != ((INSERT_SPLIT_ROOT_NREC * 59) + 1))
|
||
TEST_ERROR
|
||
record = 2759; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 3704; /* Right record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 4555; /* Right-most record in right internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 4387; /* Right-most record in right leaf node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
TESTING("B-tree insert: split side internal node to 2 in level 2 B-tree (l->2)");
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != ((INSERT_SPLIT_ROOT_NREC * 59) + 1))
|
||
TEST_ERROR
|
||
record = 2759; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 932; /* Left-most record in left internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 870; /* Left-most record in left leaf node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
/* Force left-most internal node to split */
|
||
for(u = 0; u < ((INSERT_SPLIT_ROOT_NREC * 14) - (INSERT_SPLIT_ROOT_NREC / 4) + 3); u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != ((INSERT_SPLIT_ROOT_NREC * 73) - (INSERT_SPLIT_ROOT_NREC / 4) + 4))
|
||
TEST_ERROR
|
||
record = 870; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 1814; /* Next-to-left-most record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 61; /* Left-most record in left internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 0; /* Left-most record in left leaf node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
/* Iterate over B-tree to check records have been inserted correctly */
|
||
idx = 0;
|
||
if(H5B2_iterate(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, iter_cb, &idx) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the index is correct */
|
||
if(idx != ((INSERT_SPLIT_ROOT_NREC * 73) - (INSERT_SPLIT_ROOT_NREC / 4) + 4))
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
STACK_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_insert_level2_2internal_split() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_insert_level2_3internal_redistrib
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code. This test inserts enough
|
||
* records to make a level 2 B-tree and then adds enough more
|
||
* records to force the left-most and right-most internal nodes to
|
||
* split and more records to force a 3 node redistribution of the
|
||
* internal nodes.
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Saturday, February 19, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_insert_level2_3internal_redistrib(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 */
|
||
H5B2_stat_t bt2_stat; /* Statistics about B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
hsize_t idx; /* Index within B-tree, for iterator */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
/*
|
||
* Test inserting many records into v2 B-tree
|
||
*/
|
||
TESTING("B-tree insert: redistrib 3 internals in level 2 B-tree");
|
||
|
||
/*
|
||
* Create v2 B-tree
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Insert enough records to force root to split into 3 internal nodes */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC * 36); u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
for(; u < ((INSERT_SPLIT_ROOT_NREC * 59) + 1); u++) {
|
||
record = u + (INSERT_SPLIT_ROOT_NREC * 13) + ((3 * INSERT_SPLIT_ROOT_NREC) / 4) + 3;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != ((INSERT_SPLIT_ROOT_NREC * 59) + 1))
|
||
TEST_ERROR
|
||
record = 1889; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 3703; /* Right record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 2267; /* Record to left of insertion point in middle internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 3199; /* Record to right of insertion point in middle internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 3137; /* Record just above insertion point in leaf node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
/* Insert records to fill up middle internal node */
|
||
for(u = 0; u < ((INSERT_SPLIT_ROOT_NREC * 13) + ((3 * INSERT_SPLIT_ROOT_NREC) / 4) + 2); u++) {
|
||
record = u + (INSERT_SPLIT_ROOT_NREC * 36);
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != ((INSERT_SPLIT_ROOT_NREC * 72) + ((3 * INSERT_SPLIT_ROOT_NREC) / 4) + 3))
|
||
TEST_ERROR
|
||
record = 1889; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 3703; /* Right record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 3104; /* Record to left of insertion point in middle internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 3137; /* Record to right of insertion point in middle internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 3135; /* Record just above insertion point in leaf node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
/* Insert another record, forcing the middle internal node to redistribute */
|
||
record = u + (INSERT_SPLIT_ROOT_NREC * 36);
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != ((INSERT_SPLIT_ROOT_NREC * 72) + ((3 * INSERT_SPLIT_ROOT_NREC) / 4) + 4))
|
||
TEST_ERROR
|
||
record = 1574; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 3104; /* Right record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
#ifdef NONE
|
||
record = 2862; /* Record to left of insertion point in right internal node (now) */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
#endif /* NONE */
|
||
record = 3137; /* Record to right of insertion point in right internal node (now) */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 3135; /* Record just above insertion point in leaf node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
/* Iterate over B-tree to check records have been inserted correctly */
|
||
idx = 0;
|
||
if(H5B2_iterate(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, iter_cb, &idx) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the index is correct */
|
||
if(idx != ((INSERT_SPLIT_ROOT_NREC * 72) + ((3 * INSERT_SPLIT_ROOT_NREC) / 4) + 4))
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
STACK_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_insert_level2_3internal_redistrib() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_insert_level2_3internal_split
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code. This test inserts enough
|
||
* records to make a level 2 B-tree and then adds enough more
|
||
* records to force the left-most and right-most internal nodes to
|
||
* split and more records to force a 3->4 node split of the
|
||
* internal nodes.
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Saturday, February 19, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_insert_level2_3internal_split(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 */
|
||
H5B2_stat_t bt2_stat; /* Statistics about B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
hsize_t idx; /* Index within B-tree, for iterator */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
/*
|
||
* Test inserting many records into v2 B-tree
|
||
*/
|
||
TESTING("B-tree insert: split 3 internals to 4 in level 2 B-tree");
|
||
|
||
/*
|
||
* Create v2 B-tree
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Insert enough records to force root to split into 3 internal nodes */
|
||
/* (and fill right internal node) */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC * 31); u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
for(; u < (INSERT_SPLIT_ROOT_NREC * 74); u++) {
|
||
record = u + ((INSERT_SPLIT_ROOT_NREC * 13) + ((3 * INSERT_SPLIT_ROOT_NREC) / 4) + 3);
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != (INSERT_SPLIT_ROOT_NREC * 74))
|
||
TEST_ERROR
|
||
record = 1889; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 3703; /* Right record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 1952; /* Record to left of insertion point in middle internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 2884; /* Record to right of insertion point in middle internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 2822; /* Record just after insertion point in leaf node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
/* Insert records to fill up middle internal node */
|
||
for(u = 0; u < ((INSERT_SPLIT_ROOT_NREC * 13) + ((3 * INSERT_SPLIT_ROOT_NREC) / 4) + 2); u++) {
|
||
record = u + (INSERT_SPLIT_ROOT_NREC * 31);
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != ((INSERT_SPLIT_ROOT_NREC * 87) + ((3 * INSERT_SPLIT_ROOT_NREC) / 4) + 2))
|
||
TEST_ERROR
|
||
record = 1889; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 3703; /* Right record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 2789; /* Record to left of insertion point in middle internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 2822; /* Record to right of insertion point in middle internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 2823; /* Record just above insertion point in leaf node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
/* Insert record to split middle internal node */
|
||
record = u + (INSERT_SPLIT_ROOT_NREC * 31);
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != ((INSERT_SPLIT_ROOT_NREC * 87) + ((3 * INSERT_SPLIT_ROOT_NREC) / 4) + 3))
|
||
TEST_ERROR
|
||
record = 1889; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 2789; /* Middle record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 3703; /* Right record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
#ifdef NONE
|
||
record = 3049; /* Record to left of insertion point in middle internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
#endif /* NONE */
|
||
record = 2822; /* Record to right of insertion point in middle internal node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 2823; /* Record just after insertion point in leaf node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
|
||
/* Iterate over B-tree to check records have been inserted correctly */
|
||
idx = 0;
|
||
if(H5B2_iterate(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, iter_cb, &idx) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the index is correct */
|
||
if(idx != ((INSERT_SPLIT_ROOT_NREC * 87) + ((3 * INSERT_SPLIT_ROOT_NREC) / 4) + 3))
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_insert_level2_3internal_split() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_insert_lots
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code. This test inserts many
|
||
* records in random order, enough to make at a level 4 B-tree.
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Saturday, February 19, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_insert_lots(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 */
|
||
hsize_t idx; /* Index within B-tree, for iterator */
|
||
time_t curr_time; /* Current time, for seeding random number generator */
|
||
hsize_t *records; /* Record #'s for random insertion */
|
||
unsigned u; /* Local index variable */
|
||
unsigned swap_idx; /* Location to swap with when shuffling */
|
||
hsize_t temp_rec; /* Temporary record */
|
||
H5B2_stat_t bt2_stat; /* Statistics about B-tree created */
|
||
hsize_t nrec; /* Number of records in B-tree */
|
||
herr_t ret; /* Generic error return value */
|
||
|
||
/* Initialize random number seed */
|
||
curr_time=HDtime(NULL);
|
||
#ifdef QAK
|
||
curr_time=1109170019;
|
||
HDfprintf(stderr,"curr_time=%lu\n",(unsigned long)curr_time);
|
||
#endif /* QAK */
|
||
HDsrandom((unsigned long)curr_time);
|
||
|
||
/*
|
||
* Test inserting many records into v2 B-tree
|
||
*/
|
||
TESTING("B-tree insert: create random level 4 B-tree");
|
||
|
||
/* Allocate space for the records */
|
||
if((records = (hsize_t *)HDmalloc(sizeof(hsize_t) * INSERT_MANY)) == NULL)
|
||
TEST_ERROR
|
||
|
||
/* Initialize record #'s */
|
||
for(u=0; u<INSERT_MANY; u++)
|
||
records[u] = u;
|
||
|
||
/* Shuffle record #'s */
|
||
for(u=0; u<INSERT_MANY; u++) {
|
||
swap_idx = ((unsigned)HDrandom() % (INSERT_MANY - u)) + u;
|
||
temp_rec = records[u];
|
||
records[u] = records[swap_idx];
|
||
records[swap_idx] = temp_rec;
|
||
} /* end for */
|
||
|
||
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 = (H5F_t *)H5I_object(file)))
|
||
FAIL_STACK_ERROR
|
||
|
||
/*
|
||
* Create v2 B-tree
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Insert random records */
|
||
for(u = 0; u < INSERT_MANY; u++) {
|
||
record = records[u];
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 4)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != INSERT_MANY)
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
STACK_ERROR
|
||
|
||
/* Re-open the file */
|
||
if((file = H5Fopen(filename, H5F_ACC_RDWR, fapl)) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Check up on B-tree after re-open */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 4)
|
||
TEST_ERROR
|
||
if(bt2_stat.nrecords != INSERT_MANY)
|
||
TEST_ERROR
|
||
|
||
/* Iterate over B-tree to check records have been inserted correctly */
|
||
idx = 0;
|
||
if(H5B2_iterate(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, iter_cb, &idx) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the index is correct */
|
||
if(idx != INSERT_MANY)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to find non-existant record in level-4 B-tree */
|
||
/* (Should not be found, but not fail) */
|
||
idx = INSERT_MANY * 2;
|
||
if(H5B2_find(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &idx, find_cb, &idx) != FALSE)
|
||
TEST_ERROR
|
||
|
||
/* Find random records */
|
||
for(u = 0; u < FIND_MANY; u++) {
|
||
/* Pick random record */
|
||
idx = (hsize_t)(HDrandom()%INSERT_MANY);
|
||
|
||
/* Attempt to find existant record in root of level-4 B-tree */
|
||
if(H5B2_find(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &idx, find_cb, &idx) != TRUE)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Attempt to index non-existant record in level-4 B-tree, in increasing & decreasing order */
|
||
H5E_BEGIN_TRY {
|
||
ret = H5B2_index(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5_ITER_INC, (hsize_t)(INSERT_MANY*3), find_cb, NULL);
|
||
} H5E_END_TRY;
|
||
/* Should fail */
|
||
if(ret != FAIL)
|
||
TEST_ERROR
|
||
H5E_BEGIN_TRY {
|
||
ret = H5B2_index(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5_ITER_DEC, (hsize_t)(INSERT_MANY*3), find_cb, NULL);
|
||
} H5E_END_TRY;
|
||
/* Should fail */
|
||
if(ret != FAIL)
|
||
TEST_ERROR
|
||
|
||
/* Find random records */
|
||
for(u = 0; u < FIND_MANY; u++) {
|
||
/* Pick random record */
|
||
idx = (hsize_t)(HDrandom() % INSERT_MANY);
|
||
|
||
/* Attempt to find existant record in root of level-4 B-tree */
|
||
/* (in increasing order) */
|
||
if(H5B2_index(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5_ITER_INC, idx, find_cb, &idx) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Attempt to find existant record in root of level-4 B-tree */
|
||
/* (in decreasing order) */
|
||
if(H5B2_index(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5_ITER_DEC, idx, find_dec_cb, &idx) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
PASSED();
|
||
|
||
TESTING("B-tree insert: attempt duplicate record in level 4 B-tree");
|
||
|
||
record = INSERT_MANY / 2;
|
||
H5E_BEGIN_TRY {
|
||
ret = H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record);
|
||
} H5E_END_TRY;
|
||
/* Should fail */
|
||
if(ret != FAIL)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != INSERT_MANY)
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
HDfree(records);
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
HDfree(records);
|
||
return 1;
|
||
} /* test_insert_lots() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_remove_basic
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Friday, February 25, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_remove_basic(hid_t fapl)
|
||
{
|
||
hid_t file=-1;
|
||
char filename[1024];
|
||
H5F_t *f=NULL;
|
||
hsize_t record; /* Record to insert into tree */
|
||
hsize_t rrecord; /* Record to remove from tree */
|
||
hsize_t nrec; /* Number of records in B-tree */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
haddr_t root_addr; /* Address of root of B-tree created */
|
||
herr_t ret; /* Generic error return value */
|
||
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
/* Record removal tests */
|
||
TESTING("B-tree remove: record from empty B-tree");
|
||
|
||
/*
|
||
* Test v2 B-tree creation
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != 0)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to remove a record from a B-tree with no records */
|
||
record = 0;
|
||
H5E_BEGIN_TRY {
|
||
ret = H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, NULL, NULL);
|
||
} H5E_END_TRY;
|
||
/* Should fail */
|
||
if(ret != FAIL)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
TESTING("B-tree remove: non-existant record from 1 record B-tree");
|
||
|
||
/* Insert one record into B-tree */
|
||
record = 42;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != 1)
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Attempt to remove a non-existant record from a B-tree with 1 record */
|
||
record = 0;
|
||
H5E_BEGIN_TRY {
|
||
ret = H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, NULL, NULL);
|
||
} H5E_END_TRY;
|
||
/* Should fail */
|
||
if(ret != FAIL)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
/* Attempt to remove a record from a B-tree with 1 record */
|
||
TESTING("B-tree remove: existant record from 1 record B-tree");
|
||
record = 42;
|
||
rrecord = 0;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != 42)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != 0)
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the root node has been freed */
|
||
if(H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
/* Attempt to insert records into B-tree which had records removed */
|
||
TESTING("B-tree remove: adding records to B-tree after removal");
|
||
|
||
/* Insert several records into B-tree again */
|
||
record=42;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
record=34;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
record=56;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
record=38;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != 4)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
/* Attempt to remove a non-existant record from a level-0 B-tree with mult. record */
|
||
TESTING("B-tree remove: non-existant record from level-0 B-tree");
|
||
record = 0;
|
||
H5E_BEGIN_TRY {
|
||
ret = H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, NULL, NULL);
|
||
} H5E_END_TRY;
|
||
/* Should fail */
|
||
if(ret != FAIL)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
/* Attempt to remove a record from a level-0 B-tree with mult. record */
|
||
TESTING("B-tree remove: mult. existant records from level-0 B-tree");
|
||
record = 42;
|
||
rrecord = 0;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != 42)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != 3)
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the root node has not been freed */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
record = 34;
|
||
rrecord = 0;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != 34)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != 2)
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the root node has not been freed */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
record = 56;
|
||
rrecord = 0;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != 56)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != 1)
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the root node has not been freed */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
record = 38;
|
||
rrecord = 0;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != 38)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != 0)
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the root node has been freed */
|
||
if(H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_remove_basic() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_remove_level1_noredistrib
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Friday, February 25, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_remove_level1_noredistrib(hid_t fapl)
|
||
{
|
||
hid_t file=-1;
|
||
char filename[1024];
|
||
H5F_t *f=NULL;
|
||
hsize_t record; /* Record to insert into tree */
|
||
hsize_t rrecord; /* Record to remove from tree */
|
||
hsize_t nrec; /* Number of records in B-tree */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
haddr_t root_addr; /* Address of root of B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
unsigned u; /* Local index variable */
|
||
herr_t ret; /* Generic error return value */
|
||
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
/* B-tree record removal tests */
|
||
TESTING("B-tree remove: non-existant record from level-1 B-tree");
|
||
|
||
/*
|
||
* Test v2 B-tree creation
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Create level-1 B-tree with 3 leaves */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC * 2); u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 2))
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Attempt to remove a non-existant record from a B-tree with 1 record */
|
||
record = (INSERT_SPLIT_ROOT_NREC * 2) + 1;
|
||
H5E_BEGIN_TRY {
|
||
ret = H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, NULL, NULL);
|
||
} H5E_END_TRY;
|
||
/* Should fail */
|
||
if(ret != FAIL)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC*2))
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
/* Attempt to remove a record from right leaf of a level-1 B-tree with noredistribution */
|
||
TESTING("B-tree remove: record from right leaf of level-1 B-tree");
|
||
record = 62; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 94; /* Right record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = (INSERT_SPLIT_ROOT_NREC * 2) - 2;
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
rrecord = 0;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != ((INSERT_SPLIT_ROOT_NREC * 2) - 2))
|
||
TEST_ERROR
|
||
|
||
/* Make certain that the leaf nodes didn't redistribute */
|
||
record = 62; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 94; /* Right record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != ((INSERT_SPLIT_ROOT_NREC * 2) - 1))
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
/* Attempt to remove a record from left leaf of a level-1 B-tree with noredistribution */
|
||
TESTING("B-tree remove: record from left leaf of level-1 B-tree");
|
||
record = 0;
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
rrecord = 1;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != 0)
|
||
TEST_ERROR
|
||
|
||
/* Make certain that the leaf nodes didn't redistribute */
|
||
record = 62; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 94; /* Right record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != ((INSERT_SPLIT_ROOT_NREC * 2) - 2))
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
/* Attempt to remove a record from middle leaf of a level-1 B-tree with noredistribution */
|
||
TESTING("B-tree remove: record from middle leaf of level-1 B-tree");
|
||
record = INSERT_SPLIT_ROOT_NREC;
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 0)
|
||
TEST_ERROR
|
||
rrecord = 0;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != INSERT_SPLIT_ROOT_NREC)
|
||
TEST_ERROR
|
||
|
||
/* Make certain that the leaf nodes didn't redistribute */
|
||
record = 62; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 94; /* Right record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != ((INSERT_SPLIT_ROOT_NREC * 2) - 3))
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
if (H5Fclose(file)<0) TEST_ERROR
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_remove_level1_noredistrib() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_remove_level1_redistrib
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Friday, March 4, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_remove_level1_redistrib(hid_t fapl)
|
||
{
|
||
hid_t file=-1;
|
||
char filename[1024];
|
||
H5F_t *f=NULL;
|
||
hsize_t record; /* Record to insert into tree */
|
||
hsize_t rrecord; /* Record to remove from tree */
|
||
hsize_t nrec; /* Number of records in B-tree */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
haddr_t root_addr; /* Address of root of B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
/* More complex record removals */
|
||
TESTING("B-tree remove: redistribute 2 leaves in level-1 B-tree (r->l)");
|
||
|
||
/*
|
||
* Test v2 B-tree creation
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Create level-1 B-tree with 3 leaves */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC * 2); u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 62; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 94; /* Right record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 2))
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Attempt to remove enough records from right leaf of a level-1 B-tree to force redistribution */
|
||
for(u = 0; u < 8; u++) {
|
||
record = (INSERT_SPLIT_ROOT_NREC * 2) - (u + 1);
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != ((INSERT_SPLIT_ROOT_NREC * 2) - (u + 1)))
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != ((INSERT_SPLIT_ROOT_NREC * 2) - (u + 1)))
|
||
TEST_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 62; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 90; /* Right record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
/* Attempt to remove enough records from left leaf of a level-1 B-tree to force redistribution */
|
||
TESTING("B-tree remove: redistribute 2 leaves in level-1 B-tree (l->r)");
|
||
for(u = 0; u < 39; u++) {
|
||
record = u;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != u)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (((INSERT_SPLIT_ROOT_NREC * 2) - 8) - (u + 1)))
|
||
TEST_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 64; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 90; /* Right record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
/* Attempt to remove enough records from middle leaf of a level-1 B-tree to force redistribution */
|
||
TESTING("B-tree remove: redistribute 3 leaves in level-1 B-tree");
|
||
for(u = 0; u < 2; u++) {
|
||
record = INSERT_SPLIT_ROOT_NREC + 2 + u;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != (INSERT_SPLIT_ROOT_NREC + 2 + u))
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != ((((INSERT_SPLIT_ROOT_NREC * 2) - 47)) - (u + 1)))
|
||
TEST_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 64; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 91; /* Right record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_remove_level1_redistrib() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_remove_level1_2leaf_merge
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Friday, March 4, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_remove_level1_2leaf_merge(hid_t fapl)
|
||
{
|
||
hid_t file=-1;
|
||
char filename[1024];
|
||
H5F_t *f=NULL;
|
||
hsize_t record; /* Record to insert into tree */
|
||
hsize_t rrecord; /* Record to remove from tree */
|
||
hsize_t nrec; /* Number of records in B-tree */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
haddr_t root_addr; /* Address of root of B-tree created */
|
||
H5B2_node_info_test_t ninfo; /* B-tree node info */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
TESTING("B-tree remove: merge 2 leaves to 1 in level-1 B-tree (r->l)");
|
||
|
||
/*
|
||
* Test v2 B-tree creation
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Create level-1 B-tree with 3 leaves */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC * 2); u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 62; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 94; /* Right record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 2))
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Attempt to remove enough records from right leaf of a level-1 B-tree to force redistribution */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC / 4); u++) {
|
||
record = (INSERT_SPLIT_ROOT_NREC * 2) - (u + 1);
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != ((INSERT_SPLIT_ROOT_NREC * 2) - (u + 1)))
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != ((INSERT_SPLIT_ROOT_NREC * 2) - (u + 1)))
|
||
TEST_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 62; /* Left record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 1)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
/* Attempt to remove enough records from left leaf of a level-1 B-tree to force redistribution */
|
||
TESTING("B-tree remove: merge 2 leaves to 1 in level-1 B-tree (l->r)");
|
||
|
||
/* Fill B-tree back up */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC / 4); u++) {
|
||
record = (INSERT_SPLIT_ROOT_NREC * 2) - (u + 1);
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 62; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 94; /* Right record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
/* Remove records */
|
||
for(u = 0; u < ((3 * INSERT_SPLIT_ROOT_NREC) / 4) - 1; u++) {
|
||
record = u;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != u)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != ((INSERT_SPLIT_ROOT_NREC * 2) - (u + 1)))
|
||
TEST_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 94; /* Left record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 1)
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_remove_level1_2leaf_merge() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_remove_level1_3leaf_merge
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Friday, March 4, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_remove_level1_3leaf_merge(hid_t fapl)
|
||
{
|
||
hid_t file=-1;
|
||
char filename[1024];
|
||
H5F_t *f=NULL;
|
||
hsize_t record; /* Record to insert into tree */
|
||
hsize_t rrecord; /* Record to remove from tree */
|
||
hsize_t nrec; /* Number of records in B-tree */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
haddr_t root_addr; /* Address of root of B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
H5B2_node_info_test_t ninfo; /* B-tree node info */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
TESTING("B-tree remove: merge 3 leaves to 2 in level-1 B-tree");
|
||
|
||
/*
|
||
* v2 B-tree creation
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Create level-1 B-tree with 3 leaves */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC * 2); u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 62; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 94; /* Right record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 2))
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Attempt to remove enough records from middle leaf of a level-1 B-tree to force merge */
|
||
for(u = 0; u < ((5 * INSERT_SPLIT_ROOT_NREC) / 6) - 1; u++) {
|
||
record = ((3 * INSERT_SPLIT_ROOT_NREC) / 2) - (u + 1);
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != (((3 * INSERT_SPLIT_ROOT_NREC) / 2) - (u + 1)))
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != ((INSERT_SPLIT_ROOT_NREC * 2) - (u + 1)))
|
||
TEST_ERROR
|
||
} /* end for */
|
||
|
||
record = 37; /* Only record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 1)
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_remove_level1_3leaf_merge() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_remove_level1_promote
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Friday, March 4, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_remove_level1_promote(hid_t fapl)
|
||
{
|
||
hid_t file=-1;
|
||
char filename[1024];
|
||
H5F_t *f=NULL;
|
||
hsize_t record; /* Record to insert into tree */
|
||
hsize_t rrecord; /* Record to remove from tree */
|
||
hsize_t nrec; /* Number of records in B-tree */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
haddr_t root_addr; /* Address of root of B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
H5B2_node_info_test_t ninfo; /* B-tree node info */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
TESTING("B-tree remove: promote from right leaf of level-1 B-tree");
|
||
|
||
/*
|
||
* v2 B-tree creation
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Create level-1 B-tree with 5 leaves */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC * 4); u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 62; /* Left-most record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 125; /* Center-Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 188; /* Center-Right record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 220; /* Right-most record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 4)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 4))
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Attempt to remove record from root node of a level-1 B-tree to force promotion from right leaf */
|
||
record = 220;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != 220)
|
||
TEST_ERROR
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 62; /* Left-most record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 125; /* Center-Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 188; /* Center-Right record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 221; /* Right-most record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 4)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 4) - 1)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
/* Attempt to remove record from root node of a level-1 B-tree to force promotion from left leaf */
|
||
/* (Note: current algorithm doesn't actually ever promote from left leaf.
|
||
* It would be useful to update the B-tree routines to always choose
|
||
* to promote a record from the node with more children. - QAK)
|
||
*/
|
||
TESTING("B-tree remove: promote from left leaf of level-1 B-tree");
|
||
record = 62;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != 62)
|
||
TEST_ERROR
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 63; /* Left-most record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 125; /* Center-Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 188; /* Center-Right record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 221; /* Right-most record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 4)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 4) - 2)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
/* Attempt to remove record from root node of a level-1 B-tree to force promotion from middle leaf */
|
||
TESTING("B-tree remove: promote from middle leaf of level-1 B-tree");
|
||
record = 125;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != 125)
|
||
TEST_ERROR
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 63; /* Left-most record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 126; /* Center-Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 188; /* Center-Right record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 221; /* Right-most record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 4)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 4) - 3)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
if (H5Fclose(file)<0) TEST_ERROR
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_remove_level1_promote() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_remove_level1_promote_2leaf_redistrib
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Friday, March 4, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_remove_level1_promote_2leaf_redistrib(hid_t fapl)
|
||
{
|
||
hid_t file=-1;
|
||
char filename[1024];
|
||
H5F_t *f=NULL;
|
||
hsize_t record; /* Record to insert into tree */
|
||
hsize_t rrecord; /* Record to remove from tree */
|
||
hsize_t nrec; /* Number of records in B-tree */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
haddr_t root_addr; /* Address of root of B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
H5B2_node_info_test_t ninfo; /* B-tree node info */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
TESTING("B-tree remove: promote from leaf of level-1 B-tree w/2 node redistrib");
|
||
|
||
/*
|
||
* v2 B-tree creation
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Create level-1 B-tree with 3 leaves */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC * 2); u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 62; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 94; /* Right record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 2))
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Attempt to remove record from root node of a level-1 B-tree to force promotion from right leaf */
|
||
|
||
/* Remove records from right leaf until its ready to redistribute */
|
||
for(u = 0; u < 7; u++) {
|
||
record = (INSERT_SPLIT_ROOT_NREC * 2) - (u + 1);
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != ((INSERT_SPLIT_ROOT_NREC * 2) - (u + 1)))
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != ((INSERT_SPLIT_ROOT_NREC * 2) - (u + 1)))
|
||
TEST_ERROR
|
||
} /* end for */
|
||
|
||
record = 94;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != 94)
|
||
TEST_ERROR
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 62; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 90; /* Right record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 2) - 8)
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_remove_level1_promote_2leaf_redistrib() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_remove_level1_promote_3leaf_redistrib
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Friday, March 4, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_remove_level1_promote_3leaf_redistrib(hid_t fapl)
|
||
{
|
||
hid_t file=-1;
|
||
char filename[1024];
|
||
H5F_t *f=NULL;
|
||
hsize_t record; /* Record to insert into tree */
|
||
hsize_t rrecord; /* Record to remove from tree */
|
||
hsize_t nrec; /* Number of records in B-tree */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
haddr_t root_addr; /* Address of root of B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
H5B2_node_info_test_t ninfo; /* B-tree node info */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
TESTING("B-tree remove: promote from leaf of level-1 B-tree w/3 node redistrib");
|
||
|
||
/*
|
||
* v2 B-tree creation
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Create level-1 B-tree with 3 leaves */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC * 2); u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 62; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 94; /* Right record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 2))
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Attempt to remove record from root node of a level-1 B-tree to force promotion from middle leaf */
|
||
|
||
/* Remove records from right leaf until its ready to redistribute */
|
||
for(u = 0; u < 7; u++) {
|
||
record = 63 + u;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != (63 + u))
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != ((INSERT_SPLIT_ROOT_NREC * 2) - (u + 1)))
|
||
TEST_ERROR
|
||
} /* end for */
|
||
|
||
record = 62;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != 62)
|
||
TEST_ERROR
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 39; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 86; /* Right record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 2) - 8)
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_remove_level1_promote_3leaf_redistrib() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_remove_level1_promote_2leaf_merge
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Friday, March 4, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_remove_level1_promote_2leaf_merge(hid_t fapl)
|
||
{
|
||
hid_t file=-1;
|
||
char filename[1024];
|
||
H5F_t *f=NULL;
|
||
hsize_t record; /* Record to insert into tree */
|
||
hsize_t rrecord; /* Record to remove from tree */
|
||
hsize_t nrec; /* Number of records in B-tree */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
haddr_t root_addr; /* Address of root of B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
H5B2_node_info_test_t ninfo; /* B-tree node info */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
TESTING("B-tree remove: promote from leaf of level-1 B-tree w/2->1 merge");
|
||
|
||
/*
|
||
* v2 B-tree creation
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Create level-1 B-tree with 3 leaves */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC * 2); u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 62; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 94; /* Right record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 2))
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Attempt to remove record from root node of a level-1 B-tree to force promotion from right leaf */
|
||
|
||
/* Remove records from right leaf until its ready to merge */
|
||
for(u = 0; u < 14; u++) {
|
||
record = (INSERT_SPLIT_ROOT_NREC * 2) - (u + 1);
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != ((INSERT_SPLIT_ROOT_NREC * 2) - (u + 1)))
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != ((INSERT_SPLIT_ROOT_NREC * 2) - (u + 1)))
|
||
TEST_ERROR
|
||
} /* end for */
|
||
|
||
record = 87;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != 87)
|
||
TEST_ERROR
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 62; /* Middle record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 1)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 2) - 15)
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_remove_level1_promote_2leaf_merge() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_remove_level1_promote_3leaf_merge
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Friday, March 4, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_remove_level1_promote_3leaf_merge(hid_t fapl)
|
||
{
|
||
hid_t file=-1;
|
||
char filename[1024];
|
||
H5F_t *f=NULL;
|
||
hsize_t record; /* Record to insert into tree */
|
||
hsize_t rrecord; /* Record to remove from tree */
|
||
hsize_t nrec; /* Number of records in B-tree */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
haddr_t root_addr; /* Address of root of B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
H5B2_node_info_test_t ninfo; /* B-tree node info */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
TESTING("B-tree remove: promote from leaf of level-1 B-tree w/3->2 merge");
|
||
|
||
/*
|
||
* v2 B-tree creation
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Create level-2 B-tree with 3 leaves */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC * 2); u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 62; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 1)
|
||
TEST_ERROR
|
||
record = 94; /* Right record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 2))
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Attempt to remove record from root node of a level-1 B-tree to force promotion from middle leaf */
|
||
|
||
/* Remove records from middle leaf until it's ready to merge */
|
||
for(u = 0; u < 50; u++) {
|
||
record = ((3 * INSERT_SPLIT_ROOT_NREC) / 2) - (u + 1);
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != (((3 * INSERT_SPLIT_ROOT_NREC) / 2) - (u + 1)))
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != ((INSERT_SPLIT_ROOT_NREC * 2) - (u + 1)))
|
||
TEST_ERROR
|
||
} /* end for */
|
||
|
||
record = 25;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != 25)
|
||
TEST_ERROR
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 37; /* Right record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 1)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 2) - 51)
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_remove_level1_promote_3leaf_merge() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_remove_level1_collapse
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Friday, March 4, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_remove_level1_collapse(hid_t fapl)
|
||
{
|
||
hid_t file=-1;
|
||
char filename[1024];
|
||
H5F_t *f=NULL;
|
||
hsize_t record; /* Record to insert into tree */
|
||
hsize_t rrecord; /* Record to remove from tree */
|
||
hsize_t nrec; /* Number of records in B-tree */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
haddr_t root_addr; /* Address of root of B-tree created */
|
||
H5B2_node_info_test_t ninfo; /* B-tree node info */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
TESTING("B-tree remove: collapse level-1 B-tree back to level-0");
|
||
|
||
/*
|
||
* v2 B-tree creation
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Create level-1 B-tree with 2 leaves */
|
||
for(u = 0; u < INSERT_SPLIT_ROOT_NREC; u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 31; /* Middle record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 1)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != INSERT_SPLIT_ROOT_NREC)
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Attempt to remove records from B-tree to force a single leaf for the B-tree */
|
||
for(u = 0; u < 14; u++) {
|
||
record = INSERT_SPLIT_ROOT_NREC - (u + 1);
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != (INSERT_SPLIT_ROOT_NREC - (u + 1)))
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC - (u + 1)))
|
||
TEST_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 31; /* Middle record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 0)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != (INSERT_SPLIT_ROOT_NREC - u))
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC - u))
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_remove_level1_collapse() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_remove_level2_promote
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Friday, March 4, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_remove_level2_promote(hid_t fapl)
|
||
{
|
||
hid_t file=-1;
|
||
char filename[1024];
|
||
H5F_t *f=NULL;
|
||
hsize_t record; /* Record to insert into tree */
|
||
hsize_t rrecord; /* Record to remove from tree */
|
||
hsize_t nrec; /* Number of records in B-tree */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
haddr_t root_addr; /* Address of root of B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
H5B2_node_info_test_t ninfo; /* B-tree node info */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
TESTING("B-tree remove: promote from right internal of level-2 B-tree");
|
||
|
||
/*
|
||
* v2 B-tree creation
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Create level-2 B-tree with 3 internal nodes */
|
||
for(u = 0; u < ((INSERT_SPLIT_ROOT_NREC * 59) + 1); u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 1889; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 2834; /* Right record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 2)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != ((INSERT_SPLIT_ROOT_NREC * 59) + 1))
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Check information about record in right internal node */
|
||
record = 2960; /* Record in right internal node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 14)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to remove record from right internal node of a level-2 B-tree to force promotion */
|
||
record = 2960;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != 2960)
|
||
TEST_ERROR
|
||
|
||
/* Check information about record promoted into right internal node */
|
||
record = 2961; /* Record in right internal node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 14)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 59))
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
/* Attempt to remove record from left internal node of a level-2 B-tree to force promotion */
|
||
TESTING("B-tree remove: promote from left internal of level-2 B-tree");
|
||
|
||
/* Check information about record in left internal node */
|
||
record = 1133; /* Record in left internal node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 29)
|
||
TEST_ERROR
|
||
|
||
record = 1133;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != 1133)
|
||
TEST_ERROR
|
||
|
||
/* Check information about record in left internal node */
|
||
record = 1134; /* Record in left internal node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 29)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 59) - 1)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
/* Attempt to remove record from middle internal node of a level-2 B-tree to force promotion */
|
||
TESTING("B-tree remove: promote from middle internal of level-2 B-tree");
|
||
|
||
/* Check information about record in middle internal node */
|
||
record = 2267; /* Record in middle internal node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 14)
|
||
TEST_ERROR
|
||
|
||
record = 2267;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != 2267)
|
||
TEST_ERROR
|
||
|
||
/* Check information about record in middle internal node */
|
||
record = 2268; /* Record in middle internal node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 14)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 59) - 2)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
/* Attempt to remove record from root node of a level-2 B-tree to force promotion */
|
||
TESTING("B-tree remove: promote record from root of level-2 B-tree");
|
||
|
||
/* Check information about record in root node */
|
||
record = 1889; /* Left record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 2)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
record = 1889;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != 1889)
|
||
TEST_ERROR
|
||
|
||
/* Check information about record in root node */
|
||
record = 1890; /* Left record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 2)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 59) - 3)
|
||
TEST_ERROR
|
||
|
||
/* Check information about record in root node */
|
||
record = 2834; /* Right record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 2)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
record = 2834;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != 2834)
|
||
TEST_ERROR
|
||
|
||
/* Check information about record in root node */
|
||
record = 2835; /* Right record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 2)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 59) - 4)
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_remove_level2_promote() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_remove_level2_promote_2internal_redistrib
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Monday, March 7, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_remove_level2_promote_2internal_redistrib(hid_t fapl)
|
||
{
|
||
hid_t file=-1;
|
||
char filename[1024];
|
||
H5F_t *f=NULL;
|
||
hsize_t record; /* Record to insert into tree */
|
||
hsize_t rrecord; /* Record to remove from tree */
|
||
hsize_t nrec; /* Number of records in B-tree */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
haddr_t root_addr; /* Address of root of B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
H5B2_node_info_test_t ninfo; /* B-tree node info */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
TESTING("B-tree remove: promote from right internal of level-2 B-tree w/redistrib");
|
||
|
||
/*
|
||
* v2 B-tree creation
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Create level-2 B-tree with 3 internal nodes */
|
||
for(u = 0; u < ((INSERT_SPLIT_ROOT_NREC * 59) + 1); u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 1889; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 2834; /* Right record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 2)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != ((INSERT_SPLIT_ROOT_NREC * 59) + 1))
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
record = 3685; /* Right-most record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 14)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to remove record from right internal node of a level-2 B-tree to force promotion w/redistribution */
|
||
for(u = 0; u < 8; u++) {
|
||
record = ((INSERT_SPLIT_ROOT_NREC * 59) + 1) - (u + 1);
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != (((INSERT_SPLIT_ROOT_NREC * 59) + 1)- (u + 1)))
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (((INSERT_SPLIT_ROOT_NREC * 59) + 1) - (u + 1)))
|
||
TEST_ERROR
|
||
} /* end for */
|
||
|
||
record = 3685;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != 3685)
|
||
TEST_ERROR
|
||
|
||
record = 3681; /* Right-most record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 14)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 59) - 8)
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_remove_level2_promote_2internal_redistrib() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_remove_level2_3promote_internal_redistrib
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Monday, March 7, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_remove_level2_promote_3internal_redistrib(hid_t fapl)
|
||
{
|
||
hid_t file=-1;
|
||
char filename[1024];
|
||
H5F_t *f=NULL;
|
||
hsize_t record; /* Record to insert into tree */
|
||
hsize_t rrecord; /* Record to remove from tree */
|
||
hsize_t nrec; /* Number of records in B-tree */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
haddr_t root_addr; /* Address of root of B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
H5B2_node_info_test_t ninfo; /* B-tree node info */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
TESTING("B-tree remove: promote from left internal of level-2 B-tree w/redistrib");
|
||
|
||
/*
|
||
* v2 B-tree creation
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Create level-2 B-tree with 3 internal nodes */
|
||
for(u = 0; u < ((INSERT_SPLIT_ROOT_NREC * 59) + 1); u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 1889; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 2834; /* Right record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 2)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != ((INSERT_SPLIT_ROOT_NREC * 59) + 1))
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
record = 62; /* Left-most record in left node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 29)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to remove record from left internal node of a level-2 B-tree to force promotion w/redistribution */
|
||
for(u = 0; u < 38; u++) {
|
||
record = 63 + u;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != (63 + u))
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (((INSERT_SPLIT_ROOT_NREC * 59) + 1) - (u + 1)))
|
||
TEST_ERROR
|
||
} /* end for */
|
||
|
||
record = 62;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != 62)
|
||
TEST_ERROR
|
||
|
||
record = 49; /* Left-most record in left node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 29)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 59) - 38)
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_remove_level2_promote_3internal_redistrib() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_remove_level2_promote_2internal_merge
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Monday, March 7, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_remove_level2_promote_2internal_merge(hid_t fapl)
|
||
{
|
||
hid_t file=-1;
|
||
char filename[1024];
|
||
H5F_t *f=NULL;
|
||
hsize_t record; /* Record to insert into tree */
|
||
hsize_t rrecord; /* Record to remove from tree */
|
||
hsize_t nrec; /* Number of records in B-tree */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
haddr_t root_addr; /* Address of root of B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
H5B2_node_info_test_t ninfo; /* B-tree node info */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
TESTING("B-tree remove: promote from right internal of level-2 B-tree w/merge");
|
||
|
||
/*
|
||
* v2 B-tree creation
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Create level-2 B-tree with 3 internal nodes */
|
||
for(u = 0; u < ((INSERT_SPLIT_ROOT_NREC * 59) + 1); u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 1889; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 2834; /* Right record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 2)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != ((INSERT_SPLIT_ROOT_NREC * 59) + 1))
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Check information about record in right internal node */
|
||
record = 3685; /* Right-most record in right internal node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 14)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to remove record from right internal node of a level-2 B-tree to force promotion w/redistribution */
|
||
for(u = 0; u < 15; u++) {
|
||
record = ((INSERT_SPLIT_ROOT_NREC * 59) + 1) - (u + 1);
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != (((INSERT_SPLIT_ROOT_NREC * 59) + 1)- (u + 1)))
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (((INSERT_SPLIT_ROOT_NREC * 59) + 1) - (u + 1)))
|
||
TEST_ERROR
|
||
} /* end for */
|
||
|
||
/* Force merge by promoting current right-most record */
|
||
record = 3678;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != 3678)
|
||
TEST_ERROR
|
||
|
||
/* Check information about record in right internal node */
|
||
record = 3653; /* Right-most record in right internal node (now) */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 13)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 59) - 15)
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_remove_level2_promote_2internal_merge() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_remove_level2_3promote_internal_merge
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Monday, March 7, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_remove_level2_promote_3internal_merge(hid_t fapl)
|
||
{
|
||
hid_t file=-1;
|
||
char filename[1024];
|
||
H5F_t *f=NULL;
|
||
hsize_t record; /* Record to insert into tree */
|
||
hsize_t rrecord; /* Record to remove from tree */
|
||
hsize_t nrec; /* Number of records in B-tree */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
haddr_t root_addr; /* Address of root of B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
H5B2_node_info_test_t ninfo; /* B-tree node info */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
TESTING("B-tree remove: promote from middle internal of level-2 B-tree w/merge");
|
||
|
||
/*
|
||
* v2 B-tree creation
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Create level-2 B-tree with 3 internal nodes */
|
||
for(u = 0; u < ((INSERT_SPLIT_ROOT_NREC * 59) + 1); u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 1889; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 2834; /* Right record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 2)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != ((INSERT_SPLIT_ROOT_NREC * 59) + 1))
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Check information about record in left internal node */
|
||
record = 62; /* Left-most record in left internal node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 29)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to remove record from left internal node of a level-2 B-tree to force promotion w/redistribution */
|
||
for(u = 0; u < 112; u++) {
|
||
record = 48 + u;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != (48 + u))
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (((INSERT_SPLIT_ROOT_NREC * 59) + 1) - (u + 1)))
|
||
TEST_ERROR
|
||
} /* end for */
|
||
|
||
/* Force merge of left-most internal nodes by promotion */
|
||
record = 25;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != 25)
|
||
TEST_ERROR
|
||
|
||
/* Check information about record in left internal node */
|
||
record = 37; /* Left-most record in left internal node (now) */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 28)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_SPLIT_ROOT_NREC * 59) - 112)
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_remove_level2_promote_3internal_merge() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_remove_level2_2internal_merge_left
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Tuesday, March 8, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_remove_level2_2internal_merge_left(hid_t fapl)
|
||
{
|
||
hid_t file=-1;
|
||
char filename[1024];
|
||
H5F_t *f=NULL;
|
||
hsize_t record; /* Record to insert into tree */
|
||
hsize_t rrecord; /* Record to remove from tree */
|
||
hsize_t nrec; /* Number of records in B-tree */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
haddr_t root_addr; /* Address of root of B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
H5B2_node_info_test_t ninfo; /* B-tree node info */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
TESTING("B-tree remove: merge 2 internal nodes to 1 in level-2 B-tree (l->r)");
|
||
|
||
/*
|
||
* v2 B-tree creation
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Create level-2 B-tree with 3 internal nodes */
|
||
for(u = 0; u < ((INSERT_SPLIT_ROOT_NREC * 59) + 1); u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 1889; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 2834; /* Right record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 2)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != ((INSERT_SPLIT_ROOT_NREC * 59) + 1))
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Attempt to remove records from a level-2 B-tree to force 2 internal nodes to merge */
|
||
for(u = 0; u < ((INSERT_SPLIT_ROOT_NREC * 21) + 15); u++) {
|
||
record = u;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != u)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (((INSERT_SPLIT_ROOT_NREC * 59) + 1) - (u + 1)))
|
||
TEST_ERROR
|
||
} /* end for */
|
||
|
||
record = 2834; /* Middle record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 2)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 1)
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_remove_level2_2internal_merge_left() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_remove_level2_2internal_merge_right
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Tuesday, March 8, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_remove_level2_2internal_merge_right(hid_t fapl)
|
||
{
|
||
hid_t file=-1;
|
||
char filename[1024];
|
||
H5F_t *f=NULL;
|
||
hsize_t record; /* Record to insert into tree */
|
||
hsize_t rrecord; /* Record to remove from tree */
|
||
hsize_t nrec; /* Number of records in B-tree */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
haddr_t root_addr; /* Address of root of B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
H5B2_node_info_test_t ninfo; /* B-tree node info */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
TESTING("B-tree remove: merge 2 internal nodes to 1 in level-2 B-tree (r->l)");
|
||
|
||
/*
|
||
* v2 B-tree creation
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Create level-2 B-tree with 3 internal nodes */
|
||
for(u = 0; u < ((INSERT_SPLIT_ROOT_NREC * 59) + 1); u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 1889; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 2834; /* Right record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 2)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != ((INSERT_SPLIT_ROOT_NREC * 59) + 1))
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Attempt to remove records from a level-2 B-tree to force 2 internal nodes to merge */
|
||
for(u = 0; u < ((INSERT_SPLIT_ROOT_NREC * 5) + 17); u++) {
|
||
record = ((INSERT_SPLIT_ROOT_NREC * 59) + 1) - (u + 1);
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != (((INSERT_SPLIT_ROOT_NREC * 59) + 1) - (u + 1)))
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (((INSERT_SPLIT_ROOT_NREC * 59) + 1) - (u+ 1)))
|
||
TEST_ERROR
|
||
} /* end for */
|
||
|
||
record = 1889; /* Middle record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 2)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 1)
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_remove_level2_2internal_merge_right() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_remove_level2_3internal_merge
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Tuesday, March 8, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_remove_level2_3internal_merge(hid_t fapl)
|
||
{
|
||
hid_t file=-1;
|
||
char filename[1024];
|
||
H5F_t *f=NULL;
|
||
hsize_t record; /* Record to insert into tree */
|
||
hsize_t rrecord; /* Record to remove from tree */
|
||
hsize_t nrec; /* Number of records in B-tree */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
haddr_t root_addr; /* Address of root of B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
H5B2_node_info_test_t ninfo; /* B-tree node info */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
TESTING("B-tree remove: merge 3 internal nodes to 2 in level-2 B-tree");
|
||
|
||
/*
|
||
* v2 B-tree creation
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Create level-2 B-tree with 3 internal nodes */
|
||
for(u = 0; u < ((INSERT_SPLIT_ROOT_NREC * 59) + 1); u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 1889; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 2834; /* Right record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 2)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != ((INSERT_SPLIT_ROOT_NREC * 59) + 1))
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Attempt to remove record from middle internal node of a level-2 B-tree to force promotion w/redistribution */
|
||
for(u = 0; u < ((INSERT_SPLIT_ROOT_NREC * 23) + 15); u++) {
|
||
record = (INSERT_SPLIT_ROOT_NREC * 20) + u;
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != ((INSERT_SPLIT_ROOT_NREC * 20) + u))
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (((INSERT_SPLIT_ROOT_NREC * 59) + 1) - (u + 1)))
|
||
TEST_ERROR
|
||
} /* end for */
|
||
|
||
record = 1196; /* Right record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 2)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 1)
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_remove_level2_3internal_merge() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_remove_level2_collapse_right
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Tuesday, March 8, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_remove_level2_collapse_right(hid_t fapl)
|
||
{
|
||
hid_t file=-1;
|
||
char filename[1024];
|
||
H5F_t *f=NULL;
|
||
hsize_t record; /* Record to insert into tree */
|
||
hsize_t rrecord; /* Record to remove from tree */
|
||
hsize_t nrec; /* Number of records in B-tree */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
haddr_t root_addr; /* Address of root of B-tree created */
|
||
int rec_depth; /* Depth of record in B-tree */
|
||
H5B2_stat_t bt2_stat; /* Statistics about B-tree created */
|
||
H5B2_node_info_test_t ninfo; /* B-tree node info */
|
||
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)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
TESTING("B-tree remove: collapse level-2 B-tree back to level-1 (r->l)");
|
||
|
||
/*
|
||
* v2 B-tree creation
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Create level-2 B-tree with 3 internal nodes */
|
||
for(u = 0; u < ((INSERT_SPLIT_ROOT_NREC * 59) + 1); u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check record values in root of B-tree */
|
||
record = 1889; /* Left record in root node */
|
||
if((rec_depth = H5B2_get_node_depth_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record)) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(rec_depth != 2)
|
||
TEST_ERROR
|
||
record = 2834; /* Right record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 2)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != ((INSERT_SPLIT_ROOT_NREC * 59) + 1))
|
||
TEST_ERROR
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(!H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Attempt to remove records from a level-2 B-tree to force back to level-1 */
|
||
for(u = 0; u < (INSERT_SPLIT_ROOT_NREC * 34) + 17; u++) {
|
||
record = ((INSERT_SPLIT_ROOT_NREC * 59) + 1) - (u + 1);
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(record != (((INSERT_SPLIT_ROOT_NREC * 59) + 1) - (u + 1)))
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (((INSERT_SPLIT_ROOT_NREC * 59) + 1) - (u + 1)))
|
||
TEST_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 1)
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_remove_level2_collapse_right() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: gen_l4_btree2
|
||
*
|
||
* Purpose: Generate a level-4 v2 B-tree for testing.
|
||
*
|
||
* Return: Success: 0
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Tuesday, October 14, 2008
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
gen_l4_btree2(const char *filename, hid_t fapl, haddr_t *bt2_addr,
|
||
const hsize_t *records)
|
||
{
|
||
hid_t file = -1;
|
||
H5F_t *f = NULL;
|
||
hsize_t record; /* Record to insert into tree */
|
||
unsigned u; /* Local index variable */
|
||
H5B2_stat_t bt2_stat; /* Statistics about B-tree created */
|
||
|
||
/* Create the file to work on */
|
||
if((file = H5Fcreate(filename, H5F_ACC_TRUNC, H5P_DEFAULT, fapl)) < 0)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
/*
|
||
* Create v2 B-tree
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Insert random records */
|
||
for(u = 0; u < INSERT_MANY; u++) {
|
||
record = records[u];
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, *bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, *bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 4)
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
STACK_ERROR
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
|
||
return 1;
|
||
} /* gen_l4_btree2() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_remove_lots
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code. This test inserts many
|
||
* records in random order, enough to make at a level 4 B-tree
|
||
* and then removes them all, by record and by index.
|
||
*
|
||
* Return: Success: 0
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Tuesday, March 8, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_remove_lots(const char *env_h5_drvr, hid_t fapl)
|
||
{
|
||
hid_t file = -1;
|
||
char filename[1024];
|
||
H5F_t *f = NULL;
|
||
int fd = -1; /* File descriptor */
|
||
h5_stat_t sb; /* Stat buffer for file */
|
||
void *file_data = NULL; /* Copy of file data */
|
||
hsize_t record; /* Record to insert into tree */
|
||
hsize_t rrecord; /* Record to remove from tree */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
haddr_t root_addr; /* Address of root of B-tree created */
|
||
time_t curr_time; /* Current time, for seeding random number generator */
|
||
hsize_t *records; /* Record #'s for random insertion */
|
||
unsigned u; /* Local index variable */
|
||
unsigned rem_idx; /* Location to remove */
|
||
hsize_t nrec; /* Number of records in B-tree */
|
||
hbool_t single_file_vfd; /* Whether VFD used stores data in a single file */
|
||
|
||
/* Initialize random number seed */
|
||
curr_time = HDtime(NULL);
|
||
#ifdef QAK
|
||
curr_time = 1163537969;
|
||
HDfprintf(stderr, "curr_time = %lu\n", (unsigned long)curr_time);
|
||
#endif /* QAK */
|
||
HDsrandom((unsigned long)curr_time);
|
||
|
||
/*
|
||
* Test removing many records into v2 B-tree
|
||
*/
|
||
|
||
/* Allocate space for the records */
|
||
if(NULL == (records = (hsize_t *)HDmalloc(sizeof(hsize_t) * INSERT_MANY)))
|
||
TEST_ERROR
|
||
|
||
/* Initialize record #'s */
|
||
for(u = 0; u < INSERT_MANY; u++)
|
||
records[u] = u;
|
||
|
||
/* Shuffle record #'s */
|
||
for(u = 0; u < INSERT_MANY; u++) {
|
||
hsize_t temp_rec; /* Temporary record */
|
||
unsigned swap_idx; /* Location to swap with when shuffling */
|
||
|
||
swap_idx = ((unsigned)HDrandom() % (INSERT_MANY - u)) + u;
|
||
temp_rec = records[u];
|
||
records[u] = records[swap_idx];
|
||
records[swap_idx] = temp_rec;
|
||
} /* end for */
|
||
|
||
h5_fixname(FILENAME[0], fapl, filename, sizeof filename);
|
||
|
||
/* Generate the v2 B-tree to test */
|
||
if(gen_l4_btree2(filename, fapl, &bt2_addr, records))
|
||
TEST_ERROR
|
||
|
||
/* Check for VFD which stores data in multiple files */
|
||
single_file_vfd = (hbool_t)(HDstrcmp(env_h5_drvr, "split") && HDstrcmp(env_h5_drvr, "multi") && HDstrcmp(env_h5_drvr, "family"));
|
||
if(single_file_vfd) {
|
||
/* Make a copy of the file in memory, in order to speed up deletion testing */
|
||
|
||
/* Open the file just created */
|
||
if((fd = HDopen(filename, O_RDONLY, 0)) < 0)
|
||
TEST_ERROR
|
||
|
||
/* Retrieve the file's size */
|
||
if(HDfstat(fd, &sb) < 0)
|
||
TEST_ERROR
|
||
|
||
/* Allocate space for the file data */
|
||
if(NULL == (file_data = HDmalloc((size_t)sb.st_size)))
|
||
TEST_ERROR
|
||
|
||
/* Read file's data into memory */
|
||
if(HDread(fd, file_data, (size_t)sb.st_size) < (ssize_t)sb.st_size)
|
||
TEST_ERROR
|
||
|
||
/* Close the file */
|
||
if(HDclose(fd) < 0)
|
||
TEST_ERROR
|
||
fd = -1;
|
||
} /* end if */
|
||
|
||
/* Print banner for this test */
|
||
TESTING("B-tree remove: create random level 4 B-tree and delete all records in random order");
|
||
|
||
/* Re-open the file */
|
||
if((file = H5Fopen(filename, H5F_ACC_RDWR, fapl)) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Re-shuffle record #'s */
|
||
for(u = 0; u < INSERT_MANY; u++) {
|
||
hsize_t temp_rec; /* Temporary record */
|
||
unsigned swap_idx; /* Location to swap with when shuffling */
|
||
|
||
swap_idx = ((unsigned)HDrandom() % (INSERT_MANY - u)) + u;
|
||
temp_rec = records[u];
|
||
records[u] = records[swap_idx];
|
||
records[swap_idx] = temp_rec;
|
||
} /* end for */
|
||
|
||
/* Remove all records */
|
||
for(u = 0; u < INSERT_MANY; u++) {
|
||
record = records[u];
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != records[u])
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_MANY - (u + 1)))
|
||
TEST_ERROR
|
||
} /* end for */
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
STACK_ERROR
|
||
|
||
PASSED();
|
||
|
||
|
||
|
||
/* Check for VFD which stores data in multiple files */
|
||
if(single_file_vfd) {
|
||
/* Re-write the file's data with the copy in memory */
|
||
|
||
/* Open the file just created */
|
||
if((fd = HDopen(filename, O_RDWR|O_CREAT|O_TRUNC, 0666)) < 0)
|
||
TEST_ERROR
|
||
|
||
/* Write file's data from memory */
|
||
if(HDwrite(fd, file_data, (size_t)sb.st_size) < (ssize_t)sb.st_size)
|
||
TEST_ERROR
|
||
|
||
/* Close the file */
|
||
if(HDclose(fd) < 0)
|
||
TEST_ERROR
|
||
fd = -1;
|
||
} /* end if */
|
||
else {
|
||
/* Re-generate the v2 B-tree to test */
|
||
if(gen_l4_btree2(filename, fapl, &bt2_addr, records))
|
||
TEST_ERROR
|
||
} /* end else */
|
||
|
||
|
||
/* Print banner for this test */
|
||
TESTING("B-tree remove: create random level 4 B-tree and delete all records by index, in random order");
|
||
|
||
/* Re-open the file */
|
||
if((file = H5Fopen(filename, H5F_ACC_RDWR, fapl)) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Remove all records */
|
||
for(u = 0; u < INSERT_MANY; u++) {
|
||
/* Pick a record index to remove from randomly */
|
||
rem_idx = ((unsigned)HDrandom() % (INSERT_MANY - u));
|
||
rrecord = HSIZET_MAX;
|
||
|
||
/* Remove random record */
|
||
if(H5B2_remove_by_idx(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5_ITER_INC, (hsize_t)rem_idx, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord >= INSERT_MANY)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_MANY - (u + 1)))
|
||
TEST_ERROR
|
||
} /* end for */
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
STACK_ERROR
|
||
|
||
PASSED();
|
||
|
||
|
||
|
||
/* Check for VFD which stores data in multiple files */
|
||
if(single_file_vfd) {
|
||
/* Re-write the file's data with the copy in memory */
|
||
|
||
/* Open the file just created */
|
||
if((fd = HDopen(filename, O_RDWR|O_CREAT|O_TRUNC, 0666)) < 0)
|
||
TEST_ERROR
|
||
|
||
/* Write file's data from memory */
|
||
if(HDwrite(fd, file_data, (size_t)sb.st_size) < (ssize_t)sb.st_size)
|
||
TEST_ERROR
|
||
|
||
/* Close the file */
|
||
if(HDclose(fd) < 0)
|
||
TEST_ERROR
|
||
fd = -1;
|
||
} /* end if */
|
||
else {
|
||
/* Re-generate the v2 B-tree to test */
|
||
if(gen_l4_btree2(filename, fapl, &bt2_addr, records))
|
||
TEST_ERROR
|
||
} /* end else */
|
||
|
||
|
||
|
||
/* Print banner for this test */
|
||
TESTING("B-tree remove: create random level 4 B-tree and delete all records by index, in increasing order");
|
||
|
||
/* Re-open the file */
|
||
if((file = H5Fopen(filename, H5F_ACC_RDWR, fapl)) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Remove all records */
|
||
for(u = 0; u < INSERT_MANY; u++) {
|
||
/* Remove first record */
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove_by_idx(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5_ITER_INC, (hsize_t)0, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != u)
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_MANY - (u + 1)))
|
||
TEST_ERROR
|
||
} /* end for */
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
STACK_ERROR
|
||
|
||
PASSED();
|
||
|
||
|
||
|
||
/* Check for VFD which stores data in multiple files */
|
||
if(single_file_vfd) {
|
||
/* Re-write the file's data with the copy in memory */
|
||
|
||
/* Open the file just created */
|
||
if((fd = HDopen(filename, O_RDWR|O_CREAT|O_TRUNC, 0666)) < 0)
|
||
TEST_ERROR
|
||
|
||
/* Write file's data from memory */
|
||
if(HDwrite(fd, file_data, (size_t)sb.st_size) < (ssize_t)sb.st_size)
|
||
TEST_ERROR
|
||
|
||
/* Close the file */
|
||
if(HDclose(fd) < 0)
|
||
TEST_ERROR
|
||
fd = -1;
|
||
} /* end if */
|
||
else {
|
||
/* Re-generate the v2 B-tree to test */
|
||
if(gen_l4_btree2(filename, fapl, &bt2_addr, records))
|
||
TEST_ERROR
|
||
} /* end else */
|
||
|
||
|
||
|
||
/* Print banner for this test */
|
||
TESTING("B-tree remove: create random level 4 B-tree and delete all records by index, in decreasing order");
|
||
|
||
/* Re-open the file */
|
||
if((file = H5Fopen(filename, H5F_ACC_RDWR, fapl)) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Remove all records */
|
||
for(u = 0; u < INSERT_MANY; u++) {
|
||
/* Remove last record */
|
||
rrecord = HSIZET_MAX;
|
||
if(H5B2_remove_by_idx(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5_ITER_DEC, (hsize_t)0, remove_cb, &rrecord) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the record value is correct */
|
||
if(rrecord != (INSERT_MANY - (u + 1)))
|
||
TEST_ERROR
|
||
|
||
/* Query the number of records in the B-tree */
|
||
if(H5B2_get_nrec(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &nrec) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the # of records is correct */
|
||
if(nrec != (INSERT_MANY - (u + 1)))
|
||
TEST_ERROR
|
||
} /* end for */
|
||
|
||
/* Query the address of the root node in the B-tree */
|
||
if(H5B2_get_root_addr_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &root_addr) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Make certain that the address of the root node is defined */
|
||
if(H5F_addr_defined(root_addr))
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
STACK_ERROR
|
||
|
||
PASSED();
|
||
|
||
if(records)
|
||
HDfree(records);
|
||
if(file_data)
|
||
HDfree(file_data);
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
|
||
if(fd > 0)
|
||
HDclose(fd);
|
||
if(records)
|
||
HDfree(records);
|
||
if(file_data)
|
||
HDfree(file_data);
|
||
|
||
return 1;
|
||
} /* test_remove_lots() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_find_neighbor
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code. This test exercises
|
||
* code to find nearest neighbors to a given value in a B-tree.
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Tuesday, March 8, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_find_neighbor(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 */
|
||
hsize_t search; /* Search value */
|
||
hsize_t *records; /* Record #'s for random insertion */
|
||
unsigned u; /* Local index variable */
|
||
H5B2_node_info_test_t ninfo; /* B-tree node info */
|
||
herr_t ret; /* Generic error return value */
|
||
|
||
/* Allocate space for the records */
|
||
if((records = (hsize_t *)HDmalloc(sizeof(hsize_t)*FIND_NEIGHBOR))==NULL)
|
||
TEST_ERROR
|
||
|
||
/* Initialize record #'s */
|
||
for(u = 0; u < FIND_NEIGHBOR; u++)
|
||
records[u] = u * 2;
|
||
|
||
h5_fixname(FILENAME[0], fapl, filename, sizeof filename);
|
||
|
||
/*
|
||
* Test nearest neighbor for '<' cases
|
||
*/
|
||
TESTING("B-tree find: nearest neighbor less than a value");
|
||
|
||
/* Create the file to work on */
|
||
if((file = H5Fcreate(filename, H5F_ACC_TRUNC, H5P_DEFAULT, fapl)) < 0)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
/*
|
||
* Create v2 B-tree
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Insert records */
|
||
for(u = 0; u < FIND_NEIGHBOR; u++) {
|
||
record = records[u];
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Attempt to find record B-tree less than a value */
|
||
search = 0;
|
||
H5E_BEGIN_TRY {
|
||
ret = H5B2_neighbor(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5B2_COMPARE_LESS, &search, neighbor_cb, &record);
|
||
} H5E_END_TRY;
|
||
/* Should fail */
|
||
if(ret != FAIL)
|
||
TEST_ERROR
|
||
|
||
search = 1;
|
||
if(H5B2_neighbor(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5B2_COMPARE_LESS, &search, neighbor_cb, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(record != 0)
|
||
TEST_ERROR
|
||
|
||
search = 2;
|
||
if(H5B2_neighbor(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5B2_COMPARE_LESS, &search, neighbor_cb, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(record != 0)
|
||
TEST_ERROR
|
||
|
||
search = 3;
|
||
if(H5B2_neighbor(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5B2_COMPARE_LESS, &search, neighbor_cb, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(record != 2)
|
||
TEST_ERROR
|
||
|
||
search = 4;
|
||
if(H5B2_neighbor(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5B2_COMPARE_LESS, &search, neighbor_cb, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(record != 2)
|
||
TEST_ERROR
|
||
|
||
record = 250; /* Record in left internal node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 14)
|
||
TEST_ERROR
|
||
|
||
/* Neighbor is in internal node */
|
||
search = 251;
|
||
if(H5B2_neighbor(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5B2_COMPARE_LESS, &search, neighbor_cb, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(record != 250)
|
||
TEST_ERROR
|
||
|
||
record = 1888; /* Record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 2)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 1)
|
||
TEST_ERROR
|
||
|
||
/* Neighbor is in root node */
|
||
search = 1889;
|
||
if(H5B2_neighbor(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5B2_COMPARE_LESS, &search, neighbor_cb, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(record != 1888)
|
||
TEST_ERROR
|
||
|
||
search = (FIND_NEIGHBOR * 2) + 1;
|
||
if(H5B2_neighbor(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5B2_COMPARE_LESS, &search, neighbor_cb, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(record != ((FIND_NEIGHBOR - 1) * 2))
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
/*
|
||
* Test nearest neighbor for '>' cases
|
||
*/
|
||
TESTING("B-tree find: nearest neighbor greater than a value");
|
||
|
||
/* Attempt to find record B-tree less than a value */
|
||
search = (FIND_NEIGHBOR * 2) + 1;
|
||
H5E_BEGIN_TRY {
|
||
ret = H5B2_neighbor(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5B2_COMPARE_GREATER, &search, neighbor_cb, &record);
|
||
} H5E_END_TRY;
|
||
/* Should fail */
|
||
if(ret != FAIL)
|
||
TEST_ERROR
|
||
|
||
search = 0;
|
||
if(H5B2_neighbor(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5B2_COMPARE_GREATER, &search, neighbor_cb, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(record != 2)
|
||
TEST_ERROR
|
||
|
||
search = 1;
|
||
if(H5B2_neighbor(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5B2_COMPARE_GREATER, &search, neighbor_cb, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(record != 2)
|
||
TEST_ERROR
|
||
|
||
search = 2;
|
||
if(H5B2_neighbor(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5B2_COMPARE_GREATER, &search, neighbor_cb, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(record != 4)
|
||
TEST_ERROR
|
||
|
||
search = 3;
|
||
if(H5B2_neighbor(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5B2_COMPARE_GREATER, &search, neighbor_cb, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(record != 4)
|
||
TEST_ERROR
|
||
|
||
record = 2896; /* Record in right internal node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 16)
|
||
TEST_ERROR
|
||
|
||
/* Neighbor is in internal node */
|
||
search = 2895;
|
||
if(H5B2_neighbor(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5B2_COMPARE_GREATER, &search, neighbor_cb, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(record != 2896)
|
||
TEST_ERROR
|
||
|
||
/* Neighbor is in root node */
|
||
search = 1887;
|
||
if(H5B2_neighbor(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5B2_COMPARE_GREATER, &search, neighbor_cb, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(record != 1888)
|
||
TEST_ERROR
|
||
|
||
search = ((FIND_NEIGHBOR - 1) * 2) - 1;
|
||
if(H5B2_neighbor(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, H5B2_COMPARE_GREATER, &search, neighbor_cb, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(record != ((FIND_NEIGHBOR - 1) * 2))
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
STACK_ERROR
|
||
|
||
PASSED();
|
||
|
||
HDfree(records);
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
HDfree(records);
|
||
return 1;
|
||
} /* test_find_neighbor() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_delete
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code. This test exercises
|
||
* code to delete a B-tree from a file
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Wednesday, March 9, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_delete(hid_t fapl)
|
||
{
|
||
hid_t file=-1;
|
||
char filename[1024];
|
||
H5F_t *f=NULL;
|
||
h5_stat_size_t empty_size; /* Size of an empty file */
|
||
h5_stat_size_t file_size; /* Size of each file created */
|
||
hsize_t record; /* Record to insert into tree */
|
||
haddr_t bt2_addr; /* Address of B-tree created */
|
||
H5B2_stat_t bt2_stat; /* Statistics about B-tree created */
|
||
unsigned u; /* Local index variable */
|
||
|
||
h5_fixname(FILENAME[0], fapl, filename, sizeof filename);
|
||
|
||
/* Attempt to delete empty B-tree */
|
||
TESTING("B-tree delete: delete empty B-tree");
|
||
|
||
/* Create empty file for size comparisons later */
|
||
|
||
/* Create the file to work on */
|
||
if((file = H5Fcreate(filename, H5F_ACC_TRUNC, H5P_DEFAULT, fapl)) < 0)
|
||
STACK_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
STACK_ERROR
|
||
|
||
/* Get the size of an empty file */
|
||
if((empty_size = h5_get_file_size(filename, fapl)) < 0)
|
||
TEST_ERROR
|
||
|
||
/* Create the file to work on */
|
||
if((file = H5Fcreate(filename, H5F_ACC_TRUNC, H5P_DEFAULT, fapl)) < 0)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
/*
|
||
* Create v2 B-tree
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/*
|
||
* Delete v2 B-tree
|
||
*/
|
||
if(H5B2_delete(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, NULL, NULL) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Close the file */
|
||
if(H5Fclose(file) < 0)
|
||
STACK_ERROR
|
||
|
||
/* Get the size of the file */
|
||
if((file_size = h5_get_file_size(filename, fapl)) < 0)
|
||
TEST_ERROR
|
||
|
||
/* Verify the file is correct size */
|
||
if(file_size != empty_size)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
/* Attempt to delete level-0 B-tree */
|
||
TESTING("B-tree delete: delete level-0 B-tree");
|
||
|
||
/* Create the file to work on */
|
||
if((file = H5Fcreate(filename, H5F_ACC_TRUNC, H5P_DEFAULT, fapl)) < 0)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
/*
|
||
* Create v2 B-tree
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Insert records */
|
||
for(u = 0; u < DELETE_SMALL; u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 0)
|
||
TEST_ERROR
|
||
|
||
/*
|
||
* Delete v2 B-tree
|
||
*/
|
||
if(H5B2_delete(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, NULL, NULL) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
STACK_ERROR
|
||
|
||
/* Get the size of the file */
|
||
if((file_size = h5_get_file_size(filename, fapl)) < 0)
|
||
TEST_ERROR
|
||
|
||
/* Verify the file is correct size */
|
||
if(file_size != empty_size)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
/* Attempt to delete level-1 B-tree */
|
||
TESTING("B-tree delete: delete level-1 B-tree");
|
||
|
||
/* Create the file to work on */
|
||
if((file = H5Fcreate(filename, H5F_ACC_TRUNC, H5P_DEFAULT, fapl)) < 0)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
/*
|
||
* Create v2 B-tree
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Insert records */
|
||
for(u = 0; u < DELETE_MEDIUM; u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 1)
|
||
TEST_ERROR
|
||
|
||
/*
|
||
* Delete v2 B-tree
|
||
*/
|
||
if(H5B2_delete(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, NULL, NULL) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
STACK_ERROR
|
||
|
||
/* Get the size of the file */
|
||
if((file_size = h5_get_file_size(filename, fapl)) < 0)
|
||
TEST_ERROR
|
||
|
||
/* Verify the file is correct size */
|
||
if(file_size != empty_size)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
/* Attempt to delete level-2 B-tree */
|
||
TESTING("B-tree delete: delete level-2 B-tree");
|
||
|
||
/* Create the file to work on */
|
||
if((file = H5Fcreate(filename, H5F_ACC_TRUNC, H5P_DEFAULT, fapl)) < 0)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
/*
|
||
* Create v2 B-tree
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Insert records */
|
||
for(u = 0; u < DELETE_LARGE; u++) {
|
||
record = u;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
|
||
/*
|
||
* Delete v2 B-tree
|
||
*/
|
||
if(H5B2_delete(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, NULL, NULL) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
STACK_ERROR
|
||
|
||
/* Get the size of the file */
|
||
if((file_size = h5_get_file_size(filename, fapl)) < 0)
|
||
TEST_ERROR
|
||
|
||
/* Verify the file is correct size */
|
||
if(file_size != empty_size)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_delete() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: test_modify
|
||
*
|
||
* Purpose: Basic tests for the B-tree v2 code. This test exercises
|
||
* code to modify an existing record in the B-tree
|
||
*
|
||
* Return: Success: 0
|
||
*
|
||
* Failure: 1
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Friday, March 10, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
static unsigned
|
||
test_modify(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 */
|
||
hsize_t modify; /* Modified value */
|
||
hsize_t found; /* Found value */
|
||
H5B2_stat_t bt2_stat; /* Statistics about B-tree created */
|
||
H5B2_node_info_test_t ninfo; /* B-tree node info */
|
||
unsigned u; /* Local index variable */
|
||
herr_t ret; /* Generic error return value */
|
||
|
||
h5_fixname(FILENAME[0], fapl, filename, sizeof filename);
|
||
|
||
/*
|
||
* Test modifying records
|
||
*/
|
||
TESTING("B-tree modify: attempt to modify non-existant record");
|
||
|
||
/* Create the file to work on */
|
||
if((file = H5Fcreate(filename, H5F_ACC_TRUNC, H5P_DEFAULT, fapl)) < 0)
|
||
STACK_ERROR
|
||
|
||
/* Get a pointer to the internal file object */
|
||
if(NULL == (f = (H5F_t *)H5I_object(file)))
|
||
STACK_ERROR
|
||
|
||
/*
|
||
* Create v2 B-tree
|
||
*/
|
||
if(H5B2_create(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, 512, 8, 100, 40, &bt2_addr/*out*/) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
/* Create level-2 B-tree with 3 internal nodes */
|
||
for(u = 0; u < ((INSERT_SPLIT_ROOT_NREC * 59) + 1); u++) {
|
||
record = u * 5;
|
||
if(H5B2_insert(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record) < 0)
|
||
FAIL_STACK_ERROR
|
||
} /* end for */
|
||
|
||
/* Check up on B-tree */
|
||
if(H5B2_stat_info(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &bt2_stat) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(bt2_stat.depth != 2)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to modify a non-existant record */
|
||
record = 3;
|
||
modify = 4;
|
||
H5E_BEGIN_TRY {
|
||
ret = H5B2_modify(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, modify_cb, &modify);
|
||
} H5E_END_TRY;
|
||
/* Should fail */
|
||
if(ret != FAIL)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
TESTING("B-tree modify: modify record in leaf node");
|
||
|
||
record = 4330; /* Record in leaf node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 0)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 62)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to modify a record in a leaf node */
|
||
record = 4330;
|
||
modify = 4331;
|
||
if(H5B2_modify(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, modify_cb, &modify) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
record = 4331; /* Record in leaf node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 0)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 62)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to find modified record */
|
||
record = 4331;
|
||
found = 4331;
|
||
if(H5B2_find(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, find_cb, &found) != TRUE)
|
||
FAIL_STACK_ERROR
|
||
if(found != 4331)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to find original record */
|
||
record = 4330;
|
||
found = HSIZET_MAX;
|
||
H5E_BEGIN_TRY {
|
||
ret = H5B2_modify(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, modify_cb, &modify);
|
||
} H5E_END_TRY;
|
||
/* Should fail */
|
||
if(ret != FAIL)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
TESTING("B-tree modify: modify record in internal node");
|
||
|
||
record = 5350; /* Record in internal node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 29)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to modify a record in an internal node */
|
||
record = 5350;
|
||
modify = 5352;
|
||
if(H5B2_modify(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, modify_cb, &modify) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
record = 5352; /* Record in internal node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 1)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 29)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to find modified record */
|
||
record = 5352;
|
||
found = 5352;
|
||
if(H5B2_find(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, find_cb, &found) != TRUE)
|
||
STACK_ERROR
|
||
if(found != 5352)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to find original record */
|
||
record = 5350;
|
||
found = 5350;
|
||
H5E_BEGIN_TRY {
|
||
ret = H5B2_modify(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, modify_cb, &modify);
|
||
} H5E_END_TRY;
|
||
/* Should fail */
|
||
if(ret != FAIL)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
TESTING("B-tree modify: modify record in root node");
|
||
|
||
record = 9445; /* Record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 2)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to modify a record in a root node */
|
||
record = 9445;
|
||
modify = 9448;
|
||
if(H5B2_modify(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, modify_cb, &modify) < 0)
|
||
FAIL_STACK_ERROR
|
||
|
||
record = 9448; /* Record in root node */
|
||
if(H5B2_get_node_info_test(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, &ninfo) < 0)
|
||
FAIL_STACK_ERROR
|
||
if(ninfo.depth != 2)
|
||
TEST_ERROR
|
||
if(ninfo.nrec != 2)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to find modified record */
|
||
record = 9448;
|
||
found = 9448;
|
||
if(H5B2_find(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, find_cb, &found) != TRUE)
|
||
STACK_ERROR
|
||
if(found != 9448)
|
||
TEST_ERROR
|
||
|
||
/* Attempt to find original record */
|
||
record = 9445;
|
||
found = 9445;
|
||
H5E_BEGIN_TRY {
|
||
ret = H5B2_modify(f, H5P_DATASET_XFER_DEFAULT, H5B2_TEST, bt2_addr, &record, modify_cb, &modify);
|
||
} H5E_END_TRY;
|
||
/* Should fail */
|
||
if(ret != FAIL)
|
||
TEST_ERROR
|
||
|
||
/* Close file */
|
||
if(H5Fclose(file) < 0)
|
||
TEST_ERROR
|
||
|
||
PASSED();
|
||
|
||
return 0;
|
||
|
||
error:
|
||
H5E_BEGIN_TRY {
|
||
H5Fclose(file);
|
||
} H5E_END_TRY;
|
||
return 1;
|
||
} /* test_modify() */
|
||
|
||
|
||
/*-------------------------------------------------------------------------
|
||
* Function: main
|
||
*
|
||
* Purpose: Test the B-tree v2 code
|
||
*
|
||
* Return: Success:
|
||
*
|
||
* Failure:
|
||
*
|
||
* Programmer: Quincey Koziol
|
||
* Tuesday, February 1, 2005
|
||
*
|
||
*-------------------------------------------------------------------------
|
||
*/
|
||
int
|
||
main(void)
|
||
{
|
||
hid_t fapl = -1; /* File access property list for data files */
|
||
unsigned nerrors = 0; /* Cumulative error count */
|
||
int ExpressMode;
|
||
const char *envval = NULL;
|
||
|
||
envval = HDgetenv("HDF5_DRIVER");
|
||
if(envval == NULL)
|
||
envval = "nomatch";
|
||
|
||
/* Reset library */
|
||
h5_reset();
|
||
fapl = h5_fileaccess();
|
||
ExpressMode = GetTestExpress();
|
||
if (ExpressMode > 1)
|
||
printf("***Express test mode on. Some tests may be skipped\n");
|
||
|
||
/* Test B-tree record insertion */
|
||
/* Iteration, find & index routines tested in these routines as well */
|
||
nerrors += test_insert_basic(fapl);
|
||
nerrors += test_insert_split_root(fapl);
|
||
nerrors += test_insert_level1_2leaf_redistrib(fapl);
|
||
nerrors += test_insert_level1_side_split(fapl);
|
||
nerrors += test_insert_level1_3leaf_redistrib(fapl);
|
||
nerrors += test_insert_level1_middle_split(fapl);
|
||
nerrors += test_insert_make_level2(fapl);
|
||
nerrors += test_insert_level2_leaf_redistrib(fapl);
|
||
nerrors += test_insert_level2_leaf_split(fapl);
|
||
nerrors += test_insert_level2_2internal_redistrib(fapl);
|
||
nerrors += test_insert_level2_2internal_split(fapl);
|
||
nerrors += test_insert_level2_3internal_redistrib(fapl);
|
||
nerrors += test_insert_level2_3internal_split(fapl);
|
||
if (ExpressMode > 1)
|
||
printf("***Express test mode on. test_insert_lots skipped\n");
|
||
else
|
||
nerrors += test_insert_lots(fapl);
|
||
|
||
/* Test B-tree record removal */
|
||
/* Querying the number of records routine also tested in these routines as well */
|
||
nerrors += test_remove_basic(fapl);
|
||
nerrors += test_remove_level1_noredistrib(fapl);
|
||
nerrors += test_remove_level1_redistrib(fapl);
|
||
nerrors += test_remove_level1_2leaf_merge(fapl);
|
||
nerrors += test_remove_level1_3leaf_merge(fapl);
|
||
nerrors += test_remove_level1_promote(fapl);
|
||
nerrors += test_remove_level1_promote_2leaf_redistrib(fapl);
|
||
nerrors += test_remove_level1_promote_3leaf_redistrib(fapl);
|
||
nerrors += test_remove_level1_promote_2leaf_merge(fapl);
|
||
nerrors += test_remove_level1_promote_3leaf_merge(fapl);
|
||
nerrors += test_remove_level1_collapse(fapl);
|
||
nerrors += test_remove_level2_promote(fapl);
|
||
nerrors += test_remove_level2_promote_2internal_redistrib(fapl);
|
||
nerrors += test_remove_level2_promote_3internal_redistrib(fapl);
|
||
nerrors += test_remove_level2_promote_2internal_merge(fapl);
|
||
nerrors += test_remove_level2_promote_3internal_merge(fapl);
|
||
nerrors += test_remove_level2_2internal_merge_left(fapl);
|
||
nerrors += test_remove_level2_2internal_merge_right(fapl);
|
||
nerrors += test_remove_level2_3internal_merge(fapl);
|
||
nerrors += test_remove_level2_collapse_right(fapl);
|
||
if (ExpressMode > 1)
|
||
printf("***Express test mode on. test_remove_lots skipped\n");
|
||
else
|
||
nerrors += test_remove_lots(envval, fapl);
|
||
|
||
/* Test more complex B-tree queries */
|
||
nerrors += test_find_neighbor(fapl);
|
||
|
||
/* Test deleting B-trees */
|
||
nerrors += test_delete(fapl);
|
||
|
||
/* Test modifying B-tree records */
|
||
nerrors += test_modify(fapl);
|
||
|
||
if(nerrors)
|
||
goto error;
|
||
|
||
puts("All v2 B-tree tests passed.");
|
||
|
||
h5_cleanup(FILENAME, fapl);
|
||
|
||
return 0;
|
||
|
||
error:
|
||
puts("*** TESTS FAILED ***");
|
||
|
||
H5E_BEGIN_TRY {
|
||
H5Pclose(fapl);
|
||
} H5E_END_TRY;
|
||
|
||
return 1;
|
||
} /* end main() */
|
||
|