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 static int g_cnt;
37
Pthread(VOID * temp)38 static VOID *Pthread(VOID *temp)
39 {
40 INT32 ret;
41 CHAR msgrcd[MQUEUE_STANDARD_NAME_LENGTH] = {0};
42 g_cnt = 1;
43
44 (void)(temp);
45 ret = mq_receive(g_mqueue, msgrcd, MQUEUE_STANDARD_NAME_LENGTH, nullptr);
46 ICUNIT_GOTO_EQUAL(ret, MQUEUE_SHORT_ARRAY_LENGTH, ret, EXIT);
47 ICUNIT_GOTO_STRING_EQUAL(msgrcd, MQUEUE_SEND_STRING_TEST, msgrcd, EXIT);
48
49 return nullptr;
50 EXIT:
51 g_cnt = 0;
52 return nullptr;
53 }
54
SigUsr1(int signo)55 static void SigUsr1(int signo)
56 {
57 CHAR msgrcd[MQUEUE_STANDARD_NAME_LENGTH] = {0};
58 int ret;
59 g_signo = signo;
60
61 ret = mq_receive(g_mqueue, msgrcd, MQUEUE_STANDARD_NAME_LENGTH, nullptr);
62 ICUNIT_GOTO_EQUAL(ret, MQUEUE_SHORT_ARRAY_LENGTH, ret, EXIT);
63 ICUNIT_GOTO_STRING_EQUAL(msgrcd, g_mqueueMsessage[1], msgrcd, EXIT);
64
65 return;
66 EXIT:
67 exit(255); // 255, Set a exit status.
68 }
Child(void)69 static void Child(void)
70 {
71 int ret;
72 struct sigevent sigev = {0};
73 pthread_t pthread1;
74 const CHAR *msgptr = MQUEUE_SEND_STRING_TEST;
75 CHAR msgrcd[MQUEUE_STANDARD_NAME_LENGTH] = {0};
76 struct mq_attr attr = {0};
77
78 attr.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
79 attr.mq_maxmsg = 3; // 3, queue max message size.
80
81 ret = snprintf_s(g_mqname, MQUEUE_STANDARD_NAME_LENGTH - 1, MQUEUE_STANDARD_NAME_LENGTH, "/mq209_%d", getpid());
82 ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT1);
83
84 g_mqueue = mq_open(g_mqname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
85 ICUNIT_GOTO_NOT_EQUAL(g_mqueue, (mqd_t)-1, g_mqueue, EXIT);
86
87 signal(SIGUSR1, SigUsr1);
88
89 sigev.sigev_notify = SIGEV_SIGNAL;
90 sigev.sigev_signo = SIGUSR1;
91
92 g_signo = 0;
93 g_cnt = 0;
94
95 ret = pthread_create(&pthread1, nullptr, Pthread, nullptr);
96 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
97 for (int i = 0; i < 3; i++) { // 3, The loop frequency.
98 sleep(1);
99 }
100 ICUNIT_GOTO_EQUAL(g_cnt, 1, g_cnt, EXIT);
101 ret = mq_notify(g_mqueue, &sigev);
102 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
103
104 ret = mq_send(g_mqueue, msgptr, strlen(msgptr), 0);
105 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
106
107 ret = pthread_join(pthread1, NULL);
108 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
109 ICUNIT_GOTO_EQUAL(g_cnt, 1, g_cnt, EXIT);
110 ICUNIT_GOTO_EQUAL(g_signo, 0, g_signo, EXIT);
111
112 ret = mq_send(g_mqueue, g_mqueueMsessage[1], MQUEUE_SHORT_ARRAY_LENGTH, 0);
113 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
114
115 while (g_signo == 0) {
116 }
117 ICUNIT_GOTO_EQUAL(g_signo, SIGUSR1, g_signo, EXIT);
118
119 mq_close(g_mqueue);
120 mq_unlink(g_mqname);
121 exit(10); // 10, Set a exit status.
122
123 EXIT:
124 mq_close(g_mqueue);
125 mq_unlink(g_mqname);
126 EXIT1:
127 return;
128 }
Testcase(VOID)129 static UINT32 Testcase(VOID)
130 {
131 int ret;
132 int status;
133
134 pid_t pid = fork();
135 ICUNIT_GOTO_WITHIN_EQUAL(pid, 0, 100000, pid, EXIT); // 100000, Valid range value of pid.
136
137 if (pid == 0) {
138 Child();
139 exit(255); // 255, Set a exit status.
140 }
141
142 ret = waitpid(pid, &status, 0);
143 ICUNIT_ASSERT_EQUAL(ret, pid, ret);
144
145 status = WEXITSTATUS(status);
146 ICUNIT_ASSERT_EQUAL(status, 10, status); // 10, Here, assert the ret.
147
148 return 0;
149 EXIT:
150 return 1;
151 }
152
ItPosixQueue209(VOID)153 VOID ItPosixQueue209(VOID)
154 {
155 TEST_ADD_CASE("IT_POSIX_QUEUE_209", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
156 }
157