| /fs/squashfs/ |
| D | cache.c | 70 struct squashfs_cache_entry *entry; in squashfs_cache_get() local
76 if (cache->entry[i].block == block) in squashfs_cache_get()
100 if (cache->entry[i].refcount == 0) in squashfs_cache_get()
106 entry = &cache->entry[i]; in squashfs_cache_get()
113 entry->block = block; in squashfs_cache_get()
114 entry->refcount = 1; in squashfs_cache_get()
115 entry->pending = 1; in squashfs_cache_get()
116 entry->num_waiters = 0; in squashfs_cache_get()
117 entry->error = 0; in squashfs_cache_get()
120 entry->length = squashfs_read_data(sb, entry->data, in squashfs_cache_get()
[all …]
|
| D | symlink.c | 57 struct squashfs_cache_entry *entry; in squashfs_symlink_readpage() local
84 entry = squashfs_cache_get(sb, msblk->block_cache, block, 0); in squashfs_symlink_readpage()
85 if (entry->error) { in squashfs_symlink_readpage()
89 squashfs_cache_put(entry); in squashfs_symlink_readpage()
94 copied = squashfs_copy_data(pageaddr + bytes, entry, offset, in squashfs_symlink_readpage()
99 block = entry->next_index; in squashfs_symlink_readpage()
101 squashfs_cache_put(entry); in squashfs_symlink_readpage()
|
| /fs/btrfs/ |
| D | ordered-data.c | 29 static u64 entry_end(struct btrfs_ordered_extent *entry) in entry_end() argument
31 if (entry->file_offset + entry->len < entry->file_offset) in entry_end()
33 return entry->file_offset + entry->len; in entry_end()
44 struct btrfs_ordered_extent *entry; in tree_insert() local
48 entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node); in tree_insert()
50 if (file_offset < entry->file_offset) in tree_insert()
52 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 | 81 struct btrfs_free_space *entry, *ret = NULL; in tree_search_offset() local
84 entry = rb_entry(n, struct btrfs_free_space, offset_index); in tree_search_offset()
86 if (offset < entry->offset) { in tree_search_offset()
88 (!ret || entry->offset < ret->offset) && in tree_search_offset()
89 (bytes <= entry->bytes)) in tree_search_offset()
90 ret = entry; in tree_search_offset()
92 } else if (offset > entry->offset) { in tree_search_offset()
93 if ((entry->offset + entry->bytes - 1) >= offset && in tree_search_offset()
94 bytes <= entry->bytes) { in tree_search_offset()
95 ret = entry; in tree_search_offset()
[all …]
|
| D | ref-cache.c | 80 struct btrfs_leaf_ref *entry; in tree_insert() local
84 entry = rb_entry(parent, struct btrfs_leaf_ref, rb_node); in tree_insert()
86 if (bytenr < entry->bytenr) in tree_insert()
88 else if (bytenr > entry->bytenr) in tree_insert()
94 entry = rb_entry(node, struct btrfs_leaf_ref, rb_node); in tree_insert()
103 struct btrfs_leaf_ref *entry; in tree_search() local
106 entry = rb_entry(n, struct btrfs_leaf_ref, rb_node); in tree_search()
107 WARN_ON(!entry->in_tree); in tree_search()
109 if (bytenr < entry->bytenr) in tree_search()
111 else if (bytenr > entry->bytenr) in tree_search()
|
| D | extent_map.c | 93 struct extent_map *entry; in tree_insert() local
97 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
99 WARN_ON(!entry->in_tree); in tree_insert()
101 if (offset < entry->start) in tree_insert()
103 else if (offset >= extent_map_end(entry)) in tree_insert()
109 entry = rb_entry(node, struct extent_map, rb_node); in tree_insert()
110 entry->in_tree = 1; in tree_insert()
127 struct extent_map *entry; in __tree_search() local
131 entry = rb_entry(n, struct extent_map, rb_node); in __tree_search()
133 prev_entry = entry; in __tree_search()
[all …]
|
| /fs/afs/ |
| D | cache.c | 14 const void *entry);
15 static void afs_cell_cache_update(void *source, void *entry);
31 const void *entry) in afs_cell_cache_match() argument
33 const struct afs_cache_cell *ccell = entry; in afs_cell_cache_match()
52 static void afs_cell_cache_update(void *source, void *entry) in afs_cell_cache_update() argument
54 struct afs_cache_cell *ccell = entry; in afs_cell_cache_update()
57 _enter("%p,%p", source, entry); in afs_cell_cache_update()
70 const void *entry);
71 static void afs_vlocation_cache_update(void *source, void *entry);
88 const void *entry) in afs_vlocation_cache_match() argument
[all …]
|
| D | vlclient.c | 63 struct afs_cache_vlocation *entry; in afs_deliver_vl_get_entry_by_xxx() local
78 entry = call->reply; in afs_deliver_vl_get_entry_by_xxx()
82 entry->name[loop] = ntohl(*bp++); in afs_deliver_vl_get_entry_by_xxx()
83 entry->name[loop] = 0; in afs_deliver_vl_get_entry_by_xxx()
87 entry->nservers = ntohl(*bp++); in afs_deliver_vl_get_entry_by_xxx()
90 entry->servers[loop].s_addr = *bp++; in afs_deliver_vl_get_entry_by_xxx()
96 entry->srvtmask[loop] = 0; in afs_deliver_vl_get_entry_by_xxx()
98 entry->srvtmask[loop] |= AFS_VOL_VTM_RW; in afs_deliver_vl_get_entry_by_xxx()
100 entry->srvtmask[loop] |= AFS_VOL_VTM_RO; in afs_deliver_vl_get_entry_by_xxx()
102 entry->srvtmask[loop] |= AFS_VOL_VTM_BAK; in afs_deliver_vl_get_entry_by_xxx()
[all …]
|
| /fs/yaffs2/ |
| D | devextras.h | 89 static __inline__ void ylist_del(struct ylist_head *entry) in ylist_del() argument
91 struct ylist_head *listNext = entry->next; in ylist_del()
92 struct ylist_head *listPrev = entry->prev; in ylist_del()
99 static __inline__ void ylist_del_init(struct ylist_head *entry) in ylist_del_init() argument
101 ylist_del(entry); in ylist_del_init()
102 entry->next = entry->prev = entry; in ylist_del_init()
107 static __inline__ int ylist_empty(struct ylist_head *entry) in ylist_empty() argument
109 return (entry->next == entry); in ylist_empty()
118 #define ylist_entry(entry, type, member) \ argument
119 ((type *)((char *)(entry)-(unsigned long)(&((type *)NULL)->member)))
|
| /fs/fuse/ |
| D | dir.c | 18 static inline void fuse_dentry_settime(struct dentry *entry, u64 time) in fuse_dentry_settime() argument
20 entry->d_time = time; in fuse_dentry_settime()
23 static inline u64 fuse_dentry_time(struct dentry *entry) in fuse_dentry_time() argument
25 return entry->d_time; in fuse_dentry_time()
31 static void fuse_dentry_settime(struct dentry *entry, u64 time) in fuse_dentry_settime() argument
33 entry->d_time = time; in fuse_dentry_settime()
34 entry->d_fsdata = (void *) (unsigned long) (time >> 32); in fuse_dentry_settime()
37 static u64 fuse_dentry_time(struct dentry *entry) in fuse_dentry_time() argument
39 return (u64) entry->d_time + in fuse_dentry_time()
40 ((u64) (unsigned long) entry->d_fsdata << 32); in fuse_dentry_time()
[all …]
|
| /fs/fat/ |
| D | fatent.c | 24 static void fat12_ent_blocknr(struct super_block *sb, int entry, in fat12_ent_blocknr() argument
28 int bytes = entry + (entry >> 1); in fat12_ent_blocknr()
29 WARN_ON(entry < FAT_START_ENT || sbi->max_cluster <= entry); in fat12_ent_blocknr()
34 static void fat_ent_blocknr(struct super_block *sb, int entry, in fat_ent_blocknr() argument
38 int bytes = (entry << sbi->fatent_shift); in fat_ent_blocknr()
39 WARN_ON(entry < FAT_START_ENT || sbi->max_cluster <= entry); in fat_ent_blocknr()
123 if (fatent->entry & 1) in fat12_ent_get()
161 if (fatent->entry & 1) { in fat12_ent_put()
199 u8 *nextp = ent12_p[1] + 1 + (fatent->entry & 1); in fat12_ent_next()
201 fatent->entry++; in fat12_ent_next()
[all …]
|
| /fs/xfs/ |
| D | xfs_attr_leaf.c | 725 xfs_attr_leaf_entry_t *entry; in xfs_attr_shortform_allfit() local
732 entry = &leaf->entries[0]; in xfs_attr_shortform_allfit()
734 for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) { in xfs_attr_shortform_allfit()
735 if (entry->flags & XFS_ATTR_INCOMPLETE) in xfs_attr_shortform_allfit()
737 if (!(entry->flags & XFS_ATTR_LOCAL)) in xfs_attr_shortform_allfit()
762 xfs_attr_leaf_entry_t *entry; in xfs_attr_leaf_to_shortform() local
819 entry = &leaf->entries[0]; in xfs_attr_leaf_to_shortform()
820 for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) { in xfs_attr_leaf_to_shortform()
821 if (entry->flags & XFS_ATTR_INCOMPLETE) in xfs_attr_leaf_to_shortform()
823 if (!entry->nameidx) in xfs_attr_leaf_to_shortform()
[all …]
|
| /fs/ext4/ |
| D | xattr.c | 67 #define IS_LAST_ENTRY(entry) (*(__u32 *)(entry) == 0) argument
147 ext4_xattr_check_names(struct ext4_xattr_entry *entry, void *end) in ext4_xattr_check_names() argument
149 while (!IS_LAST_ENTRY(entry)) { in ext4_xattr_check_names()
150 struct ext4_xattr_entry *next = EXT4_XATTR_NEXT(entry); in ext4_xattr_check_names()
153 entry = next; in ext4_xattr_check_names()
171 ext4_xattr_check_entry(struct ext4_xattr_entry *entry, size_t size) in ext4_xattr_check_entry() argument
173 size_t value_size = le32_to_cpu(entry->e_value_size); in ext4_xattr_check_entry()
175 if (entry->e_value_block != 0 || value_size > size || in ext4_xattr_check_entry()
176 le16_to_cpu(entry->e_value_offs) + value_size > size) in ext4_xattr_check_entry()
185 struct ext4_xattr_entry *entry; in ext4_xattr_find_entry() local
[all …]
|
| /fs/omfs/ |
| D | file.c | 51 struct omfs_extent_entry *entry; in omfs_shrink_inode() local
87 entry = &oe->e_entry; in omfs_shrink_inode()
92 start = be64_to_cpu(entry->e_cluster); in omfs_shrink_inode()
93 count = be64_to_cpu(entry->e_blocks); in omfs_shrink_inode()
96 entry++; in omfs_shrink_inode()
136 struct omfs_extent_entry *entry = &oe->e_entry; in omfs_grow_extent() local
158 terminator = entry + extent_count - 1; in omfs_grow_extent()
160 entry = terminator-1; in omfs_grow_extent()
161 new_block = be64_to_cpu(entry->e_cluster) + in omfs_grow_extent()
162 be64_to_cpu(entry->e_blocks); in omfs_grow_extent()
[all …]
|
| /fs/ext2/ |
| D | xattr.c | 70 #define IS_LAST_ENTRY(entry) (*(__u32 *)(entry) == 0) argument
153 struct ext2_xattr_entry *entry; in ext2_xattr_get() local
189 entry = FIRST_ENTRY(bh); in ext2_xattr_get()
190 while (!IS_LAST_ENTRY(entry)) { in ext2_xattr_get()
192 EXT2_XATTR_NEXT(entry); in ext2_xattr_get()
195 if (name_index == entry->e_name_index && in ext2_xattr_get()
196 name_len == entry->e_name_len && in ext2_xattr_get()
197 memcmp(name, entry->e_name, name_len) == 0) in ext2_xattr_get()
199 entry = next; in ext2_xattr_get()
202 while (!IS_LAST_ENTRY(entry)) { in ext2_xattr_get()
[all …]
|
| /fs/nfs_common/ |
| D | nfsacl.c | 51 struct posix_acl_entry *entry = in xdr_nfsace_encode() local
54 *p++ = htonl(entry->e_tag | nfsacl_desc->typeflag); in xdr_nfsace_encode()
55 switch(entry->e_tag) { in xdr_nfsace_encode()
64 *p++ = htonl(entry->e_id); in xdr_nfsace_encode()
70 *p++ = htonl(entry->e_perm & S_IRWXO); in xdr_nfsace_encode()
131 struct posix_acl_entry *entry; in xdr_nfsace_decode() local
142 entry = &nfsacl_desc->acl->a_entries[nfsacl_desc->count++]; in xdr_nfsace_decode()
143 entry->e_tag = ntohl(*p++) & ~NFS_ACL_DEFAULT; in xdr_nfsace_decode()
144 entry->e_id = ntohl(*p++); in xdr_nfsace_decode()
145 entry->e_perm = ntohl(*p++); in xdr_nfsace_decode()
[all …]
|
| /fs/ext3/ |
| D | xattr.c | 67 #define IS_LAST_ENTRY(entry) (*(__u32 *)(entry) == 0) argument
154 ext3_xattr_check_names(struct ext3_xattr_entry *entry, void *end) in ext3_xattr_check_names() argument
156 while (!IS_LAST_ENTRY(entry)) { in ext3_xattr_check_names()
157 struct ext3_xattr_entry *next = EXT3_XATTR_NEXT(entry); in ext3_xattr_check_names()
160 entry = next; in ext3_xattr_check_names()
178 ext3_xattr_check_entry(struct ext3_xattr_entry *entry, size_t size) in ext3_xattr_check_entry() argument
180 size_t value_size = le32_to_cpu(entry->e_value_size); in ext3_xattr_check_entry()
182 if (entry->e_value_block != 0 || value_size > size || in ext3_xattr_check_entry()
183 le16_to_cpu(entry->e_value_offs) + value_size > size) in ext3_xattr_check_entry()
192 struct ext3_xattr_entry *entry; in ext3_xattr_find_entry() local
[all …]
|
| /fs/nfs/ |
| D | dir.c | 155 struct nfs_entry *entry; member
185 __func__, (long long)desc->entry->cookie, in nfs_readdir_filler()
191 error = NFS_PROTO(inode)->readdir(file->f_path.dentry, cred, desc->entry->cookie, page, in nfs_readdir_filler()
226 p = desc->decode(p, desc->entry, desc->plus); in dir_decode()
231 desc->entry->fattr->time_start = desc->timestamp; in dir_decode()
232 desc->entry->fattr->gencount = desc->gencount; in dir_decode()
234 desc->entry->fattr->valid &= ~NFS_ATTR_FATTR; in dir_decode()
258 struct nfs_entry *entry = desc->entry; in find_dirent() local
264 __func__, (unsigned long long)entry->cookie); in find_dirent()
265 if (entry->prev_cookie == *desc->dir_cookie) in find_dirent()
[all …]
|
| /fs/ |
| D | xattr_acl.c | 21 posix_acl_xattr_entry *entry = (posix_acl_xattr_entry *)(header+1), *end; in posix_acl_from_xattr() local
44 for (end = entry + count; entry != end; acl_e++, entry++) { in posix_acl_from_xattr()
45 acl_e->e_tag = le16_to_cpu(entry->e_tag); in posix_acl_from_xattr()
46 acl_e->e_perm = le16_to_cpu(entry->e_perm); in posix_acl_from_xattr()
58 acl_e->e_id = le32_to_cpu(entry->e_id); in posix_acl_from_xattr()
|
| D | select.c | 87 struct poll_table_entry * entry; member
92 ((unsigned long)((table)->entry+1) > PAGE_SIZE + (unsigned long)(table))
119 static void free_poll_entry(struct poll_table_entry *entry) in free_poll_entry() argument
121 remove_wait_queue(entry->wait_address, &entry->wait); in free_poll_entry()
122 fput(entry->filp); in free_poll_entry()
132 struct poll_table_entry * entry; in poll_freewait() local
135 entry = p->entry; in poll_freewait()
137 entry--; in poll_freewait()
138 free_poll_entry(entry); in poll_freewait()
139 } while (entry > p->entries); in poll_freewait()
[all …]
|
| /fs/hfsplus/ |
| D | catalog.c | 87 static int hfsplus_cat_build_record(hfsplus_cat_entry *entry, u32 cnid, struct inode *inode) in hfsplus_cat_build_record() argument
92 folder = &entry->folder; in hfsplus_cat_build_record()
109 file = &entry->file; in hfsplus_cat_build_record()
142 hfsplus_cat_entry *entry, int type, in hfsplus_fill_cat_thread() argument
145 entry->type = cpu_to_be16(type); in hfsplus_fill_cat_thread()
146 entry->thread.reserved = 0; in hfsplus_fill_cat_thread()
147 entry->thread.parentID = cpu_to_be32(parentid); in hfsplus_fill_cat_thread()
148 hfsplus_asc2uni(sb, &entry->thread.nodeName, str->name, str->len); in hfsplus_fill_cat_thread()
149 return 10 + be16_to_cpu(entry->thread.nodeName.length) * 2; in hfsplus_fill_cat_thread()
185 hfsplus_cat_entry entry; in hfsplus_create_cat() local
[all …]
|
| D | dir.c | 33 hfsplus_cat_entry entry; in hfsplus_lookup() local
45 err = hfs_brec_read(&fd, &entry, sizeof(entry)); in hfsplus_lookup()
55 type = be16_to_cpu(entry.type); in hfsplus_lookup()
61 cnid = be32_to_cpu(entry.folder.id); in hfsplus_lookup()
68 cnid = be32_to_cpu(entry.file.id); in hfsplus_lookup()
69 if (entry.file.user_info.fdType == cpu_to_be32(HFSP_HARDLINK_TYPE) && in hfsplus_lookup()
70 entry.file.user_info.fdCreator == cpu_to_be32(HFSP_HFSPLUS_CREATOR) && in hfsplus_lookup()
71 (entry.file.create_date == HFSPLUS_I(HFSPLUS_SB(sb).hidden_dir).create_date || in hfsplus_lookup()
72 entry.file.create_date == HFSPLUS_I(sb->s_root->d_inode).create_date) && in hfsplus_lookup()
86 linkid = be32_to_cpu(entry.file.permissions.dev); in hfsplus_lookup()
[all …]
|
| D | ioctl.c | 100 hfsplus_cat_entry entry; in hfsplus_setxattr() local
113 hfs_bnode_read(fd.bnode, &entry, fd.entryoffset, in hfsplus_setxattr()
115 file = &entry.file; in hfsplus_setxattr()
130 hfs_bnode_write(fd.bnode, &entry, fd.entryoffset, in hfsplus_setxattr()
142 hfsplus_cat_entry entry; in hfsplus_getxattr() local
156 hfs_bnode_read(fd.bnode, &entry, fd.entryoffset, in hfsplus_getxattr()
159 file = &entry.file; in hfsplus_getxattr()
|
| /fs/hfs/ |
| D | catalog.c | 86 union hfs_cat_rec entry; in hfs_cat_create() local
98 entry_size = hfs_cat_build_thread(sb, &entry, S_ISDIR(inode->i_mode) ? in hfs_cat_create()
107 err = hfs_brec_insert(&fd, &entry, entry_size); in hfs_cat_create()
112 entry_size = hfs_cat_build_record(&entry, cnid, inode); in hfs_cat_create()
120 err = hfs_brec_insert(&fd, &entry, entry_size); in hfs_cat_create()
277 union hfs_cat_rec entry; in hfs_cat_move() local
293 hfs_bnode_read(src_fd.bnode, &entry, src_fd.entryoffset, in hfs_cat_move()
305 err = hfs_brec_insert(&dst_fd, &entry, src_fd.entrylength); in hfs_cat_move()
324 type = entry.type; in hfs_cat_move()
325 if (type == HFS_CDR_FIL && !(entry.file.Flags & HFS_FIL_THD)) in hfs_cat_move()
[all …]
|
| /fs/udf/ |
| D | partition.c | 137 struct sparingEntry *entry = &st->mapEntry[i]; in udf_get_pblock_spar15() local
138 u32 origLoc = le32_to_cpu(entry->origLocation); in udf_get_pblock_spar15()
142 return le32_to_cpu(entry->mappedLocation) + in udf_get_pblock_spar15()
185 struct sparingEntry *entry = &st->mapEntry[k]; in udf_relocate_blocks() local
186 u32 origLoc = le32_to_cpu(entry->origLocation); in udf_relocate_blocks()
197 entry->origLocation = in udf_relocate_blocks()
207 entry->mappedLocation) + in udf_relocate_blocks()
214 entry->mappedLocation) + in udf_relocate_blocks()
224 struct sparingEntry *entry = &st->mapEntry[l]; in udf_relocate_blocks() local
225 u32 origLoc = le32_to_cpu(entry->origLocation); in udf_relocate_blocks()
|