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, j;
38 UINT32 index;
39 UINT32 queueID[LOSCFG_BASE_IPC_QUEUE_LIMIT + 1];
40 CHAR filebuf[260] = "abcdeabcde0123456789abcedfghij9876550210abcdeabcde0123456789abcedfghij9876550210abcdeabcde0123"
41 "456789abcedfghij9876550210abcdeabcde0123456789abcedfghij9876550210abcdeabcde0123456789abcedfgh"
42 "ij9876550210abcdeabcde0123456789abcedfghij9876550210lalalalalalalala";
43 CHAR readbuf[260] = ""; // 260, buffersize
44 QUEUE_INFO_S queueInfo;
45
46 const UINT32 len = 1;
47 const UINT32 count = 256; // 256, set maxMsgSize
48
49 UINT32 limit = LOSCFG_BASE_IPC_QUEUE_LIMIT - QUEUE_EXISTED_NUM;
50 for (index = 0; index < limit; index++) {
51 ret = LOS_QueueCreate(NULL, len, &queueID[index], 0, count);
52 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
53
54 ret = LOS_QueueInfoGet(queueID[index], &queueInfo);
55 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
56 ICUNIT_GOTO_EQUAL(queueInfo.queueLen, len, queueInfo.queueLen, EXIT);
57 ICUNIT_GOTO_EQUAL(queueInfo.queueID, queueID[index], queueInfo.queueID, EXIT);
58 }
59
60 ret = LOS_QueueCreate("Q1", len, &queueID[LOSCFG_BASE_IPC_QUEUE_LIMIT + 1], 0, count);
61 ICUNIT_GOTO_EQUAL(ret, LOS_ERRNO_QUEUE_CB_UNAVAILABLE, ret, EXIT);
62
63 for (j = 0; j < 100; j++) { // 100, test times
64 for (index = 0; index < limit; index++) {
65 for (i = 0; i < len; i++) {
66 ret = LOS_QueueWrite(queueID[index], filebuf, count, 0);
67 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
68 }
69 ret = LOS_QueueWrite(queueID[index], filebuf, count, 0);
70 ICUNIT_GOTO_EQUAL(ret, LOS_ERRNO_QUEUE_ISFULL, ret, EXIT);
71
72 for (i = 0; i < len; i++) {
73 (void)memset_s(readbuf, sizeof(readbuf), 0, 260); // 260, buffersize
74 ret = LOS_QueueRead(queueID[index], readbuf, count, 0);
75 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
76 }
77 ret = LOS_QueueRead(queueID[index], readbuf, count, 0);
78 ICUNIT_GOTO_EQUAL(ret, LOS_ERRNO_QUEUE_ISEMPTY, ret, EXIT);
79 }
80 }
81 ret = LOS_QueueWrite(queueID[limit - 1], filebuf, count, 0);
82 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
83
84 ret = LOS_QueueRead(queueID[limit - 1], readbuf, count, 0);
85 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
86
87 ret = LOS_QueueInfoGet(queueID[limit - 1], &queueInfo);
88 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
89 ICUNIT_GOTO_EQUAL(queueInfo.queueLen, len, queueInfo.queueLen, EXIT);
90 ICUNIT_GOTO_EQUAL(queueInfo.queueID, queueID[limit - 1], queueInfo.queueID, EXIT);
91
92 ret = LOS_QueueRead(queueID[limit - 1], readbuf, count, 0);
93 ICUNIT_GOTO_EQUAL(ret, LOS_ERRNO_QUEUE_ISEMPTY, ret, EXIT);
94
95 for (index = 0; index < limit; index++) {
96 ret = LOS_QueueDelete(queueID[index]);
97 ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
98 }
99 return LOS_OK;
100
101 EXIT:
102 for (index = 0; index < limit; index++) {
103 LOS_QueueDelete(queueID[index]);
104 }
105 return LOS_OK;
106 }
107
ItLosQueue090(VOID)108 VOID ItLosQueue090(VOID)
109 {
110 TEST_ADD_CASE("ItLosQueue090", Testcase, TEST_LOS, TEST_QUE, TEST_LEVEL0, TEST_FUNCTION);
111 }
112
113