• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
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 #define FNONBLOCK O_NONBLOCK
33 
Testcase(VOID)34 static UINT32 Testcase(VOID)
35 {
36     UINT32 pri;
37     INT32 ret;
38     CHAR mqname[MQUEUE_STANDARD_NAME_LENGTH] = {0};
39     CHAR msgrcd[MQUEUE_STANDARD_NAME_LENGTH] = {0};
40     const CHAR *msgptr = MQUEUE_SEND_STRING_TEST;
41     mqd_t mqueue;
42     struct mq_attr attr = { 0 };
43 
44     ret = snprintf_s(mqname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
45                      "/mq168_%d", LosCurTaskIDGet());
46     ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT2);
47 
48     attr.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
49     attr.mq_maxmsg = MQUEUE_SHORT_ARRAY_LENGTH;
50 
51     mqueue = mq_open(mqname, FNONBLOCK | O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
52     ICUNIT_ASSERT_NOT_EQUAL(mqueue, (mqd_t)-1, mqueue);
53 
54     ret = mq_send(mqueue, msgptr, strlen(msgptr), MQUEUE_PRIORITY_TEST + 6); // 6, Mqueue priority.
55     ICUNIT_GOTO_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT1);
56     ICUNIT_GOTO_EQUAL(errno, EINVAL, errno, EXIT1);
57 
58     ret = mq_send(mqueue, msgptr, strlen(msgptr), MQUEUE_PRIORITY_TEST + 10); // 10, Mqueue priority.
59     ICUNIT_GOTO_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT1);
60     ICUNIT_GOTO_EQUAL(errno, EINVAL, errno, EXIT1);
61 
62     ret = mq_send(mqueue, msgptr, strlen(msgptr), MQUEUE_PRIORITY_TEST + 2); // 2, Mqueue priority.
63     ICUNIT_GOTO_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT1);
64     ICUNIT_GOTO_EQUAL(errno, EINVAL, errno, EXIT1);
65 
66     ret = mq_send(mqueue, msgptr, strlen(msgptr), MQUEUE_PRIORITY_TEST + 8); // 8, Mqueue priority.
67     ICUNIT_GOTO_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT1);
68     ICUNIT_GOTO_EQUAL(errno, EINVAL, errno, EXIT1);
69 
70     ret = mq_send(mqueue, msgptr, strlen(msgptr), MQUEUE_PRIORITY_TEST + 1);
71     ICUNIT_GOTO_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT1);
72     ICUNIT_GOTO_EQUAL(errno, EINVAL, errno, EXIT1);
73 
74     ret = mq_receive(mqueue, msgrcd, MQUEUE_STANDARD_NAME_LENGTH, NULL);
75     ICUNIT_GOTO_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT1);
76     ICUNIT_GOTO_EQUAL(errno, EAGAIN, errno, EXIT1);
77 
78     ret = mq_close(mqueue);
79     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
80 
81     ret = mq_unlink(mqname);
82     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
83 
84     return MQUEUE_NO_ERROR;
85 EXIT1:
86     mq_close(mqueue);
87 EXIT:
88     mq_unlink(mqname);
89 EXIT2:
90     return MQUEUE_NO_ERROR;
91 }
92 
ItPosixQueue168(VOID)93 VOID ItPosixQueue168(VOID)
94 {
95     TEST_ADD_CASE("IT_POSIX_QUEUE_168", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
96 }
97