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/module.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 <asm/uaccess.h>
29 /* The dcookies are allocated from a kmem_cache and
30 * hashed onto a small number of lists. None of the
31 * code here is particularly performance critical
33 struct dcookie_struct {
34 struct dentry * dentry;
35 struct vfsmount * vfsmnt;
36 struct list_head hash_list;
39 static LIST_HEAD(dcookie_users);
40 static DEFINE_MUTEX(dcookie_mutex);
41 static struct kmem_cache *dcookie_cache __read_mostly;
42 static struct list_head *dcookie_hashtable __read_mostly;
43 static size_t hash_size __read_mostly;
45 static inline int is_live(void)
47 return !(list_empty(&dcookie_users));
51 /* The dentry is locked, its address will do for the cookie */
52 static inline unsigned long dcookie_value(struct dcookie_struct * dcs)
54 return (unsigned long)dcs->dentry;
58 static size_t dcookie_hash(unsigned long dcookie)
60 return (dcookie >> L1_CACHE_SHIFT) & (hash_size - 1);
64 static struct dcookie_struct * find_dcookie(unsigned long dcookie)
66 struct dcookie_struct *found = NULL;
67 struct dcookie_struct * dcs;
68 struct list_head * pos;
69 struct list_head * list;
71 list = dcookie_hashtable + dcookie_hash(dcookie);
73 list_for_each(pos, list) {
74 dcs = list_entry(pos, struct dcookie_struct, hash_list);
75 if (dcookie_value(dcs) == dcookie) {
85 static void hash_dcookie(struct dcookie_struct * dcs)
87 struct list_head * list = dcookie_hashtable + dcookie_hash(dcookie_value(dcs));
88 list_add(&dcs->hash_list, list);
92 static struct dcookie_struct * alloc_dcookie(struct dentry * dentry,
93 struct vfsmount * vfsmnt)
95 struct dcookie_struct * dcs = kmem_cache_alloc(dcookie_cache, GFP_KERNEL);
99 dentry->d_cookie = dcs;
101 dcs->dentry = dget(dentry);
102 dcs->vfsmnt = mntget(vfsmnt);
109 /* This is the main kernel-side routine that retrieves the cookie
110 * value for a dentry/vfsmnt pair.
112 int get_dcookie(struct dentry * dentry, struct vfsmount * vfsmnt,
113 unsigned long * cookie)
116 struct dcookie_struct * dcs;
118 mutex_lock(&dcookie_mutex);
125 dcs = dentry->d_cookie;
128 dcs = alloc_dcookie(dentry, vfsmnt);
135 *cookie = dcookie_value(dcs);
138 mutex_unlock(&dcookie_mutex);
143 /* And here is where the userspace process can look up the cookie value
144 * to retrieve the path.
146 asmlinkage long sys_lookup_dcookie(u64 cookie64, char __user * buf, size_t len)
148 unsigned long cookie = (unsigned long)cookie64;
153 struct dcookie_struct * dcs;
155 /* we could leak path information to users
156 * without dir read permission without this
158 if (!capable(CAP_SYS_ADMIN))
161 mutex_lock(&dcookie_mutex);
168 if (!(dcs = find_dcookie(cookie)))
172 kbuf = kmalloc(PAGE_SIZE, GFP_KERNEL);
176 /* FIXME: (deleted) ? */
177 path = d_path(dcs->dentry, dcs->vfsmnt, kbuf, PAGE_SIZE);
186 pathlen = kbuf + PAGE_SIZE - path;
187 if (pathlen <= len) {
189 if (copy_to_user(buf, path, pathlen))
196 mutex_unlock(&dcookie_mutex);
201 static int dcookie_init(void)
203 struct list_head * d;
204 unsigned int i, hash_bits;
207 dcookie_cache = kmem_cache_create("dcookie_cache",
208 sizeof(struct dcookie_struct),
214 dcookie_hashtable = kmalloc(PAGE_SIZE, GFP_KERNEL);
215 if (!dcookie_hashtable)
221 * Find the power-of-two list-heads that can fit into the allocation..
222 * We don't guarantee that "sizeof(struct list_head)" is necessarily
225 hash_size = PAGE_SIZE / sizeof(struct list_head);
229 } while ((hash_size >> hash_bits) != 0);
233 * Re-calculate the actual number of entries and the mask
234 * from the number of bits we can fit.
236 hash_size = 1UL << hash_bits;
238 /* And initialize the newly allocated array */
239 d = dcookie_hashtable;
250 kmem_cache_destroy(dcookie_cache);
255 static void free_dcookie(struct dcookie_struct * dcs)
257 dcs->dentry->d_cookie = NULL;
260 kmem_cache_free(dcookie_cache, dcs);
264 static void dcookie_exit(void)
266 struct list_head * list;
267 struct list_head * pos;
268 struct list_head * pos2;
269 struct dcookie_struct * dcs;
272 for (i = 0; i < hash_size; ++i) {
273 list = dcookie_hashtable + i;
274 list_for_each_safe(pos, pos2, list) {
275 dcs = list_entry(pos, struct dcookie_struct, hash_list);
276 list_del(&dcs->hash_list);
281 kfree(dcookie_hashtable);
282 kmem_cache_destroy(dcookie_cache);
286 struct dcookie_user {
287 struct list_head next;
290 struct dcookie_user * dcookie_register(void)
292 struct dcookie_user * user;
294 mutex_lock(&dcookie_mutex);
296 user = kmalloc(sizeof(struct dcookie_user), GFP_KERNEL);
300 if (!is_live() && dcookie_init())
303 list_add(&user->next, &dcookie_users);
306 mutex_unlock(&dcookie_mutex);
315 void dcookie_unregister(struct dcookie_user * user)
317 mutex_lock(&dcookie_mutex);
319 list_del(&user->next);
325 mutex_unlock(&dcookie_mutex);
328 EXPORT_SYMBOL_GPL(dcookie_register);
329 EXPORT_SYMBOL_GPL(dcookie_unregister);
330 EXPORT_SYMBOL_GPL(get_dcookie);