1 /*
2 * Copyright (c) 2013-2019 Huawei Technologies Co., Ltd. All rights reserved.
3 * Copyright (c) 2020-2021 Huawei Device Co., Ltd. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without modification,
6 * are permitted provided that the following conditions are met:
7 *
8 * 1. Redistributions of source code must retain the above copyright notice, this list of
9 * conditions and the following disclaimer.
10 *
11 * 2. Redistributions in binary form must reproduce the above copyright notice, this list
12 * of conditions and the following disclaimer in the documentation and/or other materials
13 * provided with the distribution.
14 *
15 * 3. Neither the name of the copyright holder nor the names of its contributors may be used
16 * to endorse or promote products derived from this software without specific prior written
17 * permission.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
21 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
23 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
24 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
25 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
26 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
27 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
28 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
29 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 */
31
32 #include "It_los_queue.h"
33
TaskF01(VOID)34 static VOID TaskF01(VOID)
35 {
36 UINT32 ret;
37 CHAR buff1[QUEUE_SHORT_BUFFER_LENGTH] = "UniDSP";
38 CHAR buff2[QUEUE_SHORT_BUFFER_LENGTH] = " ";
39
40 ret = LOS_QueueRead(g_testQueueID01, &buff2, QUEUE_BASE_MSGSIZE, LOS_WAIT_FOREVER);
41 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
42
43 ret = LOS_QueueWrite(g_testQueueID01, &buff1, QUEUE_BASE_MSGSIZE, 0);
44 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
45
46 ret = LOS_QueueWrite(g_testQueueID01, &buff1, QUEUE_BASE_MSGSIZE, LOS_WAIT_FOREVER);
47 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
48
49 EXIT:
50 ret = LOS_QueueDelete(g_testQueueID01);
51 ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
52
53 ret = LOS_TaskDelete(g_testTaskID01);
54 ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
55
56 return;
57 }
58
Testcase(VOID)59 static UINT32 Testcase(VOID)
60 {
61 UINT32 ret;
62 QUEUE_INFO_S queueInfo;
63 CHAR buff1[QUEUE_SHORT_BUFFER_LENGTH] = "UniDSP";
64
65 TSK_INIT_PARAM_S task1 = {0};
66 task1.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF01;
67 task1.uwStackSize = TASK_STACK_SIZE_TEST;
68 task1.pcName = "TskTstA";
69 task1.usTaskPrio = TASK_PRIO_TEST - 2; // TASK_PRIO_TEST - 2, Set the priority according to the task purpose,a smaller number means a higher priority.
70 task1.uwResved = LOS_TASK_STATUS_DETACHED;
71
72 ret = LOS_QueueInfoGet(0, NULL);
73 ICUNIT_ASSERT_EQUAL(ret, LOS_ERRNO_QUEUE_PTR_NULL, ret);
74
75 ret = LOS_QueueCreate("Q1", 1, &g_testQueueID01, 0, QUEUE_BASE_MSGSIZE);
76 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
77
78 ret = LOS_TaskCreate(&g_testTaskID01, &task1);
79 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT1);
80
81 ret = LOS_QueueInfoGet(g_testQueueID01, &queueInfo);
82 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT2);
83 ICUNIT_GOTO_EQUAL(queueInfo.waitReadTask[OS_WAIT_TASK_ID_TO_ARRAY_IDX(g_testTaskID01)], 1 << (g_testTaskID01 & OS_WAIT_TASK_ARRAY_ELEMENT_MASK), queueInfo.waitReadTask, EXIT2);
84
85 ret = LOS_QueueWrite(g_testQueueID01, &buff1, QUEUE_BASE_MSGSIZE, 0);
86 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT2);
87
88 ret = LOS_QueueInfoGet(g_testQueueID01, &queueInfo);
89 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT2);
90 ICUNIT_GOTO_EQUAL(queueInfo.waitWriteTask[OS_WAIT_TASK_ID_TO_ARRAY_IDX(g_testTaskID01)], 1 << (g_testTaskID01 & OS_WAIT_TASK_ARRAY_ELEMENT_MASK), queueInfo.waitWriteTask, EXIT2);
91
92 EXIT2:
93 ret = LOS_TaskDelete(g_testTaskID01);
94 ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
95 EXIT1:
96 ret = LOS_QueueDelete(g_testQueueID01);
97 ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
98 EXIT:
99 return LOS_OK;
100 }
101
LlTLosQueue001(VOID)102 VOID LlTLosQueue001(VOID)
103 {
104 TEST_ADD_CASE("LlTLosQueue001", Testcase, TEST_LOS, TEST_QUE, TEST_LEVEL0, TEST_FUNCTION);
105 }
106
107