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 ICUNIT_GOTO_EQUAL(g_testCount, 3, g_testCount, EXIT); // 3, Here, assert the g_testCount.
44
45 LOS_AtomicInc(&g_testCount);
46
47 ret = mq_timedreceive(g_gqueue, msgrcd, MQUEUE_STANDARD_NAME_LENGTH, NULL, &ts);
48 ICUNIT_GOTO_EQUAL(ret, MQUEUE_SHORT_ARRAY_LENGTH, ret, EXIT);
49 ICUNIT_GOTO_STRING_EQUAL(msgrcd, MQUEUE_SEND_STRING_TEST, msgrcd, EXIT);
50
51 LOS_AtomicInc(&g_testCount);
52
53 ret = mq_close(g_gqueue);
54 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
55
56 ret = mq_unlink(g_gqname);
57 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
58 return;
59
60 EXIT:
61 mq_close(g_gqueue);
62 mq_unlink(g_gqname);
63 return;
64 }
65
HwiF02(VOID * arg)66 static VOID HwiF02(VOID *arg)
67 {
68 INT32 ret;
69 const CHAR *msgptr = MQUEUE_SEND_STRING_TEST;
70 struct timespec ts = { 0 };
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 ts.tv_sec = 0;
77
78 TEST_HwiClear(HWI_NUM_TEST1);
79
80 LOS_AtomicInc(&g_testCount);
81
82 g_gqueue = mq_open(g_gqname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
83 ICUNIT_GOTO_NOT_EQUAL(g_gqueue, (mqd_t)-1, g_gqueue, EXIT);
84
85 ret = mq_timedsend(g_gqueue, msgptr, strlen(msgptr), 0, &ts);
86 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
87
88 LOS_AtomicInc(&g_testCount);
89
90 return;
91
92 EXIT:
93 mq_close(g_gqueue);
94 mq_unlink(g_gqname);
95 return;
96 }
97
Testcase(VOID)98 static UINT32 Testcase(VOID)
99 {
100 UINT32 uret;
101 INT32 ret;
102
103 g_testCount = 0;
104
105 ret = snprintf_s(g_gqname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
106 "/mq124_%d", LosCurTaskIDGet());
107 ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT);
108
109 uret = LOS_HwiCreate(HWI_NUM_TEST1, 1, 0, (HWI_PROC_FUNC)HwiF02, 0);
110 ICUNIT_GOTO_EQUAL(uret, MQUEUE_NO_ERROR, uret, EXIT);
111
112 #ifdef LOSCFG_KERNEL_SMP
113 HalIrqSetAffinity(HWI_NUM_TEST1, CPUID_TO_AFFI_MASK(ArchCurrCpuid()));
114 #endif
115
116 TEST_HwiTrigger(HWI_NUM_TEST1);
117
118 ICUNIT_GOTO_EQUAL(g_testCount, 2, g_testCount, EXIT); // 2, Here, assert the g_testCount.
119
120 uret = LOS_HwiCreate(HWI_NUM_TEST, 1, 0, (HWI_PROC_FUNC)HwiF01, 0);
121 ICUNIT_GOTO_EQUAL(uret, MQUEUE_NO_ERROR, uret, EXIT1);
122
123 #ifdef LOSCFG_KERNEL_SMP
124 HalIrqSetAffinity(HWI_NUM_TEST, CPUID_TO_AFFI_MASK(ArchCurrCpuid()));
125 #endif
126
127 LOS_AtomicInc(&g_testCount);
128 ICUNIT_GOTO_EQUAL(g_testCount, 3, g_testCount, EXIT1); // 3, Here, assert the g_testCount.
129
130 TEST_HwiTrigger(HWI_NUM_TEST);
131
132 ICUNIT_GOTO_EQUAL(g_testCount, 5, g_testCount, EXIT1); // 5, Here, assert the g_testCount.
133
134 TEST_HwiDelete(HWI_NUM_TEST);
135
136 TEST_HwiDelete(HWI_NUM_TEST1);
137
138 return MQUEUE_NO_ERROR;
139
140 EXIT1:
141 TEST_HwiDelete(HWI_NUM_TEST);
142 EXIT:
143 TEST_HwiDelete(HWI_NUM_TEST1);
144 return MQUEUE_NO_ERROR;
145 }
146
ItPosixQueue124(VOID)147 VOID ItPosixQueue124(VOID) // IT_Layer_ModuleORFeature_No
148 {
149 TEST_ADD_CASE("IT_POSIX_QUEUE_124", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
150 }
151