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 struct timespec ts = { 0 };
38
39 ts.tv_sec = 0xffff;
40
41 LOS_AtomicInc(&g_testCount);
42
43 ret = mq_timedreceive(g_gqueue, msgrcd, MQUEUE_STANDARD_NAME_LENGTH, NULL, &ts);
44 ICUNIT_GOTO_EQUAL(ret, MQUEUE_SHORT_ARRAY_LENGTH, ret, EXIT);
45 ICUNIT_GOTO_STRING_EQUAL(msgrcd, g_mqueueMsessage[2], msgrcd, EXIT); // 2, g_mqueueMsessage buffer index.
46
47 LOS_AtomicInc(&g_testCount);
48 return NULL;
49 EXIT:
50 g_testCount = 0;
51 return NULL;
52 }
53
PthreadF02(VOID * arg)54 static VOID *PthreadF02(VOID *arg)
55 {
56 INT32 ret;
57 UINT32 pri;
58 CHAR msgrcd[MQUEUE_STANDARD_NAME_LENGTH] = {0};
59 struct timespec ts = { 0 };
60 ts.tv_sec = 0xffff;
61
62 LOS_AtomicInc(&g_testCount);
63
64 ret = mq_timedreceive(g_gqueue, msgrcd, MQUEUE_STANDARD_NAME_LENGTH, &pri, &ts);
65 ICUNIT_GOTO_EQUAL(ret, MQUEUE_SHORT_ARRAY_LENGTH, ret, EXIT);
66 ICUNIT_GOTO_STRING_EQUAL(msgrcd, g_mqueueMsessage[1], msgrcd, EXIT);
67
68 LOS_AtomicInc(&g_testCount);
69 return NULL;
70 EXIT:
71 g_testCount = 0;
72 return NULL;
73 }
74
Testcase(VOID)75 static UINT32 Testcase(VOID)
76 {
77 INT32 ret;
78 CHAR mqname[MQUEUE_STANDARD_NAME_LENGTH] = "";
79 pthread_t pthread1;
80 pthread_attr_t attr1;
81 pthread_t pthread2;
82 pthread_attr_t attr2;
83 struct sched_param schedparam1;
84 struct sched_param schedparam2;
85 struct mq_attr attr = { 0 };
86
87 attr.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
88 attr.mq_maxmsg = MQUEUE_STANDARD_NAME_LENGTH;
89
90 g_testCount = 0;
91
92 (void)snprintf_s(mqname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1,
93 "/mq120_%d", LosCurTaskIDGet());
94
95 g_gqueue = mq_open(mqname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
96 ICUNIT_GOTO_NOT_EQUAL(g_gqueue, (mqd_t)-1, g_gqueue, EXIT1);
97
98 ret = pthread_attr_init(&attr1);
99 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
100
101 schedparam1.sched_priority = MQUEUE_PTHREAD_PRIORITY_TEST2;
102 ret = pthread_attr_setschedparam(&attr1, &schedparam1);
103 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
104
105 ret = pthread_create(&pthread1, &attr1, PthreadF02, NULL);
106 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
107
108 ret = pthread_attr_init(&attr2);
109 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
110
111 schedparam2.sched_priority = MQUEUE_PTHREAD_PRIORITY_TEST2 - 2; // 2, Pthread schedul priority.
112 ret = pthread_attr_setschedparam(&attr2, &schedparam2);
113 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT3);
114
115 ret = pthread_create(&pthread2, &attr2, PthreadF01, NULL);
116 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT3);
117
118 ret = mq_send(g_gqueue, g_mqueueMsessage[1], MQUEUE_SHORT_ARRAY_LENGTH, 0);
119 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT3);
120
121 ret = mq_send(g_gqueue, g_mqueueMsessage[2], MQUEUE_SHORT_ARRAY_LENGTH, 0); // 2, mqueue message buffer index.
122 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT3);
123
124 TestExtraTaskDelay(3); // 3, Set delay time.
125 ICUNIT_GOTO_EQUAL(g_testCount, 4, g_testCount, EXIT3); // 4, Here, assert the g_testCount.
126
127 ret = pthread_join(pthread1, NULL);
128 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT3);
129
130 ret = pthread_attr_destroy(&attr1);
131 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT3);
132
133 ret = pthread_join(pthread2, NULL);
134 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
135
136 ret = pthread_attr_destroy(&attr2);
137 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
138
139 ret = mq_close(g_gqueue);
140 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
141
142 ret = mq_unlink(mqname);
143 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
144
145 return MQUEUE_NO_ERROR;
146 EXIT3:
147 pthread_attr_destroy(&attr1);
148 EXIT2:
149 pthread_attr_destroy(&attr2);
150 EXIT1:
151 mq_close(g_gqueue);
152 EXIT:
153 mq_unlink(mqname);
154 return MQUEUE_NO_ERROR;
155 }
156
ItPosixQueue120(VOID)157 VOID ItPosixQueue120(VOID) // IT_Layer_ModuleORFeature_No
158 {
159 TEST_ADD_CASE("IT_POSIX_QUEUE_120", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
160 }
161