Lines Matching defs:n_enqueued
95 size_t n_enqueued = 0;
99 n_enqueued = eventQueue->tail - eventQueue->head + eventQueue->nevents;
100 if (n_enqueued >= eventQueue->nevents)
101 n_enqueued -= eventQueue->nevents;
103 return n_enqueued;
110 size_t i, n_enqueued, first_hunk;
127 n_enqueued = mieqNumEnqueued(eventQueue);
155 eventQueue->tail = n_enqueued;
206 size_t n_enqueued;
210 n_enqueued = mieqNumEnqueued(&miEventQueue);
220 else if (n_enqueued + 1 == miEventQueue.nevents) {