/Linux-v6.1/tools/testing/selftests/kvm/ |
D | dirty_log_perf_test.c | 159 static void get_dirty_log(struct kvm_vm *vm, unsigned long *bitmaps[], int slots) in get_dirty_log() argument 166 kvm_vm_get_dirty_log(vm, slot, bitmaps[i]); in get_dirty_log() 170 static void clear_dirty_log(struct kvm_vm *vm, unsigned long *bitmaps[], in clear_dirty_log() argument 178 kvm_vm_clear_dirty_log(vm, slot, bitmaps[i], 0, pages_per_slot); in clear_dirty_log() 184 unsigned long **bitmaps; in alloc_bitmaps() local 187 bitmaps = malloc(slots * sizeof(bitmaps[0])); in alloc_bitmaps() 188 TEST_ASSERT(bitmaps, "Failed to allocate bitmaps array."); in alloc_bitmaps() 191 bitmaps[i] = bitmap_zalloc(pages_per_slot); in alloc_bitmaps() 192 TEST_ASSERT(bitmaps[i], "Failed to allocate slot bitmap."); in alloc_bitmaps() 195 return bitmaps; in alloc_bitmaps() [all …]
|
/Linux-v6.1/fs/reiserfs/ |
D | resize.c | 83 /* resizing of reiserfs bitmaps (journal and real), if needed */ in reiserfs_resize() 85 /* reallocate journal bitmaps */ in reiserfs_resize() 88 ("reiserfs_resize: unable to allocate memory for journal bitmaps\n"); in reiserfs_resize() 92 * the new journal bitmaps are zero filled, now we copy i in reiserfs_resize() 106 memcpy(jbitmap[i].bitmaps, jb->bitmaps, copy_size); in reiserfs_resize() 113 node_tmp = jb->bitmaps; in reiserfs_resize() 114 jb->bitmaps = jbitmap[i].bitmaps; in reiserfs_resize() 127 * Journal bitmaps are still supersized, but the in reiserfs_resize() 139 * journal transaction begins, and the new bitmaps don't in reiserfs_resize() 175 * incorrect bitmaps now, but none of it is ever going to touch the in reiserfs_resize()
|
/Linux-v6.1/Documentation/filesystems/ext4/ |
D | blockgroup.rst | 46 of the block bitmaps to allow for future expansion of the filesystem. By 56 present, will be at the beginning of the block group. The bitmaps and 58 bitmaps to come after the inode table, or for both to be in different 68 first block group of the flex_bg are expanded to include the bitmaps 71 superblock, group descriptors, data block bitmaps for groups 0-3, inode 72 bitmaps for groups 0-3, inode tables for groups 0-3, and the remaining 117 block and inode bitmaps. 125 that the inode and block bitmaps for that group can be calculated and 132 By not writing zeroes to the bitmaps and inode table, mkfs time is
|
D | bitmaps.rst | 3 Block and inode Bitmaps 11 As with most bitmaps, one bit represents the usage status of one data 19 the bitmaps and group descriptor live inside the group. Unfortunately,
|
D | bigalloc.rst | 21 bitmaps for a 2T file system from 64 megabytes to 256 kilobytes. It also 27 on, the block bitmaps track clusters, not individual blocks. This means
|
D | group_descr.rst | 13 Notice how the group descriptor records the location of both bitmaps and 18 of the groups' bitmaps and inode tables into one long run in the first
|
D | globals.rst | 11 .. include:: bitmaps.rst
|
/Linux-v6.1/net/sched/ |
D | sch_qfq.c | 86 for the scheduler: bitmaps and bucket lists. 120 * Possible group states. These values are used as indexes for the bitmaps 189 unsigned long bitmaps[QFQ_MAX_STATE]; /* Group bitmaps. */ member 191 u32 min_slot_shift; /* Index of the group-0 bit in the bitmaps. */ 742 unsigned long mask = mask_from(q->bitmaps[ER], grp->index); in qfq_calc_state() 757 * q->bitmaps[dst] |= q->bitmaps[src] & mask; 758 * q->bitmaps[src] &= ~mask; 764 q->bitmaps[dst] |= q->bitmaps[src] & mask; in qfq_move_groups() 765 q->bitmaps[src] &= ~mask; in qfq_move_groups() 770 unsigned long mask = mask_from(q->bitmaps[ER], index + 1); in qfq_unblock_groups() [all …]
|
/Linux-v6.1/fs/btrfs/ |
D | subpage.c | 166 real_size = struct_size(ret, bitmaps, in btrfs_alloc_subpage() 402 bitmap_test_range_all_set(subpage->bitmaps, \ 407 bitmap_test_range_all_zero(subpage->bitmaps, \ 420 bitmap_set(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_set_uptodate() 435 bitmap_clear(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_clear_uptodate() 449 bitmap_set(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_set_error() 463 bitmap_clear(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_clear_error() 478 bitmap_set(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_set_dirty() 503 bitmap_clear(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_clear_and_test_dirty() 529 bitmap_set(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_set_writeback() [all …]
|
D | free-space-cache.c | 723 * bitmaps, we may end up using more memory than this. in recalculate_thresholds() 753 LIST_HEAD(bitmaps); in __load_free_space_cache() 873 list_add_tail(&e->list, &bitmaps); in __load_free_space_cache() 882 * We add the bitmaps at the end of the entries in order that in __load_free_space_cache() 885 list_for_each_entry_safe(e, n, &bitmaps, list) { in __load_free_space_cache() 1074 int *entries, int *bitmaps, in write_cache_extent_entries() argument 1111 *bitmaps += 1; in write_cache_extent_entries() 1152 int entries, int bitmaps) in update_cache_item() argument 1189 btrfs_set_free_space_bitmaps(leaf, header, bitmaps); in update_cache_item() 1257 /* Write out the bitmaps */ in write_bitmap_entries() [all …]
|
D | subpage.h | 11 * For subpage we pack all uptodate/error/dirty/writeback/ordered bitmaps into 69 unsigned long bitmaps[]; member
|
/Linux-v6.1/fs/minix/ |
D | minix.h | 104 * big-endian 32 or 64 bit indexed bitmaps on big-endian system or 105 * little-endian bitmaps on little-endian system 122 * big-endian 16bit indexed bitmaps 159 * little-endian bitmaps
|
/Linux-v6.1/net/ethtool/ |
D | bitset.c | 8 /* Some bitmaps are internally represented as an array of unsigned long, some 11 * suffix in their names expect u32 based bitmaps, those without it expect 12 * unsigned long bitmaps. 547 * set to values from value. Bitmaps in the attribute may be longer than 593 * @nbits: size of @val and @mask bitmaps 598 * Provide @nbits size long bitmaps for value and mask so that 687 /* 64-bit big endian architectures are the only case when u32 based bitmaps 688 * and unsigned long based bitmaps have different memory layout so that we 693 * variables for bitmaps up to ETHNL_SMALL_BITMAP_BITS bits which is the 694 * majority of bitmaps used by ethtool.
|
/Linux-v6.1/arch/arm/include/asm/ |
D | dma-iommu.h | 15 unsigned long **bitmaps; /* array of bitmaps */ member
|
/Linux-v6.1/arch/arm/mm/ |
D | dma-mapping.c | 779 start = bitmap_find_next_zero_area(mapping->bitmaps[i], in __alloc_iova() 785 bitmap_set(mapping->bitmaps[i], start, count); in __alloc_iova() 800 start = bitmap_find_next_zero_area(mapping->bitmaps[i], in __alloc_iova() 808 bitmap_set(mapping->bitmaps[i], start, count); in __alloc_iova() 849 bitmap_clear(mapping->bitmaps[bitmap_index], start, count); in __free_iova() 1585 mapping->bitmaps = kcalloc(extensions, sizeof(unsigned long *), in arm_iommu_create_mapping() 1587 if (!mapping->bitmaps) in arm_iommu_create_mapping() 1590 mapping->bitmaps[0] = kzalloc(bitmap_size, GFP_KERNEL); in arm_iommu_create_mapping() 1591 if (!mapping->bitmaps[0]) in arm_iommu_create_mapping() 1608 kfree(mapping->bitmaps[0]); in arm_iommu_create_mapping() [all …]
|
/Linux-v6.1/net/rds/ |
D | cong.c | 55 * This is implemented by having each node maintain bitmaps which indicate 60 * The bitmaps are allocated as connections are brought up. This avoids 62 * The dense bitmaps let transports send the entire bitmap on any bitmap change 135 * these bitmaps in the process getting pointers to them. The bitmaps are only
|
/Linux-v6.1/include/linux/ |
D | bitmap.h | 17 * bitmaps provide bit arrays that consume one or more unsigned 91 * Also the following operations in asm/bitops.h apply to bitmaps.:: 283 * On 32-bit systems bitmaps are represented as u32 arrays internally. On LE64 305 * On 64-bit systems bitmaps are represented as u64 arrays internally. On LE32 382 * bitmap_or_equal - Check whether the or of two bitmaps is equal to a third 386 * @nbits: number of bits in each of these bitmaps 527 * Linux bitmaps are internally arrays of unsigned longs, i.e. 32-bit 534 * bitmaps and therefore don't require any special handling.
|
/Linux-v6.1/fs/btrfs/tests/ |
D | free-space-tree-tests.c | 141 test_err("could not convert to bitmaps"); in check_free_space_extents() 423 static int run_test(test_func_t test_func, int bitmaps, u32 sectorsize, in run_test() argument 491 if (bitmaps) { in run_test() 494 test_err("could not convert block group to bitmaps"); in run_test() 541 "%ps failed with bitmaps, sectorsize=%u, nodesize=%u, alignment=%u", in run_test_both_formats()
|
D | free-space-tests.c | 132 /* Test a bit straddling two bitmaps */ in test_bitmaps() 136 test_err("couldn't add space that straddles two bitmaps %d", in test_bitmaps() 423 * that forces use of bitmaps as soon as we have at least 1 in test_steal_space_from_bitmap_to_extent() 870 /* Now validate bitmaps do the correct thing. */ in test_bytes_index() 893 /* Now validate bitmaps with different ->max_extent_size. */ in test_bytes_index() 926 * ->max_extent_size is larger than the first bitmaps. in test_bytes_index() 1022 * alloc dummy block group whose size cross bitmaps. in btrfs_test_free_space_cache()
|
/Linux-v6.1/Documentation/admin-guide/device-mapper/ |
D | dm-zoned.rst | 77 3) A set of blocks used to store bitmaps indicating the validity of 99 information provided by the bitmaps. Valid blocks are read either from 135 a third set of metadata (without the zone bitmaps) is written to the
|
/Linux-v6.1/fs/ext4/ |
D | balloc.c | 11 * Big-endian to little-endian byte-swapping/bitmaps by 102 * For the allocation bitmaps and inode table, we first need in ext4_num_overhead_clusters() 209 /* Set bits for block and inode bitmaps, and inode table */ in ext4_init_block_bitmap() 247 * The free blocks are managed by bitmaps. A file system contains several 323 /* with FLEX_BG, the inode/block bitmaps and itable in ext4_valid_block_bitmap() 326 * or it has to also read the block group where the bitmaps in ext4_valid_block_bitmap() 417 * bits for block/inode/inode tables are set in the bitmaps
|
/Linux-v6.1/block/partitions/ |
D | ldm.h | 84 #define TOC_BITMAP2 "log" /* bitmaps in the TOCBLOCK. */ 107 struct tocblock { /* We have exactly two bitmaps. */
|
/Linux-v6.1/drivers/net/ethernet/mellanox/mlx5/core/steering/ |
D | dr_buddy.c | 31 /* Allocating max_order bitmaps, one for each order */ in mlx5dr_buddy_init() 42 * use (the biggest one), so mark the first bit in both bitmaps. in mlx5dr_buddy_init()
|
/Linux-v6.1/Documentation/driver-api/md/ |
D | md-cluster.rst | 12 Separate write-intent-bitmaps are used for each cluster node. 13 The bitmaps record all writes that may have been started on that node, 43 The bm_lockres protects individual node bitmaps. They are named in 368 gathers bitmap information from all bitmaps. This combined
|
/Linux-v6.1/block/ |
D | blk-zoned.c | 541 * blk_revalidate_disk_zones - (re)allocate and initialize zone bitmaps 546 * a disk request queue zone bitmaps. This functions should normally be called 596 * Install the new bitmaps and update nr_zones only once the queue is in blk_revalidate_disk_zones() 598 * referencing the bitmaps). in blk_revalidate_disk_zones()
|