Home
last modified time | relevance | path

Searched refs:extent (Results 1 – 25 of 125) sorted by relevance

12345

/linux/kernel/
A Duser_namespace.c307 if (extent) in map_id_range_down()
308 id = (id - extent->first) + extent->lower_first; in map_id_range_down()
370 if (extent) in map_id_up()
371 id = (id - extent->lower_first) + extent->first; in map_id_up()
596 extent->first, in uid_m_show()
598 extent->count); in uid_m_show()
617 extent->first, in gid_m_show()
638 extent->first, in projid_m_show()
1002 if ((extent.first + extent.count) <= extent.first) in map_write()
1004 if ((extent.lower_first + extent.count) <= in map_write()
[all …]
A Duser.c31 .extent[0] = {
41 .extent[0] = {
51 .extent[0] = {
/linux/Documentation/filesystems/ext4/
A Difork.rst38 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
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
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
147 - First file block number that this extent covers.
153 the extent is uninitialized and the actual extent length is ``ee_len`` -
[all …]
A Dbigalloc.rst31 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/fs/hfs/
A Dextent.c226 hfs_dump_extent(extent); in hfs_add_extent()
227 for (i = 0; i < 3; extent++, i++) { in hfs_add_extent()
234 extent++; in hfs_add_extent()
254 hfs_dump_extent(extent); in hfs_free_extents()
255 for (i = 0; i < 3; extent++, i++) { in hfs_free_extents()
270 extent->block = 0; in hfs_free_extents()
271 extent->count = 0; in hfs_free_extents()
282 extent--; in hfs_free_extents()
292 struct hfs_extent *extent; in hfs_free_fork() local
297 extent = file->ExtRec; in hfs_free_fork()
[all …]
/linux/arch/parisc/math-emu/
A Dsfadd.c42 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 …]
A Dsfsub.c42 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 …]
A Ddfadd.c42 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 …]
A Ddfsub.c43 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 …]
A Dfloat.h530 #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 …]
A Ddbl_float.h335 #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 …]
A Dsgl_float.h206 #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/
A Dfiemap.rst8 extent mappings. Instead of block-by-block mapping (such as bmap), fiemap
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 */
133 Delayed allocation - while there is data for this extent, its
146 extent data via I/O to the block device while the filesystem is
167 Unwritten extent - the extent is allocated but its data has not been
185 each discovered extent::
[all …]
A Domfs.rst11 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
A Derofs.rst166 0 flat file data without data inline (no extent);
168 2 flat file data with tail packing data inline (no extent);
243 In order to record each variable-sized extent, logical clusters (lclusters) are
245 extent is generated within the range (HEAD) or not (NONHEAD). Lclusters are now
248 |<- variable-sized extent ->|<- VLE ->|
269 For each HEAD lcluster, clusterofs is recorded to indicate where a new extent
/linux/fs/hfsplus/
A Dextents.c157 struct hfsplus_extent *extent, in __hfsplus_ext_read_extent() argument
304 be32_to_cpu(extent[i].start_block), in hfsplus_dump_extent()
315 hfsplus_dump_extent(extent); in hfsplus_add_extent()
316 for (i = 0; i < 8; extent++, i++) { in hfsplus_add_extent()
323 extent++; in hfsplus_add_extent()
338 struct hfsplus_extent *extent, in hfsplus_free_extents() argument
348 hfsplus_dump_extent(extent); in hfsplus_free_extents()
349 for (i = 0; i < 8; extent++, i++) { in hfsplus_free_extents()
369 extent->block_count = 0; in hfsplus_free_extents()
370 extent->start_block = 0; in hfsplus_free_extents()
[all …]
A Dwrapper.c97 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/mm/
A Dmremap.c425 extent = next - old_addr; in get_extent()
426 if (extent > old_end - old_addr) in get_extent()
427 extent = old_end - old_addr; in get_extent()
429 if (extent > next - new_addr) in get_extent()
430 extent = next - new_addr; in get_extent()
431 return extent; in get_extent()
484 unsigned long extent, old_end; in move_page_tables() local
500 for (; old_addr < old_end; old_addr += extent, new_addr += extent) { in move_page_tables()
515 if (extent == HPAGE_PUD_SIZE) { in move_page_tables()
537 if (extent == HPAGE_PMD_SIZE && in move_page_tables()
[all …]
/linux/fs/btrfs/
A DMakefile23 btrfs-y += super.o ctree.o extent-tree.o print-tree.o root-tree.o dir-item.o \
42 tests/extent-buffer-tests.o tests/btrfs-tests.o \
43 tests/extent-io-tests.o tests/inode-tests.o tests/qgroup-tests.o \
44 tests/free-space-tree-tests.o tests/extent-map-tests.o
A Dreflink.c367 struct btrfs_file_extent_item *extent; in btrfs_clone() local
414 extent = btrfs_item_ptr(leaf, slot, in btrfs_clone()
416 extent_gen = btrfs_file_extent_generation(leaf, extent); in btrfs_clone()
417 comp = btrfs_file_extent_compression(leaf, extent); in btrfs_clone()
418 type = btrfs_file_extent_type(leaf, extent); in btrfs_clone()
421 disko = btrfs_file_extent_disk_bytenr(leaf, extent); in btrfs_clone()
422 diskl = btrfs_file_extent_disk_num_bytes(leaf, extent); in btrfs_clone()
423 datao = btrfs_file_extent_offset(leaf, extent); in btrfs_clone()
424 datal = btrfs_file_extent_num_bytes(leaf, extent); in btrfs_clone()
427 datal = btrfs_file_extent_ram_bytes(leaf, extent); in btrfs_clone()
/linux/fs/
A Dioctl.c118 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/Documentation/ABI/testing/
A Dsysfs-fs-ext423 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/
A Dleo.c117 u32 extent; member
146 u32 extent; /* Copy/Scroll/Fill size (SS0 only) */ member
188 u32 extent; member
219 par->extent = ((info->var.xres - 1) | in leo_switch_from_graph()
225 sbus_writel(par->extent, &ss->vclipmax); in leo_switch_from_graph()
231 &par->lc_ss0_usr->extent); in leo_switch_from_graph()
/linux/arch/m68k/fpsp040/
A DREADME10 To the maximum extent permitted by applicable law,
17 To the maximum extent permitted by applicable law,
/linux/fs/ext4/
A Dextents.c5126 struct ext4_extent *extent; in ext4_ext_shift_extents() local
5137 extent = path[depth].p_ext; in ext4_ext_shift_extents()
5138 if (!extent) in ext4_ext_shift_extents()
5155 if (extent) { in ext4_ext_shift_extents()
5203 if (!extent) { in ext4_ext_shift_extents()
5233 extent++; in ext4_ext_shift_extents()
5408 struct ext4_extent *extent; in ext4_insert_range() local
5508 extent = path[depth].p_ext; in ext4_insert_range()
5509 if (extent) { in ext4_insert_range()
5784 struct ext4_extent *extent; in ext4_clu_mapped() local
[all …]

Completed in 49 milliseconds

12345