Lines Matching refs:tail
206 /* Insert it at the tail of the linked list */
207 if (hdl->tail == NULL) {
210 hdl->tail = new_node;
214 /* Insert as new tail in circular list. */
215 new_node->next = hdl->tail->next;
216 hdl->tail->next = new_node;
217 hdl->tail = new_node;
244 struct bcm_notif_client_request * nodep = hdl->tail;
259 hdl->tail = NULL;
272 * If we got a hit at the tail of the list, need to adjust
273 * the main list "tail" pointer.
275 if (hdl->tail == nodep)
276 hdl->tail = prevp;
305 struct bcm_notif_client_request * nodep = hdl->tail;
348 struct bcm_notif_client_request * nodep = (*hdl)->tail;
400 nodep = hdl->tail;
408 struct bcm_notif_client_request * firstp = hdl->tail->next;