Searched refs:entry (Results 1 - 25 of 97) sorted by relevance

1234

/fs/squashfs/
H A Dcache.c69 struct squashfs_cache_entry *entry; local
75 if (cache->entry[i].block == block) {
97 * At least one unused cache entry. A simple
98 * round-robin strategy is used to choose the entry to
103 if (cache->entry[i].refcount == 0)
109 entry = &cache->entry[i];
112 * Initialise chosen cache entry, and fill it in from
116 entry->block = block;
117 entry
186 squashfs_cache_put(struct squashfs_cache_entry *entry) argument
266 struct squashfs_cache_entry *entry = &cache->entry[i]; local
306 squashfs_copy_data(void *buffer, struct squashfs_cache_entry *entry, int offset, int length) argument
349 struct squashfs_cache_entry *entry; local
[all...]
H A Dsymlink.c57 struct squashfs_cache_entry *entry; local
84 entry = squashfs_cache_get(sb, msblk->block_cache, block, 0);
85 if (entry->error) {
89 squashfs_cache_put(entry);
94 copied = squashfs_copy_data(pageaddr + bytes, entry, offset,
99 block = entry->next_index;
101 squashfs_cache_put(entry);
/fs/f2fs/
H A Dxattr.h59 #define ENTRY_SIZE(entry) (XATTR_ALIGN(sizeof(struct f2fs_xattr_entry) + \
60 entry->e_name_len + le16_to_cpu(entry->e_value_size)))
62 #define XATTR_NEXT_ENTRY(entry) ((struct f2fs_xattr_entry *)((char *)(entry) +\
63 ENTRY_SIZE(entry)))
65 #define IS_XATTR_LAST_ENTRY(entry) (*(__u32 *)(entry) == 0)
67 #define list_for_each_xattr(entry, addr) \
68 for (entry
[all...]
H A Dacl.c53 struct f2fs_acl_entry *entry = (struct f2fs_acl_entry *)(hdr + 1); local
71 if ((char *)entry > end)
74 acl->a_entries[i].e_tag = le16_to_cpu(entry->e_tag);
75 acl->a_entries[i].e_perm = le16_to_cpu(entry->e_perm);
82 entry = (struct f2fs_acl_entry *)((char *)entry +
89 le32_to_cpu(entry->e_id));
90 entry = (struct f2fs_acl_entry *)((char *)entry +
96 le32_to_cpu(entry
115 struct f2fs_acl_entry *entry; local
[all...]
H A Drecovery.c61 struct fsync_inode_entry *entry; local
63 list_for_each_entry(entry, head, list)
64 if (entry->inode->i_ino == ino)
65 return entry;
174 struct fsync_inode_entry *entry; local
187 entry = get_fsync_inode(head, ino_of_node(page));
188 if (entry) {
190 set_inode_flag(F2FS_I(entry->inode),
200 entry = kmem_cache_alloc(fsync_entry_slab, GFP_F2FS_ZERO);
201 if (!entry) {
237 struct fsync_inode_entry *entry, *tmp; local
434 struct fsync_inode_entry *entry; local
[all...]
/fs/btrfs/
H A Dordered-data.c31 static u64 entry_end(struct btrfs_ordered_extent *entry) argument
33 if (entry->file_offset + entry->len < entry->file_offset)
35 return entry->file_offset + entry->len;
46 struct btrfs_ordered_extent *entry; local
50 entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node);
52 if (file_offset < entry->file_offset)
54 else if (file_offset >= entry_end(entry))
83 struct btrfs_ordered_extent *entry; local
130 offset_in_entry(struct btrfs_ordered_extent *entry, u64 file_offset) argument
138 range_overlaps(struct btrfs_ordered_extent *entry, u64 file_offset, u64 len) argument
157 struct btrfs_ordered_extent *entry; local
191 struct btrfs_ordered_extent *entry; local
279 btrfs_add_ordered_sum(struct inode *inode, struct btrfs_ordered_extent *entry, struct btrfs_ordered_sum *sum) argument
313 struct btrfs_ordered_extent *entry = NULL; local
383 struct btrfs_ordered_extent *entry = NULL; local
528 btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry) argument
552 btrfs_remove_ordered_extent(struct inode *inode, struct btrfs_ordered_extent *entry) argument
685 btrfs_start_ordered_extent(struct inode *inode, struct btrfs_ordered_extent *entry, int wait) argument
790 struct btrfs_ordered_extent *entry = NULL; local
817 struct btrfs_ordered_extent *entry = NULL; local
858 struct btrfs_ordered_extent *entry = NULL; local
[all...]
H A Dfree-space-cache.c491 struct btrfs_free_space_entry *entry; local
496 entry = io_ctl->cur;
497 entry->offset = cpu_to_le64(offset);
498 entry->bytes = cpu_to_le64(bytes);
499 entry->type = (bitmap) ? BTRFS_FREE_SPACE_BITMAP :
559 struct btrfs_free_space *entry, u8 *type)
571 entry->offset = le64_to_cpu(e->offset);
572 entry->bytes = le64_to_cpu(e->bytes);
586 struct btrfs_free_space *entry)
594 memcpy(entry
558 io_ctl_read_entry(struct io_ctl *io_ctl, struct btrfs_free_space *entry, u8 *type) argument
585 io_ctl_read_bitmap(struct io_ctl *io_ctl, struct btrfs_free_space *entry) argument
1039 struct btrfs_free_space *entry = local
1073 struct btrfs_free_space *entry = local
1342 struct btrfs_free_space *entry, *prev = NULL; local
1617 struct btrfs_free_space *entry; local
1864 struct btrfs_free_space *entry; local
2320 struct btrfs_free_space *entry; local
2415 struct btrfs_free_space *entry = NULL; local
2497 btrfs_alloc_from_bitmap(struct btrfs_block_group_cache *block_group, struct btrfs_free_cluster *cluster, struct btrfs_free_space *entry, u64 bytes, u64 min_start, u64 *max_extent_size) argument
2535 struct btrfs_free_space *entry = NULL; local
2614 btrfs_bitmap_cluster(struct btrfs_block_group_cache *block_group, struct btrfs_free_space *entry, struct btrfs_free_cluster *cluster, u64 offset, u64 bytes, u64 cont1_bytes, u64 min_bytes) argument
2689 struct btrfs_free_space *entry = NULL; local
2779 struct btrfs_free_space *entry; local
2827 struct btrfs_free_space *entry, *tmp; local
2957 struct btrfs_free_space *entry; local
3030 struct btrfs_free_space *entry; local
3123 struct btrfs_free_space *entry = NULL; local
[all...]
H A Dextent_map.c96 struct extent_map *entry = NULL; local
102 entry = rb_entry(parent, struct extent_map, rb_node);
104 if (em->start < entry->start)
106 else if (em->start >= extent_map_end(entry))
113 while (parent && em->start >= extent_map_end(entry)) {
115 entry = rb_entry(parent, struct extent_map, rb_node);
118 if (end > entry->start && em->start < extent_map_end(entry))
122 entry = rb_entry(parent, struct extent_map, rb_node);
123 while (parent && em->start < entry
147 struct extent_map *entry; local
[all...]
/fs/ext4/
H A Dblock_validity.c61 struct ext4_system_zone *new_entry = NULL, *entry; local
67 entry = rb_entry(parent, struct ext4_system_zone, node);
68 if (start_blk < entry->start_blk)
70 else if (start_blk >= (entry->start_blk + entry->count))
73 if (start_blk + count > (entry->start_blk +
74 entry->count))
75 entry->count = (start_blk + count -
76 entry->start_blk);
100 entry
125 struct ext4_system_zone *entry; local
183 struct ext4_system_zone *entry, *n; local
200 struct ext4_system_zone *entry; local
[all...]
H A Dxattr.h57 #define EXT4_XATTR_NEXT(entry) \
59 (char *)(entry) + EXT4_XATTR_LEN((entry)->e_name_len)))
73 #define IS_LAST_ENTRY(entry) (*(__u32 *)(entry) == 0)
H A Dxattr.c30 * | entry 1 | |
31 * | entry 2 | | growing downwards
32 * | entry 3 | v
40 * The header is followed by multiple entry descriptors. In disk blocks, the
41 * entry descriptors are kept sorted. In inodes, they are unsorted. The
191 ext4_xattr_check_names(struct ext4_xattr_entry *entry, void *end, argument
194 struct ext4_xattr_entry *e = entry;
203 while (!IS_LAST_ENTRY(entry)) {
204 if (entry->e_value_size != 0 &&
205 (value_start + le16_to_cpu(entry
237 ext4_xattr_check_entry(struct ext4_xattr_entry *entry, size_t size) argument
251 struct ext4_xattr_entry *entry; local
279 struct ext4_xattr_entry *entry; local
331 struct ext4_xattr_entry *entry; local
399 ext4_xattr_list_entries(struct dentry *dentry, struct ext4_xattr_entry *entry, char *buffer, size_t buffer_size) argument
1233 ext4_xattr_shift_entries(struct ext4_xattr_entry *entry, int value_offs_shift, void *to, void *from, size_t n, int blocksize) argument
1262 struct ext4_xattr_entry *entry, *last, *first; local
1656 ext4_xattr_hash_entry(struct ext4_xattr_header *header, struct ext4_xattr_entry *entry) argument
1692 ext4_xattr_rehash(struct ext4_xattr_header *header, struct ext4_xattr_entry *entry) argument
[all...]
/fs/lockd/
H A Dprocfs.c73 struct proc_dir_entry *entry; local
75 entry = proc_mkdir("fs/lockd", NULL);
76 if (!entry)
78 entry = proc_create("nlm_end_grace", S_IRUGO|S_IWUSR, entry,
80 if (!entry) {
/fs/nilfs2/
H A Ddat.c91 struct nilfs_dat_entry *entry; local
95 entry = nilfs_palloc_block_get_entry(dat, req->pr_entry_nr,
97 entry->de_start = cpu_to_le64(NILFS_CNO_MIN);
98 entry->de_end = cpu_to_le64(NILFS_CNO_MAX);
99 entry->de_blocknr = cpu_to_le64(0);
115 struct nilfs_dat_entry *entry; local
119 entry = nilfs_palloc_block_get_entry(dat, req->pr_entry_nr,
121 entry->de_start = cpu_to_le64(NILFS_CNO_MIN);
122 entry->de_end = cpu_to_le64(NILFS_CNO_MIN);
123 entry
142 struct nilfs_dat_entry *entry; local
157 struct nilfs_dat_entry *entry; local
190 struct nilfs_dat_entry *entry; local
215 struct nilfs_dat_entry *entry; local
331 struct nilfs_dat_entry *entry; local
400 struct nilfs_dat_entry *entry; local
437 struct nilfs_dat_entry *entry; local
[all...]
/fs/afs/
H A Dvlclient.c64 struct afs_cache_vlocation *entry; local
79 entry = call->reply;
83 entry->name[loop] = ntohl(*bp++);
84 entry->name[loop] = 0;
88 entry->nservers = ntohl(*bp++);
91 entry->servers[loop].s_addr = *bp++;
97 entry->srvtmask[loop] = 0;
99 entry->srvtmask[loop] |= AFS_VOL_VTM_RW;
101 entry->srvtmask[loop] |= AFS_VOL_VTM_RO;
103 entry
150 afs_vl_get_entry_by_name(struct in_addr *addr, struct key *key, const char *volname, struct afs_cache_vlocation *entry, const struct afs_wait_mode *wait_mode) argument
190 afs_vl_get_entry_by_id(struct in_addr *addr, struct key *key, afs_volid_t volid, afs_voltype_t voltype, struct afs_cache_vlocation *entry, const struct afs_wait_mode *wait_mode) argument
[all...]
/fs/proc/
H A Dproc_sysctl.c84 struct ctl_table *entry; local
95 entry = &head->ctl_table[ctl_node - head->node];
96 procname = entry->procname;
105 return entry;
111 static int insert_entry(struct ctl_table_header *head, struct ctl_table *entry) argument
113 struct rb_node *node = &head->node[entry - head->ctl_table].node;
116 const char *name = entry->procname;
138 pr_err("sysctl duplicate entry: ");
140 pr_cont("/%s\n", entry->procname);
150 static void erase_entry(struct ctl_table_header *head, struct ctl_table *entry) argument
172 struct ctl_table *entry; local
180 struct ctl_table *entry; local
187 struct ctl_table *entry; local
300 struct ctl_table *entry; local
328 struct ctl_table *entry = NULL; local
345 struct ctl_table *entry = *pentry; local
659 struct ctl_table *entry; local
829 struct ctl_table *entry; local
946 struct ctl_table *entry; local
1023 struct ctl_table *link_table, *entry, *link; local
1067 struct ctl_table *entry, *link; local
1182 struct ctl_table *entry; local
1275 struct ctl_table *entry; local
1295 struct ctl_table *entry, *files; local
1477 struct ctl_table *entry; local
[all...]
/fs/efivarfs/
H A Dsuper.c116 struct efivar_entry *entry; local
124 entry = kmalloc(sizeof(*entry), GFP_KERNEL);
125 if (!entry)
128 memcpy(entry->var.VariableName, name16, name_size);
129 memcpy(&(entry->var.VendorGuid), &vendor, sizeof(efi_guid_t));
131 len = ucs2_strlen(entry->var.VariableName);
139 name[i] = entry->var.VariableName[i] & 0xFF;
143 efi_guid_unparse(&entry->var.VendorGuid, name + len + 1);
160 efivar_entry_size(entry,
180 efivarfs_destroy(struct efivar_entry *entry, void *data) argument
[all...]
/fs/nfs_common/
H A Dnfsacl.c11 * - Minimal ACLs always have an ACL_MASK entry, so they have
13 * - The ACL_MASK entry in such minimal ACLs always has the same
14 * permissions as the ACL_GROUP_OBJ entry. (In extended ACLs
54 struct posix_acl_entry *entry = local
57 *p++ = htonl(entry->e_tag | nfsacl_desc->typeflag);
58 switch(entry->e_tag) {
66 *p++ = htonl(from_kuid(&init_user_ns, entry->e_uid));
69 *p++ = htonl(from_kgid(&init_user_ns, entry->e_gid));
75 *p++ = htonl(entry->e_perm & S_IRWXO);
150 struct posix_acl_entry *entry; local
[all...]
/fs/omfs/
H A Dfile.c35 struct omfs_extent_entry *entry; local
42 /* traverse extent table, freeing each entry that is greater
71 entry = &oe->e_entry;
73 /* ignore last entry as it is the terminator */
76 start = be64_to_cpu(entry->e_cluster);
77 count = be64_to_cpu(entry->e_blocks);
80 entry++;
120 struct omfs_extent_entry *entry = &oe->e_entry; local
142 terminator = entry + extent_count - 1;
144 entry
227 struct omfs_extent_entry *entry; local
[all...]
/fs/jffs2/
H A Dacl.c59 struct jffs2_acl_entry *entry; local
86 entry = value;
89 acl->a_entries[i].e_tag = je16_to_cpu(entry->e_tag);
90 acl->a_entries[i].e_perm = je16_to_cpu(entry->e_perm);
105 je32_to_cpu(entry->e_id));
113 je32_to_cpu(entry->e_id));
131 struct jffs2_acl_entry *entry; local
136 header = kmalloc(sizeof(*header) + acl->a_count * sizeof(*entry), GFP_KERNEL);
143 entry = e;
144 entry
[all...]
/fs/ocfs2/
H A Dacl.c59 struct ocfs2_acl_entry *entry = local
62 acl->a_entries[n].e_tag = le16_to_cpu(entry->e_tag);
63 acl->a_entries[n].e_perm = le16_to_cpu(entry->e_perm);
68 le32_to_cpu(entry->e_id));
73 le32_to_cpu(entry->e_id));
89 struct ocfs2_acl_entry *entry = NULL; local
99 entry = (struct ocfs2_acl_entry *)ocfs2_acl;
100 for (n = 0; n < acl->a_count; n++, entry++) {
101 entry->e_tag = cpu_to_le16(acl->a_entries[n].e_tag);
102 entry
[all...]
/fs/hfsplus/
H A Dattributes.c87 void hfsplus_destroy_attr_entry(hfsplus_attr_entry *entry) argument
89 if (entry)
90 kmem_cache_free(hfsplus_attr_tree_cachep, entry);
95 static int hfsplus_attr_build_record(hfsplus_attr_entry *entry, int record_type, argument
103 memset(entry, 0, sizeof(*entry));
110 memset(entry, 0, sizeof(*entry));
115 memset(entry, 0, sizeof(struct hfsplus_attr_inline_data));
116 entry
[all...]
/fs/xfs/libxfs/
H A Dxfs_attr_leaf.c757 struct xfs_attr_leaf_entry *entry; local
765 entry = xfs_attr3_leaf_entryp(leaf);
768 for (i = 0; i < leafhdr.count; entry++, i++) {
769 if (entry->flags & XFS_ATTR_INCOMPLETE)
771 if (!(entry->flags & XFS_ATTR_LOCAL))
800 struct xfs_attr_leaf_entry *entry; local
818 entry = xfs_attr3_leaf_entryp(leaf);
852 for (i = 0; i < ichdr.count; entry++, i++) {
853 if (entry->flags & XFS_ATTR_INCOMPLETE)
855 if (!entry
1149 struct xfs_attr_leaf_entry *entry; local
1576 struct xfs_attr_leaf_entry *entry; local
1798 struct xfs_attr_leaf_entry *entry; local
1956 struct xfs_attr_leaf_entry *entry; local
2079 struct xfs_attr_leaf_entry *entry; local
2189 struct xfs_attr_leaf_entry *entry; local
2467 struct xfs_attr_leaf_entry *entry; local
2536 struct xfs_attr_leaf_entry *entry; local
[all...]
/fs/fuse/
H A Ddir.c41 static inline void fuse_dentry_settime(struct dentry *entry, u64 time) argument
43 entry->d_time = time;
46 static inline u64 fuse_dentry_time(struct dentry *entry) argument
48 return entry->d_time;
54 static void fuse_dentry_settime(struct dentry *entry, u64 time) argument
56 entry->d_time = time;
57 entry->d_fsdata = (void *) (unsigned long) (time >> 32);
60 static u64 fuse_dentry_time(struct dentry *entry) argument
62 return (u64) entry->d_time +
63 ((u64) (unsigned long) entry
89 fuse_change_entry_timeout(struct dentry *entry, struct fuse_entry_out *o) argument
133 fuse_invalidate_entry_cache(struct dentry *entry) argument
142 fuse_invalidate_entry(struct dentry *entry) argument
190 fuse_dentry_revalidate(struct dentry *entry, unsigned int flags) argument
353 fuse_lookup(struct inode *dir, struct dentry *entry, unsigned int flags) argument
401 fuse_create_open(struct inode *dir, struct dentry *entry, struct file *file, unsigned flags, umode_t mode, int *opened) argument
504 fuse_atomic_open(struct inode *dir, struct dentry *entry, struct file *file, unsigned flags, umode_t mode, int *opened) argument
550 create_new_entry(struct fuse_conn *fc, struct fuse_req *req, struct inode *dir, struct dentry *entry, umode_t mode) argument
607 fuse_mknod(struct inode *dir, struct dentry *entry, umode_t mode, dev_t rdev) argument
633 fuse_create(struct inode *dir, struct dentry *entry, umode_t mode, bool excl) argument
639 fuse_mkdir(struct inode *dir, struct dentry *entry, umode_t mode) argument
662 fuse_symlink(struct inode *dir, struct dentry *entry, const char *link) argument
688 fuse_unlink(struct inode *dir, struct dentry *entry) argument
728 fuse_rmdir(struct inode *dir, struct dentry *entry) argument
845 fuse_link(struct dentry *entry, struct inode *newdir, struct dentry *newent) argument
1011 struct dentry *entry; local
1810 fuse_setattr(struct dentry *entry, struct iattr *attr) argument
1823 fuse_getattr(struct vfsmount *mnt, struct dentry *entry, struct kstat *stat) argument
1835 fuse_setxattr(struct dentry *entry, const char *name, const void *value, size_t size, int flags) argument
1877 fuse_getxattr(struct dentry *entry, const char *name, void *value, size_t size) argument
1927 fuse_listxattr(struct dentry *entry, char *list, size_t size) argument
1977 fuse_removexattr(struct dentry *entry, const char *name) argument
[all...]
/fs/ext2/
H A Dacl.c42 ext2_acl_entry *entry = local
46 acl->a_entries[n].e_tag = le16_to_cpu(entry->e_tag);
47 acl->a_entries[n].e_perm = le16_to_cpu(entry->e_perm);
63 le32_to_cpu(entry->e_id));
71 le32_to_cpu(entry->e_id));
106 ext2_acl_entry *entry = (ext2_acl_entry *)e; local
107 entry->e_tag = cpu_to_le16(acl_e->e_tag);
108 entry->e_perm = cpu_to_le16(acl_e->e_perm);
111 entry->e_id = cpu_to_le32(
116 entry
[all...]
/fs/ext3/
H A Dacl.c38 ext3_acl_entry *entry = local
42 acl->a_entries[n].e_tag = le16_to_cpu(entry->e_tag);
43 acl->a_entries[n].e_perm = le16_to_cpu(entry->e_perm);
59 le32_to_cpu(entry->e_id));
67 le32_to_cpu(entry->e_id));
102 ext3_acl_entry *entry = (ext3_acl_entry *)e; local
103 entry->e_tag = cpu_to_le16(acl_e->e_tag);
104 entry->e_perm = cpu_to_le16(acl_e->e_perm);
107 entry->e_id = cpu_to_le32(
112 entry
[all...]

Completed in 379 milliseconds

1234