| /openbmc/linux/tools/lib/ |
| H A D | bitmap.c | 21 void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1, in __bitmap_or() argument
28 dst[k] = bitmap1[k] | bitmap2[k]; in __bitmap_or()
60 bool __bitmap_and(unsigned long *dst, const unsigned long *bitmap1, in __bitmap_and() argument
68 result |= (dst[k] = bitmap1[k] & bitmap2[k]); in __bitmap_and()
70 result |= (dst[k] = bitmap1[k] & bitmap2[k] & in __bitmap_and()
75 bool __bitmap_equal(const unsigned long *bitmap1, in __bitmap_equal() argument
80 if (bitmap1[k] != bitmap2[k]) in __bitmap_equal()
84 if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits)) in __bitmap_equal()
90 bool __bitmap_intersects(const unsigned long *bitmap1, in __bitmap_intersects() argument
95 if (bitmap1[k] & bitmap2[k]) in __bitmap_intersects()
[all …]
|
| /openbmc/qemu/util/ |
| H A D | bitmap.c | 78 int slow_bitmap_equal(const unsigned long *bitmap1, in slow_bitmap_equal() argument
84 if (bitmap1[k] != bitmap2[k]) { in slow_bitmap_equal()
90 if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits)) { in slow_bitmap_equal()
112 int slow_bitmap_and(unsigned long *dst, const unsigned long *bitmap1, in slow_bitmap_and() argument
120 result |= (dst[k] = bitmap1[k] & bitmap2[k]); in slow_bitmap_and()
125 void slow_bitmap_or(unsigned long *dst, const unsigned long *bitmap1, in slow_bitmap_or() argument
132 dst[k] = bitmap1[k] | bitmap2[k]; in slow_bitmap_or()
143 dst[k] = bitmap1[k] ^ bitmap2[k]; in slow_bitmap_xor()
155 result |= (dst[k] = bitmap1[k] & ~bitmap2[k]); in slow_bitmap_andnot()
385 int slow_bitmap_intersects(const unsigned long *bitmap1, in slow_bitmap_intersects() argument
[all …]
|
| /openbmc/qemu/tests/qemu-iotests/ |
| H A D | 254.out | 3 {"execute": "block-dirty-bitmap-add", "arguments": {"name": "bitmap1", "node": "drive0", "persisten…
41 "name": "bitmap1",
51 "name": "bitmap1",
56 "target": "bitmap1"
108 "name": "bitmap1",
129 "name": "bitmap1"
|
| H A D | 256.out | 36 "name": "bitmap1",
102 "bitmap": "bitmap1",
|
| H A D | 124 | 388 bitmap1 = self.add_bitmap('bitmap1', drive0)
392 transaction_bitmap_clear(bitmap1.drive['id'], bitmap1.name),
404 self.create_incremental(bitmap1)
|
| /openbmc/linux/tools/testing/selftests/seccomp/ |
| H A D | seccomp_benchmark.c | 143 unsigned long long native, filter1, filter2, bitmap1, bitmap2; in main() local
174 bitmap1 = timing(CLOCK_PROCESS_CPUTIME_ID, samples) / samples; in main()
175 printf("getpid RET_ALLOW 1 filter (bitmap): %llu ns\n", bitmap1); in main()
207 bitmap1 - native); in main()
215 bitmap1 - native - (bitmap2 - bitmap1)); in main()
222 ret |= compare("native", "≤", "1 bitmap", native, le, bitmap1); in main()
231 bitmap1 - native, approx, bitmap2 - native); in main()
237 ret |= compare("entry", "≈", "1 bitmapped", entry, approx, bitmap1 - native); in main()
|
| /openbmc/linux/lib/ |
| H A D | bitmap.c | 48 bool __bitmap_equal(const unsigned long *bitmap1, in __bitmap_equal() argument
53 if (bitmap1[k] != bitmap2[k]) in __bitmap_equal()
73 if ((bitmap1[k] | bitmap2[k]) != bitmap3[k]) in __bitmap_or_equal()
80 tmp = (bitmap1[k] | bitmap2[k]) ^ bitmap3[k]; in __bitmap_or_equal()
248 result |= (dst[k] = bitmap1[k] & bitmap2[k]); in __bitmap_and()
250 result |= (dst[k] = bitmap1[k] & bitmap2[k] & in __bitmap_and()
263 dst[k] = bitmap1[k] | bitmap2[k]; in __bitmap_or()
274 dst[k] = bitmap1[k] ^ bitmap2[k]; in __bitmap_xor()
286 result |= (dst[k] = bitmap1[k] & ~bitmap2[k]); in __bitmap_andnot()
311 if (bitmap1[k] & bitmap2[k]) in __bitmap_intersects()
[all …]
|
| /openbmc/linux/fs/ocfs2/ |
| H A D | localalloc.c | 330 || alloc->id1.bitmap1.i_used in ocfs2_load_local_alloc()
331 || alloc->id1.bitmap1.i_total in ocfs2_load_local_alloc()
664 le32_to_cpu(alloc->id1.bitmap1.i_used); in ocfs2_reserve_local_alloc_bits()
686 le32_to_cpu(alloc->id1.bitmap1.i_used); in ocfs2_reserve_local_alloc_bits()
833 if (!alloc->id1.bitmap1.i_total) { in ocfs2_local_alloc_find_clear_bits()
904 le32_to_cpu(alloc->id1.bitmap1.i_total), in ocfs2_local_alloc_find_clear_bits()
915 alloc->id1.bitmap1.i_total = 0; in ocfs2_clear_local_alloc()
916 alloc->id1.bitmap1.i_used = 0; in ocfs2_clear_local_alloc()
964 if (!alloc->id1.bitmap1.i_total) { in ocfs2_sync_local_to_main()
1159 le32_to_cpu(alloc->id1.bitmap1.i_total), in ocfs2_local_alloc_new_window()
[all …]
|
| H A D | suballoc.c | 809 free_bits = le32_to_cpu(fe->id1.bitmap1.i_total) - in ocfs2_reserve_suballoc_bits()
810 le32_to_cpu(fe->id1.bitmap1.i_used); in ocfs2_reserve_suballoc_bits()
840 (le32_to_cpu(fe->id1.bitmap1.i_total) in ocfs2_reserve_suballoc_bits()
841 - le32_to_cpu(fe->id1.bitmap1.i_used))); in ocfs2_reserve_suballoc_bits()
1595 tmp_used = le32_to_cpu(di->id1.bitmap1.i_used); in ocfs2_alloc_dinode_update_counts()
1614 tmp_used = le32_to_cpu(di->id1.bitmap1.i_used); in ocfs2_rollback_alloc_dinode_counts()
1899 if (le32_to_cpu(fe->id1.bitmap1.i_used) >= in ocfs2_claim_suballoc_bits()
1900 le32_to_cpu(fe->id1.bitmap1.i_total)) { in ocfs2_claim_suballoc_bits()
1904 le32_to_cpu(fe->id1.bitmap1.i_used), in ocfs2_claim_suballoc_bits()
1905 le32_to_cpu(fe->id1.bitmap1.i_total)); in ocfs2_claim_suballoc_bits()
[all …]
|
| H A D | resize.c | 139 le32_add_cpu(&fe->id1.bitmap1.i_total, num_bits); in ocfs2_update_last_group_and_inode()
144 le32_add_cpu(&fe->id1.bitmap1.i_used, backups); in ocfs2_update_last_group_and_inode()
550 le32_add_cpu(&fe->id1.bitmap1.i_total, input->clusters *cl_bpc); in ocfs2_group_add()
551 le32_add_cpu(&fe->id1.bitmap1.i_used, in ocfs2_group_add()
|
| H A D | ioctl.c | 308 le32_to_cpu(dinode_alloc->id1.bitmap1.i_total); in ocfs2_info_scan_inode_alloc()
310 le32_to_cpu(dinode_alloc->id1.bitmap1.i_total) - in ocfs2_info_scan_inode_alloc()
311 le32_to_cpu(dinode_alloc->id1.bitmap1.i_used); in ocfs2_info_scan_inode_alloc()
581 le32_to_cpu(gb_dinode->id1.bitmap1.i_total); in ocfs2_info_freefrag_scan_bitmap()
583 le32_to_cpu(gb_dinode->id1.bitmap1.i_used); in ocfs2_info_freefrag_scan_bitmap()
|
| H A D | ocfs2_fs.h | 713 } bitmap1; member
|
| H A D | move_extents.c | 403 (vict_blkno >= ((u64)le32_to_cpu(ac_dinode->id1.bitmap1.i_total) << in ocfs2_find_victim_alloc_group()
|
| H A D | super.c | 1643 numbits = le32_to_cpu(bm_lock->id1.bitmap1.i_total); in ocfs2_statfs()
1644 freebits = numbits - le32_to_cpu(bm_lock->id1.bitmap1.i_used); in ocfs2_statfs()
|
| /openbmc/qemu/include/qemu/ |
| H A D | bitmap.h | 77 int slow_bitmap_equal(const unsigned long *bitmap1,
81 int slow_bitmap_and(unsigned long *dst, const unsigned long *bitmap1,
83 void slow_bitmap_or(unsigned long *dst, const unsigned long *bitmap1,
85 void slow_bitmap_xor(unsigned long *dst, const unsigned long *bitmap1,
87 int slow_bitmap_andnot(unsigned long *dst, const unsigned long *bitmap1,
89 int slow_bitmap_intersects(const unsigned long *bitmap1,
|
| /openbmc/linux/tools/include/linux/ |
| H A D | bitmap.h | 16 void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1,
18 bool __bitmap_and(unsigned long *dst, const unsigned long *bitmap1,
20 bool __bitmap_equal(const unsigned long *bitmap1,
23 bool __bitmap_intersects(const unsigned long *bitmap1,
|
| /openbmc/linux/include/linux/ |
| H A D | bitmap.h | 138 bool __bitmap_equal(const unsigned long *bitmap1,
152 bool __bitmap_and(unsigned long *dst, const unsigned long *bitmap1,
154 void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1,
156 void __bitmap_xor(unsigned long *dst, const unsigned long *bitmap1,
158 bool __bitmap_andnot(unsigned long *dst, const unsigned long *bitmap1,
163 bool __bitmap_intersects(const unsigned long *bitmap1,
165 bool __bitmap_subset(const unsigned long *bitmap1,
168 unsigned int __bitmap_weight_and(const unsigned long *bitmap1,
|
| /openbmc/qemu/docs/interop/ |
| H A D | bitmaps.rst | 228 "name": "bitmap1",
|