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, 0, g_testCount, EXIT);
41
42 g_testCount++;
43
44 LOS_TaskLock();
45
46 // 2, modify task priority, base on testsuite task`s priority.
47 ret = LOS_CurTaskPriSet(TASK_PRIO_TEST - 1);
48 ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
49
50 ICUNIT_GOTO_EQUAL(g_testCount, 1, g_testCount, EXIT);
51 g_testCount++;
52
53 LOS_TaskUnlock();
54
55 ICUNIT_GOTO_EQUAL(g_testCount, 3, g_testCount, EXIT); // 3, Here, assert that g_testCount is equal to 3.
56 g_testCount++;
57
58 return;
59 EXIT:
60 LOS_TaskDelete(g_testTaskID02);
61 return;
62 }
63
TaskF01(VOID)64 static VOID TaskF01(VOID)
65 {
66 UINT32 ret;
67 TSK_INIT_PARAM_S task1 = { 0 };
68 task1.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF02;
69 task1.uwStackSize = TASK_STACK_SIZE_TEST;
70 task1.pcName = "Tsk078B";
71 task1.usTaskPrio = TASK_PRIO_TEST - 3; // 3, set new task priority base on testsuite task`s priority.
72 task1.uwResved = LOS_TASK_STATUS_DETACHED;
73
74 ret = LOS_TaskCreate(&g_testTaskID02, &task1);
75 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
76
77 ret = LOS_TaskPriGet(g_testTaskID02);
78
79 // 2, Assert this result is consistent with the priority that has been set.
80 ICUNIT_GOTO_EQUAL(ret, TASK_PRIO_TEST - 1, ret, EXIT);
81
82 ICUNIT_GOTO_EQUAL(g_testCount, 2, g_testCount, EXIT); // 2, Here, assert that g_testCount is equal to 2.
83 g_testCount++;
84
85 LOS_TaskDelete(g_testTaskID01);
86 return;
87 EXIT:
88 LOS_TaskDelete(g_testTaskID02);
89 LOS_TaskDelete(g_testTaskID01);
90 return;
91 }
92
TestCase(VOID)93 static UINT32 TestCase(VOID)
94 {
95 UINT32 ret;
96 TSK_INIT_PARAM_S task1 = { 0 };
97 task1.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF01;
98 task1.uwStackSize = TASK_STACK_SIZE_TEST;
99 task1.pcName = "Tsk078A";
100 task1.usTaskPrio = TASK_PRIO_TEST - 2; // 2, set new task priority, it is higher than the current task.
101 task1.uwResved = LOS_TASK_ATTR_JOINABLE;
102
103 g_testCount = 0;
104 ret = LOS_TaskCreate(&g_testTaskID01, &task1);
105 ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
106
107 ret = LOS_TaskJoin(g_testTaskID01, NULL);
108 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
109
110 ICUNIT_GOTO_EQUAL(g_testCount, 4, g_testCount, EXIT); // 4, Here, assert that g_testCount is equal to 4.
111
112 return LOS_OK;
113
114 EXIT:
115 LOS_TaskDelete(g_testTaskID01);
116 LOS_TaskJoin(g_testTaskID01, NULL);
117 return LOS_OK;
118 }
119
ItLosTask115(VOID)120 VOID ItLosTask115(VOID) // IT_Layer_ModuleORFeature_No
121 {
122 TEST_ADD_CASE("ItLosTask115", TestCase, TEST_LOS, TEST_TASK, TEST_LEVEL0, TEST_FUNCTION);
123 }
124
125