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