• 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     ICUNIT_GOTO_EQUAL(g_testCount, 2, g_testCount, EXIT); // 2, Here, assert that g_testCount is equal to 2.
39 
40     while (g_testCount <= 2) { // 2, wait until g_testCount is greater to 2.
41     }
42     ICUNIT_ASSERT_EQUAL_VOID(g_testCount, 4, g_testCount); // 4, Here, assert that g_testCount is equal to 4.
43     g_testCount++;
44 EXIT:
45     LOS_TaskDelete(g_testTaskID02);
46 }
47 
TaskF01(VOID)48 static VOID TaskF01(VOID)
49 {
50     g_testCount++;
51     LOS_TaskDelay(2); // 2, set delay time
52     ICUNIT_ASSERT_EQUAL_VOID(g_testCount, 3, g_testCount); // 3, Here, assert that g_testCount is equal to 3.
53     g_testCount++;
54 
55     LOS_TaskDelete(g_testTaskID01);
56 }
57 
TestCase(VOID)58 static UINT32 TestCase(VOID)
59 {
60     UINT32 ret;
61     TSK_INIT_PARAM_S task1 = { 0 };
62     task1.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF01;
63     task1.uwStackSize = TASK_STACK_SIZE_TEST;
64     task1.pcName = "Tsk091A";
65     task1.usTaskPrio = TASK_PRIO_TEST - 1;
66     task1.uwResved = LOS_TASK_STATUS_DETACHED;
67     g_testCount = 0;
68     ret = LOS_TaskCreate(&g_testTaskID01, &task1);
69     ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
70     ICUNIT_ASSERT_EQUAL(g_testCount, 1, g_testCount);
71     g_testCount++;
72 
73     task1.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF02;
74     task1.pcName = "Tsk091B";
75     task1.usTaskPrio = TASK_PRIO_TEST - 3; // 3, set new task priority base on testsuite task`s priority.
76     task1.uwResved = LOS_TASK_STATUS_DETACHED;
77     ret = LOS_TaskCreate(&g_testTaskID02, &task1);
78     ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
79     ICUNIT_ASSERT_EQUAL(g_testCount, 5, g_testCount); // 5, Here, assert that g_testCount is equal to 5.
80 
81     return LOS_OK;
82 }
83 
ItLosTask091(VOID)84 VOID ItLosTask091(VOID) // IT_Layer_ModuleORFeature_No
85 {
86     TEST_ADD_CASE("ItLosTask091", TestCase, TEST_LOS, TEST_TASK, TEST_LEVEL0, TEST_FUNCTION);
87 }
88 
89