• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 /*
2  * Copyright (c) 2022 Huawei Device Co., Ltd. All rights reserved.
3  *
4  * Redistribution and use in source and binary forms, with or without modification,
5  * are permitted provided that the following conditions are met:
6  *
7  * 1. Redistributions of source code must retain the above copyright notice, this list of
8  * conditions and the following disclaimer.
9  *
10  * 2. Redistributions in binary form must reproduce the above copyright notice, this list
11  * of conditions and the following disclaimer in the documentation and/or other materials
12  * provided with the distribution.
13  *
14  * 3. Neither the name of the copyright holder nor the names of its contributors may be used
15  * to endorse or promote products derived from this software without specific prior written
16  * permission.
17  *
18  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
19  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
20  * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
21  * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
22  * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
23  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
24  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
25  * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
26  * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
27  * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
28  * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29  */
30 #include "It_posix_queue.h"
31 
Testcase(VOID)32 static UINT32 Testcase(VOID)
33 {
34     INT32 ret = 0;
35     INT32 i;
36     CHAR mqname[MQUEUE_STANDARD_NAME_LENGTH] = "";
37     const CHAR *msgptr = "test message";
38     mqd_t mqueue;
39     struct mq_attr mqstat;
40 
41     ret = snprintf_s(mqname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
42                      "/mq046_%d", LOS_CurTaskIDGet());
43     ICUNIT_GOTO_NOT_EQUAL(ret, -1, ret, EXIT2);
44 
45     ret = memset_s(&mqstat, sizeof(mqstat), 0, sizeof(mqstat));
46     ICUNIT_ASSERT_EQUAL(ret, 0, ret);
47     mqstat.mq_msgsize = MQUEUE_STANDARD_NAME_LENGTH;
48     mqstat.mq_maxmsg = MQUEUE_STANDARD_NAME_LENGTH;
49     mqueue = mq_open(mqname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &mqstat);
50     ICUNIT_GOTO_NOT_EQUAL(mqueue, (mqd_t)-1, mqueue, EXIT2);
51 
52     for (i = 0; i < 5; i++) { // 5, the loop frequency.
53         ret = mq_send(mqueue, msgptr, strlen(msgptr), 0);
54         ICUNIT_GOTO_NOT_EQUAL(ret, -1, ret, EXIT1);
55     }
56     ret = memset_s(&mqstat, sizeof(mqstat), 0, sizeof(mqstat));
57     ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT1);
58     ret = mq_getattr(mqueue, &mqstat);
59     ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT1);
60     ICUNIT_GOTO_EQUAL(mqstat.mq_curmsgs, 5, mqstat.mq_curmsgs, EXIT1); // 5, assert the curmsgs.
61 
62     ret = mq_close(mqueue);
63     ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT);
64 
65     ret = mq_unlink(mqname);
66     ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT2);
67 
68     return LOS_OK;
69 EXIT1:
70     mq_close(mqueue);
71 EXIT:
72     mq_unlink(mqname);
73 EXIT2:
74     return LOS_NOK;
75 }
76 
77 /**
78  * @tc.name: ItPosixQueue046
79  * @tc.desc: Test interface mq_getattr
80  * @tc.type: FUNC
81  * @tc.require: issueI61YO0
82  */
83 
ItPosixQueue046(VOID)84 VOID ItPosixQueue046(VOID)
85 {
86     TEST_ADD_CASE("ItPosixQueue046", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
87 }
88