Home
last modified time | relevance | path

Searched full:bitmaps (Results 1 – 25 of 164) sorted by relevance

1234567

/linux/tools/testing/selftests/kvm/lib/
H A Dmemstress.c340 void memstress_get_dirty_log(struct kvm_vm *vm, unsigned long *bitmaps[], int slots) in memstress_get_dirty_log() argument
347 kvm_vm_get_dirty_log(vm, slot, bitmaps[i]); in memstress_get_dirty_log()
351 void memstress_clear_dirty_log(struct kvm_vm *vm, unsigned long *bitmaps[], in memstress_clear_dirty_log() argument
359 kvm_vm_clear_dirty_log(vm, slot, bitmaps[i], 0, pages_per_slot); in memstress_clear_dirty_log()
365 unsigned long **bitmaps; in memstress_alloc_bitmaps() local
368 bitmaps = malloc(slots * sizeof(bitmaps[0])); in memstress_alloc_bitmaps()
369 TEST_ASSERT(bitmaps, "Failed to allocate bitmaps array."); in memstress_alloc_bitmaps()
372 bitmaps[ in memstress_alloc_bitmaps()
379 memstress_free_bitmaps(unsigned long * bitmaps[],int slots) memstress_free_bitmaps() argument
[all...]
/linux/net/sched/
H A Dsch_qfq.c86 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. */
768 unsigned long mask = mask_from(q->bitmaps[ER], grp->index); in qfq_calc_state()
783 * q->bitmaps[dst] |= q->bitmaps[src] & mask;
784 * q->bitmaps[src] &= ~mask;
790 q->bitmaps[dst] |= q->bitmaps[src] & mask; in qfq_move_groups()
791 q->bitmaps[src] &= ~mask; in qfq_move_groups()
796 unsigned long mask = mask_from(q->bitmaps[ER], index + 1); in qfq_unblock_groups()
[all …]
/linux/fs/btrfs/
H A Dsubpage.c97 real_size = struct_size(ret, bitmaps, in btrfs_alloc_folio_state()
307 bitmap_test_range_all_set(__bfs->bitmaps, \
316 bitmap_test_range_all_zero(__bfs->bitmaps, \
329 bitmap_set(bfs->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_set_uptodate()
344 bitmap_clear(bfs->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_clear_uptodate()
392 bitmap_set(bfs->bitmaps, dirty_bit, nbits); in btrfs_subpage_set_dirty()
394 bitmap_clear(bfs->bitmaps, fixup_bit, nbits); in btrfs_subpage_set_dirty()
439 bitmap_clear(bfs->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_clear_and_test_dirty()
465 bitmap_set(bfs->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_set_writeback()
492 bitmap_clear(bfs->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_clear_writeback()
[all …]
H A Dfree-space-cache.c714 * 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()
1071 int *entries, int *bitmaps, in write_cache_extent_entries() argument
1108 *bitmaps += 1; in write_cache_extent_entries()
1149 int entries, int bitmaps) in update_cache_item() argument
1186 btrfs_set_free_space_bitmaps(leaf, header, bitmaps); in update_cache_item()
1246 /* Write out the bitmaps */ in write_bitmap_entries()
[all …]
/linux/drivers/net/ethernet/qualcomm/ppe/
H A Dppe_config.h107 /* Hardware bitmaps for bypassing features of the ingress packet. */
140 /* Hardware bitmaps for bypassing features of the egress packet. */
170 /* Hardware bitmaps for bypassing counter of packet. */
180 /* Hardware bitmaps for bypassing features of tunnel packet. */
207 * struct ppe_sc_bypass - PPE service bypass bitmaps
224 * @bitmaps: Bitmap of bypass features.
237 struct ppe_sc_bypass bitmaps; member
H A Dppe_config.c1133 bitmap_value = bitmap_read(cfg.bitmaps.egress, 0, PPE_SC_BYPASS_EGRESS_SIZE); in ppe_sc_config_set()
1136 test_bit(PPE_SC_BYPASS_COUNTER_RX, cfg.bitmaps.counter)); in ppe_sc_config_set()
1138 test_bit(PPE_SC_BYPASS_COUNTER_TX, cfg.bitmaps.counter)); in ppe_sc_config_set()
1145 bitmap_value = bitmap_read(cfg.bitmaps.ingress, 0, PPE_SC_BYPASS_INGRESS_SIZE); in ppe_sc_config_set()
1148 test_bit(PPE_SC_BYPASS_COUNTER_RX_VLAN, cfg.bitmaps.counter)); in ppe_sc_config_set()
1167 test_bit(PPE_SC_BYPASS_COUNTER_TX_VLAN, cfg.bitmaps.counter)); in ppe_sc_config_set()
1174 bitmap_value = bitmap_read(cfg.bitmaps.tunnel, 0, PPE_SC_BYPASS_TUNNEL_SIZE); in ppe_sc_config_set()
1797 bitmap_zero(sc_cfg.bitmaps.counter, PPE_SC_BYPASS_COUNTER_SIZE); in ppe_servcode_init()
1798 bitmap_zero(sc_cfg.bitmaps.tunnel, PPE_SC_BYPASS_TUNNEL_SIZE); in ppe_servcode_init()
1800 bitmap_fill(sc_cfg.bitmaps.ingress, PPE_SC_BYPASS_INGRESS_SIZE); in ppe_servcode_init()
[all …]
/linux/tools/testing/selftests/kvm/include/
H A Dmemstress.h76 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/tools/testing/selftests/kvm/x86/
H A Ddirty_log_page_splitting_test.c91 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/fs/minix/
H A Dminix.h110 * big-endian 32 or 64 bit indexed bitmaps on big-endian system or
111 * little-endian bitmaps on little-endian system
128 * big-endian 16bit indexed bitmaps
165 * little-endian bitmaps
/linux/net/ethtool/
H A Dbitset.c9 /* Some bitmaps are internally represented as an array of unsigned long, some
12 * suffix in their names expect u32 based bitmaps, those without it expect
13 * unsigned long bitmaps.
430 * ethnl_bitmap32_equal() - Compare two bitmaps
588 * set to values from value. Bitmaps in the attribute may be longer than
634 * @nbits: size of @val and @mask bitmaps
639 * Provide @nbits size long bitmaps for value and mask so that
728 /* 64-bit big endian architectures are the only case when u32 based bitmaps
729 * and unsigned long based bitmaps have different memory layout so that we
734 * variables for bitmaps up to ETHNL_SMALL_BITMAP_BITS bits which is the
[all …]
/linux/arch/arm/include/asm/
H A Ddma-iommu.h15 unsigned long **bitmaps; /* array of bitmaps */ member
/linux/Documentation/filesystems/ext4/
H A Dbigalloc.rst21 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
H A Dgroup_descr.rst13 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/arch/arm/mm/
H A Ddma-mapping.c773 start = bitmap_find_next_zero_area(mapping->bitmaps[i], in __alloc_iova()
779 bitmap_set(mapping->bitmaps[i], start, count); in __alloc_iova()
794 start = bitmap_find_next_zero_area(mapping->bitmaps[i], in __alloc_iova()
802 bitmap_set(mapping->bitmaps[i], start, count); in __alloc_iova()
843 bitmap_clear(mapping->bitmaps[bitmap_index], start, count); in __free_iova()
1512 mapping->bitmaps = kcalloc(extensions, sizeof(unsigned long *), in arm_iommu_create_mapping()
1514 if (!mapping->bitmaps) in arm_iommu_create_mapping()
1517 mapping->bitmaps[0] = kzalloc(bitmap_size, GFP_KERNEL); in arm_iommu_create_mapping()
1518 if (!mapping->bitmaps[0]) in arm_iommu_create_mapping()
1537 kfree(mapping->bitmaps[0]); in arm_iommu_create_mapping()
[all …]
/linux/tools/testing/selftests/kvm/
H A Ddirty_log_perf_test.c108 unsigned long **bitmaps; in run_test() local
131 bitmaps = memstress_alloc_bitmaps(p->slots, pages_per_slot); in run_test()
199 memstress_get_dirty_log(vm, bitmaps, p->slots); in run_test()
208 memstress_clear_dirty_log(vm, bitmaps, p->slots, in run_test()
253 memstress_free_bitmaps(bitmaps, p->slots); in run_test()
/linux/net/rds/
H A Dcong.c55 * 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/lib/
H A Dregion_alloc_benchmark.c63 unsigned long bitmaps = nr_ids / IDA_BITMAP_BITS; in ida_size() local
67 bitmaps++; in ida_size()
75 bitmaps * sizeof(struct ida_bitmap) + in ida_size()
H A Dbitmap.c17 * bitmaps provide an array of bits, implemented using an
31 * The byte ordering of bitmaps is more natural on little
485 * bitmap_remap - Apply map defined by a pair of bitmaps to another bitmap
490 * @nbits: number of bits in each of these bitmaps
499 * If either of the @old and @new bitmaps are empty, or if @src and
539 * bitmap_bitremap - Apply map defined by a pair of bitmaps to a single bit
543 * @bits: number of bits in each of these bitmaps
582 * @bits: number of bits in each of these bitmaps
716 * @nbits: number of bits in each of these bitmaps
/linux/include/linux/
H A Dbitmap.h20 * bitmaps provide bit arrays that consume one or more unsigned
104 * Also the following operations in asm/bitops.h apply to bitmaps.::
296 * On 32-bit systems bitmaps are represented as u32 arrays internally. On LE64
318 * On 64-bit systems bitmaps are represented as u64 arrays internally. So,
421 * bitmap_or_equal - Check whether the or of two bitmaps is equal to a third
425 * @nbits: number of bits in each of these bitmaps
603 * @nbits: number of bits in each of these bitmaps
651 * @nbits: number of bits in each of these bitmaps
770 * Linux bitmaps are internally arrays of unsigned longs, i.e. 32-bit
777 * bitmaps and therefore don't require any special handling.
/linux/Documentation/admin-guide/device-mapper/
H A Ddm-zoned.rst77 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/drivers/net/ethernet/mellanox/mlx5/core/steering/sws/
H A Ddr_buddy.c25 /* Allocating max_order bitmaps, one for each order */ in mlx5dr_buddy_init()
36 * use (the biggest one), so mark the first bit in both bitmaps. in mlx5dr_buddy_init()
/linux/drivers/net/ipa/
H A Dipa.h57 * @endpoint_count: Number of defined bits in most bitmaps below
113 /* Bitmaps indicating endpoint state */
/linux/Documentation/driver-api/md/
H A Dmd-cluster.rst12 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/fs/ext4/
H A Dballoc.c11 * Big-endian to little-endian byte-swapping/bitmaps by
128 * For the allocation bitmaps, we first need to check to see in ext4_num_overhead_clusters()
210 /* Set bits for block and inode bitmaps, and inode table */ in ext4_init_block_bitmap()
248 * The free blocks are managed by bitmaps. A file system contains several
361 /* with FLEX_BG, the inode/block bitmaps and itable in ext4_valid_block_bitmap()
364 * or it has to also read the block group where the bitmaps in ext4_valid_block_bitmap()
463 * bits for block/inode/inode tables are set in the bitmaps
/linux/Documentation/input/devices/
H A Dalps.rst173 The second packet type contains bitmaps representing the x and y axes. In the
174 bitmaps a given bit is set if there is a finger covering that position on the
232 2) The bitmaps represent the same data as in the v3 bitmap packets, although
237 analyzing the bitmaps.

1234567