/fs/ext3/ |
D | namei.c | 124 struct dx_entry entries[0]; member 130 struct dx_entry entries[0]; member 137 struct dx_entry *entries; member 152 static unsigned dx_get_count (struct dx_entry *entries); 153 static unsigned dx_get_limit (struct dx_entry *entries); 154 static void dx_set_count (struct dx_entry *entries, unsigned value); 155 static void dx_set_limit (struct dx_entry *entries, unsigned value); 216 static inline unsigned dx_get_count (struct dx_entry *entries) in dx_get_count() argument 218 return le16_to_cpu(((struct dx_countlimit *) entries)->count); in dx_get_count() 221 static inline unsigned dx_get_limit (struct dx_entry *entries) in dx_get_limit() argument [all …]
|
/fs/ext4/ |
D | namei.c | 124 struct dx_entry entries[0]; member 130 struct dx_entry entries[0]; member 137 struct dx_entry *entries; member 152 static unsigned dx_get_count(struct dx_entry *entries); 153 static unsigned dx_get_limit(struct dx_entry *entries); 154 static void dx_set_count(struct dx_entry *entries, unsigned value); 155 static void dx_set_limit(struct dx_entry *entries, unsigned value); 218 static inline unsigned dx_get_count(struct dx_entry *entries) in dx_get_count() argument 220 return le16_to_cpu(((struct dx_countlimit *) entries)->count); in dx_get_count() 223 static inline unsigned dx_get_limit(struct dx_entry *entries) in dx_get_limit() argument [all …]
|
/fs/squashfs/ |
D | cache.c | 75 for (i = 0; i < cache->entries; i++) in squashfs_cache_get() 79 if (i == cache->entries) { in squashfs_cache_get() 99 for (n = 0; n < cache->entries; n++) { in squashfs_cache_get() 102 i = (i + 1) % cache->entries; in squashfs_cache_get() 105 cache->next_blk = (i + 1) % cache->entries; in squashfs_cache_get() 215 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() 251 cache->unused = entries; in squashfs_cache_init() 252 cache->entries = entries; in squashfs_cache_init() [all …]
|
D | file.c | 152 meta->entries = 0; in empty_meta_index() 263 offset = index < meta->offset + meta->entries ? index : in fill_meta_index() 264 meta->offset + meta->entries - 1; in fill_meta_index() 272 meta->entries); in fill_meta_index() 283 for (i = meta->offset + meta->entries; i <= index && in fill_meta_index() 290 if (meta->entries == 0) in fill_meta_index() 306 meta->entries++; in fill_meta_index() 311 meta->offset, meta->entries); in fill_meta_index()
|
D | squashfs_fs_sb.h | 30 int entries; member
|
D | squashfs_fs.h | 203 unsigned short entries; member
|
/fs/nfs_common/ |
D | nfsacl.c | 78 int entries = (acl && acl->a_count) ? max_t(int, acl->a_count, 4) : 0; in nfsacl_encode() local 82 .array_len = encode_entries ? entries : 0, in nfsacl_encode() 93 if (entries > NFS_ACL_MAX_ENTRIES || in nfsacl_encode() 94 xdr_encode_word(buf, base, entries)) in nfsacl_encode() 236 u32 entries; in nfsacl_decode() local 239 if (xdr_decode_word(buf, base, &entries) || in nfsacl_decode() 240 entries > NFS_ACL_MAX_ENTRIES) in nfsacl_decode() 242 nfsacl_desc.desc.array_maxlen = entries; in nfsacl_decode() 247 if (entries != nfsacl_desc.desc.array_len || in nfsacl_decode() 255 *aclcnt = entries; in nfsacl_decode()
|
/fs/xfs/support/ |
D | ktrace.c | 59 int entries; in ktrace_alloc() local 76 entries = roundup_pow_of_two(nentries); in ktrace_alloc() 77 if (entries == ktrace_zentries) { in ktrace_alloc() 81 ktep = (ktrace_entry_t*)kmem_zalloc((entries * sizeof(*ktep)), in ktrace_alloc() 98 ktp->kt_nentries = entries; in ktrace_alloc() 99 ASSERT(is_power_of_2(entries)); in ktrace_alloc() 100 ktp->kt_index_mask = entries - 1; in ktrace_alloc()
|
/fs/reiserfs/ |
D | item_ops.c | 536 int entries = 0; in direntry_check_left() local 545 entries++; in direntry_check_left() 548 if (entries == dir_u->entry_count) { in direntry_check_left() 555 && entries < 2) in direntry_check_left() 556 entries = 0; in direntry_check_left() 558 return entries ? : -1; in direntry_check_left() 564 int entries = 0; in direntry_check_right() local 573 entries++; in direntry_check_right() 575 BUG_ON(entries == dir_u->entry_count); in direntry_check_right() 579 && entries > dir_u->entry_count - 2) in direntry_check_right() [all …]
|
/fs/proc/ |
D | inode-alloc.txt | 4 00000001-00000fff static entries (goners) 8 0001xxxx-7fffxxxx pid-dir entries for pid 1-7fff 10 f0000000-ffffffff dynamic entries
|
D | base.c | 140 static unsigned int pid_entry_count_dirs(const struct pid_entry *entries, in pid_entry_count_dirs() argument 148 if (S_ISDIR(entries[i].mode)) in pid_entry_count_dirs() 356 unsigned long *entries; in proc_pid_stack() local 359 entries = kmalloc(MAX_STACK_TRACE_DEPTH * sizeof(*entries), GFP_KERNEL); in proc_pid_stack() 360 if (!entries) in proc_pid_stack() 365 trace.entries = entries; in proc_pid_stack() 371 (void *)entries[i], (void *)entries[i]); in proc_pid_stack() 373 kfree(entries); in proc_pid_stack()
|
D | Kconfig | 52 modifiable sysctl entries will be generated beneath the
|
/fs/xfs/ |
D | xfs_attr_leaf.h | 113 xfs_attr_leaf_entry_t entries[1]; /* sorted on key, not name */ member 158 &((char *)leafp)[be16_to_cpu(leafp->entries[idx].nameidx)]; in xfs_attr_leaf_name_remote() 165 &((char *)leafp)[be16_to_cpu(leafp->entries[idx].nameidx)]; in xfs_attr_leaf_name_local() 170 return &((char *)leafp)[be16_to_cpu(leafp->entries[idx].nameidx)]; in xfs_attr_leaf_name()
|
D | xfs_attr_leaf.c | 732 entry = &leaf->entries[0]; in xfs_attr_shortform_allfit() 819 entry = &leaf->entries[0]; in xfs_attr_leaf_to_shortform() 887 leaf->entries[be16_to_cpu(leaf->hdr.count)-1 ].hashval; in xfs_attr_leaf_to_node() 1090 entry = &leaf->entries[args->index]; in xfs_attr_leaf_add_work() 1371 leaf1->entries[be16_to_cpu(leaf1->hdr.count)-1].hashval); in xfs_attr_leaf_rebalance() 1373 leaf2->entries[be16_to_cpu(leaf2->hdr.count)-1].hashval); in xfs_attr_leaf_rebalance() 1454 entry = &leaf1->entries[0]; in xfs_attr_leaf_figure_balance() 1479 entry = &leaf1->entries[0]; in xfs_attr_leaf_figure_balance() 1671 entry = &leaf->entries[args->index]; in xfs_attr_leaf_remove() 1764 entry = &leaf->entries[be16_to_cpu(hdr->count)]; in xfs_attr_leaf_remove() [all …]
|
D | xfs_attr.c | 1857 if (cursor->hashval > be32_to_cpu(leaf->entries[ in xfs_attr_node_list() 1864 be32_to_cpu(leaf->entries[0].hashval)) { in xfs_attr_node_list() 2316 (__psunsigned_t)be32_to_cpu(leaf->entries[0].hashval), in xfs_attr_trace_l_cl() 2317 (__psunsigned_t)be32_to_cpu(leaf->entries[ in xfs_attr_trace_l_cl()
|
/fs/ |
D | select.c | 88 struct poll_table_entry entries[0]; member 139 } while (entry > p->entries); in poll_freewait() 162 new_table->entry = new_table->entries; in poll_get_entry() 661 struct pollfd entries[0]; member 723 pfd = walk->entries; in do_poll() 794 if (copy_from_user(walk->entries, ufds + nfds-todo, in do_sys_poll() 816 struct pollfd *fds = walk->entries; in do_sys_poll()
|
D | binfmt_misc.c | 38 static LIST_HEAD(entries); 73 list_for_each(l, &entries) { in check_file() 626 list_add(&e->list, &entries); in bm_register_write() 669 while (!list_empty(&entries)) in bm_status_write() 670 kill_node(list_entry(entries.next, Node, list)); in bm_status_write()
|
D | compat_ioctl.c | 1161 compat_caddr_t entries; member 1175 if (tmp.entries) in do_unimap_ioctl() 1176 if (!access_ok(VERIFY_WRITE, compat_ptr(tmp.entries), in do_unimap_ioctl() 1185 compat_ptr(tmp.entries)); in do_unimap_ioctl() 1190 compat_ptr(tmp.entries)); in do_unimap_ioctl()
|
/fs/gfs2/ |
D | dir.c | 1201 const struct gfs2_dirent **darr, u32 entries, in do_filldir_main() argument 1210 sort(darr, entries, sizeof(struct gfs2_dirent *), compare_dents, NULL); in do_filldir_main() 1216 for (x = 0, y = 1; x < entries; x++, y++) { in do_filldir_main() 1220 if (y < entries) { in do_filldir_main() 1268 unsigned entries = 0, entries2 = 0; in gfs2_dir_read_leaf() local 1284 entries += be16_to_cpu(lf->lf_entries); in gfs2_dir_read_leaf() 1290 if (!entries) in gfs2_dir_read_leaf() 1300 larr = vmalloc((leaves + entries + 99) * sizeof(void *)); in gfs2_dir_read_leaf() 1338 BUG_ON(entries2 != entries); in gfs2_dir_read_leaf() 1340 entries, copied); in gfs2_dir_read_leaf() [all …]
|
/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/ocfs2/ |
D | xattr.c | 3524 char *entries, *buf, *bucket_buf = NULL; in ocfs2_defrag_xattr_bucket() local 3554 entries = (char *)xh->xh_entries; in ocfs2_defrag_xattr_bucket() 3567 sort(entries, le16_to_cpu(xh->xh_count), in ocfs2_defrag_xattr_bucket() 3614 sort(entries, le16_to_cpu(xh->xh_count), in ocfs2_defrag_xattr_bucket() 3722 struct ocfs2_xattr_entry *entries = xh->xh_entries; in ocfs2_xattr_find_divide_pos() local 3734 if (cmp_xe(&entries[middle - delta - 1], in ocfs2_xattr_find_divide_pos() 3735 &entries[middle - delta])) in ocfs2_xattr_find_divide_pos() 3743 if (cmp_xe(&entries[middle + delta], in ocfs2_xattr_find_divide_pos() 3744 &entries[middle + delta + 1])) in ocfs2_xattr_find_divide_pos()
|
/fs/befs/ |
D | ChangeLog | 386 * Cleaned up the fs/Config.in entries a bit, now slightly more descriptive. 391 * Added Configure.help entries for CONFIG_BEFS_FS and CONFIG_DEBUG_BEFS
|
/fs/smbfs/ |
D | proc.c | 1947 int i, first, entries_seen, entries; in smb_proc_readdir_short() local 1969 entries = 0; in smb_proc_readdir_short() 2066 result = entries; in smb_proc_readdir_short()
|
/fs/ntfs/ |
D | ChangeLog | 116 its directory entries and we do not support directory operations at 724 rescan the volume on boot and update all quota entries. 1242 - Change ntfs_lookup() to only create dcache entries for the correctly 1634 - Hide DOS only name space directory entries from readdir() but allow 1636 support directory hard links, while still allowing access to entries 1689 you to list directories, use stat on directory entries and the file
|
/fs/cifs/ |
D | README | 117 allow adding entries to a file to the /etc/permissions file to achieve the 603 debugging entries. The maximum value it can be set
|