1 /**************************************************************************
3 * Copyright 2009-2010 VMware, Inc.
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:
14 * The above copyright notice and this permission notice (including the
15 * next paragraph) shall be included in all copies or substantial portions
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.
26 **************************************************************************/
33 * LLVM IR doesn't support all basic arithmetic operations we care about (most
34 * notably min/max and saturated operations), and it is often necessary to
35 * resort machine-specific intrinsics directly. The functions here hide all
36 * these implementation details from the other modules.
38 * We also do simple expressions simplification here. Reasons are:
39 * - it is very easy given we have all necessary information readily available
40 * - LLVM optimization passes fail to simplify several vector expressions
41 * - We often know value constraints which the optimization passes have no way
42 * of knowing, such as when source arguments are known to be in [0, 1] range.
44 * @author Jose Fonseca <jfonseca@vmware.com>
48 #include "util/u_memory.h"
49 #include "util/u_debug.h"
50 #include "util/u_math.h"
51 #include "util/u_string.h"
52 #include "util/u_cpu_detect.h"
54 #include "lp_bld_type.h"
55 #include "lp_bld_const.h"
56 #include "lp_bld_intr.h"
57 #include "lp_bld_logic.h"
58 #include "lp_bld_pack.h"
59 #include "lp_bld_debug.h"
60 #include "lp_bld_arit.h"
63 #define EXP_POLY_DEGREE 3
65 #define LOG_POLY_DEGREE 5
70 * No checks for special case values of a or b = 1 or 0 are done.
73 lp_build_min_simple(struct lp_build_context
*bld
,
77 const struct lp_type type
= bld
->type
;
78 const char *intrinsic
= NULL
;
81 assert(lp_check_value(type
, a
));
82 assert(lp_check_value(type
, b
));
84 /* TODO: optimize the constant case */
86 if(type
.width
* type
.length
== 128) {
88 if(type
.width
== 32 && util_cpu_caps
.has_sse
)
89 intrinsic
= "llvm.x86.sse.min.ps";
90 if(type
.width
== 64 && util_cpu_caps
.has_sse2
)
91 intrinsic
= "llvm.x86.sse2.min.pd";
94 if(type
.width
== 8 && !type
.sign
&& util_cpu_caps
.has_sse2
)
95 intrinsic
= "llvm.x86.sse2.pminu.b";
96 if(type
.width
== 8 && type
.sign
&& util_cpu_caps
.has_sse4_1
)
97 intrinsic
= "llvm.x86.sse41.pminsb";
98 if(type
.width
== 16 && !type
.sign
&& util_cpu_caps
.has_sse4_1
)
99 intrinsic
= "llvm.x86.sse41.pminuw";
100 if(type
.width
== 16 && type
.sign
&& util_cpu_caps
.has_sse2
)
101 intrinsic
= "llvm.x86.sse2.pmins.w";
102 if(type
.width
== 32 && !type
.sign
&& util_cpu_caps
.has_sse4_1
)
103 intrinsic
= "llvm.x86.sse41.pminud";
104 if(type
.width
== 32 && type
.sign
&& util_cpu_caps
.has_sse4_1
)
105 intrinsic
= "llvm.x86.sse41.pminsd";
110 return lp_build_intrinsic_binary(bld
->builder
, intrinsic
, lp_build_vec_type(bld
->type
), a
, b
);
112 cond
= lp_build_cmp(bld
, PIPE_FUNC_LESS
, a
, b
);
113 return lp_build_select(bld
, cond
, a
, b
);
119 * No checks for special case values of a or b = 1 or 0 are done.
122 lp_build_max_simple(struct lp_build_context
*bld
,
126 const struct lp_type type
= bld
->type
;
127 const char *intrinsic
= NULL
;
130 assert(lp_check_value(type
, a
));
131 assert(lp_check_value(type
, b
));
133 /* TODO: optimize the constant case */
135 if(type
.width
* type
.length
== 128) {
137 if(type
.width
== 32 && util_cpu_caps
.has_sse
)
138 intrinsic
= "llvm.x86.sse.max.ps";
139 if(type
.width
== 64 && util_cpu_caps
.has_sse2
)
140 intrinsic
= "llvm.x86.sse2.max.pd";
143 if(type
.width
== 8 && !type
.sign
&& util_cpu_caps
.has_sse2
)
144 intrinsic
= "llvm.x86.sse2.pmaxu.b";
145 if(type
.width
== 8 && type
.sign
&& util_cpu_caps
.has_sse4_1
)
146 intrinsic
= "llvm.x86.sse41.pmaxsb";
147 if(type
.width
== 16 && !type
.sign
&& util_cpu_caps
.has_sse4_1
)
148 intrinsic
= "llvm.x86.sse41.pmaxuw";
149 if(type
.width
== 16 && type
.sign
&& util_cpu_caps
.has_sse2
)
150 intrinsic
= "llvm.x86.sse2.pmaxs.w";
151 if(type
.width
== 32 && !type
.sign
&& util_cpu_caps
.has_sse4_1
)
152 intrinsic
= "llvm.x86.sse41.pmaxud";
153 if(type
.width
== 32 && type
.sign
&& util_cpu_caps
.has_sse4_1
)
154 intrinsic
= "llvm.x86.sse41.pmaxsd";
159 return lp_build_intrinsic_binary(bld
->builder
, intrinsic
, lp_build_vec_type(bld
->type
), a
, b
);
161 cond
= lp_build_cmp(bld
, PIPE_FUNC_GREATER
, a
, b
);
162 return lp_build_select(bld
, cond
, a
, b
);
167 * Generate 1 - a, or ~a depending on bld->type.
170 lp_build_comp(struct lp_build_context
*bld
,
173 const struct lp_type type
= bld
->type
;
175 assert(lp_check_value(type
, a
));
182 if(type
.norm
&& !type
.floating
&& !type
.fixed
&& !type
.sign
) {
183 if(LLVMIsConstant(a
))
184 return LLVMConstNot(a
);
186 return LLVMBuildNot(bld
->builder
, a
, "");
189 if(LLVMIsConstant(a
))
191 return LLVMConstFSub(bld
->one
, a
);
193 return LLVMConstSub(bld
->one
, a
);
196 return LLVMBuildFSub(bld
->builder
, bld
->one
, a
, "");
198 return LLVMBuildSub(bld
->builder
, bld
->one
, a
, "");
206 lp_build_add(struct lp_build_context
*bld
,
210 const struct lp_type type
= bld
->type
;
213 assert(lp_check_value(type
, a
));
214 assert(lp_check_value(type
, b
));
220 if(a
== bld
->undef
|| b
== bld
->undef
)
224 const char *intrinsic
= NULL
;
226 if(a
== bld
->one
|| b
== bld
->one
)
229 if(util_cpu_caps
.has_sse2
&&
230 type
.width
* type
.length
== 128 &&
231 !type
.floating
&& !type
.fixed
) {
233 intrinsic
= type
.sign
? "llvm.x86.sse2.padds.b" : "llvm.x86.sse2.paddus.b";
235 intrinsic
= type
.sign
? "llvm.x86.sse2.padds.w" : "llvm.x86.sse2.paddus.w";
239 return lp_build_intrinsic_binary(bld
->builder
, intrinsic
, lp_build_vec_type(bld
->type
), a
, b
);
242 if(LLVMIsConstant(a
) && LLVMIsConstant(b
))
244 res
= LLVMConstFAdd(a
, b
);
246 res
= LLVMConstAdd(a
, b
);
249 res
= LLVMBuildFAdd(bld
->builder
, a
, b
, "");
251 res
= LLVMBuildAdd(bld
->builder
, a
, b
, "");
253 /* clamp to ceiling of 1.0 */
254 if(bld
->type
.norm
&& (bld
->type
.floating
|| bld
->type
.fixed
))
255 res
= lp_build_min_simple(bld
, res
, bld
->one
);
257 /* XXX clamp to floor of -1 or 0??? */
263 /** Return the scalar sum of the elements of a */
265 lp_build_sum_vector(struct lp_build_context
*bld
,
268 const struct lp_type type
= bld
->type
;
269 LLVMValueRef index
, res
;
272 assert(lp_check_value(type
, a
));
274 if (type
.length
== 1) {
278 assert(!bld
->type
.norm
);
280 index
= LLVMConstInt(LLVMInt32Type(), 0, 0);
281 res
= LLVMBuildExtractElement(bld
->builder
, a
, index
, "");
283 for (i
= 1; i
< type
.length
; i
++) {
284 index
= LLVMConstInt(LLVMInt32Type(), i
, 0);
286 res
= LLVMBuildFAdd(bld
->builder
, res
,
287 LLVMBuildExtractElement(bld
->builder
,
291 res
= LLVMBuildAdd(bld
->builder
, res
,
292 LLVMBuildExtractElement(bld
->builder
,
305 lp_build_sub(struct lp_build_context
*bld
,
309 const struct lp_type type
= bld
->type
;
312 assert(lp_check_value(type
, a
));
313 assert(lp_check_value(type
, b
));
317 if(a
== bld
->undef
|| b
== bld
->undef
)
323 const char *intrinsic
= NULL
;
328 if(util_cpu_caps
.has_sse2
&&
329 type
.width
* type
.length
== 128 &&
330 !type
.floating
&& !type
.fixed
) {
332 intrinsic
= type
.sign
? "llvm.x86.sse2.psubs.b" : "llvm.x86.sse2.psubus.b";
334 intrinsic
= type
.sign
? "llvm.x86.sse2.psubs.w" : "llvm.x86.sse2.psubus.w";
338 return lp_build_intrinsic_binary(bld
->builder
, intrinsic
, lp_build_vec_type(bld
->type
), a
, b
);
341 if(LLVMIsConstant(a
) && LLVMIsConstant(b
))
343 res
= LLVMConstFSub(a
, b
);
345 res
= LLVMConstSub(a
, b
);
348 res
= LLVMBuildFSub(bld
->builder
, a
, b
, "");
350 res
= LLVMBuildSub(bld
->builder
, a
, b
, "");
352 if(bld
->type
.norm
&& (bld
->type
.floating
|| bld
->type
.fixed
))
353 res
= lp_build_max_simple(bld
, res
, bld
->zero
);
360 * Normalized 8bit multiplication.
364 * makes the following approximation to the division (Sree)
366 * a*b/255 ~= (a*(b + 1)) >> 256
368 * which is the fastest method that satisfies the following OpenGL criteria
370 * 0*0 = 0 and 255*255 = 255
374 * takes the geometric series approximation to the division
376 * t/255 = (t >> 8) + (t >> 16) + (t >> 24) ..
378 * in this case just the first two terms to fit in 16bit arithmetic
380 * t/255 ~= (t + (t >> 8)) >> 8
382 * note that just by itself it doesn't satisfies the OpenGL criteria, as
383 * 255*255 = 254, so the special case b = 255 must be accounted or roundoff
386 * - geometric series plus rounding
388 * when using a geometric series division instead of truncating the result
389 * use roundoff in the approximation (Jim Blinn)
391 * t/255 ~= (t + (t >> 8) + 0x80) >> 8
393 * achieving the exact results
395 * @sa Alvy Ray Smith, Image Compositing Fundamentals, Tech Memo 4, Aug 15, 1995,
396 * ftp://ftp.alvyray.com/Acrobat/4_Comp.pdf
397 * @sa Michael Herf, The "double blend trick", May 2000,
398 * http://www.stereopsis.com/doubleblend.html
401 lp_build_mul_u8n(LLVMBuilderRef builder
,
402 struct lp_type i16_type
,
403 LLVMValueRef a
, LLVMValueRef b
)
408 assert(!i16_type
.floating
);
409 assert(lp_check_value(i16_type
, a
));
410 assert(lp_check_value(i16_type
, b
));
412 c8
= lp_build_const_int_vec(i16_type
, 8);
416 /* a*b/255 ~= (a*(b + 1)) >> 256 */
417 b
= LLVMBuildAdd(builder
, b
, lp_build_const_int_vec(i16_type
, 1), "");
418 ab
= LLVMBuildMul(builder
, a
, b
, "");
422 /* ab/255 ~= (ab + (ab >> 8) + 0x80) >> 8 */
423 ab
= LLVMBuildMul(builder
, a
, b
, "");
424 ab
= LLVMBuildAdd(builder
, ab
, LLVMBuildLShr(builder
, ab
, c8
, ""), "");
425 ab
= LLVMBuildAdd(builder
, ab
, lp_build_const_int_vec(i16_type
, 0x80), "");
429 ab
= LLVMBuildLShr(builder
, ab
, c8
, "");
439 lp_build_mul(struct lp_build_context
*bld
,
443 const struct lp_type type
= bld
->type
;
447 assert(lp_check_value(type
, a
));
448 assert(lp_check_value(type
, b
));
458 if(a
== bld
->undef
|| b
== bld
->undef
)
461 if(!type
.floating
&& !type
.fixed
&& type
.norm
) {
462 if(type
.width
== 8) {
463 struct lp_type i16_type
= lp_wider_type(type
);
464 LLVMValueRef al
, ah
, bl
, bh
, abl
, abh
, ab
;
466 lp_build_unpack2(bld
->builder
, type
, i16_type
, a
, &al
, &ah
);
467 lp_build_unpack2(bld
->builder
, type
, i16_type
, b
, &bl
, &bh
);
469 /* PMULLW, PSRLW, PADDW */
470 abl
= lp_build_mul_u8n(bld
->builder
, i16_type
, al
, bl
);
471 abh
= lp_build_mul_u8n(bld
->builder
, i16_type
, ah
, bh
);
473 ab
= lp_build_pack2(bld
->builder
, i16_type
, type
, abl
, abh
);
483 shift
= lp_build_const_int_vec(type
, type
.width
/2);
487 if(LLVMIsConstant(a
) && LLVMIsConstant(b
)) {
489 res
= LLVMConstFMul(a
, b
);
491 res
= LLVMConstMul(a
, b
);
494 res
= LLVMConstAShr(res
, shift
);
496 res
= LLVMConstLShr(res
, shift
);
501 res
= LLVMBuildFMul(bld
->builder
, a
, b
, "");
503 res
= LLVMBuildMul(bld
->builder
, a
, b
, "");
506 res
= LLVMBuildAShr(bld
->builder
, res
, shift
, "");
508 res
= LLVMBuildLShr(bld
->builder
, res
, shift
, "");
517 * Small vector x scale multiplication optimization.
520 lp_build_mul_imm(struct lp_build_context
*bld
,
526 assert(lp_check_value(bld
->type
, a
));
535 return lp_build_negate(bld
, a
);
537 if(b
== 2 && bld
->type
.floating
)
538 return lp_build_add(bld
, a
, a
);
540 if(util_is_power_of_two(b
)) {
541 unsigned shift
= ffs(b
) - 1;
543 if(bld
->type
.floating
) {
546 * Power of two multiplication by directly manipulating the mantissa.
548 * XXX: This might not be always faster, it will introduce a small error
549 * for multiplication by zero, and it will produce wrong results
552 unsigned mantissa
= lp_mantissa(bld
->type
);
553 factor
= lp_build_const_int_vec(bld
->type
, (unsigned long long)shift
<< mantissa
);
554 a
= LLVMBuildBitCast(bld
->builder
, a
, lp_build_int_vec_type(bld
->type
), "");
555 a
= LLVMBuildAdd(bld
->builder
, a
, factor
, "");
556 a
= LLVMBuildBitCast(bld
->builder
, a
, lp_build_vec_type(bld
->type
), "");
561 factor
= lp_build_const_vec(bld
->type
, shift
);
562 return LLVMBuildShl(bld
->builder
, a
, factor
, "");
566 factor
= lp_build_const_vec(bld
->type
, (double)b
);
567 return lp_build_mul(bld
, a
, factor
);
575 lp_build_div(struct lp_build_context
*bld
,
579 const struct lp_type type
= bld
->type
;
581 assert(lp_check_value(type
, a
));
582 assert(lp_check_value(type
, b
));
587 return lp_build_rcp(bld
, b
);
592 if(a
== bld
->undef
|| b
== bld
->undef
)
595 if(LLVMIsConstant(a
) && LLVMIsConstant(b
)) {
597 return LLVMConstFDiv(a
, b
);
599 return LLVMConstSDiv(a
, b
);
601 return LLVMConstUDiv(a
, b
);
604 if(util_cpu_caps
.has_sse
&& type
.width
== 32 && type
.length
== 4)
605 return lp_build_mul(bld
, a
, lp_build_rcp(bld
, b
));
608 return LLVMBuildFDiv(bld
->builder
, a
, b
, "");
610 return LLVMBuildSDiv(bld
->builder
, a
, b
, "");
612 return LLVMBuildUDiv(bld
->builder
, a
, b
, "");
617 * Linear interpolation -- without any checks.
619 * @sa http://www.stereopsis.com/doubleblend.html
621 static INLINE LLVMValueRef
622 lp_build_lerp_simple(struct lp_build_context
*bld
,
630 assert(lp_check_value(bld
->type
, x
));
631 assert(lp_check_value(bld
->type
, v0
));
632 assert(lp_check_value(bld
->type
, v1
));
634 delta
= lp_build_sub(bld
, v1
, v0
);
636 res
= lp_build_mul(bld
, x
, delta
);
638 res
= lp_build_add(bld
, v0
, res
);
640 if (bld
->type
.fixed
) {
641 /* XXX: This step is necessary for lerping 8bit colors stored on 16bits,
642 * but it will be wrong for other uses. Basically we need a more
643 * powerful lp_type, capable of further distinguishing the values
644 * interpretation from the value storage. */
645 res
= LLVMBuildAnd(bld
->builder
, res
, lp_build_const_int_vec(bld
->type
, (1 << bld
->type
.width
/2) - 1), "");
653 * Linear interpolation.
656 lp_build_lerp(struct lp_build_context
*bld
,
661 const struct lp_type type
= bld
->type
;
664 assert(lp_check_value(type
, x
));
665 assert(lp_check_value(type
, v0
));
666 assert(lp_check_value(type
, v1
));
669 struct lp_type wide_type
;
670 struct lp_build_context wide_bld
;
671 LLVMValueRef xl
, xh
, v0l
, v0h
, v1l
, v1h
, resl
, resh
;
674 assert(type
.length
>= 2);
678 * Create a wider type, enough to hold the intermediate result of the
681 memset(&wide_type
, 0, sizeof wide_type
);
682 wide_type
.fixed
= TRUE
;
683 wide_type
.width
= type
.width
*2;
684 wide_type
.length
= type
.length
/2;
686 lp_build_context_init(&wide_bld
, bld
->builder
, wide_type
);
688 lp_build_unpack2(bld
->builder
, type
, wide_type
, x
, &xl
, &xh
);
689 lp_build_unpack2(bld
->builder
, type
, wide_type
, v0
, &v0l
, &v0h
);
690 lp_build_unpack2(bld
->builder
, type
, wide_type
, v1
, &v1l
, &v1h
);
693 * Scale x from [0, 255] to [0, 256]
696 shift
= lp_build_const_int_vec(wide_type
, type
.width
- 1);
698 xl
= lp_build_add(&wide_bld
, xl
,
699 LLVMBuildAShr(bld
->builder
, xl
, shift
, ""));
700 xh
= lp_build_add(&wide_bld
, xh
,
701 LLVMBuildAShr(bld
->builder
, xh
, shift
, ""));
707 resl
= lp_build_lerp_simple(&wide_bld
, xl
, v0l
, v1l
);
708 resh
= lp_build_lerp_simple(&wide_bld
, xh
, v0h
, v1h
);
710 res
= lp_build_pack2(bld
->builder
, wide_type
, type
, resl
, resh
);
712 res
= lp_build_lerp_simple(bld
, x
, v0
, v1
);
720 lp_build_lerp_2d(struct lp_build_context
*bld
,
728 LLVMValueRef v0
= lp_build_lerp(bld
, x
, v00
, v01
);
729 LLVMValueRef v1
= lp_build_lerp(bld
, x
, v10
, v11
);
730 return lp_build_lerp(bld
, y
, v0
, v1
);
736 * Do checks for special cases.
739 lp_build_min(struct lp_build_context
*bld
,
743 assert(lp_check_value(bld
->type
, a
));
744 assert(lp_check_value(bld
->type
, b
));
746 if(a
== bld
->undef
|| b
== bld
->undef
)
753 if(a
== bld
->zero
|| b
== bld
->zero
)
761 return lp_build_min_simple(bld
, a
, b
);
767 * Do checks for special cases.
770 lp_build_max(struct lp_build_context
*bld
,
774 assert(lp_check_value(bld
->type
, a
));
775 assert(lp_check_value(bld
->type
, b
));
777 if(a
== bld
->undef
|| b
== bld
->undef
)
784 if(a
== bld
->one
|| b
== bld
->one
)
792 return lp_build_max_simple(bld
, a
, b
);
797 * Generate clamp(a, min, max)
798 * Do checks for special cases.
801 lp_build_clamp(struct lp_build_context
*bld
,
806 assert(lp_check_value(bld
->type
, a
));
807 assert(lp_check_value(bld
->type
, min
));
808 assert(lp_check_value(bld
->type
, max
));
810 a
= lp_build_min(bld
, a
, max
);
811 a
= lp_build_max(bld
, a
, min
);
820 lp_build_abs(struct lp_build_context
*bld
,
823 const struct lp_type type
= bld
->type
;
824 LLVMTypeRef vec_type
= lp_build_vec_type(type
);
826 assert(lp_check_value(type
, a
));
832 /* Mask out the sign bit */
833 LLVMTypeRef int_vec_type
= lp_build_int_vec_type(type
);
834 unsigned long long absMask
= ~(1ULL << (type
.width
- 1));
835 LLVMValueRef mask
= lp_build_const_int_vec(type
, ((unsigned long long) absMask
));
836 a
= LLVMBuildBitCast(bld
->builder
, a
, int_vec_type
, "");
837 a
= LLVMBuildAnd(bld
->builder
, a
, mask
, "");
838 a
= LLVMBuildBitCast(bld
->builder
, a
, vec_type
, "");
842 if(type
.width
*type
.length
== 128 && util_cpu_caps
.has_ssse3
) {
845 return lp_build_intrinsic_unary(bld
->builder
, "llvm.x86.ssse3.pabs.b.128", vec_type
, a
);
847 return lp_build_intrinsic_unary(bld
->builder
, "llvm.x86.ssse3.pabs.w.128", vec_type
, a
);
849 return lp_build_intrinsic_unary(bld
->builder
, "llvm.x86.ssse3.pabs.d.128", vec_type
, a
);
853 return lp_build_max(bld
, a
, LLVMBuildNeg(bld
->builder
, a
, ""));
858 lp_build_negate(struct lp_build_context
*bld
,
861 assert(lp_check_value(bld
->type
, a
));
863 #if HAVE_LLVM >= 0x0207
864 if (bld
->type
.floating
)
865 a
= LLVMBuildFNeg(bld
->builder
, a
, "");
868 a
= LLVMBuildNeg(bld
->builder
, a
, "");
874 /** Return -1, 0 or +1 depending on the sign of a */
876 lp_build_sgn(struct lp_build_context
*bld
,
879 const struct lp_type type
= bld
->type
;
883 assert(lp_check_value(type
, a
));
885 /* Handle non-zero case */
887 /* if not zero then sign must be positive */
890 else if(type
.floating
) {
891 LLVMTypeRef vec_type
;
892 LLVMTypeRef int_type
;
896 unsigned long long maskBit
= (unsigned long long)1 << (type
.width
- 1);
898 int_type
= lp_build_int_vec_type(type
);
899 vec_type
= lp_build_vec_type(type
);
900 mask
= lp_build_const_int_vec(type
, maskBit
);
902 /* Take the sign bit and add it to 1 constant */
903 sign
= LLVMBuildBitCast(bld
->builder
, a
, int_type
, "");
904 sign
= LLVMBuildAnd(bld
->builder
, sign
, mask
, "");
905 one
= LLVMConstBitCast(bld
->one
, int_type
);
906 res
= LLVMBuildOr(bld
->builder
, sign
, one
, "");
907 res
= LLVMBuildBitCast(bld
->builder
, res
, vec_type
, "");
911 LLVMValueRef minus_one
= lp_build_const_vec(type
, -1.0);
912 cond
= lp_build_cmp(bld
, PIPE_FUNC_GREATER
, a
, bld
->zero
);
913 res
= lp_build_select(bld
, cond
, bld
->one
, minus_one
);
917 cond
= lp_build_cmp(bld
, PIPE_FUNC_EQUAL
, a
, bld
->zero
);
918 res
= lp_build_select(bld
, cond
, bld
->zero
, res
);
925 * Set the sign of float vector 'a' according to 'sign'.
926 * If sign==0, return abs(a).
927 * If sign==1, return -abs(a);
928 * Other values for sign produce undefined results.
931 lp_build_set_sign(struct lp_build_context
*bld
,
932 LLVMValueRef a
, LLVMValueRef sign
)
934 const struct lp_type type
= bld
->type
;
935 LLVMTypeRef int_vec_type
= lp_build_int_vec_type(type
);
936 LLVMTypeRef vec_type
= lp_build_vec_type(type
);
937 LLVMValueRef shift
= lp_build_const_int_vec(type
, type
.width
- 1);
938 LLVMValueRef mask
= lp_build_const_int_vec(type
,
939 ~((unsigned long long) 1 << (type
.width
- 1)));
940 LLVMValueRef val
, res
;
942 assert(type
.floating
);
943 assert(lp_check_value(type
, a
));
945 /* val = reinterpret_cast<int>(a) */
946 val
= LLVMBuildBitCast(bld
->builder
, a
, int_vec_type
, "");
947 /* val = val & mask */
948 val
= LLVMBuildAnd(bld
->builder
, val
, mask
, "");
949 /* sign = sign << shift */
950 sign
= LLVMBuildShl(bld
->builder
, sign
, shift
, "");
951 /* res = val | sign */
952 res
= LLVMBuildOr(bld
->builder
, val
, sign
, "");
953 /* res = reinterpret_cast<float>(res) */
954 res
= LLVMBuildBitCast(bld
->builder
, res
, vec_type
, "");
961 * Convert vector of (or scalar) int to vector of (or scalar) float.
964 lp_build_int_to_float(struct lp_build_context
*bld
,
967 const struct lp_type type
= bld
->type
;
968 LLVMTypeRef vec_type
= lp_build_vec_type(type
);
970 assert(type
.floating
);
972 return LLVMBuildSIToFP(bld
->builder
, a
, vec_type
, "");
977 enum lp_build_round_sse41_mode
979 LP_BUILD_ROUND_SSE41_NEAREST
= 0,
980 LP_BUILD_ROUND_SSE41_FLOOR
= 1,
981 LP_BUILD_ROUND_SSE41_CEIL
= 2,
982 LP_BUILD_ROUND_SSE41_TRUNCATE
= 3
986 static INLINE LLVMValueRef
987 lp_build_round_sse41(struct lp_build_context
*bld
,
989 enum lp_build_round_sse41_mode mode
)
991 const struct lp_type type
= bld
->type
;
992 LLVMTypeRef vec_type
= lp_build_vec_type(type
);
993 const char *intrinsic
;
995 assert(type
.floating
);
996 assert(type
.width
*type
.length
== 128);
997 assert(lp_check_value(type
, a
));
998 assert(util_cpu_caps
.has_sse4_1
);
1000 switch(type
.width
) {
1002 intrinsic
= "llvm.x86.sse41.round.ps";
1005 intrinsic
= "llvm.x86.sse41.round.pd";
1012 return lp_build_intrinsic_binary(bld
->builder
, intrinsic
, vec_type
, a
,
1013 LLVMConstInt(LLVMInt32Type(), mode
, 0));
1018 * Return the integer part of a float (vector) value. The returned value is
1020 * Ex: trunc(-1.5) = 1.0
1023 lp_build_trunc(struct lp_build_context
*bld
,
1026 const struct lp_type type
= bld
->type
;
1028 assert(type
.floating
);
1029 assert(lp_check_value(type
, a
));
1031 if (util_cpu_caps
.has_sse4_1
&& type
.width
*type
.length
== 128)
1032 return lp_build_round_sse41(bld
, a
, LP_BUILD_ROUND_SSE41_TRUNCATE
);
1034 LLVMTypeRef vec_type
= lp_build_vec_type(type
);
1035 LLVMTypeRef int_vec_type
= lp_build_int_vec_type(type
);
1037 res
= LLVMBuildFPToSI(bld
->builder
, a
, int_vec_type
, "");
1038 res
= LLVMBuildSIToFP(bld
->builder
, res
, vec_type
, "");
1045 * Return float (vector) rounded to nearest integer (vector). The returned
1046 * value is a float (vector).
1047 * Ex: round(0.9) = 1.0
1048 * Ex: round(-1.5) = -2.0
1051 lp_build_round(struct lp_build_context
*bld
,
1054 const struct lp_type type
= bld
->type
;
1056 assert(type
.floating
);
1057 assert(lp_check_value(type
, a
));
1059 if (util_cpu_caps
.has_sse4_1
&& type
.width
*type
.length
== 128)
1060 return lp_build_round_sse41(bld
, a
, LP_BUILD_ROUND_SSE41_NEAREST
);
1062 LLVMTypeRef vec_type
= lp_build_vec_type(type
);
1064 res
= lp_build_iround(bld
, a
);
1065 res
= LLVMBuildSIToFP(bld
->builder
, res
, vec_type
, "");
1072 * Return floor of float (vector), result is a float (vector)
1073 * Ex: floor(1.1) = 1.0
1074 * Ex: floor(-1.1) = -2.0
1077 lp_build_floor(struct lp_build_context
*bld
,
1080 const struct lp_type type
= bld
->type
;
1082 assert(type
.floating
);
1083 assert(lp_check_value(type
, a
));
1085 if (util_cpu_caps
.has_sse4_1
&& type
.width
*type
.length
== 128)
1086 return lp_build_round_sse41(bld
, a
, LP_BUILD_ROUND_SSE41_FLOOR
);
1088 LLVMTypeRef vec_type
= lp_build_vec_type(type
);
1090 res
= lp_build_ifloor(bld
, a
);
1091 res
= LLVMBuildSIToFP(bld
->builder
, res
, vec_type
, "");
1098 * Return ceiling of float (vector), returning float (vector).
1099 * Ex: ceil( 1.1) = 2.0
1100 * Ex: ceil(-1.1) = -1.0
1103 lp_build_ceil(struct lp_build_context
*bld
,
1106 const struct lp_type type
= bld
->type
;
1108 assert(type
.floating
);
1109 assert(lp_check_value(type
, a
));
1111 if (util_cpu_caps
.has_sse4_1
&& type
.width
*type
.length
== 128)
1112 return lp_build_round_sse41(bld
, a
, LP_BUILD_ROUND_SSE41_CEIL
);
1114 LLVMTypeRef vec_type
= lp_build_vec_type(type
);
1116 res
= lp_build_iceil(bld
, a
);
1117 res
= LLVMBuildSIToFP(bld
->builder
, res
, vec_type
, "");
1124 * Return fractional part of 'a' computed as a - floor(a)
1125 * Typically used in texture coord arithmetic.
1128 lp_build_fract(struct lp_build_context
*bld
,
1131 assert(bld
->type
.floating
);
1132 return lp_build_sub(bld
, a
, lp_build_floor(bld
, a
));
1137 * Return the integer part of a float (vector) value. The returned value is
1138 * an integer (vector).
1139 * Ex: itrunc(-1.5) = 1
1142 lp_build_itrunc(struct lp_build_context
*bld
,
1145 const struct lp_type type
= bld
->type
;
1146 LLVMTypeRef int_vec_type
= lp_build_int_vec_type(type
);
1148 assert(type
.floating
);
1149 assert(lp_check_value(type
, a
));
1151 return LLVMBuildFPToSI(bld
->builder
, a
, int_vec_type
, "");
1156 * Return float (vector) rounded to nearest integer (vector). The returned
1157 * value is an integer (vector).
1158 * Ex: iround(0.9) = 1
1159 * Ex: iround(-1.5) = -2
1162 lp_build_iround(struct lp_build_context
*bld
,
1165 const struct lp_type type
= bld
->type
;
1166 LLVMTypeRef int_vec_type
= lp_build_int_vec_type(type
);
1169 assert(type
.floating
);
1171 assert(lp_check_value(type
, a
));
1173 if (util_cpu_caps
.has_sse4_1
&& type
.width
*type
.length
== 128) {
1174 res
= lp_build_round_sse41(bld
, a
, LP_BUILD_ROUND_SSE41_NEAREST
);
1177 LLVMTypeRef vec_type
= lp_build_vec_type(type
);
1178 LLVMValueRef mask
= lp_build_const_int_vec(type
, (unsigned long long)1 << (type
.width
- 1));
1183 sign
= LLVMBuildBitCast(bld
->builder
, a
, int_vec_type
, "");
1184 sign
= LLVMBuildAnd(bld
->builder
, sign
, mask
, "");
1187 half
= lp_build_const_vec(type
, 0.5);
1188 half
= LLVMBuildBitCast(bld
->builder
, half
, int_vec_type
, "");
1189 half
= LLVMBuildOr(bld
->builder
, sign
, half
, "");
1190 half
= LLVMBuildBitCast(bld
->builder
, half
, vec_type
, "");
1192 res
= LLVMBuildFAdd(bld
->builder
, a
, half
, "");
1195 res
= LLVMBuildFPToSI(bld
->builder
, res
, int_vec_type
, "");
1202 * Return floor of float (vector), result is an int (vector)
1203 * Ex: ifloor(1.1) = 1.0
1204 * Ex: ifloor(-1.1) = -2.0
1207 lp_build_ifloor(struct lp_build_context
*bld
,
1210 const struct lp_type type
= bld
->type
;
1211 LLVMTypeRef int_vec_type
= lp_build_int_vec_type(type
);
1214 assert(type
.floating
);
1215 assert(lp_check_value(type
, a
));
1217 if (util_cpu_caps
.has_sse4_1
&& type
.width
*type
.length
== 128) {
1218 res
= lp_build_round_sse41(bld
, a
, LP_BUILD_ROUND_SSE41_FLOOR
);
1221 /* Take the sign bit and add it to 1 constant */
1222 LLVMTypeRef vec_type
= lp_build_vec_type(type
);
1223 unsigned mantissa
= lp_mantissa(type
);
1224 LLVMValueRef mask
= lp_build_const_int_vec(type
, (unsigned long long)1 << (type
.width
- 1));
1226 LLVMValueRef offset
;
1228 /* sign = a < 0 ? ~0 : 0 */
1229 sign
= LLVMBuildBitCast(bld
->builder
, a
, int_vec_type
, "");
1230 sign
= LLVMBuildAnd(bld
->builder
, sign
, mask
, "");
1231 sign
= LLVMBuildAShr(bld
->builder
, sign
, lp_build_const_int_vec(type
, type
.width
- 1), "ifloor.sign");
1233 /* offset = -0.99999(9)f */
1234 offset
= lp_build_const_vec(type
, -(double)(((unsigned long long)1 << mantissa
) - 10)/((unsigned long long)1 << mantissa
));
1235 offset
= LLVMConstBitCast(offset
, int_vec_type
);
1237 /* offset = a < 0 ? offset : 0.0f */
1238 offset
= LLVMBuildAnd(bld
->builder
, offset
, sign
, "");
1239 offset
= LLVMBuildBitCast(bld
->builder
, offset
, vec_type
, "ifloor.offset");
1241 res
= LLVMBuildFAdd(bld
->builder
, a
, offset
, "ifloor.res");
1244 /* round to nearest (toward zero) */
1245 res
= LLVMBuildFPToSI(bld
->builder
, res
, int_vec_type
, "ifloor.res");
1252 * Return ceiling of float (vector), returning int (vector).
1253 * Ex: iceil( 1.1) = 2
1254 * Ex: iceil(-1.1) = -1
1257 lp_build_iceil(struct lp_build_context
*bld
,
1260 const struct lp_type type
= bld
->type
;
1261 LLVMTypeRef int_vec_type
= lp_build_int_vec_type(type
);
1264 assert(type
.floating
);
1265 assert(lp_check_value(type
, a
));
1267 if (util_cpu_caps
.has_sse4_1
&& type
.width
*type
.length
== 128) {
1268 res
= lp_build_round_sse41(bld
, a
, LP_BUILD_ROUND_SSE41_CEIL
);
1271 LLVMTypeRef vec_type
= lp_build_vec_type(type
);
1272 unsigned mantissa
= lp_mantissa(type
);
1273 LLVMValueRef mask
= lp_build_const_int_vec(type
, (unsigned long long)1 << (type
.width
- 1));
1275 LLVMValueRef offset
;
1277 /* sign = a < 0 ? 0 : ~0 */
1278 sign
= LLVMBuildBitCast(bld
->builder
, a
, int_vec_type
, "");
1279 sign
= LLVMBuildAnd(bld
->builder
, sign
, mask
, "");
1280 sign
= LLVMBuildAShr(bld
->builder
, sign
, lp_build_const_int_vec(type
, type
.width
- 1), "iceil.sign");
1281 sign
= LLVMBuildNot(bld
->builder
, sign
, "iceil.not");
1283 /* offset = 0.99999(9)f */
1284 offset
= lp_build_const_vec(type
, (double)(((unsigned long long)1 << mantissa
) - 10)/((unsigned long long)1 << mantissa
));
1285 offset
= LLVMConstBitCast(offset
, int_vec_type
);
1287 /* offset = a < 0 ? 0.0 : offset */
1288 offset
= LLVMBuildAnd(bld
->builder
, offset
, sign
, "");
1289 offset
= LLVMBuildBitCast(bld
->builder
, offset
, vec_type
, "iceil.offset");
1291 res
= LLVMBuildFAdd(bld
->builder
, a
, offset
, "iceil.res");
1294 /* round to nearest (toward zero) */
1295 res
= LLVMBuildFPToSI(bld
->builder
, res
, int_vec_type
, "iceil.res");
1302 lp_build_sqrt(struct lp_build_context
*bld
,
1305 const struct lp_type type
= bld
->type
;
1306 LLVMTypeRef vec_type
= lp_build_vec_type(type
);
1309 assert(lp_check_value(type
, a
));
1311 /* TODO: optimize the constant case */
1312 /* TODO: optimize the constant case */
1314 assert(type
.floating
);
1315 util_snprintf(intrinsic
, sizeof intrinsic
, "llvm.sqrt.v%uf%u", type
.length
, type
.width
);
1317 return lp_build_intrinsic_unary(bld
->builder
, intrinsic
, vec_type
, a
);
1322 * Do one Newton-Raphson step to improve reciprocate precision:
1324 * x_{i+1} = x_i * (2 - a * x_i)
1326 * XXX: Unfortunately this won't give IEEE-754 conformant results for 0 or
1327 * +/-Inf, giving NaN instead. Certain applications rely on this behavior,
1328 * such as Google Earth, which does RCP(RSQRT(0.0) when drawing the Earth's
1329 * halo. It would be necessary to clamp the argument to prevent this.
1332 * - http://en.wikipedia.org/wiki/Division_(digital)#Newton.E2.80.93Raphson_division
1333 * - http://softwarecommunity.intel.com/articles/eng/1818.htm
1335 static INLINE LLVMValueRef
1336 lp_build_rcp_refine(struct lp_build_context
*bld
,
1340 LLVMValueRef two
= lp_build_const_vec(bld
->type
, 2.0);
1343 res
= LLVMBuildFMul(bld
->builder
, a
, rcp_a
, "");
1344 res
= LLVMBuildFSub(bld
->builder
, two
, res
, "");
1345 res
= LLVMBuildFMul(bld
->builder
, rcp_a
, res
, "");
1352 lp_build_rcp(struct lp_build_context
*bld
,
1355 const struct lp_type type
= bld
->type
;
1357 assert(lp_check_value(type
, a
));
1366 assert(type
.floating
);
1368 if(LLVMIsConstant(a
))
1369 return LLVMConstFDiv(bld
->one
, a
);
1372 * We don't use RCPPS because:
1373 * - it only has 10bits of precision
1374 * - it doesn't even get the reciprocate of 1.0 exactly
1375 * - doing Newton-Rapshon steps yields wrong (NaN) values for 0.0 or Inf
1376 * - for recent processors the benefit over DIVPS is marginal, a case
1379 * We could still use it on certain processors if benchmarks show that the
1380 * RCPPS plus necessary workarounds are still preferrable to DIVPS; or for
1381 * particular uses that require less workarounds.
1384 if (FALSE
&& util_cpu_caps
.has_sse
&& type
.width
== 32 && type
.length
== 4) {
1385 const unsigned num_iterations
= 0;
1389 res
= lp_build_intrinsic_unary(bld
->builder
, "llvm.x86.sse.rcp.ps", bld
->vec_type
, a
);
1391 for (i
= 0; i
< num_iterations
; ++i
) {
1392 res
= lp_build_rcp_refine(bld
, a
, res
);
1398 return LLVMBuildFDiv(bld
->builder
, bld
->one
, a
, "");
1403 * Do one Newton-Raphson step to improve rsqrt precision:
1405 * x_{i+1} = 0.5 * x_i * (3.0 - a * x_i * x_i)
1408 * - http://softwarecommunity.intel.com/articles/eng/1818.htm
1410 static INLINE LLVMValueRef
1411 lp_build_rsqrt_refine(struct lp_build_context
*bld
,
1413 LLVMValueRef rsqrt_a
)
1415 LLVMValueRef half
= lp_build_const_vec(bld
->type
, 0.5);
1416 LLVMValueRef three
= lp_build_const_vec(bld
->type
, 3.0);
1419 res
= LLVMBuildFMul(bld
->builder
, rsqrt_a
, rsqrt_a
, "");
1420 res
= LLVMBuildFMul(bld
->builder
, a
, res
, "");
1421 res
= LLVMBuildFSub(bld
->builder
, three
, res
, "");
1422 res
= LLVMBuildFMul(bld
->builder
, rsqrt_a
, res
, "");
1423 res
= LLVMBuildFMul(bld
->builder
, half
, res
, "");
1430 * Generate 1/sqrt(a)
1433 lp_build_rsqrt(struct lp_build_context
*bld
,
1436 const struct lp_type type
= bld
->type
;
1438 assert(lp_check_value(type
, a
));
1440 assert(type
.floating
);
1442 if (util_cpu_caps
.has_sse
&& type
.width
== 32 && type
.length
== 4) {
1443 const unsigned num_iterations
= 0;
1447 res
= lp_build_intrinsic_unary(bld
->builder
, "llvm.x86.sse.rsqrt.ps", bld
->vec_type
, a
);
1449 for (i
= 0; i
< num_iterations
; ++i
) {
1450 res
= lp_build_rsqrt_refine(bld
, a
, res
);
1456 return lp_build_rcp(bld
, lp_build_sqrt(bld
, a
));
1460 static inline LLVMValueRef
1461 lp_build_const_v4si(unsigned long value
)
1463 LLVMValueRef element
= LLVMConstInt(LLVMInt32Type(), value
, 0);
1464 LLVMValueRef elements
[4] = { element
, element
, element
, element
};
1465 return LLVMConstVector(elements
, 4);
1468 static inline LLVMValueRef
1469 lp_build_const_v4sf(float value
)
1471 LLVMValueRef element
= LLVMConstReal(LLVMFloatType(), value
);
1472 LLVMValueRef elements
[4] = { element
, element
, element
, element
};
1473 return LLVMConstVector(elements
, 4);
1478 * Generate sin(a) using SSE2
1481 lp_build_sin(struct lp_build_context
*bld
,
1484 struct lp_type int_type
= lp_int_type(bld
->type
);
1485 LLVMBuilderRef b
= bld
->builder
;
1486 LLVMTypeRef v4sf
= LLVMVectorType(LLVMFloatType(), 4);
1487 LLVMTypeRef v4si
= LLVMVectorType(LLVMInt32Type(), 4);
1490 * take the absolute value,
1491 * x = _mm_and_ps(x, *(v4sf*)_ps_inv_sign_mask);
1494 LLVMValueRef inv_sig_mask
= lp_build_const_v4si(~0x80000000);
1495 LLVMValueRef a_v4si
= LLVMBuildBitCast(b
, a
, v4si
, "a_v4si");
1497 LLVMValueRef absi
= LLVMBuildAnd(b
, a_v4si
, inv_sig_mask
, "absi");
1498 LLVMValueRef x_abs
= LLVMBuildBitCast(b
, absi
, v4sf
, "x_abs");
1501 * extract the sign bit (upper one)
1502 * sign_bit = _mm_and_ps(sign_bit, *(v4sf*)_ps_sign_mask);
1504 LLVMValueRef sig_mask
= lp_build_const_v4si(0x80000000);
1505 LLVMValueRef sign_bit_i
= LLVMBuildAnd(b
, a_v4si
, sig_mask
, "sign_bit_i");
1509 * y = _mm_mul_ps(x, *(v4sf*)_ps_cephes_FOPI);
1512 LLVMValueRef FOPi
= lp_build_const_v4sf(1.27323954473516);
1513 LLVMValueRef scale_y
= LLVMBuildFMul(b
, x_abs
, FOPi
, "scale_y");
1516 * store the integer part of y in mm0
1517 * emm2 = _mm_cvttps_epi32(y);
1520 LLVMValueRef emm2_i
= LLVMBuildFPToSI(b
, scale_y
, v4si
, "emm2_i");
1523 * j=(j+1) & (~1) (see the cephes sources)
1524 * emm2 = _mm_add_epi32(emm2, *(v4si*)_pi32_1);
1527 LLVMValueRef all_one
= lp_build_const_v4si(1);
1528 LLVMValueRef emm2_add
= LLVMBuildAdd(b
, emm2_i
, all_one
, "emm2_add");
1530 * emm2 = _mm_and_si128(emm2, *(v4si*)_pi32_inv1);
1532 LLVMValueRef inv_one
= lp_build_const_v4si(~1);
1533 LLVMValueRef emm2_and
= LLVMBuildAnd(b
, emm2_add
, inv_one
, "emm2_and");
1536 * y = _mm_cvtepi32_ps(emm2);
1538 LLVMValueRef y_2
= LLVMBuildSIToFP(b
, emm2_and
, v4sf
, "y_2");
1540 /* get the swap sign flag
1541 * emm0 = _mm_and_si128(emm2, *(v4si*)_pi32_4);
1543 LLVMValueRef pi32_4
= lp_build_const_v4si(4);
1544 LLVMValueRef emm0_and
= LLVMBuildAnd(b
, emm2_add
, pi32_4
, "emm0_and");
1547 * emm2 = _mm_slli_epi32(emm0, 29);
1549 LLVMValueRef const_29
= lp_build_const_v4si(29);
1550 LLVMValueRef swap_sign_bit
= LLVMBuildShl(b
, emm0_and
, const_29
, "swap_sign_bit");
1553 * get the polynom selection mask
1554 * there is one polynom for 0 <= x <= Pi/4
1555 * and another one for Pi/4<x<=Pi/2
1556 * Both branches will be computed.
1558 * emm2 = _mm_and_si128(emm2, *(v4si*)_pi32_2);
1559 * emm2 = _mm_cmpeq_epi32(emm2, _mm_setzero_si128());
1562 LLVMValueRef pi32_2
= lp_build_const_v4si(2);
1563 LLVMValueRef emm2_3
= LLVMBuildAnd(b
, emm2_and
, pi32_2
, "emm2_3");
1564 LLVMValueRef poly_mask
= lp_build_compare(b
, int_type
, PIPE_FUNC_EQUAL
,
1565 emm2_3
, lp_build_const_v4si(0));
1567 * sign_bit = _mm_xor_ps(sign_bit, swap_sign_bit);
1569 LLVMValueRef sign_bit_1
= LLVMBuildXor(b
, sign_bit_i
, swap_sign_bit
, "sign_bit");
1572 * _PS_CONST(minus_cephes_DP1, -0.78515625);
1573 * _PS_CONST(minus_cephes_DP2, -2.4187564849853515625e-4);
1574 * _PS_CONST(minus_cephes_DP3, -3.77489497744594108e-8);
1576 LLVMValueRef DP1
= lp_build_const_v4sf(-0.78515625);
1577 LLVMValueRef DP2
= lp_build_const_v4sf(-2.4187564849853515625e-4);
1578 LLVMValueRef DP3
= lp_build_const_v4sf(-3.77489497744594108e-8);
1581 * The magic pass: "Extended precision modular arithmetic"
1582 * x = ((x - y * DP1) - y * DP2) - y * DP3;
1583 * xmm1 = _mm_mul_ps(y, xmm1);
1584 * xmm2 = _mm_mul_ps(y, xmm2);
1585 * xmm3 = _mm_mul_ps(y, xmm3);
1587 LLVMValueRef xmm1
= LLVMBuildFMul(b
, y_2
, DP1
, "xmm1");
1588 LLVMValueRef xmm2
= LLVMBuildFMul(b
, y_2
, DP2
, "xmm2");
1589 LLVMValueRef xmm3
= LLVMBuildFMul(b
, y_2
, DP3
, "xmm3");
1592 * x = _mm_add_ps(x, xmm1);
1593 * x = _mm_add_ps(x, xmm2);
1594 * x = _mm_add_ps(x, xmm3);
1597 LLVMValueRef x_1
= LLVMBuildFAdd(b
, x_abs
, xmm1
, "x_1");
1598 LLVMValueRef x_2
= LLVMBuildFAdd(b
, x_1
, xmm2
, "x_2");
1599 LLVMValueRef x_3
= LLVMBuildFAdd(b
, x_2
, xmm3
, "x_3");
1602 * Evaluate the first polynom (0 <= x <= Pi/4)
1604 * z = _mm_mul_ps(x,x);
1606 LLVMValueRef z
= LLVMBuildFMul(b
, x_3
, x_3
, "z");
1609 * _PS_CONST(coscof_p0, 2.443315711809948E-005);
1610 * _PS_CONST(coscof_p1, -1.388731625493765E-003);
1611 * _PS_CONST(coscof_p2, 4.166664568298827E-002);
1613 LLVMValueRef coscof_p0
= lp_build_const_v4sf(2.443315711809948E-005);
1614 LLVMValueRef coscof_p1
= lp_build_const_v4sf(-1.388731625493765E-003);
1615 LLVMValueRef coscof_p2
= lp_build_const_v4sf(4.166664568298827E-002);
1618 * y = *(v4sf*)_ps_coscof_p0;
1619 * y = _mm_mul_ps(y, z);
1621 LLVMValueRef y_3
= LLVMBuildFMul(b
, z
, coscof_p0
, "y_3");
1622 LLVMValueRef y_4
= LLVMBuildFAdd(b
, y_3
, coscof_p1
, "y_4");
1623 LLVMValueRef y_5
= LLVMBuildFMul(b
, y_4
, z
, "y_5");
1624 LLVMValueRef y_6
= LLVMBuildFAdd(b
, y_5
, coscof_p2
, "y_6");
1625 LLVMValueRef y_7
= LLVMBuildFMul(b
, y_6
, z
, "y_7");
1626 LLVMValueRef y_8
= LLVMBuildFMul(b
, y_7
, z
, "y_8");
1630 * tmp = _mm_mul_ps(z, *(v4sf*)_ps_0p5);
1631 * y = _mm_sub_ps(y, tmp);
1632 * y = _mm_add_ps(y, *(v4sf*)_ps_1);
1634 LLVMValueRef half
= lp_build_const_v4sf(0.5);
1635 LLVMValueRef tmp
= LLVMBuildFMul(b
, z
, half
, "tmp");
1636 LLVMValueRef y_9
= LLVMBuildFSub(b
, y_8
, tmp
, "y_8");
1637 LLVMValueRef one
= lp_build_const_v4sf(1.0);
1638 LLVMValueRef y_10
= LLVMBuildFAdd(b
, y_9
, one
, "y_9");
1641 * _PS_CONST(sincof_p0, -1.9515295891E-4);
1642 * _PS_CONST(sincof_p1, 8.3321608736E-3);
1643 * _PS_CONST(sincof_p2, -1.6666654611E-1);
1645 LLVMValueRef sincof_p0
= lp_build_const_v4sf(-1.9515295891E-4);
1646 LLVMValueRef sincof_p1
= lp_build_const_v4sf(8.3321608736E-3);
1647 LLVMValueRef sincof_p2
= lp_build_const_v4sf(-1.6666654611E-1);
1650 * Evaluate the second polynom (Pi/4 <= x <= 0)
1652 * y2 = *(v4sf*)_ps_sincof_p0;
1653 * y2 = _mm_mul_ps(y2, z);
1654 * y2 = _mm_add_ps(y2, *(v4sf*)_ps_sincof_p1);
1655 * y2 = _mm_mul_ps(y2, z);
1656 * y2 = _mm_add_ps(y2, *(v4sf*)_ps_sincof_p2);
1657 * y2 = _mm_mul_ps(y2, z);
1658 * y2 = _mm_mul_ps(y2, x);
1659 * y2 = _mm_add_ps(y2, x);
1662 LLVMValueRef y2_3
= LLVMBuildFMul(b
, z
, sincof_p0
, "y2_3");
1663 LLVMValueRef y2_4
= LLVMBuildFAdd(b
, y2_3
, sincof_p1
, "y2_4");
1664 LLVMValueRef y2_5
= LLVMBuildFMul(b
, y2_4
, z
, "y2_5");
1665 LLVMValueRef y2_6
= LLVMBuildFAdd(b
, y2_5
, sincof_p2
, "y2_6");
1666 LLVMValueRef y2_7
= LLVMBuildFMul(b
, y2_6
, z
, "y2_7");
1667 LLVMValueRef y2_8
= LLVMBuildFMul(b
, y2_7
, x_3
, "y2_8");
1668 LLVMValueRef y2_9
= LLVMBuildFAdd(b
, y2_8
, x_3
, "y2_9");
1671 * select the correct result from the two polynoms
1673 * y2 = _mm_and_ps(xmm3, y2); //, xmm3);
1674 * y = _mm_andnot_ps(xmm3, y);
1675 * y = _mm_add_ps(y,y2);
1677 LLVMValueRef y2_i
= LLVMBuildBitCast(b
, y2_9
, v4si
, "y2_i");
1678 LLVMValueRef y_i
= LLVMBuildBitCast(b
, y_10
, v4si
, "y_i");
1679 LLVMValueRef y2_and
= LLVMBuildAnd(b
, y2_i
, poly_mask
, "y2_and");
1680 LLVMValueRef inv
= lp_build_const_v4si(~0);
1681 LLVMValueRef poly_mask_inv
= LLVMBuildXor(b
, poly_mask
, inv
, "poly_mask_inv");
1682 LLVMValueRef y_and
= LLVMBuildAnd(b
, y_i
, poly_mask_inv
, "y_and");
1683 LLVMValueRef y_combine
= LLVMBuildAdd(b
, y_and
, y2_and
, "y_combine");
1687 * y = _mm_xor_ps(y, sign_bit);
1689 LLVMValueRef y_sign
= LLVMBuildXor(b
, y_combine
, sign_bit_1
, "y_sin");
1690 LLVMValueRef y_result
= LLVMBuildBitCast(b
, y_sign
, v4sf
, "y_result");
1696 * Generate cos(a) using SSE2
1699 lp_build_cos(struct lp_build_context
*bld
,
1702 struct lp_type int_type
= lp_int_type(bld
->type
);
1703 LLVMBuilderRef b
= bld
->builder
;
1704 LLVMTypeRef v4sf
= LLVMVectorType(LLVMFloatType(), 4);
1705 LLVMTypeRef v4si
= LLVMVectorType(LLVMInt32Type(), 4);
1708 * take the absolute value,
1709 * x = _mm_and_ps(x, *(v4sf*)_ps_inv_sign_mask);
1712 LLVMValueRef inv_sig_mask
= lp_build_const_v4si(~0x80000000);
1713 LLVMValueRef a_v4si
= LLVMBuildBitCast(b
, a
, v4si
, "a_v4si");
1715 LLVMValueRef absi
= LLVMBuildAnd(b
, a_v4si
, inv_sig_mask
, "absi");
1716 LLVMValueRef x_abs
= LLVMBuildBitCast(b
, absi
, v4sf
, "x_abs");
1720 * y = _mm_mul_ps(x, *(v4sf*)_ps_cephes_FOPI);
1723 LLVMValueRef FOPi
= lp_build_const_v4sf(1.27323954473516);
1724 LLVMValueRef scale_y
= LLVMBuildFMul(b
, x_abs
, FOPi
, "scale_y");
1727 * store the integer part of y in mm0
1728 * emm2 = _mm_cvttps_epi32(y);
1731 LLVMValueRef emm2_i
= LLVMBuildFPToSI(b
, scale_y
, v4si
, "emm2_i");
1734 * j=(j+1) & (~1) (see the cephes sources)
1735 * emm2 = _mm_add_epi32(emm2, *(v4si*)_pi32_1);
1738 LLVMValueRef all_one
= lp_build_const_v4si(1);
1739 LLVMValueRef emm2_add
= LLVMBuildAdd(b
, emm2_i
, all_one
, "emm2_add");
1741 * emm2 = _mm_and_si128(emm2, *(v4si*)_pi32_inv1);
1743 LLVMValueRef inv_one
= lp_build_const_v4si(~1);
1744 LLVMValueRef emm2_and
= LLVMBuildAnd(b
, emm2_add
, inv_one
, "emm2_and");
1747 * y = _mm_cvtepi32_ps(emm2);
1749 LLVMValueRef y_2
= LLVMBuildSIToFP(b
, emm2_and
, v4sf
, "y_2");
1753 * emm2 = _mm_sub_epi32(emm2, *(v4si*)_pi32_2);
1755 LLVMValueRef const_2
= lp_build_const_v4si(2);
1756 LLVMValueRef emm2_2
= LLVMBuildSub(b
, emm2_and
, const_2
, "emm2_2");
1759 /* get the swap sign flag
1760 * emm0 = _mm_andnot_si128(emm2, *(v4si*)_pi32_4);
1762 LLVMValueRef inv
= lp_build_const_v4si(~0);
1763 LLVMValueRef emm0_not
= LLVMBuildXor(b
, emm2_2
, inv
, "emm0_not");
1764 LLVMValueRef pi32_4
= lp_build_const_v4si(4);
1765 LLVMValueRef emm0_and
= LLVMBuildAnd(b
, emm0_not
, pi32_4
, "emm0_and");
1768 * emm2 = _mm_slli_epi32(emm0, 29);
1770 LLVMValueRef const_29
= lp_build_const_v4si(29);
1771 LLVMValueRef sign_bit
= LLVMBuildShl(b
, emm0_and
, const_29
, "sign_bit");
1774 * get the polynom selection mask
1775 * there is one polynom for 0 <= x <= Pi/4
1776 * and another one for Pi/4<x<=Pi/2
1777 * Both branches will be computed.
1779 * emm2 = _mm_and_si128(emm2, *(v4si*)_pi32_2);
1780 * emm2 = _mm_cmpeq_epi32(emm2, _mm_setzero_si128());
1783 LLVMValueRef pi32_2
= lp_build_const_v4si(2);
1784 LLVMValueRef emm2_3
= LLVMBuildAnd(b
, emm2_2
, pi32_2
, "emm2_3");
1785 LLVMValueRef poly_mask
= lp_build_compare(b
, int_type
, PIPE_FUNC_EQUAL
,
1786 emm2_3
, lp_build_const_v4si(0));
1789 * _PS_CONST(minus_cephes_DP1, -0.78515625);
1790 * _PS_CONST(minus_cephes_DP2, -2.4187564849853515625e-4);
1791 * _PS_CONST(minus_cephes_DP3, -3.77489497744594108e-8);
1793 LLVMValueRef DP1
= lp_build_const_v4sf(-0.78515625);
1794 LLVMValueRef DP2
= lp_build_const_v4sf(-2.4187564849853515625e-4);
1795 LLVMValueRef DP3
= lp_build_const_v4sf(-3.77489497744594108e-8);
1798 * The magic pass: "Extended precision modular arithmetic"
1799 * x = ((x - y * DP1) - y * DP2) - y * DP3;
1800 * xmm1 = _mm_mul_ps(y, xmm1);
1801 * xmm2 = _mm_mul_ps(y, xmm2);
1802 * xmm3 = _mm_mul_ps(y, xmm3);
1804 LLVMValueRef xmm1
= LLVMBuildFMul(b
, y_2
, DP1
, "xmm1");
1805 LLVMValueRef xmm2
= LLVMBuildFMul(b
, y_2
, DP2
, "xmm2");
1806 LLVMValueRef xmm3
= LLVMBuildFMul(b
, y_2
, DP3
, "xmm3");
1809 * x = _mm_add_ps(x, xmm1);
1810 * x = _mm_add_ps(x, xmm2);
1811 * x = _mm_add_ps(x, xmm3);
1814 LLVMValueRef x_1
= LLVMBuildFAdd(b
, x_abs
, xmm1
, "x_1");
1815 LLVMValueRef x_2
= LLVMBuildFAdd(b
, x_1
, xmm2
, "x_2");
1816 LLVMValueRef x_3
= LLVMBuildFAdd(b
, x_2
, xmm3
, "x_3");
1819 * Evaluate the first polynom (0 <= x <= Pi/4)
1821 * z = _mm_mul_ps(x,x);
1823 LLVMValueRef z
= LLVMBuildFMul(b
, x_3
, x_3
, "z");
1826 * _PS_CONST(coscof_p0, 2.443315711809948E-005);
1827 * _PS_CONST(coscof_p1, -1.388731625493765E-003);
1828 * _PS_CONST(coscof_p2, 4.166664568298827E-002);
1830 LLVMValueRef coscof_p0
= lp_build_const_v4sf(2.443315711809948E-005);
1831 LLVMValueRef coscof_p1
= lp_build_const_v4sf(-1.388731625493765E-003);
1832 LLVMValueRef coscof_p2
= lp_build_const_v4sf(4.166664568298827E-002);
1835 * y = *(v4sf*)_ps_coscof_p0;
1836 * y = _mm_mul_ps(y, z);
1838 LLVMValueRef y_3
= LLVMBuildFMul(b
, z
, coscof_p0
, "y_3");
1839 LLVMValueRef y_4
= LLVMBuildFAdd(b
, y_3
, coscof_p1
, "y_4");
1840 LLVMValueRef y_5
= LLVMBuildFMul(b
, y_4
, z
, "y_5");
1841 LLVMValueRef y_6
= LLVMBuildFAdd(b
, y_5
, coscof_p2
, "y_6");
1842 LLVMValueRef y_7
= LLVMBuildFMul(b
, y_6
, z
, "y_7");
1843 LLVMValueRef y_8
= LLVMBuildFMul(b
, y_7
, z
, "y_8");
1847 * tmp = _mm_mul_ps(z, *(v4sf*)_ps_0p5);
1848 * y = _mm_sub_ps(y, tmp);
1849 * y = _mm_add_ps(y, *(v4sf*)_ps_1);
1851 LLVMValueRef half
= lp_build_const_v4sf(0.5);
1852 LLVMValueRef tmp
= LLVMBuildFMul(b
, z
, half
, "tmp");
1853 LLVMValueRef y_9
= LLVMBuildFSub(b
, y_8
, tmp
, "y_8");
1854 LLVMValueRef one
= lp_build_const_v4sf(1.0);
1855 LLVMValueRef y_10
= LLVMBuildFAdd(b
, y_9
, one
, "y_9");
1858 * _PS_CONST(sincof_p0, -1.9515295891E-4);
1859 * _PS_CONST(sincof_p1, 8.3321608736E-3);
1860 * _PS_CONST(sincof_p2, -1.6666654611E-1);
1862 LLVMValueRef sincof_p0
= lp_build_const_v4sf(-1.9515295891E-4);
1863 LLVMValueRef sincof_p1
= lp_build_const_v4sf(8.3321608736E-3);
1864 LLVMValueRef sincof_p2
= lp_build_const_v4sf(-1.6666654611E-1);
1867 * Evaluate the second polynom (Pi/4 <= x <= 0)
1869 * y2 = *(v4sf*)_ps_sincof_p0;
1870 * y2 = _mm_mul_ps(y2, z);
1871 * y2 = _mm_add_ps(y2, *(v4sf*)_ps_sincof_p1);
1872 * y2 = _mm_mul_ps(y2, z);
1873 * y2 = _mm_add_ps(y2, *(v4sf*)_ps_sincof_p2);
1874 * y2 = _mm_mul_ps(y2, z);
1875 * y2 = _mm_mul_ps(y2, x);
1876 * y2 = _mm_add_ps(y2, x);
1879 LLVMValueRef y2_3
= LLVMBuildFMul(b
, z
, sincof_p0
, "y2_3");
1880 LLVMValueRef y2_4
= LLVMBuildFAdd(b
, y2_3
, sincof_p1
, "y2_4");
1881 LLVMValueRef y2_5
= LLVMBuildFMul(b
, y2_4
, z
, "y2_5");
1882 LLVMValueRef y2_6
= LLVMBuildFAdd(b
, y2_5
, sincof_p2
, "y2_6");
1883 LLVMValueRef y2_7
= LLVMBuildFMul(b
, y2_6
, z
, "y2_7");
1884 LLVMValueRef y2_8
= LLVMBuildFMul(b
, y2_7
, x_3
, "y2_8");
1885 LLVMValueRef y2_9
= LLVMBuildFAdd(b
, y2_8
, x_3
, "y2_9");
1888 * select the correct result from the two polynoms
1890 * y2 = _mm_and_ps(xmm3, y2); //, xmm3);
1891 * y = _mm_andnot_ps(xmm3, y);
1892 * y = _mm_add_ps(y,y2);
1894 LLVMValueRef y2_i
= LLVMBuildBitCast(b
, y2_9
, v4si
, "y2_i");
1895 LLVMValueRef y_i
= LLVMBuildBitCast(b
, y_10
, v4si
, "y_i");
1896 LLVMValueRef y2_and
= LLVMBuildAnd(b
, y2_i
, poly_mask
, "y2_and");
1897 LLVMValueRef poly_mask_inv
= LLVMBuildXor(b
, poly_mask
, inv
, "poly_mask_inv");
1898 LLVMValueRef y_and
= LLVMBuildAnd(b
, y_i
, poly_mask_inv
, "y_and");
1899 LLVMValueRef y_combine
= LLVMBuildAdd(b
, y_and
, y2_and
, "y_combine");
1903 * y = _mm_xor_ps(y, sign_bit);
1905 LLVMValueRef y_sign
= LLVMBuildXor(b
, y_combine
, sign_bit
, "y_sin");
1906 LLVMValueRef y_result
= LLVMBuildBitCast(b
, y_sign
, v4sf
, "y_result");
1912 * Generate pow(x, y)
1915 lp_build_pow(struct lp_build_context
*bld
,
1919 /* TODO: optimize the constant case */
1920 if (gallivm_debug
& GALLIVM_DEBUG_PERF
&&
1921 LLVMIsConstant(x
) && LLVMIsConstant(y
)) {
1922 debug_printf("%s: inefficient/imprecise constant arithmetic\n",
1926 return lp_build_exp2(bld
, lp_build_mul(bld
, lp_build_log2(bld
, x
), y
));
1934 lp_build_exp(struct lp_build_context
*bld
,
1937 /* log2(e) = 1/log(2) */
1938 LLVMValueRef log2e
= lp_build_const_vec(bld
->type
, 1.4426950408889634);
1940 assert(lp_check_value(bld
->type
, x
));
1942 return lp_build_mul(bld
, log2e
, lp_build_exp2(bld
, x
));
1950 lp_build_log(struct lp_build_context
*bld
,
1954 LLVMValueRef log2
= lp_build_const_vec(bld
->type
, 0.69314718055994529);
1956 assert(lp_check_value(bld
->type
, x
));
1958 return lp_build_mul(bld
, log2
, lp_build_exp2(bld
, x
));
1963 * Generate polynomial.
1964 * Ex: coeffs[0] + x * coeffs[1] + x^2 * coeffs[2].
1967 lp_build_polynomial(struct lp_build_context
*bld
,
1969 const double *coeffs
,
1970 unsigned num_coeffs
)
1972 const struct lp_type type
= bld
->type
;
1973 LLVMValueRef res
= NULL
;
1976 assert(lp_check_value(bld
->type
, x
));
1978 /* TODO: optimize the constant case */
1979 if (gallivm_debug
& GALLIVM_DEBUG_PERF
&&
1980 LLVMIsConstant(x
)) {
1981 debug_printf("%s: inefficient/imprecise constant arithmetic\n",
1985 for (i
= num_coeffs
; i
--; ) {
1988 coeff
= lp_build_const_vec(type
, coeffs
[i
]);
1991 res
= lp_build_add(bld
, coeff
, lp_build_mul(bld
, x
, res
));
2004 * Minimax polynomial fit of 2**x, in range [0, 1[
2006 const double lp_build_exp2_polynomial
[] = {
2007 #if EXP_POLY_DEGREE == 5
2008 0.999999999690134838155,
2009 0.583974334321735217258,
2010 0.164553105719676828492,
2011 0.0292811063701710962255,
2012 0.00354944426657875141846,
2013 0.000296253726543423377365
2014 #elif EXP_POLY_DEGREE == 4
2015 1.00000001502262084505,
2016 0.563586057338685991394,
2017 0.150436017652442413623,
2018 0.0243220604213317927308,
2019 0.0025359088446580436489
2020 #elif EXP_POLY_DEGREE == 3
2021 0.999925218562710312959,
2022 0.695833540494823811697,
2023 0.226067155427249155588,
2024 0.0780245226406372992967
2025 #elif EXP_POLY_DEGREE == 2
2026 1.00172476321474503578,
2027 0.657636275736077639316,
2028 0.33718943461968720704
2036 lp_build_exp2_approx(struct lp_build_context
*bld
,
2038 LLVMValueRef
*p_exp2_int_part
,
2039 LLVMValueRef
*p_frac_part
,
2040 LLVMValueRef
*p_exp2
)
2042 const struct lp_type type
= bld
->type
;
2043 LLVMTypeRef vec_type
= lp_build_vec_type(type
);
2044 LLVMTypeRef int_vec_type
= lp_build_int_vec_type(type
);
2045 LLVMValueRef ipart
= NULL
;
2046 LLVMValueRef fpart
= NULL
;
2047 LLVMValueRef expipart
= NULL
;
2048 LLVMValueRef expfpart
= NULL
;
2049 LLVMValueRef res
= NULL
;
2051 assert(lp_check_value(bld
->type
, x
));
2053 if(p_exp2_int_part
|| p_frac_part
|| p_exp2
) {
2054 /* TODO: optimize the constant case */
2055 if (gallivm_debug
& GALLIVM_DEBUG_PERF
&&
2056 LLVMIsConstant(x
)) {
2057 debug_printf("%s: inefficient/imprecise constant arithmetic\n",
2061 assert(type
.floating
&& type
.width
== 32);
2063 x
= lp_build_min(bld
, x
, lp_build_const_vec(type
, 129.0));
2064 x
= lp_build_max(bld
, x
, lp_build_const_vec(type
, -126.99999));
2066 /* ipart = floor(x) */
2067 ipart
= lp_build_floor(bld
, x
);
2069 /* fpart = x - ipart */
2070 fpart
= LLVMBuildFSub(bld
->builder
, x
, ipart
, "");
2073 if(p_exp2_int_part
|| p_exp2
) {
2074 /* expipart = (float) (1 << ipart) */
2075 ipart
= LLVMBuildFPToSI(bld
->builder
, ipart
, int_vec_type
, "");
2076 expipart
= LLVMBuildAdd(bld
->builder
, ipart
, lp_build_const_int_vec(type
, 127), "");
2077 expipart
= LLVMBuildShl(bld
->builder
, expipart
, lp_build_const_int_vec(type
, 23), "");
2078 expipart
= LLVMBuildBitCast(bld
->builder
, expipart
, vec_type
, "");
2082 expfpart
= lp_build_polynomial(bld
, fpart
, lp_build_exp2_polynomial
,
2083 Elements(lp_build_exp2_polynomial
));
2085 res
= LLVMBuildFMul(bld
->builder
, expipart
, expfpart
, "");
2089 *p_exp2_int_part
= expipart
;
2092 *p_frac_part
= fpart
;
2100 lp_build_exp2(struct lp_build_context
*bld
,
2104 lp_build_exp2_approx(bld
, x
, NULL
, NULL
, &res
);
2110 * Minimax polynomial fit of log2(x)/(x - 1), for x in range [1, 2[
2111 * These coefficients can be generate with
2112 * http://www.boost.org/doc/libs/1_36_0/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/minimax.html
2114 const double lp_build_log2_polynomial
[] = {
2115 #if LOG_POLY_DEGREE == 6
2116 3.11578814719469302614,
2117 -3.32419399085241980044,
2118 2.59883907202499966007,
2119 -1.23152682416275988241,
2120 0.318212422185251071475,
2121 -0.0344359067839062357313
2122 #elif LOG_POLY_DEGREE == 5
2123 2.8882704548164776201,
2124 -2.52074962577807006663,
2125 1.48116647521213171641,
2126 -0.465725644288844778798,
2127 0.0596515482674574969533
2128 #elif LOG_POLY_DEGREE == 4
2129 2.61761038894603480148,
2130 -1.75647175389045657003,
2131 0.688243882994381274313,
2132 -0.107254423828329604454
2133 #elif LOG_POLY_DEGREE == 3
2134 2.28330284476918490682,
2135 -1.04913055217340124191,
2136 0.204446009836232697516
2144 * See http://www.devmaster.net/forums/showthread.php?p=43580
2147 lp_build_log2_approx(struct lp_build_context
*bld
,
2149 LLVMValueRef
*p_exp
,
2150 LLVMValueRef
*p_floor_log2
,
2151 LLVMValueRef
*p_log2
)
2153 const struct lp_type type
= bld
->type
;
2154 LLVMTypeRef vec_type
= lp_build_vec_type(type
);
2155 LLVMTypeRef int_vec_type
= lp_build_int_vec_type(type
);
2157 LLVMValueRef expmask
= lp_build_const_int_vec(type
, 0x7f800000);
2158 LLVMValueRef mantmask
= lp_build_const_int_vec(type
, 0x007fffff);
2159 LLVMValueRef one
= LLVMConstBitCast(bld
->one
, int_vec_type
);
2161 LLVMValueRef i
= NULL
;
2162 LLVMValueRef exp
= NULL
;
2163 LLVMValueRef mant
= NULL
;
2164 LLVMValueRef logexp
= NULL
;
2165 LLVMValueRef logmant
= NULL
;
2166 LLVMValueRef res
= NULL
;
2168 assert(lp_check_value(bld
->type
, x
));
2170 if(p_exp
|| p_floor_log2
|| p_log2
) {
2171 /* TODO: optimize the constant case */
2172 if (gallivm_debug
& GALLIVM_DEBUG_PERF
&&
2173 LLVMIsConstant(x
)) {
2174 debug_printf("%s: inefficient/imprecise constant arithmetic\n",
2178 assert(type
.floating
&& type
.width
== 32);
2180 i
= LLVMBuildBitCast(bld
->builder
, x
, int_vec_type
, "");
2182 /* exp = (float) exponent(x) */
2183 exp
= LLVMBuildAnd(bld
->builder
, i
, expmask
, "");
2186 if(p_floor_log2
|| p_log2
) {
2187 logexp
= LLVMBuildLShr(bld
->builder
, exp
, lp_build_const_int_vec(type
, 23), "");
2188 logexp
= LLVMBuildSub(bld
->builder
, logexp
, lp_build_const_int_vec(type
, 127), "");
2189 logexp
= LLVMBuildSIToFP(bld
->builder
, logexp
, vec_type
, "");
2193 /* mant = (float) mantissa(x) */
2194 mant
= LLVMBuildAnd(bld
->builder
, i
, mantmask
, "");
2195 mant
= LLVMBuildOr(bld
->builder
, mant
, one
, "");
2196 mant
= LLVMBuildBitCast(bld
->builder
, mant
, vec_type
, "");
2198 logmant
= lp_build_polynomial(bld
, mant
, lp_build_log2_polynomial
,
2199 Elements(lp_build_log2_polynomial
));
2201 /* This effectively increases the polynomial degree by one, but ensures that log2(1) == 0*/
2202 logmant
= LLVMBuildFMul(bld
->builder
, logmant
, LLVMBuildFSub(bld
->builder
, mant
, bld
->one
, ""), "");
2204 res
= LLVMBuildFAdd(bld
->builder
, logmant
, logexp
, "");
2208 exp
= LLVMBuildBitCast(bld
->builder
, exp
, vec_type
, "");
2213 *p_floor_log2
= logexp
;
2221 lp_build_log2(struct lp_build_context
*bld
,
2225 lp_build_log2_approx(bld
, x
, NULL
, NULL
, &res
);