1 /*
2 * Copyright (c) 2022 Huawei Device Co., Ltd. All rights reserved.
3 *
4 * Redistribution and use in source and binary forms, with or without modification,
5 * are permitted provided that the following conditions are met:
6 *
7 * 1. Redistributions of source code must retain the above copyright notice, this list of
8 * conditions and the following disclaimer.
9 *
10 * 2. Redistributions in binary form must reproduce the above copyright notice, this list
11 * of conditions and the following disclaimer in the documentation and/or other materials
12 * provided with the distribution.
13 *
14 * 3. Neither the name of the copyright holder nor the names of its contributors may be used
15 * to endorse or promote products derived from this software without specific prior written
16 * permission.
17 *
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
20 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
21 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
22 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
23 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
24 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
25 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
26 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
27 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
28 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 */
30 #include "It_posix_queue.h"
31
Testcase(VOID)32 static UINT32 Testcase(VOID)
33 {
34 INT32 ret, i = 0;
35 CHAR mqname[MQUEUE_STANDARD_NAME_LENGTH] = {0};
36 CHAR msgrcd[MQUEUE_STANDARD_NAME_LENGTH] = {0};
37 CHAR msgptr[MQUEUE_STANDARD_NAME_LENGTH] = {0};
38 mqd_t mqueue;
39 struct mq_attr attr = {0};
40
41 ret = snprintf_s(mqname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1,
42 "/mq027_%d", LOS_CurTaskIDGet());
43 ICUNIT_GOTO_NOT_EQUAL(ret, -1, ret, EXIT2);
44
45 attr.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
46 attr.mq_maxmsg = MQUEUE_SHORT_ARRAY_LENGTH;
47
48 mqueue = mq_open(mqname, O_CREAT | O_RDWR | O_NONBLOCK, S_IRUSR | S_IWUSR, &attr);
49 ICUNIT_GOTO_NOT_EQUAL(mqueue, (mqd_t)-1, mqueue, EXIT1);
50
51 while (1) {
52 ret = snprintf_s(msgptr, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, "message %d", i);
53 ICUNIT_GOTO_NOT_EQUAL(ret, -1, ret, EXIT1);
54 ret = mq_send(mqueue, msgptr, strlen(msgptr), 0);
55 if (ret == -1) {
56 ICUNIT_GOTO_EQUAL(errno, EAGAIN, errno, EXIT1);
57 break;
58 }
59 i++;
60 }
61 ICUNIT_GOTO_EQUAL(i, MQUEUE_SHORT_ARRAY_LENGTH, i, EXIT1);
62
63 i = 0;
64 ret = snprintf_s(msgptr, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, "message %d", i);
65 ICUNIT_GOTO_NOT_EQUAL(ret, -1, ret, EXIT1);
66 ret = mq_receive(mqueue, msgrcd, MQUEUE_STANDARD_NAME_LENGTH, NULL);
67 ICUNIT_GOTO_EQUAL(ret, strlen(msgptr), ret, EXIT1);
68
69 ret = strcmp(msgptr, msgrcd);
70 ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT1);
71
72 ret = mq_close(mqueue);
73 ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT);
74
75 ret = mq_unlink(mqname);
76 ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT2);
77
78 return LOS_OK;
79 EXIT1:
80 mq_close(mqueue);
81 EXIT:
82 mq_unlink(mqname);
83 EXIT2:
84 return LOS_NOK;
85 }
86
87 /**
88 * @tc.name: ItPosixQueue027
89 * @tc.desc: Test interface mq_send
90 * @tc.type: FUNC
91 * @tc.require: issueI6148G
92 */
93
ItPosixQueue027(VOID)94 VOID ItPosixQueue027(VOID)
95 {
96 TEST_ADD_CASE("ItPosixQueue027", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
97 }
98