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 "It_los_queue.h"
33
34
ItQueueHead032F02null35 static VOID ItQueueHead032F02(VOID)
36 {
37 UINT32 ret;
38 CHAR buff2[8] = "";
39
40 g_testCount++;
41
42 ret = LOS_QueueRead(g_testQueueID01, &buff2, QUEUE_BASE_MSGSIZE, 0);
43 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
44
45 g_testCount++;
46
47 EXIT:
48 LOS_TaskDelete(g_testTaskID02);
49 }
ItQueueHead032F01null50 static VOID ItQueueHead032F01(VOID)
51 {
52 UINT32 ret;
53 CHAR buff1[8] = "UniDSP";
54
55 g_testCount++;
56
57 ret = LOS_QueueWriteHead(g_testQueueID01, &buff1, QUEUE_BASE_MSGSIZE, 100); // 100, Set the timeout time
58 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
59
60 g_testCount++;
61
62 EXIT:
63 LOS_TaskDelete(g_testTaskID01);
64 }
65
Testcasenull66 static UINT32 Testcase(VOID)
67 {
68 UINT32 ret;
69 CHAR buff1[8] = "UniDSP";
70
71 TSK_INIT_PARAM_S task1 = { 0 };
72 TSK_INIT_PARAM_S task2 = { 0 };
73
74 task1.pfnTaskEntry = (TSK_ENTRY_FUNC)ItQueueHead032F01;
75 task1.pcName = "TskName1";
76 task1.uwStackSize = TASK_STACK_SIZE_TEST;
77 task1.usTaskPrio = 22; // 22, Set the priority according to the task purpose,a smaller number means a higher priority.
78
79 task2.pfnTaskEntry = (TSK_ENTRY_FUNC)ItQueueHead032F02;
80 task2.pcName = "TskName2";
81 task2.uwStackSize = TASK_STACK_SIZE_TEST;
82 task2.usTaskPrio = 21; // 21, Set the priority according to the task purpose,a smaller number means a higher priority.
83
84 g_testCount = 0;
85
86 ret = LOS_QueueCreate("Q1", 1, &g_testQueueID01, 0, QUEUE_BASE_MSGSIZE);
87 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
88
89 ret = LOS_QueueWriteHead(g_testQueueID01, &buff1, QUEUE_BASE_MSGSIZE, 100); // 100, Set the timeout time
90 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
91
92 ret = LOS_TaskCreate(&g_testTaskID01, &task1);
93 ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
94
95 ICUNIT_ASSERT_EQUAL(g_testCount, 1, g_testCount);
96 g_testCount++;
97
98 ret = LOS_TaskCreate(&g_testTaskID02, &task2);
99 ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
100
101 ICUNIT_GOTO_EQUAL(g_testCount, 5, g_testCount, EXIT); // Compare wiht the expected value 5.
102
103 EXIT:
104 LOS_QueueDelete(g_testQueueID01);
105 return LOS_OK;
106 }
107
ItLosQueueHead032null108 VOID ItLosQueueHead032(VOID)
109 {
110 TEST_ADD_CASE("ItLosQueueHead032", Testcase, TEST_LOS, TEST_QUE, TEST_LEVEL1, TEST_FUNCTION);
111 }
112
113