projects / mesa.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
history | raw | HEAD
softpipe: Add functions for computing relative mipmap level
[mesa.git] / src / gallium / drivers / softpipe / sp_tex_sample.c
1 /**************************************************************************
2 *
3 * Copyright 2007 VMware, Inc.
4 * All Rights Reserved.
5 * Copyright 2008-2010 VMware, Inc. All rights reserved.
6 *
7 * Permission is hereby granted, free of charge, to any person obtaining a
8 * copy of this software and associated documentation files (the
9 * "Software"), to deal in the Software without restriction, including
10 * without limitation the rights to use, copy, modify, merge, publish,
11 * distribute, sub license, and/or sell copies of the Software, and to
12 * permit persons to whom the Software is furnished to do so, subject to
13 * the following conditions:
14 *
15 * The above copyright notice and this permission notice (including the
16 * next paragraph) shall be included in all copies or substantial portions
17 * of the Software.
18 *
19 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
20 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
21 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
22 * IN NO EVENT SHALL VMWARE AND/OR ITS SUPPLIERS BE LIABLE FOR
23 * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
24 * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
25 * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
26 *
27 **************************************************************************/
28
29 /**
30 * Texture sampling
31 *
32 * Authors:
33 * Brian Paul
34 * Keith Whitwell
35 */
36
37 #include "pipe/p_context.h"
38 #include "pipe/p_defines.h"
39 #include "pipe/p_shader_tokens.h"
40 #include "util/u_math.h"
41 #include "util/u_format.h"
42 #include "util/u_memory.h"
43 #include "util/u_inlines.h"
44 #include "sp_quad.h" /* only for #define QUAD_* tokens */
45 #include "sp_tex_sample.h"
46 #include "sp_texture.h"
47 #include "sp_tex_tile_cache.h"
48
49
50 /** Set to one to help debug texture sampling */
51 #define DEBUG_TEX 0
52
53
54 /*
55 * Return fractional part of 'f'. Used for computing interpolation weights.
56 * Need to be careful with negative values.
57 * Note, if this function isn't perfect you'll sometimes see 1-pixel bands
58 * of improperly weighted linear-filtered textures.
59 * The tests/texwrap.c demo is a good test.
60 */
61 static inline float
62 frac(float f)
63 {
64 return f - floorf(f);
65 }
66
67
68
69 /**
70 * Linear interpolation macro
71 */
72 static inline float
73 lerp(float a, float v0, float v1)
74 {
75 return v0 + a * (v1 - v0);
76 }
77
78
79 /**
80 * Do 2D/bilinear interpolation of float values.
81 * v00, v10, v01 and v11 are typically four texture samples in a square/box.
82 * a and b are the horizontal and vertical interpolants.
83 * It's important that this function is inlined when compiled with
84 * optimization! If we find that's not true on some systems, convert
85 * to a macro.
86 */
87 static inline float
88 lerp_2d(float a, float b,
89 float v00, float v10, float v01, float v11)
90 {
91 const float temp0 = lerp(a, v00, v10);
92 const float temp1 = lerp(a, v01, v11);
93 return lerp(b, temp0, temp1);
94 }
95
96
97 /**
98 * As above, but 3D interpolation of 8 values.
99 */
100 static inline float
101 lerp_3d(float a, float b, float c,
102 float v000, float v100, float v010, float v110,
103 float v001, float v101, float v011, float v111)
104 {
105 const float temp0 = lerp_2d(a, b, v000, v100, v010, v110);
106 const float temp1 = lerp_2d(a, b, v001, v101, v011, v111);
107 return lerp(c, temp0, temp1);
108 }
109
110
111
112 /**
113 * Compute coord % size for repeat wrap modes.
114 * Note that if coord is negative, coord % size doesn't give the right
115 * value. To avoid that problem we add a large multiple of the size
116 * (rather than using a conditional).
117 */
118 static inline int
119 repeat(int coord, unsigned size)
120 {
121 return (coord + size * 1024) % size;
122 }
123
124
125 /**
126 * Apply texture coord wrapping mode and return integer texture indexes
127 * for a vector of four texcoords (S or T or P).
128 * \param wrapMode PIPE_TEX_WRAP_x
129 * \param s the incoming texcoords
130 * \param size the texture image size
131 * \param icoord returns the integer texcoords
132 */
133 static void
134 wrap_nearest_repeat(float s, unsigned size, int offset, int *icoord)
135 {
136 /* s limited to [0,1) */
137 /* i limited to [0,size-1] */
138 int i = util_ifloor(s * size);
139 *icoord = repeat(i + offset, size);
140 }
141
142
143 static void
144 wrap_nearest_clamp(float s, unsigned size, int offset, int *icoord)
145 {
146 /* s limited to [0,1] */
147 /* i limited to [0,size-1] */
148 s *= size;
149 s += offset;
150 if (s <= 0.0F)
151 *icoord = 0;
152 else if (s >= size)
153 *icoord = size - 1;
154 else
155 *icoord = util_ifloor(s);
156 }
157
158
159 static void
160 wrap_nearest_clamp_to_edge(float s, unsigned size, int offset, int *icoord)
161 {
162 /* s limited to [min,max] */
163 /* i limited to [0, size-1] */
164 const float min = 0.5F;
165 const float max = (float)size - 0.5F;
166
167 s *= size;
168 s += offset;
169
170 if (s < min)
171 *icoord = 0;
172 else if (s > max)
173 *icoord = size - 1;
174 else
175 *icoord = util_ifloor(s);
176 }
177
178
179 static void
180 wrap_nearest_clamp_to_border(float s, unsigned size, int offset, int *icoord)
181 {
182 /* s limited to [min,max] */
183 /* i limited to [-1, size] */
184 const float min = -0.5F;
185 const float max = size + 0.5F;
186
187 s *= size;
188 s += offset;
189 if (s <= min)
190 *icoord = -1;
191 else if (s >= max)
192 *icoord = size;
193 else
194 *icoord = util_ifloor(s);
195 }
196
197 static void
198 wrap_nearest_mirror_repeat(float s, unsigned size, int offset, int *icoord)
199 {
200 const float min = 1.0F / (2.0F * size);
201 const float max = 1.0F - min;
202 int flr;
203 float u;
204
205 s += (float)offset / size;
206 flr = util_ifloor(s);
207 u = frac(s);
208 if (flr & 1)
209 u = 1.0F - u;
210 if (u < min)
211 *icoord = 0;
212 else if (u > max)
213 *icoord = size - 1;
214 else
215 *icoord = util_ifloor(u * size);
216 }
217
218
219 static void
220 wrap_nearest_mirror_clamp(float s, unsigned size, int offset, int *icoord)
221 {
222 /* s limited to [0,1] */
223 /* i limited to [0,size-1] */
224 const float u = fabsf(s * size + offset);
225 if (u <= 0.0F)
226 *icoord = 0;
227 else if (u >= size)
228 *icoord = size - 1;
229 else
230 *icoord = util_ifloor(u);
231 }
232
233
234 static void
235 wrap_nearest_mirror_clamp_to_edge(float s, unsigned size, int offset, int *icoord)
236 {
237 /* s limited to [min,max] */
238 /* i limited to [0, size-1] */
239 const float min = 0.5F;
240 const float max = (float)size - 0.5F;
241 const float u = fabsf(s * size + offset);
242
243 if (u < min)
244 *icoord = 0;
245 else if (u > max)
246 *icoord = size - 1;
247 else
248 *icoord = util_ifloor(u);
249 }
250
251
252 static void
253 wrap_nearest_mirror_clamp_to_border(float s, unsigned size, int offset, int *icoord)
254 {
255 /* u limited to [-0.5, size-0.5] */
256 const float min = -0.5F;
257 const float max = (float)size + 0.5F;
258 const float u = fabsf(s * size + offset);
259
260 if (u < min)
261 *icoord = -1;
262 else if (u > max)
263 *icoord = size;
264 else
265 *icoord = util_ifloor(u);
266 }
267
268
269 /**
270 * Used to compute texel locations for linear sampling
271 * \param wrapMode PIPE_TEX_WRAP_x
272 * \param s the texcoord
273 * \param size the texture image size
274 * \param icoord0 returns first texture index
275 * \param icoord1 returns second texture index (usually icoord0 + 1)
276 * \param w returns blend factor/weight between texture indices
277 * \param icoord returns the computed integer texture coord
278 */
279 static void
280 wrap_linear_repeat(float s, unsigned size, int offset,
281 int *icoord0, int *icoord1, float *w)
282 {
283 float u = s * size - 0.5F;
284 *icoord0 = repeat(util_ifloor(u) + offset, size);
285 *icoord1 = repeat(*icoord0 + 1, size);
286 *w = frac(u);
287 }
288
289
290 static void
291 wrap_linear_clamp(float s, unsigned size, int offset,
292 int *icoord0, int *icoord1, float *w)
293 {
294 float u = CLAMP(s * size + offset, 0.0F, (float)size);
295
296 u = u - 0.5f;
297 *icoord0 = util_ifloor(u);
298 *icoord1 = *icoord0 + 1;
299 *w = frac(u);
300 }
301
302
303 static void
304 wrap_linear_clamp_to_edge(float s, unsigned size, int offset,
305 int *icoord0, int *icoord1, float *w)
306 {
307 float u = CLAMP(s * size + offset, 0.0F, (float)size);
308 u = u - 0.5f;
309 *icoord0 = util_ifloor(u);
310 *icoord1 = *icoord0 + 1;
311 if (*icoord0 < 0)
312 *icoord0 = 0;
313 if (*icoord1 >= (int) size)
314 *icoord1 = size - 1;
315 *w = frac(u);
316 }
317
318
319 static void
320 wrap_linear_clamp_to_border(float s, unsigned size, int offset,
321 int *icoord0, int *icoord1, float *w)
322 {
323 const float min = -0.5F;
324 const float max = (float)size + 0.5F;
325 float u = CLAMP(s * size + offset, min, max);
326 u = u - 0.5f;
327 *icoord0 = util_ifloor(u);
328 *icoord1 = *icoord0 + 1;
329 *w = frac(u);
330 }
331
332
333 static void
334 wrap_linear_mirror_repeat(float s, unsigned size, int offset,
335 int *icoord0, int *icoord1, float *w)
336 {
337 int flr;
338 float u;
339
340 s += (float)offset / size;
341 flr = util_ifloor(s);
342 u = frac(s);
343 if (flr & 1)
344 u = 1.0F - u;
345 u = u * size - 0.5F;
346 *icoord0 = util_ifloor(u);
347 *icoord1 = *icoord0 + 1;
348 if (*icoord0 < 0)
349 *icoord0 = 0;
350 if (*icoord1 >= (int) size)
351 *icoord1 = size - 1;
352 *w = frac(u);
353 }
354
355
356 static void
357 wrap_linear_mirror_clamp(float s, unsigned size, int offset,
358 int *icoord0, int *icoord1, float *w)
359 {
360 float u = fabsf(s * size + offset);
361 if (u >= size)
362 u = (float) size;
363 u -= 0.5F;
364 *icoord0 = util_ifloor(u);
365 *icoord1 = *icoord0 + 1;
366 *w = frac(u);
367 }
368
369
370 static void
371 wrap_linear_mirror_clamp_to_edge(float s, unsigned size, int offset,
372 int *icoord0, int *icoord1, float *w)
373 {
374 float u = fabsf(s * size + offset);
375 if (u >= size)
376 u = (float) size;
377 u -= 0.5F;
378 *icoord0 = util_ifloor(u);
379 *icoord1 = *icoord0 + 1;
380 if (*icoord0 < 0)
381 *icoord0 = 0;
382 if (*icoord1 >= (int) size)
383 *icoord1 = size - 1;
384 *w = frac(u);
385 }
386
387
388 static void
389 wrap_linear_mirror_clamp_to_border(float s, unsigned size, int offset,
390 int *icoord0, int *icoord1, float *w)
391 {
392 const float min = -0.5F;
393 const float max = size + 0.5F;
394 float u = fabsf(s * size + offset);
395 if (u <= min)
396 u = min;
397 else if (u >= max)
398 u = max;
399 u -= 0.5F;
400 *icoord0 = util_ifloor(u);
401 *icoord1 = *icoord0 + 1;
402 *w = frac(u);
403 }
404
405
406 /**
407 * PIPE_TEX_WRAP_CLAMP for nearest sampling, unnormalized coords.
408 */
409 static void
410 wrap_nearest_unorm_clamp(float s, unsigned size, int offset, int *icoord)
411 {
412 int i = util_ifloor(s);
413 *icoord = CLAMP(i + offset, 0, (int) size-1);
414 }
415
416
417 /**
418 * PIPE_TEX_WRAP_CLAMP_TO_BORDER for nearest sampling, unnormalized coords.
419 */
420 static void
421 wrap_nearest_unorm_clamp_to_border(float s, unsigned size, int offset, int *icoord)
422 {
423 *icoord = util_ifloor( CLAMP(s + offset, -0.5F, (float) size + 0.5F) );
424 }
425
426
427 /**
428 * PIPE_TEX_WRAP_CLAMP_TO_EDGE for nearest sampling, unnormalized coords.
429 */
430 static void
431 wrap_nearest_unorm_clamp_to_edge(float s, unsigned size, int offset, int *icoord)
432 {
433 *icoord = util_ifloor( CLAMP(s + offset, 0.5F, (float) size - 0.5F) );
434 }
435
436
437 /**
438 * PIPE_TEX_WRAP_CLAMP for linear sampling, unnormalized coords.
439 */
440 static void
441 wrap_linear_unorm_clamp(float s, unsigned size, int offset,
442 int *icoord0, int *icoord1, float *w)
443 {
444 /* Not exactly what the spec says, but it matches NVIDIA output */
445 float u = CLAMP(s + offset - 0.5F, 0.0f, (float) size - 1.0f);
446 *icoord0 = util_ifloor(u);
447 *icoord1 = *icoord0 + 1;
448 *w = frac(u);
449 }
450
451
452 /**
453 * PIPE_TEX_WRAP_CLAMP_TO_BORDER for linear sampling, unnormalized coords.
454 */
455 static void
456 wrap_linear_unorm_clamp_to_border(float s, unsigned size, int offset,
457 int *icoord0, int *icoord1, float *w)
458 {
459 float u = CLAMP(s + offset, -0.5F, (float) size + 0.5F);
460 u -= 0.5F;
461 *icoord0 = util_ifloor(u);
462 *icoord1 = *icoord0 + 1;
463 if (*icoord1 > (int) size - 1)
464 *icoord1 = size - 1;
465 *w = frac(u);
466 }
467
468
469 /**
470 * PIPE_TEX_WRAP_CLAMP_TO_EDGE for linear sampling, unnormalized coords.
471 */
472 static void
473 wrap_linear_unorm_clamp_to_edge(float s, unsigned size, int offset,
474 int *icoord0, int *icoord1, float *w)
475 {
476 float u = CLAMP(s + offset, +0.5F, (float) size - 0.5F);
477 u -= 0.5F;
478 *icoord0 = util_ifloor(u);
479 *icoord1 = *icoord0 + 1;
480 if (*icoord1 > (int) size - 1)
481 *icoord1 = size - 1;
482 *w = frac(u);
483 }
484
485
486 /**
487 * Do coordinate to array index conversion. For array textures.
488 */
489 static inline int
490 coord_to_layer(float coord, unsigned first_layer, unsigned last_layer)
491 {
492 int c = util_ifloor(coord + 0.5F);
493 return CLAMP(c, (int)first_layer, (int)last_layer);
494 }
495
496
497 /**
498 * Examine the quad's texture coordinates to compute the partial
499 * derivatives w.r.t X and Y, then compute lambda (level of detail).
500 */
501 static float
502 compute_lambda_1d(const struct sp_sampler_view *sview,
503 const float s[TGSI_QUAD_SIZE],
504 const float t[TGSI_QUAD_SIZE],
505 const float p[TGSI_QUAD_SIZE])
506 {
507 const struct pipe_resource *texture = sview->base.texture;
508 float dsdx = fabsf(s[QUAD_BOTTOM_RIGHT] - s[QUAD_BOTTOM_LEFT]);
509 float dsdy = fabsf(s[QUAD_TOP_LEFT] - s[QUAD_BOTTOM_LEFT]);
510 float rho = MAX2(dsdx, dsdy) * u_minify(texture->width0, sview->base.u.tex.first_level);
511
512 return util_fast_log2(rho);
513 }
514
515
516 static float
517 compute_lambda_2d(const struct sp_sampler_view *sview,
518 const float s[TGSI_QUAD_SIZE],
519 const float t[TGSI_QUAD_SIZE],
520 const float p[TGSI_QUAD_SIZE])
521 {
522 const struct pipe_resource *texture = sview->base.texture;
523 float dsdx = fabsf(s[QUAD_BOTTOM_RIGHT] - s[QUAD_BOTTOM_LEFT]);
524 float dsdy = fabsf(s[QUAD_TOP_LEFT] - s[QUAD_BOTTOM_LEFT]);
525 float dtdx = fabsf(t[QUAD_BOTTOM_RIGHT] - t[QUAD_BOTTOM_LEFT]);
526 float dtdy = fabsf(t[QUAD_TOP_LEFT] - t[QUAD_BOTTOM_LEFT]);
527 float maxx = MAX2(dsdx, dsdy) * u_minify(texture->width0, sview->base.u.tex.first_level);
528 float maxy = MAX2(dtdx, dtdy) * u_minify(texture->height0, sview->base.u.tex.first_level);
529 float rho = MAX2(maxx, maxy);
530
531 return util_fast_log2(rho);
532 }
533
534
535 static float
536 compute_lambda_3d(const struct sp_sampler_view *sview,
537 const float s[TGSI_QUAD_SIZE],
538 const float t[TGSI_QUAD_SIZE],
539 const float p[TGSI_QUAD_SIZE])
540 {
541 const struct pipe_resource *texture = sview->base.texture;
542 float dsdx = fabsf(s[QUAD_BOTTOM_RIGHT] - s[QUAD_BOTTOM_LEFT]);
543 float dsdy = fabsf(s[QUAD_TOP_LEFT] - s[QUAD_BOTTOM_LEFT]);
544 float dtdx = fabsf(t[QUAD_BOTTOM_RIGHT] - t[QUAD_BOTTOM_LEFT]);
545 float dtdy = fabsf(t[QUAD_TOP_LEFT] - t[QUAD_BOTTOM_LEFT]);
546 float dpdx = fabsf(p[QUAD_BOTTOM_RIGHT] - p[QUAD_BOTTOM_LEFT]);
547 float dpdy = fabsf(p[QUAD_TOP_LEFT] - p[QUAD_BOTTOM_LEFT]);
548 float maxx = MAX2(dsdx, dsdy) * u_minify(texture->width0, sview->base.u.tex.first_level);
549 float maxy = MAX2(dtdx, dtdy) * u_minify(texture->height0, sview->base.u.tex.first_level);
550 float maxz = MAX2(dpdx, dpdy) * u_minify(texture->depth0, sview->base.u.tex.first_level);
551 float rho;
552
553 rho = MAX2(maxx, maxy);
554 rho = MAX2(rho, maxz);
555
556 return util_fast_log2(rho);
557 }
558
559
560 /**
561 * Compute lambda for a vertex texture sampler.
562 * Since there aren't derivatives to use, just return 0.
563 */
564 static float
565 compute_lambda_vert(const struct sp_sampler_view *sview,
566 const float s[TGSI_QUAD_SIZE],
567 const float t[TGSI_QUAD_SIZE],
568 const float p[TGSI_QUAD_SIZE])
569 {
570 return 0.0f;
571 }
572
573
574
575 /**
576 * Get a texel from a texture, using the texture tile cache.
577 *
578 * \param addr the template tex address containing cube, z, face info.
579 * \param x the x coord of texel within 2D image
580 * \param y the y coord of texel within 2D image
581 * \param rgba the quad to put the texel/color into
582 *
583 * XXX maybe move this into sp_tex_tile_cache.c and merge with the
584 * sp_get_cached_tile_tex() function.
585 */
586
587
588
589
590 static inline const float *
591 get_texel_2d_no_border(const struct sp_sampler_view *sp_sview,
592 union tex_tile_address addr, int x, int y)
593 {
594 const struct softpipe_tex_cached_tile *tile;
595 addr.bits.x = x / TEX_TILE_SIZE;
596 addr.bits.y = y / TEX_TILE_SIZE;
597 y %= TEX_TILE_SIZE;
598 x %= TEX_TILE_SIZE;
599
600 tile = sp_get_cached_tile_tex(sp_sview->cache, addr);
601
602 return &tile->data.color[y][x][0];
603 }
604
605
606 static inline const float *
607 get_texel_2d(const struct sp_sampler_view *sp_sview,
608 const struct sp_sampler *sp_samp,
609 union tex_tile_address addr, int x, int y)
610 {
611 const struct pipe_resource *texture = sp_sview->base.texture;
612 unsigned level = addr.bits.level;
613
614 if (x < 0 || x >= (int) u_minify(texture->width0, level) ||
615 y < 0 || y >= (int) u_minify(texture->height0, level)) {
616 return sp_samp->base.border_color.f;
617 }
618 else {
619 return get_texel_2d_no_border( sp_sview, addr, x, y );
620 }
621 }
622
623
624 /*
625 * Here's the complete logic (HOLY CRAP) for finding next face and doing the
626 * corresponding coord wrapping, implemented by get_next_face,
627 * get_next_xcoord, get_next_ycoord.
628 * Read like that (first line):
629 * If face is +x and s coord is below zero, then
630 * new face is +z, new s is max , new t is old t
631 * (max is always cube size - 1).
632 *
633 * +x s- -> +z: s = max, t = t
634 * +x s+ -> -z: s = 0, t = t
635 * +x t- -> +y: s = max, t = max-s
636 * +x t+ -> -y: s = max, t = s
637 *
638 * -x s- -> -z: s = max, t = t
639 * -x s+ -> +z: s = 0, t = t
640 * -x t- -> +y: s = 0, t = s
641 * -x t+ -> -y: s = 0, t = max-s
642 *
643 * +y s- -> -x: s = t, t = 0
644 * +y s+ -> +x: s = max-t, t = 0
645 * +y t- -> -z: s = max-s, t = 0
646 * +y t+ -> +z: s = s, t = 0
647 *
648 * -y s- -> -x: s = max-t, t = max
649 * -y s+ -> +x: s = t, t = max
650 * -y t- -> +z: s = s, t = max
651 * -y t+ -> -z: s = max-s, t = max
652
653 * +z s- -> -x: s = max, t = t
654 * +z s+ -> +x: s = 0, t = t
655 * +z t- -> +y: s = s, t = max
656 * +z t+ -> -y: s = s, t = 0
657
658 * -z s- -> +x: s = max, t = t
659 * -z s+ -> -x: s = 0, t = t
660 * -z t- -> +y: s = max-s, t = 0
661 * -z t+ -> -y: s = max-s, t = max
662 */
663
664
665 /*
666 * seamless cubemap neighbour array.
667 * this array is used to find the adjacent face in each of 4 directions,
668 * left, right, up, down. (or -x, +x, -y, +y).
669 */
670 static const unsigned face_array[PIPE_TEX_FACE_MAX][4] = {
671 /* pos X first then neg X is Z different, Y the same */
672 /* PIPE_TEX_FACE_POS_X,*/
673 { PIPE_TEX_FACE_POS_Z, PIPE_TEX_FACE_NEG_Z,
674 PIPE_TEX_FACE_POS_Y, PIPE_TEX_FACE_NEG_Y },
675 /* PIPE_TEX_FACE_NEG_X */
676 { PIPE_TEX_FACE_NEG_Z, PIPE_TEX_FACE_POS_Z,
677 PIPE_TEX_FACE_POS_Y, PIPE_TEX_FACE_NEG_Y },
678
679 /* pos Y first then neg Y is X different, X the same */
680 /* PIPE_TEX_FACE_POS_Y */
681 { PIPE_TEX_FACE_NEG_X, PIPE_TEX_FACE_POS_X,
682 PIPE_TEX_FACE_NEG_Z, PIPE_TEX_FACE_POS_Z },
683
684 /* PIPE_TEX_FACE_NEG_Y */
685 { PIPE_TEX_FACE_NEG_X, PIPE_TEX_FACE_POS_X,
686 PIPE_TEX_FACE_POS_Z, PIPE_TEX_FACE_NEG_Z },
687
688 /* pos Z first then neg Y is X different, X the same */
689 /* PIPE_TEX_FACE_POS_Z */
690 { PIPE_TEX_FACE_NEG_X, PIPE_TEX_FACE_POS_X,
691 PIPE_TEX_FACE_POS_Y, PIPE_TEX_FACE_NEG_Y },
692
693 /* PIPE_TEX_FACE_NEG_Z */
694 { PIPE_TEX_FACE_POS_X, PIPE_TEX_FACE_NEG_X,
695 PIPE_TEX_FACE_POS_Y, PIPE_TEX_FACE_NEG_Y }
696 };
697
698 static inline unsigned
699 get_next_face(unsigned face, int idx)
700 {
701 return face_array[face][idx];
702 }
703
704 /*
705 * return a new xcoord based on old face, old coords, cube size
706 * and fall_off_index (0 for x-, 1 for x+, 2 for y-, 3 for y+)
707 */
708 static inline int
709 get_next_xcoord(unsigned face, unsigned fall_off_index, int max, int xc, int yc)
710 {
711 if ((face == 0 && fall_off_index != 1) ||
712 (face == 1 && fall_off_index == 0) ||
713 (face == 4 && fall_off_index == 0) ||
714 (face == 5 && fall_off_index == 0)) {
715 return max;
716 }
717 if ((face == 1 && fall_off_index != 0) ||
718 (face == 0 && fall_off_index == 1) ||
719 (face == 4 && fall_off_index == 1) ||
720 (face == 5 && fall_off_index == 1)) {
721 return 0;
722 }
723 if ((face == 4 && fall_off_index >= 2) ||
724 (face == 2 && fall_off_index == 3) ||
725 (face == 3 && fall_off_index == 2)) {
726 return xc;
727 }
728 if ((face == 5 && fall_off_index >= 2) ||
729 (face == 2 && fall_off_index == 2) ||
730 (face == 3 && fall_off_index == 3)) {
731 return max - xc;
732 }
733 if ((face == 2 && fall_off_index == 0) ||
734 (face == 3 && fall_off_index == 1)) {
735 return yc;
736 }
737 /* (face == 2 && fall_off_index == 1) ||
738 (face == 3 && fall_off_index == 0)) */
739 return max - yc;
740 }
741
742 /*
743 * return a new ycoord based on old face, old coords, cube size
744 * and fall_off_index (0 for x-, 1 for x+, 2 for y-, 3 for y+)
745 */
746 static inline int
747 get_next_ycoord(unsigned face, unsigned fall_off_index, int max, int xc, int yc)
748 {
749 if ((fall_off_index <= 1) && (face <= 1 || face >= 4)) {
750 return yc;
751 }
752 if (face == 2 ||
753 (face == 4 && fall_off_index == 3) ||
754 (face == 5 && fall_off_index == 2)) {
755 return 0;
756 }
757 if (face == 3 ||
758 (face == 4 && fall_off_index == 2) ||
759 (face == 5 && fall_off_index == 3)) {
760 return max;
761 }
762 if ((face == 0 && fall_off_index == 3) ||
763 (face == 1 && fall_off_index == 2)) {
764 return xc;
765 }
766 /* (face == 0 && fall_off_index == 2) ||
767 (face == 1 && fall_off_index == 3) */
768 return max - xc;
769 }
770
771
772 /* Gather a quad of adjacent texels within a tile:
773 */
774 static inline void
775 get_texel_quad_2d_no_border_single_tile(const struct sp_sampler_view *sp_sview,
776 union tex_tile_address addr,
777 unsigned x, unsigned y,
778 const float *out[4])
779 {
780 const struct softpipe_tex_cached_tile *tile;
781
782 addr.bits.x = x / TEX_TILE_SIZE;
783 addr.bits.y = y / TEX_TILE_SIZE;
784 y %= TEX_TILE_SIZE;
785 x %= TEX_TILE_SIZE;
786
787 tile = sp_get_cached_tile_tex(sp_sview->cache, addr);
788
789 out[0] = &tile->data.color[y ][x ][0];
790 out[1] = &tile->data.color[y ][x+1][0];
791 out[2] = &tile->data.color[y+1][x ][0];
792 out[3] = &tile->data.color[y+1][x+1][0];
793 }
794
795
796 /* Gather a quad of potentially non-adjacent texels:
797 */
798 static inline void
799 get_texel_quad_2d_no_border(const struct sp_sampler_view *sp_sview,
800 union tex_tile_address addr,
801 int x0, int y0,
802 int x1, int y1,
803 const float *out[4])
804 {
805 out[0] = get_texel_2d_no_border( sp_sview, addr, x0, y0 );
806 out[1] = get_texel_2d_no_border( sp_sview, addr, x1, y0 );
807 out[2] = get_texel_2d_no_border( sp_sview, addr, x0, y1 );
808 out[3] = get_texel_2d_no_border( sp_sview, addr, x1, y1 );
809 }
810
811 /* Can involve a lot of unnecessary checks for border color:
812 */
813 static inline void
814 get_texel_quad_2d(const struct sp_sampler_view *sp_sview,
815 const struct sp_sampler *sp_samp,
816 union tex_tile_address addr,
817 int x0, int y0,
818 int x1, int y1,
819 const float *out[4])
820 {
821 out[0] = get_texel_2d( sp_sview, sp_samp, addr, x0, y0 );
822 out[1] = get_texel_2d( sp_sview, sp_samp, addr, x1, y0 );
823 out[3] = get_texel_2d( sp_sview, sp_samp, addr, x1, y1 );
824 out[2] = get_texel_2d( sp_sview, sp_samp, addr, x0, y1 );
825 }
826
827
828
829 /* 3d variants:
830 */
831 static inline const float *
832 get_texel_3d_no_border(const struct sp_sampler_view *sp_sview,
833 union tex_tile_address addr, int x, int y, int z)
834 {
835 const struct softpipe_tex_cached_tile *tile;
836
837 addr.bits.x = x / TEX_TILE_SIZE;
838 addr.bits.y = y / TEX_TILE_SIZE;
839 addr.bits.z = z;
840 y %= TEX_TILE_SIZE;
841 x %= TEX_TILE_SIZE;
842
843 tile = sp_get_cached_tile_tex(sp_sview->cache, addr);
844
845 return &tile->data.color[y][x][0];
846 }
847
848
849 static inline const float *
850 get_texel_3d(const struct sp_sampler_view *sp_sview,
851 const struct sp_sampler *sp_samp,
852 union tex_tile_address addr, int x, int y, int z)
853 {
854 const struct pipe_resource *texture = sp_sview->base.texture;
855 unsigned level = addr.bits.level;
856
857 if (x < 0 || x >= (int) u_minify(texture->width0, level) ||
858 y < 0 || y >= (int) u_minify(texture->height0, level) ||
859 z < 0 || z >= (int) u_minify(texture->depth0, level)) {
860 return sp_samp->base.border_color.f;
861 }
862 else {
863 return get_texel_3d_no_border( sp_sview, addr, x, y, z );
864 }
865 }
866
867
868 /* Get texel pointer for 1D array texture */
869 static inline const float *
870 get_texel_1d_array(const struct sp_sampler_view *sp_sview,
871 const struct sp_sampler *sp_samp,
872 union tex_tile_address addr, int x, int y)
873 {
874 const struct pipe_resource *texture = sp_sview->base.texture;
875 unsigned level = addr.bits.level;
876
877 if (x < 0 || x >= (int) u_minify(texture->width0, level)) {
878 return sp_samp->base.border_color.f;
879 }
880 else {
881 return get_texel_2d_no_border(sp_sview, addr, x, y);
882 }
883 }
884
885
886 /* Get texel pointer for 2D array texture */
887 static inline const float *
888 get_texel_2d_array(const struct sp_sampler_view *sp_sview,
889 const struct sp_sampler *sp_samp,
890 union tex_tile_address addr, int x, int y, int layer)
891 {
892 const struct pipe_resource *texture = sp_sview->base.texture;
893 unsigned level = addr.bits.level;
894
895 assert(layer < (int) texture->array_size);
896 assert(layer >= 0);
897
898 if (x < 0 || x >= (int) u_minify(texture->width0, level) ||
899 y < 0 || y >= (int) u_minify(texture->height0, level)) {
900 return sp_samp->base.border_color.f;
901 }
902 else {
903 return get_texel_3d_no_border(sp_sview, addr, x, y, layer);
904 }
905 }
906
907
908 static inline const float *
909 get_texel_cube_seamless(const struct sp_sampler_view *sp_sview,
910 union tex_tile_address addr, int x, int y,
911 float *corner, int layer, unsigned face)
912 {
913 const struct pipe_resource *texture = sp_sview->base.texture;
914 unsigned level = addr.bits.level;
915 int new_x, new_y, max_x;
916
917 max_x = (int) u_minify(texture->width0, level);
918
919 assert(texture->width0 == texture->height0);
920 new_x = x;
921 new_y = y;
922
923 /* change the face */
924 if (x < 0) {
925 /*
926 * Cheat with corners. They are difficult and I believe because we don't get
927 * per-pixel faces we can actually have multiple corner texels per pixel,
928 * which screws things up majorly in any case (as the per spec behavior is
929 * to average the 3 remaining texels, which we might not have).
930 * Hence just make sure that the 2nd coord is clamped, will simply pick the
931 * sample which would have fallen off the x coord, but not y coord.
932 * So the filter weight of the samples will be wrong, but at least this
933 * ensures that only valid texels near the corner are used.
934 */
935 if (y < 0 || y >= max_x) {
936 y = CLAMP(y, 0, max_x - 1);
937 }
938 new_x = get_next_xcoord(face, 0, max_x -1, x, y);
939 new_y = get_next_ycoord(face, 0, max_x -1, x, y);
940 face = get_next_face(face, 0);
941 } else if (x >= max_x) {
942 if (y < 0 || y >= max_x) {
943 y = CLAMP(y, 0, max_x - 1);
944 }
945 new_x = get_next_xcoord(face, 1, max_x -1, x, y);
946 new_y = get_next_ycoord(face, 1, max_x -1, x, y);
947 face = get_next_face(face, 1);
948 } else if (y < 0) {
949 new_x = get_next_xcoord(face, 2, max_x -1, x, y);
950 new_y = get_next_ycoord(face, 2, max_x -1, x, y);
951 face = get_next_face(face, 2);
952 } else if (y >= max_x) {
953 new_x = get_next_xcoord(face, 3, max_x -1, x, y);
954 new_y = get_next_ycoord(face, 3, max_x -1, x, y);
955 face = get_next_face(face, 3);
956 }
957
958 return get_texel_3d_no_border(sp_sview, addr, new_x, new_y, layer + face);
959 }
960
961
962 /* Get texel pointer for cube array texture */
963 static inline const float *
964 get_texel_cube_array(const struct sp_sampler_view *sp_sview,
965 const struct sp_sampler *sp_samp,
966 union tex_tile_address addr, int x, int y, int layer)
967 {
968 const struct pipe_resource *texture = sp_sview->base.texture;
969 unsigned level = addr.bits.level;
970
971 assert(layer < (int) texture->array_size);
972 assert(layer >= 0);
973
974 if (x < 0 || x >= (int) u_minify(texture->width0, level) ||
975 y < 0 || y >= (int) u_minify(texture->height0, level)) {
976 return sp_samp->base.border_color.f;
977 }
978 else {
979 return get_texel_3d_no_border(sp_sview, addr, x, y, layer);
980 }
981 }
982 /**
983 * Given the logbase2 of a mipmap's base level size and a mipmap level,
984 * return the size (in texels) of that mipmap level.
985 * For example, if level[0].width = 256 then base_pot will be 8.
986 * If level = 2, then we'll return 64 (the width at level=2).
987 * Return 1 if level > base_pot.
988 */
989 static inline unsigned
990 pot_level_size(unsigned base_pot, unsigned level)
991 {
992 return (base_pot >= level) ? (1 << (base_pot - level)) : 1;
993 }
994
995
996 static void
997 print_sample(const char *function, const float *rgba)
998 {
999 debug_printf("%s %g %g %g %g\n",
1000 function,
1001 rgba[0], rgba[TGSI_NUM_CHANNELS], rgba[2*TGSI_NUM_CHANNELS], rgba[3*TGSI_NUM_CHANNELS]);
1002 }
1003
1004
1005 static void
1006 print_sample_4(const char *function, float rgba[TGSI_NUM_CHANNELS][TGSI_QUAD_SIZE])
1007 {
1008 debug_printf("%s %g %g %g %g, %g %g %g %g, %g %g %g %g, %g %g %g %g\n",
1009 function,
1010 rgba[0][0], rgba[1][0], rgba[2][0], rgba[3][0],
1011 rgba[0][1], rgba[1][1], rgba[2][1], rgba[3][1],
1012 rgba[0][2], rgba[1][2], rgba[2][2], rgba[3][2],
1013 rgba[0][3], rgba[1][3], rgba[2][3], rgba[3][3]);
1014 }
1015
1016
1017 /* Some image-filter fastpaths:
1018 */
1019 static inline void
1020 img_filter_2d_linear_repeat_POT(struct sp_sampler_view *sp_sview,
1021 struct sp_sampler *sp_samp,
1022 const struct img_filter_args *args,
1023 float *rgba)
1024 {
1025 unsigned xpot = pot_level_size(sp_sview->xpot, args->level);
1026 unsigned ypot = pot_level_size(sp_sview->ypot, args->level);
1027 int xmax = (xpot - 1) & (TEX_TILE_SIZE - 1); /* MIN2(TEX_TILE_SIZE, xpot) - 1; */
1028 int ymax = (ypot - 1) & (TEX_TILE_SIZE - 1); /* MIN2(TEX_TILE_SIZE, ypot) - 1; */
1029 union tex_tile_address addr;
1030 int c;
1031
1032 float u = (args->s * xpot - 0.5F) + args->offset[0];
1033 float v = (args->t * ypot - 0.5F) + args->offset[1];
1034
1035 int uflr = util_ifloor(u);
1036 int vflr = util_ifloor(v);
1037
1038 float xw = u - (float)uflr;
1039 float yw = v - (float)vflr;
1040
1041 int x0 = uflr & (xpot - 1);
1042 int y0 = vflr & (ypot - 1);
1043
1044 const float *tx[4];
1045
1046 addr.value = 0;
1047 addr.bits.level = args->level;
1048
1049 /* Can we fetch all four at once:
1050 */
1051 if (x0 < xmax && y0 < ymax) {
1052 get_texel_quad_2d_no_border_single_tile(sp_sview, addr, x0, y0, tx);
1053 }
1054 else {
1055 unsigned x1 = (x0 + 1) & (xpot - 1);
1056 unsigned y1 = (y0 + 1) & (ypot - 1);
1057 get_texel_quad_2d_no_border(sp_sview, addr, x0, y0, x1, y1, tx);
1058 }
1059
1060 /* interpolate R, G, B, A */
1061 for (c = 0; c < TGSI_QUAD_SIZE; c++) {
1062 rgba[TGSI_NUM_CHANNELS*c] = lerp_2d(xw, yw,
1063 tx[0][c], tx[1][c],
1064 tx[2][c], tx[3][c]);
1065 }
1066
1067 if (DEBUG_TEX) {
1068 print_sample(__FUNCTION__, rgba);
1069 }
1070 }
1071
1072
1073 static inline void
1074 img_filter_2d_nearest_repeat_POT(struct sp_sampler_view *sp_sview,
1075 struct sp_sampler *sp_samp,
1076 const struct img_filter_args *args,
1077 float rgba[TGSI_QUAD_SIZE])
1078 {
1079 unsigned xpot = pot_level_size(sp_sview->xpot, args->level);
1080 unsigned ypot = pot_level_size(sp_sview->ypot, args->level);
1081 const float *out;
1082 union tex_tile_address addr;
1083 int c;
1084
1085 float u = args->s * xpot + args->offset[0];
1086 float v = args->t * ypot + args->offset[1];
1087
1088 int uflr = util_ifloor(u);
1089 int vflr = util_ifloor(v);
1090
1091 int x0 = uflr & (xpot - 1);
1092 int y0 = vflr & (ypot - 1);
1093
1094 addr.value = 0;
1095 addr.bits.level = args->level;
1096
1097 out = get_texel_2d_no_border(sp_sview, addr, x0, y0);
1098 for (c = 0; c < TGSI_QUAD_SIZE; c++)
1099 rgba[TGSI_NUM_CHANNELS*c] = out[c];
1100
1101 if (DEBUG_TEX) {
1102 print_sample(__FUNCTION__, rgba);
1103 }
1104 }
1105
1106
1107 static inline void
1108 img_filter_2d_nearest_clamp_POT(struct sp_sampler_view *sp_sview,
1109 struct sp_sampler *sp_samp,
1110 const struct img_filter_args *args,
1111 float rgba[TGSI_QUAD_SIZE])
1112 {
1113 unsigned xpot = pot_level_size(sp_sview->xpot, args->level);
1114 unsigned ypot = pot_level_size(sp_sview->ypot, args->level);
1115 union tex_tile_address addr;
1116 int c;
1117
1118 float u = args->s * xpot + args->offset[0];
1119 float v = args->t * ypot + args->offset[1];
1120
1121 int x0, y0;
1122 const float *out;
1123
1124 addr.value = 0;
1125 addr.bits.level = args->level;
1126
1127 x0 = util_ifloor(u);
1128 if (x0 < 0)
1129 x0 = 0;
1130 else if (x0 > (int) xpot - 1)
1131 x0 = xpot - 1;
1132
1133 y0 = util_ifloor(v);
1134 if (y0 < 0)
1135 y0 = 0;
1136 else if (y0 > (int) ypot - 1)
1137 y0 = ypot - 1;
1138
1139 out = get_texel_2d_no_border(sp_sview, addr, x0, y0);
1140 for (c = 0; c < TGSI_QUAD_SIZE; c++)
1141 rgba[TGSI_NUM_CHANNELS*c] = out[c];
1142
1143 if (DEBUG_TEX) {
1144 print_sample(__FUNCTION__, rgba);
1145 }
1146 }
1147
1148
1149 static void
1150 img_filter_1d_nearest(struct sp_sampler_view *sp_sview,
1151 struct sp_sampler *sp_samp,
1152 const struct img_filter_args *args,
1153 float rgba[TGSI_QUAD_SIZE])
1154 {
1155 const struct pipe_resource *texture = sp_sview->base.texture;
1156 int width;
1157 int x;
1158 union tex_tile_address addr;
1159 const float *out;
1160 int c;
1161
1162 width = u_minify(texture->width0, args->level);
1163
1164 assert(width > 0);
1165
1166 addr.value = 0;
1167 addr.bits.level = args->level;
1168
1169 sp_samp->nearest_texcoord_s(args->s, width, args->offset[0], &x);
1170
1171 out = get_texel_2d(sp_sview, sp_samp, addr, x, 0);
1172 for (c = 0; c < TGSI_QUAD_SIZE; c++)
1173 rgba[TGSI_NUM_CHANNELS*c] = out[c];
1174
1175 if (DEBUG_TEX) {
1176 print_sample(__FUNCTION__, rgba);
1177 }
1178 }
1179
1180
1181 static void
1182 img_filter_1d_array_nearest(struct sp_sampler_view *sp_sview,
1183 struct sp_sampler *sp_samp,
1184 const struct img_filter_args *args,
1185 float *rgba)
1186 {
1187 const struct pipe_resource *texture = sp_sview->base.texture;
1188 int width;
1189 int x, layer;
1190 union tex_tile_address addr;
1191 const float *out;
1192 int c;
1193
1194 width = u_minify(texture->width0, args->level);
1195
1196 assert(width > 0);
1197
1198 addr.value = 0;
1199 addr.bits.level = args->level;
1200
1201 sp_samp->nearest_texcoord_s(args->s, width, args->offset[0], &x);
1202 layer = coord_to_layer(args->t, sp_sview->base.u.tex.first_layer,
1203 sp_sview->base.u.tex.last_layer);
1204
1205 out = get_texel_1d_array(sp_sview, sp_samp, addr, x, layer);
1206 for (c = 0; c < TGSI_QUAD_SIZE; c++)
1207 rgba[TGSI_NUM_CHANNELS*c] = out[c];
1208
1209 if (DEBUG_TEX) {
1210 print_sample(__FUNCTION__, rgba);
1211 }
1212 }
1213
1214
1215 static void
1216 img_filter_2d_nearest(struct sp_sampler_view *sp_sview,
1217 struct sp_sampler *sp_samp,
1218 const struct img_filter_args *args,
1219 float *rgba)
1220 {
1221 const struct pipe_resource *texture = sp_sview->base.texture;
1222 int width, height;
1223 int x, y;
1224 union tex_tile_address addr;
1225 const float *out;
1226 int c;
1227
1228 width = u_minify(texture->width0, args->level);
1229 height = u_minify(texture->height0, args->level);
1230
1231 assert(width > 0);
1232 assert(height > 0);
1233
1234 addr.value = 0;
1235 addr.bits.level = args->level;
1236
1237 sp_samp->nearest_texcoord_s(args->s, width, args->offset[0], &x);
1238 sp_samp->nearest_texcoord_t(args->t, height, args->offset[1], &y);
1239
1240 out = get_texel_2d(sp_sview, sp_samp, addr, x, y);
1241 for (c = 0; c < TGSI_QUAD_SIZE; c++)
1242 rgba[TGSI_NUM_CHANNELS*c] = out[c];
1243
1244 if (DEBUG_TEX) {
1245 print_sample(__FUNCTION__, rgba);
1246 }
1247 }
1248
1249
1250 static void
1251 img_filter_2d_array_nearest(struct sp_sampler_view *sp_sview,
1252 struct sp_sampler *sp_samp,
1253 const struct img_filter_args *args,
1254 float *rgba)
1255 {
1256 const struct pipe_resource *texture = sp_sview->base.texture;
1257 int width, height;
1258 int x, y, layer;
1259 union tex_tile_address addr;
1260 const float *out;
1261 int c;
1262
1263 width = u_minify(texture->width0, args->level);
1264 height = u_minify(texture->height0, args->level);
1265
1266 assert(width > 0);
1267 assert(height > 0);
1268
1269 addr.value = 0;
1270 addr.bits.level = args->level;
1271
1272 sp_samp->nearest_texcoord_s(args->s, width, args->offset[0], &x);
1273 sp_samp->nearest_texcoord_t(args->t, height, args->offset[1], &y);
1274 layer = coord_to_layer(args->p, sp_sview->base.u.tex.first_layer,
1275 sp_sview->base.u.tex.last_layer);
1276
1277 out = get_texel_2d_array(sp_sview, sp_samp, addr, x, y, layer);
1278 for (c = 0; c < TGSI_QUAD_SIZE; c++)
1279 rgba[TGSI_NUM_CHANNELS*c] = out[c];
1280
1281 if (DEBUG_TEX) {
1282 print_sample(__FUNCTION__, rgba);
1283 }
1284 }
1285
1286
1287 static void
1288 img_filter_cube_nearest(struct sp_sampler_view *sp_sview,
1289 struct sp_sampler *sp_samp,
1290 const struct img_filter_args *args,
1291 float *rgba)
1292 {
1293 const struct pipe_resource *texture = sp_sview->base.texture;
1294 int width, height;
1295 int x, y, layerface;
1296 union tex_tile_address addr;
1297 const float *out;
1298 int c;
1299
1300 width = u_minify(texture->width0, args->level);
1301 height = u_minify(texture->height0, args->level);
1302
1303 assert(width > 0);
1304 assert(height > 0);
1305
1306 addr.value = 0;
1307 addr.bits.level = args->level;
1308
1309 /*
1310 * If NEAREST filtering is done within a miplevel, always apply wrap
1311 * mode CLAMP_TO_EDGE.
1312 */
1313 if (sp_samp->base.seamless_cube_map) {
1314 wrap_nearest_clamp_to_edge(args->s, width, args->offset[0], &x);
1315 wrap_nearest_clamp_to_edge(args->t, height, args->offset[1], &y);
1316 } else {
1317 /* Would probably make sense to ignore mode and just do edge clamp */
1318 sp_samp->nearest_texcoord_s(args->s, width, args->offset[0], &x);
1319 sp_samp->nearest_texcoord_t(args->t, height, args->offset[1], &y);
1320 }
1321
1322 layerface = args->face_id + sp_sview->base.u.tex.first_layer;
1323 out = get_texel_cube_array(sp_sview, sp_samp, addr, x, y, layerface);
1324 for (c = 0; c < TGSI_QUAD_SIZE; c++)
1325 rgba[TGSI_NUM_CHANNELS*c] = out[c];
1326
1327 if (DEBUG_TEX) {
1328 print_sample(__FUNCTION__, rgba);
1329 }
1330 }
1331
1332 static void
1333 img_filter_cube_array_nearest(struct sp_sampler_view *sp_sview,
1334 struct sp_sampler *sp_samp,
1335 const struct img_filter_args *args,
1336 float *rgba)
1337 {
1338 const struct pipe_resource *texture = sp_sview->base.texture;
1339 int width, height;
1340 int x, y, layerface;
1341 union tex_tile_address addr;
1342 const float *out;
1343 int c;
1344
1345 width = u_minify(texture->width0, args->level);
1346 height = u_minify(texture->height0, args->level);
1347
1348 assert(width > 0);
1349 assert(height > 0);
1350
1351 addr.value = 0;
1352 addr.bits.level = args->level;
1353
1354 sp_samp->nearest_texcoord_s(args->s, width, args->offset[0], &x);
1355 sp_samp->nearest_texcoord_t(args->t, height, args->offset[1], &y);
1356 layerface = coord_to_layer(6 * args->p + sp_sview->base.u.tex.first_layer,
1357 sp_sview->base.u.tex.first_layer,
1358 sp_sview->base.u.tex.last_layer - 5) + args->face_id;
1359
1360 out = get_texel_cube_array(sp_sview, sp_samp, addr, x, y, layerface);
1361 for (c = 0; c < TGSI_QUAD_SIZE; c++)
1362 rgba[TGSI_NUM_CHANNELS*c] = out[c];
1363
1364 if (DEBUG_TEX) {
1365 print_sample(__FUNCTION__, rgba);
1366 }
1367 }
1368
1369 static void
1370 img_filter_3d_nearest(struct sp_sampler_view *sp_sview,
1371 struct sp_sampler *sp_samp,
1372 const struct img_filter_args *args,
1373 float *rgba)
1374 {
1375 const struct pipe_resource *texture = sp_sview->base.texture;
1376 int width, height, depth;
1377 int x, y, z;
1378 union tex_tile_address addr;
1379 const float *out;
1380 int c;
1381
1382 width = u_minify(texture->width0, args->level);
1383 height = u_minify(texture->height0, args->level);
1384 depth = u_minify(texture->depth0, args->level);
1385
1386 assert(width > 0);
1387 assert(height > 0);
1388 assert(depth > 0);
1389
1390 sp_samp->nearest_texcoord_s(args->s, width, args->offset[0], &x);
1391 sp_samp->nearest_texcoord_t(args->t, height, args->offset[1], &y);
1392 sp_samp->nearest_texcoord_p(args->p, depth, args->offset[2], &z);
1393
1394 addr.value = 0;
1395 addr.bits.level = args->level;
1396
1397 out = get_texel_3d(sp_sview, sp_samp, addr, x, y, z);
1398 for (c = 0; c < TGSI_QUAD_SIZE; c++)
1399 rgba[TGSI_NUM_CHANNELS*c] = out[c];
1400 }
1401
1402
1403 static void
1404 img_filter_1d_linear(struct sp_sampler_view *sp_sview,
1405 struct sp_sampler *sp_samp,
1406 const struct img_filter_args *args,
1407 float *rgba)
1408 {
1409 const struct pipe_resource *texture = sp_sview->base.texture;
1410 int width;
1411 int x0, x1;
1412 float xw; /* weights */
1413 union tex_tile_address addr;
1414 const float *tx0, *tx1;
1415 int c;
1416
1417 width = u_minify(texture->width0, args->level);
1418
1419 assert(width > 0);
1420
1421 addr.value = 0;
1422 addr.bits.level = args->level;
1423
1424 sp_samp->linear_texcoord_s(args->s, width, args->offset[0], &x0, &x1, &xw);
1425
1426 tx0 = get_texel_2d(sp_sview, sp_samp, addr, x0, 0);
1427 tx1 = get_texel_2d(sp_sview, sp_samp, addr, x1, 0);
1428
1429 /* interpolate R, G, B, A */
1430 for (c = 0; c < TGSI_QUAD_SIZE; c++)
1431 rgba[TGSI_NUM_CHANNELS*c] = lerp(xw, tx0[c], tx1[c]);
1432 }
1433
1434
1435 static void
1436 img_filter_1d_array_linear(struct sp_sampler_view *sp_sview,
1437 struct sp_sampler *sp_samp,
1438 const struct img_filter_args *args,
1439 float *rgba)
1440 {
1441 const struct pipe_resource *texture = sp_sview->base.texture;
1442 int width;
1443 int x0, x1, layer;
1444 float xw; /* weights */
1445 union tex_tile_address addr;
1446 const float *tx0, *tx1;
1447 int c;
1448
1449 width = u_minify(texture->width0, args->level);
1450
1451 assert(width > 0);
1452
1453 addr.value = 0;
1454 addr.bits.level = args->level;
1455
1456 sp_samp->linear_texcoord_s(args->s, width, args->offset[0], &x0, &x1, &xw);
1457 layer = coord_to_layer(args->t, sp_sview->base.u.tex.first_layer,
1458 sp_sview->base.u.tex.last_layer);
1459
1460 tx0 = get_texel_1d_array(sp_sview, sp_samp, addr, x0, layer);
1461 tx1 = get_texel_1d_array(sp_sview, sp_samp, addr, x1, layer);
1462
1463 /* interpolate R, G, B, A */
1464 for (c = 0; c < TGSI_QUAD_SIZE; c++)
1465 rgba[TGSI_NUM_CHANNELS*c] = lerp(xw, tx0[c], tx1[c]);
1466 }
1467
1468 /*
1469 * Retrieve the gathered value, need to convert to the
1470 * TGSI expected interface, and take component select
1471 * and swizzling into account.
1472 */
1473 static float
1474 get_gather_value(const struct sp_sampler_view *sp_sview,
1475 int chan_in, int comp_sel,
1476 const float *tx[4])
1477 {
1478 int chan;
1479 unsigned swizzle;
1480
1481 /*
1482 * softpipe samples in a different order
1483 * to TGSI expects, so we need to swizzle,
1484 * the samples into the correct slots.
1485 */
1486 switch (chan_in) {
1487 case 0:
1488 chan = 2;
1489 break;
1490 case 1:
1491 chan = 3;
1492 break;
1493 case 2:
1494 chan = 1;
1495 break;
1496 case 3:
1497 chan = 0;
1498 break;
1499 default:
1500 assert(0);
1501 return 0.0;
1502 }
1503
1504 /* pick which component to use for the swizzle */
1505 switch (comp_sel) {
1506 case 0:
1507 swizzle = sp_sview->base.swizzle_r;
1508 break;
1509 case 1:
1510 swizzle = sp_sview->base.swizzle_g;
1511 break;
1512 case 2:
1513 swizzle = sp_sview->base.swizzle_b;
1514 break;
1515 case 3:
1516 swizzle = sp_sview->base.swizzle_a;
1517 break;
1518 default:
1519 assert(0);
1520 return 0.0;
1521 }
1522
1523 /* get correct result using the channel and swizzle */
1524 switch (swizzle) {
1525 case PIPE_SWIZZLE_ZERO:
1526 return 0.0;
1527 case PIPE_SWIZZLE_ONE:
1528 return 1.0;
1529 default:
1530 return tx[chan][swizzle];
1531 }
1532 }
1533
1534
1535 static void
1536 img_filter_2d_linear(struct sp_sampler_view *sp_sview,
1537 struct sp_sampler *sp_samp,
1538 const struct img_filter_args *args,
1539 float *rgba)
1540 {
1541 const struct pipe_resource *texture = sp_sview->base.texture;
1542 int width, height;
1543 int x0, y0, x1, y1;
1544 float xw, yw; /* weights */
1545 union tex_tile_address addr;
1546 const float *tx[4];
1547 int c;
1548
1549 width = u_minify(texture->width0, args->level);
1550 height = u_minify(texture->height0, args->level);
1551
1552 assert(width > 0);
1553 assert(height > 0);
1554
1555 addr.value = 0;
1556 addr.bits.level = args->level;
1557
1558 sp_samp->linear_texcoord_s(args->s, width, args->offset[0], &x0, &x1, &xw);
1559 sp_samp->linear_texcoord_t(args->t, height, args->offset[1], &y0, &y1, &yw);
1560
1561 tx[0] = get_texel_2d(sp_sview, sp_samp, addr, x0, y0);
1562 tx[1] = get_texel_2d(sp_sview, sp_samp, addr, x1, y0);
1563 tx[2] = get_texel_2d(sp_sview, sp_samp, addr, x0, y1);
1564 tx[3] = get_texel_2d(sp_sview, sp_samp, addr, x1, y1);
1565
1566 if (args->gather_only) {
1567 for (c = 0; c < TGSI_QUAD_SIZE; c++)
1568 rgba[TGSI_NUM_CHANNELS*c] = get_gather_value(sp_sview, c,
1569 args->gather_comp,
1570 tx);
1571 } else {
1572 /* interpolate R, G, B, A */
1573 for (c = 0; c < TGSI_QUAD_SIZE; c++)
1574 rgba[TGSI_NUM_CHANNELS*c] = lerp_2d(xw, yw,
1575 tx[0][c], tx[1][c],
1576 tx[2][c], tx[3][c]);
1577 }
1578 }
1579
1580
1581 static void
1582 img_filter_2d_array_linear(struct sp_sampler_view *sp_sview,
1583 struct sp_sampler *sp_samp,
1584 const struct img_filter_args *args,
1585 float *rgba)
1586 {
1587 const struct pipe_resource *texture = sp_sview->base.texture;
1588 int width, height;
1589 int x0, y0, x1, y1, layer;
1590 float xw, yw; /* weights */
1591 union tex_tile_address addr;
1592 const float *tx[4];
1593 int c;
1594
1595 width = u_minify(texture->width0, args->level);
1596 height = u_minify(texture->height0, args->level);
1597
1598 assert(width > 0);
1599 assert(height > 0);
1600
1601 addr.value = 0;
1602 addr.bits.level = args->level;
1603
1604 sp_samp->linear_texcoord_s(args->s, width, args->offset[0], &x0, &x1, &xw);
1605 sp_samp->linear_texcoord_t(args->t, height, args->offset[1], &y0, &y1, &yw);
1606 layer = coord_to_layer(args->p, sp_sview->base.u.tex.first_layer,
1607 sp_sview->base.u.tex.last_layer);
1608
1609 tx[0] = get_texel_2d_array(sp_sview, sp_samp, addr, x0, y0, layer);
1610 tx[1] = get_texel_2d_array(sp_sview, sp_samp, addr, x1, y0, layer);
1611 tx[2] = get_texel_2d_array(sp_sview, sp_samp, addr, x0, y1, layer);
1612 tx[3] = get_texel_2d_array(sp_sview, sp_samp, addr, x1, y1, layer);
1613
1614 if (args->gather_only) {
1615 for (c = 0; c < TGSI_QUAD_SIZE; c++)
1616 rgba[TGSI_NUM_CHANNELS*c] = get_gather_value(sp_sview, c,
1617 args->gather_comp,
1618 tx);
1619 } else {
1620 /* interpolate R, G, B, A */
1621 for (c = 0; c < TGSI_QUAD_SIZE; c++)
1622 rgba[TGSI_NUM_CHANNELS*c] = lerp_2d(xw, yw,
1623 tx[0][c], tx[1][c],
1624 tx[2][c], tx[3][c]);
1625 }
1626 }
1627
1628
1629 static void
1630 img_filter_cube_linear(struct sp_sampler_view *sp_sview,
1631 struct sp_sampler *sp_samp,
1632 const struct img_filter_args *args,
1633 float *rgba)
1634 {
1635 const struct pipe_resource *texture = sp_sview->base.texture;
1636 int width, height;
1637 int x0, y0, x1, y1, layer;
1638 float xw, yw; /* weights */
1639 union tex_tile_address addr;
1640 const float *tx[4];
1641 float corner0[TGSI_QUAD_SIZE], corner1[TGSI_QUAD_SIZE],
1642 corner2[TGSI_QUAD_SIZE], corner3[TGSI_QUAD_SIZE];
1643 int c;
1644
1645 width = u_minify(texture->width0, args->level);
1646 height = u_minify(texture->height0, args->level);
1647
1648 assert(width > 0);
1649 assert(height > 0);
1650
1651 addr.value = 0;
1652 addr.bits.level = args->level;
1653
1654 /*
1655 * For seamless if LINEAR filtering is done within a miplevel,
1656 * always apply wrap mode CLAMP_TO_BORDER.
1657 */
1658 if (sp_samp->base.seamless_cube_map) {
1659 /* Note this is a bit overkill, actual clamping is not required */
1660 wrap_linear_clamp_to_border(args->s, width, args->offset[0], &x0, &x1, &xw);
1661 wrap_linear_clamp_to_border(args->t, height, args->offset[1], &y0, &y1, &yw);
1662 } else {
1663 /* Would probably make sense to ignore mode and just do edge clamp */
1664 sp_samp->linear_texcoord_s(args->s, width, args->offset[0], &x0, &x1, &xw);
1665 sp_samp->linear_texcoord_t(args->t, height, args->offset[1], &y0, &y1, &yw);
1666 }
1667
1668 layer = sp_sview->base.u.tex.first_layer;
1669
1670 if (sp_samp->base.seamless_cube_map) {
1671 tx[0] = get_texel_cube_seamless(sp_sview, addr, x0, y0, corner0, layer, args->face_id);
1672 tx[1] = get_texel_cube_seamless(sp_sview, addr, x1, y0, corner1, layer, args->face_id);
1673 tx[2] = get_texel_cube_seamless(sp_sview, addr, x0, y1, corner2, layer, args->face_id);
1674 tx[3] = get_texel_cube_seamless(sp_sview, addr, x1, y1, corner3, layer, args->face_id);
1675 } else {
1676 tx[0] = get_texel_cube_array(sp_sview, sp_samp, addr, x0, y0, layer + args->face_id);
1677 tx[1] = get_texel_cube_array(sp_sview, sp_samp, addr, x1, y0, layer + args->face_id);
1678 tx[2] = get_texel_cube_array(sp_sview, sp_samp, addr, x0, y1, layer + args->face_id);
1679 tx[3] = get_texel_cube_array(sp_sview, sp_samp, addr, x1, y1, layer + args->face_id);
1680 }
1681
1682 if (args->gather_only) {
1683 for (c = 0; c < TGSI_QUAD_SIZE; c++)
1684 rgba[TGSI_NUM_CHANNELS*c] = get_gather_value(sp_sview, c,
1685 args->gather_comp,
1686 tx);
1687 } else {
1688 /* interpolate R, G, B, A */
1689 for (c = 0; c < TGSI_QUAD_SIZE; c++)
1690 rgba[TGSI_NUM_CHANNELS*c] = lerp_2d(xw, yw,
1691 tx[0][c], tx[1][c],
1692 tx[2][c], tx[3][c]);
1693 }
1694 }
1695
1696
1697 static void
1698 img_filter_cube_array_linear(struct sp_sampler_view *sp_sview,
1699 struct sp_sampler *sp_samp,
1700 const struct img_filter_args *args,
1701 float *rgba)
1702 {
1703 const struct pipe_resource *texture = sp_sview->base.texture;
1704 int width, height;
1705 int x0, y0, x1, y1, layer;
1706 float xw, yw; /* weights */
1707 union tex_tile_address addr;
1708 const float *tx[4];
1709 float corner0[TGSI_QUAD_SIZE], corner1[TGSI_QUAD_SIZE],
1710 corner2[TGSI_QUAD_SIZE], corner3[TGSI_QUAD_SIZE];
1711 int c;
1712
1713 width = u_minify(texture->width0, args->level);
1714 height = u_minify(texture->height0, args->level);
1715
1716 assert(width > 0);
1717 assert(height > 0);
1718
1719 addr.value = 0;
1720 addr.bits.level = args->level;
1721
1722 /*
1723 * For seamless if LINEAR filtering is done within a miplevel,
1724 * always apply wrap mode CLAMP_TO_BORDER.
1725 */
1726 if (sp_samp->base.seamless_cube_map) {
1727 /* Note this is a bit overkill, actual clamping is not required */
1728 wrap_linear_clamp_to_border(args->s, width, args->offset[0], &x0, &x1, &xw);
1729 wrap_linear_clamp_to_border(args->t, height, args->offset[1], &y0, &y1, &yw);
1730 } else {
1731 /* Would probably make sense to ignore mode and just do edge clamp */
1732 sp_samp->linear_texcoord_s(args->s, width, args->offset[0], &x0, &x1, &xw);
1733 sp_samp->linear_texcoord_t(args->t, height, args->offset[1], &y0, &y1, &yw);
1734 }
1735
1736 layer = coord_to_layer(6 * args->p + sp_sview->base.u.tex.first_layer,
1737 sp_sview->base.u.tex.first_layer,
1738 sp_sview->base.u.tex.last_layer - 5);
1739
1740 if (sp_samp->base.seamless_cube_map) {
1741 tx[0] = get_texel_cube_seamless(sp_sview, addr, x0, y0, corner0, layer, args->face_id);
1742 tx[1] = get_texel_cube_seamless(sp_sview, addr, x1, y0, corner1, layer, args->face_id);
1743 tx[2] = get_texel_cube_seamless(sp_sview, addr, x0, y1, corner2, layer, args->face_id);
1744 tx[3] = get_texel_cube_seamless(sp_sview, addr, x1, y1, corner3, layer, args->face_id);
1745 } else {
1746 tx[0] = get_texel_cube_array(sp_sview, sp_samp, addr, x0, y0, layer + args->face_id);
1747 tx[1] = get_texel_cube_array(sp_sview, sp_samp, addr, x1, y0, layer + args->face_id);
1748 tx[2] = get_texel_cube_array(sp_sview, sp_samp, addr, x0, y1, layer + args->face_id);
1749 tx[3] = get_texel_cube_array(sp_sview, sp_samp, addr, x1, y1, layer + args->face_id);
1750 }
1751
1752 if (args->gather_only) {
1753 for (c = 0; c < TGSI_QUAD_SIZE; c++)
1754 rgba[TGSI_NUM_CHANNELS*c] = get_gather_value(sp_sview, c,
1755 args->gather_comp,
1756 tx);
1757 } else {
1758 /* interpolate R, G, B, A */
1759 for (c = 0; c < TGSI_QUAD_SIZE; c++)
1760 rgba[TGSI_NUM_CHANNELS*c] = lerp_2d(xw, yw,
1761 tx[0][c], tx[1][c],
1762 tx[2][c], tx[3][c]);
1763 }
1764 }
1765
1766 static void
1767 img_filter_3d_linear(struct sp_sampler_view *sp_sview,
1768 struct sp_sampler *sp_samp,
1769 const struct img_filter_args *args,
1770 float *rgba)
1771 {
1772 const struct pipe_resource *texture = sp_sview->base.texture;
1773 int width, height, depth;
1774 int x0, x1, y0, y1, z0, z1;
1775 float xw, yw, zw; /* interpolation weights */
1776 union tex_tile_address addr;
1777 const float *tx00, *tx01, *tx02, *tx03, *tx10, *tx11, *tx12, *tx13;
1778 int c;
1779
1780 width = u_minify(texture->width0, args->level);
1781 height = u_minify(texture->height0, args->level);
1782 depth = u_minify(texture->depth0, args->level);
1783
1784 addr.value = 0;
1785 addr.bits.level = args->level;
1786
1787 assert(width > 0);
1788 assert(height > 0);
1789 assert(depth > 0);
1790
1791 sp_samp->linear_texcoord_s(args->s, width, args->offset[0], &x0, &x1, &xw);
1792 sp_samp->linear_texcoord_t(args->t, height, args->offset[1], &y0, &y1, &yw);
1793 sp_samp->linear_texcoord_p(args->p, depth, args->offset[2], &z0, &z1, &zw);
1794
1795 tx00 = get_texel_3d(sp_sview, sp_samp, addr, x0, y0, z0);
1796 tx01 = get_texel_3d(sp_sview, sp_samp, addr, x1, y0, z0);
1797 tx02 = get_texel_3d(sp_sview, sp_samp, addr, x0, y1, z0);
1798 tx03 = get_texel_3d(sp_sview, sp_samp, addr, x1, y1, z0);
1799
1800 tx10 = get_texel_3d(sp_sview, sp_samp, addr, x0, y0, z1);
1801 tx11 = get_texel_3d(sp_sview, sp_samp, addr, x1, y0, z1);
1802 tx12 = get_texel_3d(sp_sview, sp_samp, addr, x0, y1, z1);
1803 tx13 = get_texel_3d(sp_sview, sp_samp, addr, x1, y1, z1);
1804
1805 /* interpolate R, G, B, A */
1806 for (c = 0; c < TGSI_QUAD_SIZE; c++)
1807 rgba[TGSI_NUM_CHANNELS*c] = lerp_3d(xw, yw, zw,
1808 tx00[c], tx01[c],
1809 tx02[c], tx03[c],
1810 tx10[c], tx11[c],
1811 tx12[c], tx13[c]);
1812 }
1813
1814
1815 /* Calculate level of detail for every fragment,
1816 * with lambda already computed.
1817 * Note that lambda has already been biased by global LOD bias.
1818 * \param biased_lambda per-quad lambda.
1819 * \param lod_in per-fragment lod_bias or explicit_lod.
1820 * \param lod returns the per-fragment lod.
1821 */
1822 static inline void
1823 compute_lod(const struct pipe_sampler_state *sampler,
1824 enum tgsi_sampler_control control,
1825 const float biased_lambda,
1826 const float lod_in[TGSI_QUAD_SIZE],
1827 float lod[TGSI_QUAD_SIZE])
1828 {
1829 float min_lod = sampler->min_lod;
1830 float max_lod = sampler->max_lod;
1831 uint i;
1832
1833 switch (control) {
1834 case tgsi_sampler_lod_none:
1835 case tgsi_sampler_lod_zero:
1836 /* XXX FIXME */
1837 case tgsi_sampler_derivs_explicit:
1838 lod[0] = lod[1] = lod[2] = lod[3] = CLAMP(biased_lambda, min_lod, max_lod);
1839 break;
1840 case tgsi_sampler_lod_bias:
1841 for (i = 0; i < TGSI_QUAD_SIZE; i++) {
1842 lod[i] = biased_lambda + lod_in[i];
1843 lod[i] = CLAMP(lod[i], min_lod, max_lod);
1844 }
1845 break;
1846 case tgsi_sampler_lod_explicit:
1847 for (i = 0; i < TGSI_QUAD_SIZE; i++) {
1848 lod[i] = CLAMP(lod_in[i], min_lod, max_lod);
1849 }
1850 break;
1851 default:
1852 assert(0);
1853 lod[0] = lod[1] = lod[2] = lod[3] = 0.0f;
1854 }
1855 }
1856
1857
1858 /* Calculate level of detail for every fragment. The computed value is not
1859 * clamped to lod_min and lod_max.
1860 * \param lod_in per-fragment lod_bias or explicit_lod.
1861 * \param lod results per-fragment lod.
1862 */
1863 static inline void
1864 compute_lambda_lod_unclamped(struct sp_sampler_view *sp_sview,
1865 struct sp_sampler *sp_samp,
1866 const float s[TGSI_QUAD_SIZE],
1867 const float t[TGSI_QUAD_SIZE],
1868 const float p[TGSI_QUAD_SIZE],
1869 const float lod_in[TGSI_QUAD_SIZE],
1870 enum tgsi_sampler_control control,
1871 float lod[TGSI_QUAD_SIZE])
1872 {
1873 const struct pipe_sampler_state *sampler = &sp_samp->base;
1874 const float lod_bias = sampler->lod_bias;
1875 float lambda;
1876 uint i;
1877
1878 switch (control) {
1879 case tgsi_sampler_lod_none:
1880 /* XXX FIXME */
1881 case tgsi_sampler_derivs_explicit:
1882 lambda = sp_sview->compute_lambda(sp_sview, s, t, p) + lod_bias;
1883 lod[0] = lod[1] = lod[2] = lod[3] = lambda;
1884 break;
1885 case tgsi_sampler_lod_bias:
1886 lambda = sp_sview->compute_lambda(sp_sview, s, t, p) + lod_bias;
1887 for (i = 0; i < TGSI_QUAD_SIZE; i++) {
1888 lod[i] = lambda + lod_in[i];
1889 }
1890 break;
1891 case tgsi_sampler_lod_explicit:
1892 for (i = 0; i < TGSI_QUAD_SIZE; i++) {
1893 lod[i] = lod_in[i] + lod_bias;
1894 }
1895 break;
1896 case tgsi_sampler_lod_zero:
1897 case tgsi_sampler_gather:
1898 lod[0] = lod[1] = lod[2] = lod[3] = lod_bias;
1899 break;
1900 default:
1901 assert(0);
1902 lod[0] = lod[1] = lod[2] = lod[3] = 0.0f;
1903 }
1904 }
1905
1906 /* Calculate level of detail for every fragment.
1907 * \param lod_in per-fragment lod_bias or explicit_lod.
1908 * \param lod results per-fragment lod.
1909 */
1910 static inline void
1911 compute_lambda_lod(struct sp_sampler_view *sp_sview,
1912 struct sp_sampler *sp_samp,
1913 const float s[TGSI_QUAD_SIZE],
1914 const float t[TGSI_QUAD_SIZE],
1915 const float p[TGSI_QUAD_SIZE],
1916 const float lod_in[TGSI_QUAD_SIZE],
1917 enum tgsi_sampler_control control,
1918 float lod[TGSI_QUAD_SIZE])
1919 {
1920 const struct pipe_sampler_state *sampler = &sp_samp->base;
1921 const float min_lod = sampler->min_lod;
1922 const float max_lod = sampler->max_lod;
1923 int i;
1924
1925 compute_lambda_lod_unclamped(sp_sview, sp_samp,
1926 s, t, p, lod_in, control, lod);
1927 for (i = 0; i < TGSI_QUAD_SIZE; i++) {
1928 lod[i] = CLAMP(lod[i], min_lod, max_lod);
1929 }
1930 }
1931
1932 static inline unsigned
1933 get_gather_component(const float lod_in[TGSI_QUAD_SIZE])
1934 {
1935 /* gather component is stored in lod_in slot as unsigned */
1936 return (*(unsigned int *)lod_in) & 0x3;
1937 }
1938
1939 /**
1940 * Clamps given lod to both lod limits and mip level limits. Clamping to the
1941 * latter limits is done so that lod is relative to the first (base) level.
1942 */
1943 static void
1944 clamp_lod(const struct sp_sampler_view *sp_sview,
1945 const struct sp_sampler *sp_samp,
1946 const float lod[TGSI_QUAD_SIZE],
1947 float clamped[TGSI_QUAD_SIZE])
1948 {
1949 const float min_lod = sp_samp->base.min_lod;
1950 const float max_lod = sp_samp->base.max_lod;
1951 const float min_level = sp_sview->base.u.tex.first_level;
1952 const float max_level = sp_sview->base.u.tex.last_level;
1953 int i;
1954
1955 for (i = 0; i < TGSI_QUAD_SIZE; i++) {
1956 float cl = lod[i];
1957
1958 cl = CLAMP(cl, min_lod, max_lod);
1959 cl = CLAMP(cl, 0, max_level - min_level);
1960 clamped[i] = cl;
1961 }
1962 }
1963
1964 /**
1965 * Get mip level relative to base level for linear mip filter
1966 */
1967 static void
1968 mip_rel_level_linear(struct sp_sampler_view *sp_sview,
1969 struct sp_sampler *sp_samp,
1970 const float lod[TGSI_QUAD_SIZE],
1971 float level[TGSI_QUAD_SIZE])
1972 {
1973 clamp_lod(sp_sview, sp_samp, lod, level);
1974 }
1975
1976 static void
1977 mip_filter_linear(struct sp_sampler_view *sp_sview,
1978 struct sp_sampler *sp_samp,
1979 img_filter_func min_filter,
1980 img_filter_func mag_filter,
1981 const float s[TGSI_QUAD_SIZE],
1982 const float t[TGSI_QUAD_SIZE],
1983 const float p[TGSI_QUAD_SIZE],
1984 const float c0[TGSI_QUAD_SIZE],
1985 const float lod_in[TGSI_QUAD_SIZE],
1986 const struct filter_args *filt_args,
1987 float rgba[TGSI_NUM_CHANNELS][TGSI_QUAD_SIZE])
1988 {
1989 const struct pipe_sampler_view *psview = &sp_sview->base;
1990 int j;
1991 float lod[TGSI_QUAD_SIZE];
1992 struct img_filter_args args;
1993
1994 compute_lambda_lod(sp_sview, sp_samp, s, t, p, lod_in, filt_args->control, lod);
1995
1996 args.offset = filt_args->offset;
1997 args.gather_only = filt_args->control == tgsi_sampler_gather;
1998 args.gather_comp = get_gather_component(lod_in);
1999
2000 for (j = 0; j < TGSI_QUAD_SIZE; j++) {
2001 int level0 = psview->u.tex.first_level + (int)lod[j];
2002
2003 args.s = s[j];
2004 args.t = t[j];
2005 args.p = p[j];
2006 args.face_id = sp_sview->faces[j];
2007
2008 if (lod[j] < 0.0) {
2009 args.level = psview->u.tex.first_level;
2010 mag_filter(sp_sview, sp_samp, &args, &rgba[0][j]);
2011 }
2012 else if (level0 >= (int) psview->u.tex.last_level) {
2013 args.level = psview->u.tex.last_level;
2014 min_filter(sp_sview, sp_samp, &args, &rgba[0][j]);
2015 }
2016 else {
2017 float levelBlend = frac(lod[j]);
2018 float rgbax[TGSI_NUM_CHANNELS][TGSI_QUAD_SIZE];
2019 int c;
2020
2021 args.level = level0;
2022 min_filter(sp_sview, sp_samp, &args, &rgbax[0][0]);
2023 args.level = level0+1;
2024 min_filter(sp_sview, sp_samp, &args, &rgbax[0][1]);
2025
2026 for (c = 0; c < 4; c++) {
2027 rgba[c][j] = lerp(levelBlend, rgbax[c][0], rgbax[c][1]);
2028 }
2029 }
2030 }
2031
2032 if (DEBUG_TEX) {
2033 print_sample_4(__FUNCTION__, rgba);
2034 }
2035 }
2036
2037
2038 /**
2039 * Get mip level relative to base level for nearest mip filter
2040 */
2041 static void
2042 mip_rel_level_nearest(struct sp_sampler_view *sp_sview,
2043 struct sp_sampler *sp_samp,
2044 const float lod[TGSI_QUAD_SIZE],
2045 float level[TGSI_QUAD_SIZE])
2046 {
2047 int j;
2048
2049 clamp_lod(sp_sview, sp_samp, lod, level);
2050 for (j = 0; j < TGSI_QUAD_SIZE; j++)
2051 /* TODO: It should rather be:
2052 * level[j] = ceil(level[j] + 0.5F) - 1.0F;
2053 */
2054 level[j] = (int)(level[j] + 0.5F);
2055 }
2056
2057 /**
2058 * Compute nearest mipmap level from texcoords.
2059 * Then sample the texture level for four elements of a quad.
2060 * \param c0 the LOD bias factors, or absolute LODs (depending on control)
2061 */
2062 static void
2063 mip_filter_nearest(struct sp_sampler_view *sp_sview,
2064 struct sp_sampler *sp_samp,
2065 img_filter_func min_filter,
2066 img_filter_func mag_filter,
2067 const float s[TGSI_QUAD_SIZE],
2068 const float t[TGSI_QUAD_SIZE],
2069 const float p[TGSI_QUAD_SIZE],
2070 const float c0[TGSI_QUAD_SIZE],
2071 const float lod_in[TGSI_QUAD_SIZE],
2072 const struct filter_args *filt_args,
2073 float rgba[TGSI_NUM_CHANNELS][TGSI_QUAD_SIZE])
2074 {
2075 const struct pipe_sampler_view *psview = &sp_sview->base;
2076 float lod[TGSI_QUAD_SIZE];
2077 int j;
2078 struct img_filter_args args;
2079
2080 args.offset = filt_args->offset;
2081 args.gather_only = filt_args->control == tgsi_sampler_gather;
2082 args.gather_comp = get_gather_component(lod_in);
2083
2084 compute_lambda_lod(sp_sview, sp_samp, s, t, p, lod_in, filt_args->control, lod);
2085
2086 for (j = 0; j < TGSI_QUAD_SIZE; j++) {
2087 args.s = s[j];
2088 args.t = t[j];
2089 args.p = p[j];
2090 args.face_id = sp_sview->faces[j];
2091
2092 if (lod[j] < 0.0) {
2093 args.level = psview->u.tex.first_level;
2094 mag_filter(sp_sview, sp_samp, &args, &rgba[0][j]);
2095 } else {
2096 int level = psview->u.tex.first_level + (int)(lod[j] + 0.5F);
2097 args.level = MIN2(level, (int)psview->u.tex.last_level);
2098 min_filter(sp_sview, sp_samp, &args, &rgba[0][j]);
2099 }
2100 }
2101
2102 if (DEBUG_TEX) {
2103 print_sample_4(__FUNCTION__, rgba);
2104 }
2105 }
2106
2107
2108 /**
2109 * Get mip level relative to base level for none mip filter
2110 */
2111 static void
2112 mip_rel_level_none(struct sp_sampler_view *sp_sview,
2113 struct sp_sampler *sp_samp,
2114 const float lod[TGSI_QUAD_SIZE],
2115 float level[TGSI_QUAD_SIZE])
2116 {
2117 int j;
2118
2119 for (j = 0; j < TGSI_QUAD_SIZE; j++) {
2120 level[j] = 0;
2121 }
2122 }
2123
2124 static void
2125 mip_filter_none(struct sp_sampler_view *sp_sview,
2126 struct sp_sampler *sp_samp,
2127 img_filter_func min_filter,
2128 img_filter_func mag_filter,
2129 const float s[TGSI_QUAD_SIZE],
2130 const float t[TGSI_QUAD_SIZE],
2131 const float p[TGSI_QUAD_SIZE],
2132 const float c0[TGSI_QUAD_SIZE],
2133 const float lod_in[TGSI_QUAD_SIZE],
2134 const struct filter_args *filt_args,
2135 float rgba[TGSI_NUM_CHANNELS][TGSI_QUAD_SIZE])
2136 {
2137 float lod[TGSI_QUAD_SIZE];
2138 int j;
2139 struct img_filter_args args;
2140
2141 args.level = sp_sview->base.u.tex.first_level;
2142 args.offset = filt_args->offset;
2143 args.gather_only = filt_args->control == tgsi_sampler_gather;
2144
2145 compute_lambda_lod(sp_sview, sp_samp, s, t, p, lod_in, filt_args->control, lod);
2146
2147 for (j = 0; j < TGSI_QUAD_SIZE; j++) {
2148 args.s = s[j];
2149 args.t = t[j];
2150 args.p = p[j];
2151 args.face_id = sp_sview->faces[j];
2152 if (lod[j] < 0.0) {
2153 mag_filter(sp_sview, sp_samp, &args, &rgba[0][j]);
2154 }
2155 else {
2156 min_filter(sp_sview, sp_samp, &args, &rgba[0][j]);
2157 }
2158 }
2159 }
2160
2161
2162 /**
2163 * Get mip level relative to base level for none mip filter
2164 */
2165 static void
2166 mip_rel_level_none_no_filter_select(struct sp_sampler_view *sp_sview,
2167 struct sp_sampler *sp_samp,
2168 const float lod[TGSI_QUAD_SIZE],
2169 float level[TGSI_QUAD_SIZE])
2170 {
2171 mip_rel_level_none(sp_sview, sp_samp, lod, level);
2172 }
2173
2174 static void
2175 mip_filter_none_no_filter_select(struct sp_sampler_view *sp_sview,
2176 struct sp_sampler *sp_samp,
2177 img_filter_func min_filter,
2178 img_filter_func mag_filter,
2179 const float s[TGSI_QUAD_SIZE],
2180 const float t[TGSI_QUAD_SIZE],
2181 const float p[TGSI_QUAD_SIZE],
2182 const float c0[TGSI_QUAD_SIZE],
2183 const float lod_in[TGSI_QUAD_SIZE],
2184 const struct filter_args *filt_args,
2185 float rgba[TGSI_NUM_CHANNELS][TGSI_QUAD_SIZE])
2186 {
2187 int j;
2188 struct img_filter_args args;
2189 args.level = sp_sview->base.u.tex.first_level;
2190 args.offset = filt_args->offset;
2191 args.gather_only = filt_args->control == tgsi_sampler_gather;
2192 for (j = 0; j < TGSI_QUAD_SIZE; j++) {
2193 args.s = s[j];
2194 args.t = t[j];
2195 args.p = p[j];
2196 args.face_id = sp_sview->faces[j];
2197 mag_filter(sp_sview, sp_samp, &args, &rgba[0][j]);
2198 }
2199 }
2200
2201
2202 /* For anisotropic filtering */
2203 #define WEIGHT_LUT_SIZE 1024
2204
2205 static float *weightLut = NULL;
2206
2207 /**
2208 * Creates the look-up table used to speed-up EWA sampling
2209 */
2210 static void
2211 create_filter_table(void)
2212 {
2213 unsigned i;
2214 if (!weightLut) {
2215 weightLut = (float *) MALLOC(WEIGHT_LUT_SIZE * sizeof(float));
2216
2217 for (i = 0; i < WEIGHT_LUT_SIZE; ++i) {
2218 float alpha = 2;
2219 float r2 = (float) i / (float) (WEIGHT_LUT_SIZE - 1);
2220 float weight = (float) exp(-alpha * r2);
2221 weightLut[i] = weight;
2222 }
2223 }
2224 }
2225
2226
2227 /**
2228 * Elliptical weighted average (EWA) filter for producing high quality
2229 * anisotropic filtered results.
2230 * Based on the Higher Quality Elliptical Weighted Average Filter
2231 * published by Paul S. Heckbert in his Master's Thesis
2232 * "Fundamentals of Texture Mapping and Image Warping" (1989)
2233 */
2234 static void
2235 img_filter_2d_ewa(struct sp_sampler_view *sp_sview,
2236 struct sp_sampler *sp_samp,
2237 img_filter_func min_filter,
2238 img_filter_func mag_filter,
2239 const float s[TGSI_QUAD_SIZE],
2240 const float t[TGSI_QUAD_SIZE],
2241 const float p[TGSI_QUAD_SIZE],
2242 unsigned level,
2243 const float dudx, const float dvdx,
2244 const float dudy, const float dvdy,
2245 float rgba[TGSI_NUM_CHANNELS][TGSI_QUAD_SIZE])
2246 {
2247 const struct pipe_resource *texture = sp_sview->base.texture;
2248
2249 // ??? Won't the image filters blow up if level is negative?
2250 unsigned level0 = level > 0 ? level : 0;
2251 float scaling = 1.0f / (1 << level0);
2252 int width = u_minify(texture->width0, level0);
2253 int height = u_minify(texture->height0, level0);
2254 struct img_filter_args args;
2255 float ux = dudx * scaling;
2256 float vx = dvdx * scaling;
2257 float uy = dudy * scaling;
2258 float vy = dvdy * scaling;
2259
2260 /* compute ellipse coefficients to bound the region:
2261 * A*x*x + B*x*y + C*y*y = F.
2262 */
2263 float A = vx*vx+vy*vy+1;
2264 float B = -2*(ux*vx+uy*vy);
2265 float C = ux*ux+uy*uy+1;
2266 float F = A*C-B*B/4.0f;
2267
2268 /* check if it is an ellipse */
2269 /* assert(F > 0.0); */
2270
2271 /* Compute the ellipse's (u,v) bounding box in texture space */
2272 float d = -B*B+4.0f*C*A;
2273 float box_u = 2.0f / d * sqrtf(d*C*F); /* box_u -> half of bbox with */
2274 float box_v = 2.0f / d * sqrtf(A*d*F); /* box_v -> half of bbox height */
2275
2276 float rgba_temp[TGSI_NUM_CHANNELS][TGSI_QUAD_SIZE];
2277 float s_buffer[TGSI_QUAD_SIZE];
2278 float t_buffer[TGSI_QUAD_SIZE];
2279 float weight_buffer[TGSI_QUAD_SIZE];
2280 unsigned buffer_next;
2281 int j;
2282 float den; /* = 0.0F; */
2283 float ddq;
2284 float U; /* = u0 - tex_u; */
2285 int v;
2286
2287 /* Scale ellipse formula to directly index the Filter Lookup Table.
2288 * i.e. scale so that F = WEIGHT_LUT_SIZE-1
2289 */
2290 double formScale = (double) (WEIGHT_LUT_SIZE - 1) / F;
2291 A *= formScale;
2292 B *= formScale;
2293 C *= formScale;
2294 /* F *= formScale; */ /* no need to scale F as we don't use it below here */
2295
2296 /* For each quad, the du and dx values are the same and so the ellipse is
2297 * also the same. Note that texel/image access can only be performed using
2298 * a quad, i.e. it is not possible to get the pixel value for a single
2299 * tex coord. In order to have a better performance, the access is buffered
2300 * using the s_buffer/t_buffer and weight_buffer. Only when the buffer is
2301 * full, then the pixel values are read from the image.
2302 */
2303 ddq = 2 * A;
2304
2305 args.level = level;
2306 for (j = 0; j < TGSI_QUAD_SIZE; j++) {
2307 /* Heckbert MS thesis, p. 59; scan over the bounding box of the ellipse
2308 * and incrementally update the value of Ax^2+Bxy*Cy^2; when this
2309 * value, q, is less than F, we're inside the ellipse
2310 */
2311 float tex_u = -0.5F + s[j] * texture->width0 * scaling;
2312 float tex_v = -0.5F + t[j] * texture->height0 * scaling;
2313
2314 int u0 = (int) floorf(tex_u - box_u);
2315 int u1 = (int) ceilf(tex_u + box_u);
2316 int v0 = (int) floorf(tex_v - box_v);
2317 int v1 = (int) ceilf(tex_v + box_v);
2318
2319 float num[4] = {0.0F, 0.0F, 0.0F, 0.0F};
2320 buffer_next = 0;
2321 den = 0;
2322 args.face_id = sp_sview->faces[j];
2323
2324 U = u0 - tex_u;
2325 for (v = v0; v <= v1; ++v) {
2326 float V = v - tex_v;
2327 float dq = A * (2 * U + 1) + B * V;
2328 float q = (C * V + B * U) * V + A * U * U;
2329
2330 int u;
2331 for (u = u0; u <= u1; ++u) {
2332 /* Note that the ellipse has been pre-scaled so F =
2333 * WEIGHT_LUT_SIZE - 1
2334 */
2335 if (q < WEIGHT_LUT_SIZE) {
2336 /* as a LUT is used, q must never be negative;
2337 * should not happen, though
2338 */
2339 const int qClamped = q >= 0.0F ? q : 0;
2340 float weight = weightLut[qClamped];
2341
2342 weight_buffer[buffer_next] = weight;
2343 s_buffer[buffer_next] = u / ((float) width);
2344 t_buffer[buffer_next] = v / ((float) height);
2345
2346 buffer_next++;
2347 if (buffer_next == TGSI_QUAD_SIZE) {
2348 /* 4 texel coords are in the buffer -> read it now */
2349 unsigned jj;
2350 /* it is assumed that samp->min_img_filter is set to
2351 * img_filter_2d_nearest or one of the
2352 * accelerated img_filter_2d_nearest_XXX functions.
2353 */
2354 for (jj = 0; jj < buffer_next; jj++) {
2355 args.s = s_buffer[jj];
2356 args.t = t_buffer[jj];
2357 args.p = p[jj];
2358 min_filter(sp_sview, sp_samp, &args, &rgba_temp[0][jj]);
2359 num[0] += weight_buffer[jj] * rgba_temp[0][jj];
2360 num[1] += weight_buffer[jj] * rgba_temp[1][jj];
2361 num[2] += weight_buffer[jj] * rgba_temp[2][jj];
2362 num[3] += weight_buffer[jj] * rgba_temp[3][jj];
2363 }
2364
2365 buffer_next = 0;
2366 }
2367
2368 den += weight;
2369 }
2370 q += dq;
2371 dq += ddq;
2372 }
2373 }
2374
2375 /* if the tex coord buffer contains unread values, we will read
2376 * them now.
2377 */
2378 if (buffer_next > 0) {
2379 unsigned jj;
2380 /* it is assumed that samp->min_img_filter is set to
2381 * img_filter_2d_nearest or one of the
2382 * accelerated img_filter_2d_nearest_XXX functions.
2383 */
2384 for (jj = 0; jj < buffer_next; jj++) {
2385 args.s = s_buffer[jj];
2386 args.t = t_buffer[jj];
2387 args.p = p[jj];
2388 min_filter(sp_sview, sp_samp, &args, &rgba_temp[0][jj]);
2389 num[0] += weight_buffer[jj] * rgba_temp[0][jj];
2390 num[1] += weight_buffer[jj] * rgba_temp[1][jj];
2391 num[2] += weight_buffer[jj] * rgba_temp[2][jj];
2392 num[3] += weight_buffer[jj] * rgba_temp[3][jj];
2393 }
2394 }
2395
2396 if (den <= 0.0F) {
2397 /* Reaching this place would mean that no pixels intersected
2398 * the ellipse. This should never happen because the filter
2399 * we use always intersects at least one pixel.
2400 */
2401
2402 /*rgba[0]=0;
2403 rgba[1]=0;
2404 rgba[2]=0;
2405 rgba[3]=0;*/
2406 /* not enough pixels in resampling, resort to direct interpolation */
2407 args.s = s[j];
2408 args.t = t[j];
2409 args.p = p[j];
2410 min_filter(sp_sview, sp_samp, &args, &rgba_temp[0][j]);
2411 den = 1;
2412 num[0] = rgba_temp[0][j];
2413 num[1] = rgba_temp[1][j];
2414 num[2] = rgba_temp[2][j];
2415 num[3] = rgba_temp[3][j];
2416 }
2417
2418 rgba[0][j] = num[0] / den;
2419 rgba[1][j] = num[1] / den;
2420 rgba[2][j] = num[2] / den;
2421 rgba[3][j] = num[3] / den;
2422 }
2423 }
2424
2425
2426 /**
2427 * Get mip level relative to base level for linear mip filter
2428 */
2429 static void
2430 mip_rel_level_linear_aniso(struct sp_sampler_view *sp_sview,
2431 struct sp_sampler *sp_samp,
2432 const float lod[TGSI_QUAD_SIZE],
2433 float level[TGSI_QUAD_SIZE])
2434 {
2435 mip_rel_level_linear(sp_sview, sp_samp, lod, level);
2436 }
2437
2438 /**
2439 * Sample 2D texture using an anisotropic filter.
2440 */
2441 static void
2442 mip_filter_linear_aniso(struct sp_sampler_view *sp_sview,
2443 struct sp_sampler *sp_samp,
2444 img_filter_func min_filter,
2445 img_filter_func mag_filter,
2446 const float s[TGSI_QUAD_SIZE],
2447 const float t[TGSI_QUAD_SIZE],
2448 const float p[TGSI_QUAD_SIZE],
2449 const float c0[TGSI_QUAD_SIZE],
2450 const float lod_in[TGSI_QUAD_SIZE],
2451 const struct filter_args *filt_args,
2452 float rgba[TGSI_NUM_CHANNELS][TGSI_QUAD_SIZE])
2453 {
2454 const struct pipe_resource *texture = sp_sview->base.texture;
2455 const struct pipe_sampler_view *psview = &sp_sview->base;
2456 int level0;
2457 float lambda;
2458 float lod[TGSI_QUAD_SIZE];
2459
2460 float s_to_u = u_minify(texture->width0, psview->u.tex.first_level);
2461 float t_to_v = u_minify(texture->height0, psview->u.tex.first_level);
2462 float dudx = (s[QUAD_BOTTOM_RIGHT] - s[QUAD_BOTTOM_LEFT]) * s_to_u;
2463 float dudy = (s[QUAD_TOP_LEFT] - s[QUAD_BOTTOM_LEFT]) * s_to_u;
2464 float dvdx = (t[QUAD_BOTTOM_RIGHT] - t[QUAD_BOTTOM_LEFT]) * t_to_v;
2465 float dvdy = (t[QUAD_TOP_LEFT] - t[QUAD_BOTTOM_LEFT]) * t_to_v;
2466 struct img_filter_args args;
2467
2468 if (filt_args->control == tgsi_sampler_lod_bias ||
2469 filt_args->control == tgsi_sampler_lod_none ||
2470 /* XXX FIXME */
2471 filt_args->control == tgsi_sampler_derivs_explicit) {
2472 /* note: instead of working with Px and Py, we will use the
2473 * squared length instead, to avoid sqrt.
2474 */
2475 float Px2 = dudx * dudx + dvdx * dvdx;
2476 float Py2 = dudy * dudy + dvdy * dvdy;
2477
2478 float Pmax2;
2479 float Pmin2;
2480 float e;
2481 const float maxEccentricity = sp_samp->base.max_anisotropy * sp_samp->base.max_anisotropy;
2482
2483 if (Px2 < Py2) {
2484 Pmax2 = Py2;
2485 Pmin2 = Px2;
2486 }
2487 else {
2488 Pmax2 = Px2;
2489 Pmin2 = Py2;
2490 }
2491
2492 /* if the eccentricity of the ellipse is too big, scale up the shorter
2493 * of the two vectors to limit the maximum amount of work per pixel
2494 */
2495 e = Pmax2 / Pmin2;
2496 if (e > maxEccentricity) {
2497 /* float s=e / maxEccentricity;
2498 minor[0] *= s;
2499 minor[1] *= s;
2500 Pmin2 *= s; */
2501 Pmin2 = Pmax2 / maxEccentricity;
2502 }
2503
2504 /* note: we need to have Pmin=sqrt(Pmin2) here, but we can avoid
2505 * this since 0.5*log(x) = log(sqrt(x))
2506 */
2507 lambda = 0.5F * util_fast_log2(Pmin2) + sp_samp->base.lod_bias;
2508 compute_lod(&sp_samp->base, filt_args->control, lambda, lod_in, lod);
2509 }
2510 else {
2511 assert(filt_args->control == tgsi_sampler_lod_explicit ||
2512 filt_args->control == tgsi_sampler_lod_zero);
2513 compute_lod(&sp_samp->base, filt_args->control, sp_samp->base.lod_bias, lod_in, lod);
2514 }
2515
2516 /* XXX: Take into account all lod values.
2517 */
2518 lambda = lod[0];
2519 level0 = psview->u.tex.first_level + (int)lambda;
2520
2521 /* If the ellipse covers the whole image, we can
2522 * simply return the average of the whole image.
2523 */
2524 if (level0 >= (int) psview->u.tex.last_level) {
2525 int j;
2526 for (j = 0; j < TGSI_QUAD_SIZE; j++) {
2527 args.s = s[j];
2528 args.t = t[j];
2529 args.p = p[j];
2530 args.level = psview->u.tex.last_level;
2531 args.face_id = sp_sview->faces[j];
2532 min_filter(sp_sview, sp_samp, &args, &rgba[0][j]);
2533 }
2534 }
2535 else {
2536 /* don't bother interpolating between multiple LODs; it doesn't
2537 * seem to be worth the extra running time.
2538 */
2539 img_filter_2d_ewa(sp_sview, sp_samp, min_filter, mag_filter,
2540 s, t, p, level0,
2541 dudx, dvdx, dudy, dvdy, rgba);
2542 }
2543
2544 if (DEBUG_TEX) {
2545 print_sample_4(__FUNCTION__, rgba);
2546 }
2547 }
2548
2549 /**
2550 * Get mip level relative to base level for linear mip filter
2551 */
2552 static void
2553 mip_rel_level_linear_2d_linear_repeat_POT(struct sp_sampler_view *sp_sview,
2554 struct sp_sampler *sp_samp,
2555 const float lod[TGSI_QUAD_SIZE],
2556 float level[TGSI_QUAD_SIZE])
2557 {
2558 mip_rel_level_linear(sp_sview, sp_samp, lod, level);
2559 }
2560
2561 /**
2562 * Specialized version of mip_filter_linear with hard-wired calls to
2563 * 2d lambda calculation and 2d_linear_repeat_POT img filters.
2564 */
2565 static void
2566 mip_filter_linear_2d_linear_repeat_POT(
2567 struct sp_sampler_view *sp_sview,
2568 struct sp_sampler *sp_samp,
2569 img_filter_func min_filter,
2570 img_filter_func mag_filter,
2571 const float s[TGSI_QUAD_SIZE],
2572 const float t[TGSI_QUAD_SIZE],
2573 const float p[TGSI_QUAD_SIZE],
2574 const float c0[TGSI_QUAD_SIZE],
2575 const float lod_in[TGSI_QUAD_SIZE],
2576 const struct filter_args *filt_args,
2577 float rgba[TGSI_NUM_CHANNELS][TGSI_QUAD_SIZE])
2578 {
2579 const struct pipe_sampler_view *psview = &sp_sview->base;
2580 int j;
2581 float lod[TGSI_QUAD_SIZE];
2582
2583 compute_lambda_lod(sp_sview, sp_samp, s, t, p, lod_in, filt_args->control, lod);
2584
2585 for (j = 0; j < TGSI_QUAD_SIZE; j++) {
2586 int level0 = psview->u.tex.first_level + (int)lod[j];
2587 struct img_filter_args args;
2588 /* Catches both negative and large values of level0:
2589 */
2590 args.s = s[j];
2591 args.t = t[j];
2592 args.p = p[j];
2593 args.face_id = sp_sview->faces[j];
2594 args.offset = filt_args->offset;
2595 args.gather_only = filt_args->control == tgsi_sampler_gather;
2596 if ((unsigned)level0 >= psview->u.tex.last_level) {
2597 if (level0 < 0)
2598 args.level = psview->u.tex.first_level;
2599 else
2600 args.level = psview->u.tex.last_level;
2601 img_filter_2d_linear_repeat_POT(sp_sview, sp_samp, &args,
2602 &rgba[0][j]);
2603
2604 }
2605 else {
2606 float levelBlend = frac(lod[j]);
2607 float rgbax[TGSI_NUM_CHANNELS][TGSI_QUAD_SIZE];
2608 int c;
2609
2610 args.level = level0;
2611 img_filter_2d_linear_repeat_POT(sp_sview, sp_samp, &args, &rgbax[0][0]);
2612 args.level = level0+1;
2613 img_filter_2d_linear_repeat_POT(sp_sview, sp_samp, &args, &rgbax[0][1]);
2614
2615 for (c = 0; c < TGSI_NUM_CHANNELS; c++)
2616 rgba[c][j] = lerp(levelBlend, rgbax[c][0], rgbax[c][1]);
2617 }
2618 }
2619
2620 if (DEBUG_TEX) {
2621 print_sample_4(__FUNCTION__, rgba);
2622 }
2623 }
2624
2625 static const struct sp_filter_funcs funcs_linear = {
2626 mip_rel_level_linear,
2627 mip_filter_linear
2628 };
2629
2630 static const struct sp_filter_funcs funcs_nearest = {
2631 mip_rel_level_nearest,
2632 mip_filter_nearest
2633 };
2634
2635 static const struct sp_filter_funcs funcs_none = {
2636 mip_rel_level_none,
2637 mip_filter_none
2638 };
2639
2640 static const struct sp_filter_funcs funcs_none_no_filter_select = {
2641 mip_rel_level_none_no_filter_select,
2642 mip_filter_none_no_filter_select
2643 };
2644
2645 static const struct sp_filter_funcs funcs_linear_aniso = {
2646 mip_rel_level_linear_aniso,
2647 mip_filter_linear_aniso
2648 };
2649
2650 static const struct sp_filter_funcs funcs_linear_2d_linear_repeat_POT = {
2651 mip_rel_level_linear_2d_linear_repeat_POT,
2652 mip_filter_linear_2d_linear_repeat_POT
2653 };
2654
2655 /**
2656 * Do shadow/depth comparisons.
2657 */
2658 static void
2659 sample_compare(struct sp_sampler_view *sp_sview,
2660 struct sp_sampler *sp_samp,
2661 const float s[TGSI_QUAD_SIZE],
2662 const float t[TGSI_QUAD_SIZE],
2663 const float p[TGSI_QUAD_SIZE],
2664 const float c0[TGSI_QUAD_SIZE],
2665 const float c1[TGSI_QUAD_SIZE],
2666 enum tgsi_sampler_control control,
2667 float rgba[TGSI_NUM_CHANNELS][TGSI_QUAD_SIZE])
2668 {
2669 const struct pipe_sampler_state *sampler = &sp_samp->base;
2670 int j, v;
2671 int k[TGSI_NUM_CHANNELS][TGSI_QUAD_SIZE];
2672 float pc[4];
2673 const struct util_format_description *format_desc;
2674 unsigned chan_type;
2675 bool is_gather = (control == tgsi_sampler_gather);
2676
2677 /**
2678 * Compare texcoord 'p' (aka R) against texture value 'rgba[0]'
2679 * for 2D Array texture we need to use the 'c0' (aka Q).
2680 * When we sampled the depth texture, the depth value was put into all
2681 * RGBA channels. We look at the red channel here.
2682 */
2683
2684 if (sp_sview->base.target == PIPE_TEXTURE_2D_ARRAY ||
2685 sp_sview->base.target == PIPE_TEXTURE_CUBE) {
2686 pc[0] = c0[0];
2687 pc[1] = c0[1];
2688 pc[2] = c0[2];
2689 pc[3] = c0[3];
2690 } else if (sp_sview->base.target == PIPE_TEXTURE_CUBE_ARRAY) {
2691 pc[0] = c1[0];
2692 pc[1] = c1[1];
2693 pc[2] = c1[2];
2694 pc[3] = c1[3];
2695 } else {
2696 pc[0] = p[0];
2697 pc[1] = p[1];
2698 pc[2] = p[2];
2699 pc[3] = p[3];
2700 }
2701
2702 format_desc = util_format_description(sp_sview->base.format);
2703 /* not entirely sure we couldn't end up with non-valid swizzle here */
2704 chan_type = format_desc->swizzle[0] <= UTIL_FORMAT_SWIZZLE_W ?
2705 format_desc->channel[format_desc->swizzle[0]].type :
2706 UTIL_FORMAT_TYPE_FLOAT;
2707 if (chan_type != UTIL_FORMAT_TYPE_FLOAT) {
2708 /*
2709 * clamping is a result of conversion to texture format, hence
2710 * doesn't happen with floats. Technically also should do comparison
2711 * in texture format (quantization!).
2712 */
2713 pc[0] = CLAMP(pc[0], 0.0F, 1.0F);
2714 pc[1] = CLAMP(pc[1], 0.0F, 1.0F);
2715 pc[2] = CLAMP(pc[2], 0.0F, 1.0F);
2716 pc[3] = CLAMP(pc[3], 0.0F, 1.0F);
2717 }
2718
2719 for (v = 0; v < (is_gather ? TGSI_NUM_CHANNELS : 1); v++) {
2720 /* compare four texcoords vs. four texture samples */
2721 switch (sampler->compare_func) {
2722 case PIPE_FUNC_LESS:
2723 k[v][0] = pc[0] < rgba[v][0];
2724 k[v][1] = pc[1] < rgba[v][1];
2725 k[v][2] = pc[2] < rgba[v][2];
2726 k[v][3] = pc[3] < rgba[v][3];
2727 break;
2728 case PIPE_FUNC_LEQUAL:
2729 k[v][0] = pc[0] <= rgba[v][0];
2730 k[v][1] = pc[1] <= rgba[v][1];
2731 k[v][2] = pc[2] <= rgba[v][2];
2732 k[v][3] = pc[3] <= rgba[v][3];
2733 break;
2734 case PIPE_FUNC_GREATER:
2735 k[v][0] = pc[0] > rgba[v][0];
2736 k[v][1] = pc[1] > rgba[v][1];
2737 k[v][2] = pc[2] > rgba[v][2];
2738 k[v][3] = pc[3] > rgba[v][3];
2739 break;
2740 case PIPE_FUNC_GEQUAL:
2741 k[v][0] = pc[0] >= rgba[v][0];
2742 k[v][1] = pc[1] >= rgba[v][1];
2743 k[v][2] = pc[2] >= rgba[v][2];
2744 k[v][3] = pc[3] >= rgba[v][3];
2745 break;
2746 case PIPE_FUNC_EQUAL:
2747 k[v][0] = pc[0] == rgba[v][0];
2748 k[v][1] = pc[1] == rgba[v][1];
2749 k[v][2] = pc[2] == rgba[v][2];
2750 k[v][3] = pc[3] == rgba[v][3];
2751 break;
2752 case PIPE_FUNC_NOTEQUAL:
2753 k[v][0] = pc[0] != rgba[v][0];
2754 k[v][1] = pc[1] != rgba[v][1];
2755 k[v][2] = pc[2] != rgba[v][2];
2756 k[v][3] = pc[3] != rgba[v][3];
2757 break;
2758 case PIPE_FUNC_ALWAYS:
2759 k[v][0] = k[v][1] = k[v][2] = k[v][3] = 1;
2760 break;
2761 case PIPE_FUNC_NEVER:
2762 k[v][0] = k[v][1] = k[v][2] = k[v][3] = 0;
2763 break;
2764 default:
2765 k[v][0] = k[v][1] = k[v][2] = k[v][3] = 0;
2766 assert(0);
2767 break;
2768 }
2769 }
2770
2771 if (is_gather) {
2772 for (j = 0; j < TGSI_QUAD_SIZE; j++) {
2773 for (v = 0; v < TGSI_NUM_CHANNELS; v++) {
2774 rgba[v][j] = k[v][j];
2775 }
2776 }
2777 } else {
2778 for (j = 0; j < TGSI_QUAD_SIZE; j++) {
2779 rgba[0][j] = k[0][j];
2780 rgba[1][j] = k[0][j];
2781 rgba[2][j] = k[0][j];
2782 rgba[3][j] = 1.0F;
2783 }
2784 }
2785 }
2786
2787 static void
2788 do_swizzling(const struct pipe_sampler_view *sview,
2789 float in[TGSI_NUM_CHANNELS][TGSI_QUAD_SIZE],
2790 float out[TGSI_NUM_CHANNELS][TGSI_QUAD_SIZE])
2791 {
2792 int j;
2793 const unsigned swizzle_r = sview->swizzle_r;
2794 const unsigned swizzle_g = sview->swizzle_g;
2795 const unsigned swizzle_b = sview->swizzle_b;
2796 const unsigned swizzle_a = sview->swizzle_a;
2797
2798 switch (swizzle_r) {
2799 case PIPE_SWIZZLE_ZERO:
2800 for (j = 0; j < 4; j++)
2801 out[0][j] = 0.0f;
2802 break;
2803 case PIPE_SWIZZLE_ONE:
2804 for (j = 0; j < 4; j++)
2805 out[0][j] = 1.0f;
2806 break;
2807 default:
2808 assert(swizzle_r < 4);
2809 for (j = 0; j < 4; j++)
2810 out[0][j] = in[swizzle_r][j];
2811 }
2812
2813 switch (swizzle_g) {
2814 case PIPE_SWIZZLE_ZERO:
2815 for (j = 0; j < 4; j++)
2816 out[1][j] = 0.0f;
2817 break;
2818 case PIPE_SWIZZLE_ONE:
2819 for (j = 0; j < 4; j++)
2820 out[1][j] = 1.0f;
2821 break;
2822 default:
2823 assert(swizzle_g < 4);
2824 for (j = 0; j < 4; j++)
2825 out[1][j] = in[swizzle_g][j];
2826 }
2827
2828 switch (swizzle_b) {
2829 case PIPE_SWIZZLE_ZERO:
2830 for (j = 0; j < 4; j++)
2831 out[2][j] = 0.0f;
2832 break;
2833 case PIPE_SWIZZLE_ONE:
2834 for (j = 0; j < 4; j++)
2835 out[2][j] = 1.0f;
2836 break;
2837 default:
2838 assert(swizzle_b < 4);
2839 for (j = 0; j < 4; j++)
2840 out[2][j] = in[swizzle_b][j];
2841 }
2842
2843 switch (swizzle_a) {
2844 case PIPE_SWIZZLE_ZERO:
2845 for (j = 0; j < 4; j++)
2846 out[3][j] = 0.0f;
2847 break;
2848 case PIPE_SWIZZLE_ONE:
2849 for (j = 0; j < 4; j++)
2850 out[3][j] = 1.0f;
2851 break;
2852 default:
2853 assert(swizzle_a < 4);
2854 for (j = 0; j < 4; j++)
2855 out[3][j] = in[swizzle_a][j];
2856 }
2857 }
2858
2859
2860 static wrap_nearest_func
2861 get_nearest_unorm_wrap(unsigned mode)
2862 {
2863 switch (mode) {
2864 case PIPE_TEX_WRAP_CLAMP:
2865 return wrap_nearest_unorm_clamp;
2866 case PIPE_TEX_WRAP_CLAMP_TO_EDGE:
2867 return wrap_nearest_unorm_clamp_to_edge;
2868 case PIPE_TEX_WRAP_CLAMP_TO_BORDER:
2869 return wrap_nearest_unorm_clamp_to_border;
2870 default:
2871 debug_printf("illegal wrap mode %d with non-normalized coords\n", mode);
2872 return wrap_nearest_unorm_clamp;
2873 }
2874 }
2875
2876
2877 static wrap_nearest_func
2878 get_nearest_wrap(unsigned mode)
2879 {
2880 switch (mode) {
2881 case PIPE_TEX_WRAP_REPEAT:
2882 return wrap_nearest_repeat;
2883 case PIPE_TEX_WRAP_CLAMP:
2884 return wrap_nearest_clamp;
2885 case PIPE_TEX_WRAP_CLAMP_TO_EDGE:
2886 return wrap_nearest_clamp_to_edge;
2887 case PIPE_TEX_WRAP_CLAMP_TO_BORDER:
2888 return wrap_nearest_clamp_to_border;
2889 case PIPE_TEX_WRAP_MIRROR_REPEAT:
2890 return wrap_nearest_mirror_repeat;
2891 case PIPE_TEX_WRAP_MIRROR_CLAMP:
2892 return wrap_nearest_mirror_clamp;
2893 case PIPE_TEX_WRAP_MIRROR_CLAMP_TO_EDGE:
2894 return wrap_nearest_mirror_clamp_to_edge;
2895 case PIPE_TEX_WRAP_MIRROR_CLAMP_TO_BORDER:
2896 return wrap_nearest_mirror_clamp_to_border;
2897 default:
2898 assert(0);
2899 return wrap_nearest_repeat;
2900 }
2901 }
2902
2903
2904 static wrap_linear_func
2905 get_linear_unorm_wrap(unsigned mode)
2906 {
2907 switch (mode) {
2908 case PIPE_TEX_WRAP_CLAMP:
2909 return wrap_linear_unorm_clamp;
2910 case PIPE_TEX_WRAP_CLAMP_TO_EDGE:
2911 return wrap_linear_unorm_clamp_to_edge;
2912 case PIPE_TEX_WRAP_CLAMP_TO_BORDER:
2913 return wrap_linear_unorm_clamp_to_border;
2914 default:
2915 debug_printf("illegal wrap mode %d with non-normalized coords\n", mode);
2916 return wrap_linear_unorm_clamp;
2917 }
2918 }
2919
2920
2921 static wrap_linear_func
2922 get_linear_wrap(unsigned mode)
2923 {
2924 switch (mode) {
2925 case PIPE_TEX_WRAP_REPEAT:
2926 return wrap_linear_repeat;
2927 case PIPE_TEX_WRAP_CLAMP:
2928 return wrap_linear_clamp;
2929 case PIPE_TEX_WRAP_CLAMP_TO_EDGE:
2930 return wrap_linear_clamp_to_edge;
2931 case PIPE_TEX_WRAP_CLAMP_TO_BORDER:
2932 return wrap_linear_clamp_to_border;
2933 case PIPE_TEX_WRAP_MIRROR_REPEAT:
2934 return wrap_linear_mirror_repeat;
2935 case PIPE_TEX_WRAP_MIRROR_CLAMP:
2936 return wrap_linear_mirror_clamp;
2937 case PIPE_TEX_WRAP_MIRROR_CLAMP_TO_EDGE:
2938 return wrap_linear_mirror_clamp_to_edge;
2939 case PIPE_TEX_WRAP_MIRROR_CLAMP_TO_BORDER:
2940 return wrap_linear_mirror_clamp_to_border;
2941 default:
2942 assert(0);
2943 return wrap_linear_repeat;
2944 }
2945 }
2946
2947
2948 /**
2949 * Is swizzling needed for the given state key?
2950 */
2951 static inline bool
2952 any_swizzle(const struct pipe_sampler_view *view)
2953 {
2954 return (view->swizzle_r != PIPE_SWIZZLE_RED ||
2955 view->swizzle_g != PIPE_SWIZZLE_GREEN ||
2956 view->swizzle_b != PIPE_SWIZZLE_BLUE ||
2957 view->swizzle_a != PIPE_SWIZZLE_ALPHA);
2958 }
2959
2960
2961 static img_filter_func
2962 get_img_filter(const struct sp_sampler_view *sp_sview,
2963 const struct pipe_sampler_state *sampler,
2964 unsigned filter, bool gather)
2965 {
2966 switch (sp_sview->base.target) {
2967 case PIPE_BUFFER:
2968 case PIPE_TEXTURE_1D:
2969 if (filter == PIPE_TEX_FILTER_NEAREST)
2970 return img_filter_1d_nearest;
2971 else
2972 return img_filter_1d_linear;
2973 break;
2974 case PIPE_TEXTURE_1D_ARRAY:
2975 if (filter == PIPE_TEX_FILTER_NEAREST)
2976 return img_filter_1d_array_nearest;
2977 else
2978 return img_filter_1d_array_linear;
2979 break;
2980 case PIPE_TEXTURE_2D:
2981 case PIPE_TEXTURE_RECT:
2982 /* Try for fast path:
2983 */
2984 if (!gather && sp_sview->pot2d &&
2985 sampler->wrap_s == sampler->wrap_t &&
2986 sampler->normalized_coords)
2987 {
2988 switch (sampler->wrap_s) {
2989 case PIPE_TEX_WRAP_REPEAT:
2990 switch (filter) {
2991 case PIPE_TEX_FILTER_NEAREST:
2992 return img_filter_2d_nearest_repeat_POT;
2993 case PIPE_TEX_FILTER_LINEAR:
2994 return img_filter_2d_linear_repeat_POT;
2995 default:
2996 break;
2997 }
2998 break;
2999 case PIPE_TEX_WRAP_CLAMP:
3000 switch (filter) {
3001 case PIPE_TEX_FILTER_NEAREST:
3002 return img_filter_2d_nearest_clamp_POT;
3003 default:
3004 break;
3005 }
3006 }
3007 }
3008 /* Otherwise use default versions:
3009 */
3010 if (filter == PIPE_TEX_FILTER_NEAREST)
3011 return img_filter_2d_nearest;
3012 else
3013 return img_filter_2d_linear;
3014 break;
3015 case PIPE_TEXTURE_2D_ARRAY:
3016 if (filter == PIPE_TEX_FILTER_NEAREST)
3017 return img_filter_2d_array_nearest;
3018 else
3019 return img_filter_2d_array_linear;
3020 break;
3021 case PIPE_TEXTURE_CUBE:
3022 if (filter == PIPE_TEX_FILTER_NEAREST)
3023 return img_filter_cube_nearest;
3024 else
3025 return img_filter_cube_linear;
3026 break;
3027 case PIPE_TEXTURE_CUBE_ARRAY:
3028 if (filter == PIPE_TEX_FILTER_NEAREST)
3029 return img_filter_cube_array_nearest;
3030 else
3031 return img_filter_cube_array_linear;
3032 break;
3033 case PIPE_TEXTURE_3D:
3034 if (filter == PIPE_TEX_FILTER_NEAREST)
3035 return img_filter_3d_nearest;
3036 else
3037 return img_filter_3d_linear;
3038 break;
3039 default:
3040 assert(0);
3041 return img_filter_1d_nearest;
3042 }
3043 }
3044
3045 /**
3046 * Get mip filter funcs, and optionally both img min filter and img mag
3047 * filter. Note that both img filter function pointers must be either non-NULL
3048 * or NULL.
3049 */
3050 static void
3051 get_filters(struct sp_sampler_view *sp_sview,
3052 struct sp_sampler *sp_samp,
3053 enum tgsi_sampler_control control,
3054 const struct sp_filter_funcs **funcs,
3055 img_filter_func *min,
3056 img_filter_func *mag)
3057 {
3058 assert(funcs);
3059 if (control == tgsi_sampler_gather) {
3060 *funcs = &funcs_nearest;
3061 if (min) {
3062 *min = get_img_filter(sp_sview, &sp_samp->base,
3063 PIPE_TEX_FILTER_LINEAR, true);
3064 }
3065 } else if (sp_sview->pot2d & sp_samp->min_mag_equal_repeat_linear) {
3066 *funcs = &funcs_linear_2d_linear_repeat_POT;
3067 } else {
3068 *funcs = sp_samp->filter_funcs;
3069 if (min) {
3070 assert(mag);
3071 *min = get_img_filter(sp_sview, &sp_samp->base,
3072 sp_samp->min_img_filter, false);
3073 if (sp_samp->min_mag_equal) {
3074 *mag = *min;
3075 } else {
3076 *mag = get_img_filter(sp_sview, &sp_samp->base,
3077 sp_samp->base.mag_img_filter, false);
3078 }
3079 }
3080 }
3081 }
3082
3083 static void
3084 sample_mip(struct sp_sampler_view *sp_sview,
3085 struct sp_sampler *sp_samp,
3086 const float s[TGSI_QUAD_SIZE],
3087 const float t[TGSI_QUAD_SIZE],
3088 const float p[TGSI_QUAD_SIZE],
3089 const float c0[TGSI_QUAD_SIZE],
3090 const float lod[TGSI_QUAD_SIZE],
3091 const struct filter_args *filt_args,
3092 float rgba[TGSI_NUM_CHANNELS][TGSI_QUAD_SIZE])
3093 {
3094 const struct sp_filter_funcs *funcs = NULL;
3095 img_filter_func min_img_filter = NULL;
3096 img_filter_func mag_img_filter = NULL;
3097
3098 get_filters(sp_sview, sp_samp, filt_args->control,
3099 &funcs, &min_img_filter, &mag_img_filter);
3100
3101 funcs->filter(sp_sview, sp_samp, min_img_filter, mag_img_filter,
3102 s, t, p, c0, lod, filt_args, rgba);
3103
3104 if (sp_samp->base.compare_mode != PIPE_TEX_COMPARE_NONE) {
3105 sample_compare(sp_sview, sp_samp, s, t, p, c0,
3106 lod, filt_args->control, rgba);
3107 }
3108
3109 if (sp_sview->need_swizzle && filt_args->control != tgsi_sampler_gather) {
3110 float rgba_temp[TGSI_NUM_CHANNELS][TGSI_QUAD_SIZE];
3111 memcpy(rgba_temp, rgba, sizeof(rgba_temp));
3112 do_swizzling(&sp_sview->base, rgba_temp, rgba);
3113 }
3114
3115 }
3116
3117
3118 /**
3119 * This function uses cube texture coordinates to choose a face of a cube and
3120 * computes the 2D cube face coordinates. Puts face info into the sampler
3121 * faces[] array.
3122 */
3123 static void
3124 convert_cube(struct sp_sampler_view *sp_sview,
3125 struct sp_sampler *sp_samp,
3126 const float s[TGSI_QUAD_SIZE],
3127 const float t[TGSI_QUAD_SIZE],
3128 const float p[TGSI_QUAD_SIZE],
3129 const float c0[TGSI_QUAD_SIZE],
3130 float ssss[TGSI_QUAD_SIZE],
3131 float tttt[TGSI_QUAD_SIZE],
3132 float pppp[TGSI_QUAD_SIZE])
3133 {
3134 unsigned j;
3135
3136 pppp[0] = c0[0];
3137 pppp[1] = c0[1];
3138 pppp[2] = c0[2];
3139 pppp[3] = c0[3];
3140 /*
3141 major axis
3142 direction target sc tc ma
3143 ---------- ------------------------------- --- --- ---
3144 +rx TEXTURE_CUBE_MAP_POSITIVE_X_EXT -rz -ry rx
3145 -rx TEXTURE_CUBE_MAP_NEGATIVE_X_EXT +rz -ry rx
3146 +ry TEXTURE_CUBE_MAP_POSITIVE_Y_EXT +rx +rz ry
3147 -ry TEXTURE_CUBE_MAP_NEGATIVE_Y_EXT +rx -rz ry
3148 +rz TEXTURE_CUBE_MAP_POSITIVE_Z_EXT +rx -ry rz
3149 -rz TEXTURE_CUBE_MAP_NEGATIVE_Z_EXT -rx -ry rz
3150 */
3151
3152 /* Choose the cube face and compute new s/t coords for the 2D face.
3153 *
3154 * Use the same cube face for all four pixels in the quad.
3155 *
3156 * This isn't ideal, but if we want to use a different cube face
3157 * per pixel in the quad, we'd have to also compute the per-face
3158 * LOD here too. That's because the four post-face-selection
3159 * texcoords are no longer related to each other (they're
3160 * per-face!) so we can't use subtraction to compute the partial
3161 * deriviates to compute the LOD. Doing so (near cube edges
3162 * anyway) gives us pretty much random values.
3163 */
3164 {
3165 /* use the average of the four pixel's texcoords to choose the face */
3166 const float rx = 0.25F * (s[0] + s[1] + s[2] + s[3]);
3167 const float ry = 0.25F * (t[0] + t[1] + t[2] + t[3]);
3168 const float rz = 0.25F * (p[0] + p[1] + p[2] + p[3]);
3169 const float arx = fabsf(rx), ary = fabsf(ry), arz = fabsf(rz);
3170
3171 if (arx >= ary && arx >= arz) {
3172 const float sign = (rx >= 0.0F) ? 1.0F : -1.0F;
3173 const uint face = (rx >= 0.0F) ?
3174 PIPE_TEX_FACE_POS_X : PIPE_TEX_FACE_NEG_X;
3175 for (j = 0; j < TGSI_QUAD_SIZE; j++) {
3176 const float ima = -0.5F / fabsf(s[j]);
3177 ssss[j] = sign * p[j] * ima + 0.5F;
3178 tttt[j] = t[j] * ima + 0.5F;
3179 sp_sview->faces[j] = face;
3180 }
3181 }
3182 else if (ary >= arx && ary >= arz) {
3183 const float sign = (ry >= 0.0F) ? 1.0F : -1.0F;
3184 const uint face = (ry >= 0.0F) ?
3185 PIPE_TEX_FACE_POS_Y : PIPE_TEX_FACE_NEG_Y;
3186 for (j = 0; j < TGSI_QUAD_SIZE; j++) {
3187 const float ima = -0.5F / fabsf(t[j]);
3188 ssss[j] = -s[j] * ima + 0.5F;
3189 tttt[j] = sign * -p[j] * ima + 0.5F;
3190 sp_sview->faces[j] = face;
3191 }
3192 }
3193 else {
3194 const float sign = (rz >= 0.0F) ? 1.0F : -1.0F;
3195 const uint face = (rz >= 0.0F) ?
3196 PIPE_TEX_FACE_POS_Z : PIPE_TEX_FACE_NEG_Z;
3197 for (j = 0; j < TGSI_QUAD_SIZE; j++) {
3198 const float ima = -0.5F / fabsf(p[j]);
3199 ssss[j] = sign * -s[j] * ima + 0.5F;
3200 tttt[j] = t[j] * ima + 0.5F;
3201 sp_sview->faces[j] = face;
3202 }
3203 }
3204 }
3205 }
3206
3207
3208 static void
3209 sp_get_dims(struct sp_sampler_view *sp_sview, int level,
3210 int dims[4])
3211 {
3212 const struct pipe_sampler_view *view = &sp_sview->base;
3213 const struct pipe_resource *texture = view->texture;
3214
3215 if (view->target == PIPE_BUFFER) {
3216 dims[0] = (view->u.buf.last_element - view->u.buf.first_element) + 1;
3217 /* the other values are undefined, but let's avoid potential valgrind
3218 * warnings.
3219 */
3220 dims[1] = dims[2] = dims[3] = 0;
3221 return;
3222 }
3223
3224 /* undefined according to EXT_gpu_program */
3225 level += view->u.tex.first_level;
3226 if (level > view->u.tex.last_level)
3227 return;
3228
3229 dims[3] = view->u.tex.last_level - view->u.tex.first_level + 1;
3230 dims[0] = u_minify(texture->width0, level);
3231
3232 switch (view->target) {
3233 case PIPE_TEXTURE_1D_ARRAY:
3234 dims[1] = view->u.tex.last_layer - view->u.tex.first_layer + 1;
3235 /* fallthrough */
3236 case PIPE_TEXTURE_1D:
3237 return;
3238 case PIPE_TEXTURE_2D_ARRAY:
3239 dims[2] = view->u.tex.last_layer - view->u.tex.first_layer + 1;
3240 /* fallthrough */
3241 case PIPE_TEXTURE_2D:
3242 case PIPE_TEXTURE_CUBE:
3243 case PIPE_TEXTURE_RECT:
3244 dims[1] = u_minify(texture->height0, level);
3245 return;
3246 case PIPE_TEXTURE_3D:
3247 dims[1] = u_minify(texture->height0, level);
3248 dims[2] = u_minify(texture->depth0, level);
3249 return;
3250 case PIPE_TEXTURE_CUBE_ARRAY:
3251 dims[1] = u_minify(texture->height0, level);
3252 dims[2] = (view->u.tex.last_layer - view->u.tex.first_layer + 1) / 6;
3253 break;
3254 default:
3255 assert(!"unexpected texture target in sp_get_dims()");
3256 return;
3257 }
3258 }
3259
3260 /**
3261 * This function is only used for getting unfiltered texels via the
3262 * TXF opcode. The GL spec says that out-of-bounds texel fetches
3263 * produce undefined results. Instead of crashing, lets just clamp
3264 * coords to the texture image size.
3265 */
3266 static void
3267 sp_get_texels(struct sp_sampler_view *sp_sview,
3268 const int v_i[TGSI_QUAD_SIZE],
3269 const int v_j[TGSI_QUAD_SIZE],
3270 const int v_k[TGSI_QUAD_SIZE],
3271 const int lod[TGSI_QUAD_SIZE],
3272 const int8_t offset[3],
3273 float rgba[TGSI_NUM_CHANNELS][TGSI_QUAD_SIZE])
3274 {
3275 union tex_tile_address addr;
3276 const struct pipe_resource *texture = sp_sview->base.texture;
3277 int j, c;
3278 const float *tx;
3279 int width, height, depth;
3280
3281 addr.value = 0;
3282 /* TODO write a better test for LOD */
3283 addr.bits.level = sp_sview->base.target == PIPE_BUFFER ? 0 :
3284 CLAMP(lod[0] + sp_sview->base.u.tex.first_level,
3285 sp_sview->base.u.tex.first_level,
3286 sp_sview->base.u.tex.last_level);
3287
3288 width = u_minify(texture->width0, addr.bits.level);
3289 height = u_minify(texture->height0, addr.bits.level);
3290 depth = u_minify(texture->depth0, addr.bits.level);
3291
3292 switch (sp_sview->base.target) {
3293 case PIPE_BUFFER:
3294 case PIPE_TEXTURE_1D:
3295 for (j = 0; j < TGSI_QUAD_SIZE; j++) {
3296 int x = CLAMP(v_i[j] + offset[0], 0, width - 1);
3297 tx = get_texel_2d_no_border(sp_sview, addr, x, 0);
3298 for (c = 0; c < 4; c++) {
3299 rgba[c][j] = tx[c];
3300 }
3301 }
3302 break;
3303 case PIPE_TEXTURE_1D_ARRAY:
3304 for (j = 0; j < TGSI_QUAD_SIZE; j++) {
3305 int x = CLAMP(v_i[j] + offset[0], 0, width - 1);
3306 int y = CLAMP(v_j[j], sp_sview->base.u.tex.first_layer,
3307 sp_sview->base.u.tex.last_layer);
3308 tx = get_texel_2d_no_border(sp_sview, addr, x, y);
3309 for (c = 0; c < 4; c++) {
3310 rgba[c][j] = tx[c];
3311 }
3312 }
3313 break;
3314 case PIPE_TEXTURE_2D:
3315 case PIPE_TEXTURE_RECT:
3316 for (j = 0; j < TGSI_QUAD_SIZE; j++) {
3317 int x = CLAMP(v_i[j] + offset[0], 0, width - 1);
3318 int y = CLAMP(v_j[j] + offset[1], 0, height - 1);
3319 tx = get_texel_2d_no_border(sp_sview, addr, x, y);
3320 for (c = 0; c < 4; c++) {
3321 rgba[c][j] = tx[c];
3322 }
3323 }
3324 break;
3325 case PIPE_TEXTURE_2D_ARRAY:
3326 for (j = 0; j < TGSI_QUAD_SIZE; j++) {
3327 int x = CLAMP(v_i[j] + offset[0], 0, width - 1);
3328 int y = CLAMP(v_j[j] + offset[1], 0, height - 1);
3329 int layer = CLAMP(v_k[j], sp_sview->base.u.tex.first_layer,
3330 sp_sview->base.u.tex.last_layer);
3331 tx = get_texel_3d_no_border(sp_sview, addr, x, y, layer);
3332 for (c = 0; c < 4; c++) {
3333 rgba[c][j] = tx[c];
3334 }
3335 }
3336 break;
3337 case PIPE_TEXTURE_3D:
3338 for (j = 0; j < TGSI_QUAD_SIZE; j++) {
3339 int x = CLAMP(v_i[j] + offset[0], 0, width - 1);
3340 int y = CLAMP(v_j[j] + offset[1], 0, height - 1);
3341 int z = CLAMP(v_k[j] + offset[2], 0, depth - 1);
3342 tx = get_texel_3d_no_border(sp_sview, addr, x, y, z);
3343 for (c = 0; c < 4; c++) {
3344 rgba[c][j] = tx[c];
3345 }
3346 }
3347 break;
3348 case PIPE_TEXTURE_CUBE: /* TXF can't work on CUBE according to spec */
3349 default:
3350 assert(!"Unknown or CUBE texture type in TXF processing\n");
3351 break;
3352 }
3353
3354 if (sp_sview->need_swizzle) {
3355 float rgba_temp[TGSI_NUM_CHANNELS][TGSI_QUAD_SIZE];
3356 memcpy(rgba_temp, rgba, sizeof(rgba_temp));
3357 do_swizzling(&sp_sview->base, rgba_temp, rgba);
3358 }
3359 }
3360
3361
3362 void *
3363 softpipe_create_sampler_state(struct pipe_context *pipe,
3364 const struct pipe_sampler_state *sampler)
3365 {
3366 struct sp_sampler *samp = CALLOC_STRUCT(sp_sampler);
3367
3368 samp->base = *sampler;
3369
3370 /* Note that (for instance) linear_texcoord_s and
3371 * nearest_texcoord_s may be active at the same time, if the
3372 * sampler min_img_filter differs from its mag_img_filter.
3373 */
3374 if (sampler->normalized_coords) {
3375 samp->linear_texcoord_s = get_linear_wrap( sampler->wrap_s );
3376 samp->linear_texcoord_t = get_linear_wrap( sampler->wrap_t );
3377 samp->linear_texcoord_p = get_linear_wrap( sampler->wrap_r );
3378
3379 samp->nearest_texcoord_s = get_nearest_wrap( sampler->wrap_s );
3380 samp->nearest_texcoord_t = get_nearest_wrap( sampler->wrap_t );
3381 samp->nearest_texcoord_p = get_nearest_wrap( sampler->wrap_r );
3382 }
3383 else {
3384 samp->linear_texcoord_s = get_linear_unorm_wrap( sampler->wrap_s );
3385 samp->linear_texcoord_t = get_linear_unorm_wrap( sampler->wrap_t );
3386 samp->linear_texcoord_p = get_linear_unorm_wrap( sampler->wrap_r );
3387
3388 samp->nearest_texcoord_s = get_nearest_unorm_wrap( sampler->wrap_s );
3389 samp->nearest_texcoord_t = get_nearest_unorm_wrap( sampler->wrap_t );
3390 samp->nearest_texcoord_p = get_nearest_unorm_wrap( sampler->wrap_r );
3391 }
3392
3393 samp->min_img_filter = sampler->min_img_filter;
3394
3395 switch (sampler->min_mip_filter) {
3396 case PIPE_TEX_MIPFILTER_NONE:
3397 if (sampler->min_img_filter == sampler->mag_img_filter)
3398 samp->filter_funcs = &funcs_none_no_filter_select;
3399 else
3400 samp->filter_funcs = &funcs_none;
3401 break;
3402
3403 case PIPE_TEX_MIPFILTER_NEAREST:
3404 samp->filter_funcs = &funcs_nearest;
3405 break;
3406
3407 case PIPE_TEX_MIPFILTER_LINEAR:
3408 if (sampler->min_img_filter == sampler->mag_img_filter &&
3409 sampler->normalized_coords &&
3410 sampler->wrap_s == PIPE_TEX_WRAP_REPEAT &&
3411 sampler->wrap_t == PIPE_TEX_WRAP_REPEAT &&
3412 sampler->min_img_filter == PIPE_TEX_FILTER_LINEAR &&
3413 sampler->max_anisotropy <= 1) {
3414 samp->min_mag_equal_repeat_linear = TRUE;
3415 }
3416 samp->filter_funcs = &funcs_linear;
3417
3418 /* Anisotropic filtering extension. */
3419 if (sampler->max_anisotropy > 1) {
3420 samp->filter_funcs = &funcs_linear_aniso;
3421
3422 /* Override min_img_filter:
3423 * min_img_filter needs to be set to NEAREST since we need to access
3424 * each texture pixel as it is and weight it later; using linear
3425 * filters will have incorrect results.
3426 * By setting the filter to NEAREST here, we can avoid calling the
3427 * generic img_filter_2d_nearest in the anisotropic filter function,
3428 * making it possible to use one of the accelerated implementations
3429 */
3430 samp->min_img_filter = PIPE_TEX_FILTER_NEAREST;
3431
3432 /* on first access create the lookup table containing the filter weights. */
3433 if (!weightLut) {
3434 create_filter_table();
3435 }
3436 }
3437 break;
3438 }
3439 if (samp->min_img_filter == sampler->mag_img_filter) {
3440 samp->min_mag_equal = TRUE;
3441 }
3442
3443 return (void *)samp;
3444 }
3445
3446
3447 compute_lambda_func
3448 softpipe_get_lambda_func(const struct pipe_sampler_view *view, unsigned shader)
3449 {
3450 if (shader != PIPE_SHADER_FRAGMENT)
3451 return compute_lambda_vert;
3452
3453 switch (view->target) {
3454 case PIPE_BUFFER:
3455 case PIPE_TEXTURE_1D:
3456 case PIPE_TEXTURE_1D_ARRAY:
3457 return compute_lambda_1d;
3458 case PIPE_TEXTURE_2D:
3459 case PIPE_TEXTURE_2D_ARRAY:
3460 case PIPE_TEXTURE_RECT:
3461 case PIPE_TEXTURE_CUBE:
3462 case PIPE_TEXTURE_CUBE_ARRAY:
3463 return compute_lambda_2d;
3464 case PIPE_TEXTURE_3D:
3465 return compute_lambda_3d;
3466 default:
3467 assert(0);
3468 return compute_lambda_1d;
3469 }
3470 }
3471
3472
3473 struct pipe_sampler_view *
3474 softpipe_create_sampler_view(struct pipe_context *pipe,
3475 struct pipe_resource *resource,
3476 const struct pipe_sampler_view *templ)
3477 {
3478 struct sp_sampler_view *sview = CALLOC_STRUCT(sp_sampler_view);
3479 struct softpipe_resource *spr = (struct softpipe_resource *)resource;
3480
3481 if (sview) {
3482 struct pipe_sampler_view *view = &sview->base;
3483 *view = *templ;
3484 view->reference.count = 1;
3485 view->texture = NULL;
3486 pipe_resource_reference(&view->texture, resource);
3487 view->context = pipe;
3488
3489 #ifdef DEBUG
3490 /*
3491 * This is possibly too lenient, but the primary reason is just
3492 * to catch state trackers which forget to initialize this, so
3493 * it only catches clearly impossible view targets.
3494 */
3495 if (view->target != resource->target) {
3496 if (view->target == PIPE_TEXTURE_1D)
3497 assert(resource->target == PIPE_TEXTURE_1D_ARRAY);
3498 else if (view->target == PIPE_TEXTURE_1D_ARRAY)
3499 assert(resource->target == PIPE_TEXTURE_1D);
3500 else if (view->target == PIPE_TEXTURE_2D)
3501 assert(resource->target == PIPE_TEXTURE_2D_ARRAY ||
3502 resource->target == PIPE_TEXTURE_CUBE ||
3503 resource->target == PIPE_TEXTURE_CUBE_ARRAY);
3504 else if (view->target == PIPE_TEXTURE_2D_ARRAY)
3505 assert(resource->target == PIPE_TEXTURE_2D ||
3506 resource->target == PIPE_TEXTURE_CUBE ||
3507 resource->target == PIPE_TEXTURE_CUBE_ARRAY);
3508 else if (view->target == PIPE_TEXTURE_CUBE)
3509 assert(resource->target == PIPE_TEXTURE_CUBE_ARRAY ||
3510 resource->target == PIPE_TEXTURE_2D_ARRAY);
3511 else if (view->target == PIPE_TEXTURE_CUBE_ARRAY)
3512 assert(resource->target == PIPE_TEXTURE_CUBE ||
3513 resource->target == PIPE_TEXTURE_2D_ARRAY);
3514 else
3515 assert(0);
3516 }
3517 #endif
3518
3519 if (any_swizzle(view)) {
3520 sview->need_swizzle = TRUE;
3521 }
3522
3523 sview->need_cube_convert = (view->target == PIPE_TEXTURE_CUBE ||
3524 view->target == PIPE_TEXTURE_CUBE_ARRAY);
3525 sview->pot2d = spr->pot &&
3526 (view->target == PIPE_TEXTURE_2D ||
3527 view->target == PIPE_TEXTURE_RECT);
3528
3529 sview->xpot = util_logbase2( resource->width0 );
3530 sview->ypot = util_logbase2( resource->height0 );
3531 }
3532
3533 return (struct pipe_sampler_view *) sview;
3534 }
3535
3536
3537 static void
3538 sp_tgsi_get_dims(struct tgsi_sampler *tgsi_sampler,
3539 const unsigned sview_index,
3540 int level, int dims[4])
3541 {
3542 struct sp_tgsi_sampler *sp_samp = (struct sp_tgsi_sampler *)tgsi_sampler;
3543
3544 assert(sview_index < PIPE_MAX_SHADER_SAMPLER_VIEWS);
3545 /* always have a view here but texture is NULL if no sampler view was set. */
3546 if (!sp_samp->sp_sview[sview_index].base.texture) {
3547 dims[0] = dims[1] = dims[2] = dims[3] = 0;
3548 return;
3549 }
3550 sp_get_dims(&sp_samp->sp_sview[sview_index], level, dims);
3551 }
3552
3553
3554 static void
3555 sp_tgsi_get_samples(struct tgsi_sampler *tgsi_sampler,
3556 const unsigned sview_index,
3557 const unsigned sampler_index,
3558 const float s[TGSI_QUAD_SIZE],
3559 const float t[TGSI_QUAD_SIZE],
3560 const float p[TGSI_QUAD_SIZE],
3561 const float c0[TGSI_QUAD_SIZE],
3562 const float lod[TGSI_QUAD_SIZE],
3563 float derivs[3][2][TGSI_QUAD_SIZE],
3564 const int8_t offset[3],
3565 enum tgsi_sampler_control control,
3566 float rgba[TGSI_NUM_CHANNELS][TGSI_QUAD_SIZE])
3567 {
3568 struct sp_tgsi_sampler *sp_tgsi_samp = (struct sp_tgsi_sampler *)tgsi_sampler;
3569 struct sp_sampler_view *sp_sview;
3570 struct sp_sampler *sp_samp;
3571 struct filter_args filt_args;
3572
3573 assert(sview_index < PIPE_MAX_SHADER_SAMPLER_VIEWS);
3574 assert(sampler_index < PIPE_MAX_SAMPLERS);
3575 assert(sp_tgsi_samp->sp_sampler[sampler_index]);
3576
3577 sp_sview = &sp_tgsi_samp->sp_sview[sview_index];
3578 sp_samp = sp_tgsi_samp->sp_sampler[sampler_index];
3579 /* always have a view here but texture is NULL if no sampler view was set. */
3580 if (!sp_sview->base.texture) {
3581 int i, j;
3582 for (j = 0; j < TGSI_NUM_CHANNELS; j++) {
3583 for (i = 0; i < TGSI_QUAD_SIZE; i++) {
3584 rgba[j][i] = 0.0f;
3585 }
3586 }
3587 return;
3588 }
3589
3590 filt_args.control = control;
3591 filt_args.offset = offset;
3592
3593 if (sp_sview->need_cube_convert) {
3594 float cs[TGSI_QUAD_SIZE];
3595 float ct[TGSI_QUAD_SIZE];
3596 float cp[TGSI_QUAD_SIZE];
3597
3598 convert_cube(sp_sview, sp_samp, s, t, p, c0, cs, ct, cp);
3599
3600 sample_mip(sp_sview, sp_samp, cs, ct, cp, c0, lod, &filt_args, rgba);
3601 } else {
3602 sample_mip(sp_sview, sp_samp, s, t, p, c0, lod, &filt_args, rgba);
3603 }
3604 }
3605
3606
3607 static void
3608 sp_tgsi_get_texel(struct tgsi_sampler *tgsi_sampler,
3609 const unsigned sview_index,
3610 const int i[TGSI_QUAD_SIZE],
3611 const int j[TGSI_QUAD_SIZE], const int k[TGSI_QUAD_SIZE],
3612 const int lod[TGSI_QUAD_SIZE], const int8_t offset[3],
3613 float rgba[TGSI_NUM_CHANNELS][TGSI_QUAD_SIZE])
3614 {
3615 struct sp_tgsi_sampler *sp_samp = (struct sp_tgsi_sampler *)tgsi_sampler;
3616
3617 assert(sview_index < PIPE_MAX_SHADER_SAMPLER_VIEWS);
3618 /* always have a view here but texture is NULL if no sampler view was set. */
3619 if (!sp_samp->sp_sview[sview_index].base.texture) {
3620 int i, j;
3621 for (j = 0; j < TGSI_NUM_CHANNELS; j++) {
3622 for (i = 0; i < TGSI_QUAD_SIZE; i++) {
3623 rgba[j][i] = 0.0f;
3624 }
3625 }
3626 return;
3627 }
3628 sp_get_texels(&sp_samp->sp_sview[sview_index], i, j, k, lod, offset, rgba);
3629 }
3630
3631
3632 struct sp_tgsi_sampler *
3633 sp_create_tgsi_sampler(void)
3634 {
3635 struct sp_tgsi_sampler *samp = CALLOC_STRUCT(sp_tgsi_sampler);
3636 if (!samp)
3637 return NULL;
3638
3639 samp->base.get_dims = sp_tgsi_get_dims;
3640 samp->base.get_samples = sp_tgsi_get_samples;
3641 samp->base.get_texel = sp_tgsi_get_texel;
3642
3643 return samp;
3644 }
3645