| /fs/squashfs/ |
| D | cache.c | 74 for (i = cache->curr_blk, n = 0; n < cache->entries; n++) { in squashfs_cache_get()
79 i = (i + 1) % cache->entries; in squashfs_cache_get()
82 if (n == cache->entries) { in squashfs_cache_get()
102 for (n = 0; n < cache->entries; n++) { in squashfs_cache_get()
105 i = (i + 1) % cache->entries; in squashfs_cache_get()
108 cache->next_blk = (i + 1) % cache->entries; in squashfs_cache_get()
217 for (i = 0; i < cache->entries; i++) { in squashfs_cache_delete()
233 struct squashfs_cache *squashfs_cache_init(char *name, int entries, in squashfs_cache_init() argument
244 cache->entry = kcalloc(entries, sizeof(*(cache->entry)), GFP_KERNEL); in squashfs_cache_init()
252 cache->unused = entries; in squashfs_cache_init()
[all …]
|
| D | file.c | 155 meta->entries = 0; in empty_meta_index()
270 offset = index < meta->offset + meta->entries ? index : in fill_meta_index()
271 meta->offset + meta->entries - 1; in fill_meta_index()
279 meta->entries); in fill_meta_index()
290 for (i = meta->offset + meta->entries; i <= index && in fill_meta_index()
297 if (meta->entries == 0) in fill_meta_index()
313 meta->entries++; in fill_meta_index()
318 meta->offset, meta->entries); in fill_meta_index()
|
| D | squashfs_fs_sb.h | 30 int entries; member
|
| D | squashfs_fs.h | 235 unsigned short entries; member
|
| /fs/nfs_common/ |
| D | nfsacl.c | 94 int entries = (acl && acl->a_count) ? max_t(int, acl->a_count, 4) : 0; in nfsacl_encode() local
98 .array_len = encode_entries ? entries : 0, in nfsacl_encode()
109 if (entries > NFS_ACL_MAX_ENTRIES || in nfsacl_encode()
110 xdr_encode_word(buf, base, entries)) in nfsacl_encode()
273 u32 entries; in nfsacl_decode() local
276 if (xdr_decode_word(buf, base, &entries) || in nfsacl_decode()
277 entries > NFS_ACL_MAX_ENTRIES) in nfsacl_decode()
279 nfsacl_desc.desc.array_maxlen = entries; in nfsacl_decode()
284 if (entries != nfsacl_desc.desc.array_len || in nfsacl_decode()
292 *aclcnt = entries; in nfsacl_decode()
|
| /fs/ext4/ |
| D | namei.c | 213 struct dx_entry entries[0]; member
219 struct dx_entry entries[0]; member
226 struct dx_entry *entries; member
249 static unsigned dx_get_count(struct dx_entry *entries);
250 static unsigned dx_get_limit(struct dx_entry *entries);
251 static void dx_set_count(struct dx_entry *entries, unsigned value);
252 static void dx_set_limit(struct dx_entry *entries, unsigned value);
535 static inline unsigned dx_get_count(struct dx_entry *entries) in dx_get_count() argument
537 return le16_to_cpu(((struct dx_countlimit *) entries)->count); in dx_get_count()
540 static inline unsigned dx_get_limit(struct dx_entry *entries) in dx_get_limit() argument
[all …]
|
| /fs/reiserfs/ |
| D | item_ops.c | 537 int entries = 0; in direntry_check_left() local
546 entries++; in direntry_check_left()
549 if (entries == dir_u->entry_count) { in direntry_check_left()
557 && entries < 2) in direntry_check_left()
558 entries = 0; in direntry_check_left()
560 return entries ? : -1; in direntry_check_left()
566 int entries = 0; in direntry_check_right() local
575 entries++; in direntry_check_right()
577 BUG_ON(entries == dir_u->entry_count); in direntry_check_right()
581 && entries > dir_u->entry_count - 2) in direntry_check_right()
[all …]
|
| /fs/nfs/ |
| D | mount_clnt.c | 420 u32 entries, i; in decode_auth_flavors() local
429 entries = be32_to_cpup(p); in decode_auth_flavors()
430 dprintk("NFS: received %u auth flavors\n", entries); in decode_auth_flavors()
431 if (entries > NFS_MAX_SECFLAVORS) in decode_auth_flavors()
432 entries = NFS_MAX_SECFLAVORS; in decode_auth_flavors()
434 p = xdr_inline_decode(xdr, 4 * entries); in decode_auth_flavors()
438 if (entries > *count) in decode_auth_flavors()
439 entries = *count; in decode_auth_flavors()
441 for (i = 0; i < entries; i++) { in decode_auth_flavors()
|
| /fs/xfs/libxfs/ |
| D | xfs_da_format.h | 682 xfs_attr_leaf_entry_t entries[1]; /* sorted on key, not name */ member
714 struct xfs_attr_leaf_entry entries[1]; member
800 return &((struct xfs_attr3_leafblock *)leafp)->entries[0]; in xfs_attr3_leaf_entryp()
801 return &leafp->entries[0]; in xfs_attr3_leaf_entryp()
810 struct xfs_attr_leaf_entry *entries = xfs_attr3_leaf_entryp(leafp); in xfs_attr3_leaf_name() local
812 return &((char *)leafp)[be16_to_cpu(entries[idx].nameidx)]; in xfs_attr3_leaf_name()
|
| D | xfs_attr_leaf.c | 961 struct xfs_attr_leaf_entry *entries; in xfs_attr3_leaf_to_node() local
1007 entries = xfs_attr3_leaf_entryp(leaf); in xfs_attr3_leaf_to_node()
1010 btree[0].hashval = entries[icleafhdr.count - 1].hashval; in xfs_attr3_leaf_to_node()
2160 struct xfs_attr_leaf_entry *entries; in xfs_attr3_leaf_lookup_int() local
2171 entries = xfs_attr3_leaf_entryp(leaf); in xfs_attr3_leaf_lookup_int()
2179 for (entry = &entries[probe]; span > 4; entry = &entries[probe]) { in xfs_attr3_leaf_lookup_int()
2475 struct xfs_attr_leaf_entry *entries; in xfs_attr_leaf_lasthash() local
2479 entries = xfs_attr3_leaf_entryp(bp->b_addr); in xfs_attr_leaf_lasthash()
2484 return be32_to_cpu(entries[ichdr.count - 1].hashval); in xfs_attr_leaf_lasthash()
2494 struct xfs_attr_leaf_entry *entries; in xfs_attr_leaf_entsize() local
[all …]
|
| D | xfs_dir2_leaf.c | 1657 int entries; in xfs_dir3_leaf_size() local
1660 entries = hdr->count - hdr->stale; in xfs_dir3_leaf_size()
1667 return hdrsize + entries * sizeof(xfs_dir2_leaf_entry_t) in xfs_dir3_leaf_size()
|
| /fs/xfs/ |
| D | xfs_attr_list.c | 247 struct xfs_attr_leaf_entry *entries; in xfs_attr_node_list() local
262 entries = xfs_attr3_leaf_entryp(leaf); in xfs_attr_node_list()
264 entries[leafhdr.count - 1].hashval)) { in xfs_attr_node_list()
269 entries[0].hashval)) { in xfs_attr_node_list()
369 struct xfs_attr_leaf_entry *entries; in xfs_attr3_leaf_list_int() local
379 entries = xfs_attr3_leaf_entryp(leaf); in xfs_attr3_leaf_list_int()
388 entry = &entries[0]; in xfs_attr3_leaf_list_int()
407 entry = &entries[0]; in xfs_attr3_leaf_list_int()
|
| /fs/overlayfs/ |
| D | readdir.c | 34 struct list_head entries; member
185 ovl_cache_free(&cache->entries); in ovl_cache_put()
315 list_for_each(p, &od->cache->entries) { in ovl_seek_cursor()
341 INIT_LIST_HEAD(&cache->entries); in ovl_cache_get()
343 res = ovl_dir_read_merged(dentry, &cache->entries); in ovl_cache_get()
345 ovl_cache_free(&cache->entries); in ovl_cache_get()
379 while (od->cursor != &od->cache->entries) { in ovl_iterate()
|
| /fs/nfsd/ |
| D | nfscache.c | 349 unsigned int entries = 0; in nfsd_cache_search() local
352 ++entries; in nfsd_cache_search()
360 if (entries > longest_chain) { in nfsd_cache_search()
361 longest_chain = entries; in nfsd_cache_search()
363 } else if (entries == longest_chain) { in nfsd_cache_search()
|
| D | acl.h | 50 int nfs4_acl_bytes(int entries);
|
| D | nfs4acl.c | 827 int nfs4_acl_bytes(int entries) in nfs4_acl_bytes() argument
829 return sizeof(struct nfs4_acl) + entries * sizeof(struct nfs4_ace); in nfs4_acl_bytes()
|
| /fs/gfs2/ |
| D | dir.c | 1230 const struct gfs2_dirent **darr, u32 entries, in do_filldir_main() argument
1238 sort(darr, entries, sizeof(struct gfs2_dirent *), compare_dents, NULL); in do_filldir_main()
1244 for (x = 0, y = 1; x < entries; x++, y++) { in do_filldir_main()
1248 if (y < entries) { in do_filldir_main()
1306 unsigned entries = 0, entries2 = 0; in gfs2_dir_read_leaf() local
1322 entries += be16_to_cpu(lf->lf_entries); in gfs2_dir_read_leaf()
1328 if (!entries) in gfs2_dir_read_leaf()
1338 larr = gfs2_alloc_sort_buffer((leaves + entries + 99) * sizeof(void *)); in gfs2_dir_read_leaf()
1376 BUG_ON(entries2 != entries); in gfs2_dir_read_leaf()
1377 error = do_filldir_main(ip, ctx, darr, entries, copied); in gfs2_dir_read_leaf()
[all …]
|
| /fs/ |
| D | select.c | 99 struct poll_table_entry entries[0]; member
151 } while (entry > p->entries); in poll_freewait()
174 new_table->entry = new_table->entries; in poll_get_entry()
746 struct pollfd entries[0]; member
815 pfd = walk->entries; in do_poll()
901 if (copy_from_user(walk->entries, ufds + nfds-todo, in do_sys_poll()
923 struct pollfd *fds = walk->entries; in do_sys_poll()
|
| D | binfmt_misc.c | 39 static LIST_HEAD(entries);
90 list_for_each(l, &entries) { in check_file()
713 list_add(&e->list, &entries); in bm_register_write()
765 while (!list_empty(&entries)) in bm_status_write()
766 kill_node(list_entry(entries.next, Node, list)); in bm_status_write()
|
| /fs/cramfs/ |
| D | README | 6 swapped around (though it does care that directory entries (inodes) in
27 a directory's entries before recursing down its subdirectories: the
32 Beginning in 2.4.7, directory entries are sorted. This optimization
|
| /fs/btrfs/ |
| D | free-space-cache.c | 916 int *entries, int *bitmaps, in write_cache_extent_entries() argument
944 *entries += 1; in write_cache_extent_entries()
979 *entries += 1; in write_cache_extent_entries()
994 int entries, int bitmaps) in update_cache_item() argument
1032 btrfs_set_free_space_entries(leaf, header, entries); in update_cache_item()
1048 int *entries) in write_pinned_extent_entries() argument
1085 *entries += 1; in write_pinned_extent_entries()
1175 io_ctl->entries, io_ctl->bitmaps); in btrfs_wait_cache_io()
1240 int entries = 0; in __btrfs_write_out_cache() local
1282 block_group, &entries, &bitmaps, in __btrfs_write_out_cache()
[all …]
|
| /fs/proc/ |
| D | base.c | 145 static unsigned int pid_entry_count_dirs(const struct pid_entry *entries, in pid_entry_count_dirs() argument
153 if (S_ISDIR(entries[i].mode)) in pid_entry_count_dirs()
471 unsigned long *entries; in proc_pid_stack() local
489 entries = kmalloc(MAX_STACK_TRACE_DEPTH * sizeof(*entries), GFP_KERNEL); in proc_pid_stack()
490 if (!entries) in proc_pid_stack()
495 trace.entries = entries; in proc_pid_stack()
504 (void *)entries[i], (void *)entries[i]); in proc_pid_stack()
508 kfree(entries); in proc_pid_stack()
|
| D | Kconfig | 56 modifiable sysctl entries will be generated beneath the
|
| /fs/f2fs/ |
| D | segment.c | 1604 int entries = SIT_VBLOCK_MAP_SIZE / sizeof(unsigned long); in add_discard_addrs() local
1628 for (i = 0; i < entries; i++) in add_discard_addrs()
2071 memcpy(dst->entries, src->entries, SUM_ENTRY_SIZE); in write_current_sum_page()
2250 int entries = SIT_VBLOCK_MAP_SIZE / sizeof(unsigned long); in __next_free_blkoff() local
2256 for (i = 0; i < entries; i++) in __next_free_blkoff()
3087 seg_i->sum_blk->entries[j] = *s; in read_compacted_summaries()
3140 struct f2fs_summary *ns = &sum->entries[0]; in read_normal_summaries()
3160 memcpy(curseg->sum_blk->entries, sum->entries, SUM_ENTRY_SIZE); in read_normal_summaries()
3246 *summary = seg_i->sum_blk->entries[j]; in write_compacted_summaries()
3501 &raw_sit->entries[sit_offset]); in flush_sit_entries()
[all …]
|
| D | recovery.c | 353 sum = curseg->sum_blk->entries[blkoff]; in check_index_in_prev_nodes()
360 sum = sum_node->entries[blkoff]; in check_index_in_prev_nodes()
|