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