]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
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> | |
1da177e4 | 22 | #include <linux/pagemap.h> |
0eeca283 | 23 | #include <linux/fsnotify.h> |
1da177e4 LT |
24 | #include <linux/personality.h> |
25 | #include <linux/security.h> | |
6146f0d5 | 26 | #include <linux/ima.h> |
1da177e4 LT |
27 | #include <linux/syscalls.h> |
28 | #include <linux/mount.h> | |
29 | #include <linux/audit.h> | |
16f7e0fe | 30 | #include <linux/capability.h> |
834f2a4a | 31 | #include <linux/file.h> |
5590ff0d | 32 | #include <linux/fcntl.h> |
08ce5f16 | 33 | #include <linux/device_cgroup.h> |
5ad4e53b | 34 | #include <linux/fs_struct.h> |
1da177e4 LT |
35 | #include <asm/uaccess.h> |
36 | ||
e81e3f4d EP |
37 | #include "internal.h" |
38 | ||
1da177e4 LT |
39 | /* [Feb-1997 T. Schoebel-Theuer] |
40 | * Fundamental changes in the pathname lookup mechanisms (namei) | |
41 | * were necessary because of omirr. The reason is that omirr needs | |
42 | * to know the _real_ pathname, not the user-supplied one, in case | |
43 | * of symlinks (and also when transname replacements occur). | |
44 | * | |
45 | * The new code replaces the old recursive symlink resolution with | |
46 | * an iterative one (in case of non-nested symlink chains). It does | |
47 | * this with calls to <fs>_follow_link(). | |
48 | * As a side effect, dir_namei(), _namei() and follow_link() are now | |
49 | * replaced with a single function lookup_dentry() that can handle all | |
50 | * the special cases of the former code. | |
51 | * | |
52 | * With the new dcache, the pathname is stored at each inode, at least as | |
53 | * long as the refcount of the inode is positive. As a side effect, the | |
54 | * size of the dcache depends on the inode cache and thus is dynamic. | |
55 | * | |
56 | * [29-Apr-1998 C. Scott Ananian] Updated above description of symlink | |
57 | * resolution to correspond with current state of the code. | |
58 | * | |
59 | * Note that the symlink resolution is not *completely* iterative. | |
60 | * There is still a significant amount of tail- and mid- recursion in | |
61 | * the algorithm. Also, note that <fs>_readlink() is not used in | |
62 | * lookup_dentry(): lookup_dentry() on the result of <fs>_readlink() | |
63 | * may return different results than <fs>_follow_link(). Many virtual | |
64 | * filesystems (including /proc) exhibit this behavior. | |
65 | */ | |
66 | ||
67 | /* [24-Feb-97 T. Schoebel-Theuer] Side effects caused by new implementation: | |
68 | * New symlink semantics: when open() is called with flags O_CREAT | O_EXCL | |
69 | * and the name already exists in form of a symlink, try to create the new | |
70 | * name indicated by the symlink. The old code always complained that the | |
71 | * name already exists, due to not following the symlink even if its target | |
72 | * is nonexistent. The new semantics affects also mknod() and link() when | |
73 | * the name is a symlink pointing to a non-existant name. | |
74 | * | |
75 | * I don't know which semantics is the right one, since I have no access | |
76 | * to standards. But I found by trial that HP-UX 9.0 has the full "new" | |
77 | * semantics implemented, while SunOS 4.1.1 and Solaris (SunOS 5.4) have the | |
78 | * "old" one. Personally, I think the new semantics is much more logical. | |
79 | * Note that "ln old new" where "new" is a symlink pointing to a non-existing | |
80 | * file does succeed in both HP-UX and SunOs, but not in Solaris | |
81 | * and in the old Linux semantics. | |
82 | */ | |
83 | ||
84 | /* [16-Dec-97 Kevin Buhr] For security reasons, we change some symlink | |
85 | * semantics. See the comments in "open_namei" and "do_link" below. | |
86 | * | |
87 | * [10-Sep-98 Alan Modra] Another symlink change. | |
88 | */ | |
89 | ||
90 | /* [Feb-Apr 2000 AV] Complete rewrite. Rules for symlinks: | |
91 | * inside the path - always follow. | |
92 | * in the last component in creation/removal/renaming - never follow. | |
93 | * if LOOKUP_FOLLOW passed - follow. | |
94 | * if the pathname has trailing slashes - follow. | |
95 | * otherwise - don't follow. | |
96 | * (applied in that order). | |
97 | * | |
98 | * [Jun 2000 AV] Inconsistent behaviour of open() in case if flags==O_CREAT | |
99 | * restored for 2.4. This is the last surviving part of old 4.2BSD bug. | |
100 | * During the 2.4 we need to fix the userland stuff depending on it - | |
101 | * hopefully we will be able to get rid of that wart in 2.5. So far only | |
102 | * XEmacs seems to be relying on it... | |
103 | */ | |
104 | /* | |
105 | * [Sep 2001 AV] Single-semaphore locking scheme (kudos to David Holland) | |
a11f3a05 | 106 | * implemented. Let's see if raised priority of ->s_vfs_rename_mutex gives |
1da177e4 LT |
107 | * any extra contention... |
108 | */ | |
109 | ||
110 | /* In order to reduce some races, while at the same time doing additional | |
111 | * checking and hopefully speeding things up, we copy filenames to the | |
112 | * kernel data space before using them.. | |
113 | * | |
114 | * POSIX.1 2.4: an empty pathname is invalid (ENOENT). | |
115 | * PATH_MAX includes the nul terminator --RR. | |
116 | */ | |
858119e1 | 117 | static int do_getname(const char __user *filename, char *page) |
1da177e4 LT |
118 | { |
119 | int retval; | |
120 | unsigned long len = PATH_MAX; | |
121 | ||
122 | if (!segment_eq(get_fs(), KERNEL_DS)) { | |
123 | if ((unsigned long) filename >= TASK_SIZE) | |
124 | return -EFAULT; | |
125 | if (TASK_SIZE - (unsigned long) filename < PATH_MAX) | |
126 | len = TASK_SIZE - (unsigned long) filename; | |
127 | } | |
128 | ||
129 | retval = strncpy_from_user(page, filename, len); | |
130 | if (retval > 0) { | |
131 | if (retval < len) | |
132 | return 0; | |
133 | return -ENAMETOOLONG; | |
134 | } else if (!retval) | |
135 | retval = -ENOENT; | |
136 | return retval; | |
137 | } | |
138 | ||
139 | char * getname(const char __user * filename) | |
140 | { | |
141 | char *tmp, *result; | |
142 | ||
143 | result = ERR_PTR(-ENOMEM); | |
144 | tmp = __getname(); | |
145 | if (tmp) { | |
146 | int retval = do_getname(filename, tmp); | |
147 | ||
148 | result = tmp; | |
149 | if (retval < 0) { | |
150 | __putname(tmp); | |
151 | result = ERR_PTR(retval); | |
152 | } | |
153 | } | |
154 | audit_getname(result); | |
155 | return result; | |
156 | } | |
157 | ||
158 | #ifdef CONFIG_AUDITSYSCALL | |
159 | void putname(const char *name) | |
160 | { | |
5ac3a9c2 | 161 | if (unlikely(!audit_dummy_context())) |
1da177e4 LT |
162 | audit_putname(name); |
163 | else | |
164 | __putname(name); | |
165 | } | |
166 | EXPORT_SYMBOL(putname); | |
167 | #endif | |
168 | ||
5909ccaa LT |
169 | /* |
170 | * This does basic POSIX ACL permission checking | |
1da177e4 | 171 | */ |
b74c79e9 NP |
172 | static int acl_permission_check(struct inode *inode, int mask, unsigned int flags, |
173 | int (*check_acl)(struct inode *inode, int mask, unsigned int flags)) | |
1da177e4 LT |
174 | { |
175 | umode_t mode = inode->i_mode; | |
176 | ||
e6305c43 AV |
177 | mask &= MAY_READ | MAY_WRITE | MAY_EXEC; |
178 | ||
da9592ed | 179 | if (current_fsuid() == inode->i_uid) |
1da177e4 LT |
180 | mode >>= 6; |
181 | else { | |
182 | if (IS_POSIXACL(inode) && (mode & S_IRWXG) && check_acl) { | |
b74c79e9 NP |
183 | int error = check_acl(inode, mask, flags); |
184 | if (error != -EAGAIN) | |
185 | return error; | |
1da177e4 LT |
186 | } |
187 | ||
188 | if (in_group_p(inode->i_gid)) | |
189 | mode >>= 3; | |
190 | } | |
191 | ||
192 | /* | |
193 | * If the DACs are ok we don't need any capability check. | |
194 | */ | |
e6305c43 | 195 | if ((mask & ~mode) == 0) |
1da177e4 | 196 | return 0; |
5909ccaa LT |
197 | return -EACCES; |
198 | } | |
199 | ||
200 | /** | |
b74c79e9 | 201 | * generic_permission - check for access rights on a Posix-like filesystem |
5909ccaa LT |
202 | * @inode: inode to check access rights for |
203 | * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC) | |
204 | * @check_acl: optional callback to check for Posix ACLs | |
39191628 | 205 | * @flags: IPERM_FLAG_ flags. |
5909ccaa LT |
206 | * |
207 | * Used to check for read/write/execute permissions on a file. | |
208 | * We use "fsuid" for this, letting us set arbitrary permissions | |
209 | * for filesystem access without changing the "normal" uids which | |
b74c79e9 NP |
210 | * are used for other things. |
211 | * | |
212 | * generic_permission is rcu-walk aware. It returns -ECHILD in case an rcu-walk | |
213 | * request cannot be satisfied (eg. requires blocking or too much complexity). | |
214 | * It would then be called again in ref-walk mode. | |
5909ccaa | 215 | */ |
b74c79e9 NP |
216 | int generic_permission(struct inode *inode, int mask, unsigned int flags, |
217 | int (*check_acl)(struct inode *inode, int mask, unsigned int flags)) | |
5909ccaa LT |
218 | { |
219 | int ret; | |
220 | ||
221 | /* | |
222 | * Do the basic POSIX ACL permission checks. | |
223 | */ | |
b74c79e9 | 224 | ret = acl_permission_check(inode, mask, flags, check_acl); |
5909ccaa LT |
225 | if (ret != -EACCES) |
226 | return ret; | |
1da177e4 | 227 | |
1da177e4 LT |
228 | /* |
229 | * Read/write DACs are always overridable. | |
230 | * Executable DACs are overridable if at least one exec bit is set. | |
231 | */ | |
f696a365 | 232 | if (!(mask & MAY_EXEC) || execute_ok(inode)) |
1da177e4 LT |
233 | if (capable(CAP_DAC_OVERRIDE)) |
234 | return 0; | |
235 | ||
236 | /* | |
237 | * Searching includes executable on directories, else just read. | |
238 | */ | |
7ea66001 | 239 | mask &= MAY_READ | MAY_WRITE | MAY_EXEC; |
1da177e4 LT |
240 | if (mask == MAY_READ || (S_ISDIR(inode->i_mode) && !(mask & MAY_WRITE))) |
241 | if (capable(CAP_DAC_READ_SEARCH)) | |
242 | return 0; | |
243 | ||
244 | return -EACCES; | |
245 | } | |
246 | ||
cb23beb5 CH |
247 | /** |
248 | * inode_permission - check for access rights to a given inode | |
249 | * @inode: inode to check permission on | |
250 | * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC) | |
251 | * | |
252 | * Used to check for read/write/execute permissions on an inode. | |
253 | * We use "fsuid" for this, letting us set arbitrary permissions | |
254 | * for filesystem access without changing the "normal" uids which | |
255 | * are used for other things. | |
256 | */ | |
f419a2e3 | 257 | int inode_permission(struct inode *inode, int mask) |
1da177e4 | 258 | { |
e6305c43 | 259 | int retval; |
1da177e4 LT |
260 | |
261 | if (mask & MAY_WRITE) { | |
22590e41 | 262 | umode_t mode = inode->i_mode; |
1da177e4 LT |
263 | |
264 | /* | |
265 | * Nobody gets write access to a read-only fs. | |
266 | */ | |
267 | if (IS_RDONLY(inode) && | |
268 | (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode))) | |
269 | return -EROFS; | |
270 | ||
271 | /* | |
272 | * Nobody gets write access to an immutable file. | |
273 | */ | |
274 | if (IS_IMMUTABLE(inode)) | |
275 | return -EACCES; | |
276 | } | |
277 | ||
acfa4380 | 278 | if (inode->i_op->permission) |
b74c79e9 | 279 | retval = inode->i_op->permission(inode, mask, 0); |
f696a365 | 280 | else |
b74c79e9 NP |
281 | retval = generic_permission(inode, mask, 0, |
282 | inode->i_op->check_acl); | |
f696a365 | 283 | |
1da177e4 LT |
284 | if (retval) |
285 | return retval; | |
286 | ||
08ce5f16 SH |
287 | retval = devcgroup_inode_permission(inode, mask); |
288 | if (retval) | |
289 | return retval; | |
290 | ||
d09ca739 | 291 | return security_inode_permission(inode, mask); |
1da177e4 LT |
292 | } |
293 | ||
8c744fb8 CH |
294 | /** |
295 | * file_permission - check for additional access rights to a given file | |
296 | * @file: file to check access rights for | |
297 | * @mask: right to check for (%MAY_READ, %MAY_WRITE, %MAY_EXEC) | |
298 | * | |
299 | * Used to check for read/write/execute permissions on an already opened | |
300 | * file. | |
301 | * | |
302 | * Note: | |
303 | * Do not use this function in new code. All access checks should | |
cb23beb5 | 304 | * be done using inode_permission(). |
8c744fb8 CH |
305 | */ |
306 | int file_permission(struct file *file, int mask) | |
307 | { | |
f419a2e3 | 308 | return inode_permission(file->f_path.dentry->d_inode, mask); |
8c744fb8 CH |
309 | } |
310 | ||
1da177e4 LT |
311 | /* |
312 | * get_write_access() gets write permission for a file. | |
313 | * put_write_access() releases this write permission. | |
314 | * This is used for regular files. | |
315 | * We cannot support write (and maybe mmap read-write shared) accesses and | |
316 | * MAP_DENYWRITE mmappings simultaneously. The i_writecount field of an inode | |
317 | * can have the following values: | |
318 | * 0: no writers, no VM_DENYWRITE mappings | |
319 | * < 0: (-i_writecount) vm_area_structs with VM_DENYWRITE set exist | |
320 | * > 0: (i_writecount) users are writing to the file. | |
321 | * | |
322 | * Normally we operate on that counter with atomic_{inc,dec} and it's safe | |
323 | * except for the cases where we don't hold i_writecount yet. Then we need to | |
324 | * use {get,deny}_write_access() - these functions check the sign and refuse | |
325 | * to do the change if sign is wrong. Exclusion between them is provided by | |
326 | * the inode->i_lock spinlock. | |
327 | */ | |
328 | ||
329 | int get_write_access(struct inode * inode) | |
330 | { | |
331 | spin_lock(&inode->i_lock); | |
332 | if (atomic_read(&inode->i_writecount) < 0) { | |
333 | spin_unlock(&inode->i_lock); | |
334 | return -ETXTBSY; | |
335 | } | |
336 | atomic_inc(&inode->i_writecount); | |
337 | spin_unlock(&inode->i_lock); | |
338 | ||
339 | return 0; | |
340 | } | |
341 | ||
342 | int deny_write_access(struct file * file) | |
343 | { | |
0f7fc9e4 | 344 | struct inode *inode = file->f_path.dentry->d_inode; |
1da177e4 LT |
345 | |
346 | spin_lock(&inode->i_lock); | |
347 | if (atomic_read(&inode->i_writecount) > 0) { | |
348 | spin_unlock(&inode->i_lock); | |
349 | return -ETXTBSY; | |
350 | } | |
351 | atomic_dec(&inode->i_writecount); | |
352 | spin_unlock(&inode->i_lock); | |
353 | ||
354 | return 0; | |
355 | } | |
356 | ||
5dd784d0 JB |
357 | /** |
358 | * path_get - get a reference to a path | |
359 | * @path: path to get the reference to | |
360 | * | |
361 | * Given a path increment the reference count to the dentry and the vfsmount. | |
362 | */ | |
363 | void path_get(struct path *path) | |
364 | { | |
365 | mntget(path->mnt); | |
366 | dget(path->dentry); | |
367 | } | |
368 | EXPORT_SYMBOL(path_get); | |
369 | ||
b3e19d92 NP |
370 | /** |
371 | * path_get_long - get a long reference to a path | |
372 | * @path: path to get the reference to | |
373 | * | |
374 | * Given a path increment the reference count to the dentry and the vfsmount. | |
375 | */ | |
376 | void path_get_long(struct path *path) | |
377 | { | |
378 | mntget_long(path->mnt); | |
379 | dget(path->dentry); | |
380 | } | |
381 | ||
1d957f9b JB |
382 | /** |
383 | * path_put - put a reference to a path | |
384 | * @path: path to put the reference to | |
385 | * | |
386 | * Given a path decrement the reference count to the dentry and the vfsmount. | |
387 | */ | |
388 | void path_put(struct path *path) | |
1da177e4 | 389 | { |
1d957f9b JB |
390 | dput(path->dentry); |
391 | mntput(path->mnt); | |
1da177e4 | 392 | } |
1d957f9b | 393 | EXPORT_SYMBOL(path_put); |
1da177e4 | 394 | |
b3e19d92 NP |
395 | /** |
396 | * path_put_long - put a long reference to a path | |
397 | * @path: path to put the reference to | |
398 | * | |
399 | * Given a path decrement the reference count to the dentry and the vfsmount. | |
400 | */ | |
401 | void path_put_long(struct path *path) | |
402 | { | |
403 | dput(path->dentry); | |
404 | mntput_long(path->mnt); | |
405 | } | |
406 | ||
31e6b01f NP |
407 | /** |
408 | * nameidata_drop_rcu - drop this nameidata out of rcu-walk | |
409 | * @nd: nameidata pathwalk data to drop | |
39191628 | 410 | * Returns: 0 on success, -ECHILD on failure |
31e6b01f NP |
411 | * |
412 | * Path walking has 2 modes, rcu-walk and ref-walk (see | |
413 | * Documentation/filesystems/path-lookup.txt). __drop_rcu* functions attempt | |
414 | * to drop out of rcu-walk mode and take normal reference counts on dentries | |
415 | * and vfsmounts to transition to rcu-walk mode. __drop_rcu* functions take | |
416 | * refcounts at the last known good point before rcu-walk got stuck, so | |
417 | * ref-walk may continue from there. If this is not successful (eg. a seqcount | |
418 | * has changed), then failure is returned and path walk restarts from the | |
419 | * beginning in ref-walk mode. | |
420 | * | |
421 | * nameidata_drop_rcu attempts to drop the current nd->path and nd->root into | |
422 | * ref-walk. Must be called from rcu-walk context. | |
423 | */ | |
424 | static int nameidata_drop_rcu(struct nameidata *nd) | |
425 | { | |
426 | struct fs_struct *fs = current->fs; | |
427 | struct dentry *dentry = nd->path.dentry; | |
428 | ||
429 | BUG_ON(!(nd->flags & LOOKUP_RCU)); | |
430 | if (nd->root.mnt) { | |
431 | spin_lock(&fs->lock); | |
432 | if (nd->root.mnt != fs->root.mnt || | |
433 | nd->root.dentry != fs->root.dentry) | |
434 | goto err_root; | |
435 | } | |
436 | spin_lock(&dentry->d_lock); | |
437 | if (!__d_rcu_to_refcount(dentry, nd->seq)) | |
438 | goto err; | |
439 | BUG_ON(nd->inode != dentry->d_inode); | |
440 | spin_unlock(&dentry->d_lock); | |
441 | if (nd->root.mnt) { | |
442 | path_get(&nd->root); | |
443 | spin_unlock(&fs->lock); | |
444 | } | |
445 | mntget(nd->path.mnt); | |
446 | ||
447 | rcu_read_unlock(); | |
448 | br_read_unlock(vfsmount_lock); | |
449 | nd->flags &= ~LOOKUP_RCU; | |
450 | return 0; | |
451 | err: | |
452 | spin_unlock(&dentry->d_lock); | |
453 | err_root: | |
454 | if (nd->root.mnt) | |
455 | spin_unlock(&fs->lock); | |
456 | return -ECHILD; | |
457 | } | |
458 | ||
459 | /* Try to drop out of rcu-walk mode if we were in it, otherwise do nothing. */ | |
460 | static inline int nameidata_drop_rcu_maybe(struct nameidata *nd) | |
461 | { | |
462 | if (nd->flags & LOOKUP_RCU) | |
463 | return nameidata_drop_rcu(nd); | |
464 | return 0; | |
465 | } | |
466 | ||
467 | /** | |
468 | * nameidata_dentry_drop_rcu - drop nameidata and dentry out of rcu-walk | |
469 | * @nd: nameidata pathwalk data to drop | |
470 | * @dentry: dentry to drop | |
39191628 | 471 | * Returns: 0 on success, -ECHILD on failure |
31e6b01f NP |
472 | * |
473 | * nameidata_dentry_drop_rcu attempts to drop the current nd->path and nd->root, | |
474 | * and dentry into ref-walk. @dentry must be a path found by a do_lookup call on | |
475 | * @nd. Must be called from rcu-walk context. | |
476 | */ | |
477 | static int nameidata_dentry_drop_rcu(struct nameidata *nd, struct dentry *dentry) | |
478 | { | |
479 | struct fs_struct *fs = current->fs; | |
480 | struct dentry *parent = nd->path.dentry; | |
481 | ||
90dbb77b NP |
482 | /* |
483 | * It can be possible to revalidate the dentry that we started | |
484 | * the path walk with. force_reval_path may also revalidate the | |
485 | * dentry already committed to the nameidata. | |
486 | */ | |
487 | if (unlikely(parent == dentry)) | |
488 | return nameidata_drop_rcu(nd); | |
489 | ||
31e6b01f NP |
490 | BUG_ON(!(nd->flags & LOOKUP_RCU)); |
491 | if (nd->root.mnt) { | |
492 | spin_lock(&fs->lock); | |
493 | if (nd->root.mnt != fs->root.mnt || | |
494 | nd->root.dentry != fs->root.dentry) | |
495 | goto err_root; | |
496 | } | |
497 | spin_lock(&parent->d_lock); | |
498 | spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED); | |
499 | if (!__d_rcu_to_refcount(dentry, nd->seq)) | |
500 | goto err; | |
501 | /* | |
502 | * If the sequence check on the child dentry passed, then the child has | |
503 | * not been removed from its parent. This means the parent dentry must | |
504 | * be valid and able to take a reference at this point. | |
505 | */ | |
506 | BUG_ON(!IS_ROOT(dentry) && dentry->d_parent != parent); | |
507 | BUG_ON(!parent->d_count); | |
508 | parent->d_count++; | |
509 | spin_unlock(&dentry->d_lock); | |
510 | spin_unlock(&parent->d_lock); | |
511 | if (nd->root.mnt) { | |
512 | path_get(&nd->root); | |
513 | spin_unlock(&fs->lock); | |
514 | } | |
515 | mntget(nd->path.mnt); | |
516 | ||
517 | rcu_read_unlock(); | |
518 | br_read_unlock(vfsmount_lock); | |
519 | nd->flags &= ~LOOKUP_RCU; | |
520 | return 0; | |
521 | err: | |
522 | spin_unlock(&dentry->d_lock); | |
523 | spin_unlock(&parent->d_lock); | |
524 | err_root: | |
525 | if (nd->root.mnt) | |
526 | spin_unlock(&fs->lock); | |
527 | return -ECHILD; | |
528 | } | |
529 | ||
530 | /* Try to drop out of rcu-walk mode if we were in it, otherwise do nothing. */ | |
531 | static inline int nameidata_dentry_drop_rcu_maybe(struct nameidata *nd, struct dentry *dentry) | |
532 | { | |
533 | if (nd->flags & LOOKUP_RCU) | |
534 | return nameidata_dentry_drop_rcu(nd, dentry); | |
535 | return 0; | |
536 | } | |
537 | ||
538 | /** | |
539 | * nameidata_drop_rcu_last - drop nameidata ending path walk out of rcu-walk | |
540 | * @nd: nameidata pathwalk data to drop | |
39191628 | 541 | * Returns: 0 on success, -ECHILD on failure |
31e6b01f NP |
542 | * |
543 | * nameidata_drop_rcu_last attempts to drop the current nd->path into ref-walk. | |
544 | * nd->path should be the final element of the lookup, so nd->root is discarded. | |
545 | * Must be called from rcu-walk context. | |
546 | */ | |
547 | static int nameidata_drop_rcu_last(struct nameidata *nd) | |
548 | { | |
549 | struct dentry *dentry = nd->path.dentry; | |
550 | ||
551 | BUG_ON(!(nd->flags & LOOKUP_RCU)); | |
552 | nd->flags &= ~LOOKUP_RCU; | |
553 | nd->root.mnt = NULL; | |
554 | spin_lock(&dentry->d_lock); | |
555 | if (!__d_rcu_to_refcount(dentry, nd->seq)) | |
556 | goto err_unlock; | |
557 | BUG_ON(nd->inode != dentry->d_inode); | |
558 | spin_unlock(&dentry->d_lock); | |
559 | ||
560 | mntget(nd->path.mnt); | |
561 | ||
562 | rcu_read_unlock(); | |
563 | br_read_unlock(vfsmount_lock); | |
564 | ||
565 | return 0; | |
566 | ||
567 | err_unlock: | |
568 | spin_unlock(&dentry->d_lock); | |
569 | rcu_read_unlock(); | |
570 | br_read_unlock(vfsmount_lock); | |
571 | return -ECHILD; | |
572 | } | |
573 | ||
574 | /* Try to drop out of rcu-walk mode if we were in it, otherwise do nothing. */ | |
575 | static inline int nameidata_drop_rcu_last_maybe(struct nameidata *nd) | |
576 | { | |
577 | if (likely(nd->flags & LOOKUP_RCU)) | |
578 | return nameidata_drop_rcu_last(nd); | |
579 | return 0; | |
580 | } | |
581 | ||
834f2a4a TM |
582 | /** |
583 | * release_open_intent - free up open intent resources | |
584 | * @nd: pointer to nameidata | |
585 | */ | |
586 | void release_open_intent(struct nameidata *nd) | |
587 | { | |
0f7fc9e4 | 588 | if (nd->intent.open.file->f_path.dentry == NULL) |
834f2a4a TM |
589 | put_filp(nd->intent.open.file); |
590 | else | |
591 | fput(nd->intent.open.file); | |
592 | } | |
593 | ||
bb20c18d NP |
594 | /* |
595 | * Call d_revalidate and handle filesystems that request rcu-walk | |
596 | * to be dropped. This may be called and return in rcu-walk mode, | |
597 | * regardless of success or error. If -ECHILD is returned, the caller | |
598 | * must return -ECHILD back up the path walk stack so path walk may | |
599 | * be restarted in ref-walk mode. | |
600 | */ | |
34286d66 NP |
601 | static int d_revalidate(struct dentry *dentry, struct nameidata *nd) |
602 | { | |
603 | int status; | |
604 | ||
605 | status = dentry->d_op->d_revalidate(dentry, nd); | |
606 | if (status == -ECHILD) { | |
607 | if (nameidata_dentry_drop_rcu(nd, dentry)) | |
608 | return status; | |
609 | status = dentry->d_op->d_revalidate(dentry, nd); | |
610 | } | |
611 | ||
612 | return status; | |
613 | } | |
614 | ||
bcdc5e01 IK |
615 | static inline struct dentry * |
616 | do_revalidate(struct dentry *dentry, struct nameidata *nd) | |
617 | { | |
34286d66 NP |
618 | int status; |
619 | ||
620 | status = d_revalidate(dentry, nd); | |
bcdc5e01 IK |
621 | if (unlikely(status <= 0)) { |
622 | /* | |
623 | * The dentry failed validation. | |
624 | * If d_revalidate returned 0 attempt to invalidate | |
625 | * the dentry otherwise d_revalidate is asking us | |
626 | * to return a fail status. | |
627 | */ | |
34286d66 NP |
628 | if (status < 0) { |
629 | /* If we're in rcu-walk, we don't have a ref */ | |
630 | if (!(nd->flags & LOOKUP_RCU)) | |
631 | dput(dentry); | |
632 | dentry = ERR_PTR(status); | |
633 | ||
634 | } else { | |
635 | /* Don't d_invalidate in rcu-walk mode */ | |
636 | if (nameidata_dentry_drop_rcu_maybe(nd, dentry)) | |
637 | return ERR_PTR(-ECHILD); | |
bcdc5e01 IK |
638 | if (!d_invalidate(dentry)) { |
639 | dput(dentry); | |
640 | dentry = NULL; | |
641 | } | |
bcdc5e01 IK |
642 | } |
643 | } | |
644 | return dentry; | |
645 | } | |
646 | ||
fb045adb NP |
647 | static inline int need_reval_dot(struct dentry *dentry) |
648 | { | |
649 | if (likely(!(dentry->d_flags & DCACHE_OP_REVALIDATE))) | |
650 | return 0; | |
651 | ||
652 | if (likely(!(dentry->d_sb->s_type->fs_flags & FS_REVAL_DOT))) | |
653 | return 0; | |
654 | ||
655 | return 1; | |
656 | } | |
657 | ||
39159de2 JL |
658 | /* |
659 | * force_reval_path - force revalidation of a dentry | |
660 | * | |
661 | * In some situations the path walking code will trust dentries without | |
662 | * revalidating them. This causes problems for filesystems that depend on | |
663 | * d_revalidate to handle file opens (e.g. NFSv4). When FS_REVAL_DOT is set | |
664 | * (which indicates that it's possible for the dentry to go stale), force | |
665 | * a d_revalidate call before proceeding. | |
666 | * | |
667 | * Returns 0 if the revalidation was successful. If the revalidation fails, | |
668 | * either return the error returned by d_revalidate or -ESTALE if the | |
669 | * revalidation it just returned 0. If d_revalidate returns 0, we attempt to | |
670 | * invalidate the dentry. It's up to the caller to handle putting references | |
671 | * to the path if necessary. | |
672 | */ | |
673 | static int | |
674 | force_reval_path(struct path *path, struct nameidata *nd) | |
675 | { | |
676 | int status; | |
677 | struct dentry *dentry = path->dentry; | |
678 | ||
679 | /* | |
680 | * only check on filesystems where it's possible for the dentry to | |
fb045adb | 681 | * become stale. |
39159de2 | 682 | */ |
fb045adb | 683 | if (!need_reval_dot(dentry)) |
39159de2 JL |
684 | return 0; |
685 | ||
34286d66 | 686 | status = d_revalidate(dentry, nd); |
39159de2 JL |
687 | if (status > 0) |
688 | return 0; | |
689 | ||
690 | if (!status) { | |
bb20c18d NP |
691 | /* Don't d_invalidate in rcu-walk mode */ |
692 | if (nameidata_drop_rcu(nd)) | |
693 | return -ECHILD; | |
39159de2 JL |
694 | d_invalidate(dentry); |
695 | status = -ESTALE; | |
696 | } | |
697 | return status; | |
698 | } | |
699 | ||
1da177e4 | 700 | /* |
b75b5086 AV |
701 | * Short-cut version of permission(), for calling on directories |
702 | * during pathname resolution. Combines parts of permission() | |
703 | * and generic_permission(), and tests ONLY for MAY_EXEC permission. | |
1da177e4 LT |
704 | * |
705 | * If appropriate, check DAC only. If not appropriate, or | |
b75b5086 | 706 | * short-cut DAC fails, then call ->permission() to do more |
1da177e4 LT |
707 | * complete permission check. |
708 | */ | |
b74c79e9 | 709 | static inline int exec_permission(struct inode *inode, unsigned int flags) |
1da177e4 | 710 | { |
5909ccaa | 711 | int ret; |
1da177e4 | 712 | |
cb9179ea | 713 | if (inode->i_op->permission) { |
b74c79e9 NP |
714 | ret = inode->i_op->permission(inode, MAY_EXEC, flags); |
715 | } else { | |
716 | ret = acl_permission_check(inode, MAY_EXEC, flags, | |
717 | inode->i_op->check_acl); | |
cb9179ea | 718 | } |
b74c79e9 | 719 | if (likely(!ret)) |
1da177e4 | 720 | goto ok; |
b74c79e9 | 721 | if (ret == -ECHILD) |
31e6b01f | 722 | return ret; |
1da177e4 | 723 | |
f1ac9f6b | 724 | if (capable(CAP_DAC_OVERRIDE) || capable(CAP_DAC_READ_SEARCH)) |
1da177e4 LT |
725 | goto ok; |
726 | ||
5909ccaa | 727 | return ret; |
1da177e4 | 728 | ok: |
b74c79e9 | 729 | return security_inode_exec_permission(inode, flags); |
1da177e4 LT |
730 | } |
731 | ||
2a737871 AV |
732 | static __always_inline void set_root(struct nameidata *nd) |
733 | { | |
f7ad3c6b MS |
734 | if (!nd->root.mnt) |
735 | get_fs_root(current->fs, &nd->root); | |
2a737871 AV |
736 | } |
737 | ||
6de88d72 AV |
738 | static int link_path_walk(const char *, struct nameidata *); |
739 | ||
31e6b01f NP |
740 | static __always_inline void set_root_rcu(struct nameidata *nd) |
741 | { | |
742 | if (!nd->root.mnt) { | |
743 | struct fs_struct *fs = current->fs; | |
c28cc364 NP |
744 | unsigned seq; |
745 | ||
746 | do { | |
747 | seq = read_seqcount_begin(&fs->seq); | |
748 | nd->root = fs->root; | |
749 | } while (read_seqcount_retry(&fs->seq, seq)); | |
31e6b01f NP |
750 | } |
751 | } | |
752 | ||
f1662356 | 753 | static __always_inline int __vfs_follow_link(struct nameidata *nd, const char *link) |
1da177e4 | 754 | { |
31e6b01f NP |
755 | int ret; |
756 | ||
1da177e4 LT |
757 | if (IS_ERR(link)) |
758 | goto fail; | |
759 | ||
760 | if (*link == '/') { | |
2a737871 | 761 | set_root(nd); |
1d957f9b | 762 | path_put(&nd->path); |
2a737871 AV |
763 | nd->path = nd->root; |
764 | path_get(&nd->root); | |
1da177e4 | 765 | } |
31e6b01f | 766 | nd->inode = nd->path.dentry->d_inode; |
b4091d5f | 767 | |
31e6b01f NP |
768 | ret = link_path_walk(link, nd); |
769 | return ret; | |
1da177e4 | 770 | fail: |
1d957f9b | 771 | path_put(&nd->path); |
1da177e4 LT |
772 | return PTR_ERR(link); |
773 | } | |
774 | ||
1d957f9b | 775 | static void path_put_conditional(struct path *path, struct nameidata *nd) |
051d3812 IK |
776 | { |
777 | dput(path->dentry); | |
4ac91378 | 778 | if (path->mnt != nd->path.mnt) |
051d3812 IK |
779 | mntput(path->mnt); |
780 | } | |
781 | ||
7b9337aa NP |
782 | static inline void path_to_nameidata(const struct path *path, |
783 | struct nameidata *nd) | |
051d3812 | 784 | { |
31e6b01f NP |
785 | if (!(nd->flags & LOOKUP_RCU)) { |
786 | dput(nd->path.dentry); | |
787 | if (nd->path.mnt != path->mnt) | |
788 | mntput(nd->path.mnt); | |
9a229683 | 789 | } |
31e6b01f | 790 | nd->path.mnt = path->mnt; |
4ac91378 | 791 | nd->path.dentry = path->dentry; |
051d3812 IK |
792 | } |
793 | ||
def4af30 | 794 | static __always_inline int |
7b9337aa | 795 | __do_follow_link(const struct path *link, struct nameidata *nd, void **p) |
1da177e4 LT |
796 | { |
797 | int error; | |
7b9337aa | 798 | struct dentry *dentry = link->dentry; |
1da177e4 | 799 | |
7b9337aa | 800 | touch_atime(link->mnt, dentry); |
1da177e4 | 801 | nd_set_link(nd, NULL); |
cd4e91d3 | 802 | |
87556ef1 DH |
803 | if (link->mnt == nd->path.mnt) |
804 | mntget(link->mnt); | |
31e6b01f | 805 | |
86acdca1 | 806 | nd->last_type = LAST_BIND; |
def4af30 AV |
807 | *p = dentry->d_inode->i_op->follow_link(dentry, nd); |
808 | error = PTR_ERR(*p); | |
809 | if (!IS_ERR(*p)) { | |
1da177e4 | 810 | char *s = nd_get_link(nd); |
cc314eef | 811 | error = 0; |
1da177e4 LT |
812 | if (s) |
813 | error = __vfs_follow_link(nd, s); | |
39159de2 JL |
814 | else if (nd->last_type == LAST_BIND) { |
815 | error = force_reval_path(&nd->path, nd); | |
816 | if (error) | |
817 | path_put(&nd->path); | |
818 | } | |
1da177e4 | 819 | } |
1da177e4 LT |
820 | return error; |
821 | } | |
822 | ||
823 | /* | |
824 | * This limits recursive symlink follows to 8, while | |
825 | * limiting consecutive symlinks to 40. | |
826 | * | |
827 | * Without that kind of total limit, nasty chains of consecutive | |
828 | * symlinks can cause almost arbitrarily long lookups. | |
829 | */ | |
90ebe565 | 830 | static inline int do_follow_link(struct path *path, struct nameidata *nd) |
1da177e4 | 831 | { |
def4af30 | 832 | void *cookie; |
1da177e4 LT |
833 | int err = -ELOOP; |
834 | if (current->link_count >= MAX_NESTED_LINKS) | |
835 | goto loop; | |
836 | if (current->total_link_count >= 40) | |
837 | goto loop; | |
838 | BUG_ON(nd->depth >= MAX_NESTED_LINKS); | |
839 | cond_resched(); | |
90ebe565 | 840 | err = security_inode_follow_link(path->dentry, nd); |
1da177e4 LT |
841 | if (err) |
842 | goto loop; | |
843 | current->link_count++; | |
844 | current->total_link_count++; | |
845 | nd->depth++; | |
def4af30 AV |
846 | err = __do_follow_link(path, nd, &cookie); |
847 | if (!IS_ERR(cookie) && path->dentry->d_inode->i_op->put_link) | |
848 | path->dentry->d_inode->i_op->put_link(path->dentry, nd, cookie); | |
258fa999 | 849 | path_put(path); |
839d9f93 AV |
850 | current->link_count--; |
851 | nd->depth--; | |
1da177e4 LT |
852 | return err; |
853 | loop: | |
1d957f9b JB |
854 | path_put_conditional(path, nd); |
855 | path_put(&nd->path); | |
1da177e4 LT |
856 | return err; |
857 | } | |
858 | ||
31e6b01f NP |
859 | static int follow_up_rcu(struct path *path) |
860 | { | |
861 | struct vfsmount *parent; | |
862 | struct dentry *mountpoint; | |
863 | ||
864 | parent = path->mnt->mnt_parent; | |
865 | if (parent == path->mnt) | |
866 | return 0; | |
867 | mountpoint = path->mnt->mnt_mountpoint; | |
868 | path->dentry = mountpoint; | |
869 | path->mnt = parent; | |
870 | return 1; | |
871 | } | |
872 | ||
bab77ebf | 873 | int follow_up(struct path *path) |
1da177e4 LT |
874 | { |
875 | struct vfsmount *parent; | |
876 | struct dentry *mountpoint; | |
99b7db7b NP |
877 | |
878 | br_read_lock(vfsmount_lock); | |
bab77ebf AV |
879 | parent = path->mnt->mnt_parent; |
880 | if (parent == path->mnt) { | |
99b7db7b | 881 | br_read_unlock(vfsmount_lock); |
1da177e4 LT |
882 | return 0; |
883 | } | |
884 | mntget(parent); | |
bab77ebf | 885 | mountpoint = dget(path->mnt->mnt_mountpoint); |
99b7db7b | 886 | br_read_unlock(vfsmount_lock); |
bab77ebf AV |
887 | dput(path->dentry); |
888 | path->dentry = mountpoint; | |
889 | mntput(path->mnt); | |
890 | path->mnt = parent; | |
1da177e4 LT |
891 | return 1; |
892 | } | |
893 | ||
b5c84bf6 | 894 | /* |
9875cf80 DH |
895 | * Perform an automount |
896 | * - return -EISDIR to tell follow_managed() to stop and return the path we | |
897 | * were called with. | |
1da177e4 | 898 | */ |
9875cf80 DH |
899 | static int follow_automount(struct path *path, unsigned flags, |
900 | bool *need_mntput) | |
31e6b01f | 901 | { |
9875cf80 DH |
902 | struct vfsmount *mnt; |
903 | ||
904 | if (!path->dentry->d_op || !path->dentry->d_op->d_automount) | |
905 | return -EREMOTE; | |
906 | ||
6f45b656 DH |
907 | /* We don't want to mount if someone supplied AT_NO_AUTOMOUNT |
908 | * and this is the terminal part of the path. | |
909 | */ | |
910 | if ((flags & LOOKUP_NO_AUTOMOUNT) && !(flags & LOOKUP_CONTINUE)) | |
911 | return -EISDIR; /* we actually want to stop here */ | |
912 | ||
9875cf80 DH |
913 | /* We want to mount if someone is trying to open/create a file of any |
914 | * type under the mountpoint, wants to traverse through the mountpoint | |
915 | * or wants to open the mounted directory. | |
916 | * | |
917 | * We don't want to mount if someone's just doing a stat and they've | |
918 | * set AT_SYMLINK_NOFOLLOW - unless they're stat'ing a directory and | |
919 | * appended a '/' to the name. | |
920 | */ | |
921 | if (!(flags & LOOKUP_FOLLOW) && | |
922 | !(flags & (LOOKUP_CONTINUE | LOOKUP_DIRECTORY | | |
923 | LOOKUP_OPEN | LOOKUP_CREATE))) | |
924 | return -EISDIR; | |
925 | ||
926 | current->total_link_count++; | |
927 | if (current->total_link_count >= 40) | |
928 | return -ELOOP; | |
929 | ||
930 | mnt = path->dentry->d_op->d_automount(path); | |
931 | if (IS_ERR(mnt)) { | |
932 | /* | |
933 | * The filesystem is allowed to return -EISDIR here to indicate | |
934 | * it doesn't want to automount. For instance, autofs would do | |
935 | * this so that its userspace daemon can mount on this dentry. | |
936 | * | |
937 | * However, we can only permit this if it's a terminal point in | |
938 | * the path being looked up; if it wasn't then the remainder of | |
939 | * the path is inaccessible and we should say so. | |
940 | */ | |
941 | if (PTR_ERR(mnt) == -EISDIR && (flags & LOOKUP_CONTINUE)) | |
942 | return -EREMOTE; | |
943 | return PTR_ERR(mnt); | |
31e6b01f | 944 | } |
9875cf80 DH |
945 | if (!mnt) /* mount collision */ |
946 | return 0; | |
31e6b01f | 947 | |
9875cf80 DH |
948 | if (mnt->mnt_sb == path->mnt->mnt_sb && |
949 | mnt->mnt_root == path->dentry) { | |
950 | mntput(mnt); | |
951 | return -ELOOP; | |
463ffb2e | 952 | } |
9875cf80 DH |
953 | |
954 | dput(path->dentry); | |
955 | if (*need_mntput) | |
956 | mntput(path->mnt); | |
957 | path->mnt = mnt; | |
958 | path->dentry = dget(mnt->mnt_root); | |
959 | *need_mntput = true; | |
960 | return 0; | |
463ffb2e AV |
961 | } |
962 | ||
9875cf80 DH |
963 | /* |
964 | * Handle a dentry that is managed in some way. | |
cc53ce53 | 965 | * - Flagged for transit management (autofs) |
9875cf80 DH |
966 | * - Flagged as mountpoint |
967 | * - Flagged as automount point | |
968 | * | |
969 | * This may only be called in refwalk mode. | |
970 | * | |
971 | * Serialization is taken care of in namespace.c | |
972 | */ | |
973 | static int follow_managed(struct path *path, unsigned flags) | |
1da177e4 | 974 | { |
9875cf80 DH |
975 | unsigned managed; |
976 | bool need_mntput = false; | |
977 | int ret; | |
978 | ||
979 | /* Given that we're not holding a lock here, we retain the value in a | |
980 | * local variable for each dentry as we look at it so that we don't see | |
981 | * the components of that value change under us */ | |
982 | while (managed = ACCESS_ONCE(path->dentry->d_flags), | |
983 | managed &= DCACHE_MANAGED_DENTRY, | |
984 | unlikely(managed != 0)) { | |
cc53ce53 DH |
985 | /* Allow the filesystem to manage the transit without i_mutex |
986 | * being held. */ | |
987 | if (managed & DCACHE_MANAGE_TRANSIT) { | |
988 | BUG_ON(!path->dentry->d_op); | |
989 | BUG_ON(!path->dentry->d_op->d_manage); | |
990 | ret = path->dentry->d_op->d_manage(path->dentry, false); | |
991 | if (ret < 0) | |
992 | return ret == -EISDIR ? 0 : ret; | |
993 | } | |
994 | ||
9875cf80 DH |
995 | /* Transit to a mounted filesystem. */ |
996 | if (managed & DCACHE_MOUNTED) { | |
997 | struct vfsmount *mounted = lookup_mnt(path); | |
998 | if (mounted) { | |
999 | dput(path->dentry); | |
1000 | if (need_mntput) | |
1001 | mntput(path->mnt); | |
1002 | path->mnt = mounted; | |
1003 | path->dentry = dget(mounted->mnt_root); | |
1004 | need_mntput = true; | |
1005 | continue; | |
1006 | } | |
1007 | ||
1008 | /* Something is mounted on this dentry in another | |
1009 | * namespace and/or whatever was mounted there in this | |
1010 | * namespace got unmounted before we managed to get the | |
1011 | * vfsmount_lock */ | |
1012 | } | |
1013 | ||
1014 | /* Handle an automount point */ | |
1015 | if (managed & DCACHE_NEED_AUTOMOUNT) { | |
1016 | ret = follow_automount(path, flags, &need_mntput); | |
1017 | if (ret < 0) | |
1018 | return ret == -EISDIR ? 0 : ret; | |
1019 | continue; | |
1020 | } | |
1021 | ||
1022 | /* We didn't change the current path point */ | |
1023 | break; | |
1da177e4 | 1024 | } |
9875cf80 | 1025 | return 0; |
1da177e4 LT |
1026 | } |
1027 | ||
cc53ce53 | 1028 | int follow_down_one(struct path *path) |
1da177e4 LT |
1029 | { |
1030 | struct vfsmount *mounted; | |
1031 | ||
1c755af4 | 1032 | mounted = lookup_mnt(path); |
1da177e4 | 1033 | if (mounted) { |
9393bd07 AV |
1034 | dput(path->dentry); |
1035 | mntput(path->mnt); | |
1036 | path->mnt = mounted; | |
1037 | path->dentry = dget(mounted->mnt_root); | |
1da177e4 LT |
1038 | return 1; |
1039 | } | |
1040 | return 0; | |
1041 | } | |
1042 | ||
9875cf80 DH |
1043 | /* |
1044 | * Skip to top of mountpoint pile in rcuwalk mode. We abort the rcu-walk if we | |
cc53ce53 | 1045 | * meet a managed dentry and we're not walking to "..". True is returned to |
9875cf80 DH |
1046 | * continue, false to abort. |
1047 | */ | |
1048 | static bool __follow_mount_rcu(struct nameidata *nd, struct path *path, | |
1049 | struct inode **inode, bool reverse_transit) | |
1050 | { | |
cc53ce53 DH |
1051 | unsigned abort_mask = |
1052 | reverse_transit ? 0 : DCACHE_MANAGE_TRANSIT; | |
1053 | ||
9875cf80 DH |
1054 | while (d_mountpoint(path->dentry)) { |
1055 | struct vfsmount *mounted; | |
cc53ce53 DH |
1056 | if (path->dentry->d_flags & abort_mask) |
1057 | return true; | |
9875cf80 DH |
1058 | mounted = __lookup_mnt(path->mnt, path->dentry, 1); |
1059 | if (!mounted) | |
1060 | break; | |
1061 | path->mnt = mounted; | |
1062 | path->dentry = mounted->mnt_root; | |
1063 | nd->seq = read_seqcount_begin(&path->dentry->d_seq); | |
1064 | *inode = path->dentry->d_inode; | |
1065 | } | |
1066 | ||
1067 | if (unlikely(path->dentry->d_flags & DCACHE_NEED_AUTOMOUNT)) | |
1068 | return reverse_transit; | |
1069 | return true; | |
1070 | } | |
1071 | ||
31e6b01f NP |
1072 | static int follow_dotdot_rcu(struct nameidata *nd) |
1073 | { | |
1074 | struct inode *inode = nd->inode; | |
1075 | ||
1076 | set_root_rcu(nd); | |
1077 | ||
9875cf80 | 1078 | while (1) { |
31e6b01f NP |
1079 | if (nd->path.dentry == nd->root.dentry && |
1080 | nd->path.mnt == nd->root.mnt) { | |
1081 | break; | |
1082 | } | |
1083 | if (nd->path.dentry != nd->path.mnt->mnt_root) { | |
1084 | struct dentry *old = nd->path.dentry; | |
1085 | struct dentry *parent = old->d_parent; | |
1086 | unsigned seq; | |
1087 | ||
1088 | seq = read_seqcount_begin(&parent->d_seq); | |
1089 | if (read_seqcount_retry(&old->d_seq, nd->seq)) | |
1090 | return -ECHILD; | |
1091 | inode = parent->d_inode; | |
1092 | nd->path.dentry = parent; | |
1093 | nd->seq = seq; | |
1094 | break; | |
1095 | } | |
1096 | if (!follow_up_rcu(&nd->path)) | |
1097 | break; | |
1098 | nd->seq = read_seqcount_begin(&nd->path.dentry->d_seq); | |
1099 | inode = nd->path.dentry->d_inode; | |
1100 | } | |
9875cf80 | 1101 | __follow_mount_rcu(nd, &nd->path, &inode, true); |
31e6b01f NP |
1102 | nd->inode = inode; |
1103 | ||
1104 | return 0; | |
1105 | } | |
1106 | ||
cc53ce53 DH |
1107 | /* |
1108 | * Follow down to the covering mount currently visible to userspace. At each | |
1109 | * point, the filesystem owning that dentry may be queried as to whether the | |
1110 | * caller is permitted to proceed or not. | |
1111 | * | |
1112 | * Care must be taken as namespace_sem may be held (indicated by mounting_here | |
1113 | * being true). | |
1114 | */ | |
1115 | int follow_down(struct path *path, bool mounting_here) | |
1116 | { | |
1117 | unsigned managed; | |
1118 | int ret; | |
1119 | ||
1120 | while (managed = ACCESS_ONCE(path->dentry->d_flags), | |
1121 | unlikely(managed & DCACHE_MANAGED_DENTRY)) { | |
1122 | /* Allow the filesystem to manage the transit without i_mutex | |
1123 | * being held. | |
1124 | * | |
1125 | * We indicate to the filesystem if someone is trying to mount | |
1126 | * something here. This gives autofs the chance to deny anyone | |
1127 | * other than its daemon the right to mount on its | |
1128 | * superstructure. | |
1129 | * | |
1130 | * The filesystem may sleep at this point. | |
1131 | */ | |
1132 | if (managed & DCACHE_MANAGE_TRANSIT) { | |
1133 | BUG_ON(!path->dentry->d_op); | |
1134 | BUG_ON(!path->dentry->d_op->d_manage); | |
1135 | ret = path->dentry->d_op->d_manage(path->dentry, mounting_here); | |
1136 | if (ret < 0) | |
1137 | return ret == -EISDIR ? 0 : ret; | |
1138 | } | |
1139 | ||
1140 | /* Transit to a mounted filesystem. */ | |
1141 | if (managed & DCACHE_MOUNTED) { | |
1142 | struct vfsmount *mounted = lookup_mnt(path); | |
1143 | if (!mounted) | |
1144 | break; | |
1145 | dput(path->dentry); | |
1146 | mntput(path->mnt); | |
1147 | path->mnt = mounted; | |
1148 | path->dentry = dget(mounted->mnt_root); | |
1149 | continue; | |
1150 | } | |
1151 | ||
1152 | /* Don't handle automount points here */ | |
1153 | break; | |
1154 | } | |
1155 | return 0; | |
1156 | } | |
1157 | ||
9875cf80 DH |
1158 | /* |
1159 | * Skip to top of mountpoint pile in refwalk mode for follow_dotdot() | |
1160 | */ | |
1161 | static void follow_mount(struct path *path) | |
1162 | { | |
1163 | while (d_mountpoint(path->dentry)) { | |
1164 | struct vfsmount *mounted = lookup_mnt(path); | |
1165 | if (!mounted) | |
1166 | break; | |
1167 | dput(path->dentry); | |
1168 | mntput(path->mnt); | |
1169 | path->mnt = mounted; | |
1170 | path->dentry = dget(mounted->mnt_root); | |
1171 | } | |
1172 | } | |
1173 | ||
31e6b01f | 1174 | static void follow_dotdot(struct nameidata *nd) |
1da177e4 | 1175 | { |
2a737871 | 1176 | set_root(nd); |
e518ddb7 | 1177 | |
1da177e4 | 1178 | while(1) { |
4ac91378 | 1179 | struct dentry *old = nd->path.dentry; |
1da177e4 | 1180 | |
2a737871 AV |
1181 | if (nd->path.dentry == nd->root.dentry && |
1182 | nd->path.mnt == nd->root.mnt) { | |
1da177e4 LT |
1183 | break; |
1184 | } | |
4ac91378 | 1185 | if (nd->path.dentry != nd->path.mnt->mnt_root) { |
3088dd70 AV |
1186 | /* rare case of legitimate dget_parent()... */ |
1187 | nd->path.dentry = dget_parent(nd->path.dentry); | |
1da177e4 LT |
1188 | dput(old); |
1189 | break; | |
1190 | } | |
3088dd70 | 1191 | if (!follow_up(&nd->path)) |
1da177e4 | 1192 | break; |
1da177e4 | 1193 | } |
79ed0226 | 1194 | follow_mount(&nd->path); |
31e6b01f | 1195 | nd->inode = nd->path.dentry->d_inode; |
1da177e4 LT |
1196 | } |
1197 | ||
baa03890 NP |
1198 | /* |
1199 | * Allocate a dentry with name and parent, and perform a parent | |
1200 | * directory ->lookup on it. Returns the new dentry, or ERR_PTR | |
1201 | * on error. parent->d_inode->i_mutex must be held. d_lookup must | |
1202 | * have verified that no child exists while under i_mutex. | |
1203 | */ | |
1204 | static struct dentry *d_alloc_and_lookup(struct dentry *parent, | |
1205 | struct qstr *name, struct nameidata *nd) | |
1206 | { | |
1207 | struct inode *inode = parent->d_inode; | |
1208 | struct dentry *dentry; | |
1209 | struct dentry *old; | |
1210 | ||
1211 | /* Don't create child dentry for a dead directory. */ | |
1212 | if (unlikely(IS_DEADDIR(inode))) | |
1213 | return ERR_PTR(-ENOENT); | |
1214 | ||
1215 | dentry = d_alloc(parent, name); | |
1216 | if (unlikely(!dentry)) | |
1217 | return ERR_PTR(-ENOMEM); | |
1218 | ||
1219 | old = inode->i_op->lookup(inode, dentry, nd); | |
1220 | if (unlikely(old)) { | |
1221 | dput(dentry); | |
1222 | dentry = old; | |
1223 | } | |
1224 | return dentry; | |
1225 | } | |
1226 | ||
1da177e4 LT |
1227 | /* |
1228 | * It's more convoluted than I'd like it to be, but... it's still fairly | |
1229 | * small and for now I'd prefer to have fast path as straight as possible. | |
1230 | * It _is_ time-critical. | |
1231 | */ | |
1232 | static int do_lookup(struct nameidata *nd, struct qstr *name, | |
31e6b01f | 1233 | struct path *path, struct inode **inode) |
1da177e4 | 1234 | { |
4ac91378 | 1235 | struct vfsmount *mnt = nd->path.mnt; |
31e6b01f | 1236 | struct dentry *dentry, *parent = nd->path.dentry; |
6e6b1bd1 | 1237 | struct inode *dir; |
9875cf80 DH |
1238 | int err; |
1239 | ||
3cac260a AV |
1240 | /* |
1241 | * See if the low-level filesystem might want | |
1242 | * to use its own hash.. | |
1243 | */ | |
fb045adb | 1244 | if (unlikely(parent->d_flags & DCACHE_OP_HASH)) { |
9875cf80 | 1245 | err = parent->d_op->d_hash(parent, nd->inode, name); |
3cac260a AV |
1246 | if (err < 0) |
1247 | return err; | |
1248 | } | |
1da177e4 | 1249 | |
b04f784e NP |
1250 | /* |
1251 | * Rename seqlock is not required here because in the off chance | |
1252 | * of a false negative due to a concurrent rename, we're going to | |
1253 | * do the non-racy lookup, below. | |
1254 | */ | |
31e6b01f NP |
1255 | if (nd->flags & LOOKUP_RCU) { |
1256 | unsigned seq; | |
1257 | ||
1258 | *inode = nd->inode; | |
1259 | dentry = __d_lookup_rcu(parent, name, &seq, inode); | |
1260 | if (!dentry) { | |
1261 | if (nameidata_drop_rcu(nd)) | |
1262 | return -ECHILD; | |
1263 | goto need_lookup; | |
1264 | } | |
1265 | /* Memory barrier in read_seqcount_begin of child is enough */ | |
1266 | if (__read_seqcount_retry(&parent->d_seq, nd->seq)) | |
1267 | return -ECHILD; | |
1268 | ||
1269 | nd->seq = seq; | |
34286d66 | 1270 | if (dentry->d_flags & DCACHE_OP_REVALIDATE) |
31e6b01f | 1271 | goto need_revalidate; |
1a8edf40 | 1272 | done2: |
31e6b01f NP |
1273 | path->mnt = mnt; |
1274 | path->dentry = dentry; | |
9875cf80 DH |
1275 | if (likely(__follow_mount_rcu(nd, path, inode, false))) |
1276 | return 0; | |
1277 | if (nameidata_drop_rcu(nd)) | |
1278 | return -ECHILD; | |
1279 | /* fallthru */ | |
1280 | } | |
1281 | dentry = __d_lookup(parent, name); | |
1282 | if (!dentry) | |
1283 | goto need_lookup; | |
2e2e88ea | 1284 | found: |
9875cf80 DH |
1285 | if (dentry->d_flags & DCACHE_OP_REVALIDATE) |
1286 | goto need_revalidate; | |
1da177e4 | 1287 | done: |
9875cf80 DH |
1288 | path->mnt = mnt; |
1289 | path->dentry = dentry; | |
1290 | err = follow_managed(path, nd->flags); | |
1291 | if (unlikely(err < 0)) | |
1292 | return err; | |
1293 | *inode = path->dentry->d_inode; | |
1da177e4 LT |
1294 | return 0; |
1295 | ||
1296 | need_lookup: | |
6e6b1bd1 | 1297 | dir = parent->d_inode; |
31e6b01f | 1298 | BUG_ON(nd->inode != dir); |
6e6b1bd1 AV |
1299 | |
1300 | mutex_lock(&dir->i_mutex); | |
1301 | /* | |
1302 | * First re-do the cached lookup just in case it was created | |
b04f784e NP |
1303 | * while we waited for the directory semaphore, or the first |
1304 | * lookup failed due to an unrelated rename. | |
6e6b1bd1 | 1305 | * |
b04f784e NP |
1306 | * This could use version numbering or similar to avoid unnecessary |
1307 | * cache lookups, but then we'd have to do the first lookup in the | |
1308 | * non-racy way. However in the common case here, everything should | |
1309 | * be hot in cache, so would it be a big win? | |
6e6b1bd1 AV |
1310 | */ |
1311 | dentry = d_lookup(parent, name); | |
baa03890 NP |
1312 | if (likely(!dentry)) { |
1313 | dentry = d_alloc_and_lookup(parent, name, nd); | |
6e6b1bd1 AV |
1314 | mutex_unlock(&dir->i_mutex); |
1315 | if (IS_ERR(dentry)) | |
1316 | goto fail; | |
1317 | goto done; | |
1318 | } | |
6e6b1bd1 AV |
1319 | /* |
1320 | * Uhhuh! Nasty case: the cache was re-populated while | |
1321 | * we waited on the semaphore. Need to revalidate. | |
1322 | */ | |
1323 | mutex_unlock(&dir->i_mutex); | |
2e2e88ea | 1324 | goto found; |
1da177e4 LT |
1325 | |
1326 | need_revalidate: | |
bcdc5e01 IK |
1327 | dentry = do_revalidate(dentry, nd); |
1328 | if (!dentry) | |
1329 | goto need_lookup; | |
1330 | if (IS_ERR(dentry)) | |
1331 | goto fail; | |
1a8edf40 AV |
1332 | if (nd->flags & LOOKUP_RCU) |
1333 | goto done2; | |
bcdc5e01 | 1334 | goto done; |
1da177e4 LT |
1335 | |
1336 | fail: | |
1337 | return PTR_ERR(dentry); | |
1338 | } | |
1339 | ||
1340 | /* | |
1341 | * Name resolution. | |
ea3834d9 PM |
1342 | * This is the basic name resolution function, turning a pathname into |
1343 | * the final dentry. We expect 'base' to be positive and a directory. | |
1da177e4 | 1344 | * |
ea3834d9 PM |
1345 | * Returns 0 and nd will have valid dentry and mnt on success. |
1346 | * Returns error and drops reference to input namei data on failure. | |
1da177e4 | 1347 | */ |
6de88d72 | 1348 | static int link_path_walk(const char *name, struct nameidata *nd) |
1da177e4 LT |
1349 | { |
1350 | struct path next; | |
1da177e4 LT |
1351 | int err; |
1352 | unsigned int lookup_flags = nd->flags; | |
1353 | ||
1354 | while (*name=='/') | |
1355 | name++; | |
1356 | if (!*name) | |
1357 | goto return_reval; | |
1358 | ||
1da177e4 | 1359 | if (nd->depth) |
f55eab82 | 1360 | lookup_flags = LOOKUP_FOLLOW | (nd->flags & LOOKUP_CONTINUE); |
1da177e4 LT |
1361 | |
1362 | /* At this point we know we have a real path component. */ | |
1363 | for(;;) { | |
31e6b01f | 1364 | struct inode *inode; |
1da177e4 LT |
1365 | unsigned long hash; |
1366 | struct qstr this; | |
1367 | unsigned int c; | |
1368 | ||
cdce5d6b | 1369 | nd->flags |= LOOKUP_CONTINUE; |
31e6b01f | 1370 | if (nd->flags & LOOKUP_RCU) { |
b74c79e9 | 1371 | err = exec_permission(nd->inode, IPERM_FLAG_RCU); |
31e6b01f NP |
1372 | if (err == -ECHILD) { |
1373 | if (nameidata_drop_rcu(nd)) | |
1374 | return -ECHILD; | |
1375 | goto exec_again; | |
1376 | } | |
1377 | } else { | |
1378 | exec_again: | |
b74c79e9 | 1379 | err = exec_permission(nd->inode, 0); |
31e6b01f | 1380 | } |
1da177e4 LT |
1381 | if (err) |
1382 | break; | |
1383 | ||
1384 | this.name = name; | |
1385 | c = *(const unsigned char *)name; | |
1386 | ||
1387 | hash = init_name_hash(); | |
1388 | do { | |
1389 | name++; | |
1390 | hash = partial_name_hash(c, hash); | |
1391 | c = *(const unsigned char *)name; | |
1392 | } while (c && (c != '/')); | |
1393 | this.len = name - (const char *) this.name; | |
1394 | this.hash = end_name_hash(hash); | |
1395 | ||
1396 | /* remove trailing slashes? */ | |
1397 | if (!c) | |
1398 | goto last_component; | |
1399 | while (*++name == '/'); | |
1400 | if (!*name) | |
1401 | goto last_with_slashes; | |
1402 | ||
1403 | /* | |
1404 | * "." and ".." are special - ".." especially so because it has | |
1405 | * to be able to know about the current root directory and | |
1406 | * parent relationships. | |
1407 | */ | |
1408 | if (this.name[0] == '.') switch (this.len) { | |
1409 | default: | |
1410 | break; | |
31e6b01f | 1411 | case 2: |
1da177e4 LT |
1412 | if (this.name[1] != '.') |
1413 | break; | |
31e6b01f NP |
1414 | if (nd->flags & LOOKUP_RCU) { |
1415 | if (follow_dotdot_rcu(nd)) | |
1416 | return -ECHILD; | |
1417 | } else | |
1418 | follow_dotdot(nd); | |
1da177e4 LT |
1419 | /* fallthrough */ |
1420 | case 1: | |
1421 | continue; | |
1422 | } | |
1da177e4 | 1423 | /* This does the actual lookups.. */ |
31e6b01f | 1424 | err = do_lookup(nd, &this, &next, &inode); |
1da177e4 LT |
1425 | if (err) |
1426 | break; | |
1da177e4 | 1427 | err = -ENOENT; |
1da177e4 LT |
1428 | if (!inode) |
1429 | goto out_dput; | |
1da177e4 LT |
1430 | |
1431 | if (inode->i_op->follow_link) { | |
31e6b01f NP |
1432 | /* We commonly drop rcu-walk here */ |
1433 | if (nameidata_dentry_drop_rcu_maybe(nd, next.dentry)) | |
1434 | return -ECHILD; | |
1435 | BUG_ON(inode != next.dentry->d_inode); | |
90ebe565 | 1436 | err = do_follow_link(&next, nd); |
1da177e4 LT |
1437 | if (err) |
1438 | goto return_err; | |
31e6b01f | 1439 | nd->inode = nd->path.dentry->d_inode; |
1da177e4 | 1440 | err = -ENOENT; |
31e6b01f | 1441 | if (!nd->inode) |
1da177e4 | 1442 | break; |
31e6b01f | 1443 | } else { |
09dd17d3 | 1444 | path_to_nameidata(&next, nd); |
31e6b01f NP |
1445 | nd->inode = inode; |
1446 | } | |
1da177e4 | 1447 | err = -ENOTDIR; |
31e6b01f | 1448 | if (!nd->inode->i_op->lookup) |
1da177e4 LT |
1449 | break; |
1450 | continue; | |
1451 | /* here ends the main loop */ | |
1452 | ||
1453 | last_with_slashes: | |
1454 | lookup_flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY; | |
1455 | last_component: | |
f55eab82 TM |
1456 | /* Clear LOOKUP_CONTINUE iff it was previously unset */ |
1457 | nd->flags &= lookup_flags | ~LOOKUP_CONTINUE; | |
1da177e4 LT |
1458 | if (lookup_flags & LOOKUP_PARENT) |
1459 | goto lookup_parent; | |
1460 | if (this.name[0] == '.') switch (this.len) { | |
1461 | default: | |
1462 | break; | |
31e6b01f | 1463 | case 2: |
1da177e4 LT |
1464 | if (this.name[1] != '.') |
1465 | break; | |
31e6b01f NP |
1466 | if (nd->flags & LOOKUP_RCU) { |
1467 | if (follow_dotdot_rcu(nd)) | |
1468 | return -ECHILD; | |
1469 | } else | |
1470 | follow_dotdot(nd); | |
1da177e4 LT |
1471 | /* fallthrough */ |
1472 | case 1: | |
1473 | goto return_reval; | |
1474 | } | |
31e6b01f | 1475 | err = do_lookup(nd, &this, &next, &inode); |
1da177e4 LT |
1476 | if (err) |
1477 | break; | |
db372915 DH |
1478 | if (inode && unlikely(inode->i_op->follow_link) && |
1479 | (lookup_flags & LOOKUP_FOLLOW)) { | |
31e6b01f NP |
1480 | if (nameidata_dentry_drop_rcu_maybe(nd, next.dentry)) |
1481 | return -ECHILD; | |
1482 | BUG_ON(inode != next.dentry->d_inode); | |
90ebe565 | 1483 | err = do_follow_link(&next, nd); |
1da177e4 LT |
1484 | if (err) |
1485 | goto return_err; | |
31e6b01f NP |
1486 | nd->inode = nd->path.dentry->d_inode; |
1487 | } else { | |
09dd17d3 | 1488 | path_to_nameidata(&next, nd); |
31e6b01f NP |
1489 | nd->inode = inode; |
1490 | } | |
1da177e4 | 1491 | err = -ENOENT; |
31e6b01f | 1492 | if (!nd->inode) |
1da177e4 LT |
1493 | break; |
1494 | if (lookup_flags & LOOKUP_DIRECTORY) { | |
1495 | err = -ENOTDIR; | |
31e6b01f | 1496 | if (!nd->inode->i_op->lookup) |
1da177e4 LT |
1497 | break; |
1498 | } | |
1499 | goto return_base; | |
1500 | lookup_parent: | |
1501 | nd->last = this; | |
1502 | nd->last_type = LAST_NORM; | |
1503 | if (this.name[0] != '.') | |
1504 | goto return_base; | |
1505 | if (this.len == 1) | |
1506 | nd->last_type = LAST_DOT; | |
1507 | else if (this.len == 2 && this.name[1] == '.') | |
1508 | nd->last_type = LAST_DOTDOT; | |
1509 | else | |
1510 | goto return_base; | |
1511 | return_reval: | |
1512 | /* | |
1513 | * We bypassed the ordinary revalidation routines. | |
1514 | * We may need to check the cached dentry for staleness. | |
1515 | */ | |
fb045adb | 1516 | if (need_reval_dot(nd->path.dentry)) { |
1da177e4 | 1517 | /* Note: we do not d_invalidate() */ |
34286d66 NP |
1518 | err = d_revalidate(nd->path.dentry, nd); |
1519 | if (!err) | |
1520 | err = -ESTALE; | |
1521 | if (err < 0) | |
1da177e4 LT |
1522 | break; |
1523 | } | |
1524 | return_base: | |
31e6b01f NP |
1525 | if (nameidata_drop_rcu_last_maybe(nd)) |
1526 | return -ECHILD; | |
1da177e4 LT |
1527 | return 0; |
1528 | out_dput: | |
31e6b01f NP |
1529 | if (!(nd->flags & LOOKUP_RCU)) |
1530 | path_put_conditional(&next, nd); | |
1da177e4 LT |
1531 | break; |
1532 | } | |
31e6b01f NP |
1533 | if (!(nd->flags & LOOKUP_RCU)) |
1534 | path_put(&nd->path); | |
1da177e4 LT |
1535 | return_err: |
1536 | return err; | |
1537 | } | |
1538 | ||
31e6b01f NP |
1539 | static inline int path_walk_rcu(const char *name, struct nameidata *nd) |
1540 | { | |
1541 | current->total_link_count = 0; | |
1542 | ||
1543 | return link_path_walk(name, nd); | |
1544 | } | |
1545 | ||
1546 | static inline int path_walk_simple(const char *name, struct nameidata *nd) | |
1547 | { | |
1548 | current->total_link_count = 0; | |
1549 | ||
1550 | return link_path_walk(name, nd); | |
1551 | } | |
1552 | ||
fc9b52cd | 1553 | static int path_walk(const char *name, struct nameidata *nd) |
1da177e4 | 1554 | { |
6de88d72 AV |
1555 | struct path save = nd->path; |
1556 | int result; | |
1557 | ||
1da177e4 | 1558 | current->total_link_count = 0; |
6de88d72 AV |
1559 | |
1560 | /* make sure the stuff we saved doesn't go away */ | |
1561 | path_get(&save); | |
1562 | ||
1563 | result = link_path_walk(name, nd); | |
1564 | if (result == -ESTALE) { | |
1565 | /* nd->path had been dropped */ | |
1566 | current->total_link_count = 0; | |
1567 | nd->path = save; | |
1568 | path_get(&nd->path); | |
1569 | nd->flags |= LOOKUP_REVAL; | |
1570 | result = link_path_walk(name, nd); | |
1571 | } | |
1572 | ||
1573 | path_put(&save); | |
1574 | ||
1575 | return result; | |
1da177e4 LT |
1576 | } |
1577 | ||
31e6b01f NP |
1578 | static void path_finish_rcu(struct nameidata *nd) |
1579 | { | |
1580 | if (nd->flags & LOOKUP_RCU) { | |
1581 | /* RCU dangling. Cancel it. */ | |
1582 | nd->flags &= ~LOOKUP_RCU; | |
1583 | nd->root.mnt = NULL; | |
1584 | rcu_read_unlock(); | |
1585 | br_read_unlock(vfsmount_lock); | |
1586 | } | |
1587 | if (nd->file) | |
1588 | fput(nd->file); | |
1589 | } | |
1590 | ||
1591 | static int path_init_rcu(int dfd, const char *name, unsigned int flags, struct nameidata *nd) | |
1592 | { | |
1593 | int retval = 0; | |
1594 | int fput_needed; | |
1595 | struct file *file; | |
1596 | ||
1597 | nd->last_type = LAST_ROOT; /* if there are only slashes... */ | |
1598 | nd->flags = flags | LOOKUP_RCU; | |
1599 | nd->depth = 0; | |
1600 | nd->root.mnt = NULL; | |
1601 | nd->file = NULL; | |
1602 | ||
1603 | if (*name=='/') { | |
1604 | struct fs_struct *fs = current->fs; | |
c28cc364 | 1605 | unsigned seq; |
31e6b01f NP |
1606 | |
1607 | br_read_lock(vfsmount_lock); | |
1608 | rcu_read_lock(); | |
1609 | ||
c28cc364 NP |
1610 | do { |
1611 | seq = read_seqcount_begin(&fs->seq); | |
1612 | nd->root = fs->root; | |
1613 | nd->path = nd->root; | |
1614 | nd->seq = __read_seqcount_begin(&nd->path.dentry->d_seq); | |
1615 | } while (read_seqcount_retry(&fs->seq, seq)); | |
31e6b01f NP |
1616 | |
1617 | } else if (dfd == AT_FDCWD) { | |
1618 | struct fs_struct *fs = current->fs; | |
c28cc364 | 1619 | unsigned seq; |
31e6b01f NP |
1620 | |
1621 | br_read_lock(vfsmount_lock); | |
1622 | rcu_read_lock(); | |
1623 | ||
c28cc364 NP |
1624 | do { |
1625 | seq = read_seqcount_begin(&fs->seq); | |
1626 | nd->path = fs->pwd; | |
1627 | nd->seq = __read_seqcount_begin(&nd->path.dentry->d_seq); | |
1628 | } while (read_seqcount_retry(&fs->seq, seq)); | |
1629 | ||
31e6b01f NP |
1630 | } else { |
1631 | struct dentry *dentry; | |
1632 | ||
1633 | file = fget_light(dfd, &fput_needed); | |
1634 | retval = -EBADF; | |
1635 | if (!file) | |
1636 | goto out_fail; | |
1637 | ||
1638 | dentry = file->f_path.dentry; | |
1639 | ||
1640 | retval = -ENOTDIR; | |
1641 | if (!S_ISDIR(dentry->d_inode->i_mode)) | |
1642 | goto fput_fail; | |
1643 | ||
1644 | retval = file_permission(file, MAY_EXEC); | |
1645 | if (retval) | |
1646 | goto fput_fail; | |
1647 | ||
1648 | nd->path = file->f_path; | |
1649 | if (fput_needed) | |
1650 | nd->file = file; | |
1651 | ||
c28cc364 | 1652 | nd->seq = __read_seqcount_begin(&nd->path.dentry->d_seq); |
31e6b01f NP |
1653 | br_read_lock(vfsmount_lock); |
1654 | rcu_read_lock(); | |
1655 | } | |
1656 | nd->inode = nd->path.dentry->d_inode; | |
1657 | return 0; | |
1658 | ||
1659 | fput_fail: | |
1660 | fput_light(file, fput_needed); | |
1661 | out_fail: | |
1662 | return retval; | |
1663 | } | |
1664 | ||
9b4a9b14 | 1665 | static int path_init(int dfd, const char *name, unsigned int flags, struct nameidata *nd) |
1da177e4 | 1666 | { |
ea3834d9 | 1667 | int retval = 0; |
170aa3d0 UD |
1668 | int fput_needed; |
1669 | struct file *file; | |
1da177e4 LT |
1670 | |
1671 | nd->last_type = LAST_ROOT; /* if there are only slashes... */ | |
1672 | nd->flags = flags; | |
1673 | nd->depth = 0; | |
2a737871 | 1674 | nd->root.mnt = NULL; |
1da177e4 | 1675 | |
1da177e4 | 1676 | if (*name=='/') { |
2a737871 AV |
1677 | set_root(nd); |
1678 | nd->path = nd->root; | |
1679 | path_get(&nd->root); | |
5590ff0d | 1680 | } else if (dfd == AT_FDCWD) { |
f7ad3c6b | 1681 | get_fs_pwd(current->fs, &nd->path); |
5590ff0d | 1682 | } else { |
5590ff0d UD |
1683 | struct dentry *dentry; |
1684 | ||
1685 | file = fget_light(dfd, &fput_needed); | |
170aa3d0 UD |
1686 | retval = -EBADF; |
1687 | if (!file) | |
6d09bb62 | 1688 | goto out_fail; |
5590ff0d | 1689 | |
0f7fc9e4 | 1690 | dentry = file->f_path.dentry; |
5590ff0d | 1691 | |
170aa3d0 UD |
1692 | retval = -ENOTDIR; |
1693 | if (!S_ISDIR(dentry->d_inode->i_mode)) | |
6d09bb62 | 1694 | goto fput_fail; |
5590ff0d UD |
1695 | |
1696 | retval = file_permission(file, MAY_EXEC); | |
170aa3d0 | 1697 | if (retval) |
6d09bb62 | 1698 | goto fput_fail; |
5590ff0d | 1699 | |
5dd784d0 JB |
1700 | nd->path = file->f_path; |
1701 | path_get(&file->f_path); | |
5590ff0d UD |
1702 | |
1703 | fput_light(file, fput_needed); | |
1da177e4 | 1704 | } |
31e6b01f | 1705 | nd->inode = nd->path.dentry->d_inode; |
9b4a9b14 | 1706 | return 0; |
2dfdd266 | 1707 | |
9b4a9b14 AV |
1708 | fput_fail: |
1709 | fput_light(file, fput_needed); | |
1710 | out_fail: | |
1711 | return retval; | |
1712 | } | |
1713 | ||
1714 | /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */ | |
1715 | static int do_path_lookup(int dfd, const char *name, | |
1716 | unsigned int flags, struct nameidata *nd) | |
1717 | { | |
31e6b01f NP |
1718 | int retval; |
1719 | ||
1720 | /* | |
1721 | * Path walking is largely split up into 2 different synchronisation | |
1722 | * schemes, rcu-walk and ref-walk (explained in | |
1723 | * Documentation/filesystems/path-lookup.txt). These share much of the | |
1724 | * path walk code, but some things particularly setup, cleanup, and | |
1725 | * following mounts are sufficiently divergent that functions are | |
1726 | * duplicated. Typically there is a function foo(), and its RCU | |
1727 | * analogue, foo_rcu(). | |
1728 | * | |
1729 | * -ECHILD is the error number of choice (just to avoid clashes) that | |
1730 | * is returned if some aspect of an rcu-walk fails. Such an error must | |
1731 | * be handled by restarting a traditional ref-walk (which will always | |
1732 | * be able to complete). | |
1733 | */ | |
1734 | retval = path_init_rcu(dfd, name, flags, nd); | |
1735 | if (unlikely(retval)) | |
1736 | return retval; | |
1737 | retval = path_walk_rcu(name, nd); | |
1738 | path_finish_rcu(nd); | |
2a737871 AV |
1739 | if (nd->root.mnt) { |
1740 | path_put(&nd->root); | |
1741 | nd->root.mnt = NULL; | |
1742 | } | |
31e6b01f NP |
1743 | |
1744 | if (unlikely(retval == -ECHILD || retval == -ESTALE)) { | |
1745 | /* slower, locked walk */ | |
1746 | if (retval == -ESTALE) | |
1747 | flags |= LOOKUP_REVAL; | |
1748 | retval = path_init(dfd, name, flags, nd); | |
1749 | if (unlikely(retval)) | |
1750 | return retval; | |
1751 | retval = path_walk(name, nd); | |
1752 | if (nd->root.mnt) { | |
1753 | path_put(&nd->root); | |
1754 | nd->root.mnt = NULL; | |
1755 | } | |
1756 | } | |
1757 | ||
1758 | if (likely(!retval)) { | |
1759 | if (unlikely(!audit_dummy_context())) { | |
1760 | if (nd->path.dentry && nd->inode) | |
1761 | audit_inode(name, nd->path.dentry); | |
1762 | } | |
1763 | } | |
1764 | ||
170aa3d0 | 1765 | return retval; |
1da177e4 LT |
1766 | } |
1767 | ||
fc9b52cd | 1768 | int path_lookup(const char *name, unsigned int flags, |
5590ff0d UD |
1769 | struct nameidata *nd) |
1770 | { | |
1771 | return do_path_lookup(AT_FDCWD, name, flags, nd); | |
1772 | } | |
1773 | ||
d1811465 AV |
1774 | int kern_path(const char *name, unsigned int flags, struct path *path) |
1775 | { | |
1776 | struct nameidata nd; | |
1777 | int res = do_path_lookup(AT_FDCWD, name, flags, &nd); | |
1778 | if (!res) | |
1779 | *path = nd.path; | |
1780 | return res; | |
1781 | } | |
1782 | ||
16f18200 JJS |
1783 | /** |
1784 | * vfs_path_lookup - lookup a file path relative to a dentry-vfsmount pair | |
1785 | * @dentry: pointer to dentry of the base directory | |
1786 | * @mnt: pointer to vfs mount of the base directory | |
1787 | * @name: pointer to file name | |
1788 | * @flags: lookup flags | |
1789 | * @nd: pointer to nameidata | |
1790 | */ | |
1791 | int vfs_path_lookup(struct dentry *dentry, struct vfsmount *mnt, | |
1792 | const char *name, unsigned int flags, | |
1793 | struct nameidata *nd) | |
1794 | { | |
1795 | int retval; | |
1796 | ||
1797 | /* same as do_path_lookup */ | |
1798 | nd->last_type = LAST_ROOT; | |
1799 | nd->flags = flags; | |
1800 | nd->depth = 0; | |
1801 | ||
c8e7f449 JB |
1802 | nd->path.dentry = dentry; |
1803 | nd->path.mnt = mnt; | |
1804 | path_get(&nd->path); | |
5b857119 AV |
1805 | nd->root = nd->path; |
1806 | path_get(&nd->root); | |
31e6b01f | 1807 | nd->inode = nd->path.dentry->d_inode; |
16f18200 JJS |
1808 | |
1809 | retval = path_walk(name, nd); | |
4ac91378 | 1810 | if (unlikely(!retval && !audit_dummy_context() && nd->path.dentry && |
31e6b01f | 1811 | nd->inode)) |
4ac91378 | 1812 | audit_inode(name, nd->path.dentry); |
16f18200 | 1813 | |
5b857119 AV |
1814 | path_put(&nd->root); |
1815 | nd->root.mnt = NULL; | |
16f18200 | 1816 | |
2a737871 | 1817 | return retval; |
16f18200 JJS |
1818 | } |
1819 | ||
eead1911 CH |
1820 | static struct dentry *__lookup_hash(struct qstr *name, |
1821 | struct dentry *base, struct nameidata *nd) | |
1da177e4 | 1822 | { |
81fca444 | 1823 | struct inode *inode = base->d_inode; |
057f6c01 | 1824 | struct dentry *dentry; |
1da177e4 LT |
1825 | int err; |
1826 | ||
b74c79e9 | 1827 | err = exec_permission(inode, 0); |
81fca444 CH |
1828 | if (err) |
1829 | return ERR_PTR(err); | |
1da177e4 LT |
1830 | |
1831 | /* | |
1832 | * See if the low-level filesystem might want | |
1833 | * to use its own hash.. | |
1834 | */ | |
fb045adb | 1835 | if (base->d_flags & DCACHE_OP_HASH) { |
b1e6a015 | 1836 | err = base->d_op->d_hash(base, inode, name); |
1da177e4 LT |
1837 | dentry = ERR_PTR(err); |
1838 | if (err < 0) | |
1839 | goto out; | |
1840 | } | |
1841 | ||
b04f784e NP |
1842 | /* |
1843 | * Don't bother with __d_lookup: callers are for creat as | |
1844 | * well as unlink, so a lot of the time it would cost | |
1845 | * a double lookup. | |
6e6b1bd1 | 1846 | */ |
b04f784e | 1847 | dentry = d_lookup(base, name); |
6e6b1bd1 | 1848 | |
fb045adb | 1849 | if (dentry && (dentry->d_flags & DCACHE_OP_REVALIDATE)) |
6e6b1bd1 AV |
1850 | dentry = do_revalidate(dentry, nd); |
1851 | ||
baa03890 NP |
1852 | if (!dentry) |
1853 | dentry = d_alloc_and_lookup(base, name, nd); | |
1da177e4 LT |
1854 | out: |
1855 | return dentry; | |
1856 | } | |
1857 | ||
057f6c01 JM |
1858 | /* |
1859 | * Restricted form of lookup. Doesn't follow links, single-component only, | |
1860 | * needs parent already locked. Doesn't follow mounts. | |
1861 | * SMP-safe. | |
1862 | */ | |
eead1911 | 1863 | static struct dentry *lookup_hash(struct nameidata *nd) |
057f6c01 | 1864 | { |
4ac91378 | 1865 | return __lookup_hash(&nd->last, nd->path.dentry, nd); |
1da177e4 LT |
1866 | } |
1867 | ||
eead1911 CH |
1868 | static int __lookup_one_len(const char *name, struct qstr *this, |
1869 | struct dentry *base, int len) | |
1da177e4 LT |
1870 | { |
1871 | unsigned long hash; | |
1da177e4 LT |
1872 | unsigned int c; |
1873 | ||
057f6c01 JM |
1874 | this->name = name; |
1875 | this->len = len; | |
1da177e4 | 1876 | if (!len) |
057f6c01 | 1877 | return -EACCES; |
1da177e4 LT |
1878 | |
1879 | hash = init_name_hash(); | |
1880 | while (len--) { | |
1881 | c = *(const unsigned char *)name++; | |
1882 | if (c == '/' || c == '\0') | |
057f6c01 | 1883 | return -EACCES; |
1da177e4 LT |
1884 | hash = partial_name_hash(c, hash); |
1885 | } | |
057f6c01 JM |
1886 | this->hash = end_name_hash(hash); |
1887 | return 0; | |
1888 | } | |
1da177e4 | 1889 | |
eead1911 | 1890 | /** |
a6b91919 | 1891 | * lookup_one_len - filesystem helper to lookup single pathname component |
eead1911 CH |
1892 | * @name: pathname component to lookup |
1893 | * @base: base directory to lookup from | |
1894 | * @len: maximum length @len should be interpreted to | |
1895 | * | |
a6b91919 RD |
1896 | * Note that this routine is purely a helper for filesystem usage and should |
1897 | * not be called by generic code. Also note that by using this function the | |
eead1911 CH |
1898 | * nameidata argument is passed to the filesystem methods and a filesystem |
1899 | * using this helper needs to be prepared for that. | |
1900 | */ | |
057f6c01 JM |
1901 | struct dentry *lookup_one_len(const char *name, struct dentry *base, int len) |
1902 | { | |
1903 | int err; | |
1904 | struct qstr this; | |
1905 | ||
2f9092e1 DW |
1906 | WARN_ON_ONCE(!mutex_is_locked(&base->d_inode->i_mutex)); |
1907 | ||
057f6c01 | 1908 | err = __lookup_one_len(name, &this, base, len); |
eead1911 CH |
1909 | if (err) |
1910 | return ERR_PTR(err); | |
1911 | ||
49705b77 | 1912 | return __lookup_hash(&this, base, NULL); |
057f6c01 JM |
1913 | } |
1914 | ||
2d8f3038 AV |
1915 | int user_path_at(int dfd, const char __user *name, unsigned flags, |
1916 | struct path *path) | |
1da177e4 | 1917 | { |
2d8f3038 | 1918 | struct nameidata nd; |
1da177e4 LT |
1919 | char *tmp = getname(name); |
1920 | int err = PTR_ERR(tmp); | |
1da177e4 | 1921 | if (!IS_ERR(tmp)) { |
2d8f3038 AV |
1922 | |
1923 | BUG_ON(flags & LOOKUP_PARENT); | |
1924 | ||
1925 | err = do_path_lookup(dfd, tmp, flags, &nd); | |
1da177e4 | 1926 | putname(tmp); |
2d8f3038 AV |
1927 | if (!err) |
1928 | *path = nd.path; | |
1da177e4 LT |
1929 | } |
1930 | return err; | |
1931 | } | |
1932 | ||
2ad94ae6 AV |
1933 | static int user_path_parent(int dfd, const char __user *path, |
1934 | struct nameidata *nd, char **name) | |
1935 | { | |
1936 | char *s = getname(path); | |
1937 | int error; | |
1938 | ||
1939 | if (IS_ERR(s)) | |
1940 | return PTR_ERR(s); | |
1941 | ||
1942 | error = do_path_lookup(dfd, s, LOOKUP_PARENT, nd); | |
1943 | if (error) | |
1944 | putname(s); | |
1945 | else | |
1946 | *name = s; | |
1947 | ||
1948 | return error; | |
1949 | } | |
1950 | ||
1da177e4 LT |
1951 | /* |
1952 | * It's inline, so penalty for filesystems that don't use sticky bit is | |
1953 | * minimal. | |
1954 | */ | |
1955 | static inline int check_sticky(struct inode *dir, struct inode *inode) | |
1956 | { | |
da9592ed DH |
1957 | uid_t fsuid = current_fsuid(); |
1958 | ||
1da177e4 LT |
1959 | if (!(dir->i_mode & S_ISVTX)) |
1960 | return 0; | |
da9592ed | 1961 | if (inode->i_uid == fsuid) |
1da177e4 | 1962 | return 0; |
da9592ed | 1963 | if (dir->i_uid == fsuid) |
1da177e4 LT |
1964 | return 0; |
1965 | return !capable(CAP_FOWNER); | |
1966 | } | |
1967 | ||
1968 | /* | |
1969 | * Check whether we can remove a link victim from directory dir, check | |
1970 | * whether the type of victim is right. | |
1971 | * 1. We can't do it if dir is read-only (done in permission()) | |
1972 | * 2. We should have write and exec permissions on dir | |
1973 | * 3. We can't remove anything from append-only dir | |
1974 | * 4. We can't do anything with immutable dir (done in permission()) | |
1975 | * 5. If the sticky bit on dir is set we should either | |
1976 | * a. be owner of dir, or | |
1977 | * b. be owner of victim, or | |
1978 | * c. have CAP_FOWNER capability | |
1979 | * 6. If the victim is append-only or immutable we can't do antyhing with | |
1980 | * links pointing to it. | |
1981 | * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR. | |
1982 | * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR. | |
1983 | * 9. We can't remove a root or mountpoint. | |
1984 | * 10. We don't allow removal of NFS sillyrenamed files; it's handled by | |
1985 | * nfs_async_unlink(). | |
1986 | */ | |
858119e1 | 1987 | static int may_delete(struct inode *dir,struct dentry *victim,int isdir) |
1da177e4 LT |
1988 | { |
1989 | int error; | |
1990 | ||
1991 | if (!victim->d_inode) | |
1992 | return -ENOENT; | |
1993 | ||
1994 | BUG_ON(victim->d_parent->d_inode != dir); | |
cccc6bba | 1995 | audit_inode_child(victim, dir); |
1da177e4 | 1996 | |
f419a2e3 | 1997 | error = inode_permission(dir, MAY_WRITE | MAY_EXEC); |
1da177e4 LT |
1998 | if (error) |
1999 | return error; | |
2000 | if (IS_APPEND(dir)) | |
2001 | return -EPERM; | |
2002 | if (check_sticky(dir, victim->d_inode)||IS_APPEND(victim->d_inode)|| | |
f9454548 | 2003 | IS_IMMUTABLE(victim->d_inode) || IS_SWAPFILE(victim->d_inode)) |
1da177e4 LT |
2004 | return -EPERM; |
2005 | if (isdir) { | |
2006 | if (!S_ISDIR(victim->d_inode->i_mode)) | |
2007 | return -ENOTDIR; | |
2008 | if (IS_ROOT(victim)) | |
2009 | return -EBUSY; | |
2010 | } else if (S_ISDIR(victim->d_inode->i_mode)) | |
2011 | return -EISDIR; | |
2012 | if (IS_DEADDIR(dir)) | |
2013 | return -ENOENT; | |
2014 | if (victim->d_flags & DCACHE_NFSFS_RENAMED) | |
2015 | return -EBUSY; | |
2016 | return 0; | |
2017 | } | |
2018 | ||
2019 | /* Check whether we can create an object with dentry child in directory | |
2020 | * dir. | |
2021 | * 1. We can't do it if child already exists (open has special treatment for | |
2022 | * this case, but since we are inlined it's OK) | |
2023 | * 2. We can't do it if dir is read-only (done in permission()) | |
2024 | * 3. We should have write and exec permissions on dir | |
2025 | * 4. We can't do it if dir is immutable (done in permission()) | |
2026 | */ | |
a95164d9 | 2027 | static inline int may_create(struct inode *dir, struct dentry *child) |
1da177e4 LT |
2028 | { |
2029 | if (child->d_inode) | |
2030 | return -EEXIST; | |
2031 | if (IS_DEADDIR(dir)) | |
2032 | return -ENOENT; | |
f419a2e3 | 2033 | return inode_permission(dir, MAY_WRITE | MAY_EXEC); |
1da177e4 LT |
2034 | } |
2035 | ||
1da177e4 LT |
2036 | /* |
2037 | * p1 and p2 should be directories on the same fs. | |
2038 | */ | |
2039 | struct dentry *lock_rename(struct dentry *p1, struct dentry *p2) | |
2040 | { | |
2041 | struct dentry *p; | |
2042 | ||
2043 | if (p1 == p2) { | |
f2eace23 | 2044 | mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT); |
1da177e4 LT |
2045 | return NULL; |
2046 | } | |
2047 | ||
a11f3a05 | 2048 | mutex_lock(&p1->d_inode->i_sb->s_vfs_rename_mutex); |
1da177e4 | 2049 | |
e2761a11 OH |
2050 | p = d_ancestor(p2, p1); |
2051 | if (p) { | |
2052 | mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_PARENT); | |
2053 | mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_CHILD); | |
2054 | return p; | |
1da177e4 LT |
2055 | } |
2056 | ||
e2761a11 OH |
2057 | p = d_ancestor(p1, p2); |
2058 | if (p) { | |
2059 | mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT); | |
2060 | mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD); | |
2061 | return p; | |
1da177e4 LT |
2062 | } |
2063 | ||
f2eace23 IM |
2064 | mutex_lock_nested(&p1->d_inode->i_mutex, I_MUTEX_PARENT); |
2065 | mutex_lock_nested(&p2->d_inode->i_mutex, I_MUTEX_CHILD); | |
1da177e4 LT |
2066 | return NULL; |
2067 | } | |
2068 | ||
2069 | void unlock_rename(struct dentry *p1, struct dentry *p2) | |
2070 | { | |
1b1dcc1b | 2071 | mutex_unlock(&p1->d_inode->i_mutex); |
1da177e4 | 2072 | if (p1 != p2) { |
1b1dcc1b | 2073 | mutex_unlock(&p2->d_inode->i_mutex); |
a11f3a05 | 2074 | mutex_unlock(&p1->d_inode->i_sb->s_vfs_rename_mutex); |
1da177e4 LT |
2075 | } |
2076 | } | |
2077 | ||
2078 | int vfs_create(struct inode *dir, struct dentry *dentry, int mode, | |
2079 | struct nameidata *nd) | |
2080 | { | |
a95164d9 | 2081 | int error = may_create(dir, dentry); |
1da177e4 LT |
2082 | |
2083 | if (error) | |
2084 | return error; | |
2085 | ||
acfa4380 | 2086 | if (!dir->i_op->create) |
1da177e4 LT |
2087 | return -EACCES; /* shouldn't it be ENOSYS? */ |
2088 | mode &= S_IALLUGO; | |
2089 | mode |= S_IFREG; | |
2090 | error = security_inode_create(dir, dentry, mode); | |
2091 | if (error) | |
2092 | return error; | |
1da177e4 | 2093 | error = dir->i_op->create(dir, dentry, mode, nd); |
a74574aa | 2094 | if (!error) |
f38aa942 | 2095 | fsnotify_create(dir, dentry); |
1da177e4 LT |
2096 | return error; |
2097 | } | |
2098 | ||
3fb64190 | 2099 | int may_open(struct path *path, int acc_mode, int flag) |
1da177e4 | 2100 | { |
3fb64190 | 2101 | struct dentry *dentry = path->dentry; |
1da177e4 LT |
2102 | struct inode *inode = dentry->d_inode; |
2103 | int error; | |
2104 | ||
2105 | if (!inode) | |
2106 | return -ENOENT; | |
2107 | ||
c8fe8f30 CH |
2108 | switch (inode->i_mode & S_IFMT) { |
2109 | case S_IFLNK: | |
1da177e4 | 2110 | return -ELOOP; |
c8fe8f30 CH |
2111 | case S_IFDIR: |
2112 | if (acc_mode & MAY_WRITE) | |
2113 | return -EISDIR; | |
2114 | break; | |
2115 | case S_IFBLK: | |
2116 | case S_IFCHR: | |
3fb64190 | 2117 | if (path->mnt->mnt_flags & MNT_NODEV) |
1da177e4 | 2118 | return -EACCES; |
c8fe8f30 CH |
2119 | /*FALLTHRU*/ |
2120 | case S_IFIFO: | |
2121 | case S_IFSOCK: | |
1da177e4 | 2122 | flag &= ~O_TRUNC; |
c8fe8f30 | 2123 | break; |
4a3fd211 | 2124 | } |
b41572e9 | 2125 | |
3fb64190 | 2126 | error = inode_permission(inode, acc_mode); |
b41572e9 DH |
2127 | if (error) |
2128 | return error; | |
6146f0d5 | 2129 | |
1da177e4 LT |
2130 | /* |
2131 | * An append-only file must be opened in append mode for writing. | |
2132 | */ | |
2133 | if (IS_APPEND(inode)) { | |
8737c930 | 2134 | if ((flag & O_ACCMODE) != O_RDONLY && !(flag & O_APPEND)) |
7715b521 | 2135 | return -EPERM; |
1da177e4 | 2136 | if (flag & O_TRUNC) |
7715b521 | 2137 | return -EPERM; |
1da177e4 LT |
2138 | } |
2139 | ||
2140 | /* O_NOATIME can only be set by the owner or superuser */ | |
7715b521 AV |
2141 | if (flag & O_NOATIME && !is_owner_or_cap(inode)) |
2142 | return -EPERM; | |
1da177e4 LT |
2143 | |
2144 | /* | |
2145 | * Ensure there are no outstanding leases on the file. | |
2146 | */ | |
b65a9cfc | 2147 | return break_lease(inode, flag); |
7715b521 | 2148 | } |
1da177e4 | 2149 | |
e1181ee6 | 2150 | static int handle_truncate(struct file *filp) |
7715b521 | 2151 | { |
e1181ee6 | 2152 | struct path *path = &filp->f_path; |
7715b521 AV |
2153 | struct inode *inode = path->dentry->d_inode; |
2154 | int error = get_write_access(inode); | |
2155 | if (error) | |
2156 | return error; | |
2157 | /* | |
2158 | * Refuse to truncate files with mandatory locks held on them. | |
2159 | */ | |
2160 | error = locks_verify_locked(inode); | |
2161 | if (!error) | |
ea0d3ab2 | 2162 | error = security_path_truncate(path); |
7715b521 AV |
2163 | if (!error) { |
2164 | error = do_truncate(path->dentry, 0, | |
2165 | ATTR_MTIME|ATTR_CTIME|ATTR_OPEN, | |
e1181ee6 | 2166 | filp); |
7715b521 AV |
2167 | } |
2168 | put_write_access(inode); | |
acd0c935 | 2169 | return error; |
1da177e4 LT |
2170 | } |
2171 | ||
d57999e1 DH |
2172 | /* |
2173 | * Be careful about ever adding any more callers of this | |
2174 | * function. Its flags must be in the namei format, not | |
2175 | * what get passed to sys_open(). | |
2176 | */ | |
2177 | static int __open_namei_create(struct nameidata *nd, struct path *path, | |
8737c930 | 2178 | int open_flag, int mode) |
aab520e2 DH |
2179 | { |
2180 | int error; | |
4ac91378 | 2181 | struct dentry *dir = nd->path.dentry; |
aab520e2 DH |
2182 | |
2183 | if (!IS_POSIXACL(dir->d_inode)) | |
ce3b0f8d | 2184 | mode &= ~current_umask(); |
be6d3e56 KT |
2185 | error = security_path_mknod(&nd->path, path->dentry, mode, 0); |
2186 | if (error) | |
2187 | goto out_unlock; | |
aab520e2 | 2188 | error = vfs_create(dir->d_inode, path->dentry, mode, nd); |
be6d3e56 | 2189 | out_unlock: |
aab520e2 | 2190 | mutex_unlock(&dir->d_inode->i_mutex); |
4ac91378 JB |
2191 | dput(nd->path.dentry); |
2192 | nd->path.dentry = path->dentry; | |
31e6b01f | 2193 | |
aab520e2 DH |
2194 | if (error) |
2195 | return error; | |
2196 | /* Don't check for write permission, don't truncate */ | |
8737c930 | 2197 | return may_open(&nd->path, 0, open_flag & ~O_TRUNC); |
aab520e2 DH |
2198 | } |
2199 | ||
d57999e1 DH |
2200 | /* |
2201 | * Note that while the flag value (low two bits) for sys_open means: | |
2202 | * 00 - read-only | |
2203 | * 01 - write-only | |
2204 | * 10 - read-write | |
2205 | * 11 - special | |
2206 | * it is changed into | |
2207 | * 00 - no permissions needed | |
2208 | * 01 - read-permission | |
2209 | * 10 - write-permission | |
2210 | * 11 - read-write | |
2211 | * for the internal routines (ie open_namei()/follow_link() etc) | |
2212 | * This is more logical, and also allows the 00 "no perm needed" | |
2213 | * to be used for symlinks (where the permissions are checked | |
2214 | * later). | |
2215 | * | |
2216 | */ | |
2217 | static inline int open_to_namei_flags(int flag) | |
2218 | { | |
2219 | if ((flag+1) & O_ACCMODE) | |
2220 | flag++; | |
2221 | return flag; | |
2222 | } | |
2223 | ||
7715b521 | 2224 | static int open_will_truncate(int flag, struct inode *inode) |
4a3fd211 DH |
2225 | { |
2226 | /* | |
2227 | * We'll never write to the fs underlying | |
2228 | * a device file. | |
2229 | */ | |
2230 | if (special_file(inode->i_mode)) | |
2231 | return 0; | |
2232 | return (flag & O_TRUNC); | |
2233 | } | |
2234 | ||
648fa861 | 2235 | static struct file *finish_open(struct nameidata *nd, |
9a66179e | 2236 | int open_flag, int acc_mode) |
648fa861 AV |
2237 | { |
2238 | struct file *filp; | |
2239 | int will_truncate; | |
2240 | int error; | |
2241 | ||
9a66179e | 2242 | will_truncate = open_will_truncate(open_flag, nd->path.dentry->d_inode); |
648fa861 AV |
2243 | if (will_truncate) { |
2244 | error = mnt_want_write(nd->path.mnt); | |
2245 | if (error) | |
2246 | goto exit; | |
2247 | } | |
2248 | error = may_open(&nd->path, acc_mode, open_flag); | |
2249 | if (error) { | |
2250 | if (will_truncate) | |
2251 | mnt_drop_write(nd->path.mnt); | |
2252 | goto exit; | |
2253 | } | |
2254 | filp = nameidata_to_filp(nd); | |
2255 | if (!IS_ERR(filp)) { | |
2256 | error = ima_file_check(filp, acc_mode); | |
2257 | if (error) { | |
2258 | fput(filp); | |
2259 | filp = ERR_PTR(error); | |
2260 | } | |
2261 | } | |
2262 | if (!IS_ERR(filp)) { | |
648fa861 | 2263 | if (will_truncate) { |
e1181ee6 | 2264 | error = handle_truncate(filp); |
648fa861 AV |
2265 | if (error) { |
2266 | fput(filp); | |
2267 | filp = ERR_PTR(error); | |
2268 | } | |
2269 | } | |
2270 | } | |
2271 | /* | |
2272 | * It is now safe to drop the mnt write | |
2273 | * because the filp has had a write taken | |
2274 | * on its behalf. | |
2275 | */ | |
2276 | if (will_truncate) | |
2277 | mnt_drop_write(nd->path.mnt); | |
d893f1bc | 2278 | path_put(&nd->path); |
648fa861 AV |
2279 | return filp; |
2280 | ||
2281 | exit: | |
2282 | if (!IS_ERR(nd->intent.open.file)) | |
2283 | release_open_intent(nd); | |
2284 | path_put(&nd->path); | |
2285 | return ERR_PTR(error); | |
2286 | } | |
2287 | ||
31e6b01f NP |
2288 | /* |
2289 | * Handle O_CREAT case for do_filp_open | |
2290 | */ | |
fb1cc555 | 2291 | static struct file *do_last(struct nameidata *nd, struct path *path, |
5b369df8 | 2292 | int open_flag, int acc_mode, |
3e297b61 | 2293 | int mode, const char *pathname) |
fb1cc555 | 2294 | { |
a1e28038 | 2295 | struct dentry *dir = nd->path.dentry; |
fb1cc555 | 2296 | struct file *filp; |
1f36f774 AV |
2297 | int error = -EISDIR; |
2298 | ||
2299 | switch (nd->last_type) { | |
2300 | case LAST_DOTDOT: | |
2301 | follow_dotdot(nd); | |
2302 | dir = nd->path.dentry; | |
176306f5 | 2303 | case LAST_DOT: |
fb045adb | 2304 | if (need_reval_dot(dir)) { |
f20877d9 O |
2305 | int status = d_revalidate(nd->path.dentry, nd); |
2306 | if (!status) | |
2307 | status = -ESTALE; | |
2308 | if (status < 0) { | |
2309 | error = status; | |
1f36f774 | 2310 | goto exit; |
f20877d9 | 2311 | } |
1f36f774 AV |
2312 | } |
2313 | /* fallthrough */ | |
1f36f774 | 2314 | case LAST_ROOT: |
31e6b01f | 2315 | goto exit; |
1f36f774 AV |
2316 | case LAST_BIND: |
2317 | audit_inode(pathname, dir); | |
67ee3ad2 | 2318 | goto ok; |
1f36f774 | 2319 | } |
67ee3ad2 | 2320 | |
1f36f774 | 2321 | /* trailing slashes? */ |
31e6b01f NP |
2322 | if (nd->last.name[nd->last.len]) |
2323 | goto exit; | |
a2c36b45 | 2324 | |
a1e28038 AV |
2325 | mutex_lock(&dir->d_inode->i_mutex); |
2326 | ||
2327 | path->dentry = lookup_hash(nd); | |
2328 | path->mnt = nd->path.mnt; | |
2329 | ||
fb1cc555 AV |
2330 | error = PTR_ERR(path->dentry); |
2331 | if (IS_ERR(path->dentry)) { | |
2332 | mutex_unlock(&dir->d_inode->i_mutex); | |
2333 | goto exit; | |
2334 | } | |
2335 | ||
2336 | if (IS_ERR(nd->intent.open.file)) { | |
2337 | error = PTR_ERR(nd->intent.open.file); | |
2338 | goto exit_mutex_unlock; | |
2339 | } | |
2340 | ||
2341 | /* Negative dentry, just create the file */ | |
2342 | if (!path->dentry->d_inode) { | |
2343 | /* | |
2344 | * This write is needed to ensure that a | |
2345 | * ro->rw transition does not occur between | |
2346 | * the time when the file is created and when | |
2347 | * a permanent write count is taken through | |
2348 | * the 'struct file' in nameidata_to_filp(). | |
2349 | */ | |
2350 | error = mnt_want_write(nd->path.mnt); | |
2351 | if (error) | |
2352 | goto exit_mutex_unlock; | |
2353 | error = __open_namei_create(nd, path, open_flag, mode); | |
2354 | if (error) { | |
2355 | mnt_drop_write(nd->path.mnt); | |
2356 | goto exit; | |
2357 | } | |
2358 | filp = nameidata_to_filp(nd); | |
2359 | mnt_drop_write(nd->path.mnt); | |
d893f1bc | 2360 | path_put(&nd->path); |
fb1cc555 AV |
2361 | if (!IS_ERR(filp)) { |
2362 | error = ima_file_check(filp, acc_mode); | |
2363 | if (error) { | |
2364 | fput(filp); | |
2365 | filp = ERR_PTR(error); | |
2366 | } | |
2367 | } | |
2368 | return filp; | |
2369 | } | |
2370 | ||
2371 | /* | |
2372 | * It already exists. | |
2373 | */ | |
2374 | mutex_unlock(&dir->d_inode->i_mutex); | |
2375 | audit_inode(pathname, path->dentry); | |
2376 | ||
2377 | error = -EEXIST; | |
5b369df8 | 2378 | if (open_flag & O_EXCL) |
fb1cc555 AV |
2379 | goto exit_dput; |
2380 | ||
9875cf80 DH |
2381 | error = follow_managed(path, nd->flags); |
2382 | if (error < 0) | |
2383 | goto exit_dput; | |
fb1cc555 AV |
2384 | |
2385 | error = -ENOENT; | |
2386 | if (!path->dentry->d_inode) | |
2387 | goto exit_dput; | |
9e67f361 AV |
2388 | |
2389 | if (path->dentry->d_inode->i_op->follow_link) | |
fb1cc555 | 2390 | return NULL; |
fb1cc555 AV |
2391 | |
2392 | path_to_nameidata(path, nd); | |
31e6b01f | 2393 | nd->inode = path->dentry->d_inode; |
fb1cc555 | 2394 | error = -EISDIR; |
31e6b01f | 2395 | if (S_ISDIR(nd->inode->i_mode)) |
fb1cc555 | 2396 | goto exit; |
67ee3ad2 | 2397 | ok: |
9a66179e | 2398 | filp = finish_open(nd, open_flag, acc_mode); |
fb1cc555 AV |
2399 | return filp; |
2400 | ||
2401 | exit_mutex_unlock: | |
2402 | mutex_unlock(&dir->d_inode->i_mutex); | |
2403 | exit_dput: | |
2404 | path_put_conditional(path, nd); | |
2405 | exit: | |
2406 | if (!IS_ERR(nd->intent.open.file)) | |
2407 | release_open_intent(nd); | |
fb1cc555 AV |
2408 | path_put(&nd->path); |
2409 | return ERR_PTR(error); | |
2410 | } | |
2411 | ||
1da177e4 | 2412 | /* |
4a3fd211 DH |
2413 | * Note that the low bits of the passed in "open_flag" |
2414 | * are not the same as in the local variable "flag". See | |
2415 | * open_to_namei_flags() for more details. | |
1da177e4 | 2416 | */ |
a70e65df | 2417 | struct file *do_filp_open(int dfd, const char *pathname, |
6e8341a1 | 2418 | int open_flag, int mode, int acc_mode) |
1da177e4 | 2419 | { |
4a3fd211 | 2420 | struct file *filp; |
a70e65df | 2421 | struct nameidata nd; |
6e8341a1 | 2422 | int error; |
9850c056 | 2423 | struct path path; |
1da177e4 | 2424 | int count = 0; |
d57999e1 | 2425 | int flag = open_to_namei_flags(open_flag); |
31e6b01f | 2426 | int flags; |
1f36f774 AV |
2427 | |
2428 | if (!(open_flag & O_CREAT)) | |
2429 | mode = 0; | |
1da177e4 | 2430 | |
b1085ba8 LS |
2431 | /* Must never be set by userspace */ |
2432 | open_flag &= ~FMODE_NONOTIFY; | |
2433 | ||
6b2f3d1f CH |
2434 | /* |
2435 | * O_SYNC is implemented as __O_SYNC|O_DSYNC. As many places only | |
2436 | * check for O_DSYNC if the need any syncing at all we enforce it's | |
2437 | * always set instead of having to deal with possibly weird behaviour | |
2438 | * for malicious applications setting only __O_SYNC. | |
2439 | */ | |
2440 | if (open_flag & __O_SYNC) | |
2441 | open_flag |= O_DSYNC; | |
2442 | ||
6e8341a1 | 2443 | if (!acc_mode) |
6d125529 | 2444 | acc_mode = MAY_OPEN | ACC_MODE(open_flag); |
1da177e4 | 2445 | |
834f2a4a | 2446 | /* O_TRUNC implies we need access checks for write permissions */ |
4296e2cb | 2447 | if (open_flag & O_TRUNC) |
834f2a4a TM |
2448 | acc_mode |= MAY_WRITE; |
2449 | ||
1da177e4 LT |
2450 | /* Allow the LSM permission hook to distinguish append |
2451 | access from general write access. */ | |
4296e2cb | 2452 | if (open_flag & O_APPEND) |
1da177e4 LT |
2453 | acc_mode |= MAY_APPEND; |
2454 | ||
31e6b01f NP |
2455 | flags = LOOKUP_OPEN; |
2456 | if (open_flag & O_CREAT) { | |
2457 | flags |= LOOKUP_CREATE; | |
2458 | if (open_flag & O_EXCL) | |
2459 | flags |= LOOKUP_EXCL; | |
2460 | } | |
2461 | if (open_flag & O_DIRECTORY) | |
2462 | flags |= LOOKUP_DIRECTORY; | |
2463 | if (!(open_flag & O_NOFOLLOW)) | |
2464 | flags |= LOOKUP_FOLLOW; | |
2465 | ||
2466 | filp = get_empty_filp(); | |
2467 | if (!filp) | |
2468 | return ERR_PTR(-ENFILE); | |
2469 | ||
2470 | filp->f_flags = open_flag; | |
2471 | nd.intent.open.file = filp; | |
2472 | nd.intent.open.flags = flag; | |
2473 | nd.intent.open.create_mode = mode; | |
2474 | ||
2475 | if (open_flag & O_CREAT) | |
2476 | goto creat; | |
2477 | ||
2478 | /* !O_CREAT, simple open */ | |
2479 | error = do_path_lookup(dfd, pathname, flags, &nd); | |
2480 | if (unlikely(error)) | |
2481 | goto out_filp; | |
2482 | error = -ELOOP; | |
2483 | if (!(nd.flags & LOOKUP_FOLLOW)) { | |
2484 | if (nd.inode->i_op->follow_link) | |
2485 | goto out_path; | |
2486 | } | |
2487 | error = -ENOTDIR; | |
2488 | if (nd.flags & LOOKUP_DIRECTORY) { | |
2489 | if (!nd.inode->i_op->lookup) | |
2490 | goto out_path; | |
2491 | } | |
2492 | audit_inode(pathname, nd.path.dentry); | |
2493 | filp = finish_open(&nd, open_flag, acc_mode); | |
2494 | return filp; | |
2495 | ||
2496 | creat: | |
2497 | /* OK, have to create the file. Find the parent. */ | |
2498 | error = path_init_rcu(dfd, pathname, | |
2499 | LOOKUP_PARENT | (flags & LOOKUP_REVAL), &nd); | |
1da177e4 | 2500 | if (error) |
31e6b01f NP |
2501 | goto out_filp; |
2502 | error = path_walk_rcu(pathname, &nd); | |
2503 | path_finish_rcu(&nd); | |
2504 | if (unlikely(error == -ECHILD || error == -ESTALE)) { | |
2505 | /* slower, locked walk */ | |
2506 | if (error == -ESTALE) { | |
2507 | reval: | |
2508 | flags |= LOOKUP_REVAL; | |
2509 | } | |
2510 | error = path_init(dfd, pathname, | |
2511 | LOOKUP_PARENT | (flags & LOOKUP_REVAL), &nd); | |
2512 | if (error) | |
2513 | goto out_filp; | |
3866248e | 2514 | |
31e6b01f | 2515 | error = path_walk_simple(pathname, &nd); |
654f562c | 2516 | } |
31e6b01f NP |
2517 | if (unlikely(error)) |
2518 | goto out_filp; | |
2519 | if (unlikely(!audit_dummy_context())) | |
9b4a9b14 | 2520 | audit_inode(pathname, nd.path.dentry); |
1da177e4 LT |
2521 | |
2522 | /* | |
a2c36b45 | 2523 | * We have the parent and last component. |
1da177e4 | 2524 | */ |
31e6b01f | 2525 | nd.flags = flags; |
3e297b61 | 2526 | filp = do_last(&nd, &path, open_flag, acc_mode, mode, pathname); |
806b681c | 2527 | while (unlikely(!filp)) { /* trailing symlink */ |
7b9337aa NP |
2528 | struct path link = path; |
2529 | struct inode *linki = link.dentry->d_inode; | |
def4af30 | 2530 | void *cookie; |
806b681c | 2531 | error = -ELOOP; |
db372915 | 2532 | if (!(nd.flags & LOOKUP_FOLLOW)) |
1f36f774 AV |
2533 | goto exit_dput; |
2534 | if (count++ == 32) | |
806b681c AV |
2535 | goto exit_dput; |
2536 | /* | |
2537 | * This is subtle. Instead of calling do_follow_link() we do | |
2538 | * the thing by hands. The reason is that this way we have zero | |
2539 | * link_count and path_walk() (called from ->follow_link) | |
2540 | * honoring LOOKUP_PARENT. After that we have the parent and | |
2541 | * last component, i.e. we are in the same situation as after | |
2542 | * the first path_walk(). Well, almost - if the last component | |
2543 | * is normal we get its copy stored in nd->last.name and we will | |
2544 | * have to putname() it when we are done. Procfs-like symlinks | |
2545 | * just set LAST_BIND. | |
2546 | */ | |
2547 | nd.flags |= LOOKUP_PARENT; | |
7b9337aa | 2548 | error = security_inode_follow_link(link.dentry, &nd); |
806b681c AV |
2549 | if (error) |
2550 | goto exit_dput; | |
7b9337aa | 2551 | error = __do_follow_link(&link, &nd, &cookie); |
def4af30 | 2552 | if (unlikely(error)) { |
7b9337aa NP |
2553 | if (!IS_ERR(cookie) && linki->i_op->put_link) |
2554 | linki->i_op->put_link(link.dentry, &nd, cookie); | |
806b681c | 2555 | /* nd.path had been dropped */ |
7b9337aa | 2556 | nd.path = link; |
31e6b01f | 2557 | goto out_path; |
806b681c AV |
2558 | } |
2559 | nd.flags &= ~LOOKUP_PARENT; | |
3e297b61 | 2560 | filp = do_last(&nd, &path, open_flag, acc_mode, mode, pathname); |
7b9337aa NP |
2561 | if (linki->i_op->put_link) |
2562 | linki->i_op->put_link(link.dentry, &nd, cookie); | |
2563 | path_put(&link); | |
806b681c | 2564 | } |
10fa8e62 | 2565 | out: |
2a737871 AV |
2566 | if (nd.root.mnt) |
2567 | path_put(&nd.root); | |
31e6b01f | 2568 | if (filp == ERR_PTR(-ESTALE) && !(flags & LOOKUP_REVAL)) |
10fa8e62 | 2569 | goto reval; |
10fa8e62 | 2570 | return filp; |
1da177e4 | 2571 | |
806b681c AV |
2572 | exit_dput: |
2573 | path_put_conditional(&path, &nd); | |
31e6b01f NP |
2574 | out_path: |
2575 | path_put(&nd.path); | |
2576 | out_filp: | |
806b681c | 2577 | if (!IS_ERR(nd.intent.open.file)) |
a70e65df | 2578 | release_open_intent(&nd); |
806b681c | 2579 | filp = ERR_PTR(error); |
10fa8e62 | 2580 | goto out; |
1da177e4 LT |
2581 | } |
2582 | ||
a70e65df CH |
2583 | /** |
2584 | * filp_open - open file and return file pointer | |
2585 | * | |
2586 | * @filename: path to open | |
2587 | * @flags: open flags as per the open(2) second argument | |
2588 | * @mode: mode for the new file if O_CREAT is set, else ignored | |
2589 | * | |
2590 | * This is the helper to open a file from kernelspace if you really | |
2591 | * have to. But in generally you should not do this, so please move | |
2592 | * along, nothing to see here.. | |
2593 | */ | |
2594 | struct file *filp_open(const char *filename, int flags, int mode) | |
2595 | { | |
6e8341a1 | 2596 | return do_filp_open(AT_FDCWD, filename, flags, mode, 0); |
a70e65df CH |
2597 | } |
2598 | EXPORT_SYMBOL(filp_open); | |
2599 | ||
1da177e4 LT |
2600 | /** |
2601 | * lookup_create - lookup a dentry, creating it if it doesn't exist | |
2602 | * @nd: nameidata info | |
2603 | * @is_dir: directory flag | |
2604 | * | |
2605 | * Simple function to lookup and return a dentry and create it | |
2606 | * if it doesn't exist. Is SMP-safe. | |
c663e5d8 | 2607 | * |
4ac91378 | 2608 | * Returns with nd->path.dentry->d_inode->i_mutex locked. |
1da177e4 LT |
2609 | */ |
2610 | struct dentry *lookup_create(struct nameidata *nd, int is_dir) | |
2611 | { | |
c663e5d8 | 2612 | struct dentry *dentry = ERR_PTR(-EEXIST); |
1da177e4 | 2613 | |
4ac91378 | 2614 | mutex_lock_nested(&nd->path.dentry->d_inode->i_mutex, I_MUTEX_PARENT); |
c663e5d8 CH |
2615 | /* |
2616 | * Yucky last component or no last component at all? | |
2617 | * (foo/., foo/.., /////) | |
2618 | */ | |
1da177e4 LT |
2619 | if (nd->last_type != LAST_NORM) |
2620 | goto fail; | |
2621 | nd->flags &= ~LOOKUP_PARENT; | |
3516586a | 2622 | nd->flags |= LOOKUP_CREATE | LOOKUP_EXCL; |
a634904a | 2623 | nd->intent.open.flags = O_EXCL; |
c663e5d8 CH |
2624 | |
2625 | /* | |
2626 | * Do the final lookup. | |
2627 | */ | |
49705b77 | 2628 | dentry = lookup_hash(nd); |
1da177e4 LT |
2629 | if (IS_ERR(dentry)) |
2630 | goto fail; | |
c663e5d8 | 2631 | |
e9baf6e5 AV |
2632 | if (dentry->d_inode) |
2633 | goto eexist; | |
c663e5d8 CH |
2634 | /* |
2635 | * Special case - lookup gave negative, but... we had foo/bar/ | |
2636 | * From the vfs_mknod() POV we just have a negative dentry - | |
2637 | * all is fine. Let's be bastards - you had / on the end, you've | |
2638 | * been asking for (non-existent) directory. -ENOENT for you. | |
2639 | */ | |
e9baf6e5 AV |
2640 | if (unlikely(!is_dir && nd->last.name[nd->last.len])) { |
2641 | dput(dentry); | |
2642 | dentry = ERR_PTR(-ENOENT); | |
2643 | } | |
1da177e4 | 2644 | return dentry; |
e9baf6e5 | 2645 | eexist: |
1da177e4 | 2646 | dput(dentry); |
e9baf6e5 | 2647 | dentry = ERR_PTR(-EEXIST); |
1da177e4 LT |
2648 | fail: |
2649 | return dentry; | |
2650 | } | |
f81a0bff | 2651 | EXPORT_SYMBOL_GPL(lookup_create); |
1da177e4 LT |
2652 | |
2653 | int vfs_mknod(struct inode *dir, struct dentry *dentry, int mode, dev_t dev) | |
2654 | { | |
a95164d9 | 2655 | int error = may_create(dir, dentry); |
1da177e4 LT |
2656 | |
2657 | if (error) | |
2658 | return error; | |
2659 | ||
2660 | if ((S_ISCHR(mode) || S_ISBLK(mode)) && !capable(CAP_MKNOD)) | |
2661 | return -EPERM; | |
2662 | ||
acfa4380 | 2663 | if (!dir->i_op->mknod) |
1da177e4 LT |
2664 | return -EPERM; |
2665 | ||
08ce5f16 SH |
2666 | error = devcgroup_inode_mknod(mode, dev); |
2667 | if (error) | |
2668 | return error; | |
2669 | ||
1da177e4 LT |
2670 | error = security_inode_mknod(dir, dentry, mode, dev); |
2671 | if (error) | |
2672 | return error; | |
2673 | ||
1da177e4 | 2674 | error = dir->i_op->mknod(dir, dentry, mode, dev); |
a74574aa | 2675 | if (!error) |
f38aa942 | 2676 | fsnotify_create(dir, dentry); |
1da177e4 LT |
2677 | return error; |
2678 | } | |
2679 | ||
463c3197 DH |
2680 | static int may_mknod(mode_t mode) |
2681 | { | |
2682 | switch (mode & S_IFMT) { | |
2683 | case S_IFREG: | |
2684 | case S_IFCHR: | |
2685 | case S_IFBLK: | |
2686 | case S_IFIFO: | |
2687 | case S_IFSOCK: | |
2688 | case 0: /* zero mode translates to S_IFREG */ | |
2689 | return 0; | |
2690 | case S_IFDIR: | |
2691 | return -EPERM; | |
2692 | default: | |
2693 | return -EINVAL; | |
2694 | } | |
2695 | } | |
2696 | ||
2e4d0924 HC |
2697 | SYSCALL_DEFINE4(mknodat, int, dfd, const char __user *, filename, int, mode, |
2698 | unsigned, dev) | |
1da177e4 | 2699 | { |
2ad94ae6 AV |
2700 | int error; |
2701 | char *tmp; | |
2702 | struct dentry *dentry; | |
1da177e4 LT |
2703 | struct nameidata nd; |
2704 | ||
2705 | if (S_ISDIR(mode)) | |
2706 | return -EPERM; | |
1da177e4 | 2707 | |
2ad94ae6 | 2708 | error = user_path_parent(dfd, filename, &nd, &tmp); |
1da177e4 | 2709 | if (error) |
2ad94ae6 AV |
2710 | return error; |
2711 | ||
1da177e4 | 2712 | dentry = lookup_create(&nd, 0); |
463c3197 DH |
2713 | if (IS_ERR(dentry)) { |
2714 | error = PTR_ERR(dentry); | |
2715 | goto out_unlock; | |
2716 | } | |
4ac91378 | 2717 | if (!IS_POSIXACL(nd.path.dentry->d_inode)) |
ce3b0f8d | 2718 | mode &= ~current_umask(); |
463c3197 DH |
2719 | error = may_mknod(mode); |
2720 | if (error) | |
2721 | goto out_dput; | |
2722 | error = mnt_want_write(nd.path.mnt); | |
2723 | if (error) | |
2724 | goto out_dput; | |
be6d3e56 KT |
2725 | error = security_path_mknod(&nd.path, dentry, mode, dev); |
2726 | if (error) | |
2727 | goto out_drop_write; | |
463c3197 | 2728 | switch (mode & S_IFMT) { |
1da177e4 | 2729 | case 0: case S_IFREG: |
4ac91378 | 2730 | error = vfs_create(nd.path.dentry->d_inode,dentry,mode,&nd); |
1da177e4 LT |
2731 | break; |
2732 | case S_IFCHR: case S_IFBLK: | |
4ac91378 | 2733 | error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode, |
1da177e4 LT |
2734 | new_decode_dev(dev)); |
2735 | break; | |
2736 | case S_IFIFO: case S_IFSOCK: | |
4ac91378 | 2737 | error = vfs_mknod(nd.path.dentry->d_inode,dentry,mode,0); |
1da177e4 | 2738 | break; |
1da177e4 | 2739 | } |
be6d3e56 | 2740 | out_drop_write: |
463c3197 DH |
2741 | mnt_drop_write(nd.path.mnt); |
2742 | out_dput: | |
2743 | dput(dentry); | |
2744 | out_unlock: | |
4ac91378 | 2745 | mutex_unlock(&nd.path.dentry->d_inode->i_mutex); |
1d957f9b | 2746 | path_put(&nd.path); |
1da177e4 LT |
2747 | putname(tmp); |
2748 | ||
2749 | return error; | |
2750 | } | |
2751 | ||
3480b257 | 2752 | SYSCALL_DEFINE3(mknod, const char __user *, filename, int, mode, unsigned, dev) |
5590ff0d UD |
2753 | { |
2754 | return sys_mknodat(AT_FDCWD, filename, mode, dev); | |
2755 | } | |
2756 | ||
1da177e4 LT |
2757 | int vfs_mkdir(struct inode *dir, struct dentry *dentry, int mode) |
2758 | { | |
a95164d9 | 2759 | int error = may_create(dir, dentry); |
1da177e4 LT |
2760 | |
2761 | if (error) | |
2762 | return error; | |
2763 | ||
acfa4380 | 2764 | if (!dir->i_op->mkdir) |
1da177e4 LT |
2765 | return -EPERM; |
2766 | ||
2767 | mode &= (S_IRWXUGO|S_ISVTX); | |
2768 | error = security_inode_mkdir(dir, dentry, mode); | |
2769 | if (error) | |
2770 | return error; | |
2771 | ||
1da177e4 | 2772 | error = dir->i_op->mkdir(dir, dentry, mode); |
a74574aa | 2773 | if (!error) |
f38aa942 | 2774 | fsnotify_mkdir(dir, dentry); |
1da177e4 LT |
2775 | return error; |
2776 | } | |
2777 | ||
2e4d0924 | 2778 | SYSCALL_DEFINE3(mkdirat, int, dfd, const char __user *, pathname, int, mode) |
1da177e4 LT |
2779 | { |
2780 | int error = 0; | |
2781 | char * tmp; | |
6902d925 DH |
2782 | struct dentry *dentry; |
2783 | struct nameidata nd; | |
1da177e4 | 2784 | |
2ad94ae6 AV |
2785 | error = user_path_parent(dfd, pathname, &nd, &tmp); |
2786 | if (error) | |
6902d925 | 2787 | goto out_err; |
1da177e4 | 2788 | |
6902d925 DH |
2789 | dentry = lookup_create(&nd, 1); |
2790 | error = PTR_ERR(dentry); | |
2791 | if (IS_ERR(dentry)) | |
2792 | goto out_unlock; | |
1da177e4 | 2793 | |
4ac91378 | 2794 | if (!IS_POSIXACL(nd.path.dentry->d_inode)) |
ce3b0f8d | 2795 | mode &= ~current_umask(); |
463c3197 DH |
2796 | error = mnt_want_write(nd.path.mnt); |
2797 | if (error) | |
2798 | goto out_dput; | |
be6d3e56 KT |
2799 | error = security_path_mkdir(&nd.path, dentry, mode); |
2800 | if (error) | |
2801 | goto out_drop_write; | |
4ac91378 | 2802 | error = vfs_mkdir(nd.path.dentry->d_inode, dentry, mode); |
be6d3e56 | 2803 | out_drop_write: |
463c3197 DH |
2804 | mnt_drop_write(nd.path.mnt); |
2805 | out_dput: | |
6902d925 DH |
2806 | dput(dentry); |
2807 | out_unlock: | |
4ac91378 | 2808 | mutex_unlock(&nd.path.dentry->d_inode->i_mutex); |
1d957f9b | 2809 | path_put(&nd.path); |
6902d925 DH |
2810 | putname(tmp); |
2811 | out_err: | |
1da177e4 LT |
2812 | return error; |
2813 | } | |
2814 | ||
3cdad428 | 2815 | SYSCALL_DEFINE2(mkdir, const char __user *, pathname, int, mode) |
5590ff0d UD |
2816 | { |
2817 | return sys_mkdirat(AT_FDCWD, pathname, mode); | |
2818 | } | |
2819 | ||
1da177e4 LT |
2820 | /* |
2821 | * We try to drop the dentry early: we should have | |
2822 | * a usage count of 2 if we're the only user of this | |
2823 | * dentry, and if that is true (possibly after pruning | |
2824 | * the dcache), then we drop the dentry now. | |
2825 | * | |
2826 | * A low-level filesystem can, if it choses, legally | |
2827 | * do a | |
2828 | * | |
2829 | * if (!d_unhashed(dentry)) | |
2830 | * return -EBUSY; | |
2831 | * | |
2832 | * if it cannot handle the case of removing a directory | |
2833 | * that is still in use by something else.. | |
2834 | */ | |
2835 | void dentry_unhash(struct dentry *dentry) | |
2836 | { | |
2837 | dget(dentry); | |
dc168427 | 2838 | shrink_dcache_parent(dentry); |
1da177e4 | 2839 | spin_lock(&dentry->d_lock); |
b7ab39f6 | 2840 | if (dentry->d_count == 2) |
1da177e4 LT |
2841 | __d_drop(dentry); |
2842 | spin_unlock(&dentry->d_lock); | |
1da177e4 LT |
2843 | } |
2844 | ||
2845 | int vfs_rmdir(struct inode *dir, struct dentry *dentry) | |
2846 | { | |
2847 | int error = may_delete(dir, dentry, 1); | |
2848 | ||
2849 | if (error) | |
2850 | return error; | |
2851 | ||
acfa4380 | 2852 | if (!dir->i_op->rmdir) |
1da177e4 LT |
2853 | return -EPERM; |
2854 | ||
1b1dcc1b | 2855 | mutex_lock(&dentry->d_inode->i_mutex); |
1da177e4 LT |
2856 | dentry_unhash(dentry); |
2857 | if (d_mountpoint(dentry)) | |
2858 | error = -EBUSY; | |
2859 | else { | |
2860 | error = security_inode_rmdir(dir, dentry); | |
2861 | if (!error) { | |
2862 | error = dir->i_op->rmdir(dir, dentry); | |
d83c49f3 | 2863 | if (!error) { |
1da177e4 | 2864 | dentry->d_inode->i_flags |= S_DEAD; |
d83c49f3 AV |
2865 | dont_mount(dentry); |
2866 | } | |
1da177e4 LT |
2867 | } |
2868 | } | |
1b1dcc1b | 2869 | mutex_unlock(&dentry->d_inode->i_mutex); |
1da177e4 | 2870 | if (!error) { |
1da177e4 LT |
2871 | d_delete(dentry); |
2872 | } | |
2873 | dput(dentry); | |
2874 | ||
2875 | return error; | |
2876 | } | |
2877 | ||
5590ff0d | 2878 | static long do_rmdir(int dfd, const char __user *pathname) |
1da177e4 LT |
2879 | { |
2880 | int error = 0; | |
2881 | char * name; | |
2882 | struct dentry *dentry; | |
2883 | struct nameidata nd; | |
2884 | ||
2ad94ae6 | 2885 | error = user_path_parent(dfd, pathname, &nd, &name); |
1da177e4 | 2886 | if (error) |
2ad94ae6 | 2887 | return error; |
1da177e4 LT |
2888 | |
2889 | switch(nd.last_type) { | |
0612d9fb OH |
2890 | case LAST_DOTDOT: |
2891 | error = -ENOTEMPTY; | |
2892 | goto exit1; | |
2893 | case LAST_DOT: | |
2894 | error = -EINVAL; | |
2895 | goto exit1; | |
2896 | case LAST_ROOT: | |
2897 | error = -EBUSY; | |
2898 | goto exit1; | |
1da177e4 | 2899 | } |
0612d9fb OH |
2900 | |
2901 | nd.flags &= ~LOOKUP_PARENT; | |
2902 | ||
4ac91378 | 2903 | mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT); |
49705b77 | 2904 | dentry = lookup_hash(&nd); |
1da177e4 | 2905 | error = PTR_ERR(dentry); |
6902d925 DH |
2906 | if (IS_ERR(dentry)) |
2907 | goto exit2; | |
0622753b DH |
2908 | error = mnt_want_write(nd.path.mnt); |
2909 | if (error) | |
2910 | goto exit3; | |
be6d3e56 KT |
2911 | error = security_path_rmdir(&nd.path, dentry); |
2912 | if (error) | |
2913 | goto exit4; | |
4ac91378 | 2914 | error = vfs_rmdir(nd.path.dentry->d_inode, dentry); |
be6d3e56 | 2915 | exit4: |
0622753b DH |
2916 | mnt_drop_write(nd.path.mnt); |
2917 | exit3: | |
6902d925 DH |
2918 | dput(dentry); |
2919 | exit2: | |
4ac91378 | 2920 | mutex_unlock(&nd.path.dentry->d_inode->i_mutex); |
1da177e4 | 2921 | exit1: |
1d957f9b | 2922 | path_put(&nd.path); |
1da177e4 LT |
2923 | putname(name); |
2924 | return error; | |
2925 | } | |
2926 | ||
3cdad428 | 2927 | SYSCALL_DEFINE1(rmdir, const char __user *, pathname) |
5590ff0d UD |
2928 | { |
2929 | return do_rmdir(AT_FDCWD, pathname); | |
2930 | } | |
2931 | ||
1da177e4 LT |
2932 | int vfs_unlink(struct inode *dir, struct dentry *dentry) |
2933 | { | |
2934 | int error = may_delete(dir, dentry, 0); | |
2935 | ||
2936 | if (error) | |
2937 | return error; | |
2938 | ||
acfa4380 | 2939 | if (!dir->i_op->unlink) |
1da177e4 LT |
2940 | return -EPERM; |
2941 | ||
1b1dcc1b | 2942 | mutex_lock(&dentry->d_inode->i_mutex); |
1da177e4 LT |
2943 | if (d_mountpoint(dentry)) |
2944 | error = -EBUSY; | |
2945 | else { | |
2946 | error = security_inode_unlink(dir, dentry); | |
bec1052e | 2947 | if (!error) { |
1da177e4 | 2948 | error = dir->i_op->unlink(dir, dentry); |
bec1052e | 2949 | if (!error) |
d83c49f3 | 2950 | dont_mount(dentry); |
bec1052e | 2951 | } |
1da177e4 | 2952 | } |
1b1dcc1b | 2953 | mutex_unlock(&dentry->d_inode->i_mutex); |
1da177e4 LT |
2954 | |
2955 | /* We don't d_delete() NFS sillyrenamed files--they still exist. */ | |
2956 | if (!error && !(dentry->d_flags & DCACHE_NFSFS_RENAMED)) { | |
ece95912 | 2957 | fsnotify_link_count(dentry->d_inode); |
e234f35c | 2958 | d_delete(dentry); |
1da177e4 | 2959 | } |
0eeca283 | 2960 | |
1da177e4 LT |
2961 | return error; |
2962 | } | |
2963 | ||
2964 | /* | |
2965 | * Make sure that the actual truncation of the file will occur outside its | |
1b1dcc1b | 2966 | * directory's i_mutex. Truncate can take a long time if there is a lot of |
1da177e4 LT |
2967 | * writeout happening, and we don't want to prevent access to the directory |
2968 | * while waiting on the I/O. | |
2969 | */ | |
5590ff0d | 2970 | static long do_unlinkat(int dfd, const char __user *pathname) |
1da177e4 | 2971 | { |
2ad94ae6 AV |
2972 | int error; |
2973 | char *name; | |
1da177e4 LT |
2974 | struct dentry *dentry; |
2975 | struct nameidata nd; | |
2976 | struct inode *inode = NULL; | |
2977 | ||
2ad94ae6 | 2978 | error = user_path_parent(dfd, pathname, &nd, &name); |
1da177e4 | 2979 | if (error) |
2ad94ae6 AV |
2980 | return error; |
2981 | ||
1da177e4 LT |
2982 | error = -EISDIR; |
2983 | if (nd.last_type != LAST_NORM) | |
2984 | goto exit1; | |
0612d9fb OH |
2985 | |
2986 | nd.flags &= ~LOOKUP_PARENT; | |
2987 | ||
4ac91378 | 2988 | mutex_lock_nested(&nd.path.dentry->d_inode->i_mutex, I_MUTEX_PARENT); |
49705b77 | 2989 | dentry = lookup_hash(&nd); |
1da177e4 LT |
2990 | error = PTR_ERR(dentry); |
2991 | if (!IS_ERR(dentry)) { | |
2992 | /* Why not before? Because we want correct error value */ | |
2993 | if (nd.last.name[nd.last.len]) | |
2994 | goto slashes; | |
2995 | inode = dentry->d_inode; | |
2996 | if (inode) | |
7de9c6ee | 2997 | ihold(inode); |
0622753b DH |
2998 | error = mnt_want_write(nd.path.mnt); |
2999 | if (error) | |
3000 | goto exit2; | |
be6d3e56 KT |
3001 | error = security_path_unlink(&nd.path, dentry); |
3002 | if (error) | |
3003 | goto exit3; | |
4ac91378 | 3004 | error = vfs_unlink(nd.path.dentry->d_inode, dentry); |
be6d3e56 | 3005 | exit3: |
0622753b | 3006 | mnt_drop_write(nd.path.mnt); |
1da177e4 LT |
3007 | exit2: |
3008 | dput(dentry); | |
3009 | } | |
4ac91378 | 3010 | mutex_unlock(&nd.path.dentry->d_inode->i_mutex); |
1da177e4 LT |
3011 | if (inode) |
3012 | iput(inode); /* truncate the inode here */ | |
3013 | exit1: | |
1d957f9b | 3014 | path_put(&nd.path); |
1da177e4 LT |
3015 | putname(name); |
3016 | return error; | |
3017 | ||
3018 | slashes: | |
3019 | error = !dentry->d_inode ? -ENOENT : | |
3020 | S_ISDIR(dentry->d_inode->i_mode) ? -EISDIR : -ENOTDIR; | |
3021 | goto exit2; | |
3022 | } | |
3023 | ||
2e4d0924 | 3024 | SYSCALL_DEFINE3(unlinkat, int, dfd, const char __user *, pathname, int, flag) |
5590ff0d UD |
3025 | { |
3026 | if ((flag & ~AT_REMOVEDIR) != 0) | |
3027 | return -EINVAL; | |
3028 | ||
3029 | if (flag & AT_REMOVEDIR) | |
3030 | return do_rmdir(dfd, pathname); | |
3031 | ||
3032 | return do_unlinkat(dfd, pathname); | |
3033 | } | |
3034 | ||
3480b257 | 3035 | SYSCALL_DEFINE1(unlink, const char __user *, pathname) |
5590ff0d UD |
3036 | { |
3037 | return do_unlinkat(AT_FDCWD, pathname); | |
3038 | } | |
3039 | ||
db2e747b | 3040 | int vfs_symlink(struct inode *dir, struct dentry *dentry, const char *oldname) |
1da177e4 | 3041 | { |
a95164d9 | 3042 | int error = may_create(dir, dentry); |
1da177e4 LT |
3043 | |
3044 | if (error) | |
3045 | return error; | |
3046 | ||
acfa4380 | 3047 | if (!dir->i_op->symlink) |
1da177e4 LT |
3048 | return -EPERM; |
3049 | ||
3050 | error = security_inode_symlink(dir, dentry, oldname); | |
3051 | if (error) | |
3052 | return error; | |
3053 | ||
1da177e4 | 3054 | error = dir->i_op->symlink(dir, dentry, oldname); |
a74574aa | 3055 | if (!error) |
f38aa942 | 3056 | fsnotify_create(dir, dentry); |
1da177e4 LT |
3057 | return error; |
3058 | } | |
3059 | ||
2e4d0924 HC |
3060 | SYSCALL_DEFINE3(symlinkat, const char __user *, oldname, |
3061 | int, newdfd, const char __user *, newname) | |
1da177e4 | 3062 | { |
2ad94ae6 AV |
3063 | int error; |
3064 | char *from; | |
3065 | char *to; | |
6902d925 DH |
3066 | struct dentry *dentry; |
3067 | struct nameidata nd; | |
1da177e4 LT |
3068 | |
3069 | from = getname(oldname); | |
2ad94ae6 | 3070 | if (IS_ERR(from)) |
1da177e4 | 3071 | return PTR_ERR(from); |
1da177e4 | 3072 | |
2ad94ae6 | 3073 | error = user_path_parent(newdfd, newname, &nd, &to); |
6902d925 | 3074 | if (error) |
2ad94ae6 AV |
3075 | goto out_putname; |
3076 | ||
6902d925 DH |
3077 | dentry = lookup_create(&nd, 0); |
3078 | error = PTR_ERR(dentry); | |
3079 | if (IS_ERR(dentry)) | |
3080 | goto out_unlock; | |
3081 | ||
75c3f29d DH |
3082 | error = mnt_want_write(nd.path.mnt); |
3083 | if (error) | |
3084 | goto out_dput; | |
be6d3e56 KT |
3085 | error = security_path_symlink(&nd.path, dentry, from); |
3086 | if (error) | |
3087 | goto out_drop_write; | |
db2e747b | 3088 | error = vfs_symlink(nd.path.dentry->d_inode, dentry, from); |
be6d3e56 | 3089 | out_drop_write: |
75c3f29d DH |
3090 | mnt_drop_write(nd.path.mnt); |
3091 | out_dput: | |
6902d925 DH |
3092 | dput(dentry); |
3093 | out_unlock: | |
4ac91378 | 3094 | mutex_unlock(&nd.path.dentry->d_inode->i_mutex); |
1d957f9b | 3095 | path_put(&nd.path); |
6902d925 DH |
3096 | putname(to); |
3097 | out_putname: | |
1da177e4 LT |
3098 | putname(from); |
3099 | return error; | |
3100 | } | |
3101 | ||
3480b257 | 3102 | SYSCALL_DEFINE2(symlink, const char __user *, oldname, const char __user *, newname) |
5590ff0d UD |
3103 | { |
3104 | return sys_symlinkat(oldname, AT_FDCWD, newname); | |
3105 | } | |
3106 | ||
1da177e4 LT |
3107 | int vfs_link(struct dentry *old_dentry, struct inode *dir, struct dentry *new_dentry) |
3108 | { | |
3109 | struct inode *inode = old_dentry->d_inode; | |
3110 | int error; | |
3111 | ||
3112 | if (!inode) | |
3113 | return -ENOENT; | |
3114 | ||
a95164d9 | 3115 | error = may_create(dir, new_dentry); |
1da177e4 LT |
3116 | if (error) |
3117 | return error; | |
3118 | ||
3119 | if (dir->i_sb != inode->i_sb) | |
3120 | return -EXDEV; | |
3121 | ||
3122 | /* | |
3123 | * A link to an append-only or immutable file cannot be created. | |
3124 | */ | |
3125 | if (IS_APPEND(inode) || IS_IMMUTABLE(inode)) | |
3126 | return -EPERM; | |
acfa4380 | 3127 | if (!dir->i_op->link) |
1da177e4 | 3128 | return -EPERM; |
7e79eedb | 3129 | if (S_ISDIR(inode->i_mode)) |
1da177e4 LT |
3130 | return -EPERM; |
3131 | ||
3132 | error = security_inode_link(old_dentry, dir, new_dentry); | |
3133 | if (error) | |
3134 | return error; | |
3135 | ||
7e79eedb | 3136 | mutex_lock(&inode->i_mutex); |
1da177e4 | 3137 | error = dir->i_op->link(old_dentry, dir, new_dentry); |
7e79eedb | 3138 | mutex_unlock(&inode->i_mutex); |
e31e14ec | 3139 | if (!error) |
7e79eedb | 3140 | fsnotify_link(dir, inode, new_dentry); |
1da177e4 LT |
3141 | return error; |
3142 | } | |
3143 | ||
3144 | /* | |
3145 | * Hardlinks are often used in delicate situations. We avoid | |
3146 | * security-related surprises by not following symlinks on the | |
3147 | * newname. --KAB | |
3148 | * | |
3149 | * We don't follow them on the oldname either to be compatible | |
3150 | * with linux 2.0, and to avoid hard-linking to directories | |
3151 | * and other special files. --ADM | |
3152 | */ | |
2e4d0924 HC |
3153 | SYSCALL_DEFINE5(linkat, int, olddfd, const char __user *, oldname, |
3154 | int, newdfd, const char __user *, newname, int, flags) | |
1da177e4 LT |
3155 | { |
3156 | struct dentry *new_dentry; | |
2d8f3038 AV |
3157 | struct nameidata nd; |
3158 | struct path old_path; | |
1da177e4 | 3159 | int error; |
2ad94ae6 | 3160 | char *to; |
1da177e4 | 3161 | |
45c9b11a | 3162 | if ((flags & ~AT_SYMLINK_FOLLOW) != 0) |
c04030e1 UD |
3163 | return -EINVAL; |
3164 | ||
2d8f3038 AV |
3165 | error = user_path_at(olddfd, oldname, |
3166 | flags & AT_SYMLINK_FOLLOW ? LOOKUP_FOLLOW : 0, | |
3167 | &old_path); | |
1da177e4 | 3168 | if (error) |
2ad94ae6 AV |
3169 | return error; |
3170 | ||
3171 | error = user_path_parent(newdfd, newname, &nd, &to); | |
1da177e4 LT |
3172 | if (error) |
3173 | goto out; | |
3174 | error = -EXDEV; | |
2d8f3038 | 3175 | if (old_path.mnt != nd.path.mnt) |
1da177e4 LT |
3176 | goto out_release; |
3177 | new_dentry = lookup_create(&nd, 0); | |
3178 | error = PTR_ERR(new_dentry); | |
6902d925 DH |
3179 | if (IS_ERR(new_dentry)) |
3180 | goto out_unlock; | |
75c3f29d DH |
3181 | error = mnt_want_write(nd.path.mnt); |
3182 | if (error) | |
3183 | goto out_dput; | |
be6d3e56 KT |
3184 | error = security_path_link(old_path.dentry, &nd.path, new_dentry); |
3185 | if (error) | |
3186 | goto out_drop_write; | |
2d8f3038 | 3187 | error = vfs_link(old_path.dentry, nd.path.dentry->d_inode, new_dentry); |
be6d3e56 | 3188 | out_drop_write: |
75c3f29d DH |
3189 | mnt_drop_write(nd.path.mnt); |
3190 | out_dput: | |
6902d925 DH |
3191 | dput(new_dentry); |
3192 | out_unlock: | |
4ac91378 | 3193 | mutex_unlock(&nd.path.dentry->d_inode->i_mutex); |
1da177e4 | 3194 | out_release: |
1d957f9b | 3195 | path_put(&nd.path); |
2ad94ae6 | 3196 | putname(to); |
1da177e4 | 3197 | out: |
2d8f3038 | 3198 | path_put(&old_path); |
1da177e4 LT |
3199 | |
3200 | return error; | |
3201 | } | |
3202 | ||
3480b257 | 3203 | SYSCALL_DEFINE2(link, const char __user *, oldname, const char __user *, newname) |
5590ff0d | 3204 | { |
c04030e1 | 3205 | return sys_linkat(AT_FDCWD, oldname, AT_FDCWD, newname, 0); |
5590ff0d UD |
3206 | } |
3207 | ||
1da177e4 LT |
3208 | /* |
3209 | * The worst of all namespace operations - renaming directory. "Perverted" | |
3210 | * doesn't even start to describe it. Somebody in UCB had a heck of a trip... | |
3211 | * Problems: | |
3212 | * a) we can get into loop creation. Check is done in is_subdir(). | |
3213 | * b) race potential - two innocent renames can create a loop together. | |
3214 | * That's where 4.4 screws up. Current fix: serialization on | |
a11f3a05 | 3215 | * sb->s_vfs_rename_mutex. We might be more accurate, but that's another |
1da177e4 LT |
3216 | * story. |
3217 | * c) we have to lock _three_ objects - parents and victim (if it exists). | |
1b1dcc1b | 3218 | * And that - after we got ->i_mutex on parents (until then we don't know |
1da177e4 LT |
3219 | * whether the target exists). Solution: try to be smart with locking |
3220 | * order for inodes. We rely on the fact that tree topology may change | |
a11f3a05 | 3221 | * only under ->s_vfs_rename_mutex _and_ that parent of the object we |
1da177e4 LT |
3222 | * move will be locked. Thus we can rank directories by the tree |
3223 | * (ancestors first) and rank all non-directories after them. | |
3224 | * That works since everybody except rename does "lock parent, lookup, | |
a11f3a05 | 3225 | * lock child" and rename is under ->s_vfs_rename_mutex. |
1da177e4 LT |
3226 | * HOWEVER, it relies on the assumption that any object with ->lookup() |
3227 | * has no more than 1 dentry. If "hybrid" objects will ever appear, | |
3228 | * we'd better make sure that there's no link(2) for them. | |
3229 | * d) some filesystems don't support opened-but-unlinked directories, | |
3230 | * either because of layout or because they are not ready to deal with | |
3231 | * all cases correctly. The latter will be fixed (taking this sort of | |
3232 | * stuff into VFS), but the former is not going away. Solution: the same | |
3233 | * trick as in rmdir(). | |
3234 | * e) conversion from fhandle to dentry may come in the wrong moment - when | |
1b1dcc1b | 3235 | * we are removing the target. Solution: we will have to grab ->i_mutex |
1da177e4 | 3236 | * in the fhandle_to_dentry code. [FIXME - current nfsfh.c relies on |
c41b20e7 | 3237 | * ->i_mutex on parents, which works but leads to some truly excessive |
1da177e4 LT |
3238 | * locking]. |
3239 | */ | |
75c96f85 AB |
3240 | static int vfs_rename_dir(struct inode *old_dir, struct dentry *old_dentry, |
3241 | struct inode *new_dir, struct dentry *new_dentry) | |
1da177e4 LT |
3242 | { |
3243 | int error = 0; | |
3244 | struct inode *target; | |
3245 | ||
3246 | /* | |
3247 | * If we are going to change the parent - check write permissions, | |
3248 | * we'll need to flip '..'. | |
3249 | */ | |
3250 | if (new_dir != old_dir) { | |
f419a2e3 | 3251 | error = inode_permission(old_dentry->d_inode, MAY_WRITE); |
1da177e4 LT |
3252 | if (error) |
3253 | return error; | |
3254 | } | |
3255 | ||
3256 | error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry); | |
3257 | if (error) | |
3258 | return error; | |
3259 | ||
3260 | target = new_dentry->d_inode; | |
d83c49f3 | 3261 | if (target) |
1b1dcc1b | 3262 | mutex_lock(&target->i_mutex); |
1da177e4 LT |
3263 | if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry)) |
3264 | error = -EBUSY; | |
d83c49f3 AV |
3265 | else { |
3266 | if (target) | |
3267 | dentry_unhash(new_dentry); | |
1da177e4 | 3268 | error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry); |
d83c49f3 | 3269 | } |
1da177e4 | 3270 | if (target) { |
d83c49f3 | 3271 | if (!error) { |
1da177e4 | 3272 | target->i_flags |= S_DEAD; |
d83c49f3 AV |
3273 | dont_mount(new_dentry); |
3274 | } | |
1b1dcc1b | 3275 | mutex_unlock(&target->i_mutex); |
1da177e4 LT |
3276 | if (d_unhashed(new_dentry)) |
3277 | d_rehash(new_dentry); | |
3278 | dput(new_dentry); | |
3279 | } | |
e31e14ec | 3280 | if (!error) |
349457cc MF |
3281 | if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE)) |
3282 | d_move(old_dentry,new_dentry); | |
1da177e4 LT |
3283 | return error; |
3284 | } | |
3285 | ||
75c96f85 AB |
3286 | static int vfs_rename_other(struct inode *old_dir, struct dentry *old_dentry, |
3287 | struct inode *new_dir, struct dentry *new_dentry) | |
1da177e4 LT |
3288 | { |
3289 | struct inode *target; | |
3290 | int error; | |
3291 | ||
3292 | error = security_inode_rename(old_dir, old_dentry, new_dir, new_dentry); | |
3293 | if (error) | |
3294 | return error; | |
3295 | ||
3296 | dget(new_dentry); | |
3297 | target = new_dentry->d_inode; | |
3298 | if (target) | |
1b1dcc1b | 3299 | mutex_lock(&target->i_mutex); |
1da177e4 LT |
3300 | if (d_mountpoint(old_dentry)||d_mountpoint(new_dentry)) |
3301 | error = -EBUSY; | |
3302 | else | |
3303 | error = old_dir->i_op->rename(old_dir, old_dentry, new_dir, new_dentry); | |
3304 | if (!error) { | |
bec1052e | 3305 | if (target) |
d83c49f3 | 3306 | dont_mount(new_dentry); |
349457cc | 3307 | if (!(old_dir->i_sb->s_type->fs_flags & FS_RENAME_DOES_D_MOVE)) |
1da177e4 | 3308 | d_move(old_dentry, new_dentry); |
1da177e4 LT |
3309 | } |
3310 | if (target) | |
1b1dcc1b | 3311 | mutex_unlock(&target->i_mutex); |
1da177e4 LT |
3312 | dput(new_dentry); |
3313 | return error; | |
3314 | } | |
3315 | ||
3316 | int vfs_rename(struct inode *old_dir, struct dentry *old_dentry, | |
3317 | struct inode *new_dir, struct dentry *new_dentry) | |
3318 | { | |
3319 | int error; | |
3320 | int is_dir = S_ISDIR(old_dentry->d_inode->i_mode); | |
59b0df21 | 3321 | const unsigned char *old_name; |
1da177e4 LT |
3322 | |
3323 | if (old_dentry->d_inode == new_dentry->d_inode) | |
3324 | return 0; | |
3325 | ||
3326 | error = may_delete(old_dir, old_dentry, is_dir); | |
3327 | if (error) | |
3328 | return error; | |
3329 | ||
3330 | if (!new_dentry->d_inode) | |
a95164d9 | 3331 | error = may_create(new_dir, new_dentry); |
1da177e4 LT |
3332 | else |
3333 | error = may_delete(new_dir, new_dentry, is_dir); | |
3334 | if (error) | |
3335 | return error; | |
3336 | ||
acfa4380 | 3337 | if (!old_dir->i_op->rename) |
1da177e4 LT |
3338 | return -EPERM; |
3339 | ||
0eeca283 RL |
3340 | old_name = fsnotify_oldname_init(old_dentry->d_name.name); |
3341 | ||
1da177e4 LT |
3342 | if (is_dir) |
3343 | error = vfs_rename_dir(old_dir,old_dentry,new_dir,new_dentry); | |
3344 | else | |
3345 | error = vfs_rename_other(old_dir,old_dentry,new_dir,new_dentry); | |
123df294 AV |
3346 | if (!error) |
3347 | fsnotify_move(old_dir, new_dir, old_name, is_dir, | |
5a190ae6 | 3348 | new_dentry->d_inode, old_dentry); |
0eeca283 RL |
3349 | fsnotify_oldname_free(old_name); |
3350 | ||
1da177e4 LT |
3351 | return error; |
3352 | } | |
3353 | ||
2e4d0924 HC |
3354 | SYSCALL_DEFINE4(renameat, int, olddfd, const char __user *, oldname, |
3355 | int, newdfd, const char __user *, newname) | |
1da177e4 | 3356 | { |
2ad94ae6 AV |
3357 | struct dentry *old_dir, *new_dir; |
3358 | struct dentry *old_dentry, *new_dentry; | |
3359 | struct dentry *trap; | |
1da177e4 | 3360 | struct nameidata oldnd, newnd; |
2ad94ae6 AV |
3361 | char *from; |
3362 | char *to; | |
3363 | int error; | |
1da177e4 | 3364 | |
2ad94ae6 | 3365 | error = user_path_parent(olddfd, oldname, &oldnd, &from); |
1da177e4 LT |
3366 | if (error) |
3367 | goto exit; | |
3368 | ||
2ad94ae6 | 3369 | error = user_path_parent(newdfd, newname, &newnd, &to); |
1da177e4 LT |
3370 | if (error) |
3371 | goto exit1; | |
3372 | ||
3373 | error = -EXDEV; | |
4ac91378 | 3374 | if (oldnd.path.mnt != newnd.path.mnt) |
1da177e4 LT |
3375 | goto exit2; |
3376 | ||
4ac91378 | 3377 | old_dir = oldnd.path.dentry; |
1da177e4 LT |
3378 | error = -EBUSY; |
3379 | if (oldnd.last_type != LAST_NORM) | |
3380 | goto exit2; | |
3381 | ||
4ac91378 | 3382 | new_dir = newnd.path.dentry; |
1da177e4 LT |
3383 | if (newnd.last_type != LAST_NORM) |
3384 | goto exit2; | |
3385 | ||
0612d9fb OH |
3386 | oldnd.flags &= ~LOOKUP_PARENT; |
3387 | newnd.flags &= ~LOOKUP_PARENT; | |
4e9ed2f8 | 3388 | newnd.flags |= LOOKUP_RENAME_TARGET; |
0612d9fb | 3389 | |
1da177e4 LT |
3390 | trap = lock_rename(new_dir, old_dir); |
3391 | ||
49705b77 | 3392 | old_dentry = lookup_hash(&oldnd); |
1da177e4 LT |
3393 | error = PTR_ERR(old_dentry); |
3394 | if (IS_ERR(old_dentry)) | |
3395 | goto exit3; | |
3396 | /* source must exist */ | |
3397 | error = -ENOENT; | |
3398 | if (!old_dentry->d_inode) | |
3399 | goto exit4; | |
3400 | /* unless the source is a directory trailing slashes give -ENOTDIR */ | |
3401 | if (!S_ISDIR(old_dentry->d_inode->i_mode)) { | |
3402 | error = -ENOTDIR; | |
3403 | if (oldnd.last.name[oldnd.last.len]) | |
3404 | goto exit4; | |
3405 | if (newnd.last.name[newnd.last.len]) | |
3406 | goto exit4; | |
3407 | } | |
3408 | /* source should not be ancestor of target */ | |
3409 | error = -EINVAL; | |
3410 | if (old_dentry == trap) | |
3411 | goto exit4; | |
49705b77 | 3412 | new_dentry = lookup_hash(&newnd); |
1da177e4 LT |
3413 | error = PTR_ERR(new_dentry); |
3414 | if (IS_ERR(new_dentry)) | |
3415 | goto exit4; | |
3416 | /* target should not be an ancestor of source */ | |
3417 | error = -ENOTEMPTY; | |
3418 | if (new_dentry == trap) | |
3419 | goto exit5; | |
3420 | ||
9079b1eb DH |
3421 | error = mnt_want_write(oldnd.path.mnt); |
3422 | if (error) | |
3423 | goto exit5; | |
be6d3e56 KT |
3424 | error = security_path_rename(&oldnd.path, old_dentry, |
3425 | &newnd.path, new_dentry); | |
3426 | if (error) | |
3427 | goto exit6; | |
1da177e4 LT |
3428 | error = vfs_rename(old_dir->d_inode, old_dentry, |
3429 | new_dir->d_inode, new_dentry); | |
be6d3e56 | 3430 | exit6: |
9079b1eb | 3431 | mnt_drop_write(oldnd.path.mnt); |
1da177e4 LT |
3432 | exit5: |
3433 | dput(new_dentry); | |
3434 | exit4: | |
3435 | dput(old_dentry); | |
3436 | exit3: | |
3437 | unlock_rename(new_dir, old_dir); | |
3438 | exit2: | |
1d957f9b | 3439 | path_put(&newnd.path); |
2ad94ae6 | 3440 | putname(to); |
1da177e4 | 3441 | exit1: |
1d957f9b | 3442 | path_put(&oldnd.path); |
1da177e4 | 3443 | putname(from); |
2ad94ae6 | 3444 | exit: |
1da177e4 LT |
3445 | return error; |
3446 | } | |
3447 | ||
a26eab24 | 3448 | SYSCALL_DEFINE2(rename, const char __user *, oldname, const char __user *, newname) |
5590ff0d UD |
3449 | { |
3450 | return sys_renameat(AT_FDCWD, oldname, AT_FDCWD, newname); | |
3451 | } | |
3452 | ||
1da177e4 LT |
3453 | int vfs_readlink(struct dentry *dentry, char __user *buffer, int buflen, const char *link) |
3454 | { | |
3455 | int len; | |
3456 | ||
3457 | len = PTR_ERR(link); | |
3458 | if (IS_ERR(link)) | |
3459 | goto out; | |
3460 | ||
3461 | len = strlen(link); | |
3462 | if (len > (unsigned) buflen) | |
3463 | len = buflen; | |
3464 | if (copy_to_user(buffer, link, len)) | |
3465 | len = -EFAULT; | |
3466 | out: | |
3467 | return len; | |
3468 | } | |
3469 | ||
3470 | /* | |
3471 | * A helper for ->readlink(). This should be used *ONLY* for symlinks that | |
3472 | * have ->follow_link() touching nd only in nd_set_link(). Using (or not | |
3473 | * using) it for any given inode is up to filesystem. | |
3474 | */ | |
3475 | int generic_readlink(struct dentry *dentry, char __user *buffer, int buflen) | |
3476 | { | |
3477 | struct nameidata nd; | |
cc314eef | 3478 | void *cookie; |
694a1764 | 3479 | int res; |
cc314eef | 3480 | |
1da177e4 | 3481 | nd.depth = 0; |
cc314eef | 3482 | cookie = dentry->d_inode->i_op->follow_link(dentry, &nd); |
694a1764 MS |
3483 | if (IS_ERR(cookie)) |
3484 | return PTR_ERR(cookie); | |
3485 | ||
3486 | res = vfs_readlink(dentry, buffer, buflen, nd_get_link(&nd)); | |
3487 | if (dentry->d_inode->i_op->put_link) | |
3488 | dentry->d_inode->i_op->put_link(dentry, &nd, cookie); | |
3489 | return res; | |
1da177e4 LT |
3490 | } |
3491 | ||
3492 | int vfs_follow_link(struct nameidata *nd, const char *link) | |
3493 | { | |
3494 | return __vfs_follow_link(nd, link); | |
3495 | } | |
3496 | ||
3497 | /* get the link contents into pagecache */ | |
3498 | static char *page_getlink(struct dentry * dentry, struct page **ppage) | |
3499 | { | |
ebd09abb DG |
3500 | char *kaddr; |
3501 | struct page *page; | |
1da177e4 | 3502 | struct address_space *mapping = dentry->d_inode->i_mapping; |
090d2b18 | 3503 | page = read_mapping_page(mapping, 0, NULL); |
1da177e4 | 3504 | if (IS_ERR(page)) |
6fe6900e | 3505 | return (char*)page; |
1da177e4 | 3506 | *ppage = page; |
ebd09abb DG |
3507 | kaddr = kmap(page); |
3508 | nd_terminate_link(kaddr, dentry->d_inode->i_size, PAGE_SIZE - 1); | |
3509 | return kaddr; | |
1da177e4 LT |
3510 | } |
3511 | ||
3512 | int page_readlink(struct dentry *dentry, char __user *buffer, int buflen) | |
3513 | { | |
3514 | struct page *page = NULL; | |
3515 | char *s = page_getlink(dentry, &page); | |
3516 | int res = vfs_readlink(dentry,buffer,buflen,s); | |
3517 | if (page) { | |
3518 | kunmap(page); | |
3519 | page_cache_release(page); | |
3520 | } | |
3521 | return res; | |
3522 | } | |
3523 | ||
cc314eef | 3524 | void *page_follow_link_light(struct dentry *dentry, struct nameidata *nd) |
1da177e4 | 3525 | { |
cc314eef | 3526 | struct page *page = NULL; |
1da177e4 | 3527 | nd_set_link(nd, page_getlink(dentry, &page)); |
cc314eef | 3528 | return page; |
1da177e4 LT |
3529 | } |
3530 | ||
cc314eef | 3531 | void page_put_link(struct dentry *dentry, struct nameidata *nd, void *cookie) |
1da177e4 | 3532 | { |
cc314eef LT |
3533 | struct page *page = cookie; |
3534 | ||
3535 | if (page) { | |
1da177e4 LT |
3536 | kunmap(page); |
3537 | page_cache_release(page); | |
1da177e4 LT |
3538 | } |
3539 | } | |
3540 | ||
54566b2c NP |
3541 | /* |
3542 | * The nofs argument instructs pagecache_write_begin to pass AOP_FLAG_NOFS | |
3543 | */ | |
3544 | int __page_symlink(struct inode *inode, const char *symname, int len, int nofs) | |
1da177e4 LT |
3545 | { |
3546 | struct address_space *mapping = inode->i_mapping; | |
0adb25d2 | 3547 | struct page *page; |
afddba49 | 3548 | void *fsdata; |
beb497ab | 3549 | int err; |
1da177e4 | 3550 | char *kaddr; |
54566b2c NP |
3551 | unsigned int flags = AOP_FLAG_UNINTERRUPTIBLE; |
3552 | if (nofs) | |
3553 | flags |= AOP_FLAG_NOFS; | |
1da177e4 | 3554 | |
7e53cac4 | 3555 | retry: |
afddba49 | 3556 | err = pagecache_write_begin(NULL, mapping, 0, len-1, |
54566b2c | 3557 | flags, &page, &fsdata); |
1da177e4 | 3558 | if (err) |
afddba49 NP |
3559 | goto fail; |
3560 | ||
1da177e4 LT |
3561 | kaddr = kmap_atomic(page, KM_USER0); |
3562 | memcpy(kaddr, symname, len-1); | |
3563 | kunmap_atomic(kaddr, KM_USER0); | |
afddba49 NP |
3564 | |
3565 | err = pagecache_write_end(NULL, mapping, 0, len-1, len-1, | |
3566 | page, fsdata); | |
1da177e4 LT |
3567 | if (err < 0) |
3568 | goto fail; | |
afddba49 NP |
3569 | if (err < len-1) |
3570 | goto retry; | |
3571 | ||
1da177e4 LT |
3572 | mark_inode_dirty(inode); |
3573 | return 0; | |
1da177e4 LT |
3574 | fail: |
3575 | return err; | |
3576 | } | |
3577 | ||
0adb25d2 KK |
3578 | int page_symlink(struct inode *inode, const char *symname, int len) |
3579 | { | |
3580 | return __page_symlink(inode, symname, len, | |
54566b2c | 3581 | !(mapping_gfp_mask(inode->i_mapping) & __GFP_FS)); |
0adb25d2 KK |
3582 | } |
3583 | ||
92e1d5be | 3584 | const struct inode_operations page_symlink_inode_operations = { |
1da177e4 LT |
3585 | .readlink = generic_readlink, |
3586 | .follow_link = page_follow_link_light, | |
3587 | .put_link = page_put_link, | |
3588 | }; | |
3589 | ||
2d8f3038 | 3590 | EXPORT_SYMBOL(user_path_at); |
cc53ce53 | 3591 | EXPORT_SYMBOL(follow_down_one); |
1da177e4 LT |
3592 | EXPORT_SYMBOL(follow_down); |
3593 | EXPORT_SYMBOL(follow_up); | |
3594 | EXPORT_SYMBOL(get_write_access); /* binfmt_aout */ | |
3595 | EXPORT_SYMBOL(getname); | |
3596 | EXPORT_SYMBOL(lock_rename); | |
1da177e4 LT |
3597 | EXPORT_SYMBOL(lookup_one_len); |
3598 | EXPORT_SYMBOL(page_follow_link_light); | |
3599 | EXPORT_SYMBOL(page_put_link); | |
3600 | EXPORT_SYMBOL(page_readlink); | |
0adb25d2 | 3601 | EXPORT_SYMBOL(__page_symlink); |
1da177e4 LT |
3602 | EXPORT_SYMBOL(page_symlink); |
3603 | EXPORT_SYMBOL(page_symlink_inode_operations); | |
3604 | EXPORT_SYMBOL(path_lookup); | |
d1811465 | 3605 | EXPORT_SYMBOL(kern_path); |
16f18200 | 3606 | EXPORT_SYMBOL(vfs_path_lookup); |
f419a2e3 | 3607 | EXPORT_SYMBOL(inode_permission); |
8c744fb8 | 3608 | EXPORT_SYMBOL(file_permission); |
1da177e4 LT |
3609 | EXPORT_SYMBOL(unlock_rename); |
3610 | EXPORT_SYMBOL(vfs_create); | |
3611 | EXPORT_SYMBOL(vfs_follow_link); | |
3612 | EXPORT_SYMBOL(vfs_link); | |
3613 | EXPORT_SYMBOL(vfs_mkdir); | |
3614 | EXPORT_SYMBOL(vfs_mknod); | |
3615 | EXPORT_SYMBOL(generic_permission); | |
3616 | EXPORT_SYMBOL(vfs_readlink); | |
3617 | EXPORT_SYMBOL(vfs_rename); | |
3618 | EXPORT_SYMBOL(vfs_rmdir); | |
3619 | EXPORT_SYMBOL(vfs_symlink); | |
3620 | EXPORT_SYMBOL(vfs_unlink); | |
3621 | EXPORT_SYMBOL(dentry_unhash); | |
3622 | EXPORT_SYMBOL(generic_readlink); |