Lines Matching refs:queues
61 * that queues events, both from the underlying peer classes
116 * NUM_PRIORITIES queues and all Events on a particular internal Queue
121 private Queue[] queues = new Queue[NUM_PRIORITIES];
217 queues[i] = new Queue();
318 if (queues[priority].head == null) {
320 queues[priority].head = queues[priority].tail = newItem;
333 queues[priority].tail.next = newItem;
334 queues[priority].tail = newItem;
419 for (EventQueueItem entry = queues[priority].head;
512 if (queues[i].head != null) {
533 * event queues are nested with push()/pop().
555 if (queues[i].head != null) {
556 EventQueueItem entry = queues[i].head;
557 queues[i].head = entry.next;
559 queues[i].tail = null;
573 * event queues are nested with push()/pop().
579 for (EventQueueItem entry = queues[i].head, prev = null;
584 queues[i].head = entry.next;
588 if (queues[i].tail == entry) {
589 queues[i].tail = prev;
614 if (queues[i].head != null) {
615 return queues[i].head.event;
635 EventQueueItem q = queues[i].head;
1124 EventQueueItem entry = queues[i].head;
1143 queues[i].head = entry.next;
1153 queues[i].tail = prev;