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 mqd_t queue[_POSIX_OPEN_MAX + _POSIX_MQ_OPEN_MAX + 1];
37 INT32 i, unresolved = 0, failure = 0, numqueues = 0, ret;
38
39 for (i = 0; (i < _POSIX_OPEN_MAX) && (i < _POSIX_MQ_OPEN_MAX); i++, numqueues++) {
40 (void)snprintf_s(qname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
41 "/mq090%d_%d", i, LosCurTaskIDGet());
42
43 queue[i] = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
44 if (queue[i] == (mqd_t)-1) {
45 unresolved = 1;
46 break;
47 }
48 }
49
50 queue[numqueues] = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
51 if (queue[numqueues] != (mqd_t)-1) {
52 } else {
53 if (errno != EMFILE) {
54 failure = 1;
55 }
56 }
57
58 for (i = 0; i <= numqueues; i++) {
59 ret = mq_close(queue[i]);
60 ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT);
61 }
62 for (i = 0; i < numqueues; i++) {
63 (void)snprintf_s(qname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
64 "/mq090%d_%d", i, LosCurTaskIDGet());
65 ret = mq_unlink(qname);
66 ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT);
67 }
68
69 (void)snprintf_s(qname, MQUEUE_STANDARD_NAME_LENGTH, MQUEUE_STANDARD_NAME_LENGTH - 1, \
70 "/mq090%d_%d", numqueues, LosCurTaskIDGet());
71 ret = mq_unlink(qname);
72 ICUNIT_GOTO_EQUAL(ret, -1, ret, EXIT);
73
74 if (failure == 1) {
75 ICUNIT_ASSERT_NOT_EQUAL(failure, 1, failure);
76 }
77
78 if (unresolved == 1) {
79 ICUNIT_ASSERT_NOT_EQUAL(unresolved, 1, unresolved);
80 }
81 return MQUEUE_NO_ERROR;
82 EXIT:
83 for (i = 0; i <= numqueues; i++) {
84 mq_close(queue[i]);
85 mq_unlink(qname);
86 }
87 return MQUEUE_NO_ERROR;
88 }
89
ItPosixQueue090(VOID)90 VOID ItPosixQueue090(VOID) // IT_Layer_ModuleORFeature_No
91 {
92 TEST_ADD_CASE("IT_POSIX_QUEUE_090", Testcase, TEST_POSIX, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION);
93 }
94