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
HwiF01(VOID)36 static VOID HwiF01(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 return;
53 EXIT:
54 g_testCount = 0;
55 }
56
Testcase(VOID)57 static UINT32 Testcase(VOID)
58 {
59 UINT32 ret;
60 CHAR buff1[QUEUE_SHORT_BUFFER_LENGTH] = "UniDSP";
61 QUEUE_INFO_S queueInfo;
62
63 g_testCount = 0;
64
65 ret = LOS_QueueCreate("Q1", QUEUE_BASE_NUM, &g_testQueueID01, 0, QUEUE_SHORT_BUFFER_LENGTH);
66 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
67
68 ret = LOS_QueueWrite(g_testQueueID01, &buff1, QUEUE_SHORT_BUFFER_LENGTH, 0);
69 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
70
71 ret = LOS_HwiCreate(HWI_NUM_TEST, 1, 0, HwiF01, 0);
72 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
73
74 TestHwiTrigger(HWI_NUM_TEST);
75
76 ICUNIT_GOTO_EQUAL(g_testCount, 2, g_testCount, EXIT); // Compare wiht the expected value 2.
77
78 g_testCount++;
79
80 ret = LOS_QueueInfoGet(g_testQueueID01, &queueInfo);
81 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
82 ICUNIT_GOTO_EQUAL(queueInfo.queueLen, 3, queueInfo.queueLen, EXIT); // Compare wiht the expected value 3.
83 ICUNIT_GOTO_EQUAL(queueInfo.queueID, g_testQueueID01, queueInfo.queueID, EXIT);
84
85 ret = LOS_QueueDelete(g_testQueueID01);
86 ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
87
88 ICUNIT_GOTO_EQUAL(g_testCount, 3, g_testCount, EXIT); // Compare wiht the expected value 3.
89
90 TestHwiDelete(HWI_NUM_TEST);
91
92 return LOS_OK;
93
94 EXIT:
95 TestHwiDelete(HWI_NUM_TEST);
96 LOS_QueueDelete(g_testQueueID01);
97 return LOS_OK;
98 }
99
ItLosQueue108(VOID)100 VOID ItLosQueue108(VOID)
101 {
102 TEST_ADD_CASE("ItLosQueue108", Testcase, TEST_LOS, TEST_QUE, TEST_LEVEL1, TEST_FUNCTION);
103 }
104
105