• 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 rcdTimeout = { 0 };
38     rcdTimeout.tv_sec = 0xffff;
39 
40     LOS_AtomicInc(&g_testCount);
41 
42     ret = mq_timedreceive(g_messageQId, msgRcd, MQUEUE_STANDARD_NAME_LENGTH, NULL, &rcdTimeout);
43     ICUNIT_GOTO_EQUAL(ret, MSGLEN, ret, NOK);
44     ICUNIT_GOTO_STRING_EQUAL(msgRcd, MQUEUE_SEND_STRING_TEST, msgRcd, NOK);
45 
46 NOK:
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 
60     msgAttr.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
61     msgAttr.mq_maxmsg = MQUEUE_STANDARD_NAME_LENGTH;
62 
63     g_testCount = 0;
64 
65     LOS_TaskLock();
66     ret = snprintf_s(qName, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
67                      "/mq117_%d", LosCurTaskIDGet());
68     ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT);
69 
70     g_messageQId = mq_open(qName, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &msgAttr);
71     ICUNIT_GOTO_NOT_EQUAL(g_messageQId, (mqd_t)-1, g_messageQId, EXIT2);
72 
73     ret = pthread_attr_init(&attrA);
74     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
75 
76     sp.sched_priority = MQUEUE_PTHREAD_PRIORITY_TEST2;
77     ret = pthread_attr_setschedparam(&attrA, &sp);
78     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
79 
80     ret = pthread_create(&threadA, &attrA, PthreadF01, NULL);
81     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
82 
83     LOS_TaskUnlock();
84 
85     ret = mq_send(g_messageQId, msgPtr, strlen(msgPtr), 0);
86     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
87 
88     LosTaskDelay(1);
89 
90     ret = pthread_join(threadA, NULL);
91     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
92 
93     ret = pthread_attr_destroy(&attrA);
94     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT2);
95 
96     ICUNIT_GOTO_EQUAL(g_testCount, 1, g_testCount, EXIT3);
97 
98     ret = mq_close(g_messageQId);
99     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT3);
100 
101     ret = mq_unlink(qName);
102     ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT3);
103 
104     return MQUEUE_NO_ERROR;
105 EXIT3:
106     mq_close(g_messageQId);
107     mq_unlink(qName);
108     return MQUEUE_NO_ERROR;
109 EXIT2:
110     mq_close(g_messageQId);
111     mq_unlink(qName);
112 EXIT1:
113     PosixPthreadDestroy(&attrA, threadA);
114 EXIT:
115     return MQUEUE_NO_ERROR;
116 }
117 
ItPosixQueue117(VOID)118 VOID ItPosixQueue117(VOID) // IT_Layer_ModuleORFeature_No
119 {
120     TEST_ADD_CASE("IT_POSIX_QUEUE_117", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
121 }
122