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 * argument)33 static VOID *PthreadF01(VOID *argument)
34 {
35 INT32 i, ret;
36 const CHAR *msgptr[] = { "msg test 1", "msg test 2", "msg test 3" };
37 struct mq_attr attr = { 0 };
38
39 g_testCount = 1;
40
41 mq_getattr(g_gqueue, &attr);
42 for (i = 0; i < 3; i++) { // 3, the loop frequency.
43 LosTaskDelay(2); // 2, delay
44 ret = mq_send(g_gqueue, msgptr[i], attr.mq_msgsize, 0);
45 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
46 }
47
48 g_testCount = 2; // 2, Init test count value.
49
50 return NULL;
51 EXIT:
52 g_testCount = 0;
53 return NULL;
54 }
55
PthreadF02(VOID * argument)56 static VOID *PthreadF02(VOID *argument)
57 {
58 INT32 i, ret;
59 UINT32 uret;
60 const CHAR *msgptr[] = { "msg test 1", "msg test 2", "msg test 3" };
61 CHAR msgrcd[3][MQUEUE_STANDARD_NAME_LENGTH] = {0};
62 struct mq_attr attr = { 0 };
63 UINT32 msgPrio = 1;
64
65 g_testCount = 3; // 3, Init test count value.
66
67 mq_getattr(g_gqueue, &attr);
68 for (i = 0; i < 3; i++) { // 3, the loop frequency.
69 uret = LosTaskDelay(2); // 2, delay
70 ICUNIT_GOTO_EQUAL(uret, MQUEUE_NO_ERROR, uret, EXIT);
71
72 ret = mq_receive(g_gqueue, msgrcd[i], attr.mq_msgsize, &msgPrio);
73 ICUNIT_GOTO_EQUAL(ret, attr.mq_msgsize, ret, EXIT);
74 ICUNIT_GOTO_NOT_EQUAL(ret, strlen(msgptr[i]), ret, EXIT);
75 ICUNIT_GOTO_STRING_EQUAL(msgrcd[i], msgptr[i], msgrcd[i], EXIT);
76 }
77
78 g_testCount = 4; // 4, Init test count value.
79
80 return NULL;
81 EXIT:
82 g_testCount = 0;
83 return NULL;
84 }
85
Testcase(VOID)86 static UINT32 Testcase(VOID)
87 {
88 INT32 ret;
89 UINT32 uret;
90 CHAR mqname[MQUEUE_STANDARD_NAME_LENGTH] = "";
91 struct mq_attr mqstat, attr;
92 pthread_attr_t attr1;
93 pthread_t newTh, newTh2;
94
95 ret = memset_s(&mqstat, sizeof(mqstat), 0, sizeof(mqstat));
96 ICUNIT_ASSERT_EQUAL(ret, 0, ret);
97 mqstat.mq_maxmsg = MQUEUE_SHORT_ARRAY_LENGTH;
98 mqstat.mq_msgsize = MQUEUE_SHORT_ARRAY_LENGTH * 2; // 2, mqueue message size.
99 mqstat.mq_flags = 0;
100
101 ret = snprintf_s(mqname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
102 "/mq144_%d", LosCurTaskIDGet());
103 ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT3);
104
105 g_gqueue = mq_open(mqname, O_CREAT | O_RDWR, S_IRWXU | S_IRWXG | S_IRWXO, &mqstat);
106 ICUNIT_GOTO_NOT_EQUAL(g_gqueue, (mqd_t)-1, g_gqueue, EXIT);
107
108 g_testCount = 0;
109
110 ret = PosixPthreadInit(&attr1, MQUEUE_PTHREAD_PRIORITY_TEST1);
111 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
112
113 ret = pthread_create(&newTh, &attr1, PthreadF01, NULL);
114 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
115
116 LosTaskDelay(1);
117 ICUNIT_GOTO_EQUAL(g_testCount, 1, g_testCount, EXIT1);
118
119 ret = PosixPthreadInit(&attr1, MQUEUE_PTHREAD_PRIORITY_TEST2);
120 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
121
122 ret = pthread_create(&newTh2, &attr1, PthreadF02, NULL);
123 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
124
125 uret = LosTaskDelay(12); // 12, Set delay time.
126 ICUNIT_GOTO_EQUAL(uret, MQUEUE_NO_ERROR, uret, EXIT2);
127
128 ICUNIT_GOTO_EQUAL(g_testCount, 4, g_testCount, EXIT2); // 4, Here, assert the g_testCount.
129
130 ret = PosixPthreadDestroy(&attr1, newTh2);
131 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
132
133 ret = PosixPthreadDestroy(&attr1, newTh);
134 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
135
136 ret = mq_close(g_gqueue);
137 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
138
139 ret = mq_unlink(mqname);
140 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
141
142 return MQUEUE_NO_ERROR;
143 EXIT2:
144 PosixPthreadDestroy(&attr1, newTh2);
145 EXIT1:
146 PosixPthreadDestroy(&attr1, newTh);
147 EXIT:
148 mq_close(g_gqueue);
149 mq_unlink(mqname);
150 EXIT3:
151 return MQUEUE_NO_ERROR;
152 }
153
ItPosixQueue144(VOID)154 VOID ItPosixQueue144(VOID) // IT_Layer_ModuleORFeature_No
155 {
156 TEST_ADD_CASE("ItPosixQueue144", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
157 }
158