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 = 0;
36 CHAR mqname[MQUEUE_STANDARD_NAME_LENGTH] = {0};
37 CHAR msgrv1[MQUEUE_STANDARD_NAME_LENGTH] = {0};
38 CHAR msgrv2[MQUEUE_STANDARD_NAME_LENGTH] = {0};
39 const CHAR *msgptr1 = "test message1";
40 const CHAR *msgptr2 = "test message2 with differnet length";
41 mqd_t mqueue;
42 struct timespec ts;
43 struct mq_attr attr = { 0 };
44
45 ret = snprintf_s(mqname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
46 "/mq104_%d", LosCurTaskIDGet());
47 ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT2);
48
49 attr.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
50 attr.mq_maxmsg = MQUEUE_STANDARD_NAME_LENGTH;
51 mqueue = mq_open(mqname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
52 ICUNIT_GOTO_NOT_EQUAL(mqueue, (mqd_t)-1, mqueue, EXIT1);
53
54 ret = mq_send(mqueue, msgptr1, strlen(msgptr1), 0);
55 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
56
57 ret = mq_send(mqueue, msgptr2, strlen(msgptr2), 0);
58 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
59
60 ts.tv_sec = 1;
61 ts.tv_nsec = 0;
62 ret = mq_timedreceive(mqueue, msgrv1, MQUEUE_STANDARD_NAME_LENGTH, NULL, &ts);
63 ICUNIT_GOTO_EQUAL(ret, strlen(msgptr1), ret, EXIT1);
64
65 ret = mq_timedreceive(mqueue, msgrv2, MQUEUE_STANDARD_NAME_LENGTH, NULL, &ts);
66 ICUNIT_GOTO_EQUAL(ret, strlen(msgptr2), ret, EXIT1);
67
68 ret = strcmp(msgrv1, msgptr1);
69 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
70
71 ret = strcmp(msgrv2, msgptr2);
72 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
73
74 ret = strcmp(msgrv1, msgrv2);
75 ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
76
77 ret = mq_close(mqueue);
78 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
79
80 ret = mq_unlink(mqname);
81 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
82
83 return MQUEUE_NO_ERROR;
84 EXIT1:
85 mq_close(mqueue);
86 EXIT:
87 mq_unlink(mqname);
88 EXIT2:
89 return MQUEUE_NO_ERROR;
90 }
91
ItPosixQueue104(VOID)92 VOID ItPosixQueue104(VOID) // IT_Layer_ModuleORFeature_No
93 {
94 TEST_ADD_CASE("IT_POSIX_QUEUE_104", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
95 }
96