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