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