Lines Matching defs:nevents
83 size_t nevents; /* the number of buckets in our queue */
97 if (eventQueue->nevents) {
99 n_enqueued = eventQueue->tail - eventQueue->head + eventQueue->nevents;
100 if (n_enqueued >= eventQueue->nevents)
101 n_enqueued -= eventQueue->nevents;
118 if (new_nevents <= eventQueue->nevents)
130 first_hunk = eventQueue->nevents - eventQueue->head;
140 for (i = eventQueue->nevents; i < new_nevents; i++) {
157 eventQueue->nevents = new_nevents;
184 for (i = 0; i < miEventQueue.nevents; i++) {
218 oldtail = (oldtail - 1) % miEventQueue.nevents;
220 else if (n_enqueued + 1 == miEventQueue.nevents) {
221 if (!mieqGrowQueue(&miEventQueue, miEventQueue.nevents << 1)) {
267 miEventQueue.tail = (oldtail + 1) % miEventQueue.nevents;
547 miEventQueue.head = (miEventQueue.head + 1) % miEventQueue.nevents;