9f51a3ee69ad2a4054d2c2ed48ca024cc6b9c553
[mesa.git] / src / mesa / drivers / dri / intel / intel_mipmap_tree.c
1 /**************************************************************************
2 *
3 * Copyright 2006 Tungsten Graphics, Inc., Cedar Park, Texas.
4 * All Rights Reserved.
5 *
6 * Permission is hereby granted, free of charge, to any person obtaining a
7 * 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, sub license, 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:
13 *
14 * The above copyright notice and this permission notice (including the
15 * next paragraph) shall be included in all copies or substantial portions
16 * of the Software.
17 *
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
19 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
21 * IN NO EVENT SHALL TUNGSTEN GRAPHICS AND/OR ITS SUPPLIERS BE LIABLE FOR
22 * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
23 * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
24 * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
25 *
26 **************************************************************************/
27
28 #include "intel_context.h"
29 #include "intel_mipmap_tree.h"
30 #include "intel_regions.h"
31 #include "intel_tex_layout.h"
32 #ifndef I915
33 #include "brw_state.h"
34 #endif
35 #include "main/enums.h"
36
37 #define FILE_DEBUG_FLAG DEBUG_MIPTREE
38
39
40 static GLenum
41 target_to_target(GLenum target)
42 {
43 switch (target) {
44 case GL_TEXTURE_CUBE_MAP_POSITIVE_X_ARB:
45 case GL_TEXTURE_CUBE_MAP_NEGATIVE_X_ARB:
46 case GL_TEXTURE_CUBE_MAP_POSITIVE_Y_ARB:
47 case GL_TEXTURE_CUBE_MAP_NEGATIVE_Y_ARB:
48 case GL_TEXTURE_CUBE_MAP_POSITIVE_Z_ARB:
49 case GL_TEXTURE_CUBE_MAP_NEGATIVE_Z_ARB:
50 return GL_TEXTURE_CUBE_MAP_ARB;
51 default:
52 return target;
53 }
54 }
55
56
57 static struct intel_mipmap_tree *
58 intel_miptree_create_internal(struct intel_context *intel,
59 GLenum target,
60 GLenum internal_format,
61 GLuint first_level,
62 GLuint last_level,
63 GLuint width0,
64 GLuint height0,
65 GLuint depth0, GLuint cpp, GLuint compress_byte,
66 uint32_t tiling)
67 {
68 GLboolean ok;
69 struct intel_mipmap_tree *mt = calloc(sizeof(*mt), 1);
70
71 DBG("%s target %s format %s level %d..%d <-- %p\n", __FUNCTION__,
72 _mesa_lookup_enum_by_nr(target),
73 _mesa_lookup_enum_by_nr(internal_format),
74 first_level, last_level, mt);
75
76 mt->target = target_to_target(target);
77 mt->internal_format = internal_format;
78 mt->first_level = first_level;
79 mt->last_level = last_level;
80 mt->width0 = width0;
81 mt->height0 = height0;
82 mt->depth0 = depth0;
83 mt->cpp = compress_byte ? compress_byte : cpp;
84 mt->compressed = compress_byte ? 1 : 0;
85 mt->refcount = 1;
86 mt->pitch = 0;
87
88 #ifdef I915
89 if (intel->is_945)
90 ok = i945_miptree_layout(intel, mt, tiling);
91 else
92 ok = i915_miptree_layout(intel, mt, tiling);
93 #else
94 ok = brw_miptree_layout(intel, mt, tiling);
95 #endif
96
97 if (!ok) {
98 free(mt);
99 DBG("%s not okay - returning NULL\n", __FUNCTION__);
100 return NULL;
101 }
102
103 return mt;
104 }
105
106
107 struct intel_mipmap_tree *
108 intel_miptree_create(struct intel_context *intel,
109 GLenum target,
110 GLenum base_format,
111 GLenum internal_format,
112 GLuint first_level,
113 GLuint last_level,
114 GLuint width0,
115 GLuint height0,
116 GLuint depth0, GLuint cpp, GLuint compress_byte,
117 GLboolean expect_accelerated_upload)
118 {
119 struct intel_mipmap_tree *mt;
120 uint32_t tiling;
121
122 if (intel->use_texture_tiling && compress_byte == 0) {
123 if (intel->gen >= 4 &&
124 (base_format == GL_DEPTH_COMPONENT ||
125 base_format == GL_DEPTH_STENCIL_EXT))
126 tiling = I915_TILING_Y;
127 else
128 tiling = I915_TILING_X;
129 } else
130 tiling = I915_TILING_NONE;
131
132 mt = intel_miptree_create_internal(intel, target, internal_format,
133 first_level, last_level, width0,
134 height0, depth0, cpp, compress_byte,
135 tiling);
136 /*
137 * pitch == 0 || height == 0 indicates the null texture
138 */
139 if (!mt || !mt->pitch || !mt->total_height) {
140 free(mt);
141 return NULL;
142 }
143
144 mt->region = intel_region_alloc(intel,
145 tiling,
146 mt->cpp,
147 mt->pitch,
148 mt->total_height,
149 expect_accelerated_upload);
150 mt->pitch = mt->region->pitch;
151
152 if (!mt->region) {
153 free(mt);
154 return NULL;
155 }
156
157 return mt;
158 }
159
160
161 struct intel_mipmap_tree *
162 intel_miptree_create_for_region(struct intel_context *intel,
163 GLenum target,
164 GLenum internal_format,
165 GLuint first_level,
166 GLuint last_level,
167 struct intel_region *region,
168 GLuint depth0,
169 GLuint compress_byte)
170 {
171 struct intel_mipmap_tree *mt;
172
173 mt = intel_miptree_create_internal(intel, target, internal_format,
174 first_level, last_level,
175 region->width, region->height, 1,
176 region->cpp, compress_byte,
177 I915_TILING_NONE);
178 if (!mt)
179 return mt;
180
181 /* The mipmap tree pitch is aligned to 64 bytes to make sure render
182 * to texture works, but we don't need that for texturing from a
183 * pixmap. Just override it here. */
184 mt->pitch = region->pitch;
185
186 intel_region_reference(&mt->region, region);
187
188 return mt;
189 }
190
191
192 /**
193 * intel_miptree_pitch_align:
194 *
195 * @intel: intel context pointer
196 *
197 * @mt: the miptree to compute pitch alignment for
198 *
199 * @pitch: the natural pitch value
200 *
201 * Given @pitch, compute a larger value which accounts for
202 * any necessary alignment required by the device
203 */
204 int intel_miptree_pitch_align (struct intel_context *intel,
205 struct intel_mipmap_tree *mt,
206 uint32_t tiling,
207 int pitch)
208 {
209 #ifdef I915
210 GLcontext *ctx = &intel->ctx;
211 #endif
212
213 if (!mt->compressed) {
214 int pitch_align;
215
216 /* XXX: Align pitch to multiple of 64 bytes for now to allow
217 * render-to-texture to work in all cases. This should probably be
218 * replaced at some point by some scheme to only do this when really
219 * necessary.
220 */
221 pitch_align = 64;
222
223 if (tiling == I915_TILING_X)
224 pitch_align = 512;
225 else if (tiling == I915_TILING_Y)
226 pitch_align = 128;
227
228 pitch = ALIGN(pitch * mt->cpp, pitch_align);
229
230 #ifdef I915
231 /* Do a little adjustment to linear allocations so that we avoid
232 * hitting the same channel of memory for 2 different pages when
233 * reading a 2x2 subspan or doing bilinear filtering.
234 */
235 if (tiling == I915_TILING_NONE && !(pitch & 511) &&
236 (pitch + pitch_align) < (1 << ctx->Const.MaxTextureLevels))
237 pitch += pitch_align;
238 #endif
239
240 pitch /= mt->cpp;
241 }
242 return pitch;
243 }
244
245
246 void
247 intel_miptree_reference(struct intel_mipmap_tree **dst,
248 struct intel_mipmap_tree *src)
249 {
250 src->refcount++;
251 *dst = src;
252 DBG("%s %p refcount now %d\n", __FUNCTION__, src, src->refcount);
253 }
254
255
256 void
257 intel_miptree_release(struct intel_context *intel,
258 struct intel_mipmap_tree **mt)
259 {
260 if (!*mt)
261 return;
262
263 DBG("%s %p refcount will be %d\n", __FUNCTION__, *mt, (*mt)->refcount - 1);
264 if (--(*mt)->refcount <= 0) {
265 GLuint i;
266
267 DBG("%s deleting %p\n", __FUNCTION__, *mt);
268
269 #ifndef I915
270 /* Free up cached binding tables holding a reference on our buffer, to
271 * avoid excessive memory consumption.
272 *
273 * This isn't as aggressive as we could be, as we'd like to do
274 * it from any time we free the last ref on a region. But intel_region.c
275 * is context-agnostic. Perhaps our constant state cache should be, as
276 * well.
277 */
278 brw_state_cache_bo_delete(&brw_context(&intel->ctx)->surface_cache,
279 (*mt)->region->buffer);
280 #endif
281
282 intel_region_release(&((*mt)->region));
283
284 for (i = 0; i < MAX_TEXTURE_LEVELS; i++) {
285 free((*mt)->level[i].x_offset);
286 free((*mt)->level[i].y_offset);
287 }
288
289 free(*mt);
290 }
291 *mt = NULL;
292 }
293
294
295 /**
296 * Can the image be pulled into a unified mipmap tree? This mirrors
297 * the completeness test in a lot of ways.
298 *
299 * Not sure whether I want to pass gl_texture_image here.
300 */
301 GLboolean
302 intel_miptree_match_image(struct intel_mipmap_tree *mt,
303 struct gl_texture_image *image)
304 {
305 GLboolean isCompressed = _mesa_is_format_compressed(image->TexFormat);
306 struct intel_texture_image *intelImage = intel_texture_image(image);
307 GLuint level = intelImage->level;
308
309 /* Images with borders are never pulled into mipmap trees. */
310 if (image->Border)
311 return GL_FALSE;
312
313 if (image->InternalFormat != mt->internal_format ||
314 isCompressed != mt->compressed)
315 return GL_FALSE;
316
317 if (!isCompressed &&
318 !mt->compressed &&
319 _mesa_get_format_bytes(image->TexFormat) != mt->cpp)
320 return GL_FALSE;
321
322 /* Test image dimensions against the base level image adjusted for
323 * minification. This will also catch images not present in the
324 * tree, changed targets, etc.
325 */
326 if (image->Width != mt->level[level].width ||
327 image->Height != mt->level[level].height ||
328 image->Depth != mt->level[level].depth)
329 return GL_FALSE;
330
331 return GL_TRUE;
332 }
333
334
335 void
336 intel_miptree_set_level_info(struct intel_mipmap_tree *mt,
337 GLuint level,
338 GLuint nr_images,
339 GLuint x, GLuint y,
340 GLuint w, GLuint h, GLuint d)
341 {
342 mt->level[level].width = w;
343 mt->level[level].height = h;
344 mt->level[level].depth = d;
345 mt->level[level].level_offset = (x + y * mt->pitch) * mt->cpp;
346 mt->level[level].level_x = x;
347 mt->level[level].level_y = y;
348 mt->level[level].nr_images = nr_images;
349
350 DBG("%s level %d size: %d,%d,%d offset %d,%d (0x%x)\n", __FUNCTION__,
351 level, w, h, d, x, y, mt->level[level].level_offset);
352
353 assert(nr_images);
354 assert(!mt->level[level].x_offset);
355
356 mt->level[level].x_offset = malloc(nr_images * sizeof(GLuint));
357 mt->level[level].x_offset[0] = mt->level[level].level_x;
358 mt->level[level].y_offset = malloc(nr_images * sizeof(GLuint));
359 mt->level[level].y_offset[0] = mt->level[level].level_y;
360 }
361
362
363 void
364 intel_miptree_set_image_offset(struct intel_mipmap_tree *mt,
365 GLuint level, GLuint img,
366 GLuint x, GLuint y)
367 {
368 if (img == 0 && level == 0)
369 assert(x == 0 && y == 0);
370
371 assert(img < mt->level[level].nr_images);
372
373 mt->level[level].x_offset[img] = mt->level[level].level_x + x;
374 mt->level[level].y_offset[img] = mt->level[level].level_y + y;
375
376 DBG("%s level %d img %d pos %d,%d\n",
377 __FUNCTION__, level, img,
378 mt->level[level].x_offset[img], mt->level[level].y_offset[img]);
379 }
380
381
382 void
383 intel_miptree_get_image_offset(struct intel_mipmap_tree *mt,
384 GLuint level, GLuint face, GLuint depth,
385 GLuint *x, GLuint *y)
386 {
387 if (mt->target == GL_TEXTURE_CUBE_MAP_ARB) {
388 *x = mt->level[level].x_offset[face];
389 *y = mt->level[level].y_offset[face];
390 } else if (mt->target == GL_TEXTURE_3D) {
391 *x = mt->level[level].x_offset[depth];
392 *y = mt->level[level].y_offset[depth];
393 } else {
394 *x = mt->level[level].x_offset[0];
395 *y = mt->level[level].y_offset[0];
396 }
397 }
398
399 /**
400 * Map a teximage in a mipmap tree.
401 * \param row_stride returns row stride in bytes
402 * \param image_stride returns image stride in bytes (for 3D textures).
403 * \param image_offsets pointer to array of pixel offsets from the returned
404 * pointer to each depth image
405 * \return address of mapping
406 */
407 GLubyte *
408 intel_miptree_image_map(struct intel_context * intel,
409 struct intel_mipmap_tree * mt,
410 GLuint face,
411 GLuint level,
412 GLuint * row_stride, GLuint * image_offsets)
413 {
414 GLuint x, y;
415 DBG("%s \n", __FUNCTION__);
416
417 if (row_stride)
418 *row_stride = mt->pitch * mt->cpp;
419
420 if (mt->target == GL_TEXTURE_3D) {
421 int i;
422
423 for (i = 0; i < mt->level[level].depth; i++) {
424
425 intel_miptree_get_image_offset(mt, level, face, i,
426 &x, &y);
427 image_offsets[i] = x + y * mt->pitch;
428 }
429
430 return intel_region_map(intel, mt->region);
431 } else {
432 assert(mt->level[level].depth == 1);
433 intel_miptree_get_image_offset(mt, level, face, 0,
434 &x, &y);
435 image_offsets[0] = 0;
436
437 return intel_region_map(intel, mt->region) +
438 (x + y * mt->pitch) * mt->cpp;
439 }
440 }
441
442
443 void
444 intel_miptree_image_unmap(struct intel_context *intel,
445 struct intel_mipmap_tree *mt)
446 {
447 DBG("%s\n", __FUNCTION__);
448 intel_region_unmap(intel, mt->region);
449 }
450
451
452 /**
453 * Upload data for a particular image.
454 */
455 void
456 intel_miptree_image_data(struct intel_context *intel,
457 struct intel_mipmap_tree *dst,
458 GLuint face,
459 GLuint level,
460 void *src,
461 GLuint src_row_pitch,
462 GLuint src_image_pitch)
463 {
464 const GLuint depth = dst->level[level].depth;
465 GLuint i;
466
467 DBG("%s: %d/%d\n", __FUNCTION__, face, level);
468 for (i = 0; i < depth; i++) {
469 GLuint dst_x, dst_y, height;
470
471 intel_miptree_get_image_offset(dst, level, face, i, &dst_x, &dst_y);
472
473 height = dst->level[level].height;
474 if(dst->compressed)
475 height = (height + 3) / 4;
476
477 intel_region_data(intel,
478 dst->region, 0, dst_x, dst_y,
479 src,
480 src_row_pitch,
481 0, 0, /* source x, y */
482 dst->level[level].width, height); /* width, height */
483
484 src = (char *)src + src_image_pitch * dst->cpp;
485 }
486 }
487
488
489 /**
490 * Copy mipmap image between trees
491 */
492 void
493 intel_miptree_image_copy(struct intel_context *intel,
494 struct intel_mipmap_tree *dst,
495 GLuint face, GLuint level,
496 struct intel_mipmap_tree *src)
497 {
498 GLuint width = src->level[level].width;
499 GLuint height = src->level[level].height;
500 GLuint depth = src->level[level].depth;
501 GLuint src_x, src_y, dst_x, dst_y;
502 GLuint i;
503 GLboolean success;
504
505 if (dst->compressed) {
506 GLuint align_w, align_h;
507
508 intel_get_texture_alignment_unit(dst->internal_format,
509 &align_w, &align_h);
510 height = (height + 3) / 4;
511 width = ALIGN(width, align_w);
512 }
513
514 intel_prepare_render(intel);
515
516 for (i = 0; i < depth; i++) {
517 intel_miptree_get_image_offset(src, level, face, i, &src_x, &src_y);
518 intel_miptree_get_image_offset(dst, level, face, i, &dst_x, &dst_y);
519 success = intel_region_copy(intel,
520 dst->region, 0, dst_x, dst_y,
521 src->region, 0, src_x, src_y, width, height,
522 GL_COPY);
523 if (!success) {
524 GLubyte *src_ptr, *dst_ptr;
525
526 src_ptr = intel_region_map(intel, src->region);
527 dst_ptr = intel_region_map(intel, dst->region);
528
529 _mesa_copy_rect(dst_ptr + dst->cpp * (dst_x + dst_y * dst->pitch),
530 dst->cpp,
531 dst->pitch,
532 0, 0, width, height,
533 src_ptr + src->cpp * (src_x + src_y * src->pitch),
534 src->pitch,
535 0, 0);
536 intel_region_unmap(intel, src->region);
537 intel_region_unmap(intel, dst->region);
538 }
539 }
540 }