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
32 #define QUEUE_NAME_MAX_LEN (MQUEUE_NAME_MAX_TEST * 2)
33
Testcase(VOID)34 static UINT32 Testcase(VOID)
35 {
36 CHAR mqname[QUEUE_NAME_MAX_LEN];
37 mqd_t mqueue;
38 UINT32 ret;
39 INT32 i;
40
41 ret = snprintf_s(mqname, QUEUE_NAME_MAX_LEN, QUEUE_NAME_MAX_LEN - 1, \
42 "/mq015_%d", LOS_CurTaskIDGet());
43 ICUNIT_GOTO_NOT_EQUAL(ret, -1, ret, EXIT1);
44
45 for (i = 0; i < MQUEUE_NAME_MAX_TEST; i++) {
46 ret = strcat_s(mqname, QUEUE_NAME_MAX_LEN, "0");
47 ICUNIT_ASSERT_EQUAL(ret, EOK, ret);
48 }
49
50 mqueue = mq_open(mqname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
51 ICUNIT_GOTO_EQUAL(mqueue, (mqd_t)-1, mqueue, EXIT);
52 ICUNIT_ASSERT_EQUAL(errno, ENAMETOOLONG, errno);
53
54 return LOS_OK;
55 EXIT:
56 mq_close(mqueue);
57 mq_unlink(mqname);
58 EXIT1:
59 return LOS_OK;
60 }
61
62 /**
63 * @tc.name: ItPosixQueue015
64 * @tc.desc: Test interface mq_open
65 * @tc.type: FUNC
66 * @tc.require: issueI603SR6
67 */
68
ItPosixQueue015(VOID)69 VOID ItPosixQueue015(VOID)
70 {
71 TEST_ADD_CASE("ItPosixQueue015", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
72 }
73