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