/openjdk7/jdk/src/macosx/native/sun/osxapp/ |
H A D | QueuingApplicationDelegate.h | 35 NSMutableArray* queue; variable 47 @property(retain) NSMutableArray* queue; variable
|
/openjdk7/langtools/test/tools/javac/capture/ |
H A D | Capture3.java | 41 Q<? super T> queue; field in class:Ref 44 this.queue.enqueue(this);
|
/openjdk7/langtools/test/tools/javac/generics/wildcards/pos/ |
H A D | AmbiguousCast2.java | 36 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();
|
/openjdk7/jdk/src/share/classes/com/sun/jndi/ldap/pool/ |
H A D | ConnectionsWeakRef.java | 62 ConnectionsWeakRef (ConnectionsRef connsRef, ReferenceQueue queue) { argument 63 super(connsRef, queue);
|
H A D | Pool.java | 63 * a reference queue. 67 * ConnectionsWeakRef object into the reference queue. 68 * The reference queue is monitored lazily for reclaimable Connections 86 private static final ReferenceQueue queue = new ReferenceQueue(); field in class:Pool 138 Reference weakRef = new ConnectionsWeakRef(connsRef, queue); 187 while ((releaseRef = (ConnectionsWeakRef) queue.poll())
|
/openjdk7/jdk/src/share/classes/com/sun/tools/jdi/ |
H A D | InternalEventHandler.java | 34 EventQueueImpl queue; field in class:InternalEventHandler 37 InternalEventHandler(VirtualMachineImpl vm, EventQueueImpl queue) argument 40 this.queue = queue; 54 EventSet eventSet = queue.removeInternal();
|
/openjdk7/jdk/test/sun/management/jmxremote/ |
H A D | LocalRMIServerSocketFactoryTest.java | 45 private static final SynchronousQueue<Exception> queue = field in class:LocalRMIServerSocketFactoryTest 59 final Exception x = queue.take(); 106 queue.put(error);
|
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/istack/internal/ |
H A D | Pool.java | 62 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/jdk/src/share/sample/jmx/jmx-scandir/src/com/sun/jmx/examples/scandir/ |
H A D | ScanDirAgent.java | 88 // 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/jdk/src/share/classes/java/lang/ref/ |
H A D | Reference.java | 49 * 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 D | Finalizer.java | 41 private static ReferenceQueue queue = new ReferenceQueue(); field in class:Finalizer 84 super(finalizee, queue); 151 Finalizer f = (Finalizer)queue.poll(); 189 Finalizer f = (Finalizer)queue.remove();
|
/openjdk7/jdk/src/share/classes/com/sun/jmx/remote/internal/ |
H A D | ArrayQueue.java | 34 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/jaxws/src/share/jaxws_classes/com/sun/xml/internal/messaging/saaj/util/ |
H A D | ParserPool.java | 43 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/jaxws/src/share/jaxws_classes/com/sun/xml/internal/ws/util/ |
H A D | Pool.java | 52 // volatile since multiple threads may access queue reference 53 private volatile WeakReference<ConcurrentLinkedQueue<T>> queue; field in class:Pool 72 WeakReference<ConcurrentLinkedQueue<T>> q = queue; 79 // overwrite the queue 81 queue = new WeakReference<ConcurrentLinkedQueue<T>>(d);
|
/openjdk7/jdk/src/share/classes/sun/util/locale/ |
H A D | LocaleObjectCache.java | 41 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/test/java/util/concurrent/BlockingQueue/ |
H A D | CancelledProducerConsumerLoops.java | 129 /* unbounded queue implementations are prone to OOME 136 final BlockingQueue<Integer> queue; field in class:CancelledProducerConsumerLoops.Stage 140 queue = q; 158 if (!queue.offer(new Integer(l), 1, TimeUnit.SECONDS)) 175 Integer x = queue.poll(1, TimeUnit.SECONDS);
|
H A D | SingleProducerMultipleConsumerLoops.java | 91 final BlockingQueue<Integer> queue; field in class:SingleProducerMultipleConsumerLoops.Stage 95 queue = q; 110 queue.put(new Integer(i)); 134 Integer item = queue.take();
|
H A D | MultipleProducersSingleConsumerLoops.java | 110 final BlockingQueue<Integer> queue; field in class:MultipleProducersSingleConsumerLoops.Stage 113 queue = q; 132 queue.put(new Integer(l)); 155 s += queue.take().intValue();
|
H A D | ProducerConsumerLoops.java | 107 final BlockingQueue<Integer> queue; field in class:ProducerConsumerLoops.Stage 110 queue = q; 128 queue.put(new Integer(l)); 152 l = LoopHelpers.compute1(queue.take().intValue());
|
/openjdk7/corba/src/share/classes/com/sun/corba/se/impl/encoding/ |
H A D | BufferManagerWriteCollect.java | 51 private BufferQueue queue = new BufferQueue(); field in class:BufferManagerWriteCollect 77 // queue, and allocate a new bbwi. 84 queue.enqueue(bbwi); 110 queue.enqueue(((CDROutputObject)outputObject).getByteBufferWithInfo()); 174 // iterate thru queue and release any ByteBufferWithInfo's 175 // ByteBuffer that may be remaining on the queue to the 218 return queue.size() != 0; 223 return queue.dequeue();
|
/openjdk7/jdk/src/share/classes/javax/swing/ |
H A D | ActionPropertyChangeListener.java | 55 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/beans/ |
H A D | WeakIdentityMap.java | 45 private final ReferenceQueue<Object> queue = new ReferenceQueue<Object>(); field in class:WeakIdentityMap 80 this.table[index] = new Entry<T>(key, hash, value, this.queue, this.table[index]); 90 // If ignoring null elements and processing ref queue caused massive 106 for (Object ref = this.queue.poll(); ref != null; ref = this.queue.poll()) { 170 Entry(Object key, int hash, T value, ReferenceQueue<Object> queue, Entry<T> next) { argument 171 super(key, queue);
|
/openjdk7/jdk/src/share/native/com/sun/media/sound/ |
H A D | PlatformMidi.c | 83 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...] |
/openjdk7/jdk/src/share/classes/sun/java2d/ |
H A D | Disposer.java | 50 private static final ReferenceQueue queue = new ReferenceQueue(); field in class:Disposer 135 ref = new PhantomReference(target, queue); 137 ref = new WeakReference(target, queue); 145 Object obj = queue.remove(); 187 * Set to indicate the queue is presently being polled. 210 while ((obj = queue.poll()) != null 243 * WARNING: this thread class monitors a specific queue, so a reference 244 * added here must have been created with this queue. Failure to do 246 * the reference queue. 253 records.put(new WeakReference(obj, queue) , re [all...] |
/openjdk7/jdk/src/share/classes/sun/misc/ |
H A D | Queue.java | 32 * 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...] |