1/* 2 * Copyright (C) 2008 The Android Open Source Project 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * * Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * * Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in 12 * the documentation and/or other materials provided with the 13 * distribution. 14 * 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 16 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 17 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS 18 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 19 * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 20 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, 21 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS 22 * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED 23 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, 24 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT 25 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 26 * SUCH DAMAGE. 27 */ 28 29#ifndef _POLL_H_ 30#define _POLL_H_ 31 32#include <sys/cdefs.h> 33#include <linux/poll.h> 34#include <signal.h> /* For sigset_t. */ 35#include <time.h> /* For timespec. */ 36 37__BEGIN_DECLS 38 39typedef unsigned int nfds_t; 40 41int poll(struct pollfd*, nfds_t, int); 42int ppoll(struct pollfd*, nfds_t, const struct timespec*, const sigset_t*); 43 44int __poll_chk(struct pollfd*, nfds_t, int, size_t); 45int __poll_real(struct pollfd*, nfds_t, int) __RENAME(poll); 46__errordecl(__poll_too_small_error, "poll: pollfd array smaller than fd count"); 47 48int __ppoll_chk(struct pollfd*, nfds_t, const struct timespec*, const sigset_t*, size_t); 49int __ppoll_real(struct pollfd*, nfds_t, const struct timespec*, const sigset_t*) __RENAME(ppoll); 50__errordecl(__ppoll_too_small_error, "ppoll: pollfd array smaller than fd count"); 51 52#if defined(__BIONIC_FORTIFY) 53 54__BIONIC_FORTIFY_INLINE 55int poll(struct pollfd* fds, nfds_t fd_count, int timeout) { 56#if defined(__clang__) 57 return __poll_chk(fds, fd_count, timeout, __bos(fds)); 58#else 59 if (__bos(fds) != __BIONIC_FORTIFY_UNKNOWN_SIZE) { 60 if (!__builtin_constant_p(fd_count)) { 61 return __poll_chk(fds, fd_count, timeout, __bos(fds)); 62 } else if (__bos(fds) / sizeof(*fds) < fd_count) { 63 __poll_too_small_error(); 64 } 65 } 66 return __poll_real(fds, fd_count, timeout); 67#endif 68} 69 70__BIONIC_FORTIFY_INLINE 71int ppoll(struct pollfd* fds, nfds_t fd_count, const struct timespec* timeout, const sigset_t* mask) { 72#if defined(__clang__) 73 return __ppoll_chk(fds, fd_count, timeout, mask, __bos(fds)); 74#else 75 if (__bos(fds) != __BIONIC_FORTIFY_UNKNOWN_SIZE) { 76 if (!__builtin_constant_p(fd_count)) { 77 return __ppoll_chk(fds, fd_count, timeout, mask, __bos(fds)); 78 } else if (__bos(fds) / sizeof(*fds) < fd_count) { 79 __ppoll_too_small_error(); 80 } 81 } 82 return __ppoll_real(fds, fd_count, timeout, mask); 83#endif 84} 85 86#endif 87 88__END_DECLS 89 90#endif /* _POLL_H_ */ 91