| /linux/kernel/ |
| H A D | user_namespace.c | 292 * map_id_range_down_base - Find idmap via binary search in static extent array.
304 /* Find the matching extent */ in map_id_range_down_base()
306 first = map->extent[idx].first; in map_id_range_down_base()
307 last = first + map->extent[idx].count - 1; in map_id_range_down_base()
310 return &map->extent[idx]; in map_id_range_down_base()
317 struct uid_gid_extent *extent; in map_id_range_down() local
322 extent = map_id_range_down_base(extents, map, id, count); in map_id_range_down()
324 extent = map_id_range_down_max(extents, map, id, count); in map_id_range_down()
327 if (extent) in map_id_range_down()
328 id = (id - extent in map_id_range_down()
380 struct uid_gid_extent *extent; map_id_up() local
605 struct uid_gid_extent *extent = v; uid_m_show() local
626 struct uid_gid_extent *extent = v; gid_m_show() local
647 struct uid_gid_extent *extent = v; projid_m_show() local
735 mappings_overlap(struct uid_gid_map * new_map,struct uid_gid_extent * extent) mappings_overlap() argument
778 insert_extent(struct uid_gid_map * map,struct uid_gid_extent * extent) insert_extent() argument
933 struct uid_gid_extent extent; map_write() local
[all...] |
| H A D | user.c | 40 .extent[0] = {
50 .extent[0] = {
60 .extent[0] = {
|
| /linux/Documentation/filesystems/ext4/ |
| H A D | ifork.rst | 38 led to the creation of the extent mapping scheme, discussed below.
46 In ext4, the file to logical block map has been replaced with an extent
51 very large files with a single extent, at a considerable reduction in
60 points to a block containing more nodes in the extent tree. If the node
63 point to the file's data blocks. The root node of the extent tree is
67 The extent tree header is recorded in ``struct ext4_extent_header``,
93 - Depth of this extent node in the extent tree. 0 = this extent node
94 points to data blocks; otherwise, this extent node points to other
95 extent nodes. The extent tree can be at most 5 levels deep: a logical
103 Internal nodes of the extent tree, also known as index nodes, are
[all …]
|
| /linux/fs/hfs/ |
| H A D | extent.c | 150 static inline int __hfs_ext_read_extent(struct hfs_find_data *fd, struct hfs_extent *extent, in __hfs_ext_read_extent() argument
165 hfs_bnode_read(fd->bnode, extent, fd->entryoffset, sizeof(hfs_extent_rec)); in __hfs_ext_read_extent()
208 static void hfs_dump_extent(struct hfs_extent *extent) in hfs_dump_extent() argument
215 be16_to_cpu(extent[i].block), in hfs_dump_extent()
216 be16_to_cpu(extent[i].count)); in hfs_dump_extent()
220 static int hfs_add_extent(struct hfs_extent *extent, u16 offset, in hfs_add_extent() argument
226 hfs_dump_extent(extent); in hfs_add_extent()
227 for (i = 0; i < 3; extent++, i++) { in hfs_add_extent()
228 count = be16_to_cpu(extent->count); in hfs_add_extent()
230 start = be16_to_cpu(extent->block); in hfs_add_extent()
[all …]
|
| /linux/arch/parisc/math-emu/ |
| H A D | sfsub.c | 42 register unsigned int left, right, result, extent; in sgl_fsub() local
277 /*and lower to*/extent); in sgl_fsub()
287 Sgl_subtract_withextension(left,/*minus*/right,/*with*/extent,/*into*/result); in sgl_fsub()
301 Sgl_leftshiftby1_withextent(result,extent,result); in sgl_fsub()
328 Ext_leftshiftby1(extent); in sgl_fsub()
340 Ext_leftshiftby1(extent); in sgl_fsub()
418 Sgl_right_align(result,/*by*/(1-result_exponent),extent); in sgl_fsub()
433 Sgl_rightshiftby1_withextent(result,extent,extent); in sgl_fsub()
444 if(Ext_isnotzero(extent)) in sgl_fsub()
450 if(Ext_isone_sign(extent)) in sgl_fsub()
[all …]
|
| H A D | sfadd.c | 42 register unsigned int left, right, result, extent; in sgl_fadd() local
274 /*and lower to*/extent); in sgl_fadd()
284 Sgl_subtract_withextension(left,/*minus*/right,/*with*/extent,/*into*/result); in sgl_fadd()
298 Sgl_leftshiftby1_withextent(result,extent,result); in sgl_fadd()
325 Ext_leftshiftby1(extent); in sgl_fadd()
337 Ext_leftshiftby1(extent); in sgl_fadd()
415 Sgl_right_align(result,/*by*/(1-result_exponent),extent); in sgl_fadd()
430 Sgl_rightshiftby1_withextent(result,extent,extent); in sgl_fadd()
441 if(Ext_isnotzero(extent)) in sgl_fadd()
447 if(Ext_isone_sign(extent)) in sgl_fadd()
[all …]
|
| H A D | dfsub.c | 43 register unsigned int leftp1, leftp2, rightp1, rightp2, extent; in dbl_fsub() local
281 /*and lower to*/extent); in dbl_fsub()
292 /*with*/extent,/*into*/resultp1,resultp2); in dbl_fsub()
306 Dbl_leftshiftby1_withextent(resultp1,resultp2,extent,resultp1,resultp2); in dbl_fsub()
333 Ext_leftshiftby1(extent); in dbl_fsub()
345 Ext_leftshiftby1(extent); in dbl_fsub()
423 Dbl_fix_overshift(resultp1,resultp2,(1-result_exponent),extent); in dbl_fsub()
438 Dbl_rightshiftby1_withextent(resultp2,extent,extent); in dbl_fsub()
449 if(Ext_isnotzero(extent)) in dbl_fsub()
455 if(Ext_isone_sign(extent)) in dbl_fsub()
[all …]
|
| H A D | dfadd.c | 42 register unsigned int leftp1, leftp2, rightp1, rightp2, extent; in dbl_fadd() local
278 /*and lower to*/extent); in dbl_fadd()
289 /*with*/extent,/*into*/resultp1,resultp2); in dbl_fadd()
303 Dbl_leftshiftby1_withextent(resultp1,resultp2,extent,resultp1,resultp2); in dbl_fadd()
330 Ext_leftshiftby1(extent); in dbl_fadd()
342 Ext_leftshiftby1(extent); in dbl_fadd()
420 Dbl_fix_overshift(resultp1,resultp2,(1-result_exponent),extent); in dbl_fadd()
435 Dbl_rightshiftby1_withextent(resultp2,extent,extent); in dbl_fadd()
446 if(Ext_isnotzero(extent)) in dbl_fadd()
452 if(Ext_isone_sign(extent)) in dbl_fadd()
[all …]
|
| H A D | float.h | 530 #define Ext_isone_sign(extent) (Extsign(extent))
531 #define Ext_isnotzero(extent) \
532 (Extall(extent))
533 #define Ext_isnotzero_lower(extent) \
534 (Extlow31(extent))
535 #define Ext_leftshiftby1(extent) \
536 Extall(extent) <<= 1
537 #define Ext_negate(extent) \
538 (int )Extall(extent) = 0 - (int )Extall(extent)
539 #define Ext_setone_low(extent) Bitfield_deposit(1,31,1,extent)
[all …]
|
| H A D | dbl_float.h | 335 #define Dbl_right_align(srcdstA,srcdstB,shift,extent) \ argument
345 shift-32, Extall(extent)); \
346 if(Dallp2(srcdstB) << 64 - (shift)) Ext_setone_low(extent); \
348 else Extall(extent) = Dallp2(srcdstB); \
353 Extall(extent) = Dallp1(srcdstA); \
354 if(Dallp2(srcdstB)) Ext_setone_low(extent); \
364 Extall(extent) = Dallp2(srcdstB) << 32 - (shift); \
369 else Extall(extent) = 0; \
376 #define Dbl_fix_overshift(srcdstA,srcdstB,shift,extent) \ argument
377 Extall(extent) = Dallp2(srcdstB) << 32 - (shift); \
[all …]
|
| H A D | sgl_float.h | 206 #define Sgl_right_align(srcdst,shift,extent) \ argument
209 Extall(extent) = Sall(srcdst) << (32-(shift)); \
213 Extall(extent) = Sall(srcdst); \
226 #define Sgl_subtract_withextension(left,right,extent,result) \ argument
229 if((Extall(extent) = 0-Extall(extent))) \
|
| /linux/Documentation/filesystems/ |
| H A D | fiemap.rst | 8 extent mappings. Instead of block-by-block mapping (such as bmap), fiemap
33 those on disk - that is, the logical offset of the 1st returned extent
35 extent may end after fm_length. All offsets and lengths are in bytes.
75 fm_extent_count. In that case, the last extent in the array will not
77 flag set (see the next section on extent flags).
79 Each extent is described by a single fiemap_extent structure as
84 * the extent */
86 * of the extent */
87 __u64 fe_length; /* length in bytes for the extent */
89 __u32 fe_flags; /* FIEMAP_EXTENT_* flags for this extent */
[all …]
|
| H A D | omfs.rst | 11 and Rio Karma MP3 player. The filesystem is extent-based, utilizing
90 A file is an omfs_inode structure followed by an extent table beginning at
99 __be64 e_next; /* next extent table location */
102 struct omfs_extent_entry e_entry; /* start of extent entries */
105 Each extent holds the block offset followed by number of blocks allocated to
106 the extent. The final extent in each table is a terminator with e_cluster
|
| /linux/fs/hfsplus/ |
| H A D | extents.c | 157 struct hfsplus_extent *extent, in __hfsplus_ext_read_extent() argument
172 hfs_bnode_read(fd->bnode, extent, fd->entryoffset, in __hfsplus_ext_read_extent()
297 static void hfsplus_dump_extent(struct hfsplus_extent *extent) in hfsplus_dump_extent() argument
304 be32_to_cpu(extent[i].start_block), in hfsplus_dump_extent()
305 be32_to_cpu(extent[i].block_count)); in hfsplus_dump_extent()
309 static int hfsplus_add_extent(struct hfsplus_extent *extent, u32 offset, in hfsplus_add_extent() argument
315 hfsplus_dump_extent(extent); in hfsplus_add_extent()
316 for (i = 0; i < 8; extent++, i++) { in hfsplus_add_extent()
317 count = be32_to_cpu(extent->block_count); in hfsplus_add_extent()
319 start = be32_to_cpu(extent->start_block); in hfsplus_add_extent()
[all …]
|
| H A D | wrapper.c | 96 u32 extent; in hfsplus_read_mdb() local
119 extent = get_unaligned_be32(bufptr + HFSP_WRAPOFF_EMBEDEXT); in hfsplus_read_mdb()
120 wd->embed_start = (extent >> 16) & 0xFFFF; in hfsplus_read_mdb()
121 wd->embed_count = extent & 0xFFFF; in hfsplus_read_mdb()
|
| /linux/mm/ |
| H A D | mremap.c | 410 * Returns an extent of the corresponding size for the pgt_entry specified if
411 * valid. Else returns a smaller extent bounded by the end of the source and
418 unsigned long next, extent, mask, size; in get_extent() local
437 /* even if next overflowed, extent below will be ok */ in get_extent()
438 extent = next - old_addr; in get_extent()
439 if (extent > old_end - old_addr) in get_extent()
440 extent = old_end - old_addr; in get_extent()
442 if (extent > next - new_addr) in get_extent()
443 extent = next - new_addr; in get_extent()
444 return extent; in get_extent()
549 unsigned long extent, old_end; move_page_tables() local
[all...] |
| /linux/fs/btrfs/ |
| H A D | Makefile | 25 btrfs-y += super.o ctree.o extent-tree.o print-tree.o root-tree.o dir-item.o \
35 subpage.o tree-mod-log.o extent-io-tree.o fs.o messages.o bio.o \
44 tests/extent-buffer-tests.o tests/btrfs-tests.o \
45 tests/extent-io-tests.o tests/inode-tests.o tests/qgroup-tests.o \
46 tests/free-space-tree-tests.o tests/extent-map-tests.o
|
| H A D | reflink.c | 372 struct btrfs_file_extent_item *extent; in btrfs_clone() local
419 extent = btrfs_item_ptr(leaf, slot, in btrfs_clone()
421 extent_gen = btrfs_file_extent_generation(leaf, extent); in btrfs_clone()
422 comp = btrfs_file_extent_compression(leaf, extent); in btrfs_clone()
423 type = btrfs_file_extent_type(leaf, extent); in btrfs_clone()
426 disko = btrfs_file_extent_disk_bytenr(leaf, extent); in btrfs_clone()
427 diskl = btrfs_file_extent_disk_num_bytes(leaf, extent); in btrfs_clone()
428 datao = btrfs_file_extent_offset(leaf, extent); in btrfs_clone()
429 datal = btrfs_file_extent_num_bytes(leaf, extent); in btrfs_clone()
432 datal = btrfs_file_extent_ram_bytes(leaf, extent); in btrfs_clone()
|
| /linux/Documentation/ABI/testing/ |
| H A D | sysfs-fs-ext4 | 23 will search to find the best extent
30 will search to find the best extent
106 extent when manipulating an inode's extent tree. Note
|
| /linux/drivers/video/fbdev/ |
| H A D | leo.c | 111 u32 extent; member
140 u32 extent; /* Copy/Scroll/Fill size (SS0 only) */ member
182 u32 extent; member
213 par->extent = ((info->var.xres - 1) | in leo_switch_from_graph()
219 sbus_writel(par->extent, &ss->vclipmax); in leo_switch_from_graph()
225 &par->lc_ss0_usr->extent); in leo_switch_from_graph()
|
| /linux/arch/m68k/fpsp040/ |
| H A D | README | 10 To the maximum extent permitted by applicable law,
17 To the maximum extent permitted by applicable law,
|
| /linux/net/ceph/ |
| H A D | osd_client.c | 193 return osd_req_op_data(osd_req, which, extent, osd_data); in osd_req_op_extent_osd_data()
217 osd_data = osd_req_op_data(osd_req, which, extent, osd_data); in osd_req_op_extent_osd_data_pages()
228 osd_data = osd_req_op_data(osd_req, which, extent, osd_data); in osd_req_op_extent_osd_data_pagelist()
241 osd_data = osd_req_op_data(osd_req, which, extent, osd_data); in osd_req_op_extent_osd_data_bio()
258 osd_data = osd_req_op_data(osd_req, which, extent, osd_data); in osd_req_op_extent_osd_data_bvecs()
269 osd_data = osd_req_op_data(osd_req, which, extent, osd_data); in osd_req_op_extent_osd_data_bvec_pos()
285 osd_data = osd_req_op_data(osd_req, which, extent, osd_data); in osd_req_op_extent_osd_iter()
407 kfree(op->extent.sparse_ext); in osd_req_op_data_release()
408 ceph_osd_data_release(&op->extent.osd_data); in osd_req_op_data_release()
771 op->extent.offset = offset; in osd_req_op_extent_init()
[all …]
|
| /linux/include/linux/ceph/ |
| H A D | osd_client.h | 156 } extent; member
643 if (op->extent.sparse_ext_cnt == 0) in ceph_sparse_ext_map_end()
646 ext = &op->extent.sparse_ext[op->extent.sparse_ext_cnt - 1]; in ceph_sparse_ext_map_end()
648 return ext->off + ext->len - op->extent.offset; in ceph_sparse_ext_map_end()
|
| /linux/kernel/module/ |
| H A D | decompress.c | 17 static int module_extend_max_pages(struct load_info *info, unsigned int extent) in module_extend_max_pages() argument
21 new_pages = kvmalloc_array(info->max_pages + extent, in module_extend_max_pages()
29 info->max_pages += extent; in module_extend_max_pages()
|
| /linux/fs/bcachefs/ |
| H A D | backpointers.c | 443 struct bkey_s_c extent, unsigned dev) in drop_dev_and_update() argument
445 struct bkey_i *n = bch2_bkey_make_mut_noupdate(trans, extent); in drop_dev_and_update()
455 enum btree_id btree, struct bkey_s_c extent, in check_extent_checksum() argument
459 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(extent); in check_extent_checksum()
468 if (bkey_is_btree_ptr(extent.k)) in check_extent_checksum()
471 bkey_for_each_ptr_decode(extent.k, ptrs, p, entry) in check_extent_checksum()
500 bch2_bkey_val_to_text(&buf, c, extent); in check_extent_checksum()
504 struct nonce nonce = extent_nonce(extent.k->version, p.crc); in check_extent_checksum()
509 ret = drop_dev_and_update(trans, btree, extent, dev) ?: 1; in check_extent_checksum()
|