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
Testcase(VOID)35 static UINT32 Testcase(VOID)
36 {
37 UINT32 ret, i;
38 const UINT32 len = 1000;
39 CHAR buff1[QUEUE_SHORT_BUFFER_LENGTH] = "UniDSP";
40 CHAR buff2[QUEUE_SHORT_BUFFER_LENGTH];
41 QUEUE_INFO_S queueInfo;
42
43 ret = LOS_QueueCreate("Q1", 1000, &g_testQueueID01, 0, QUEUE_SHORT_BUFFER_LENGTH); // 1000, queue len
44 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
45
46 ret = LOS_QueueInfoGet(g_testQueueID01, &queueInfo);
47 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
48 ICUNIT_GOTO_EQUAL(queueInfo.queueLen, len, queueInfo.queueLen, EXIT);
49 ICUNIT_GOTO_EQUAL(queueInfo.queueID, g_testQueueID01, queueInfo.queueID, EXIT);
50
51 for (i = 0; i < 1000; i++) { // 1000, queue len
52 ret = LOS_QueueWrite(g_testQueueID01, buff1, QUEUE_SHORT_BUFFER_LENGTH, 0);
53 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
54 }
55 ret = LOS_QueueWrite(g_testQueueID01, buff1, QUEUE_SHORT_BUFFER_LENGTH, 0);
56 ICUNIT_GOTO_EQUAL(ret, LOS_ERRNO_QUEUE_ISFULL, ret, EXIT);
57
58 for (i = 0; i < 1000; i++) { // 1000, queue len
59 ret = LOS_QueueRead(g_testQueueID01, buff2, QUEUE_SHORT_BUFFER_LENGTH, 0);
60 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
61 }
62 ret = LOS_QueueRead(g_testQueueID01, buff2, QUEUE_SHORT_BUFFER_LENGTH, 0);
63 ICUNIT_GOTO_EQUAL(ret, LOS_ERRNO_QUEUE_ISEMPTY, ret, EXIT);
64
65 ret = LOS_QueueWrite(g_testQueueID01, buff1, QUEUE_SHORT_BUFFER_LENGTH, 0);
66 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
67
68 ret = LOS_QueueRead(g_testQueueID01, buff2, QUEUE_SHORT_BUFFER_LENGTH, 0);
69 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
70
71 ret = LOS_QueueInfoGet(g_testQueueID01, &queueInfo);
72 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
73 ICUNIT_GOTO_EQUAL(queueInfo.queueLen, len, queueInfo.queueLen, EXIT);
74 ICUNIT_GOTO_EQUAL(queueInfo.queueID, g_testQueueID01, queueInfo.queueID, EXIT);
75
76 ret = LOS_QueueRead(g_testQueueID01, buff2, QUEUE_SHORT_BUFFER_LENGTH, 0);
77 ICUNIT_GOTO_EQUAL(ret, LOS_ERRNO_QUEUE_ISEMPTY, ret, EXIT);
78
79 ret = LOS_QueueDelete(g_testQueueID01);
80 ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
81
82 return LOS_OK;
83
84 EXIT:
85 LOS_QueueDelete(g_testQueueID01);
86 return LOS_OK;
87 }
88
ItLosQueue088(VOID)89 VOID ItLosQueue088(VOID)
90 {
91 TEST_ADD_CASE("ItLosQueue088", Testcase, TEST_LOS, TEST_QUE, TEST_LEVEL0, TEST_FUNCTION);
92 }
93
94