1 .\" This manpage is copyright (C) 2001 Paul Sheer.
3 .\" %%%LICENSE_START(VERBATIM)
4 .\" Permission is granted to make and distribute verbatim copies of this
5 .\" manual provided the copyright notice and this permission notice are
6 .\" preserved on all copies.
8 .\" Permission is granted to copy and distribute modified versions of this
9 .\" manual under the conditions for verbatim copying, provided that the
10 .\" entire resulting derived work is distributed under the terms of a
11 .\" permission notice identical to this one.
13 .\" Since the Linux kernel and libraries are constantly changing, this
14 .\" manual page may be incorrect or out-of-date. The author(s) assume no
15 .\" responsibility for errors or omissions, or for damages resulting from
16 .\" the use of the information contained herein. The author(s) may not
17 .\" have taken the same level of care in the production of this manual,
18 .\" which is licensed free of charge, as they might when working
21 .\" Formatted or processed versions of this manual, if unaccompanied by
22 .\" the source, must acknowledge the copyright and authors of this work.
25 .\" very minor changes, aeb
27 .\" Modified 5 June 2002, Michael Kerrisk <mtk.manpages@gmail.com>
28 .\" 2006-05-13, mtk, removed much material that is redundant with select.2
29 .\" various other changes
30 .\" 2008-01-26, mtk, substantial changes and rewrites
32 .TH SELECT_TUT 2 2015-08-08 "Linux" "Linux Programmer's Manual"
34 select, pselect, FD_CLR, FD_ISSET, FD_SET, FD_ZERO \-
35 synchronous I/O multiplexing
38 /* According to POSIX.1-2001, POSIX.1-2008 */
40 .B #include <sys/select.h>
42 /* According to earlier standards */
44 .B #include <sys/time.h>
46 .B #include <sys/types.h>
48 .B #include <unistd.h>
50 .BI "int select(int " nfds ", fd_set *" readfds ", fd_set *" writefds ,
51 .BI " fd_set *" exceptfds ", struct timeval *" utimeout );
53 .BI "void FD_CLR(int " fd ", fd_set *" set );
55 .BI "int FD_ISSET(int " fd ", fd_set *" set );
57 .BI "void FD_SET(int " fd ", fd_set *" set );
59 .BI "void FD_ZERO(fd_set *" set );
61 .B #include <sys/select.h>
63 .BI "int pselect(int " nfds ", fd_set *" readfds ", fd_set *" writefds ,
64 .BI " fd_set *" exceptfds ", const struct timespec *" ntimeout ,
65 .BI " const sigset_t *" sigmask );
69 Feature Test Macro Requirements for glibc (see
70 .BR feature_test_macros (7)):
74 _POSIX_C_SOURCE\ >=\ 200112L || _XOPEN_SOURCE\ >=\ 600
79 is used to efficiently monitor multiple file descriptors,
80 to see if any of them is, or becomes, "ready";
81 that is, to see whether I/O becomes possible,
82 or an "exceptional condition" has occurred on any of the file descriptors.
84 Its principal arguments are three "sets" of file descriptors:
85 \fIreadfds\fP, \fIwritefds\fP, and \fIexceptfds\fP.
86 Each set is declared as type
88 and its contents can be manipulated with the macros
94 A newly declared set should first be cleared using
97 modifies the contents of the sets according to the rules
98 described below; after calling
100 you can test if a file descriptor is still present in a set with the
104 returns nonzero if a specified file descriptor is present in a set
105 and zero if it is not.
107 removes a file descriptor from a set.
111 This set is watched to see if data is available for reading from any of
112 its file descriptors.
115 has returned, \fIreadfds\fP will be
116 cleared of all file descriptors except for those that
117 are immediately available for reading.
120 This set is watched to see if there is space to write data to any of
121 its file descriptors.
124 has returned, \fIwritefds\fP will be
125 cleared of all file descriptors except for those that
126 are immediately available for writing.
129 This set is watched for "exceptional conditions".
130 In practice, only one such exceptional condition is common:
131 the availability of \fIout-of-band\fP (OOB) data for reading
138 for more details about OOB data.
139 (One other less common case where
141 indicates an exceptional condition occurs with pseudoterminals
147 \fIexceptfds\fP will be cleared of all file descriptors except for those
148 for which an exceptional condition has occurred.
151 This is an integer one more than the maximum of any file descriptor in
153 In other words, while adding file descriptors to each of the sets,
154 you must calculate the maximum integer value of all of them,
155 then increment this value by one, and then pass this as \fInfds\fP.
158 This is the longest time
160 may wait before returning, even if nothing interesting happened.
161 If this value is passed as NULL, then
163 blocks indefinitely waiting for a file descriptor to become ready.
164 \fIutimeout\fP can be set to zero seconds, which causes
166 to return immediately, with information about the readiness
167 of file descriptors at the time of the call.
168 The structure \fIstruct timeval\fP is defined as:
173 time_t tv_sec; /* seconds */
174 long tv_usec; /* microseconds */
182 has the same meaning as
186 has nanosecond precision as follows:
191 long tv_sec; /* seconds */
192 long tv_nsec; /* nanoseconds */
198 This argument holds a set of signals that the kernel should unblock
199 (i.e., remove from the signal mask of the calling thread),
200 while the caller is blocked inside the
205 .BR sigprocmask (2)).
207 in which case the call does not modify the signal mask on
208 entry and exit to the function.
211 will then behave just like
213 .SS Combining signal and data events
215 is useful if you are waiting for a signal as well as
216 for file descriptor(s) to become ready for I/O.
217 Programs that receive signals
218 normally use the signal handler only to raise a global flag.
219 The global flag will indicate that the event must be processed
220 in the main loop of the program.
221 A signal will cause the
225 call to return with \fIerrno\fP set to \fBEINTR\fP.
226 This behavior is essential so that signals can be processed
227 in the main loop of the program, otherwise
229 would block indefinitely.
231 in the main loop will be a conditional to check the global flag.
233 what if a signal arrives after the conditional, but before the
238 would block indefinitely, even though an event is actually pending.
239 This race condition is solved by the
242 This call can be used to set the signal mask to a set of signals
243 that are to be received only within the
246 For instance, let us say that the event in question
247 was the exit of a child process.
248 Before the start of the main loop, we
249 would block \fBSIGCHLD\fP using
255 by using an empty signal mask.
256 Our program would look like:
259 static volatile sig_atomic_t got_SIGCHLD = 0;
262 child_sig_handler(int sig)
268 main(int argc, char *argv[])
270 sigset_t sigmask, empty_mask;
272 fd_set readfds, writefds, exceptfds;
275 sigemptyset(&sigmask);
276 sigaddset(&sigmask, SIGCHLD);
277 if (sigprocmask(SIG_BLOCK, &sigmask, NULL) == \-1) {
278 perror("sigprocmask");
283 sa.sa_handler = child_sig_handler;
284 sigemptyset(&sa.sa_mask);
285 if (sigaction(SIGCHLD, &sa, NULL) == \-1) {
290 sigemptyset(&empty_mask);
292 for (;;) { /* main loop */
293 /* Initialize readfds, writefds, and exceptfds
294 before the pselect() call. (Code omitted.) */
296 r = pselect(nfds, &readfds, &writefds, &exceptfds,
298 if (r == \-1 && errno != EINTR) {
305 /* Handle signalled event here; e.g., wait() for all
306 terminated children. (Code omitted.) */
309 /* main body of program */
314 So what is the point of
316 Can't I just read and write to my file descriptors whenever I want?
320 multiple descriptors at the same time and properly puts the process to
321 sleep if there is no activity.
322 UNIX programmers often find
323 themselves in a position where they have to handle I/O from more than one
324 file descriptor where the data flow may be intermittent.
325 If you were to merely create a sequence of
330 find that one of your calls may block waiting for data from/to a file
331 descriptor, while another file descriptor is unused though ready for I/O.
333 efficiently copes with this situation.
335 Many people who try to use
337 come across behavior that is
338 difficult to understand and produces nonportable or borderline results.
339 For instance, the above program is carefully written not to
340 block at any point, even though it does not set its file descriptors to
342 It is easy to introduce
343 subtle errors that will remove the advantage of using
345 so here is a list of essentials to watch for when using
349 You should always try to use
353 should have nothing to do if there is no data available.
355 depends on timeouts is not usually portable and is difficult to debug.
358 The value \fInfds\fP must be properly calculated for efficiency as
362 No file descriptor must be added to any set if you do not intend
363 to check its result after the
365 call, and respond appropriately.
371 returns, all file descriptors in all sets
372 should be checked to see if they are ready.
381 do \fInot\fP necessarily read/write the full amount of data
382 that you have requested.
383 If they do read/write the full amount, it's
384 because you have a low traffic load and a fast stream.
385 This is not always going to be the case.
386 You should cope with the case of your
387 functions managing to send or receive only a single byte.
390 Never read/write only in single bytes at a time unless you are really
391 sure that you have a small amount of data to process.
393 inefficient not to read/write as much data as you can buffer each time.
394 The buffers in the example below are 1024 bytes although they could
395 easily be made larger.
406 call can return \-1 with
411 set to \fBEAGAIN\fP (\fBEWOULDBLOCK\fP).
412 These results must be properly managed (not done properly above).
413 If your program is not going to receive any signals, then
414 it is unlikely you will get \fBEINTR\fP.
415 If your program does not set nonblocking I/O,
416 you will not get \fBEAGAIN\fP.
417 .\" Nonetheless, you should still cope with these errors for completeness.
426 with a buffer length of zero.
435 fail with errors other than those listed in \fB7.\fP,
436 or one of the input functions returns 0, indicating end of file,
437 then you should \fInot\fP pass that file descriptor to
440 In the example below,
441 I close the file descriptor immediately, and then set it to \-1
442 to prevent it being included in a set.
445 The timeout value must be initialized with each new call to
447 since some operating systems modify the structure.
449 however does not modify its timeout structure.
454 modifies its file descriptor sets,
455 if the call is being used in a loop,
456 then the sets must be reinitialized before each call.
457 .\" "I have heard" does not fill me with confidence, and doesn't
458 .\" belong in a man page, so I've commented this point out.
461 .\" I have heard that the Windows socket layer does not cope with OOB data
463 .\" It also does not cope with
465 .\" calls when no file descriptors are set at all.
466 .\" Having no file descriptors set is a useful
467 .\" way to sleep the process with subsecond precision by using the timeout.
468 .\" (See further on.)
470 On systems that do not have a
472 function, you can call
474 with a finite timeout and no file descriptors as
480 tv.tv_usec = 200000; /* 0.2 seconds */
481 select(0, NULL, NULL, NULL, &tv);
484 This is guaranteed to work only on UNIX systems, however.
488 returns the total number of file descriptors
489 still present in the file descriptor sets.
493 timed out, then the return value will be zero.
494 The file descriptors set should be all
495 empty (but may not be on some systems).
497 A return value of \-1 indicates an error, with \fIerrno\fP being
499 In the case of an error, the contents of the returned sets and
500 the \fIstruct timeout\fP contents are undefined and should not be used.
502 however never modifies \fIntimeout\fP.
505 all operating systems that support sockets also support
509 many problems in a portable and efficient way that naive programmers try
510 to solve in a more complicated manner using
511 threads, forking, IPCs, signals, memory sharing, and so on.
515 system call has the same functionality as
517 and is somewhat more efficient when monitoring sparse
518 file descriptor sets.
519 It is nowadays widely available, but historically was less portable than
524 API provides an interface that is more efficient than
528 when monitoring large numbers of file descriptors.
530 Here is an example that better demonstrates the true utility of
532 The listing below is a TCP forwarding program that forwards
533 from one TCP port to another.
539 #include <sys/time.h>
540 #include <sys/types.h>
543 #include <sys/socket.h>
544 #include <netinet/in.h>
545 #include <arpa/inet.h>
548 static int forward_port;
551 #define max(x,y) ((x) > (y) ? (x) : (y))
554 listen_socket(int listen_port)
556 struct sockaddr_in addr;
560 s = socket(AF_INET, SOCK_STREAM, 0);
566 if (setsockopt(s, SOL_SOCKET, SO_REUSEADDR,
567 &yes, sizeof(yes)) == \-1) {
568 perror("setsockopt");
572 memset(&addr, 0, sizeof(addr));
573 addr.sin_port = htons(listen_port);
574 addr.sin_family = AF_INET;
575 if (bind(s, (struct sockaddr *) &addr, sizeof(addr)) == \-1) {
580 printf("accepting connections on port %d\\n", listen_port);
586 connect_socket(int connect_port, char *address)
588 struct sockaddr_in addr;
591 s = socket(AF_INET, SOCK_STREAM, 0);
598 memset(&addr, 0, sizeof(addr));
599 addr.sin_port = htons(connect_port);
600 addr.sin_family = AF_INET;
602 if (!inet_aton(address, (struct in_addr *) &addr.sin_addr.s_addr)) {
603 perror("bad IP address format");
608 if (connect(s, (struct sockaddr *) &addr, sizeof(addr)) == \-1) {
610 shutdown(s, SHUT_RDWR);
617 #define SHUT_FD1 do { \\
619 shutdown(fd1, SHUT_RDWR); \\
625 #define SHUT_FD2 do { \\
627 shutdown(fd2, SHUT_RDWR); \\
633 #define BUF_SIZE 1024
636 main(int argc, char *argv[])
639 int fd1 = \-1, fd2 = \-1;
640 char buf1[BUF_SIZE], buf2[BUF_SIZE];
641 int buf1_avail, buf1_written;
642 int buf2_avail, buf2_written;
645 fprintf(stderr, "Usage\\n\\tfwd <listen\-port> "
646 "<forward\-to\-port> <forward\-to\-ip\-address>\\n");
650 signal(SIGPIPE, SIG_IGN);
652 forward_port = atoi(argv[2]);
654 h = listen_socket(atoi(argv[1]));
667 if (fd1 > 0 && buf1_avail < BUF_SIZE) {
669 nfds = max(nfds, fd1);
671 if (fd2 > 0 && buf2_avail < BUF_SIZE) {
673 nfds = max(nfds, fd2);
675 if (fd1 > 0 && buf2_avail \- buf2_written > 0) {
677 nfds = max(nfds, fd1);
679 if (fd2 > 0 && buf1_avail \- buf1_written > 0) {
681 nfds = max(nfds, fd2);
685 nfds = max(nfds, fd1);
689 nfds = max(nfds, fd2);
692 r = select(nfds + 1, &rd, &wr, &er, NULL);
694 if (r == \-1 && errno == EINTR)
702 if (FD_ISSET(h, &rd)) {
704 struct sockaddr_in client_addr;
706 memset(&client_addr, 0, l = sizeof(client_addr));
707 r = accept(h, (struct sockaddr *) &client_addr, &l);
713 buf1_avail = buf1_written = 0;
714 buf2_avail = buf2_written = 0;
716 fd2 = connect_socket(forward_port, argv[3]);
720 printf("connect from %s\\n",
721 inet_ntoa(client_addr.sin_addr));
725 /* NB: read oob data before normal reads */
728 if (FD_ISSET(fd1, &er)) {
731 r = recv(fd1, &c, 1, MSG_OOB);
735 send(fd2, &c, 1, MSG_OOB);
738 if (FD_ISSET(fd2, &er)) {
741 r = recv(fd2, &c, 1, MSG_OOB);
745 send(fd1, &c, 1, MSG_OOB);
748 if (FD_ISSET(fd1, &rd)) {
749 r = read(fd1, buf1 + buf1_avail,
750 BUF_SIZE \- buf1_avail);
757 if (FD_ISSET(fd2, &rd)) {
758 r = read(fd2, buf2 + buf2_avail,
759 BUF_SIZE \- buf2_avail);
766 if (FD_ISSET(fd1, &wr)) {
767 r = write(fd1, buf2 + buf2_written,
768 buf2_avail \- buf2_written);
775 if (FD_ISSET(fd2, &wr)) {
776 r = write(fd2, buf1 + buf1_written,
777 buf1_avail \- buf1_written);
784 /* check if write data has caught read data */
786 if (buf1_written == buf1_avail)
787 buf1_written = buf1_avail = 0;
788 if (buf2_written == buf2_avail)
789 buf2_written = buf2_avail = 0;
791 /* one side has closed the connection, keep
792 writing to the other side until empty */
794 if (fd1 < 0 && buf1_avail \- buf1_written == 0)
796 if (fd2 < 0 && buf2_avail \- buf2_written == 0)
803 The above program properly forwards most kinds of TCP connections
804 including OOB signal data transmitted by \fBtelnet\fP servers.
805 It handles the tricky problem of having data flow in both directions
807 You might think it more efficient to use a
809 call and devote a thread to each stream.
810 This becomes more tricky than you might suspect.
811 Another idea is to set nonblocking I/O using
813 This also has its problems because you end up using
814 inefficient timeouts.
816 The program does not handle more than one simultaneous connection at a
817 time, although it could easily be extended to do this with a linked list
818 of buffers\(emone for each connection.
820 connections cause the current connection to be dropped.
839 .\" This man page was written by Paul Sheer.