Home
last modified time | relevance | path

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

12

/fs/
Dbinfmt_misc.c76 Node *e = list_entry(l, Node, list); in check_file() local
80 if (!test_bit(Enabled, &e->flags)) in check_file()
83 if (!test_bit(Magic, &e->flags)) { in check_file()
84 if (p && !strcmp(e->magic, p + 1)) in check_file()
85 return e; in check_file()
89 s = bprm->buf + e->offset; in check_file()
90 if (e->mask) { in check_file()
91 for (j = 0; j < e->size; j++) in check_file()
92 if ((*s++ ^ e->magic[j]) & e->mask[j]) in check_file()
95 for (j = 0; j < e->size; j++) in check_file()
[all …]
/fs/dlm/
Drequestqueue.c36 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 …]
Dlowcomms.c955 static void free_entry(struct writequeue_entry *e) in free_entry() argument
957 __free_page(e->page); in free_entry()
958 kfree(e); in free_entry()
974 struct writequeue_entry *e; in sctp_init_assoc() local
1009 e = list_first_entry(&con->writequeue, struct writequeue_entry, list); in sctp_init_assoc()
1010 len = e->len; in sctp_init_assoc()
1011 offset = e->offset; in sctp_init_assoc()
1015 iov[0].iov_base = page_address(e->page)+offset; in sctp_init_assoc()
1038 e->offset += ret; in sctp_init_assoc()
1039 e->len -= ret; in sctp_init_assoc()
[all …]
/fs/ubifs/
Drecovery.c1269 struct size_entry *e; in add_ino() local
1273 e = rb_entry(parent, struct size_entry, rb); in add_ino()
1274 if (inum < e->inum) in add_ino()
1280 e = kzalloc(sizeof(struct size_entry), GFP_KERNEL); in add_ino()
1281 if (!e) in add_ino()
1284 e->inum = inum; in add_ino()
1285 e->i_size = i_size; in add_ino()
1286 e->d_size = d_size; in add_ino()
1287 e->exists = exists; in add_ino()
1289 rb_link_node(&e->rb, parent, p); in add_ino()
[all …]
/fs/xfs/
Dxfs_error.h25 #define XFS_ERROR(e) xfs_error_trap(e) argument
27 #define XFS_ERROR(e) (e) argument
38 #define XFS_ERROR_REPORT(e, lvl, mp) \ argument
39 xfs_error_report(e, lvl, mp, __FILE__, __LINE__, __return_address)
40 #define XFS_CORRUPTION_ERROR(e, lvl, mp, mem) \ argument
41 xfs_corruption_error(e, lvl, mp, mem, \
Dxfs_error.c39 xfs_error_trap(int e) in xfs_error_trap() argument
43 if (!e) in xfs_error_trap()
48 if (e != xfs_etrap[i]) in xfs_error_trap()
50 xfs_notice(NULL, "%s: error %d", __func__, e); in xfs_error_trap()
54 return e; in xfs_error_trap()
/fs/hfs/
Dbfind.c47 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/f2fs/
Dnode.c130 static void __del_from_nat_cache(struct f2fs_nm_info *nm_i, struct nat_entry *e) in __del_from_nat_cache() argument
132 list_del(&e->list); in __del_from_nat_cache()
133 radix_tree_delete(&nm_i->nat_root, nat_get_nid(e)); in __del_from_nat_cache()
135 kmem_cache_free(nat_entry_slab, e); in __del_from_nat_cache()
141 struct nat_entry *e; in is_checkpointed_node() local
145 e = __lookup_nat_cache(nm_i, nid); in is_checkpointed_node()
146 if (e && !e->checkpointed) in is_checkpointed_node()
173 struct nat_entry *e; in cache_nat_entry() local
176 e = __lookup_nat_cache(nm_i, nid); in cache_nat_entry()
177 if (!e) { in cache_nat_entry()
[all …]
/fs/hfsplus/
Dbfind.c118 int b, e; in __hfs_brec_find() local
125 e = bnode->num_recs - 1; in __hfs_brec_find()
128 rec = (e + b) / 2; in __hfs_brec_find()
136 if (rec_found(bnode, fd, &b, &e, &rec)) { in __hfs_brec_find()
140 } while (b <= e); in __hfs_brec_find()
142 if (rec != e && e >= 0) { in __hfs_brec_find()
143 len = hfs_brec_lenoff(bnode, e, &off); in __hfs_brec_find()
144 keylen = hfs_brec_keylen(bnode, e); in __hfs_brec_find()
153 fd->record = e; in __hfs_brec_find()
Dunicode.c103 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/ocfs2/
Ddlmglue.h129 #define ocfs2_inode_lock_full(i, r, e, f)\ argument
130 ocfs2_inode_lock_full_nested(i, r, e, f, OI_LS_NORMAL)
131 #define ocfs2_inode_lock_nested(i, b, e, s)\ argument
132 ocfs2_inode_lock_full_nested(i, b, e, 0, s)
135 #define ocfs2_inode_lock(i, b, e) ocfs2_inode_lock_full_nested(i, b, e, 0, OI_LS_NORMAL) argument
/fs/ext4/
Dacl.c97 char *e; in ext4_acl_to_disk() local
106 e = (char *)ext_acl + sizeof(ext4_acl_header); in ext4_acl_to_disk()
109 ext4_acl_entry *entry = (ext4_acl_entry *)e; in ext4_acl_to_disk()
116 e += sizeof(ext4_acl_entry); in ext4_acl_to_disk()
121 e += sizeof(ext4_acl_entry); in ext4_acl_to_disk()
128 e += sizeof(ext4_acl_entry_short); in ext4_acl_to_disk()
/fs/btrfs/
Dfree-space-cache.c551 struct btrfs_free_space_entry *e; in io_ctl_read_entry() local
560 e = io_ctl->cur; in io_ctl_read_entry()
561 entry->offset = le64_to_cpu(e->offset); in io_ctl_read_entry()
562 entry->bytes = le64_to_cpu(e->bytes); in io_ctl_read_entry()
563 *type = e->type; in io_ctl_read_entry()
601 struct btrfs_free_space *e, *prev = NULL; in merge_space_tree() local
607 e = rb_entry(n, struct btrfs_free_space, offset_index); in merge_space_tree()
610 if (e->bitmap || prev->bitmap) in merge_space_tree()
612 if (prev->offset + prev->bytes == e->offset) { in merge_space_tree()
614 unlink_free_space(ctl, e); in merge_space_tree()
[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/ext3/
Dacl.c90 char *e; in ext3_acl_to_disk() local
99 e = (char *)ext_acl + sizeof(ext3_acl_header); in ext3_acl_to_disk()
102 ext3_acl_entry *entry = (ext3_acl_entry *)e; in ext3_acl_to_disk()
109 e += sizeof(ext3_acl_entry); in ext3_acl_to_disk()
114 e += sizeof(ext3_acl_entry); in ext3_acl_to_disk()
121 e += sizeof(ext3_acl_entry_short); in ext3_acl_to_disk()
/fs/jffs2/
Dacl.c132 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()
/fs/reiserfs/
Dxattr_acl.c162 char *e; in posix_acl_to_disk() local
173 e = (char *)ext_acl + sizeof(reiserfs_acl_header); in posix_acl_to_disk()
176 reiserfs_acl_entry *entry = (reiserfs_acl_entry *) e; in posix_acl_to_disk()
183 e += sizeof(reiserfs_acl_entry); in posix_acl_to_disk()
188 e += sizeof(reiserfs_acl_entry); in posix_acl_to_disk()
195 e += sizeof(reiserfs_acl_entry_short); in posix_acl_to_disk()
/fs/ceph/
Dsnap.c622 void *p, void *e, bool deletion) in ceph_update_snap_trace() argument
634 ceph_decode_need(&p, e, sizeof(*ri), bad); in ceph_update_snap_trace()
637 ceph_decode_need(&p, e, sizeof(u64)*(le32_to_cpu(ri->num_snaps) + in ceph_update_snap_trace()
693 realm, invalidate, p, e); in ceph_update_snap_trace()
695 if (p < e) in ceph_update_snap_trace()
781 void *e = p + msg->front.iov_len; in ceph_handle_snap() local
823 ceph_decode_need(&p, e, sizeof(*ri), bad); in ceph_handle_snap()
908 ceph_update_snap_trace(mdsc, p, e, in ceph_handle_snap()
/fs/cifs/
DREADME21 1) Get the kernel source (e.g.from http://www.kernel.org)
25 then patch the kernel (e.g. "patch -p1 < cifs_24.patch")
27 it has not already been added (e.g. current SuSE and UL
31 the cifs download to your kernel build directory e.g.
42 1) Download the kernel (e.g. from http://www.kernel.org)
44 (e.g. /usr/src/linux-2.5.73)
55 the modules directory e.g. /lib/modules/2.4.10-4GB/kernel/fs/cifs/cifs.o).
66 users who are used to Windows e.g.
71 trivially built from Samba 3.0 or later source e.g. by executing:
86 utility as suid (e.g. "chmod +s /sbin/mount.cifs). To enable users to
[all …]
/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
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/
Ddir.c87 int e = 0; in hpfs_readdir() local
93 e = 1; in hpfs_readdir()
98 e = 1; in hpfs_readdir()
102 if (e) { in hpfs_readdir()
/fs/coda/
DKconfig9 disconnected operation (e.g. for laptops), read/write server
15 client and server. Servers are currently user level, i.e. they need
/fs/pstore/
Dplatform.c183 const char *e = s + c; in pstore_console_write() local
185 while (s < e) { in pstore_console_write()
202 c = e - s; in pstore_console_write()
/fs/logfs/
Dreadwrite.c1697 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/nfsd/
Dnfs4idmap.c101 struct ent *e = kmalloc(sizeof(*e), GFP_KERNEL); in ent_alloc() local
102 if (e) in ent_alloc()
103 return &e->h; in ent_alloc()

12