Lines Matching refs:head
147 static void mc_node_add(mc_dlist_t *node, mc_dlist_t **head, mc_dlist_t **tail);
148 static void mc_node_del(mc_dlist_t *node, mc_dlist_t **head, mc_dlist_t **tail);
149 static void *mc_node_get(int id, mc_dlist_t *head);
559 bank = seg->head;
920 segi->head = banki;
1436 * Input: The pointer of node to be added, head and tail of the list
1440 mc_node_add(mc_dlist_t *node, mc_dlist_t **head, mc_dlist_t **tail)
1442 DPRINTF(MC_LIST_DEBUG, ("mc_node_add: node->id %d head %p tail %p\n",
1443 node->id, (void *) *head, (void *) *tail));
1445 if (*head != NULL) {
1452 *head = *tail = node;
1457 * Input: The pointer of node to be deleted, head and tail of the list
1461 * 2. At the head of the list
1462 * 3. At the head and tail of the list, i.e. only one left.
1467 mc_node_del(mc_dlist_t *node, mc_dlist_t **head, mc_dlist_t **tail)
1477 /* deleted node is at the head of list */
1478 *head = node->next;
1485 * Search the list from the head of the list to match the given id
1486 * Input: id and the head of the list
1490 mc_node_get(int id, mc_dlist_t *head)
1494 node = head;