| /linux/tools/testing/selftests/kvm/lib/ |
| H A 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/net/sched/ |
| H A 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. */
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/tools/testing/selftests/kvm/include/ |
| H A 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/net/ethtool/ |
| H A 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/fs/btrfs/ |
| H A 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
1109 *bitmaps += 1; in write_cache_extent_entries()
1150 int entries, int bitmaps) in update_cache_item() argument
1187 btrfs_set_free_space_bitmaps(leaf, header, bitmaps); in update_cache_item()
1247 /* Write out the bitmaps */ in write_bitmap_entries()
[all …]
|
| /linux/arch/arm/include/asm/ |
| H A D | dma-iommu.h | 15 unsigned long **bitmaps; /* array of bitmaps */ member
|
| /linux/arch/arm/mm/ |
| H A D | dma-mapping.c | 773 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/Documentation/filesystems/ext4/ |
| H A 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
|
| H A 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/net/rds/ |
| H A 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/Documentation/admin-guide/device-mapper/ |
| H A 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/kernel/liveupdate/ |
| H A D | kexec_handover.c | 71 * PAGE_SIZE byte bitmaps. For instance if PAGE_SIZE = 4096, the entire 1G order
326 * Record all the bitmaps in a linked list of pages for the next kernel to
327 * process. Each chunk holds bitmaps of the same order and each block of bitmaps
328 * starts at a given physical address. This allows the bitmaps to be sparse. The
355 struct khoser_mem_bitmap_ptr bitmaps[KHOSER_BITMAP_SIZE]; member
435 if (chunk->hdr.num_elms == ARRAY_SIZE(chunk->bitmaps)) { in kho_mem_serialize()
443 elm = &chunk->bitmaps[chunk->hdr.num_elms]; in kho_mem_serialize()
489 pr_err("failed to get preserved memory bitmaps\n"); in kho_get_mem_map_phys()
503 &chunk->bitmaps[i]); in kho_mem_deserialize()
|
| /linux/drivers/net/ethernet/mellanox/mlx5/core/steering/sws/ |
| H A D | dr_buddy.c | 25 /* 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/Documentation/driver-api/md/ |
| H A 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/drivers/net/ipa/ |
| H A D | ipa.h | 57 * @endpoint_count: Number of defined bits in most bitmaps below
113 /* Bitmaps indicating endpoint state */
|
| /linux/fs/btrfs/tests/ |
| H A 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/Documentation/input/devices/ |
| H A D | alps.rst | 173 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.
|
| /linux/fs/xfs/scrub/ |
| H A D | rmap.c | 67 /* Bitmaps containing all blocks for each type of AG metadata. */
74 /* Did we complete the AG space metadata bitmaps? */
387 * Set up bitmaps mapping all the AG metadata to compare with the rmapbt
505 * Check for set regions in the bitmaps; if there are any, the rmap records do
|
| H A D | off_bitmap.h | 9 /* Bitmaps, but for type-checked for xfs_fileoff_t */
|
| H A D | fsb_bitmap.h | 9 /* Bitmaps, but for type-checked for xfs_fsblock_t */
|
| H A D | rtb_bitmap.h | 9 /* Bitmaps, but for type-checked for xfs_rtblock_t */
|
| H A D | rgb_bitmap.h | 9 /* Bitmaps, but for type-checked for xfs_rgblock_t */
|
| /linux/fs/ext2/ |
| H A D | ialloc.c | 12 * Big-endian to little-endian byte-swapping/bitmaps by
30 * The free inodes are managed by bitmaps. A file system contains several
100 * bitmaps. Otherwise a newly created file might use
141 /* Ok, now we can actually update the inode bitmaps.. */ in ext2_free_inode()
|
| /linux/arch/x86/kernel/ |
| H A D | process.h | 33 * __switch_to_xtra() handles debug registers, i/o bitmaps, in switch_to_extra()
|
| /linux/drivers/md/ |
| H A D | dm-clone-metadata.c | 56 * Region and Dirty bitmaps.
71 * we use a second set of bitmaps, the dmap (dirty bitmap), which includes two
72 * bitmaps, namely dirty_regions and dirty_words. The dirty_regions bitmap
125 /* Spinlock protecting the region and dirty bitmaps. */
795 /* Swap dirty bitmaps */ in dm_clone_metadata_pre_commit()
|