Searched defs:queue (Results 76 - 100 of 247) sorted by relevance

12345678910

/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/tool/servers/data/rebaselineserver/
H A Dmain.js41 STATE_TO_DISPLAY_STATE[STATE_IN_QUEUE] = 'In queue';
48 var queue; variable
63 queue = new RebaselineQueue();
80 queue.addCurrentTest();
83 queue.removeCurrentTest();
86 queue.rebaseline();
394 queue.updateState();
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/svga/
H A Dsvga_state_rss.c48 svga_queue_rs( &queue, SVGA3D_RS_##token, value ); \
58 svga_queue_rs( &queue, SVGA3D_RS_##token, value ); \
83 struct rs_queue queue; local
86 queue.rs_count = 0;
268 if (queue.rs_count) {
273 queue.rs_count ) != PIPE_OK)
277 queue.rs,
278 queue.rs_count * sizeof queue.rs[0]);
H A Dsvga_state_tss.c77 struct bind_queue queue; local
79 queue.bind_count = 0;
123 queue.bind[queue.bind_count].unit = i;
124 queue.bind[queue.bind_count].view = view;
125 queue.bind_count++;
134 if (queue.bind_count) {
139 queue.bind_count ) != PIPE_OK)
142 for (i = 0; i < queue
187 struct bind_queue queue; local
294 struct ts_queue queue; local
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/egl/wayland/
H A Dnative_wayland.h48 struct wl_event_queue *queue; member in struct:wayland_display
/external/chromium_org/third_party/webrtc/base/
H A Dnatsocketfactory.h123 MessageQueue* queue() { return msg_queue_; } function in class:rtc::NATSocketServer
137 virtual void SetMessageQueue(MessageQueue* queue) { argument
138 msg_queue_ = queue;
139 server_->SetMessageQueue(queue);
/external/deqp/executor/
H A DxeCallQueue.cpp124 // Call queue must be grown.
198 CallWriter::CallWriter (CallQueue* queue, Call::Function function) argument
199 : m_queue (queue)
200 , m_call (queue->getEmptyCall())
/external/deqp/framework/platform/android/
H A DtcuAndroidRenderActivity.cpp47 MESSAGE_QUEUE_SIZE = 8 //!< Length of RenderThread message queue.
107 // \note Thread must be running or otherwise nobody is going to drain the queue.
231 // \todo [2013-05-08 pyry] What if system fills up the input queue before we have window ready?
258 // Thread must keep draining message queue until FINISH message is encountered.
352 void RenderActivity::onInputQueueCreated (AInputQueue* queue) argument
355 m_thread->enqueue(Message(MESSAGE_INPUT_QUEUE_CREATED, queue));
358 void RenderActivity::onInputQueueDestroyed (AInputQueue* queue) argument
361 m_thread->enqueue(Message(MESSAGE_INPUT_QUEUE_DESTROYED, queue));
/external/dhcpcd/
H A Deloop.c54 int queue; member in struct:timeout
113 add_q_timeout_tv(int queue, argument
152 t->queue = queue;
174 add_q_timeout_sec(int queue, time_t when, void (*callback)(void *), void *arg) argument
180 add_q_timeout_tv(queue, &tv, callback, arg);
187 v_delete_q_timeouts(int queue, void *arg, void (*callback)(void *), va_list v) argument
194 if (t->queue == queue && t->arg == arg &&
217 delete_q_timeouts(int queue, voi argument
227 delete_q_timeout(int queue, void (*callback)(void *), void *arg) argument
[all...]
/external/libnl/lib/netfilter/
H A Dqueue.c2 * lib/netfilter/queue.c Netfilter Queue
14 * @defgroup queue Queue
25 #include <netlink/netfilter/queue.h>
111 static int nfnl_queue_build_request(const struct nfnl_queue *queue, argument
116 if (!nfnl_queue_test_group(queue))
120 0, nfnl_queue_get_group(queue));
124 if (nfnl_queue_test_maxlen(queue) &&
126 htonl(nfnl_queue_get_maxlen(queue))) < 0)
132 if (nfnl_queue_test_copy_mode(queue)) {
135 switch (nfnl_queue_get_copy_mode(queue)) {
160 nfnl_queue_build_create_request(const struct nfnl_queue *queue, struct nl_msg **result) argument
182 nfnl_queue_create(struct nl_sock *nlh, const struct nfnl_queue *queue) argument
193 nfnl_queue_build_change_request(const struct nfnl_queue *queue, struct nl_msg **result) argument
199 nfnl_queue_change(struct nl_sock *nlh, const struct nfnl_queue *queue) argument
210 nfnl_queue_build_delete_request(const struct nfnl_queue *queue, struct nl_msg **result) argument
220 nfnl_queue_delete(struct nl_sock *nlh, const struct nfnl_queue *queue) argument
[all...]
/external/llvm/utils/lit/lit/
H A Drun.py6 import Queue as queue namespace
8 import queue namespace
50 # Create a shared queue to provide the test indices.
51 self.queue = queue_impl()
53 self.queue.put(i)
55 self.queue.put(None)
66 return self.queue.get()
116 self.queue = multiprocessing.Queue()
120 # results to the actual display implementation via an output queue.
121 self.queue
[all...]
/external/mesa3d/src/gallium/drivers/svga/
H A Dsvga_state_rss.c48 svga_queue_rs( &queue, SVGA3D_RS_##token, value ); \
58 svga_queue_rs( &queue, SVGA3D_RS_##token, value ); \
83 struct rs_queue queue; local
86 queue.rs_count = 0;
268 if (queue.rs_count) {
273 queue.rs_count ) != PIPE_OK)
277 queue.rs,
278 queue.rs_count * sizeof queue.rs[0]);
H A Dsvga_state_tss.c77 struct bind_queue queue; local
79 queue.bind_count = 0;
123 queue.bind[queue.bind_count].unit = i;
124 queue.bind[queue.bind_count].view = view;
125 queue.bind_count++;
134 if (queue.bind_count) {
139 queue.bind_count ) != PIPE_OK)
142 for (i = 0; i < queue
187 struct bind_queue queue; local
294 struct ts_queue queue; local
[all...]
/external/mesa3d/src/gallium/state_trackers/egl/wayland/
H A Dnative_wayland.h48 struct wl_event_queue *queue; member in struct:wayland_display
/external/mockito/cglib-and-asm/src/org/mockito/asm/tree/analysis/
H A DAnalyzer.java72 private int[] queue; field in class:Analyzer
111 queue = new int[n];
173 int insn = queue[--top];
475 queue[top++] = insn;
504 queue[top++] = insn;
/external/openfst/src/include/fst/script/
H A Drmepsilon.h28 #include <fst/queue.h>
76 AutoQueue<StateId> queue(*fst, distance, EpsilonArcFilter<Arc>());
78 &queue, opts.delta, opts.connect, weight_thresh,
84 FifoQueue<StateId> queue; local
86 &queue, opts.delta, opts.connect, weight_thresh,
92 LifoQueue<StateId> queue; local
94 &queue, opts.delta, opts.connect, weight_thresh,
100 NaturalShortestFirstQueue<StateId, Weight> queue(*distance);
103 &queue, opts.delta, opts.connect, weight_thresh,
109 StateOrderQueue<StateId> queue; local
[all...]
H A Dshortest-distance.h27 #include <fst/queue.h> // for QueueType
110 Queue *queue = local
114 queue, AnyArcFilter<Arc>(), opts.source, opts.delta);
116 delete queue;
120 Queue *queue = local
125 queue, EpsilonArcFilter<Arc>(), opts.source, opts.delta);
127 delete queue;
131 Queue *queue = local
136 queue, InputEpsilonArcFilter<Arc>(), opts.source, opts.delta);
138 delete queue;
142 Queue *queue = local
[all...]
/external/stlport/stlport/stl/
H A D_queue.h59 class queue class in inherits:__stlport_class
62 : public __stlport_class<queue<_Tp> >
64 : public __stlport_class<queue<_Tp, _Sequence> >
70 typedef queue<_Tp> _Self;
72 typedef queue<_Tp, _Sequence> _Self;
86 queue() : c() {} function in class:queue
87 explicit queue(const _Sequence& __c) : c(__c) {} function in class:queue
90 queue(__move_source<_Self> src) function in class:queue
122 operator==(const queue<_STLP_QUEUE_ARGS >& __x, const queue<_STLP_QUEUE_ARG
[all...]
/external/apache-http/src/org/apache/commons/logging/impl/
H A DWeakHashtable.java130 private ReferenceQueue queue = new ReferenceQueue(); field in class:WeakHashtable
246 Referenced keyRef = new Referenced(key, queue);
326 synchronized (queue) {
328 while ((key = (WeakKey) queue.poll()) != null) {
340 synchronized (queue) {
341 WeakKey key = (WeakKey) queue.poll();
415 private Referenced(Object key, ReferenceQueue queue) { argument
416 reference = new WeakKey(key, queue, this);
473 ReferenceQueue queue,
475 super(key, queue);
472 WeakKey(Object key, ReferenceQueue queue, Referenced referenced) argument
[all...]
/external/chromium_org/apps/
H A Dlauncher.cc96 // has outstanding tasks on a message queue it will be retained; once all
249 // the lazy background task queue is used to load the extension and then
251 extensions::LazyBackgroundTaskQueue* const queue = member in class:apps::__anon1836::PlatformAppPathLauncher::extensions
253 if (queue->ShouldEnqueueTask(profile_, extension_)) {
254 queue->AddPendingTask(
/external/chromium_org/cc/layers/
H A Dpainted_scrollbar_layer.cc205 bool PaintedScrollbarLayer::Update(ResourceUpdateQueue* queue, argument
234 ContentsScalingLayer::Update(queue, occlusion);
/external/chromium_org/cc/resources/
H A Done_copy_raster_worker_pool.cc136 void OneCopyRasterWorkerPool::ScheduleTasks(RasterTaskQueue* queue) { argument
166 for (RasterTaskQueue::Item::Vector::const_iterator it = queue->items.begin();
167 it != queue->items.end();
/external/chromium_org/cc/test/
H A Dtiled_layer_test_common.cc17 void FakeLayerUpdater::Resource::Update(ResourceUpdateQueue* queue, argument
25 queue->AppendPartialUpload(upload);
27 queue->AppendFullUpload(upload);
/external/chromium_org/chrome/browser/net/
H A Dpredictor_unittest.cc574 Predictor::HostNameQueue queue; local
578 // First check high priority queue FIFO functionality.
579 EXPECT_TRUE(queue.IsEmpty());
580 queue.Push(first, UrlInfo::LEARNED_REFERAL_MOTIVATED);
581 EXPECT_FALSE(queue.IsEmpty());
582 queue.Push(second, UrlInfo::MOUSE_OVER_MOTIVATED);
583 EXPECT_FALSE(queue.IsEmpty());
584 EXPECT_EQ(queue.Pop(), first);
585 EXPECT_FALSE(queue.IsEmpty());
586 EXPECT_EQ(queue
601 Predictor::HostNameQueue queue; local
[all...]
/external/chromium_org/chrome/browser/ui/app_modal_dialogs/
H A Djavascript_dialog_manager.cc298 AppModalDialogQueue* queue = AppModalDialogQueue::GetInstance(); local
299 AppModalDialog* active_dialog = queue->active_dialog();
302 for (AppModalDialogQueue::iterator i = queue->begin();
303 i != queue->end(); ++i) {
/external/chromium_org/chrome/browser/ui/website_settings/
H A Dpermission_bubble_manager.cc109 // correct behavior on interstitials -- we probably want to basically queue
388 const std::vector<PermissionBubbleRequest*>& queue,
393 for (iter = queue.begin(); iter != queue.end(); iter++) {
408 const std::vector<PermissionBubbleRequest*>& queue) {
410 for (iter = queue.begin(); iter != queue.end(); iter++) {
386 ExistingRequest( PermissionBubbleRequest* request, const std::vector<PermissionBubbleRequest*>& queue, bool* same_object) argument
407 HasUserGestureRequest( const std::vector<PermissionBubbleRequest*>& queue) argument

Completed in 4402 milliseconds

12345678910