xref: /freebsd/sys/compat/linux/linux_util.c (revision 094fc1ed0f2627525c7b0342efcbad5be7a8546a)
1 /*-
2  * Copyright (c) 1994 Christos Zoulas
3  * Copyright (c) 1995 Frank van der Linden
4  * Copyright (c) 1995 Scott Bartram
5  * All rights reserved.
6  *
7  * Redistribution and use in source and binary forms, with or without
8  * modification, are permitted provided that the following conditions
9  * are met:
10  * 1. Redistributions of source code must retain the above copyright
11  *    notice, this list of conditions and the following disclaimer.
12  * 2. Redistributions in binary form must reproduce the above copyright
13  *    notice, this list of conditions and the following disclaimer in the
14  *    documentation and/or other materials provided with the distribution.
15  * 3. The name of the author may not be used to endorse or promote products
16  *    derived from this software without specific prior written permission
17  *
18  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
19  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
20  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
21  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
22  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
23  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
27  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28  *
29  *	from: svr4_util.c,v 1.5 1995/01/22 23:44:50 christos Exp
30  */
31 
32 #include <sys/cdefs.h>
33 __FBSDID("$FreeBSD$");
34 
35 #include "opt_compat.h"
36 
37 #include <sys/param.h>
38 #include <sys/bus.h>
39 #include <sys/fcntl.h>
40 #include <sys/lock.h>
41 #include <sys/malloc.h>
42 #include <sys/kernel.h>
43 #include <sys/linker_set.h>
44 #include <sys/mutex.h>
45 #include <sys/namei.h>
46 #include <sys/proc.h>
47 #include <sys/sdt.h>
48 #include <sys/syscallsubr.h>
49 #include <sys/systm.h>
50 #include <sys/vnode.h>
51 
52 #include <machine/stdarg.h>
53 
54 #include <compat/linux/linux_util.h>
55 
56 MALLOC_DEFINE(M_LINUX, "linux", "Linux mode structures");
57 MALLOC_DEFINE(M_EPOLL, "lepoll", "Linux events structures");
58 MALLOC_DEFINE(M_FUTEX, "futex", "Linux futexes");
59 MALLOC_DEFINE(M_FUTEX_WP, "futex wp", "Linux futex waiting proc");
60 
61 const char      linux_emul_path[] = "/compat/linux";
62 
63 /*
64  * Search an alternate path before passing pathname arguments on to
65  * system calls. Useful for keeping a separate 'emulation tree'.
66  *
67  * If cflag is set, we check if an attempt can be made to create the
68  * named file, i.e. we check if the directory it should be in exists.
69  */
70 int
71 linux_emul_convpath(struct thread *td, const char *path, enum uio_seg pathseg,
72     char **pbuf, int cflag, int dfd)
73 {
74 	int retval;
75 
76 	retval = kern_alternate_path(td, linux_emul_path, path, pathseg, pbuf,
77 	    cflag, dfd);
78 
79 	return (retval);
80 }
81 
82 void
83 linux_msg(const struct thread *td, const char *fmt, ...)
84 {
85 	va_list ap;
86 	struct proc *p;
87 
88 	p = td->td_proc;
89 	printf("linux: pid %d (%s): ", (int)p->p_pid, p->p_comm);
90 	va_start(ap, fmt);
91 	vprintf(fmt, ap);
92 	va_end(ap);
93 	printf("\n");
94 }
95 
96 struct device_element
97 {
98 	TAILQ_ENTRY(device_element) list;
99 	struct linux_device_handler entry;
100 };
101 
102 static TAILQ_HEAD(, device_element) devices =
103 	TAILQ_HEAD_INITIALIZER(devices);
104 
105 static struct linux_device_handler null_handler =
106 	{ "mem", "mem", "null", "null", 1, 3, 1};
107 
108 DATA_SET(linux_device_handler_set, null_handler);
109 
110 char *
111 linux_driver_get_name_dev(device_t dev)
112 {
113 	struct device_element *de;
114 	const char *device_name = device_get_name(dev);
115 
116 	if (device_name == NULL)
117 		return NULL;
118 	TAILQ_FOREACH(de, &devices, list) {
119 		if (strcmp(device_name, de->entry.bsd_driver_name) == 0)
120 			return (de->entry.linux_driver_name);
121 	}
122 
123 	return (NULL);
124 }
125 
126 int
127 linux_driver_get_major_minor(const char *node, int *major, int *minor)
128 {
129 	struct device_element *de;
130 	unsigned long devno;
131 
132 	if (node == NULL || major == NULL || minor == NULL)
133 		return 1;
134 
135 	if (strlen(node) > strlen("pts/") &&
136 	    strncmp(node, "pts/", strlen("pts/")) == 0) {
137 		/*
138 		 * Linux checks major and minors of the slave device
139 		 * to make sure it's a pty device, so let's make him
140 		 * believe it is.
141 		 */
142 		devno = strtoul(node + strlen("pts/"), NULL, 10);
143 		*major = 136 + (devno / 256);
144 		*minor = devno % 256;
145 
146 		return (0);
147 	}
148 
149 	if ((strlen(node) > strlen("drm/") &&
150 	    strncmp(node, "drm/", strlen("drm/")) == 0) ) {
151 		devno = strtoul(node + strlen("drm/"), NULL, 10);
152 		*major = 226 + (devno / 256);
153 		*minor = devno % 256;
154 		return (0);
155 	}
156 
157 
158 	TAILQ_FOREACH(de, &devices, list) {
159 		if (strcmp(node, de->entry.bsd_device_name) == 0) {
160 			*major = de->entry.linux_major;
161 			*minor = de->entry.linux_minor;
162 			return (0);
163 		}
164 	}
165 
166 	return (1);
167 }
168 
169 char *
170 linux_get_char_devices()
171 {
172 	struct device_element *de;
173 	char *temp, *string, *last;
174 	char formated[256];
175 	int current_size = 0, string_size = 1024;
176 
177 	string = malloc(string_size, M_LINUX, M_WAITOK);
178 	string[0] = '\000';
179 	last = "";
180 	TAILQ_FOREACH(de, &devices, list) {
181 		if (!de->entry.linux_char_device)
182 			continue;
183 		temp = string;
184 		if (strcmp(last, de->entry.bsd_driver_name) != 0) {
185 			last = de->entry.bsd_driver_name;
186 
187 			snprintf(formated, sizeof(formated), "%3d %s\n",
188 				 de->entry.linux_major,
189 				 de->entry.linux_device_name);
190 			if (strlen(formated) + current_size
191 			    >= string_size) {
192 				string_size *= 2;
193 				string = malloc(string_size,
194 				    M_LINUX, M_WAITOK);
195 				bcopy(temp, string, current_size);
196 				free(temp, M_LINUX);
197 			}
198 			strcat(string, formated);
199 			current_size = strlen(string);
200 		}
201 	}
202 
203 	return (string);
204 }
205 
206 void
207 linux_free_get_char_devices(char *string)
208 {
209 
210 	free(string, M_LINUX);
211 }
212 
213 static int linux_major_starting = 200;
214 
215 int
216 linux_device_register_handler(struct linux_device_handler *d)
217 {
218 	struct device_element *de;
219 
220 	if (d == NULL)
221 		return (EINVAL);
222 
223 	de = malloc(sizeof(*de), M_LINUX, M_WAITOK);
224 	if (d->linux_major < 0) {
225 		d->linux_major = linux_major_starting++;
226 	}
227 	bcopy(d, &de->entry, sizeof(*d));
228 
229 	/* Add the element to the list, sorted on span. */
230 	TAILQ_INSERT_TAIL(&devices, de, list);
231 
232 	return (0);
233 }
234 
235 int
236 linux_device_unregister_handler(struct linux_device_handler *d)
237 {
238 	struct device_element *de;
239 
240 	if (d == NULL)
241 		return (EINVAL);
242 
243 	TAILQ_FOREACH(de, &devices, list) {
244 		if (bcmp(d, &de->entry, sizeof(*d)) == 0) {
245 			TAILQ_REMOVE(&devices, de, list);
246 			free(de, M_LINUX);
247 
248 			return (0);
249 		}
250 	}
251 
252 	return (EINVAL);
253 }
254