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 <linux/ratelimit.h>
19 #include "overlayfs.h"
21 struct ovl_cache_entry
{
26 struct list_head l_node
;
28 struct ovl_cache_entry
*next_maybe_whiteout
;
34 struct ovl_dir_cache
{
37 struct list_head entries
;
41 struct ovl_readdir_data
{
42 struct dir_context ctx
;
43 struct dentry
*dentry
;
46 struct list_head
*list
;
47 struct list_head middle
;
48 struct ovl_cache_entry
*first_maybe_whiteout
;
52 bool d_type_supported
;
58 struct ovl_dir_cache
*cache
;
59 struct list_head
*cursor
;
60 struct file
*realfile
;
61 struct file
*upperfile
;
64 static struct ovl_cache_entry
*ovl_cache_entry_from_node(struct rb_node
*n
)
66 return rb_entry(n
, struct ovl_cache_entry
, node
);
69 static bool ovl_cache_entry_find_link(const char *name
, int len
,
70 struct rb_node
***link
,
71 struct rb_node
**parent
)
74 struct rb_node
**newp
= *link
;
76 while (!found
&& *newp
) {
78 struct ovl_cache_entry
*tmp
;
81 tmp
= ovl_cache_entry_from_node(*newp
);
82 cmp
= strncmp(name
, tmp
->name
, len
);
84 newp
= &tmp
->node
.rb_right
;
85 else if (cmp
< 0 || len
< tmp
->len
)
86 newp
= &tmp
->node
.rb_left
;
95 static struct ovl_cache_entry
*ovl_cache_entry_find(struct rb_root
*root
,
96 const char *name
, int len
)
98 struct rb_node
*node
= root
->rb_node
;
102 struct ovl_cache_entry
*p
= ovl_cache_entry_from_node(node
);
104 cmp
= strncmp(name
, p
->name
, len
);
106 node
= p
->node
.rb_right
;
107 else if (cmp
< 0 || len
< p
->len
)
108 node
= p
->node
.rb_left
;
116 static bool ovl_calc_d_ino(struct ovl_readdir_data
*rdd
,
117 struct ovl_cache_entry
*p
)
119 /* Don't care if not doing ovl_iter() */
123 /* Always recalc d_ino when remapping lower inode numbers */
124 if (ovl_xino_bits(rdd
->dentry
->d_sb
))
127 /* Always recalc d_ino for parent */
128 if (strcmp(p
->name
, "..") == 0)
131 /* If this is lower, then native d_ino will do */
136 * Recalc d_ino for '.' and for all entries if dir is impure (contains
139 if ((p
->name
[0] == '.' && p
->len
== 1) ||
140 ovl_test_flag(OVL_IMPURE
, d_inode(rdd
->dentry
)))
146 static struct ovl_cache_entry
*ovl_cache_entry_new(struct ovl_readdir_data
*rdd
,
147 const char *name
, int len
,
148 u64 ino
, unsigned int d_type
)
150 struct ovl_cache_entry
*p
;
151 size_t size
= offsetof(struct ovl_cache_entry
, name
[len
+ 1]);
153 p
= kmalloc(size
, GFP_KERNEL
);
157 memcpy(p
->name
, name
, len
);
163 /* Defer setting d_ino for upper entry to ovl_iterate() */
164 if (ovl_calc_d_ino(rdd
, p
))
166 p
->is_upper
= rdd
->is_upper
;
167 p
->is_whiteout
= false;
169 if (d_type
== DT_CHR
) {
170 p
->next_maybe_whiteout
= rdd
->first_maybe_whiteout
;
171 rdd
->first_maybe_whiteout
= p
;
176 static int ovl_cache_entry_add_rb(struct ovl_readdir_data
*rdd
,
177 const char *name
, int len
, u64 ino
,
180 struct rb_node
**newp
= &rdd
->root
->rb_node
;
181 struct rb_node
*parent
= NULL
;
182 struct ovl_cache_entry
*p
;
184 if (ovl_cache_entry_find_link(name
, len
, &newp
, &parent
))
187 p
= ovl_cache_entry_new(rdd
, name
, len
, ino
, d_type
);
193 list_add_tail(&p
->l_node
, rdd
->list
);
194 rb_link_node(&p
->node
, parent
, newp
);
195 rb_insert_color(&p
->node
, rdd
->root
);
200 static int ovl_fill_lowest(struct ovl_readdir_data
*rdd
,
201 const char *name
, int namelen
,
202 loff_t offset
, u64 ino
, unsigned int d_type
)
204 struct ovl_cache_entry
*p
;
206 p
= ovl_cache_entry_find(rdd
->root
, name
, namelen
);
208 list_move_tail(&p
->l_node
, &rdd
->middle
);
210 p
= ovl_cache_entry_new(rdd
, name
, namelen
, ino
, d_type
);
214 list_add_tail(&p
->l_node
, &rdd
->middle
);
220 void ovl_cache_free(struct list_head
*list
)
222 struct ovl_cache_entry
*p
;
223 struct ovl_cache_entry
*n
;
225 list_for_each_entry_safe(p
, n
, list
, l_node
)
228 INIT_LIST_HEAD(list
);
231 void ovl_dir_cache_free(struct inode
*inode
)
233 struct ovl_dir_cache
*cache
= ovl_dir_cache(inode
);
236 ovl_cache_free(&cache
->entries
);
241 static void ovl_cache_put(struct ovl_dir_file
*od
, struct dentry
*dentry
)
243 struct ovl_dir_cache
*cache
= od
->cache
;
245 WARN_ON(cache
->refcount
<= 0);
247 if (!cache
->refcount
) {
248 if (ovl_dir_cache(d_inode(dentry
)) == cache
)
249 ovl_set_dir_cache(d_inode(dentry
), NULL
);
251 ovl_cache_free(&cache
->entries
);
256 static int ovl_fill_merge(struct dir_context
*ctx
, const char *name
,
257 int namelen
, loff_t offset
, u64 ino
,
260 struct ovl_readdir_data
*rdd
=
261 container_of(ctx
, struct ovl_readdir_data
, ctx
);
265 return ovl_cache_entry_add_rb(rdd
, name
, namelen
, ino
, d_type
);
267 return ovl_fill_lowest(rdd
, name
, namelen
, offset
, ino
, d_type
);
270 static int ovl_check_whiteouts(struct dentry
*dir
, struct ovl_readdir_data
*rdd
)
273 struct ovl_cache_entry
*p
;
274 struct dentry
*dentry
;
275 const struct cred
*old_cred
;
277 old_cred
= ovl_override_creds(rdd
->dentry
->d_sb
);
279 err
= down_write_killable(&dir
->d_inode
->i_rwsem
);
281 while (rdd
->first_maybe_whiteout
) {
282 p
= rdd
->first_maybe_whiteout
;
283 rdd
->first_maybe_whiteout
= p
->next_maybe_whiteout
;
284 dentry
= lookup_one_len(p
->name
, dir
, p
->len
);
285 if (!IS_ERR(dentry
)) {
286 p
->is_whiteout
= ovl_is_whiteout(dentry
);
290 inode_unlock(dir
->d_inode
);
292 revert_creds(old_cred
);
297 static inline int ovl_dir_read(struct path
*realpath
,
298 struct ovl_readdir_data
*rdd
)
300 struct file
*realfile
;
303 realfile
= ovl_path_open(realpath
, O_RDONLY
| O_DIRECTORY
);
304 if (IS_ERR(realfile
))
305 return PTR_ERR(realfile
);
307 rdd
->first_maybe_whiteout
= NULL
;
312 err
= iterate_dir(realfile
, &rdd
->ctx
);
315 } while (!err
&& rdd
->count
);
317 if (!err
&& rdd
->first_maybe_whiteout
&& rdd
->dentry
)
318 err
= ovl_check_whiteouts(realpath
->dentry
, rdd
);
326 * Can we iterate real dir directly?
328 * Non-merge dir may contain whiteouts from a time it was a merge upper, before
329 * lower dir was removed under it and possibly before it was rotated from upper
332 static bool ovl_dir_is_real(struct dentry
*dir
)
334 return !ovl_test_flag(OVL_WHITEOUTS
, d_inode(dir
));
337 static void ovl_dir_reset(struct file
*file
)
339 struct ovl_dir_file
*od
= file
->private_data
;
340 struct ovl_dir_cache
*cache
= od
->cache
;
341 struct dentry
*dentry
= file
->f_path
.dentry
;
344 if (cache
&& ovl_dentry_version_get(dentry
) != cache
->version
) {
345 ovl_cache_put(od
, dentry
);
349 is_real
= ovl_dir_is_real(dentry
);
350 if (od
->is_real
!= is_real
) {
351 /* is_real can only become false when dir is copied up */
352 if (WARN_ON(is_real
))
358 static int ovl_dir_read_merged(struct dentry
*dentry
, struct list_head
*list
,
359 struct rb_root
*root
)
362 struct path realpath
;
363 struct ovl_readdir_data rdd
= {
364 .ctx
.actor
= ovl_fill_merge
,
372 for (idx
= 0; idx
!= -1; idx
= next
) {
373 next
= ovl_path_next(idx
, dentry
, &realpath
);
374 rdd
.is_upper
= ovl_dentry_upper(dentry
) == realpath
.dentry
;
377 err
= ovl_dir_read(&realpath
, &rdd
);
382 * Insert lowest layer entries before upper ones, this
383 * allows offsets to be reasonably constant
385 list_add(&rdd
.middle
, rdd
.list
);
386 rdd
.is_lowest
= true;
387 err
= ovl_dir_read(&realpath
, &rdd
);
388 list_del(&rdd
.middle
);
394 static void ovl_seek_cursor(struct ovl_dir_file
*od
, loff_t pos
)
399 list_for_each(p
, &od
->cache
->entries
) {
404 /* Cursor is safe since the cache is stable */
408 static struct ovl_dir_cache
*ovl_cache_get(struct dentry
*dentry
)
411 struct ovl_dir_cache
*cache
;
413 cache
= ovl_dir_cache(d_inode(dentry
));
414 if (cache
&& ovl_dentry_version_get(dentry
) == cache
->version
) {
415 WARN_ON(!cache
->refcount
);
419 ovl_set_dir_cache(d_inode(dentry
), NULL
);
421 cache
= kzalloc(sizeof(struct ovl_dir_cache
), GFP_KERNEL
);
423 return ERR_PTR(-ENOMEM
);
426 INIT_LIST_HEAD(&cache
->entries
);
427 cache
->root
= RB_ROOT
;
429 res
= ovl_dir_read_merged(dentry
, &cache
->entries
, &cache
->root
);
431 ovl_cache_free(&cache
->entries
);
436 cache
->version
= ovl_dentry_version_get(dentry
);
437 ovl_set_dir_cache(d_inode(dentry
), cache
);
442 /* Map inode number to lower fs unique range */
443 static u64
ovl_remap_lower_ino(u64 ino
, int xinobits
, int fsid
,
444 const char *name
, int namelen
)
446 if (ino
>> (64 - xinobits
)) {
447 pr_warn_ratelimited("overlayfs: d_ino too big (%.*s, ino=%llu, xinobits=%d)\n",
448 namelen
, name
, ino
, xinobits
);
452 return ino
| ((u64
)fsid
) << (64 - xinobits
);
456 * Set d_ino for upper entries. Non-upper entries should always report
457 * the uppermost real inode ino and should not call this function.
459 * When not all layer are on same fs, report real ino also for upper.
461 * When all layers are on the same fs, and upper has a reference to
462 * copy up origin, call vfs_getattr() on the overlay entry to make
463 * sure that d_ino will be consistent with st_ino from stat(2).
465 static int ovl_cache_update_ino(struct path
*path
, struct ovl_cache_entry
*p
)
468 struct dentry
*dir
= path
->dentry
;
469 struct dentry
*this = NULL
;
470 enum ovl_path_type type
;
471 u64 ino
= p
->real_ino
;
472 int xinobits
= ovl_xino_bits(dir
->d_sb
);
475 if (!ovl_same_sb(dir
->d_sb
) && !xinobits
)
478 if (p
->name
[0] == '.') {
483 if (p
->len
== 2 && p
->name
[1] == '.') {
484 /* we shall not be moved */
485 this = dget(dir
->d_parent
);
489 this = lookup_one_len(p
->name
, dir
, p
->len
);
490 if (IS_ERR_OR_NULL(this) || !this->d_inode
) {
500 type
= ovl_path_type(this);
501 if (OVL_TYPE_ORIGIN(type
)) {
503 struct path statpath
= *path
;
505 statpath
.dentry
= this;
506 err
= vfs_getattr(&statpath
, &stat
, STATX_INO
, 0);
510 WARN_ON_ONCE(dir
->d_sb
->s_dev
!= stat
.dev
);
512 } else if (xinobits
&& !OVL_TYPE_UPPER(type
)) {
513 ino
= ovl_remap_lower_ino(ino
, xinobits
,
514 ovl_layer_lower(this)->fsid
,
524 pr_warn_ratelimited("overlayfs: failed to look up (%s) for ino (%i)\n",
529 static int ovl_fill_plain(struct dir_context
*ctx
, const char *name
,
530 int namelen
, loff_t offset
, u64 ino
,
533 struct ovl_cache_entry
*p
;
534 struct ovl_readdir_data
*rdd
=
535 container_of(ctx
, struct ovl_readdir_data
, ctx
);
538 p
= ovl_cache_entry_new(rdd
, name
, namelen
, ino
, d_type
);
543 list_add_tail(&p
->l_node
, rdd
->list
);
548 static int ovl_dir_read_impure(struct path
*path
, struct list_head
*list
,
549 struct rb_root
*root
)
552 struct path realpath
;
553 struct ovl_cache_entry
*p
, *n
;
554 struct ovl_readdir_data rdd
= {
555 .ctx
.actor
= ovl_fill_plain
,
560 INIT_LIST_HEAD(list
);
562 ovl_path_upper(path
->dentry
, &realpath
);
564 err
= ovl_dir_read(&realpath
, &rdd
);
568 list_for_each_entry_safe(p
, n
, list
, l_node
) {
569 if (strcmp(p
->name
, ".") != 0 &&
570 strcmp(p
->name
, "..") != 0) {
571 err
= ovl_cache_update_ino(path
, p
);
575 if (p
->ino
== p
->real_ino
) {
576 list_del(&p
->l_node
);
579 struct rb_node
**newp
= &root
->rb_node
;
580 struct rb_node
*parent
= NULL
;
582 if (WARN_ON(ovl_cache_entry_find_link(p
->name
, p
->len
,
586 rb_link_node(&p
->node
, parent
, newp
);
587 rb_insert_color(&p
->node
, root
);
593 static struct ovl_dir_cache
*ovl_cache_get_impure(struct path
*path
)
596 struct dentry
*dentry
= path
->dentry
;
597 struct ovl_dir_cache
*cache
;
599 cache
= ovl_dir_cache(d_inode(dentry
));
600 if (cache
&& ovl_dentry_version_get(dentry
) == cache
->version
)
603 /* Impure cache is not refcounted, free it here */
604 ovl_dir_cache_free(d_inode(dentry
));
605 ovl_set_dir_cache(d_inode(dentry
), NULL
);
607 cache
= kzalloc(sizeof(struct ovl_dir_cache
), GFP_KERNEL
);
609 return ERR_PTR(-ENOMEM
);
611 res
= ovl_dir_read_impure(path
, &cache
->entries
, &cache
->root
);
613 ovl_cache_free(&cache
->entries
);
617 if (list_empty(&cache
->entries
)) {
619 * A good opportunity to get rid of an unneeded "impure" flag.
620 * Removing the "impure" xattr is best effort.
622 if (!ovl_want_write(dentry
)) {
623 ovl_do_removexattr(ovl_dentry_upper(dentry
),
625 ovl_drop_write(dentry
);
627 ovl_clear_flag(OVL_IMPURE
, d_inode(dentry
));
632 cache
->version
= ovl_dentry_version_get(dentry
);
633 ovl_set_dir_cache(d_inode(dentry
), cache
);
638 struct ovl_readdir_translate
{
639 struct dir_context
*orig_ctx
;
640 struct ovl_dir_cache
*cache
;
641 struct dir_context ctx
;
647 static int ovl_fill_real(struct dir_context
*ctx
, const char *name
,
648 int namelen
, loff_t offset
, u64 ino
,
651 struct ovl_readdir_translate
*rdt
=
652 container_of(ctx
, struct ovl_readdir_translate
, ctx
);
653 struct dir_context
*orig_ctx
= rdt
->orig_ctx
;
655 if (rdt
->parent_ino
&& strcmp(name
, "..") == 0) {
656 ino
= rdt
->parent_ino
;
657 } else if (rdt
->cache
) {
658 struct ovl_cache_entry
*p
;
660 p
= ovl_cache_entry_find(&rdt
->cache
->root
, name
, namelen
);
663 } else if (rdt
->xinobits
) {
664 ino
= ovl_remap_lower_ino(ino
, rdt
->xinobits
, rdt
->fsid
,
668 return orig_ctx
->actor(orig_ctx
, name
, namelen
, offset
, ino
, d_type
);
671 static int ovl_iterate_real(struct file
*file
, struct dir_context
*ctx
)
674 struct ovl_dir_file
*od
= file
->private_data
;
675 struct dentry
*dir
= file
->f_path
.dentry
;
676 struct ovl_layer
*lower_layer
= ovl_layer_lower(dir
);
677 struct ovl_readdir_translate rdt
= {
678 .ctx
.actor
= ovl_fill_real
,
680 .xinobits
= ovl_xino_bits(dir
->d_sb
),
683 if (rdt
.xinobits
&& lower_layer
)
684 rdt
.fsid
= lower_layer
->fsid
;
686 if (OVL_TYPE_MERGE(ovl_path_type(dir
->d_parent
))) {
688 struct path statpath
= file
->f_path
;
690 statpath
.dentry
= dir
->d_parent
;
691 err
= vfs_getattr(&statpath
, &stat
, STATX_INO
, 0);
695 WARN_ON_ONCE(dir
->d_sb
->s_dev
!= stat
.dev
);
696 rdt
.parent_ino
= stat
.ino
;
699 if (ovl_test_flag(OVL_IMPURE
, d_inode(dir
))) {
700 rdt
.cache
= ovl_cache_get_impure(&file
->f_path
);
701 if (IS_ERR(rdt
.cache
))
702 return PTR_ERR(rdt
.cache
);
705 err
= iterate_dir(od
->realfile
, &rdt
.ctx
);
706 ctx
->pos
= rdt
.ctx
.pos
;
712 static int ovl_iterate(struct file
*file
, struct dir_context
*ctx
)
714 struct ovl_dir_file
*od
= file
->private_data
;
715 struct dentry
*dentry
= file
->f_path
.dentry
;
716 struct ovl_cache_entry
*p
;
724 * If parent is merge, then need to adjust d_ino for '..', if
725 * dir is impure then need to adjust d_ino for copied up
728 if (ovl_xino_bits(dentry
->d_sb
) ||
729 (ovl_same_sb(dentry
->d_sb
) &&
730 (ovl_test_flag(OVL_IMPURE
, d_inode(dentry
)) ||
731 OVL_TYPE_MERGE(ovl_path_type(dentry
->d_parent
))))) {
732 return ovl_iterate_real(file
, ctx
);
734 return iterate_dir(od
->realfile
, ctx
);
738 struct ovl_dir_cache
*cache
;
740 cache
= ovl_cache_get(dentry
);
742 return PTR_ERR(cache
);
745 ovl_seek_cursor(od
, ctx
->pos
);
748 while (od
->cursor
!= &od
->cache
->entries
) {
749 p
= list_entry(od
->cursor
, struct ovl_cache_entry
, l_node
);
750 if (!p
->is_whiteout
) {
752 err
= ovl_cache_update_ino(&file
->f_path
, p
);
756 if (!dir_emit(ctx
, p
->name
, p
->len
, p
->ino
, p
->type
))
759 od
->cursor
= p
->l_node
.next
;
765 static loff_t
ovl_dir_llseek(struct file
*file
, loff_t offset
, int origin
)
768 struct ovl_dir_file
*od
= file
->private_data
;
770 inode_lock(file_inode(file
));
775 res
= vfs_llseek(od
->realfile
, offset
, origin
);
776 file
->f_pos
= od
->realfile
->f_pos
;
782 offset
+= file
->f_pos
;
792 if (offset
!= file
->f_pos
) {
793 file
->f_pos
= offset
;
795 ovl_seek_cursor(od
, offset
);
800 inode_unlock(file_inode(file
));
805 static int ovl_dir_fsync(struct file
*file
, loff_t start
, loff_t end
,
808 struct ovl_dir_file
*od
= file
->private_data
;
809 struct dentry
*dentry
= file
->f_path
.dentry
;
810 struct file
*realfile
= od
->realfile
;
812 /* Nothing to sync for lower */
813 if (!OVL_TYPE_UPPER(ovl_path_type(dentry
)))
817 * Need to check if we started out being a lower dir, but got copied up
820 struct inode
*inode
= file_inode(file
);
822 realfile
= READ_ONCE(od
->upperfile
);
824 struct path upperpath
;
826 ovl_path_upper(dentry
, &upperpath
);
827 realfile
= ovl_path_open(&upperpath
, O_RDONLY
);
830 if (!od
->upperfile
) {
831 if (IS_ERR(realfile
)) {
833 return PTR_ERR(realfile
);
835 smp_store_release(&od
->upperfile
, realfile
);
837 /* somebody has beaten us to it */
838 if (!IS_ERR(realfile
))
840 realfile
= od
->upperfile
;
846 return vfs_fsync_range(realfile
, start
, end
, datasync
);
849 static int ovl_dir_release(struct inode
*inode
, struct file
*file
)
851 struct ovl_dir_file
*od
= file
->private_data
;
855 ovl_cache_put(od
, file
->f_path
.dentry
);
866 static int ovl_dir_open(struct inode
*inode
, struct file
*file
)
868 struct path realpath
;
869 struct file
*realfile
;
870 struct ovl_dir_file
*od
;
871 enum ovl_path_type type
;
873 od
= kzalloc(sizeof(struct ovl_dir_file
), GFP_KERNEL
);
877 type
= ovl_path_real(file
->f_path
.dentry
, &realpath
);
878 realfile
= ovl_path_open(&realpath
, file
->f_flags
);
879 if (IS_ERR(realfile
)) {
881 return PTR_ERR(realfile
);
883 od
->realfile
= realfile
;
884 od
->is_real
= ovl_dir_is_real(file
->f_path
.dentry
);
885 od
->is_upper
= OVL_TYPE_UPPER(type
);
886 file
->private_data
= od
;
891 const struct file_operations ovl_dir_operations
= {
892 .read
= generic_read_dir
,
893 .open
= ovl_dir_open
,
894 .iterate
= ovl_iterate
,
895 .llseek
= ovl_dir_llseek
,
896 .fsync
= ovl_dir_fsync
,
897 .release
= ovl_dir_release
,
900 int ovl_check_empty_dir(struct dentry
*dentry
, struct list_head
*list
)
903 struct ovl_cache_entry
*p
, *n
;
904 struct rb_root root
= RB_ROOT
;
905 const struct cred
*old_cred
;
907 old_cred
= ovl_override_creds(dentry
->d_sb
);
908 err
= ovl_dir_read_merged(dentry
, list
, &root
);
909 revert_creds(old_cred
);
915 list_for_each_entry_safe(p
, n
, list
, l_node
) {
917 * Select whiteouts in upperdir, they should
918 * be cleared when deleting this directory.
920 if (p
->is_whiteout
) {
926 if (p
->name
[0] == '.') {
929 if (p
->len
== 2 && p
->name
[1] == '.')
936 list_del(&p
->l_node
);
943 void ovl_cleanup_whiteouts(struct dentry
*upper
, struct list_head
*list
)
945 struct ovl_cache_entry
*p
;
947 inode_lock_nested(upper
->d_inode
, I_MUTEX_CHILD
);
948 list_for_each_entry(p
, list
, l_node
) {
949 struct dentry
*dentry
;
951 if (WARN_ON(!p
->is_whiteout
|| !p
->is_upper
))
954 dentry
= lookup_one_len(p
->name
, upper
, p
->len
);
955 if (IS_ERR(dentry
)) {
956 pr_err("overlayfs: lookup '%s/%.*s' failed (%i)\n",
957 upper
->d_name
.name
, p
->len
, p
->name
,
958 (int) PTR_ERR(dentry
));
962 ovl_cleanup(upper
->d_inode
, dentry
);
965 inode_unlock(upper
->d_inode
);
968 static int ovl_check_d_type(struct dir_context
*ctx
, const char *name
,
969 int namelen
, loff_t offset
, u64 ino
,
972 struct ovl_readdir_data
*rdd
=
973 container_of(ctx
, struct ovl_readdir_data
, ctx
);
975 /* Even if d_type is not supported, DT_DIR is returned for . and .. */
976 if (!strncmp(name
, ".", namelen
) || !strncmp(name
, "..", namelen
))
979 if (d_type
!= DT_UNKNOWN
)
980 rdd
->d_type_supported
= true;
986 * Returns 1 if d_type is supported, 0 not supported/unknown. Negative values
987 * if error is encountered.
989 int ovl_check_d_type_supported(struct path
*realpath
)
992 struct ovl_readdir_data rdd
= {
993 .ctx
.actor
= ovl_check_d_type
,
994 .d_type_supported
= false,
997 err
= ovl_dir_read(realpath
, &rdd
);
1001 return rdd
.d_type_supported
;
1004 static void ovl_workdir_cleanup_recurse(struct path
*path
, int level
)
1007 struct inode
*dir
= path
->dentry
->d_inode
;
1009 struct rb_root root
= RB_ROOT
;
1010 struct ovl_cache_entry
*p
;
1011 struct ovl_readdir_data rdd
= {
1012 .ctx
.actor
= ovl_fill_merge
,
1019 err
= ovl_dir_read(path
, &rdd
);
1023 inode_lock_nested(dir
, I_MUTEX_PARENT
);
1024 list_for_each_entry(p
, &list
, l_node
) {
1025 struct dentry
*dentry
;
1027 if (p
->name
[0] == '.') {
1030 if (p
->len
== 2 && p
->name
[1] == '.')
1033 dentry
= lookup_one_len(p
->name
, path
->dentry
, p
->len
);
1036 if (dentry
->d_inode
)
1037 ovl_workdir_cleanup(dir
, path
->mnt
, dentry
, level
);
1042 ovl_cache_free(&list
);
1045 void ovl_workdir_cleanup(struct inode
*dir
, struct vfsmount
*mnt
,
1046 struct dentry
*dentry
, int level
)
1050 if (!d_is_dir(dentry
) || level
> 1) {
1051 ovl_cleanup(dir
, dentry
);
1055 err
= ovl_do_rmdir(dir
, dentry
);
1057 struct path path
= { .mnt
= mnt
, .dentry
= dentry
};
1060 ovl_workdir_cleanup_recurse(&path
, level
+ 1);
1061 inode_lock_nested(dir
, I_MUTEX_PARENT
);
1062 ovl_cleanup(dir
, dentry
);
1066 int ovl_indexdir_cleanup(struct ovl_fs
*ofs
)
1069 struct dentry
*indexdir
= ofs
->indexdir
;
1070 struct dentry
*index
= NULL
;
1071 struct inode
*dir
= indexdir
->d_inode
;
1072 struct path path
= { .mnt
= ofs
->upper_mnt
, .dentry
= indexdir
};
1074 struct rb_root root
= RB_ROOT
;
1075 struct ovl_cache_entry
*p
;
1076 struct ovl_readdir_data rdd
= {
1077 .ctx
.actor
= ovl_fill_merge
,
1084 err
= ovl_dir_read(&path
, &rdd
);
1088 inode_lock_nested(dir
, I_MUTEX_PARENT
);
1089 list_for_each_entry(p
, &list
, l_node
) {
1090 if (p
->name
[0] == '.') {
1093 if (p
->len
== 2 && p
->name
[1] == '.')
1096 index
= lookup_one_len(p
->name
, indexdir
, p
->len
);
1097 if (IS_ERR(index
)) {
1098 err
= PTR_ERR(index
);
1102 err
= ovl_verify_index(ofs
, index
);
1105 } else if (err
== -ESTALE
) {
1106 /* Cleanup stale index entries */
1107 err
= ovl_cleanup(dir
, index
);
1108 } else if (err
!= -ENOENT
) {
1110 * Abort mount to avoid corrupting the index if
1111 * an incompatible index entry was found or on out
1115 } else if (ofs
->config
.nfs_export
) {
1117 * Whiteout orphan index to block future open by
1118 * handle after overlay nlink dropped to zero.
1120 err
= ovl_cleanup_and_whiteout(indexdir
, dir
, index
);
1122 /* Cleanup orphan index entries */
1123 err
= ovl_cleanup(dir
, index
);
1136 ovl_cache_free(&list
);
1138 pr_err("overlayfs: failed index dir cleanup (%i)\n", err
);