Lines Matching defs:eventQueue
93 mieqNumEnqueued(EventQueuePtr eventQueue)
97 if (eventQueue->nevents) {
99 n_enqueued = eventQueue->tail - eventQueue->head + eventQueue->nevents;
100 if (n_enqueued >= eventQueue->nevents)
101 n_enqueued -= eventQueue->nevents;
108 mieqGrowQueue(EventQueuePtr eventQueue, size_t new_nevents)
113 if (!eventQueue) {
114 ErrorF("[mi] mieqGrowQueue called with a NULL eventQueue\n");
118 if (new_nevents <= eventQueue->nevents)
127 n_enqueued = mieqNumEnqueued(eventQueue);
130 first_hunk = eventQueue->nevents - eventQueue->head;
131 if (eventQueue->events) {
133 &eventQueue->events[eventQueue->head],
136 eventQueue->events, eventQueue->head * sizeof(EventRec));
140 for (i = eventQueue->nevents; i < new_nevents; i++) {
155 eventQueue->tail = n_enqueued;
156 eventQueue->head = 0;
157 eventQueue->nevents = new_nevents;
158 free(eventQueue->events);
159 eventQueue->events = new_events;