Searched refs:KSYNCMAP (Results 1 – 3 of 3) sorted by relevance
62 for_each_set_bit(i, (unsigned long *)&p->bitmap, KSYNCMAP) { in __sync_print()77 for_each_set_bit(i, (unsigned long *)&p->bitmap, KSYNCMAP) { in __sync_print()344 for (step = 0; step < KSYNCMAP; step++) { in igt_syncmap_join_below()361 for (step = 0; step < KSYNCMAP; step++) { in igt_syncmap_join_below()372 for (idx = 1; idx < KSYNCMAP; idx++) { in igt_syncmap_join_below()384 for (step = 0; step < KSYNCMAP; step++) { in igt_syncmap_join_below()420 for (idx = 0; idx < KSYNCMAP; idx++) { in igt_syncmap_neighbours()468 for (idx = 0; idx < KSYNCMAP; idx++) { in igt_syncmap_compact()498 if (sync->bitmap != BIT(KSYNCMAP) - 1) { in igt_syncmap_compact()501 BIT(KSYNCMAP) - 1, KSYNCMAP); in igt_syncmap_compact()[all …]
32 #define SHIFT ilog2(KSYNCMAP)33 #define MASK (KSYNCMAP - 1)93 BUILD_BUG_ON_NOT_POWER_OF_2(KSYNCMAP); in i915_syncmap_init()95 BUILD_BUG_ON(KSYNCMAP > BITS_PER_TYPE((*root)->bitmap)); in i915_syncmap_init()203 p = kmalloc(sizeof(*p) + KSYNCMAP * sizeof(u32), GFP_KERNEL); in __sync_alloc_leaf()285 next = kzalloc(sizeof(*next) + KSYNCMAP * sizeof(next), in __sync_set()
31 #define KSYNCMAP 16 /* radix of the tree, how many slots in each layer */ macro
