| /fs/btrfs/ |
| A D | backref.c | 3115 list_del_init(&node->lower); in btrfs_backref_drop_node()
3168 ASSERT(upper && lower && upper->level == lower->level + 1); in btrfs_backref_link_edge()
3169 edge->node[LOWER] = lower; in btrfs_backref_link_edge()
3333 lower = cur; in handle_indirect_tree_backref()
3339 lower->bytenr); in handle_indirect_tree_backref()
3346 lower->root = root; in handle_indirect_tree_backref()
3362 lower->level + 1); in handle_indirect_tree_backref()
3417 lower = upper; in handle_indirect_tree_backref()
3589 lower = edge->node[LOWER]; in btrfs_backref_finish_upper_links()
3655 lower = edge->node[LOWER]; in btrfs_backref_error_cleanup()
[all …]
|
| A D | ctree.c | 2846 struct extent_buffer *lower; in insert_new_root() local
2855 lower = path->nodes[level-1]; in insert_new_root()
2857 btrfs_item_key(lower, &lower_key, 0); in insert_new_root()
2859 btrfs_node_key(lower, &lower_key, 0); in insert_new_root()
2872 lower_gen = btrfs_header_generation(lower); in insert_new_root()
2917 struct extent_buffer *lower; in insert_ptr() local
2923 lower = path->nodes[level]; in insert_ptr()
2924 nritems = btrfs_header_nritems(lower); in insert_ptr()
2936 memmove_extent_buffer(lower, in insert_ptr()
2949 btrfs_set_node_key(lower, key, slot); in insert_ptr()
[all …]
|
| A D | backref.h | 340 struct list_head lower; member
|
| A D | relocation.c | 226 struct btrfs_backref_node *lower; in walk_down_backref() local
231 lower = edge->node[LOWER]; in walk_down_backref()
232 if (list_is_last(&edge->list[LOWER], &lower->upper)) { in walk_down_backref()
357 while (!list_empty(&cur->lower)) { in handle_useless_nodes()
359 struct btrfs_backref_node *lower; in handle_useless_nodes() local
361 edge = list_first_entry(&cur->lower, struct btrfs_backref_edge, in handle_useless_nodes()
365 lower = edge->node[LOWER]; in handle_useless_nodes()
369 if (list_empty(&lower->upper)) in handle_useless_nodes()
370 list_add(&lower->list, useless_node); in handle_useless_nodes()
|
| /fs/ |
| A D | mnt_idmapping.c | 360 uid_t lower; in statmount_mnt_idmap() local
373 lower = map_id_range_up(map_up, extent->lower_first, extent->count); in statmount_mnt_idmap()
374 if (lower == (uid_t) -1) in statmount_mnt_idmap()
377 seq_printf(seq, "%u %u %u", extent->first, lower, extent->count); in statmount_mnt_idmap()
|
| /fs/overlayfs/ |
| A D | Kconfig | 8 and a 'lower' filesystem. When a name exists in both filesystems, the
10 'lower' filesystem is either hidden or, in the case of directories,
51 the index directory to map lower inodes to upper inodes by default.
56 The inodes index feature prevents breaking of lower hardlinks on copy
80 the same lower dir. The full index may incur some overhead on mount
|
| A D | params.c | 327 l = krealloc_array(ctx->lower, nr, sizeof(*l), GFP_KERNEL_ACCOUNT); in ovl_ctx_realloc_lower()
331 ctx->lower = l; in ovl_ctx_realloc_lower()
360 l = &ctx->lower[ctx->nr++]; in ovl_add_layer()
469 struct ovl_fs_context_layer *l = ctx->lower; in ovl_reset_lowerdirs()
707 kfree(ctx->lower); in ovl_fs_context_free()
779 ctx->lower = kmalloc_array(3, sizeof(*ctx->lower), GFP_KERNEL_ACCOUNT); in ovl_init_fs_context()
780 if (!ctx->lower) in ovl_init_fs_context()
|
| A D | export.c | 299 struct dentry *lower = lowerpath ? lowerpath->dentry : NULL; in ovl_obtain_alias() local
308 if (d_is_dir(upper ?: lower)) in ovl_obtain_alias()
311 oe = ovl_alloc_entry(!!lower); in ovl_obtain_alias()
316 if (lower) { in ovl_obtain_alias()
317 ovl_lowerstack(oe)->dentry = dget(lower); in ovl_obtain_alias()
|
| A D | namei.c | 921 struct dentry *lower, struct dentry *upper) in ovl_fix_origin() argument
929 fh = ovl_get_origin_fh(ofs, lower); in ovl_fix_origin()
1168 struct ovl_path lower = ovl_lowerstack(poe)[i]; in ovl_lookup() local
1178 d.last = lower.layer->idx == ovl_numlower(roe); in ovl_lookup()
1180 d.layer = lower.layer; in ovl_lookup()
1181 err = ovl_lookup_layer(lower.dentry, &d, &this, false); in ovl_lookup()
1236 stack[ctr].layer = lower.layer; in ovl_lookup()
1246 i = lower.layer->idx - 1; in ovl_lookup()
|
| A D | super.c | 33 struct dentry *upper, *lower; in ovl_d_real() local
55 lower = ovl_dentry_lower(dentry); in ovl_d_real()
70 lower = ovl_dentry_lowerdata(dentry); in ovl_d_real()
71 if (!lower) in ovl_d_real()
76 return d_real(lower, type); in ovl_d_real()
1031 struct ovl_fs_context_layer *l = &ctx->lower[i]; in ovl_get_layers()
1148 l = &ctx->lower[i]; in ovl_get_lowerstack()
1175 l = &ctx->lower[i]; in ovl_get_lowerstack()
|
| A D | params.h | 34 struct ovl_fs_context_layer *lower; member
|
| A D | inode.c | 1169 struct dentry *lower, bool index) in ovl_hash_bylower() argument
1174 if (!lower) in ovl_hash_bylower()
1187 !d_is_dir(lower) && d_inode(lower)->i_nlink > 1) in ovl_hash_bylower()
|
| A D | util.c | 1060 struct dentry *lower = ovl_dentry_lower(dentry); in ovl_need_index() local
1062 if (!lower || !ovl_indexdir(dentry->d_sb)) in ovl_need_index()
1070 if (!d_is_dir(lower) && d_inode(lower)->i_nlink > 1) in ovl_need_index()
|
| /fs/fat/ |
| A D | namei_vfat.c | 264 unsigned char lower:1, member
269 (x)->lower = 1; \
299 info->lower = 0; in to_shortname_char()
306 info->lower = 0; in to_shortname_char()
311 info->lower = 0; in to_shortname_char()
451 if ((base_info.upper || base_info.lower) && in vfat_create_shortname()
452 (ext_info.upper || ext_info.lower)) { in vfat_create_shortname()
453 if (!base_info.upper && base_info.lower) in vfat_create_shortname()
455 if (!ext_info.upper && ext_info.lower) in vfat_create_shortname()
|
| A D | dir.c | 235 wchar_t *uni_buf, unsigned short opt, int lower) in fat_shortname2uni() argument
244 if (lower) in fat_shortname2uni()
|
| /fs/erofs/ |
| A D | Kconfig | 158 it costs lower CPU overhead.
|