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