2 * Copyright (C) 2008 Nicolai Haehnle.
6 * Permission is hereby granted, free of charge, to any person obtaining
7 * a copy of this software and associated documentation files (the
8 * "Software"), to deal in the Software without restriction, including
9 * without limitation the rights to use, copy, modify, merge, publish,
10 * distribute, sublicense, and/or sell copies of the Software, and to
11 * permit persons to whom the Software is furnished to do so, subject to
12 * the following conditions:
14 * The above copyright notice and this permission notice (including the
15 * next paragraph) shall be included in all copies or substantial
16 * portions of the Software.
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
19 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
21 * IN NO EVENT SHALL THE COPYRIGHT OWNER(S) AND/OR ITS SUPPLIERS BE
22 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
23 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
24 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
28 #include "radeon_mipmap_tree.h"
33 #include "main/simple_list.h"
34 #include "main/texcompress.h"
35 #include "main/texformat.h"
37 static GLuint
radeon_compressed_texture_size(GLcontext
*ctx
,
38 GLsizei width
, GLsizei height
, GLsizei depth
,
41 GLuint size
= _mesa_compressed_texture_size(ctx
, width
, height
, depth
, mesaFormat
);
43 if (mesaFormat
== MESA_FORMAT_RGB_DXT1
||
44 mesaFormat
== MESA_FORMAT_RGBA_DXT1
) {
45 if (width
+ 3 < 8) /* width one block */
47 else if (width
+ 3 < 16)
50 /* DXT3/5, 16 bytes per block */
51 // WARN_ONCE("DXT 3/5 suffers from multitexturing problems!\n");
60 static int radeon_compressed_num_bytes(GLuint mesaFormat
)
65 case MESA_FORMAT_RGB_FXT1
:
66 case MESA_FORMAT_RGBA_FXT1
:
67 case MESA_FORMAT_RGB_DXT1
:
68 case MESA_FORMAT_RGBA_DXT1
:
72 case MESA_FORMAT_RGBA_DXT3
:
73 case MESA_FORMAT_RGBA_DXT5
:
83 * Compute sizes and fill in offset and blit information for the given
84 * image (determined by \p face and \p level).
86 * \param curOffset points to the offset at which the image is to be stored
87 * and is updated by this function according to the size of the image.
89 static void compute_tex_image_offset(radeonContextPtr rmesa
, radeon_mipmap_tree
*mt
,
90 GLuint face
, GLuint level
, GLuint
* curOffset
)
92 radeon_mipmap_level
*lvl
= &mt
->levels
[level
];
93 uint32_t row_align
= rmesa
->texture_row_align
- 1;
95 /* Find image size in bytes */
97 /* TODO: Is this correct? Need test cases for compressed textures! */
98 lvl
->rowstride
= (lvl
->width
* mt
->bpp
+ 63) & ~63;
99 lvl
->size
= radeon_compressed_texture_size(mt
->radeon
->glCtx
,
100 lvl
->width
, lvl
->height
, lvl
->depth
, mt
->compressed
);
101 } else if (mt
->target
== GL_TEXTURE_RECTANGLE_NV
) {
102 lvl
->rowstride
= (lvl
->width
* mt
->bpp
+ 63) & ~63;
103 lvl
->size
= lvl
->rowstride
* lvl
->height
;
104 } else if (mt
->tilebits
& RADEON_TXO_MICRO_TILE
) {
105 /* tile pattern is 16 bytes x2. mipmaps stay 32 byte aligned,
106 * though the actual offset may be different (if texture is less than
107 * 32 bytes width) to the untiled case */
108 lvl
->rowstride
= (lvl
->width
* mt
->bpp
* 2 + 31) & ~31;
109 lvl
->size
= lvl
->rowstride
* ((lvl
->height
+ 1) / 2) * lvl
->depth
;
111 lvl
->rowstride
= (lvl
->width
* mt
->bpp
+ row_align
) & ~row_align
;
112 lvl
->size
= lvl
->rowstride
* lvl
->height
* lvl
->depth
;
114 assert(lvl
->size
> 0);
116 /* All images are aligned to a 32-byte offset */
117 *curOffset
= (*curOffset
+ 0x1f) & ~0x1f;
118 lvl
->faces
[face
].offset
= *curOffset
;
119 *curOffset
+= lvl
->size
;
121 if (RADEON_DEBUG
& DEBUG_TEXTURE
)
123 "level %d, face %d: rs:%d %dx%d at %d\n",
124 level
, face
, lvl
->rowstride
, lvl
->width
, lvl
->height
, lvl
->faces
[face
].offset
);
127 static GLuint
minify(GLuint size
, GLuint levels
)
129 size
= size
>> levels
;
136 static void calculate_miptree_layout_r100(radeonContextPtr rmesa
, radeon_mipmap_tree
*mt
)
143 numLevels
= mt
->lastLevel
- mt
->firstLevel
+ 1;
144 assert(numLevels
<= rmesa
->glCtx
->Const
.MaxTextureLevels
);
147 for(face
= 0; face
< mt
->faces
; face
++) {
149 for(i
= 0; i
< numLevels
; i
++) {
150 mt
->levels
[i
].width
= minify(mt
->width0
, i
);
151 mt
->levels
[i
].height
= minify(mt
->height0
, i
);
152 mt
->levels
[i
].depth
= minify(mt
->depth0
, i
);
153 compute_tex_image_offset(rmesa
, mt
, face
, i
, &curOffset
);
157 /* Note the required size in memory */
158 mt
->totalsize
= (curOffset
+ RADEON_OFFSET_MASK
) & ~RADEON_OFFSET_MASK
;
161 static void calculate_miptree_layout_r300(radeonContextPtr rmesa
, radeon_mipmap_tree
*mt
)
167 numLevels
= mt
->lastLevel
- mt
->firstLevel
+ 1;
168 assert(numLevels
<= rmesa
->glCtx
->Const
.MaxTextureLevels
);
171 for(i
= 0; i
< numLevels
; i
++) {
174 mt
->levels
[i
].width
= minify(mt
->width0
, i
);
175 mt
->levels
[i
].height
= minify(mt
->height0
, i
);
176 mt
->levels
[i
].depth
= minify(mt
->depth0
, i
);
178 for(face
= 0; face
< mt
->faces
; face
++)
179 compute_tex_image_offset(rmesa
, mt
, face
, i
, &curOffset
);
182 /* Note the required size in memory */
183 mt
->totalsize
= (curOffset
+ RADEON_OFFSET_MASK
) & ~RADEON_OFFSET_MASK
;
187 * Create a new mipmap tree, calculate its layout and allocate memory.
189 radeon_mipmap_tree
* radeon_miptree_create(radeonContextPtr rmesa
, radeonTexObj
*t
,
190 GLenum target
, GLuint firstLevel
, GLuint lastLevel
,
191 GLuint width0
, GLuint height0
, GLuint depth0
,
192 GLuint bpp
, GLuint tilebits
, GLuint compressed
)
194 radeon_mipmap_tree
*mt
= CALLOC_STRUCT(_radeon_mipmap_tree
);
200 mt
->faces
= (target
== GL_TEXTURE_CUBE_MAP
) ? 6 : 1;
201 mt
->firstLevel
= firstLevel
;
202 mt
->lastLevel
= lastLevel
;
204 mt
->height0
= height0
;
206 mt
->bpp
= compressed
? radeon_compressed_num_bytes(compressed
) : bpp
;
207 mt
->tilebits
= tilebits
;
208 mt
->compressed
= compressed
;
210 if (rmesa
->radeonScreen
->chip_family
>= CHIP_FAMILY_R300
)
211 calculate_miptree_layout_r300(rmesa
, mt
);
213 calculate_miptree_layout_r100(rmesa
, mt
);
215 mt
->bo
= radeon_bo_open(rmesa
->radeonScreen
->bom
,
216 0, mt
->totalsize
, 1024,
217 RADEON_GEM_DOMAIN_VRAM
,
223 void radeon_miptree_reference(radeon_mipmap_tree
*mt
)
226 assert(mt
->refcount
> 0);
229 void radeon_miptree_unreference(radeon_mipmap_tree
*mt
)
234 assert(mt
->refcount
> 0);
237 radeon_bo_unref(mt
->bo
);
244 * Calculate first and last mip levels for the given texture object,
245 * where the dimensions are taken from the given texture image at
248 * Note: level is the OpenGL level number, which is not necessarily the same
249 * as the first level that is actually present.
251 * The base level image of the given texture face must be non-null,
254 static void calculate_first_last_level(struct gl_texture_object
*tObj
,
255 GLuint
*pfirstLevel
, GLuint
*plastLevel
,
256 GLuint face
, GLuint level
)
258 const struct gl_texture_image
* const baseImage
=
259 tObj
->Image
[face
][level
];
263 /* These must be signed values. MinLod and MaxLod can be negative numbers,
264 * and having firstLevel and lastLevel as signed prevents the need for
270 /* Yes, this looks overly complicated, but it's all needed.
272 switch (tObj
->Target
) {
276 case GL_TEXTURE_CUBE_MAP
:
277 if (tObj
->MinFilter
== GL_NEAREST
|| tObj
->MinFilter
== GL_LINEAR
) {
278 /* GL_NEAREST and GL_LINEAR only care about GL_TEXTURE_BASE_LEVEL.
280 firstLevel
= lastLevel
= tObj
->BaseLevel
;
282 firstLevel
= tObj
->BaseLevel
+ (GLint
)(tObj
->MinLod
+ 0.5);
283 firstLevel
= MAX2(firstLevel
, tObj
->BaseLevel
);
284 firstLevel
= MIN2(firstLevel
, level
+ baseImage
->MaxLog2
);
285 lastLevel
= tObj
->BaseLevel
+ (GLint
)(tObj
->MaxLod
+ 0.5);
286 lastLevel
= MAX2(lastLevel
, tObj
->BaseLevel
);
287 lastLevel
= MIN2(lastLevel
, level
+ baseImage
->MaxLog2
);
288 lastLevel
= MIN2(lastLevel
, tObj
->MaxLevel
);
289 lastLevel
= MAX2(firstLevel
, lastLevel
); /* need at least one level */
292 case GL_TEXTURE_RECTANGLE_NV
:
293 case GL_TEXTURE_4D_SGIS
:
294 firstLevel
= lastLevel
= 0;
300 /* save these values */
301 *pfirstLevel
= firstLevel
;
302 *plastLevel
= lastLevel
;
307 * Checks whether the given miptree can hold the given texture image at the
308 * given face and level.
310 GLboolean
radeon_miptree_matches_image(radeon_mipmap_tree
*mt
,
311 struct gl_texture_image
*texImage
, GLuint face
, GLuint level
)
313 radeon_mipmap_level
*lvl
;
315 if (face
>= mt
->faces
|| level
< mt
->firstLevel
|| level
> mt
->lastLevel
)
318 if (texImage
->IsCompressed
!= mt
->compressed
)
321 if (!texImage
->IsCompressed
&&
323 texImage
->TexFormat
->TexelBytes
!= mt
->bpp
)
326 lvl
= &mt
->levels
[level
- mt
->firstLevel
];
327 if (lvl
->width
!= texImage
->Width
||
328 lvl
->height
!= texImage
->Height
||
329 lvl
->depth
!= texImage
->Depth
)
337 * Checks whether the given miptree has the right format to store the given texture object.
339 GLboolean
radeon_miptree_matches_texture(radeon_mipmap_tree
*mt
, struct gl_texture_object
*texObj
)
341 struct gl_texture_image
*firstImage
;
344 GLuint firstLevel
, lastLevel
;
346 calculate_first_last_level(texObj
, &firstLevel
, &lastLevel
, 0, texObj
->BaseLevel
);
347 if (texObj
->Target
== GL_TEXTURE_CUBE_MAP
)
350 firstImage
= texObj
->Image
[0][firstLevel
];
351 compressed
= firstImage
->IsCompressed
? firstImage
->TexFormat
->MesaFormat
: 0;
353 return (mt
->firstLevel
== firstLevel
&&
354 mt
->lastLevel
== lastLevel
&&
355 mt
->width0
== firstImage
->Width
&&
356 mt
->height0
== firstImage
->Height
&&
357 mt
->depth0
== firstImage
->Depth
&&
358 mt
->bpp
== firstImage
->TexFormat
->TexelBytes
&&
359 mt
->compressed
== compressed
);
364 * Try to allocate a mipmap tree for the given texture that will fit the
365 * given image in the given position.
367 void radeon_try_alloc_miptree(radeonContextPtr rmesa
, radeonTexObj
*t
,
368 struct gl_texture_image
*texImage
, GLuint face
, GLuint level
)
370 GLuint compressed
= texImage
->IsCompressed
? texImage
->TexFormat
->MesaFormat
: 0;
372 GLuint firstLevel
, lastLevel
;
376 calculate_first_last_level(&t
->base
, &firstLevel
, &lastLevel
, face
, level
);
377 if (t
->base
.Target
== GL_TEXTURE_CUBE_MAP
)
380 if (level
!= firstLevel
|| face
>= numfaces
)
383 t
->mt
= radeon_miptree_create(rmesa
, t
, t
->base
.Target
,
384 firstLevel
, lastLevel
,
385 texImage
->Width
, texImage
->Height
, texImage
->Depth
,
386 texImage
->TexFormat
->TexelBytes
, t
->tile_bits
, compressed
);
389 /* Although we use the image_offset[] array to store relative offsets
390 * to cube faces, Mesa doesn't know anything about this and expects
391 * each cube face to be treated as a separate image.
393 * These functions present that view to mesa:
396 radeon_miptree_depth_offsets(radeon_mipmap_tree
*mt
, GLuint level
, GLuint
*offsets
)
398 if (mt
->target
!= GL_TEXTURE_3D
|| mt
->faces
== 1)
402 for (i
= 0; i
< 6; i
++)
403 offsets
[i
] = mt
->levels
[level
].faces
[i
].offset
;
408 radeon_miptree_image_offset(radeon_mipmap_tree
*mt
,
409 GLuint face
, GLuint level
)
411 if (mt
->target
== GL_TEXTURE_CUBE_MAP_ARB
)
412 return (mt
->levels
[level
].faces
[face
].offset
);
414 return mt
->levels
[level
].faces
[0].offset
;