Searched refs:bit_map (Results 1 – 3 of 3) sorted by relevance
169 #define FOR_EACH_BIT(bit_pos, bit_map) \ argument170 for (bit_pos = __builtin_ctzll(bit_map); \171 bit_map; \172 bit_map &= ~(1ULL << (bit_pos)), \173 bit_pos = __builtin_ctzll(bit_map))181 #define FOR_EACH_PRESENT_NODE_ID(node_id, bit_map) \ argument182 FOR_EACH_BIT(node_id, bit_map)204 #define FOR_EACH_PRESENT_REGION_ID(region_id, bit_map) \ argument205 for (unsigned long long region_id_limit = count_set_bits(bit_map) \214 #define FOR_EACH_PRESENT_MASTER_INTERFACE(iface_id, bit_map) \ argument[all …]
495 brw_update_dirty_count(struct dirty_bit_map *bit_map, uint64_t bits) in brw_update_dirty_count() argument497 for (int i = 0; bit_map[i].bit != 0; i++) { in brw_update_dirty_count()498 if (bit_map[i].bit & bits) in brw_update_dirty_count()499 bit_map[i].count++; in brw_update_dirty_count()504 brw_print_dirty_count(struct dirty_bit_map *bit_map) in brw_print_dirty_count() argument506 for (int i = 0; bit_map[i].bit != 0; i++) { in brw_print_dirty_count()507 if (bit_map[i].count > 1) { in brw_print_dirty_count()509 bit_map[i].bit, bit_map[i].count, bit_map[i].name); in brw_print_dirty_count()
204 uint32_t bit_map = 0U; in GetFilterMap() local215 bit_map |= 1 << filter; in GetFilterMap()219 bit_map |= FILTER_TRY_NONE; in GetFilterMap()222 bit_map = FILTER_TRY_NONE; in GetFilterMap()224 bit_map = FILTER_TRY_ALL; in GetFilterMap()226 return bit_map; in GetFilterMap()