HomeSort by relevance Sort by last modified time
    Searched refs:queue (Results 1 - 25 of 1662) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/stlport/test/unit/
queue_header_test.cpp 8 #include <queue>
  /ndk/tests/device/test-gnustl-full/unit/
queue_header_test.cpp 8 #include <queue>
  /ndk/tests/device/test-stlport/unit/
queue_header_test.cpp 8 #include <queue>
  /hardware/intel/common/wrs_omxil_core/utils/inc/
queue.h 2 * queue.h, queue
28 struct queue { struct
34 void __queue_init(struct queue *queue);
35 struct queue *queue_alloc(void);
37 inline void __queue_free(struct queue *queue);
39 void queue_free_all(struct queue *queue);
    [all...]
  /hardware/intel/common/wrs_omxil_core/utils/src/
queue.c 2 * queue.c, queue
21 #include <queue.h>
23 inline void __queue_init(struct queue *queue)
25 queue->head = NULL;
26 queue->tail = NULL;
27 queue->length = 0;
30 struct queue *queue_alloc(void)
32 struct queue *queue local
    [all...]
  /external/chromium_org/media/base/
decoder_buffer_queue_unittest.cc 36 DecoderBufferQueue queue; local
37 EXPECT_TRUE(queue.IsEmpty());
39 queue.Push(CreateBuffer(0));
40 EXPECT_FALSE(queue.IsEmpty());
44 DecoderBufferQueue queue; local
45 queue.Push(CreateBuffer(0));
46 queue.Push(CreateBuffer(1));
47 EXPECT_FALSE(queue.IsEmpty());
48 EXPECT_EQ(1, queue.Duration().InSeconds());
50 queue.Clear()
56 DecoderBufferQueue queue; local
85 DecoderBufferQueue queue; local
121 DecoderBufferQueue queue; local
146 DecoderBufferQueue queue; local
    [all...]
  /external/chromium_org/chrome/browser/chromeos/drive/
job_queue_unittest.cc 16 // Create a queue. Number of jobs are initially zero.
17 JobQueue queue(kNumMaxConcurrentJobs, kNumPriorityLevels);
18 EXPECT_EQ(0U, queue.GetNumberOfJobs());
21 queue.Push(101, LOW_PRIORITY);
22 queue.Push(102, HIGH_PRIORITY);
23 queue.Push(103, LOW_PRIORITY);
24 queue.Push(104, HIGH_PRIORITY);
28 EXPECT_TRUE(queue.PopForRun(LOW_PRIORITY, &id));
30 EXPECT_TRUE(queue.PopForRun(LOW_PRIORITY, &id));
34 EXPECT_TRUE(queue.PopForRun(LOW_PRIORITY, &id))
    [all...]
  /hardware/samsung_slsi/exynos5/exynos_omx/openmax/exynos_omx/osal/
Exynos_OSAL_Queue.c 42 EXYNOS_QUEUE *queue = (EXYNOS_QUEUE *)queueHandle; local
46 if (!queue)
49 ret = Exynos_OSAL_MutexCreate(&queue->qMutex);
53 queue->first = (EXYNOS_QElem *)Exynos_OSAL_Malloc(sizeof(EXYNOS_QElem));
54 if (queue->first == NULL)
57 Exynos_OSAL_Memset(queue->first, 0, sizeof(EXYNOS_QElem));
58 currentqelem = queue->last = queue->first;
59 queue->numElem = 0;
60 queue->maxNumElem = maxNumElem
86 EXYNOS_QUEUE *queue = (EXYNOS_QUEUE *)queueHandle; local
110 EXYNOS_QUEUE *queue = (EXYNOS_QUEUE *)queueHandle; local
131 EXYNOS_QUEUE *queue = (EXYNOS_QUEUE *)queueHandle; local
153 EXYNOS_QUEUE *queue = (EXYNOS_QUEUE *)queueHandle; local
165 EXYNOS_QUEUE *queue = (EXYNOS_QUEUE *)queueHandle; local
177 EXYNOS_QUEUE *queue = (EXYNOS_QUEUE *)queueHandle; local
    [all...]
  /external/chromium_org/third_party/libjingle/source/talk/base/
atomicops_unittest.cc 47 talk_base::FixedSizeLockFreeQueue<int> queue; local
48 EXPECT_EQ(0u, queue.capacity());
49 EXPECT_EQ(0u, queue.Size());
50 EXPECT_FALSE(queue.PushBack(1));
52 EXPECT_FALSE(queue.PopFront(&val));
56 talk_base::FixedSizeLockFreeQueue<int> queue(5);
57 EXPECT_EQ(5u, queue.capacity());
58 EXPECT_EQ(0u, queue.Size());
60 EXPECT_FALSE(queue.PopFront(&val));
64 talk_base::FixedSizeLockFreeQueue<int> queue(2)
    [all...]
  /external/chromium_org/third_party/webrtc/base/
atomicops_unittest.cc 30 rtc::FixedSizeLockFreeQueue<int> queue; local
31 EXPECT_EQ(0u, queue.capacity());
32 EXPECT_EQ(0u, queue.Size());
33 EXPECT_FALSE(queue.PushBack(1));
35 EXPECT_FALSE(queue.PopFront(&val));
39 rtc::FixedSizeLockFreeQueue<int> queue(5);
40 EXPECT_EQ(5u, queue.capacity());
41 EXPECT_EQ(0u, queue.Size());
43 EXPECT_FALSE(queue.PopFront(&val));
47 rtc::FixedSizeLockFreeQueue<int> queue(2)
    [all...]
  /external/bluetooth/bluedroid/osi/include/
fixed_queue.h 28 // Creates a new fixed queue with the given |capacity|. If more elements than
29 // |capacity| are added to the queue, the caller is blocked until space is
30 // made available in the queue. Returns NULL on failure. The caller must free
31 // the returned queue with |fixed_queue_free|.
34 // Freeing a queue that is currently in use (i.e. has waiters
36 void fixed_queue_free(fixed_queue_t *queue, fixed_queue_free_cb free_cb);
38 // Enqueues the given |data| into the |queue|. The caller will be blocked
39 // if nore more space is available in the queue. Neither |queue| nor |data|
41 void fixed_queue_enqueue(fixed_queue_t *queue, void *data)
    [all...]
  /device/moto/shamu/camera/QCamera2/stack/mm-camera-test/src/
mm_qcamera_queue.c 33 int mm_camera_queue_init(mm_camera_queue_t *queue,
37 if ( NULL == queue ) {
41 pthread_mutex_init(&queue->m_lock, NULL);
42 cam_list_init(&queue->m_head.list);
43 queue->m_size = 0;
44 queue->m_dataFn = data_rel_fn;
45 queue->m_userData = user_data;
50 int mm_qcamera_queue_release(mm_camera_queue_t *queue)
52 if ( NULL == queue ) {
56 mm_qcamera_queue_flush(queue);
    [all...]
  /prebuilts/misc/common/swig/include/2.0.11/ruby/
std_queue.i 9 struct traits_asptr<std::queue<T> > {
10 static int asptr(VALUE obj, std::queue<T> **vec) {
11 return traits_asptr_stdseq<std::queue<T> >::asptr(obj, vec);
16 struct traits_from<std::queue<T> > {
17 static VALUE from(const std::queue<T> & vec) {
18 return traits_from_stdseq<std::queue<T> >::from(vec);
24 %rename("delete") std::queue::__delete__;
25 %rename("reject!") std::queue::reject_bang;
26 %rename("map!") std::queue::map_bang;
27 %rename("empty?") std::queue::empty
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/
lp_scene_queue.h 42 lp_scene_queue_destroy(struct lp_scene_queue *queue);
45 lp_scene_dequeue(struct lp_scene_queue *queue, boolean wait);
48 lp_scene_enqueue(struct lp_scene_queue *queue, struct lp_scene *scene);
  /external/mesa3d/src/gallium/drivers/llvmpipe/
lp_scene_queue.h 42 lp_scene_queue_destroy(struct lp_scene_queue *queue);
45 lp_scene_dequeue(struct lp_scene_queue *queue, boolean wait);
48 lp_scene_enqueue(struct lp_scene_queue *queue, struct lp_scene *scene);
  /external/chromium_org/chrome/browser/sync_file_system/drive_backend_v1/
origin_operation_queue_unittest.cc 15 OriginOperationQueue* queue) {
16 ASSERT_FALSE(queue->empty());
18 op = queue->Pop();
28 OriginOperationQueue queue; local
30 queue.Push(origin1, OriginOperation::REGISTERING);
31 queue.Push(origin2, OriginOperation::DISABLING);
32 queue.Push(origin1, OriginOperation::UNINSTALLING);
34 ASSERT_EQ(3U, queue.size());
35 ASSERT_TRUE(queue.HasPendingOperation(origin1));
36 ASSERT_TRUE(queue.HasPendingOperation(origin2))
    [all...]
  /external/chromium_org/v8/test/cctest/
test-libplatform-worker-thread.cc 30 #include "src/libplatform/task-queue.h"
39 TaskQueue queue; local
47 WorkerThread* thread1 = new WorkerThread(&queue);
48 WorkerThread* thread2 = new WorkerThread(&queue);
52 queue.Append(task1);
53 queue.Append(task2);
54 queue.Append(task3);
55 queue.Append(task4);
58 queue.Terminate();
  /external/libcxx/test/containers/container.adaptors/queue/queue.cons/
default_noexcept.pass.cpp 10 // <queue>
12 // queue()
17 #include <queue>
26 typedef std::queue<MoveOnly> C;
dtor_noexcept.pass.cpp 10 // <queue>
12 // ~queue() // implied noexcept;
14 #include <queue>
23 typedef std::queue<MoveOnly> C;
move_assign_noexcept.pass.cpp 10 // <queue>
12 // queue& operator=(queue&& c)
17 #include <queue>
26 typedef std::queue<MoveOnly> C;
move_noexcept.pass.cpp 10 // <queue>
12 // queue(queue&&)
17 #include <queue>
26 typedef std::queue<MoveOnly> C;
  /external/libcxx/test/containers/container.adaptors/queue/queue.defn/
size.pass.cpp 10 // <queue>
14 #include <queue>
19 std::queue<int> q;
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/queue/queue.cons/
default_noexcept.pass.cpp 10 // <queue>
12 // queue()
17 #include <queue>
26 typedef std::queue<MoveOnly> C;
dtor_noexcept.pass.cpp 10 // <queue>
12 // ~queue() // implied noexcept;
14 #include <queue>
23 typedef std::queue<MoveOnly> C;
move_assign_noexcept.pass.cpp 10 // <queue>
12 // queue& operator=(queue&& c)
17 #include <queue>
26 typedef std::queue<MoveOnly> C;

Completed in 2540 milliseconds

1 2 3 4 5 6 7 8 91011>>