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 UINT32 ret;
36
37 mqd_t msgQIdA; // Define queue ID for queue A
38 mqd_t msgQIdB; // Define queue ID for queue B
39
40 CHAR qNameA[MQUEUE_STANDARD_NAME_LENGTH] = "/mq156_A";
41 CHAR qNameB[MQUEUE_STANDARD_NAME_LENGTH] = "/mq156_B";
42
43 const CHAR *msgPtr = MQUEUE_SEND_STRING_TEST;
44 CHAR msgRcd[MQUEUE_STANDARD_NAME_LENGTH] = {0};
45
46 struct mq_attr msgAttr = { 0 };
47 msgAttr.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
48 msgAttr.mq_maxmsg = MQUEUE_STANDARD_NAME_LENGTH;
49
50 msgQIdA = mq_open(qNameA, O_CREAT | O_RDWR | O_NONBLOCK, S_IRUSR | S_IWUSR, &msgAttr);
51 ICUNIT_ASSERT_NOT_EQUAL(msgQIdA, (mqd_t)-1, msgQIdA);
52
53 ret = mq_receive(msgQIdA, msgRcd, MQUEUE_STANDARD_NAME_LENGTH, NULL);
54 ICUNIT_GOTO_EQUAL(ret, (UINT32)-1, ret, EXIT);
55
56 msgQIdB = mq_open(qNameB, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &msgAttr);
57 ICUNIT_ASSERT_NOT_EQUAL(msgQIdB, (mqd_t)-1, msgQIdB);
58
59 ret = mq_send(msgQIdB, msgPtr, strlen(msgPtr), 0);
60 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
61
62 ret = mq_receive(msgQIdB, msgRcd, MQUEUE_STANDARD_NAME_LENGTH, NULL);
63 ICUNIT_GOTO_EQUAL(ret, MSGLEN, ret, EXIT1);
64 ICUNIT_GOTO_STRING_EQUAL(msgRcd, MQUEUE_SEND_STRING_TEST, msgRcd, EXIT1);
65
66 ret = mq_close(msgQIdB);
67 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
68
69 ret = mq_unlink(qNameB);
70 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
71
72 ret = mq_close(msgQIdA);
73 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
74
75 ret = mq_unlink(qNameA);
76 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
77
78 return MQUEUE_NO_ERROR;
79
80 EXIT1:
81 mq_close(msgQIdB);
82 mq_unlink(qNameB);
83 EXIT:
84 mq_close(msgQIdA);
85 mq_unlink(qNameA);
86 return MQUEUE_NO_ERROR;
87 }
88
ItPosixQueue156(VOID)89 VOID ItPosixQueue156(VOID) // IT_Layer_ModuleORFeature_No
90 {
91 TEST_ADD_CASE("IT_POSIX_QUEUE_156", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
92 }
93