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