• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
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;
35     CHAR mqname[MQUEUE_STANDARD_NAME_LENGTH] = {0};
36     CHAR msgrcd[MQUEUE_STANDARD_NAME_LENGTH] = {0};
37     CHAR msgrcd2[MQUEUE_STANDARD_NAME_LENGTH] = {0};
38     const CHAR *msgptr = MQUEUE_SEND_STRING_TEST;
39     mqd_t rdwrqueue;
40     mqd_t rdwrqueue2;
41     struct mq_attr attr = {0};
42 
43     ret = snprintf_s(mqname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1,
44                      "/mq006_%d", LOS_CurTaskIDGet());
45     ICUNIT_GOTO_NOT_EQUAL(ret, -1, ret, EXIT2);
46 
47     attr.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
48     attr.mq_maxmsg = MQUEUE_STANDARD_NAME_LENGTH;
49     rdwrqueue = mq_open(mqname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
50     ICUNIT_GOTO_NOT_EQUAL(rdwrqueue, (mqd_t)-1, rdwrqueue, EXIT);
51 
52     ret = mq_send(rdwrqueue, msgptr, strlen(msgptr), 0);
53     ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT);
54 
55     ret = mq_receive(rdwrqueue, msgrcd, MQUEUE_STANDARD_NAME_LENGTH, NULL);
56     ICUNIT_GOTO_EQUAL(ret, strlen(msgptr), ret, EXIT);
57 
58     rdwrqueue2 = mq_open(mqname, O_RDWR, S_IRUSR | S_IWUSR, &attr);
59     ICUNIT_GOTO_NOT_EQUAL(rdwrqueue2, (mqd_t)-1, rdwrqueue2, EXIT1);
60 
61     ret = mq_send(rdwrqueue2, msgptr, strlen(msgptr), 0);
62     ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT1);
63 
64     ret = mq_receive(rdwrqueue2, msgrcd2, MQUEUE_STANDARD_NAME_LENGTH, NULL);
65     ICUNIT_GOTO_EQUAL(ret, strlen(msgptr), ret, EXIT1);
66 
67     ret = mq_close(rdwrqueue2);
68     ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT1);
69 
70     ret = mq_close(rdwrqueue);
71     ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT);
72 
73     ret = mq_unlink(mqname);
74     ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT);
75 
76     return LOS_OK;
77 EXIT1:
78     mq_close(rdwrqueue2);
79 EXIT:
80     mq_close(rdwrqueue);
81     mq_unlink(mqname);
82 EXIT2:
83     return LOS_OK;
84 }
85 
86 /**
87 * @tc.name: ItPosixQueue006
88 * @tc.desc: Test interface mq_receive
89 * @tc.type: FUNC
90 * @tc.require: issueI603SR6
91  */
92 
ItPosixQueue006(VOID)93 VOID ItPosixQueue006(VOID)
94 {
95     TEST_ADD_CASE("ItPosixQueue006", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
96 }
97