| /kernel/linux/linux-5.10/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()
|
| /kernel/linux/linux-6.6/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()
|
| /kernel/linux/linux-6.6/tools/testing/selftests/kvm/lib/ |
| D | memstress.c | 350 void memstress_get_dirty_log(struct kvm_vm *vm, unsigned long *bitmaps[], int slots) in memstress_get_dirty_log() argument
357 kvm_vm_get_dirty_log(vm, slot, bitmaps[i]); in memstress_get_dirty_log()
361 void memstress_clear_dirty_log(struct kvm_vm *vm, unsigned long *bitmaps[], in memstress_clear_dirty_log() argument
369 kvm_vm_clear_dirty_log(vm, slot, bitmaps[i], 0, pages_per_slot); in memstress_clear_dirty_log()
375 unsigned long **bitmaps; in memstress_alloc_bitmaps() local
378 bitmaps = malloc(slots * sizeof(bitmaps[0])); in memstress_alloc_bitmaps()
379 TEST_ASSERT(bitmaps, "Failed to allocate bitmaps array."); in memstress_alloc_bitmaps()
382 bitmaps[i] = bitmap_zalloc(pages_per_slot); in memstress_alloc_bitmaps()
383 TEST_ASSERT(bitmaps[i], "Failed to allocate slot bitmap."); in memstress_alloc_bitmaps()
386 return bitmaps; in memstress_alloc_bitmaps()
[all …]
|
| /kernel/linux/linux-6.6/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
|
| /kernel/linux/linux-5.10/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
|
| /kernel/linux/linux-5.10/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
190 unsigned long bitmaps[QFQ_MAX_STATE]; /* Group bitmaps. */ member
192 u32 min_slot_shift; /* Index of the group-0 bit in the bitmaps. */
758 unsigned long mask = mask_from(q->bitmaps[ER], grp->index); in qfq_calc_state()
773 * q->bitmaps[dst] |= q->bitmaps[src] & mask;
774 * q->bitmaps[src] &= ~mask;
780 q->bitmaps[dst] |= q->bitmaps[src] & mask; in qfq_move_groups()
781 q->bitmaps[src] &= ~mask; in qfq_move_groups()
786 unsigned long mask = mask_from(q->bitmaps[ER], index + 1); in qfq_unblock_groups()
[all …]
|
| /kernel/linux/linux-6.6/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. */
769 unsigned long mask = mask_from(q->bitmaps[ER], grp->index); in qfq_calc_state()
784 * q->bitmaps[dst] |= q->bitmaps[src] & mask;
785 * q->bitmaps[src] &= ~mask;
791 q->bitmaps[dst] |= q->bitmaps[src] & mask; in qfq_move_groups()
792 q->bitmaps[src] &= ~mask; in qfq_move_groups()
797 unsigned long mask = mask_from(q->bitmaps[ER], index + 1); in qfq_unblock_groups()
[all …]
|
| /kernel/linux/linux-6.6/fs/btrfs/ |
| D | subpage.c | 164 real_size = struct_size(ret, bitmaps, in btrfs_alloc_subpage()
378 bitmap_test_range_all_set(subpage->bitmaps, \
383 bitmap_test_range_all_zero(subpage->bitmaps, \
396 bitmap_set(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_set_uptodate()
411 bitmap_clear(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_clear_uptodate()
425 bitmap_set(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_set_dirty()
450 bitmap_clear(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_clear_and_test_dirty()
476 bitmap_set(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_set_writeback()
490 bitmap_clear(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_clear_writeback()
507 bitmap_set(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_set_ordered()
[all …]
|
| D | free-space-cache.c | 713 * bitmaps, we may end up using more memory than this. in recalculate_thresholds()
743 LIST_HEAD(bitmaps); in __load_free_space_cache()
865 list_add_tail(&e->list, &bitmaps); in __load_free_space_cache()
874 * We add the bitmaps at the end of the entries in order that in __load_free_space_cache()
877 list_for_each_entry_safe(e, n, &bitmaps, list) { in __load_free_space_cache()
1072 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()
1254 /* Write out the bitmaps */ in write_bitmap_entries()
[all …]
|
| /kernel/linux/linux-6.6/tools/testing/selftests/kvm/x86_64/ |
| D | dirty_log_page_splitting_test.c | 90 unsigned long **bitmaps; in run_test() local
111 bitmaps = memstress_alloc_bitmaps(SLOTS, pages_per_slot); in run_test()
139 memstress_get_dirty_log(vm, bitmaps, SLOTS); in run_test()
142 memstress_clear_dirty_log(vm, bitmaps, SLOTS, pages_per_slot); in run_test()
165 memstress_free_bitmaps(bitmaps, SLOTS); in run_test()
|
| /kernel/linux/linux-6.6/tools/testing/selftests/kvm/include/ |
| D | memstress.h | 77 void memstress_get_dirty_log(struct kvm_vm *vm, unsigned long *bitmaps[], int slots);
78 void memstress_clear_dirty_log(struct kvm_vm *vm, unsigned long *bitmaps[],
81 void memstress_free_bitmaps(unsigned long *bitmaps[], int slots);
|
| /kernel/linux/linux-6.6/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
|
| /kernel/linux/linux-5.10/fs/minix/ |
| D | minix.h | 103 * big-endian 32 or 64 bit indexed bitmaps on big-endian system or
104 * little-endian bitmaps on little-endian system
121 * big-endian 16bit indexed bitmaps
158 * little-endian bitmaps
|
| /kernel/linux/linux-5.10/arch/arm/include/asm/ |
| D | dma-iommu.h | 15 unsigned long **bitmaps; /* array of bitmaps */ member
|
| /kernel/linux/linux-6.6/arch/arm/include/asm/ |
| D | dma-iommu.h | 15 unsigned long **bitmaps; /* array of bitmaps */ member
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-5.10/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.
|
| /kernel/linux/linux-5.10/fs/btrfs/ |
| D | free-space-cache.c | 676 LIST_HEAD(bitmaps); in __load_free_space_cache()
807 list_add_tail(&e->list, &bitmaps); in __load_free_space_cache()
816 * We add the bitmaps at the end of the entries in order that in __load_free_space_cache()
819 list_for_each_entry_safe(e, n, &bitmaps, list) { in __load_free_space_cache()
945 int *entries, int *bitmaps, in write_cache_extent_entries() argument
982 *bitmaps += 1; in write_cache_extent_entries()
1023 int entries, int bitmaps) in update_cache_item() argument
1060 btrfs_set_free_space_bitmaps(leaf, header, bitmaps); in update_cache_item()
1128 /* Write out the bitmaps */ in write_bitmap_entries()
1189 io_ctl->entries, io_ctl->bitmaps); in __btrfs_wait_cache_io()
[all …]
|
| /kernel/linux/linux-6.6/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()
1575 mapping->bitmaps = kcalloc(extensions, sizeof(unsigned long *), in arm_iommu_create_mapping()
1577 if (!mapping->bitmaps) in arm_iommu_create_mapping()
1580 mapping->bitmaps[0] = kzalloc(bitmap_size, GFP_KERNEL); in arm_iommu_create_mapping()
1581 if (!mapping->bitmaps[0]) in arm_iommu_create_mapping()
1598 kfree(mapping->bitmaps[0]); in arm_iommu_create_mapping()
[all …]
|
| /kernel/linux/linux-6.6/tools/testing/selftests/kvm/ |
| D | dirty_log_perf_test.c | 143 unsigned long **bitmaps; in run_test() local
168 bitmaps = memstress_alloc_bitmaps(p->slots, pages_per_slot); in run_test()
238 memstress_get_dirty_log(vm, bitmaps, p->slots); in run_test()
247 memstress_clear_dirty_log(vm, bitmaps, p->slots, in run_test()
292 memstress_free_bitmaps(bitmaps, p->slots); in run_test()
|
| /kernel/linux/linux-5.10/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
|