Home
last modified time | relevance | path

Searched refs:e (Results 1 – 25 of 53) sorted by relevance

123

/fs/
Dbinfmt_misc.c97 Node *e = list_entry(l, Node, list); in check_file() local
102 if (!test_bit(Enabled, &e->flags)) in check_file()
106 if (!test_bit(Magic, &e->flags)) { in check_file()
107 if (p && !strcmp(e->magic, p + 1)) in check_file()
108 return e; in check_file()
113 s = bprm->buf + e->offset; in check_file()
114 if (e->mask) { in check_file()
115 for (j = 0; j < e->size; j++) in check_file()
116 if ((*s++ ^ e->magic[j]) & e->mask[j]) in check_file()
119 for (j = 0; j < e->size; j++) in check_file()
[all …]
Dfs_parser.c85 const struct fs_parameter_enum *e; in fs_parse() local
190 for (e = desc->enums; e->name[0]; e++) { in fs_parse()
191 if (e->opt == p->opt && in fs_parse()
192 strcmp(e->name, param->string) == 0) { in fs_parse()
193 result->uint_32 = e->value; in fs_parse()
363 const struct fs_parameter_enum *e; in fs_validate_description() local
417 for (e = desc->enums; e->name[0]; e++) { in fs_validate_description()
422 if (param->opt == e->opt && in fs_validate_description()
425 name, e - desc->enums, param->name); in fs_validate_description()
437 for (e = desc->enums; e->name[0]; e++) in fs_validate_description()
[all …]
/fs/dlm/
Drequestqueue.c34 struct rq_entry *e; in dlm_add_requestqueue() local
37 e = kmalloc(sizeof(struct rq_entry) + length, GFP_NOFS); in dlm_add_requestqueue()
38 if (!e) { in dlm_add_requestqueue()
43 e->recover_seq = ls->ls_recover_seq & 0xFFFFFFFF; in dlm_add_requestqueue()
44 e->nodeid = nodeid; in dlm_add_requestqueue()
45 memcpy(&e->request, ms, ms->m_header.h_length); in dlm_add_requestqueue()
48 list_add_tail(&e->list, &ls->ls_requestqueue); in dlm_add_requestqueue()
65 struct rq_entry *e; in dlm_process_requestqueue() local
77 e = list_entry(ls->ls_requestqueue.next, struct rq_entry, list); in dlm_process_requestqueue()
80 ms = &e->request; in dlm_process_requestqueue()
[all …]
Dlowcomms.c972 static void free_entry(struct writequeue_entry *e) in free_entry() argument
974 __free_page(e->page); in free_entry()
975 kfree(e); in free_entry()
985 static void writequeue_entry_complete(struct writequeue_entry *e, int completed) in writequeue_entry_complete() argument
987 e->offset += completed; in writequeue_entry_complete()
988 e->len -= completed; in writequeue_entry_complete()
990 if (e->len == 0 && e->users == 0) { in writequeue_entry_complete()
991 list_del(&e->list); in writequeue_entry_complete()
992 free_entry(e); in writequeue_entry_complete()
1426 struct writequeue_entry *e; in dlm_lowcomms_get_buffer() local
[all …]
/fs/ubifs/
Drecovery.c1250 struct size_entry *e; in add_ino() local
1254 e = rb_entry(parent, struct size_entry, rb); in add_ino()
1255 if (inum < e->inum) in add_ino()
1261 e = kzalloc(sizeof(struct size_entry), GFP_KERNEL); in add_ino()
1262 if (!e) in add_ino()
1265 e->inum = inum; in add_ino()
1266 e->i_size = i_size; in add_ino()
1267 e->d_size = d_size; in add_ino()
1268 e->exists = exists; in add_ino()
1270 rb_link_node(&e->rb, parent, p); in add_ino()
[all …]
/fs/afs/
Dmisc.c113 void afs_prioritise_error(struct afs_error *e, int error, u32 abort_code) in afs_prioritise_error() argument
119 if (e->error == -ETIMEDOUT || in afs_prioritise_error()
120 e->error == -ETIME) in afs_prioritise_error()
125 if (e->error == -ENOMEM || in afs_prioritise_error()
126 e->error == -ENONET) in afs_prioritise_error()
131 if (e->error == -ERFKILL) in afs_prioritise_error()
135 if (e->error == -EADDRNOTAVAIL) in afs_prioritise_error()
139 if (e->error == -ENETUNREACH) in afs_prioritise_error()
143 if (e->error == -EHOSTUNREACH) in afs_prioritise_error()
147 if (e->error == -EHOSTDOWN) in afs_prioritise_error()
[all …]
Dvl_probe.c177 struct afs_error e; in afs_send_vl_probes() local
181 e.error = 0; in afs_send_vl_probes()
182 e.responded = false; in afs_send_vl_probes()
189 afs_do_probe_vlserver(net, server, key, i, &e)) in afs_send_vl_probes()
193 return in_progress ? 0 : e.error; in afs_send_vl_probes()
Dfs_probe.c176 struct afs_error e; in afs_probe_fileservers() local
180 e.error = 0; in afs_probe_fileservers()
181 e.responded = false; in afs_probe_fileservers()
188 afs_do_probe_fileserver(net, server, key, i, &e)) in afs_probe_fileservers()
192 return in_progress ? 0 : e.error; in afs_probe_fileservers()
Dvl_rotate.c88 struct afs_error e; in afs_select_vlserver() local
256 e.error = -EDESTADDRREQ; in afs_select_vlserver()
257 e.responded = false; in afs_select_vlserver()
261 afs_prioritise_error(&e, READ_ONCE(s->probe.error), in afs_select_vlserver()
/fs/hfs/
Dbfind.c48 int b, e; in __hfs_brec_find() local
52 e = bnode->num_recs - 1; in __hfs_brec_find()
55 rec = (e + b) / 2; in __hfs_brec_find()
65 e = rec; in __hfs_brec_find()
72 e = rec - 1; in __hfs_brec_find()
73 } while (b <= e); in __hfs_brec_find()
74 if (rec != e && e >= 0) { in __hfs_brec_find()
75 len = hfs_brec_lenoff(bnode, e, &off); in __hfs_brec_find()
76 keylen = hfs_brec_keylen(bnode, e); in __hfs_brec_find()
84 fd->record = e; in __hfs_brec_find()
/fs/hfsplus/
Dbfind.c119 int b, e; in __hfs_brec_find() local
124 e = bnode->num_recs - 1; in __hfs_brec_find()
127 rec = (e + b) / 2; in __hfs_brec_find()
135 if (rec_found(bnode, fd, &b, &e, &rec)) { in __hfs_brec_find()
139 } while (b <= e); in __hfs_brec_find()
141 if (rec != e && e >= 0) { in __hfs_brec_find()
142 len = hfs_brec_lenoff(bnode, e, &off); in __hfs_brec_find()
143 keylen = hfs_brec_keylen(bnode, e); in __hfs_brec_find()
152 fd->record = e; in __hfs_brec_find()
Dunicode.c104 int i, s, e; in hfsplus_compose_lookup() local
107 e = p[1]; in hfsplus_compose_lookup()
108 if (!e || cc < p[s * 2] || cc > p[e * 2]) in hfsplus_compose_lookup()
111 i = (s + e) / 2; in hfsplus_compose_lookup()
115 e = i - 1; in hfsplus_compose_lookup()
118 } while (s <= e); in hfsplus_compose_lookup()
/fs/ocfs2/
Ddlmglue.h147 #define ocfs2_inode_lock_full(i, r, e, f)\ argument
148 ocfs2_inode_lock_full_nested(i, r, e, f, OI_LS_NORMAL)
149 #define ocfs2_inode_lock_nested(i, b, e, s)\ argument
150 ocfs2_inode_lock_full_nested(i, b, e, 0, s)
153 #define ocfs2_inode_lock(i, b, e) ocfs2_inode_lock_full_nested(i, b, e, 0, OI_LS_NORMAL) argument
154 #define ocfs2_try_inode_lock(i, b, e)\ argument
155 ocfs2_inode_lock_full_nested(i, b, e, OCFS2_META_LOCK_NOQUEUE,\
/fs/f2fs/
Dnode.c159 static void __free_nat_entry(struct nat_entry *e) in __free_nat_entry() argument
161 kmem_cache_free(nat_entry_slab, e); in __free_nat_entry()
207 static void __del_from_nat_cache(struct f2fs_nm_info *nm_i, struct nat_entry *e) in __del_from_nat_cache() argument
209 radix_tree_delete(&nm_i->nat_root, nat_get_nid(e)); in __del_from_nat_cache()
211 __free_nat_entry(e); in __del_from_nat_cache()
355 struct nat_entry *e; in f2fs_need_dentry_mark() local
359 e = __lookup_nat_cache(nm_i, nid); in f2fs_need_dentry_mark()
360 if (e) { in f2fs_need_dentry_mark()
361 if (!get_nat_flag(e, IS_CHECKPOINTED) && in f2fs_need_dentry_mark()
362 !get_nat_flag(e, HAS_FSYNCED_INODE)) in f2fs_need_dentry_mark()
[all …]
Dcheckpoint.c462 struct ino_entry *e, *tmp; in __add_ino_entry() local
469 e = radix_tree_lookup(&im->ino_root, ino); in __add_ino_entry()
470 if (!e) { in __add_ino_entry()
471 e = tmp; in __add_ino_entry()
472 if (unlikely(radix_tree_insert(&im->ino_root, ino, e))) in __add_ino_entry()
475 memset(e, 0, sizeof(struct ino_entry)); in __add_ino_entry()
476 e->ino = ino; in __add_ino_entry()
478 list_add_tail(&e->list, &im->ino_list); in __add_ino_entry()
484 f2fs_set_bit(devidx, (char *)&e->dirty_device); in __add_ino_entry()
489 if (e != tmp) in __add_ino_entry()
[all …]
/fs/ext2/
Dacl.c95 char *e; in ext2_acl_to_disk() local
104 e = (char *)ext_acl + sizeof(ext2_acl_header); in ext2_acl_to_disk()
107 ext2_acl_entry *entry = (ext2_acl_entry *)e; in ext2_acl_to_disk()
114 e += sizeof(ext2_acl_entry); in ext2_acl_to_disk()
119 e += sizeof(ext2_acl_entry); in ext2_acl_to_disk()
126 e += sizeof(ext2_acl_entry_short); in ext2_acl_to_disk()
/fs/xfs/
Dxfs_error.h27 #define XFS_ERROR_REPORT(e, lvl, mp) \ argument
28 xfs_error_report(e, lvl, mp, __FILE__, __LINE__, __return_address)
29 #define XFS_CORRUPTION_ERROR(e, lvl, mp, buf, bufsize) \ argument
30 xfs_corruption_error(e, lvl, mp, buf, bufsize, \
/fs/ext4/
Dacl.c94 char *e; in ext4_acl_to_disk() local
103 e = (char *)ext_acl + sizeof(ext4_acl_header); in ext4_acl_to_disk()
106 ext4_acl_entry *entry = (ext4_acl_entry *)e; in ext4_acl_to_disk()
113 e += sizeof(ext4_acl_entry); in ext4_acl_to_disk()
118 e += sizeof(ext4_acl_entry); in ext4_acl_to_disk()
125 e += sizeof(ext4_acl_entry_short); in ext4_acl_to_disk()
/fs/jffs2/
Dacl.c132 void *e; in jffs2_acl_to_medium() local
141 e = header + 1; in jffs2_acl_to_medium()
144 entry = e; in jffs2_acl_to_medium()
151 e += sizeof(struct jffs2_acl_entry); in jffs2_acl_to_medium()
156 e += sizeof(struct jffs2_acl_entry); in jffs2_acl_to_medium()
163 e += sizeof(struct jffs2_acl_entry_short); in jffs2_acl_to_medium()
/fs/reiserfs/
Dxattr_acl.c138 char *e; in reiserfs_posix_acl_to_disk() local
149 e = (char *)ext_acl + sizeof(reiserfs_acl_header); in reiserfs_posix_acl_to_disk()
152 reiserfs_acl_entry *entry = (reiserfs_acl_entry *) e; in reiserfs_posix_acl_to_disk()
159 e += sizeof(reiserfs_acl_entry); in reiserfs_posix_acl_to_disk()
164 e += sizeof(reiserfs_acl_entry); in reiserfs_posix_acl_to_disk()
171 e += sizeof(reiserfs_acl_entry_short); in reiserfs_posix_acl_to_disk()
/fs/btrfs/
Dfree-space-cache.c589 struct btrfs_free_space_entry *e; in io_ctl_read_entry() local
598 e = io_ctl->cur; in io_ctl_read_entry()
599 entry->offset = le64_to_cpu(e->offset); in io_ctl_read_entry()
600 entry->bytes = le64_to_cpu(e->bytes); in io_ctl_read_entry()
601 *type = e->type; in io_ctl_read_entry()
639 struct btrfs_free_space *e, *prev = NULL; in merge_space_tree() local
645 e = rb_entry(n, struct btrfs_free_space, offset_index); in merge_space_tree()
648 if (e->bitmap || prev->bitmap) in merge_space_tree()
650 if (prev->offset + prev->bytes == e->offset) { in merge_space_tree()
652 unlink_free_space(ctl, e); in merge_space_tree()
[all …]
/fs/erofs/
Derofs_fs.h185 static inline unsigned int erofs_xattr_entry_size(struct erofs_xattr_entry *e) in erofs_xattr_entry_size() argument
188 e->e_name_len + le16_to_cpu(e->e_value_size)); in erofs_xattr_entry_size()
/fs/cramfs/
DREADME5 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
65 and specific data block alignments e.g. for XIP applications.
69 tree, i.e. the same order as `find -size +0 \( -type f -o -type l \)
96 This kernel supports cramfs holes (i.e. [efficient representation of]
176 e.g. get readpage to decompress to a buffer of size MAX_BLKSIZE (which
/fs/hpfs/
Ddir.c92 int e = 0; in hpfs_readdir() local
98 e = 1; in hpfs_readdir()
103 e = 1; in hpfs_readdir()
107 if (e) { in hpfs_readdir()
/fs/ceph/
Dsnap.c677 void *p, void *e, bool deletion, in ceph_update_snap_trace() argument
691 ceph_decode_need(&p, e, sizeof(*ri), bad); in ceph_update_snap_trace()
694 ceph_decode_need(&p, e, sizeof(u64)*(le32_to_cpu(ri->num_snaps) + in ceph_update_snap_trace()
750 realm, invalidate, p, e); in ceph_update_snap_trace()
753 if (invalidate && p >= e) in ceph_update_snap_trace()
761 if (p < e) in ceph_update_snap_trace()
853 void *e = p + msg->front.iov_len; in ceph_handle_snap() local
895 ceph_decode_need(&p, e, sizeof(*ri), bad); in ceph_handle_snap()
987 ceph_update_snap_trace(mdsc, p, e, in ceph_handle_snap()

123