| /external/emma/tools/java/com/vladium/tools/ |
| ClassDep.java | 125 final LinkedList /* class VM name:String */ queue = new LinkedList (); local
128 queue.add (Descriptors.javaNameToVMName (m_rootSet [i]));
134 while (! queue.isEmpty ())
136 final String classVMName = (String) queue.removeFirst ();
173 queue.addLast (classDepVMName);
|
| /external/iproute2/ip/ |
| ipntable.c | 54 " [ delay_probe MSEC ] [ queue LEN ]\n"
204 } else if (strcmp(*argv, "queue") == 0) {
205 __u32 queue; local
209 if (get_u32(&queue, *argv, 0))
210 invarg("\"queue\" value is invalid", *argv);
215 NDTPA_QUEUE_LEN, queue);
511 __u32 queue = rta_getattr_u32(tpb[NDTPA_QUEUE_LEN]); local
512 fprintf(fp, "queue %u ", queue);
|
| /external/javassist/src/main/javassist/util/ |
| HotSwapper.java | 243 EventQueue queue = jvm.eventQueue(); local
244 return queue.remove();
|
| /external/smali/util/src/main/java/ds/tree/ |
| RadixTreeImpl.java | 34 import java.util.Queue;
270 Queue<RadixTreeNode<T>> queue = new LinkedList<RadixTreeNode<T>>(); local
272 queue.addAll(parent.getChildern());
274 while (!queue.isEmpty()) {
275 RadixTreeNode<T> node = queue.remove();
284 queue.addAll(node.getChildern());
|
| /frameworks/av/media/libstagefright/rtsp/ |
| AMPEG4ElementaryAssembler.cpp | 208 List<sp<ABuffer> > *queue = source->queue(); local
210 if (queue->empty()) {
215 List<sp<ABuffer> >::iterator it = queue->begin();
216 while (it != queue->end()) {
221 it = queue->erase(it);
224 if (queue->empty()) {
229 sp<ABuffer> buffer = *queue->begin();
368 queue->erase(queue->begin())
[all...] |
| /frameworks/base/core/java/android/os/ |
| Looper.java | 106 * Run the message queue in this thread. Be sure to call
114 final MessageQueue queue = me.mQueue; local
122 Message msg = queue.next(); // might block
124 // No message indicates that the message queue is quitting.
203 * more messages in the message queue.
205 * Any attempt to post messages to the queue after the looper is asked to quit will fail.
223 * in the message queue that are already due to be delivered have been handled.
227 * Any attempt to post messages to the queue after the looper is asked to quit will fail.
236 * Posts a synchronization barrier to the Looper's message queue.
238 * Message processing occurs as usual until the message queue encounters th
[all...] |
| /frameworks/base/core/jni/ |
| android_view_InputQueue.cpp | 202 sp<InputQueue> queue = InputQueue::createQueue(queueWeak, messageQueue->getLooper()); local
203 if (!queue.get()) {
207 queue->incStrong(&gInputQueueClassInfo);
208 return reinterpret_cast<jlong>(queue.get());
212 sp<InputQueue> queue = reinterpret_cast<InputQueue*>(ptr); local
213 queue->detachLooper();
214 queue->decStrong(&gInputQueueClassInfo);
219 InputQueue* queue = reinterpret_cast<InputQueue*>(ptr); local
220 KeyEvent* event = queue->createKeyEvent();
223 queue->recycleInputEvent(event)
237 sp<InputQueue> queue = reinterpret_cast<InputQueue*>(ptr); local
[all...] |
| /frameworks/base/libs/hwui/renderthread/ |
| RenderThread.cpp | 63 void TaskQueue::queue(RenderTask* task) { function in class:android::uirenderer::renderthread::TaskQueue
66 LOG_ALWAYS_FATAL_IF(task->mNext || mTail == task, "Task is already in the queue!");
110 "Cannot remove a task that isn't in the queue!");
218 ATRACE_NAME("queue mFrameCallbackTask");
265 // Process our queue, if we have anything
300 void RenderThread::queue(RenderTask* task) { function in class:android::uirenderer::renderthread::RenderThread
302 mQueue.queue(task);
317 queue(task);
|
| /frameworks/base/services/core/java/com/android/server/am/ |
| BroadcastRecord.java | 67 BroadcastQueue queue; // the outbound queue handling this broadcast field in class:BroadcastRecord
182 queue = _queue;
|
| /frameworks/base/tests/CoreTests/android/core/ |
| HeapTest.java | 230 ReferenceQueue<Object> queue) {
233 refs[i] = new PhantomReference<Object>(objects[i], queue);
238 ReferenceQueue<T> queue) {
242 * the queue are marked as enqueued. Once we
243 * pull them off the queue, they will no longer
258 /* Make sure that all of the references on the queue
262 while ((ref = (PhantomReference<T>) queue.poll()) != null) {
273 "unexpected ref on queue");
316 ReferenceQueue<Object> queue = new ReferenceQueue<Object>(); local
321 makeRefs(objects, refs, queue);
[all...] |
| /frameworks/base/tests/touchlag/ |
| touchlag.cpp | 189 struct Queue {
195 Queue() : index(0) { }
251 Queue queue; local
277 queue.push(x, y);
278 queue.get(lag, &lag_x, &lag_y);
|
| /hardware/samsung_slsi/exynos5/include/ |
| gralloc_priv.h | 56 void *queue; member in struct:private_module_t
|
| /packages/apps/UnifiedEmail/src/com/android/mail/browse/ |
| MessageAttachmentTile.java | 139 PriorityQueue<MessageAttachmentTile> queue = new PriorityQueue<MessageAttachmentTile>( local
143 queue.add(tile);
150 MessageAttachmentTile tile = queue.remove();
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| MinMaxPriorityQueueTest.java | 52 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
54 assertEquals(11, queue.capacity());
55 checkUnbounded(queue);
56 checkNatural(queue);
60 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
63 assertEquals(11, queue.capacity());
64 checkUnbounded(queue);
65 assertSame(SOME_COMPARATOR, queue.comparator());
69 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
72 assertEquals(8, queue.capacity())
78 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
88 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
97 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
107 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
120 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
129 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
139 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
149 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
161 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
[all...] |
| /developers/build/prebuilts/gradle/MediaRouter/Application/src/main/java/com/example/android/mediarouter/player/ |
| SessionManager.java | 31 * SessionManager manages a media session as a queue. It supports common
89 // If queue is empty, don't forget to call onPlaylistReady()!
350 List<PlaylistItem> queue = local
368 queue.add(item);
372 mPlaylist = queue;
404 String result = "Media Queue: ";
|
| /developers/samples/android/media/MediaRouter/Application/src/main/java/com/example/android/mediarouter/player/ |
| SessionManager.java | 31 * SessionManager manages a media session as a queue. It supports common
89 // If queue is empty, don't forget to call onPlaylistReady()!
350 List<PlaylistItem> queue = local
368 queue.add(item);
372 mPlaylist = queue;
404 String result = "Media Queue: ";
|
| /development/samples/Support7Demos/src/com/example/android/supportv7/media/ |
| SessionManager.java | 29 * SessionManager manages a media session as a queue. It supports common
85 // If queue is empty, don't forget to call onPlaylistReady()!
358 List<PlaylistItem> queue = local
376 queue.add(item);
380 mPlaylist = queue;
412 String result = "Media Queue: ";
|
| /development/samples/browseable/MediaRouter/src/com.example.android.mediarouter/player/ |
| SessionManager.java | 31 * SessionManager manages a media session as a queue. It supports common
89 // If queue is empty, don't forget to call onPlaylistReady()!
350 List<PlaylistItem> queue = local
368 queue.add(item);
372 mPlaylist = queue;
404 String result = "Media Queue: ";
|
| /external/chromium_org/cc/resources/ |
| raster_worker_pool_perftest.cc | 202 void BuildRasterTaskQueue(RasterTaskQueue* queue,
209 queue->items.push_back(
304 // Avoid unnecessary heap allocations by reusing the same queue.
305 RasterTaskQueue queue; local
309 queue.Reset();
310 BuildRasterTaskQueue(&queue, raster_tasks);
311 raster_worker_pool_->AsRasterizer()->ScheduleTasks(&queue);
340 // Avoid unnecessary heap allocations by reusing the same queue.
341 RasterTaskQueue queue; local
346 queue.Reset()
375 RasterTaskQueue queue; local
498 RasterTaskQueue queue; local
[all...] |
| tile_manager_unittest.cc | 98 virtual void BuildRasterQueue(RasterTilePriorityQueue* queue,
100 virtual void BuildEvictionQueue(EvictionTilePriorityQueue* queue,
606 RasterTilePriorityQueue queue; local
607 host_impl_.BuildRasterQueue(&queue, SAME_PRIORITY_FOR_BOTH_TREES);
608 EXPECT_FALSE(queue.IsEmpty());
612 while (!queue.IsEmpty()) {
613 EXPECT_TRUE(queue.Top());
614 all_tiles.insert(queue.Top());
616 queue.Pop();
624 queue.Reset()
791 EvictionTilePriorityQueue queue; local
1012 EvictionTilePriorityQueue queue; local
1054 RasterTilePriorityQueue queue; local
1119 EvictionTilePriorityQueue queue; local
[all...] |
| /external/chromium_org/cc/trees/ |
| single_thread_proxy.cc | 181 scoped_ptr<ResourceUpdateQueue> queue = local
184 layer_tree_host_->UpdateLayers(queue.get());
211 queue.Pass(),
|
| /external/chromium_org/media/base/android/java/src/org/chromium/media/ |
| UsbMidiDeviceAndroid.java | 127 request.queue(buffer, buffer.remaining());
158 request.queue(buffer, buffer.capacity());
202 // We use bulkTransfer instead of UsbRequest.queue because queueing
220 request.queue(ByteBuffer.wrap(bs), bs.length);
|
| /external/chromium_org/net/spdy/ |
| spdy_priority_tree.h | 11 #include <queue>
448 List queue; local
454 queue.push_back(*it);
456 while (!queue.empty()) {
457 NodeId current_node_id = queue.front();
471 queue.push_back(*it);
486 // Remove this node from the queue.
487 queue.pop_front();
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/Dromaeo/resources/dromaeo/web/ |
| webrunner.js | 209 // Queue of functions to run
210 var queue = []; variable
352 // Remove the next test from the queue and execute it
354 if ( interval && queue.length ) {
357 status: { current: totalTestItems - queue.length,
361 queue.shift()();
362 } else if ( queue.length == 0 ) {
412 queue = queue.concat( queues[ names[n] ] );
415 totalTestItems = queue.length
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/inspector/ |
| DOMPatchSupport.cpp | 489 Deque<Digest*> queue; local
490 queue.append(digest);
491 while (!queue.isEmpty()) {
492 Digest* first = queue.takeFirst();
495 queue.append(first->m_children[i].get());
|
