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