• 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 
TaskF03(UINT32 arg)36 static VOID TaskF03(UINT32 arg)
37 {
38     ICUNIT_GOTO_EQUAL(arg, -1, arg, EXIT);
39     g_testCount++;
40 EXIT:
41     return;
42 }
43 
TaskF02(UINT32 arg)44 static VOID TaskF02(UINT32 arg)
45 {
46     ICUNIT_GOTO_EQUAL(arg, 0, arg, EXIT);
47     g_testCount++;
48 EXIT:
49     return;
50 }
51 
TaskF01(UINT32 arg1)52 static VOID TaskF01(UINT32 arg1)
53 {
54     ICUNIT_GOTO_EQUAL(arg1, 0xffff, arg1, EXIT);
55     g_testCount++;
56 EXIT:
57     return;
58 }
59 
TestCase(VOID)60 static UINT32 TestCase(VOID)
61 {
62     UINT32 ret;
63     TSK_INIT_PARAM_S task1 = { 0 };
64     task1.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF01;
65     task1.uwStackSize = TASK_STACK_SIZE_TEST;
66     task1.pcName = "Tsk094A";
67     task1.usTaskPrio = TASK_PRIO_TEST - 2; // 2, set new task priority, it is higher than the current task.
68     task1.uwResved = LOS_TASK_ATTR_JOINABLE;
69     task1.uwArg = 0xffff;
70 
71     g_testCount = 0;
72     ret = LOS_TaskCreateOnly(&g_testTaskID01, &task1);
73     ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
74     ICUNIT_GOTO_EQUAL(g_testCount, 0, g_testCount, EXIT);
75 
76     LOS_TaskResume(g_testTaskID01);
77 
78     ICUNIT_GOTO_EQUAL(g_testCount, 1, g_testCount, EXIT);
79 
80     task1.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF02;
81     task1.uwArg = 0;
82     task1.pcName = "Tsk094B";
83     task1.usTaskPrio = TASK_PRIO_TEST - 3; // 3, set new task priority base on testsuite task`s priority.
84     ret = LOS_TaskCreateOnly(&g_testTaskID02, &task1);
85     ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
86     ICUNIT_GOTO_EQUAL(g_testCount, 1, g_testCount, EXIT);
87 
88     LOS_TaskResume(g_testTaskID02);
89 
90     ICUNIT_GOTO_EQUAL(g_testCount, 2, g_testCount, EXIT); // 2, Here, assert that g_testCount is equal to 2.
91 
92     task1.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF03;
93     task1.uwArg = -1;
94     task1.pcName = "Tsk094C";
95     task1.usTaskPrio = TASK_PRIO_TEST - 4; // 4, set new task priority base on testsuite task`s priority.
96     ret = LOS_TaskCreateOnly(&g_testTaskID03, &task1);
97     ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
98     ICUNIT_GOTO_EQUAL(g_testCount, 2, g_testCount, EXIT); // 2, Here, assert that g_testCount is equal to 2.
99 
100     LOS_TaskResume(g_testTaskID03);
101 
102     ICUNIT_GOTO_EQUAL(g_testCount, 3, g_testCount, EXIT); // 3, Here, assert that g_testCount is equal to 3.
103 
104     ret = LOS_TaskJoin(g_testTaskID01, NULL);
105     ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT);
106 
107     ret = LOS_TaskJoin(g_testTaskID02, NULL);
108     ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT);
109 
110     ret = LOS_TaskJoin(g_testTaskID03, NULL);
111     ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT);
112 
113 EXIT:
114     LOS_TaskDelete(g_testTaskID01);
115     LOS_TaskDelete(g_testTaskID02);
116     LOS_TaskDelete(g_testTaskID03);
117     LOS_TaskJoin(g_testTaskID01, NULL);
118     LOS_TaskJoin(g_testTaskID02, NULL);
119     LOS_TaskJoin(g_testTaskID03, NULL);
120     return LOS_OK;
121 }
122 
ItLosTask094(VOID)123 VOID ItLosTask094(VOID) // IT_Layer_ModuleORFeature_No
124 {
125     TEST_ADD_CASE("ItLosTask094", TestCase, TEST_LOS, TEST_TASK, TEST_LEVEL0, TEST_FUNCTION);
126 }
127 
128