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