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