1 .\" Copyright (c) 1983, 1991 The Regents of the University of California.
2 .\" All rights reserved.
4 .\" Redistribution and use in source and binary forms, with or without
5 .\" modification, are permitted provided that the following conditions
7 .\" 1. Redistributions of source code must retain the above copyright
8 .\" notice, this list of conditions and the following disclaimer.
9 .\" 2. Redistributions in binary form must reproduce the above copyright
10 .\" notice, this list of conditions and the following disclaimer in the
11 .\" documentation and/or other materials provided with the distribution.
12 .\" 3. All advertising materials mentioning features or use of this software
13 .\" must display the following acknowledgement:
14 .\" This product includes software developed by the University of
15 .\" California, Berkeley and its contributors.
16 .\" 4. Neither the name of the University nor the names of its contributors
17 .\" may be used to endorse or promote products derived from this software
18 .\" without specific prior written permission.
20 .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 .\" $Id: listen.2,v 1.6 1999/05/18 14:10:32 freitag Exp $
34 .\" Modified Fri Jul 23 22:07:54 1993 by Rik Faith <faith@cs.unc.edu>
35 .\" Modified 950727 by aeb, following a suggestion by Urs Thuermann
36 .\" <urs@isnogud.escape.de>
37 .\" Modified Tue Oct 22 08:11:14 EDT 1996 by Eric S. Raymond <esr@thyrsus.com>
38 .\" Modified 1998 by Andi Kleen
39 .\" Modified 11 May 2001 by Sam Varshavchik <mrsam@courier-mta.com>
41 .TH LISTEN 2 1993-07-23 "BSD Man Page" "Linux Programmer's Manual"
43 listen \- listen for connections on a socket
45 .B #include <sys/socket.h>
47 .BI "int listen(int " s ", int " backlog );
49 To accept connections, a socket is first created with
51 a willingness to accept incoming connections and a queue limit for incoming
52 connections are specified with
54 and then the connections are
59 call applies only to sockets of type
66 parameter defines the maximum length the queue of pending connections may
67 grow to. If a connection request arrives with the queue full the client
68 may receive an error with an indication of
70 or, if the underlying protocol supports retransmission, the request may be
71 ignored so that retries succeed.
75 parameter on TCP sockets changed with Linux 2.2.
76 Now it specifies the queue length for
78 established sockets waiting to be accepted, instead of the number of incomplete
79 connection requests. The maximum length of the queue for incomplete sockets
81 .B tcp_max_syn_backlog
83 When syncookies are enabled there is no logical maximum
84 length and this sysctl setting is ignored.
90 On success, zero is returned. On error, \-1 is returned, and
96 Another socket is already listening on the same port.
101 is not a valid descriptor.
109 The socket is not of a type that supports the
113 Single Unix, 4.4BSD, POSIX 1003.1g draft. The
115 function call first appeared in 4.2BSD.
117 If the socket is of type
124 (128 in Linux 2.0 & 2.2), it is silently truncated
127 Don't rely on this value in portable applications since BSD
128 (and some BSD-derived systems) limit the backlog to 5.