Home
last modified time | relevance | path

Searched refs:entries (Results 1 – 25 of 51) sorted by relevance

123

/fs/nfs_common/
Dnfsacl.c95 int entries = (acl && acl->a_count) ? max_t(int, acl->a_count, 4) : 0; in nfsacl_encode() local
99 .array_len = encode_entries ? entries : 0, in nfsacl_encode()
110 if (entries > NFS_ACL_MAX_ENTRIES || in nfsacl_encode()
111 xdr_encode_word(buf, base, entries)) in nfsacl_encode()
157 u32 entries = (acl && acl->a_count) ? max_t(int, acl->a_count, 4) : 0; in nfs_stream_encode_acl() local
161 .array_len = encode_entries ? entries : 0, in nfs_stream_encode_acl()
173 if (entries > NFS_ACL_MAX_ENTRIES) in nfs_stream_encode_acl()
175 if (xdr_stream_encode_u32(xdr, entries) < 0) in nfs_stream_encode_acl()
345 u32 entries; in nfsacl_decode() local
348 if (xdr_decode_word(buf, base, &entries) || in nfsacl_decode()
[all …]
/fs/squashfs/
Dcache.c61 for (i = cache->curr_blk, n = 0; n < cache->entries; n++) { in squashfs_cache_get()
66 i = (i + 1) % cache->entries; in squashfs_cache_get()
69 if (n == cache->entries) { in squashfs_cache_get()
89 for (n = 0; n < cache->entries; n++) { in squashfs_cache_get()
92 i = (i + 1) % cache->entries; in squashfs_cache_get()
95 cache->next_blk = (i + 1) % cache->entries; in squashfs_cache_get()
204 for (i = 0; i < cache->entries; i++) { in squashfs_cache_delete()
223 struct squashfs_cache *squashfs_cache_init(char *name, int entries, in squashfs_cache_init() argument
234 cache->entry = kcalloc(entries, sizeof(*(cache->entry)), GFP_KERNEL); in squashfs_cache_init()
242 cache->unused = entries; in squashfs_cache_init()
[all …]
Dfile.c139 meta->entries = 0; in empty_meta_index()
254 offset = index < meta->offset + meta->entries ? index : in fill_meta_index()
255 meta->offset + meta->entries - 1; in fill_meta_index()
263 meta->entries); in fill_meta_index()
274 for (i = meta->offset + meta->entries; i <= index && in fill_meta_index()
281 if (meta->entries == 0) in fill_meta_index()
297 meta->entries++; in fill_meta_index()
302 meta->offset, meta->entries); in fill_meta_index()
Dsquashfs_fs_sb.h17 int entries; member
/fs/ext4/
Dnamei.c261 struct dx_entry entries[]; member
267 struct dx_entry entries[]; member
274 struct dx_entry *entries; member
297 static unsigned dx_get_count(struct dx_entry *entries);
298 static unsigned dx_get_limit(struct dx_entry *entries);
299 static void dx_set_count(struct dx_entry *entries, unsigned value);
300 static void dx_set_limit(struct dx_entry *entries, unsigned value);
588 static inline unsigned dx_get_count(struct dx_entry *entries) in dx_get_count() argument
590 return le16_to_cpu(((struct dx_countlimit *) entries)->count); in dx_get_count()
593 static inline unsigned dx_get_limit(struct dx_entry *entries) in dx_get_limit() argument
[all …]
/fs/reiserfs/
Ditem_ops.c529 int entries = 0; in direntry_check_left() local
538 entries++; in direntry_check_left()
541 if (entries == dir_u->entry_count) { in direntry_check_left()
549 && entries < 2) in direntry_check_left()
550 entries = 0; in direntry_check_left()
552 return entries ? : -1; in direntry_check_left()
558 int entries = 0; in direntry_check_right() local
567 entries++; in direntry_check_right()
569 BUG_ON(entries == dir_u->entry_count); in direntry_check_right()
573 && entries > dir_u->entry_count - 2) in direntry_check_right()
[all …]
/fs/nfs/
Dmount_clnt.c427 u32 entries, i; in decode_auth_flavors() local
436 entries = be32_to_cpup(p); in decode_auth_flavors()
437 dprintk("NFS: received %u auth flavors\n", entries); in decode_auth_flavors()
438 if (entries > NFS_MAX_SECFLAVORS) in decode_auth_flavors()
439 entries = NFS_MAX_SECFLAVORS; in decode_auth_flavors()
441 p = xdr_inline_decode(xdr, 4 * entries); in decode_auth_flavors()
445 if (entries > *count) in decode_auth_flavors()
446 entries = *count; in decode_auth_flavors()
448 for (i = 0; i < entries; i++) { in decode_auth_flavors()
/fs/smb/client/
Dcached_dir.c26 list_for_each_entry(cfid, &cfids->entries, entry) { in find_or_create_cached_dir()
57 list_add(&cfid->entry, &cfids->entries); in find_or_create_cached_dir()
354 list_for_each_entry(cfid, &cfids->entries, entry) { in open_cached_dir_by_dentry()
439 list_for_each_entry(cfid, &cfids->entries, entry) { in close_all_cached_dirs()
457 list_for_each_entry_safe(cfid, q, &cfids->entries, entry) { in invalidate_all_cached_dirs()
506 list_for_each_entry(cfid, &cfids->entries, entry) { in cached_dir_lease_break()
545 INIT_LIST_HEAD(&cfid->dirents.entries); in init_cached_dir()
562 list_for_each_entry_safe(dirent, q, &cfid->dirents.entries, entry) { in free_cached_dir()
581 INIT_LIST_HEAD(&cfids->entries); in init_cached_dirs()
595 list_for_each_entry_safe(cfid, q, &cfids->entries, entry) { in free_cached_dirs()
Dcached_dir.h30 struct list_head entries; member
59 struct list_head entries; member
/fs/xfs/
Dxfs_attr_list.c311 struct xfs_attr_leaf_entry *entries; in xfs_attr_node_list() local
326 entries = xfs_attr3_leaf_entryp(leaf); in xfs_attr_node_list()
328 entries[leafhdr.count - 1].hashval)) { in xfs_attr_node_list()
333 entries[0].hashval)) { in xfs_attr_node_list()
394 struct xfs_attr_leaf_entry *entries; in xfs_attr3_leaf_list_int() local
403 entries = xfs_attr3_leaf_entryp(leaf); in xfs_attr3_leaf_list_int()
411 entry = &entries[0]; in xfs_attr3_leaf_list_int()
430 entry = &entries[0]; in xfs_attr3_leaf_list_int()
/fs/xfs/libxfs/
Dxfs_da_format.h635 xfs_attr_leaf_entry_t entries[1]; /* sorted on key, not name */ member
667 struct xfs_attr_leaf_entry entries[1]; member
716 return &((struct xfs_attr3_leafblock *)leafp)->entries[0]; in xfs_attr3_leaf_entryp()
717 return &leafp->entries[0]; in xfs_attr3_leaf_entryp()
726 struct xfs_attr_leaf_entry *entries = xfs_attr3_leaf_entryp(leafp); in xfs_attr3_leaf_name() local
728 return &((char *)leafp)[be16_to_cpu(entries[idx].nameidx)]; in xfs_attr3_leaf_name()
Dxfs_attr_leaf.c316 struct xfs_attr_leaf_entry *entries; in xfs_attr3_leaf_verify() local
340 entries = xfs_attr3_leaf_entryp(bp->b_addr); in xfs_attr3_leaf_verify()
341 if ((char *)&entries[ichdr.count] > in xfs_attr3_leaf_verify()
353 for (i = 0, ent = entries; i < ichdr.count; ent++, i++) { in xfs_attr3_leaf_verify()
1219 struct xfs_attr_leaf_entry *entries; in xfs_attr3_leaf_to_node() local
1268 entries = xfs_attr3_leaf_entryp(leaf); in xfs_attr3_leaf_to_node()
1271 icnodehdr.btree[0].hashval = entries[icleafhdr.count - 1].hashval; in xfs_attr3_leaf_to_node()
2416 struct xfs_attr_leaf_entry *entries; in xfs_attr3_leaf_lookup_int() local
2427 entries = xfs_attr3_leaf_entryp(leaf); in xfs_attr3_leaf_lookup_int()
2438 for (entry = &entries[probe]; span > 4; entry = &entries[probe]) { in xfs_attr3_leaf_lookup_int()
[all …]
/fs/smb/server/
Dndr.c315 ret = ndr_write_int16(n, acl->entries[i].type); in ndr_encode_posix_acl_entry()
319 ret = ndr_write_int16(n, acl->entries[i].type); in ndr_encode_posix_acl_entry()
323 if (acl->entries[i].type == SMB_ACL_USER) { in ndr_encode_posix_acl_entry()
325 ret = ndr_write_int64(n, acl->entries[i].uid); in ndr_encode_posix_acl_entry()
326 } else if (acl->entries[i].type == SMB_ACL_GROUP) { in ndr_encode_posix_acl_entry()
328 ret = ndr_write_int64(n, acl->entries[i].gid); in ndr_encode_posix_acl_entry()
334 ret = ndr_write_int32(n, acl->entries[i].perm); in ndr_encode_posix_acl_entry()
Dxattr.h79 struct xattr_acl_entry entries[]; member
/fs/gfs2/
Ddir.c1264 struct gfs2_dirent **darr, u32 entries, in do_filldir_main() argument
1272 if (sort_start < entries) in do_filldir_main()
1273 sort(&darr[sort_start], entries - sort_start, in do_filldir_main()
1279 for (x = 0, y = 1; x < entries; x++, y++) { in do_filldir_main()
1283 if (y < entries) { in do_filldir_main()
1335 unsigned entries) in gfs2_set_cookies() argument
1340 for (i = 0; i < entries; i++) { in gfs2_set_cookies()
1374 unsigned entries = 0, entries2 = 0; in gfs2_dir_read_leaf() local
1389 entries += be16_to_cpu(lf->lf_entries); in gfs2_dir_read_leaf()
1400 if (!entries) in gfs2_dir_read_leaf()
[all …]
/fs/overlayfs/
Dreaddir.c34 struct list_head entries; member
233 ovl_cache_free(&cache->entries); in ovl_dir_cache_free()
248 ovl_cache_free(&cache->entries); in ovl_cache_put()
384 list_for_each(p, &od->cache->entries) { in ovl_seek_cursor()
411 INIT_LIST_HEAD(&cache->entries); in ovl_cache_get()
414 res = ovl_dir_read_merged(dentry, &cache->entries, &cache->root); in ovl_cache_get()
416 ovl_cache_free(&cache->entries); in ovl_cache_get()
614 res = ovl_dir_read_impure(path, &cache->entries, &cache->root); in ovl_cache_get_impure()
616 ovl_cache_free(&cache->entries); in ovl_cache_get_impure()
620 if (list_empty(&cache->entries)) { in ovl_cache_get_impure()
[all …]
/fs/xfs/scrub/
Dagheader.c614 xfs_agblock_t *entries; member
645 sai->entries[sai->nr_entries++] = agbno; in xchk_agfl_block()
728 sai.entries = kmem_zalloc(sizeof(xfs_agblock_t) * agflcount, in xchk_agfl()
730 if (!sai.entries) { in xchk_agfl()
751 sort(sai.entries, sai.nr_entries, sizeof(sai.entries[0]), in xchk_agfl()
754 if (sai.entries[i] == sai.entries[i - 1]) { in xchk_agfl()
761 kmem_free(sai.entries); in xchk_agfl()
Dattr.c313 struct xfs_attr_leaf_entry *entries; in xchk_xattr_block() local
366 entries = xfs_attr3_leaf_entryp(leaf); in xchk_xattr_block()
367 if ((char *)&entries[leafhdr.count] > (char *)leaf + leafhdr.firstused) in xchk_xattr_block()
371 for (i = 0, ent = entries; i < leafhdr.count; ent++, i++) { in xchk_xattr_block()
/fs/vboxsf/
Dutils.c493 b->entries = 0; in vboxsf_dir_buf_alloc()
538 u32 entries, size; in vboxsf_dir_read_all() local
554 &size, buf, &entries); in vboxsf_dir_read_all()
558 b->entries += entries; in vboxsf_dir_read_all()
/fs/nfsd/
Dnfscache.c392 unsigned int entries = 0; in nfsd_cache_insert() local
396 ++entries; in nfsd_cache_insert()
414 if (entries > nn->longest_chain) { in nfsd_cache_insert()
415 nn->longest_chain = entries; in nfsd_cache_insert()
417 } else if (entries == nn->longest_chain) { in nfsd_cache_insert()
Dacl.h44 int nfs4_acl_bytes(int entries);
/fs/
Dbinfmt_misc.c43 static LIST_HEAD(entries);
96 list_for_each(l, &entries) { in check_file()
699 list_add(&e->list, &entries); in bm_register_write()
752 while (!list_empty(&entries)) in bm_status_write()
753 kill_node(list_first_entry(&entries, Node, list)); in bm_status_write()
Dselect.c101 struct poll_table_entry entries[]; member
153 } while (entry > p->entries); in poll_freewait()
176 new_table->entry = new_table->entries; in poll_get_entry()
844 struct pollfd entries[]; member
912 pfd = walk->entries; in do_poll()
998 if (copy_from_user(walk->entries, ufds + nfds-todo, in do_sys_poll()
1007 walk = walk->next = kmalloc(struct_size(walk, entries, len), in do_sys_poll()
1023 struct pollfd *fds = walk->entries; in do_sys_poll()
/fs/incfs/
Dformat.c574 struct incfs_blockmap_entry *entries, in incfs_read_blockmap_entries() argument
584 if (!bfc || !entries) in incfs_read_blockmap_entries()
590 result = incfs_kread(bfc, entries, bytes_to_read, bm_entry_off); in incfs_read_blockmap_entries()
593 return result / sizeof(*entries); in incfs_read_blockmap_entries()
/fs/cramfs/
DREADME6 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

123