| /linux/kernel/ |
| H A D | user_namespace.c | 309 first = map->extent[idx].first; in map_id_range_down_base()
310 last = first + map->extent[idx].count - 1; in map_id_range_down_base()
313 return &map->extent[idx]; in map_id_range_down_base()
320 struct uid_gid_extent *extent; in map_id_range_down() local
325 extent = map_id_range_down_base(extents, map, id, count); in map_id_range_down()
327 extent = map_id_range_down_max(extents, map, id, count); in map_id_range_down()
330 if (extent) in map_id_range_down()
331 id = (id - extent->first) + extent->lower_first; in map_id_range_down()
358 first = map->extent[idx].lower_first; in map_id_range_up_base()
359 last = first + map->extent[idx].count - 1; in map_id_range_up_base()
[all …]
|
| /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 …]
|
| H A D | bigalloc.rst | 31 units of clusters instead of blocks” to the extent tree, though it is
33 “extent tree v2” but that code has not landed as of May 2015.
|
| /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
22 those on disk - that is, the logical offset of the 1st returned extent
24 extent may end after fm_length. All offsets and lengths are in bytes.
66 fm_extent_count. In that case, the last extent in the array will not
68 flag set (see the next section on extent flags).
70 Each extent is described by a single fiemap_extent structure as
83 The fe_flags field contains flags which describe the extent returned.
84 A special flag, FIEMAP_EXTENT_LAST is always set on the last extent in
103 This is generally the last extent in the file. A mapping attempt past
104 this extent may return nothing. Some implementations set this flag to
[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/ |
| H A D | mnt_idmapping.c | 361 struct uid_gid_extent *extent; in statmount_mnt_idmap() local
364 extent = &map->extent[idx]; in statmount_mnt_idmap()
366 extent = &map->forward[idx]; in statmount_mnt_idmap()
373 lower = map_id_range_up(map_up, extent->lower_first, extent->count); in statmount_mnt_idmap()
377 seq_printf(seq, "%u %u %u", extent->first, lower, extent->count); in statmount_mnt_idmap()
|
| H A D | ioctl.c | 114 struct fiemap_extent extent; in fiemap_fill_next_extent() local
137 memset(&extent, 0, sizeof(extent)); in fiemap_fill_next_extent()
138 extent.fe_logical = logical; in fiemap_fill_next_extent()
139 extent.fe_physical = phys; in fiemap_fill_next_extent()
140 extent.fe_length = len; in fiemap_fill_next_extent()
141 extent.fe_flags = flags; in fiemap_fill_next_extent()
144 if (copy_to_user(dest, &extent, sizeof(extent))) in fiemap_fill_next_extent()
|
| /linux/mm/ |
| H A D | mremap.c | 198 unsigned long extent, pmd_t *old_pmd, pmd_t *new_pmd) in move_ptes() argument
210 unsigned long old_end = old_addr + extent; in move_ptes()
546 * Returns an extent of the corresponding size for the pgt_entry specified if
547 * valid. Else returns a smaller extent bounded by the end of the source and
553 unsigned long next, extent, mask, size; in get_extent() local
575 /* even if next overflowed, extent below will be ok */ in get_extent()
576 extent = next - old_addr; in get_extent()
577 if (extent > old_end - old_addr) in get_extent()
578 extent = old_end - old_addr; in get_extent()
580 if (extent > nex in get_extent()
781 pmc_next(struct pagetable_move_control * pmc,unsigned long extent) pmc_next() argument
806 unsigned long extent; move_page_tables() local
[all...] |
| /linux/fs/btrfs/ |
| H A D | Kconfig | 54 extent maps, extent io, extent buffers, inodes, qgroups and others,
107 - extent tree v2 - complex rework of extent tracking
|
| H A D | reflink.c | 429 struct btrfs_file_extent_item *extent; in btrfs_clone() local
474 extent = btrfs_item_ptr(leaf, slot, in btrfs_clone()
476 extent_gen = btrfs_file_extent_generation(leaf, extent); in btrfs_clone()
477 comp = btrfs_file_extent_compression(leaf, extent); in btrfs_clone()
478 type = btrfs_file_extent_type(leaf, extent); in btrfs_clone()
481 disko = btrfs_file_extent_disk_bytenr(leaf, extent); in btrfs_clone()
482 diskl = btrfs_file_extent_disk_num_bytes(leaf, extent); in btrfs_clone()
483 datao = btrfs_file_extent_offset(leaf, extent); in btrfs_clone()
484 datal = btrfs_file_extent_num_bytes(leaf, extent); in btrfs_clone()
487 datal = btrfs_file_extent_ram_bytes(leaf, extent); in btrfs_clone()
|
| H A D | raid-stripe-tree.c | 22 struct btrfs_stripe_extent *extent, AUTO_KFREE(newitem); in btrfs_partially_delete_raid_extent() local
44 extent = btrfs_item_ptr(leaf, slot, struct btrfs_stripe_extent); in btrfs_partially_delete_raid_extent()
47 struct btrfs_raid_stride *stride = &extent->strides[i]; in btrfs_partially_delete_raid_extent()
188 struct btrfs_stripe_extent *extent; in btrfs_delete_raid_extent() local
211 extent = btrfs_item_ptr(leaf, path->slots[0], in btrfs_delete_raid_extent()
215 struct btrfs_raid_stride *stride = &extent->strides[i]; in btrfs_delete_raid_extent()
|
| /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/include/linux/ceph/ |
| H A D | osd_client.h | 156 } extent; member
635 if (op->extent.sparse_ext_cnt == 0) in ceph_sparse_ext_map_end()
638 ext = &op->extent.sparse_ext[op->extent.sparse_ext_cnt - 1]; in ceph_sparse_ext_map_end()
640 return ext->off + ext->len - op->extent.offset; in ceph_sparse_ext_map_end()
|
| /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 | 194 return osd_req_op_data(osd_req, which, extent, osd_data); in osd_req_op_extent_osd_data()
218 osd_data = osd_req_op_data(osd_req, which, extent, osd_data); in osd_req_op_extent_osd_data_pages()
232 osd_data = osd_req_op_data(osd_req, which, extent, osd_data); in osd_req_op_extent_osd_data_bio()
249 osd_data = osd_req_op_data(osd_req, which, extent, osd_data); in osd_req_op_extent_osd_data_bvecs()
260 osd_data = osd_req_op_data(osd_req, which, extent, osd_data); in osd_req_op_extent_osd_data_bvec_pos()
276 osd_data = osd_req_op_data(osd_req, which, extent, osd_data); in osd_req_op_extent_osd_iter()
385 kfree(op->extent.sparse_ext); in osd_req_op_data_release()
386 ceph_osd_data_release(&op->extent.osd_data); in osd_req_op_data_release()
749 op->extent.offset = offset; in osd_req_op_extent_init()
750 op->extent.length = length; in osd_req_op_extent_init()
[all …]
|
| /linux/fs/ext4/ |
| H A D | extents.c | 5500 struct ext4_extent *extent; in ext4_ext_shift_extents() local
5511 extent = path[depth].p_ext; in ext4_ext_shift_extents()
5512 if (!extent) in ext4_ext_shift_extents()
5515 stop = le32_to_cpu(extent->ee_block); in ext4_ext_shift_extents()
5528 extent = path[depth].p_ext; in ext4_ext_shift_extents()
5529 if (extent) { in ext4_ext_shift_extents()
5530 ex_start = le32_to_cpu(extent->ee_block); in ext4_ext_shift_extents()
5531 ex_end = le32_to_cpu(extent->ee_block) + in ext4_ext_shift_extents()
5532 ext4_ext_get_actual_len(extent); in ext4_ext_shift_extents()
5545 (stop + ext4_ext_get_actual_len(extent))) { in ext4_ext_shift_extents()
[all …]
|
| /linux/LICENSES/deprecated/ |
| H A D | CC0-1.0 | 42 associating CC0 with a Work (the "Affirmer"), to the extent that he or she
71 2. Waiver. To the greatest extent permitted by, but not in contravention
90 Waiver shall be preserved to the maximum extent permitted taking into
92 extent the Waiver is so judged Affirmer hereby grants to each affected
120 the greatest extent permissible under applicable law.
|