91 mieqNumEnqueued(EventQueuePtr eventQueue)  in mieqNumEnqueued()  argument
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()
106 mieqGrowQueue(EventQueuePtr eventQueue, size_t new_nevents)  in mieqGrowQueue()  argument
111     if (!eventQueue) {  in mieqGrowQueue()
116     if (new_nevents <= eventQueue->nevents)  in mieqGrowQueue()
125     n_enqueued = mieqNumEnqueued(eventQueue);  in mieqGrowQueue()
128     first_hunk = eventQueue->nevents - eventQueue->head;  in mieqGrowQueue()
130            &eventQueue->events[eventQueue->head],  in mieqGrowQueue()
133            eventQueue->events, eventQueue->head * sizeof(EventRec));  in mieqGrowQueue()
136     for (i = eventQueue->nevents; i < new_nevents; i++) {  in mieqGrowQueue()
151     eventQueue->tail = n_enqueued;  in mieqGrowQueue()
152     eventQueue->head = 0;  in mieqGrowQueue()
153     eventQueue->nevents = new_nevents;  in mieqGrowQueue()
154     free(eventQueue->events);  in mieqGrowQueue()
155     eventQueue->events = new_events;  in mieqGrowQueue()