/openbmc/qemu/block/ |
H A D | vmdk.c | 536 VmdkExtent *extent; in vmdk_add_extent() local 571 extent = &s->extents[s->num_extents]; in vmdk_add_extent() 574 memset(extent, 0, sizeof(VmdkExtent)); in vmdk_add_extent() 575 extent->file = file; in vmdk_add_extent() 576 extent->flat = flat; in vmdk_add_extent() 577 extent->sectors = sectors; in vmdk_add_extent() 578 extent->l1_table_offset = l1_offset; in vmdk_add_extent() 579 extent->l1_backup_table_offset = l1_backup_offset; in vmdk_add_extent() 580 extent->l1_size = l1_size; in vmdk_add_extent() 581 extent->l1_entry_sectors = l2_size * cluster_sectors; in vmdk_add_extent() [all …]
|
H A D | nbd.c | 620 NBDExtent64 *extent, Error **errp) in nbd_parse_blockstatus_payload() argument 624 size_t ext_len = wide ? sizeof(*extent) : sizeof(NBDExtent32); in nbd_parse_blockstatus_payload() 645 extent->length = payload_advance64(&payload); in nbd_parse_blockstatus_payload() 646 extent->flags = payload_advance64(&payload); in nbd_parse_blockstatus_payload() 649 extent->length = payload_advance32(&payload); in nbd_parse_blockstatus_payload() 650 extent->flags = payload_advance32(&payload); in nbd_parse_blockstatus_payload() 653 if (extent->length == 0) { in nbd_parse_blockstatus_payload() 671 if (s->info.min_block && !QEMU_IS_ALIGNED(extent->length, in nbd_parse_blockstatus_payload() 674 if (extent->length > s->info.min_block) { in nbd_parse_blockstatus_payload() 675 extent->length = QEMU_ALIGN_DOWN(extent->length, in nbd_parse_blockstatus_payload() [all …]
|
/openbmc/linux/kernel/ |
H A D | user_namespace.c | 303 first = map->extent[idx].first; in map_id_range_down_base() 304 last = first + map->extent[idx].count - 1; in map_id_range_down_base() 307 return &map->extent[idx]; in map_id_range_down_base() 314 struct uid_gid_extent *extent; in map_id_range_down() local 319 extent = map_id_range_down_base(extents, map, id, count); in map_id_range_down() 321 extent = map_id_range_down_max(extents, map, id, count); in map_id_range_down() 324 if (extent) in map_id_range_down() 325 id = (id - extent->first) + extent->lower_first; in map_id_range_down() 350 first = map->extent[idx].lower_first; in map_id_up_base() 351 last = first + map->extent[idx].count - 1; in map_id_up_base() [all …]
|
H A D | user.c | 31 .extent[0] = { 41 .extent[0] = { 51 .extent[0] = {
|
/openbmc/u-boot/fs/btrfs/ |
H A D | extent-io.c | 13 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 D | inode.c | 90 struct btrfs_file_extent_item *extent; in btrfs_readlink() local 104 extent = btrfs_path_item_ptr(&path, struct btrfs_file_extent_item); in btrfs_readlink() 105 if (extent->type != BTRFS_FILE_EXTENT_INLINE) { in btrfs_readlink() 111 btrfs_file_extent_item_to_cpu_inl(extent); in btrfs_readlink() 113 if (extent->compression != BTRFS_COMPRESS_NONE) { in btrfs_readlink() 117 } else if (extent->encryption != 0) { in btrfs_readlink() 121 } else if (extent->ram_bytes >= btrfs_info.sb.sectorsize) { 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() [all …]
|
/openbmc/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 …]
|
/openbmc/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 …]
|
/openbmc/linux/arch/parisc/math-emu/ |
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 | 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 | 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 …]
|
/openbmc/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
|
/openbmc/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 | 95 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 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 \ 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 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()
|
/openbmc/linux/mm/ |
H A D | mremap.c | 425 unsigned long next, extent, mask, size; in get_extent() local 445 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() 529 extent = get_extent(NORMAL_PUD, old_addr, old_end, new_addr); in move_page_tables() [all …]
|
/openbmc/linux/fs/ |
H A D | ioctl.c | 115 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/qemu/tests/qemu-iotests/ |
H A D | 078.out | 17 == Negative extent size == 20 == Zero extent size ==
|
/openbmc/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
|
/openbmc/openbmc/poky/meta/files/common-licenses/ |
H A D | CC-BY-4.0 | 3 …ommons disclaims all liability for damages resulting from their use to the fullest extent possible. 15 … Attribution 4.0 International Public License ("Public License"). To the extent this Public Licens… 67 …owever, to the extent possible, the Licensor waives and/or agrees not to assert any such rights he… 71 …3. To the extent possible, the Licensor waives any right to collect royalties from You for the exe… 91 … v. a URI or hyperlink to the Licensed Material to the extent reasonably practicable; 99 …must remove any of the information required by Section 3(a)(1)(A) to the extent reasonably practic… 116 …a. Unless otherwise separately undertaken by the Licensor, to the extent possible, the Licensor of… 118 …b. To the extent possible, in no event will the Licensor be liable to You on any legal theory (inc… 120 …f liability provided above shall be interpreted in a manner that, to the extent possible, most clo… 148 …To the extent possible, if any provision of this Public License is deemed unenforceable, it shall …
|