freedreno/a4xx: frag-depth fixes
[mesa.git] / src / gallium / auxiliary / gallivm / lp_bld_sample.c
1 /**************************************************************************
2 *
3 * Copyright 2009 VMware, Inc.
4 * All Rights Reserved.
5 *
6 * Permission is hereby granted, free of charge, to any person obtaining a
7 * copy of this software and associated documentation files (the
8 * "Software"), to deal in the Software without restriction, including
9 * without limitation the rights to use, copy, modify, merge, publish,
10 * distribute, sub license, and/or sell copies of the Software, and to
11 * permit persons to whom the Software is furnished to do so, subject to
12 * the following conditions:
13 *
14 * The above copyright notice and this permission notice (including the
15 * next paragraph) shall be included in all copies or substantial portions
16 * of the Software.
17 *
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
19 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
21 * IN NO EVENT SHALL VMWARE AND/OR ITS SUPPLIERS BE LIABLE FOR
22 * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
23 * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
24 * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
25 *
26 **************************************************************************/
27
28 /**
29 * @file
30 * Texture sampling -- common code.
31 *
32 * @author Jose Fonseca <jfonseca@vmware.com>
33 */
34
35 #include "pipe/p_defines.h"
36 #include "pipe/p_state.h"
37 #include "util/u_format.h"
38 #include "util/u_math.h"
39 #include "util/u_cpu_detect.h"
40 #include "lp_bld_arit.h"
41 #include "lp_bld_const.h"
42 #include "lp_bld_debug.h"
43 #include "lp_bld_printf.h"
44 #include "lp_bld_flow.h"
45 #include "lp_bld_sample.h"
46 #include "lp_bld_swizzle.h"
47 #include "lp_bld_type.h"
48 #include "lp_bld_logic.h"
49 #include "lp_bld_pack.h"
50 #include "lp_bld_quad.h"
51 #include "lp_bld_bitarit.h"
52
53
54 /*
55 * Bri-linear factor. Should be greater than one.
56 */
57 #define BRILINEAR_FACTOR 2
58
59 /**
60 * Does the given texture wrap mode allow sampling the texture border color?
61 * XXX maybe move this into gallium util code.
62 */
63 boolean
64 lp_sampler_wrap_mode_uses_border_color(unsigned mode,
65 unsigned min_img_filter,
66 unsigned mag_img_filter)
67 {
68 switch (mode) {
69 case PIPE_TEX_WRAP_REPEAT:
70 case PIPE_TEX_WRAP_CLAMP_TO_EDGE:
71 case PIPE_TEX_WRAP_MIRROR_REPEAT:
72 case PIPE_TEX_WRAP_MIRROR_CLAMP_TO_EDGE:
73 return FALSE;
74 case PIPE_TEX_WRAP_CLAMP:
75 case PIPE_TEX_WRAP_MIRROR_CLAMP:
76 if (min_img_filter == PIPE_TEX_FILTER_NEAREST &&
77 mag_img_filter == PIPE_TEX_FILTER_NEAREST) {
78 return FALSE;
79 } else {
80 return TRUE;
81 }
82 case PIPE_TEX_WRAP_CLAMP_TO_BORDER:
83 case PIPE_TEX_WRAP_MIRROR_CLAMP_TO_BORDER:
84 return TRUE;
85 default:
86 assert(0 && "unexpected wrap mode");
87 return FALSE;
88 }
89 }
90
91
92 /**
93 * Initialize lp_sampler_static_texture_state object with the gallium
94 * texture/sampler_view state (this contains the parts which are
95 * considered static).
96 */
97 void
98 lp_sampler_static_texture_state(struct lp_static_texture_state *state,
99 const struct pipe_sampler_view *view)
100 {
101 const struct pipe_resource *texture;
102
103 memset(state, 0, sizeof *state);
104
105 if (!view || !view->texture)
106 return;
107
108 texture = view->texture;
109
110 state->format = view->format;
111 state->swizzle_r = view->swizzle_r;
112 state->swizzle_g = view->swizzle_g;
113 state->swizzle_b = view->swizzle_b;
114 state->swizzle_a = view->swizzle_a;
115
116 state->target = texture->target;
117 state->pot_width = util_is_power_of_two(texture->width0);
118 state->pot_height = util_is_power_of_two(texture->height0);
119 state->pot_depth = util_is_power_of_two(texture->depth0);
120 state->level_zero_only = !view->u.tex.last_level;
121
122 /*
123 * the layer / element / level parameters are all either dynamic
124 * state or handled transparently wrt execution.
125 */
126 }
127
128
129 /**
130 * Initialize lp_sampler_static_sampler_state object with the gallium sampler
131 * state (this contains the parts which are considered static).
132 */
133 void
134 lp_sampler_static_sampler_state(struct lp_static_sampler_state *state,
135 const struct pipe_sampler_state *sampler)
136 {
137 memset(state, 0, sizeof *state);
138
139 if (!sampler)
140 return;
141
142 /*
143 * We don't copy sampler state over unless it is actually enabled, to avoid
144 * spurious recompiles, as the sampler static state is part of the shader
145 * key.
146 *
147 * Ideally the state tracker or cso_cache module would make all state
148 * canonical, but until that happens it's better to be safe than sorry here.
149 *
150 * XXX: Actually there's much more than can be done here, especially
151 * regarding 1D/2D/3D/CUBE textures, wrap modes, etc.
152 */
153
154 state->wrap_s = sampler->wrap_s;
155 state->wrap_t = sampler->wrap_t;
156 state->wrap_r = sampler->wrap_r;
157 state->min_img_filter = sampler->min_img_filter;
158 state->mag_img_filter = sampler->mag_img_filter;
159 state->seamless_cube_map = sampler->seamless_cube_map;
160
161 if (sampler->max_lod > 0.0f) {
162 state->min_mip_filter = sampler->min_mip_filter;
163 } else {
164 state->min_mip_filter = PIPE_TEX_MIPFILTER_NONE;
165 }
166
167 if (state->min_mip_filter != PIPE_TEX_MIPFILTER_NONE ||
168 state->min_img_filter != state->mag_img_filter) {
169 if (sampler->lod_bias != 0.0f) {
170 state->lod_bias_non_zero = 1;
171 }
172
173 /* If min_lod == max_lod we can greatly simplify mipmap selection.
174 * This is a case that occurs during automatic mipmap generation.
175 */
176 if (sampler->min_lod == sampler->max_lod) {
177 state->min_max_lod_equal = 1;
178 } else {
179 if (sampler->min_lod > 0.0f) {
180 state->apply_min_lod = 1;
181 }
182
183 /*
184 * XXX this won't do anything with the mesa state tracker which always
185 * sets max_lod to not more than actually present mip maps...
186 */
187 if (sampler->max_lod < (PIPE_MAX_TEXTURE_LEVELS - 1)) {
188 state->apply_max_lod = 1;
189 }
190 }
191 }
192
193 state->compare_mode = sampler->compare_mode;
194 if (sampler->compare_mode != PIPE_TEX_COMPARE_NONE) {
195 state->compare_func = sampler->compare_func;
196 }
197
198 state->normalized_coords = sampler->normalized_coords;
199 }
200
201
202 /**
203 * Generate code to compute coordinate gradient (rho).
204 * \param derivs partial derivatives of (s, t, r, q) with respect to X and Y
205 *
206 * The resulting rho has bld->levelf format (per quad or per element).
207 */
208 static LLVMValueRef
209 lp_build_rho(struct lp_build_sample_context *bld,
210 unsigned texture_unit,
211 LLVMValueRef s,
212 LLVMValueRef t,
213 LLVMValueRef r,
214 LLVMValueRef cube_rho,
215 const struct lp_derivatives *derivs)
216 {
217 struct gallivm_state *gallivm = bld->gallivm;
218 struct lp_build_context *int_size_bld = &bld->int_size_in_bld;
219 struct lp_build_context *float_size_bld = &bld->float_size_in_bld;
220 struct lp_build_context *float_bld = &bld->float_bld;
221 struct lp_build_context *coord_bld = &bld->coord_bld;
222 struct lp_build_context *rho_bld = &bld->lodf_bld;
223 const unsigned dims = bld->dims;
224 LLVMValueRef ddx_ddy[2];
225 LLVMBuilderRef builder = bld->gallivm->builder;
226 LLVMTypeRef i32t = LLVMInt32TypeInContext(bld->gallivm->context);
227 LLVMValueRef index0 = LLVMConstInt(i32t, 0, 0);
228 LLVMValueRef index1 = LLVMConstInt(i32t, 1, 0);
229 LLVMValueRef index2 = LLVMConstInt(i32t, 2, 0);
230 LLVMValueRef rho_vec;
231 LLVMValueRef int_size, float_size;
232 LLVMValueRef rho;
233 LLVMValueRef first_level, first_level_vec;
234 unsigned length = coord_bld->type.length;
235 unsigned num_quads = length / 4;
236 boolean rho_per_quad = rho_bld->type.length != length;
237 boolean no_rho_opt = (gallivm_debug & GALLIVM_DEBUG_NO_RHO_APPROX) && (dims > 1);
238 unsigned i;
239 LLVMValueRef i32undef = LLVMGetUndef(LLVMInt32TypeInContext(gallivm->context));
240 LLVMValueRef rho_xvec, rho_yvec;
241
242 /* Note that all simplified calculations will only work for isotropic filtering */
243
244 /*
245 * rho calcs are always per quad except for explicit derivs (excluding
246 * the messy cube maps for now) when requested.
247 */
248
249 first_level = bld->dynamic_state->first_level(bld->dynamic_state,
250 bld->gallivm, texture_unit);
251 first_level_vec = lp_build_broadcast_scalar(int_size_bld, first_level);
252 int_size = lp_build_minify(int_size_bld, bld->int_size, first_level_vec, TRUE);
253 float_size = lp_build_int_to_float(float_size_bld, int_size);
254
255 if (cube_rho) {
256 LLVMValueRef cubesize;
257 LLVMValueRef index0 = lp_build_const_int32(gallivm, 0);
258
259 /*
260 * Cube map code did already everything except size mul and per-quad extraction.
261 * Luckily cube maps are always quadratic!
262 */
263 if (rho_per_quad) {
264 rho = lp_build_pack_aos_scalars(bld->gallivm, coord_bld->type,
265 rho_bld->type, cube_rho, 0);
266 }
267 else {
268 rho = lp_build_swizzle_scalar_aos(coord_bld, cube_rho, 0, 4);
269 }
270 /* Could optimize this for single quad just skip the broadcast */
271 cubesize = lp_build_extract_broadcast(gallivm, bld->float_size_in_type,
272 rho_bld->type, float_size, index0);
273 /* skipping sqrt hence returning rho squared */
274 cubesize = lp_build_mul(rho_bld, cubesize, cubesize);
275 rho = lp_build_mul(rho_bld, cubesize, rho);
276 }
277 else if (derivs) {
278 LLVMValueRef ddmax[3], ddx[3], ddy[3];
279 for (i = 0; i < dims; i++) {
280 LLVMValueRef floatdim;
281 LLVMValueRef indexi = lp_build_const_int32(gallivm, i);
282
283 floatdim = lp_build_extract_broadcast(gallivm, bld->float_size_in_type,
284 coord_bld->type, float_size, indexi);
285
286 /*
287 * note that for rho_per_quad case could reduce math (at some shuffle
288 * cost), but for now use same code to per-pixel lod case.
289 */
290 if (no_rho_opt) {
291 ddx[i] = lp_build_mul(coord_bld, floatdim, derivs->ddx[i]);
292 ddy[i] = lp_build_mul(coord_bld, floatdim, derivs->ddy[i]);
293 ddx[i] = lp_build_mul(coord_bld, ddx[i], ddx[i]);
294 ddy[i] = lp_build_mul(coord_bld, ddy[i], ddy[i]);
295 }
296 else {
297 LLVMValueRef tmpx, tmpy;
298 tmpx = lp_build_abs(coord_bld, derivs->ddx[i]);
299 tmpy = lp_build_abs(coord_bld, derivs->ddy[i]);
300 ddmax[i] = lp_build_max(coord_bld, tmpx, tmpy);
301 ddmax[i] = lp_build_mul(coord_bld, floatdim, ddmax[i]);
302 }
303 }
304 if (no_rho_opt) {
305 rho_xvec = lp_build_add(coord_bld, ddx[0], ddx[1]);
306 rho_yvec = lp_build_add(coord_bld, ddy[0], ddy[1]);
307 if (dims > 2) {
308 rho_xvec = lp_build_add(coord_bld, rho_xvec, ddx[2]);
309 rho_yvec = lp_build_add(coord_bld, rho_yvec, ddy[2]);
310 }
311 rho = lp_build_max(coord_bld, rho_xvec, rho_yvec);
312 /* skipping sqrt hence returning rho squared */
313 }
314 else {
315 rho = ddmax[0];
316 if (dims > 1) {
317 rho = lp_build_max(coord_bld, rho, ddmax[1]);
318 if (dims > 2) {
319 rho = lp_build_max(coord_bld, rho, ddmax[2]);
320 }
321 }
322 }
323 if (rho_per_quad) {
324 /*
325 * rho_vec contains per-pixel rho, convert to scalar per quad.
326 */
327 rho = lp_build_pack_aos_scalars(bld->gallivm, coord_bld->type,
328 rho_bld->type, rho, 0);
329 }
330 }
331 else {
332 /*
333 * This looks all a bit complex, but it's not that bad
334 * (the shuffle code makes it look worse than it is).
335 * Still, might not be ideal for all cases.
336 */
337 static const unsigned char swizzle0[] = { /* no-op swizzle */
338 0, LP_BLD_SWIZZLE_DONTCARE,
339 LP_BLD_SWIZZLE_DONTCARE, LP_BLD_SWIZZLE_DONTCARE
340 };
341 static const unsigned char swizzle1[] = {
342 1, LP_BLD_SWIZZLE_DONTCARE,
343 LP_BLD_SWIZZLE_DONTCARE, LP_BLD_SWIZZLE_DONTCARE
344 };
345 static const unsigned char swizzle2[] = {
346 2, LP_BLD_SWIZZLE_DONTCARE,
347 LP_BLD_SWIZZLE_DONTCARE, LP_BLD_SWIZZLE_DONTCARE
348 };
349
350 if (dims < 2) {
351 ddx_ddy[0] = lp_build_packed_ddx_ddy_onecoord(coord_bld, s);
352 }
353 else if (dims >= 2) {
354 ddx_ddy[0] = lp_build_packed_ddx_ddy_twocoord(coord_bld, s, t);
355 if (dims > 2) {
356 ddx_ddy[1] = lp_build_packed_ddx_ddy_onecoord(coord_bld, r);
357 }
358 }
359
360 if (no_rho_opt) {
361 static const unsigned char swizzle01[] = { /* no-op swizzle */
362 0, 1,
363 LP_BLD_SWIZZLE_DONTCARE, LP_BLD_SWIZZLE_DONTCARE
364 };
365 static const unsigned char swizzle23[] = {
366 2, 3,
367 LP_BLD_SWIZZLE_DONTCARE, LP_BLD_SWIZZLE_DONTCARE
368 };
369 LLVMValueRef ddx_ddys, ddx_ddyt, floatdim, shuffles[LP_MAX_VECTOR_LENGTH / 4];
370
371 for (i = 0; i < num_quads; i++) {
372 shuffles[i*4+0] = shuffles[i*4+1] = index0;
373 shuffles[i*4+2] = shuffles[i*4+3] = index1;
374 }
375 floatdim = LLVMBuildShuffleVector(builder, float_size, float_size,
376 LLVMConstVector(shuffles, length), "");
377 ddx_ddy[0] = lp_build_mul(coord_bld, ddx_ddy[0], floatdim);
378 ddx_ddy[0] = lp_build_mul(coord_bld, ddx_ddy[0], ddx_ddy[0]);
379 ddx_ddys = lp_build_swizzle_aos(coord_bld, ddx_ddy[0], swizzle01);
380 ddx_ddyt = lp_build_swizzle_aos(coord_bld, ddx_ddy[0], swizzle23);
381 rho_vec = lp_build_add(coord_bld, ddx_ddys, ddx_ddyt);
382
383 if (dims > 2) {
384 static const unsigned char swizzle02[] = {
385 0, 2,
386 LP_BLD_SWIZZLE_DONTCARE, LP_BLD_SWIZZLE_DONTCARE
387 };
388 floatdim = lp_build_extract_broadcast(gallivm, bld->float_size_in_type,
389 coord_bld->type, float_size, index2);
390 ddx_ddy[1] = lp_build_mul(coord_bld, ddx_ddy[1], floatdim);
391 ddx_ddy[1] = lp_build_mul(coord_bld, ddx_ddy[1], ddx_ddy[1]);
392 ddx_ddy[1] = lp_build_swizzle_aos(coord_bld, ddx_ddy[1], swizzle02);
393 rho_vec = lp_build_add(coord_bld, rho_vec, ddx_ddy[1]);
394 }
395
396 rho_xvec = lp_build_swizzle_aos(coord_bld, rho_vec, swizzle0);
397 rho_yvec = lp_build_swizzle_aos(coord_bld, rho_vec, swizzle1);
398 rho = lp_build_max(coord_bld, rho_xvec, rho_yvec);
399
400 if (rho_per_quad) {
401 rho = lp_build_pack_aos_scalars(bld->gallivm, coord_bld->type,
402 rho_bld->type, rho, 0);
403 }
404 else {
405 rho = lp_build_swizzle_scalar_aos(coord_bld, rho, 0, 4);
406 }
407 /* skipping sqrt hence returning rho squared */
408 }
409 else {
410 ddx_ddy[0] = lp_build_abs(coord_bld, ddx_ddy[0]);
411 if (dims > 2) {
412 ddx_ddy[1] = lp_build_abs(coord_bld, ddx_ddy[1]);
413 }
414
415 if (dims < 2) {
416 rho_xvec = lp_build_swizzle_aos(coord_bld, ddx_ddy[0], swizzle0);
417 rho_yvec = lp_build_swizzle_aos(coord_bld, ddx_ddy[0], swizzle2);
418 }
419 else if (dims == 2) {
420 static const unsigned char swizzle02[] = {
421 0, 2,
422 LP_BLD_SWIZZLE_DONTCARE, LP_BLD_SWIZZLE_DONTCARE
423 };
424 static const unsigned char swizzle13[] = {
425 1, 3,
426 LP_BLD_SWIZZLE_DONTCARE, LP_BLD_SWIZZLE_DONTCARE
427 };
428 rho_xvec = lp_build_swizzle_aos(coord_bld, ddx_ddy[0], swizzle02);
429 rho_yvec = lp_build_swizzle_aos(coord_bld, ddx_ddy[0], swizzle13);
430 }
431 else {
432 LLVMValueRef shuffles1[LP_MAX_VECTOR_LENGTH];
433 LLVMValueRef shuffles2[LP_MAX_VECTOR_LENGTH];
434 assert(dims == 3);
435 for (i = 0; i < num_quads; i++) {
436 shuffles1[4*i + 0] = lp_build_const_int32(gallivm, 4*i);
437 shuffles1[4*i + 1] = lp_build_const_int32(gallivm, 4*i + 2);
438 shuffles1[4*i + 2] = lp_build_const_int32(gallivm, length + 4*i);
439 shuffles1[4*i + 3] = i32undef;
440 shuffles2[4*i + 0] = lp_build_const_int32(gallivm, 4*i + 1);
441 shuffles2[4*i + 1] = lp_build_const_int32(gallivm, 4*i + 3);
442 shuffles2[4*i + 2] = lp_build_const_int32(gallivm, length + 4*i + 2);
443 shuffles2[4*i + 3] = i32undef;
444 }
445 rho_xvec = LLVMBuildShuffleVector(builder, ddx_ddy[0], ddx_ddy[1],
446 LLVMConstVector(shuffles1, length), "");
447 rho_yvec = LLVMBuildShuffleVector(builder, ddx_ddy[0], ddx_ddy[1],
448 LLVMConstVector(shuffles2, length), "");
449 }
450
451 rho_vec = lp_build_max(coord_bld, rho_xvec, rho_yvec);
452
453 if (bld->coord_type.length > 4) {
454 /* expand size to each quad */
455 if (dims > 1) {
456 /* could use some broadcast_vector helper for this? */
457 LLVMValueRef src[LP_MAX_VECTOR_LENGTH/4];
458 for (i = 0; i < num_quads; i++) {
459 src[i] = float_size;
460 }
461 float_size = lp_build_concat(bld->gallivm, src, float_size_bld->type, num_quads);
462 }
463 else {
464 float_size = lp_build_broadcast_scalar(coord_bld, float_size);
465 }
466 rho_vec = lp_build_mul(coord_bld, rho_vec, float_size);
467
468 if (dims <= 1) {
469 rho = rho_vec;
470 }
471 else {
472 if (dims >= 2) {
473 LLVMValueRef rho_s, rho_t, rho_r;
474
475 rho_s = lp_build_swizzle_aos(coord_bld, rho_vec, swizzle0);
476 rho_t = lp_build_swizzle_aos(coord_bld, rho_vec, swizzle1);
477
478 rho = lp_build_max(coord_bld, rho_s, rho_t);
479
480 if (dims >= 3) {
481 rho_r = lp_build_swizzle_aos(coord_bld, rho_vec, swizzle2);
482 rho = lp_build_max(coord_bld, rho, rho_r);
483 }
484 }
485 }
486 if (rho_per_quad) {
487 rho = lp_build_pack_aos_scalars(bld->gallivm, coord_bld->type,
488 rho_bld->type, rho, 0);
489 }
490 else {
491 rho = lp_build_swizzle_scalar_aos(coord_bld, rho, 0, 4);
492 }
493 }
494 else {
495 if (dims <= 1) {
496 rho_vec = LLVMBuildExtractElement(builder, rho_vec, index0, "");
497 }
498 rho_vec = lp_build_mul(float_size_bld, rho_vec, float_size);
499
500 if (dims <= 1) {
501 rho = rho_vec;
502 }
503 else {
504 if (dims >= 2) {
505 LLVMValueRef rho_s, rho_t, rho_r;
506
507 rho_s = LLVMBuildExtractElement(builder, rho_vec, index0, "");
508 rho_t = LLVMBuildExtractElement(builder, rho_vec, index1, "");
509
510 rho = lp_build_max(float_bld, rho_s, rho_t);
511
512 if (dims >= 3) {
513 rho_r = LLVMBuildExtractElement(builder, rho_vec, index2, "");
514 rho = lp_build_max(float_bld, rho, rho_r);
515 }
516 }
517 }
518 if (!rho_per_quad) {
519 rho = lp_build_broadcast_scalar(rho_bld, rho);
520 }
521 }
522 }
523 }
524
525 return rho;
526 }
527
528
529 /*
530 * Bri-linear lod computation
531 *
532 * Use a piece-wise linear approximation of log2 such that:
533 * - round to nearest, for values in the neighborhood of -1, 0, 1, 2, etc.
534 * - linear approximation for values in the neighborhood of 0.5, 1.5., etc,
535 * with the steepness specified in 'factor'
536 * - exact result for 0.5, 1.5, etc.
537 *
538 *
539 * 1.0 - /----*
540 * /
541 * /
542 * /
543 * 0.5 - *
544 * /
545 * /
546 * /
547 * 0.0 - *----/
548 *
549 * | |
550 * 2^0 2^1
551 *
552 * This is a technique also commonly used in hardware:
553 * - http://ixbtlabs.com/articles2/gffx/nv40-rx800-3.html
554 *
555 * TODO: For correctness, this should only be applied when texture is known to
556 * have regular mipmaps, i.e., mipmaps derived from the base level.
557 *
558 * TODO: This could be done in fixed point, where applicable.
559 */
560 static void
561 lp_build_brilinear_lod(struct lp_build_context *bld,
562 LLVMValueRef lod,
563 double factor,
564 LLVMValueRef *out_lod_ipart,
565 LLVMValueRef *out_lod_fpart)
566 {
567 LLVMValueRef lod_fpart;
568 double pre_offset = (factor - 0.5)/factor - 0.5;
569 double post_offset = 1 - factor;
570
571 if (0) {
572 lp_build_printf(bld->gallivm, "lod = %f\n", lod);
573 }
574
575 lod = lp_build_add(bld, lod,
576 lp_build_const_vec(bld->gallivm, bld->type, pre_offset));
577
578 lp_build_ifloor_fract(bld, lod, out_lod_ipart, &lod_fpart);
579
580 lod_fpart = lp_build_mul(bld, lod_fpart,
581 lp_build_const_vec(bld->gallivm, bld->type, factor));
582
583 lod_fpart = lp_build_add(bld, lod_fpart,
584 lp_build_const_vec(bld->gallivm, bld->type, post_offset));
585
586 /*
587 * It's not necessary to clamp lod_fpart since:
588 * - the above expression will never produce numbers greater than one.
589 * - the mip filtering branch is only taken if lod_fpart is positive
590 */
591
592 *out_lod_fpart = lod_fpart;
593
594 if (0) {
595 lp_build_printf(bld->gallivm, "lod_ipart = %i\n", *out_lod_ipart);
596 lp_build_printf(bld->gallivm, "lod_fpart = %f\n\n", *out_lod_fpart);
597 }
598 }
599
600
601 /*
602 * Combined log2 and brilinear lod computation.
603 *
604 * It's in all identical to calling lp_build_fast_log2() and
605 * lp_build_brilinear_lod() above, but by combining we can compute the integer
606 * and fractional part independently.
607 */
608 static void
609 lp_build_brilinear_rho(struct lp_build_context *bld,
610 LLVMValueRef rho,
611 double factor,
612 LLVMValueRef *out_lod_ipart,
613 LLVMValueRef *out_lod_fpart)
614 {
615 LLVMValueRef lod_ipart;
616 LLVMValueRef lod_fpart;
617
618 const double pre_factor = (2*factor - 0.5)/(M_SQRT2*factor);
619 const double post_offset = 1 - 2*factor;
620
621 assert(bld->type.floating);
622
623 assert(lp_check_value(bld->type, rho));
624
625 /*
626 * The pre factor will make the intersections with the exact powers of two
627 * happen precisely where we want them to be, which means that the integer
628 * part will not need any post adjustments.
629 */
630 rho = lp_build_mul(bld, rho,
631 lp_build_const_vec(bld->gallivm, bld->type, pre_factor));
632
633 /* ipart = ifloor(log2(rho)) */
634 lod_ipart = lp_build_extract_exponent(bld, rho, 0);
635
636 /* fpart = rho / 2**ipart */
637 lod_fpart = lp_build_extract_mantissa(bld, rho);
638
639 lod_fpart = lp_build_mul(bld, lod_fpart,
640 lp_build_const_vec(bld->gallivm, bld->type, factor));
641
642 lod_fpart = lp_build_add(bld, lod_fpart,
643 lp_build_const_vec(bld->gallivm, bld->type, post_offset));
644
645 /*
646 * Like lp_build_brilinear_lod, it's not necessary to clamp lod_fpart since:
647 * - the above expression will never produce numbers greater than one.
648 * - the mip filtering branch is only taken if lod_fpart is positive
649 */
650
651 *out_lod_ipart = lod_ipart;
652 *out_lod_fpart = lod_fpart;
653 }
654
655
656 /**
657 * Fast implementation of iround(log2(sqrt(x))), based on
658 * log2(x^n) == n*log2(x).
659 *
660 * Gives accurate results all the time.
661 * (Could be trivially extended to handle other power-of-two roots.)
662 */
663 static LLVMValueRef
664 lp_build_ilog2_sqrt(struct lp_build_context *bld,
665 LLVMValueRef x)
666 {
667 LLVMBuilderRef builder = bld->gallivm->builder;
668 LLVMValueRef ipart;
669 struct lp_type i_type = lp_int_type(bld->type);
670 LLVMValueRef one = lp_build_const_int_vec(bld->gallivm, i_type, 1);
671
672 assert(bld->type.floating);
673
674 assert(lp_check_value(bld->type, x));
675
676 /* ipart = log2(x) + 0.5 = 0.5*(log2(x^2) + 1.0) */
677 ipart = lp_build_extract_exponent(bld, x, 1);
678 ipart = LLVMBuildAShr(builder, ipart, one, "");
679
680 return ipart;
681 }
682
683
684 /**
685 * Generate code to compute texture level of detail (lambda).
686 * \param derivs partial derivatives of (s, t, r, q) with respect to X and Y
687 * \param lod_bias optional float vector with the shader lod bias
688 * \param explicit_lod optional float vector with the explicit lod
689 * \param cube_rho rho calculated by cube coord mapping (optional)
690 * \param out_lod_ipart integer part of lod
691 * \param out_lod_fpart float part of lod (never larger than 1 but may be negative)
692 * \param out_lod_positive (mask) if lod is positive (i.e. texture is minified)
693 *
694 * The resulting lod can be scalar per quad or be per element.
695 */
696 void
697 lp_build_lod_selector(struct lp_build_sample_context *bld,
698 unsigned texture_unit,
699 unsigned sampler_unit,
700 LLVMValueRef s,
701 LLVMValueRef t,
702 LLVMValueRef r,
703 LLVMValueRef cube_rho,
704 const struct lp_derivatives *derivs,
705 LLVMValueRef lod_bias, /* optional */
706 LLVMValueRef explicit_lod, /* optional */
707 unsigned mip_filter,
708 LLVMValueRef *out_lod_ipart,
709 LLVMValueRef *out_lod_fpart,
710 LLVMValueRef *out_lod_positive)
711
712 {
713 LLVMBuilderRef builder = bld->gallivm->builder;
714 struct lp_build_context *lodf_bld = &bld->lodf_bld;
715 LLVMValueRef lod;
716
717 *out_lod_ipart = bld->lodi_bld.zero;
718 *out_lod_positive = bld->lodi_bld.zero;
719 *out_lod_fpart = lodf_bld->zero;
720
721 /*
722 * For determining min/mag, we follow GL 4.1 spec, 3.9.12 Texture Magnification:
723 * "Implementations may either unconditionally assume c = 0 for the minification
724 * vs. magnification switch-over point, or may choose to make c depend on the
725 * combination of minification and magnification modes as follows: if the
726 * magnification filter is given by LINEAR and the minification filter is given
727 * by NEAREST_MIPMAP_NEAREST or NEAREST_MIPMAP_LINEAR, then c = 0.5. This is
728 * done to ensure that a minified texture does not appear "sharper" than a
729 * magnified texture. Otherwise c = 0."
730 * And 3.9.11 Texture Minification:
731 * "If lod is less than or equal to the constant c (see section 3.9.12) the
732 * texture is said to be magnified; if it is greater, the texture is minified."
733 * So, using 0 as switchover point always, and using magnification for lod == 0.
734 * Note that the always c = 0 behavior is new (first appearing in GL 3.1 spec),
735 * old GL versions required 0.5 for the modes listed above.
736 * I have no clue about the (undocumented) wishes of d3d9/d3d10 here!
737 */
738
739 if (bld->static_sampler_state->min_max_lod_equal) {
740 /* User is forcing sampling from a particular mipmap level.
741 * This is hit during mipmap generation.
742 */
743 LLVMValueRef min_lod =
744 bld->dynamic_state->min_lod(bld->dynamic_state,
745 bld->gallivm, sampler_unit);
746
747 lod = lp_build_broadcast_scalar(lodf_bld, min_lod);
748 }
749 else {
750 if (explicit_lod) {
751 if (bld->num_lods != bld->coord_type.length)
752 lod = lp_build_pack_aos_scalars(bld->gallivm, bld->coord_bld.type,
753 lodf_bld->type, explicit_lod, 0);
754 else
755 lod = explicit_lod;
756 }
757 else {
758 LLVMValueRef rho;
759 boolean rho_squared = ((gallivm_debug & GALLIVM_DEBUG_NO_RHO_APPROX) &&
760 (bld->dims > 1)) || cube_rho;
761
762 rho = lp_build_rho(bld, texture_unit, s, t, r, cube_rho, derivs);
763
764 /*
765 * Compute lod = log2(rho)
766 */
767
768 if (!lod_bias &&
769 !bld->static_sampler_state->lod_bias_non_zero &&
770 !bld->static_sampler_state->apply_max_lod &&
771 !bld->static_sampler_state->apply_min_lod) {
772 /*
773 * Special case when there are no post-log2 adjustments, which
774 * saves instructions but keeping the integer and fractional lod
775 * computations separate from the start.
776 */
777
778 if (mip_filter == PIPE_TEX_MIPFILTER_NONE ||
779 mip_filter == PIPE_TEX_MIPFILTER_NEAREST) {
780 /*
781 * Don't actually need both values all the time, lod_ipart is
782 * needed for nearest mipfilter, lod_positive if min != mag.
783 */
784 if (rho_squared) {
785 *out_lod_ipart = lp_build_ilog2_sqrt(lodf_bld, rho);
786 }
787 else {
788 *out_lod_ipart = lp_build_ilog2(lodf_bld, rho);
789 }
790 *out_lod_positive = lp_build_cmp(lodf_bld, PIPE_FUNC_GREATER,
791 rho, lodf_bld->one);
792 return;
793 }
794 if (mip_filter == PIPE_TEX_MIPFILTER_LINEAR &&
795 !(gallivm_debug & GALLIVM_DEBUG_NO_BRILINEAR) &&
796 !rho_squared) {
797 /*
798 * This can't work if rho is squared. Not sure if it could be
799 * fixed while keeping it worthwile, could also do sqrt here
800 * but brilinear and no_rho_opt seems like a combination not
801 * making much sense anyway so just use ordinary path below.
802 */
803 lp_build_brilinear_rho(lodf_bld, rho, BRILINEAR_FACTOR,
804 out_lod_ipart, out_lod_fpart);
805 *out_lod_positive = lp_build_cmp(lodf_bld, PIPE_FUNC_GREATER,
806 rho, lodf_bld->one);
807 return;
808 }
809 }
810
811 if (0) {
812 lod = lp_build_log2(lodf_bld, rho);
813 }
814 else {
815 lod = lp_build_fast_log2(lodf_bld, rho);
816 }
817 if (rho_squared) {
818 /* log2(x^2) == 0.5*log2(x) */
819 lod = lp_build_mul(lodf_bld, lod,
820 lp_build_const_vec(bld->gallivm, lodf_bld->type, 0.5F));
821 }
822
823 /* add shader lod bias */
824 if (lod_bias) {
825 if (bld->num_lods != bld->coord_type.length)
826 lod_bias = lp_build_pack_aos_scalars(bld->gallivm, bld->coord_bld.type,
827 lodf_bld->type, lod_bias, 0);
828 lod = LLVMBuildFAdd(builder, lod, lod_bias, "shader_lod_bias");
829 }
830 }
831
832 /* add sampler lod bias */
833 if (bld->static_sampler_state->lod_bias_non_zero) {
834 LLVMValueRef sampler_lod_bias =
835 bld->dynamic_state->lod_bias(bld->dynamic_state,
836 bld->gallivm, sampler_unit);
837 sampler_lod_bias = lp_build_broadcast_scalar(lodf_bld,
838 sampler_lod_bias);
839 lod = LLVMBuildFAdd(builder, lod, sampler_lod_bias, "sampler_lod_bias");
840 }
841
842 /* clamp lod */
843 if (bld->static_sampler_state->apply_max_lod) {
844 LLVMValueRef max_lod =
845 bld->dynamic_state->max_lod(bld->dynamic_state,
846 bld->gallivm, sampler_unit);
847 max_lod = lp_build_broadcast_scalar(lodf_bld, max_lod);
848
849 lod = lp_build_min(lodf_bld, lod, max_lod);
850 }
851 if (bld->static_sampler_state->apply_min_lod) {
852 LLVMValueRef min_lod =
853 bld->dynamic_state->min_lod(bld->dynamic_state,
854 bld->gallivm, sampler_unit);
855 min_lod = lp_build_broadcast_scalar(lodf_bld, min_lod);
856
857 lod = lp_build_max(lodf_bld, lod, min_lod);
858 }
859 }
860
861 *out_lod_positive = lp_build_cmp(lodf_bld, PIPE_FUNC_GREATER,
862 lod, lodf_bld->zero);
863
864 if (mip_filter == PIPE_TEX_MIPFILTER_LINEAR) {
865 if (!(gallivm_debug & GALLIVM_DEBUG_NO_BRILINEAR)) {
866 lp_build_brilinear_lod(lodf_bld, lod, BRILINEAR_FACTOR,
867 out_lod_ipart, out_lod_fpart);
868 }
869 else {
870 lp_build_ifloor_fract(lodf_bld, lod, out_lod_ipart, out_lod_fpart);
871 }
872
873 lp_build_name(*out_lod_fpart, "lod_fpart");
874 }
875 else {
876 *out_lod_ipart = lp_build_iround(lodf_bld, lod);
877 }
878
879 lp_build_name(*out_lod_ipart, "lod_ipart");
880
881 return;
882 }
883
884
885 /**
886 * For PIPE_TEX_MIPFILTER_NEAREST, convert int part of lod
887 * to actual mip level.
888 * Note: this is all scalar per quad code.
889 * \param lod_ipart int texture level of detail
890 * \param level_out returns integer
891 * \param out_of_bounds returns per coord out_of_bounds mask if provided
892 */
893 void
894 lp_build_nearest_mip_level(struct lp_build_sample_context *bld,
895 unsigned texture_unit,
896 LLVMValueRef lod_ipart,
897 LLVMValueRef *level_out,
898 LLVMValueRef *out_of_bounds)
899 {
900 struct lp_build_context *leveli_bld = &bld->leveli_bld;
901 LLVMValueRef first_level, last_level, level;
902
903 first_level = bld->dynamic_state->first_level(bld->dynamic_state,
904 bld->gallivm, texture_unit);
905 last_level = bld->dynamic_state->last_level(bld->dynamic_state,
906 bld->gallivm, texture_unit);
907 first_level = lp_build_broadcast_scalar(leveli_bld, first_level);
908 last_level = lp_build_broadcast_scalar(leveli_bld, last_level);
909
910 level = lp_build_add(leveli_bld, lod_ipart, first_level);
911
912 if (out_of_bounds) {
913 LLVMValueRef out, out1;
914 out = lp_build_cmp(leveli_bld, PIPE_FUNC_LESS, level, first_level);
915 out1 = lp_build_cmp(leveli_bld, PIPE_FUNC_GREATER, level, last_level);
916 out = lp_build_or(leveli_bld, out, out1);
917 if (bld->num_mips == bld->coord_bld.type.length) {
918 *out_of_bounds = out;
919 }
920 else if (bld->num_mips == 1) {
921 *out_of_bounds = lp_build_broadcast_scalar(&bld->int_coord_bld, out);
922 }
923 else {
924 assert(bld->num_mips == bld->coord_bld.type.length / 4);
925 *out_of_bounds = lp_build_unpack_broadcast_aos_scalars(bld->gallivm,
926 leveli_bld->type,
927 bld->int_coord_bld.type,
928 out);
929 }
930 level = lp_build_andnot(&bld->int_coord_bld, level, *out_of_bounds);
931 *level_out = level;
932 }
933 else {
934 /* clamp level to legal range of levels */
935 *level_out = lp_build_clamp(leveli_bld, level, first_level, last_level);
936
937 }
938 }
939
940
941 /**
942 * For PIPE_TEX_MIPFILTER_LINEAR, convert per-quad (or per element) int LOD(s)
943 * to two (per-quad) (adjacent) mipmap level indexes, and fix up float lod
944 * part accordingly.
945 * Later, we'll sample from those two mipmap levels and interpolate between them.
946 */
947 void
948 lp_build_linear_mip_levels(struct lp_build_sample_context *bld,
949 unsigned texture_unit,
950 LLVMValueRef lod_ipart,
951 LLVMValueRef *lod_fpart_inout,
952 LLVMValueRef *level0_out,
953 LLVMValueRef *level1_out)
954 {
955 LLVMBuilderRef builder = bld->gallivm->builder;
956 struct lp_build_context *leveli_bld = &bld->leveli_bld;
957 struct lp_build_context *levelf_bld = &bld->levelf_bld;
958 LLVMValueRef first_level, last_level;
959 LLVMValueRef clamp_min;
960 LLVMValueRef clamp_max;
961
962 assert(bld->num_lods == bld->num_mips);
963
964 first_level = bld->dynamic_state->first_level(bld->dynamic_state,
965 bld->gallivm, texture_unit);
966 last_level = bld->dynamic_state->last_level(bld->dynamic_state,
967 bld->gallivm, texture_unit);
968 first_level = lp_build_broadcast_scalar(leveli_bld, first_level);
969 last_level = lp_build_broadcast_scalar(leveli_bld, last_level);
970
971 *level0_out = lp_build_add(leveli_bld, lod_ipart, first_level);
972 *level1_out = lp_build_add(leveli_bld, *level0_out, leveli_bld->one);
973
974 /*
975 * Clamp both *level0_out and *level1_out to [first_level, last_level], with
976 * the minimum number of comparisons, and zeroing lod_fpart in the extreme
977 * ends in the process.
978 */
979
980 /* *level0_out < first_level */
981 clamp_min = LLVMBuildICmp(builder, LLVMIntSLT,
982 *level0_out, first_level,
983 "clamp_lod_to_first");
984
985 *level0_out = LLVMBuildSelect(builder, clamp_min,
986 first_level, *level0_out, "");
987
988 *level1_out = LLVMBuildSelect(builder, clamp_min,
989 first_level, *level1_out, "");
990
991 *lod_fpart_inout = LLVMBuildSelect(builder, clamp_min,
992 levelf_bld->zero, *lod_fpart_inout, "");
993
994 /* *level0_out >= last_level */
995 clamp_max = LLVMBuildICmp(builder, LLVMIntSGE,
996 *level0_out, last_level,
997 "clamp_lod_to_last");
998
999 *level0_out = LLVMBuildSelect(builder, clamp_max,
1000 last_level, *level0_out, "");
1001
1002 *level1_out = LLVMBuildSelect(builder, clamp_max,
1003 last_level, *level1_out, "");
1004
1005 *lod_fpart_inout = LLVMBuildSelect(builder, clamp_max,
1006 levelf_bld->zero, *lod_fpart_inout, "");
1007
1008 lp_build_name(*level0_out, "texture%u_miplevel0", texture_unit);
1009 lp_build_name(*level1_out, "texture%u_miplevel1", texture_unit);
1010 lp_build_name(*lod_fpart_inout, "texture%u_mipweight", texture_unit);
1011 }
1012
1013
1014 /**
1015 * Return pointer to a single mipmap level.
1016 * \param level integer mipmap level
1017 */
1018 LLVMValueRef
1019 lp_build_get_mipmap_level(struct lp_build_sample_context *bld,
1020 LLVMValueRef level)
1021 {
1022 LLVMBuilderRef builder = bld->gallivm->builder;
1023 LLVMValueRef indexes[2], data_ptr, mip_offset;
1024
1025 indexes[0] = lp_build_const_int32(bld->gallivm, 0);
1026 indexes[1] = level;
1027 mip_offset = LLVMBuildGEP(builder, bld->mip_offsets, indexes, 2, "");
1028 mip_offset = LLVMBuildLoad(builder, mip_offset, "");
1029 data_ptr = LLVMBuildGEP(builder, bld->base_ptr, &mip_offset, 1, "");
1030 return data_ptr;
1031 }
1032
1033 /**
1034 * Return (per-pixel) offsets to mip levels.
1035 * \param level integer mipmap level
1036 */
1037 LLVMValueRef
1038 lp_build_get_mip_offsets(struct lp_build_sample_context *bld,
1039 LLVMValueRef level)
1040 {
1041 LLVMBuilderRef builder = bld->gallivm->builder;
1042 LLVMValueRef indexes[2], offsets, offset1;
1043
1044 indexes[0] = lp_build_const_int32(bld->gallivm, 0);
1045 if (bld->num_mips == 1) {
1046 indexes[1] = level;
1047 offset1 = LLVMBuildGEP(builder, bld->mip_offsets, indexes, 2, "");
1048 offset1 = LLVMBuildLoad(builder, offset1, "");
1049 offsets = lp_build_broadcast_scalar(&bld->int_coord_bld, offset1);
1050 }
1051 else if (bld->num_mips == bld->coord_bld.type.length / 4) {
1052 unsigned i;
1053
1054 offsets = bld->int_coord_bld.undef;
1055 for (i = 0; i < bld->num_mips; i++) {
1056 LLVMValueRef indexi = lp_build_const_int32(bld->gallivm, i);
1057 LLVMValueRef indexo = lp_build_const_int32(bld->gallivm, 4 * i);
1058 indexes[1] = LLVMBuildExtractElement(builder, level, indexi, "");
1059 offset1 = LLVMBuildGEP(builder, bld->mip_offsets, indexes, 2, "");
1060 offset1 = LLVMBuildLoad(builder, offset1, "");
1061 offsets = LLVMBuildInsertElement(builder, offsets, offset1, indexo, "");
1062 }
1063 offsets = lp_build_swizzle_scalar_aos(&bld->int_coord_bld, offsets, 0, 4);
1064 }
1065 else {
1066 unsigned i;
1067
1068 assert (bld->num_mips == bld->coord_bld.type.length);
1069
1070 offsets = bld->int_coord_bld.undef;
1071 for (i = 0; i < bld->num_mips; i++) {
1072 LLVMValueRef indexi = lp_build_const_int32(bld->gallivm, i);
1073 indexes[1] = LLVMBuildExtractElement(builder, level, indexi, "");
1074 offset1 = LLVMBuildGEP(builder, bld->mip_offsets, indexes, 2, "");
1075 offset1 = LLVMBuildLoad(builder, offset1, "");
1076 offsets = LLVMBuildInsertElement(builder, offsets, offset1, indexi, "");
1077 }
1078 }
1079 return offsets;
1080 }
1081
1082
1083 /**
1084 * Codegen equivalent for u_minify().
1085 * @param lod_scalar if lod is a (broadcasted) scalar
1086 * Return max(1, base_size >> level);
1087 */
1088 LLVMValueRef
1089 lp_build_minify(struct lp_build_context *bld,
1090 LLVMValueRef base_size,
1091 LLVMValueRef level,
1092 boolean lod_scalar)
1093 {
1094 LLVMBuilderRef builder = bld->gallivm->builder;
1095 assert(lp_check_value(bld->type, base_size));
1096 assert(lp_check_value(bld->type, level));
1097
1098 if (level == bld->zero) {
1099 /* if we're using mipmap level zero, no minification is needed */
1100 return base_size;
1101 }
1102 else {
1103 LLVMValueRef size;
1104 assert(bld->type.sign);
1105 if (lod_scalar ||
1106 (util_cpu_caps.has_avx2 || !util_cpu_caps.has_sse)) {
1107 size = LLVMBuildLShr(builder, base_size, level, "minify");
1108 size = lp_build_max(bld, size, bld->one);
1109 }
1110 else {
1111 /*
1112 * emulate shift with float mul, since intel "forgot" shifts with
1113 * per-element shift count until avx2, which results in terrible
1114 * scalar extraction (both count and value), scalar shift,
1115 * vector reinsertion. Should not be an issue on any non-x86 cpu
1116 * with a vector instruction set.
1117 * On cpus with AMD's XOP this should also be unnecessary but I'm
1118 * not sure if llvm would emit this with current flags.
1119 */
1120 LLVMValueRef const127, const23, lf;
1121 struct lp_type ftype;
1122 struct lp_build_context fbld;
1123 ftype = lp_type_float_vec(32, bld->type.length * bld->type.width);
1124 lp_build_context_init(&fbld, bld->gallivm, ftype);
1125 const127 = lp_build_const_int_vec(bld->gallivm, bld->type, 127);
1126 const23 = lp_build_const_int_vec(bld->gallivm, bld->type, 23);
1127
1128 /* calculate 2^(-level) float */
1129 lf = lp_build_sub(bld, const127, level);
1130 lf = lp_build_shl(bld, lf, const23);
1131 lf = LLVMBuildBitCast(builder, lf, fbld.vec_type, "");
1132
1133 /* finish shift operation by doing float mul */
1134 base_size = lp_build_int_to_float(&fbld, base_size);
1135 size = lp_build_mul(&fbld, base_size, lf);
1136 /*
1137 * do the max also with floats because
1138 * a) non-emulated int max requires sse41
1139 * (this is actually a lie as we could cast to 16bit values
1140 * as 16bit is sufficient and 16bit int max is sse2)
1141 * b) with avx we can do int max 4-wide but float max 8-wide
1142 */
1143 size = lp_build_max(&fbld, size, fbld.one);
1144 size = lp_build_itrunc(&fbld, size);
1145 }
1146 return size;
1147 }
1148 }
1149
1150
1151 /**
1152 * Dereference stride_array[mipmap_level] array to get a stride.
1153 * Return stride as a vector.
1154 */
1155 static LLVMValueRef
1156 lp_build_get_level_stride_vec(struct lp_build_sample_context *bld,
1157 LLVMValueRef stride_array, LLVMValueRef level)
1158 {
1159 LLVMBuilderRef builder = bld->gallivm->builder;
1160 LLVMValueRef indexes[2], stride, stride1;
1161 indexes[0] = lp_build_const_int32(bld->gallivm, 0);
1162 if (bld->num_mips == 1) {
1163 indexes[1] = level;
1164 stride1 = LLVMBuildGEP(builder, stride_array, indexes, 2, "");
1165 stride1 = LLVMBuildLoad(builder, stride1, "");
1166 stride = lp_build_broadcast_scalar(&bld->int_coord_bld, stride1);
1167 }
1168 else if (bld->num_mips == bld->coord_bld.type.length / 4) {
1169 LLVMValueRef stride1;
1170 unsigned i;
1171
1172 stride = bld->int_coord_bld.undef;
1173 for (i = 0; i < bld->num_mips; i++) {
1174 LLVMValueRef indexi = lp_build_const_int32(bld->gallivm, i);
1175 LLVMValueRef indexo = lp_build_const_int32(bld->gallivm, 4 * i);
1176 indexes[1] = LLVMBuildExtractElement(builder, level, indexi, "");
1177 stride1 = LLVMBuildGEP(builder, stride_array, indexes, 2, "");
1178 stride1 = LLVMBuildLoad(builder, stride1, "");
1179 stride = LLVMBuildInsertElement(builder, stride, stride1, indexo, "");
1180 }
1181 stride = lp_build_swizzle_scalar_aos(&bld->int_coord_bld, stride, 0, 4);
1182 }
1183 else {
1184 LLVMValueRef stride1;
1185 unsigned i;
1186
1187 assert (bld->num_mips == bld->coord_bld.type.length);
1188
1189 stride = bld->int_coord_bld.undef;
1190 for (i = 0; i < bld->coord_bld.type.length; i++) {
1191 LLVMValueRef indexi = lp_build_const_int32(bld->gallivm, i);
1192 indexes[1] = LLVMBuildExtractElement(builder, level, indexi, "");
1193 stride1 = LLVMBuildGEP(builder, stride_array, indexes, 2, "");
1194 stride1 = LLVMBuildLoad(builder, stride1, "");
1195 stride = LLVMBuildInsertElement(builder, stride, stride1, indexi, "");
1196 }
1197 }
1198 return stride;
1199 }
1200
1201
1202 /**
1203 * When sampling a mipmap, we need to compute the width, height, depth
1204 * of the source levels from the level indexes. This helper function
1205 * does that.
1206 */
1207 void
1208 lp_build_mipmap_level_sizes(struct lp_build_sample_context *bld,
1209 LLVMValueRef ilevel,
1210 LLVMValueRef *out_size,
1211 LLVMValueRef *row_stride_vec,
1212 LLVMValueRef *img_stride_vec)
1213 {
1214 const unsigned dims = bld->dims;
1215 LLVMValueRef ilevel_vec;
1216
1217 /*
1218 * Compute width, height, depth at mipmap level 'ilevel'
1219 */
1220 if (bld->num_mips == 1) {
1221 ilevel_vec = lp_build_broadcast_scalar(&bld->int_size_bld, ilevel);
1222 *out_size = lp_build_minify(&bld->int_size_bld, bld->int_size, ilevel_vec, TRUE);
1223 }
1224 else {
1225 LLVMValueRef int_size_vec;
1226 LLVMValueRef tmp[LP_MAX_VECTOR_LENGTH];
1227 unsigned num_quads = bld->coord_bld.type.length / 4;
1228 unsigned i;
1229
1230 if (bld->num_mips == num_quads) {
1231 /*
1232 * XXX: this should be #ifndef SANE_INSTRUCTION_SET.
1233 * intel "forgot" the variable shift count instruction until avx2.
1234 * A harmless 8x32 shift gets translated into 32 instructions
1235 * (16 extracts, 8 scalar shifts, 8 inserts), llvm is apparently
1236 * unable to recognize if there are really just 2 different shift
1237 * count values. So do the shift 4-wide before expansion.
1238 */
1239 struct lp_build_context bld4;
1240 struct lp_type type4;
1241
1242 type4 = bld->int_coord_bld.type;
1243 type4.length = 4;
1244
1245 lp_build_context_init(&bld4, bld->gallivm, type4);
1246
1247 if (bld->dims == 1) {
1248 assert(bld->int_size_in_bld.type.length == 1);
1249 int_size_vec = lp_build_broadcast_scalar(&bld4,
1250 bld->int_size);
1251 }
1252 else {
1253 assert(bld->int_size_in_bld.type.length == 4);
1254 int_size_vec = bld->int_size;
1255 }
1256
1257 for (i = 0; i < num_quads; i++) {
1258 LLVMValueRef ileveli;
1259 LLVMValueRef indexi = lp_build_const_int32(bld->gallivm, i);
1260
1261 ileveli = lp_build_extract_broadcast(bld->gallivm,
1262 bld->leveli_bld.type,
1263 bld4.type,
1264 ilevel,
1265 indexi);
1266 tmp[i] = lp_build_minify(&bld4, int_size_vec, ileveli, TRUE);
1267 }
1268 /*
1269 * out_size is [w0, h0, d0, _, w1, h1, d1, _, ...] vector for dims > 1,
1270 * [w0, w0, w0, w0, w1, w1, w1, w1, ...] otherwise.
1271 */
1272 *out_size = lp_build_concat(bld->gallivm,
1273 tmp,
1274 bld4.type,
1275 num_quads);
1276 }
1277 else {
1278 /* FIXME: this is terrible and results in _huge_ vector
1279 * (for the dims > 1 case).
1280 * Should refactor this (together with extract_image_sizes) and do
1281 * something more useful. Could for instance if we have width,height
1282 * with 4-wide vector pack all elements into a 8xi16 vector
1283 * (on which we can still do useful math) instead of using a 16xi32
1284 * vector.
1285 * For dims == 1 this will create [w0, w1, w2, w3, ...] vector.
1286 * For dims > 1 this will create [w0, h0, d0, _, w1, h1, d1, _, ...] vector.
1287 */
1288 assert(bld->num_mips == bld->coord_bld.type.length);
1289 if (bld->dims == 1) {
1290 assert(bld->int_size_in_bld.type.length == 1);
1291 int_size_vec = lp_build_broadcast_scalar(&bld->int_coord_bld,
1292 bld->int_size);
1293 *out_size = lp_build_minify(&bld->int_coord_bld, int_size_vec, ilevel, FALSE);
1294 }
1295 else {
1296 LLVMValueRef ilevel1;
1297 for (i = 0; i < bld->num_mips; i++) {
1298 LLVMValueRef indexi = lp_build_const_int32(bld->gallivm, i);
1299 ilevel1 = lp_build_extract_broadcast(bld->gallivm, bld->int_coord_type,
1300 bld->int_size_in_bld.type, ilevel, indexi);
1301 tmp[i] = bld->int_size;
1302 tmp[i] = lp_build_minify(&bld->int_size_in_bld, tmp[i], ilevel1, TRUE);
1303 }
1304 *out_size = lp_build_concat(bld->gallivm, tmp,
1305 bld->int_size_in_bld.type,
1306 bld->num_mips);
1307 }
1308 }
1309 }
1310
1311 if (dims >= 2) {
1312 *row_stride_vec = lp_build_get_level_stride_vec(bld,
1313 bld->row_stride_array,
1314 ilevel);
1315 }
1316 if (dims == 3 || has_layer_coord(bld->static_texture_state->target)) {
1317 *img_stride_vec = lp_build_get_level_stride_vec(bld,
1318 bld->img_stride_array,
1319 ilevel);
1320 }
1321 }
1322
1323
1324 /**
1325 * Extract and broadcast texture size.
1326 *
1327 * @param size_type type of the texture size vector (either
1328 * bld->int_size_type or bld->float_size_type)
1329 * @param coord_type type of the texture size vector (either
1330 * bld->int_coord_type or bld->coord_type)
1331 * @param size vector with the texture size (width, height, depth)
1332 */
1333 void
1334 lp_build_extract_image_sizes(struct lp_build_sample_context *bld,
1335 struct lp_build_context *size_bld,
1336 struct lp_type coord_type,
1337 LLVMValueRef size,
1338 LLVMValueRef *out_width,
1339 LLVMValueRef *out_height,
1340 LLVMValueRef *out_depth)
1341 {
1342 const unsigned dims = bld->dims;
1343 LLVMTypeRef i32t = LLVMInt32TypeInContext(bld->gallivm->context);
1344 struct lp_type size_type = size_bld->type;
1345
1346 if (bld->num_mips == 1) {
1347 *out_width = lp_build_extract_broadcast(bld->gallivm,
1348 size_type,
1349 coord_type,
1350 size,
1351 LLVMConstInt(i32t, 0, 0));
1352 if (dims >= 2) {
1353 *out_height = lp_build_extract_broadcast(bld->gallivm,
1354 size_type,
1355 coord_type,
1356 size,
1357 LLVMConstInt(i32t, 1, 0));
1358 if (dims == 3) {
1359 *out_depth = lp_build_extract_broadcast(bld->gallivm,
1360 size_type,
1361 coord_type,
1362 size,
1363 LLVMConstInt(i32t, 2, 0));
1364 }
1365 }
1366 }
1367 else {
1368 unsigned num_quads = bld->coord_bld.type.length / 4;
1369
1370 if (dims == 1) {
1371 *out_width = size;
1372 }
1373 else if (bld->num_mips == num_quads) {
1374 *out_width = lp_build_swizzle_scalar_aos(size_bld, size, 0, 4);
1375 if (dims >= 2) {
1376 *out_height = lp_build_swizzle_scalar_aos(size_bld, size, 1, 4);
1377 if (dims == 3) {
1378 *out_depth = lp_build_swizzle_scalar_aos(size_bld, size, 2, 4);
1379 }
1380 }
1381 }
1382 else {
1383 assert(bld->num_mips == bld->coord_type.length);
1384 *out_width = lp_build_pack_aos_scalars(bld->gallivm, size_type,
1385 coord_type, size, 0);
1386 if (dims >= 2) {
1387 *out_height = lp_build_pack_aos_scalars(bld->gallivm, size_type,
1388 coord_type, size, 1);
1389 if (dims == 3) {
1390 *out_depth = lp_build_pack_aos_scalars(bld->gallivm, size_type,
1391 coord_type, size, 2);
1392 }
1393 }
1394 }
1395 }
1396 }
1397
1398
1399 /**
1400 * Unnormalize coords.
1401 *
1402 * @param flt_size vector with the integer texture size (width, height, depth)
1403 */
1404 void
1405 lp_build_unnormalized_coords(struct lp_build_sample_context *bld,
1406 LLVMValueRef flt_size,
1407 LLVMValueRef *s,
1408 LLVMValueRef *t,
1409 LLVMValueRef *r)
1410 {
1411 const unsigned dims = bld->dims;
1412 LLVMValueRef width;
1413 LLVMValueRef height;
1414 LLVMValueRef depth;
1415
1416 lp_build_extract_image_sizes(bld,
1417 &bld->float_size_bld,
1418 bld->coord_type,
1419 flt_size,
1420 &width,
1421 &height,
1422 &depth);
1423
1424 /* s = s * width, t = t * height */
1425 *s = lp_build_mul(&bld->coord_bld, *s, width);
1426 if (dims >= 2) {
1427 *t = lp_build_mul(&bld->coord_bld, *t, height);
1428 if (dims >= 3) {
1429 *r = lp_build_mul(&bld->coord_bld, *r, depth);
1430 }
1431 }
1432 }
1433
1434 /**
1435 * Generate new coords and faces for cubemap texels falling off the face.
1436 *
1437 * @param face face (center) of the pixel
1438 * @param x0 lower x coord
1439 * @param x1 higher x coord (must be x0 + 1)
1440 * @param y0 lower y coord
1441 * @param y1 higher y coord (must be x0 + 1)
1442 * @param max_coord texture cube (level) size - 1
1443 * @param next_faces new face values when falling off
1444 * @param next_xcoords new x coord values when falling off
1445 * @param next_ycoords new y coord values when falling off
1446 *
1447 * The arrays hold the new values when under/overflow of
1448 * lower x, higher x, lower y, higher y coord would occur (in this order).
1449 * next_xcoords/next_ycoords have two entries each (for both new lower and
1450 * higher coord).
1451 */
1452 void
1453 lp_build_cube_new_coords(struct lp_build_context *ivec_bld,
1454 LLVMValueRef face,
1455 LLVMValueRef x0,
1456 LLVMValueRef x1,
1457 LLVMValueRef y0,
1458 LLVMValueRef y1,
1459 LLVMValueRef max_coord,
1460 LLVMValueRef next_faces[4],
1461 LLVMValueRef next_xcoords[4][2],
1462 LLVMValueRef next_ycoords[4][2])
1463 {
1464 /*
1465 * Lookup tables aren't nice for simd code hence try some logic here.
1466 * (Note that while it would not be necessary to do per-sample (4) lookups
1467 * when using a LUT as it's impossible that texels fall off of positive
1468 * and negative edges simultaneously, it would however be necessary to
1469 * do 2 lookups for corner handling as in this case texels both fall off
1470 * of x and y axes.)
1471 */
1472 /*
1473 * Next faces (for face 012345):
1474 * x < 0.0 : 451110
1475 * x >= 1.0 : 540001
1476 * y < 0.0 : 225422
1477 * y >= 1.0 : 334533
1478 * Hence nfx+ (and nfy+) == nfx- (nfy-) xor 1
1479 * nfx-: face > 1 ? (face == 5 ? 0 : 1) : (4 + face & 1)
1480 * nfy+: face & ~4 > 1 ? face + 2 : 3;
1481 * This could also use pshufb instead, but would need (manually coded)
1482 * ssse3 intrinsic (llvm won't do non-constant shuffles).
1483 */
1484 struct gallivm_state *gallivm = ivec_bld->gallivm;
1485 LLVMValueRef sel, sel_f2345, sel_f23, sel_f2, tmpsel, tmp;
1486 LLVMValueRef faceand1, sel_fand1, maxmx0, maxmx1, maxmy0, maxmy1;
1487 LLVMValueRef c2 = lp_build_const_int_vec(gallivm, ivec_bld->type, 2);
1488 LLVMValueRef c3 = lp_build_const_int_vec(gallivm, ivec_bld->type, 3);
1489 LLVMValueRef c4 = lp_build_const_int_vec(gallivm, ivec_bld->type, 4);
1490 LLVMValueRef c5 = lp_build_const_int_vec(gallivm, ivec_bld->type, 5);
1491
1492 sel = lp_build_cmp(ivec_bld, PIPE_FUNC_EQUAL, face, c5);
1493 tmpsel = lp_build_select(ivec_bld, sel, ivec_bld->zero, ivec_bld->one);
1494 sel_f2345 = lp_build_cmp(ivec_bld, PIPE_FUNC_GREATER, face, ivec_bld->one);
1495 faceand1 = lp_build_and(ivec_bld, face, ivec_bld->one);
1496 tmp = lp_build_add(ivec_bld, faceand1, c4);
1497 next_faces[0] = lp_build_select(ivec_bld, sel_f2345, tmpsel, tmp);
1498 next_faces[1] = lp_build_xor(ivec_bld, next_faces[0], ivec_bld->one);
1499
1500 tmp = lp_build_andnot(ivec_bld, face, c4);
1501 sel_f23 = lp_build_cmp(ivec_bld, PIPE_FUNC_GREATER, tmp, ivec_bld->one);
1502 tmp = lp_build_add(ivec_bld, face, c2);
1503 next_faces[3] = lp_build_select(ivec_bld, sel_f23, tmp, c3);
1504 next_faces[2] = lp_build_xor(ivec_bld, next_faces[3], ivec_bld->one);
1505
1506 /*
1507 * new xcoords (for face 012345):
1508 * x < 0.0 : max max t max-t max max
1509 * x >= 1.0 : 0 0 max-t t 0 0
1510 * y < 0.0 : max 0 max-s s s max-s
1511 * y >= 1.0 : max 0 s max-s s max-s
1512 *
1513 * ncx[1] = face & ~4 > 1 ? (face == 2 ? max-t : t) : 0
1514 * ncx[0] = max - ncx[1]
1515 * ncx[3] = face > 1 ? (face & 1 ? max-s : s) : (face & 1) ? 0 : max
1516 * ncx[2] = face & ~4 > 1 ? max - ncx[3] : ncx[3]
1517 */
1518 sel_f2 = lp_build_cmp(ivec_bld, PIPE_FUNC_EQUAL, face, c2);
1519 maxmy0 = lp_build_sub(ivec_bld, max_coord, y0);
1520 tmp = lp_build_select(ivec_bld, sel_f2, maxmy0, y0);
1521 next_xcoords[1][0] = lp_build_select(ivec_bld, sel_f23, tmp, ivec_bld->zero);
1522 next_xcoords[0][0] = lp_build_sub(ivec_bld, max_coord, next_xcoords[1][0]);
1523 maxmy1 = lp_build_sub(ivec_bld, max_coord, y1);
1524 tmp = lp_build_select(ivec_bld, sel_f2, maxmy1, y1);
1525 next_xcoords[1][1] = lp_build_select(ivec_bld, sel_f23, tmp, ivec_bld->zero);
1526 next_xcoords[0][1] = lp_build_sub(ivec_bld, max_coord, next_xcoords[1][1]);
1527
1528 sel_fand1 = lp_build_cmp(ivec_bld, PIPE_FUNC_EQUAL, faceand1, ivec_bld->one);
1529
1530 tmpsel = lp_build_select(ivec_bld, sel_fand1, ivec_bld->zero, max_coord);
1531 maxmx0 = lp_build_sub(ivec_bld, max_coord, x0);
1532 tmp = lp_build_select(ivec_bld, sel_fand1, maxmx0, x0);
1533 next_xcoords[3][0] = lp_build_select(ivec_bld, sel_f2345, tmp, tmpsel);
1534 tmp = lp_build_sub(ivec_bld, max_coord, next_xcoords[3][0]);
1535 next_xcoords[2][0] = lp_build_select(ivec_bld, sel_f23, tmp, next_xcoords[3][0]);
1536 maxmx1 = lp_build_sub(ivec_bld, max_coord, x1);
1537 tmp = lp_build_select(ivec_bld, sel_fand1, maxmx1, x1);
1538 next_xcoords[3][1] = lp_build_select(ivec_bld, sel_f2345, tmp, tmpsel);
1539 tmp = lp_build_sub(ivec_bld, max_coord, next_xcoords[3][1]);
1540 next_xcoords[2][1] = lp_build_select(ivec_bld, sel_f23, tmp, next_xcoords[3][1]);
1541
1542 /*
1543 * new ycoords (for face 012345):
1544 * x < 0.0 : t t 0 max t t
1545 * x >= 1.0 : t t 0 max t t
1546 * y < 0.0 : max-s s 0 max max 0
1547 * y >= 1.0 : s max-s 0 max 0 max
1548 *
1549 * ncy[0] = face & ~4 > 1 ? (face == 2 ? 0 : max) : t
1550 * ncy[1] = ncy[0]
1551 * ncy[3] = face > 1 ? (face & 1 ? max : 0) : (face & 1) ? max-s : max
1552 * ncx[2] = face & ~4 > 1 ? max - ncx[3] : ncx[3]
1553 */
1554 tmp = lp_build_select(ivec_bld, sel_f2, ivec_bld->zero, max_coord);
1555 next_ycoords[0][0] = lp_build_select(ivec_bld, sel_f23, tmp, y0);
1556 next_ycoords[1][0] = next_ycoords[0][0];
1557 next_ycoords[0][1] = lp_build_select(ivec_bld, sel_f23, tmp, y1);
1558 next_ycoords[1][1] = next_ycoords[0][1];
1559
1560 tmpsel = lp_build_select(ivec_bld, sel_fand1, maxmx0, x0);
1561 tmp = lp_build_select(ivec_bld, sel_fand1, max_coord, ivec_bld->zero);
1562 next_ycoords[3][0] = lp_build_select(ivec_bld, sel_f2345, tmp, tmpsel);
1563 tmp = lp_build_sub(ivec_bld, max_coord, next_ycoords[3][0]);
1564 next_ycoords[2][0] = lp_build_select(ivec_bld, sel_f23, next_ycoords[3][0], tmp);
1565 tmpsel = lp_build_select(ivec_bld, sel_fand1, maxmx1, x1);
1566 tmp = lp_build_select(ivec_bld, sel_fand1, max_coord, ivec_bld->zero);
1567 next_ycoords[3][1] = lp_build_select(ivec_bld, sel_f2345, tmp, tmpsel);
1568 tmp = lp_build_sub(ivec_bld, max_coord, next_ycoords[3][1]);
1569 next_ycoords[2][1] = lp_build_select(ivec_bld, sel_f23, next_ycoords[3][1], tmp);
1570 }
1571
1572
1573 /** Helper used by lp_build_cube_lookup() */
1574 static LLVMValueRef
1575 lp_build_cube_imapos(struct lp_build_context *coord_bld, LLVMValueRef coord)
1576 {
1577 /* ima = +0.5 / abs(coord); */
1578 LLVMValueRef posHalf = lp_build_const_vec(coord_bld->gallivm, coord_bld->type, 0.5);
1579 LLVMValueRef absCoord = lp_build_abs(coord_bld, coord);
1580 LLVMValueRef ima = lp_build_div(coord_bld, posHalf, absCoord);
1581 return ima;
1582 }
1583
1584
1585 /** Helper for doing 3-wise selection.
1586 * Returns sel1 ? val2 : (sel0 ? val0 : val1).
1587 */
1588 static LLVMValueRef
1589 lp_build_select3(struct lp_build_context *sel_bld,
1590 LLVMValueRef sel0,
1591 LLVMValueRef sel1,
1592 LLVMValueRef val0,
1593 LLVMValueRef val1,
1594 LLVMValueRef val2)
1595 {
1596 LLVMValueRef tmp;
1597 tmp = lp_build_select(sel_bld, sel0, val0, val1);
1598 return lp_build_select(sel_bld, sel1, val2, tmp);
1599 }
1600
1601
1602 /**
1603 * Generate code to do cube face selection and compute per-face texcoords.
1604 */
1605 void
1606 lp_build_cube_lookup(struct lp_build_sample_context *bld,
1607 LLVMValueRef *coords,
1608 const struct lp_derivatives *derivs_in, /* optional */
1609 LLVMValueRef *rho,
1610 struct lp_derivatives *derivs_out, /* optional */
1611 boolean need_derivs)
1612 {
1613 struct lp_build_context *coord_bld = &bld->coord_bld;
1614 LLVMBuilderRef builder = bld->gallivm->builder;
1615 struct gallivm_state *gallivm = bld->gallivm;
1616 LLVMValueRef si, ti, ri;
1617
1618 /*
1619 * Do per-pixel face selection. We cannot however (as we used to do)
1620 * simply calculate the derivs afterwards (which is very bogus for
1621 * explicit derivs btw) because the values would be "random" when
1622 * not all pixels lie on the same face. So what we do here is just
1623 * calculate the derivatives after scaling the coords by the absolute
1624 * value of the inverse major axis, and essentially do rho calculation
1625 * steps as if it were a 3d texture. This is perfect if all pixels hit
1626 * the same face, but not so great at edges, I believe the max error
1627 * should be sqrt(2) with no_rho_approx or 2 otherwise (essentially measuring
1628 * the 3d distance between 2 points on the cube instead of measuring up/down
1629 * the edge). Still this is possibly a win over just selecting the same face
1630 * for all pixels. Unfortunately, something like that doesn't work for
1631 * explicit derivatives.
1632 */
1633 struct lp_build_context *cint_bld = &bld->int_coord_bld;
1634 struct lp_type intctype = cint_bld->type;
1635 LLVMTypeRef coord_vec_type = coord_bld->vec_type;
1636 LLVMTypeRef cint_vec_type = cint_bld->vec_type;
1637 LLVMValueRef as, at, ar, face, face_s, face_t;
1638 LLVMValueRef as_ge_at, maxasat, ar_ge_as_at;
1639 LLVMValueRef snewx, tnewx, snewy, tnewy, snewz, tnewz;
1640 LLVMValueRef tnegi, rnegi;
1641 LLVMValueRef ma, mai, signma, signmabit, imahalfpos;
1642 LLVMValueRef posHalf = lp_build_const_vec(gallivm, coord_bld->type, 0.5);
1643 LLVMValueRef signmask = lp_build_const_int_vec(gallivm, intctype,
1644 1LL << (intctype.width - 1));
1645 LLVMValueRef signshift = lp_build_const_int_vec(gallivm, intctype,
1646 intctype.width -1);
1647 LLVMValueRef facex = lp_build_const_int_vec(gallivm, intctype, PIPE_TEX_FACE_POS_X);
1648 LLVMValueRef facey = lp_build_const_int_vec(gallivm, intctype, PIPE_TEX_FACE_POS_Y);
1649 LLVMValueRef facez = lp_build_const_int_vec(gallivm, intctype, PIPE_TEX_FACE_POS_Z);
1650 LLVMValueRef s = coords[0];
1651 LLVMValueRef t = coords[1];
1652 LLVMValueRef r = coords[2];
1653
1654 assert(PIPE_TEX_FACE_NEG_X == PIPE_TEX_FACE_POS_X + 1);
1655 assert(PIPE_TEX_FACE_NEG_Y == PIPE_TEX_FACE_POS_Y + 1);
1656 assert(PIPE_TEX_FACE_NEG_Z == PIPE_TEX_FACE_POS_Z + 1);
1657
1658 /*
1659 * get absolute value (for x/y/z face selection) and sign bit
1660 * (for mirroring minor coords and pos/neg face selection)
1661 * of the original coords.
1662 */
1663 as = lp_build_abs(&bld->coord_bld, s);
1664 at = lp_build_abs(&bld->coord_bld, t);
1665 ar = lp_build_abs(&bld->coord_bld, r);
1666
1667 /*
1668 * major face determination: select x if x > y else select y
1669 * select z if z >= max(x,y) else select previous result
1670 * if some axis are the same we chose z over y, y over x - the
1671 * dx10 spec seems to ask for it while OpenGL doesn't care (if we
1672 * wouldn't care could save a select or two if using different
1673 * compares and doing at_g_as_ar last since tnewx and tnewz are the
1674 * same).
1675 */
1676 as_ge_at = lp_build_cmp(coord_bld, PIPE_FUNC_GREATER, as, at);
1677 maxasat = lp_build_max(coord_bld, as, at);
1678 ar_ge_as_at = lp_build_cmp(coord_bld, PIPE_FUNC_GEQUAL, ar, maxasat);
1679
1680 if (need_derivs && (derivs_in ||
1681 ((gallivm_debug & GALLIVM_DEBUG_NO_QUAD_LOD) &&
1682 (gallivm_debug & GALLIVM_DEBUG_NO_RHO_APPROX)))) {
1683 /*
1684 * XXX: This is really really complex.
1685 * It is a bit overkill to use this for implicit derivatives as well,
1686 * no way this is worth the cost in practice, but seems to be the
1687 * only way for getting accurate and per-pixel lod values.
1688 */
1689 LLVMValueRef ima, imahalf, tmp, ddx[3], ddy[3];
1690 LLVMValueRef madx, mady, madxdivma, madydivma;
1691 LLVMValueRef sdxi, tdxi, rdxi, sdyi, tdyi, rdyi;
1692 LLVMValueRef tdxnegi, rdxnegi, tdynegi, rdynegi;
1693 LLVMValueRef sdxnewx, sdxnewy, sdxnewz, tdxnewx, tdxnewy, tdxnewz;
1694 LLVMValueRef sdynewx, sdynewy, sdynewz, tdynewx, tdynewy, tdynewz;
1695 LLVMValueRef face_sdx, face_tdx, face_sdy, face_tdy;
1696 /*
1697 * s = 1/2 * ( sc / ma + 1)
1698 * t = 1/2 * ( tc / ma + 1)
1699 *
1700 * s' = 1/2 * (sc' * ma - sc * ma') / ma^2
1701 * t' = 1/2 * (tc' * ma - tc * ma') / ma^2
1702 *
1703 * dx.s = 0.5 * (dx.sc - sc * dx.ma / ma) / ma
1704 * dx.t = 0.5 * (dx.tc - tc * dx.ma / ma) / ma
1705 * dy.s = 0.5 * (dy.sc - sc * dy.ma / ma) / ma
1706 * dy.t = 0.5 * (dy.tc - tc * dy.ma / ma) / ma
1707 */
1708
1709 /* select ma, calculate ima */
1710 ma = lp_build_select3(coord_bld, as_ge_at, ar_ge_as_at, s, t, r);
1711 mai = LLVMBuildBitCast(builder, ma, cint_vec_type, "");
1712 signmabit = LLVMBuildAnd(builder, mai, signmask, "");
1713 ima = lp_build_div(coord_bld, coord_bld->one, ma);
1714 imahalf = lp_build_mul(coord_bld, posHalf, ima);
1715 imahalfpos = lp_build_abs(coord_bld, imahalf);
1716
1717 if (!derivs_in) {
1718 ddx[0] = lp_build_ddx(coord_bld, s);
1719 ddx[1] = lp_build_ddx(coord_bld, t);
1720 ddx[2] = lp_build_ddx(coord_bld, r);
1721 ddy[0] = lp_build_ddy(coord_bld, s);
1722 ddy[1] = lp_build_ddy(coord_bld, t);
1723 ddy[2] = lp_build_ddy(coord_bld, r);
1724 }
1725 else {
1726 ddx[0] = derivs_in->ddx[0];
1727 ddx[1] = derivs_in->ddx[1];
1728 ddx[2] = derivs_in->ddx[2];
1729 ddy[0] = derivs_in->ddy[0];
1730 ddy[1] = derivs_in->ddy[1];
1731 ddy[2] = derivs_in->ddy[2];
1732 }
1733
1734 /* select major derivatives */
1735 madx = lp_build_select3(coord_bld, as_ge_at, ar_ge_as_at, ddx[0], ddx[1], ddx[2]);
1736 mady = lp_build_select3(coord_bld, as_ge_at, ar_ge_as_at, ddy[0], ddy[1], ddy[2]);
1737
1738 si = LLVMBuildBitCast(builder, s, cint_vec_type, "");
1739 ti = LLVMBuildBitCast(builder, t, cint_vec_type, "");
1740 ri = LLVMBuildBitCast(builder, r, cint_vec_type, "");
1741
1742 sdxi = LLVMBuildBitCast(builder, ddx[0], cint_vec_type, "");
1743 tdxi = LLVMBuildBitCast(builder, ddx[1], cint_vec_type, "");
1744 rdxi = LLVMBuildBitCast(builder, ddx[2], cint_vec_type, "");
1745
1746 sdyi = LLVMBuildBitCast(builder, ddy[0], cint_vec_type, "");
1747 tdyi = LLVMBuildBitCast(builder, ddy[1], cint_vec_type, "");
1748 rdyi = LLVMBuildBitCast(builder, ddy[2], cint_vec_type, "");
1749
1750 /*
1751 * compute all possible new s/t coords, which does the mirroring,
1752 * and do the same for derivs minor axes.
1753 * snewx = signma * -r;
1754 * tnewx = -t;
1755 * snewy = s;
1756 * tnewy = signma * r;
1757 * snewz = signma * s;
1758 * tnewz = -t;
1759 */
1760 tnegi = LLVMBuildXor(builder, ti, signmask, "");
1761 rnegi = LLVMBuildXor(builder, ri, signmask, "");
1762 tdxnegi = LLVMBuildXor(builder, tdxi, signmask, "");
1763 rdxnegi = LLVMBuildXor(builder, rdxi, signmask, "");
1764 tdynegi = LLVMBuildXor(builder, tdyi, signmask, "");
1765 rdynegi = LLVMBuildXor(builder, rdyi, signmask, "");
1766
1767 snewx = LLVMBuildXor(builder, signmabit, rnegi, "");
1768 tnewx = tnegi;
1769 sdxnewx = LLVMBuildXor(builder, signmabit, rdxnegi, "");
1770 tdxnewx = tdxnegi;
1771 sdynewx = LLVMBuildXor(builder, signmabit, rdynegi, "");
1772 tdynewx = tdynegi;
1773
1774 snewy = si;
1775 tnewy = LLVMBuildXor(builder, signmabit, ri, "");
1776 sdxnewy = sdxi;
1777 tdxnewy = LLVMBuildXor(builder, signmabit, rdxi, "");
1778 sdynewy = sdyi;
1779 tdynewy = LLVMBuildXor(builder, signmabit, rdyi, "");
1780
1781 snewz = LLVMBuildXor(builder, signmabit, si, "");
1782 tnewz = tnegi;
1783 sdxnewz = LLVMBuildXor(builder, signmabit, sdxi, "");
1784 tdxnewz = tdxnegi;
1785 sdynewz = LLVMBuildXor(builder, signmabit, sdyi, "");
1786 tdynewz = tdynegi;
1787
1788 /* select the mirrored values */
1789 face = lp_build_select3(cint_bld, as_ge_at, ar_ge_as_at, facex, facey, facez);
1790 face_s = lp_build_select3(cint_bld, as_ge_at, ar_ge_as_at, snewx, snewy, snewz);
1791 face_t = lp_build_select3(cint_bld, as_ge_at, ar_ge_as_at, tnewx, tnewy, tnewz);
1792 face_sdx = lp_build_select3(cint_bld, as_ge_at, ar_ge_as_at, sdxnewx, sdxnewy, sdxnewz);
1793 face_tdx = lp_build_select3(cint_bld, as_ge_at, ar_ge_as_at, tdxnewx, tdxnewy, tdxnewz);
1794 face_sdy = lp_build_select3(cint_bld, as_ge_at, ar_ge_as_at, sdynewx, sdynewy, sdynewz);
1795 face_tdy = lp_build_select3(cint_bld, as_ge_at, ar_ge_as_at, tdynewx, tdynewy, tdynewz);
1796
1797 face_s = LLVMBuildBitCast(builder, face_s, coord_vec_type, "");
1798 face_t = LLVMBuildBitCast(builder, face_t, coord_vec_type, "");
1799 face_sdx = LLVMBuildBitCast(builder, face_sdx, coord_vec_type, "");
1800 face_tdx = LLVMBuildBitCast(builder, face_tdx, coord_vec_type, "");
1801 face_sdy = LLVMBuildBitCast(builder, face_sdy, coord_vec_type, "");
1802 face_tdy = LLVMBuildBitCast(builder, face_tdy, coord_vec_type, "");
1803
1804 /* deriv math, dx.s = 0.5 * (dx.sc - sc * dx.ma / ma) / ma */
1805 madxdivma = lp_build_mul(coord_bld, madx, ima);
1806 tmp = lp_build_mul(coord_bld, madxdivma, face_s);
1807 tmp = lp_build_sub(coord_bld, face_sdx, tmp);
1808 derivs_out->ddx[0] = lp_build_mul(coord_bld, tmp, imahalf);
1809
1810 /* dx.t = 0.5 * (dx.tc - tc * dx.ma / ma) / ma */
1811 tmp = lp_build_mul(coord_bld, madxdivma, face_t);
1812 tmp = lp_build_sub(coord_bld, face_tdx, tmp);
1813 derivs_out->ddx[1] = lp_build_mul(coord_bld, tmp, imahalf);
1814
1815 /* dy.s = 0.5 * (dy.sc - sc * dy.ma / ma) / ma */
1816 madydivma = lp_build_mul(coord_bld, mady, ima);
1817 tmp = lp_build_mul(coord_bld, madydivma, face_s);
1818 tmp = lp_build_sub(coord_bld, face_sdy, tmp);
1819 derivs_out->ddy[0] = lp_build_mul(coord_bld, tmp, imahalf);
1820
1821 /* dy.t = 0.5 * (dy.tc - tc * dy.ma / ma) / ma */
1822 tmp = lp_build_mul(coord_bld, madydivma, face_t);
1823 tmp = lp_build_sub(coord_bld, face_tdy, tmp);
1824 derivs_out->ddy[1] = lp_build_mul(coord_bld, tmp, imahalf);
1825
1826 signma = LLVMBuildLShr(builder, mai, signshift, "");
1827 coords[2] = LLVMBuildOr(builder, face, signma, "face");
1828
1829 /* project coords */
1830 face_s = lp_build_mul(coord_bld, face_s, imahalfpos);
1831 face_t = lp_build_mul(coord_bld, face_t, imahalfpos);
1832
1833 coords[0] = lp_build_add(coord_bld, face_s, posHalf);
1834 coords[1] = lp_build_add(coord_bld, face_t, posHalf);
1835
1836 return;
1837 }
1838
1839 else if (need_derivs) {
1840 LLVMValueRef ddx_ddy[2], tmp[3], rho_vec;
1841 static const unsigned char swizzle0[] = { /* no-op swizzle */
1842 0, LP_BLD_SWIZZLE_DONTCARE,
1843 LP_BLD_SWIZZLE_DONTCARE, LP_BLD_SWIZZLE_DONTCARE
1844 };
1845 static const unsigned char swizzle1[] = {
1846 1, LP_BLD_SWIZZLE_DONTCARE,
1847 LP_BLD_SWIZZLE_DONTCARE, LP_BLD_SWIZZLE_DONTCARE
1848 };
1849 static const unsigned char swizzle01[] = { /* no-op swizzle */
1850 0, 1,
1851 LP_BLD_SWIZZLE_DONTCARE, LP_BLD_SWIZZLE_DONTCARE
1852 };
1853 static const unsigned char swizzle23[] = {
1854 2, 3,
1855 LP_BLD_SWIZZLE_DONTCARE, LP_BLD_SWIZZLE_DONTCARE
1856 };
1857 static const unsigned char swizzle02[] = {
1858 0, 2,
1859 LP_BLD_SWIZZLE_DONTCARE, LP_BLD_SWIZZLE_DONTCARE
1860 };
1861
1862 /*
1863 * scale the s/t/r coords pre-select/mirror so we can calculate
1864 * "reasonable" derivs.
1865 */
1866 ma = lp_build_select3(coord_bld, as_ge_at, ar_ge_as_at, s, t, r);
1867 imahalfpos = lp_build_cube_imapos(coord_bld, ma);
1868 s = lp_build_mul(coord_bld, s, imahalfpos);
1869 t = lp_build_mul(coord_bld, t, imahalfpos);
1870 r = lp_build_mul(coord_bld, r, imahalfpos);
1871
1872 /*
1873 * This isn't quite the same as the "ordinary" (3d deriv) path since we
1874 * know the texture is square which simplifies things (we can omit the
1875 * size mul which happens very early completely here and do it at the
1876 * very end).
1877 * Also always do calculations according to GALLIVM_DEBUG_NO_RHO_APPROX
1878 * since the error can get quite big otherwise at edges.
1879 * (With no_rho_approx max error is sqrt(2) at edges, same as it is
1880 * without no_rho_approx for 2d textures, otherwise it would be factor 2.)
1881 */
1882 ddx_ddy[0] = lp_build_packed_ddx_ddy_twocoord(coord_bld, s, t);
1883 ddx_ddy[1] = lp_build_packed_ddx_ddy_onecoord(coord_bld, r);
1884
1885 ddx_ddy[0] = lp_build_mul(coord_bld, ddx_ddy[0], ddx_ddy[0]);
1886 ddx_ddy[1] = lp_build_mul(coord_bld, ddx_ddy[1], ddx_ddy[1]);
1887
1888 tmp[0] = lp_build_swizzle_aos(coord_bld, ddx_ddy[0], swizzle01);
1889 tmp[1] = lp_build_swizzle_aos(coord_bld, ddx_ddy[0], swizzle23);
1890 tmp[2] = lp_build_swizzle_aos(coord_bld, ddx_ddy[1], swizzle02);
1891
1892 rho_vec = lp_build_add(coord_bld, tmp[0], tmp[1]);
1893 rho_vec = lp_build_add(coord_bld, rho_vec, tmp[2]);
1894
1895 tmp[0] = lp_build_swizzle_aos(coord_bld, rho_vec, swizzle0);
1896 tmp[1] = lp_build_swizzle_aos(coord_bld, rho_vec, swizzle1);
1897 *rho = lp_build_max(coord_bld, tmp[0], tmp[1]);
1898 }
1899
1900 if (!need_derivs) {
1901 ma = lp_build_select3(coord_bld, as_ge_at, ar_ge_as_at, s, t, r);
1902 }
1903 mai = LLVMBuildBitCast(builder, ma, cint_vec_type, "");
1904 signmabit = LLVMBuildAnd(builder, mai, signmask, "");
1905
1906 si = LLVMBuildBitCast(builder, s, cint_vec_type, "");
1907 ti = LLVMBuildBitCast(builder, t, cint_vec_type, "");
1908 ri = LLVMBuildBitCast(builder, r, cint_vec_type, "");
1909
1910 /*
1911 * compute all possible new s/t coords, which does the mirroring
1912 * snewx = signma * -r;
1913 * tnewx = -t;
1914 * snewy = s;
1915 * tnewy = signma * r;
1916 * snewz = signma * s;
1917 * tnewz = -t;
1918 */
1919 tnegi = LLVMBuildXor(builder, ti, signmask, "");
1920 rnegi = LLVMBuildXor(builder, ri, signmask, "");
1921
1922 snewx = LLVMBuildXor(builder, signmabit, rnegi, "");
1923 tnewx = tnegi;
1924
1925 snewy = si;
1926 tnewy = LLVMBuildXor(builder, signmabit, ri, "");
1927
1928 snewz = LLVMBuildXor(builder, signmabit, si, "");
1929 tnewz = tnegi;
1930
1931 /* select the mirrored values */
1932 face_s = lp_build_select3(cint_bld, as_ge_at, ar_ge_as_at, snewx, snewy, snewz);
1933 face_t = lp_build_select3(cint_bld, as_ge_at, ar_ge_as_at, tnewx, tnewy, tnewz);
1934 face = lp_build_select3(cint_bld, as_ge_at, ar_ge_as_at, facex, facey, facez);
1935
1936 face_s = LLVMBuildBitCast(builder, face_s, coord_vec_type, "");
1937 face_t = LLVMBuildBitCast(builder, face_t, coord_vec_type, "");
1938
1939 /* add +1 for neg face */
1940 /* XXX with AVX probably want to use another select here -
1941 * as long as we ensure vblendvps gets used we can actually
1942 * skip the comparison and just use sign as a "mask" directly.
1943 */
1944 signma = LLVMBuildLShr(builder, mai, signshift, "");
1945 coords[2] = LLVMBuildOr(builder, face, signma, "face");
1946
1947 /* project coords */
1948 if (!need_derivs) {
1949 imahalfpos = lp_build_cube_imapos(coord_bld, ma);
1950 face_s = lp_build_mul(coord_bld, face_s, imahalfpos);
1951 face_t = lp_build_mul(coord_bld, face_t, imahalfpos);
1952 }
1953
1954 coords[0] = lp_build_add(coord_bld, face_s, posHalf);
1955 coords[1] = lp_build_add(coord_bld, face_t, posHalf);
1956 }
1957
1958
1959 /**
1960 * Compute the partial offset of a pixel block along an arbitrary axis.
1961 *
1962 * @param coord coordinate in pixels
1963 * @param stride number of bytes between rows of successive pixel blocks
1964 * @param block_length number of pixels in a pixels block along the coordinate
1965 * axis
1966 * @param out_offset resulting relative offset of the pixel block in bytes
1967 * @param out_subcoord resulting sub-block pixel coordinate
1968 */
1969 void
1970 lp_build_sample_partial_offset(struct lp_build_context *bld,
1971 unsigned block_length,
1972 LLVMValueRef coord,
1973 LLVMValueRef stride,
1974 LLVMValueRef *out_offset,
1975 LLVMValueRef *out_subcoord)
1976 {
1977 LLVMBuilderRef builder = bld->gallivm->builder;
1978 LLVMValueRef offset;
1979 LLVMValueRef subcoord;
1980
1981 if (block_length == 1) {
1982 subcoord = bld->zero;
1983 }
1984 else {
1985 /*
1986 * Pixel blocks have power of two dimensions. LLVM should convert the
1987 * rem/div to bit arithmetic.
1988 * TODO: Verify this.
1989 * It does indeed BUT it does transform it to scalar (and back) when doing so
1990 * (using roughly extract, shift/and, mov, unpack) (llvm 2.7).
1991 * The generated code looks seriously unfunny and is quite expensive.
1992 */
1993 #if 0
1994 LLVMValueRef block_width = lp_build_const_int_vec(bld->type, block_length);
1995 subcoord = LLVMBuildURem(builder, coord, block_width, "");
1996 coord = LLVMBuildUDiv(builder, coord, block_width, "");
1997 #else
1998 unsigned logbase2 = util_logbase2(block_length);
1999 LLVMValueRef block_shift = lp_build_const_int_vec(bld->gallivm, bld->type, logbase2);
2000 LLVMValueRef block_mask = lp_build_const_int_vec(bld->gallivm, bld->type, block_length - 1);
2001 subcoord = LLVMBuildAnd(builder, coord, block_mask, "");
2002 coord = LLVMBuildLShr(builder, coord, block_shift, "");
2003 #endif
2004 }
2005
2006 offset = lp_build_mul(bld, coord, stride);
2007
2008 assert(out_offset);
2009 assert(out_subcoord);
2010
2011 *out_offset = offset;
2012 *out_subcoord = subcoord;
2013 }
2014
2015
2016 /**
2017 * Compute the offset of a pixel block.
2018 *
2019 * x, y, z, y_stride, z_stride are vectors, and they refer to pixels.
2020 *
2021 * Returns the relative offset and i,j sub-block coordinates
2022 */
2023 void
2024 lp_build_sample_offset(struct lp_build_context *bld,
2025 const struct util_format_description *format_desc,
2026 LLVMValueRef x,
2027 LLVMValueRef y,
2028 LLVMValueRef z,
2029 LLVMValueRef y_stride,
2030 LLVMValueRef z_stride,
2031 LLVMValueRef *out_offset,
2032 LLVMValueRef *out_i,
2033 LLVMValueRef *out_j)
2034 {
2035 LLVMValueRef x_stride;
2036 LLVMValueRef offset;
2037
2038 x_stride = lp_build_const_vec(bld->gallivm, bld->type,
2039 format_desc->block.bits/8);
2040
2041 lp_build_sample_partial_offset(bld,
2042 format_desc->block.width,
2043 x, x_stride,
2044 &offset, out_i);
2045
2046 if (y && y_stride) {
2047 LLVMValueRef y_offset;
2048 lp_build_sample_partial_offset(bld,
2049 format_desc->block.height,
2050 y, y_stride,
2051 &y_offset, out_j);
2052 offset = lp_build_add(bld, offset, y_offset);
2053 }
2054 else {
2055 *out_j = bld->zero;
2056 }
2057
2058 if (z && z_stride) {
2059 LLVMValueRef z_offset;
2060 LLVMValueRef k;
2061 lp_build_sample_partial_offset(bld,
2062 1, /* pixel blocks are always 2D */
2063 z, z_stride,
2064 &z_offset, &k);
2065 offset = lp_build_add(bld, offset, z_offset);
2066 }
2067
2068 *out_offset = offset;
2069 }