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
PthreadF01(VOID * arg)33 static VOID *PthreadF01(VOID *arg)
34 {
35 INT32 i, ret;
36 const CHAR *msgptr[] = { "send_111 1", "send_111 2", "send_111 3", "send_111 4", "send_111 5" };
37
38 for (i = 0; i < MQUEUE_PTHREAD_NUM_TEST; i++) {
39 ret = mq_send(g_gqueue, msgptr[i], strlen(msgptr[i]), 0);
40 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
41 }
42 LOS_AtomicInc(&g_testCount);
43
44 pthread_exit(nullptr);
45
46 return NULL;
47 EXIT:
48 pthread_exit(nullptr);
49 g_testCount = 0;
50 return NULL;
51 }
52
PthreadF02(VOID * arg)53 static VOID *PthreadF02(VOID *arg)
54 {
55 INT32 i, ret;
56 INT32 pthreadCount = *(INT32 *)arg;
57 CHAR msgrcd[MQUEUE_PTHREAD_NUM_TEST][MQUEUE_PTHREAD_NUM_TEST][MQUEUE_STANDARD_NAME_LENGTH];
58
59 for (i = 0; i < MQUEUE_PTHREAD_NUM_TEST; i++) {
60 ret = mq_receive(g_gqueue, msgrcd[pthreadCount][i], MQUEUE_STANDARD_NAME_LENGTH, NULL);
61 ICUNIT_GOTO_EQUAL(ret, MQUEUE_SHORT_ARRAY_LENGTH, ret, EXIT);
62 }
63
64 LOS_AtomicInc(&g_testCount);
65
66 pthread_exit(nullptr);
67
68 return NULL;
69 EXIT:
70 g_testCount = 0;
71 pthread_exit(nullptr);
72 return NULL;
73 }
74
Testcase(VOID)75 static UINT32 Testcase(VOID)
76 {
77 INT32 oflag, i, ret = 0;
78 INT32 pthreadCount[MQUEUE_PTHREAD_NUM_TEST];
79 CHAR mqname[MQUEUE_STANDARD_NAME_LENGTH] = "";
80 pthread_t pthreadSend[MQUEUE_PTHREAD_NUM_TEST];
81 pthread_t pthreadRecev[MQUEUE_PTHREAD_NUM_TEST];
82 pthread_attr_t attr1;
83 struct mq_attr mqstat;
84
85 ret = pthread_attr_init(&attr1);
86 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
87
88 g_testCount = 0;
89
90 (void)snprintf_s(mqname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1,
91 "/mq162_%d", LosCurTaskIDGet());
92 (void)memset_s(&mqstat, sizeof(mqstat), 0, sizeof(mqstat));
93 mqstat.mq_maxmsg = MQUEUE_PTHREAD_NUM_TEST;
94 mqstat.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
95 mqstat.mq_flags = 0;
96
97 oflag = O_CREAT | O_NONBLOCK | O_RDWR;
98 g_gqueue = mq_open(mqname, oflag, S_IRWXU | S_IRWXG | S_IRWXO, &mqstat);
99 ICUNIT_GOTO_NOT_EQUAL(g_gqueue, (mqd_t)-1, g_gqueue, EXIT1);
100 for (i = 0; i < MQUEUE_PTHREAD_NUM_TEST; i++) {
101 pthreadCount[i] = i;
102 ret = pthread_create(&pthreadSend[i], &attr1, PthreadF01, NULL);
103 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
104
105 ret = pthread_create(&pthreadRecev[i], &attr1, PthreadF02, (void *)&pthreadCount[i]);
106 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
107 }
108
109 for (i = 0; i < MQUEUE_PTHREAD_NUM_TEST; i++) {
110 ret = pthread_join(pthreadSend[i], NULL);
111 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
112
113 ret = pthread_join(pthreadRecev[i], NULL);
114 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
115 }
116 ICUNIT_GOTO_EQUAL(g_testCount, MQUEUE_PTHREAD_NUM_TEST * 2, g_testCount, EXIT1); // 2, assert the g_testCount.
117
118 ret = mq_close(g_gqueue);
119 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
120
121 ret = mq_unlink(mqname);
122 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
123
124 ret = pthread_attr_destroy(&attr1);
125 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
126
127 return MQUEUE_NO_ERROR;
128 EXIT2:
129 for (i = 0; i < MQUEUE_PTHREAD_NUM_TEST; i++) {
130 pthread_join(pthreadSend[i], NULL);
131 pthread_join(pthreadRecev[i], NULL);
132 }
133 EXIT1:
134 mq_close(g_gqueue);
135 mq_unlink(mqname);
136 EXIT:
137 pthread_attr_destroy(&attr1);
138 return MQUEUE_NO_ERROR;
139 }
140
ItPosixQueue162(VOID)141 VOID ItPosixQueue162(VOID) // IT_Layer_ModuleORFeature_No
142 {
143 TEST_ADD_CASE("IT_POSIX_QUEUE_162", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
144 }
145