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