| /Linux-v4.19/kernel/ |
| D | user_namespace.c | 287 first = map->extent[idx].first; in map_id_range_down_base()
288 last = first + map->extent[idx].count - 1; in map_id_range_down_base()
291 return &map->extent[idx]; in map_id_range_down_base()
298 struct uid_gid_extent *extent; in map_id_range_down() local
303 extent = map_id_range_down_base(extents, map, id, count); in map_id_range_down()
305 extent = map_id_range_down_max(extents, map, id, count); in map_id_range_down()
308 if (extent) in map_id_range_down()
309 id = (id - extent->first) + extent->lower_first; in map_id_range_down()
334 first = map->extent[idx].lower_first; in map_id_up_base()
335 last = first + map->extent[idx].count - 1; in map_id_up_base()
[all …]
|
| D | user.c | 30 .extent[0] = {
40 .extent[0] = {
50 .extent[0] = {
|
| /Linux-v4.19/Documentation/filesystems/ext4/ondisk/ |
| 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 …]
|
| D | bigalloc.rst | 19 clusters instead of blocks” to the extent tree, though it is not clear
20 where those patches went-- they eventually morphed into “extent tree v2”
|
| /Linux-v4.19/fs/hfs/ |
| D | extent.c | 146 static inline int __hfs_ext_read_extent(struct hfs_find_data *fd, struct hfs_extent *extent, in __hfs_ext_read_extent() argument
161 hfs_bnode_read(fd->bnode, extent, fd->entryoffset, sizeof(hfs_extent_rec)); in __hfs_ext_read_extent()
204 static void hfs_dump_extent(struct hfs_extent *extent) in hfs_dump_extent() argument
211 be16_to_cpu(extent[i].block), in hfs_dump_extent()
212 be16_to_cpu(extent[i].count)); in hfs_dump_extent()
216 static int hfs_add_extent(struct hfs_extent *extent, u16 offset, in hfs_add_extent() argument
222 hfs_dump_extent(extent); in hfs_add_extent()
223 for (i = 0; i < 3; extent++, i++) { in hfs_add_extent()
224 count = be16_to_cpu(extent->count); in hfs_add_extent()
226 start = be16_to_cpu(extent->block); in hfs_add_extent()
[all …]
|
| D | Makefile | 8 catalog.o dir.o extent.o inode.o attr.o mdb.o \
|
| /Linux-v4.19/arch/parisc/math-emu/ |
| D | sfadd.c | 55 register unsigned int left, right, result, extent; in sgl_fadd() local
287 /*and lower to*/extent); in sgl_fadd()
297 Sgl_subtract_withextension(left,/*minus*/right,/*with*/extent,/*into*/result); in sgl_fadd()
311 Sgl_leftshiftby1_withextent(result,extent,result); in sgl_fadd()
338 Ext_leftshiftby1(extent); in sgl_fadd()
350 Ext_leftshiftby1(extent); in sgl_fadd()
428 Sgl_right_align(result,/*by*/(1-result_exponent),extent); in sgl_fadd()
443 Sgl_rightshiftby1_withextent(result,extent,extent); in sgl_fadd()
454 if(Ext_isnotzero(extent)) in sgl_fadd()
460 if(Ext_isone_sign(extent)) in sgl_fadd()
[all …]
|
| D | sfsub.c | 55 register unsigned int left, right, result, extent; in sgl_fsub() local
290 /*and lower to*/extent); in sgl_fsub()
300 Sgl_subtract_withextension(left,/*minus*/right,/*with*/extent,/*into*/result); in sgl_fsub()
314 Sgl_leftshiftby1_withextent(result,extent,result); in sgl_fsub()
341 Ext_leftshiftby1(extent); in sgl_fsub()
353 Ext_leftshiftby1(extent); in sgl_fsub()
431 Sgl_right_align(result,/*by*/(1-result_exponent),extent); in sgl_fsub()
446 Sgl_rightshiftby1_withextent(result,extent,extent); in sgl_fsub()
457 if(Ext_isnotzero(extent)) in sgl_fsub()
463 if(Ext_isone_sign(extent)) in sgl_fsub()
[all …]
|
| D | dfadd.c | 55 register unsigned int leftp1, leftp2, rightp1, rightp2, extent; in dbl_fadd() local
291 /*and lower to*/extent); in dbl_fadd()
302 /*with*/extent,/*into*/resultp1,resultp2); in dbl_fadd()
316 Dbl_leftshiftby1_withextent(resultp1,resultp2,extent,resultp1,resultp2); in dbl_fadd()
343 Ext_leftshiftby1(extent); in dbl_fadd()
355 Ext_leftshiftby1(extent); in dbl_fadd()
433 Dbl_fix_overshift(resultp1,resultp2,(1-result_exponent),extent); in dbl_fadd()
448 Dbl_rightshiftby1_withextent(resultp2,extent,extent); in dbl_fadd()
459 if(Ext_isnotzero(extent)) in dbl_fadd()
465 if(Ext_isone_sign(extent)) in dbl_fadd()
[all …]
|
| D | dfsub.c | 56 register unsigned int leftp1, leftp2, rightp1, rightp2, extent; in dbl_fsub() local
294 /*and lower to*/extent); in dbl_fsub()
305 /*with*/extent,/*into*/resultp1,resultp2); in dbl_fsub()
319 Dbl_leftshiftby1_withextent(resultp1,resultp2,extent,resultp1,resultp2); in dbl_fsub()
346 Ext_leftshiftby1(extent); in dbl_fsub()
358 Ext_leftshiftby1(extent); in dbl_fsub()
436 Dbl_fix_overshift(resultp1,resultp2,(1-result_exponent),extent); in dbl_fsub()
451 Dbl_rightshiftby1_withextent(resultp2,extent,extent); in dbl_fsub()
462 if(Ext_isnotzero(extent)) in dbl_fsub()
468 if(Ext_isone_sign(extent)) in dbl_fsub()
[all …]
|
| D | float.h | 543 #define Ext_isone_sign(extent) (Extsign(extent))
544 #define Ext_isnotzero(extent) \
545 (Extall(extent))
546 #define Ext_isnotzero_lower(extent) \
547 (Extlow31(extent))
548 #define Ext_leftshiftby1(extent) \
549 Extall(extent) <<= 1
550 #define Ext_negate(extent) \
551 (int )Extall(extent) = 0 - (int )Extall(extent)
552 #define Ext_setone_low(extent) Bitfield_deposit(1,31,1,extent)
[all …]
|
| D | dbl_float.h | 348 #define Dbl_right_align(srcdstA,srcdstB,shift,extent) \ argument
358 shift-32, Extall(extent)); \
359 if(Dallp2(srcdstB) << 64 - (shift)) Ext_setone_low(extent); \
361 else Extall(extent) = Dallp2(srcdstB); \
366 Extall(extent) = Dallp1(srcdstA); \
367 if(Dallp2(srcdstB)) Ext_setone_low(extent); \
377 Extall(extent) = Dallp2(srcdstB) << 32 - (shift); \
382 else Extall(extent) = 0; \
389 #define Dbl_fix_overshift(srcdstA,srcdstB,shift,extent) \ argument
390 Extall(extent) = Dallp2(srcdstB) << 32 - (shift); \
[all …]
|
| D | sgl_float.h | 219 #define Sgl_right_align(srcdst,shift,extent) \ argument
222 Extall(extent) = Sall(srcdst) << (32-(shift)); \
226 Extall(extent) = Sall(srcdst); \
239 #define Sgl_subtract_withextension(left,right,extent,result) \ argument
242 if((Extall(extent) = 0-Extall(extent))) \
|
| /Linux-v4.19/fs/hfsplus/ |
| D | extents.c | 153 struct hfsplus_extent *extent, in __hfsplus_ext_read_extent() argument
168 hfs_bnode_read(fd->bnode, extent, fd->entryoffset, in __hfsplus_ext_read_extent()
291 static void hfsplus_dump_extent(struct hfsplus_extent *extent) in hfsplus_dump_extent() argument
298 be32_to_cpu(extent[i].start_block), in hfsplus_dump_extent()
299 be32_to_cpu(extent[i].block_count)); in hfsplus_dump_extent()
303 static int hfsplus_add_extent(struct hfsplus_extent *extent, u32 offset, in hfsplus_add_extent() argument
309 hfsplus_dump_extent(extent); in hfsplus_add_extent()
310 for (i = 0; i < 8; extent++, i++) { in hfsplus_add_extent()
311 count = be32_to_cpu(extent->block_count); in hfsplus_add_extent()
313 start = be32_to_cpu(extent->start_block); in hfsplus_add_extent()
[all …]
|
| D | wrapper.c | 97 u32 extent; in hfsplus_read_mdb() local
120 extent = get_unaligned_be32(bufptr + HFSP_WRAPOFF_EMBEDEXT); in hfsplus_read_mdb()
121 wd->embed_start = (extent >> 16) & 0xFFFF; in hfsplus_read_mdb()
122 wd->embed_count = extent & 0xFFFF; in hfsplus_read_mdb()
|
| /Linux-v4.19/Documentation/filesystems/ |
| D | fiemap.txt | 6 extent mappings. Instead of block-by-block mapping (such as bmap), fiemap
31 those on disk - that is, the logical offset of the 1st returned extent
33 extent may end after fm_length. All offsets and lengths are in bytes.
73 fm_extent_count. In that case, the last extent in the array will not
75 flag set (see the next section on extent flags).
77 Each extent is described by a single fiemap_extent structure as
82 * the extent */
84 * of the extent */
85 __u64 fe_length; /* length in bytes for the extent */
87 __u32 fe_flags; /* FIEMAP_EXTENT_* flags for this extent */
[all …]
|
| D | omfs.txt | 7 and Rio Karma MP3 player. The filesystem is extent-based, utilizing
84 A file is an omfs_inode structure followed by an extent table beginning at
93 __be64 e_next; /* next extent table location */
96 struct omfs_extent_entry e_entry; /* start of extent entries */
99 Each extent holds the block offset followed by number of blocks allocated to
100 the extent. The final extent in each table is a terminator with e_cluster
|
| /Linux-v4.19/fs/btrfs/ |
| D | Makefile | 5 btrfs-y += super.o ctree.o extent-tree.o print-tree.o root-tree.o dir-item.o \
20 tests/extent-buffer-tests.o tests/btrfs-tests.o \
21 tests/extent-io-tests.o tests/inode-tests.o tests/qgroup-tests.o \
22 tests/free-space-tree-tests.o tests/extent-map-tests.o
|
| /Linux-v4.19/mm/ |
| D | mremap.c | 199 unsigned long extent, next, old_end; in move_page_tables() local
211 for (; old_addr < old_end; old_addr += extent, new_addr += extent) { in move_page_tables()
215 extent = next - old_addr; in move_page_tables()
216 if (extent > old_end - old_addr) in move_page_tables()
217 extent = old_end - old_addr; in move_page_tables()
225 if (extent == HPAGE_PMD_SIZE) { in move_page_tables()
244 if (extent > next - new_addr) in move_page_tables()
245 extent = next - new_addr; in move_page_tables()
246 move_ptes(vma, old_pmd, old_addr, old_addr + extent, new_vma, in move_page_tables()
|
| /Linux-v4.19/fs/ |
| D | ioctl.c | 92 struct fiemap_extent extent; in fiemap_fill_next_extent() local
111 memset(&extent, 0, sizeof(extent)); in fiemap_fill_next_extent()
112 extent.fe_logical = logical; in fiemap_fill_next_extent()
113 extent.fe_physical = phys; in fiemap_fill_next_extent()
114 extent.fe_length = len; in fiemap_fill_next_extent()
115 extent.fe_flags = flags; in fiemap_fill_next_extent()
118 if (copy_to_user(dest, &extent, sizeof(extent))) in fiemap_fill_next_extent()
|
| /Linux-v4.19/Documentation/ABI/testing/ |
| 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-v4.19/arch/m68k/fpsp040/ |
| D | README | 10 To the maximum extent permitted by applicable law,
17 To the maximum extent permitted by applicable law,
|
| /Linux-v4.19/drivers/video/fbdev/ |
| D | leo.c | 116 u32 extent; member
145 u32 extent; /* Copy/Scroll/Fill size (SS0 only) */ member
187 u32 extent; member
218 par->extent = ((info->var.xres - 1) | in leo_switch_from_graph()
224 sbus_writel(par->extent, &ss->vclipmax); in leo_switch_from_graph()
230 &par->lc_ss0_usr->extent); in leo_switch_from_graph()
|
| /Linux-v4.19/drivers/gpu/drm/amd/amdgpu/ |
| D | clearstate_defs.h | 34 const unsigned int *extent; member
|
| /Linux-v4.19/drivers/gpu/drm/radeon/ |
| D | clearstate_defs.h | 34 const unsigned int *extent; member
|
