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