Searched defs:queue (Results 176 - 200 of 247) sorted by relevance

12345678910

/external/doclava/src/com/google/doclava/
H A DMethodInfo.java47 private static void addInterfaces(ArrayList<ClassInfo> ifaces, ArrayList<ClassInfo> queue) { argument
49 queue.add(i);
52 addInterfaces(i.interfaces(), queue);
67 ArrayList<ClassInfo> queue = new ArrayList<ClassInfo>();
68 addInterfaces(containingClass().interfaces(), queue);
69 for (ClassInfo iface : queue) {
80 private static void addRealInterfaces(ArrayList<ClassInfo> ifaces, ArrayList<ClassInfo> queue) { argument
82 queue.add(i);
84 queue.add(i.superclass());
88 addInterfaces(i.realInterfaces(), queue);
[all...]
/external/guava/guava-tests/test/com/google/common/collect/
H A DIterablesTest.java1200 Queue<Integer> queue = Lists.newLinkedList(asList(5, 14));
1203 Iterables.consumingIterable(queue).iterator();
1205 assertEquals(5, queue.peek().intValue());
1208 assertEquals(14, queue.peek().intValue());
1210 assertTrue(queue.isEmpty());
1214 Queue<Integer> queue =
1218 Iterables.consumingIterable(queue).iterator();
1227 private Queue<T> queue; field in class:IterablesTest.UnIterableQueue
1229 UnIterableQueue(Queue<T> queue) { argument
1230 this.queue
[all...]
H A DMapMakerInternalMapTest.java1859 public ValueReference<K, V> copyFor(ReferenceQueue<V> queue, ReferenceEntry<K, V> entry) { argument
/external/linux-tools-perf/perf-3.12.0/tools/perf/util/
H A Dannotate.c642 int max_lines, struct disasm_line *queue)
685 if (queue != NULL) {
686 list_for_each_entry_from(queue, &notes->src->source, node) {
687 if (queue == dl)
689 disasm_line__print(queue, sym, start, evsel, len,
728 if (queue)
1222 struct disasm_line *pos, *queue = NULL; local
1254 if (context && queue == NULL) {
1255 queue = pos;
1261 queue)) {
640 disasm_line__print(struct disasm_line *dl, struct symbol *sym, u64 start, struct perf_evsel *evsel, u64 len, int min_pcnt, int printed, int max_lines, struct disasm_line *queue) argument
[all...]
/external/qemu/distrib/mini-glib/src/
H A Dglib-mini.c705 GQueue* queue = g_new0(GQueue, 1); local
706 return queue;
709 void g_queue_free(GQueue* queue) { argument
710 GQueueNode* node = queue->head;
716 queue->head = queue->tail = NULL;
717 queue->length = 0;
718 g_free(queue);
721 gboolean g_queue_is_empty(GQueue* queue) { argument
722 return queue
725 g_queue_push_tail(GQueue* queue, void* data) argument
734 g_queue_peek_head(GQueue* queue) argument
738 g_queue_peek_tail(GQueue* queue) argument
742 g_queue_pop_head(GQueue* queue) argument
[all...]
/external/skia/experimental/Intersection/
H A DEdgeWalker_TestUtility.cpp479 State4* State4::queue = NULL; member in class:State4
515 while (!State4::queue) {
519 statePtr = State4::queue;
527 State4::queue = NULL; member in class:State4
530 State4::queue = &threadState[index]; member in class:State4
535 State4::queue ? State4::queue->index : -1);
709 State4::queue = &state; member in class:State4
728 while (!State4::queue) {
732 while (State4::queue) {
746 State4::queue = next; member in class:State4
[all...]
/external/valgrind/main/drd/tests/
H A Dtsan_thread_wrappers_pthread.h50 #include <queue>
371 /// Just a message queue.
392 // Blocks if the queue is empty.
402 // If queue is not empty,
403 // remove an element from queue, put it into *res and return true.
414 std::queue<void*> q_; // protected by mu_
426 static bool IsQueueNotEmpty(std::queue<void*> * queue) { argument
427 return !queue->empty();
/external/wpa_supplicant_8/hostapd/
H A Dconfig_file.c874 struct hostapd_tx_queue_params *queue; local
897 queue = &conf->tx_queue[num];
900 queue->aifs = atoi(val);
901 if (queue->aifs < 0 || queue->aifs > 255) {
903 queue->aifs);
907 queue->cwmin = atoi(val);
908 if (!valid_cw(queue->cwmin)) {
910 queue->cwmin);
914 queue
[all...]
/external/wpa_supplicant_8/hostapd/src/ap/
H A Dap_drv_ops.c621 int hostapd_set_tx_queue_params(struct hostapd_data *hapd, int queue, int aifs, argument
626 return hapd->driver->set_tx_queue_params(hapd->drv_priv, queue, aifs,
/external/wpa_supplicant_8/src/ap/
H A Dap_drv_ops.c621 int hostapd_set_tx_queue_params(struct hostapd_data *hapd, int queue, int aifs, argument
626 return hapd->driver->set_tx_queue_params(hapd->drv_priv, queue, aifs,
/external/wpa_supplicant_8/wpa_supplicant/src/ap/
H A Dap_drv_ops.c621 int hostapd_set_tx_queue_params(struct hostapd_data *hapd, int queue, int aifs, argument
626 return hapd->driver->set_tx_queue_params(hapd->drv_priv, queue, aifs,
/external/chromium_org/cc/layers/
H A Dlayer.cc1057 bool Layer::Update(ResourceUpdateQueue* queue, argument
/external/chromium_org/cc/trees/
H A Dlayer_tree_host.cc736 bool LayerTreeHost::UpdateLayers(ResourceUpdateQueue* queue) { argument
744 bool result = UpdateLayers(root_layer(), queue);
809 ResourceUpdateQueue* queue) {
878 update_list, queue, &did_paint_content, &need_more_updates);
990 ResourceUpdateQueue* queue,
1000 *did_paint_content |= mask_layer->Update(queue, NULL);
1008 *did_paint_content |= replica_mask_layer->Update(queue, NULL);
1015 ResourceUpdateQueue* queue,
1039 *it, queue, did_paint_content, need_more_updates);
1042 *did_paint_content |= it->Update(queue,
808 UpdateLayers(Layer* root_layer, ResourceUpdateQueue* queue) argument
989 PaintMasksForRenderSurface(Layer* render_surface_layer, ResourceUpdateQueue* queue, bool* did_paint_content, bool* need_more_updates) argument
1013 PaintLayerContents( const RenderSurfaceLayerList& render_surface_layer_list, ResourceUpdateQueue* queue, bool* did_paint_content, bool* need_more_updates) argument
[all...]
H A Dlayer_tree_impl.cc198 // The request queue should have been processed and does not require a push.
1018 const UIResourceRequestQueue& queue) {
1019 ui_resource_request_queue_ = queue;
1049 // If all UI resource evictions were not recreated by processing this queue,
1017 set_ui_resource_request_queue( const UIResourceRequestQueue& queue) argument
H A Dthread_proxy.cc415 // The texture upload queue may reference textures that were just purged,
416 // clear them from the queue.
808 scoped_ptr<ResourceUpdateQueue> queue = local
811 bool updated = layer_tree_host()->UpdateLayers(queue.get());
865 queue.release()));
898 scoped_ptr<ResourceUpdateQueue> queue(raw_queue);
913 queue->ClearUploadsToEvictedResources();
926 queue.Pass(),
H A Dlayer_tree_host_unittest.cc969 virtual bool Update(ResourceUpdateQueue* queue,
971 bool updated = ContentLayer::Update(queue, occlusion);
1652 bool EvictionTestLayer::Update(ResourceUpdateQueue* queue, argument
1661 queue->AppendFullUpload(upload);
/external/chromium_org/ui/aura/gestures/
H A Dgesture_recognizer_unittest.cc30 #include <queue>
365 void set_queue_events(bool queue) { queue_events_ = queue; } argument
375 std::queue<ui::TouchEvent*> queue_;
1708 scoped_ptr<aura::Window> queue(CreateTestWindowWithDelegate(
1711 queued_delegate->set_window(queue.get());
/external/guava/guava-tests/test/com/google/common/cache/
H A DLocalCacheTest.java2637 public ValueReference<K, V> copyFor(ReferenceQueue<V> queue, ReferenceEntry<K, V> entry) { argument
/external/nanohttpd/core/src/main/java/fi/iki/elonen/
H A DNanoHTTPD.java1373 private ArrayList<Cookie> queue = new ArrayList<Cookie>(); field in class:NanoHTTPD.CookieHandler
1410 queue.add(new Cookie(name, value, Cookie.getHTTPTime(expires)));
1414 queue.add(cookie);
1432 for (Cookie cookie : queue) {
/external/strace/
H A Ddefs.h434 struct queue_t* queue; member in struct:tcb
/external/chromium_org/net/spdy/
H A Dspdy_session.cc907 // |request| should not be in a queue not matching its priority.
911 PendingStreamRequestQueue* queue = &pending_create_stream_queues_[i]; local
912 DCHECK(std::find_if(queue->begin(),
913 queue->end(),
914 RequestEquals(request)) == queue->end());
918 PendingStreamRequestQueue* queue = local
920 // Remove |request| from |queue| while preserving the order of the
923 std::find_if(queue->begin(), queue->end(), RequestEquals(request));
926 if (it != queue
3251 std::deque<SpdyStreamId>* queue = &stream_send_unstall_queue_[i]; local
[all...]
/external/guava/guava/src/com/google/common/cache/
H A DLocalCache.java110 * This implementation uses a per-segment queue to record a memento of the additions, removals,
111 * and accesses that were performed on the map. The queue is drained on writes and when it exceeds
146 * the cleanup queue and both reference queues.
651 ValueReference<K, V> copyFor(ReferenceQueue<V> queue, ReferenceEntry<K, V> entry); argument
697 ReferenceQueue<Object> queue, ReferenceEntry<Object, Object> entry) {
787 * Returns the next entry in the access queue.
792 * Sets the next entry in the access queue.
797 * Returns the previous entry in the access queue.
802 * Sets the previous entry in the access queue.
823 * Returns the next entry in the write queue
1346 WeakEntry(ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1450 WeakAccessEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1498 WeakWriteEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1546 WeakAccessWriteEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1639 WeakValueReference(ReferenceQueue<V> queue, V referent, ReferenceEntry<K, V> entry) argument
1658 copyFor( ReferenceQueue<V> queue, ReferenceEntry<K, V> entry) argument
1686 SoftValueReference(ReferenceQueue<V> queue, V referent, ReferenceEntry<K, V> entry) argument
1705 copyFor(ReferenceQueue<V> queue, ReferenceEntry<K, V> entry) argument
1751 copyFor(ReferenceQueue<V> queue, ReferenceEntry<K, V> entry) argument
1780 WeightedWeakValueReference(ReferenceQueue<V> queue, V referent, ReferenceEntry<K, V> entry, int weight) argument
1792 copyFor( ReferenceQueue<V> queue, ReferenceEntry<K, V> entry) argument
1804 WeightedSoftValueReference(ReferenceQueue<V> queue, V referent, ReferenceEntry<K, V> entry, int weight) argument
1815 copyFor(ReferenceQueue<V> queue, ReferenceEntry<K, V> entry) argument
3604 copyFor(ReferenceQueue<V> queue, ReferenceEntry<K, V> entry) argument
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DMapMakerInternalMap.java91 * This implementation uses a per-segment queue to record a memento of the additions, removals,
92 * and accesses that were performed on the map. The queue is drained on writes and when it exceeds
127 * the cleanup queue and both reference queues.
609 ValueReference<K, V> copyFor(ReferenceQueue<V> queue, ReferenceEntry<K, V> entry); argument
643 ReferenceQueue<Object> queue, ReferenceEntry<Object, Object> entry) {
1224 SoftEntry(ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) { argument
1225 super(key, queue);
1320 ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
1321 super(queue, key, hash, next);
1368 ReferenceQueue<K> queue,
1319 SoftExpirableEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1367 SoftEvictableEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1403 SoftExpirableEvictableEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1481 WeakEntry(ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1577 WeakExpirableEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1625 WeakEvictableEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1661 WeakExpirableEvictableEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1742 WeakValueReference(ReferenceQueue<V> queue, V referent, ReferenceEntry<K, V> entry) argument
1758 copyFor( ReferenceQueue<V> queue, ReferenceEntry<K, V> entry) argument
1781 SoftValueReference(ReferenceQueue<V> queue, V referent, ReferenceEntry<K, V> entry) argument
1797 copyFor(ReferenceQueue<V> queue, ReferenceEntry<K, V> entry) argument
1833 copyFor(ReferenceQueue<V> queue, ReferenceEntry<K, V> entry) argument
[all...]
/external/kernel-headers/original/uapi/sound/
H A Dasequencer.h73 #define SNDRV_SEQ_EVENT_SETPOS_TICK 33 /* set tick queue position */
74 #define SNDRV_SEQ_EVENT_SETPOS_TIME 34 /* set realtime queue position */
78 #define SNDRV_SEQ_EVENT_QUEUE_SKEW 38 /* skew queue tempo */
248 /* queue timer control */
250 unsigned char queue; /* affected queue */ member in struct:snd_seq_ev_queue_control
276 unsigned char queue; /* schedule queue */ member in struct:snd_seq_event
289 struct snd_seq_ev_queue_control queue; member in union:snd_seq_event::__anon23538
393 unsigned char queue; /* Queu member in struct:snd_seq_remove_events
472 int queue; /* queue id */ member in struct:snd_seq_queue_info
488 int queue; /* queue id */ member in struct:snd_seq_queue_status
500 int queue; /* sequencer queue */ member in struct:snd_seq_queue_tempo
516 int queue; /* sequencer queue */ member in struct:snd_seq_queue_timer
529 int queue; /* sequencer queue */ member in struct:snd_seq_queue_client
547 unsigned char queue; /* input time-stamp queue (optional) */ member in struct:snd_seq_port_subscribe
562 unsigned char queue; /* R/O: result */ member in struct:snd_seq_query_subs
[all...]
/external/owasp/sanitizer/tools/findbugs/lib/
H A Dasm-analysis-3.3.jar ... .analysis.Subroutine[] subroutines private boolean[] queued private int[] queue private int top public void " href="/5.1.0 ...

Completed in 1132 milliseconds

12345678910