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
33 #define QUEUE_NAME_MAX_LEN (MQUEUE_NAME_MAX_TEST * 2)
34
Testcase(VOID)35 static UINT32 Testcase(VOID)
36 {
37 CHAR mqname[QUEUE_NAME_MAX_LEN];
38 mqd_t mqueue;
39 UINT32 ret;
40 INT32 i;
41
42 ret = snprintf_s(mqname, QUEUE_NAME_MAX_LEN, QUEUE_NAME_MAX_LEN - 1, \
43 "/mq025_%d", LosCurTaskIDGet()); // 2, mqname length.
44 ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT1);
45
46 for (i = 0; i < MQUEUE_NAME_MAX_TEST; i++) {
47 ret = strcat_s(mqname, QUEUE_NAME_MAX_LEN, "0");
48 ICUNIT_ASSERT_EQUAL(ret, EOK, ret);
49 }
50
51 mqueue = mq_open(mqname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
52 ICUNIT_GOTO_EQUAL(mqueue, (mqd_t)-1, mqueue, EXIT);
53 ICUNIT_ASSERT_EQUAL(errno, ENAMETOOLONG, errno);
54
55 return MQUEUE_NO_ERROR;
56 EXIT:
57 mq_close(mqueue);
58 mq_unlink(mqname);
59 EXIT1:
60 return MQUEUE_NO_ERROR;
61 }
62
ItPosixQueue025(VOID)63 VOID ItPosixQueue025(VOID) // IT_Layer_ModuleORFeature_No
64 {
65 TEST_ADD_CASE("IT_POSIX_QUEUE_025", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
66 }
67