1 .\" Copyright (c) 1983, 1993
2 .\" The Regents of the University of California. 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 .\" @(#)connect.2 8.1 (Berkeley) 6/4/93
40 .Nd initiate a connection on a socket
47 .Fn connect "int s" "const struct sockaddr *name" "socklen_t namelen"
54 this call specifies the peer with which the socket is to be associated;
55 this address is that to which datagrams are to be sent,
56 and the only address from which datagrams are to be received.
57 If the socket is of type
59 this call attempts to make a connection to
61 The other socket is specified by
63 which is an address in the communications space of the socket.
64 Each communications space interprets the
66 parameter in its own way.
67 Generally, stream sockets may successfully
69 only once; datagram sockets may use
71 multiple times to change their association.
72 Datagram sockets may dissolve the association
73 by connecting to an invalid address, such as a null address.
83 is not a valid descriptor.
86 is a descriptor for a file, not a socket.
87 .It Bq Er EADDRNOTAVAIL
88 The specified address is not available on this machine.
89 .It Bq Er EAFNOSUPPORT
90 Addresses in the specified address family cannot be used with this socket.
92 The socket is already connected.
94 Connection establishment timed out without establishing a connection.
95 .It Bq Er ECONNREFUSED
96 The attempt to connect was forcefully rejected.
98 The network isn't reachable from this host.
100 The address is already in use.
104 parameter specifies an area outside
105 the process address space.
106 .It Bq Er EINPROGRESS
107 The socket is non-blocking
108 and the connection cannot
109 be completed immediately.
112 for completion by selecting the socket for writing.
114 The socket is non-blocking
115 and a previous connection attempt
116 has not yet been completed.
119 The following errors are specific to connecting names in the UNIX domain.
120 These errors may not apply in future versions of the UNIX IPC domain.
123 A component of the path prefix is not a directory.
124 .It Bq Er ENAMETOOLONG
125 A component of a pathname exceeded 255 characters,
126 or an entire path name exceeded 1023 characters.
128 The named socket does not exist.
130 Search permission is denied for a component of the path prefix.
132 Write access to the named socket is denied.
134 Too many symbolic links were encountered in translating the pathname.
145 function call appeared in