4 * Copyright 2002 John Levon <levon@movementarian.org>
6 * Persistent cookie-path mappings. These are used by
7 * profilers to convert a per-task EIP value into something
8 * non-transitory that can be processed at a later date.
9 * This is done by locking the dentry/vfsmnt pair in the
10 * kernel until released by the tasks needing the persistent
11 * objects. The tag is simply an unsigned long that refers
12 * to the pair and can be looked up from userspace.
15 #include <linux/syscalls.h>
16 #include <linux/export.h>
17 #include <linux/slab.h>
18 #include <linux/list.h>
19 #include <linux/mount.h>
20 #include <linux/capability.h>
21 #include <linux/dcache.h>
23 #include <linux/err.h>
24 #include <linux/errno.h>
25 #include <linux/dcookies.h>
26 #include <linux/mutex.h>
27 #include <linux/path.h>
28 #include <linux/compat.h>
29 #include <linux/uaccess.h>
31 /* The dcookies are allocated from a kmem_cache and
32 * hashed onto a small number of lists. None of the
33 * code here is particularly performance critical
35 struct dcookie_struct {
37 struct list_head hash_list;
40 static LIST_HEAD(dcookie_users);
41 static DEFINE_MUTEX(dcookie_mutex);
42 static struct kmem_cache *dcookie_cache __read_mostly;
43 static struct list_head *dcookie_hashtable __read_mostly;
44 static size_t hash_size __read_mostly;
46 static inline int is_live(void)
48 return !(list_empty(&dcookie_users));
52 /* The dentry is locked, its address will do for the cookie */
53 static inline unsigned long dcookie_value(struct dcookie_struct * dcs)
55 return (unsigned long)dcs->path.dentry;
59 static size_t dcookie_hash(unsigned long dcookie)
61 return (dcookie >> L1_CACHE_SHIFT) & (hash_size - 1);
65 static struct dcookie_struct * find_dcookie(unsigned long dcookie)
67 struct dcookie_struct *found = NULL;
68 struct dcookie_struct * dcs;
69 struct list_head * pos;
70 struct list_head * list;
72 list = dcookie_hashtable + dcookie_hash(dcookie);
74 list_for_each(pos, list) {
75 dcs = list_entry(pos, struct dcookie_struct, hash_list);
76 if (dcookie_value(dcs) == dcookie) {
86 static void hash_dcookie(struct dcookie_struct * dcs)
88 struct list_head * list = dcookie_hashtable + dcookie_hash(dcookie_value(dcs));
89 list_add(&dcs->hash_list, list);
93 static struct dcookie_struct *alloc_dcookie(const struct path *path)
95 struct dcookie_struct *dcs = kmem_cache_alloc(dcookie_cache,
102 spin_lock(&d->d_lock);
103 d->d_flags |= DCACHE_COOKIE;
104 spin_unlock(&d->d_lock);
113 /* This is the main kernel-side routine that retrieves the cookie
114 * value for a dentry/vfsmnt pair.
116 int get_dcookie(const struct path *path, unsigned long *cookie)
119 struct dcookie_struct * dcs;
121 mutex_lock(&dcookie_mutex);
128 if (path->dentry->d_flags & DCACHE_COOKIE) {
129 dcs = find_dcookie((unsigned long)path->dentry);
131 dcs = alloc_dcookie(path);
138 *cookie = dcookie_value(dcs);
141 mutex_unlock(&dcookie_mutex);
146 /* And here is where the userspace process can look up the cookie value
147 * to retrieve the path.
149 static int do_lookup_dcookie(u64 cookie64, char __user *buf, size_t len)
151 unsigned long cookie = (unsigned long)cookie64;
156 struct dcookie_struct * dcs;
158 /* we could leak path information to users
159 * without dir read permission without this
161 if (!capable(CAP_SYS_ADMIN))
164 mutex_lock(&dcookie_mutex);
171 if (!(dcs = find_dcookie(cookie)))
175 kbuf = kmalloc(PAGE_SIZE, GFP_KERNEL);
179 /* FIXME: (deleted) ? */
180 path = d_path(&dcs->path, kbuf, PAGE_SIZE);
182 mutex_unlock(&dcookie_mutex);
191 pathlen = kbuf + PAGE_SIZE - path;
192 if (pathlen <= len) {
194 if (copy_to_user(buf, path, pathlen))
202 mutex_unlock(&dcookie_mutex);
206 SYSCALL_DEFINE3(lookup_dcookie, u64, cookie64, char __user *, buf, size_t, len)
208 return do_lookup_dcookie(cookie64, buf, len);
212 COMPAT_SYSCALL_DEFINE4(lookup_dcookie, u32, w0, u32, w1, char __user *, buf, compat_size_t, len)
215 return do_lookup_dcookie(((u64)w0 << 32) | w1, buf, len);
217 return do_lookup_dcookie(((u64)w1 << 32) | w0, buf, len);
222 static int dcookie_init(void)
224 struct list_head * d;
225 unsigned int i, hash_bits;
228 dcookie_cache = kmem_cache_create("dcookie_cache",
229 sizeof(struct dcookie_struct),
235 dcookie_hashtable = kmalloc(PAGE_SIZE, GFP_KERNEL);
236 if (!dcookie_hashtable)
242 * Find the power-of-two list-heads that can fit into the allocation..
243 * We don't guarantee that "sizeof(struct list_head)" is necessarily
246 hash_size = PAGE_SIZE / sizeof(struct list_head);
250 } while ((hash_size >> hash_bits) != 0);
254 * Re-calculate the actual number of entries and the mask
255 * from the number of bits we can fit.
257 hash_size = 1UL << hash_bits;
259 /* And initialize the newly allocated array */
260 d = dcookie_hashtable;
271 kmem_cache_destroy(dcookie_cache);
276 static void free_dcookie(struct dcookie_struct * dcs)
278 struct dentry *d = dcs->path.dentry;
280 spin_lock(&d->d_lock);
281 d->d_flags &= ~DCACHE_COOKIE;
282 spin_unlock(&d->d_lock);
284 path_put(&dcs->path);
285 kmem_cache_free(dcookie_cache, dcs);
289 static void dcookie_exit(void)
291 struct list_head * list;
292 struct list_head * pos;
293 struct list_head * pos2;
294 struct dcookie_struct * dcs;
297 for (i = 0; i < hash_size; ++i) {
298 list = dcookie_hashtable + i;
299 list_for_each_safe(pos, pos2, list) {
300 dcs = list_entry(pos, struct dcookie_struct, hash_list);
301 list_del(&dcs->hash_list);
306 kfree(dcookie_hashtable);
307 kmem_cache_destroy(dcookie_cache);
311 struct dcookie_user {
312 struct list_head next;
315 struct dcookie_user * dcookie_register(void)
317 struct dcookie_user * user;
319 mutex_lock(&dcookie_mutex);
321 user = kmalloc(sizeof(struct dcookie_user), GFP_KERNEL);
325 if (!is_live() && dcookie_init())
328 list_add(&user->next, &dcookie_users);
331 mutex_unlock(&dcookie_mutex);
340 void dcookie_unregister(struct dcookie_user * user)
342 mutex_lock(&dcookie_mutex);
344 list_del(&user->next);
350 mutex_unlock(&dcookie_mutex);
353 EXPORT_SYMBOL_GPL(dcookie_register);
354 EXPORT_SYMBOL_GPL(dcookie_unregister);
355 EXPORT_SYMBOL_GPL(get_dcookie);