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 CHAR qName[MQUEUE_STANDARD_NAME_LENGTH] = "";
38 const CHAR *msgPtr = MQUEUE_SEND_STRING_TEST;
39 struct mq_attr msgAttr = { 0 };
40 CHAR msgRcd[MQUEUE_STANDARD_NAME_LENGTH] = {0};
41
42 msgAttr.mq_msgsize = 0xFFF0;
43 msgAttr.mq_maxmsg = 0xFFF0;
44
45 ret = snprintf_s(qName, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
46 "/mq148_%d", LosCurTaskIDGet());
47 ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT1);
48
49 g_messageQId = mq_open(qName, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &msgAttr);
50 ICUNIT_GOTO_EQUAL(g_messageQId, (mqd_t)-1, g_messageQId, EXIT);
51
52 ret = mq_send(g_messageQId, msgPtr, strlen(msgPtr), 0);
53 ICUNIT_GOTO_EQUAL(ret, (UINT32)-1, ret, EXIT);
54
55 ret = mq_receive(g_messageQId, msgRcd, MQUEUE_STANDARD_NAME_LENGTH, NULL);
56 ICUNIT_GOTO_EQUAL(ret, (UINT32)-1, ret, EXIT);
57
58 return MQUEUE_NO_ERROR;
59 EXIT:
60 mq_close(g_messageQId);
61 mq_unlink(qName);
62 EXIT1:
63 return MQUEUE_NO_ERROR;
64 }
65
ItPosixQueue148(VOID)66 VOID ItPosixQueue148(VOID) // IT_Layer_ModuleORFeature_No
67 {
68 TEST_ADD_CASE("IT_POSIX_QUEUE_148", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
69 }
70