| /linux-6.14.4/tools/testing/selftests/kvm/lib/ |
| D | memstress.c | 344 void memstress_get_dirty_log(struct kvm_vm *vm, unsigned long *bitmaps[], int slots) in memstress_get_dirty_log() argument
351 kvm_vm_get_dirty_log(vm, slot, bitmaps[i]); in memstress_get_dirty_log()
355 void memstress_clear_dirty_log(struct kvm_vm *vm, unsigned long *bitmaps[], in memstress_clear_dirty_log() argument
363 kvm_vm_clear_dirty_log(vm, slot, bitmaps[i], 0, pages_per_slot); in memstress_clear_dirty_log()
369 unsigned long **bitmaps; in memstress_alloc_bitmaps() local
372 bitmaps = malloc(slots * sizeof(bitmaps[0])); in memstress_alloc_bitmaps()
373 TEST_ASSERT(bitmaps, "Failed to allocate bitmaps array."); in memstress_alloc_bitmaps()
376 bitmaps[i] = bitmap_zalloc(pages_per_slot); in memstress_alloc_bitmaps()
377 TEST_ASSERT(bitmaps[i], "Failed to allocate slot bitmap."); in memstress_alloc_bitmaps()
380 return bitmaps; in memstress_alloc_bitmaps()
[all …]
|
| /linux-6.14.4/fs/btrfs/ |
| D | subpage.c | 136 real_size = struct_size(ret, bitmaps, in btrfs_alloc_subpage()
266 for_each_set_bit_from(bit, subpage->bitmaps, start_bit + nbits) { in btrfs_subpage_end_and_test_lock()
267 clear_bit(bit, subpage->bitmaps); in btrfs_subpage_end_and_test_lock()
345 if (test_and_clear_bit(bit + start_bit, subpage->bitmaps)) in btrfs_folio_end_lock_bitmap()
356 bitmap_test_range_all_set(subpage->bitmaps, \
361 bitmap_test_range_all_zero(subpage->bitmaps, \
374 bitmap_set(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_set_uptodate()
389 bitmap_clear(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_clear_uptodate()
403 bitmap_set(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_set_dirty()
428 bitmap_clear(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_clear_and_test_dirty()
[all …]
|
| D | free-space-cache.c | 714 * bitmaps, we may end up using more memory than this. in recalculate_thresholds()
744 LIST_HEAD(bitmaps); in __load_free_space_cache()
866 list_add_tail(&e->list, &bitmaps); in __load_free_space_cache()
875 * We add the bitmaps at the end of the entries in order that in __load_free_space_cache()
878 list_for_each_entry_safe(e, n, &bitmaps, list) { in __load_free_space_cache()
1073 int *entries, int *bitmaps, in write_cache_extent_entries() argument
1110 *bitmaps += 1; in write_cache_extent_entries()
1151 int entries, int bitmaps) in update_cache_item() argument
1188 btrfs_set_free_space_bitmaps(leaf, header, bitmaps); in update_cache_item()
1254 /* Write out the bitmaps */ in write_bitmap_entries()
[all …]
|
| D | subpage.h | 17 * For subpage we pack all uptodate/dirty/writeback/ordered bitmaps into
64 unsigned long bitmaps[]; member
|
| /linux-6.14.4/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
|
| /linux-6.14.4/net/sched/ |
| D | sch_qfq.c | 86 for the scheduler: bitmaps and bucket lists.
121 * Possible group states. These values are used as indexes for the bitmaps
188 unsigned long bitmaps[QFQ_MAX_STATE]; /* Group bitmaps. */ member
190 u32 min_slot_shift; /* Index of the group-0 bit in the bitmaps. */
750 unsigned long mask = mask_from(q->bitmaps[ER], grp->index); in qfq_calc_state()
765 * q->bitmaps[dst] |= q->bitmaps[src] & mask;
766 * q->bitmaps[src] &= ~mask;
772 q->bitmaps[dst] |= q->bitmaps[src] & mask; in qfq_move_groups()
773 q->bitmaps[src] &= ~mask; in qfq_move_groups()
778 unsigned long mask = mask_from(q->bitmaps[ER], index + 1); in qfq_unblock_groups()
[all …]
|
| /linux-6.14.4/tools/testing/selftests/kvm/include/ |
| D | memstress.h | 76 void memstress_get_dirty_log(struct kvm_vm *vm, unsigned long *bitmaps[], int slots);
77 void memstress_clear_dirty_log(struct kvm_vm *vm, unsigned long *bitmaps[],
80 void memstress_free_bitmaps(unsigned long *bitmaps[], int slots);
|
| /linux-6.14.4/tools/testing/selftests/kvm/x86/ |
| D | dirty_log_page_splitting_test.c | 91 unsigned long **bitmaps; in run_test() local
114 bitmaps = memstress_alloc_bitmaps(SLOTS, pages_per_slot); in run_test()
142 memstress_get_dirty_log(vm, bitmaps, SLOTS); in run_test()
145 memstress_clear_dirty_log(vm, bitmaps, SLOTS, pages_per_slot); in run_test()
168 memstress_free_bitmaps(bitmaps, SLOTS); in run_test()
|
| /linux-6.14.4/fs/minix/ |
| D | minix.h | 105 * big-endian 32 or 64 bit indexed bitmaps on big-endian system or
106 * little-endian bitmaps on little-endian system
123 * big-endian 16bit indexed bitmaps
160 * little-endian bitmaps
|
| /linux-6.14.4/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.
429 * ethnl_bitmap32_equal() - Compare two bitmaps
587 * set to values from value. Bitmaps in the attribute may be longer than
633 * @nbits: size of @val and @mask bitmaps
638 * Provide @nbits size long bitmaps for value and mask so that
727 /* 64-bit big endian architectures are the only case when u32 based bitmaps
728 * and unsigned long based bitmaps have different memory layout so that we
733 * variables for bitmaps up to ETHNL_SMALL_BITMAP_BITS bits which is the
[all …]
|
| /linux-6.14.4/arch/arm/include/asm/ |
| D | dma-iommu.h | 15 unsigned long **bitmaps; /* array of bitmaps */ member
|
| /linux-6.14.4/arch/arm/mm/ |
| D | dma-mapping.c | 775 start = bitmap_find_next_zero_area(mapping->bitmaps[i], in __alloc_iova()
781 bitmap_set(mapping->bitmaps[i], start, count); in __alloc_iova()
796 start = bitmap_find_next_zero_area(mapping->bitmaps[i], in __alloc_iova()
804 bitmap_set(mapping->bitmaps[i], start, count); in __alloc_iova()
845 bitmap_clear(mapping->bitmaps[bitmap_index], start, count); in __free_iova()
1572 mapping->bitmaps = kcalloc(extensions, sizeof(unsigned long *), in arm_iommu_create_mapping()
1574 if (!mapping->bitmaps) in arm_iommu_create_mapping()
1577 mapping->bitmaps[0] = kzalloc(bitmap_size, GFP_KERNEL); in arm_iommu_create_mapping()
1578 if (!mapping->bitmaps[0]) in arm_iommu_create_mapping()
1597 kfree(mapping->bitmaps[0]); in arm_iommu_create_mapping()
[all …]
|
| /linux-6.14.4/tools/testing/selftests/kvm/ |
| D | dirty_log_perf_test.c | 140 unsigned long **bitmaps; in run_test() local
163 bitmaps = memstress_alloc_bitmaps(p->slots, pages_per_slot); in run_test()
233 memstress_get_dirty_log(vm, bitmaps, p->slots); in run_test()
242 memstress_clear_dirty_log(vm, bitmaps, p->slots, in run_test()
287 memstress_free_bitmaps(bitmaps, p->slots); in run_test()
|
| /linux-6.14.4/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-6.14.4/include/linux/ |
| D | bitmap.h | 20 * bitmaps provide bit arrays that consume one or more unsigned
101 * Also the following operations in asm/bitops.h apply to bitmaps.::
286 * On 32-bit systems bitmaps are represented as u32 arrays internally. On LE64
308 * On 64-bit systems bitmaps are represented as u64 arrays internally. So,
387 * bitmap_or_equal - Check whether the or of two bitmaps is equal to a third
391 * @nbits: number of bits in each of these bitmaps
537 * @nbits: number of bits in each of these bitmaps
585 * @nbits: number of bits in each of these bitmaps
710 * Linux bitmaps are internally arrays of unsigned longs, i.e. 32-bit
717 * bitmaps and therefore don't require any special handling.
|
| /linux-6.14.4/fs/btrfs/tests/ |
| D | free-space-tree-tests.c | 142 test_err("could not convert to bitmaps"); in check_free_space_extents()
424 static int run_test(test_func_t test_func, int bitmaps, u32 sectorsize, in run_test() argument
492 if (bitmaps) { in run_test()
495 test_err("could not convert block group to bitmaps"); in run_test()
542 "%ps failed with bitmaps, sectorsize=%u, nodesize=%u, alignment=%u", in run_test_both_formats()
|
| /linux-6.14.4/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-6.14.4/lib/ |
| D | bitmap.c | 17 * bitmaps provide an array of bits, implemented using an
31 * The byte ordering of bitmaps is more natural on little
466 * bitmap_remap - Apply map defined by a pair of bitmaps to another bitmap
471 * @nbits: number of bits in each of these bitmaps
480 * If either of the @old and @new bitmaps are empty, or if @src and
520 * bitmap_bitremap - Apply map defined by a pair of bitmaps to a single bit
524 * @bits: number of bits in each of these bitmaps
563 * @bits: number of bits in each of these bitmaps
697 * @nbits: number of bits in each of these bitmaps
|
| /linux-6.14.4/drivers/video/fbdev/core/ |
| D | Kconfig | 208 For example, to draw a single character, instead of using bitmaps,
209 an index to an array of bitmaps will be used. To clear or move a
|
| /linux-6.14.4/drivers/net/ethernet/mellanox/mlx5/core/steering/sws/ |
| D | dr_buddy.c | 29 /* Allocating max_order bitmaps, one for each order */ in mlx5dr_buddy_init()
40 * use (the biggest one), so mark the first bit in both bitmaps. in mlx5dr_buddy_init()
|
| /linux-6.14.4/block/partitions/ |
| D | ldm.h | 84 #define TOC_BITMAP2 "log" /* bitmaps in the TOCBLOCK. */
107 struct tocblock { /* We have exactly two bitmaps. */
|
| /linux-6.14.4/drivers/net/ipa/ |
| D | ipa.h | 57 * @endpoint_count: Number of defined bits in most bitmaps below
113 /* Bitmaps indicating endpoint state */
|