Searched defs:queue (Results 51 - 75 of 134) sorted by relevance

123456

/external/javassist/src/main/javassist/bytecode/analysis/
H A DAnalyzer.java133 IntQueue queue = new IntQueue();
141 queue.add(iter.next());
142 while (!queue.isEmpty()) {
143 analyzeNextEntry(method, iter, queue, executor);
168 IntQueue queue, Executor executor) throws BadBytecode {
169 int pos = queue.take();
185 mergeTableSwitch(queue, pos, iter, frame);
187 mergeLookupSwitch(queue, pos, iter, frame);
189 mergeRet(queue, iter, pos, frame, subroutine);
195 mergeJsr(queue, frame
167 analyzeNextEntry(MethodInfo method, CodeIterator iter, IntQueue queue, Executor executor) argument
276 merge(IntQueue queue, Frame frame, int target) argument
292 mergeExceptionHandlers(IntQueue queue, MethodInfo method, int pos, Frame frame) argument
306 mergeJsr(IntQueue queue, Frame frame, Subroutine sub, int pos, int next) argument
347 mergeLookupSwitch(IntQueue queue, int pos, CodeIterator iter, Frame frame) argument
361 mergeRet(IntQueue queue, CodeIterator iter, int pos, Frame frame, Subroutine subroutine) argument
400 mergeTableSwitch(IntQueue queue, int pos, CodeIterator iter, Frame frame) argument
[all...]
/external/jmonkeyengine/engine/src/core/com/jme3/renderer/
H A DViewPort.java37 import com.jme3.renderer.queue.RenderQueue;
70 protected final RenderQueue queue = new RenderQueue(); field in class:ViewPort
272 return queue;
/external/jmonkeyengine/engine/src/core/com/jme3/scene/
H A DGeometry.java464 protected void breadthFirstTraversal(SceneGraphVisitor visitor, Queue<Spatial> queue) { argument
H A DNode.java639 protected void breadthFirstTraversal(SceneGraphVisitor visitor, Queue<Spatial> queue) { argument
640 queue.addAll(children);
/external/libppp/src/
H A Dlink.c97 struct mqueue *queue, *highest; local
102 for (queue = l->Queue; queue < highest; queue++)
103 while (queue->len)
104 m_enqueue(highest, m_dequeue(queue));
110 struct mqueue *queue, *highest; local
113 for (queue = l->Queue; queue <= highest; queue
153 struct mqueue *queue, *highest; local
[all...]
H A Dmbuf.c70 struct mbuf *queue; member in struct:memmap
349 log_Printf(LogDEBUG, "m_dequeue: queue len = %lu\n", (u_long)q->len);
367 m_enqueue(struct mqueue *queue, struct mbuf *bp) argument
370 if (queue->last) {
371 queue->last->m_nextpkt = bp;
372 queue->last = bp;
374 queue->last = queue->top = bp;
375 queue->len++;
376 log_Printf(LogDEBUG, "m_enqueue: len = %lu\n", (unsigned long)queue
[all...]
H A Dipv6cp.c424 struct mqueue *queue; local
441 queue = ipv6cp->Queue + IPV6CP_QUEUES(ipv6cp) - 1;
443 if (queue->top) {
444 bp = m_dequeue(queue);
458 } while (queue-- != ipv6cp->Queue);
/external/replicaisland/src/com/replica/replicaisland/
H A DGameRenderer.java31 * queue of renderable objects from the thread and uses that to draw the scene every frame. If
32 * no queue is available then no drawing is performed. If the queue is not changed from frame to
178 /** Draws the scene. Note that the draw queue is locked for the duration of this function. */
229 // If we have no draw queue, clear the screen. If we have a draw queue that
295 public synchronized void setDrawQueue(ObjectManager queue, float cameraX, float cameraY) { argument
296 mDrawQueue = queue;
/external/valgrind/unittest/
H A Dthread_wrappers.h43 #include <queue>
102 /// Just a message queue.
123 // Blocks if the queue is empty.
133 // If queue is not empty,
134 // remove an element from queue, put it into *res and return true.
145 std::queue<void*> q_; // protected by mu_
157 static bool IsQueueNotEmpty(std::queue<void*> * queue) { argument
158 return !queue->empty();
/external/webkit/Source/WebKit/android/jni/
H A DWebIconDatabase.cpp92 // on the WebCore thread, so switching threads via this queue is superfluous
159 // Swap the notifications queue
160 Vector<WTF::String> queue; local
162 queue.swap(mNotifications);
166 // Swap the clients queue
170 for (unsigned i = 0; i < queue.size(); ++i) {
172 clients[j]->didAddIconForPageUrl(queue[i]);
/external/webkit/Source/WebKit/win/
H A DWebIconDatabase.cpp417 Vector<String> queue; local
420 queue.swap(m_sharedWebIconDatabase->m_notificationQueue);
424 for (unsigned i = 0; i < queue.size(); ++i) {
425 if (queue[i].isNull())
428 postDidAddIconNotification(queue[i], m_sharedWebIconDatabase);
/external/webkit/Tools/Scripts/webkitpy/layout_tests/layout_package/
H A Dmanager_worker_broker_unittest.py193 starting_queue = self.queue()
194 stopping_queue = self.queue()
244 def queue(self): member in class:InlineBrokerTests.MultiProcessBrokerTests
253 def queue(self): member in class:ThreadedBrokerTests
/external/chromium/base/
H A Dmessage_loop.h9 #include <queue>
372 class TaskQueue : public std::queue<PendingTask> {
374 void Swap(TaskQueue* queue) { argument
375 c.swap(queue->c); // Calls std::deque::swap
429 // Post a task to our incomming queue.
450 // this queue is only accessed (push/pop) by our current thread.
459 // A queue of non-nestable tasks that we had to defer because when it came
/external/chromium/third_party/libevent/
H A Devent.c42 #include <sys/queue.h>
200 /* allocate a single active event queue */
928 event_queue_remove(struct event_base *base, struct event *ev, int queue) argument
930 if (!(ev->ev_flags & queue))
931 event_errx(1, "%s: %p(fd %d) not on queue %x", __func__,
932 ev, ev->ev_fd, queue);
937 ev->ev_flags &= ~queue;
938 switch (queue) {
951 event_errx(1, "%s: unknown queue %x", __func__, queue);
956 event_queue_insert(struct event_base *base, struct event *ev, int queue) argument
[all...]
/external/compiler-rt/lib/asan/
H A Dasan_mac.cc244 // http://libdispatch.macosforge.org/trac/browser/trunk/src/queue.c
389 void dispatch_after(dispatch_time_t when, dispatch_queue_t queue,
418 dispatch_time_t when, dispatch_queue_t queue, void(^work)(void)) {
420 REAL(dispatch_after)(when, queue, asan_block);
417 INTERCEPTOR(void, dispatch_after, dispatch_time_t when, dispatch_queue_t queue, void(^work)(void)) argument
/external/guava/guava/src/com/google/common/collect/
H A DIterables.java972 * queue's elements in queue order
998 private final Queue<T> queue; field in class:Iterables.ConsumingQueueIterator
1000 private ConsumingQueueIterator(Queue<T> queue) { argument
1001 this.queue = queue;
1006 return queue.remove();
H A DIterators.java1287 final Queue<PeekingIterator<T>> queue; field in class:Iterators.MergingIterator
1304 queue = new PriorityQueue<PeekingIterator<T>>(2, heapComparator);
1308 queue.add(Iterators.peekingIterator(iterator));
1315 if (queue.isEmpty()) {
1319 PeekingIterator<T> nextIter = queue.poll();
1323 queue.add(nextIter);
H A DMinMaxPriorityQueue.java42 * A double-ended priority queue, which provides constant-time access to both
43 * its least element and its greatest element, as determined by the queue's
50 * the queue according to the queue's comparator. But unlike a regular priority
51 * queue, the methods {@link #peekLast}, {@link #pollLast} and
53 * in the queue instead.
55 * <p>A min-max priority queue can be configured with a maximum size. If so,
56 * each time the size of the queue exceeds that value, the queue automatically
79 * <li>If you only access one end of the queue, an
222 private Object[] queue; field in class:MinMaxPriorityQueue
[all...]
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DIterables.java930 * queue's elements in queue order
956 private final Queue<T> queue; field in class:Iterables.ConsumingQueueIterator
958 private ConsumingQueueIterator(Queue<T> queue) { argument
959 this.queue = queue;
964 return queue.remove();
H A DIterators.java1251 final Queue<PeekingIterator<T>> queue; field in class:Iterators.MergingIterator
1268 queue = new PriorityQueue<PeekingIterator<T>>(2, heapComparator);
1272 queue.add(Iterators.peekingIterator(iterator));
1279 if (queue.isEmpty()) {
1283 PeekingIterator<T> nextIter = queue.poll();
1287 queue.add(nextIter);
/external/guava/guava-tests/test/com/google/common/collect/
H A DMinMaxPriorityQueueTest.java52 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue
54 assertEquals(11, queue.capacity());
55 checkUnbounded(queue);
56 checkNatural(queue);
60 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue
63 assertEquals(11, queue.capacity());
64 checkUnbounded(queue);
65 assertSame(SOME_COMPARATOR, queue.comparator());
69 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue
72 assertEquals(8, queue
175 checkNatural(MinMaxPriorityQueue<Integer> queue) argument
179 checkUnbounded(MinMaxPriorityQueue<Integer> queue) argument
[all...]
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dqueue.h0 // queue.h
41 // // Returns the head of the queue
45 // // Removes the head of the queue
49 // // Does the queue contain no elements?
51 // // Remove all states from queue
55 // State queue types.
57 TRIVIAL_QUEUE = 0, // Single state queue
58 FIFO_QUEUE = 1, // First-in, first-out queue
59 LIFO_QUEUE = 2, // Last-in, first-out queue
60 SHORTEST_FIRST_QUEUE = 3, // Shortest-first queue
410 SccQueue(const vector<StateId> &scc, vector<Queue*> *queue) argument
[all...]
/external/bluetooth/bluedroid/stack/rfcomm/
H A Dport_int.h56 BUFFER_Q queue; /* Queue of buffers waiting to be sent */ member in struct:__anon1419
59 UINT32 queue_size; /* Number of data bytes in the queue */
203 UINT16 rx_buf_critical; /* port receive queue critical watermark level */
/external/chromium/third_party/libjingle/source/talk/p2p/base/
H A Dpseudotcp.cc278 queue(buffer, 1, true);
442 int written = queue(buffer, uint32(len), false);
460 uint32 PseudoTcp::queue(const char* data, uint32 len, bool bCtrl) { function in class:cricket::PseudoTcp
477 //LOG(LS_INFO) << "PseudoTcp::queue - m_slen = " << m_slen;
638 queue(buffer, 1, true);
748 // If we make room in the send queue, notify the user
/external/clang/tools/libclang/
H A DRecursiveASTVisitor.h118 /// Stmts are traversed internally using a data queue to avoid a stack overflow
268 StmtQueue.queue(S->getSubExpr()); \
288 StmtQueue.queue(S->getLHS()); \
289 StmtQueue.queue(S->getRHS()); \
415 NewQueueRAII(StmtsTy &queue, RecursiveASTVisitor &RAV) : RAV(RAV) { argument
416 RAV.Queues.push_back(&queue);
435 void queue(Stmt *S) { function in class:clang::cxindex::RecursiveASTVisitor::StmtQueueAction
1751 StmtQueue.queue(*range); \
1757 StmtQueue.queue(S->getAsmString());
1759 StmtQueue.queue(
[all...]

Completed in 3689 milliseconds

123456