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