• 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     UINT32 ret;
39 
40     g_testCount++;
41 
42     ret = LOS_TaskSuspend(g_testTaskID01);
43     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
44 
45 EXIT:
46     LOS_TaskDelete(g_testTaskID01);
47 
48     return;
49 }
50 
SwtmrF01(VOID)51 static VOID SwtmrF01(VOID)
52 {
53     return;
54 }
55 
TestCase(VOID)56 static UINT32 TestCase(VOID)
57 {
58     UINT32 ret;
59     UINT32 loop;
60     UINT32 loopEnd = 0xff;
61     UINT32 swTmrID;
62     TSK_INIT_PARAM_S task1 = { 0 };
63     task1.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF01;
64     task1.uwStackSize = TASK_STACK_SIZE_TEST;
65     task1.pcName = "Tsk088A";
66     task1.usTaskPrio = TASK_PRIO_TEST - 2; // 2, set new task priority, it is higher than the current task.
67 
68     g_testCount = 0;
69 
70     ret = LOS_SwtmrCreate(1, LOS_SWTMR_MODE_PERIOD, (SWTMR_PROC_FUNC)SwtmrF01, &swTmrID, 0xffff
71 #if (LOSCFG_BASE_CORE_SWTMR_ALIGN == 1)
72         , OS_SWTMR_ROUSES_ALLOW, OS_SWTMR_ALIGN_INSENSITIVE
73 #endif
74     );
75     ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
76 
77     ret = LOS_SwtmrStart(swTmrID);
78     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
79 
80     for (loop = 0; loop < loopEnd; loop++) {
81         ret = LOS_TaskCreate(&g_testTaskID01, &task1);
82         ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
83 
84         ICUNIT_GOTO_EQUAL(g_testCount, loop + 1, g_testCount, EXIT);
85 
86         ret = LOS_TaskResume(g_testTaskID01);
87         ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
88     }
89 
90     ret = LOS_SwtmrDelete(swTmrID);
91     ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
92 
93     return LOS_OK;
94 
95 EXIT:
96 
97     ret = LOS_SwtmrDelete(swTmrID);
98     ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
99 
100     LOS_TaskDelete(g_testTaskID01);
101 
102     return LOS_OK;
103 }
104 
ItLosTask088(VOID)105 VOID ItLosTask088(VOID) // IT_Layer_ModuleORFeature_No
106 {
107     TEST_ADD_CASE("ItLosTask088", TestCase, TEST_LOS, TEST_TASK, TEST_LEVEL2, TEST_PRESSURE);
108 }
109 
110