Searched refs:queue (Results 1 - 25 of 114) sorted by relevance

12345

/openjdk7/jdk/src/share/classes/javax/swing/
H A DActionPropertyChangeListener.java55 private static ReferenceQueue<JComponent> queue; field in class:ActionPropertyChangeListener
65 if (queue == null) {
66 queue = new ReferenceQueue<JComponent>();
69 return queue;
100 ReferenceQueue<JComponent> queue = getQueue();
105 while ((r = (OwnedWeakReference)queue.poll()) != null) {
112 this.target = new OwnedWeakReference<T>(c, queue, this);
147 OwnedWeakReference(U target, ReferenceQueue<? super U> queue, argument
149 super(target, queue);
/openjdk7/jdk/src/share/classes/java/lang/ref/
H A DReference.java49 * whether or not the instance was registered with a queue when it was
57 * Enqueued: An element of the queue with which the instance was
65 * The state is encoded in the queue and next fields as follows:
67 * Active: queue = ReferenceQueue with which instance is registered, or
68 * ReferenceQueue.NULL if it was not registered with a queue; next =
71 * Pending: queue = ReferenceQueue with which instance is registered;
72 * next = Following instance in queue, or this if at end of list.
74 * Enqueued: queue = ReferenceQueue.ENQUEUED; next = Following instance
75 * in queue, or this if at end of list.
77 * Inactive: queue
92 ReferenceQueue<? super T> queue; field in class:Reference
233 Reference(T referent, ReferenceQueue<? super T> queue) argument
[all...]
H A DReferenceQueue.java39 * Constructs a new reference-object queue.
59 if (r.queue == ENQUEUED) return false;
61 r.queue = ENQUEUED;
78 r.queue = NULL;
90 * Polls this queue to see if a reference object is available. If one is
91 * available without further delay then it is removed from the queue and
106 * Removes the next reference object in this queue, blocking until either
114 * added to this queue. If zero, block indefinitely.
144 * Removes the next reference object in this queue, blocking until one
/openjdk7/jdk/src/share/classes/java/util/
H A DPriorityQueue.java29 * An unbounded priority {@linkplain Queue queue} based on a priority heap.
30 * The elements of the priority queue are ordered according to their
32 * provided at queue construction time, depending on which constructor is
33 * used. A priority queue does not permit {@code null} elements.
34 * A priority queue relying on natural ordering also does not permit
38 * <p>The <em>head</em> of this queue is the <em>least</em> element
41 * broken arbitrarily. The queue retrieval operations {@code poll},
43 * element at the head of the queue.
45 * <p>A priority queue is unbounded, but has an internal
47 * elements on the queue
95 private transient Object[] queue; field in class:PriorityQueue
[all...]
H A DTimer.java78 * it uses a binary heap to represent its task queue, so the cost to schedule
91 * The timer task queue. This data structure is shared with the timer
94 * and removing them from the queue when they're obsolete.
96 private final TaskQueue queue = new TaskQueue(); field in class:Timer
101 private final TimerThread thread = new TimerThread(queue);
106 * tasks in the timer queue. It is used in preference to a finalizer on
112 synchronized(queue) {
114 queue.notify(); // In case queue is empty.
395 synchronized(queue) {
497 private TaskQueue queue; field in class:TimerThread
499 TimerThread(TaskQueue queue) argument
578 private TimerTask[] queue = new TimerTask[128]; field in class:TaskQueue
[all...]
/openjdk7/jdk/src/share/classes/java/util/concurrent/
H A DScheduledThreadPoolExecutor.java57 * automatically removed from the work queue until its delay
61 * causes tasks to be immediately removed from the work queue at
75 * {@code corePoolSize} threads and an unbounded queue, adjustments
132 * 2. Using a custom queue (DelayedWorkQueue), a variant of
161 * True if ScheduledFutureTask.cancel should remove from queue
199 * Index into delay queue, to support faster cancellation.
314 * is shut down, rejects the task. Otherwise adds task to queue
354 * Cancels and clears the queue of all tasks that should not be run
455 * because the thread bounds and queue capacities are reached
474 * because the thread bounds and queue capacitie
834 private RunnableScheduledFuture[] queue = field in class:ScheduledThreadPoolExecutor.DelayedWorkQueue
[all...]
/openjdk7/jdk/src/share/classes/com/sun/jmx/remote/internal/
H A DArrayQueue.java34 this.queue = newArray(capacity + 1);
50 this.queue = newqueue;
61 queue[tail] = o;
71 throw new IllegalArgumentException("Can only remove head of queue");
74 T removed = queue[head];
75 queue[head] = null;
83 final String msg = "Index " + i + ", queue size " + size;
87 return queue[index];
99 private T[] queue; field in class:ArrayQueue
/openjdk7/jdk/src/share/classes/com/sun/jndi/ldap/pool/
H A DConnectionsWeakRef.java62 ConnectionsWeakRef (ConnectionsRef connsRef, ReferenceQueue queue) { argument
63 super(connsRef, queue);
/openjdk7/jdk/src/share/classes/com/sun/tools/jdi/
H A DInternalEventHandler.java34 EventQueueImpl queue; field in class:InternalEventHandler
37 InternalEventHandler(VirtualMachineImpl vm, EventQueueImpl queue) argument
40 this.queue = queue;
54 EventSet eventSet = queue.removeInternal();
/openjdk7/jdk/src/macosx/native/com/apple/concurrent/
H A DDispatch.m52 dispatch_queue_t queue = dispatch_get_main_queue();
53 return ptr_to_jlong(queue);
65 dispatch_queue_t queue = dispatch_get_global_queue((long)priority, 0);
66 return ptr_to_jlong(queue);
82 dispatch_queue_t queue = dispatch_queue_create(queue_name, NULL);
85 return ptr_to_jlong(queue);
108 dispatch_queue_t queue = (dispatch_queue_t)jlong_to_ptr(nativeQueue);
109 if (queue == NULL) return; // shouldn't happen
114 dispatch_fxn(queue, ^{
/openjdk7/jdk/src/macosx/native/com/sun/media/sound/
H A DPLATFORM_API_MacOSX_MidiIn.c95 /* read the next message from the queue */
100 while (handle->queue != NULL && handle->platformData != NULL) {
101 MidiMessage* msg = MIDI_QueueRead(handle->queue);
108 MIDI_WaitOnConditionVariable(handle->platformData, handle->queue->lock);
117 if (handle == NULL || handle->queue == NULL) {
120 MIDI_QueueRemove(handle->queue, TRUE /*onlyLocked*/);
/openjdk7/jdk/src/macosx/native/sun/osxapp/
H A DQueuingApplicationDelegate.h35 NSMutableArray* queue; variable
47 @property(retain) NSMutableArray* queue; variable
H A DQueuingApplicationDelegate.m46 @synthesize queue;
66 self.queue = [NSMutableArray arrayWithCapacity: 0];
104 self.queue = nil;
117 [self.queue addObject:[^(){
126 [self.queue addObject:[^(){
137 [self.queue addObject:[^(){
147 [self.queue addObject:[^(){
154 [self.queue addObject:[^(){
162 [self.queue addObject:[^(){
170 [self.queue addObjec
[all...]
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/istack/internal/
H A DPool.java62 private volatile WeakReference<ConcurrentLinkedQueue<T>> queue; field in class:Pool.Impl
89 WeakReference<ConcurrentLinkedQueue<T>> q = queue;
96 // overwrite the queue
98 queue = new WeakReference<ConcurrentLinkedQueue<T>>(d);
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/messaging/saaj/util/
H A DParserPool.java43 private final BlockingQueue queue; field in class:ParserPool
49 queue = new ArrayBlockingQueue(capacity);
55 queue.put(factory.newSAXParser());
71 return (SAXParser) queue.take();
79 queue.offer(parser);
/openjdk7/jdk/test/java/io/Serializable/subclassGC/
H A DSubclassGC.java65 final ReferenceQueue<Class<?>> queue = new ReferenceQueue<Class<?>>();
66 WeakReference<Class<?>> ref = new WeakReference<Class<?>>(cl, queue);
77 Reference<? extends Class<?>> dequeued = queue.remove(TIMEOUT);
/openjdk7/jdk/test/java/nio/file/Files/walkFileTree/
H A DCreateFileTree.java42 Queue<Path> queue = new ArrayDeque<Path>();
43 queue.add(top);
47 while (((dir = queue.poll()) != null) && (n < total)) {
52 queue.offer(subdir);
/openjdk7/jdk/src/share/native/com/sun/media/sound/
H A DPlatformMidi.c83 MidiMessageQueue* queue = (MidiMessageQueue*) malloc(sizeof(MidiMessageQueue) + ((capacity-1) * sizeof(MidiMessage))); local
84 if (queue) {
86 queue->lock = MIDI_CreateLock();
87 queue->capacity = capacity;
88 queue->size = 0;
89 queue->readIndex = 0;
90 queue->writeIndex = 0;
92 return queue;
95 void MIDI_DestroyQueue(MidiMessageQueue* queue) { argument
96 if (queue) {
108 MIDI_QueueAddShort(MidiMessageQueue* queue, UINT32 packedMsg, INT64 timestamp, int overwrite) argument
132 MIDI_QueueAddLong(MidiMessageQueue* queue, UBYTE* data, UINT32 size, INT32 sysexIndex, INT64 timestamp, int overwrite) argument
161 MIDI_QueueRead(MidiMessageQueue* queue) argument
175 MIDI_QueueRemove(MidiMessageQueue* queue, INT32 onlyLocked) argument
191 MIDI_QueueClear(MidiMessageQueue* queue) argument
[all...]
H A DPlatformMidi.h35 /* do we need the queue ? */
98 MidiMessage queue[1]; member in struct:tag_MidiQueue
110 MidiMessageQueue* queue; // may be NULL if no queue is used member in struct:tag_MidiDeviceHandle
131 void MIDI_DestroyQueue(MidiMessageQueue* queue);
132 // if overwrite is true, oldest messages will be overwritten when the queue is full
134 int MIDI_QueueAddShort(MidiMessageQueue* queue, UINT32 packedMsg, INT64 timestamp, int overwrite);
135 int MIDI_QueueAddLong(MidiMessageQueue* queue, UBYTE* data, UINT32 size,
138 // returns NULL if no messages in queue.
139 MidiMessage* MIDI_QueueRead(MidiMessageQueue* queue);
[all...]
/openjdk7/jdk/src/share/classes/sun/util/locale/
H A DLocaleObjectCache.java41 private ReferenceQueue<V> queue = new ReferenceQueue<>(); field in class:LocaleObjectCache
67 CacheEntry<K, V> newEntry = new CacheEntry<>(key, newVal, queue);
84 CacheEntry<K, V> entry = new CacheEntry<>(key, value, queue);
92 while ((entry = (CacheEntry<K, V>)queue.poll()) != null) {
106 CacheEntry(K key, V value, ReferenceQueue<V> queue) { argument
107 super(value, queue);
/openjdk7/jdk/src/share/classes/sun/misc/
H A DQueue.java32 * Queue: implements a simple queue mechanism. Allows for enumeration of the
69 * Dequeue the oldest object on the queue. Will wait indefinitely.
71 * @return the oldest object on the queue.
80 * Dequeue the oldest object on the queue.
84 * @return the oldest object on the queue.
106 * Is the queue empty?
107 * @return true if the queue is empty.
151 Queue queue; field in class:FIFOQueueEnumerator
155 queue = q;
164 synchronized (queue) {
176 Queue queue; field in class:LIFOQueueEnumerator
[all...]
/openjdk7/jdk/src/share/classes/sun/net/www/http/
H A DKeepAliveStream.java47 // has this KeepAliveStream been put on the queue for asynchronous cleanup.
50 private static final KeepAliveStreamCleaner queue = new KeepAliveStreamCleaner(); field in class:KeepAliveStream
92 //put this KeepAliveStream on the queue so that the data remaining
155 synchronized(queue) {
157 if (!queue.offer(kace)) {
163 queue.notifyAll();
185 cleanerThread = new Thread(grp, queue, "Keep-Alive-SocketCleaner");
196 } // queue
/openjdk7/jdk/src/share/sample/jmx/jmx-scandir/src/com/sun/jmx/examples/scandir/
H A DScanDirAgent.java88 // A queue to put received Notifications.
90 private final BlockingQueue<Notification> queue; field in class:ScanDirAgent
92 // A listener that will put notifications into the queue.
103 // Initialize the notification queue
104 queue = new LinkedBlockingQueue<Notification>();
111 // Just put the received notification in the queue.
115 queue.put(notification);
193 queue.poll(30,TimeUnit.SECONDS);
/openjdk7/langtools/test/tools/javac/capture/
H A DCapture3.java41 Q<? super T> queue; field in class:Ref
44 this.queue.enqueue(this);
/openjdk7/langtools/test/tools/javac/generics/wildcards/pos/
H A DAmbiguousCast2.java36 static ReferenceQueue<Integer> queue = new ReferenceQueue<Integer>(); field in class:Test
38 public Test(K key, V value, ReferenceQueue<V> queue) { argument
39 super(value, queue);
43 Test<String, Integer> fromQueue = (Test<String, Integer>) queue.remove();

Completed in 182 milliseconds

12345