i_nvp_t
i_nvp_t *nvcur, i_nvp;
i_nvp_t *tmp;
tmp = (i_nvp_t *)nvpriv.nvp_list;
i_nvp_t i_nvp, *tmp;
nvpair = &((i_nvp_t *)wsp->walk_addr)->nvi_nvp;
((i_nvp_t *)((size_t)(nvp) - offsetof(i_nvp_t, nvi_nvp)))
i_nvp_t *curr;
i_nvp_t *curr;
i_nvp_t *curr;
i_nvp_t *curr;
i_nvp_t *curr;
i_nvp_t **tab = nv_mem_zalloc(priv, buckets * sizeof (i_nvp_t *));
i_nvp_t **tab = priv->nvp_hashtable;
nv_mem_free(priv, tab, priv->nvp_nbuckets * sizeof (i_nvp_t *));
i_nvp_t **tab = priv->nvp_hashtable;
i_nvp_t *entry = tab[index];
for (i_nvp_t *e = entry; e != NULL; e = e->nvi_hashtable_next) {
i_nvp_t **tab = priv->nvp_hashtable;
i_nvp_t **new_tab = nv_mem_zalloc(priv, new_size * sizeof (i_nvp_t *));
i_nvp_t *next, *e = tab[i];
i_nvp_t **tab = priv->nvp_hashtable;
i_nvp_t *bucket = tab[index];
for (i_nvp_t *prev = NULL, *e = bucket;
i_nvp_t **tab = priv->nvp_hashtable;
i_nvp_t *bucket = tab[index];
i_nvp_t *new_entry = NVPAIR2I_NVP(nvp);
i_nvp_t *buf;
nvsize = len + offsetof(i_nvp_t, nvi_nvp);
size_t nvsize = nvp->nvp_size + offsetof(i_nvp_t, nvi_nvp);
i_nvp_t *curr = NVPAIR2I_NVP(nvp);
i_nvp_t *curr = NVPAIR2I_NVP(nvp);
i_nvp_t *curr;
i_nvp_t *curr;
i_nvp_t *curr;
i_nvp_t *_nvi_next;
i_nvp_t *_nvi_prev;
i_nvp_t *_nvi_hashtable_next;
i_nvp_t *nvp_list; /* linked list of nvpairs */
i_nvp_t *nvp_last; /* last nvpair */
i_nvp_t *nvp_curr; /* current walker nvpair */
i_nvp_t **nvp_hashtable; /* table of entries used for lookup */