2 * Copyright (c) 1998 Mark Newton
3 * Copyright (c) 1996 Christos Zoulas.
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * 3. All advertising materials mentioning features or use of this software
15 * must display the following acknowledgement:
16 * This product includes software developed by Christos Zoulas.
17 * 4. The name of the author may not be used to endorse or promote products
18 * derived from this software without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
21 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
22 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
23 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
24 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
25 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
29 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 * In SVR4 unix domain sockets are referenced sometimes
34 * (in putmsg(2) for example) as a [device, inode] pair instead of a pathname.
35 * Since there is no iname() routine in the kernel, and we need access to
36 * a mapping from inode to pathname, we keep our own table. This is a simple
37 * linked list that contains the pathname, the [device, inode] pair, the
38 * file corresponding to that socket and the process. When the
39 * socket gets closed we remove the item from the list. The list gets loaded
40 * every time a stat(2) call finds a socket.
43 #include <sys/cdefs.h>
44 __FBSDID("$FreeBSD$");
46 #include <sys/param.h>
47 #include <sys/systm.h>
48 #include <sys/queue.h>
51 #include <sys/mutex.h>
52 #include <sys/socket.h>
53 #include <sys/socketvar.h>
54 #include <sys/sysproto.h>
58 #include <sys/malloc.h>
60 #include <compat/svr4/svr4.h>
61 #include <compat/svr4/svr4_types.h>
62 #include <compat/svr4/svr4_util.h>
63 #include <compat/svr4/svr4_socket.h>
64 #include <compat/svr4/svr4_signal.h>
65 #include <compat/svr4/svr4_sockmod.h>
66 #include <compat/svr4/svr4_proto.h>
69 svr4_find_socket(td, fp, dev, ino)
75 struct svr4_sockcache_entry *e;
76 void *cookie = ((struct socket *)fp->f_data)->so_emuldata;
78 if (svr4_str_initialized != 2) {
79 if (atomic_cmpset_acq_int(&svr4_str_initialized, 0, 1)) {
80 DPRINTF(("svr4_find_socket: uninitialized [%p,%d,%d]\n",
82 TAILQ_INIT(&svr4_head);
83 atomic_store_rel_int(&svr4_str_initialized, 2);
89 DPRINTF(("svr4_find_socket: [%p,%d,%d]: ", td, dev, ino));
90 TAILQ_FOREACH(e, &svr4_head, entries)
91 if (e->p == td->td_proc && e->dev == dev && e->ino == ino) {
93 if (e->cookie != NULL && e->cookie != cookie)
94 panic("svr4 socket cookie mismatch");
97 DPRINTF(("%s\n", e->sock.sun_path));
101 DPRINTF(("not found\n"));
107 * svr4_delete_socket() is in sys/dev/streams.c (because it's called by
108 * the streams "soo_close()" routine).
111 svr4_add_socket(td, path, st)
116 struct svr4_sockcache_entry *e;
122 * Wait for the TAILQ to be initialized. Only the very first CPU
123 * will succeed on the atomic_cmpset(). The other CPU's will spin
124 * until the first one finishes the initialization. Once the
125 * initialization is complete, the condition will always fail
126 * avoiding expensive atomic operations in the common case.
128 while (svr4_str_initialized != 2)
129 if (atomic_cmpset_acq_int(&svr4_str_initialized, 0, 1)) {
130 TAILQ_INIT(&svr4_head);
131 atomic_store_rel_int(&svr4_str_initialized, 2);
134 e = malloc(sizeof(*e), M_TEMP, M_WAITOK);
140 if ((error = copyinstr(path, e->sock.sun_path,
141 sizeof(e->sock.sun_path), &len)) != 0) {
143 DPRINTF(("svr4_add_socket: copyinstr failed %d\n", error));
148 e->sock.sun_family = AF_LOCAL;
149 e->sock.sun_len = len;
151 TAILQ_INSERT_HEAD(&svr4_head, e, entries);
153 DPRINTF(("svr4_add_socket: %s [%p,%d,%d]\n", e->sock.sun_path,
154 td->td_proc, e->dev, e->ino));
160 svr4_sys_socket(td, uap)
162 struct svr4_sys_socket_args *uap;
165 case SVR4_SOCK_DGRAM:
166 uap->type = SOCK_DGRAM;
169 case SVR4_SOCK_STREAM:
170 uap->type = SOCK_STREAM;
174 uap->type = SOCK_RAW;
178 uap->type = SOCK_RDM;
181 case SVR4_SOCK_SEQPACKET:
182 uap->type = SOCK_SEQPACKET;
187 return socket(td, (struct socket_args *)uap);