• 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 
38     LOS_AtomicInc(&g_testCount);
39 
40     ret = mq_receive(g_gqueue, msgrcd, MQUEUE_STANDARD_NAME_LENGTH, NULL);
41     ICUNIT_GOTO_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT);
42 
43     LOS_AtomicInc(&g_testCount);
44 
45     return NULL;
46 
47 EXIT:
48     g_testCount = 0;
49     return NULL;
50 }
51 
Testcase(VOID)52 static UINT32 Testcase(VOID)
53 {
54     pthread_t thread1;
55     pthread_attr_t attr1;
56     INT32 ret;
57     struct sched_param schedparam;
58 
59     CHAR mqname[MQUEUE_STANDARD_NAME_LENGTH] = "";
60     const CHAR *msgptr = MQUEUE_SEND_STRING_TEST;
61     CHAR msgrcd[MQUEUE_STANDARD_NAME_LENGTH] = {0};
62     struct mq_attr attr = { 0 };
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                      "/mq078_%d", LosCurTaskIDGet());
70     ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT2);
71 
72     g_gqueue = mq_open(mqname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
73     ICUNIT_ASSERT_NOT_EQUAL(g_gqueue, (mqd_t)-1, g_gqueue);
74 
75     ret = mq_send(g_gqueue, msgptr, strlen(msgptr), 0);
76     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
77 
78     ret = mq_receive(g_gqueue, msgrcd, MQUEUE_STANDARD_NAME_LENGTH, NULL);
79     ICUNIT_GOTO_EQUAL(ret, MQUEUE_SHORT_ARRAY_LENGTH, ret, EXIT);
80     ICUNIT_ASSERT_STRING_EQUAL(msgrcd, MQUEUE_SEND_STRING_TEST, msgrcd);
81 
82     ret = mq_close(g_gqueue);
83     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
84 
85     ret = mq_unlink(mqname);
86     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
87 
88     ret = pthread_attr_init(&attr1);
89     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
90 
91     schedparam.sched_priority = MQUEUE_PTHREAD_PRIORITY_TEST2;
92     ret = pthread_attr_setschedparam(&attr1, &schedparam);
93     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
94 
95     ret = pthread_create(&thread1, &attr1, PthreadF01, NULL);
96     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
97 
98     ret = pthread_join(thread1, NULL);
99     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
100 
101     ret = pthread_attr_destroy(&attr1);
102     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
103 
104     ICUNIT_ASSERT_EQUAL(g_testCount, 2, g_testCount); // 2, Here, assert the g_testCount.
105 
106     return MQUEUE_NO_ERROR;
107 EXIT1:
108     pthread_attr_destroy(&attr1);
109 EXIT:
110     mq_close(g_gqueue);
111     mq_unlink(mqname);
112 EXIT2:
113     return MQUEUE_NO_ERROR;
114 }
115 
ItPosixQueue078(VOID)116 VOID ItPosixQueue078(VOID) // IT_Layer_ModuleORFeature_No
117 {
118     TEST_ADD_CASE("IT_POSIX_QUEUE_078", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
119 }
120