• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
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 * argument)33 static VOID *PthreadF01(VOID *argument)
34 {
35     INT32 ret;
36     const CHAR *msgptr = MQUEUE_SEND_STRING_TEST;
37 
38     g_testCount = 1;
39 
40     TestAssertWaitDelay(&g_testCount, 3); // 3, Here, assert the g_testCount.
41 
42     ret = mq_send(g_gqueue, msgptr, strlen(msgptr), 0);
43     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
44 
45     g_testCount = 2; // 2, Init test count value.
46 
47     return NULL;
48 EXIT:
49     mq_close(g_gqueue);
50     mq_unlink(g_gqname);
51     g_testCount = 0;
52     return NULL;
53 }
54 
PthreadF02(VOID * argument)55 static VOID *PthreadF02(VOID *argument)
56 {
57     INT32 ret = 0;
58     CHAR msgrv[MQUEUE_STANDARD_NAME_LENGTH] = {0};
59 
60     g_testCount = 3; // 3, Init test count value.
61 
62     ret = mq_receive(g_gqueue, msgrv, MQUEUE_STANDARD_NAME_LENGTH, NULL);
63     ICUNIT_GOTO_EQUAL(ret, MQUEUE_SHORT_ARRAY_LENGTH, ret, EXIT);
64 
65     ret = LosTaskDelay(1);
66     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
67 
68     ret = mq_close(g_gqueue);
69     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
70 
71     ret = mq_unlink(g_gqname);
72     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
73 
74     g_testCount = 4; // 4, Init test count value.
75     return NULL;
76 EXIT:
77     mq_close(g_gqueue);
78     mq_unlink(g_gqname);
79     g_testCount = 0;
80     return NULL;
81 }
82 
Testcase(VOID)83 static UINT32 Testcase(VOID)
84 {
85     UINT32 ret;
86     struct mq_attr attr = { 0 };
87     pthread_attr_t attr1;
88     pthread_t newTh1, newTh2;
89 
90     (void)snprintf_s(g_gqname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1,
91                      "/mq053_%d", LosCurTaskIDGet());
92 
93     attr.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
94     attr.mq_maxmsg = MQUEUE_STANDARD_NAME_LENGTH;
95     g_gqueue = mq_open(g_gqname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
96     ICUNIT_GOTO_NOT_EQUAL(g_gqueue, (mqd_t)-1, g_gqueue, EXIT);
97 
98     g_testCount = 0;
99 
100     ret = PosixPthreadInit(&attr1, MQUEUE_PTHREAD_PRIORITY_TEST1);
101     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
102 
103     ret = pthread_create(&newTh1, &attr1, PthreadF01, NULL);
104     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
105 
106     TestAssertWaitDelay(&g_testCount, 1);
107 
108     ret = PosixPthreadInit(&attr1, MQUEUE_PTHREAD_PRIORITY_TEST2);
109     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
110 
111     ret = pthread_create(&newTh2, &attr1, PthreadF02, NULL);
112     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
113 
114 #ifdef TEST3559A_M7
115     ret = LosTaskDelay(50); // 50, Set delay time.
116 #else
117     ret = LosTaskDelay(10); // 10, Set delay time.
118 #endif
119     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
120 
121     TestAssertWaitDelay(&g_testCount, 4); // 4, Here, assert the g_testCount.
122 
123     ret = PosixPthreadDestroy(&attr1, newTh2);
124     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
125 
126     ret = PosixPthreadDestroy(&attr1, newTh1);
127     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
128 
129     return MQUEUE_NO_ERROR;
130 EXIT2:
131     PosixPthreadDestroy(&attr1, newTh2);
132 EXIT1:
133     PosixPthreadDestroy(&attr1, newTh1);
134 EXIT:
135     mq_close(g_gqueue);
136     mq_unlink(g_gqname);
137     return MQUEUE_NO_ERROR;
138 }
139 
ItPosixQueue053(VOID)140 VOID ItPosixQueue053(VOID)
141 {
142     TEST_ADD_CASE("ItPosixQueue053", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
143 }
144