Displaying 5 results from an estimated 5 matches for "setfastmathflags".
Did you mean:
getfastmathflags
2012 Dec 04
3
[LLVMdev] Which transform passes to apply?
...ters on how to
optimize out:
%accumulate = fadd double %6, 0.000000e+00
Using the 3.1 release and the C++ API, I can't figure out how
FPMathOperator, TargetOptions, nor IRBuilder::SetDefaultFPMathTag work. I
also don't see any floating point math transformation passes. I did see
IRBuilder::SetFastMathFlags, do I need to update to 3.2 and use this call?
--
View this message in context: http://llvm.1065342.n5.nabble.com/Which-transform-passes-to-apply-tp52111p52211.html
Sent from the LLVM - Dev mailing list archive at Nabble.com.
2012 Dec 04
0
[LLVMdev] Which transform passes to apply?
Hi Josh,
On 03/12/12 02:58, Josh Klontz wrote:
> Hello, I'm a new LLVM user working on a C++ EDSL for image processing. I have
> a function, which after applying createInstructionCombiningPass() and
> createDeadCodeEliminationPass() looks like:
>
...
> *%dst_yRem = urem i32 %i, %dst_columns
> %dst_y = urem i32 %i, %dst_columns
> %1 = sub i32 %i, %dst_y
>
2012 Dec 04
0
[LLVMdev] Which transform passes to apply?
...t started going in to the IR level transforms.
>
> Using the 3.1 release and the C++ API, I can't figure out how
> FPMathOperator, TargetOptions, nor IRBuilder::SetDefaultFPMathTag work. I
> also don't see any floating point math transformation passes. I did see
> IRBuilder::SetFastMathFlags, do I need to update to 3.2 and use this call?
Please open a bug report since even in mainline this transform isn't done yet
(as fast-math support at the IR level only just got going).
Ciao, Duncan.
>
>
>
>
> --
> View this message in context: http://llvm.1065342.n5.nabble....
2012 Dec 03
2
[LLVMdev] Which transform passes to apply?
Hello, I'm a new LLVM user working on a C++ EDSL for image processing. I have
a function, which after applying createInstructionCombiningPass() and
createDeadCodeEliminationPass() looks like:
define void @jitcv_sum_64sf1001(%Matrix* %src, %Matrix* %dst, i32 %len) {
entry:
br label %loop_i
loop_i: ; preds = %loop_i_end,
%entry
%i = phi i32 [ 0,
2019 Mar 18
3
[RFC] Making space for a flush-to-zero flag in FastMathFlags
We knew the day when we needed another FMF bit was coming back in:
https://reviews.llvm.org/D39304
...it was just a question of 'when'. :)
I'm guessing that an FTZ bit won't be the last new bit needed if we
consider permutations between strict FP and fast-math. Even without that,
denormals-as-zero (DAZ) might also be useful?
So rather than continuing to carve these out bit-by-bit,