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
36 static UINT32 g_taskCountArray[LOSCFG_BASE_CORE_TSK_LIMIT] = {0};
TaskF01(VOID)37 static VOID TaskF01(VOID)
38 {
39 ICUNIT_TRACK_EQUAL(g_taskCountArray[g_index], g_testCount, g_taskCountArray[g_index]);
40 g_testCount++;
41 g_index++;
42 LOS_TaskDelete(g_testTaskIdArray[g_index - 1]);
43 }
44
HwiF01(VOID)45 static VOID HwiF01(VOID)
46 {
47 UINT32 ret;
48 UINT8 startIndex;
49 UINT8 delIndex;
50 UINT8 pro;
51 CHAR acName[TASK_NAME_NUM];
52 TSK_INIT_PARAM_S task1 = { 0 };
53 task1.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF01;
54 task1.uwStackSize = LOSCFG_BASE_CORE_TSK_MIN_STACK_SIZE + 0x100;
55
56 TestHwiClear(HWI_NUM_TEST);
57
58 if (LOSCFG_BASE_CORE_SWTMR == 1) {
59 pro = 1;
60 } else {
61 pro = 0;
62 }
63 startIndex = TaskUsedCountGet() + 1;
64
65 g_testCount = 0;
66
67 for (g_index = startIndex; g_index < LOSCFG_BASE_CORE_TSK_LIMIT + 1; pro++, g_testCount++, g_index++) {
68 task1.usTaskPrio = pro;
69 (void)sprintf_s(acName, TASK_NAME_NUM, "Tsk086_%d", g_index);
70 task1.pcName = acName;
71
72 ret = LOS_TaskCreate(&g_testTaskIdArray[g_index], &task1);
73 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
74
75 g_taskCountArray[g_index] = g_testCount;
76 }
77
78 g_testCount = 0;
79 g_index = startIndex;
80
81 return;
82
83 EXIT:
84 for (delIndex = startIndex; delIndex < g_index - 1 + startIndex; delIndex++) {
85 LOS_TaskDelete(g_testTaskIdArray[delIndex]);
86 }
87
88 return;
89 }
90
TestCase(VOID)91 static UINT32 TestCase(VOID)
92 {
93 UINT32 ret;
94
95 ret = LOS_HwiCreate(HWI_NUM_TEST, 1, 0, HwiF01, 0);
96 ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
97
98 TestHwiTrigger(HWI_NUM_TEST);
99
100 LOS_TaskDelay(5); // 5, set delay time
101 TestHwiDelete(HWI_NUM_TEST);
102 return LOS_OK;
103 }
104
ItLosTask086(VOID)105 VOID ItLosTask086(VOID) // IT_Layer_ModuleORFeature_No
106 {
107 TEST_ADD_CASE("ItLosTask086", TestCase, TEST_LOS, TEST_TASK, TEST_LEVEL2, TEST_PRESSURE);
108 }
109
110