Blame view
fs/dcookies.c
6.9 KB
1da177e4c
|
1 2 3 4 5 6 7 8 9 10 11 12 13 |
/* * dcookies.c * * Copyright 2002 John Levon <levon@movementarian.org> * * Persistent cookie-path mappings. These are used by * profilers to convert a per-task EIP value into something * non-transitory that can be processed at a later date. * This is done by locking the dentry/vfsmnt pair in the * kernel until released by the tasks needing the persistent * objects. The tag is simply an unsigned long that refers * to the pair and can be looked up from userspace. */ |
1da177e4c
|
14 |
#include <linux/syscalls.h> |
630d9c472
|
15 |
#include <linux/export.h> |
1da177e4c
|
16 17 18 |
#include <linux/slab.h> #include <linux/list.h> #include <linux/mount.h> |
16f7e0fe2
|
19 |
#include <linux/capability.h> |
1da177e4c
|
20 21 |
#include <linux/dcache.h> #include <linux/mm.h> |
4e950f6f0
|
22 |
#include <linux/err.h> |
1da177e4c
|
23 24 |
#include <linux/errno.h> #include <linux/dcookies.h> |
353ab6e97
|
25 |
#include <linux/mutex.h> |
448678a0f
|
26 |
#include <linux/path.h> |
d5dc77bfe
|
27 |
#include <linux/compat.h> |
7c0f6ba68
|
28 |
#include <linux/uaccess.h> |
1da177e4c
|
29 30 31 32 33 34 |
/* The dcookies are allocated from a kmem_cache and * hashed onto a small number of lists. None of the * code here is particularly performance critical */ struct dcookie_struct { |
448678a0f
|
35 |
struct path path; |
1da177e4c
|
36 37 38 39 |
struct list_head hash_list; }; static LIST_HEAD(dcookie_users); |
353ab6e97
|
40 |
static DEFINE_MUTEX(dcookie_mutex); |
e18b890bb
|
41 |
static struct kmem_cache *dcookie_cache __read_mostly; |
fa3536cc1
|
42 43 |
static struct list_head *dcookie_hashtable __read_mostly; static size_t hash_size __read_mostly; |
1da177e4c
|
44 45 46 47 48 49 50 51 52 53 |
static inline int is_live(void) { return !(list_empty(&dcookie_users)); } /* The dentry is locked, its address will do for the cookie */ static inline unsigned long dcookie_value(struct dcookie_struct * dcs) { |
448678a0f
|
54 |
return (unsigned long)dcs->path.dentry; |
1da177e4c
|
55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 |
} static size_t dcookie_hash(unsigned long dcookie) { return (dcookie >> L1_CACHE_SHIFT) & (hash_size - 1); } static struct dcookie_struct * find_dcookie(unsigned long dcookie) { struct dcookie_struct *found = NULL; struct dcookie_struct * dcs; struct list_head * pos; struct list_head * list; list = dcookie_hashtable + dcookie_hash(dcookie); list_for_each(pos, list) { dcs = list_entry(pos, struct dcookie_struct, hash_list); if (dcookie_value(dcs) == dcookie) { found = dcs; break; } } return found; } static void hash_dcookie(struct dcookie_struct * dcs) { struct list_head * list = dcookie_hashtable + dcookie_hash(dcookie_value(dcs)); list_add(&dcs->hash_list, list); } |
71215a75c
|
90 |
static struct dcookie_struct *alloc_dcookie(const struct path *path) |
1da177e4c
|
91 |
{ |
448678a0f
|
92 93 |
struct dcookie_struct *dcs = kmem_cache_alloc(dcookie_cache, GFP_KERNEL); |
c2452f327
|
94 |
struct dentry *d; |
1da177e4c
|
95 96 |
if (!dcs) return NULL; |
c2452f327
|
97 98 99 100 |
d = path->dentry; spin_lock(&d->d_lock); d->d_flags |= DCACHE_COOKIE; spin_unlock(&d->d_lock); |
448678a0f
|
101 102 |
dcs->path = *path; path_get(path); |
1da177e4c
|
103 |
hash_dcookie(dcs); |
1da177e4c
|
104 105 106 107 108 109 110 |
return dcs; } /* This is the main kernel-side routine that retrieves the cookie * value for a dentry/vfsmnt pair. */ |
71215a75c
|
111 |
int get_dcookie(const struct path *path, unsigned long *cookie) |
1da177e4c
|
112 113 114 |
{ int err = 0; struct dcookie_struct * dcs; |
353ab6e97
|
115 |
mutex_lock(&dcookie_mutex); |
1da177e4c
|
116 117 118 119 120 |
if (!is_live()) { err = -EINVAL; goto out; } |
c2452f327
|
121 122 123 |
if (path->dentry->d_flags & DCACHE_COOKIE) { dcs = find_dcookie((unsigned long)path->dentry); } else { |
448678a0f
|
124 |
dcs = alloc_dcookie(path); |
c2452f327
|
125 126 127 128 |
if (!dcs) { err = -ENOMEM; goto out; } |
1da177e4c
|
129 130 131 132 133 |
} *cookie = dcookie_value(dcs); out: |
353ab6e97
|
134 |
mutex_unlock(&dcookie_mutex); |
1da177e4c
|
135 136 137 138 139 140 141 |
return err; } /* And here is where the userspace process can look up the cookie value * to retrieve the path. */ |
4a0fd5bf0
|
142 |
SYSCALL_DEFINE3(lookup_dcookie, u64, cookie64, char __user *, buf, size_t, len) |
1da177e4c
|
143 144 145 146 147 148 149 150 151 152 153 154 155 |
{ unsigned long cookie = (unsigned long)cookie64; int err = -EINVAL; char * kbuf; char * path; size_t pathlen; struct dcookie_struct * dcs; /* we could leak path information to users * without dir read permission without this */ if (!capable(CAP_SYS_ADMIN)) return -EPERM; |
353ab6e97
|
156 |
mutex_lock(&dcookie_mutex); |
1da177e4c
|
157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 |
if (!is_live()) { err = -EINVAL; goto out; } if (!(dcs = find_dcookie(cookie))) goto out; err = -ENOMEM; kbuf = kmalloc(PAGE_SIZE, GFP_KERNEL); if (!kbuf) goto out; /* FIXME: (deleted) ? */ |
cf28b4863
|
172 |
path = d_path(&dcs->path, kbuf, PAGE_SIZE); |
1da177e4c
|
173 |
|
fe47ae7f5
|
174 |
mutex_unlock(&dcookie_mutex); |
1da177e4c
|
175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 |
if (IS_ERR(path)) { err = PTR_ERR(path); goto out_free; } err = -ERANGE; pathlen = kbuf + PAGE_SIZE - path; if (pathlen <= len) { err = pathlen; if (copy_to_user(buf, path, pathlen)) err = -EFAULT; } out_free: kfree(kbuf); |
fe47ae7f5
|
191 |
return err; |
1da177e4c
|
192 |
out: |
353ab6e97
|
193 |
mutex_unlock(&dcookie_mutex); |
1da177e4c
|
194 195 |
return err; } |
1da177e4c
|
196 |
|
d5dc77bfe
|
197 |
#ifdef CONFIG_COMPAT |
d8d14bd09
|
198 |
COMPAT_SYSCALL_DEFINE4(lookup_dcookie, u32, w0, u32, w1, char __user *, buf, compat_size_t, len) |
d5dc77bfe
|
199 200 201 202 203 204 205 206 |
{ #ifdef __BIG_ENDIAN return sys_lookup_dcookie(((u64)w0 << 32) | w1, buf, len); #else return sys_lookup_dcookie(((u64)w1 << 32) | w0, buf, len); #endif } #endif |
1da177e4c
|
207 208 209 210 211 212 213 214 |
static int dcookie_init(void) { struct list_head * d; unsigned int i, hash_bits; int err = -ENOMEM; dcookie_cache = kmem_cache_create("dcookie_cache", sizeof(struct dcookie_struct), |
20c2df83d
|
215 |
0, 0, NULL); |
1da177e4c
|
216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 |
if (!dcookie_cache) goto out; dcookie_hashtable = kmalloc(PAGE_SIZE, GFP_KERNEL); if (!dcookie_hashtable) goto out_kmem; err = 0; /* * Find the power-of-two list-heads that can fit into the allocation.. * We don't guarantee that "sizeof(struct list_head)" is necessarily * a power-of-two. */ hash_size = PAGE_SIZE / sizeof(struct list_head); hash_bits = 0; do { hash_bits++; } while ((hash_size >> hash_bits) != 0); hash_bits--; /* * Re-calculate the actual number of entries and the mask * from the number of bits we can fit. */ hash_size = 1UL << hash_bits; /* And initialize the newly allocated array */ d = dcookie_hashtable; i = hash_size; do { INIT_LIST_HEAD(d); d++; i--; } while (i); out: return err; out_kmem: kmem_cache_destroy(dcookie_cache); goto out; } static void free_dcookie(struct dcookie_struct * dcs) { |
c2452f327
|
263 264 265 266 267 |
struct dentry *d = dcs->path.dentry; spin_lock(&d->d_lock); d->d_flags &= ~DCACHE_COOKIE; spin_unlock(&d->d_lock); |
448678a0f
|
268 |
path_put(&dcs->path); |
1da177e4c
|
269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 |
kmem_cache_free(dcookie_cache, dcs); } static void dcookie_exit(void) { struct list_head * list; struct list_head * pos; struct list_head * pos2; struct dcookie_struct * dcs; size_t i; for (i = 0; i < hash_size; ++i) { list = dcookie_hashtable + i; list_for_each_safe(pos, pos2, list) { dcs = list_entry(pos, struct dcookie_struct, hash_list); list_del(&dcs->hash_list); free_dcookie(dcs); } } kfree(dcookie_hashtable); kmem_cache_destroy(dcookie_cache); } struct dcookie_user { struct list_head next; }; struct dcookie_user * dcookie_register(void) { struct dcookie_user * user; |
353ab6e97
|
302 |
mutex_lock(&dcookie_mutex); |
1da177e4c
|
303 304 305 306 307 308 309 310 311 312 313 |
user = kmalloc(sizeof(struct dcookie_user), GFP_KERNEL); if (!user) goto out; if (!is_live() && dcookie_init()) goto out_free; list_add(&user->next, &dcookie_users); out: |
353ab6e97
|
314 |
mutex_unlock(&dcookie_mutex); |
1da177e4c
|
315 316 317 318 319 320 321 322 323 324 |
return user; out_free: kfree(user); user = NULL; goto out; } void dcookie_unregister(struct dcookie_user * user) { |
353ab6e97
|
325 |
mutex_lock(&dcookie_mutex); |
1da177e4c
|
326 327 328 329 330 331 |
list_del(&user->next); kfree(user); if (!is_live()) dcookie_exit(); |
353ab6e97
|
332 |
mutex_unlock(&dcookie_mutex); |
1da177e4c
|
333 334 335 336 337 |
} EXPORT_SYMBOL_GPL(dcookie_register); EXPORT_SYMBOL_GPL(dcookie_unregister); EXPORT_SYMBOL_GPL(get_dcookie); |