• 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     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_testCount = 0;
67 
68     ret = snprintf_s(mqname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
69                      "/mq113_%d", LosCurTaskIDGet());
70     ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT3);
71 
72     g_gqueue = mq_open(mqname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
73     ICUNIT_GOTO_NOT_EQUAL(g_gqueue, (mqd_t)-1, g_gqueue, EXIT2);
74 
75     TestExtraTaskDelay(1);
76 
77     ret = pthread_attr_init(&attr1);
78     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
79 
80     schedparam.sched_priority = MQUEUE_PTHREAD_PRIORITY_TEST2;
81     ret = pthread_attr_setschedparam(&attr1, &schedparam);
82     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
83 
84     ret = pthread_create(&pthread1, &attr1, PthreadF01, NULL);
85     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
86 
87     usleep(0);
88     ICUNIT_GOTO_NOT_EQUAL(g_gqueue, (mqd_t)-1, g_gqueue, EXIT2);
89 
90     ret = mq_send(g_gqueue, msgptr, strlen(msgptr), 0);
91     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
92 
93     usleep(0);
94 
95     ret = pthread_join(pthread1, NULL);
96     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
97 
98     ICUNIT_GOTO_EQUAL(g_testCount, 1, g_testCount, EXIT2);
99 
100     ret = mq_close(g_gqueue);
101     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
102 
103     ret = mq_unlink(mqname);
104     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
105 
106     ret = pthread_attr_destroy(&attr1);
107     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
108 
109     return MQUEUE_NO_ERROR;
110 
111 EXIT2:
112     mq_close(g_gqueue);
113     mq_unlink(mqname);
114 EXIT1:
115     pthread_join(pthread1, NULL);
116 EXIT:
117     pthread_attr_destroy(&attr1);
118 EXIT3:
119     return MQUEUE_NO_ERROR;
120 }
121 
ItPosixQueue113(VOID)122 VOID ItPosixQueue113(VOID) // IT_Layer_ModuleORFeature_No
123 {
124     TEST_ADD_CASE("IT_POSIX_QUEUE_113", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
125 }
126