| /fs/squashfs/ |
| D | cache.c | 56 struct squashfs_cache_entry *entry; in squashfs_cache_get() local
62 if (cache->entry[i].block == block) { in squashfs_cache_get()
90 if (cache->entry[i].refcount == 0) in squashfs_cache_get()
96 entry = &cache->entry[i]; in squashfs_cache_get()
103 entry->block = block; in squashfs_cache_get()
104 entry->refcount = 1; in squashfs_cache_get()
105 entry->pending = 1; in squashfs_cache_get()
106 entry->num_waiters = 0; in squashfs_cache_get()
107 entry->error = 0; in squashfs_cache_get()
110 entry->length = squashfs_read_data(sb, block, length, in squashfs_cache_get()
[all …]
|
| /fs/ |
| D | mbcache.c | 77 struct mb_cache_entry *entry, *dup; in mb_cache_entry_create() local
88 entry = kmem_cache_alloc(mb_entry_cache, mask); in mb_cache_entry_create()
89 if (!entry) in mb_cache_entry_create()
92 INIT_LIST_HEAD(&entry->e_list); in mb_cache_entry_create()
94 atomic_set(&entry->e_refcnt, 1); in mb_cache_entry_create()
95 entry->e_key = key; in mb_cache_entry_create()
96 entry->e_value = value; in mb_cache_entry_create()
97 entry->e_reusable = reusable; in mb_cache_entry_create()
98 entry->e_referenced = 0; in mb_cache_entry_create()
104 kmem_cache_free(mb_entry_cache, entry); in mb_cache_entry_create()
[all …]
|
| D | dax.c | 83 static unsigned long dax_to_pfn(void *entry) in dax_to_pfn() argument
85 return xa_to_value(entry) >> DAX_SHIFT; in dax_to_pfn()
93 static bool dax_is_locked(void *entry) in dax_is_locked() argument
95 return xa_to_value(entry) & DAX_LOCKED; in dax_is_locked()
98 static unsigned int dax_entry_order(void *entry) in dax_entry_order() argument
100 if (xa_to_value(entry) & DAX_PMD) in dax_entry_order()
105 static unsigned long dax_is_pmd_entry(void *entry) in dax_is_pmd_entry() argument
107 return xa_to_value(entry) & DAX_PMD; in dax_is_pmd_entry()
110 static bool dax_is_pte_entry(void *entry) in dax_is_pte_entry() argument
112 return !(xa_to_value(entry) & DAX_PMD); in dax_is_pte_entry()
[all …]
|
| /fs/btrfs/ |
| D | ordered-data.c | 21 static u64 entry_end(struct btrfs_ordered_extent *entry) in entry_end() argument
23 if (entry->file_offset + entry->len < entry->file_offset) in entry_end()
25 return entry->file_offset + entry->len; in entry_end()
36 struct btrfs_ordered_extent *entry; in tree_insert() local
40 entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node); in tree_insert()
42 if (file_offset < entry->file_offset) in tree_insert()
44 else if (file_offset >= entry_end(entry)) in tree_insert()
73 struct btrfs_ordered_extent *entry; in __tree_search() local
77 entry = rb_entry(n, struct btrfs_ordered_extent, rb_node); in __tree_search()
79 prev_entry = entry; in __tree_search()
[all …]
|
| D | free-space-cache.c | 519 struct btrfs_free_space_entry *entry; in io_ctl_add_entry() local
524 entry = io_ctl->cur; in io_ctl_add_entry()
525 entry->offset = cpu_to_le64(offset); in io_ctl_add_entry()
526 entry->bytes = cpu_to_le64(bytes); in io_ctl_add_entry()
527 entry->type = (bitmap) ? BTRFS_FREE_SPACE_BITMAP : in io_ctl_add_entry()
587 struct btrfs_free_space *entry, u8 *type) in io_ctl_read_entry() argument
599 entry->offset = le64_to_cpu(e->offset); in io_ctl_read_entry()
600 entry->bytes = le64_to_cpu(e->bytes); in io_ctl_read_entry()
614 struct btrfs_free_space *entry) in io_ctl_read_bitmap() argument
622 copy_page(entry->bitmap, io_ctl->cur); in io_ctl_read_bitmap()
[all …]
|
| /fs/nilfs2/ |
| D | dat.c | 78 struct nilfs_dat_entry *entry; in nilfs_dat_commit_alloc() local
82 entry = nilfs_palloc_block_get_entry(dat, req->pr_entry_nr, in nilfs_dat_commit_alloc()
84 entry->de_start = cpu_to_le64(NILFS_CNO_MIN); in nilfs_dat_commit_alloc()
85 entry->de_end = cpu_to_le64(NILFS_CNO_MAX); in nilfs_dat_commit_alloc()
86 entry->de_blocknr = cpu_to_le64(0); in nilfs_dat_commit_alloc()
102 struct nilfs_dat_entry *entry; in nilfs_dat_commit_free() local
106 entry = nilfs_palloc_block_get_entry(dat, req->pr_entry_nr, in nilfs_dat_commit_free()
108 entry->de_start = cpu_to_le64(NILFS_CNO_MIN); in nilfs_dat_commit_free()
109 entry->de_end = cpu_to_le64(NILFS_CNO_MIN); in nilfs_dat_commit_free()
110 entry->de_blocknr = cpu_to_le64(0); in nilfs_dat_commit_free()
[all …]
|
| /fs/ext4/ |
| D | block_validity.c | 55 struct ext4_system_zone *entry, *n; in release_system_zone() local
57 rbtree_postorder_for_each_entry_safe(entry, n, in release_system_zone()
59 kmem_cache_free(ext4_system_zone_cachep, entry); in release_system_zone()
71 struct ext4_system_zone *new_entry = NULL, *entry; in add_system_zone() local
77 entry = rb_entry(parent, struct ext4_system_zone, node); in add_system_zone()
78 if (start_blk < entry->start_blk) in add_system_zone()
80 else if (start_blk >= (entry->start_blk + entry->count)) in add_system_zone()
83 if (start_blk + count > (entry->start_blk + in add_system_zone()
84 entry->count)) in add_system_zone()
85 entry->count = (start_blk + count - in add_system_zone()
[all …]
|
| D | xattr.c | 183 ext4_xattr_check_entries(struct ext4_xattr_entry *entry, void *end, in ext4_xattr_check_entries() argument
186 struct ext4_xattr_entry *e = entry; in ext4_xattr_check_entries()
199 while (!IS_LAST_ENTRY(entry)) { in ext4_xattr_check_entries()
200 u32 size = le32_to_cpu(entry->e_value_size); in ext4_xattr_check_entries()
205 if (size != 0 && entry->e_value_inum == 0) { in ext4_xattr_check_entries()
206 u16 offs = le16_to_cpu(entry->e_value_offs); in ext4_xattr_check_entries()
223 entry = EXT4_XATTR_NEXT(entry); in ext4_xattr_check_entries()
284 struct ext4_xattr_entry *entry, *next; in xattr_find_entry() local
291 for (entry = *pentry; !IS_LAST_ENTRY(entry); entry = next) { in xattr_find_entry()
292 next = EXT4_XATTR_NEXT(entry); in xattr_find_entry()
[all …]
|
| /fs/ocfs2/ |
| D | filecheck.c | 102 struct ocfs2_filecheck_sysfs_entry *entry = container_of(kobj, in ocfs2_filecheck_release() local
105 complete(&entry->fs_kobj_unregister); in ocfs2_filecheck_release()
149 ocfs2_filecheck_sysfs_free(struct ocfs2_filecheck_sysfs_entry *entry) in ocfs2_filecheck_sysfs_free() argument
153 spin_lock(&entry->fs_fcheck->fc_lock); in ocfs2_filecheck_sysfs_free()
154 while (!list_empty(&entry->fs_fcheck->fc_head)) { in ocfs2_filecheck_sysfs_free()
155 p = list_first_entry(&entry->fs_fcheck->fc_head, in ocfs2_filecheck_sysfs_free()
161 spin_unlock(&entry->fs_fcheck->fc_lock); in ocfs2_filecheck_sysfs_free()
163 kfree(entry->fs_fcheck); in ocfs2_filecheck_sysfs_free()
164 entry->fs_fcheck = NULL; in ocfs2_filecheck_sysfs_free()
171 struct ocfs2_filecheck_sysfs_entry *entry = &osb->osb_fc_ent; in ocfs2_filecheck_create_sysfs() local
[all …]
|
| /fs/proc/ |
| D | proc_sysctl.c | 113 struct ctl_table *entry; in find_entry() local
124 entry = &head->ctl_table[ctl_node - head->node]; in find_entry()
125 procname = entry->procname; in find_entry()
134 return entry; in find_entry()
140 static int insert_entry(struct ctl_table_header *head, struct ctl_table *entry) in insert_entry() argument
142 struct rb_node *node = &head->node[entry - head->ctl_table].node; in insert_entry()
145 const char *name = entry->procname; in insert_entry()
169 pr_cont("/%s\n", entry->procname); in insert_entry()
179 static void erase_entry(struct ctl_table_header *head, struct ctl_table *entry) in erase_entry() argument
181 struct rb_node *node = &head->node[entry - head->ctl_table].node; in erase_entry()
[all …]
|
| D | namespaces.c | 113 const struct proc_ns_operations **entry, **last; in proc_ns_dir_readdir() local
122 entry = ns_entries + (ctx->pos - 2); in proc_ns_dir_readdir()
124 while (entry <= last) { in proc_ns_dir_readdir()
125 const struct proc_ns_operations *ops = *entry; in proc_ns_dir_readdir()
130 entry++; in proc_ns_dir_readdir()
147 const struct proc_ns_operations **entry, **last; in proc_ns_dir_lookup() local
155 for (entry = ns_entries; entry < last; entry++) { in proc_ns_dir_lookup()
156 if (strlen((*entry)->name) != len) in proc_ns_dir_lookup()
158 if (!memcmp(dentry->d_name.name, (*entry)->name, len)) in proc_ns_dir_lookup()
161 if (entry == last) in proc_ns_dir_lookup()
[all …]
|
| D | uid.c | 36 struct uid_hash_entry *entry; in uid_hash_entry_exists_locked() local
38 hash_for_each_possible(proc_uid_hash_table, entry, hash, uid) { in uid_hash_entry_exists_locked()
39 if (entry->uid == uid) in uid_hash_entry_exists_locked()
47 struct uid_hash_entry *entry; in proc_register_uid() local
57 entry = kzalloc(sizeof(struct uid_hash_entry), GFP_KERNEL); in proc_register_uid()
58 if (!entry) in proc_register_uid()
60 entry->uid = uid; in proc_register_uid()
64 kfree(entry); in proc_register_uid()
66 hash_add(proc_uid_hash_table, &entry->hash, uid); in proc_register_uid()
240 struct uid_hash_entry *entry; in proc_uid_readdir() local
[all …]
|
| /fs/fuse/ |
| D | dir.c | 28 static inline void __fuse_dentry_settime(struct dentry *entry, u64 time) in __fuse_dentry_settime() argument
30 entry->d_fsdata = (void *) time; in __fuse_dentry_settime()
33 static inline u64 fuse_dentry_time(const struct dentry *entry) in fuse_dentry_time() argument
35 return (u64)entry->d_fsdata; in fuse_dentry_time()
49 static inline u64 fuse_dentry_time(const struct dentry *entry) in fuse_dentry_time() argument
51 return ((union fuse_dentry *) entry->d_fsdata)->time; in fuse_dentry_time()
102 void fuse_change_entry_timeout(struct dentry *entry, struct fuse_entry_out *o) in fuse_change_entry_timeout() argument
104 fuse_dentry_settime(entry, in fuse_change_entry_timeout()
156 void fuse_invalidate_entry_cache(struct dentry *entry) in fuse_invalidate_entry_cache() argument
158 fuse_dentry_settime(entry, 0); in fuse_invalidate_entry_cache()
[all …]
|
| /fs/f2fs/ |
| D | acl.c | 50 struct f2fs_acl_entry *entry = (struct f2fs_acl_entry *)(hdr + 1); in f2fs_acl_from_disk() local
71 if ((char *)entry > end) in f2fs_acl_from_disk()
74 acl->a_entries[i].e_tag = le16_to_cpu(entry->e_tag); in f2fs_acl_from_disk()
75 acl->a_entries[i].e_perm = le16_to_cpu(entry->e_perm); in f2fs_acl_from_disk()
82 entry = (struct f2fs_acl_entry *)((char *)entry + in f2fs_acl_from_disk()
89 le32_to_cpu(entry->e_id)); in f2fs_acl_from_disk()
90 entry = (struct f2fs_acl_entry *)((char *)entry + in f2fs_acl_from_disk()
96 le32_to_cpu(entry->e_id)); in f2fs_acl_from_disk()
97 entry = (struct f2fs_acl_entry *)((char *)entry + in f2fs_acl_from_disk()
104 if ((char *)entry != end) in f2fs_acl_from_disk()
[all …]
|
| D | xattr.h | 62 #define ENTRY_SIZE(entry) (XATTR_ALIGN(sizeof(struct f2fs_xattr_entry) + \ argument
63 (entry)->e_name_len + le16_to_cpu((entry)->e_value_size)))
65 #define XATTR_NEXT_ENTRY(entry) ((struct f2fs_xattr_entry *)((char *)(entry) +\ argument
66 ENTRY_SIZE(entry)))
68 #define IS_XATTR_LAST_ENTRY(entry) (*(__u32 *)(entry) == 0) argument
70 #define list_for_each_xattr(entry, addr) \ argument
71 for (entry = XATTR_FIRST_ENTRY(addr);\
72 !IS_XATTR_LAST_ENTRY(entry);\
73 entry = XATTR_NEXT_ENTRY(entry))
|
| D | recovery.c | 59 struct fsync_inode_entry *entry; in get_fsync_inode() local
61 list_for_each_entry(entry, head, list) in get_fsync_inode()
62 if (entry->inode->i_ino == ino) in get_fsync_inode()
63 return entry; in get_fsync_inode()
72 struct fsync_inode_entry *entry; in add_fsync_inode() local
89 entry = f2fs_kmem_cache_alloc(fsync_entry_slab, GFP_F2FS_ZERO); in add_fsync_inode()
90 entry->inode = inode; in add_fsync_inode()
91 list_add_tail(&entry->list, head); in add_fsync_inode()
93 return entry; in add_fsync_inode()
99 static void del_fsync_inode(struct fsync_inode_entry *entry, int drop) in del_fsync_inode() argument
[all …]
|
| D | xattr.c | 210 struct f2fs_xattr_entry *entry; in __find_xattr() local
212 list_for_each_xattr(entry, base_addr) { in __find_xattr()
213 if ((void *)(entry) + sizeof(__u32) > last_base_addr || in __find_xattr()
214 (void *)XATTR_NEXT_ENTRY(entry) > last_base_addr) in __find_xattr()
217 if (entry->e_name_index != index) in __find_xattr()
219 if (entry->e_name_len != len) in __find_xattr()
221 if (!memcmp(entry->e_name, name, len)) in __find_xattr()
224 return entry; in __find_xattr()
231 struct f2fs_xattr_entry *entry; in __find_inline_xattr() local
235 list_for_each_xattr(entry, base_addr) { in __find_inline_xattr()
[all …]
|
| /fs/efivarfs/ |
| D | super.c | 110 struct efivar_entry *entry; in efivarfs_callback() local
119 entry = kzalloc(sizeof(*entry), GFP_KERNEL); in efivarfs_callback()
120 if (!entry) in efivarfs_callback()
123 memcpy(entry->var.VariableName, name16, name_size); in efivarfs_callback()
124 memcpy(&(entry->var.VendorGuid), &vendor, sizeof(efi_guid_t)); in efivarfs_callback()
126 len = ucs2_utf8size(entry->var.VariableName); in efivarfs_callback()
133 ucs2_as_utf8(name, entry->var.VariableName, len); in efivarfs_callback()
135 if (efivar_variable_is_removable(entry->var.VendorGuid, name, len)) in efivarfs_callback()
140 efi_guid_to_str(&entry->var.VendorGuid, name + len + 1); in efivarfs_callback()
155 efivar_entry_size(entry, &size); in efivarfs_callback()
[all …]
|
| /fs/ext2/ |
| D | xattr.c | 71 #define IS_LAST_ENTRY(entry) (*(__u32 *)(entry) == 0) argument
148 ext2_xattr_entry_valid(struct ext2_xattr_entry *entry, in ext2_xattr_entry_valid() argument
154 next = EXT2_XATTR_NEXT(entry); in ext2_xattr_entry_valid()
158 if (entry->e_value_block != 0) in ext2_xattr_entry_valid()
161 size = le32_to_cpu(entry->e_value_size); in ext2_xattr_entry_valid()
163 le16_to_cpu(entry->e_value_offs) + size > end_offs) in ext2_xattr_entry_valid()
171 struct ext2_xattr_entry *entry) in ext2_xattr_cmp_entry() argument
175 cmp = name_index - entry->e_name_index; in ext2_xattr_cmp_entry()
177 cmp = name_len - entry->e_name_len; in ext2_xattr_cmp_entry()
179 cmp = memcmp(name, entry->e_name, name_len); in ext2_xattr_cmp_entry()
[all …]
|
| /fs/nfs_common/ |
| D | nfsacl.c | 55 struct posix_acl_entry *entry = in xdr_nfsace_encode() local
58 *p++ = htonl(entry->e_tag | nfsacl_desc->typeflag); in xdr_nfsace_encode()
59 switch(entry->e_tag) { in xdr_nfsace_encode()
67 *p++ = htonl(from_kuid(&init_user_ns, entry->e_uid)); in xdr_nfsace_encode()
70 *p++ = htonl(from_kgid(&init_user_ns, entry->e_gid)); in xdr_nfsace_encode()
76 *p++ = htonl(entry->e_perm & S_IRWXO); in xdr_nfsace_encode()
151 struct posix_acl_entry *entry; in xdr_nfsace_decode() local
163 entry = &nfsacl_desc->acl->a_entries[nfsacl_desc->count++]; in xdr_nfsace_decode()
164 entry->e_tag = ntohl(*p++) & ~NFS_ACL_DEFAULT; in xdr_nfsace_decode()
166 entry->e_perm = ntohl(*p++); in xdr_nfsace_decode()
[all …]
|
| /fs/fat/ |
| D | fatent.c | 22 static void fat12_ent_blocknr(struct super_block *sb, int entry, in fat12_ent_blocknr() argument
26 int bytes = entry + (entry >> 1); in fat12_ent_blocknr()
27 WARN_ON(!fat_valid_entry(sbi, entry)); in fat12_ent_blocknr()
32 static void fat_ent_blocknr(struct super_block *sb, int entry, in fat_ent_blocknr() argument
36 int bytes = (entry << sbi->fatent_shift); in fat_ent_blocknr()
37 WARN_ON(!fat_valid_entry(sbi, entry)); in fat_ent_blocknr()
124 if (fatent->entry & 1) in fat12_ent_get()
162 if (fatent->entry & 1) { in fat12_ent_put()
197 u8 *nextp = ent12_p[1] + 1 + (fatent->entry & 1); in fat12_ent_next()
199 fatent->entry++; in fat12_ent_next()
[all …]
|
| /fs/omfs/ |
| D | file.c | 35 struct omfs_extent_entry *entry; in omfs_shrink_inode() local
71 entry = &oe->e_entry; in omfs_shrink_inode()
76 start = be64_to_cpu(entry->e_cluster); in omfs_shrink_inode()
77 count = be64_to_cpu(entry->e_blocks); in omfs_shrink_inode()
80 entry++; in omfs_shrink_inode()
120 struct omfs_extent_entry *entry = &oe->e_entry; in omfs_grow_extent() local
142 terminator = entry + extent_count - 1; in omfs_grow_extent()
144 entry = terminator-1; in omfs_grow_extent()
145 new_block = be64_to_cpu(entry->e_cluster) + in omfs_grow_extent()
146 be64_to_cpu(entry->e_blocks); in omfs_grow_extent()
[all …]
|
| /fs/xfs/libxfs/ |
| D | xfs_attr_leaf.c | 883 struct xfs_attr_leaf_entry *entry; in xfs_attr_shortform_allfit() local
892 entry = xfs_attr3_leaf_entryp(leaf); in xfs_attr_shortform_allfit()
895 for (i = 0; i < leafhdr.count; entry++, i++) { in xfs_attr_shortform_allfit()
896 if (entry->flags & XFS_ATTR_INCOMPLETE) in xfs_attr_shortform_allfit()
898 if (!(entry->flags & XFS_ATTR_LOCAL)) in xfs_attr_shortform_allfit()
1001 struct xfs_attr_leaf_entry *entry; in xfs_attr3_leaf_to_shortform() local
1019 entry = xfs_attr3_leaf_entryp(leaf); in xfs_attr3_leaf_to_shortform()
1051 for (i = 0; i < ichdr.count; entry++, i++) { in xfs_attr3_leaf_to_shortform()
1052 if (entry->flags & XFS_ATTR_INCOMPLETE) in xfs_attr3_leaf_to_shortform()
1054 if (!entry->nameidx) in xfs_attr3_leaf_to_shortform()
[all …]
|
| /fs/afs/ |
| D | vlclient.c | 20 struct afs_vldb_entry *entry; in afs_deliver_vl_get_entry_by_name_u() local
33 entry = call->ret_vldb; in afs_deliver_vl_get_entry_by_name_u()
40 entry->name[i] = (u8)ntohl(uvldb->name[i]); in afs_deliver_vl_get_entry_by_name_u()
41 entry->name[i] = 0; in afs_deliver_vl_get_entry_by_name_u()
42 entry->name_len = strlen(entry->name); in afs_deliver_vl_get_entry_by_name_u()
59 int n = entry->nr_servers; in afs_deliver_vl_get_entry_by_name_u()
66 entry->fs_mask[n] |= AFS_VOL_VTM_RW; in afs_deliver_vl_get_entry_by_name_u()
68 entry->fs_mask[n] |= AFS_VOL_VTM_BAK; in afs_deliver_vl_get_entry_by_name_u()
71 entry->fs_mask[n] |= AFS_VOL_VTM_RO; in afs_deliver_vl_get_entry_by_name_u()
72 if (!entry->fs_mask[n]) in afs_deliver_vl_get_entry_by_name_u()
[all …]
|
| /fs/nfs/ |
| D | dir.c | 202 int nfs_readdir_add_to_array(struct nfs_entry *entry, struct page *page) in nfs_readdir_add_to_array() argument
215 cache_entry->cookie = entry->prev_cookie; in nfs_readdir_add_to_array()
216 cache_entry->ino = entry->ino; in nfs_readdir_add_to_array()
217 cache_entry->d_type = entry->d_type; in nfs_readdir_add_to_array()
218 ret = nfs_readdir_make_qstr(&cache_entry->string, entry->name, entry->len); in nfs_readdir_add_to_array()
221 array->last_cookie = entry->cookie; in nfs_readdir_add_to_array()
223 if (entry->eof != 0) in nfs_readdir_add_to_array()
334 struct nfs_entry *entry, struct file *file, struct inode *inode) in nfs_readdir_xdr_filler() argument
344 error = NFS_PROTO(inode)->readdir(file_dentry(file), cred, entry->cookie, pages, in nfs_readdir_xdr_filler()
363 struct nfs_entry *entry, struct xdr_stream *xdr) in xdr_decode() argument
[all …]
|