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