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