/linux/tools/testing/selftests/kvm/ |
A D | dirty_log_perf_test.c | 125 kvm_vm_get_dirty_log(vm, slot, bitmaps[i]); in get_dirty_log() 143 unsigned long **bitmaps; in alloc_bitmaps() local 146 bitmaps = malloc(slots * sizeof(bitmaps[0])); in alloc_bitmaps() 150 bitmaps[i] = bitmap_zalloc(pages_per_slot); in alloc_bitmaps() 154 return bitmaps; in alloc_bitmaps() 162 free(bitmaps[i]); in free_bitmaps() 164 free(bitmaps); in free_bitmaps() 171 unsigned long **bitmaps; in run_test() local 195 bitmaps = alloc_bitmaps(p->slots, pages_per_slot); in run_test() 253 get_dirty_log(vm, bitmaps, p->slots); in run_test() [all …]
|
/linux/net/sched/ |
A D | sch_qfq.c | 771 q->bitmaps[dst] |= q->bitmaps[src] & mask; in qfq_move_groups() 772 q->bitmaps[src] &= ~mask; in qfq_move_groups() 961 ineligible = q->bitmaps[IR] | q->bitmaps[IB]; in qfq_update_eligible() 963 if (!q->bitmaps[ER]) { in qfq_update_eligible() 1162 if (!q->bitmaps[ER]) in qfq_choose_next_agg() 1165 grp = qfq_ffs(q, q->bitmaps[ER]); in qfq_choose_next_agg() 1176 __clear_bit(grp->index, &q->bitmaps[ER]); in qfq_choose_next_agg() 1188 __set_bit(grp->index, &q->bitmaps[s]); in qfq_choose_next_agg() 1301 __set_bit(grp->index, &q->bitmaps[s]); in qfq_schedule_agg() 1304 s, q->bitmaps[s], in qfq_schedule_agg() [all …]
|
/linux/fs/btrfs/ |
A D | subpage.c | 143 real_size = struct_size(ret, bitmaps, in btrfs_alloc_subpage() 379 bitmap_test_range_all_set(subpage->bitmaps, \ 384 bitmap_test_range_all_zero(subpage->bitmaps, \ 397 bitmap_set(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_set_uptodate() 412 bitmap_clear(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_clear_uptodate() 426 bitmap_set(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_set_error() 455 bitmap_set(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_set_dirty() 506 bitmap_set(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_set_writeback() 537 bitmap_set(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_set_ordered() 566 bitmap_set(subpage->bitmaps, start_bit, len >> fs_info->sectorsize_bits); in btrfs_subpage_set_checked() [all …]
|
A D | free-space-cache.c | 715 LIST_HEAD(bitmaps); in __load_free_space_cache() 835 list_add_tail(&e->list, &bitmaps); in __load_free_space_cache() 1017 int *entries, int *bitmaps, in write_cache_extent_entries() argument 1054 *bitmaps += 1; in write_cache_extent_entries() 1095 int entries, int bitmaps) in update_cache_item() argument 1261 io_ctl->entries, io_ctl->bitmaps); in __btrfs_wait_cache_io() 1332 int bitmaps = 0; in __btrfs_write_out_cache() local 1429 io_ctl->bitmaps = bitmaps; in __btrfs_write_out_cache() 3380 if (!list_empty(bitmaps)) in setup_cluster_bitmap() 3386 list_add(&entry->list, bitmaps); in setup_cluster_bitmap() [all …]
|
A D | subpage.h | 69 unsigned long bitmaps[]; member
|
A D | free-space-cache.h | 77 int bitmaps; member
|
/linux/fs/reiserfs/ |
A D | resize.c | 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()
|
A D | journal.c | 216 if (!jb->bitmaps[bmap_nr]) { in set_bit_in_list_bitmap() 217 jb->bitmaps[bmap_nr] = get_bitmap_node(sb); in set_bit_in_list_bitmap() 227 if (jb->bitmaps == NULL) in cleanup_bitmap_list() 231 if (jb->bitmaps[i]) { in cleanup_bitmap_list() 232 free_bitmap_node(sb, jb->bitmaps[i]); in cleanup_bitmap_list() 233 jb->bitmaps[i] = NULL; in cleanup_bitmap_list() 250 vfree(jb->bitmaps); in free_list_bitmaps() 251 jb->bitmaps = NULL; in free_list_bitmaps() 290 jb->bitmaps = vzalloc(mem); in reiserfs_allocate_list_bitmaps() 291 if (!jb->bitmaps) { in reiserfs_allocate_list_bitmaps() [all …]
|
/linux/Documentation/filesystems/ext4/ |
A 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
|
A D | bitmaps.rst | 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,
|
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
|
A D | globals.rst | 11 .. include:: bitmaps.rst
|
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/arch/arm/mm/ |
A D | dma-mapping.c | 1122 start = bitmap_find_next_zero_area(mapping->bitmaps[i], in __alloc_iova() 1128 bitmap_set(mapping->bitmaps[i], start, count); in __alloc_iova() 1151 bitmap_set(mapping->bitmaps[i], start, count); in __alloc_iova() 2070 if (!mapping->bitmaps) in arm_iommu_create_mapping() 2073 mapping->bitmaps[0] = kzalloc(bitmap_size, GFP_KERNEL); in arm_iommu_create_mapping() 2074 if (!mapping->bitmaps[0]) in arm_iommu_create_mapping() 2091 kfree(mapping->bitmaps[0]); in arm_iommu_create_mapping() 2093 kfree(mapping->bitmaps); in arm_iommu_create_mapping() 2109 kfree(mapping->bitmaps[i]); in release_iommu_mapping() 2110 kfree(mapping->bitmaps); in release_iommu_mapping() [all …]
|
/linux/arch/arm/include/asm/ |
A D | dma-iommu.h | 15 unsigned long **bitmaps; /* array of bitmaps */ member
|
/linux/Documentation/devicetree/bindings/cpufreq/ |
A D | imx-cpufreq-dt.txt | 12 - opp-supported-hw: Two bitmaps indicating:
|
/linux/fs/hpfs/ |
A D | super.c | 621 sbi->sb_bitmaps = le32_to_cpu(superblock->bitmaps); in hpfs_fill_super() 651 if (!(sbi->sb_bmp_dir = hpfs_load_bitmap_directory(s, le32_to_cpu(superblock->bitmaps)))) in hpfs_fill_super() 691 hpfs_chk_sectors(s, le32_to_cpu(superblock->bitmaps), 4, "bitmaps")) { in hpfs_fill_super()
|
A D | hpfs.h | 89 __le32 bitmaps; /* pointers to free space bit maps */ member
|
/linux/Documentation/driver-api/md/ |
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/Documentation/admin-guide/device-mapper/ |
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/Documentation/input/devices/ |
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/btrfs/tests/ |
A D | free-space-tree-tests.c | 423 static int run_test(test_func_t test_func, int bitmaps, u32 sectorsize, in run_test() argument 488 if (bitmaps) { in run_test()
|
/linux/Documentation/devicetree/bindings/soc/qcom/ |
A D | qcom,smsm.txt | 6 matrix of bitmaps signal subscription of notifications upon changes to a
|
/linux/arch/arm/mach-tegra/ |
A D | reset-handler.S | 53 movw r0, #0x3FFD @ enable, cluster_switch, immed, bitmaps
|
/linux/Documentation/networking/ |
A D | rds.rst | 261 This is implemented by having each node maintain bitmaps which 266 The bitmaps are allocated as connections are brought up. This 268 sages on sockets. The dense bitmaps let transports send the
|