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 TEST_HwiTrigger(HWI_NUM_TEST);
36
37 LOS_AtomicInc(&g_testCount);
38
39 return NULL;
40 }
41
HwiF01(VOID * arg)42 static VOID HwiF01(VOID *arg)
43 {
44 INT32 ret;
45 const CHAR *msgptr = MQUEUE_SEND_STRING_TEST;
46 struct timespec ts = { 0 };
47
48 ts.tv_sec = 0;
49
50 TEST_HwiClear(HWI_NUM_TEST);
51
52 LOS_AtomicInc(&g_testCount);
53
54 ret = mq_timedsend(g_gqueue, msgptr, strlen(msgptr), 0, &ts);
55 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
56
57 return;
58 EXIT:
59 g_testCount = 0;
60 return;
61 }
62
PthreadF02(VOID * arg)63 static VOID *PthreadF02(VOID *arg)
64 {
65 INT32 ret;
66 UINT32 uret;
67 CHAR mqname[MQUEUE_STANDARD_NAME_LENGTH] = "";
68 CHAR msgrcd[MQUEUE_STANDARD_NAME_LENGTH] = {0};
69 pthread_t pthread1;
70 struct mq_attr attr = { 0 };
71 struct timespec ts = { 0 };
72
73 ts.tv_sec = 10; // 10, secend.
74
75 attr.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
76 attr.mq_maxmsg = MQUEUE_STANDARD_NAME_LENGTH;
77
78 LOS_AtomicInc(&g_testCount);
79
80 ret = snprintf_s(mqname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
81 "/mq119_%d", LosCurTaskIDGet());
82 ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT3);
83
84 g_gqueue = mq_open(mqname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
85 ICUNIT_GOTO_NOT_EQUAL(g_gqueue, (mqd_t)-1, g_gqueue, EXIT);
86
87 ret = LOS_HwiCreate(HWI_NUM_TEST, 0, 0, (HWI_PROC_FUNC)HwiF01, 0);
88 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
89
90 ret = pthread_create(&pthread1, NULL, PthreadF01, NULL);
91 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
92
93 usleep(10000); // 10000, Microseconds.
94
95 ICUNIT_GOTO_EQUAL(g_testCount, 3, g_testCount, EXIT2); // 3, Here, assert the g_testCount.
96
97 ret = mq_timedreceive(g_gqueue, msgrcd, MQUEUE_STANDARD_NAME_LENGTH, NULL, &ts);
98 ICUNIT_GOTO_EQUAL(ret, MQUEUE_SHORT_ARRAY_LENGTH, ret, EXIT2);
99 ICUNIT_GOTO_STRING_EQUAL(msgrcd, MQUEUE_SEND_STRING_TEST, msgrcd, EXIT2);
100
101 ret = pthread_join(pthread1, NULL);
102 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
103
104 ret = mq_close(g_gqueue);
105 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
106
107 ret = mq_unlink(mqname);
108 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
109
110 TEST_HwiDelete(HWI_NUM_TEST);
111
112 LOS_AtomicInc(&g_testCount);
113
114 return MQUEUE_NO_ERROR;
115 EXIT2:
116 TEST_HwiDelete(HWI_NUM_TEST);
117 EXIT1:
118 pthread_join(pthread1, NULL);
119 EXIT:
120 mq_close(g_gqueue);
121 mq_unlink(mqname);
122 EXIT3:
123 return MQUEUE_NO_ERROR;
124 }
125
Testcase(VOID)126 static UINT32 Testcase(VOID)
127 {
128 INT32 ret;
129 pthread_t pthread1;
130 pthread_attr_t attr1;
131 struct sched_param schedparam;
132
133 g_testCount = 0;
134
135 ret = pthread_attr_init(&attr1);
136 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
137
138 schedparam.sched_priority = MQUEUE_PTHREAD_PRIORITY_TEST2;
139 ret = pthread_attr_setschedparam(&attr1, &schedparam);
140 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
141
142 ret = pthread_create(&pthread1, &attr1, PthreadF02, NULL);
143 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
144
145 ret = pthread_join(pthread1, NULL);
146 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
147
148 ret = pthread_attr_destroy(&attr1);
149 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
150
151 ICUNIT_GOTO_EQUAL(g_testCount, 4, g_testCount, EXIT); // 4, Here, assert the g_testCount.
152
153 return MQUEUE_NO_ERROR;
154
155 EXIT1:
156 pthread_join(pthread1, NULL);
157 EXIT:
158 pthread_attr_destroy(&attr1);
159 return MQUEUE_NO_ERROR;
160 }
161
ItPosixQueue119(VOID)162 VOID ItPosixQueue119(VOID) // IT_Layer_ModuleORFeature_No
163 {
164 TEST_ADD_CASE("IT_POSIX_QUEUE_119", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
165 }
166