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 static int g_testFlag = 0;
33
PthreadF01(VOID * arg)34 static VOID *PthreadF01(VOID *arg)
35 {
36 INT32 ret;
37 INT32 i;
38 CHAR msgrcd[MQUEUE_STANDARD_NAME_LENGTH] = {0};
39 struct timespec ts = { 0 };
40 ts.tv_sec = 0xffff;
41 for (i = 0; i < MQUEUE_STANDARD_NAME_LENGTH * 2; i++) { // 2, The loop frequency name length.
42 ret = mq_timedreceive(g_gqueue, msgrcd, MQUEUE_STANDARD_NAME_LENGTH, NULL, &ts);
43 ICUNIT_GOTO_EQUAL(ret, MQUEUE_SHORT_ARRAY_LENGTH, ret, EXIT);
44 ICUNIT_GOTO_STRING_EQUAL(msgrcd, MQUEUE_SEND_STRING_TEST, msgrcd, EXIT);
45 }
46 g_testFlag = 0; // 0 means the sub thread has executed
47 return NULL;
48 EXIT:
49 return NULL;
50 }
51
Testcase(VOID)52 static UINT32 Testcase(VOID)
53 {
54 INT32 ret;
55 INT32 i;
56 CHAR mqname[MQUEUE_STANDARD_NAME_LENGTH] = "";
57 const CHAR *msgptr = MQUEUE_SEND_STRING_TEST;
58 pthread_t pthread1;
59 pthread_attr_t attr1;
60 struct sched_param schedparam;
61 struct mq_attr attr = { 0 };
62
63 attr.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
64 attr.mq_maxmsg = MQUEUE_STANDARD_NAME_LENGTH;
65
66 g_testFlag = 1; // 1 initialize the flag
67 LOS_TaskLock();
68 ret = snprintf_s(mqname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
69 "/mq075_%d", LosCurTaskIDGet());
70 ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT2);
71 g_gqueue = mq_open(mqname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
72 ICUNIT_GOTO_NOT_EQUAL(g_gqueue, (mqd_t)-1, g_gqueue, EXIT1);
73 ret = pthread_attr_init(&attr1);
74 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
75
76 pthread_attr_setinheritsched(&attr1, PTHREAD_EXPLICIT_SCHED);
77 schedparam.sched_priority = MQUEUE_PTHREAD_PRIORITY_TEST2;
78
79 ret = pthread_attr_setschedparam(&attr1, &schedparam);
80 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
81
82 ret = pthread_create(&pthread1, &attr1, PthreadF01, NULL);
83 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
84
85 LOS_TaskUnlock();
86 for (i = 0; i < MQUEUE_STANDARD_NAME_LENGTH * 2; i++) { // 2, The loop frequency name length.
87 ret = mq_send(g_gqueue, msgptr, strlen(msgptr), 0);
88 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
89 }
90
91 // waitting for the flag is 0, means the sub thread has executed
92 while (g_testFlag) {
93 usleep(1);
94 }
95
96 ret = mq_close(g_gqueue);
97 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
98
99 ret = mq_unlink(mqname);
100 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
101
102 ret = pthread_join(pthread1, NULL);
103 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
104
105 ret = pthread_attr_destroy(&attr1);
106 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
107
108 return MQUEUE_NO_ERROR;
109 EXIT1:
110 mq_close(g_gqueue);
111 mq_unlink(mqname);
112 EXIT:
113 PosixPthreadDestroy(&attr1, pthread1);
114 EXIT2:
115 return MQUEUE_NO_ERROR;
116 }
117
ItPosixQueue075(VOID)118 VOID ItPosixQueue075(VOID) // IT_Layer_ModuleORFeature_No
119 {
120 TEST_ADD_CASE("IT_POSIX_QUEUE_075", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
121 }
122