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 CHAR qname[MQUEUE_STANDARD_NAME_LENGTH], msgrcd[MQUEUE_STANDARD_NAME_LENGTH];
36 CHAR msgptr[MQUEUE_STANDARD_NAME_LENGTH];
37 struct timespec ts;
38 struct mq_attr attr = { 0 };
39 mqd_t queue;
40 INT32 unresolved = 0, failure = 0, i, maxreached = 0, ret = 0;
41 unsigned pri;
42
43 ret = snprintf_s(qname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
44 "/mq080-1_%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 = MAXMSG5;
49 queue = mq_open(qname, O_CREAT | O_RDWR | O_NONBLOCK, S_IRUSR | S_IWUSR, &attr);
50 ICUNIT_GOTO_NOT_EQUAL(queue, (mqd_t)-1, queue, EXIT);
51
52 ts.tv_sec = 0;
53 ts.tv_nsec = 0;
54 for (i = 0; i < MAXMSG5 + 1; i++) {
55 ret = snprintf_s(msgptr, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, "message %d", i);
56 ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT);
57 ts.tv_sec++;
58 if (mq_timedsend(queue, msgptr, strlen(msgptr), 0, &ts) == -1) {
59 maxreached = 1;
60 ICUNIT_GOTO_EQUAL(errno, EAGAIN, errno, EXIT);
61 break;
62 }
63 }
64
65 if (mq_receive(queue, msgrcd, MQUEUE_STANDARD_NAME_LENGTH, NULL) == -1) {
66 unresolved = 1;
67 } else {
68 if ((strcmp(msgptr, msgrcd) == 0) && (maxreached != 0)) {
69 ICUNIT_GOTO_EQUAL(maxreached, 0, maxreached, EXIT);
70 }
71 }
72
73 ret = mq_close(queue);
74 ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT);
75
76 ret = mq_unlink(qname);
77 ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT);
78
79 return MQUEUE_NO_ERROR;
80 EXIT:
81 mq_close(queue);
82 mq_unlink(qname);
83 EXIT2:
84 return MQUEUE_NO_ERROR;
85 }
86
ItPosixQueue080(VOID)87 VOID ItPosixQueue080(VOID) // IT_Layer_ModuleORFeature_No
88 {
89 TEST_ADD_CASE("IT_POSIX_QUEUE_080", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
90 }
91