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;
36 const CHAR *msgptr = MQUEUE_SEND_STRING_TEST;
37 CHAR mqname1[MQUEUE_STANDARD_NAME_LENGTH] = "";
38 CHAR mqname2[MQUEUE_STANDARD_NAME_LENGTH] = "";
39 mqd_t mqueue1;
40 mqd_t mqueue2;
41 struct mq_attr attr = { 0 };
42
43 attr.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
44 attr.mq_maxmsg = MQUEUE_STANDARD_NAME_LENGTH;
45
46 ret = snprintf_s(mqname1, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
47 "/mq073_1_%d", LosCurTaskIDGet());
48 ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT2);
49 ret = snprintf_s(mqname2, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
50 "/mq073_2_%d", LosCurTaskIDGet());
51 ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT2);
52
53 mqueue1 = mq_open(mqname1, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
54 ICUNIT_GOTO_NOT_EQUAL(mqueue1, (mqd_t)-1, mqueue1, EXIT);
55
56 mqueue2 = mq_open(mqname2, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
57 ICUNIT_GOTO_NOT_EQUAL(mqueue2, (mqd_t)-1, mqueue2, EXIT1);
58
59 ret = mq_send(mqueue1, msgptr, strlen(msgptr), 0);
60 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
61
62 ret = mq_send(mqueue2, msgptr, strlen(msgptr), 0);
63 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
64
65 ret = mq_close(mqueue2);
66 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
67
68 ret = mq_unlink(mqname2);
69 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
70
71 ret = mq_close(mqueue1);
72 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
73
74 ret = mq_unlink(mqname1);
75 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
76
77 return MQUEUE_NO_ERROR;
78 EXIT1:
79 mq_close(mqueue2);
80 mq_unlink(mqname2);
81 EXIT:
82 mq_close(mqueue1);
83 mq_unlink(mqname1);
84 EXIT2:
85 return MQUEUE_NO_ERROR;
86 }
87
ItPosixQueue073(VOID)88 VOID ItPosixQueue073(VOID) // IT_Layer_ModuleORFeature_No
89 {
90 TEST_ADD_CASE("IT_POSIX_QUEUE_073", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
91 }
92