Searched refs:bitmap1 (Results 1 – 6 of 6) sorted by relevance
| /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/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()
136 void slow_bitmap_xor(unsigned long *dst, const unsigned long *bitmap1, in slow_bitmap_xor() argument
143 dst[k] = bitmap1[k] ^ bitmap2[k]; in slow_bitmap_xor()
147 int slow_bitmap_andnot(unsigned long *dst, const unsigned long *bitmap1, in slow_bitmap_andnot() argument
[all …]
|
| /openbmc/qemu/include/qemu/ |
| H A D | bitmap.h | 85 int slow_bitmap_equal(const unsigned long *bitmap1,
89 int slow_bitmap_and(unsigned long *dst, const unsigned long *bitmap1,
91 void slow_bitmap_or(unsigned long *dst, const unsigned long *bitmap1,
93 void slow_bitmap_xor(unsigned long *dst, const unsigned long *bitmap1,
95 int slow_bitmap_andnot(unsigned long *dst, const unsigned long *bitmap1,
97 int slow_bitmap_intersects(const unsigned long *bitmap1,
|
| /openbmc/qemu/docs/interop/ |
| H A D | bitmaps.rst | 228 "name": "bitmap1",
|