Source
29
29
/****************/
30
30
31
31
#define H5B_PACKAGE /*suppress error about including H5Bpkg */
32
32
33
33
/***********/
34
34
/* Headers */
35
35
/***********/
36
36
#include "H5private.h" /* Generic Functions */
37
37
#include "H5Bpkg.h" /* B-link trees */
38
38
#include "H5Eprivate.h" /* Error handling */
39
+
#include "H5MMprivate.h" /* Memory management */
39
40
40
41
•
41
42
/*-------------------------------------------------------------------------
42
43
* Function: H5B_debug
43
44
*
44
45
* Purpose: Prints debugging info about a B-tree.
45
46
*
46
47
* Return: Non-negative on success/Negative on failure
47
48
*
48
49
* Programmer: Robb Matzke
183
184
herr_t status;
184
185
herr_t ret_value=SUCCEED; /* Return value */
185
186
186
187
/* A queue of child data */
187
188
struct child_t {
188
189
haddr_t addr;
189
190
unsigned level;
190
191
struct child_t *next;
191
192
} *head = NULL, *tail = NULL, *prev = NULL, *cur = NULL, *tmp = NULL;
192
193
193
-
FUNC_ENTER_NOAPI(H5B_assert, FAIL)
194
+
FUNC_ENTER_NOAPI_NOFUNC(H5B_assert)
194
195
195
196
if (0==ncalls++) {
196
197
if (H5DEBUG(B)) {
197
198
fprintf(H5DEBUG(B), "H5B: debugging B-trees (expensive)\n");
198
199
}
199
200
}
200
201
/* Initialize the queue */
201
202
bt = (H5B_t *)H5AC_protect(f, dxpl_id, H5AC_BT, addr, type, udata, H5AC_READ);
202
203
assert(bt);
203
204
shared=(H5B_shared_t *)H5RC_GET_OBJ(bt->rc_shared);
270
271
cur = cur->next;
271
272
}
272
273
273
274
/* Free all entries from queue */
274
275
while (head) {
275
276
tmp = head->next;
276
277
H5MM_xfree(head);
277
278
head = tmp;
278
279
}
279
280
280
-
done:
281
281
FUNC_LEAVE_NOAPI(ret_value)
282
282
}
283
283
#endif /* H5B_DEBUG */
284
284