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 count = 256;
39 CHAR filebuf[260] = "abcdeabcde0123456789abcedfghij9876550210abcdeabcde0123456789abcedfghij9876550210abcdeabcde0123"
40 "456789abcedfghij9876550210abcdeabcde0123456789abcedfghij9876550210abcdeabcde0123456789abcedfgh"
41 "ij9876550210abcdeabcde0123456789abcedfghij9876550210lalalalalalalala";
42 CHAR readbuf[260] = ""; // 260, set max readbuf size > maxMsgSize (count)
43 QUEUE_INFO_S queueInfo;
44
45 ret = LOS_QueueCreate("Q1", QUEUE_BASE_NUM, &g_testQueueID01, 0, count);
46 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
47
48 for (i = 0; i < 100; i++) { // 100, test write read times
49 ret = LOS_QueueWrite(g_testQueueID01, filebuf, count, 0);
50 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
51
52 (void)memset_s(readbuf, sizeof(readbuf), 0, 260); // 260, readbuf size
53 ret = LOS_QueueRead(g_testQueueID01, readbuf, count, 0);
54 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
55
56 ret = LOS_QueueInfoGet(g_testQueueID01, &queueInfo);
57 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
58 ICUNIT_GOTO_EQUAL(queueInfo.queueLen, 3, queueInfo.queueLen, EXIT); // Compare wiht the expected value 3.
59 ICUNIT_GOTO_EQUAL(queueInfo.queueID, g_testQueueID01, queueInfo.queueID, EXIT);
60 }
61 ret = LOS_QueueRead(g_testQueueID01, readbuf, count, 0);
62 ICUNIT_GOTO_EQUAL(ret, LOS_ERRNO_QUEUE_ISEMPTY, ret, EXIT);
63
64 ret = LOS_QueueDelete(g_testQueueID01);
65 ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
66
67 return LOS_OK;
68
69 EXIT:
70 LOS_QueueDelete(g_testQueueID01);
71 return LOS_OK;
72 }
73
ItLosQueue087(VOID)74 VOID ItLosQueue087(VOID)
75 {
76 TEST_ADD_CASE("ItLosQueue087", Testcase, TEST_LOS, TEST_QUE, TEST_LEVEL0, TEST_FUNCTION);
77 }
78
79