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_task.h"
34
35
TaskF02(VOID)36 static VOID TaskF02(VOID)
37 {
38 UINT32 ret;
39
40 ICUNIT_GOTO_EQUAL(g_testCount, 1, g_testCount, EXIT1);
41 g_testCount++;
42
43 ret = LOS_TaskResume(g_testTaskID01);
44 ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
45
46 ICUNIT_GOTO_EQUAL(g_testCount, 3, g_testCount, EXIT2); // 3, Here, assert that g_testCount is equal to 3.
47 g_testCount++;
48
49 LOS_TaskDelete(g_testTaskID02);
50 return;
51
52 EXIT1:
53 LOS_TaskDelete(g_testTaskID01);
54 EXIT2:
55 LOS_TaskDelete(g_testTaskID02);
56
57 return;
58 }
59
TaskF01(VOID)60 static VOID TaskF01(VOID)
61 {
62 UINT32 ret;
63
64 g_testCount++;
65
66 ret = LOS_TaskSuspend(g_testTaskID01);
67 ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
68
69 ICUNIT_GOTO_EQUAL(g_testCount, 2, g_testCount, EXIT); // 2, Here, assert that g_testCount is equal to 2.
70 g_testCount++;
71
72 LOS_TaskDelete(g_testTaskID01);
73
74 return;
75
76 EXIT:
77 LOS_TaskDelete(g_testTaskID01);
78 LOS_TaskDelete(g_testTaskID02);
79
80 return;
81 }
82
TestCase(VOID)83 static UINT32 TestCase(VOID)
84 {
85 UINT32 ret;
86 TSK_INIT_PARAM_S task1 = { 0 };
87 task1.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF01;
88 task1.uwStackSize = TASK_STACK_SIZE_TEST;
89 task1.pcName = "Tsk073A";
90 task1.usTaskPrio = TASK_PRIO_TEST - 2; // 2, set new task priority, it is higher than the current task.
91
92 g_testCount = 0;
93
94 LOS_TaskLock();
95
96 ret = LOS_TaskCreate(&g_testTaskID01, &task1);
97 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT2);
98
99 task1.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF02;
100 task1.pcName = "Tsk073B";
101 task1.usTaskPrio = TASK_PRIO_TEST - 1;
102
103 ret = LOS_TaskCreate(&g_testTaskID02, &task1);
104 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT1);
105
106 ICUNIT_GOTO_EQUAL(g_testCount, 0, g_testCount, EXIT1);
107
108 LOS_TaskUnlock();
109
110 ICUNIT_ASSERT_EQUAL(g_testCount, 4, g_testCount); // 4, Here, assert that g_testCount is equal to 4.
111
112 return LOS_OK;
113
114 EXIT1:
115 LOS_TaskDelete(g_testTaskID01);
116 EXIT2:
117 LOS_TaskUnlock();
118
119 return LOS_OK;
120 }
121
ItLosTask073(VOID)122 VOID ItLosTask073(VOID) // IT_Layer_ModuleORFeature_No
123 {
124 TEST_ADD_CASE("ItLosTask073", TestCase, TEST_LOS, TEST_TASK, TEST_LEVEL1, TEST_FUNCTION);
125 }
126
127