• 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 i;
35     INT32 ret = 0;
36     INT32 mqueuePri[MQUEUE_PRIORITY_NUM_TEST] = {MQ_PRIO_MAX, MQ_PRIO_MAX + 1, MQ_PRIO_MAX + 5}; // 5, Mqueue priority.
37     CHAR mqname[MQUEUE_STANDARD_NAME_LENGTH] = "";
38     const CHAR *msgptr = MQUEUE_SEND_STRING_TEST;
39     mqd_t mqueue;
40 
41     ret = snprintf_s(mqname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
42                      "/mq033_%d", LOS_CurTaskIDGet());
43     ICUNIT_GOTO_NOT_EQUAL(ret, -1, ret, EXIT2);
44 
45     mqueue = mq_open(mqname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
46     ICUNIT_GOTO_NOT_EQUAL(mqueue, (mqd_t)-1, mqueue, EXIT1);
47 
48     for (i = 0; i < MQUEUE_PRIORITY_NUM_TEST; i++) {
49         ret = mq_send(mqueue, msgptr, strlen(msgptr), mqueuePri[i]);
50         ICUNIT_GOTO_EQUAL(ret, -1, ret, EXIT1);
51         ICUNIT_GOTO_EQUAL(errno, EINVAL, errno, EXIT1);
52     }
53 
54     ret = mq_close(mqueue);
55     ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT);
56 
57     ret = mq_unlink(mqname);
58     ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT2);
59 
60     return LOS_OK;
61 EXIT1:
62     mq_close(mqueue);
63 EXIT:
64     mq_unlink(mqname);
65 EXIT2:
66     return LOS_NOK;
67 }
68 
69 /**
70  * @tc.name: ItPosixQueue033
71  * @tc.desc: Test interface mq_send
72  * @tc.type: FUNC
73  * @tc.require: issueI6148G
74  */
75 
ItPosixQueue033(VOID)76 VOID ItPosixQueue033(VOID)
77 {
78     TEST_ADD_CASE("ItPosixQueue033", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
79 }
80