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 "osTest.h"
33 #include "It_los_mux.h"
34 #include "los_config.h"
35
36
TaskFuncC(VOID)37 static VOID TaskFuncC(VOID)
38 {
39 UINT32 ret;
40 g_testCount++;
41
42 ICUNIT_ASSERT_EQUAL_VOID(g_testCount, 3, g_testCount); // 3, Here, assert that g_testCount is equal to 3.
43
44 ret = LOS_MuxPend(g_mutexTest1, LOS_WAIT_FOREVER);
45 ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
46
47 ret = LOS_MuxPost(g_mutexTest1);
48 ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
49
50 // 3, Here, assert that g_testCount is equal to 3.
51 ICUNIT_ASSERT_EQUAL_VOID(g_testCount, 3, g_testCount);
52 // 3, Here, assert that priority is equal to 3.
53 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 3, g_losTask.runTask->priority);
54 g_testCount++;
55 }
56
TaskFuncB(VOID)57 static VOID TaskFuncB(VOID)
58 {
59 UINT32 ret;
60 g_testCount++;
61
62 ICUNIT_ASSERT_EQUAL_VOID(g_testCount, 2, g_testCount); // 2, Here, assert that g_testCount is equal to 2.
63
64 ret = LOS_MuxPend(g_mutexTest1, LOS_WAIT_FOREVER);
65 ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
66
67 ret = LOS_MuxPost(g_mutexTest1);
68 ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
69
70 // 4, Here, assert that g_testCount is equal to 4.
71 ICUNIT_ASSERT_EQUAL_VOID(g_testCount, 4, g_testCount);
72
73 // 5, Here, assert that priority is equal to 5.
74 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 5, g_losTask.runTask->priority);
75 g_testCount++;
76 }
77
TaskFuncA(VOID)78 static VOID TaskFuncA(VOID)
79 {
80 UINT32 ret;
81 TSK_INIT_PARAM_S task1 = {0};
82 TSK_INIT_PARAM_S task2 = {0};
83 g_testCount++;
84
85 ICUNIT_ASSERT_EQUAL_VOID(g_testCount, 1, g_testCount); // 1, Here, assert that g_testCount is equal to 1.
86
87 ret = LOS_MuxPend(g_mutexTest1, 0);
88 ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
89
90 task1.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskFuncB;
91 // 5, Set the priority according to the task purpose,a smaller number means a higher priority.
92 task1.usTaskPrio = 5;
93 task1.pcName = "TaskB";
94 task1.uwStackSize = LOSCFG_BASE_CORE_TSK_DEFAULT_STACK_SIZE;
95 task1.uwResved = LOS_TASK_STATUS_DETACHED;
96
97 ret = LOS_TaskCreate(&g_testTaskID02, &task1);
98 ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
99
100 task2.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskFuncC;
101 // 3, Set the priority according to the task purpose,a smaller number means a higher priority.
102 task2.usTaskPrio = 3;
103 task2.pcName = "TaskC";
104 task2.uwStackSize = LOSCFG_BASE_CORE_TSK_DEFAULT_STACK_SIZE;
105 task2.uwResved = LOS_TASK_STATUS_DETACHED;
106
107 ret = LOS_TaskCreate(&g_testTaskID03, &task2);
108 ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
109
110 ICUNIT_ASSERT_EQUAL_VOID(g_testCount, 3, g_testCount); // 3, Here, assert that g_testCount is equal to 3.
111
112 ret = LOS_MuxPost(g_mutexTest1);
113 ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
114
115 ret = LOS_MuxDelete(g_mutexTest1);
116 ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
117
118 // 10, Here, assert that priority is equal to 10.
119 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 10, g_losTask.runTask->priority);
120
121 ICUNIT_ASSERT_EQUAL_VOID(g_testCount, 5, g_testCount); // 5, Here, assert that g_testCount is equal to 5.
122 }
123
Testcase(void)124 static UINT32 Testcase(void)
125 {
126 UINT32 ret;
127 TSK_INIT_PARAM_S task = {0};
128 g_testCount = 0;
129
130 ret = LOS_MuxCreate(&g_mutexTest1);
131 ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
132
133 task.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskFuncA;
134 task.pcName = "TaskA";
135 // 10, Set the priority according to the task purpose,a smaller number means a higher priority.
136 task.usTaskPrio = 10;
137 task.uwStackSize = LOSCFG_BASE_CORE_TSK_DEFAULT_STACK_SIZE;
138 task.uwResved = LOS_TASK_STATUS_DETACHED;
139
140 ret = LOS_TaskCreate(&g_testTaskID01, &task);
141 ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
142
143 ICUNIT_ASSERT_EQUAL(g_testCount, 5, g_testCount); // 5, Here, assert that g_testCount is equal to 5.
144 // 25, Here, assert that priority is equal to 25.
145 ICUNIT_ASSERT_EQUAL(g_losTask.runTask->priority, 25, g_losTask.runTask->priority);
146 return LOS_OK;
147 }
148
ItLosMux027(void)149 VOID ItLosMux027(void)
150 {
151 TEST_ADD_CASE("ItLosMux027", Testcase, TEST_LOS, TEST_MUX, TEST_LEVEL1, TEST_FUNCTION);
152 }
153
154