• 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 = 0;
36     const CHAR *msgptr = "test message ";
37 
38     g_testCount = 1;
39 
40     ret = LosTaskDelay(2); // 2, Set delay time.
41     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
42 
43     ret = mq_send(g_gqueue, msgptr, strlen(msgptr), 0);
44     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
45 
46     g_testCount = 2; // 2, Init test count value.
47 
48     return NULL;
49 EXIT:
50     g_testCount = 0;
51     return NULL;
52 }
53 
PthreadF02(VOID * argument)54 static VOID *PthreadF02(VOID *argument)
55 {
56     INT32 ret = 0, len;
57     CHAR  msgrv[MQUEUE_STANDARD_NAME_LENGTH] = {0};
58     const CHAR *msgptr = "test message ";
59     struct timespec ts;
60 
61     g_testCount = 3; // 3, Init test count value.
62 
63     ts.tv_sec = INT32_MAX;
64     ts.tv_nsec = 0;
65 
66     len = mq_timedreceive(g_gqueue, msgrv, MQUEUE_STANDARD_NAME_LENGTH, NULL, &ts);
67 
68     ret = LosTaskDelay(3); // 3, Set delay time.
69     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
70     ICUNIT_GOTO_EQUAL(len, strlen(msgptr), len, EXIT);
71 
72     ret = mq_close(g_gqueue);
73     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
74 
75     ret = mq_unlink(g_gqname);
76     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
77 
78     g_testCount = 4; // 4, Init test count value.
79 
80     return NULL;
81 EXIT:
82     mq_close(g_gqueue);
83     mq_unlink(g_gqname);
84     g_testCount = 0;
85     return NULL;
86 }
87 
Testcase(VOID)88 static UINT32 Testcase(VOID)
89 {
90     INT32 ret;
91     struct mq_attr attr = { 0 };
92     pthread_attr_t attr1;
93     pthread_t newTh, newTh2;
94 
95     ret = snprintf_s(g_gqname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
96                      "/mq097_%d", LosCurTaskIDGet());
97     ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT3);
98 
99     attr.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
100     attr.mq_maxmsg = MQUEUE_STANDARD_NAME_LENGTH;
101     g_gqueue = mq_open(g_gqname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
102     ICUNIT_GOTO_NOT_EQUAL(g_gqueue, (mqd_t)-1, g_gqueue, EXIT);
103 
104     g_testCount = 0;
105 
106     ret = PosixPthreadInit(&attr1, MQUEUE_PTHREAD_PRIORITY_TEST1);
107     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
108 
109     ret = pthread_create(&newTh, &attr1, PthreadF01, NULL);
110     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
111 
112     ret = PosixPthreadInit(&attr1, MQUEUE_PTHREAD_PRIORITY_TEST2);
113     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
114 
115     ret = pthread_create(&newTh2, &attr1, PthreadF02, NULL);
116     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
117 
118     ret = LosTaskDelay(10); // 10, Set delay time.
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, newTh);
127     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
128 
129     return MQUEUE_NO_ERROR;
130 
131 EXIT2:
132     PosixPthreadDestroy(&attr1, newTh2);
133 EXIT1:
134     PosixPthreadDestroy(&attr1, newTh);
135 EXIT:
136     mq_close(g_gqueue);
137     mq_unlink(g_gqname);
138 EXIT3:
139     return MQUEUE_NO_ERROR;
140 }
141 
ItPosixQueue097(VOID)142 VOID ItPosixQueue097(VOID) // IT_Layer_ModuleORFeature_No
143 {
144     TEST_ADD_CASE("IT_POSIX_QUEUE_097", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
145 }
146