28 	queue_node_ptr_t newnode;  in queue_insert()  local
33 	newnode = (queue_node_ptr_t) malloc(sizeof(struct queue_node));  in queue_insert()
34 	if (newnode == NULL)  in queue_insert()
37 	newnode->element = e;  in queue_insert()
38 	newnode->next = NULL;  in queue_insert()
41 		q->head = q->tail = newnode;  in queue_insert()
43 		q->tail->next = newnode;  in queue_insert()
44 		q->tail = newnode;  in queue_insert()
52 	queue_node_ptr_t newnode;  in queue_push()  local
57 	newnode = (queue_node_ptr_t) malloc(sizeof(struct queue_node));  in queue_push()
58 	if (newnode == NULL)  in queue_push()
61 	newnode->element = e;  in queue_push()
62 	newnode->next = NULL;  in queue_push()
65 		q->head = q->tail = newnode;  in queue_push()
67 		newnode->next = q->head;  in queue_push()
68 		q->head = newnode;  in queue_push()