mirror of
https://github.com/HDFGroup/hdf5.git
synced 2025-02-17 16:10:24 +08:00
Yanked -Wc++-compat from the flags used to build the C library in both
the Autotools and CMake.
This commit is contained in:
parent
19f32485cf
commit
957940befb
@ -107,7 +107,7 @@ if (NOT MSVC AND CMAKE_COMPILER_IS_GNUCC)
|
||||
endif()
|
||||
elseif (CMAKE_C_COMPILER_ID STREQUAL "GNU")
|
||||
set (CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -pedantic -Wall -Wextra")
|
||||
set (H5_CFLAGS0 "${H5_CFLAGS0} -Wbad-function-cast -Wc++-compat -Wcast-align")
|
||||
set (H5_CFLAGS0 "${H5_CFLAGS0} -Wbad-function-cast -Wno-c++-compat -Wcast-align")
|
||||
set (H5_CFLAGS0 "${H5_CFLAGS0} -Wcast-qual -Wconversion -Wdeclaration-after-statement -Wdisabled-optimization -Wfloat-equal")
|
||||
set (H5_CFLAGS0 "${H5_CFLAGS0} -Wformat=2 -Winit-self -Winvalid-pch -Wmissing-declarations -Wmissing-include-dirs")
|
||||
set (H5_CFLAGS0 "${H5_CFLAGS0} -Wmissing-prototypes -Wnested-externs -Wold-style-definition -Wpacked -Wpointer-arith")
|
||||
|
@ -168,7 +168,10 @@ if test "X-gcc" = "X-$cc_vendor"; then
|
||||
# NOTE: Disable the -Wformat-nonliteral from -Wformat=2 here and re-add
|
||||
# it to the developer flags.
|
||||
#
|
||||
H5_CFLAGS="$H5_CFLAGS -pedantic -Wall -Wextra -Wbad-function-cast -Wc++-compat -Wcast-align"
|
||||
# NOTE: Due to the divergence in the C and C++, we're dropping support for
|
||||
# compiling the C library with a C++ compiler and dropping the -Wc++-compat
|
||||
# warning.
|
||||
H5_CFLAGS="$H5_CFLAGS -pedantic -Wall -Wextra -Wbad-function-cast -Wno-c++-compat -Wcast-align"
|
||||
H5_CFLAGS="$H5_CFLAGS -Wcast-qual -Wconversion -Wdeclaration-after-statement -Wdisabled-optimization -Wfloat-equal"
|
||||
H5_CFLAGS="$H5_CFLAGS -Wformat=2 -Wno-format-nonliteral -Winit-self -Winvalid-pch -Wmissing-declarations -Wmissing-include-dirs"
|
||||
H5_CFLAGS="$H5_CFLAGS -Wmissing-prototypes -Wnested-externs -Wold-style-definition -Wpacked"
|
||||
|
@ -241,7 +241,7 @@ H5FDregister(const H5FD_class_t *cls)
|
||||
HGOTO_ERROR(H5E_ARGS, H5E_UNINITIALIZED, H5I_INVALID_HID, "'get_eof' method is not defined")
|
||||
if(!cls->read || !cls->write)
|
||||
HGOTO_ERROR(H5E_ARGS, H5E_UNINITIALIZED, H5I_INVALID_HID, "'read' and/or 'write' method is not defined")
|
||||
for (type = H5FD_MEM_DEFAULT; type < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t,type))
|
||||
for (type = H5FD_MEM_DEFAULT; type < H5FD_MEM_NTYPES; type++)
|
||||
if(cls->fl_map[type] < H5FD_MEM_NOLIST || cls->fl_map[type] >= H5FD_MEM_NTYPES)
|
||||
HGOTO_ERROR(H5E_ARGS, H5E_BADVALUE, H5I_INVALID_HID, "invalid free-list mapping")
|
||||
|
||||
@ -286,7 +286,7 @@ H5FD_register(const void *_cls, size_t size, hbool_t app_ref)
|
||||
HDassert(cls->get_eoa && cls->set_eoa);
|
||||
HDassert(cls->get_eof);
|
||||
HDassert(cls->read && cls->write);
|
||||
for(type = H5FD_MEM_DEFAULT; type < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, type)) {
|
||||
for(type = H5FD_MEM_DEFAULT; type < H5FD_MEM_NTYPES; type++) {
|
||||
HDassert(cls->fl_map[type] >= H5FD_MEM_NOLIST && cls->fl_map[type] < H5FD_MEM_NTYPES);
|
||||
}
|
||||
|
||||
|
@ -1393,7 +1393,7 @@ H5F__super_init(H5F_t *f)
|
||||
HGOTO_ERROR(H5E_FILE, H5E_CANTSET, FAIL, "can't set version of fsinfo")
|
||||
f->shared->fs_version = fsinfo.version;
|
||||
|
||||
for(ptype = H5F_MEM_PAGE_SUPER; ptype < H5F_MEM_PAGE_NTYPES; H5_INC_ENUM(H5F_mem_page_t, ptype))
|
||||
for(ptype = H5F_MEM_PAGE_SUPER; ptype < H5F_MEM_PAGE_NTYPES; ptype++)
|
||||
fsinfo.fs_addr[ptype - 1] = HADDR_UNDEF;
|
||||
|
||||
if(H5O_msg_create(&ext_loc, H5O_FSINFO_ID, H5O_MSG_FLAG_DONTSHARE | H5O_MSG_FLAG_MARK_IF_UNKNOWN, H5O_UPDATE_TIME, &fsinfo) < 0)
|
||||
|
48
src/H5MF.c
48
src/H5MF.c
@ -163,7 +163,7 @@ H5MF_init_merge_flags(H5F_shared_t *f_sh)
|
||||
* can merge with the metadata or small 'raw' data aggregator
|
||||
*/
|
||||
all_same = TRUE;
|
||||
for(type = H5FD_MEM_DEFAULT; type < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, type))
|
||||
for(type = H5FD_MEM_DEFAULT; type < H5FD_MEM_NTYPES; type++)
|
||||
/* Check for any different type mappings */
|
||||
if(f_sh->fs_type_map[type] != f_sh->fs_type_map[H5FD_MEM_DEFAULT]) {
|
||||
all_same = FALSE;
|
||||
@ -187,7 +187,7 @@ H5MF_init_merge_flags(H5F_shared_t *f_sh)
|
||||
/* One or more allocation type don't map to the same free list type */
|
||||
/* Check if all the metadata allocation types map to the same type */
|
||||
all_metadata_same = TRUE;
|
||||
for(type = H5FD_MEM_SUPER; type < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, type))
|
||||
for(type = H5FD_MEM_SUPER; type < H5FD_MEM_NTYPES; type++)
|
||||
/* Skip checking raw data free list mapping */
|
||||
/* (global heap is treated as raw data) */
|
||||
if(type != H5FD_MEM_DRAW && type != H5FD_MEM_GHEAP) {
|
||||
@ -1686,7 +1686,7 @@ HDfprintf(stderr, "%s: Entering\n", FUNC);
|
||||
/* Iterate over all the free space types that have managers and
|
||||
* get each free list's space
|
||||
*/
|
||||
for(ptype = H5F_MEM_PAGE_META; ptype < H5F_MEM_PAGE_NTYPES; H5_INC_ENUM(H5F_mem_page_t, ptype)) {
|
||||
for(ptype = H5F_MEM_PAGE_META; ptype < H5F_MEM_PAGE_NTYPES; ptype++) {
|
||||
/* Test to see if we need to switch rings -- do so if required */
|
||||
if(H5MF__fsm_type_is_self_referential(f->shared, ptype))
|
||||
needed_ring = H5AC_RING_MDFSM;
|
||||
@ -1708,7 +1708,7 @@ HDfprintf(stderr, "%s: Entering\n", FUNC);
|
||||
/* Iterate over all the free space types that have managers and
|
||||
* get each free list's space
|
||||
*/
|
||||
for(type = H5FD_MEM_DEFAULT; type < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, type)) {
|
||||
for(type = H5FD_MEM_DEFAULT; type < H5FD_MEM_NTYPES; type++) {
|
||||
/* Test to see if we need to switch rings -- do so if required */
|
||||
if(H5MF__fsm_type_is_self_referential(f->shared, (H5F_mem_page_t)type))
|
||||
needed_ring = H5AC_RING_MDFSM;
|
||||
@ -1807,9 +1807,9 @@ HDfprintf(stderr, "%s: Entering\n", FUNC);
|
||||
*
|
||||
* In passing, verify that all the free space managers are closed.
|
||||
*/
|
||||
for(ptype = H5F_MEM_PAGE_META; ptype < H5F_MEM_PAGE_NTYPES; H5_INC_ENUM(H5F_mem_page_t, ptype))
|
||||
for(ptype = H5F_MEM_PAGE_META; ptype < H5F_MEM_PAGE_NTYPES; ptype++)
|
||||
fsinfo.fs_addr[ptype - 1] = HADDR_UNDEF;
|
||||
for(type = H5FD_MEM_SUPER; type < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, type))
|
||||
for(type = H5FD_MEM_SUPER; type < H5FD_MEM_NTYPES; type++)
|
||||
fsinfo.fs_addr[type-1] = f->shared->fs_addr[type];
|
||||
fsinfo.strategy = f->shared->fs_strategy;
|
||||
fsinfo.persist = f->shared->fs_persist;
|
||||
@ -1824,7 +1824,7 @@ HDfprintf(stderr, "%s: Entering\n", FUNC);
|
||||
HGOTO_ERROR(H5E_RESOURCE, H5E_WRITEERROR, FAIL, "error in writing message to superblock extension")
|
||||
|
||||
/* Close the free space managers */
|
||||
for(type = H5FD_MEM_SUPER; type < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, type)) {
|
||||
for(type = H5FD_MEM_SUPER; type < H5FD_MEM_NTYPES; type++) {
|
||||
if(f->shared->fs_man[type]) {
|
||||
/* Test to see if we need to switch rings -- do so if required */
|
||||
if(H5MF__fsm_type_is_self_referential(f->shared, (H5F_mem_page_t)type))
|
||||
@ -1877,7 +1877,7 @@ HDfprintf(stderr, "%s: Entering\n", FUNC);
|
||||
HDassert(H5F_NULL_FSM_ADDR(f) || final_eoa == f->shared->eoa_fsm_fsalloc);
|
||||
} /* end if */
|
||||
else { /* super_vers can be 0, 1, 2 */
|
||||
for(type = H5FD_MEM_DEFAULT; type < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, type))
|
||||
for(type = H5FD_MEM_DEFAULT; type < H5FD_MEM_NTYPES; type++)
|
||||
if(H5MF__close_delete_fstype(f, (H5F_mem_page_t)type) < 0)
|
||||
HGOTO_ERROR(H5E_RESOURCE, H5E_CANTINIT, FAIL, "can't initialize file free space")
|
||||
} /* end else */
|
||||
@ -1958,7 +1958,7 @@ HDfprintf(stderr, "%s: Entering\n", FUNC);
|
||||
fsinfo.eoa_pre_fsm_fsalloc = HADDR_UNDEF;
|
||||
fsinfo.version = f->shared->fs_version;
|
||||
|
||||
for(ptype = H5F_MEM_PAGE_META; ptype < H5F_MEM_PAGE_NTYPES; H5_INC_ENUM(H5F_mem_page_t, ptype))
|
||||
for(ptype = H5F_MEM_PAGE_META; ptype < H5F_MEM_PAGE_NTYPES; ptype++)
|
||||
fsinfo.fs_addr[ptype - 1] = HADDR_UNDEF;
|
||||
|
||||
if(f->shared->fs_persist) {
|
||||
@ -1980,7 +1980,7 @@ HDfprintf(stderr, "%s: Entering\n", FUNC);
|
||||
* file space for the self referential free space managers. Other
|
||||
* data was gathered above.
|
||||
*/
|
||||
for(ptype = H5F_MEM_PAGE_META; ptype < H5F_MEM_PAGE_NTYPES; H5_INC_ENUM(H5F_mem_page_t, ptype))
|
||||
for(ptype = H5F_MEM_PAGE_META; ptype < H5F_MEM_PAGE_NTYPES; ptype++)
|
||||
fsinfo.fs_addr[ptype-1] = f->shared->fs_addr[ptype];
|
||||
fsinfo.eoa_pre_fsm_fsalloc = f->shared->eoa_fsm_fsalloc;
|
||||
|
||||
@ -1990,7 +1990,7 @@ HDfprintf(stderr, "%s: Entering\n", FUNC);
|
||||
|
||||
/* Close the free space managers */
|
||||
/* use H5MF__close_fstype() for this? */
|
||||
for(ptype = H5F_MEM_PAGE_META; ptype < H5F_MEM_PAGE_NTYPES; H5_INC_ENUM(H5F_mem_page_t, ptype)) {
|
||||
for(ptype = H5F_MEM_PAGE_META; ptype < H5F_MEM_PAGE_NTYPES; ptype++) {
|
||||
if(f->shared->fs_man[ptype]) {
|
||||
/* Test to see if we need to switch rings -- do so if required */
|
||||
if(H5MF__fsm_type_is_self_referential(f->shared, ptype))
|
||||
@ -2052,7 +2052,7 @@ HDfprintf(stderr, "%s: Entering\n", FUNC);
|
||||
/* Iterate over all the free space types that have managers
|
||||
* and get each free list's space
|
||||
*/
|
||||
for(ptype = H5F_MEM_PAGE_META; ptype < H5F_MEM_PAGE_NTYPES; H5_INC_ENUM(H5F_mem_page_t, ptype))
|
||||
for(ptype = H5F_MEM_PAGE_META; ptype < H5F_MEM_PAGE_NTYPES; ptype++)
|
||||
if(H5MF__close_delete_fstype(f, ptype) < 0)
|
||||
HGOTO_ERROR(H5E_RESOURCE, H5E_CANTRELEASE, FAIL, "can't close the free space manager")
|
||||
|
||||
@ -2125,7 +2125,7 @@ H5MF__close_shrink_eoa(H5F_t *f)
|
||||
|
||||
if(H5F_PAGED_AGGR(f)) {
|
||||
/* Check the last section of each free-space manager */
|
||||
for(ptype = H5F_MEM_PAGE_META; ptype < H5F_MEM_PAGE_NTYPES; H5_INC_ENUM(H5F_mem_page_t, ptype)) {
|
||||
for(ptype = H5F_MEM_PAGE_META; ptype < H5F_MEM_PAGE_NTYPES; ptype++) {
|
||||
if(f->shared->fs_man[ptype]) {
|
||||
/* Test to see if we need to switch rings -- do so if required */
|
||||
if(H5MF__fsm_type_is_self_referential(f->shared, ptype))
|
||||
@ -2149,7 +2149,7 @@ H5MF__close_shrink_eoa(H5F_t *f)
|
||||
} /* end if */
|
||||
else {
|
||||
/* Check the last section of each free-space manager */
|
||||
for(type = H5FD_MEM_DEFAULT; type < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, type)) {
|
||||
for(type = H5FD_MEM_DEFAULT; type < H5FD_MEM_NTYPES; type++) {
|
||||
if(f->shared->fs_man[type]) {
|
||||
/* Test to see if we need to switch rings -- do so if required */
|
||||
if(H5MF__fsm_type_is_self_referential(f->shared, (H5F_mem_page_t)type))
|
||||
@ -2245,7 +2245,7 @@ H5MF_get_freespace(H5F_t *f, hsize_t *tot_space, hsize_t *meta_size)
|
||||
end_type = (H5F_mem_page_t)H5FD_MEM_NTYPES;
|
||||
} /* end else */
|
||||
|
||||
for(tt = H5FD_MEM_SUPER; tt < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, tt))
|
||||
for(tt = H5FD_MEM_SUPER; tt < H5FD_MEM_NTYPES; tt++)
|
||||
if(HADDR_UNDEF == (fs_eoa[tt] = H5F_get_eoa(f, tt)))
|
||||
HGOTO_ERROR(H5E_RESOURCE, H5E_CANTGET, FAIL, "driver get_eoa request failed")
|
||||
|
||||
@ -2260,7 +2260,7 @@ H5MF_get_freespace(H5F_t *f, hsize_t *tot_space, hsize_t *meta_size)
|
||||
} /* end if */
|
||||
|
||||
/* Iterate over all the free space types that have managers and get each free list's space */
|
||||
for(type = start_type; type < end_type; H5_INC_ENUM(H5F_mem_page_t, type)) {
|
||||
for(type = start_type; type < end_type; type++) {
|
||||
fs_started[type] = FALSE;
|
||||
|
||||
/* Check if the free space for the file has been initialized */
|
||||
@ -2300,7 +2300,7 @@ H5MF_get_freespace(H5F_t *f, hsize_t *tot_space, hsize_t *meta_size)
|
||||
} /* end for */
|
||||
|
||||
/* Close the free-space managers if they were opened earlier in this routine */
|
||||
for(type = start_type; type < end_type; H5_INC_ENUM(H5F_mem_page_t, type)) {
|
||||
for(type = start_type; type < end_type; type++) {
|
||||
/* Test to see if we need to switch rings -- do so if required */
|
||||
if(H5MF__fsm_type_is_self_referential(f->shared, (H5F_mem_page_t)type))
|
||||
needed_ring = H5AC_RING_MDFSM;
|
||||
@ -2387,7 +2387,7 @@ H5MF_get_free_sections(H5F_t *f, H5FD_mem_t type, size_t nsects, H5F_sect_info_t
|
||||
if(H5F_PAGED_AGGR(f)) /* set to the corresponding LARGE free-space manager */
|
||||
end_type = (H5F_mem_page_t)(end_type + H5FD_MEM_NTYPES);
|
||||
else
|
||||
H5_INC_ENUM(H5F_mem_page_t, end_type);
|
||||
end_type++;
|
||||
} /* end else */
|
||||
|
||||
/* Set up user data for section iteration */
|
||||
@ -2403,7 +2403,7 @@ H5MF_get_free_sections(H5F_t *f, H5FD_mem_t type, size_t nsects, H5F_sect_info_t
|
||||
curr_ring = H5AC_RING_RDFSM;
|
||||
|
||||
/* Iterate over memory types, retrieving the number of sections of each type */
|
||||
for(ty = start_type; ty < end_type; H5_INC_ENUM(H5F_mem_page_t, ty)) {
|
||||
for(ty = start_type; ty < end_type; ty++) {
|
||||
hbool_t fs_started = FALSE; /* The free-space manager is opened or not */
|
||||
size_t nums = 0; /* The number of free-space sections */
|
||||
|
||||
@ -2733,7 +2733,7 @@ H5MF_settle_raw_data_fsm(H5F_t *f, hbool_t *fsm_settled)
|
||||
else /* no need for a second pass */
|
||||
break;
|
||||
|
||||
for(mem_type = H5FD_MEM_SUPER; mem_type < H5FD_MEM_NTYPES; H5_INC_ENUM(H5F_mem_t, mem_type)) {
|
||||
for(mem_type = H5FD_MEM_SUPER; mem_type < H5FD_MEM_NTYPES; mem_type++) {
|
||||
H5MF__alloc_to_fs_type(f->shared, mem_type, alloc_size, &fsm_type);
|
||||
|
||||
if(pass_count == 0) { /* this is the first pass */
|
||||
@ -2834,7 +2834,7 @@ H5MF_settle_raw_data_fsm(H5F_t *f, hbool_t *fsm_settled)
|
||||
* those addresses are unknown. This is OK -- we will write the correct
|
||||
* values to the message at free space manager shutdown.
|
||||
*/
|
||||
for(fsm_type = H5F_MEM_PAGE_SUPER; fsm_type < H5F_MEM_PAGE_NTYPES; H5_INC_ENUM(H5F_mem_page_t, fsm_type))
|
||||
for(fsm_type = H5F_MEM_PAGE_SUPER; fsm_type < H5F_MEM_PAGE_NTYPES; fsm_type++)
|
||||
fsinfo.fs_addr[fsm_type - 1] = HADDR_UNDEF;
|
||||
fsinfo.strategy = f->shared->fs_strategy;
|
||||
fsinfo.persist = f->shared->fs_persist;
|
||||
@ -2867,7 +2867,7 @@ H5MF_settle_raw_data_fsm(H5F_t *f, hbool_t *fsm_settled)
|
||||
*/
|
||||
|
||||
/* Reinitialize fsm_visited */
|
||||
for(fsm_type = H5F_MEM_PAGE_SUPER; fsm_type < H5F_MEM_PAGE_NTYPES; H5_INC_ENUM(H5F_mem_page_t, fsm_type))
|
||||
for(fsm_type = H5F_MEM_PAGE_SUPER; fsm_type < H5F_MEM_PAGE_NTYPES; fsm_type++)
|
||||
fsm_visited[fsm_type] = FALSE;
|
||||
|
||||
for(pass_count = 0; pass_count <= 1; pass_count++) {
|
||||
@ -2878,7 +2878,7 @@ H5MF_settle_raw_data_fsm(H5F_t *f, hbool_t *fsm_settled)
|
||||
else /* no need for a second pass */
|
||||
break;
|
||||
|
||||
for(mem_type = H5FD_MEM_SUPER; mem_type < H5FD_MEM_NTYPES; H5_INC_ENUM(H5F_mem_t, mem_type)) {
|
||||
for(mem_type = H5FD_MEM_SUPER; mem_type < H5FD_MEM_NTYPES; mem_type++) {
|
||||
H5MF__alloc_to_fs_type(f->shared, mem_type, alloc_size, &fsm_type);
|
||||
|
||||
if(pass_count == 0) { /* this is the first pass */
|
||||
@ -2975,7 +2975,7 @@ H5MF_settle_raw_data_fsm(H5F_t *f, hbool_t *fsm_settled)
|
||||
} /* end for */
|
||||
|
||||
/* verify that all opened FSMs were closed */
|
||||
for(fsm_type = H5F_MEM_PAGE_SUPER; fsm_type < H5F_MEM_PAGE_NTYPES; H5_INC_ENUM(H5F_mem_page_t, fsm_type))
|
||||
for(fsm_type = H5F_MEM_PAGE_SUPER; fsm_type < H5F_MEM_PAGE_NTYPES; fsm_type++)
|
||||
HDassert(!fsm_opened[fsm_type]);
|
||||
|
||||
/* Indicate that the FSM was settled successfully */
|
||||
|
@ -169,7 +169,7 @@ H5MF_sects_debug(H5F_t *f, haddr_t fs_addr, FILE *stream, int indent, int fwidth
|
||||
HDassert(indent >= 0);
|
||||
HDassert(fwidth >= 0);
|
||||
|
||||
for(type = H5F_MEM_PAGE_DEFAULT; type < H5F_MEM_PAGE_NTYPES; H5_INC_ENUM(H5F_mem_page_t, type))
|
||||
for(type = H5F_MEM_PAGE_DEFAULT; type < H5F_MEM_PAGE_NTYPES; type++)
|
||||
if(H5F_addr_eq(f->shared->fs_addr[type], fs_addr)) {
|
||||
if(!f->shared->fs_man[type])
|
||||
if(H5MF__open_fstype(f, type) < 0)
|
||||
@ -243,7 +243,7 @@ HDfprintf(stderr, "%s: for type = H5FD_MEM_DEFAULT, eoa = %a\n", FUNC, eoa);
|
||||
if(H5F_PAGED_AGGR(f)) { /* File space paging */
|
||||
H5F_mem_page_t ptype; /* Memory type for iteration -- page fs */
|
||||
|
||||
for(ptype = H5F_MEM_PAGE_META; ptype < H5F_MEM_PAGE_NTYPES; H5_INC_ENUM(H5F_mem_page_t, ptype)) {
|
||||
for(ptype = H5F_MEM_PAGE_META; ptype < H5F_MEM_PAGE_NTYPES; ptype++) {
|
||||
/* Print header for type */
|
||||
HDfprintf(stream, "%*sFile Free Space Info for type = %u:\n", indent, "", (unsigned)ptype);
|
||||
|
||||
@ -289,7 +289,7 @@ HDfprintf(stderr, "%s: sda_addr = %a, sda_size = %Hu, end of sda = %a\n", FUNC,
|
||||
#endif /* H5MF_ALLOC_DEBUG */
|
||||
|
||||
/* Iterate over all the free space types that have managers and dump each free list's space */
|
||||
for(atype = H5FD_MEM_DEFAULT; atype < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, atype)) {
|
||||
for(atype = H5FD_MEM_DEFAULT; atype < H5FD_MEM_NTYPES; atype++) {
|
||||
/* Print header for type */
|
||||
HDfprintf(stream, "%*sFile Free Space Info for type = %u:\n", indent, "", (unsigned)atype);
|
||||
|
||||
|
@ -111,7 +111,7 @@ H5O_fsinfo_decode(H5F_t *f, H5O_t H5_ATTR_UNUSED *open_oh,
|
||||
if(NULL == (fsinfo = H5FL_CALLOC(H5O_fsinfo_t)))
|
||||
HGOTO_ERROR(H5E_RESOURCE, H5E_NOSPACE, NULL, "memory allocation failed")
|
||||
|
||||
for(ptype = H5F_MEM_PAGE_SUPER; ptype < H5F_MEM_PAGE_NTYPES; H5_INC_ENUM(H5F_mem_page_t, ptype))
|
||||
for(ptype = H5F_MEM_PAGE_SUPER; ptype < H5F_MEM_PAGE_NTYPES; ptype++)
|
||||
fsinfo->fs_addr[ptype - 1] = HADDR_UNDEF;
|
||||
|
||||
/* Version of message */
|
||||
@ -140,7 +140,7 @@ H5O_fsinfo_decode(H5F_t *f, H5O_t H5_ATTR_UNUSED *open_oh,
|
||||
fsinfo->threshold = threshold;
|
||||
if(HADDR_UNDEF == (fsinfo->eoa_pre_fsm_fsalloc = H5F_get_eoa(f, H5FD_MEM_DEFAULT)) )
|
||||
HGOTO_ERROR(H5E_FILE, H5E_CANTGET, NULL, "unable to get file size")
|
||||
for(type = H5FD_MEM_SUPER; type < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, type))
|
||||
for(type = H5FD_MEM_SUPER; type < H5FD_MEM_NTYPES; type++)
|
||||
H5F_addr_decode(f, &p, &(fsinfo->fs_addr[type-1]));
|
||||
break;
|
||||
|
||||
@ -180,7 +180,7 @@ H5O_fsinfo_decode(H5F_t *f, H5O_t H5_ATTR_UNUSED *open_oh,
|
||||
|
||||
/* Decode addresses of free space managers, if persisting */
|
||||
if(fsinfo->persist) {
|
||||
for(ptype = H5F_MEM_PAGE_SUPER; ptype < H5F_MEM_PAGE_NTYPES; H5_INC_ENUM(H5F_mem_page_t, ptype))
|
||||
for(ptype = H5F_MEM_PAGE_SUPER; ptype < H5F_MEM_PAGE_NTYPES; ptype++)
|
||||
H5F_addr_decode(f, &p, &(fsinfo->fs_addr[ptype - 1]));
|
||||
} /* end if */
|
||||
|
||||
@ -234,7 +234,7 @@ H5O_fsinfo_encode(H5F_t *f, hbool_t H5_ATTR_UNUSED disable_shared, uint8_t *p, c
|
||||
/* Store addresses of free-space managers, if persisting */
|
||||
if(fsinfo->persist) {
|
||||
/* Addresses of free-space managers */
|
||||
for(ptype = H5F_MEM_PAGE_SUPER; ptype < H5F_MEM_PAGE_NTYPES; H5_INC_ENUM(H5F_mem_page_t, ptype))
|
||||
for(ptype = H5F_MEM_PAGE_SUPER; ptype < H5F_MEM_PAGE_NTYPES; ptype++)
|
||||
H5F_addr_encode(f, &p, fsinfo->fs_addr[ptype - 1]);
|
||||
} /* end if */
|
||||
|
||||
@ -479,7 +479,7 @@ H5O__fsinfo_debug(H5F_t H5_ATTR_UNUSED *f, const void *_mesg, FILE * stream,
|
||||
"eoa_pre_fsm_fsalloc:", fsinfo->eoa_pre_fsm_fsalloc);
|
||||
|
||||
if(fsinfo->persist) {
|
||||
for(ptype = H5F_MEM_PAGE_SUPER; ptype < H5F_MEM_PAGE_NTYPES; H5_INC_ENUM(H5F_mem_page_t, ptype))
|
||||
for(ptype = H5F_MEM_PAGE_SUPER; ptype < H5F_MEM_PAGE_NTYPES; ptype++)
|
||||
HDfprintf(stream, "%*s%-*s %a\n", indent, "", fwidth,
|
||||
"Free space manager address:", fsinfo->fs_addr[ptype-1]);
|
||||
} /* end if */
|
||||
|
@ -513,13 +513,6 @@
|
||||
# define H5_POSIX_CREATE_MODE_RW 0666
|
||||
#endif
|
||||
|
||||
/*
|
||||
* A macro to portably increment enumerated types.
|
||||
*/
|
||||
#ifndef H5_INC_ENUM
|
||||
# define H5_INC_ENUM(TYPE,VAR) (VAR)=((TYPE)((VAR)+1))
|
||||
#endif
|
||||
|
||||
/* Represents an empty asynchronous request handle.
|
||||
* Used in the VOL code.
|
||||
*/
|
||||
|
@ -13,9 +13,6 @@
|
||||
// Turn off warnings about not using the return value from these functions:
|
||||
-emacro(534,HDfflush,HDgetrusage,HDgettimeofday,HDputc)
|
||||
|
||||
// Turn off warnings about converting an enum to an int
|
||||
-emacro(641,H5_INC_ENUM,H5_DEC_ENUM)
|
||||
|
||||
// Suppress message about "Expression with side effects passed to repeated parameter 1 in macro 'assert'"
|
||||
-esym(666,assert)
|
||||
|
||||
|
@ -30,11 +30,6 @@
|
||||
-esym(534, H5UC_decr)
|
||||
-esym(534, H5VM_array_fill)
|
||||
|
||||
|
||||
// Turn off warnings about "Expression-like macro not parenthesized" for
|
||||
// enumerated type increment & decrement macros:
|
||||
-esym(773, H5_INC_ENUM, H5_DEC_ENUM)
|
||||
|
||||
/* So far, the following files have been linted with these options:
|
||||
H5.c
|
||||
H5A.c
|
||||
@ -60,7 +55,7 @@
|
||||
H5FO.c
|
||||
|
||||
H5Tcommit.c
|
||||
H5Tcompound.c
|
||||
H5Tcompound.c
|
||||
|
||||
H5Tcset.c
|
||||
H5Tenum.c
|
||||
|
24
test/dsets.c
24
test/dsets.c
@ -834,8 +834,8 @@ test_compact_io(hid_t fapl)
|
||||
skipping invalid combinations.
|
||||
- Create a file, create and write a compact dataset, and verify its data
|
||||
- Verify the dataset's layout and fill message versions */
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, low)) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, high)) {
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; low++) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; high++) {
|
||||
|
||||
/* Set version bounds */
|
||||
H5E_BEGIN_TRY {
|
||||
@ -8341,7 +8341,7 @@ test_chunk_fast(const char *env_h5_driver, hid_t fapl)
|
||||
H5D_alloc_time_t alloc_time; /* Storage allocation time */
|
||||
|
||||
/* Loop over storage allocation time */
|
||||
for(alloc_time = H5D_ALLOC_TIME_EARLY; alloc_time <= H5D_ALLOC_TIME_INCR; H5_INC_ENUM(H5D_alloc_time_t, alloc_time)) {
|
||||
for(alloc_time = H5D_ALLOC_TIME_EARLY; alloc_time <= H5D_ALLOC_TIME_INCR; alloc_time++) {
|
||||
unsigned ndims; /* Current # of dims to test */
|
||||
|
||||
/* Loop over dataspace ranks to test */
|
||||
@ -8641,7 +8641,7 @@ test_reopen_chunk_fast(hid_t fapl)
|
||||
h5_fixname(FILENAME[10], fapl, filename, sizeof filename);
|
||||
|
||||
/* Loop over storage allocation time */
|
||||
for(alloc_time = H5D_ALLOC_TIME_EARLY; alloc_time <= H5D_ALLOC_TIME_INCR; H5_INC_ENUM(H5D_alloc_time_t, alloc_time)) {
|
||||
for(alloc_time = H5D_ALLOC_TIME_EARLY; alloc_time <= H5D_ALLOC_TIME_INCR; alloc_time++) {
|
||||
/* Create file */
|
||||
if((fid = H5Fcreate(filename, H5F_ACC_TRUNC, H5P_DEFAULT, fapl)) < 0) FAIL_STACK_ERROR
|
||||
|
||||
@ -8772,7 +8772,7 @@ test_chunk_fast_bug1(hid_t fapl)
|
||||
if((sid = H5Screate_simple(2, dim, max_dim)) < 0) FAIL_STACK_ERROR
|
||||
|
||||
/* Loop over storage allocation time */
|
||||
for(alloc_time = H5D_ALLOC_TIME_EARLY; alloc_time <= H5D_ALLOC_TIME_INCR; H5_INC_ENUM(H5D_alloc_time_t, alloc_time)) {
|
||||
for(alloc_time = H5D_ALLOC_TIME_EARLY; alloc_time <= H5D_ALLOC_TIME_INCR; alloc_time++) {
|
||||
/* Create file */
|
||||
if((fid = H5Fcreate(filename, H5F_ACC_TRUNC, H5P_DEFAULT, fapl)) < 0) FAIL_STACK_ERROR
|
||||
|
||||
@ -8950,7 +8950,7 @@ test_chunk_expand(hid_t fapl)
|
||||
if(TRUE != H5Zfilter_avail(H5Z_FILTER_EXPAND)) FAIL_STACK_ERROR
|
||||
|
||||
/* Loop over storage allocation time */
|
||||
for(alloc_time = H5D_ALLOC_TIME_EARLY; alloc_time <= H5D_ALLOC_TIME_INCR; H5_INC_ENUM(H5D_alloc_time_t, alloc_time)) {
|
||||
for(alloc_time = H5D_ALLOC_TIME_EARLY; alloc_time <= H5D_ALLOC_TIME_INCR; alloc_time++) {
|
||||
|
||||
/* Create file */
|
||||
if((fid = H5Fcreate(filename, H5F_ACC_TRUNC, H5P_DEFAULT, fapl)) < 0) FAIL_STACK_ERROR
|
||||
@ -9404,7 +9404,7 @@ test_fixed_array(hid_t fapl)
|
||||
#endif /* H5_HAVE_FILTER_DEFLATE */
|
||||
|
||||
/* Loop over storage allocation time */
|
||||
for(alloc_time = H5D_ALLOC_TIME_EARLY; alloc_time <= H5D_ALLOC_TIME_INCR; H5_INC_ENUM(H5D_alloc_time_t, alloc_time)) {
|
||||
for(alloc_time = H5D_ALLOC_TIME_EARLY; alloc_time <= H5D_ALLOC_TIME_INCR; alloc_time++) {
|
||||
/* Create file */
|
||||
if((fid = H5Fcreate(filename, H5F_ACC_TRUNC, H5P_DEFAULT, fapl)) < 0) FAIL_STACK_ERROR
|
||||
|
||||
@ -9805,7 +9805,7 @@ test_single_chunk(hid_t fapl)
|
||||
#endif /* H5_HAVE_FILTER_DEFLATE */
|
||||
|
||||
/* Loop over storage allocation time */
|
||||
for(alloc_time = H5D_ALLOC_TIME_EARLY; alloc_time <= H5D_ALLOC_TIME_INCR; H5_INC_ENUM(H5D_alloc_time_t, alloc_time)) {
|
||||
for(alloc_time = H5D_ALLOC_TIME_EARLY; alloc_time <= H5D_ALLOC_TIME_INCR; alloc_time++) {
|
||||
/* Create file */
|
||||
if((fid = H5Fcreate(filename, H5F_ACC_TRUNC, H5P_DEFAULT, fapl)) < 0) FAIL_STACK_ERROR
|
||||
|
||||
@ -10335,8 +10335,8 @@ test_zero_dim_dset(hid_t fapl)
|
||||
/* Loop through all the combinations of low/high library format bounds,
|
||||
skipping invalid combination, and verify support for reading a 1D
|
||||
chunked dataset with dimension size = 0 */
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, low)) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, high)) {
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; low++) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; high++) {
|
||||
|
||||
/* Set version bounds before opening the file */
|
||||
H5E_BEGIN_TRY {
|
||||
@ -12964,8 +12964,8 @@ test_versionbounds(void)
|
||||
/* Create a source file and a dataset in it. Create a virtual file and
|
||||
virtual dataset. Creation of virtual dataset should only succeed in
|
||||
H5F_LIBVER_V110 */
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, low)) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, high)) {
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; low++) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; high++) {
|
||||
|
||||
/* Set version bounds, skip for invalid low/high combination */
|
||||
H5E_BEGIN_TRY {
|
||||
|
@ -6858,8 +6858,8 @@ test_delete_obj_named(hid_t fapl)
|
||||
|
||||
/* Loop through all valid the combinations of low/high library format bounds,
|
||||
to test delete objects that use named datatypes through different file IDs */
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, low)) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, high)) {
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; low++) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; high++) {
|
||||
|
||||
/* Skip invalid low/high combination */
|
||||
if ((high == H5F_LIBVER_EARLIEST) || (low > high))
|
||||
@ -6959,8 +6959,8 @@ test_delete_obj_named_fileid(hid_t fapl)
|
||||
h5_fixname(FILENAME[9], fapl2, filename2, sizeof filename2);
|
||||
|
||||
/* Loop through all the combinations of low/high library format bounds */
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, low)) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, high)) {
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; low++) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; high++) {
|
||||
|
||||
/* Skip invalid low/high combination */
|
||||
if ((high == H5F_LIBVER_EARLIEST) || (low > high))
|
||||
|
@ -2471,7 +2471,7 @@ main(void)
|
||||
init_cparam(&cparam);
|
||||
|
||||
/* Iterate over the testing parameters */
|
||||
for(curr_test = EARRAY_TEST_NORMAL; curr_test < EARRAY_TEST_NTESTS; H5_INC_ENUM(earray_test_type_t, curr_test)) {
|
||||
for(curr_test = EARRAY_TEST_NORMAL; curr_test < EARRAY_TEST_NTESTS; curr_test++) {
|
||||
|
||||
/* Initialize the testing parameters */
|
||||
init_tparam(&tparam, &cparam);
|
||||
@ -2503,7 +2503,7 @@ main(void)
|
||||
nerrors += test_delete_open(fapl, &cparam, &tparam);
|
||||
|
||||
/* Iterate over the type of capacity tests */
|
||||
for(curr_iter = EARRAY_ITER_FW; curr_iter < EARRAY_ITER_NITERS; H5_INC_ENUM(earray_iter_type_t, curr_iter)) {
|
||||
for(curr_iter = EARRAY_ITER_FW; curr_iter < EARRAY_ITER_NITERS; curr_iter++) {
|
||||
hsize_t sblk; /* Super block index */
|
||||
hsize_t dblk; /* Data block index */
|
||||
hsize_t nelmts; /* # of elements to test */
|
||||
|
@ -187,8 +187,8 @@ main(void)
|
||||
-1 };
|
||||
|
||||
/* Loop through all the combinations of low/high version bounds */
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, low)) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, high)) {
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; low++) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; high++) {
|
||||
char msg[80]; /* Message for file version bounds */
|
||||
const char *low_string; /* The low bound string */
|
||||
const char *high_string; /* The high bound string */
|
||||
|
@ -1687,7 +1687,7 @@ main(void)
|
||||
}
|
||||
|
||||
/* Iterate over the testing parameters */
|
||||
for(curr_test = FARRAY_TEST_NORMAL; curr_test < FARRAY_TEST_NTESTS; H5_INC_ENUM(farray_test_type_t, curr_test)) {
|
||||
for(curr_test = FARRAY_TEST_NORMAL; curr_test < FARRAY_TEST_NTESTS; curr_test++) {
|
||||
|
||||
/* Initialize the testing parameters */
|
||||
HDmemset(&tparam, 0, sizeof(tparam));
|
||||
@ -1723,7 +1723,7 @@ main(void)
|
||||
nerrors += test_delete_open(fapl, &cparam, &tparam);
|
||||
|
||||
/* Iterate over the type of capacity tests */
|
||||
for(curr_iter = FARRAY_ITER_FW; curr_iter < FARRAY_ITER_NITERS; H5_INC_ENUM(farray_iter_type_t, curr_iter)) {
|
||||
for(curr_iter = FARRAY_ITER_FW; curr_iter < FARRAY_ITER_NITERS; curr_iter++) {
|
||||
|
||||
/* Set appropriate parameters for each type of iteration */
|
||||
switch(curr_iter) {
|
||||
|
12
test/fheap.c
12
test/fheap.c
@ -16458,7 +16458,7 @@ main(void)
|
||||
}
|
||||
|
||||
/* Iterate over the testing parameters */
|
||||
for(curr_test = FHEAP_TEST_NORMAL; curr_test < FHEAP_TEST_NTESTS; H5_INC_ENUM(fheap_test_type_t, curr_test)) {
|
||||
for(curr_test = FHEAP_TEST_NORMAL; curr_test < FHEAP_TEST_NTESTS; curr_test++) {
|
||||
/* Clear the testing parameters */
|
||||
HDmemset(&tparam, 0, sizeof(fheap_test_param_t));
|
||||
tparam.actual_id_len = HEAP_ID_LEN;
|
||||
@ -16500,7 +16500,7 @@ main(void)
|
||||
fheap_test_fill_t fill; /* Size of objects to fill heap blocks with */
|
||||
|
||||
/* Filling with different sized objects */
|
||||
for(fill = FHEAP_TEST_FILL_LARGE; fill < FHEAP_TEST_FILL_N; H5_INC_ENUM(fheap_test_fill_t, fill)) {
|
||||
for(fill = FHEAP_TEST_FILL_LARGE; fill < FHEAP_TEST_FILL_N; fill++) {
|
||||
tparam.fill = fill;
|
||||
|
||||
/* Set appropriate testing parameters for each test */
|
||||
@ -16593,9 +16593,9 @@ main(void)
|
||||
fheap_test_del_drain_t drain_half; /* Deletion draining */
|
||||
|
||||
/* More complex removal patterns */
|
||||
for(del_dir = FHEAP_DEL_FORWARD; del_dir < FHEAP_DEL_NDIRS; H5_INC_ENUM(fheap_test_del_dir_t, del_dir)) {
|
||||
for(del_dir = FHEAP_DEL_FORWARD; del_dir < FHEAP_DEL_NDIRS; del_dir++) {
|
||||
tparam.del_dir = del_dir;
|
||||
for(drain_half = FHEAP_DEL_DRAIN_ALL; drain_half < FHEAP_DEL_DRAIN_N; H5_INC_ENUM(fheap_test_del_drain_t, drain_half)) {
|
||||
for(drain_half = FHEAP_DEL_DRAIN_ALL; drain_half < FHEAP_DEL_DRAIN_N; drain_half++) {
|
||||
tparam.drain_half = drain_half;
|
||||
/* Don't need to test deletion directions when deleting entire heap */
|
||||
if(tparam.del_dir == FHEAP_DEL_HEAP && tparam.drain_half > FHEAP_DEL_DRAIN_ALL)
|
||||
@ -16703,7 +16703,7 @@ main(void)
|
||||
} /* end switch */
|
||||
|
||||
/* Try several different methods of deleting objects */
|
||||
for(del_dir = FHEAP_DEL_FORWARD; del_dir < FHEAP_DEL_NDIRS; H5_INC_ENUM(fheap_test_del_dir_t, del_dir)) {
|
||||
for(del_dir = FHEAP_DEL_FORWARD; del_dir < FHEAP_DEL_NDIRS; del_dir++) {
|
||||
tparam.del_dir = del_dir;
|
||||
|
||||
/* Test 'huge' object insert & delete */
|
||||
@ -16731,7 +16731,7 @@ main(void)
|
||||
{
|
||||
fheap_test_del_dir_t del_dir; /* Deletion direction */
|
||||
|
||||
for(del_dir = FHEAP_DEL_FORWARD; del_dir < FHEAP_DEL_NDIRS; H5_INC_ENUM(fheap_test_del_dir_t, del_dir)) {
|
||||
for(del_dir = FHEAP_DEL_FORWARD; del_dir < FHEAP_DEL_NDIRS; del_dir++) {
|
||||
tparam.del_dir = del_dir;
|
||||
|
||||
/* Controlled tests */
|
||||
|
@ -29,7 +29,6 @@ const char *FILENAMES[] = {
|
||||
#define NUM_ELMTS 100
|
||||
#define FALSE 0
|
||||
#define TRUE 1
|
||||
#define INC_ENUM(TYPE,VAR) (VAR)=((TYPE)((VAR)+1))
|
||||
|
||||
/*
|
||||
* Compile and run this program in the trunk to generate
|
||||
@ -58,7 +57,7 @@ int main(void)
|
||||
unsigned fs_persist; /* Persisting free-space or not */
|
||||
|
||||
j = 0;
|
||||
for(fs_strategy = H5F_FSPACE_STRATEGY_FSM_AGGR; fs_strategy < H5F_FSPACE_STRATEGY_NTYPES; INC_ENUM(H5F_fspace_strategy_t, fs_strategy)) {
|
||||
for(fs_strategy = H5F_FSPACE_STRATEGY_FSM_AGGR; fs_strategy < H5F_FSPACE_STRATEGY_NTYPES; fs_strategy++) {
|
||||
for(fs_persist = FALSE; fs_persist <= TRUE; fs_persist++) {
|
||||
|
||||
if(fs_persist && fs_strategy >= H5F_FSPACE_STRATEGY_AGGR)
|
||||
|
@ -236,7 +236,7 @@ h5_delete_test_file(const char *base_name, hid_t fapl)
|
||||
|
||||
HDassert(HDstrlen(multi_letters) == H5FD_MEM_NTYPES);
|
||||
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t,mt)) {
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; mt++) {
|
||||
HDsnprintf(sub_filename, sizeof(sub_filename), "%s-%c.h5", filename, multi_letters[mt]);
|
||||
HDremove(sub_filename);
|
||||
}
|
||||
@ -989,7 +989,7 @@ h5_get_vfd_fapl(hid_t fapl)
|
||||
HDmemset(memb_addr, 0, sizeof(memb_addr));
|
||||
|
||||
HDassert(HDstrlen(multi_letters) == H5FD_MEM_NTYPES);
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, mt)) {
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; mt++) {
|
||||
memb_fapl[mt] = H5P_DEFAULT;
|
||||
sv[mt] = (char *)HDmalloc(H5TEST_MULTI_FILENAME_LEN);
|
||||
HDassert(sv[mt]);
|
||||
@ -1001,7 +1001,7 @@ h5_get_vfd_fapl(hid_t fapl)
|
||||
if(H5Pset_fapl_multi(fapl, memb_map, memb_fapl, memb_name, memb_addr, FALSE) < 0)
|
||||
goto error;
|
||||
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, mt))
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; mt++)
|
||||
HDfree(sv[mt]);
|
||||
} else if(!HDstrcmp(tok, "family")) {
|
||||
/* Family of files, each 1MB and using the default driver */
|
||||
@ -1397,7 +1397,7 @@ h5_get_file_size(const char *filename, hid_t fapl)
|
||||
h5_stat_size_t tot_size = 0;
|
||||
|
||||
HDassert(HDstrlen(multi_letters) == H5FD_MEM_NTYPES);
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, mt)) {
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; mt++) {
|
||||
/* Create the filename to query */
|
||||
HDsnprintf(temp, sizeof temp, "%s-%c.h5", filename, multi_letters[mt]);
|
||||
|
||||
|
33
test/links.c
33
test/links.c
@ -3310,7 +3310,7 @@ external_set_elink_fapl1(hid_t fapl, hbool_t new_format)
|
||||
HDmemset(memb_addr, 0, sizeof memb_addr);
|
||||
HDmemset(sv, 0, sizeof sv);
|
||||
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, mt)) {
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; mt++) {
|
||||
memb_map[mt] = H5FD_MEM_SUPER;
|
||||
memb_fapl[mt] = H5P_DEFAULT;
|
||||
} /* end for */
|
||||
@ -10912,9 +10912,9 @@ delete_by_idx(hid_t fapl)
|
||||
herr_t ret; /* Generic return value */
|
||||
|
||||
/* Loop over operating on different indices on link fields */
|
||||
for(idx_type = H5_INDEX_NAME; idx_type <= H5_INDEX_CRT_ORDER; H5_INC_ENUM(H5_index_t, idx_type)) {
|
||||
for(idx_type = H5_INDEX_NAME; idx_type <= H5_INDEX_CRT_ORDER; idx_type++) {
|
||||
/* Loop over operating in different orders */
|
||||
for(order = H5_ITER_INC; order <=H5_ITER_DEC; H5_INC_ENUM(H5_iter_order_t, order)) {
|
||||
for(order = H5_ITER_INC; order <=H5_ITER_DEC; order++) {
|
||||
/* Loop over using index for creation order value */
|
||||
for(use_index = FALSE; use_index <= TRUE; use_index++) {
|
||||
/* Print appropriate test message */
|
||||
@ -11224,7 +11224,7 @@ delete_by_idx_old(hid_t fapl)
|
||||
herr_t ret; /* Generic return value */
|
||||
|
||||
/* Loop over operating in different orders */
|
||||
for(order = H5_ITER_INC; order <=H5_ITER_DEC; H5_INC_ENUM(H5_iter_order_t, order)) {
|
||||
for(order = H5_ITER_INC; order <=H5_ITER_DEC; order++) {
|
||||
/* Print test banner */
|
||||
if(order == H5_ITER_INC)
|
||||
TESTING("deleting links by index in increasing order in old-style group")
|
||||
@ -11721,9 +11721,9 @@ link_iterate(hid_t fapl)
|
||||
iter_info.visited = visited;
|
||||
|
||||
/* Loop over operating on different indices on link fields */
|
||||
for(idx_type = H5_INDEX_NAME; idx_type <= H5_INDEX_CRT_ORDER; H5_INC_ENUM(H5_index_t, idx_type)) {
|
||||
for(idx_type = H5_INDEX_NAME; idx_type <= H5_INDEX_CRT_ORDER; idx_type++) {
|
||||
/* Loop over operating in different orders */
|
||||
for(order = H5_ITER_INC; order <=H5_ITER_NATIVE; H5_INC_ENUM(H5_iter_order_t, order)) {
|
||||
for(order = H5_ITER_INC; order <=H5_ITER_NATIVE; order++) {
|
||||
/* Loop over using index for creation order value */
|
||||
for(use_index = FALSE; use_index <= TRUE; use_index++) {
|
||||
/* Print appropriate test message */
|
||||
@ -12147,7 +12147,7 @@ link_iterate_old(hid_t fapl)
|
||||
iter_info.visited = visited;
|
||||
|
||||
/* Loop over operating in different orders */
|
||||
for(order = H5_ITER_INC; order <=H5_ITER_NATIVE; H5_INC_ENUM(H5_iter_order_t, order)) {
|
||||
for(order = H5_ITER_INC; order <=H5_ITER_NATIVE; order++) {
|
||||
/* Print appropriate test message */
|
||||
if(order == H5_ITER_INC) {
|
||||
TESTING("iterating over links by name index in increasing order in old-style group")
|
||||
@ -12368,9 +12368,9 @@ open_by_idx(hid_t fapl)
|
||||
if((mount_file_id = H5Fcreate(filename, H5F_ACC_TRUNC, H5P_DEFAULT, fapl)) < 0) TEST_ERROR
|
||||
|
||||
/* Loop over operating on different indices on link fields */
|
||||
for(idx_type = H5_INDEX_NAME; idx_type <= H5_INDEX_CRT_ORDER; H5_INC_ENUM(H5_index_t, idx_type)) {
|
||||
for(idx_type = H5_INDEX_NAME; idx_type <= H5_INDEX_CRT_ORDER; idx_type++) {
|
||||
/* Loop over operating in different orders */
|
||||
for(order = H5_ITER_INC; order <= H5_ITER_NATIVE; H5_INC_ENUM(H5_iter_order_t, order)) {
|
||||
for(order = H5_ITER_INC; order <= H5_ITER_NATIVE; order++) {
|
||||
/* Loop over using index for creation order value */
|
||||
for(use_index = FALSE; use_index <= TRUE; use_index++) {
|
||||
/* Print appropriate test message */
|
||||
@ -12576,7 +12576,7 @@ open_by_idx_old(hid_t fapl)
|
||||
if((mount_file_id = H5Fcreate(filename, H5F_ACC_TRUNC, H5P_DEFAULT, fapl)) < 0) TEST_ERROR
|
||||
|
||||
/* Loop over operating in different orders */
|
||||
for(order = H5_ITER_INC; order <=H5_ITER_NATIVE; H5_INC_ENUM(H5_iter_order_t, order)) {
|
||||
for(order = H5_ITER_INC; order <=H5_ITER_NATIVE; order++) {
|
||||
/* Print appropriate test message */
|
||||
if(order == H5_ITER_INC) {
|
||||
TESTING("open object by name index in increasing order in old-style group")
|
||||
@ -12786,9 +12786,9 @@ object_info(hid_t fapl)
|
||||
if((space_id = H5Screate(H5S_SCALAR)) < 0) TEST_ERROR
|
||||
|
||||
/* Loop over operating on different indices on link fields */
|
||||
for(idx_type = H5_INDEX_NAME; idx_type <= H5_INDEX_CRT_ORDER; H5_INC_ENUM(H5_index_t, idx_type)) {
|
||||
for(idx_type = H5_INDEX_NAME; idx_type <= H5_INDEX_CRT_ORDER; idx_type++) {
|
||||
/* Loop over operating in different orders */
|
||||
for(order = H5_ITER_INC; order <=H5_ITER_NATIVE; H5_INC_ENUM(H5_iter_order_t, order)) {
|
||||
for(order = H5_ITER_INC; order <=H5_ITER_NATIVE; order++) {
|
||||
/* Loop over using index for creation order value */
|
||||
for(use_index = FALSE; use_index <= TRUE; use_index++) {
|
||||
/* Print appropriate test message */
|
||||
@ -13018,7 +13018,8 @@ object_info_old(hid_t fapl)
|
||||
if((space_id = H5Screate(H5S_SCALAR)) < 0) TEST_ERROR
|
||||
|
||||
/* Loop over operating in different orders */
|
||||
for(order = H5_ITER_INC; order <=H5_ITER_NATIVE; H5_INC_ENUM(H5_iter_order_t, order)) {
|
||||
for(order = H5_ITER_INC; order <= H5_ITER_NATIVE; order++) {
|
||||
|
||||
/* Print appropriate test message */
|
||||
if(order == H5_ITER_INC) {
|
||||
TESTING("query object info by name index in increasing order in old-style group")
|
||||
@ -13165,9 +13166,9 @@ group_info(hid_t fapl)
|
||||
if(H5Pget_link_phase_change(gcpl_id, &max_compact, &min_dense) < 0) TEST_ERROR
|
||||
|
||||
/* Loop over operating on different indices on link fields */
|
||||
for(idx_type = H5_INDEX_NAME; idx_type <= H5_INDEX_CRT_ORDER; H5_INC_ENUM(H5_index_t, idx_type)) {
|
||||
for(idx_type = H5_INDEX_NAME; idx_type <= H5_INDEX_CRT_ORDER; idx_type++) {
|
||||
/* Loop over operating in different orders */
|
||||
for(order = H5_ITER_INC; order <=H5_ITER_NATIVE; H5_INC_ENUM(H5_iter_order_t, order)) {
|
||||
for(order = H5_ITER_INC; order <=H5_ITER_NATIVE; order++) {
|
||||
/* Loop over using index for creation order value */
|
||||
for(use_index = FALSE; use_index <= TRUE; use_index++) {
|
||||
/* Print appropriate test message */
|
||||
@ -13557,7 +13558,7 @@ group_info_old(hid_t fapl)
|
||||
unsigned u, v; /* Local index variables */
|
||||
|
||||
/* Loop over operating in different orders */
|
||||
for(order = H5_ITER_INC; order <=H5_ITER_NATIVE; H5_INC_ENUM(H5_iter_order_t, order)) {
|
||||
for(order = H5_ITER_INC; order <=H5_ITER_NATIVE; order++) {
|
||||
if(order == H5_ITER_INC) {
|
||||
TESTING("query group info by name index in increasing order in old-style group")
|
||||
} /* end if */
|
||||
|
20
test/mf.c
20
test/mf.c
@ -6005,7 +6005,7 @@ test_mf_bug1(const char *env_h5_drvr, hid_t fapl)
|
||||
|
||||
/* Populate memb_fapl_arr, patch memb_addr so member file addresses
|
||||
* are aligned */
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, mt)) {
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; mt++) {
|
||||
memb_fapl_arr[mt] = memb_fapl;
|
||||
memb_addr[mt] = ((memb_addr[mt] + align - 1) / align) * align;
|
||||
} /* end for */
|
||||
@ -6015,7 +6015,7 @@ test_mf_bug1(const char *env_h5_drvr, hid_t fapl)
|
||||
TEST_ERROR
|
||||
|
||||
/* Free memb_name */
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, mt))
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; mt++)
|
||||
free(memb_name[mt]);
|
||||
} /* end else */
|
||||
|
||||
@ -6378,7 +6378,7 @@ error:
|
||||
HDmemset(memb_name, 0, sizeof memb_name); \
|
||||
HDmemset(memb_addr, 0, sizeof memb_addr); \
|
||||
HDmemset(sv, 0, sizeof sv); \
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, mt)) { \
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; mt++) { \
|
||||
memb_map[mt] = H5FD_MEM_SUPER; \
|
||||
memb_fapl[mt] = H5P_DEFAULT; \
|
||||
} \
|
||||
@ -7128,7 +7128,7 @@ test_mf_strat_thres_persist(const char *env_h5_drvr, hid_t fapl, hbool_t new_for
|
||||
for(fs_threshold = 0; fs_threshold <= TEST_THRESHOLD10; fs_threshold++) {
|
||||
|
||||
/* Testing for H5F_FSPACE_STRATEGY_FSM_AGGR and H5F_FSPACE_STRATEGY_PAGE strategies only */
|
||||
for(fs_type = H5F_FSPACE_STRATEGY_FSM_AGGR; fs_type < H5F_FSPACE_STRATEGY_AGGR; H5_INC_ENUM(H5F_fspace_strategy_t, fs_type)) {
|
||||
for(fs_type = H5F_FSPACE_STRATEGY_FSM_AGGR; fs_type < H5F_FSPACE_STRATEGY_AGGR; fs_type++) {
|
||||
|
||||
if(!contig_addr_vfd && (fs_persist || fs_type == H5F_FSPACE_STRATEGY_PAGE))
|
||||
continue;
|
||||
@ -7296,7 +7296,7 @@ test_mf_strat_thres_gone(const char *env_h5_drvr, hid_t fapl, hbool_t new_format
|
||||
/* Test with TRUE or FALSE for persisting free-space */
|
||||
for(fs_persist = FALSE; fs_persist <= TRUE; fs_persist++) {
|
||||
/* Testing for H5F_FSPACE_STRATEGY_FSM_AGGR and H5F_FSPACE_STRATEGY_PAGE strategies only */
|
||||
for(fs_type = H5F_FSPACE_STRATEGY_FSM_AGGR; fs_type < H5F_FSPACE_STRATEGY_AGGR; H5_INC_ENUM(H5F_fspace_strategy_t, fs_type)) {
|
||||
for(fs_type = H5F_FSPACE_STRATEGY_FSM_AGGR; fs_type < H5F_FSPACE_STRATEGY_AGGR; fs_type++) {
|
||||
|
||||
/* Skip for multi/split driver: persisting free-space or paged aggregation strategy */
|
||||
if(!contig_addr_vfd && (fs_persist || fs_type == H5F_FSPACE_STRATEGY_PAGE))
|
||||
@ -7551,7 +7551,7 @@ set_multi_split(hid_t fapl, hsize_t pagesize, hbool_t multi, hbool_t split)
|
||||
memb_addr[H5FD_MEM_DRAW] = ((memb_addr[H5FD_MEM_DRAW] + pagesize - 1) / pagesize) * pagesize;
|
||||
} else {
|
||||
/* Set memb_addr aligned */
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, mt))
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; mt++)
|
||||
memb_addr[mt] = ((memb_addr[mt] + pagesize - 1) / pagesize) * pagesize;
|
||||
} /* end else */
|
||||
|
||||
@ -7560,7 +7560,7 @@ set_multi_split(hid_t fapl, hsize_t pagesize, hbool_t multi, hbool_t split)
|
||||
TEST_ERROR
|
||||
|
||||
/* Free memb_name */
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, mt))
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; mt++)
|
||||
free(memb_name[mt]);
|
||||
|
||||
return 0;
|
||||
@ -8616,7 +8616,7 @@ test_page_alignment(const char *env_h5_drvr, hid_t fapl)
|
||||
|
||||
/* Populate memb_fapl_arr */
|
||||
/* Set memb_addr aligned */
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, mt)) {
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; mt++) {
|
||||
memb_fapl_arr[mt] = memb_fapl;
|
||||
memb_addr[mt] = ((memb_addr[mt] + TBLOCK_SIZE4096 - 1) / TBLOCK_SIZE4096) * TBLOCK_SIZE4096;
|
||||
}
|
||||
@ -8628,7 +8628,7 @@ test_page_alignment(const char *env_h5_drvr, hid_t fapl)
|
||||
} /* end else */
|
||||
|
||||
/* Free memb_name */
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, mt))
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; mt++)
|
||||
free(memb_name[mt]);
|
||||
|
||||
/* Close memb_fapl */
|
||||
@ -8875,7 +8875,7 @@ main(void)
|
||||
nerrors += test_mf_aggr_absorb(env_h5_drvr, fapl);
|
||||
|
||||
/* For old library format--tests for alignment */
|
||||
for(curr_test = TEST_NORMAL; curr_test < TEST_NTESTS; H5_INC_ENUM(test_type_t, curr_test)) {
|
||||
for(curr_test = TEST_NORMAL; curr_test < TEST_NTESTS; curr_test++) {
|
||||
|
||||
switch(curr_test) {
|
||||
case TEST_NORMAL: /* set alignment = 1024 */
|
||||
|
@ -2187,8 +2187,8 @@ test_copy_dataset_versionbounds(hid_t fcpl_src, hid_t fapl_src)
|
||||
/* Loop through all the combinations of low/high library format bounds,
|
||||
skipping invalid combinations. Create a destination file and copy the
|
||||
source dataset to it, then verify */
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, low)) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, high)) {
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; low++) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; high++) {
|
||||
|
||||
/* Set version bounds */
|
||||
H5E_BEGIN_TRY {
|
||||
|
@ -1624,8 +1624,8 @@ main(void)
|
||||
api_ctx_pushed = TRUE;
|
||||
|
||||
/* Loop through all the combinations of low/high library format bounds */
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, low)) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, high)) {
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; low++) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; high++) {
|
||||
const char *low_string; /* Message for library version low bound */
|
||||
const char *high_string; /* Message for library version high bound */
|
||||
char msg[80]; /* Message for file format version */
|
||||
|
@ -336,7 +336,7 @@ set_multi_split(const char *env_h5_drvr, hid_t fapl, hsize_t pagesize)
|
||||
memb_addr[H5FD_MEM_DRAW] = ((memb_addr[H5FD_MEM_DRAW] + pagesize - 1) / pagesize) * pagesize;
|
||||
} else {
|
||||
/* Set memb_addr aligned */
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, mt))
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; mt++)
|
||||
memb_addr[mt] = ((memb_addr[mt] + pagesize - 1) / pagesize) * pagesize;
|
||||
} /* end else */
|
||||
|
||||
@ -345,7 +345,7 @@ set_multi_split(const char *env_h5_drvr, hid_t fapl, hsize_t pagesize)
|
||||
TEST_ERROR
|
||||
|
||||
/* Free memb_name */
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, mt))
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; mt++)
|
||||
free(memb_name[mt]);
|
||||
|
||||
} /* end if */
|
||||
|
@ -358,7 +358,7 @@ static int do_ranks( hid_t fapl, hbool_t new_format )
|
||||
|
||||
/* Iterate over different index types, but only if using the new format
|
||||
*/
|
||||
for(index_type = RANK4_INDEX_BTREE; index_type < RANK4_NINDICES; H5_INC_ENUM(rank4_index_t, index_type)) {
|
||||
for(index_type = RANK4_INDEX_BTREE; index_type < RANK4_NINDICES; index_type++) {
|
||||
/* Standard test */
|
||||
if(test_random_rank4(fapl, dcpl, do_fillvalue, disable_edge_filters, FALSE, index_type) < 0) {
|
||||
DO_RANKS_PRINT_CONFIG("Randomized rank 4")
|
||||
@ -433,8 +433,8 @@ static int do_layouts( hid_t fapl )
|
||||
|
||||
TESTING("storage layout use - tested with all low/high library format bounds");
|
||||
/* Loop through all the combinations of low/high library format bounds */
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, low)) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, high)) {
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; low++) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; high++) {
|
||||
|
||||
/* Copy plist to use locally to avoid modifying the original */
|
||||
new_fapl = H5Pcopy(fapl);
|
||||
|
12
test/tattr.c
12
test/tattr.c
@ -6272,9 +6272,9 @@ test_attr_delete_by_idx(hbool_t new_format, hid_t fcpl, hid_t fapl)
|
||||
CHECK(ret, FAIL, "H5Pget_attr_phase_change");
|
||||
|
||||
/* Loop over operating on different indices on link fields */
|
||||
for(idx_type = H5_INDEX_NAME; idx_type <= H5_INDEX_CRT_ORDER; H5_INC_ENUM(H5_index_t, idx_type)) {
|
||||
for(idx_type = H5_INDEX_NAME; idx_type <= H5_INDEX_CRT_ORDER; idx_type++) {
|
||||
/* Loop over operating in different orders */
|
||||
for(order = H5_ITER_INC; order <= H5_ITER_DEC; H5_INC_ENUM(H5_iter_order_t, order)) {
|
||||
for(order = H5_ITER_INC; order <= H5_ITER_DEC; order++) {
|
||||
/* Loop over using index for creation order value */
|
||||
for(use_index = FALSE; use_index <= TRUE; use_index++) {
|
||||
/* Print appropriate test message */
|
||||
@ -7226,9 +7226,9 @@ test_attr_iterate2(hbool_t new_format, hid_t fcpl, hid_t fapl)
|
||||
iter_info.visited = visited;
|
||||
|
||||
/* Loop over operating on different indices on link fields */
|
||||
for(idx_type = H5_INDEX_NAME; idx_type <= H5_INDEX_CRT_ORDER; H5_INC_ENUM(H5_index_t, idx_type)) {
|
||||
for(idx_type = H5_INDEX_NAME; idx_type <= H5_INDEX_CRT_ORDER; idx_type++) {
|
||||
/* Loop over operating in different orders */
|
||||
for(order = H5_ITER_INC; order <= H5_ITER_DEC; H5_INC_ENUM(H5_iter_order_t, order)) {
|
||||
for(order = H5_ITER_INC; order <= H5_ITER_DEC; order++) {
|
||||
/* Loop over using index for creation order value */
|
||||
for(use_index = FALSE; use_index <= TRUE; use_index++) {
|
||||
/* Print appropriate test message */
|
||||
@ -7586,9 +7586,9 @@ test_attr_open_by_idx(hbool_t new_format, hid_t fcpl, hid_t fapl)
|
||||
CHECK(ret, FAIL, "H5Pget_attr_phase_change");
|
||||
|
||||
/* Loop over operating on different indices on link fields */
|
||||
for(idx_type = H5_INDEX_NAME; idx_type <= H5_INDEX_CRT_ORDER; H5_INC_ENUM(H5_index_t, idx_type)) {
|
||||
for(idx_type = H5_INDEX_NAME; idx_type <= H5_INDEX_CRT_ORDER; idx_type++) {
|
||||
/* Loop over operating in different orders */
|
||||
for(order = H5_ITER_INC; order <= H5_ITER_DEC; H5_INC_ENUM(H5_iter_order_t, order)) {
|
||||
for(order = H5_ITER_INC; order <= H5_ITER_DEC; order++) {
|
||||
/* Loop over using index for creation order value */
|
||||
for(use_index = FALSE; use_index <= TRUE; use_index++) {
|
||||
/* Print appropriate test message */
|
||||
|
38
test/tfile.c
38
test/tfile.c
@ -4083,7 +4083,7 @@ test_filespace_info(const char *env_h5_drvr)
|
||||
for(fs_threshold = 0; fs_threshold <= TEST_THRESHOLD10; fs_threshold++) {
|
||||
|
||||
/* Test with 4 file space strategies */
|
||||
for(fs_strategy = H5F_FSPACE_STRATEGY_FSM_AGGR; fs_strategy < H5F_FSPACE_STRATEGY_NTYPES; H5_INC_ENUM(H5F_fspace_strategy_t, fs_strategy)) {
|
||||
for(fs_strategy = H5F_FSPACE_STRATEGY_FSM_AGGR; fs_strategy < H5F_FSPACE_STRATEGY_NTYPES; fs_strategy++) {
|
||||
|
||||
if(!contig_addr_vfd && (fs_strategy == H5F_FSPACE_STRATEGY_PAGE || fs_persist))
|
||||
continue;
|
||||
@ -4231,7 +4231,7 @@ set_multi_split(hid_t fapl, hsize_t pagesize, hbool_t multi, hbool_t split)
|
||||
memb_addr[H5FD_MEM_DRAW] = ((memb_addr[H5FD_MEM_DRAW] + pagesize - 1) / pagesize) * pagesize;
|
||||
} else {
|
||||
/* Set memb_addr aligned */
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, mt))
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; mt++)
|
||||
memb_addr[mt] = ((memb_addr[mt] + pagesize - 1) / pagesize) * pagesize;
|
||||
} /* end else */
|
||||
|
||||
@ -4240,7 +4240,7 @@ set_multi_split(hid_t fapl, hsize_t pagesize, hbool_t multi, hbool_t split)
|
||||
TEST_ERROR
|
||||
|
||||
/* Free memb_name */
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, mt))
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; mt++)
|
||||
free(memb_name[mt]);
|
||||
|
||||
return 0;
|
||||
@ -4607,7 +4607,7 @@ test_sects_freespace(const char *env_h5_drvr, hbool_t new_format)
|
||||
if(multi_vfd) {
|
||||
hssize_t ntmp;
|
||||
|
||||
for(type = H5FD_MEM_SUPER; type < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t, type)) {
|
||||
for(type = H5FD_MEM_SUPER; type < H5FD_MEM_NTYPES; type++) {
|
||||
if(type == H5FD_MEM_DRAW || type == H5FD_MEM_GHEAP)
|
||||
continue;
|
||||
/* Get the # of free-space sections in the file for metadata */
|
||||
@ -5348,7 +5348,7 @@ test_libver_bounds_open(void)
|
||||
/* Opening VERBFNAME in these combination should succeed.
|
||||
For each low bound, verify that it is upgraded properly */
|
||||
high = H5F_LIBVER_LATEST;
|
||||
for (low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, low))
|
||||
for (low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; low++)
|
||||
{
|
||||
H5F_libver_t new_low = H5F_LIBVER_EARLIEST;
|
||||
|
||||
@ -5515,8 +5515,8 @@ test_libver_bounds_low_high(void)
|
||||
CHECK(fapl, H5I_INVALID_HID, "H5Pcreate");
|
||||
|
||||
/* Loop through all the combinations of low/high version bounds */
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, low))
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, high)) {
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; low++)
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; high++) {
|
||||
|
||||
H5E_BEGIN_TRY {
|
||||
/* Set the low/high version bounds */
|
||||
@ -5918,8 +5918,8 @@ test_libver_bounds_super_open(hid_t fapl, hid_t fcpl, htri_t is_swmr, htri_t non
|
||||
CHECK(new_fapl, FAIL, "H5Pcreate");
|
||||
|
||||
/* Loop through all the combinations of low/high bounds in new_fapl */
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, low)) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, high)) {
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; low++) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; high++) {
|
||||
H5E_BEGIN_TRY {
|
||||
ret = H5Pset_libver_bounds(new_fapl, low, high);
|
||||
} H5E_END_TRY;
|
||||
@ -6094,8 +6094,8 @@ test_libver_bounds_obj(hid_t fapl)
|
||||
/* Loop through all the combinations of low/high bounds in new_fapl */
|
||||
/* Open the file with the fapl; create a group and verify the
|
||||
object header version, then delete the group and close the file.*/
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, low)) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, high)) {
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; low++) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; high++) {
|
||||
H5E_BEGIN_TRY {
|
||||
ret = H5Pset_libver_bounds(new_fapl, low, high);
|
||||
} H5E_END_TRY;
|
||||
@ -6305,8 +6305,8 @@ test_libver_bounds_dataset(hid_t fapl)
|
||||
/* Loop through all the combinations of low/high bounds in new_fapl */
|
||||
/* Open the file with the fapl and create the chunked dataset */
|
||||
/* Verify the dataset's layout, fill value and filter pipleline message versions */
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, low)) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, high)) {
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; low++) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; high++) {
|
||||
H5E_BEGIN_TRY {
|
||||
ret = H5Pset_libver_bounds(new_fapl, low, high);
|
||||
} H5E_END_TRY;
|
||||
@ -6518,8 +6518,8 @@ test_libver_bounds_dataspace(hid_t fapl)
|
||||
/* Loop through all the combinations of low/high bounds in new_fapl */
|
||||
/* Open the file and create the chunked/compact/contiguous datasets */
|
||||
/* Verify the dataspace message version for the three datasets */
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, low)) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, high)) {
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; low++) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; high++) {
|
||||
hid_t tmp_sid, tmp_sid_compact, tmp_sid_contig; /* Dataspace IDs */
|
||||
H5S_t *tmp_space, *tmp_space_compact, *tmp_space_contig; /* Internal dataspace pointers */
|
||||
|
||||
@ -6843,8 +6843,8 @@ test_libver_bounds_datatype_check(hid_t fapl, hid_t tid)
|
||||
/* Open the file and create the chunked dataset with the input tid */
|
||||
/* Verify the dataset's datatype message version */
|
||||
/* Also verify the committed atatype message version */
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, low)) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, high)) {
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; low++) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; high++) {
|
||||
H5E_BEGIN_TRY {
|
||||
ret = H5Pset_libver_bounds(new_fapl, low, high);
|
||||
} H5E_END_TRY;
|
||||
@ -7164,8 +7164,8 @@ test_libver_bounds_attributes(hid_t fapl)
|
||||
/* Loop through all the combinations of low/high bounds */
|
||||
/* Open the file and group and attach an attribute to the group */
|
||||
/* Verify the attribute version */
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, low)) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, high)) {
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; low++) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; high++) {
|
||||
H5E_BEGIN_TRY {
|
||||
ret = H5Pset_libver_bounds(new_fapl, low, high);
|
||||
} H5E_END_TRY;
|
||||
|
@ -806,8 +806,8 @@ test_h5o_link(void)
|
||||
CHECK(fapl_id, FAIL, "H5Pcreate");
|
||||
|
||||
/* Loop through all the combinations of low/high library format bounds */
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, low)) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, high)) {
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; low++) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; high++) {
|
||||
|
||||
/* Set version bounds */
|
||||
H5E_BEGIN_TRY {
|
||||
|
@ -591,7 +591,7 @@ test_h5s_zero_dim(void)
|
||||
wdata_real[i][j][k] = (int)(i + j + k);
|
||||
|
||||
/* Test with different space allocation times */
|
||||
for(alloc_time = H5D_ALLOC_TIME_EARLY; alloc_time <= H5D_ALLOC_TIME_INCR; H5_INC_ENUM(H5D_alloc_time_t, alloc_time)) {
|
||||
for(alloc_time = H5D_ALLOC_TIME_EARLY; alloc_time <= H5D_ALLOC_TIME_INCR; alloc_time++) {
|
||||
|
||||
/* Make sure we can create the space with the dimension size 0 (starting from v1.8.7).
|
||||
* The dimension doesn't need to be unlimited. */
|
||||
@ -3366,8 +3366,8 @@ test_h5s(void)
|
||||
test_h5s_zero_dim(); /* Test dataspace with zero dimension size */
|
||||
|
||||
/* Loop through all the combinations of low/high version bounds */
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, low)) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, high)) {
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; low++) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; high++) {
|
||||
|
||||
/* Invalid combinations, just continue */
|
||||
if(high == H5F_LIBVER_EARLIEST || high < low)
|
||||
|
@ -2812,8 +2812,8 @@ test_reference(void)
|
||||
test_reference_obj(); /* Test basic H5R object reference code */
|
||||
|
||||
/* Loop through all the combinations of low/high version bounds */
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, low)) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, high)) {
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; low++) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; high++) {
|
||||
|
||||
/* Invalid combinations, just continue */
|
||||
if(high <= H5F_LIBVER_V110 || high < low)
|
||||
|
@ -1781,8 +1781,8 @@ test_reference_deprec(void)
|
||||
test_reference_obj(); /* Test basic H5R object reference code */
|
||||
|
||||
/* Loop through all the combinations of low/high version bounds */
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, low)) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, high)) {
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; low++) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; high++) {
|
||||
|
||||
/* Invalid combinations, just continue */
|
||||
if(high == H5F_LIBVER_EARLIEST || high < low)
|
||||
|
@ -2543,7 +2543,7 @@ test_vltypes_fill_value(void)
|
||||
CHECK(file_id, FAIL, "H5Fcreate");
|
||||
|
||||
/* Create datasets with different storage layouts */
|
||||
for(layout = H5D_COMPACT; layout <= H5D_CHUNKED; H5_INC_ENUM(H5D_layout_t, layout)) {
|
||||
for(layout = H5D_COMPACT; layout <= H5D_CHUNKED; layout++) {
|
||||
unsigned compress_loop; /* # of times to run loop, for testing compressed chunked dataset */
|
||||
unsigned test_loop; /* Loop over datasets */
|
||||
|
||||
@ -2659,7 +2659,7 @@ test_vltypes_fill_value(void)
|
||||
CHECK(file_id, FAIL, "H5Fopen");
|
||||
|
||||
/* Read empty datasets with different storage layouts */
|
||||
for(layout = H5D_COMPACT; layout <= H5D_CHUNKED; H5_INC_ENUM(H5D_layout_t, layout)) {
|
||||
for(layout = H5D_COMPACT; layout <= H5D_CHUNKED; layout++) {
|
||||
unsigned compress_loop; /* # of times to run loop, for testing compressed chunked dataset */
|
||||
unsigned test_loop; /* Loop over datasets */
|
||||
|
||||
@ -2860,7 +2860,7 @@ test_vltypes_fill_value(void)
|
||||
CHECK(file_id, FAIL, "H5Fopen");
|
||||
|
||||
/* Write one element & fill values to datasets with different storage layouts */
|
||||
for(layout = H5D_COMPACT; layout <= H5D_CHUNKED; H5_INC_ENUM(H5D_layout_t, layout)) {
|
||||
for(layout = H5D_COMPACT; layout <= H5D_CHUNKED; layout++) {
|
||||
unsigned compress_loop; /* # of times to run loop, for testing compressed chunked dataset */
|
||||
unsigned test_loop; /* Loop over datasets */
|
||||
|
||||
|
@ -12165,8 +12165,8 @@ main(void)
|
||||
if((my_fapl = H5Pcopy(fapl)) < 0) TEST_ERROR
|
||||
|
||||
/* Loop through all the combinations of low/high version bounds */
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, low)) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, high)) {
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; low++) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; high++) {
|
||||
char msg[80]; /* Message for file version bounds */
|
||||
const char *low_string; /* The low bound string */
|
||||
const char *high_string; /* The high bound string */
|
||||
|
@ -312,8 +312,8 @@ main(void)
|
||||
if((my_fapl = H5Pcopy(fapl)) < 0) TEST_ERROR
|
||||
|
||||
/* Loop through all the combinations of low/high version bounds */
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, low)) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; H5_INC_ENUM(H5F_libver_t, high)) {
|
||||
for(low = H5F_LIBVER_EARLIEST; low < H5F_LIBVER_NBOUNDS; low++) {
|
||||
for(high = H5F_LIBVER_EARLIEST; high < H5F_LIBVER_NBOUNDS; high++) {
|
||||
char msg[80]; /* Message for file version bounds */
|
||||
const char *low_string; /* The low bound string */
|
||||
const char *high_string; /* The high bound string */
|
||||
|
@ -1351,7 +1351,7 @@ test_multi(void)
|
||||
HDmemset(memb_addr, 0, sizeof(memb_addr));
|
||||
HDmemset(sv, 0, sizeof(sv));
|
||||
|
||||
for(mt=H5FD_MEM_DEFAULT; mt<H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t,mt)) {
|
||||
for(mt=H5FD_MEM_DEFAULT; mt<H5FD_MEM_NTYPES; mt++) {
|
||||
memb_fapl[mt] = H5P_DEFAULT;
|
||||
memb_map[mt] = H5FD_MEM_SUPER;
|
||||
}
|
||||
@ -1586,7 +1586,7 @@ test_multi_compat(void)
|
||||
HDmemset(memb_addr, 0, sizeof memb_addr);
|
||||
HDmemset(sv, 0, sizeof sv);
|
||||
|
||||
for(mt=H5FD_MEM_DEFAULT; mt<H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t,mt))
|
||||
for(mt=H5FD_MEM_DEFAULT; mt<H5FD_MEM_NTYPES; mt++)
|
||||
memb_map[mt] = H5FD_MEM_SUPER;
|
||||
memb_map[H5FD_MEM_DRAW] = H5FD_MEM_DRAW;
|
||||
|
||||
|
@ -3760,7 +3760,7 @@ void gent_multi(void)
|
||||
|
||||
HDassert(HDstrlen(multi_letters) == H5FD_MEM_NTYPES);
|
||||
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t,mt)) {
|
||||
for(mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; mt++) {
|
||||
memb_fapl[mt] = H5P_DEFAULT;
|
||||
memb_map[mt] = mt;
|
||||
HDsprintf(sv[mt], "%%s-%c.h5", multi_letters[mt]);
|
||||
|
@ -1174,7 +1174,7 @@ set_vfd(parameters *param)
|
||||
HDmemset(memb_addr, 0, sizeof memb_addr);
|
||||
|
||||
HDassert(HDstrlen(multi_letters)==H5FD_MEM_NTYPES);
|
||||
for (mt=H5FD_MEM_DEFAULT; mt<H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t,mt)) {
|
||||
for (mt=H5FD_MEM_DEFAULT; mt<H5FD_MEM_NTYPES; mt++) {
|
||||
memb_fapl[mt] = H5P_DEFAULT;
|
||||
HDsprintf(sv[mt], "%%s-%c.h5", multi_letters[mt]);
|
||||
memb_name[mt] = sv[mt];
|
||||
@ -1312,7 +1312,7 @@ do_cleanupfile(iotype iot, char *filename)
|
||||
H5FD_mem_t mt;
|
||||
assert(HDstrlen(multi_letters)==H5FD_MEM_NTYPES);
|
||||
|
||||
for (mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; H5_INC_ENUM(H5FD_mem_t,mt)) {
|
||||
for (mt = H5FD_MEM_DEFAULT; mt < H5FD_MEM_NTYPES; mt++) {
|
||||
HDsnprintf(temp, sizeof temp, "%s-%c.h5",
|
||||
filename, multi_letters[mt]);
|
||||
HDremove(temp); /*don't care if it fails*/
|
||||
|
@ -47,13 +47,6 @@
|
||||
#define MAX3(a,b,c) MAX(a,MAX(b,c))
|
||||
#define MAX4(a,b,c,d) MAX(MAX(a,b),MAX(c,d))
|
||||
|
||||
/*
|
||||
* A macro to portably increment enumerated types.
|
||||
*/
|
||||
#ifndef H5_INC_ENUM
|
||||
# define H5_INC_ENUM(TYPE,VAR) (VAR)=((TYPE)((VAR)+1))
|
||||
#endif
|
||||
|
||||
#define H5_FLT_ABS_EQUAL(X,Y) (HDfabsf((X)-(Y)) < FLT_EPSILON)
|
||||
#define H5_DBL_ABS_EQUAL(X,Y) (HDfabs ((X)-(Y)) < DBL_EPSILON)
|
||||
#define H5_LDBL_ABS_EQUAL(X,Y) (HDfabsl((X)-(Y)) < LDBL_EPSILON)
|
||||
|
Loading…
Reference in New Issue
Block a user