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 #include "It_posix_queue.h"
32
Testcase(VOID)33 static UINT32 Testcase(VOID)
34 {
35 INT32 ret, i;
36 INT32 count = MQUEUE_MAX_NUM_TEST;
37 CHAR mqname[LOSCFG_BASE_IPC_QUEUE_CONFIG + 1][MQUEUE_STANDARD_NAME_LENGTH];
38 const CHAR *msgptr = MQUEUE_SEND_STRING_TEST;
39 mqd_t mqueue[LOSCFG_BASE_IPC_QUEUE_CONFIG + 1];
40 struct mq_attr attr = { 0 };
41
42 attr.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
43 attr.mq_maxmsg = MQUEUE_STANDARD_NAME_LENGTH;
44 for (i = 0; i < (count); i++) {
45 (void)snprintf_s(mqname[i], MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
46 "/mq163_%d_%d", LosCurTaskIDGet(), i);
47 mqueue[i] = mq_open(mqname[i], O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
48 ICUNIT_GOTO_NOT_EQUAL(mqueue[i], (mqd_t)-1, mqueue[i], EXIT);
49 }
50
51 #ifndef LOSCFG_DEBUG_QUEUE
52 (void)snprintf_s(mqname[i], MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
53 "/mq163_%d_%d", LosCurTaskIDGet(), i);
54 mqueue[i] = mq_open(mqname[i], O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
55 ICUNIT_GOTO_EQUAL(mqueue[i], (mqd_t)-1, mqueue[i], EXIT1);
56 ICUNIT_GOTO_EQUAL(errno, ENFILE, errno, EXIT1);
57 #endif
58
59 for (i = 0; i < (count); i++) {
60 ret = mq_send(mqueue[i], msgptr, strlen(msgptr), 0);
61 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
62 }
63
64 for (i = 0; i < (count); i++) {
65 ret = mq_close(mqueue[i]);
66 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
67
68 ret = mq_unlink(mqname[i]);
69 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
70 }
71
72 return MQUEUE_NO_ERROR;
73 EXIT1:
74 mq_close(mqueue[i]);
75 mq_unlink(mqname[i]);
76 EXIT:
77 for (i = 0; i < (count); i++) {
78 mq_close(mqueue[i]);
79 mq_unlink(mqname[i]);
80 }
81 return MQUEUE_NO_ERROR;
82 }
83
ItPosixQueue163(VOID)84 VOID ItPosixQueue163(VOID) // IT_Layer_ModuleORFeature_No
85 {
86 TEST_ADD_CASE("IT_POSIX_QUEUE_163", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
87 }
88