Searched refs:BITSET_BIT (Results 1 – 7 of 7) sorted by relevance
100 #define FD_BO_GPUREADONLY BITSET_BIT(1)101 #define FD_BO_SCANOUT BITSET_BIT(2)103 #define FD_BO_CACHED_COHERENT BITSET_BIT(3)105 #define FD_BO_NOMAP BITSET_BIT(4)107 #define FD_BO_SHARED BITSET_BIT(5)110 #define _FD_BO_VIRTIO_SHM BITSET_BIT(6)113 #define FD_BO_PREP_READ BITSET_BIT(0)114 #define FD_BO_PREP_WRITE BITSET_BIT(1)115 #define FD_BO_PREP_NOSYNC BITSET_BIT(2)116 #define FD_BO_PREP_FLUSH BITSET_BIT(3)
58 #define BITSET_BIT(b) (1u << ((b) % BITSET_WORDBITS)) macro62 #define BITSET_TEST(x, b) (((x)[BITSET_BITWORD(b)] & BITSET_BIT(b)) != 0)63 #define BITSET_SET(x, b) ((x)[BITSET_BITWORD(b)] |= BITSET_BIT(b))64 #define BITSET_CLEAR(x, b) ((x)[BITSET_BITWORD(b)] &= ~BITSET_BIT(b))66 #define BITSET_MASK(b) (((b) % BITSET_WORDBITS == 0) ? ~0 : BITSET_BIT(b) - 1)67 #define BITSET_RANGE(b, e) ((BITSET_MASK((e) + 1)) & ~(BITSET_BIT(b) - 1))386 BITSET_WORD tmp = set[word] & ~(BITSET_BIT(*end) - 1); in __bitset_next_range()407 tmp = set[word] | (BITSET_BIT(*start + 1) - 1); in __bitset_next_range()
741 g->tmp.reg_assigned[i] |= BITSET_BIT(j); in ra_simplify()769 if (pq & BITSET_BIT(j)) { in ra_simplify()787 if (skip & BITSET_BIT(j)) in ra_simplify()
296 ctx->ubo_mask |= BITSET_BIT(ubo); in midgard_promote_uniforms()306 ctx->ubo_mask |= BITSET_BIT(ubo); in midgard_promote_uniforms()
1111 ctx->ubo_mask |= BITSET_BIT(ctx->info->push.words[idx].ubo); in mir_demote_uniforms()
146 ctx->ubo_mask |= BITSET_BIT(ubo); in bi_opt_push_ubo()156 ctx->ubo_mask |= BITSET_BIT(ubo); in bi_opt_push_ubo()
46 #define I915_ENGINE_CLASS_TO_MASK(x) BITSET_BIT(x)