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 msgQId;
38 struct mq_attr msgAttr = { 0 };
39 CHAR qName[MQUEUE_STANDARD_NAME_LENGTH] = "";
40
41 CHAR *msgPtr1 = "1234567890";
42 CHAR *msgPtr2 = "2345678901";
43 CHAR *msgPtr3 = "3456789012";
44 CHAR msgRcd[MQUEUE_STANDARD_NAME_LENGTH] = {0};
45
46 msgAttr.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
47 msgAttr.mq_maxmsg = MQUEUE_STANDARD_NAME_LENGTH;
48
49 ret = snprintf_s(qName, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
50 "/mq166_%d", LosCurTaskIDGet());
51 ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT1);
52
53 msgQId = mq_open(qName, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &msgAttr);
54 ICUNIT_GOTO_NOT_EQUAL(msgQId, (mqd_t)-1, msgQId, EXIT);
55
56 ret = mq_send(msgQId, msgPtr1, strlen(msgPtr1), 0);
57 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
58
59 ret = mq_send(msgQId, msgPtr2, strlen(msgPtr2), 0);
60 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
61
62 ret = mq_send(msgQId, msgPtr3, strlen(msgPtr3), 0);
63 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
64
65 ret = mq_receive(msgQId, msgRcd, MQUEUE_STANDARD_NAME_LENGTH, NULL);
66 ICUNIT_GOTO_EQUAL(ret, MSGLEN, ret, EXIT);
67 ICUNIT_GOTO_STRING_EQUAL(msgRcd, msgPtr1, msgRcd, EXIT);
68
69 ret = mq_receive(msgQId, msgRcd, MQUEUE_STANDARD_NAME_LENGTH, NULL);
70 ICUNIT_GOTO_EQUAL(ret, MSGLEN, ret, EXIT);
71 ICUNIT_GOTO_STRING_EQUAL(msgRcd, msgPtr2, msgRcd, EXIT);
72
73 ret = mq_receive(msgQId, msgRcd, MQUEUE_STANDARD_NAME_LENGTH, NULL);
74 ICUNIT_GOTO_EQUAL(ret, MSGLEN, ret, EXIT);
75 ICUNIT_GOTO_STRING_EQUAL(msgRcd, msgPtr3, msgRcd, EXIT);
76
77 ret = mq_close(msgQId);
78 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
79
80 ret = mq_unlink(qName);
81 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
82
83 return MQUEUE_NO_ERROR;
84 EXIT:
85 mq_close(msgQId);
86 mq_unlink(qName);
87 EXIT1:
88 return MQUEUE_NO_ERROR;
89 }
90
ItPosixQueue166(VOID)91 VOID ItPosixQueue166(VOID) // IT_Layer_ModuleORFeature_No
92 {
93 TEST_ADD_CASE("IT_POSIX_QUEUE_166", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
94 }
95