39 static void vq_free_node(Vuid_queue *vq, Vuid_q_node *vqn);
52 	Vuid_q_node *new_vqns, *vqn;  in vq_initialize()  local
60 	for (vqn = new_vqns; vqn < new_vqns + vq->size; vqn++)  in vq_initialize()
61 		vq_free_node(vq, vqn);  in vq_initialize()
75 			Vuid_q_node *vqn = vq_alloc_node(vq);  in vq_put()  local
77 			if (vqn == VUID_Q_NODE_NULL)  in vq_put()
79 			vqn->firm_event = *firm_event;  in vq_put()
82 			vqn->next = vp->next;  in vq_put()
83 			vqn->prev = vp;  in vq_put()
86 				vp->next->prev = vqn;  in vq_put()
88 			vp->next = vqn;  in vq_put()
91 				vq->bottom = vqn;  in vq_put()
94 				vq->top = vqn;  in vq_put()
105 	Vuid_q_node *vqn = vq->top;  in vq_get()  local
107 	if (vqn == VUID_Q_NODE_NULL)  in vq_get()
111 		*firm_event = vqn->firm_event;  in vq_get()
113 	vq->top = vqn->next;  in vq_get()
118 	if (vq->bottom == vqn)  in vq_get()
121 	vq_free_node(vq, vqn);  in vq_get()
137 	Vuid_q_node *vqn = vq_alloc_node(vq);  in vq_putback()  local
139 	if (vqn == VUID_Q_NODE_NULL)  in vq_putback()
141 	vqn->firm_event = *firm_event;  in vq_putback()
143 	vqn->next = vq->top;  in vq_putback()
145 	vqn->prev = VUID_Q_NODE_NULL;  in vq_putback()
148 		vq->top->prev = vqn;  in vq_putback()
150 	vq->top = vqn;  in vq_putback()
153 		vq->bottom = vqn;  in vq_putback()
238 vq_is_valuator(Vuid_q_node *vqn)  in vq_is_valuator()  argument
240 	return ((vqn->firm_event.value < 1 && vqn->firm_event.value > -1) ||  in vq_is_valuator()
241 	    (vqn->firm_event.pair_type == FE_PAIR_DELTA) ||  in vq_is_valuator()
242 	    (vqn->firm_event.pair_type == FE_PAIR_ABSOLUTE));  in vq_is_valuator()
246 vq_delete_node(Vuid_queue *vq, Vuid_q_node *vqn)  in vq_delete_node()  argument
249 	if (vqn == vq->top) {  in vq_delete_node()
254 	vqn->prev->next = vqn->next;  in vq_delete_node()
256 	if (vq->bottom == vqn)  in vq_delete_node()
257 		vq->bottom = vqn->prev;  in vq_delete_node()
260 		vqn->next->prev = vqn->prev;  in vq_delete_node()
262 	vq_free_node(vq, vqn);  in vq_delete_node()
272 	Vuid_q_node *vqn;  in vq_alloc_node()  local
276 	vqn = vq->free;  in vq_alloc_node()
279 	vqn->next = VUID_Q_NODE_NULL;  in vq_alloc_node()
280 	return (vqn);  in vq_alloc_node()
284 vq_free_node(Vuid_queue *vq, Vuid_q_node *vqn)  in vq_free_node()  argument
286 	vqn->next = vq->free;  in vq_free_node()
287 	vqn->prev = VUID_Q_NODE_NULL;  in vq_free_node()
288 	vq->free = vqn;  in vq_free_node()