Home
last modified time | relevance | path

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

12345678910>>...14

/openbmc/qemu/block/
H A Dvmdk.c588 extent->end_sector = (*(extent - 1)).end_sector + extent->sectors; in vmdk_add_extent()
590 extent->end_sector = extent->sectors; in vmdk_add_extent()
607 l1_size = extent->l1_size * extent->entry_size; in vmdk_init_tables()
613 ret = bdrv_pread(extent->file, extent->l1_table_offset, l1_size, in vmdk_init_tables()
1605 offset -= (extent->end_sector - extent->sectors) * SECTOR_SIZE; in get_cluster_offset()
1729 extent->next_cluster_sector += extent->cluster_sectors; in get_cluster_offset()
1755 if (!extent) { in find_extent()
1762 extent++; in find_extent()
1774 (extent->end_sector - extent->sectors) * BDRV_SECTOR_SIZE; in vmdk_find_offset_in_cluster()
1790 if (!extent) { in vmdk_co_block_status()
[all …]
H A Dnbd.c653 if (extent->length == 0) { in nbd_parse_blockstatus_payload()
675 extent->length = QEMU_ALIGN_DOWN(extent->length, in nbd_parse_blockstatus_payload()
679 extent->flags = 0; in nbd_parse_blockstatus_payload()
696 if (extent->length > orig_length) { in nbd_parse_blockstatus_payload()
697 extent->length = orig_length; in nbd_parse_blockstatus_payload()
708 extent->flags = 2; in nbd_parse_blockstatus_payload()
1150 assert(!extent->length); in nbd_co_receive_blockstatus_reply()
1174 length, extent, &local_err); in nbd_co_receive_blockstatus_reply()
1404 NBDExtent64 extent = { 0 }; in nbd_client_co_block_status() local
1466 assert(extent.length); in nbd_client_co_block_status()
[all …]
/openbmc/u-boot/fs/btrfs/
H A Dextent-io.c13 struct btrfs_file_extent_item *extent, u64 offset, in btrfs_read_extent_inline() argument
23 cbuf = (const char *) extent + data_off; in btrfs_read_extent_inline()
24 dlen = extent->ram_bytes; in btrfs_read_extent_inline()
32 if (extent->compression == BTRFS_COMPRESS_NONE) { in btrfs_read_extent_inline()
45 res = btrfs_decompress(extent->compression, cbuf, clen, dbuf, dlen); in btrfs_read_extent_inline()
65 struct btrfs_file_extent_item *extent, u64 offset, in btrfs_read_extent_reg() argument
72 clen = extent->disk_num_bytes; in btrfs_read_extent_reg()
73 dlen = extent->num_bytes; in btrfs_read_extent_reg()
81 physical = btrfs_map_logical_to_physical(extent->disk_bytenr); in btrfs_read_extent_reg()
85 if (extent->compression == BTRFS_COMPRESS_NONE) { in btrfs_read_extent_reg()
[all …]
H A Dinode.c90 struct btrfs_file_extent_item *extent; in btrfs_readlink() local
111 btrfs_file_extent_item_to_cpu_inl(extent); in btrfs_readlink()
117 } else if (extent->encryption != 0) { in btrfs_readlink()
123 __func__, inr, extent->ram_bytes); in btrfs_readlink()
127 data_ptr = (const char *) extent in btrfs_readlink()
130 memcpy(target, data_ptr, extent->ram_bytes); in btrfs_readlink()
131 target[extent->ram_bytes] = '\0'; in btrfs_readlink()
324 struct btrfs_file_extent_item *extent; in btrfs_file_read() local
349 extent = btrfs_path_item_ptr(&path, in btrfs_file_read()
353 btrfs_file_extent_item_to_cpu_inl(extent); in btrfs_file_read()
[all …]
/openbmc/linux/kernel/
H A Duser_namespace.c324 if (extent) in map_id_range_down()
325 id = (id - extent->first) + extent->lower_first; in map_id_range_down()
387 if (extent) in map_id_up()
388 id = (id - extent->lower_first) + extent->first; in map_id_up()
613 extent->first, in uid_m_show()
615 extent->count); in uid_m_show()
634 extent->first, in gid_m_show()
655 extent->first, in projid_m_show()
1019 if ((extent.first + extent.count) <= extent.first) in map_write()
1021 if ((extent.lower_first + extent.count) <= in map_write()
[all …]
H A Duser.c31 .extent[0] = {
41 .extent[0] = {
51 .extent[0] = {
/openbmc/linux/Documentation/filesystems/ext4/
H 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 …]
/openbmc/linux/fs/hfs/
H 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 …]
/openbmc/linux/arch/parisc/math-emu/
H 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 …]
H 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 …]
H 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 …]
H 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 …]
H 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 …]
H 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 …]
/openbmc/linux/Documentation/filesystems/
H 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 …]
H 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
/openbmc/linux/fs/hfsplus/
H 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 …]
H A Dwrapper.c95 u32 extent; in hfsplus_read_mdb() local
118 extent = get_unaligned_be32(bufptr + HFSP_WRAPOFF_EMBEDEXT); in hfsplus_read_mdb()
119 wd->embed_start = (extent >> 16) & 0xFFFF; in hfsplus_read_mdb()
120 wd->embed_count = extent & 0xFFFF; in hfsplus_read_mdb()
/openbmc/linux/fs/btrfs/
H A DMakefile25 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 \
45 tests/extent-buffer-tests.o tests/btrfs-tests.o \
46 tests/extent-io-tests.o tests/inode-tests.o tests/qgroup-tests.o \
47 tests/free-space-tree-tests.o tests/extent-map-tests.o
H A Dreflink.c372 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()
/openbmc/linux/mm/
H A Dmremap.c445 extent = next - old_addr; in get_extent()
446 if (extent > old_end - old_addr) in get_extent()
447 extent = old_end - old_addr; in get_extent()
449 if (extent > next - new_addr) in get_extent()
450 extent = next - new_addr; in get_extent()
451 return extent; in get_extent()
504 unsigned long extent, old_end; in move_page_tables() local
523 for (; old_addr < old_end; old_addr += extent, new_addr += extent) { in move_page_tables()
538 if (extent == HPAGE_PUD_SIZE) { in move_page_tables()
561 if (extent == HPAGE_PMD_SIZE && in move_page_tables()
[all …]
/openbmc/qemu/tests/qemu-iotests/
H A D078.out17 == Negative extent size ==
20 == Zero extent size ==
/openbmc/linux/fs/
H A Dioctl.c115 struct fiemap_extent extent; in fiemap_fill_next_extent() local
138 memset(&extent, 0, sizeof(extent)); in fiemap_fill_next_extent()
139 extent.fe_logical = logical; in fiemap_fill_next_extent()
140 extent.fe_physical = phys; in fiemap_fill_next_extent()
141 extent.fe_length = len; in fiemap_fill_next_extent()
142 extent.fe_flags = flags; in fiemap_fill_next_extent()
145 if (copy_to_user(dest, &extent, sizeof(extent))) in fiemap_fill_next_extent()
/openbmc/linux/arch/m68k/fpsp040/
H A DREADME10 To the maximum extent permitted by applicable law,
17 To the maximum extent permitted by applicable law,
/openbmc/linux/Documentation/ABI/testing/
H 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

12345678910>>...14