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
Testcasenull35 static UINT32 Testcase(VOID)
36 {
37 UINT32 ret;
38 UINT32 index;
39 UINT32 queueID[LOSCFG_BASE_IPC_QUEUE_LIMIT + 1];
40 CHAR buff1[QUEUE_SHORT_BUFFER_LENGTH] = "UniDSP";
41 CHAR buff2[QUEUE_SHORT_BUFFER_LENGTH] = "";
42
43 UINT32 limit = LOSCFG_BASE_IPC_QUEUE_LIMIT - QUEUE_EXISTED_NUM;
44 for (index = 0; index < limit; index++) {
45 ret = LOS_QueueCreate(NULL, QUEUE_BASE_NUM, &queueID[index], 0, QUEUE_BASE_MSGSIZE);
46 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
47 }
48 ret = LOS_QueueWrite(queueID[limit - 1], &buff1, QUEUE_BASE_MSGSIZE, 0);
49 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
50
51 ret = LOS_QueueRead(queueID[limit - 1], &buff2, QUEUE_BASE_MSGSIZE, 0);
52 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
53
54 ret = LOS_QueueCreate("Q1", QUEUE_BASE_NUM, &queueID[index], 0, QUEUE_BASE_MSGSIZE);
55 ICUNIT_GOTO_NOT_EQUAL(ret, LOS_OK, ret, EXIT);
56
57 ret = LOS_QueueCreate("Q1", QUEUE_BASE_NUM, &queueID[index], 0, QUEUE_BASE_MSGSIZE);
58 ICUNIT_GOTO_NOT_EQUAL(ret, LOS_OK, ret, EXIT);
59
60 EXIT:
61 for (index = 0; index < limit; index++) {
62 ret = LOS_QueueDelete(queueID[index]);
63 ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
64 }
65
66 return LOS_OK;
67 }
68
ItLosQueue021null69 VOID ItLosQueue021(VOID)
70 {
71 TEST_ADD_CASE("ItLosQueue021", Testcase, TEST_LOS, TEST_QUE, TEST_LEVEL1, TEST_FUNCTION);
72 }
73
74