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