Lines Matching refs:queue
136 * into a submission queue. Workers take these tasks and typically
188 * the wait queue field of ctl stores worker indices, not worker
195 * All uses of the workers array, as well as queue arrays, check
207 * wait queue when they cannot find work. This "queue" is actually
214 * has not yet entered the wait queue. We solve this by requiring
217 * queue. During a rescan, the worker might release some other
228 * task to a queue that previously had two or fewer tasks, they
244 * array-based queue that is structured identically to
419 * Initial size for submission queue array. Must be a power of
426 * Maximum size for submission queue array. Must be a power of two
434 * Array serving as submission queue. Initialized upon construction.
480 * the lower 32 bits of queue state, u = (int)(ctl >>> 32) and e =
533 * Index (mod submission queue length) of next element to take
534 * from submission queue. Usage is identical to that for
541 * Index (mod submission queue length) of next element to add
542 * in submission queue. Usage is identical to that for
729 (q = v.queue) != null && (i = (q.length - 1) & b) >= 0) {
768 * Tries to enqueue worker w in wait queue and await change in
899 if ((q = submissionQueue) != null) { // ignore if queue removed
1225 * if shutdown and empty queue and no active workers
1710 * one thread's work queue by another. The reported value
2003 * item on a given queue:
2006 * final BlockingQueue<E> queue;
2008 * QueueTaker(BlockingQueue<E> q) { this.queue = q; }
2011 * item = queue.take();
2015 * return item != null || (item = queue.poll()) != null;