/************************************************************************** * * Copyright 2006 Tungsten Graphics, Inc., Cedar Park, Texas. * All Rights Reserved. * * Permission is hereby granted, free of charge, to any person obtaining a * copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sub license, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice (including the * next paragraph) shall be included in all copies or substantial portions * of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. * IN NO EVENT SHALL TUNGSTEN GRAPHICS AND/OR ITS SUPPLIERS BE LIABLE FOR * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. * **************************************************************************/ #include "intel_context.h" #include "intel_mipmap_tree.h" #include "intel_regions.h" #include "intel_tex_layout.h" #include "intel_tex.h" #include "main/enums.h" #include "main/formats.h" #define FILE_DEBUG_FLAG DEBUG_MIPTREE static GLenum target_to_target(GLenum target) { switch (target) { case GL_TEXTURE_CUBE_MAP_POSITIVE_X_ARB: case GL_TEXTURE_CUBE_MAP_NEGATIVE_X_ARB: case GL_TEXTURE_CUBE_MAP_POSITIVE_Y_ARB: case GL_TEXTURE_CUBE_MAP_NEGATIVE_Y_ARB: case GL_TEXTURE_CUBE_MAP_POSITIVE_Z_ARB: case GL_TEXTURE_CUBE_MAP_NEGATIVE_Z_ARB: return GL_TEXTURE_CUBE_MAP_ARB; default: return target; } } static struct intel_mipmap_tree * intel_miptree_create_internal(struct intel_context *intel, GLenum target, gl_format format, GLuint first_level, GLuint last_level, GLuint width0, GLuint height0, GLuint depth0, uint32_t tiling) { GLboolean ok; struct intel_mipmap_tree *mt = calloc(sizeof(*mt), 1); int compress_byte = 0; DBG("%s target %s format %s level %d..%d <-- %p\n", __FUNCTION__, _mesa_lookup_enum_by_nr(target), _mesa_get_format_name(format), first_level, last_level, mt); if (_mesa_is_format_compressed(format)) compress_byte = intel_compressed_num_bytes(format); mt->target = target_to_target(target); mt->format = format; mt->first_level = first_level; mt->last_level = last_level; mt->width0 = width0; mt->height0 = height0; mt->depth0 = depth0; mt->cpp = compress_byte ? compress_byte : _mesa_get_format_bytes(mt->format); mt->compressed = compress_byte ? 1 : 0; mt->refcount = 1; #ifdef I915 if (intel->is_945) ok = i945_miptree_layout(intel, mt, tiling); else ok = i915_miptree_layout(intel, mt, tiling); #else ok = brw_miptree_layout(intel, mt, tiling); #endif if (!ok) { free(mt); DBG("%s not okay - returning NULL\n", __FUNCTION__); return NULL; } return mt; } struct intel_mipmap_tree * intel_miptree_create(struct intel_context *intel, GLenum target, gl_format format, GLuint first_level, GLuint last_level, GLuint width0, GLuint height0, GLuint depth0, GLboolean expect_accelerated_upload) { struct intel_mipmap_tree *mt; uint32_t tiling = I915_TILING_NONE; GLenum base_format = _mesa_get_format_base_format(format); if (intel->use_texture_tiling && !_mesa_is_format_compressed(format)) { if (intel->gen >= 4 && (base_format == GL_DEPTH_COMPONENT || base_format == GL_DEPTH_STENCIL_EXT)) tiling = I915_TILING_Y; else if (width0 >= 64) tiling = I915_TILING_X; } mt = intel_miptree_create_internal(intel, target, format, first_level, last_level, width0, height0, depth0, tiling); /* * pitch == 0 || height == 0 indicates the null texture */ if (!mt || !mt->total_height) { free(mt); return NULL; } mt->region = intel_region_alloc(intel->intelScreen, tiling, mt->cpp, mt->total_width, mt->total_height, expect_accelerated_upload); if (!mt->region) { free(mt); return NULL; } return mt; } struct intel_mipmap_tree * intel_miptree_create_for_region(struct intel_context *intel, GLenum target, gl_format format, struct intel_region *region, GLuint depth0) { struct intel_mipmap_tree *mt; mt = intel_miptree_create_internal(intel, target, format, 0, 0, region->width, region->height, 1, I915_TILING_NONE); if (!mt) return mt; intel_region_reference(&mt->region, region); return mt; } void intel_miptree_reference(struct intel_mipmap_tree **dst, struct intel_mipmap_tree *src) { src->refcount++; *dst = src; DBG("%s %p refcount now %d\n", __FUNCTION__, src, src->refcount); } void intel_miptree_release(struct intel_context *intel, struct intel_mipmap_tree **mt) { if (!*mt) return; DBG("%s %p refcount will be %d\n", __FUNCTION__, *mt, (*mt)->refcount - 1); if (--(*mt)->refcount <= 0) { GLuint i; DBG("%s deleting %p\n", __FUNCTION__, *mt); intel_region_release(&((*mt)->region)); intel_region_release(&((*mt)->hiz_region)); for (i = 0; i < MAX_TEXTURE_LEVELS; i++) { free((*mt)->level[i].x_offset); free((*mt)->level[i].y_offset); } free(*mt); } *mt = NULL; } /** * Can the image be pulled into a unified mipmap tree? This mirrors * the completeness test in a lot of ways. * * Not sure whether I want to pass gl_texture_image here. */ GLboolean intel_miptree_match_image(struct intel_mipmap_tree *mt, struct gl_texture_image *image) { struct intel_texture_image *intelImage = intel_texture_image(image); GLuint level = intelImage->level; /* Images with borders are never pulled into mipmap trees. */ if (image->Border) return GL_FALSE; if (image->TexFormat != mt->format) return GL_FALSE; /* Test image dimensions against the base level image adjusted for * minification. This will also catch images not present in the * tree, changed targets, etc. */ if (image->Width != mt->level[level].width || image->Height != mt->level[level].height || image->Depth != mt->level[level].depth) return GL_FALSE; return GL_TRUE; } void intel_miptree_set_level_info(struct intel_mipmap_tree *mt, GLuint level, GLuint nr_images, GLuint x, GLuint y, GLuint w, GLuint h, GLuint d) { mt->level[level].width = w; mt->level[level].height = h; mt->level[level].depth = d; mt->level[level].level_x = x; mt->level[level].level_y = y; mt->level[level].nr_images = nr_images; DBG("%s level %d size: %d,%d,%d offset %d,%d\n", __FUNCTION__, level, w, h, d, x, y); assert(nr_images); assert(!mt->level[level].x_offset); mt->level[level].x_offset = malloc(nr_images * sizeof(GLuint)); mt->level[level].x_offset[0] = mt->level[level].level_x; mt->level[level].y_offset = malloc(nr_images * sizeof(GLuint)); mt->level[level].y_offset[0] = mt->level[level].level_y; } void intel_miptree_set_image_offset(struct intel_mipmap_tree *mt, GLuint level, GLuint img, GLuint x, GLuint y) { if (img == 0 && level == 0) assert(x == 0 && y == 0); assert(img < mt->level[level].nr_images); mt->level[level].x_offset[img] = mt->level[level].level_x + x; mt->level[level].y_offset[img] = mt->level[level].level_y + y; DBG("%s level %d img %d pos %d,%d\n", __FUNCTION__, level, img, mt->level[level].x_offset[img], mt->level[level].y_offset[img]); } void intel_miptree_get_image_offset(struct intel_mipmap_tree *mt, GLuint level, GLuint face, GLuint depth, GLuint *x, GLuint *y) { if (mt->target == GL_TEXTURE_CUBE_MAP_ARB) { *x = mt->level[level].x_offset[face]; *y = mt->level[level].y_offset[face]; } else if (mt->target == GL_TEXTURE_3D) { *x = mt->level[level].x_offset[depth]; *y = mt->level[level].y_offset[depth]; } else { *x = mt->level[level].x_offset[0]; *y = mt->level[level].y_offset[0]; } } /** * Map a teximage in a mipmap tree. * \param row_stride returns row stride in bytes * \param image_stride returns image stride in bytes (for 3D textures). * \param image_offsets pointer to array of pixel offsets from the returned * pointer to each depth image * \return address of mapping */ GLubyte * intel_miptree_image_map(struct intel_context * intel, struct intel_mipmap_tree * mt, GLuint face, GLuint level, GLuint * row_stride, GLuint * image_offsets) { GLuint x, y; if (row_stride) *row_stride = mt->region->pitch * mt->cpp; if (mt->target == GL_TEXTURE_3D) { int i; for (i = 0; i < mt->level[level].depth; i++) { intel_miptree_get_image_offset(mt, level, face, i, &x, &y); image_offsets[i] = x + y * mt->region->pitch; } DBG("%s \n", __FUNCTION__); return intel_region_map(intel, mt->region); } else { assert(mt->level[level].depth == 1); intel_miptree_get_image_offset(mt, level, face, 0, &x, &y); image_offsets[0] = 0; DBG("%s: (%d,%d) -> (%d, %d)/%d\n", __FUNCTION__, face, level, x, y, mt->region->pitch * mt->cpp); return intel_region_map(intel, mt->region) + (x + y * mt->region->pitch) * mt->cpp; } } void intel_miptree_image_unmap(struct intel_context *intel, struct intel_mipmap_tree *mt) { DBG("%s\n", __FUNCTION__); intel_region_unmap(intel, mt->region); } /** * Upload data for a particular image. */ void intel_miptree_image_data(struct intel_context *intel, struct intel_mipmap_tree *dst, GLuint face, GLuint level, void *src, GLuint src_row_pitch, GLuint src_image_pitch) { const GLuint depth = dst->level[level].depth; GLuint i; for (i = 0; i < depth; i++) { GLuint dst_x, dst_y, height, width; intel_miptree_get_image_offset(dst, level, face, i, &dst_x, &dst_y); height = dst->level[level].height; width = dst->level[level].width; if (dst->compressed) { unsigned int align_w, align_h; intel_get_texture_alignment_unit(dst->format, &align_w, &align_h); height = (height + align_h - 1) / align_h; width = ALIGN(width, align_w); } DBG("%s: %d/%d %p/%d -> (%d, %d)/%d (%d, %d)\n", __FUNCTION__, face, level, src, src_row_pitch * dst->cpp, dst_x, dst_y, dst->region->pitch * dst->cpp, width, height); intel_region_data(intel, dst->region, 0, dst_x, dst_y, src, src_row_pitch, 0, 0, /* source x, y */ width, height); src = (char *)src + src_image_pitch * dst->cpp; } } /** * Copy mipmap image between trees */ void intel_miptree_image_copy(struct intel_context *intel, struct intel_mipmap_tree *dst, GLuint face, GLuint level, struct intel_mipmap_tree *src) { GLuint width = src->level[level].width; GLuint height = src->level[level].height; GLuint depth = src->level[level].depth; GLuint src_x, src_y, dst_x, dst_y; GLuint i; GLboolean success; if (dst->compressed) { GLuint align_w, align_h; intel_get_texture_alignment_unit(dst->format, &align_w, &align_h); height = (height + 3) / 4; width = ALIGN(width, align_w); } intel_prepare_render(intel); for (i = 0; i < depth; i++) { intel_miptree_get_image_offset(src, level, face, i, &src_x, &src_y); intel_miptree_get_image_offset(dst, level, face, i, &dst_x, &dst_y); success = intel_region_copy(intel, dst->region, 0, dst_x, dst_y, src->region, 0, src_x, src_y, width, height, GL_FALSE, GL_COPY); if (!success) { GLubyte *src_ptr, *dst_ptr; src_ptr = intel_region_map(intel, src->region); dst_ptr = intel_region_map(intel, dst->region); _mesa_copy_rect(dst_ptr, dst->cpp, dst->region->pitch, dst_x, dst_y, width, height, src_ptr, src->region->pitch, src_x, src_y); intel_region_unmap(intel, src->region); intel_region_unmap(intel, dst->region); } } }