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
33 static mqd_t g_mqueue;
34 static CHAR g_mqname[MQUEUE_STANDARD_NAME_LENGTH] = "";
35 static int g_signo;
36
SigUsr1(int signo)37 static void SigUsr1(int signo)
38 {
39 CHAR msgrcd[MQUEUE_STANDARD_NAME_LENGTH] = {0};
40 int ret;
41
42 g_signo = 1;
43
44 ret = mq_receive(g_mqueue, msgrcd, MQUEUE_STANDARD_NAME_LENGTH, nullptr);
45 ICUNIT_GOTO_EQUAL(ret, MQUEUE_SHORT_ARRAY_LENGTH, ret, EXIT);
46 ICUNIT_GOTO_STRING_EQUAL(msgrcd, MQUEUE_SEND_STRING_TEST, msgrcd, EXIT);
47
48 return;
49 EXIT:
50 exit(255); // 255, Set a exit status.
51 }
Child(void)52 static void Child(void)
53 {
54 int ret;
55 struct sigevent sigev = {0};
56 const CHAR *msgptr = MQUEUE_SEND_STRING_TEST;
57 struct mq_attr attr;
58
59 attr.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
60 attr.mq_maxmsg = 1;
61
62 ret = snprintf_s(g_mqname, MQUEUE_STANDARD_NAME_LENGTH - 1, MQUEUE_STANDARD_NAME_LENGTH, "/mq207_%d", getpid());
63 ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT1);
64
65 g_mqueue = mq_open(g_mqname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
66 ICUNIT_GOTO_NOT_EQUAL(g_mqueue, (mqd_t)-1, g_mqueue, EXIT);
67
68 signal(SIGUSR1, SigUsr1);
69
70 sigev.sigev_notify = SIGEV_NONE;
71 g_signo = 0;
72
73 ret = mq_notify(g_mqueue, &sigev);
74 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
75 ret = mq_send(g_mqueue, msgptr, strlen(msgptr), 0);
76 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
77
78 for (int i = 0; i < 5; i++) { // 5, The loop frequency.
79 sleep(1);
80 }
81 ICUNIT_GOTO_EQUAL(g_signo, 0, g_signo, EXIT);
82
83 mq_close(g_mqueue);
84 mq_unlink(g_mqname);
85
86 exit(10); // 10, Set a exit status.
87 EXIT:
88 mq_close(g_mqueue);
89 mq_unlink(g_mqname);
90 EXIT1:
91 return;
92 }
93
Testcase(VOID)94 static UINT32 Testcase(VOID)
95 {
96 int ret;
97 int status;
98
99 pid_t pid = fork();
100 ICUNIT_GOTO_WITHIN_EQUAL(pid, 0, 100000, pid, EXIT); // 100000, Valid range value of pid.
101
102 if (pid == 0) {
103 Child();
104 exit(255); // 255, Set a exit status.
105 }
106
107 ret = waitpid(pid, &status, 0);
108 ICUNIT_ASSERT_EQUAL(ret, pid, ret);
109
110 status = WEXITSTATUS(status);
111 ICUNIT_ASSERT_EQUAL(status, 10, status); // 10, Here, assert the ret.
112
113 return 0;
114 EXIT:
115 return 1;
116 }
117
ItPosixQueue207(VOID)118 VOID ItPosixQueue207(VOID)
119 {
120 TEST_ADD_CASE("IT_POSIX_QUEUE_207", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
121 }