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
34
TaskF01(VOID)35 static VOID TaskF01(VOID)
36 {
37 UINT32 ret;
38 CHAR buff2[QUEUE_SHORT_BUFFER_LENGTH] = "";
39
40 g_testCount++;
41
42 ret = LOS_QueueRead(g_testQueueID01, &buff2, QUEUE_BASE_MSGSIZE, 0);
43 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
44
45 g_testCount++;
46
47 EXIT:
48 LOS_TaskDelete(g_testTaskID02);
49 }
50
TaskF02(VOID)51 static VOID TaskF02(VOID)
52 {
53 UINT32 ret;
54 CHAR buff1[QUEUE_SHORT_BUFFER_LENGTH] = "UniDSP";
55
56 g_testCount++;
57
58 ret = LOS_QueueCreate("Q1", QUEUE_BASE_NUM, &g_testQueueID01, 0, QUEUE_BASE_MSGSIZE);
59 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
60
61 ret = LOS_QueueWrite(g_testQueueID01, &buff1, QUEUE_BASE_MSGSIZE, 0);
62 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
63
64 g_testCount++;
65
66 EXIT:
67 LOS_TaskDelete(g_testTaskID01);
68 }
69
Testcase(VOID)70 static UINT32 Testcase(VOID)
71 {
72 UINT32 ret;
73
74 TSK_INIT_PARAM_S task1 = { 0 };
75 TSK_INIT_PARAM_S task2 = { 0 };
76 task1.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF02;
77 task1.pcName = "TskName1";
78 task1.uwStackSize = TASK_STACK_SIZE_TEST;
79 task1.usTaskPrio = 22; // 22, Set the priority according to the task purpose,a smaller number means a higher priority.
80
81 g_testCount = 0;
82
83 ret = LOS_TaskCreate(&g_testTaskID01, &task1);
84 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
85
86 ICUNIT_GOTO_EQUAL(g_testCount, 2, g_testCount, EXIT); // Compare wiht the expected value 2.
87 g_testCount++;
88
89 task2.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF01;
90 task2.pcName = "TskName2";
91 task2.uwStackSize = TASK_STACK_SIZE_TEST;
92 task2.usTaskPrio = 23; // 23, Set the priority according to the task purpose,a smaller number means a higher priority.
93
94 ret = LOS_TaskCreate(&g_testTaskID02, &task2);
95 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
96
97 ICUNIT_GOTO_EQUAL(g_testCount, 5, g_testCount, EXIT); // Compare wiht the expected value 5.
98
99 ret = LOS_QueueDelete(g_testQueueID01);
100 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
101
102 return LOS_OK;
103 EXIT:
104 LOS_TaskDelete(g_testTaskID01);
105 LOS_TaskDelete(g_testTaskID02);
106 LOS_QueueDelete(g_testQueueID01);
107 return LOS_OK;
108 }
109
ItLosQueue042(VOID)110 VOID ItLosQueue042(VOID)
111 {
112 TEST_ADD_CASE("ItLosQueue042", Testcase, TEST_LOS, TEST_QUE, TEST_LEVEL1, TEST_FUNCTION);
113 }
114
115