.\" Copyright (c) 1983, 1991, 1993
.\" The Regents of the University of California. All rights reserved.
.\" Redistribution and use in source and binary forms, with or without
.\" modification, are permitted provided that the following conditions
.\" 1. Redistributions of source code must retain the above copyright
.\" notice, this list of conditions and the following disclaimer.
.\" 2. Redistributions in binary form must reproduce the above copyright
.\" notice, this list of conditions and the following disclaimer in the
.\" documentation and/or other materials provided with the distribution.
.\" 3. All advertising materials mentioning features or use of this software
.\" must display the following acknowledgement:
.\" This product includes software developed by the University of
.\" California, Berkeley and its contributors.
.\" 4. Neither the name of the University nor the names of its contributors
.\" may be used to endorse or promote products derived from this software
.\" without specific prior written permission.
.\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
.\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
.\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
.\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
.\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
.\" @(#)select.2 8.2 (Berkeley) 3/25/94
.Nd synchronous I/O multiplexing
.Fd #include <sys/types.h>
.Fd #include <sys/time.h>
.Fn select "int nfds" "fd_set *readfds" "fd_set *writefds" "fd_set *exceptfds" "struct timeval *timeout"
examines the I/O descriptor sets whose addresses are passed in
to see if some of their descriptors
are ready for reading, are ready for writing, or have an exceptional
condition pending, respectively.
descriptors are checked in each set;
i.e., the descriptors from 0 through
in the descriptor sets are examined.
replaces the given descriptor sets
with subsets consisting of those descriptors that are ready
for the requested operation.
returns the total number of ready descriptors in all the sets.
The descriptor sets are stored as bit fields in arrays of integers.
The following macros are provided for manipulating such descriptor sets:
initializes a descriptor set
includes a particular descriptor
The behavior of these macros is undefined if
a descriptor value is less than zero or greater than or equal to
which is normally at least equal
to the maximum number of descriptors supported by the system.
is a non-nil pointer, it specifies a maximum interval to wait for the
selection to complete. If
is a nil pointer, the select blocks indefinitely. To affect a poll, the
argument should be non-nil, pointing to a zero-valued timeval structure.
may be given as nil pointers if no descriptors are of interest.
returns the number of ready descriptors that are contained in
or -1 if an error occurred.
If the time limit expires,
including one due to an interrupted call,
the descriptor sets will be unmodified.
One of the descriptor sets specified an invalid descriptor.
A signal was delivered before the time limit expired and
before any of the selected events occurred.
The specified time limit is invalid. One of its components is
Although the provision of
was intended to allow user programs to be written independent
of the kernel limit on the number of open files, the dimension
of a sufficiently large bit field for select remains a problem.
(currently 256) is somewhat larger than
the current kernel limit to the number of open files.
However, in order to accommodate programs which might potentially
use a larger number of open files with select, it is possible
to increase this size within a program by providing
should probably return the time remaining from the original timeout,
if any, by modifying the time value in place.
This may be implemented in future versions of the system.
Thus, it is unwise to assume that the timeout value will be unmodified
function call appeared in