3 * Copyright (C) 2011 Novell Inc.
5 * This program is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 as published by
7 * the Free Software Foundation.
11 #include <linux/slab.h>
12 #include <linux/namei.h>
13 #include <linux/file.h>
14 #include <linux/xattr.h>
15 #include <linux/rbtree.h>
16 #include <linux/security.h>
17 #include <linux/cred.h>
18 #include "overlayfs.h"
20 struct ovl_cache_entry
{
25 struct list_head l_node
;
30 struct ovl_dir_cache
{
33 struct list_head entries
;
36 struct ovl_readdir_data
{
37 struct dir_context ctx
;
40 struct list_head
*list
;
41 struct list_head
*middle
;
49 struct ovl_dir_cache
*cache
;
50 struct ovl_cache_entry cursor
;
51 struct file
*realfile
;
52 struct file
*upperfile
;
55 static struct ovl_cache_entry
*ovl_cache_entry_from_node(struct rb_node
*n
)
57 return container_of(n
, struct ovl_cache_entry
, node
);
60 static struct ovl_cache_entry
*ovl_cache_entry_find(struct rb_root
*root
,
61 const char *name
, int len
)
63 struct rb_node
*node
= root
->rb_node
;
67 struct ovl_cache_entry
*p
= ovl_cache_entry_from_node(node
);
69 cmp
= strncmp(name
, p
->name
, len
);
71 node
= p
->node
.rb_right
;
72 else if (cmp
< 0 || len
< p
->len
)
73 node
= p
->node
.rb_left
;
81 static struct ovl_cache_entry
*ovl_cache_entry_new(const char *name
, int len
,
82 u64 ino
, unsigned int d_type
)
84 struct ovl_cache_entry
*p
;
85 size_t size
= offsetof(struct ovl_cache_entry
, name
[len
+ 1]);
87 p
= kmalloc(size
, GFP_KERNEL
);
89 memcpy(p
->name
, name
, len
);
94 p
->is_whiteout
= false;
100 static int ovl_cache_entry_add_rb(struct ovl_readdir_data
*rdd
,
101 const char *name
, int len
, u64 ino
,
104 struct rb_node
**newp
= &rdd
->root
->rb_node
;
105 struct rb_node
*parent
= NULL
;
106 struct ovl_cache_entry
*p
;
110 struct ovl_cache_entry
*tmp
;
113 tmp
= ovl_cache_entry_from_node(*newp
);
114 cmp
= strncmp(name
, tmp
->name
, len
);
116 newp
= &tmp
->node
.rb_right
;
117 else if (cmp
< 0 || len
< tmp
->len
)
118 newp
= &tmp
->node
.rb_left
;
123 p
= ovl_cache_entry_new(name
, len
, ino
, d_type
);
127 list_add_tail(&p
->l_node
, rdd
->list
);
128 rb_link_node(&p
->node
, parent
, newp
);
129 rb_insert_color(&p
->node
, rdd
->root
);
134 static int ovl_fill_lower(struct ovl_readdir_data
*rdd
,
135 const char *name
, int namelen
,
136 loff_t offset
, u64 ino
, unsigned int d_type
)
138 struct ovl_cache_entry
*p
;
140 p
= ovl_cache_entry_find(rdd
->root
, name
, namelen
);
142 list_move_tail(&p
->l_node
, rdd
->middle
);
144 p
= ovl_cache_entry_new(name
, namelen
, ino
, d_type
);
148 list_add_tail(&p
->l_node
, rdd
->middle
);
154 void ovl_cache_free(struct list_head
*list
)
156 struct ovl_cache_entry
*p
;
157 struct ovl_cache_entry
*n
;
159 list_for_each_entry_safe(p
, n
, list
, l_node
)
162 INIT_LIST_HEAD(list
);
165 static void ovl_cache_put(struct ovl_dir_file
*od
, struct dentry
*dentry
)
167 struct ovl_dir_cache
*cache
= od
->cache
;
169 list_del(&od
->cursor
.l_node
);
170 WARN_ON(cache
->refcount
<= 0);
172 if (!cache
->refcount
) {
173 if (ovl_dir_cache(dentry
) == cache
)
174 ovl_set_dir_cache(dentry
, NULL
);
176 ovl_cache_free(&cache
->entries
);
181 static int ovl_fill_merge(void *buf
, const char *name
, int namelen
,
182 loff_t offset
, u64 ino
, unsigned int d_type
)
184 struct ovl_readdir_data
*rdd
= buf
;
188 return ovl_cache_entry_add_rb(rdd
, name
, namelen
, ino
, d_type
);
190 return ovl_fill_lower(rdd
, name
, namelen
, offset
, ino
, d_type
);
193 static inline int ovl_dir_read(struct path
*realpath
,
194 struct ovl_readdir_data
*rdd
)
196 struct file
*realfile
;
199 realfile
= ovl_path_open(realpath
, O_RDONLY
| O_DIRECTORY
);
200 if (IS_ERR(realfile
))
201 return PTR_ERR(realfile
);
207 err
= iterate_dir(realfile
, &rdd
->ctx
);
210 } while (!err
&& rdd
->count
);
216 static void ovl_dir_reset(struct file
*file
)
218 struct ovl_dir_file
*od
= file
->private_data
;
219 struct ovl_dir_cache
*cache
= od
->cache
;
220 struct dentry
*dentry
= file
->f_path
.dentry
;
221 enum ovl_path_type type
= ovl_path_type(dentry
);
223 if (cache
&& ovl_dentry_version_get(dentry
) != cache
->version
) {
224 ovl_cache_put(od
, dentry
);
227 WARN_ON(!od
->is_real
&& type
!= OVL_PATH_MERGE
);
228 if (od
->is_real
&& type
== OVL_PATH_MERGE
)
232 static int ovl_dir_mark_whiteouts(struct dentry
*dir
,
233 struct ovl_readdir_data
*rdd
)
235 struct ovl_cache_entry
*p
;
236 struct dentry
*dentry
;
237 const struct cred
*old_cred
;
238 struct cred
*override_cred
;
240 override_cred
= prepare_creds();
241 if (!override_cred
) {
242 ovl_cache_free(rdd
->list
);
247 * CAP_DAC_OVERRIDE for lookup
249 cap_raise(override_cred
->cap_effective
, CAP_DAC_OVERRIDE
);
250 old_cred
= override_creds(override_cred
);
252 mutex_lock(&dir
->d_inode
->i_mutex
);
253 list_for_each_entry(p
, rdd
->list
, l_node
) {
257 if (p
->type
!= DT_CHR
)
260 dentry
= lookup_one_len(p
->name
, dir
, p
->len
);
264 p
->is_whiteout
= ovl_is_whiteout(dentry
);
267 mutex_unlock(&dir
->d_inode
->i_mutex
);
269 revert_creds(old_cred
);
270 put_cred(override_cred
);
275 static inline int ovl_dir_read_merged(struct path
*upperpath
,
276 struct path
*lowerpath
,
277 struct list_head
*list
)
280 struct rb_root root
= RB_ROOT
;
281 struct list_head middle
;
282 struct ovl_readdir_data rdd
= {
283 .ctx
.actor
= ovl_fill_merge
,
289 if (upperpath
->dentry
) {
290 err
= ovl_dir_read(upperpath
, &rdd
);
294 if (lowerpath
->dentry
) {
295 err
= ovl_dir_mark_whiteouts(upperpath
->dentry
, &rdd
);
300 if (lowerpath
->dentry
) {
302 * Insert lowerpath entries before upperpath ones, this allows
303 * offsets to be reasonably constant
305 list_add(&middle
, rdd
.list
);
306 rdd
.middle
= &middle
;
308 err
= ovl_dir_read(lowerpath
, &rdd
);
316 static void ovl_seek_cursor(struct ovl_dir_file
*od
, loff_t pos
)
318 struct ovl_cache_entry
*p
;
321 list_for_each_entry(p
, &od
->cache
->entries
, l_node
) {
328 list_move_tail(&od
->cursor
.l_node
, &p
->l_node
);
331 static struct ovl_dir_cache
*ovl_cache_get(struct dentry
*dentry
)
334 struct path lowerpath
;
335 struct path upperpath
;
336 struct ovl_dir_cache
*cache
;
338 cache
= ovl_dir_cache(dentry
);
339 if (cache
&& ovl_dentry_version_get(dentry
) == cache
->version
) {
343 ovl_set_dir_cache(dentry
, NULL
);
345 cache
= kzalloc(sizeof(struct ovl_dir_cache
), GFP_KERNEL
);
347 return ERR_PTR(-ENOMEM
);
350 INIT_LIST_HEAD(&cache
->entries
);
352 ovl_path_lower(dentry
, &lowerpath
);
353 ovl_path_upper(dentry
, &upperpath
);
355 res
= ovl_dir_read_merged(&upperpath
, &lowerpath
, &cache
->entries
);
357 ovl_cache_free(&cache
->entries
);
362 cache
->version
= ovl_dentry_version_get(dentry
);
363 ovl_set_dir_cache(dentry
, cache
);
368 static int ovl_iterate(struct file
*file
, struct dir_context
*ctx
)
370 struct ovl_dir_file
*od
= file
->private_data
;
371 struct dentry
*dentry
= file
->f_path
.dentry
;
377 return iterate_dir(od
->realfile
, ctx
);
380 struct ovl_dir_cache
*cache
;
382 cache
= ovl_cache_get(dentry
);
384 return PTR_ERR(cache
);
387 ovl_seek_cursor(od
, ctx
->pos
);
390 while (od
->cursor
.l_node
.next
!= &od
->cache
->entries
) {
391 struct ovl_cache_entry
*p
;
393 p
= list_entry(od
->cursor
.l_node
.next
, struct ovl_cache_entry
, l_node
);
396 if (!p
->is_whiteout
) {
397 if (!dir_emit(ctx
, p
->name
, p
->len
, p
->ino
, p
->type
))
402 list_move(&od
->cursor
.l_node
, &p
->l_node
);
407 static loff_t
ovl_dir_llseek(struct file
*file
, loff_t offset
, int origin
)
410 struct ovl_dir_file
*od
= file
->private_data
;
412 mutex_lock(&file_inode(file
)->i_mutex
);
417 res
= vfs_llseek(od
->realfile
, offset
, origin
);
418 file
->f_pos
= od
->realfile
->f_pos
;
424 offset
+= file
->f_pos
;
434 if (offset
!= file
->f_pos
) {
435 file
->f_pos
= offset
;
437 ovl_seek_cursor(od
, offset
);
442 mutex_unlock(&file_inode(file
)->i_mutex
);
447 static int ovl_dir_fsync(struct file
*file
, loff_t start
, loff_t end
,
450 struct ovl_dir_file
*od
= file
->private_data
;
451 struct dentry
*dentry
= file
->f_path
.dentry
;
452 struct file
*realfile
= od
->realfile
;
455 * Need to check if we started out being a lower dir, but got copied up
457 if (!od
->is_upper
&& ovl_path_type(dentry
) == OVL_PATH_MERGE
) {
458 struct inode
*inode
= file_inode(file
);
460 realfile
= od
->upperfile
;
462 struct path upperpath
;
464 ovl_path_upper(dentry
, &upperpath
);
465 realfile
= ovl_path_open(&upperpath
, O_RDONLY
);
466 mutex_lock(&inode
->i_mutex
);
467 if (!od
->upperfile
) {
468 if (IS_ERR(realfile
)) {
469 mutex_unlock(&inode
->i_mutex
);
470 return PTR_ERR(realfile
);
472 od
->upperfile
= realfile
;
474 /* somebody has beaten us to it */
475 if (!IS_ERR(realfile
))
477 realfile
= od
->upperfile
;
479 mutex_unlock(&inode
->i_mutex
);
483 return vfs_fsync_range(realfile
, start
, end
, datasync
);
486 static int ovl_dir_release(struct inode
*inode
, struct file
*file
)
488 struct ovl_dir_file
*od
= file
->private_data
;
491 mutex_lock(&inode
->i_mutex
);
492 ovl_cache_put(od
, file
->f_path
.dentry
);
493 mutex_unlock(&inode
->i_mutex
);
503 static int ovl_dir_open(struct inode
*inode
, struct file
*file
)
505 struct path realpath
;
506 struct file
*realfile
;
507 struct ovl_dir_file
*od
;
508 enum ovl_path_type type
;
510 od
= kzalloc(sizeof(struct ovl_dir_file
), GFP_KERNEL
);
514 type
= ovl_path_real(file
->f_path
.dentry
, &realpath
);
515 realfile
= ovl_path_open(&realpath
, file
->f_flags
);
516 if (IS_ERR(realfile
)) {
518 return PTR_ERR(realfile
);
520 INIT_LIST_HEAD(&od
->cursor
.l_node
);
521 od
->realfile
= realfile
;
522 od
->is_real
= (type
!= OVL_PATH_MERGE
);
523 od
->is_upper
= (type
!= OVL_PATH_LOWER
);
524 file
->private_data
= od
;
529 const struct file_operations ovl_dir_operations
= {
530 .read
= generic_read_dir
,
531 .open
= ovl_dir_open
,
532 .iterate
= ovl_iterate
,
533 .llseek
= ovl_dir_llseek
,
534 .fsync
= ovl_dir_fsync
,
535 .release
= ovl_dir_release
,
538 int ovl_check_empty_dir(struct dentry
*dentry
, struct list_head
*list
)
541 struct path lowerpath
;
542 struct path upperpath
;
543 struct ovl_cache_entry
*p
;
545 ovl_path_upper(dentry
, &upperpath
);
546 ovl_path_lower(dentry
, &lowerpath
);
548 err
= ovl_dir_read_merged(&upperpath
, &lowerpath
, list
);
554 list_for_each_entry(p
, list
, l_node
) {
558 if (p
->name
[0] == '.') {
561 if (p
->len
== 2 && p
->name
[1] == '.')
571 void ovl_cleanup_whiteouts(struct dentry
*upper
, struct list_head
*list
)
573 struct ovl_cache_entry
*p
;
575 mutex_lock_nested(&upper
->d_inode
->i_mutex
, I_MUTEX_PARENT
);
576 list_for_each_entry(p
, list
, l_node
) {
577 struct dentry
*dentry
;
582 dentry
= lookup_one_len(p
->name
, upper
, p
->len
);
583 if (IS_ERR(dentry
)) {
584 pr_err("overlayfs: lookup '%s/%.*s' failed (%i)\n",
585 upper
->d_name
.name
, p
->len
, p
->name
,
586 (int) PTR_ERR(dentry
));
589 ovl_cleanup(upper
->d_inode
, dentry
);
592 mutex_unlock(&upper
->d_inode
->i_mutex
);