Re-run with updated script to convert integer literal delay arguments to k_thread_create and K_THREAD_DEFINE to use the standard timeout macros. Signed-off-by: Peter Bigot <peter.bigot@nordicsemi.no>
128 lines
3.2 KiB
C
128 lines
3.2 KiB
C
/*
|
|
* Copyright (c) 2017 Intel Corporation
|
|
*
|
|
* SPDX-License-Identifier: Apache-2.0
|
|
*/
|
|
|
|
#include "test_queue.h"
|
|
|
|
#define STACK_SIZE (512 + CONFIG_TEST_EXTRA_STACKSIZE)
|
|
#define LIST_LEN 4
|
|
#define LOOPS 32
|
|
|
|
static qdata_t data[LIST_LEN];
|
|
static qdata_t data_p[LIST_LEN];
|
|
static qdata_t data_r[LIST_LEN];
|
|
static struct k_queue queue;
|
|
static K_THREAD_STACK_DEFINE(tstack, STACK_SIZE);
|
|
static struct k_thread tdata;
|
|
static struct k_sem end_sema;
|
|
|
|
static void tqueue_append(struct k_queue *pqueue)
|
|
{
|
|
/**TESTPOINT: queue append*/
|
|
for (int i = 0; i < LIST_LEN; i++) {
|
|
k_queue_append(pqueue, (void *)&data[i]);
|
|
}
|
|
|
|
/**TESTPOINT: queue prepend*/
|
|
for (int i = LIST_LEN - 1; i >= 0; i--) {
|
|
k_queue_prepend(pqueue, (void *)&data_p[i]);
|
|
}
|
|
|
|
/**TESTPOINT: queue find and remove*/
|
|
for (int i = LIST_LEN - 1; i >= 0; i--) {
|
|
k_queue_prepend(pqueue, (void *)&data_r[i]);
|
|
}
|
|
}
|
|
|
|
static void tqueue_get(struct k_queue *pqueue)
|
|
{
|
|
void *rx_data;
|
|
|
|
/*get queue data from "queue_prepend"*/
|
|
for (int i = 0; i < LIST_LEN; i++) {
|
|
/**TESTPOINT: queue get*/
|
|
rx_data = k_queue_get(pqueue, K_NO_WAIT);
|
|
zassert_equal(rx_data, (void *)&data_p[i], NULL);
|
|
}
|
|
|
|
/*get queue data from "queue_append"*/
|
|
for (int i = 0; i < LIST_LEN; i++) {
|
|
/**TESTPOINT: queue get*/
|
|
rx_data = k_queue_get(pqueue, K_NO_WAIT);
|
|
zassert_equal(rx_data, (void *)&data[i], NULL);
|
|
}
|
|
}
|
|
|
|
static void tqueue_find_and_remove(struct k_queue *pqueue)
|
|
{
|
|
/*remove queue data from "queue_find_and_remove"*/
|
|
for (int i = 0; i < LIST_LEN; i++) {
|
|
/**TESTPOINT: queue find and remove*/
|
|
zassert_true(k_queue_remove(pqueue, &data_r[i]), NULL);
|
|
}
|
|
}
|
|
|
|
/*entry of contexts*/
|
|
static void tIsr_entry(void *p)
|
|
{
|
|
TC_PRINT("isr queue find and remove\n");
|
|
tqueue_find_and_remove((struct k_queue *)p);
|
|
TC_PRINT("isr queue get\n");
|
|
tqueue_get((struct k_queue *)p);
|
|
TC_PRINT("isr queue append ---> ");
|
|
tqueue_append((struct k_queue *)p);
|
|
}
|
|
|
|
static void tThread_entry(void *p1, void *p2, void *p3)
|
|
{
|
|
TC_PRINT("thread queue find and remove\n");
|
|
tqueue_find_and_remove((struct k_queue *)p1);
|
|
TC_PRINT("thread queue get\n");
|
|
tqueue_get((struct k_queue *)p1);
|
|
k_sem_give(&end_sema);
|
|
TC_PRINT("thread queue append ---> ");
|
|
tqueue_append((struct k_queue *)p1);
|
|
k_sem_give(&end_sema);
|
|
}
|
|
|
|
/* queue read write job */
|
|
static void tqueue_read_write(struct k_queue *pqueue)
|
|
{
|
|
k_sem_init(&end_sema, 0, 1);
|
|
/**TESTPOINT: thread-isr-thread data passing via queue*/
|
|
k_tid_t tid = k_thread_create(&tdata, tstack, STACK_SIZE,
|
|
tThread_entry, pqueue, NULL, NULL,
|
|
K_PRIO_PREEMPT(0), 0, K_NO_WAIT);
|
|
|
|
TC_PRINT("main queue append ---> ");
|
|
tqueue_append(pqueue);
|
|
irq_offload(tIsr_entry, pqueue);
|
|
k_sem_take(&end_sema, K_FOREVER);
|
|
k_sem_take(&end_sema, K_FOREVER);
|
|
|
|
TC_PRINT("main queue find and remove\n");
|
|
tqueue_find_and_remove(pqueue);
|
|
TC_PRINT("main queue get\n");
|
|
tqueue_get(pqueue);
|
|
k_thread_abort(tid);
|
|
TC_PRINT("\n");
|
|
}
|
|
|
|
/*test cases*/
|
|
/**
|
|
* @brief Test queue operations in loop
|
|
* @ingroup kernel_queue_tests
|
|
* @see k_queue_append(), k_queue_get(),
|
|
* k_queue_init(), k_queue_remove()
|
|
*/
|
|
void test_queue_loop(void)
|
|
{
|
|
k_queue_init(&queue);
|
|
for (int i = 0; i < LOOPS; i++) {
|
|
TC_PRINT("* Pass data by queue in loop %d\n", i);
|
|
tqueue_read_write(&queue);
|
|
}
|
|
}
|