| /hardware/qcom/media/mm-video-legacy/vidc/vdec/inc/ |
| queue.h | 31 typedef struct Queue Queue;
33 Queue *alloc_queue();
34 void free_queue(Queue *q);
35 void free_queue_and_qelement(Queue *q);
36 int push(Queue *q, void * element);
37 void *pop(Queue *q);
|
| /hardware/qcom/media/mm-video-v4l2/vidc/vdec/inc/ |
| queue.h | 31 typedef struct Queue Queue;
33 Queue *alloc_queue();
34 void free_queue(Queue *q);
35 void free_queue_and_qelement(Queue *q);
36 int push(Queue *q, void * element);
37 void *pop(Queue *q);
|
| /development/tools/axl/ |
| chewie.py | 16 class Queue:
18 self.queue = []
21 self.queue.append([url, time])
24 for x in range(len(self.queue)):
25 rec = self.queue[x]
27 del self.queue[x]
30 ## pull out request lag -- queue to start to done
56 queued = Queue()
|
| /external/chromium_org/media/base/ |
| decoder_buffer_queue.h | 18 // Maintains a queue of DecoderBuffers in increasing timestamp order.
21 // queue i.e., the queue must have at least 2 in-order buffers to calculate
30 // Push |buffer| to the end of the queue. If |buffer| is queued out of order
36 // Pops a DecoderBuffer from the front of the queue.
38 // It is invalid to call Pop() on an empty queue.
44 // Returns true if this queue is empty.
47 // Returns the duration of encoded data stored in this queue as measured by
51 // Returns zero if the queue is empty.
55 typedef std::deque<scoped_refptr<DecoderBuffer> > Queue;
[all...] |
| serial_runner.cc | 33 SerialRunner::Queue::Queue() {}
34 SerialRunner::Queue::~Queue() {}
36 void SerialRunner::Queue::Push(
41 void SerialRunner::Queue::Push(
46 SerialRunner::BoundPipelineStatusCB SerialRunner::Queue::Pop() {
52 bool SerialRunner::Queue::empty() {
57 const Queue& bound_fns, const PipelineStatusCB& done_cb)
70 const Queue& bound_fns, const PipelineStatusCB& done_cb)
[all...] |
| serial_runner.h | 8 #include <queue>
30 // Serial queue of bound functions to run.
31 class Queue {
33 Queue();
34 ~Queue();
45 std::queue<BoundPipelineStatusCB> bound_fns_;
56 const Queue& bound_fns, const PipelineStatusCB& done_cb);
61 SerialRunner(const Queue& bound_fns, const PipelineStatusCB& done_cb);
68 Queue bound_fns_;
|
| /packages/apps/Nfc/nci/jni/ |
| DataQueue.h | 18 * Store data bytes in a variable-size queue.
59 ** Description: Append data to the queue.
73 ** Description: Retrieve and remove data from the front of the queue.
88 ** Description: Whether the queue is empty.
101 typedef std::list<tHeader*> Queue;
103 Queue mQueue;
|
| /external/chromium_org/tools/sharding_supervisor/ |
| stdio_buffer.py | 8 import Queue
13 self.queue = Queue.Queue()
31 self.queue.put((system_pipe, line))
33 self.queue.put((system_pipe, None))
47 (pipe, line) = self.queue.get(True)
|
| /external/dropbear/ |
| queue.h | 35 struct Queue {
43 void initqueue(struct Queue* queue);
44 int isempty(struct Queue* queue);
45 void* dequeue(struct Queue* queue);
46 void *examine(struct Queue* queue);
47 void enqueue(struct Queue* queue, void* item)
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| Queue.java | 21 * specifically for use with capacity-restricted <tt>Queue</tt>
54 * Whatever the ordering used, the <em>head</em> of the queue is that
56 * {@link #poll()}. In a FIFO queue, all new elements are inserted at
57 * the <em> tail</em> of the queue. Other kinds of queues may use
58 * different placement rules. Every <tt>Queue</tt> implementation
70 * return the head of the queue.
71 * Exactly which element is removed from the queue is a
72 * function of the queue's ordering policy, which differs from
75 * queue is empty: the <tt>remove()</tt> method throws an exception,
79 * not remove, the head of the queue
[all...] |
| /external/chromium/testing/gtest/samples/ |
| sample3-inl.h | 40 // Queue is a simple queue implemented as a singled-linked list.
44 class Queue;
46 // QueueNode is a node in a Queue, which consists of an element of
50 friend class Queue<E>;
56 // Gets the next node in the queue.
74 class Queue {
77 // Creates an empty queue.
78 Queue() : head_(NULL), last_(NULL), size_(0) {}
80 // D'tor. Clears the queue
[all...] |
| /external/chromium_org/testing/gtest/samples/ |
| sample3-inl.h | 40 // Queue is a simple queue implemented as a singled-linked list.
44 class Queue;
46 // QueueNode is a node in a Queue, which consists of an element of
50 friend class Queue<E>;
56 // Gets the next node in the queue.
74 class Queue {
76 // Creates an empty queue.
77 Queue() : head_(NULL), last_(NULL), size_(0) {}
79 // D'tor. Clears the queue
[all...] |
| /external/gtest/samples/ |
| sample3-inl.h | 40 // Queue is a simple queue implemented as a singled-linked list.
44 class Queue;
46 // QueueNode is a node in a Queue, which consists of an element of
50 friend class Queue<E>;
56 // Gets the next node in the queue.
74 class Queue {
77 // Creates an empty queue.
78 Queue() : head_(NULL), last_(NULL), size_(0) {}
80 // D'tor. Clears the queue
[all...] |
| /external/protobuf/gtest/samples/ |
| sample3-inl.h | 40 // Queue is a simple queue implemented as a singled-linked list.
44 class Queue;
46 // QueueNode is a node in a Queue, which consists of an element of
50 friend class Queue<E>;
56 // Gets the next node in the queue.
74 class Queue {
77 // Creates an empty queue.
78 Queue() : head_(NULL), last_(NULL), size_(0) {}
80 // D'tor. Clears the queue
[all...] |
| /ndk/sources/third_party/googletest/googletest/samples/ |
| sample3-inl.h | 40 // Queue is a simple queue implemented as a singled-linked list.
44 class Queue;
46 // QueueNode is a node in a Queue, which consists of an element of
50 friend class Queue<E>;
56 // Gets the next node in the queue.
74 class Queue {
76 // Creates an empty queue.
77 Queue() : head_(NULL), last_(NULL), size_(0) {}
79 // D'tor. Clears the queue
[all...] |
| /external/chromium_org/chrome/test/functional/ |
| webrtc_write_wsh.py | 10 import Queue
22 g_frames_queue = Queue.Queue()
47 queue. The frames are written in the directory specified by _WORKING_DIR.
49 def __init__(self, queue):
51 self._queue = queue
|
| /external/chromium_org/v8/tools/testrunner/network/ |
| endpoint.py | 31 import Queue
|
| /external/llvm/include/llvm/CodeGen/ |
| LatencyPriorityQueue.h | 1 //===---- LatencyPriorityQueue.h - A latency-oriented priority queue ------===//
24 /// Sorting functions for the Available queue.
37 /// Queue, the number of nodes that the node is the sole unscheduled
42 /// Queue - The queue.
43 std::vector<SUnit*> Queue;
78 bool empty() const { return Queue.empty(); }
|
| /hardware/qcom/media/mm-video-legacy/vidc/vdec/src/ |
| queue.c | 29 Queue with Linked list
32 #include "queue.h"
43 struct Queue
50 Queue *alloc_queue()
52 Queue *q = (Queue *) malloc(sizeof(Queue));
61 void free_queue(Queue *q)
69 void free_queue_and_qelement(Queue *q)
79 int push(Queue *q, void * element
[all...] |
| /hardware/qcom/media/mm-video-v4l2/vidc/vdec/src/ |
| queue.c | 29 Queue with Linked list
32 #include "queue.h"
42 struct Queue {
48 Queue *alloc_queue()
50 Queue *q = (Queue *) malloc(sizeof(Queue));
60 void free_queue(Queue *q)
67 void free_queue_and_qelement(Queue *q)
77 int push(Queue *q, void * element
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/multiprocessing/dummy/ |
| connection.py | 37 from Queue import Queue
46 self._backlog_queue = Queue(backlog)
58 _in, _out = Queue(), Queue()
64 a, b = Queue(), Queue()
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/multiprocessing/dummy/ |
| connection.py | 37 from Queue import Queue
46 self._backlog_queue = Queue(backlog)
58 _in, _out = Queue(), Queue()
64 a, b = Queue(), Queue()
|
| /external/chromium-trace/trace-viewer/third_party/pywebsocket/src/mod_pywebsocket/ |
| msgutil.py | 41 import Queue
127 self._queue = Queue.Queue()
160 except Queue.Empty:
193 self._queue = Queue.Queue()
|
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/thirdparty/mod_pywebsocket/ |
| msgutil.py | 41 import Queue
127 self._queue = Queue.Queue()
160 except Queue.Empty:
193 self._queue = Queue.Queue()
|
| /external/libppp/src/ |
| ipv6cp.h | 56 struct mqueue Queue[2]; /* Output packet queues */
60 #define IPV6CP_QUEUES(ipv6cp) (sizeof ipv6cp->Queue / sizeof ipv6cp->Queue[0])
|
