Rejiggered the ID wrapping test to avoid allocating all the IDs at once
(at the expense of not being able to check for failure when all IDs are used
up), but still retaining checks for ID wrapping. This was done to avoid
an large memory footprint for the test.
Tested on:
Mac OSX/64 10.9.5 (amazon) w/serial & parallel
(Too minor to require full h5committest)
675 lines
19 KiB
C
675 lines
19 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. *
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
|
|
|
|
/* Test user-created identifiers (hid_t's) and identifier types. */
|
|
|
|
#include "testhdf5.h"
|
|
#include "hdf5.h"
|
|
|
|
/* Include H5Ipkg.h to calculate max number of groups */
|
|
#define H5I_PACKAGE
|
|
#include "H5Ipkg.h"
|
|
|
|
/* Test basic functionality of registering and deleting types and IDs */
|
|
static int basic_id_test(void)
|
|
{
|
|
H5I_type_t myType = H5I_BADID;
|
|
hid_t arrayID = H5I_INVALID_HID;
|
|
void* testObj = NULL;
|
|
void* testPtr = NULL;
|
|
char nameString[10];
|
|
hid_t testID;
|
|
ssize_t testSize = -1;
|
|
herr_t err;
|
|
int num_ref;
|
|
hsize_t num_members;
|
|
|
|
|
|
/* Try to register an ID with ficticious types */
|
|
H5E_BEGIN_TRY
|
|
arrayID = H5Iregister((H5I_type_t) 420, testObj);
|
|
H5E_END_TRY
|
|
|
|
VERIFY(arrayID, H5I_INVALID_HID, "H5Iregister");
|
|
if(arrayID != H5I_INVALID_HID)
|
|
goto out;
|
|
|
|
H5E_BEGIN_TRY
|
|
arrayID = H5Iregister((H5I_type_t) -1, testObj);
|
|
H5E_END_TRY
|
|
|
|
VERIFY(arrayID, H5I_INVALID_HID, "H5Iregister");
|
|
if(arrayID != H5I_INVALID_HID)
|
|
goto out;
|
|
|
|
/* Try to access IDs with ficticious types */
|
|
H5E_BEGIN_TRY
|
|
testPtr = H5Iobject_verify((hid_t)100, (H5I_type_t) 0);
|
|
H5E_END_TRY
|
|
|
|
VERIFY(testPtr, NULL, "H5Iobject_verify");
|
|
if(testPtr != NULL)
|
|
goto out;
|
|
|
|
H5E_BEGIN_TRY
|
|
testPtr = H5Iobject_verify((hid_t)700, (H5I_type_t) 700);
|
|
H5E_END_TRY
|
|
|
|
VERIFY(testPtr, NULL, "H5Iobject_verify");
|
|
if(testPtr != NULL)
|
|
goto out;
|
|
|
|
/* Register a type */
|
|
myType = H5Iregister_type((size_t)64, 0, (H5I_free_t) free );
|
|
|
|
CHECK(myType, H5I_BADID, "H5Iregister_type");
|
|
if(myType == H5I_BADID)
|
|
goto out;
|
|
|
|
/* Register an ID and retrieve the object it points to.
|
|
* Once the ID has been registered, testObj will be freed when
|
|
* its ID type is destroyed. */
|
|
testObj = HDmalloc(7 * sizeof(int));
|
|
arrayID = H5Iregister(myType, testObj);
|
|
|
|
CHECK(arrayID, H5I_INVALID_HID, "H5Iregister");
|
|
if(arrayID == H5I_INVALID_HID)
|
|
{
|
|
HDfree(testObj);
|
|
goto out;
|
|
}
|
|
|
|
testPtr = (int *) H5Iobject_verify(arrayID, myType);
|
|
|
|
VERIFY(testPtr, testObj, "H5Iobject_verify");
|
|
if(testPtr != testObj)
|
|
goto out;
|
|
|
|
/* Ensure that H5Iget_file_id and H5Iget_name() fail, since this
|
|
* is an hid_t for the wrong kind of object */
|
|
H5E_BEGIN_TRY
|
|
testID = H5Iget_file_id(arrayID);
|
|
H5E_END_TRY
|
|
|
|
VERIFY(testID, H5I_INVALID_HID, "H5Iget_file_id");
|
|
if(testID != H5I_INVALID_HID)
|
|
goto out;
|
|
|
|
H5E_BEGIN_TRY
|
|
testSize = H5Iget_name(arrayID, nameString, (size_t)9);
|
|
H5E_END_TRY
|
|
|
|
VERIFY(testSize, -1, "H5Iget_name");
|
|
if(testSize != -1)
|
|
goto out;
|
|
|
|
/* Make sure H5Iremove_verify catches objects of the wrong type */
|
|
H5E_BEGIN_TRY
|
|
testPtr = (int*) H5Iremove_verify(arrayID, (H5I_type_t) 0);
|
|
H5E_END_TRY
|
|
|
|
VERIFY(testPtr, NULL, "H5Iremove_verify");
|
|
if(testPtr != NULL)
|
|
goto out;
|
|
|
|
H5E_BEGIN_TRY
|
|
testPtr = (int*) H5Iremove_verify(arrayID, (H5I_type_t) ((int) myType-1));
|
|
H5E_END_TRY
|
|
|
|
VERIFY(testPtr, NULL, "H5Iremove_verify");
|
|
if(testPtr != NULL)
|
|
goto out;
|
|
|
|
/* Remove an ID and make sure we can't access it */
|
|
testPtr = (int*) H5Iremove_verify(arrayID, myType);
|
|
|
|
CHECK(testPtr, NULL, "H5Iremove_verify");
|
|
if(testPtr == NULL)
|
|
goto out;
|
|
|
|
H5E_BEGIN_TRY
|
|
testPtr = (int*) H5Iobject_verify(arrayID, myType);
|
|
H5E_END_TRY
|
|
|
|
VERIFY(testPtr, NULL, "H5Iobject_verify");
|
|
if(testPtr != NULL)
|
|
goto out;
|
|
|
|
/* Delete the type and make sure we can't access objects within it */
|
|
arrayID = H5Iregister(myType, testObj);
|
|
|
|
err = H5Idestroy_type(myType);
|
|
VERIFY(err, 0, "H5Idestroy_type");
|
|
if( err != 0)
|
|
goto out;
|
|
VERIFY(H5Itype_exists(myType), 0, "H5Itype_exists");
|
|
if(H5Itype_exists(myType) != 0)
|
|
goto out;
|
|
|
|
H5E_BEGIN_TRY
|
|
VERIFY(H5Inmembers(myType, NULL), -1, "H5Inmembers");
|
|
if(H5Inmembers(myType, NULL) != -1)
|
|
goto out;
|
|
H5E_END_TRY
|
|
|
|
/* Register another type and another object in that type */
|
|
myType = H5Iregister_type((size_t)64, 0, (H5I_free_t) free );
|
|
|
|
CHECK(myType, H5I_BADID, "H5Iregister_type");
|
|
if(myType == H5I_BADID)
|
|
goto out;
|
|
|
|
/* The memory that testObj pointed to should already have been
|
|
* freed when the previous type was destroyed. Allocate new
|
|
* memory for it.
|
|
*/
|
|
testObj = HDmalloc(7 * sizeof(int));
|
|
arrayID = H5Iregister(myType, testObj);
|
|
|
|
CHECK(arrayID, H5I_INVALID_HID, "H5Iregister");
|
|
if(arrayID == H5I_INVALID_HID)
|
|
{
|
|
HDfree(testObj);
|
|
goto out;
|
|
}
|
|
|
|
err = H5Inmembers(myType, &num_members);
|
|
CHECK(err, -1, "H5Inmembers");
|
|
if (err < 0)
|
|
goto out;
|
|
VERIFY(num_members, 1, "H5Inmembers");
|
|
if(num_members != 1)
|
|
goto out;
|
|
|
|
/* Increment references to type and ensure that dec_type_ref
|
|
doesn't destroy the type */
|
|
num_ref = H5Iinc_type_ref(myType);
|
|
VERIFY(num_ref, 2, "H5Iinc_type_ref");
|
|
if( num_ref != 2)
|
|
goto out;
|
|
num_ref = H5Idec_type_ref(myType);
|
|
VERIFY(num_ref, 1, "H5Idec_type_ref");
|
|
if(num_ref != 1)
|
|
goto out;
|
|
err = H5Inmembers(myType, &num_members);
|
|
CHECK(err, -1, "H5Inmembers");
|
|
if (err < 0)
|
|
goto out;
|
|
VERIFY(num_members, 1, "H5Inmembers");
|
|
if(num_members != 1)
|
|
goto out;
|
|
|
|
/* This call to dec_type_ref should destroy the type */
|
|
num_ref = H5Idec_type_ref(myType);
|
|
VERIFY(num_ref, 0, "H5Idec_type_ref");
|
|
if(num_ref != 0)
|
|
goto out;
|
|
VERIFY(H5Itype_exists(myType), 0, "H5Itype_exists");
|
|
if (H5Itype_exists(myType) != 0)
|
|
goto out;
|
|
|
|
H5E_BEGIN_TRY
|
|
err = H5Inmembers(myType, &num_members);
|
|
if(err >= 0)
|
|
goto out;
|
|
H5E_END_TRY
|
|
|
|
return 0;
|
|
|
|
out:
|
|
/* Clean up type if it has been allocated and free memory used
|
|
* by testObj */
|
|
if(myType >= 0)
|
|
H5Idestroy_type(myType);
|
|
|
|
return -1;
|
|
}
|
|
|
|
|
|
/* A dummy search function for the next test */
|
|
static int test_search_func(void UNUSED * ptr1, void UNUSED * ptr2) { return 0; }
|
|
|
|
/* Ensure that public functions cannot access "predefined" ID types */
|
|
static int id_predefined_test(void )
|
|
{
|
|
void * testObj;
|
|
hid_t testID;
|
|
hid_t typeID = H5I_INVALID_HID;
|
|
void * testPtr;
|
|
herr_t testErr;
|
|
|
|
testObj = HDmalloc(sizeof(int));
|
|
|
|
/* Try to perform illegal functions on various predefined types */
|
|
H5E_BEGIN_TRY
|
|
testID = H5Iregister(H5I_FILE, testObj);
|
|
H5E_END_TRY
|
|
|
|
VERIFY(testID, H5I_INVALID_HID, "H5Iregister");
|
|
if(testID != H5I_INVALID_HID)
|
|
goto out;
|
|
|
|
H5E_BEGIN_TRY
|
|
testPtr = H5Isearch(H5I_GENPROP_LST, (H5I_search_func_t) test_search_func, testObj);
|
|
H5E_END_TRY
|
|
|
|
VERIFY(testPtr, NULL, "H5Isearch");
|
|
if(testPtr != NULL)
|
|
goto out;
|
|
|
|
H5E_BEGIN_TRY
|
|
testErr = H5Inmembers(H5I_ERROR_STACK, NULL);
|
|
H5E_END_TRY
|
|
|
|
VERIFY(testErr, -1, "H5Inmembers");
|
|
if(testErr != -1)
|
|
goto out;
|
|
|
|
H5E_BEGIN_TRY
|
|
testErr = H5Iclear_type(H5I_FILE, 0);
|
|
H5E_END_TRY
|
|
|
|
VERIFY((testErr >= 0), 0, "H5Iclear_type");
|
|
if(testErr >= 0)
|
|
goto out;
|
|
|
|
H5E_BEGIN_TRY
|
|
testErr = H5Idestroy_type(H5I_DATASET);
|
|
H5E_END_TRY
|
|
|
|
VERIFY((testErr >= 0), 0, "H5Idestroy_type");
|
|
if(testErr >= 0)
|
|
goto out;
|
|
|
|
/* Create a datatype ID and try to perform illegal functions on it */
|
|
typeID = H5Tcreate(H5T_OPAQUE, (size_t)42);
|
|
CHECK(typeID, H5I_INVALID_HID, "H5Tcreate");
|
|
if(typeID == H5I_INVALID_HID)
|
|
goto out;
|
|
|
|
H5E_BEGIN_TRY
|
|
testPtr = H5Iremove_verify(typeID, H5I_DATATYPE);
|
|
H5E_END_TRY
|
|
|
|
VERIFY(testPtr, NULL, "H5Iremove_verify");
|
|
if(testPtr != NULL)
|
|
goto out;
|
|
|
|
H5E_BEGIN_TRY
|
|
testPtr = H5Iobject_verify(typeID, H5I_DATATYPE);
|
|
H5E_END_TRY
|
|
|
|
VERIFY(testPtr, NULL, "H5Iobject_verify");
|
|
if(testPtr != NULL)
|
|
goto out;
|
|
|
|
H5Tclose(typeID);
|
|
|
|
/* testObj was never registered as an atom, so it will not be
|
|
* automatically freed. */
|
|
HDfree(testObj);
|
|
return 0;
|
|
|
|
out:
|
|
if(typeID != H5I_INVALID_HID)
|
|
H5Tclose(typeID);
|
|
if(testObj != NULL)
|
|
HDfree(testObj);
|
|
|
|
return -1;
|
|
}
|
|
|
|
|
|
/* Test the H5Iis_valid function */
|
|
static int test_is_valid(void)
|
|
{
|
|
hid_t dtype; /* datatype id */
|
|
int nmembs1; /* number of type memnbers */
|
|
int nmembs2;
|
|
htri_t tri_ret; /* htri_t return value */
|
|
herr_t ret; /* return value */
|
|
|
|
/* Create a datatype id */
|
|
dtype = H5Tcopy(H5T_NATIVE_INT);
|
|
CHECK(dtype, FAIL, "H5Tcopy");
|
|
if (dtype < 0)
|
|
goto out;
|
|
|
|
/* Check that the ID is valid */
|
|
tri_ret = H5Iis_valid(dtype);
|
|
VERIFY(tri_ret, TRUE, "H5Iis_valid");
|
|
if (tri_ret != TRUE)
|
|
goto out;
|
|
|
|
/* Artificially manipulate the reference counts so app_count is 0, and dtype
|
|
* appears to be an internal id. This takes advantage of the fact that
|
|
* H5Ipkg is included.
|
|
*/
|
|
ret = H5I_inc_ref(dtype, FALSE);
|
|
CHECK(ret, FAIL, "H5I_inc_ref");
|
|
if (ret < 0)
|
|
goto out;
|
|
ret = H5I_dec_app_ref(dtype);
|
|
CHECK(ret, FAIL, "H5I_dec_ref");
|
|
if (ret < 0)
|
|
goto out;
|
|
|
|
/* Check that dtype is invalid */
|
|
tri_ret = H5Iis_valid(dtype);
|
|
VERIFY(tri_ret, FALSE, "H5Iis_valid");
|
|
if (tri_ret != FALSE)
|
|
goto out;
|
|
|
|
/* Close dtype and verify that it has been closed */
|
|
nmembs1 = H5I_nmembers(H5I_DATATYPE);
|
|
CHECK(nmembs1, FAIL, "H5I_nmembers");
|
|
if (nmembs1 < 0)
|
|
goto out;
|
|
ret = H5I_dec_ref(dtype);
|
|
CHECK(ret, FAIL, "H5I_dec_ref");
|
|
if (ret < 0)
|
|
goto out;
|
|
nmembs2 = H5I_nmembers(H5I_DATATYPE);
|
|
VERIFY(nmembs2, nmembs1 - 1, "H5I_nmembers");
|
|
if (nmembs2 != nmembs1 - 1)
|
|
goto out;
|
|
|
|
/* Check that dtype is invalid */
|
|
tri_ret = H5Iis_valid(dtype);
|
|
VERIFY(tri_ret, FALSE, "H5Iis_valid");
|
|
if (tri_ret != FALSE)
|
|
goto out;
|
|
|
|
/* Check that an id of -1 is invalid */
|
|
tri_ret = H5Iis_valid((hid_t)-1);
|
|
VERIFY(tri_ret, FALSE, "H4Iis_valid");
|
|
if (tri_ret != FALSE)
|
|
goto out;
|
|
|
|
return 0;
|
|
|
|
out:
|
|
/* Don't attempt to close dtype as we don't know the exact state of the
|
|
* reference counts. Every state in this function will be automatically
|
|
* closed at library exit anyways, as internal count is never > 1.
|
|
*/
|
|
return -1;
|
|
}
|
|
|
|
/* Test the H5Iget_type function */
|
|
static int test_get_type(void)
|
|
{
|
|
hid_t dtype; /* datatype id */
|
|
H5I_type_t type_ret; /* return value */
|
|
|
|
/* Create a datatype id */
|
|
dtype = H5Tcopy(H5T_NATIVE_INT);
|
|
CHECK(dtype, FAIL, "H5Tcopy");
|
|
if (dtype < 0)
|
|
goto out;
|
|
|
|
/* Check that the ID is correct */
|
|
type_ret = H5Iget_type(dtype);
|
|
VERIFY(type_ret, H5I_DATATYPE, "H5Iget_type");
|
|
if (type_ret == H5I_BADID)
|
|
goto out;
|
|
|
|
/* Check that the ID is correct */
|
|
type_ret = H5Iget_type((hid_t)H5T_STRING);
|
|
VERIFY(type_ret, H5I_BADID, "H5Iget_type");
|
|
if (type_ret != H5I_BADID)
|
|
goto out;
|
|
|
|
/* Check that the ID is correct */
|
|
type_ret = H5Iget_type((hid_t)-1);
|
|
VERIFY(type_ret, H5I_BADID, "H5Iget_type");
|
|
if (type_ret != H5I_BADID)
|
|
goto out;
|
|
|
|
H5Tclose(dtype);
|
|
|
|
return 0;
|
|
|
|
out:
|
|
if(dtype != H5I_INVALID_HID)
|
|
H5Tclose(dtype);
|
|
|
|
return -1;
|
|
}
|
|
|
|
/* Test boundary cases with lots of types */
|
|
|
|
/* Type IDs range from H5I_NTYPES to H5I_MAX_NUM_TYPES. The system will assign */
|
|
/* IDs in sequential order until H5I_MAX_NUM_TYPES IDs have been given out, at which */
|
|
/* point it will search for type IDs that were allocated but have since been */
|
|
/* deleted. */
|
|
/* This test will allocate IDs up to H5I_MAX_NUM_TYPES, ensure that IDs wrap around */
|
|
/* to low values successfully, ensure that an error is thrown when all possible */
|
|
/* type IDs are taken, then ensure that deleting types frees up their IDs. */
|
|
/* Note that this test depends on the implementation of IDs, so may break */
|
|
/* if the implementation changes. */
|
|
/* Also note that if someone else registered a user-defined type and forgot to */
|
|
/* destroy it, this test will mysteriously fail (because it will expect there to */
|
|
/* be one more "free" type ID than there is). */
|
|
/* H5I_NTYPES is defined in h5public.h, H5I_MAX_NUM_TYPES is defined in h5pkg.h */
|
|
static int test_id_type_list(void)
|
|
{
|
|
H5I_type_t startType; /* The first type ID we were assigned in this test */
|
|
H5I_type_t currentType;
|
|
H5I_type_t testType;
|
|
int i; /* Just a counter variable */
|
|
|
|
startType = H5Iregister_type((size_t)8, 0, (H5I_free_t) free );
|
|
CHECK(startType, H5I_BADID, "H5Iregister_type");
|
|
if(startType == H5I_BADID)
|
|
goto out;
|
|
|
|
/* Sanity check */
|
|
if(startType >= H5I_MAX_NUM_TYPES || startType < H5I_NTYPES)
|
|
{
|
|
/* Error condition, throw an error */
|
|
CHECK(1, 1, "H5Iregister_type");
|
|
goto out;
|
|
}
|
|
/* Create types up to H5I_MAX_NUM_TYPES */
|
|
for(i = startType + 1; i < H5I_MAX_NUM_TYPES; i++)
|
|
{
|
|
currentType = H5Iregister_type((size_t)8, 0, (H5I_free_t) free );
|
|
CHECK(currentType, H5I_BADID, "H5Iregister_type");
|
|
if(currentType == H5I_BADID)
|
|
goto out;
|
|
}
|
|
|
|
/* Wrap around to low type ID numbers */
|
|
for(i = H5I_NTYPES; i < startType; i++)
|
|
{
|
|
currentType = H5Iregister_type((size_t)8, 0, (H5I_free_t) free );
|
|
CHECK(currentType, H5I_BADID, "H5Iregister_type");
|
|
if(currentType == H5I_BADID)
|
|
goto out;
|
|
}
|
|
|
|
/* There should be no room at the inn for a new ID type*/
|
|
H5E_BEGIN_TRY
|
|
testType = H5Iregister_type((size_t)8, 0, (H5I_free_t) free );
|
|
H5E_END_TRY
|
|
|
|
VERIFY(testType, H5I_BADID, "H5Iregister_type");
|
|
if(testType != H5I_BADID)
|
|
goto out;
|
|
|
|
/* Now delete a type and try to insert again */
|
|
H5Idestroy_type(H5I_NTYPES);
|
|
testType = H5Iregister_type((size_t)8, 0, (H5I_free_t) free );
|
|
|
|
VERIFY(testType, H5I_NTYPES, "H5Iregister_type");
|
|
if(testType != H5I_NTYPES)
|
|
goto out;
|
|
|
|
/* Cleanup. Destroy all types. */
|
|
for(i = H5I_NTYPES; i < H5I_MAX_NUM_TYPES; i++)
|
|
H5Idestroy_type((H5I_type_t) i);
|
|
|
|
return 0;
|
|
|
|
out:
|
|
/* Cleanup. For simplicity, just destroy all types and ignore errors. */
|
|
H5E_BEGIN_TRY
|
|
for(i = H5I_NTYPES; i < H5I_MAX_NUM_TYPES; i++)
|
|
H5Idestroy_type((H5I_type_t) i);
|
|
H5E_END_TRY
|
|
return -1;
|
|
}
|
|
|
|
/* 'Fake' free routine for ID wrapping test */
|
|
static herr_t fake_free(void *obj)
|
|
{
|
|
/* Shut compilers up */
|
|
obj = obj;
|
|
|
|
return(0);
|
|
}
|
|
|
|
/* Test boundary cases with lots of IDs */
|
|
|
|
/* Type IDs range from 0 to ID_MASK before wrapping around. The code will assign */
|
|
/* IDs in sequential order until ID_MASK IDs have been given out. */
|
|
/* This test will allocate IDs up to ID_MASK, ensure that IDs wrap around */
|
|
/* to low values successfully, then ensure that deleting types frees up their IDs. */
|
|
/* NOTE: this test depends on the implementation of IDs, so may break */
|
|
/* if the implementation changes. */
|
|
static int test_id_wrap(void)
|
|
{
|
|
H5I_type_t testType; /* ID class for testing */
|
|
hid_t *id_array; /* Array of IDs allocated */
|
|
hid_t test_id; /* Test ID */
|
|
void *obj; /* Object pointer returned for ID */
|
|
unsigned u; /* Local index variable */
|
|
hsize_t nids; /* Number of IDs registered for type */
|
|
herr_t status; /* Status from routine */
|
|
|
|
/* Allocate array for storing IDs */
|
|
id_array = (hid_t *)HDmalloc((ID_MASK + 1) * sizeof(hid_t));
|
|
CHECK(id_array, NULL, "HDmalloc");
|
|
|
|
/* Register type for testing */
|
|
testType = H5Iregister_type((size_t)8, 0, (H5I_free_t)fake_free);
|
|
CHECK(testType, H5I_BADID, "H5Iregister_type");
|
|
if(testType == H5I_BADID)
|
|
goto out;
|
|
|
|
/* Get IDs, up to the maximum possible */
|
|
for(u = 0; u <= ID_MASK; u++) {
|
|
id_array[u] = H5Iregister(testType, &id_array[u]);
|
|
CHECK(id_array[u], FAIL, "H5Iregister");
|
|
if(id_array[u] < 0)
|
|
goto out;
|
|
if(u > 0) {
|
|
/* IDs should be returned in increasing order */
|
|
/* (Since application-registered IDs don't reuse ID values) */
|
|
if(id_array[u] < id_array[u - 1])
|
|
goto out;
|
|
|
|
/* Release the previous ID in the array */
|
|
obj = H5Iremove_verify(id_array[u - 1], testType);
|
|
CHECK(obj, NULL, "H5Iremove_verify");
|
|
if(NULL == obj)
|
|
goto out;
|
|
VERIFY(obj, &id_array[u - 1], "H5Iremove_verify");
|
|
if(&id_array[u - 1] != obj)
|
|
goto out;
|
|
} /* end if */
|
|
|
|
/* Verify number of registered IDs */
|
|
/* (Should stay at 1) */
|
|
status = H5Inmembers(testType, &nids);
|
|
CHECK(status, FAIL, "H5Inmembers");
|
|
if(status < 0)
|
|
goto out;
|
|
VERIFY(nids, 1, "H5Inmembers");
|
|
if(nids != 1)
|
|
goto out;
|
|
} /* end for */
|
|
|
|
/* Register another object, will wraparound */
|
|
test_id = H5Iregister(testType, &id_array[0]);
|
|
CHECK(test_id, FAIL, "H5Iregister");
|
|
if(test_id < 0)
|
|
goto out;
|
|
VERIFY(test_id, id_array[0], "H5Iregister");
|
|
if(id_array[0] != test_id)
|
|
goto out;
|
|
|
|
/* Verify number of registered IDs */
|
|
/* (Should be 2 now) */
|
|
status = H5Inmembers(testType, &nids);
|
|
CHECK(status, FAIL, "H5Inmembers");
|
|
if(status < 0)
|
|
goto out;
|
|
VERIFY(nids, 2, "H5Inmembers");
|
|
if(nids != 2)
|
|
goto out;
|
|
|
|
/* Release the first ID in the array */
|
|
obj = H5Iremove_verify(id_array[0], testType);
|
|
CHECK(obj, NULL, "H5Iremove_verify");
|
|
if(NULL == obj)
|
|
goto out;
|
|
VERIFY(obj, &id_array[0], "H5Iremove_verify");
|
|
if(&id_array[0] != obj)
|
|
goto out;
|
|
|
|
/* Release the last ID in the array */
|
|
obj = H5Iremove_verify(id_array[ID_MASK], testType);
|
|
CHECK(obj, NULL, "H5Iremove_verify");
|
|
if(NULL == obj)
|
|
goto out;
|
|
VERIFY(obj, &id_array[ID_MASK], "H5Iremove_verify");
|
|
if(&id_array[ID_MASK] != obj)
|
|
goto out;
|
|
|
|
/* Verify number of registered IDs */
|
|
/* (Should be 0 now) */
|
|
status = H5Inmembers(testType, &nids);
|
|
CHECK(status, FAIL, "H5Inmembers");
|
|
if(status < 0)
|
|
goto out;
|
|
VERIFY(nids, 0, "H5Inmembers");
|
|
if(nids != 0)
|
|
goto out;
|
|
|
|
status = H5Idestroy_type(testType);
|
|
CHECK(status, FAIL, "H5Idestroy_type");
|
|
if(status < 0)
|
|
goto out;
|
|
|
|
HDfree(id_array);
|
|
|
|
return(0);
|
|
|
|
out:
|
|
return(-1);
|
|
}
|
|
|
|
void test_ids(void)
|
|
{
|
|
if (basic_id_test() < 0) TestErrPrintf("Basic ID test failed\n");
|
|
if (id_predefined_test() < 0) TestErrPrintf("Predefined ID type test failed\n");
|
|
if (test_is_valid() < 0) TestErrPrintf("H5Iis_valid test failed\n");
|
|
if (test_get_type() < 0) TestErrPrintf("H5Iget_type test failed\n");
|
|
if (test_id_type_list() < 0) TestErrPrintf("ID type list test failed\n");
|
|
if (test_id_wrap() < 0) TestErrPrintf("ID wraparound test failed\n");
|
|
}
|