35 ll_init(llh_t *head)  in ll_init()  argument
37 	head->back = &head->front;  in ll_init()
38 	head->front = NULL;  in ll_init()
42 ll_enqueue(llh_t *head, ll_t *data)  in ll_enqueue()  argument
45 	*head->back = data;  in ll_enqueue()
46 	head->back = &data->n;  in ll_enqueue()
55 ll_mapf(llh_t *head, void (*func)(void *))  in ll_mapf()  argument
57 	ll_t *t = head->front;  in ll_mapf()
68 ll_peek(llh_t *head)  in ll_peek()  argument
70 	return (head->front);  in ll_peek()
74 ll_dequeue(llh_t *head)  in ll_dequeue()  argument
77 	ptr = head->front;  in ll_dequeue()
78 	if (ptr && ((head->front = ptr->n) == NULL))  in ll_dequeue()
79 		head->back = &head->front;  in ll_dequeue()
109 ll_check(llh_t *head)  in ll_check()  argument
112 	ll_t *ptr = head->front;  in ll_check()
114 	ll_t **prev = &head->front;  in ll_check()
124 	assert(head->back == prev);  in ll_check()