Lines Matching full:queue

17 struct k_queue queue;  variable
40 /**TESTPOINT: queue append */ in tqueue_append()
45 /**TESTPOINT: queue prepend */ in tqueue_append()
49 /**TESTPOINT: queue append list*/ in tqueue_append()
56 /**TESTPOINT: queue merge slist*/ in tqueue_append()
69 /*get queue data from "queue_prepend"*/ in tqueue_get()
71 /**TESTPOINT: queue get*/ in tqueue_get()
75 /*get queue data from "queue_append"*/ in tqueue_get()
77 /**TESTPOINT: queue get*/ in tqueue_get()
81 /*get queue data from "queue_append_list"*/ in tqueue_get()
86 /*get queue data from "queue_merge_slist"*/ in tqueue_get()
113 /**TESTPOINT: thread-thread data passing via queue*/ in tqueue_thread_thread()
125 /**TESTPOINT: thread-isr data passing via queue*/ in tqueue_thread_isr()
133 /**TESTPOINT: isr-thread data passing via queue*/ in tqueue_isr_thread()
140 * @brief Verify data passing between threads using queue
145 * Current thread will append item into queue.
147 * Verify queue can be define at compile time.
157 k_queue_init(&queue); in ZTEST()
158 tqueue_thread_thread(&queue); in ZTEST()
160 /**TESTPOINT: test K_QUEUE_DEFINEed queue*/ in ZTEST()
171 * the created array, prove that the queue data structures
181 k_queue_init(&queue); in ZTEST()
182 tqueue_thread_isr(&queue); in ZTEST()
184 /**TESTPOINT: test K_QUEUE_DEFINEed queue*/ in ZTEST()
202 /**TESTPOINT: test k_queue_init queue*/ in ZTEST()
203 k_queue_init(&queue); in ZTEST()
204 tqueue_isr_thread(&queue); in ZTEST()
206 /**TESTPOINT: test K_QUEUE_DEFINE queue*/ in ZTEST()
249 /**TESTPOINT: test k_queue_init queue*/ in ZTEST()
250 k_queue_init(&queue); in ZTEST()
252 tqueue_get_2threads(&queue); in ZTEST()
268 /* Prepend to the queue, but fails because of in tqueue_alloc()
275 /* No element must be present in the queue, as all in tqueue_alloc()
286 /* Now queue shouldn't be empty */ in tqueue_alloc()
294 * @brief Test queue alloc append and prepend
310 k_queue_init(&queue); in ZTEST()
312 tqueue_alloc(&queue); in ZTEST()
316 /* Does nothing but read items out of the queue and verify that they
330 /* There was a historical race in the queue internals when CONFIG_POLL
341 k_queue_init(&queue); in ZTEST()
345 &queue, (void *)&mid_count, NULL, in ZTEST()
350 &queue, (void *)&low_count, NULL, in ZTEST()
361 k_queue_append(&queue, &data[0]); in ZTEST()
362 k_queue_append(&queue, &data[1]); in ZTEST()
405 k_queue_is_empty(&queue); in user_access_queue_private_data()
416 * available as they store bookkeeping information about the queue directly
417 * in the queue buffers which are visible from user mode.
429 k_queue_init(&queue); in ZTEST()
430 k_queue_insert(&queue, k_queue_peek_tail(&queue), (void *)&data[0]); in ZTEST()
443 "The low priority thread get the queue data failed lastly"); in low_prio_wait_for_queue()
453 "The highest priority and waited longest get the queue data failed firstly"); in high_prio_t1_wait_for_queue()
463 "The higher priority and waited longer get the queue data failed secondly"); in high_prio_t2_wait_for_queue()
467 * @brief Test multi-threads to get data from a queue.
487 k_queue_init(&queue); in ZTEST()
488 zassert_true(k_queue_is_empty(&queue) != 0, " Initializing queue failed"); in ZTEST()
497 &queue, NULL, NULL, in ZTEST()
502 &queue, NULL, NULL, in ZTEST()
510 &queue, NULL, NULL, in ZTEST()
517 k_queue_append(&queue, &test_data[0]); in ZTEST()
518 k_queue_append(&queue, &test_data[1]); in ZTEST()
519 k_queue_append(&queue, &test_data[2]); in ZTEST()
535 * @details Append the same data to the queue repeatedly,
538 * the queue.
546 k_queue_init(&queue); in ZTEST()
547 ret = k_queue_unique_append(&queue, (void *)&data[0]); in ZTEST()
548 zassert_true(ret, "queue unique append failed"); in ZTEST()
550 ret = k_queue_unique_append(&queue, (void *)&data[0]); in ZTEST()
551 zassert_false(ret, "queue unique append should fail"); in ZTEST()
553 ret = k_queue_unique_append(&queue, (void *)&data[1]); in ZTEST()
554 zassert_true(ret, "queue unique append failed"); in ZTEST()