HomeSort by relevance Sort by last modified time
    Searched defs:Queue (Results 1 - 25 of 199) sorted by null

1 2 3 4 5 6 7 8

  /hardware/qcom/media/msm8974/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/msm8974/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);
  /hardware/qcom/media/msm8996/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);
  /hardware/qcom/media/msm8998/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()
  /packages/apps/Nfc/nci/jni/
DataQueue.h 18 * Store data bytes in a variable-size queue.
55 ** Description: Append data to the queue.
68 ** Description: Retrieve and remove data from the front of the queue.
82 ** Description: Whether the queue is empty.
94 typedef std::list<tHeader*> Queue;
96 Queue mQueue;
  /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 override { return Queue.empty(); }
  /libcore/ojluni/src/main/java/java/util/
Queue.java 50 * specifically for use with capacity-restricted {@code Queue}
55 * <caption>Summary of Queue methods</caption>
63 * <td>{@link Queue#add add(e)}</td>
64 * <td>{@link Queue#offer offer(e)}</td>
68 * <td>{@link Queue#remove remove()}</td>
69 * <td>{@link Queue#poll poll()}</td>
73 * <td>{@link Queue#element element()}</td>
74 * <td>{@link Queue#peek peek()}</td>
83 * Whatever the ordering used, the <em>head</em> of the queue is that
85 * {@link #poll()}. In a FIFO queue, all new elements are inserted a
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/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 override { return Queue.empty(); }
  /prebuilts/clang/host/darwin-x86/clang-4393122/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 override { return Queue.empty(); }
  /prebuilts/clang/host/darwin-x86/clang-4479392/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 override { return Queue.empty(); }
  /prebuilts/clang/host/darwin-x86/clang-4579689/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 override { return Queue.empty(); }
  /prebuilts/clang/host/darwin-x86/clang-4630689/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 override { return Queue.empty(); }
  /prebuilts/clang/host/darwin-x86/clang-4639204/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 override { return Queue.empty(); }
  /prebuilts/clang/host/darwin-x86/clang-4691093/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 override { return Queue.empty(); }
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/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 override { return Queue.empty(); }
  /prebuilts/clang/host/linux-x86/clang-4393122/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 override { return Queue.empty(); }
  /prebuilts/clang/host/linux-x86/clang-4479392/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 override { return Queue.empty(); }
  /prebuilts/clang/host/linux-x86/clang-4579689/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 override { return Queue.empty(); }
  /prebuilts/clang/host/linux-x86/clang-4630689/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 override { return Queue.empty(); }
  /prebuilts/clang/host/linux-x86/clang-4639204/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 override { return Queue.empty(); }
  /prebuilts/clang/host/linux-x86/clang-4691093/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 override { return Queue.empty(); }
  /external/google-breakpad/src/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/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/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...]

Completed in 718 milliseconds

1 2 3 4 5 6 7 8