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