1 .\" Copyright (c) 1991, 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 .\" @(#)unix.4 8.1 (Berkeley) 6/9/93
40 .Nd UNIX-domain protocol family
47 protocol family is a collection of protocols
48 that provides local (on-machine) interprocess
49 communication through the normal
59 file system pathnames for addressing.
62 addresses are variable-length file system pathnames of
63 at most 104 characters.
67 .Bd -literal -offset indent
79 causes a socket file to be created in the file system.
82 removed when the socket is closed \(em
84 must be used to remove the file.
92 can be calculated by the macro
98 field must be terminated by a
100 character to be used with
110 protocol family does not support broadcast addressing or any form
113 matching on incoming messages.
114 All addresses are absolute- or relative-pathnames
118 Normal file system access-control mechanisms are also
119 applied when referencing pathnames; e.g., the destination
128 protocol family is comprised of simple
129 transport protocols that support the
135 sockets also support the communication of
137 file descriptors through the use of the
146 Any valid descriptor may be sent in a message.
147 The file descriptor(s) to be passed are described using a
149 that is defined in the include file
151 The type of the message is
153 and the data portion of the messages is an array of integers
154 representing the file descriptors to be passed.
155 The number of descriptors being passed is defined
156 by the length field of the message;
157 the length field is the sum of the size of the header
158 plus the size of the array of file descriptors.
160 The received descriptor is a
162 of the sender's descriptor, as if it were created with a call to
164 Per-process descriptor flags, set with
168 passed to a receiver.
169 Descriptors that are awaiting delivery, or that are
170 purposely not received, are automatically closed by the system
171 when the destination socket is closed.
173 The effective credentials (i.e., the user ID and group list) of a
176 socket may be obtained using the
179 This may be used by a server to obtain and verify the credentials of
180 its client, and vice versa by the client to verify the credentials
182 These will arrive in the form of a filled in
186 The credentials presented to the server (the
188 caller) are those of the client when it called
190 the credentials presented to the client (the
192 caller) are those of the server when it called
194 This mechanism is reliable; there is no way for either party to influence
195 the credentials presented to its peer except by calling the appropriate
200 under different effective credentials.
203 domain sockets support a number of socket options which can be set with
207 .Bl -tag -width ".Dv LOCAL_CONNWAIT"
209 This option may be enabled on a
214 This option provides a mechanism for the receiver to
215 receive the credentials of the process as a
222 structure points to a buffer that contains a
224 structure followed by a variable length
226 structure, defined in
231 uid_t sc_uid; /* real user id */
232 uid_t sc_euid; /* effective user id */
233 gid_t sc_gid; /* real group id */
234 gid_t sc_egid; /* effective group id */
235 int sc_ngroups; /* number of supplemental groups */
236 gid_t sc_groups[1]; /* variable length */
242 macro computes the size of the
244 structure for a specified number
248 fields have the following values:
250 cmsg_len = CMSG_LEN(SOCKCREDSIZE(ngroups))
251 cmsg_level = SOL_SOCKET
252 cmsg_type = SCM_CREDS
254 .It Dv LOCAL_CONNWAIT
257 sockets, this option causes the
259 function to block until
261 has been called on the listening socket.
267 .%T "An Introductory 4.3 BSD Interprocess Communication Tutorial"
272 .%T "An Advanced 4.3 BSD Interprocess Communication Tutorial"