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_test_IO.h"
32
33 struct PollParam {
34 int nfds;
35 int timeout;
36 int ret;
37 int err;
38 };
39
Testcase(VOID)40 static UINT32 Testcase(VOID)
41 {
42 const int TEST_STR_LEN = 12;
43 int pipeFd[2], ret, err; // 2, pipe return 2 file descirpter
44 struct pollfd pollFd;
45 struct PollParam pollParam[4] = { /* nfds timeout ret err */
46 { 0, 100, -1, EINVAL},
47 { 4096, 10, -1, EINVAL},
48 { 4095, 10, -1, EFAULT},
49 { 1, -1, 1, 0}
50 };
51
52 ret = pipe(pipeFd);
53 ICUNIT_ASSERT_EQUAL(ret, 0, ret);
54 ret = write(pipeFd[1], "hello world", TEST_STR_LEN);
55 printf("write first status: %d\n", ret);
56 ICUNIT_GOTO_EQUAL(ret, TEST_STR_LEN, ret, EXIT);
57
58 pollFd.fd = pipeFd[0];
59 pollFd.events = POLLIN;
60
61 for (int i = 0; i < sizeof(pollParam) / sizeof(pollParam[0]); i++) {
62 ret = poll(&pollFd, pollParam[i].nfds, pollParam[i].timeout);
63 ICUNIT_GOTO_EQUAL(ret, pollParam[i].ret, ret, EXIT);
64 if (ret == -1) {
65 printf("i = %d\n", i);
66 if (i == 2) { // 2, pollParam[2].
67 ICUNIT_GOTO_TWO_EQUAL(errno, EFAULT, EBADF, errno, EXIT);
68 } else {
69 ICUNIT_GOTO_EQUAL(errno, pollParam[i].err, errno, EXIT);
70 }
71 }
72 }
73
74 close(pipeFd[0]);
75 close(pipeFd[1]);
76 return LOS_OK;
77 EXIT:
78 close(pipeFd[0]);
79 close(pipeFd[1]);
80 return LOS_NOK;
81 }
82
ItStdlibPoll003(void)83 VOID ItStdlibPoll003(void)
84 {
85 TEST_ADD_CASE(__FUNCTION__, Testcase, TEST_LIB, TEST_LIBC, TEST_LEVEL1, TEST_FUNCTION);
86 }
87