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
36
TaskF01(VOID)37 static VOID TaskF01(VOID)
38 {
39 UINT32 ret, newPrio;
40 g_testCount++;
41 ret = LOS_CurTaskPriSet(OS_TASK_PRIORITY_HIGHEST);
42 ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
43
44 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, OS_TASK_PRIORITY_HIGHEST, g_losTask.runTask->priority);
45
46 newPrio = TASK_PRIO_TEST - 4; // 4，get new priority, it is higher than the task of testsuit.
47 ret = LOS_CurTaskPriSet(newPrio);
48 ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
49
50 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, newPrio, g_losTask.runTask->priority);
51
52 ICUNIT_ASSERT_EQUAL_VOID(g_testCount, 1, g_testCount);
53 ret = LOS_CurTaskPriSet(OS_TASK_PRIORITY_LOWEST);
54 ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
55
56 g_testCount++;
57 }
58
TestCase(VOID)59 static UINT32 TestCase(VOID)
60 {
61 UINT32 ret;
62 TSK_INIT_PARAM_S task1 = { 0 };
63 task1.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF01;
64 task1.uwStackSize = TASK_STACK_SIZE_TEST;
65 task1.pcName = "Tsk047A";
66 task1.usTaskPrio = TASK_PRIO_TEST - 2; // 2, set new task priority, it is higher than the current task.
67 task1.uwResved = LOS_TASK_STATUS_DETACHED;
68 g_testCount = 0;
69 ret = LOS_TaskCreate(&g_testTaskID01, &task1);
70 ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
71 ICUNIT_ASSERT_EQUAL(g_testCount, 1, g_testCount);
72
73 ret = LOS_TaskDelete(g_testTaskID01);
74 ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
75
76 return LOS_OK;
77 }
78
ItLosTask047(VOID)79 VOID ItLosTask047(VOID) // IT_Layer_ModuleORFeature_No
80 {
81 TEST_ADD_CASE("ItLosTask047", TestCase, TEST_LOS, TEST_TASK, TEST_LEVEL0, TEST_FUNCTION);
82 }
83
84