Lines Matching defs:level
69 surf->base.u.tex.level >= min_level &&
70 surf->base.u.tex.level < min_level + num_levels) {
134 res, pview->u.tex.level, 1,
145 pview->u.tex.level, 1,
203 iris_resource_prepare_render(ice, z_res, zs_surf->u.tex.level,
294 iris_resource_finish_render(ice, z_res, zs_surf->u.tex.level,
302 iris_resource_finish_write(ice, s_res, zs_surf->u.tex.level,
324 iris_resource_finish_render(ice, res, desc->tex.level,
433 unsigned level, unsigned layer,
436 //DBG("%s to mt %p level %u layer %u\n", __FUNCTION__, mt, level, layer);
440 &res->base.b, res->aux.usage, level, true);
474 blorp_ccs_resolve(&blorp_batch, &surf, level, layer, 1, res->surf.format,
532 for (unsigned level = 0; level < res->surf.levels; ++level) {
533 if (!iris_resource_level_has_hiz(res, level))
562 unsigned int level, unsigned int start_layer,
566 assert(iris_resource_level_has_hiz(res, level));
587 //DBG("%s %s to mt %p level %d layers %d-%d\n",
588 //__func__, name, mt, level, start_layer, start_layer + num_layers - 1);
613 &res->base.b, res->aux.usage, level, true);
619 blorp_hiz_op(&blorp_batch, &surf, level, start_layer, num_layers, op);
650 iris_resource_level_has_hiz(const struct iris_resource *res, uint32_t level)
652 iris_resource_check_level_layer(res, level, 0);
660 if (level > 0) {
661 if (u_minify(res->base.b.width0, level) & 7)
664 if (u_minify(res->base.b.height0, level) & 3)
671 /** \brief Assert that the level and layer are valid for the resource. */
674 UNUSED uint32_t level, UNUSED uint32_t layer)
676 assert(level < res->surf.levels);
677 assert(layer < util_num_layers(&res->base.b, level));
697 miptree_layer_range_length(const struct iris_resource *res, uint32_t level,
700 assert(level <= res->base.b.last_level);
702 const uint32_t total_num_layers = iris_get_num_logical_layers(res, level);
721 /* Clamp the level range to fit the resource */
725 const uint32_t level = start_level + l;
727 miptree_layer_range_length(res, level, start_layer, num_layers);
730 iris_resource_get_aux_state(res, level, start_layer + a);
758 const uint32_t level = start_level + l;
760 miptree_layer_range_length(res, level, start_layer, num_layers);
764 iris_resource_get_aux_state(res, level, layer);
780 iris_hiz_exec(ice, batch, res, level, layer, 1, aux_op, false);
785 iris_resolve_color(ice, batch, res, level, layer, aux_op);
790 iris_resource_set_aux_state(ice, res, level, layer, 1, new_state);
797 struct iris_resource *res, uint32_t level,
805 miptree_layer_range_length(res, level, start_layer, num_layers);
810 iris_resource_get_aux_state(res, level, layer);
823 iris_resource_set_aux_state(ice, res, level, layer, 1, new_aux_state);
829 uint32_t level, uint32_t layer)
831 iris_resource_check_level_layer(res, level, layer);
840 return res->aux.state[level][layer];
845 struct iris_resource *res, uint32_t level,
849 num_layers = miptree_layer_range_length(res, level, start_layer, num_layers);
852 assert(iris_resource_level_has_hiz(res, level) ||
860 if (res->aux.state[level][start_layer + a] != aux_state) {
861 res->aux.state[level][start_layer + a] = aux_state;
1054 struct iris_resource *res, uint32_t level,
1069 return iris_resource_level_has_hiz(res, level) ?
1116 struct iris_resource *res, uint32_t level,
1120 iris_resource_prepare_access(ice, res, level, 1, start_layer,
1127 struct iris_resource *res, uint32_t level,
1131 iris_resource_finish_write(ice, res, level, start_layer, layer_count,