Searched refs:queues (Results 1 - 7 of 7) sorted by relevance

/openjdk7/jdk/test/java/util/concurrent/ConcurrentQueues/
H A DGCRetention.java64 Collection<Queue<Boolean>> queues() { method in class:GCRetention
65 List<Queue<Boolean>> queues = new ArrayList<Queue<Boolean>>();
66 queues.add(new ConcurrentLinkedDeque<Boolean>());
67 queues.add(new ConcurrentLinkedQueue<Boolean>());
68 queues.add(new ArrayBlockingQueue<Boolean>(count, false));
69 queues.add(new ArrayBlockingQueue<Boolean>(count, true));
70 queues.add(new LinkedBlockingQueue<Boolean>());
71 queues.add(new LinkedBlockingDeque<Boolean>());
72 queues.add(new PriorityBlockingQueue<Boolean>());
73 queues
[all...]
H A DRemovePollRace.java65 List<Queue<Boolean>> queues = new ArrayList<Queue<Boolean>>();
66 queues.add(new ConcurrentLinkedDeque<Boolean>());
67 queues.add(new ConcurrentLinkedQueue<Boolean>());
68 queues.add(new ArrayBlockingQueue<Boolean>(count, false));
69 queues.add(new ArrayBlockingQueue<Boolean>(count, true));
70 queues.add(new LinkedBlockingQueue<Boolean>());
71 queues.add(new LinkedBlockingDeque<Boolean>());
72 queues.add(new LinkedTransferQueue<Boolean>());
76 // queues.add(new SynchronizedLinkedListQueue<Boolean>());
79 Collections.shuffle(queues);
[all...]
H A DConcurrentQueueLoops.java57 List<Queue<Integer>> queues = new ArrayList<Queue<Integer>>();
58 queues.add(new ConcurrentLinkedDeque<Integer>());
59 queues.add(new ConcurrentLinkedQueue<Integer>());
60 queues.add(new ArrayBlockingQueue<Integer>(items, false));
61 //queues.add(new ArrayBlockingQueue<Integer>(count, true));
62 queues.add(new LinkedBlockingQueue<Integer>());
63 queues.add(new LinkedBlockingDeque<Integer>());
64 queues.add(new LinkedTransferQueue<Integer>());
68 // queues.add(new SynchronizedLinkedListQueue<Integer>());
71 Collections.shuffle(queues);
[all...]
/openjdk7/jdk/src/share/classes/java/awt/
H A DEventQueue.java61 * 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]; field in class:EventQueue
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[priorit
[all...]
/openjdk7/hotspot/src/share/vm/utilities/
H A Dworkgroup.hpp113 AbstractGangTaskWOopQueues(const char* name, OopTaskQueueSet* queues) : argument
114 AbstractGangTask(name), _queues(queues), _terminator(0, _queues) {}
119 OopTaskQueueSet* queues() { return _queues; } function in class:AbstractGangTaskWOopQueues
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A Dg1CollectedHeap.cpp4840 RefToScanQueueSet* queues() { return _queues; } function in class:G1ParEvacuateFollowersClosure
4846 RefToScanQueueSet* queues,
4849 _queues(queues), _terminator(terminator) {}
4871 while (queues()->steal(pss->queue_num(), pss->hash_seed(), stolen_task)) {
4880 // available new entries on the queues. So we have to make sure
4881 // we drain the queues as necessary.
4914 RefToScanQueueSet* queues() { return _queues; } function in class:G1ParTask
4917 return queues()->queue(i);
5198 // and different queues.
4844 G1ParEvacuateFollowersClosure(G1CollectedHeap* g1h, G1ParScanThreadState* par_scan_state, RefToScanQueueSet* queues, ParallelTaskTerminator* terminator) argument
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/
H A DconcurrentMarkSweepGeneration.cpp683 // Parallel task queues; these are shared for the
3760 // "queue_set" is a set of work queues of other threads.
3797 // The per thread work queues, available here for stealing
5117 // The per-thread work queues, available here for stealing.
5436 // Try to steal from other queues that have work
5798 OopTaskQueueSet* task_queues() { return queues(); }
5890 // Try to steal from other queues that have work
8707 // The work queues are private to each closure (thread),

Completed in 80 milliseconds