83     size_t nevents;             /* the number of buckets in our queue */  member
95     if (eventQueue->nevents) {  in mieqNumEnqueued()
97         n_enqueued = eventQueue->tail - eventQueue->head + eventQueue->nevents;  in mieqNumEnqueued()
98         if (n_enqueued >= eventQueue->nevents)  in mieqNumEnqueued()
99             n_enqueued -= eventQueue->nevents;  in mieqNumEnqueued()
116     if (new_nevents <= eventQueue->nevents)  in mieqGrowQueue()
128     first_hunk = eventQueue->nevents - eventQueue->head;  in mieqGrowQueue()
136     for (i = eventQueue->nevents; i < new_nevents; i++) {  in mieqGrowQueue()
153     eventQueue->nevents = new_nevents;  in mieqGrowQueue()
180     for (i = 0; i < miEventQueue.nevents; i++) {  in mieqFini()
214         oldtail = (oldtail - 1) % miEventQueue.nevents;  in mieqEnqueue()
216     else if (n_enqueued + 1 == miEventQueue.nevents) {  in mieqEnqueue()
217         if (!mieqGrowQueue(&miEventQueue, miEventQueue.nevents << 1)) {  in mieqEnqueue()
263     miEventQueue.tail = (oldtail + 1) % miEventQueue.nevents;  in mieqEnqueue()
535         miEventQueue.head = (miEventQueue.head + 1) % miEventQueue.nevents;  in mieqProcessInputEvents()