• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
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 
TaskF01(VOID)36 static VOID TaskF01(VOID)
37 {
38     g_testCount++;
39     return;
40 }
41 
TestCase(VOID)42 static UINT32 TestCase(VOID)
43 {
44     UINT32 ret;
45     UINT8 startIndex;
46     UINT8 index;
47     UINT8 delIndex;
48     UINT8 pro;
49     CHAR acName[TASK_NAME_NUM];
50     UINT32 auwTestTaskID[LOSCFG_BASE_CORE_TSK_LIMIT];
51     UINT32 taskCnt = TaskUsedCountGet();
52     TSK_INIT_PARAM_S task1 = { 0 };
53     task1.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF01;
54     task1.uwStackSize = LOSCFG_BASE_CORE_TSK_MIN_STACK_SIZE;
55 
56     g_leavingTaskNum = LOSCFG_BASE_CORE_TSK_LIMIT - taskCnt;
57     LOS_TaskLock();
58 
59     if (LOSCFG_BASE_CORE_SWTMR == 1) {
60         startIndex = 1;
61         pro = 1;
62     } else {
63         startIndex = 0;
64         pro = 0;
65     }
66 
67     g_testCount = 0;
68 
69     for (index = 0; index < g_leavingTaskNum + startIndex; pro++, index++) {
70         if (pro == TASK_PRIO_TEST) {
71             pro++;
72         }
73 
74         if (pro >= OS_TASK_PRIORITY_LOWEST) {
75             pro = 0;
76         }
77 
78         task1.usTaskPrio = pro;
79         (void)sprintf_s(acName, TASK_NAME_NUM, "Tsk087_%d", index);
80         task1.pcName = acName;
81 
82         ret = LOS_TaskCreate(&auwTestTaskID[index], &task1);
83         ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
84     }
85 
86     task1.pcName = "Tsk087Err";
87     task1.usTaskPrio++;
88     ret = LOS_TaskCreate(&auwTestTaskID[index], &task1);
89     ICUNIT_TRACK_EQUAL(ret, LOS_ERRNO_TSK_TCB_UNAVAILABLE, ret);
90 
91 EXIT:
92     for (delIndex = 0; delIndex < index - 1 + startIndex; delIndex++) {
93         ret = LOS_TaskDelete(auwTestTaskID[delIndex]);
94         ICUNIT_TRACK_EQUAL(ret, LOS_OK, ret);
95     }
96 
97     LOS_TaskUnlock();
98 
99     ICUNIT_TRACK_EQUAL(g_testCount, 0, g_testCount);
100 
101     return LOS_OK;
102 }
103 
ItLosTask087(VOID)104 VOID ItLosTask087(VOID) // IT_Layer_ModuleORFeature_No
105 {
106     TEST_ADD_CASE("ItLosTask087", TestCase, TEST_LOS, TEST_TASK, TEST_LEVEL2, TEST_PRESSURE);
107 }
108 
109