| /fs/ |
| D | binfmt_misc.c | 95 Node *e = list_entry(l, Node, list); in check_file() local
100 if (!test_bit(Enabled, &e->flags)) in check_file()
104 if (!test_bit(Magic, &e->flags)) { in check_file()
105 if (p && !strcmp(e->magic, p + 1)) in check_file()
106 return e; in check_file()
111 s = bprm->buf + e->offset; in check_file()
112 if (e->mask) { in check_file()
113 for (j = 0; j < e->size; j++) in check_file()
114 if ((*s++ ^ e->magic[j]) & e->mask[j]) in check_file()
117 for (j = 0; j < e->size; j++) in check_file()
[all …]
|
| /fs/dlm/ |
| D | requestqueue.c | 36 struct rq_entry *e; in dlm_add_requestqueue() local
39 e = kmalloc(sizeof(struct rq_entry) + length, GFP_NOFS); in dlm_add_requestqueue()
40 if (!e) { in dlm_add_requestqueue()
45 e->recover_seq = ls->ls_recover_seq & 0xFFFFFFFF; in dlm_add_requestqueue()
46 e->nodeid = nodeid; in dlm_add_requestqueue()
47 memcpy(&e->request, ms, ms->m_header.h_length); in dlm_add_requestqueue()
50 list_add_tail(&e->list, &ls->ls_requestqueue); in dlm_add_requestqueue()
67 struct rq_entry *e; in dlm_process_requestqueue() local
79 e = list_entry(ls->ls_requestqueue.next, struct rq_entry, list); in dlm_process_requestqueue()
82 ms = &e->request; in dlm_process_requestqueue()
[all …]
|
| D | lowcomms.c | 962 static void free_entry(struct writequeue_entry *e) in free_entry() argument
964 __free_page(e->page); in free_entry()
965 kfree(e); in free_entry()
975 static void writequeue_entry_complete(struct writequeue_entry *e, int completed) in writequeue_entry_complete() argument
977 e->offset += completed; in writequeue_entry_complete()
978 e->len -= completed; in writequeue_entry_complete()
980 if (e->len == 0 && e->users == 0) { in writequeue_entry_complete()
981 list_del(&e->list); in writequeue_entry_complete()
982 free_entry(e); in writequeue_entry_complete()
1408 struct writequeue_entry *e; in dlm_lowcomms_get_buffer() local
[all …]
|
| /fs/ubifs/ |
| D | recovery.c | 1262 struct size_entry *e; in add_ino() local
1266 e = rb_entry(parent, struct size_entry, rb); in add_ino()
1267 if (inum < e->inum) in add_ino()
1273 e = kzalloc(sizeof(struct size_entry), GFP_KERNEL); in add_ino()
1274 if (!e) in add_ino()
1277 e->inum = inum; in add_ino()
1278 e->i_size = i_size; in add_ino()
1279 e->d_size = d_size; in add_ino()
1280 e->exists = exists; in add_ino()
1282 rb_link_node(&e->rb, parent, p); in add_ino()
[all …]
|
| /fs/hfs/ |
| D | bfind.c | 47 int b, e; in __hfs_brec_find() local
51 e = bnode->num_recs - 1; in __hfs_brec_find()
54 rec = (e + b) / 2; in __hfs_brec_find()
64 e = rec; in __hfs_brec_find()
71 e = rec - 1; in __hfs_brec_find()
72 } while (b <= e); in __hfs_brec_find()
73 if (rec != e && e >= 0) { in __hfs_brec_find()
74 len = hfs_brec_lenoff(bnode, e, &off); in __hfs_brec_find()
75 keylen = hfs_brec_keylen(bnode, e); in __hfs_brec_find()
83 fd->record = e; in __hfs_brec_find()
|
| /fs/hfsplus/ |
| D | bfind.c | 118 int b, e; in __hfs_brec_find() local
123 e = bnode->num_recs - 1; in __hfs_brec_find()
126 rec = (e + b) / 2; in __hfs_brec_find()
134 if (rec_found(bnode, fd, &b, &e, &rec)) { in __hfs_brec_find()
138 } while (b <= e); in __hfs_brec_find()
140 if (rec != e && e >= 0) { in __hfs_brec_find()
141 len = hfs_brec_lenoff(bnode, e, &off); in __hfs_brec_find()
142 keylen = hfs_brec_keylen(bnode, e); in __hfs_brec_find()
151 fd->record = e; in __hfs_brec_find()
|
| D | unicode.c | 103 int i, s, e; in hfsplus_compose_lookup() local
106 e = p[1]; in hfsplus_compose_lookup()
107 if (!e || cc < p[s * 2] || cc > p[e * 2]) in hfsplus_compose_lookup()
110 i = (s + e) / 2; in hfsplus_compose_lookup()
114 e = i - 1; in hfsplus_compose_lookup()
117 } while (s <= e); in hfsplus_compose_lookup()
|
| /fs/f2fs/ |
| D | node.c | 156 static void __free_nat_entry(struct nat_entry *e) in __free_nat_entry() argument
158 kmem_cache_free(nat_entry_slab, e); in __free_nat_entry()
188 static void __del_from_nat_cache(struct f2fs_nm_info *nm_i, struct nat_entry *e) in __del_from_nat_cache() argument
190 list_del(&e->list); in __del_from_nat_cache()
191 radix_tree_delete(&nm_i->nat_root, nat_get_nid(e)); in __del_from_nat_cache()
193 __free_nat_entry(e); in __del_from_nat_cache()
266 struct nat_entry *e; in need_dentry_mark() local
270 e = __lookup_nat_cache(nm_i, nid); in need_dentry_mark()
271 if (e) { in need_dentry_mark()
272 if (!get_nat_flag(e, IS_CHECKPOINTED) && in need_dentry_mark()
[all …]
|
| D | checkpoint.c | 412 struct ino_entry *e, *tmp; in __add_ino_entry() local
419 e = radix_tree_lookup(&im->ino_root, ino); in __add_ino_entry()
420 if (!e) { in __add_ino_entry()
421 e = tmp; in __add_ino_entry()
422 if (unlikely(radix_tree_insert(&im->ino_root, ino, e))) in __add_ino_entry()
425 memset(e, 0, sizeof(struct ino_entry)); in __add_ino_entry()
426 e->ino = ino; in __add_ino_entry()
428 list_add_tail(&e->list, &im->ino_list); in __add_ino_entry()
434 f2fs_set_bit(devidx, (char *)&e->dirty_device); in __add_ino_entry()
439 if (e != tmp) in __add_ino_entry()
[all …]
|
| /fs/ocfs2/ |
| D | dlmglue.h | 136 #define ocfs2_inode_lock_full(i, r, e, f)\ argument
137 ocfs2_inode_lock_full_nested(i, r, e, f, OI_LS_NORMAL)
138 #define ocfs2_inode_lock_nested(i, b, e, s)\ argument
139 ocfs2_inode_lock_full_nested(i, b, e, 0, s)
142 #define ocfs2_inode_lock(i, b, e) ocfs2_inode_lock_full_nested(i, b, e, 0, OI_LS_NORMAL) argument
|
| /fs/ext2/ |
| D | acl.c | 94 char *e; in ext2_acl_to_disk() local
103 e = (char *)ext_acl + sizeof(ext2_acl_header); in ext2_acl_to_disk()
106 ext2_acl_entry *entry = (ext2_acl_entry *)e; in ext2_acl_to_disk()
113 e += sizeof(ext2_acl_entry); in ext2_acl_to_disk()
118 e += sizeof(ext2_acl_entry); in ext2_acl_to_disk()
125 e += sizeof(ext2_acl_entry_short); in ext2_acl_to_disk()
|
| /fs/ext4/ |
| D | acl.c | 92 char *e; in ext4_acl_to_disk() local
101 e = (char *)ext_acl + sizeof(ext4_acl_header); in ext4_acl_to_disk()
104 ext4_acl_entry *entry = (ext4_acl_entry *)e; in ext4_acl_to_disk()
111 e += sizeof(ext4_acl_entry); in ext4_acl_to_disk()
116 e += sizeof(ext4_acl_entry); in ext4_acl_to_disk()
123 e += sizeof(ext4_acl_entry_short); in ext4_acl_to_disk()
|
| /fs/jffs2/ |
| D | acl.c | 132 void *e; in jffs2_acl_to_medium() local
140 e = header + 1; in jffs2_acl_to_medium()
143 entry = e; in jffs2_acl_to_medium()
150 e += sizeof(struct jffs2_acl_entry); in jffs2_acl_to_medium()
155 e += sizeof(struct jffs2_acl_entry); in jffs2_acl_to_medium()
162 e += sizeof(struct jffs2_acl_entry_short); in jffs2_acl_to_medium()
|
| D | os-linux.h | 86 #define jffs2_flash_writev(a,b,c,d,e,f) jffs2_flash_direct_writev(a,b,c,d,e) argument
|
| /fs/xfs/ |
| D | xfs_error.h | 30 #define XFS_ERROR_REPORT(e, lvl, mp) \ argument
31 xfs_error_report(e, lvl, mp, __FILE__, __LINE__, __return_address)
32 #define XFS_CORRUPTION_ERROR(e, lvl, mp, mem) \ argument
33 xfs_corruption_error(e, lvl, mp, mem, \
|
| D | xfs_bmap_util.c | 1052 xfs_fileoff_t s, e; in xfs_alloc_file_space() local
1061 e = startoffset_fsb + allocatesize_fsb; in xfs_alloc_file_space()
1063 e += temp; in xfs_alloc_file_space()
1064 if ((temp = do_mod(e, extsz))) in xfs_alloc_file_space()
1065 e += extsz - temp; in xfs_alloc_file_space()
1068 e = allocatesize_fsb; in xfs_alloc_file_space()
1078 resblks = min_t(xfs_fileoff_t, (e - s), (MAXEXTLEN * nimaps)); in xfs_alloc_file_space()
|
| /fs/reiserfs/ |
| D | xattr_acl.c | 134 char *e; in reiserfs_posix_acl_to_disk() local
145 e = (char *)ext_acl + sizeof(reiserfs_acl_header); in reiserfs_posix_acl_to_disk()
148 reiserfs_acl_entry *entry = (reiserfs_acl_entry *) e; in reiserfs_posix_acl_to_disk()
155 e += sizeof(reiserfs_acl_entry); in reiserfs_posix_acl_to_disk()
160 e += sizeof(reiserfs_acl_entry); in reiserfs_posix_acl_to_disk()
167 e += sizeof(reiserfs_acl_entry_short); in reiserfs_posix_acl_to_disk()
|
| /fs/btrfs/ |
| D | free-space-cache.c | 591 struct btrfs_free_space_entry *e; in io_ctl_read_entry() local
600 e = io_ctl->cur; in io_ctl_read_entry()
601 entry->offset = le64_to_cpu(e->offset); in io_ctl_read_entry()
602 entry->bytes = le64_to_cpu(e->bytes); in io_ctl_read_entry()
603 *type = e->type; in io_ctl_read_entry()
641 struct btrfs_free_space *e, *prev = NULL; in merge_space_tree() local
647 e = rb_entry(n, struct btrfs_free_space, offset_index); in merge_space_tree()
650 if (e->bitmap || prev->bitmap) in merge_space_tree()
652 if (prev->offset + prev->bytes == e->offset) { in merge_space_tree()
654 unlink_free_space(ctl, e); in merge_space_tree()
[all …]
|
| /fs/ceph/ |
| D | snap.c | 663 void *p, void *e, bool deletion, in ceph_update_snap_trace() argument
677 ceph_decode_need(&p, e, sizeof(*ri), bad); in ceph_update_snap_trace()
680 ceph_decode_need(&p, e, sizeof(u64)*(le32_to_cpu(ri->num_snaps) + in ceph_update_snap_trace()
738 realm, invalidate, p, e); in ceph_update_snap_trace()
741 if (invalidate && p >= e) in ceph_update_snap_trace()
749 if (p < e) in ceph_update_snap_trace()
838 void *e = p + msg->front.iov_len; in ceph_handle_snap() local
880 ceph_decode_need(&p, e, sizeof(*ri), bad); in ceph_handle_snap()
964 ceph_update_snap_trace(mdsc, p, e, in ceph_handle_snap()
|
| /fs/cramfs/ |
| D | README | 5 a bit looser, e.g. it doesn't care if the <file_data> items are
26 confused with breadth-first); i.e. like depth-first but listing all of
47 *end* of the i'th <block> (i.e. one past the last byte, which is the
53 tree, i.e. the same order as `find -size +0 \( -type f -o -type l \)
67 This kernel supports cramfs holes (i.e. [efficient representation of]
147 e.g. get readpage to decompress to a buffer of size MAX_BLKSIZE (which
|
| /fs/hpfs/ |
| D | dir.c | 91 int e = 0; in hpfs_readdir() local
97 e = 1; in hpfs_readdir()
102 e = 1; in hpfs_readdir()
106 if (e) { in hpfs_readdir()
|
| /fs/coda/ |
| D | Kconfig | 9 disconnected operation (e.g. for laptops), read/write server
15 client and server. Servers are currently user level, i.e. they need
|
| /fs/logfs/ |
| D | readwrite.c | 1697 int e; in logfs_truncate_direct() local
1702 for (e = I0_BLOCKS - 1; e >= 0; e--) { in logfs_truncate_direct()
1703 if (size > (e+1) * LOGFS_BLOCKSIZE) in logfs_truncate_direct()
1706 wc.ofs = li->li_data[e]; in logfs_truncate_direct()
1710 page = logfs_get_write_page(inode, e, 0); in logfs_truncate_direct()
1713 err = logfs_segment_read(inode, page, wc.ofs, e, 0); in logfs_truncate_direct()
1723 li->li_data[e] = wc.ofs; in logfs_truncate_direct()
1769 int e, err = 0; in __logfs_truncate_rec() local
1780 for (e = LOGFS_BLOCK_FACTOR - 1; e >= 0; e--) { in __logfs_truncate_rec()
1781 child_bix = bix + e * logfs_step(SUBLEVEL(level)); in __logfs_truncate_rec()
[all …]
|
| /fs/9p/ |
| D | v9fs.c | 119 char *s, *e; in v9fs_parse_options() local
272 uid = simple_strtoul(s, &e, 10); in v9fs_parse_options()
273 if (*e != '\0') { in v9fs_parse_options()
|
| /fs/nfsd/ |
| D | nfs4idmap.c | 98 struct ent *e = kmalloc(sizeof(*e), GFP_KERNEL); in ent_alloc() local
99 if (e) in ent_alloc()
100 return &e->h; in ent_alloc()
|