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_ASSERT_EQUAL_VOID(g_testCount, 1, g_testCount);
41 g_testCount++;
42
43 ret = LOS_TaskResume(g_testTaskID01);
44 ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
45
46 ICUNIT_ASSERT_EQUAL_VOID(g_testCount, 3, g_testCount); // 3, Here, assert that g_testCount is equal to 3.
47 g_testCount++;
48
49 LOS_TaskDelete(g_testTaskID02);
50 }
51
TaskF01(VOID)52 static VOID TaskF01(VOID)
53 {
54 UINT32 ret;
55 TSK_INIT_PARAM_S task2 = { 0 };
56 task2.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF02;
57 task2.usTaskPrio = TASK_PRIO_TEST - 3; // 3, set new task priority base on testsuite task`s priority.
58 task2.pcName = "Tsk085B";
59 task2.uwStackSize = TASK_STACK_SIZE_TEST + 0x200;
60 g_testCount++;
61
62 ret = LOS_TaskCreate(&g_testTaskID02, &task2);
63 ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
64
65 ret = LOS_TaskSuspend(g_testTaskID01);
66 ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
67
68 ICUNIT_ASSERT_EQUAL_VOID(g_testCount, 2, g_testCount); // 2, Here, assert that g_testCount is equal to 2.
69 g_testCount++;
70
71 LOS_TaskDelete(g_testTaskID01);
72 }
73
TestCase(VOID)74 static UINT32 TestCase(VOID)
75 {
76 UINT32 ret;
77 UINT32 loop;
78 TSK_INIT_PARAM_S task1 = { 0 };
79
80 task1.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF01;
81 task1.usTaskPrio = TASK_PRIO_TEST - 5; // 5, set new task priority base on testsuite task`s priority.
82 task1.uwStackSize = TASK_STACK_SIZE_TEST + 0x200;
83 task1.pcName = "Tsk085A";
84
85 for (loop = 0; loop < IT_TASK_LOOP; loop++) {
86 g_testCount = 0;
87
88 ret = LOS_TaskCreate(&g_testTaskID01, &task1);
89 ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
90
91 ICUNIT_ASSERT_EQUAL(g_testCount, 4, g_testCount); // 4, Here, assert that g_testCount is equal to 4.
92 }
93
94 return LOS_OK;
95 }
96
ItLosTask085(VOID)97 VOID ItLosTask085(VOID) // IT_Layer_ModuleORFeature_No
98 {
99 TEST_ADD_CASE("ItLosTask085", TestCase, TEST_LOS, TEST_TASK, TEST_LEVEL2, TEST_PRESSURE);
100 }
101
102