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 #define QUEUE_SIZE 3
37 #define QUEUE_BUF_SIZE 8
38
TaskF01(VOID)39 static VOID TaskF01(VOID)
40 {
41 UINT32 ret;
42 CHAR buff1[QUEUE_BUF_SIZE] = "UniDSP";
43
44 ICUNIT_GOTO_EQUAL(g_testCount, 0, g_testCount, EXIT);
45 g_testCount++;
46
47 ret = LOS_QueueRead(g_testQueueID01, &buff1, QUEUE_BUF_SIZE, 0xff);
48 ICUNIT_GOTO_EQUAL(ret, LOS_ERRNO_QUEUE_ISEMPTY, ret, EXIT);
49
50 ICUNIT_GOTO_EQUAL(g_testCount, 0, g_testCount, EXIT);
51 g_testCount++;
52
53 EXIT:
54 return;
55 }
56
TestCase(VOID)57 static UINT32 TestCase(VOID)
58 {
59 UINT32 ret;
60 TSK_INIT_PARAM_S task1 = { 0 };
61
62 ret = LOS_QueueCreate("Q1", QUEUE_SIZE, &g_testQueueID01, 0, QUEUE_BUF_SIZE);
63 ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
64
65 task1.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF01;
66 task1.uwStackSize = TASK_STACK_SIZE_TEST;
67 task1.pcName = "Tsk093A";
68 task1.usTaskPrio = TASK_PRIO_TEST - 2; // 2, set new task priority, it is higher than the current task.
69
70 g_testCount = 0;
71
72 ret = LOS_TaskCreate(&g_testTaskID01, &task1);
73 ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
74 g_testCount++;
75
76 ret = LOS_TaskDelete(g_testTaskID01);
77 ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
78
79 LOS_TaskDelay(3); // 3, set delay time
80 ICUNIT_ASSERT_EQUAL(g_testCount, 2, g_testCount); // 2, Here, assert that g_testCount is equal to 2.
81
82 ret = LOS_QueueDelete(g_testQueueID01);
83 ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
84 return LOS_OK;
85 }
86
ItLosTask093(VOID)87 VOID ItLosTask093(VOID) // IT_Layer_ModuleORFeature_No
88 {
89 TEST_ADD_CASE("ItLosTask093", TestCase, TEST_LOS, TEST_TASK, TEST_LEVEL0, TEST_FUNCTION);
90 }
91
92