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 ret, count = 0;
36 CHAR msgrcd[MQUEUE_STANDARD_NAME_LENGTH] = {0};
37
38 TestExtraTaskDelay(1);
39
40 ICUNIT_GOTO_EQUAL(g_testCount, MQUEUE_SHORT_ARRAY_LENGTH, g_testCount, EXIT);
41
42 while (count < MQUEUE_SHORT_ARRAY_LENGTH) {
43 LOS_AtomicInc(&g_testCount);
44
45 ret = mq_receive(g_gqueue, msgrcd, MQUEUE_STANDARD_NAME_LENGTH, NULL);
46 ICUNIT_GOTO_EQUAL(ret, MQUEUE_SHORT_ARRAY_LENGTH, ret, EXIT);
47 ICUNIT_GOTO_STRING_EQUAL(msgrcd, g_mqueueMsessage[count], msgrcd, EXIT);
48
49 count++;
50 }
51 return NULL;
52
53 EXIT:
54 g_testCount = 0;
55 return NULL;
56 }
57
PthreadF02(VOID * arg)58 static VOID *PthreadF02(VOID *arg)
59 {
60 INT32 ret, count = 0;
61
62 LOS_TaskLock();
63
64 while (count < MQUEUE_SHORT_ARRAY_LENGTH) {
65 LOS_AtomicInc(&g_testCount);
66 ret = mq_send(g_gqueue, g_mqueueMsessage[count], MQUEUE_SHORT_ARRAY_LENGTH, 0);
67 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
68 count++;
69 }
70
71 ret = mq_send(g_gqueue, g_mqueueMsessage[count], MQUEUE_SHORT_ARRAY_LENGTH, 0);
72 ICUNIT_GOTO_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT);
73
74 LOS_TaskUnlock();
75
76 return NULL;
77
78 EXIT:
79 g_testCount = 0;
80 return NULL;
81 }
82
Testcase(VOID)83 static UINT32 Testcase(VOID)
84 {
85 INT32 ret;
86 UINT32 uret;
87 CHAR mqname[MQUEUE_STANDARD_NAME_LENGTH] = "";
88 pthread_t pthread1;
89 pthread_attr_t attr1;
90 pthread_t pthread2;
91 pthread_attr_t attr2;
92 struct sched_param schedparam;
93 struct mq_attr attr = { 0 };
94
95 attr.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
96 attr.mq_maxmsg = MQUEUE_SHORT_ARRAY_LENGTH;
97
98 g_testCount = 0;
99
100 LOS_TaskLock();
101
102 (void)snprintf_s(mqname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1,
103 "/mq118_%d", LosCurTaskIDGet());
104
105 g_gqueue = mq_open(mqname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
106 ICUNIT_GOTO_NOT_EQUAL(g_gqueue, (mqd_t)-1, g_gqueue, EXIT);
107
108 ret = pthread_attr_init(&attr1);
109 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
110
111 schedparam.sched_priority = MQUEUE_PTHREAD_PRIORITY_TEST2;
112 ret = pthread_attr_setschedparam(&attr1, &schedparam);
113 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
114
115 ret = pthread_create(&pthread1, &attr1, PthreadF02, NULL);
116 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
117
118 ret = pthread_attr_init(&attr2);
119 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
120
121 schedparam.sched_priority = MQUEUE_PTHREAD_PRIORITY_TEST2;
122 ret = pthread_attr_setschedparam(&attr2, &schedparam);
123 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
124
125 ret = pthread_create(&pthread2, &attr2, PthreadF01, NULL);
126 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
127
128 LOS_TaskUnlock();
129
130 uret = LosTaskDelay(5); // 5, Set delay time.
131 ICUNIT_GOTO_EQUAL(uret, MQUEUE_NO_ERROR, uret, EXIT2);
132
133 ret = pthread_join(pthread2, NULL);
134 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
135
136 ret = pthread_attr_destroy(&attr2);
137 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
138
139 ret = pthread_join(pthread1, NULL);
140 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
141
142 ret = pthread_attr_destroy(&attr1);
143 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
144
145 ICUNIT_GOTO_EQUAL(g_testCount, MQUEUE_SHORT_ARRAY_LENGTH * 2, g_testCount, EXIT); // 2, mqueue message length.
146 ret = mq_close(g_gqueue);
147 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
148
149 ret = mq_unlink(mqname);
150 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
151
152 return MQUEUE_NO_ERROR;
153 EXIT2:
154 PosixPthreadDestroy(&attr2, pthread2);
155 EXIT1:
156 PosixPthreadDestroy(&attr1, pthread1);
157 EXIT:
158 mq_close(g_gqueue);
159 mq_unlink(mqname);
160 return MQUEUE_NO_ERROR;
161 }
162
ItPosixQueue118(VOID)163 VOID ItPosixQueue118(VOID) // IT_Layer_ModuleORFeature_No
164 {
165 TEST_ADD_CASE("IT_POSIX_QUEUE_118", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
166 }
167