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
35
TaskF01(VOID)36 static VOID TaskF01(VOID)
37 {
38 UINT32 ret;
39 QUEUE_INFO_S queueInfo;
40
41 TestHwiClear(HWI_NUM_TEST);
42
43 g_testCount++;
44
45 ret = LOS_QueueInfoGet(g_testQueueID01, &queueInfo);
46 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
47 ICUNIT_GOTO_EQUAL(queueInfo.queueLen, 3, queueInfo.queueLen, EXIT); // Compare wiht the expected value 3.
48 ICUNIT_GOTO_EQUAL(queueInfo.queueID, g_testQueueID01, queueInfo.queueID, EXIT);
49
50 g_testCount++;
51
52 LOS_TaskDelete(g_testTaskID01);
53
54 return;
55 EXIT:
56 g_testCount = 0;
57 LOS_TaskDelete(g_testTaskID01);
58 }
59
Testcase(VOID)60 static UINT32 Testcase(VOID)
61 {
62 UINT32 ret;
63 CHAR buff1[QUEUE_SHORT_BUFFER_LENGTH] = "UniDSP";
64 QUEUE_INFO_S queueInfo;
65 TSK_INIT_PARAM_S task1 = { 0 };
66
67 task1.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF01;
68 task1.pcName = "queue_109";
69 task1.uwStackSize = TASK_STACK_SIZE_TEST;
70 task1.usTaskPrio = 23; // 23, Set the priority according to the task purpose,a smaller number means a higher priority.
71
72 g_testCount = 0;
73
74 ret = LOS_QueueCreate("Q1", QUEUE_BASE_NUM, &g_testQueueID01, 0, QUEUE_SHORT_BUFFER_LENGTH);
75 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
76
77 ret = LOS_QueueWrite(g_testQueueID01, &buff1, QUEUE_SHORT_BUFFER_LENGTH, 0);
78 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
79
80 ret = LOS_TaskCreate(&g_testTaskID01, &task1);
81 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
82
83 ICUNIT_GOTO_EQUAL(g_testCount, 2, g_testCount, EXIT); // Compare wiht the expected value 2.
84
85 g_testCount++;
86
87 ret = LOS_QueueInfoGet(g_testQueueID01, &queueInfo);
88 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
89 ICUNIT_GOTO_EQUAL(queueInfo.queueLen, 3, queueInfo.queueLen, EXIT); // Compare wiht the expected value 3.
90 ICUNIT_GOTO_EQUAL(queueInfo.queueID, g_testQueueID01, queueInfo.queueID, EXIT);
91
92 ret = LOS_QueueDelete(g_testQueueID01);
93 ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
94
95 ICUNIT_GOTO_EQUAL(g_testCount, 3, g_testCount, EXIT); // Compare wiht the expected value 3.
96
97 return LOS_OK;
98
99 EXIT:
100 LOS_TaskDelete(g_testTaskID01);
101 LOS_QueueDelete(g_testQueueID01);
102 return LOS_OK;
103 }
104
ItLosQueue109(VOID)105 VOID ItLosQueue109(VOID)
106 {
107 TEST_ADD_CASE("ItLosQueue109", Testcase, TEST_LOS, TEST_QUE, TEST_LEVEL1, TEST_FUNCTION);
108 }
109
110