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 return NULL;
45
46 EXIT:
47 g_testCount = 0;
48 return NULL;
49 }
50
PthreadF02(VOID * arg)51 static VOID *PthreadF02(VOID *arg)
52 {
53 INT32 ret, i;
54 CHAR mqname[MQUEUE_STANDARD_NAME_LENGTH] = "";
55 const CHAR *msgptr = MQUEUE_SEND_STRING_TEST;
56 pthread_t thread1;
57 pthread_attr_t attr1;
58 struct sched_param schedparam;
59 struct mq_attr attr = { 0 };
60 struct timespec ts = { 0 };
61
62 ts.tv_sec = 0xFFFF;
63 attr.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
64 attr.mq_maxmsg = 2; // 2, queue max message size.
65
66 ret = snprintf_s(mqname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
67 "/mq076_%d", LosCurTaskIDGet());
68 ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT2);
69
70 g_gqueue = mq_open(mqname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
71 ICUNIT_GOTO_NOT_EQUAL(g_gqueue, (mqd_t)-1, g_gqueue, EXIT1);
72 ret = pthread_attr_init(&attr1);
73 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
74
75 schedparam.sched_priority = MQUEUE_PTHREAD_PRIORITY_TEST2;
76 ret = pthread_attr_setschedparam(&attr1, &schedparam);
77 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
78
79 ret = pthread_create(&thread1, &attr1, PthreadF01, NULL);
80 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
81
82 for (i = 0; i < 3; i++) { // 3, the loop frequency.
83 ret = mq_timedsend(g_gqueue, msgptr, MQUEUE_SHORT_ARRAY_LENGTH, 0, &ts);
84 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
85
86 LOS_AtomicInc(&g_testCount);
87 }
88
89 ret = pthread_join(thread1, NULL);
90 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
91
92 ret = pthread_attr_destroy(&attr1);
93 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
94
95 ret = mq_close(g_gqueue);
96 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
97
98 ret = mq_unlink(mqname);
99 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
100
101 return NULL;
102 EXIT1:
103 mq_close(g_gqueue);
104 mq_unlink(mqname);
105 EXIT:
106 PosixPthreadDestroy(&attr1, thread1);
107 g_testCount = 0;
108 EXIT2:
109 return NULL;
110 }
111
Testcase(VOID)112 static UINT32 Testcase(VOID)
113 {
114 INT32 ret;
115 pthread_t pthread1;
116 pthread_attr_t attr1;
117 struct sched_param schedparam;
118
119 g_testCount = 0;
120
121 ret = pthread_attr_init(&attr1);
122 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
123
124 schedparam.sched_priority = MQUEUE_PTHREAD_PRIORITY_TEST2;
125 ret = pthread_attr_setschedparam(&attr1, &schedparam);
126 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
127
128 ret = pthread_create(&pthread1, &attr1, PthreadF02, NULL);
129 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
130
131 ret = pthread_join(pthread1, NULL);
132 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
133
134 ret = pthread_attr_destroy(&attr1);
135 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
136
137 ICUNIT_ASSERT_EQUAL(g_testCount, 4, g_testCount); // 4, Here, assert the g_testCount.
138
139 return MQUEUE_NO_ERROR;
140
141 EXIT:
142 PosixPthreadDestroy(&attr1, pthread1);
143 return MQUEUE_NO_ERROR;
144 }
145
ItPosixQueue076(VOID)146 VOID ItPosixQueue076(VOID)
147 {
148 TEST_ADD_CASE("IT_POSIX_QUEUE_076", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
149 }
150