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;
54 UINT32 ret1;
55 CHAR mqname[MQUEUE_STANDARD_NAME_LENGTH] = "";
56 const CHAR *msgptr = MQUEUE_SEND_STRING_TEST;
57 struct mq_attr attr = { 0 };
58 pthread_t pthread1;
59
60 attr.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
61 attr.mq_maxmsg = MQUEUE_STANDARD_NAME_LENGTH;
62 ret = snprintf_s(mqname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
63 "/mq111_%d", LosCurTaskIDGet());
64 ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT3);
65
66 g_gqueue = mq_open(mqname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
67 ICUNIT_GOTO_NOT_EQUAL(g_gqueue, (mqd_t)-1, g_gqueue, EXIT2);
68
69 LOS_AtomicInc(&g_testCount);
70
71 ret = pthread_create(&pthread1, NULL, PthreadF01, NULL);
72 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
73
74 ret = mq_send(g_gqueue, msgptr, strlen(msgptr), 0);
75 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
76
77 ret1 = LosTaskDelay(1);
78 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
79
80 ICUNIT_GOTO_EQUAL(g_testCount, 2, g_testCount, EXIT2); // 2, Here, assert the g_testCount.
81
82 ret = pthread_join(pthread1, NULL);
83 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
84
85 ret = mq_close(g_gqueue);
86 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
87
88 ret = mq_unlink(mqname);
89 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
90
91 LOS_AtomicInc(&g_testCount);
92
93 return NULL;
94 EXIT2:
95 mq_close(g_gqueue);
96 EXIT1:
97 mq_unlink(mqname);
98 EXIT:
99 pthread_join(pthread1, NULL);
100 EXIT3:
101 return NULL;
102 }
103
Testcase(VOID)104 static UINT32 Testcase(VOID)
105 {
106 UINT32 ret;
107 pthread_t pthread1;
108 pthread_attr_t attr1;
109 struct sched_param schedparam;
110
111 g_testCount = 0;
112
113 ret = pthread_attr_init(&attr1);
114 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
115
116 schedparam.sched_priority = MQUEUE_PTHREAD_PRIORITY_TEST2;
117 ret = pthread_attr_setschedparam(&attr1, &schedparam);
118 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
119
120 ret = pthread_create(&pthread1, &attr1, PthreadF02, NULL);
121 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
122
123 ret = LosTaskDelay(2); // 2, Set delay time.
124 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
125
126 ICUNIT_GOTO_EQUAL(g_testCount, 3, g_testCount, EXIT1); // 3, Here, assert the g_testCount.
127
128 ret = pthread_join(pthread1, NULL);
129 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
130
131 ret = pthread_attr_destroy(&attr1);
132 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
133
134 return MQUEUE_NO_ERROR;
135 EXIT1:
136 pthread_join(pthread1, NULL);
137 EXIT:
138 pthread_attr_destroy(&attr1);
139 return MQUEUE_NO_ERROR;
140 }
141
ItPosixQueue111(VOID)142 VOID ItPosixQueue111(VOID) // IT_Layer_ModuleORFeature_No
143 {
144 TEST_ADD_CASE("IT_POSIX_QUEUE_111", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
145 }
146