CACHE
#define LEAF CACHE (DISK_LEAF_NODE_LEVEL)
char* cache = CACHE(depth);
cache = CACHE(num_cached);
cache = CACHE (depth);
{ CACHE, TOPO_STABILITY_PRIVATE },
tnode_t *tn = topo_zen_create_tn(mod, sock, pnode, inst, CACHE);
if (topo_node_range_create(mod, zt_core->ztcore_tn, CACHE, 0, 2) != 0) {
if (topo_node_range_create(mod, zt_ccx->ztccx_tn, CACHE, 0, 0) != 0) {
while (CACHE(hdp)->dngl != NULL) {
clp = CACHE(hdp)->dngl;
CACHE(hdp)->dngl = clp->sib;
assert((CACHE(hdp)->hash == NULL) ^ (CACHE(hdp)->hash_sz != 0));
free(CACHE(hdp)->hash);
CACHE(hdp)->hash = NULL;
CACHE(hdp)->hash_sz = 0;
for (pp = &(CACHE(hdp)->dngl); *pp != NULL; ) {
*lpp = CACHE(hdp)->dngl;
CACHE(hdp)->dngl = cmnp->link;
pp = &(CACHE(hdp)->dngl);
CACHE(hdp)->update_count = DB_HDR(hdp)->update_count;
CACHE(hdp)->update_count = 0;
for (hval = 0; hval < CACHE(hdp)->hash_sz; hval++) {
CACHE(hdp)->hash = calloc(sz, sizeof (cache_link_t *));
if (CACHE(hdp)->hash == NULL) {
CACHE(hdp)->hash_sz = sz;
assert(CACHE(hdp)->root == NULL);
CACHE(hdp)->root = cnp;
clp->sib = CACHE(hdp)->dngl;
CACHE(hdp)->dngl = clp;
count_node(CACHE(hdp)->root, count);
for (clp = CACHE(hdp)->dngl; clp != NULL; clp = clp->sib) {
assert(CACHE(hdp)->hash_sz >= MIN_HASH_SIZE);
return (hval % CACHE(hdp)->hash_sz);
clp = CACHE(hdp)->dngl;
for (i = 0; i < CACHE(hdp)->hash_sz; i++) {
CACHE(hdp)->hash = calloc(hash_sz, sizeof (cache_link_t *));
if (CACHE(hdp)->hash == NULL) {
CACHE(hdp)->hash_sz = hash_sz;
"di_devlink_close: update_count = %u\n", CACHE(hdp)->update_count);
if (CACHE(hdp)->update_count == 0) {
CACHE(hdp)->update_count = 1;
(void) write_links(hdp, NULL, CACHE(hdp)->dngl, next);
DB_HDR(hdp)->update_count = CACHE(hdp)->update_count;
if (clp != NULL && ((pdmp == NULL) ^ (clp == CACHE(hdp)->dngl))) {
#define CACHE_ROOT(h) (CACHE(h)->root)
#define CACHE_HASH(h, i) (CACHE(h)->hash[i])
#define CACHE_LAST(h) (CACHE(h)->last_minor)
#define CACHE_EMPTY(h) (CACHE(h)->root == NULL && CACHE(h)->dngl == NULL)
return_cmp(CACHE);