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, count = 0;
36 CHAR msgrcd[MQUEUE_STANDARD_NAME_LENGTH] = {0};
37
38 while (count < MQUEUE_SHORT_ARRAY_LENGTH) {
39 LOS_AtomicInc(&g_testCount);
40
41 ret = mq_receive(g_gqueue, msgrcd, MQUEUE_STANDARD_NAME_LENGTH, NULL);
42 ICUNIT_GOTO_EQUAL(ret, MQUEUE_SHORT_ARRAY_LENGTH, ret, EXIT);
43 ICUNIT_GOTO_STRING_EQUAL(msgrcd, g_mqueueMsessage[count], msgrcd, EXIT);
44
45 count++;
46 }
47 return NULL;
48 EXIT:
49 g_testCount = 0;
50 return NULL;
51 }
52
Testcase(VOID)53 static UINT32 Testcase(VOID)
54 {
55 INT32 ret, count = 0;
56 CHAR mqname[MQUEUE_STANDARD_NAME_LENGTH] = "";
57 pthread_t pthread1;
58 pthread_attr_t attr1;
59 struct sched_param schedparam;
60 struct mq_attr attr = { 0 };
61
62 attr.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
63 attr.mq_maxmsg = MQUEUE_STANDARD_NAME_LENGTH;
64
65 g_testCount = 0;
66
67 LOS_TaskLock();
68 ret = snprintf_s(mqname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
69 "/mq114_%d", LosCurTaskIDGet());
70 ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT3);
71
72 g_gqueue = mq_open(mqname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
73 ICUNIT_GOTO_NOT_EQUAL(g_gqueue, (mqd_t)-1, g_gqueue, EXIT2);
74
75 ret = pthread_attr_init(&attr1);
76 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
77
78 schedparam.sched_priority = MQUEUE_PTHREAD_PRIORITY_TEST2;
79 ret = pthread_attr_setschedparam(&attr1, &schedparam);
80 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
81
82 ret = pthread_create(&pthread1, &attr1, PthreadF01, NULL);
83 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
84
85 LOS_TaskUnlock();
86
87 while (count < MQUEUE_SHORT_ARRAY_LENGTH) {
88 LOS_AtomicInc(&g_testCount);
89
90 ret = mq_send(g_gqueue, g_mqueueMsessage[count], MQUEUE_SHORT_ARRAY_LENGTH, 0);
91 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
92
93 count++;
94 }
95
96 ret = pthread_join(pthread1, NULL);
97 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
98
99 TestExtraTaskDelay(2); // 2, Set delay time.
100 ICUNIT_GOTO_EQUAL(g_testCount, MQUEUE_SHORT_ARRAY_LENGTH * 2, g_testCount, EXIT2);
101
102 ret = mq_close(g_gqueue);
103 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
104
105 ret = mq_unlink(mqname);
106 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
107
108 ret = pthread_attr_destroy(&attr1);
109 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
110
111 return MQUEUE_NO_ERROR;
112 EXIT2:
113 mq_close(g_gqueue);
114 mq_unlink(mqname);
115 EXIT1:
116 pthread_join(pthread1, NULL);
117 EXIT:
118 pthread_attr_destroy(&attr1);
119 EXIT3:
120 return MQUEUE_NO_ERROR;
121 }
122
ItPosixQueue114(VOID)123 VOID ItPosixQueue114(VOID) // IT_Layer_ModuleORFeature_No
124 {
125 TEST_ADD_CASE("IT_POSIX_QUEUE_114", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
126 }
127