Cross Reference: /osnet-11/usr/src/lib/libdevinfo/devinfo.c

Lines Matching refs:list
527 	DPRINTF((DI_TRACE, "next node on per driver list:"
568 append_node_list(struct node_list **headp, struct node_list *list)
573 		*headp = list;
577 	if (list == NULL)	/* a minor optimization */
584 	tmp->next = list;
588 prepend_node_list(struct node_list **headp, struct node_list *list)
592 	if (list == NULL)
596 	*headp = list;
601 	while (list->next)
602 		list = list->next;
604 	list->next = tmp;
629  * Insert list before the first node which is NOT a descendent of parent.
633 insert_node_list(struct node_list **headp, struct node_list *list,
638 	if (list == NULL)
643 		*headp = list;
648 		prepend_node_list(headp, list);
660 	tmp->next = list;
665  *   Get a linked list of handles of all children
735 	 * is NOT the first in the linked list of siblings.
767  *	Update node list based on action (return code from callback)
779 		 * free the node list and be done
787 		 * Get list of children and prune siblings
806 		 * Get list of children and pop first node
816 	 * insert the list of children
836  *   Invoke callback on one node and update the list of nodes to be walked
879  *   Invoke callback for each minor on the minor list of first node
880  *   on node_list headp, and place children of first node on the list.
1554 	int list = DI_PROP_DRV_LIST;
1565 	 * Find which prop list we are at
1568 		list = DI_PROP(prop)->prop_list;
1571 		switch (list++) {
1600 	} while ((prop == DI_PROP_NIL) && (list < DI_PROP_NLISTS));
3057 	struct di_prom_prop *next;	/* form a linked list */
3063 	struct di_prom_prop *list;	/* linked list of prop */
3085 	p->list = NULL;
3091 di_prom_prop_free(struct di_prom_prop *list)
3093 	struct di_prom_prop *tmp = list;
3096 		list = tmp->next;
3104 		tmp = list;
3117 	di_prom_prop_free(p->list);
3200 	 * Prepend prop to list in prom handle
3202 	prop->next = p->list;
3203 	p->list = prop;
3339 		prop->next = p->list;
3340 		p->list = prop;
3361 	 * make a copy of the property value, stick in ph->list
3371 	prop->next = p->list;
3372 	p->list = prop;
3807  *   Invoke callback for each link data on the link list of first node
3808  *   on node_list headp, and place children of first node on the list.
3872  *   Invoke callback for each link data on the link list of first node
3873  *   on node_list headp, and place children of first node on the list.
4054 		 * No nodes in the sibling list or there was no match