node_list
CHAIN_ADD(mdp->node_list, nodep);
for (nodep = CHAIN_START(mdp->node_list); nodep != NULL; ) {
for (nodep = CHAIN_START(mdp->node_list); nodep != NULL;
for (nodep = CHAIN_START(mdp->node_list); nodep != NULL;
CHAIN(md_node_t, node_list);
struct node_list *next;
node_list_t *node_list, *listp;
node_list =
if (node_list == NULL)
for (listp = node_list; listp != NULL; listp = listp->next) {
free_node_list(node_list);
free_node_list(node_list);
node_list_t *node_list, *listp;
node_list =
if (node_list == NULL)
for (listp = node_list; listp != NULL; listp = listp->next) {
free_node_list(node_list);
free_node_list(node_list);
struct node_list *next;
node_list_t *node_list, *listp;
node_list =
if (node_list == NULL)
for (listp = node_list; listp != NULL; listp = listp->next) {
free_node_list(node_list);
free_node_list(node_list);
node_list_t *node_list, *listp;
node_list =
if (node_list == NULL)
for (listp = node_list; listp != NULL; listp = listp->next) {
free_node_list(node_list);
free_node_list(node_list);
walk_one_link(struct node_list **headp, uint_t ep,
struct node_list *head; /* node_list for tree walk */
if ((head = malloc(sizeof (struct node_list))) == NULL) {
walk_one_lnode(struct node_list **headp, void *arg,
struct node_list *head; /* node_list for tree walk */
if ((head = malloc(sizeof (struct node_list))) == NULL) {
struct node_list *next;
free_node_list(struct node_list **headp)
struct node_list *tmp;
append_node_list(struct node_list **headp, struct node_list *list)
struct node_list *tmp;
prepend_node_list(struct node_list **headp, struct node_list *list)
struct node_list *tmp;
insert_node_list(struct node_list **headp, struct node_list *list,
struct node_list *tmp, *tmp1;
static struct node_list *
struct node_list *result, *tmp;
if ((result = malloc(sizeof (struct node_list))) == NULL) {
if ((tmp->next = malloc(sizeof (struct node_list))) == NULL) {
prune_sib(struct node_list **headp)
struct node_list *curr, *prev;
update_node_list(int action, uint_t flag, struct node_list **headp)
struct node_list *children, *tmp;
walk_one_node(struct node_list **headp, uint_t flag, void *arg,
struct node_list *head; /* node_list for tree walk */
if ((head = malloc(sizeof (struct node_list))) == NULL) {
walk_one_minor_list(struct node_list **headp, const char *desired_type,
struct node_list *head; /* node_list for tree walk */
if ((head = malloc(sizeof (struct node_list))) == NULL) {
uint32_t node_list;
package = SAD_INTERLEAVE(sad[i].node_list, way);
xp = SAD_INTERLEAVE(sad[i].node_list,
xp = SAD_INTERLEAVE(sad[i].node_list,
sad[i].node_list = SAD_INTERLEAVE_LIST_RD(nhm_slot, i);
sad[i].interleave = sad_interleave(sad[i].node_list);
sad[i].node_tgt[j] = (sad[i].node_list >>