Lines Matching defs:node

154 static void mc_node_add(mc_dlist_t *node, mc_dlist_t **head, mc_dlist_t **tail);
155 static void mc_node_del(mc_dlist_t *node, mc_dlist_t **head, mc_dlist_t **tail);
239 		/* get the soft state pointer for this device node */
296 	 * Basically every memory-controller node on every machine should
400 	/* get the soft state pointer for this device node */
913 	 * Create the logical bank property for this mc node. This
1858 				/* node is at the tail of list */
1866 				/* node is at the head of list */
1931  * The new node is added at the tail and is not sorted.
1933  * Input: The pointer of node to be added, head and tail of the list
1937 mc_node_add(mc_dlist_t *node, mc_dlist_t **head, mc_dlist_t **tail)
1939 	DPRINTF(MC_LIST_DEBUG, ("mc_node_add: node->id %d head %p tail %p\n",
1940 	    node->id, (void *)*head, (void *)*tail));
1943 		node->prev = *tail;
1944 		node->next = (*tail)->next;
1945 		(*tail)->next = node;
1946 		*tail = node;
1948 		node->next = node->prev = NULL;
1949 		*head = *tail = node;
1954  * Input: The pointer of node to be deleted, head and tail of the list
1956  * Deleted node will be at the following positions
1964 mc_node_del(mc_dlist_t *node, mc_dlist_t **head, mc_dlist_t **tail)
1966 	if (node->next == NULL) {
1967 		/* deleted node is at the tail of list */
1968 		*tail = node->prev;
1970 		node->next->prev = node->prev;
1973 	if (node->prev == NULL) {
1974 		/* deleted node is at the head of list */
1975 		*head = node->next;
1977 		node->prev->next = node->next;
1984  * Return: pointer of found node
1989 	mc_dlist_t *node;
1991 	node = head;
1992 	while (node != NULL) {
1994 		    node->id, id));
1995 		if (node->id == id)
1997 		node = node->next;
1999 	return (node);