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
HwiF01(VOID * arg)33 static VOID HwiF01(VOID *arg)
34 {
35 INT32 ret;
36 CHAR msgrcd[MQUEUE_STANDARD_NAME_LENGTH] = {0};
37 struct timespec ts = { 0 };
38
39 ts.tv_sec = 0;
40
41 TEST_HwiClear(HWI_NUM_TEST);
42
43 LOS_AtomicInc(&g_testCount);
44
45 ret = mq_timedreceive(g_gqueue, msgrcd, MQUEUE_STANDARD_NAME_LENGTH, NULL, &ts);
46 ICUNIT_GOTO_EQUAL(ret, MQUEUE_SHORT_ARRAY_LENGTH, ret, EXIT);
47 ICUNIT_GOTO_STRING_EQUAL(msgrcd, MQUEUE_SEND_STRING_TEST, msgrcd, EXIT);
48
49 LOS_AtomicInc(&g_testCount);
50
51 return;
52
53 EXIT:
54 g_testCount = 0;
55 return;
56 }
57
Testcase(VOID)58 static UINT32 Testcase(VOID)
59 {
60 INT32 ret;
61 UINT32 uret;
62 CHAR mqname[MQUEUE_STANDARD_NAME_LENGTH] = "";
63 const CHAR *msgptr = MQUEUE_SEND_STRING_TEST;
64 struct mq_attr attr = { 0 };
65
66 attr.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
67 attr.mq_maxmsg = MQUEUE_STANDARD_NAME_LENGTH;
68
69 g_testCount = 0;
70
71 ret = snprintf_s(mqname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
72 "/mq122_%d", LosCurTaskIDGet());
73 ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT3);
74
75 g_gqueue = mq_open(mqname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
76 ICUNIT_GOTO_NOT_EQUAL(g_gqueue, (mqd_t)-1, g_gqueue, EXIT1);
77
78 ret = mq_send(g_gqueue, msgptr, strlen(msgptr), 0);
79 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
80
81 uret = LOS_HwiCreate(HWI_NUM_TEST, 1, 0, (HWI_PROC_FUNC)HwiF01, 0);
82 ICUNIT_GOTO_EQUAL(uret, MQUEUE_NO_ERROR, uret, EXIT2);
83
84 TEST_HwiTrigger(HWI_NUM_TEST);
85
86 uret = LosTaskDelay(2); // 2, Set delay time.
87 ICUNIT_GOTO_EQUAL(uret, MQUEUE_NO_ERROR, uret, EXIT2);
88
89 ICUNIT_GOTO_EQUAL(g_testCount, 2, g_testCount, EXIT2); // 2, Here, assert the g_testCount.
90
91 TEST_HwiDelete(HWI_NUM_TEST);
92
93 ret = mq_close(g_gqueue);
94 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT1);
95
96 ret = mq_unlink(mqname);
97 ICUNIT_GOTO_EQUAL(ret, MQUEUE_NO_ERROR, ret, EXIT);
98
99 return MQUEUE_NO_ERROR;
100 EXIT2:
101 TEST_HwiDelete(HWI_NUM_TEST);
102 EXIT1:
103 mq_close(g_gqueue);
104 EXIT:
105 mq_unlink(mqname);
106 EXIT3:
107 return MQUEUE_NO_ERROR;
108 }
109
ItPosixQueue122(VOID)110 VOID ItPosixQueue122(VOID) // IT_Layer_ModuleORFeature_No
111 {
112 TEST_ADD_CASE("IT_POSIX_QUEUE_122", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
113 }
114