• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
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 
Testcase(VOID)33 static UINT32 Testcase(VOID)
34 {
35     CHAR qname[MQUEUE_STANDARD_NAME_LENGTH] = "";
36     const CHAR *msgptr = MQUEUE_SEND_STRING_TEST;
37     mqd_t queue;
38     INT32 unresolved = 0, failure = 0, ret = 0;
39 
40     ret = snprintf_s(qname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
41                      "/mq046-1_%d", LosCurTaskIDGet());
42     ICUNIT_GOTO_NOT_EQUAL(ret, MQUEUE_IS_ERROR, ret, EXIT);
43 
44     queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
45     ICUNIT_GOTO_NOT_EQUAL(queue, (mqd_t)-1, queue, EXIT);
46 
47     ret = mq_send((mqd_t)(&queue + 1), msgptr, strlen(msgptr), 0);
48     ICUNIT_GOTO_EQUAL(ret, -1, ret, EXIT2);
49     ICUNIT_GOTO_EQUAL(errno, EBADF, errno, EXIT2);
50 
51     ret = mq_close(queue);
52     ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT2);
53 
54     ret = mq_unlink(qname);
55     ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT1);
56 
57     return MQUEUE_NO_ERROR;
58 EXIT2:
59     mq_close(queue);
60 EXIT1:
61     mq_unlink(qname);
62 EXIT:
63     return MQUEUE_NO_ERROR;
64 }
65 
ItPosixQueue046(VOID)66 VOID ItPosixQueue046(VOID) // IT_Layer_ModuleORFeature_No
67 {
68     TEST_ADD_CASE("IT_POSIX_QUEUE_046", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
69 }
70