x86/cpu: Use pinning mask for CR4 bits needing to be 0
[linux/fpc-iii.git] / fs / dcookies.c
blob6eeb61100a095886e311685a5ba67a4d0b5d5fdc
1 // SPDX-License-Identifier: GPL-2.0-only
2 /*
3 * dcookies.c
5 * Copyright 2002 John Levon <levon@movementarian.org>
7 * Persistent cookie-path mappings. These are used by
8 * profilers to convert a per-task EIP value into something
9 * non-transitory that can be processed at a later date.
10 * This is done by locking the dentry/vfsmnt pair in the
11 * kernel until released by the tasks needing the persistent
12 * objects. The tag is simply an unsigned long that refers
13 * to the pair and can be looked up from userspace.
16 #include <linux/syscalls.h>
17 #include <linux/export.h>
18 #include <linux/slab.h>
19 #include <linux/list.h>
20 #include <linux/mount.h>
21 #include <linux/capability.h>
22 #include <linux/dcache.h>
23 #include <linux/mm.h>
24 #include <linux/err.h>
25 #include <linux/errno.h>
26 #include <linux/dcookies.h>
27 #include <linux/mutex.h>
28 #include <linux/path.h>
29 #include <linux/compat.h>
30 #include <linux/uaccess.h>
32 /* The dcookies are allocated from a kmem_cache and
33 * hashed onto a small number of lists. None of the
34 * code here is particularly performance critical
36 struct dcookie_struct {
37 struct path path;
38 struct list_head hash_list;
41 static LIST_HEAD(dcookie_users);
42 static DEFINE_MUTEX(dcookie_mutex);
43 static struct kmem_cache *dcookie_cache __read_mostly;
44 static struct list_head *dcookie_hashtable __read_mostly;
45 static size_t hash_size __read_mostly;
47 static inline int is_live(void)
49 return !(list_empty(&dcookie_users));
53 /* The dentry is locked, its address will do for the cookie */
54 static inline unsigned long dcookie_value(struct dcookie_struct * dcs)
56 return (unsigned long)dcs->path.dentry;
60 static size_t dcookie_hash(unsigned long dcookie)
62 return (dcookie >> L1_CACHE_SHIFT) & (hash_size - 1);
66 static struct dcookie_struct * find_dcookie(unsigned long dcookie)
68 struct dcookie_struct *found = NULL;
69 struct dcookie_struct * dcs;
70 struct list_head * pos;
71 struct list_head * list;
73 list = dcookie_hashtable + dcookie_hash(dcookie);
75 list_for_each(pos, list) {
76 dcs = list_entry(pos, struct dcookie_struct, hash_list);
77 if (dcookie_value(dcs) == dcookie) {
78 found = dcs;
79 break;
83 return found;
87 static void hash_dcookie(struct dcookie_struct * dcs)
89 struct list_head * list = dcookie_hashtable + dcookie_hash(dcookie_value(dcs));
90 list_add(&dcs->hash_list, list);
94 static struct dcookie_struct *alloc_dcookie(const struct path *path)
96 struct dcookie_struct *dcs = kmem_cache_alloc(dcookie_cache,
97 GFP_KERNEL);
98 struct dentry *d;
99 if (!dcs)
100 return NULL;
102 d = path->dentry;
103 spin_lock(&d->d_lock);
104 d->d_flags |= DCACHE_COOKIE;
105 spin_unlock(&d->d_lock);
107 dcs->path = *path;
108 path_get(path);
109 hash_dcookie(dcs);
110 return dcs;
114 /* This is the main kernel-side routine that retrieves the cookie
115 * value for a dentry/vfsmnt pair.
117 int get_dcookie(const struct path *path, unsigned long *cookie)
119 int err = 0;
120 struct dcookie_struct * dcs;
122 mutex_lock(&dcookie_mutex);
124 if (!is_live()) {
125 err = -EINVAL;
126 goto out;
129 if (path->dentry->d_flags & DCACHE_COOKIE) {
130 dcs = find_dcookie((unsigned long)path->dentry);
131 } else {
132 dcs = alloc_dcookie(path);
133 if (!dcs) {
134 err = -ENOMEM;
135 goto out;
139 *cookie = dcookie_value(dcs);
141 out:
142 mutex_unlock(&dcookie_mutex);
143 return err;
147 /* And here is where the userspace process can look up the cookie value
148 * to retrieve the path.
150 static int do_lookup_dcookie(u64 cookie64, char __user *buf, size_t len)
152 unsigned long cookie = (unsigned long)cookie64;
153 int err = -EINVAL;
154 char * kbuf;
155 char * path;
156 size_t pathlen;
157 struct dcookie_struct * dcs;
159 /* we could leak path information to users
160 * without dir read permission without this
162 if (!capable(CAP_SYS_ADMIN))
163 return -EPERM;
165 mutex_lock(&dcookie_mutex);
167 if (!is_live()) {
168 err = -EINVAL;
169 goto out;
172 if (!(dcs = find_dcookie(cookie)))
173 goto out;
175 err = -ENOMEM;
176 kbuf = kmalloc(PAGE_SIZE, GFP_KERNEL);
177 if (!kbuf)
178 goto out;
180 /* FIXME: (deleted) ? */
181 path = d_path(&dcs->path, kbuf, PAGE_SIZE);
183 mutex_unlock(&dcookie_mutex);
185 if (IS_ERR(path)) {
186 err = PTR_ERR(path);
187 goto out_free;
190 err = -ERANGE;
192 pathlen = kbuf + PAGE_SIZE - path;
193 if (pathlen <= len) {
194 err = pathlen;
195 if (copy_to_user(buf, path, pathlen))
196 err = -EFAULT;
199 out_free:
200 kfree(kbuf);
201 return err;
202 out:
203 mutex_unlock(&dcookie_mutex);
204 return err;
207 SYSCALL_DEFINE3(lookup_dcookie, u64, cookie64, char __user *, buf, size_t, len)
209 return do_lookup_dcookie(cookie64, buf, len);
212 #ifdef CONFIG_COMPAT
213 COMPAT_SYSCALL_DEFINE4(lookup_dcookie, u32, w0, u32, w1, char __user *, buf, compat_size_t, len)
215 #ifdef __BIG_ENDIAN
216 return do_lookup_dcookie(((u64)w0 << 32) | w1, buf, len);
217 #else
218 return do_lookup_dcookie(((u64)w1 << 32) | w0, buf, len);
219 #endif
221 #endif
223 static int dcookie_init(void)
225 struct list_head * d;
226 unsigned int i, hash_bits;
227 int err = -ENOMEM;
229 dcookie_cache = kmem_cache_create("dcookie_cache",
230 sizeof(struct dcookie_struct),
231 0, 0, NULL);
233 if (!dcookie_cache)
234 goto out;
236 dcookie_hashtable = kmalloc(PAGE_SIZE, GFP_KERNEL);
237 if (!dcookie_hashtable)
238 goto out_kmem;
240 err = 0;
243 * Find the power-of-two list-heads that can fit into the allocation..
244 * We don't guarantee that "sizeof(struct list_head)" is necessarily
245 * a power-of-two.
247 hash_size = PAGE_SIZE / sizeof(struct list_head);
248 hash_bits = 0;
249 do {
250 hash_bits++;
251 } while ((hash_size >> hash_bits) != 0);
252 hash_bits--;
255 * Re-calculate the actual number of entries and the mask
256 * from the number of bits we can fit.
258 hash_size = 1UL << hash_bits;
260 /* And initialize the newly allocated array */
261 d = dcookie_hashtable;
262 i = hash_size;
263 do {
264 INIT_LIST_HEAD(d);
265 d++;
266 i--;
267 } while (i);
269 out:
270 return err;
271 out_kmem:
272 kmem_cache_destroy(dcookie_cache);
273 goto out;
277 static void free_dcookie(struct dcookie_struct * dcs)
279 struct dentry *d = dcs->path.dentry;
281 spin_lock(&d->d_lock);
282 d->d_flags &= ~DCACHE_COOKIE;
283 spin_unlock(&d->d_lock);
285 path_put(&dcs->path);
286 kmem_cache_free(dcookie_cache, dcs);
290 static void dcookie_exit(void)
292 struct list_head * list;
293 struct list_head * pos;
294 struct list_head * pos2;
295 struct dcookie_struct * dcs;
296 size_t i;
298 for (i = 0; i < hash_size; ++i) {
299 list = dcookie_hashtable + i;
300 list_for_each_safe(pos, pos2, list) {
301 dcs = list_entry(pos, struct dcookie_struct, hash_list);
302 list_del(&dcs->hash_list);
303 free_dcookie(dcs);
307 kfree(dcookie_hashtable);
308 kmem_cache_destroy(dcookie_cache);
312 struct dcookie_user {
313 struct list_head next;
316 struct dcookie_user * dcookie_register(void)
318 struct dcookie_user * user;
320 mutex_lock(&dcookie_mutex);
322 user = kmalloc(sizeof(struct dcookie_user), GFP_KERNEL);
323 if (!user)
324 goto out;
326 if (!is_live() && dcookie_init())
327 goto out_free;
329 list_add(&user->next, &dcookie_users);
331 out:
332 mutex_unlock(&dcookie_mutex);
333 return user;
334 out_free:
335 kfree(user);
336 user = NULL;
337 goto out;
341 void dcookie_unregister(struct dcookie_user * user)
343 mutex_lock(&dcookie_mutex);
345 list_del(&user->next);
346 kfree(user);
348 if (!is_live())
349 dcookie_exit();
351 mutex_unlock(&dcookie_mutex);
354 EXPORT_SYMBOL_GPL(dcookie_register);
355 EXPORT_SYMBOL_GPL(dcookie_unregister);
356 EXPORT_SYMBOL_GPL(get_dcookie);