| /external/guava/guava/src/com/google/common/util/concurrent/ |
| ListenerCallQueue.java | 24 import java.util.Queue;
32 * A special purpose queue/executor that executes listener callbacks serially on a configured
53 for (ListenerCallQueue<L> queue : queues) {
54 queue.add(this);
62 @GuardedBy("this") private final Queue<Callback<L>> waitQueue = Queues.newArrayDeque();
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| ICUNotifier.java | 98 * Queue a notification on the notification thread for the current
110 notifyThread.queue(listeners.toArray(new EventListener[listeners.size()]));
120 private final List<EventListener[]> queue = new ArrayList<EventListener[]>(); field in class:ICUNotifier.NotifyThread
127 * Queue the notification on the thread.
129 public void queue(EventListener[] list) { method in class:ICUNotifier.NotifyThread
131 queue.add(list);
146 while (queue.isEmpty()) {
149 list = queue.remove(0);
|
| /external/javassist/src/main/javassist/scopedpool/ |
| SoftValueHashMap.java | 62 /* Reference queue for cleared WeakKeys */
63 private ReferenceQueue queue = new ReferenceQueue(); field in class:SoftValueHashMap
71 while ((ref = (SoftValueRef)queue.poll()) != null) {
204 Object rtn = hash.put(key, SoftValueRef.create(key, value, queue));
|
| /external/libxcam/xcore/ |
| thread_pool.cpp | 233 ThreadPool::queue (const SmartPtr<UserData> &data) function in class:XCam::ThreadPool
260 XCAM_LOG_WARNING ("thread pool(%s) create new thread failed but queue data can continue");
266 "thread pool(%s) queue data failed by creating user thread", XCAM_STR (get_name()));
|
| /external/ltp/testcases/kernel/device-drivers/nls/ |
| nlsTest.c | 148 struct request_queue *queue; local
178 queue = blk_init_queue(test_request, &dev->queue_lock);
179 if (!queue) {
189 gd_ptr->queue = queue;
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_send/ |
| 3-1.c | 10 * Test that mq_send() inserts messages into the message queue according
12 * Test by inserting multiple messages into the queue not in priority order.
50 mqd_t queue; local
59 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
60 if (queue == (mqd_t) - 1) {
65 if (mq_send(queue, msgptr3, strlen(msgptr3), PRI3) != 0) {
70 if (mq_send(queue, msgptr1, strlen(msgptr1), PRI1) != 0) {
75 if (mq_send(queue, msgptr4, strlen(msgptr4), PRI4) != 0) {
80 if (mq_send(queue, msgptr2, strlen(msgptr2), PRI2) != 0) {
85 if (mq_send(queue, msgptr5, strlen(msgptr5), PRI5) != 0)
[all...] |
| 3-2.c | 10 * Test that mq_send() inserts messages into the message queue according
52 mqd_t queue; local
61 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
62 if (queue == (mqd_t) - 1) {
67 if (mq_send(queue, msgptr3, strlen(msgptr3), PRI3) != 0) {
73 if (mq_send(queue, msgptr1, strlen(msgptr1), PRI1) != 0) {
79 if (mq_send(queue, msgptr4, strlen(msgptr4), PRI4) != 0) {
85 if (mq_send(queue, msgptr2, strlen(msgptr2), PRI2) != 0) {
91 if (mq_send(queue, msgptr5, strlen(msgptr5), PRI5) != 0) {
97 if (mq_receive(queue, msgrcd, BUFFER, &pri) == -1)
[all...] |
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_timedsend/ |
| 3-1.c | 10 * Test that mq_timedsend() inserts messages into the message queue according
12 * Test by inserting multiple messages into the queue not in priority order.
54 mqd_t queue; local
62 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
63 if (queue == (mqd_t) - 1) {
70 if (mq_timedsend(queue, msgptr3, strlen(msgptr3), PRI3, &ts) != 0) {
76 if (mq_timedsend(queue, msgptr1, strlen(msgptr1), PRI1, &ts) != 0) {
82 if (mq_timedsend(queue, msgptr4, strlen(msgptr4), PRI4, &ts) != 0) {
88 if (mq_timedsend(queue, msgptr2, strlen(msgptr2), PRI2, &ts) != 0) {
94 if (mq_timedsend(queue, msgptr5, strlen(msgptr5), PRI5, &ts) != 0)
[all...] |
| 3-2.c | 10 * Test that mq_timedsend() inserts messages into the message queue according
55 mqd_t queue; local
64 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
65 if (queue == (mqd_t) - 1) {
72 if (mq_timedsend(queue, msgptr3, strlen(msgptr3), PRI3, &ts) != 0) {
79 if (mq_timedsend(queue, msgptr1, strlen(msgptr1), PRI1, &ts) != 0) {
86 if (mq_timedsend(queue, msgptr4, strlen(msgptr4), PRI4, &ts) != 0) {
93 if (mq_timedsend(queue, msgptr2, strlen(msgptr2), PRI2, &ts) != 0) {
100 if (mq_timedsend(queue, msgptr5, strlen(msgptr5), PRI5, &ts) != 0) {
106 if (mq_receive(queue, msgrcd, BUFFER, &pri) == -1)
[all...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_queue.c | 32 static void util_queue_killall_and_wait(struct util_queue *queue);
66 add_to_atexit_list(struct util_queue *queue)
71 LIST_ADD(&queue->head, &queue_list);
76 remove_from_atexit_list(struct util_queue *queue)
82 if (iter == queue) {
113 struct util_queue *queue; member in struct:thread_input
119 struct util_queue *queue = ((struct thread_input*)input)->queue; local
124 if (queue->name) {
126 util_snprintf(name, sizeof(name), "%s:%i", queue->name, thread_index)
[all...] |
| /external/mesa3d/src/gallium/state_trackers/clover/core/ |
| event.cpp | 130 pipe_screen *screen = queue()->device().pipe;
136 pipe_screen *screen = queue()->device().pipe;
152 hard_event::queue() const { function in class:hard_event
163 pipe_screen *screen = queue()->device().pipe;
168 queue()->flush();
197 pipe_screen *screen = queue()->device().pipe;
243 soft_event::queue() const {
|
| /external/tensorflow/tensorflow/core/graph/ |
| algorithm.cc | 180 std::deque<const Node*> queue; local
183 queue.push_back(n);
185 while (!queue.empty()) {
186 const Node* n = queue.front();
187 queue.pop_front();
190 queue.push_back(in);
|
| /external/tensorflow/tensorflow/core/grappler/ |
| grappler_item.cc | 132 std::vector<const NodeDef*> queue; local
140 queue.push_back(node);
146 while (!queue.empty()) {
147 const NodeDef* node = queue.back();
148 queue.pop_back();
161 queue.push_back(in);
167 queue.push_back(send);
|
| /external/tensorflow/tensorflow/core/kernels/hexagon/ |
| graph_transfer_utils.cc | 35 std::priority_queue<std::tuple<float, int, string>> queue; local
37 queue.emplace(data[i], i, labels[i]);
39 return queue;
45 std::priority_queue<std::tuple<float, int, string>> queue = local
49 const std::tuple<float, int, string>& entry = queue.top();
52 queue.pop();
|
| /external/tensorflow/tensorflow/core/kernels/ |
| queue_ops.cc | 35 QueueInterface* queue; variable
38 ctx, LookupResource(ctx, HandleFromInput(ctx, 0), &queue), callback);
40 OP_REQUIRES_OK_ASYNC(ctx, GetResourceFromContext(ctx, "handle", &queue),
43 ComputeAsync(ctx, queue, [callback, queue]() {
44 queue->Unref();
50 virtual void ComputeAsync(OpKernelContext* ctx, QueueInterface* queue,
69 // tensors in the given Queue.
72 // tuples stored in the given Queue:
73 // - Input 0: queue handle
[all...] |
| /external/webrtc/webrtc/base/ |
| natsocketfactory.h | 128 MessageQueue* queue() { return msg_queue_; } function in class:rtc::NATSocketServer
142 void SetMessageQueue(MessageQueue* queue) override;
|
| /frameworks/av/media/libstagefright/rtsp/ |
| AH263Assembler.cpp | 54 List<sp<ABuffer> > *queue = source->queue(); local
56 if (queue->empty()) {
61 List<sp<ABuffer> >::iterator it = queue->begin();
62 while (it != queue->end()) {
67 it = queue->erase(it);
70 if (queue->empty()) {
75 sp<ABuffer> buffer = *queue->begin();
99 queue->erase(queue->begin())
[all...] |
| /frameworks/base/services/tests/servicestests/src/com/android/server/pm/ |
| UserManagerServiceIdRecyclingTest.java | 92 LinkedHashSet<Integer> queue = new LinkedHashSet<>(); local
96 assertTrue("Returned id should not be recent. Id=" + userId + ". Recents=" + queue,
97 queue.add(userId));
98 if (queue.size() > UserManagerService.MAX_RECENTLY_REMOVED_IDS_SIZE) {
99 queue.remove(queue.iterator().next());
|
| /frameworks/native/services/surfaceflinger/ |
| MessageQueue.cpp | 145 MessageQueue* queue = reinterpret_cast<MessageQueue*>(data); local
146 return queue->eventReceiver(fd, events);
|
| /hardware/google/av/codec2/vndk/bufferpool/ |
| BufferStatus.cpp | 48 std::unique_ptr<BufferStatusQueue> queue = local
50 if (!queue || queue->isValid() == false) {
54 *fmqDescPtr = queue->getDesc();
57 std::make_pair(id, std::move(queue)));
94 std::unique_ptr<BufferStatusQueue> queue = local
96 if (!queue || queue->isValid() == false) {
101 mBufferStatusQueue = std::move(queue);
|
| /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...] |
| /hardware/libhardware/modules/sensors/tests/ |
| SensorEventQueue_test.cpp | 16 bool checkWritableBufferSize(SensorEventQueue* queue, int requested, int expected) {
18 int actual = queue->getWritableRegion(requested, &buffer);
26 bool checkSize(SensorEventQueue* queue, int expected) {
27 int actual = queue->getSize();
29 printf("Expected queue size was %d; actual was %d\n", expected, actual);
45 SensorEventQueue* queue = new SensorEventQueue(10); local
46 if (!checkSize(queue, 0)) return false;
47 if (!checkWritableBufferSize(queue, 11, 10)) return false;
48 if (!checkWritableBufferSize(queue, 10, 10)) return false;
49 if (!checkWritableBufferSize(queue, 9, 9)) return false
67 SensorEventQueue* queue = new SensorEventQueue(10); local
95 SensorEventQueue* queue; member in struct:TaskContext
106 SensorEventQueue* queue = ctx->queue; local
145 SensorEventQueue* queue = ctx->queue; local
167 SensorEventQueue* queue = new SensorEventQueue(FULL_QUEUE_CAPACITY); local
[all...] |
| /hardware/qcom/msm8960/kernel-headers/linux/ |
| msm_adsp.h | 26 uint16_t queue; member in struct:adsp_command_t
|
| /hardware/qcom/msm8960/original-kernel-headers/linux/ |
| msm_adsp.h | 26 uint16_t queue; member in struct:adsp_command_t
|
| /hardware/qcom/msm8994/kernel-headers/linux/ |
| msm_adsp.h | 26 uint16_t queue; member in struct:adsp_command_t
|
