]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * linux/fs/namei.c | |
3 | * | |
4 | * Copyright (C) 1991, 1992 Linus Torvalds | |
5 | */ | |
6 | ||
7 | /* | |
8 | * Some corrections by tytso. | |
9 | */ | |
10 | ||
11 | /* [Feb 1997 T. Schoebel-Theuer] Complete rewrite of the pathname | |
12 | * lookup logic. | |
13 | */ | |
14 | /* [Feb-Apr 2000, AV] Rewrite to the new namespace architecture. | |
15 | */ | |
16 | ||
17 | #include <linux/init.h> | |
18 | #include <linux/module.h> | |
19 | #include <linux/slab.h> | |
20 | #include <linux/fs.h> | |
21 | #include <linux/namei.h> | |
22 | #include <linux/quotaops.h> | |
23 | #include <linux/pagemap.h> | |
24 | #include <linux/fsnotify.h> | |
25 | #include <linux/personality.h> | |
26 | #include <linux/security.h> | |
27 | #include <linux/syscalls.h> | |
28 | #include <linux/mount.h> | |
29 | #include <linux/audit.h> | |
30 | #include <linux/capability.h> | |
31 | #include <linux/file.h> | |
32 | #include <linux/fcntl.h> | |
33 | #include <linux/device_cgroup.h> | |
34 | #include <asm/uaccess.h> | |
35 | ||
36 | #define ACC_MODE(x) ("\000\004\002\006"[(x)&O_ACCMODE]) | |
37 | ||
38 | /* [Feb-1997 T. Schoebel-Theuer] | |
39 | * Fundamental changes in the pathname lookup mechanisms (namei) | |
40 | * were necessary because of omirr. The reason is that omirr needs | |
41 | * to know the _real_ pathname, not the user-supplied one, in case | |
42 | * of symlinks (and also when transname replacements occur). | |
43 | * | |
44 | * The new code replaces the old recursive symlink resolution with | |
45 | * an iterative one (in case of non-nested symlink chains). It does | |
46 | * this with calls to <fs>_follow_link(). | |
47 | * As a side effect, dir_namei(), _namei() and follow_link() are now | |
48 | * replaced with a single function lookup_dentry() that can handle all | |
49 | * the special cases of the former code. | |
50 | * | |
51 | * With the new dcache, the pathname is stored at each inode, at least as | |
52 | * long as the refcount of the inode is positive. As a side effect, the | |
53 | * size of the dcache depends on the inode cache and thus is dynamic. | |
54 | * | |
55 | * [29-Apr-1998 C. Scott Ananian] Updated above description of symlink | |
56 | * resolution to correspond with current state of the code. | |
57 | * | |
58 | * Note that the symlink resolution is not *completely* iterative. | |
59 | * There is still a significant amount of tail- and mid- recursion in | |
60 | * the algorithm. Also, note that <fs>_readlink() is not used in | |
61 | * lookup_dentry(): lookup_dentry() on the result of <fs>_readlink() | |
62 | * may return different results than <fs>_follow_link(). Many virtual | |
63 | * filesystems (including /proc) exhibit this behavior. | |
64 | */ | |
65 | ||
66 | /* [24-Feb-97 T. Schoebel-Theuer] Side effects caused by new implementation: | |
67 | * New symlink semantics: when open() is called with flags O_CREAT | O_EXCL | |
68 | * and the name already exists in form of a symlink, try to create the new | |
69 | * name indicated by the symlink. The old code always complained that the | |
70 | * name already exists, due to not following the symlink even if its target | |
71 | * is nonexistent. The new semantics affects also mknod() and link() when | |
72 | * the name is a symlink pointing to a non-existant name. | |
73 | * | |
74 | * I don't know which semantics is the right one, since I have no access | |
75 | * to standards. But I found by trial that HP-UX 9.0 has the full "new" | |
76 | * semantics implemented, while SunOS 4.1.1 and Solaris (SunOS 5.4) have the | |
77 | * "old" one. Personally, I think the new semantics is much more logical. | |
78 | * Note that "ln old new" where "new" is a symlink pointing to a non-existing | |
79 | * file does succeed in both HP-UX and SunOs, but not in Solaris | |
80 | * and in the old Linux semantics. | |
81 | */ | |
82 | ||
83 | /* [16-Dec-97 Kevin Buhr] For security reasons, we change some symlink | |
84 | * semantics. See the comments in "open_namei" and "do_link" below. | |
85 | * | |
86 | * [10-Sep-98 Alan Modra] Another symlink change. | |
87 | */ | |
88 | ||
89 | /* [Feb-Apr 2000 AV] Complete rewrite. Rules for symlinks: | |
90 | * inside the path - always follow. | |
91 | * in the last component in creation/removal/renaming - never follow. | |
92 | * if LOOKUP_FOLLOW passed - follow. | |
93 | * if the pathname has trailing slashes - follow. | |
94 | * otherwise - don't follow. | |
95 | * (applied in that order). | |
96 | * | |
97 | * [Jun 2000 AV] Inconsistent behaviour of open() in case if flags==O_CREAT | |
98 | * restored for 2.4. This is the last surviving part of old 4.2BSD bug. | |
99 | * During the 2.4 we need to fix the userland stuff depending on it - | |
100 | * hopefully we will be able to get rid of that wart in 2.5. So far only | |
101 | * XEmacs seems to be relying on it... | |
102 | */ | |
103 | /* | |
104 | * [Sep 2001 AV] Single-semaphore locking scheme (kudos to David Holland) | |
105 | * implemented. Let's see if raised priority of ->s_vfs_rename_mutex gives | |
106 | * any extra contention... | |
107 | */ | |
108 | ||
109 | static int __link_path_walk(const char *name, struct nameidata *nd); | |
110 | ||
111 | /* In order to reduce some races, while at the same time doing additional | |
112 | * checking and hopefully speeding things up, we copy filenames to the | |
113 | * kernel data space before using them.. | |
114 | * | |
115 | * POSIX.1 2.4: an empty pathname is invalid (ENOENT). | |
116 | * PATH_MAX includes the nul terminator --RR. | |
117 | */ | |
118 | static int do_getname(const char __user *filename, char *page) | |
119 | { | |
120 | int retval; | |
121 | unsigned long len = PATH_MAX; | |
122 | ||
123 | if (!segment_eq(get_fs(), KERNEL_DS)) { | |
124 | if ((unsigned long) filename >= TASK_SIZE) | |
125 | return -EFAULT; | |
126 | if (TASK_SIZE - (unsigned long) filename < PATH_MAX) | |
127 | len = TASK_SIZE - (unsigned long) filename; | |
128 | } | |
129 | ||
130 | retval = strncpy_from_user(page, filename, len); | |
131 | if (retval > 0) { | |
132 | if (retval < len) | |
133 | return 0; | |
134 | return -ENAMETOOLONG; | |
135 | } else if (!retval) | |
136 | retval = -ENOENT; | |
137 | return retval; | |
138 | } | |
139 | ||
140 | char * getname(const char __user * filename) | |
141 | { | |
142 | char *tmp, *result; | |
143 | ||
144 | result = ERR_PTR(-ENOMEM); | |
145 | tmp = __getname(); | |
146 | if (tmp) { | |
147 | int retval = do_getname(filename, tmp); | |
148 | ||
149 | result = tmp; | |
150 | if (retval < 0) { | |
151 | __putname(tmp); | |
152 | result = ERR_PTR(retval); | |
153 | } | |
154 | } | |
155 | audit_getname(result); | |
156 | return result; | |
157 | } | |
158 | ||
159 | #ifdef CONFIG_AUDITSYSCALL | |
160 | void putname(const char *name) | |
161 | { | |
162 | if (unlikely(!audit_dummy_context())) | |
163 | audit_putname(name); | |
164 | else | |
165 | __putname(name); | |
166 | } | |
167 | EXPORT_SYMBOL(putname); | |
168 | #endif | |
169 | ||
170 | ||
171 | /** | |
172 | * generic_permission - check for access rights on a Posix-like filesystem | |
173 | * @inode: inode to check access rights for | |
174 | * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC) | |
175 | * @check_acl: optional callback to check for Posix ACLs | |
176 | * | |
177 | * Used to check for read/write/execute permissions on a file. | |
178 | * We use "fsuid" for this, letting us set arbitrary permissions | |
179 | * for filesystem access without changing the "normal" uids which | |
180 | * are used for other things.. | |
181 | */ | |
182 | int generic_permission(struct inode *inode, int mask, | |
183 | int (*check_acl)(struct inode *inode, int mask)) | |
184 | { | |
185 | umode_t mode = inode->i_mode; | |
186 | ||
187 | mask &= MAY_READ | MAY_WRITE | MAY_EXEC; | |
188 | ||
189 | if (current_fsuid() == inode->i_uid) | |
190 | mode >>= 6; | |
191 | else { | |
192 | if (IS_POSIXACL(inode) && (mode & S_IRWXG) && check_acl) { | |
193 | int error = check_acl(inode, mask); | |
194 | if (error == -EACCES) | |
195 | goto check_capabilities; | |
196 | else if (error != -EAGAIN) | |
197 | return error; | |
198 | } | |
199 | ||
200 | if (in_group_p(inode->i_gid)) | |
201 | mode >>= 3; | |
202 | } | |
203 | ||
204 | /* | |
205 | * If the DACs are ok we don't need any capability check. | |
206 | */ | |
207 | if ((mask & ~mode) == 0) | |
208 | return 0; | |
209 | ||
210 | check_capabilities: | |
211 | /* | |
212 | * Read/write DACs are always overridable. | |
213 | * Executable DACs are overridable if at least one exec bit is set. | |
214 | */ | |
215 | if (!(mask & MAY_EXEC) || execute_ok(inode)) | |
216 | if (capable(CAP_DAC_OVERRIDE)) | |
217 | return 0; | |
218 | ||
219 | /* | |
220 | * Searching includes executable on directories, else just read. | |
221 | */ | |
222 | if (mask == MAY_READ || (S_ISDIR(inode->i_mode) && !(mask & MAY_WRITE))) | |
223 | if (capable(CAP_DAC_READ_SEARCH)) | |
224 | return 0; | |
225 | ||
226 | return -EACCES; | |
227 | } | |
228 | ||
229 | int inode_permission(struct inode *inode, int mask) | |
230 | { | |
231 | int retval; | |
232 | ||
233 | if (mask & MAY_WRITE) { | |
234 | umode_t mode = inode->i_mode; | |
235 | ||
236 | /* | |
237 | * Nobody gets write access to a read-only fs. | |
238 | */ | |
239 | if (IS_RDONLY(inode) && | |
240 | (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode))) | |
241 | return -EROFS; | |
242 | ||
243 | /* | |
244 | * Nobody gets write access to an immutable file. | |
245 | */ | |
246 | if (IS_IMMUTABLE(inode)) | |
247 | return -EACCES; | |
248 | } | |
249 | ||
250 | /* Ordinary permission routines do not understand MAY_APPEND. */ | |
251 | if (inode->i_op && inode->i_op->permission) | |
252 | retval = inode->i_op->permission(inode, mask); | |
253 | else | |
254 | retval = generic_permission(inode, mask, NULL); | |
255 | ||
256 | if (retval) | |
257 | return retval; | |
258 | ||
259 | retval = devcgroup_inode_permission(inode, mask); | |
260 | if (retval) | |
261 | return retval; | |
262 | ||
263 | return security_inode_permission(inode, | |
264 | mask & (MAY_READ|MAY_WRITE|MAY_EXEC|MAY_APPEND)); | |
265 | } | |
266 | ||
267 | /** | |
268 | * vfs_permission - check for access rights to a given path | |
269 | * @nd: lookup result that describes the path | |
270 | * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC) | |
271 | * | |
272 | * Used to check for read/write/execute permissions on a path. | |
273 | * We use "fsuid" for this, letting us set arbitrary permissions | |
274 | * for filesystem access without changing the "normal" uids which | |
275 | * are used for other things. | |
276 | */ | |
277 | int vfs_permission(struct nameidata *nd, int mask) | |
278 | { | |
279 | return inode_permission(nd->path.dentry->d_inode, mask); | |
280 | } | |
281 | ||
282 | /** | |
283 | * file_permission - check for additional access rights to a given file | |
284 | * @file: file to check access rights for | |
285 | * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC) | |
286 | * | |
287 | * Used to check for read/write/execute permissions on an already opened | |
288 | * file. | |
289 | * | |
290 | * Note: | |
291 | * Do not use this function in new code. All access checks should | |
292 | * be done using vfs_permission(). | |
293 | */ | |
294 | int file_permission(struct file *file, int mask) | |
295 | { | |
296 | return inode_permission(file->f_path.dentry->d_inode, mask); | |
297 | } | |
298 | ||
299 | /* | |
300 | * get_write_access() gets write permission for a file. | |
301 | * put_write_access() releases this write permission. | |
302 | * This is used for regular files. | |
303 | * We cannot support write (and maybe mmap read-write shared) accesses and | |
304 | * MAP_DENYWRITE mmappings simultaneously. The i_writecount field of an inode | |
305 | * can have the following values: | |
306 | * 0: no writers, no VM_DENYWRITE mappings | |
307 | * < 0: (-i_writecount) vm_area_structs with VM_DENYWRITE set exist | |
308 | * > 0: (i_writecount) users are writing to the file. | |
309 | * | |
310 | * Normally we operate on that counter with atomic_{inc,dec} and it's safe | |
311 | * except for the cases where we don't hold i_writecount yet. Then we need to | |
312 | * use {get,deny}_write_access() - these functions check the sign and refuse | |
313 | * to do the change if sign is wrong. Exclusion between them is provided by | |
314 | * the inode->i_lock spinlock. | |
315 | */ | |
316 | ||
317 | int get_write_access(struct inode * inode) | |
318 | { | |
319 | spin_lock(&inode->i_lock); | |
320 | if (atomic_read(&inode->i_writecount) < 0) { | |
321 | spin_unlock(&inode->i_lock); | |
322 | return -ETXTBSY; | |
323 | } | |
324 | atomic_inc(&inode->i_writecount); | |
325 | spin_unlock(&inode->i_lock); | |
326 | ||
327 | return 0; | |
328 | } | |
329 | ||
330 | int deny_write_access(struct file * file) | |
331 | { | |
332 | struct inode *inode = file->f_path.dentry->d_inode; | |
333 | ||
334 | spin_lock(&inode->i_lock); | |
335 | if (atomic_read(&inode->i_writecount) > 0) { | |
336 | spin_unlock(&inode->i_lock); | |
337 | return -ETXTBSY; | |
338 | } | |
339 | atomic_dec(&inode->i_writecount); | |
340 | spin_unlock(&inode->i_lock); | |
341 | ||
342 | return 0; | |
343 | } | |
344 | ||
345 | /** | |
346 | * path_get - get a reference to a path | |
347 | * @path: path to get the reference to | |
348 | * | |
349 | * Given a path increment the reference count to the dentry and the vfsmount. | |
350 | */ | |
351 | void path_get(struct path *path) | |
352 | { | |
353 | mntget(path->mnt); | |
354 | dget(path->dentry); | |
355 | } | |
356 | EXPORT_SYMBOL(path_get); | |
357 | ||
358 | /** | |
359 | * path_put - put a reference to a path | |
360 | * @path: path to put the reference to | |
361 | * | |
362 | * Given a path decrement the reference count to the dentry and the vfsmount. | |
363 | */ | |
364 | void path_put(struct path *path) | |
365 | { | |
366 | dput(path->dentry); | |
367 | mntput(path->mnt); | |
368 | } | |
369 | EXPORT_SYMBOL(path_put); | |
370 | ||
371 | /** | |
372 | * release_open_intent - free up open intent resources | |
373 | * @nd: pointer to nameidata | |
374 | */ | |
375 | void release_open_intent(struct nameidata *nd) | |
376 | { | |
377 | if (nd->intent.open.file->f_path.dentry == NULL) | |
378 | put_filp(nd->intent.open.file); | |
379 | else | |
380 | fput(nd->intent.open.file); | |
381 | } | |
382 | ||
383 | static inline struct dentry * | |
384 | do_revalidate(struct dentry *dentry, struct nameidata *nd) | |
385 | { | |
386 | int status = dentry->d_op->d_revalidate(dentry, nd); | |
387 | if (unlikely(status <= 0)) { | |
388 | /* | |
389 | * The dentry failed validation. | |
390 | * If d_revalidate returned 0 attempt to invalidate | |
391 | * the dentry otherwise d_revalidate is asking us | |
392 | * to return a fail status. | |
393 | */ | |
394 | if (!status) { | |
395 | if (!d_invalidate(dentry)) { | |
396 | dput(dentry); | |
397 | dentry = NULL; | |
398 | } | |
399 | } else { | |
400 | dput(dentry); | |
401 | dentry = ERR_PTR(status); | |
402 | } | |
403 | } | |
404 | return dentry; | |
405 | } | |
406 | ||
407 | /* | |
408 | * Internal lookup() using the new generic dcache. | |
409 | * SMP-safe | |
410 | */ | |
411 | static struct dentry * cached_lookup(struct dentry * parent, struct qstr * name, struct nameidata *nd) | |
412 | { | |
413 | struct dentry * dentry = __d_lookup(parent, name); | |
414 | ||
415 | /* lockess __d_lookup may fail due to concurrent d_move() | |
416 | * in some unrelated directory, so try with d_lookup | |
417 | */ | |
418 | if (!dentry) | |
419 | dentry = d_lookup(parent, name); | |
420 | ||
421 | if (dentry && dentry->d_op && dentry->d_op->d_revalidate) | |
422 | dentry = do_revalidate(dentry, nd); | |
423 | ||
424 | return dentry; | |
425 | } | |
426 | ||
427 | /* | |
428 | * Short-cut version of permission(), for calling by | |
429 | * path_walk(), when dcache lock is held. Combines parts | |
430 | * of permission() and generic_permission(), and tests ONLY for | |
431 | * MAY_EXEC permission. | |
432 | * | |
433 | * If appropriate, check DAC only. If not appropriate, or | |
434 | * short-cut DAC fails, then call permission() to do more | |
435 | * complete permission check. | |
436 | */ | |
437 | static int exec_permission_lite(struct inode *inode) | |
438 | { | |
439 | umode_t mode = inode->i_mode; | |
440 | ||
441 | if (inode->i_op && inode->i_op->permission) | |
442 | return -EAGAIN; | |
443 | ||
444 | if (current_fsuid() == inode->i_uid) | |
445 | mode >>= 6; | |
446 | else if (in_group_p(inode->i_gid)) | |
447 | mode >>= 3; | |
448 | ||
449 | if (mode & MAY_EXEC) | |
450 | goto ok; | |
451 | ||
452 | if ((inode->i_mode & S_IXUGO) && capable(CAP_DAC_OVERRIDE)) | |
453 | goto ok; | |
454 | ||
455 | if (S_ISDIR(inode->i_mode) && capable(CAP_DAC_OVERRIDE)) | |
456 | goto ok; | |
457 | ||
458 | if (S_ISDIR(inode->i_mode) && capable(CAP_DAC_READ_SEARCH)) | |
459 | goto ok; | |
460 | ||
461 | return -EACCES; | |
462 | ok: | |
463 | return security_inode_permission(inode, MAY_EXEC); | |
464 | } | |
465 | ||
466 | /* | |
467 | * This is called when everything else fails, and we actually have | |
468 | * to go to the low-level filesystem to find out what we should do.. | |
469 | * | |
470 | * We get the directory semaphore, and after getting that we also | |
471 | * make sure that nobody added the entry to the dcache in the meantime.. | |
472 | * SMP-safe | |
473 | */ | |
474 | static struct dentry * real_lookup(struct dentry * parent, struct qstr * name, struct nameidata *nd) | |
475 | { | |
476 | struct dentry * result; | |
477 | struct inode *dir = parent->d_inode; | |
478 | ||
479 | mutex_lock(&dir->i_mutex); | |
480 | /* | |
481 | * First re-do the cached lookup just in case it was created | |
482 | * while we waited for the directory semaphore.. | |
483 | * | |
484 | * FIXME! This could use version numbering or similar to | |
485 | * avoid unnecessary cache lookups. | |
486 | * | |
487 | * The "dcache_lock" is purely to protect the RCU list walker | |
488 | * from concurrent renames at this point (we mustn't get false | |
489 | * negatives from the RCU list walk here, unlike the optimistic | |
490 | * fast walk). | |
491 | * | |
492 | * so doing d_lookup() (with seqlock), instead of lockfree __d_lookup | |
493 | */ | |
494 | result = d_lookup(parent, name); | |
495 | if (!result) { | |
496 | struct dentry *dentry; | |
497 | ||
498 | /* Don't create child dentry for a dead directory. */ | |
499 | result = ERR_PTR(-ENOENT); | |
500 | if (IS_DEADDIR(dir)) | |
501 | goto out_unlock; | |
502 | ||
503 | dentry = d_alloc(parent, name); | |
504 | result = ERR_PTR(-ENOMEM); | |
505 | if (dentry) { | |
506 | result = dir->i_op->lookup(dir, dentry, nd); | |
507 | if (result) | |
508 | dput(dentry); | |
509 | else | |
510 | result = dentry; | |
511 | } | |
512 | out_unlock: | |
513 | mutex_unlock(&dir->i_mutex); | |
514 | return result; | |
515 | } | |
516 | ||
517 | /* | |
518 | * Uhhuh! Nasty case: the cache was re-populated while | |
519 | * we waited on the semaphore. Need to revalidate. | |
520 | */ | |
521 | mutex_unlock(&dir->i_mutex); | |
522 | if (result->d_op && result->d_op->d_revalidate) { | |
523 | result = do_revalidate(result, nd); | |
524 | if (!result) | |
525 | result = ERR_PTR(-ENOENT); | |
526 | } | |
527 | return result; | |
528 | } | |
529 | ||
530 | /* SMP-safe */ | |
531 | static __always_inline void | |
532 | walk_init_root(const char *name, struct nameidata *nd) | |
533 | { | |
534 | struct fs_struct *fs = current->fs; | |
535 | ||
536 | read_lock(&fs->lock); | |
537 | nd->path = fs->root; | |
538 | path_get(&fs->root); | |
539 | read_unlock(&fs->lock); | |
540 | } | |
541 | ||
542 | /* | |
543 | * Wrapper to retry pathname resolution whenever the underlying | |
544 | * file system returns an ESTALE. | |
545 | * | |
546 | * Retry the whole path once, forcing real lookup requests | |
547 | * instead of relying on the dcache. | |
548 | */ | |
549 | static __always_inline int link_path_walk(const char *name, struct nameidata *nd) | |
550 | { | |
551 | struct path save = nd->path; | |
552 | int result; | |
553 | ||
554 | /* make sure the stuff we saved doesn't go away */ | |
555 | path_get(&save); | |
556 | ||
557 | result = __link_path_walk(name, nd); | |
558 | if (result == -ESTALE) { | |
559 | /* nd->path had been dropped */ | |
560 | nd->path = save; | |
561 | path_get(&nd->path); | |
562 | nd->flags |= LOOKUP_REVAL; | |
563 | result = __link_path_walk(name, nd); | |
564 | } | |
565 | ||
566 | path_put(&save); | |
567 | ||
568 | return result; | |
569 | } | |
570 | ||
571 | static __always_inline int __vfs_follow_link(struct nameidata *nd, const char *link) | |
572 | { | |
573 | int res = 0; | |
574 | char *name; | |
575 | if (IS_ERR(link)) | |
576 | goto fail; | |
577 | ||
578 | if (*link == '/') { | |
579 | path_put(&nd->path); | |
580 | walk_init_root(link, nd); | |
581 | } | |
582 | res = link_path_walk(link, nd); | |
583 | if (nd->depth || res || nd->last_type!=LAST_NORM) | |
584 | return res; | |
585 | /* | |
586 | * If it is an iterative symlinks resolution in open_namei() we | |
587 | * have to copy the last component. And all that crap because of | |
588 | * bloody create() on broken symlinks. Furrfu... | |
589 | */ | |
590 | name = __getname(); | |
591 | if (unlikely(!name)) { | |
592 | path_put(&nd->path); | |
593 | return -ENOMEM; | |
594 | } | |
595 | strcpy(name, nd->last.name); | |
596 | nd->last.name = name; | |
597 | return 0; | |
598 | fail: | |
599 | path_put(&nd->path); | |
600 | return PTR_ERR(link); | |
601 | } | |
602 | ||
603 | static void path_put_conditional(struct path *path, struct nameidata *nd) | |
604 | { | |
605 | dput(path->dentry); | |
606 | if (path->mnt != nd->path.mnt) | |
607 | mntput(path->mnt); | |
608 | } | |
609 | ||
610 | static inline void path_to_nameidata(struct path *path, struct nameidata *nd) | |
611 | { | |
612 | dput(nd->path.dentry); | |
613 | if (nd->path.mnt != path->mnt) | |
614 | mntput(nd->path.mnt); | |
615 | nd->path.mnt = path->mnt; | |
616 | nd->path.dentry = path->dentry; | |
617 | } | |
618 | ||
619 | static __always_inline int __do_follow_link(struct path *path, struct nameidata *nd) | |
620 | { | |
621 | int error; | |
622 | void *cookie; | |
623 | struct dentry *dentry = path->dentry; | |
624 | ||
625 | touch_atime(path->mnt, dentry); | |
626 | nd_set_link(nd, NULL); | |
627 | ||
628 | if (path->mnt != nd->path.mnt) { | |
629 | path_to_nameidata(path, nd); | |
630 | dget(dentry); | |
631 | } | |
632 | mntget(path->mnt); | |
633 | cookie = dentry->d_inode->i_op->follow_link(dentry, nd); | |
634 | error = PTR_ERR(cookie); | |
635 | if (!IS_ERR(cookie)) { | |
636 | char *s = nd_get_link(nd); | |
637 | error = 0; | |
638 | if (s) | |
639 | error = __vfs_follow_link(nd, s); | |
640 | if (dentry->d_inode->i_op->put_link) | |
641 | dentry->d_inode->i_op->put_link(dentry, nd, cookie); | |
642 | } | |
643 | path_put(path); | |
644 | ||
645 | return error; | |
646 | } | |
647 | ||
648 | /* | |
649 | * This limits recursive symlink follows to 8, while | |
650 | * limiting consecutive symlinks to 40. | |
651 | * | |
652 | * Without that kind of total limit, nasty chains of consecutive | |
653 | * symlinks can cause almost arbitrarily long lookups. | |
654 | */ | |
655 | static inline int do_follow_link(struct path *path, struct nameidata *nd) | |
656 | { | |
657 | int err = -ELOOP; | |
658 | if (current->link_count >= MAX_NESTED_LINKS) | |
659 | goto loop; | |
660 | if (current->total_link_count >= 40) | |
661 | goto loop; | |
662 | BUG_ON(nd->depth >= MAX_NESTED_LINKS); | |
663 | cond_resched(); | |
664 | err = security_inode_follow_link(path->dentry, nd); | |
665 | if (err) | |
666 | goto loop; | |
667 | current->link_count++; | |
668 | current->total_link_count++; | |
669 | nd->depth++; | |
670 | err = __do_follow_link(path, nd); | |
671 | current->link_count--; | |
672 | nd->depth--; | |
673 | return err; | |
674 | loop: | |
675 | path_put_conditional(path, nd); | |
676 | path_put(&nd->path); | |
677 | return err; | |
678 | } | |
679 | ||
680 | int follow_up(struct vfsmount **mnt, struct dentry **dentry) | |
681 | { | |
682 | struct vfsmount *parent; | |
683 | struct dentry *mountpoint; | |
684 | spin_lock(&vfsmount_lock); | |
685 | parent=(*mnt)->mnt_parent; | |
686 | if (parent == *mnt) { | |
687 | spin_unlock(&vfsmount_lock); | |
688 | return 0; | |
689 | } | |
690 | mntget(parent); | |
691 | mountpoint=dget((*mnt)->mnt_mountpoint); | |
692 | spin_unlock(&vfsmount_lock); | |
693 | dput(*dentry); | |
694 | *dentry = mountpoint; | |
695 | mntput(*mnt); | |
696 | *mnt = parent; | |
697 | return 1; | |
698 | } | |
699 | ||
700 | /* no need for dcache_lock, as serialization is taken care in | |
701 | * namespace.c | |
702 | */ | |
703 | static int __follow_mount(struct path *path) | |
704 | { | |
705 | int res = 0; | |
706 | while (d_mountpoint(path->dentry)) { | |
707 | struct vfsmount *mounted = lookup_mnt(path->mnt, path->dentry); | |
708 | if (!mounted) | |
709 | break; | |
710 | dput(path->dentry); | |
711 | if (res) | |
712 | mntput(path->mnt); | |
713 | path->mnt = mounted; | |
714 | path->dentry = dget(mounted->mnt_root); | |
715 | res = 1; | |
716 | } | |
717 | return res; | |
718 | } | |
719 | ||
720 | static void follow_mount(struct vfsmount **mnt, struct dentry **dentry) | |
721 | { | |
722 | while (d_mountpoint(*dentry)) { | |
723 | struct vfsmount *mounted = lookup_mnt(*mnt, *dentry); | |
724 | if (!mounted) | |
725 | break; | |
726 | dput(*dentry); | |
727 | mntput(*mnt); | |
728 | *mnt = mounted; | |
729 | *dentry = dget(mounted->mnt_root); | |
730 | } | |
731 | } | |
732 | ||
733 | /* no need for dcache_lock, as serialization is taken care in | |
734 | * namespace.c | |
735 | */ | |
736 | int follow_down(struct vfsmount **mnt, struct dentry **dentry) | |
737 | { | |
738 | struct vfsmount *mounted; | |
739 | ||
740 | mounted = lookup_mnt(*mnt, *dentry); | |
741 | if (mounted) { | |
742 | dput(*dentry); | |
743 | mntput(*mnt); | |
744 | *mnt = mounted; | |
745 | *dentry = dget(mounted->mnt_root); | |
746 | return 1; | |
747 | } | |
748 | return 0; | |
749 | } | |
750 | ||
751 | static __always_inline void follow_dotdot(struct nameidata *nd) | |
752 | { | |
753 | struct fs_struct *fs = current->fs; | |
754 | ||
755 | while(1) { | |
756 | struct vfsmount *parent; | |
757 | struct dentry *old = nd->path.dentry; | |
758 | ||
759 | read_lock(&fs->lock); | |
760 | if (nd->path.dentry == fs->root.dentry && | |
761 | nd->path.mnt == fs->root.mnt) { | |
762 | read_unlock(&fs->lock); | |
763 | break; | |
764 | } | |
765 | read_unlock(&fs->lock); | |
766 | spin_lock(&dcache_lock); | |
767 | if (nd->path.dentry != nd->path.mnt->mnt_root) { | |
768 | nd->path.dentry = dget(nd->path.dentry->d_parent); | |
769 | spin_unlock(&dcache_lock); | |
770 | dput(old); | |
771 | break; | |
772 | } | |
773 | spin_unlock(&dcache_lock); | |
774 | spin_lock(&vfsmount_lock); | |
775 | parent = nd->path.mnt->mnt_parent; | |
776 | if (parent == nd->path.mnt) { | |
777 | spin_unlock(&vfsmount_lock); | |
778 | break; | |
779 | } | |
780 | mntget(parent); | |
781 | nd->path.dentry = dget(nd->path.mnt->mnt_mountpoint); | |
782 | spin_unlock(&vfsmount_lock); | |
783 | dput(old); | |
784 | mntput(nd->path.mnt); | |
785 | nd->path.mnt = parent; | |
786 | } | |
787 | follow_mount(&nd->path.mnt, &nd->path.dentry); | |
788 | } | |
789 | ||
790 | /* | |
791 | * It's more convoluted than I'd like it to be, but... it's still fairly | |
792 | * small and for now I'd prefer to have fast path as straight as possible. | |
793 | * It _is_ time-critical. | |
794 | */ | |
795 | static int do_lookup(struct nameidata *nd, struct qstr *name, | |
796 | struct path *path) | |
797 | { | |
798 | struct vfsmount *mnt = nd->path.mnt; | |
799 | struct dentry *dentry = __d_lookup(nd->path.dentry, name); | |
800 | ||
801 | if (!dentry) | |
802 | goto need_lookup; | |
803 | if (dentry->d_op && dentry->d_op->d_revalidate) | |
804 | goto need_revalidate; | |
805 | done: | |
806 | path->mnt = mnt; | |
807 | path->dentry = dentry; | |
808 | __follow_mount(path); | |
809 | return 0; | |
810 | ||
811 | need_lookup: | |
812 | dentry = real_lookup(nd->path.dentry, name, nd); | |
813 | if (IS_ERR(dentry)) | |
814 | goto fail; | |
815 | goto done; | |
816 | ||
817 | need_revalidate: | |
818 | dentry = do_revalidate(dentry, nd); | |
819 | if (!dentry) | |
820 | goto need_lookup; | |
821 | if (IS_ERR(dentry)) | |
822 | goto fail; | |
823 | goto done; | |
824 | ||
825 | fail: | |
826 | return PTR_ERR(dentry); | |
827 | } | |
828 | ||
829 | /* | |
830 | * Name resolution. | |
831 | * This is the basic name resolution function, turning a pathname into | |
832 | * the final dentry. We expect 'base' to be positive and a directory. | |
833 | * | |
834 | * Returns 0 and nd will have valid dentry and mnt on success. | |
835 | * Returns error and drops reference to input namei data on failure. | |
836 | */ | |
837 | static int __link_path_walk(const char *name, struct nameidata *nd) | |
838 | { | |
839 | struct path next; | |
840 | struct inode *inode; | |
841 | int err; | |
842 | unsigned int lookup_flags = nd->flags; | |
843 | ||
844 | while (*name=='/') | |
845 | name++; | |
846 | if (!*name) | |
847 | goto return_reval; | |
848 | ||
849 | inode = nd->path.dentry->d_inode; | |
850 | if (nd->depth) | |
851 | lookup_flags = LOOKUP_FOLLOW | (nd->flags & LOOKUP_CONTINUE); | |
852 | ||
853 | /* At this point we know we have a real path component. */ | |
854 | for(;;) { | |
855 | unsigned long hash; | |
856 | struct qstr this; | |
857 | unsigned int c; | |
858 | ||
859 | nd->flags |= LOOKUP_CONTINUE; | |
860 | err = exec_permission_lite(inode); | |
861 | if (err == -EAGAIN) | |
862 | err = vfs_permission(nd, MAY_EXEC); | |
863 | if (err) | |
864 | break; | |
865 | ||
866 | this.name = name; | |
867 | c = *(const unsigned char *)name; | |
868 | ||
869 | hash = init_name_hash(); | |
870 | do { | |
871 | name++; | |
872 | hash = partial_name_hash(c, hash); | |
873 | c = *(const unsigned char *)name; | |
874 | } while (c && (c != '/')); | |
875 | this.len = name - (const char *) this.name; | |
876 | this.hash = end_name_hash(hash); | |
877 | ||
878 | /* remove trailing slashes? */ | |
879 | if (!c) | |
880 | goto last_component; | |
881 | while (*++name == '/'); | |
882 | if (!*name) | |
883 | goto last_with_slashes; | |
884 | ||
885 | /* | |
886 | * "." and ".." are special - ".." especially so because it has | |
887 | * to be able to know about the current root directory and | |
888 | * parent relationships. | |
889 | */ | |
890 | if (this.name[0] == '.') switch (this.len) { | |
891 | default: | |
892 | break; | |
893 | case 2: | |
894 | if (this.name[1] != '.') | |
895 | break; | |
896 | follow_dotdot(nd); | |
897 | inode = nd->path.dentry->d_inode; | |
898 | /* fallthrough */ | |
899 | case 1: | |
900 | continue; | |
901 | } | |
902 | /* | |
903 | * See if the low-level filesystem might want | |
904 | * to use its own hash.. | |
905 | */ | |
906 | if (nd->path.dentry->d_op && nd->path.dentry->d_op->d_hash) { | |
907 | err = nd->path.dentry->d_op->d_hash(nd->path.dentry, | |
908 | &this); | |
909 | if (err < 0) | |
910 | break; | |
911 | } | |
912 | /* This does the actual lookups.. */ | |
913 | err = do_lookup(nd, &this, &next); | |
914 | if (err) | |
915 | break; | |
916 | ||
917 | err = -ENOENT; | |
918 | inode = next.dentry->d_inode; | |
919 | if (!inode) | |
920 | goto out_dput; | |
921 | err = -ENOTDIR; | |
922 | if (!inode->i_op) | |
923 | goto out_dput; | |
924 | ||
925 | if (inode->i_op->follow_link) { | |
926 | err = do_follow_link(&next, nd); | |
927 | if (err) | |
928 | goto return_err; | |
929 | err = -ENOENT; | |
930 | inode = nd->path.dentry->d_inode; | |
931 | if (!inode) | |
932 | break; | |
933 | err = -ENOTDIR; | |
934 | if (!inode->i_op) | |
935 | break; | |
936 | } else | |
937 | path_to_nameidata(&next, nd); | |
938 | err = -ENOTDIR; | |
939 | if (!inode->i_op->lookup) | |
940 | break; | |
941 | continue; | |
942 | /* here ends the main loop */ | |
943 | ||
944 | last_with_slashes: | |
945 | lookup_flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY; | |
946 | last_component: | |
947 | /* Clear LOOKUP_CONTINUE iff it was previously unset */ | |
948 | nd->flags &= lookup_flags | ~LOOKUP_CONTINUE; | |
949 | if (lookup_flags & LOOKUP_PARENT) | |
950 | goto lookup_parent; | |
951 | if (this.name[0] == '.') switch (this.len) { | |
952 | default: | |
953 | break; | |
954 | case 2: | |
955 | if (this.name[1] != '.') | |
956 | break; | |
957 | follow_dotdot(nd); | |
958 | inode = nd->path.dentry->d_inode; | |
959 | /* fallthrough */ | |
960 | case 1: | |
961 | goto return_reval; | |
962 | } | |
963 | if (nd->path.dentry->d_op && nd->path.dentry->d_op->d_hash) { | |
964 | err = nd->path.dentry->d_op->d_hash(nd->path.dentry, | |
965 | &this); | |
966 | if (err < 0) | |
967 | break; | |
968 | } | |
969 | err = do_lookup(nd, &this, &next); | |
970 | if (err) | |
971 | break; | |
972 | inode = next.dentry->d_inode; | |
973 | if ((lookup_flags & LOOKUP_FOLLOW) | |
974 | && inode && inode->i_op && inode->i_op->follow_link) { | |
975 | err = do_follow_link(&next, nd); | |
976 | if (err) | |
977 | goto return_err; | |
978 | inode = nd->path.dentry->d_inode; | |
979 | } else | |
980 | path_to_nameidata(&next, nd); | |
981 | err = -ENOENT; | |
982 | if (!inode) | |
983 | break; | |
984 | if (lookup_flags & LOOKUP_DIRECTORY) { | |
985 | err = -ENOTDIR; | |
986 | if (!inode->i_op || !inode->i_op->lookup) | |
987 | break; | |
988 | } | |
989 | goto return_base; | |
990 | lookup_parent: | |
991 | nd->last = this; | |
992 | nd->last_type = LAST_NORM; | |
993 | if (this.name[0] != '.') | |
994 | goto return_base; | |
995 | if (this.len == 1) | |
996 | nd->last_type = LAST_DOT; | |
997 | else if (this.len == 2 && this.name[1] == '.') | |
998 | nd->last_type = LAST_DOTDOT; | |
999 | else | |
1000 | goto return_base; | |
1001 | return_reval: | |
1002 | /* | |
1003 | * We bypassed the ordinary revalidation routines. | |
1004 | * We may need to check the cached dentry for staleness. | |
1005 | */ | |
1006 | if (nd->path.dentry && nd->path.dentry->d_sb && | |
1007 | (nd->path.dentry->d_sb->s_type->fs_flags & FS_REVAL_DOT)) { | |
1008 | err = -ESTALE; | |
1009 | /* Note: we do not d_invalidate() */ | |
1010 | if (!nd->path.dentry->d_op->d_revalidate( | |
1011 | nd->path.dentry, nd)) | |
1012 | break; | |
1013 | } | |
1014 | return_base: | |
1015 | return 0; | |
1016 | out_dput: | |
1017 | path_put_conditional(&next, nd); | |
1018 | break; | |
1019 | } | |
1020 | path_put(&nd->path); | |
1021 | return_err: | |
1022 | return err; | |
1023 | } | |
1024 | ||
1025 | static int path_walk(const char *name, struct nameidata *nd) | |
1026 | { | |
1027 | current->total_link_count = 0; | |
1028 | return link_path_walk(name, nd); | |
1029 | } | |
1030 | ||
1031 | /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */ | |
1032 | static int do_path_lookup(int dfd, const char *name, | |
1033 | unsigned int flags, struct nameidata *nd) | |
1034 | { | |
1035 | int retval = 0; | |
1036 | int fput_needed; | |
1037 | struct file *file; | |
1038 | struct fs_struct *fs = current->fs; | |
1039 | ||
1040 | nd->last_type = LAST_ROOT; /* if there are only slashes... */ | |
1041 | nd->flags = flags; | |
1042 | nd->depth = 0; | |
1043 | ||
1044 | if (*name=='/') { | |
1045 | read_lock(&fs->lock); | |
1046 | nd->path = fs->root; | |
1047 | path_get(&fs->root); | |
1048 | read_unlock(&fs->lock); | |
1049 | } else if (dfd == AT_FDCWD) { | |
1050 | read_lock(&fs->lock); | |
1051 | nd->path = fs->pwd; | |
1052 | path_get(&fs->pwd); | |
1053 | read_unlock(&fs->lock); | |
1054 | } else { | |
1055 | struct dentry *dentry; | |
1056 | ||
1057 | file = fget_light(dfd, &fput_needed); | |
1058 | retval = -EBADF; | |
1059 | if (!file) | |
1060 | goto out_fail; | |
1061 | ||
1062 | dentry = file->f_path.dentry; | |
1063 | ||
1064 | retval = -ENOTDIR; | |
1065 | if (!S_ISDIR(dentry->d_inode->i_mode)) | |
1066 | goto fput_fail; | |
1067 | ||
1068 | retval = file_permission(file, MAY_EXEC); | |
1069 | if (retval) | |
1070 | goto fput_fail; | |
1071 | ||
1072 | nd->path = file->f_path; | |
1073 | path_get(&file->f_path); | |
1074 | ||
1075 | fput_light(file, fput_needed); | |
1076 | } | |
1077 | ||
1078 | retval = path_walk(name, nd); | |
1079 | if (unlikely(!retval && !audit_dummy_context() && nd->path.dentry && | |
1080 | nd->path.dentry->d_inode)) | |
1081 | audit_inode(name, nd->path.dentry); | |
1082 | out_fail: | |
1083 | return retval; | |
1084 | ||
1085 | fput_fail: | |
1086 | fput_light(file, fput_needed); | |
1087 | goto out_fail; | |
1088 | } | |
1089 | ||
1090 | int path_lookup(const char *name, unsigned int flags, | |
1091 | struct nameidata *nd) | |
1092 | { | |
1093 | return do_path_lookup(AT_FDCWD, name, flags, nd); | |
1094 | } | |
1095 | ||
1096 | int kern_path(const char *name, unsigned int flags, struct path *path) | |
1097 | { | |
1098 | struct nameidata nd; | |
1099 | int res = do_path_lookup(AT_FDCWD, name, flags, &nd); | |
1100 | if (!res) | |
1101 | *path = nd.path; | |
1102 | return res; | |
1103 | } | |
1104 | ||
1105 | /** | |
1106 | * vfs_path_lookup - lookup a file path relative to a dentry-vfsmount pair | |
1107 | * @dentry: pointer to dentry of the base directory | |
1108 | * @mnt: pointer to vfs mount of the base directory | |
1109 | * @name: pointer to file name | |
1110 | * @flags: lookup flags | |
1111 | * @nd: pointer to nameidata | |
1112 | */ | |
1113 | int vfs_path_lookup(struct dentry *dentry, struct vfsmount *mnt, | |
1114 | const char *name, unsigned int flags, | |
1115 | struct nameidata *nd) | |
1116 | { | |
1117 | int retval; | |
1118 | ||
1119 | /* same as do_path_lookup */ | |
1120 | nd->last_type = LAST_ROOT; | |
1121 | nd->flags = flags; | |
1122 | nd->depth = 0; | |
1123 | ||
1124 | nd->path.dentry = dentry; | |
1125 | nd->path.mnt = mnt; | |
1126 | path_get(&nd->path); | |
1127 | ||
1128 | retval = path_walk(name, nd); | |
1129 | if (unlikely(!retval && !audit_dummy_context() && nd->path.dentry && | |
1130 | nd->path.dentry->d_inode)) | |
1131 | audit_inode(name, nd->path.dentry); | |
1132 | ||
1133 | return retval; | |
1134 | ||
1135 | } | |
1136 | ||
1137 | /** | |
1138 | * path_lookup_open - lookup a file path with open intent | |
1139 | * @dfd: the directory to use as base, or AT_FDCWD | |
1140 | * @name: pointer to file name | |
1141 | * @lookup_flags: lookup intent flags | |
1142 | * @nd: pointer to nameidata | |
1143 | * @open_flags: open intent flags | |
1144 | */ | |
1145 | int path_lookup_open(int dfd, const char *name, unsigned int lookup_flags, | |
1146 | struct nameidata *nd, int open_flags) | |
1147 | { | |
1148 | struct file *filp = get_empty_filp(); | |
1149 | int err; | |
1150 | ||
1151 | if (filp == NULL) | |
1152 | return -ENFILE; | |
1153 | nd->intent.open.file = filp; | |
1154 | nd->intent.open.flags = open_flags; | |
1155 | nd->intent.open.create_mode = 0; | |
1156 | err = do_path_lookup(dfd, name, lookup_flags|LOOKUP_OPEN, nd); | |
1157 | if (IS_ERR(nd->intent.open.file)) { | |
1158 | if (err == 0) { | |
1159 | err = PTR_ERR(nd->intent.open.file); | |
1160 | path_put(&nd->path); | |
1161 | } | |
1162 | } else if (err != 0) | |
1163 | release_open_intent(nd); | |
1164 | return err; | |
1165 | } | |
1166 | ||
1167 | static struct dentry *__lookup_hash(struct qstr *name, | |
1168 | struct dentry *base, struct nameidata *nd) | |
1169 | { | |
1170 | struct dentry *dentry; | |
1171 | struct inode *inode; | |
1172 | int err; | |
1173 | ||
1174 | inode = base->d_inode; | |
1175 | ||
1176 | /* | |
1177 | * See if the low-level filesystem might want | |
1178 | * to use its own hash.. | |
1179 | */ | |
1180 | if (base->d_op && base->d_op->d_hash) { | |
1181 | err = base->d_op->d_hash(base, name); | |
1182 | dentry = ERR_PTR(err); | |
1183 | if (err < 0) | |
1184 | goto out; | |
1185 | } | |
1186 | ||
1187 | dentry = cached_lookup(base, name, nd); | |
1188 | if (!dentry) { | |
1189 | struct dentry *new; | |
1190 | ||
1191 | /* Don't create child dentry for a dead directory. */ | |
1192 | dentry = ERR_PTR(-ENOENT); | |
1193 | if (IS_DEADDIR(inode)) | |
1194 | goto out; | |
1195 | ||
1196 | new = d_alloc(base, name); | |
1197 | dentry = ERR_PTR(-ENOMEM); | |
1198 | if (!new) | |
1199 | goto out; | |
1200 | dentry = inode->i_op->lookup(inode, new, nd); | |
1201 | if (!dentry) | |
1202 | dentry = new; | |
1203 | else | |
1204 | dput(new); | |
1205 | } | |
1206 | out: | |
1207 | return dentry; | |
1208 | } | |
1209 | ||
1210 | /* | |
1211 | * Restricted form of lookup. Doesn't follow links, single-component only, | |
1212 | * needs parent already locked. Doesn't follow mounts. | |
1213 | * SMP-safe. | |
1214 | */ | |
1215 | static struct dentry *lookup_hash(struct nameidata *nd) | |
1216 | { | |
1217 | int err; | |
1218 | ||
1219 | err = inode_permission(nd->path.dentry->d_inode, MAY_EXEC); | |
1220 | if (err) | |
1221 | return ERR_PTR(err); | |
1222 | return __lookup_hash(&nd->last, nd->path.dentry, nd); | |
1223 | } | |
1224 | ||
1225 | static int __lookup_one_len(const char *name, struct qstr *this, | |
1226 | struct dentry *base, int len) | |
1227 | { | |
1228 | unsigned long hash; | |
1229 | unsigned int c; | |
1230 | ||
1231 | this->name = name; | |
1232 | this->len = len; | |
1233 | if (!len) | |
1234 | return -EACCES; | |
1235 | ||
1236 | hash = init_name_hash(); | |
1237 | while (len--) { | |
1238 | c = *(const unsigned char *)name++; | |
1239 | if (c == '/' || c == '\0') | |
1240 | return -EACCES; | |
1241 | hash = partial_name_hash(c, hash); | |
1242 | } | |
1243 | this->hash = end_name_hash(hash); | |
1244 | return 0; | |
1245 | } | |
1246 | ||
1247 | /** | |
1248 | * lookup_one_len - filesystem helper to lookup single pathname component | |
1249 | * @name: pathname component to lookup | |
1250 | * @base: base directory to lookup from | |
1251 | * @len: maximum length @len should be interpreted to | |
1252 | * | |
1253 | * Note that this routine is purely a helper for filesystem usage and should | |
1254 | * not be called by generic code. Also note that by using this function the | |
1255 | * nameidata argument is passed to the filesystem methods and a filesystem | |
1256 | * using this helper needs to be prepared for that. | |
1257 | */ | |
1258 | struct dentry *lookup_one_len(const char *name, struct dentry *base, int len) | |
1259 | { | |
1260 | int err; | |
1261 | struct qstr this; | |
1262 | ||
1263 | err = __lookup_one_len(name, &this, base, len); | |
1264 | if (err) | |
1265 | return ERR_PTR(err); | |
1266 | ||
1267 | err = inode_permission(base->d_inode, MAY_EXEC); | |
1268 | if (err) | |
1269 | return ERR_PTR(err); | |
1270 | return __lookup_hash(&this, base, NULL); | |
1271 | } | |
1272 | ||
1273 | /** | |
1274 | * lookup_one_noperm - bad hack for sysfs | |
1275 | * @name: pathname component to lookup | |
1276 | * @base: base directory to lookup from | |
1277 | * | |
1278 | * This is a variant of lookup_one_len that doesn't perform any permission | |
1279 | * checks. It's a horrible hack to work around the braindead sysfs | |
1280 | * architecture and should not be used anywhere else. | |
1281 | * | |
1282 | * DON'T USE THIS FUNCTION EVER, thanks. | |
1283 | */ | |
1284 | struct dentry *lookup_one_noperm(const char *name, struct dentry *base) | |
1285 | { | |
1286 | int err; | |
1287 | struct qstr this; | |
1288 | ||
1289 | err = __lookup_one_len(name, &this, base, strlen(name)); | |
1290 | if (err) | |
1291 | return ERR_PTR(err); | |
1292 | return __lookup_hash(&this, base, NULL); | |
1293 | } | |
1294 | ||
1295 | int user_path_at(int dfd, const char __user *name, unsigned flags, | |
1296 | struct path *path) | |
1297 | { | |
1298 | struct nameidata nd; | |
1299 | char *tmp = getname(name); | |
1300 | int err = PTR_ERR(tmp); | |
1301 | if (!IS_ERR(tmp)) { | |
1302 | ||
1303 | BUG_ON(flags & LOOKUP_PARENT); | |
1304 | ||
1305 | err = do_path_lookup(dfd, tmp, flags, &nd); | |
1306 | putname(tmp); | |
1307 | if (!err) | |
1308 | *path = nd.path; | |
1309 | } | |
1310 | return err; | |
1311 | } | |
1312 | ||
1313 | static int user_path_parent(int dfd, const char __user *path, | |
1314 | struct nameidata *nd, char **name) | |
1315 | { | |
1316 | char *s = getname(path); | |
1317 | int error; | |
1318 | ||
1319 | if (IS_ERR(s)) | |
1320 | return PTR_ERR(s); | |
1321 | ||
1322 | error = do_path_lookup(dfd, s, LOOKUP_PARENT, nd); | |
1323 | if (error) | |
1324 | putname(s); | |
1325 | else | |
1326 | *name = s; | |
1327 | ||
1328 | return error; | |
1329 | } | |
1330 | ||
1331 | /* | |
1332 | * It's inline, so penalty for filesystems that don't use sticky bit is | |
1333 | * minimal. | |
1334 | */ | |
1335 | static inline int check_sticky(struct inode *dir, struct inode *inode) | |
1336 | { | |
1337 | uid_t fsuid = current_fsuid(); | |
1338 | ||
1339 | if (!(dir->i_mode & S_ISVTX)) | |
1340 | return 0; | |
1341 | if (inode->i_uid == fsuid) | |
1342 | return 0; | |
1343 | if (dir->i_uid == fsuid) | |
1344 | return 0; | |
1345 | return !capable(CAP_FOWNER); | |
1346 | } | |
1347 | ||
1348 | /* | |
1349 | * Check whether we can remove a link victim from directory dir, check | |
1350 | * whether the type of victim is right. | |
1351 | * 1. We can't do it if dir is read-only (done in permission()) | |
1352 | * 2. We should have write and exec permissions on dir | |
1353 | * 3. We can't remove anything from append-only dir | |
1354 | * 4. We can't do anything with immutable dir (done in permission()) | |
1355 | * 5. If the sticky bit on dir is set we should either | |
1356 | * a. be owner of dir, or | |
1357 | * b. be owner of victim, or | |
1358 | * c. have CAP_FOWNER capability | |
1359 | * 6. If the victim is append-only or immutable we can't do antyhing with | |
1360 | * links pointing to it. | |
1361 | * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR. | |
1362 | * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR. | |
1363 | * 9. We can't remove a root or mountpoint. | |
1364 | * 10. We don't allow removal of NFS sillyrenamed files; it's handled by | |
1365 | * nfs_async_unlink(). | |
1366 | */ | |
1367 | static int may_delete(struct inode *dir,struct dentry *victim,int isdir) | |
1368 | { | |
1369 | int error; | |
1370 | ||
1371 | if (!victim->d_inode) | |
1372 | return -ENOENT; | |
1373 | ||
1374 | BUG_ON(victim->d_parent->d_inode != dir); | |
1375 | audit_inode_child(victim->d_name.name, victim, dir); | |
1376 | ||
1377 | error = inode_permission(dir, MAY_WRITE | MAY_EXEC); | |
1378 | if (error) | |
1379 | return error; | |
1380 | if (IS_APPEND(dir)) | |
1381 | return -EPERM; | |
1382 | if (check_sticky(dir, victim->d_inode)||IS_APPEND(victim->d_inode)|| | |
1383 | IS_IMMUTABLE(victim->d_inode) || IS_SWAPFILE(victim->d_inode)) | |
1384 | return -EPERM; | |
1385 | if (isdir) { | |
1386 | if (!S_ISDIR(victim->d_inode->i_mode)) | |
1387 | return -ENOTDIR; | |
1388 | if (IS_ROOT(victim)) | |
1389 | return -EBUSY; | |
1390 | } else if (S_ISDIR(victim->d_inode->i_mode)) | |
1391 | return -EISDIR; | |
1392 | if (IS_DEADDIR(dir)) | |
1393 | return -ENOENT; | |
1394 | if (victim->d_flags & DCACHE_NFSFS_RENAMED) | |
1395 | return -EBUSY; | |
1396 | return 0; | |
1397 | } | |
1398 | ||
1399 | /* Check whether we can create an object with dentry child in directory | |
1400 | * dir. | |
1401 | * 1. We can't do it if child already exists (open has special treatment for | |
1402 | * this case, but since we are inlined it's OK) | |
1403 | * 2. We can't do it if dir is read-only (done in permission()) | |
1404 | * 3. We should have write and exec permissions on dir | |
1405 | * 4. We can't do it if dir is immutable (done in permission()) | |
1406 | */ | |
1407 | static inline int may_create(struct inode *dir, struct dentry *child) | |
1408 | { | |
1409 | if (child->d_inode) | |
1410 | return -EEXIST; | |
1411 | if (IS_DEADDIR(dir)) | |
1412 | return -ENOENT; | |
1413 | return inode_permission(dir, MAY_WRITE | MAY_EXEC); | |
1414 | } | |
1415 | ||
1416 | /* | |
1417 | * O_DIRECTORY translates into forcing a directory lookup. | |
1418 | */ | |
1419 | static inline int lookup_flags(unsigned int f) | |
1420 | { | |
1421 | unsigned long retval = LOOKUP_FOLLOW; | |
1422 | ||
1423 | if (f & O_NOFOLLOW) | |
1424 | retval &= ~LOOKUP_FOLLOW; | |
1425 | ||
1426 | if (f & O_DIRECTORY) | |
1427 | retval |= LOOKUP_DIRECTORY; | |
1428 | ||
1429 | return retval; | |
1430 | } | |
1431 | ||
1432 | /* | |
1433 | * p1 and p2 should be directories on the same fs. | |
1434 | */ | |
1435 | struct dentry *lock_rename(struct dentry *p1, struct dentry *p2) | |
1436 | { | |
1437 | struct dentry *p; | |
1438 | ||
1439 | if (p1 == p2) { | |
1440 | mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT); | |
1441 | return NULL; | |
1442 | } | |
1443 | ||
1444 | mutex_lock(&p1->d_inode->i_sb->s_vfs_rename_mutex); | |
1445 | ||
1446 | p = d_ancestor(p2, p1); | |
1447 | if (p) { | |
1448 | mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_PARENT); | |
1449 | mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_CHILD); | |
1450 | return p; | |
1451 | } | |
1452 | ||
1453 | p = d_ancestor(p1, p2); | |
1454 | if (p) { | |
1455 | mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT); | |
1456 | mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD); | |
1457 | return p; | |
1458 | } | |
1459 | ||
1460 | mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT); | |
1461 | mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD); | |
1462 | return NULL; | |
1463 | } | |
1464 | ||
1465 | void unlock_rename(struct dentry *p1, struct dentry *p2) | |
1466 | { | |
1467 | mutex_unlock(&p1->d_inode->i_mutex); | |
1468 | if (p1 != p2) { | |
1469 | mutex_unlock(&p2->d_inode->i_mutex); | |
1470 | mutex_unlock(&p1->d_inode->i_sb->s_vfs_rename_mutex); | |
1471 | } | |
1472 | } | |
1473 | ||
1474 | int vfs_create(struct inode *dir, struct dentry *dentry, int mode, | |
1475 | struct nameidata *nd) | |
1476 | { | |
1477 | int error = may_create(dir, dentry); | |
1478 | ||
1479 | if (error) | |
1480 | return error; | |
1481 | ||
1482 | if (!dir->i_op || !dir->i_op->create) | |
1483 | return -EACCES; /* shouldn't it be ENOSYS? */ | |
1484 | mode &= S_IALLUGO; | |
1485 | mode |= S_IFREG; | |
1486 | error = security_inode_create(dir, dentry, mode); | |
1487 | if (error) | |
1488 | return error; | |
1489 | DQUOT_INIT(dir); | |
1490 | error = dir->i_op->create(dir, dentry, mode, nd); | |
1491 | if (!error) | |
1492 | fsnotify_create(dir, dentry); | |
1493 | return error; | |
1494 | } | |
1495 | ||
1496 | int may_open(struct nameidata *nd, int acc_mode, int flag) | |
1497 | { | |
1498 | struct dentry *dentry = nd->path.dentry; | |
1499 | struct inode *inode = dentry->d_inode; | |
1500 | int error; | |
1501 | ||
1502 | if (!inode) | |
1503 | return -ENOENT; | |
1504 | ||
1505 | if (S_ISLNK(inode->i_mode)) | |
1506 | return -ELOOP; | |
1507 | ||
1508 | if (S_ISDIR(inode->i_mode) && (acc_mode & MAY_WRITE)) | |
1509 | return -EISDIR; | |
1510 | ||
1511 | /* | |
1512 | * FIFO's, sockets and device files are special: they don't | |
1513 | * actually live on the filesystem itself, and as such you | |
1514 | * can write to them even if the filesystem is read-only. | |
1515 | */ | |
1516 | if (S_ISFIFO(inode->i_mode) || S_ISSOCK(inode->i_mode)) { | |
1517 | flag &= ~O_TRUNC; | |
1518 | } else if (S_ISBLK(inode->i_mode) || S_ISCHR(inode->i_mode)) { | |
1519 | if (nd->path.mnt->mnt_flags & MNT_NODEV) | |
1520 | return -EACCES; | |
1521 | ||
1522 | flag &= ~O_TRUNC; | |
1523 | } | |
1524 | ||
1525 | error = vfs_permission(nd, acc_mode); | |
1526 | if (error) | |
1527 | return error; | |
1528 | /* | |
1529 | * An append-only file must be opened in append mode for writing. | |
1530 | */ | |
1531 | if (IS_APPEND(inode)) { | |
1532 | if ((flag & FMODE_WRITE) && !(flag & O_APPEND)) | |
1533 | return -EPERM; | |
1534 | if (flag & O_TRUNC) | |
1535 | return -EPERM; | |
1536 | } | |
1537 | ||
1538 | /* O_NOATIME can only be set by the owner or superuser */ | |
1539 | if (flag & O_NOATIME) | |
1540 | if (!is_owner_or_cap(inode)) | |
1541 | return -EPERM; | |
1542 | ||
1543 | /* | |
1544 | * Ensure there are no outstanding leases on the file. | |
1545 | */ | |
1546 | error = break_lease(inode, flag); | |
1547 | if (error) | |
1548 | return error; | |
1549 | ||
1550 | if (flag & O_TRUNC) { | |
1551 | error = get_write_access(inode); | |
1552 | if (error) | |
1553 | return error; | |
1554 | ||
1555 | /* | |
1556 | * Refuse to truncate files with mandatory locks held on them. | |
1557 | */ | |
1558 | error = locks_verify_locked(inode); | |
1559 | if (!error) { | |
1560 | DQUOT_INIT(inode); | |
1561 | ||
1562 | error = do_truncate(dentry, 0, | |
1563 | ATTR_MTIME|ATTR_CTIME|ATTR_OPEN, | |
1564 | NULL); | |
1565 | } | |
1566 | put_write_access(inode); | |
1567 | if (error) | |
1568 | return error; | |
1569 | } else | |
1570 | if (flag & FMODE_WRITE) | |
1571 | DQUOT_INIT(inode); | |
1572 | ||
1573 | return 0; | |
1574 | } | |
1575 | ||
1576 | /* | |
1577 | * Be careful about ever adding any more callers of this | |
1578 | * function. Its flags must be in the namei format, not | |
1579 | * what get passed to sys_open(). | |
1580 | */ | |
1581 | static int __open_namei_create(struct nameidata *nd, struct path *path, | |
1582 | int flag, int mode) | |
1583 | { | |
1584 | int error; | |
1585 | struct dentry *dir = nd->path.dentry; | |
1586 | ||
1587 | if (!IS_POSIXACL(dir->d_inode)) | |
1588 | mode &= ~current->fs->umask; | |
1589 | error = vfs_create(dir->d_inode, path->dentry, mode, nd); | |
1590 | mutex_unlock(&dir->d_inode->i_mutex); | |
1591 | dput(nd->path.dentry); | |
1592 | nd->path.dentry = path->dentry; | |
1593 | if (error) | |
1594 | return error; | |
1595 | /* Don't check for write permission, don't truncate */ | |
1596 | return may_open(nd, 0, flag & ~O_TRUNC); | |
1597 | } | |
1598 | ||
1599 | /* | |
1600 | * Note that while the flag value (low two bits) for sys_open means: | |
1601 | * 00 - read-only | |
1602 | * 01 - write-only | |
1603 | * 10 - read-write | |
1604 | * 11 - special | |
1605 | * it is changed into | |
1606 | * 00 - no permissions needed | |
1607 | * 01 - read-permission | |
1608 | * 10 - write-permission | |
1609 | * 11 - read-write | |
1610 | * for the internal routines (ie open_namei()/follow_link() etc) | |
1611 | * This is more logical, and also allows the 00 "no perm needed" | |
1612 | * to be used for symlinks (where the permissions are checked | |
1613 | * later). | |
1614 | * | |
1615 | */ | |
1616 | static inline int open_to_namei_flags(int flag) | |
1617 | { | |
1618 | if ((flag+1) & O_ACCMODE) | |
1619 | flag++; | |
1620 | return flag; | |
1621 | } | |
1622 | ||
1623 | static int open_will_write_to_fs(int flag, struct inode *inode) | |
1624 | { | |
1625 | /* | |
1626 | * We'll never write to the fs underlying | |
1627 | * a device file. | |
1628 | */ | |
1629 | if (special_file(inode->i_mode)) | |
1630 | return 0; | |
1631 | return (flag & O_TRUNC); | |
1632 | } | |
1633 | ||
1634 | /* | |
1635 | * Note that the low bits of the passed in "open_flag" | |
1636 | * are not the same as in the local variable "flag". See | |
1637 | * open_to_namei_flags() for more details. | |
1638 | */ | |
1639 | struct file *do_filp_open(int dfd, const char *pathname, | |
1640 | int open_flag, int mode) | |
1641 | { | |
1642 | struct file *filp; | |
1643 | struct nameidata nd; | |
1644 | int acc_mode, error; | |
1645 | struct path path; | |
1646 | struct dentry *dir; | |
1647 | int count = 0; | |
1648 | int will_write; | |
1649 | int flag = open_to_namei_flags(open_flag); | |
1650 | ||
1651 | acc_mode = MAY_OPEN | ACC_MODE(flag); | |
1652 | ||
1653 | /* O_TRUNC implies we need access checks for write permissions */ | |
1654 | if (flag & O_TRUNC) | |
1655 | acc_mode |= MAY_WRITE; | |
1656 | ||
1657 | /* Allow the LSM permission hook to distinguish append | |
1658 | access from general write access. */ | |
1659 | if (flag & O_APPEND) | |
1660 | acc_mode |= MAY_APPEND; | |
1661 | ||
1662 | /* | |
1663 | * The simplest case - just a plain lookup. | |
1664 | */ | |
1665 | if (!(flag & O_CREAT)) { | |
1666 | error = path_lookup_open(dfd, pathname, lookup_flags(flag), | |
1667 | &nd, flag); | |
1668 | if (error) | |
1669 | return ERR_PTR(error); | |
1670 | goto ok; | |
1671 | } | |
1672 | ||
1673 | /* | |
1674 | * Create - we need to know the parent. | |
1675 | */ | |
1676 | error = do_path_lookup(dfd, pathname, LOOKUP_PARENT, &nd); | |
1677 | if (error) | |
1678 | return ERR_PTR(error); | |
1679 | ||
1680 | /* | |
1681 | * We have the parent and last component. First of all, check | |
1682 | * that we are not asked to creat(2) an obvious directory - that | |
1683 | * will not do. | |
1684 | */ | |
1685 | error = -EISDIR; | |
1686 | if (nd.last_type != LAST_NORM || nd.last.name[nd.last.len]) | |
1687 | goto exit_parent; | |
1688 | ||
1689 | error = -ENFILE; | |
1690 | filp = get_empty_filp(); | |
1691 | if (filp == NULL) | |
1692 | goto exit_parent; | |
1693 | nd.intent.open.file = filp; | |
1694 | nd.intent.open.flags = flag; | |
1695 | nd.intent.open.create_mode = mode; | |
1696 | dir = nd.path.dentry; | |
1697 | nd.flags &= ~LOOKUP_PARENT; | |
1698 | nd.flags |= LOOKUP_CREATE | LOOKUP_OPEN; | |
1699 | if (flag & O_EXCL) | |
1700 | nd.flags |= LOOKUP_EXCL; | |
1701 | mutex_lock(&dir->d_inode->i_mutex); | |
1702 | path.dentry = lookup_hash(&nd); | |
1703 | path.mnt = nd.path.mnt; | |
1704 | ||
1705 | do_last: | |
1706 | error = PTR_ERR(path.dentry); | |
1707 | if (IS_ERR(path.dentry)) { | |
1708 | mutex_unlock(&dir->d_inode->i_mutex); | |
1709 | goto exit; | |
1710 | } | |
1711 | ||
1712 | if (IS_ERR(nd.intent.open.file)) { | |
1713 | error = PTR_ERR(nd.intent.open.file); | |
1714 | goto exit_mutex_unlock; | |
1715 | } | |
1716 | ||
1717 | /* Negative dentry, just create the file */ | |
1718 | if (!path.dentry->d_inode) { | |
1719 | /* | |
1720 | * This write is needed to ensure that a | |
1721 | * ro->rw transition does not occur between | |
1722 | * the time when the file is created and when | |
1723 | * a permanent write count is taken through | |
1724 | * the 'struct file' in nameidata_to_filp(). | |
1725 | */ | |
1726 | error = mnt_want_write(nd.path.mnt); | |
1727 | if (error) | |
1728 | goto exit_mutex_unlock; | |
1729 | error = __open_namei_create(&nd, &path, flag, mode); | |
1730 | if (error) { | |
1731 | mnt_drop_write(nd.path.mnt); | |
1732 | goto exit; | |
1733 | } | |
1734 | filp = nameidata_to_filp(&nd, open_flag); | |
1735 | mnt_drop_write(nd.path.mnt); | |
1736 | return filp; | |
1737 | } | |
1738 | ||
1739 | /* | |
1740 | * It already exists. | |
1741 | */ | |
1742 | mutex_unlock(&dir->d_inode->i_mutex); | |
1743 | audit_inode(pathname, path.dentry); | |
1744 | ||
1745 | error = -EEXIST; | |
1746 | if (flag & O_EXCL) | |
1747 | goto exit_dput; | |
1748 | ||
1749 | if (__follow_mount(&path)) { | |
1750 | error = -ELOOP; | |
1751 | if (flag & O_NOFOLLOW) | |
1752 | goto exit_dput; | |
1753 | } | |
1754 | ||
1755 | error = -ENOENT; | |
1756 | if (!path.dentry->d_inode) | |
1757 | goto exit_dput; | |
1758 | if (path.dentry->d_inode->i_op && path.dentry->d_inode->i_op->follow_link) | |
1759 | goto do_link; | |
1760 | ||
1761 | path_to_nameidata(&path, &nd); | |
1762 | error = -EISDIR; | |
1763 | if (path.dentry->d_inode && S_ISDIR(path.dentry->d_inode->i_mode)) | |
1764 | goto exit; | |
1765 | ok: | |
1766 | /* | |
1767 | * Consider: | |
1768 | * 1. may_open() truncates a file | |
1769 | * 2. a rw->ro mount transition occurs | |
1770 | * 3. nameidata_to_filp() fails due to | |
1771 | * the ro mount. | |
1772 | * That would be inconsistent, and should | |
1773 | * be avoided. Taking this mnt write here | |
1774 | * ensures that (2) can not occur. | |
1775 | */ | |
1776 | will_write = open_will_write_to_fs(flag, nd.path.dentry->d_inode); | |
1777 | if (will_write) { | |
1778 | error = mnt_want_write(nd.path.mnt); | |
1779 | if (error) | |
1780 | goto exit; | |
1781 | } | |
1782 | error = may_open(&nd, acc_mode, flag); | |
1783 | if (error) { | |
1784 | if (will_write) | |
1785 | mnt_drop_write(nd.path.mnt); | |
1786 | goto exit; | |
1787 | } | |
1788 | filp = nameidata_to_filp(&nd, open_flag); | |
1789 | /* | |
1790 | * It is now safe to drop the mnt write | |
1791 | * because the filp has had a write taken | |
1792 | * on its behalf. | |
1793 | */ | |
1794 | if (will_write) | |
1795 | mnt_drop_write(nd.path.mnt); | |
1796 | return filp; | |
1797 | ||
1798 | exit_mutex_unlock: | |
1799 | mutex_unlock(&dir->d_inode->i_mutex); | |
1800 | exit_dput: | |
1801 | path_put_conditional(&path, &nd); | |
1802 | exit: | |
1803 | if (!IS_ERR(nd.intent.open.file)) | |
1804 | release_open_intent(&nd); | |
1805 | exit_parent: | |
1806 | path_put(&nd.path); | |
1807 | return ERR_PTR(error); | |
1808 | ||
1809 | do_link: | |
1810 | error = -ELOOP; | |
1811 | if (flag & O_NOFOLLOW) | |
1812 | goto exit_dput; | |
1813 | /* | |
1814 | * This is subtle. Instead of calling do_follow_link() we do the | |
1815 | * thing by hands. The reason is that this way we have zero link_count | |
1816 | * and path_walk() (called from ->follow_link) honoring LOOKUP_PARENT. | |
1817 | * After that we have the parent and last component, i.e. | |
1818 | * we are in the same situation as after the first path_walk(). | |
1819 | * Well, almost - if the last component is normal we get its copy | |
1820 | * stored in nd->last.name and we will have to putname() it when we | |
1821 | * are done. Procfs-like symlinks just set LAST_BIND. | |
1822 | */ | |
1823 | nd.flags |= LOOKUP_PARENT; | |
1824 | error = security_inode_follow_link(path.dentry, &nd); | |
1825 | if (error) | |
1826 | goto exit_dput; | |
1827 | error = __do_follow_link(&path, &nd); | |
1828 | if (error) { | |
1829 | /* Does someone understand code flow here? Or it is only | |
1830 | * me so stupid? Anathema to whoever designed this non-sense | |
1831 | * with "intent.open". | |
1832 | */ | |
1833 | release_open_intent(&nd); | |
1834 | return ERR_PTR(error); | |
1835 | } | |
1836 | nd.flags &= ~LOOKUP_PARENT; | |
1837 | if (nd.last_type == LAST_BIND) | |
1838 | goto ok; | |
1839 | error = -EISDIR; | |
1840 | if (nd.last_type != LAST_NORM) | |
1841 | goto exit; | |
1842 | if (nd.last.name[nd.last.len]) { | |
1843 | __putname(nd.last.name); | |
1844 | goto exit; | |
1845 | } | |
1846 | error = -ELOOP; | |
1847 | if (count++==32) { | |
1848 | __putname(nd.last.name); | |
1849 | goto exit; | |
1850 | } | |
1851 | dir = nd.path.dentry; | |
1852 | mutex_lock(&dir->d_inode->i_mutex); | |
1853 | path.dentry = lookup_hash(&nd); | |
1854 | path.mnt = nd.path.mnt; | |
1855 | __putname(nd.last.name); | |
1856 | goto do_last; | |
1857 | } | |
1858 | ||
1859 | /** | |
1860 | * filp_open - open file and return file pointer | |
1861 | * | |
1862 | * @filename: path to open | |
1863 | * @flags: open flags as per the open(2) second argument | |
1864 | * @mode: mode for the new file if O_CREAT is set, else ignored | |
1865 | * | |
1866 | * This is the helper to open a file from kernelspace if you really | |
1867 | * have to. But in generally you should not do this, so please move | |
1868 | * along, nothing to see here.. | |
1869 | */ | |
1870 | struct file *filp_open(const char *filename, int flags, int mode) | |
1871 | { | |
1872 | return do_filp_open(AT_FDCWD, filename, flags, mode); | |
1873 | } | |
1874 | EXPORT_SYMBOL(filp_open); | |
1875 | ||
1876 | /** | |
1877 | * lookup_create - lookup a dentry, creating it if it doesn't exist | |
1878 | * @nd: nameidata info | |
1879 | * @is_dir: directory flag | |
1880 | * | |
1881 | * Simple function to lookup and return a dentry and create it | |
1882 | * if it doesn't exist. Is SMP-safe. | |
1883 | * | |
1884 | * Returns with nd->path.dentry->d_inode->i_mutex locked. | |
1885 | */ | |
1886 | struct dentry *lookup_create(struct nameidata *nd, int is_dir) | |
1887 | { | |
1888 | struct dentry *dentry = ERR_PTR(-EEXIST); | |
1889 | ||
1890 | mutex_lock_nested(&nd->path.dentry->d_inode->i_mutex, I_MUTEX_PARENT); | |
1891 | /* | |
1892 | * Yucky last component or no last component at all? | |
1893 | * (foo/., foo/.., /////) | |
1894 | */ | |
1895 | if (nd->last_type != LAST_NORM) | |
1896 | goto fail; | |
1897 | nd->flags &= ~LOOKUP_PARENT; | |
1898 | nd->flags |= LOOKUP_CREATE | LOOKUP_EXCL; | |
1899 | nd->intent.open.flags = O_EXCL; | |
1900 | ||
1901 | /* | |
1902 | * Do the final lookup. | |
1903 | */ | |
1904 | dentry = lookup_hash(nd); | |
1905 | if (IS_ERR(dentry)) | |
1906 | goto fail; | |
1907 | ||
1908 | if (dentry->d_inode) | |
1909 | goto eexist; | |
1910 | /* | |
1911 | * Special case - lookup gave negative, but... we had foo/bar/ | |
1912 | * From the vfs_mknod() POV we just have a negative dentry - | |
1913 | * all is fine. Let's be bastards - you had / on the end, you've | |
1914 | * been asking for (non-existent) directory. -ENOENT for you. | |
1915 | */ | |
1916 | if (unlikely(!is_dir && nd->last.name[nd->last.len])) { | |
1917 | dput(dentry); | |
1918 | dentry = ERR_PTR(-ENOENT); | |
1919 | } | |
1920 | return dentry; | |
1921 | eexist: | |
1922 | dput(dentry); | |
1923 | dentry = ERR_PTR(-EEXIST); | |
1924 | fail: | |
1925 | return dentry; | |
1926 | } | |
1927 | EXPORT_SYMBOL_GPL(lookup_create); | |
1928 | ||
1929 | int vfs_mknod(struct inode *dir, struct dentry *dentry, int mode, dev_t dev) | |
1930 | { | |
1931 | int error = may_create(dir, dentry); | |
1932 | ||
1933 | if (error) | |
1934 | return error; | |
1935 | ||
1936 | if ((S_ISCHR(mode) || S_ISBLK(mode)) && !capable(CAP_MKNOD)) | |
1937 | return -EPERM; | |
1938 | ||
1939 | if (!dir->i_op || !dir->i_op->mknod) | |
1940 | return -EPERM; | |
1941 | ||
1942 | error = devcgroup_inode_mknod(mode, dev); | |
1943 | if (error) | |
1944 | return error; | |
1945 | ||
1946 | error = security_inode_mknod(dir, dentry, mode, dev); | |
1947 | if (error) | |
1948 | return error; | |
1949 | ||
1950 | DQUOT_INIT(dir); | |
1951 | error = dir->i_op->mknod(dir, dentry, mode, dev); | |
1952 | if (!error) | |
1953 | fsnotify_create(dir, dentry); | |
1954 | return error; | |
1955 | } | |
1956 | ||
1957 | static int may_mknod(mode_t mode) | |
1958 | { | |
1959 | switch (mode & S_IFMT) { | |
1960 | case S_IFREG: | |
1961 | case S_IFCHR: | |
1962 | case S_IFBLK: | |
1963 | case S_IFIFO: | |
1964 | case S_IFSOCK: | |
1965 | case 0: /* zero mode translates to S_IFREG */ | |
1966 | return 0; | |
1967 | case S_IFDIR: | |
1968 | return -EPERM; | |
1969 | default: | |
1970 | return -EINVAL; | |
1971 | } | |
1972 | } | |
1973 | ||
1974 | asmlinkage long sys_mknodat(int dfd, const char __user *filename, int mode, | |
1975 | unsigned dev) | |
1976 | { | |
1977 | int error; | |
1978 | char *tmp; | |
1979 | struct dentry *dentry; | |
1980 | struct nameidata nd; | |
1981 | ||
1982 | if (S_ISDIR(mode)) | |
1983 | return -EPERM; | |
1984 | ||
1985 | error = user_path_parent(dfd, filename, &nd, &tmp); | |
1986 | if (error) | |
1987 | return error; | |
1988 | ||
1989 | dentry = lookup_create(&nd, 0); | |
1990 | if (IS_ERR(dentry)) { | |
1991 | error = PTR_ERR(dentry); | |
1992 | goto out_unlock; | |
1993 | } | |
1994 | if (!IS_POSIXACL(nd.path.dentry->d_inode)) | |
1995 | mode &= ~current->fs->umask; | |
1996 | error = may_mknod(mode); | |
1997 | if (error) | |
1998 | goto out_dput; | |
1999 | error = mnt_want_write(nd.path.mnt); | |
2000 | if (error) | |
2001 | goto out_dput; | |
2002 | switch (mode & S_IFMT) { | |
2003 | case 0: case S_IFREG: | |
2004 | error = vfs_create(nd.path.dentry->d_inode,dentry,mode,&nd); | |
2005 | break; | |
2006 | case S_IFCHR: case S_IFBLK: | |
2007 | error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode, | |
2008 | new_decode_dev(dev)); | |
2009 | break; | |
2010 | case S_IFIFO: case S_IFSOCK: | |
2011 | error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode,0); | |
2012 | break; | |
2013 | } | |
2014 | mnt_drop_write(nd.path.mnt); | |
2015 | out_dput: | |
2016 | dput(dentry); | |
2017 | out_unlock: | |
2018 | mutex_unlock(&nd.path.dentry->d_inode->i_mutex); | |
2019 | path_put(&nd.path); | |
2020 | putname(tmp); | |
2021 | ||
2022 | return error; | |
2023 | } | |
2024 | ||
2025 | asmlinkage long sys_mknod(const char __user *filename, int mode, unsigned dev) | |
2026 | { | |
2027 | return sys_mknodat(AT_FDCWD, filename, mode, dev); | |
2028 | } | |
2029 | ||
2030 | int vfs_mkdir(struct inode *dir, struct dentry *dentry, int mode) | |
2031 | { | |
2032 | int error = may_create(dir, dentry); | |
2033 | ||
2034 | if (error) | |
2035 | return error; | |
2036 | ||
2037 | if (!dir->i_op || !dir->i_op->mkdir) | |
2038 | return -EPERM; | |
2039 | ||
2040 | mode &= (S_IRWXUGO|S_ISVTX); | |
2041 | error = security_inode_mkdir(dir, dentry, mode); | |
2042 | if (error) | |
2043 | return error; | |
2044 | ||
2045 | DQUOT_INIT(dir); | |
2046 | error = dir->i_op->mkdir(dir, dentry, mode); | |
2047 | if (!error) | |
2048 | fsnotify_mkdir(dir, dentry); | |
2049 | return error; | |
2050 | } | |
2051 | ||
2052 | asmlinkage long sys_mkdirat(int dfd, const char __user *pathname, int mode) | |
2053 | { | |
2054 | int error = 0; | |
2055 | char * tmp; | |
2056 | struct dentry *dentry; | |
2057 | struct nameidata nd; | |
2058 | ||
2059 | error = user_path_parent(dfd, pathname, &nd, &tmp); | |
2060 | if (error) | |
2061 | goto out_err; | |
2062 | ||
2063 | dentry = lookup_create(&nd, 1); | |
2064 | error = PTR_ERR(dentry); | |
2065 | if (IS_ERR(dentry)) | |
2066 | goto out_unlock; | |
2067 | ||
2068 | if (!IS_POSIXACL(nd.path.dentry->d_inode)) | |
2069 | mode &= ~current->fs->umask; | |
2070 | error = mnt_want_write(nd.path.mnt); | |
2071 | if (error) | |
2072 | goto out_dput; | |
2073 | error = vfs_mkdir(nd.path.dentry->d_inode, dentry, mode); | |
2074 | mnt_drop_write(nd.path.mnt); | |
2075 | out_dput: | |
2076 | dput(dentry); | |
2077 | out_unlock: | |
2078 | mutex_unlock(&nd.path.dentry->d_inode->i_mutex); | |
2079 | path_put(&nd.path); | |
2080 | putname(tmp); | |
2081 | out_err: | |
2082 | return error; | |
2083 | } | |
2084 | ||
2085 | asmlinkage long sys_mkdir(const char __user *pathname, int mode) | |
2086 | { | |
2087 | return sys_mkdirat(AT_FDCWD, pathname, mode); | |
2088 | } | |
2089 | ||
2090 | /* | |
2091 | * We try to drop the dentry early: we should have | |
2092 | * a usage count of 2 if we're the only user of this | |
2093 | * dentry, and if that is true (possibly after pruning | |
2094 | * the dcache), then we drop the dentry now. | |
2095 | * | |
2096 | * A low-level filesystem can, if it choses, legally | |
2097 | * do a | |
2098 | * | |
2099 | * if (!d_unhashed(dentry)) | |
2100 | * return -EBUSY; | |
2101 | * | |
2102 | * if it cannot handle the case of removing a directory | |
2103 | * that is still in use by something else.. | |
2104 | */ | |
2105 | void dentry_unhash(struct dentry *dentry) | |
2106 | { | |
2107 | dget(dentry); | |
2108 | shrink_dcache_parent(dentry); | |
2109 | spin_lock(&dcache_lock); | |
2110 | spin_lock(&dentry->d_lock); | |
2111 | if (atomic_read(&dentry->d_count) == 2) | |
2112 | __d_drop(dentry); | |
2113 | spin_unlock(&dentry->d_lock); | |
2114 | spin_unlock(&dcache_lock); | |
2115 | } | |
2116 | ||
2117 | int vfs_rmdir(struct inode *dir, struct dentry *dentry) | |
2118 | { | |
2119 | int error = may_delete(dir, dentry, 1); | |
2120 | ||
2121 | if (error) | |
2122 | return error; | |
2123 | ||
2124 | if (!dir->i_op || !dir->i_op->rmdir) | |
2125 | return -EPERM; | |
2126 | ||
2127 | DQUOT_INIT(dir); | |
2128 | ||
2129 | mutex_lock(&dentry->d_inode->i_mutex); | |
2130 | dentry_unhash(dentry); | |
2131 | if (d_mountpoint(dentry)) | |
2132 | error = -EBUSY; | |
2133 | else { | |
2134 | error = security_inode_rmdir(dir, dentry); | |
2135 | if (!error) { | |
2136 | error = dir->i_op->rmdir(dir, dentry); | |
2137 | if (!error) | |
2138 | dentry->d_inode->i_flags |= S_DEAD; | |
2139 | } | |
2140 | } | |
2141 | mutex_unlock(&dentry->d_inode->i_mutex); | |
2142 | if (!error) { | |
2143 | d_delete(dentry); | |
2144 | } | |
2145 | dput(dentry); | |
2146 | ||
2147 | return error; | |
2148 | } | |
2149 | ||
2150 | static long do_rmdir(int dfd, const char __user *pathname) | |
2151 | { | |
2152 | int error = 0; | |
2153 | char * name; | |
2154 | struct dentry *dentry; | |
2155 | struct nameidata nd; | |
2156 | ||
2157 | error = user_path_parent(dfd, pathname, &nd, &name); | |
2158 | if (error) | |
2159 | return error; | |
2160 | ||
2161 | switch(nd.last_type) { | |
2162 | case LAST_DOTDOT: | |
2163 | error = -ENOTEMPTY; | |
2164 | goto exit1; | |
2165 | case LAST_DOT: | |
2166 | error = -EINVAL; | |
2167 | goto exit1; | |
2168 | case LAST_ROOT: | |
2169 | error = -EBUSY; | |
2170 | goto exit1; | |
2171 | } | |
2172 | ||
2173 | nd.flags &= ~LOOKUP_PARENT; | |
2174 | ||
2175 | mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT); | |
2176 | dentry = lookup_hash(&nd); | |
2177 | error = PTR_ERR(dentry); | |
2178 | if (IS_ERR(dentry)) | |
2179 | goto exit2; | |
2180 | error = mnt_want_write(nd.path.mnt); | |
2181 | if (error) | |
2182 | goto exit3; | |
2183 | error = vfs_rmdir(nd.path.dentry->d_inode, dentry); | |
2184 | mnt_drop_write(nd.path.mnt); | |
2185 | exit3: | |
2186 | dput(dentry); | |
2187 | exit2: | |
2188 | mutex_unlock(&nd.path.dentry->d_inode->i_mutex); | |
2189 | exit1: | |
2190 | path_put(&nd.path); | |
2191 | putname(name); | |
2192 | return error; | |
2193 | } | |
2194 | ||
2195 | asmlinkage long sys_rmdir(const char __user *pathname) | |
2196 | { | |
2197 | return do_rmdir(AT_FDCWD, pathname); | |
2198 | } | |
2199 | ||
2200 | int vfs_unlink(struct inode *dir, struct dentry *dentry) | |
2201 | { | |
2202 | int error = may_delete(dir, dentry, 0); | |
2203 | ||
2204 | if (error) | |
2205 | return error; | |
2206 | ||
2207 | if (!dir->i_op || !dir->i_op->unlink) | |
2208 | return -EPERM; | |
2209 | ||
2210 | DQUOT_INIT(dir); | |
2211 | ||
2212 | mutex_lock(&dentry->d_inode->i_mutex); | |
2213 | if (d_mountpoint(dentry)) | |
2214 | error = -EBUSY; | |
2215 | else { | |
2216 | error = security_inode_unlink(dir, dentry); | |
2217 | if (!error) | |
2218 | error = dir->i_op->unlink(dir, dentry); | |
2219 | } | |
2220 | mutex_unlock(&dentry->d_inode->i_mutex); | |
2221 | ||
2222 | /* We don't d_delete() NFS sillyrenamed files--they still exist. */ | |
2223 | if (!error && !(dentry->d_flags & DCACHE_NFSFS_RENAMED)) { | |
2224 | fsnotify_link_count(dentry->d_inode); | |
2225 | d_delete(dentry); | |
2226 | } | |
2227 | ||
2228 | return error; | |
2229 | } | |
2230 | ||
2231 | /* | |
2232 | * Make sure that the actual truncation of the file will occur outside its | |
2233 | * directory's i_mutex. Truncate can take a long time if there is a lot of | |
2234 | * writeout happening, and we don't want to prevent access to the directory | |
2235 | * while waiting on the I/O. | |
2236 | */ | |
2237 | static long do_unlinkat(int dfd, const char __user *pathname) | |
2238 | { | |
2239 | int error; | |
2240 | char *name; | |
2241 | struct dentry *dentry; | |
2242 | struct nameidata nd; | |
2243 | struct inode *inode = NULL; | |
2244 | ||
2245 | error = user_path_parent(dfd, pathname, &nd, &name); | |
2246 | if (error) | |
2247 | return error; | |
2248 | ||
2249 | error = -EISDIR; | |
2250 | if (nd.last_type != LAST_NORM) | |
2251 | goto exit1; | |
2252 | ||
2253 | nd.flags &= ~LOOKUP_PARENT; | |
2254 | ||
2255 | mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT); | |
2256 | dentry = lookup_hash(&nd); | |
2257 | error = PTR_ERR(dentry); | |
2258 | if (!IS_ERR(dentry)) { | |
2259 | /* Why not before? Because we want correct error value */ | |
2260 | if (nd.last.name[nd.last.len]) | |
2261 | goto slashes; | |
2262 | inode = dentry->d_inode; | |
2263 | if (inode) | |
2264 | atomic_inc(&inode->i_count); | |
2265 | error = mnt_want_write(nd.path.mnt); | |
2266 | if (error) | |
2267 | goto exit2; | |
2268 | error = vfs_unlink(nd.path.dentry->d_inode, dentry); | |
2269 | mnt_drop_write(nd.path.mnt); | |
2270 | exit2: | |
2271 | dput(dentry); | |
2272 | } | |
2273 | mutex_unlock(&nd.path.dentry->d_inode->i_mutex); | |
2274 | if (inode) | |
2275 | iput(inode); /* truncate the inode here */ | |
2276 | exit1: | |
2277 | path_put(&nd.path); | |
2278 | putname(name); | |
2279 | return error; | |
2280 | ||
2281 | slashes: | |
2282 | error = !dentry->d_inode ? -ENOENT : | |
2283 | S_ISDIR(dentry->d_inode->i_mode) ? -EISDIR : -ENOTDIR; | |
2284 | goto exit2; | |
2285 | } | |
2286 | ||
2287 | asmlinkage long sys_unlinkat(int dfd, const char __user *pathname, int flag) | |
2288 | { | |
2289 | if ((flag & ~AT_REMOVEDIR) != 0) | |
2290 | return -EINVAL; | |
2291 | ||
2292 | if (flag & AT_REMOVEDIR) | |
2293 | return do_rmdir(dfd, pathname); | |
2294 | ||
2295 | return do_unlinkat(dfd, pathname); | |
2296 | } | |
2297 | ||
2298 | asmlinkage long sys_unlink(const char __user *pathname) | |
2299 | { | |
2300 | return do_unlinkat(AT_FDCWD, pathname); | |
2301 | } | |
2302 | ||
2303 | int vfs_symlink(struct inode *dir, struct dentry *dentry, const char *oldname) | |
2304 | { | |
2305 | int error = may_create(dir, dentry); | |
2306 | ||
2307 | if (error) | |
2308 | return error; | |
2309 | ||
2310 | if (!dir->i_op || !dir->i_op->symlink) | |
2311 | return -EPERM; | |
2312 | ||
2313 | error = security_inode_symlink(dir, dentry, oldname); | |
2314 | if (error) | |
2315 | return error; | |
2316 | ||
2317 | DQUOT_INIT(dir); | |
2318 | error = dir->i_op->symlink(dir, dentry, oldname); | |
2319 | if (!error) | |
2320 | fsnotify_create(dir, dentry); | |
2321 | return error; | |
2322 | } | |
2323 | ||
2324 | asmlinkage long sys_symlinkat(const char __user *oldname, | |
2325 | int newdfd, const char __user *newname) | |
2326 | { | |
2327 | int error; | |
2328 | char *from; | |
2329 | char *to; | |
2330 | struct dentry *dentry; | |
2331 | struct nameidata nd; | |
2332 | ||
2333 | from = getname(oldname); | |
2334 | if (IS_ERR(from)) | |
2335 | return PTR_ERR(from); | |
2336 | ||
2337 | error = user_path_parent(newdfd, newname, &nd, &to); | |
2338 | if (error) | |
2339 | goto out_putname; | |
2340 | ||
2341 | dentry = lookup_create(&nd, 0); | |
2342 | error = PTR_ERR(dentry); | |
2343 | if (IS_ERR(dentry)) | |
2344 | goto out_unlock; | |
2345 | ||
2346 | error = mnt_want_write(nd.path.mnt); | |
2347 | if (error) | |
2348 | goto out_dput; | |
2349 | error = vfs_symlink(nd.path.dentry->d_inode, dentry, from); | |
2350 | mnt_drop_write(nd.path.mnt); | |
2351 | out_dput: | |
2352 | dput(dentry); | |
2353 | out_unlock: | |
2354 | mutex_unlock(&nd.path.dentry->d_inode->i_mutex); | |
2355 | path_put(&nd.path); | |
2356 | putname(to); | |
2357 | out_putname: | |
2358 | putname(from); | |
2359 | return error; | |
2360 | } | |
2361 | ||
2362 | asmlinkage long sys_symlink(const char __user *oldname, const char __user *newname) | |
2363 | { | |
2364 | return sys_symlinkat(oldname, AT_FDCWD, newname); | |
2365 | } | |
2366 | ||
2367 | int vfs_link(struct dentry *old_dentry, struct inode *dir, struct dentry *new_dentry) | |
2368 | { | |
2369 | struct inode *inode = old_dentry->d_inode; | |
2370 | int error; | |
2371 | ||
2372 | if (!inode) | |
2373 | return -ENOENT; | |
2374 | ||
2375 | error = may_create(dir, new_dentry); | |
2376 | if (error) | |
2377 | return error; | |
2378 | ||
2379 | if (dir->i_sb != inode->i_sb) | |
2380 | return -EXDEV; | |
2381 | ||
2382 | /* | |
2383 | * A link to an append-only or immutable file cannot be created. | |
2384 | */ | |
2385 | if (IS_APPEND(inode) || IS_IMMUTABLE(inode)) | |
2386 | return -EPERM; | |
2387 | if (!dir->i_op || !dir->i_op->link) | |
2388 | return -EPERM; | |
2389 | if (S_ISDIR(inode->i_mode)) | |
2390 | return -EPERM; | |
2391 | ||
2392 | error = security_inode_link(old_dentry, dir, new_dentry); | |
2393 | if (error) | |
2394 | return error; | |
2395 | ||
2396 | mutex_lock(&inode->i_mutex); | |
2397 | DQUOT_INIT(dir); | |
2398 | error = dir->i_op->link(old_dentry, dir, new_dentry); | |
2399 | mutex_unlock(&inode->i_mutex); | |
2400 | if (!error) | |
2401 | fsnotify_link(dir, inode, new_dentry); | |
2402 | return error; | |
2403 | } | |
2404 | ||
2405 | /* | |
2406 | * Hardlinks are often used in delicate situations. We avoid | |
2407 | * security-related surprises by not following symlinks on the | |
2408 | * newname. --KAB | |
2409 | * | |
2410 | * We don't follow them on the oldname either to be compatible | |
2411 | * with linux 2.0, and to avoid hard-linking to directories | |
2412 | * and other special files. --ADM | |
2413 | */ | |
2414 | asmlinkage long sys_linkat(int olddfd, const char __user *oldname, | |
2415 | int newdfd, const char __user *newname, | |
2416 | int flags) | |
2417 | { | |
2418 | struct dentry *new_dentry; | |
2419 | struct nameidata nd; | |
2420 | struct path old_path; | |
2421 | int error; | |
2422 | char *to; | |
2423 | ||
2424 | if ((flags & ~AT_SYMLINK_FOLLOW) != 0) | |
2425 | return -EINVAL; | |
2426 | ||
2427 | error = user_path_at(olddfd, oldname, | |
2428 | flags & AT_SYMLINK_FOLLOW ? LOOKUP_FOLLOW : 0, | |
2429 | &old_path); | |
2430 | if (error) | |
2431 | return error; | |
2432 | ||
2433 | error = user_path_parent(newdfd, newname, &nd, &to); | |
2434 | if (error) | |
2435 | goto out; | |
2436 | error = -EXDEV; | |
2437 | if (old_path.mnt != nd.path.mnt) | |
2438 | goto out_release; | |
2439 | new_dentry = lookup_create(&nd, 0); | |
2440 | error = PTR_ERR(new_dentry); | |
2441 | if (IS_ERR(new_dentry)) | |
2442 | goto out_unlock; | |
2443 | error = mnt_want_write(nd.path.mnt); | |
2444 | if (error) | |
2445 | goto out_dput; | |
2446 | error = vfs_link(old_path.dentry, nd.path.dentry->d_inode, new_dentry); | |
2447 | mnt_drop_write(nd.path.mnt); | |
2448 | out_dput: | |
2449 | dput(new_dentry); | |
2450 | out_unlock: | |
2451 | mutex_unlock(&nd.path.dentry->d_inode->i_mutex); | |
2452 | out_release: | |
2453 | path_put(&nd.path); | |
2454 | putname(to); | |
2455 | out: | |
2456 | path_put(&old_path); | |
2457 | ||
2458 | return error; | |
2459 | } | |
2460 | ||
2461 | asmlinkage long sys_link(const char __user *oldname, const char __user *newname) | |
2462 | { | |
2463 | return sys_linkat(AT_FDCWD, oldname, AT_FDCWD, newname, 0); | |
2464 | } | |
2465 | ||
2466 | /* | |
2467 | * The worst of all namespace operations - renaming directory. "Perverted" | |
2468 | * doesn't even start to describe it. Somebody in UCB had a heck of a trip... | |
2469 | * Problems: | |
2470 | * a) we can get into loop creation. Check is done in is_subdir(). | |
2471 | * b) race potential - two innocent renames can create a loop together. | |
2472 | * That's where 4.4 screws up. Current fix: serialization on | |
2473 | * sb->s_vfs_rename_mutex. We might be more accurate, but that's another | |
2474 | * story. | |
2475 | * c) we have to lock _three_ objects - parents and victim (if it exists). | |
2476 | * And that - after we got ->i_mutex on parents (until then we don't know | |
2477 | * whether the target exists). Solution: try to be smart with locking | |
2478 | * order for inodes. We rely on the fact that tree topology may change | |
2479 | * only under ->s_vfs_rename_mutex _and_ that parent of the object we | |
2480 | * move will be locked. Thus we can rank directories by the tree | |
2481 | * (ancestors first) and rank all non-directories after them. | |
2482 | * That works since everybody except rename does "lock parent, lookup, | |
2483 | * lock child" and rename is under ->s_vfs_rename_mutex. | |
2484 | * HOWEVER, it relies on the assumption that any object with ->lookup() | |
2485 | * has no more than 1 dentry. If "hybrid" objects will ever appear, | |
2486 | * we'd better make sure that there's no link(2) for them. | |
2487 | * d) some filesystems don't support opened-but-unlinked directories, | |
2488 | * either because of layout or because they are not ready to deal with | |
2489 | * all cases correctly. The latter will be fixed (taking this sort of | |
2490 | * stuff into VFS), but the former is not going away. Solution: the same | |
2491 | * trick as in rmdir(). | |
2492 | * e) conversion from fhandle to dentry may come in the wrong moment - when | |
2493 | * we are removing the target. Solution: we will have to grab ->i_mutex | |
2494 | * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on | |
2495 | * ->i_mutex on parents, which works but leads to some truely excessive | |
2496 | * locking]. | |
2497 | */ | |
2498 | static int vfs_rename_dir(struct inode *old_dir, struct dentry *old_dentry, | |
2499 | struct inode *new_dir, struct dentry *new_dentry) | |
2500 | { | |
2501 | int error = 0; | |
2502 | struct inode *target; | |
2503 | ||
2504 | /* | |
2505 | * If we are going to change the parent - check write permissions, | |
2506 | * we'll need to flip '..'. | |
2507 | */ | |
2508 | if (new_dir != old_dir) { | |
2509 | error = inode_permission(old_dentry->d_inode, MAY_WRITE); | |
2510 | if (error) | |
2511 | return error; | |
2512 | } | |
2513 | ||
2514 | error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry); | |
2515 | if (error) | |
2516 | return error; | |
2517 | ||
2518 | target = new_dentry->d_inode; | |
2519 | if (target) { | |
2520 | mutex_lock(&target->i_mutex); | |
2521 | dentry_unhash(new_dentry); | |
2522 | } | |
2523 | if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry)) | |
2524 | error = -EBUSY; | |
2525 | else | |
2526 | error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry); | |
2527 | if (target) { | |
2528 | if (!error) | |
2529 | target->i_flags |= S_DEAD; | |
2530 | mutex_unlock(&target->i_mutex); | |
2531 | if (d_unhashed(new_dentry)) | |
2532 | d_rehash(new_dentry); | |
2533 | dput(new_dentry); | |
2534 | } | |
2535 | if (!error) | |
2536 | if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE)) | |
2537 | d_move(old_dentry,new_dentry); | |
2538 | return error; | |
2539 | } | |
2540 | ||
2541 | static int vfs_rename_other(struct inode *old_dir, struct dentry *old_dentry, | |
2542 | struct inode *new_dir, struct dentry *new_dentry) | |
2543 | { | |
2544 | struct inode *target; | |
2545 | int error; | |
2546 | ||
2547 | error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry); | |
2548 | if (error) | |
2549 | return error; | |
2550 | ||
2551 | dget(new_dentry); | |
2552 | target = new_dentry->d_inode; | |
2553 | if (target) | |
2554 | mutex_lock(&target->i_mutex); | |
2555 | if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry)) | |
2556 | error = -EBUSY; | |
2557 | else | |
2558 | error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry); | |
2559 | if (!error) { | |
2560 | if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE)) | |
2561 | d_move(old_dentry, new_dentry); | |
2562 | } | |
2563 | if (target) | |
2564 | mutex_unlock(&target->i_mutex); | |
2565 | dput(new_dentry); | |
2566 | return error; | |
2567 | } | |
2568 | ||
2569 | int vfs_rename(struct inode *old_dir, struct dentry *old_dentry, | |
2570 | struct inode *new_dir, struct dentry *new_dentry) | |
2571 | { | |
2572 | int error; | |
2573 | int is_dir = S_ISDIR(old_dentry->d_inode->i_mode); | |
2574 | const char *old_name; | |
2575 | ||
2576 | if (old_dentry->d_inode == new_dentry->d_inode) | |
2577 | return 0; | |
2578 | ||
2579 | error = may_delete(old_dir, old_dentry, is_dir); | |
2580 | if (error) | |
2581 | return error; | |
2582 | ||
2583 | if (!new_dentry->d_inode) | |
2584 | error = may_create(new_dir, new_dentry); | |
2585 | else | |
2586 | error = may_delete(new_dir, new_dentry, is_dir); | |
2587 | if (error) | |
2588 | return error; | |
2589 | ||
2590 | if (!old_dir->i_op || !old_dir->i_op->rename) | |
2591 | return -EPERM; | |
2592 | ||
2593 | DQUOT_INIT(old_dir); | |
2594 | DQUOT_INIT(new_dir); | |
2595 | ||
2596 | old_name = fsnotify_oldname_init(old_dentry->d_name.name); | |
2597 | ||
2598 | if (is_dir) | |
2599 | error = vfs_rename_dir(old_dir,old_dentry,new_dir,new_dentry); | |
2600 | else | |
2601 | error = vfs_rename_other(old_dir,old_dentry,new_dir,new_dentry); | |
2602 | if (!error) { | |
2603 | const char *new_name = old_dentry->d_name.name; | |
2604 | fsnotify_move(old_dir, new_dir, old_name, new_name, is_dir, | |
2605 | new_dentry->d_inode, old_dentry); | |
2606 | } | |
2607 | fsnotify_oldname_free(old_name); | |
2608 | ||
2609 | return error; | |
2610 | } | |
2611 | ||
2612 | asmlinkage long sys_renameat(int olddfd, const char __user *oldname, | |
2613 | int newdfd, const char __user *newname) | |
2614 | { | |
2615 | struct dentry *old_dir, *new_dir; | |
2616 | struct dentry *old_dentry, *new_dentry; | |
2617 | struct dentry *trap; | |
2618 | struct nameidata oldnd, newnd; | |
2619 | char *from; | |
2620 | char *to; | |
2621 | int error; | |
2622 | ||
2623 | error = user_path_parent(olddfd, oldname, &oldnd, &from); | |
2624 | if (error) | |
2625 | goto exit; | |
2626 | ||
2627 | error = user_path_parent(newdfd, newname, &newnd, &to); | |
2628 | if (error) | |
2629 | goto exit1; | |
2630 | ||
2631 | error = -EXDEV; | |
2632 | if (oldnd.path.mnt != newnd.path.mnt) | |
2633 | goto exit2; | |
2634 | ||
2635 | old_dir = oldnd.path.dentry; | |
2636 | error = -EBUSY; | |
2637 | if (oldnd.last_type != LAST_NORM) | |
2638 | goto exit2; | |
2639 | ||
2640 | new_dir = newnd.path.dentry; | |
2641 | if (newnd.last_type != LAST_NORM) | |
2642 | goto exit2; | |
2643 | ||
2644 | oldnd.flags &= ~LOOKUP_PARENT; | |
2645 | newnd.flags &= ~LOOKUP_PARENT; | |
2646 | newnd.flags |= LOOKUP_RENAME_TARGET; | |
2647 | ||
2648 | trap = lock_rename(new_dir, old_dir); | |
2649 | ||
2650 | old_dentry = lookup_hash(&oldnd); | |
2651 | error = PTR_ERR(old_dentry); | |
2652 | if (IS_ERR(old_dentry)) | |
2653 | goto exit3; | |
2654 | /* source must exist */ | |
2655 | error = -ENOENT; | |
2656 | if (!old_dentry->d_inode) | |
2657 | goto exit4; | |
2658 | /* unless the source is a directory trailing slashes give -ENOTDIR */ | |
2659 | if (!S_ISDIR(old_dentry->d_inode->i_mode)) { | |
2660 | error = -ENOTDIR; | |
2661 | if (oldnd.last.name[oldnd.last.len]) | |
2662 | goto exit4; | |
2663 | if (newnd.last.name[newnd.last.len]) | |
2664 | goto exit4; | |
2665 | } | |
2666 | /* source should not be ancestor of target */ | |
2667 | error = -EINVAL; | |
2668 | if (old_dentry == trap) | |
2669 | goto exit4; | |
2670 | new_dentry = lookup_hash(&newnd); | |
2671 | error = PTR_ERR(new_dentry); | |
2672 | if (IS_ERR(new_dentry)) | |
2673 | goto exit4; | |
2674 | /* target should not be an ancestor of source */ | |
2675 | error = -ENOTEMPTY; | |
2676 | if (new_dentry == trap) | |
2677 | goto exit5; | |
2678 | ||
2679 | error = mnt_want_write(oldnd.path.mnt); | |
2680 | if (error) | |
2681 | goto exit5; | |
2682 | error = vfs_rename(old_dir->d_inode, old_dentry, | |
2683 | new_dir->d_inode, new_dentry); | |
2684 | mnt_drop_write(oldnd.path.mnt); | |
2685 | exit5: | |
2686 | dput(new_dentry); | |
2687 | exit4: | |
2688 | dput(old_dentry); | |
2689 | exit3: | |
2690 | unlock_rename(new_dir, old_dir); | |
2691 | exit2: | |
2692 | path_put(&newnd.path); | |
2693 | putname(to); | |
2694 | exit1: | |
2695 | path_put(&oldnd.path); | |
2696 | putname(from); | |
2697 | exit: | |
2698 | return error; | |
2699 | } | |
2700 | ||
2701 | asmlinkage long sys_rename(const char __user *oldname, const char __user *newname) | |
2702 | { | |
2703 | return sys_renameat(AT_FDCWD, oldname, AT_FDCWD, newname); | |
2704 | } | |
2705 | ||
2706 | int vfs_readlink(struct dentry *dentry, char __user *buffer, int buflen, const char *link) | |
2707 | { | |
2708 | int len; | |
2709 | ||
2710 | len = PTR_ERR(link); | |
2711 | if (IS_ERR(link)) | |
2712 | goto out; | |
2713 | ||
2714 | len = strlen(link); | |
2715 | if (len > (unsigned) buflen) | |
2716 | len = buflen; | |
2717 | if (copy_to_user(buffer, link, len)) | |
2718 | len = -EFAULT; | |
2719 | out: | |
2720 | return len; | |
2721 | } | |
2722 | ||
2723 | /* | |
2724 | * A helper for ->readlink(). This should be used *ONLY* for symlinks that | |
2725 | * have ->follow_link() touching nd only in nd_set_link(). Using (or not | |
2726 | * using) it for any given inode is up to filesystem. | |
2727 | */ | |
2728 | int generic_readlink(struct dentry *dentry, char __user *buffer, int buflen) | |
2729 | { | |
2730 | struct nameidata nd; | |
2731 | void *cookie; | |
2732 | int res; | |
2733 | ||
2734 | nd.depth = 0; | |
2735 | cookie = dentry->d_inode->i_op->follow_link(dentry, &nd); | |
2736 | if (IS_ERR(cookie)) | |
2737 | return PTR_ERR(cookie); | |
2738 | ||
2739 | res = vfs_readlink(dentry, buffer, buflen, nd_get_link(&nd)); | |
2740 | if (dentry->d_inode->i_op->put_link) | |
2741 | dentry->d_inode->i_op->put_link(dentry, &nd, cookie); | |
2742 | return res; | |
2743 | } | |
2744 | ||
2745 | int vfs_follow_link(struct nameidata *nd, const char *link) | |
2746 | { | |
2747 | return __vfs_follow_link(nd, link); | |
2748 | } | |
2749 | ||
2750 | /* get the link contents into pagecache */ | |
2751 | static char *page_getlink(struct dentry * dentry, struct page **ppage) | |
2752 | { | |
2753 | struct page * page; | |
2754 | struct address_space *mapping = dentry->d_inode->i_mapping; | |
2755 | page = read_mapping_page(mapping, 0, NULL); | |
2756 | if (IS_ERR(page)) | |
2757 | return (char*)page; | |
2758 | *ppage = page; | |
2759 | return kmap(page); | |
2760 | } | |
2761 | ||
2762 | int page_readlink(struct dentry *dentry, char __user *buffer, int buflen) | |
2763 | { | |
2764 | struct page *page = NULL; | |
2765 | char *s = page_getlink(dentry, &page); | |
2766 | int res = vfs_readlink(dentry,buffer,buflen,s); | |
2767 | if (page) { | |
2768 | kunmap(page); | |
2769 | page_cache_release(page); | |
2770 | } | |
2771 | return res; | |
2772 | } | |
2773 | ||
2774 | void *page_follow_link_light(struct dentry *dentry, struct nameidata *nd) | |
2775 | { | |
2776 | struct page *page = NULL; | |
2777 | nd_set_link(nd, page_getlink(dentry, &page)); | |
2778 | return page; | |
2779 | } | |
2780 | ||
2781 | void page_put_link(struct dentry *dentry, struct nameidata *nd, void *cookie) | |
2782 | { | |
2783 | struct page *page = cookie; | |
2784 | ||
2785 | if (page) { | |
2786 | kunmap(page); | |
2787 | page_cache_release(page); | |
2788 | } | |
2789 | } | |
2790 | ||
2791 | int __page_symlink(struct inode *inode, const char *symname, int len, | |
2792 | gfp_t gfp_mask) | |
2793 | { | |
2794 | struct address_space *mapping = inode->i_mapping; | |
2795 | struct page *page; | |
2796 | void *fsdata; | |
2797 | int err; | |
2798 | char *kaddr; | |
2799 | ||
2800 | retry: | |
2801 | err = pagecache_write_begin(NULL, mapping, 0, len-1, | |
2802 | AOP_FLAG_UNINTERRUPTIBLE, &page, &fsdata); | |
2803 | if (err) | |
2804 | goto fail; | |
2805 | ||
2806 | kaddr = kmap_atomic(page, KM_USER0); | |
2807 | memcpy(kaddr, symname, len-1); | |
2808 | kunmap_atomic(kaddr, KM_USER0); | |
2809 | ||
2810 | err = pagecache_write_end(NULL, mapping, 0, len-1, len-1, | |
2811 | page, fsdata); | |
2812 | if (err < 0) | |
2813 | goto fail; | |
2814 | if (err < len-1) | |
2815 | goto retry; | |
2816 | ||
2817 | mark_inode_dirty(inode); | |
2818 | return 0; | |
2819 | fail: | |
2820 | return err; | |
2821 | } | |
2822 | ||
2823 | int page_symlink(struct inode *inode, const char *symname, int len) | |
2824 | { | |
2825 | return __page_symlink(inode, symname, len, | |
2826 | mapping_gfp_mask(inode->i_mapping)); | |
2827 | } | |
2828 | ||
2829 | const struct inode_operations page_symlink_inode_operations = { | |
2830 | .readlink = generic_readlink, | |
2831 | .follow_link = page_follow_link_light, | |
2832 | .put_link = page_put_link, | |
2833 | }; | |
2834 | ||
2835 | EXPORT_SYMBOL(user_path_at); | |
2836 | EXPORT_SYMBOL(follow_down); | |
2837 | EXPORT_SYMBOL(follow_up); | |
2838 | EXPORT_SYMBOL(get_write_access); /* binfmt_aout */ | |
2839 | EXPORT_SYMBOL(getname); | |
2840 | EXPORT_SYMBOL(lock_rename); | |
2841 | EXPORT_SYMBOL(lookup_one_len); | |
2842 | EXPORT_SYMBOL(page_follow_link_light); | |
2843 | EXPORT_SYMBOL(page_put_link); | |
2844 | EXPORT_SYMBOL(page_readlink); | |
2845 | EXPORT_SYMBOL(__page_symlink); | |
2846 | EXPORT_SYMBOL(page_symlink); | |
2847 | EXPORT_SYMBOL(page_symlink_inode_operations); | |
2848 | EXPORT_SYMBOL(path_lookup); | |
2849 | EXPORT_SYMBOL(kern_path); | |
2850 | EXPORT_SYMBOL(vfs_path_lookup); | |
2851 | EXPORT_SYMBOL(inode_permission); | |
2852 | EXPORT_SYMBOL(vfs_permission); | |
2853 | EXPORT_SYMBOL(file_permission); | |
2854 | EXPORT_SYMBOL(unlock_rename); | |
2855 | EXPORT_SYMBOL(vfs_create); | |
2856 | EXPORT_SYMBOL(vfs_follow_link); | |
2857 | EXPORT_SYMBOL(vfs_link); | |
2858 | EXPORT_SYMBOL(vfs_mkdir); | |
2859 | EXPORT_SYMBOL(vfs_mknod); | |
2860 | EXPORT_SYMBOL(generic_permission); | |
2861 | EXPORT_SYMBOL(vfs_readlink); | |
2862 | EXPORT_SYMBOL(vfs_rename); | |
2863 | EXPORT_SYMBOL(vfs_rmdir); | |
2864 | EXPORT_SYMBOL(vfs_symlink); | |
2865 | EXPORT_SYMBOL(vfs_unlink); | |
2866 | EXPORT_SYMBOL(dentry_unhash); | |
2867 | EXPORT_SYMBOL(generic_readlink); |