37 static void vq_free_node(Vuid_queue *vq, Vuid_q_node *vqn);
50 	Vuid_q_node *new_vqns, *vqn;  in vq_initialize()  local
58 	for (vqn = new_vqns; vqn < new_vqns + vq->size; vqn++)  in vq_initialize()
59 		vq_free_node(vq, vqn);  in vq_initialize()
73 			Vuid_q_node *vqn = vq_alloc_node(vq);  in vq_put()  local
75 			if (vqn == VUID_Q_NODE_NULL)  in vq_put()
77 			vqn->firm_event = *firm_event;  in vq_put()
80 			vqn->next = vp->next;  in vq_put()
81 			vqn->prev = vp;  in vq_put()
84 				vp->next->prev = vqn;  in vq_put()
86 			vp->next = vqn;  in vq_put()
89 				vq->bottom = vqn;  in vq_put()
92 				vq->top = vqn;  in vq_put()
103 	Vuid_q_node *vqn = vq->top;  in vq_get()  local
105 	if (vqn == VUID_Q_NODE_NULL)  in vq_get()
109 		*firm_event = vqn->firm_event;  in vq_get()
111 	vq->top = vqn->next;  in vq_get()
116 	if (vq->bottom == vqn)  in vq_get()
119 	vq_free_node(vq, vqn);  in vq_get()
135 	Vuid_q_node *vqn = vq_alloc_node(vq);  in vq_putback()  local
137 	if (vqn == VUID_Q_NODE_NULL)  in vq_putback()
139 	vqn->firm_event = *firm_event;  in vq_putback()
141 	vqn->next = vq->top;  in vq_putback()
143 	vqn->prev = VUID_Q_NODE_NULL;  in vq_putback()
146 		vq->top->prev = vqn;  in vq_putback()
148 	vq->top = vqn;  in vq_putback()
151 		vq->bottom = vqn;  in vq_putback()
236 vq_is_valuator(Vuid_q_node *vqn)  in vq_is_valuator()  argument
238 	return ((vqn->firm_event.value < 1 && vqn->firm_event.value > -1) ||  in vq_is_valuator()
239 	    (vqn->firm_event.pair_type == FE_PAIR_DELTA) ||  in vq_is_valuator()
240 	    (vqn->firm_event.pair_type == FE_PAIR_ABSOLUTE));  in vq_is_valuator()
244 vq_delete_node(Vuid_queue *vq, Vuid_q_node *vqn)  in vq_delete_node()  argument
247 	if (vqn == vq->top) {  in vq_delete_node()
252 	vqn->prev->next = vqn->next;  in vq_delete_node()
254 	if (vq->bottom == vqn)  in vq_delete_node()
255 		vq->bottom = vqn->prev;  in vq_delete_node()
258 		vqn->next->prev = vqn->prev;  in vq_delete_node()
260 	vq_free_node(vq, vqn);  in vq_delete_node()
270 	Vuid_q_node *vqn;  in vq_alloc_node()  local
274 	vqn = vq->free;  in vq_alloc_node()
277 	vqn->next = VUID_Q_NODE_NULL;  in vq_alloc_node()
278 	return (vqn);  in vq_alloc_node()
282 vq_free_node(Vuid_queue *vq, Vuid_q_node *vqn)  in vq_free_node()  argument
284 	vqn->next = vq->free;  in vq_free_node()
285 	vqn->prev = VUID_Q_NODE_NULL;  in vq_free_node()
286 	vq->free = vqn;  in vq_free_node()