• 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_messageQId, msgRcd, MQUEUE_STANDARD_NAME_LENGTH, NULL);
41     ICUNIT_GOTO_EQUAL(ret, MSGLEN, ret, EXIT);
42     ICUNIT_GOTO_STRING_EQUAL(msgRcd, MQUEUE_SEND_STRING_TEST, msgRcd, EXIT);
43 
44     return NULL;
45 EXIT:
46     g_testCount = 0;
47     return NULL;
48 }
Testcase(VOID)49 static UINT32 Testcase(VOID)
50 {
51     pthread_t threadA;
52     pthread_attr_t attrA;
53     UINT32 ret;
54     struct sched_param sp;
55 
56     CHAR qName[MQUEUE_STANDARD_NAME_LENGTH] = "";
57     const CHAR *msgPtr = MQUEUE_SEND_STRING_TEST;
58     struct mq_attr msgAttr = { 0 };
59     msgAttr.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
60     msgAttr.mq_maxmsg = MQUEUE_STANDARD_NAME_LENGTH;
61 
62     g_testCount = 0;
63 
64     ret = snprintf_s(qName, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
65                      "/mq112_%d", LosCurTaskIDGet());
66     ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT);
67 
68     g_messageQId = mq_open(qName, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &msgAttr);
69     ICUNIT_GOTO_NOT_EQUAL(g_messageQId, (mqd_t)-1, g_messageQId, EXIT);
70 
71     ret = mq_send(g_messageQId, msgPtr, strlen(msgPtr), 0);
72     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
73 
74     ret = pthread_attr_init(&attrA);
75     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
76 
77     pthread_attr_setinheritsched(&attrA, PTHREAD_EXPLICIT_SCHED);
78 
79     sp.sched_priority = MQUEUE_PTHREAD_PRIORITY_TEST2;
80     ret = pthread_attr_setschedparam(&attrA, &sp);
81     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
82 
83     ret = pthread_create(&threadA, &attrA, PthreadF01, NULL);
84     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
85 
86     LosTaskDelay(2); // 2, Set delay time.
87     ICUNIT_GOTO_EQUAL(g_testCount, 1, g_testCount, EXIT2);
88 
89     ret = pthread_join(threadA, NULL);
90     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
91 
92     ret = pthread_attr_destroy(&attrA);
93     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
94 
95     ret = mq_close(g_messageQId);
96     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
97 
98     ret = mq_unlink(qName);
99     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
100 
101     return MQUEUE_NO_ERROR;
102 EXIT2:
103     PosixPthreadDestroy(&attrA, threadA);
104 EXIT1:
105     mq_close(g_messageQId);
106     mq_unlink(qName);
107 EXIT:
108     return MQUEUE_NO_ERROR;
109 }
110 
ItPosixQueue112(VOID)111 VOID ItPosixQueue112(VOID) // IT_Layer_ModuleORFeature_No
112 {
113     TEST_ADD_CASE("IT_POSIX_QUEUE_112", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
114 }
115