| /fs/btrfs/ |
| D | backref.h | 353 struct list_head lower; member
456 struct btrfs_backref_node *lower, in btrfs_backref_link_edge() argument
460 ASSERT(upper && lower && upper->level == lower->level + 1); in btrfs_backref_link_edge()
461 edge->node[LOWER] = lower; in btrfs_backref_link_edge()
464 list_add_tail(&edge->list[LOWER], &lower->upper); in btrfs_backref_link_edge()
466 list_add_tail(&edge->list[UPPER], &upper->lower); in btrfs_backref_link_edge()
474 ASSERT(list_empty(&node->lower)); in btrfs_backref_free_node()
524 list_del_init(&node->lower); in btrfs_backref_drop_node()
|
| D | backref.c | 3023 INIT_LIST_HEAD(&node->lower); in btrfs_backref_alloc_node()
3072 if (list_empty(&upper->lower)) { in btrfs_backref_cleanup_node()
3073 list_add_tail(&upper->lower, &cache->leaves); in btrfs_backref_cleanup_node()
3097 struct btrfs_backref_node, lower); in btrfs_backref_release_cache()
3208 struct btrfs_backref_node *lower; in handle_indirect_tree_backref() local
3270 lower = cur; in handle_indirect_tree_backref()
3276 lower->bytenr); in handle_indirect_tree_backref()
3281 list_add(&lower->list, &cache->useless_node); in handle_indirect_tree_backref()
3283 lower->root = root; in handle_indirect_tree_backref()
3299 lower->level + 1); in handle_indirect_tree_backref()
[all …]
|
| D | ctree.c | 2981 struct extent_buffer *lower; in insert_new_root() local
2990 lower = path->nodes[level-1]; in insert_new_root()
2992 btrfs_item_key(lower, &lower_key, 0); in insert_new_root()
2994 btrfs_node_key(lower, &lower_key, 0); in insert_new_root()
3006 btrfs_set_node_blockptr(c, 0, lower->start); in insert_new_root()
3007 lower_gen = btrfs_header_generation(lower); in insert_new_root()
3047 struct extent_buffer *lower; in insert_ptr() local
3053 lower = path->nodes[level]; in insert_ptr()
3054 nritems = btrfs_header_nritems(lower); in insert_ptr()
3059 ret = btrfs_tree_mod_log_insert_move(lower, slot + 1, in insert_ptr()
[all …]
|
| D | relocation.c | 218 struct btrfs_backref_node *lower; in walk_down_backref() local
223 lower = edge->node[LOWER]; in walk_down_backref()
224 if (list_is_last(&edge->list[LOWER], &lower->upper)) { in walk_down_backref()
415 list_del_init(&cur->lower); in handle_useless_nodes()
420 while (!list_empty(&cur->lower)) { in handle_useless_nodes()
422 struct btrfs_backref_node *lower; in handle_useless_nodes() local
424 edge = list_entry(cur->lower.next, in handle_useless_nodes()
428 lower = edge->node[LOWER]; in handle_useless_nodes()
432 if (list_empty(&lower->upper)) in handle_useless_nodes()
433 list_add(&lower->list, useless_node); in handle_useless_nodes()
[all …]
|
| /fs/overlayfs/ |
| D | params.c | 338 l = krealloc_array(ctx->lower, nr, sizeof(*l), GFP_KERNEL_ACCOUNT); in ovl_ctx_realloc_lower()
342 ctx->lower = l; in ovl_ctx_realloc_lower()
369 l = &ctx->lower[ctx->nr++]; in ovl_add_layer()
419 struct ovl_fs_context_layer *l = ctx->lower; in ovl_reset_lowerdirs()
488 l = krealloc_array(ctx->lower, nr_lower, sizeof(*ctx->lower), in ovl_parse_param_lowerdir()
493 ctx->lower = l; in ovl_parse_param_lowerdir()
498 l = ctx->lower; in ovl_parse_param_lowerdir()
659 kfree(ctx->lower); in ovl_fs_context_free()
731 ctx->lower = kmalloc_array(3, sizeof(*ctx->lower), GFP_KERNEL_ACCOUNT); in ovl_init_fs_context()
732 if (!ctx->lower) in ovl_init_fs_context()
|
| D | Kconfig | 7 and a 'lower' filesystem. When a name exists in both filesystems, the
9 'lower' filesystem is either hidden or, in the case of directories,
50 the index directory to map lower inodes to upper inodes by default.
55 The inodes index feature prevents breaking of lower hardlinks on copy
79 the same lower dir. The full index may incur some overhead on mount
|
| D | export.c | 299 struct dentry *lower = lowerpath ? lowerpath->dentry : NULL; in ovl_obtain_alias() local
309 if (d_is_dir(upper ?: lower)) in ovl_obtain_alias()
312 oe = ovl_alloc_entry(!!lower); in ovl_obtain_alias()
317 if (lower) { in ovl_obtain_alias()
318 ovl_lowerstack(oe)->dentry = dget(lower); in ovl_obtain_alias()
|
| D | namei.c | 874 struct dentry *lower, struct dentry *upper) in ovl_fix_origin() argument
885 err = ovl_set_origin(ofs, lower, upper); in ovl_fix_origin()
1087 struct ovl_path lower = ovl_lowerstack(poe)[i]; in ovl_lookup() local
1092 d.last = lower.layer->idx == ovl_numlower(roe); in ovl_lookup()
1094 d.mnt = lower.layer->mnt; in ovl_lookup()
1095 err = ovl_lookup_layer(lower.dentry, &d, &this, false); in ovl_lookup()
1157 stack[ctr].layer = lower.layer; in ovl_lookup()
1184 i = lower.layer->idx - 1; in ovl_lookup()
|
| D | super.c | 35 struct dentry *real = NULL, *lower; in ovl_d_real() local
66 lower = ovl_dentry_lowerdata(dentry); in ovl_d_real()
67 if (!lower) in ovl_d_real()
69 real = lower; in ovl_d_real()
1074 struct ovl_fs_context_layer *l = &ctx->lower[i]; in ovl_get_layers()
1186 l = &ctx->lower[i]; in ovl_get_lowerstack()
1213 l = &ctx->lower[i]; in ovl_get_lowerstack()
|
| D | params.h | 34 struct ovl_fs_context_layer *lower; member
|
| D | inode.c | 1292 struct dentry *lower, bool index) in ovl_hash_bylower() argument
1297 if (!lower) in ovl_hash_bylower()
1310 !d_is_dir(lower) && d_inode(lower)->i_nlink > 1) in ovl_hash_bylower()
|
| D | util.c | 958 struct dentry *lower = ovl_dentry_lower(dentry); in ovl_need_index() local
960 if (!lower || !ovl_indexdir(dentry->d_sb)) in ovl_need_index()
968 if (!d_is_dir(lower) && d_inode(lower)->i_nlink > 1) in ovl_need_index()
|
| D | copy_up.c | 429 int ovl_set_origin(struct ovl_fs *ofs, struct dentry *lower, in ovl_set_origin() argument
440 if (ovl_can_decode_fh(lower->d_sb)) { in ovl_set_origin()
441 fh = ovl_encode_real_fh(ofs, lower, false); in ovl_set_origin()
|
| D | overlayfs.h | 827 int ovl_set_origin(struct ovl_fs *ofs, struct dentry *lower,
|
| /fs/fat/ |
| D | namei_vfat.c | 267 unsigned char lower:1, member
272 (x)->lower = 1; \
302 info->lower = 0; in to_shortname_char()
309 info->lower = 0; in to_shortname_char()
314 info->lower = 0; in to_shortname_char()
454 if ((base_info.upper || base_info.lower) && in vfat_create_shortname()
455 (ext_info.upper || ext_info.lower)) { in vfat_create_shortname()
456 if (!base_info.upper && base_info.lower) in vfat_create_shortname()
458 if (!ext_info.upper && ext_info.lower) in vfat_create_shortname()
|
| D | dir.c | 235 wchar_t *uni_buf, unsigned short opt, int lower) in fat_shortname2uni() argument
244 if (lower) in fat_shortname2uni()
|