Home
last modified time | relevance | path

Searched refs:ninf (Results 1 – 25 of 25) sorted by relevance

/external/icu/icu4c/source/test/intltest/
Dtsputil.cpp35 double ninf = -uprv_getInfinity();
101 double ninf = -uprv_getInfinity(); in testMaxMin() local
109 maxMinTest(pinf, ninf, pinf, TRUE); in testMaxMin()
110 maxMinTest(pinf, ninf, ninf, FALSE); in testMaxMin()
119 maxMinTest(ninf, pzero, pzero, TRUE); in testMaxMin()
120 maxMinTest(ninf, pzero, ninf, FALSE); in testMaxMin()
121 maxMinTest(ninf, nzero, nzero, TRUE); in testMaxMin()
122 maxMinTest(ninf, nzero, ninf, FALSE); in testMaxMin()
127 maxMinTest(ninf, nan, nan, TRUE); in testMaxMin()
128 maxMinTest(ninf, nan, nan, FALSE); in testMaxMin()
[all …]
/external/v8/test/mjsunit/regress/
Dregress-925537.js37 var pinf = Number.POSITIVE_INFINITY, ninf = Number.NEGATIVE_INFINITY; variable
39 assertClose(-Math.PI / 4, Math.atan2(ninf, pinf));
40 assertClose( 3 * Math.PI / 4, Math.atan2(pinf, ninf));
41 assertClose(-3 * Math.PI / 4, Math.atan2(ninf, ninf));
/external/libcxx/test/std/utilities/function.objects/unord.hash/
Dfloating.pass.cpp42 std::size_t ninf = h(-INFINITY); in test() local
48 assert(t0 != ninf); in test()
53 assert(tp1 != ninf); in test()
57 assert(t1 != ninf); in test()
60 assert(tn1 != ninf); in test()
62 assert(pinf != ninf); in test()
/external/llvm/test/CodeGen/AMDGPU/
Dfp-classify.ll54 %ninf = fcmp une float %x.fabs, 0x7FF0000000000000
55 %and = and i1 %ord, %ninf
68 %ninf = fcmp une float %x.fabs, 0xFFF0000000000000
69 %and = and i1 %ord, %ninf
81 %ninf = fcmp une float %x, 0x7FF0000000000000
82 %and = and i1 %ord, %ninf
95 %ninf = fcmp une float %x.fabs, 0x7FF0000000000000
96 %and = and i1 %ord, %ninf
109 %ninf = fcmp une float %x.fabs, 0x7FF0000000000000
110 %and = and i1 %ord, %ninf
[all …]
/external/llvm/test/Transforms/InstSimplify/
Dfast-math.ll37 ; fadd [nnan ninf] X, (fsub [nnan ninf] 0, X) ==> 0
38 ; where nnan and ninf have to occur at least once somewhere in this
43 %t1 = fsub nnan ninf float 0.0, %a
44 %zero1 = fadd nnan ninf float %t1, %a
47 %zero2 = fadd ninf float %t2, %a
49 %t3 = fsub nnan ninf float 0.0, %a
53 %zero4 = fadd nnan ninf float %t4, %a
81 %no_zero1 = fsub ninf float %a, %a
99 %no_zero1 = fadd ninf float %a, 0.0
/external/llvm/test/Assembler/
Dfast-math-flags.ll87 ; CHECK: %a = fadd nnan ninf float %x, %y
88 %a = fadd ninf nnan float %x, %y
93 ; CHECK: %b_vec = fsub nnan ninf <3 x float> %vec, %vec
94 %b_vec = fsub ninf nnan <3 x float> %vec, %vec
99 ; CHECK: %d = fdiv nnan ninf float %x, %y
100 %d = fdiv ninf nnan float %x, %y
105 ; CHECK: %e_vec = frem nnan ninf <3 x float> %vec, %vec
106 %e_vec = frem ninf nnan <3 x float> %vec, %vec
121 ; CHECK: %a = fadd nnan ninf float %x, %y
122 %a = fadd ninf nnan float %x, %y
[all …]
/external/icu/icu4c/source/test/cintltst/
Dputiltst.c357 double ninf = -uprv_getInfinity();
372 remainderTest(1.0, ninf, 1.0);
378 remainderTest(ninf, nan, nan);
/external/clang/test/CodeGenOpenCL/
Drelaxed-fpmath.cl13 // FINITE: fdiv nnan ninf float
/external/bison/src/
Dtables.c742 table_ninf_remap (base_number tab[], int size, base_number ninf) in table_ninf_remap() argument
748 if (tab[i] < res && tab[i] != ninf) in table_ninf_remap()
754 if (tab[i] == ninf) in table_ninf_remap()
/external/llvm/test/Transforms/SLPVectorizer/X86/
Dpropagate_ir_flags.ll180 %op2 = fadd nnan ninf float %load2, 1.0
206 %op2 = fadd ninf float %load2, 1.0
232 %op2 = fadd fast nnan ninf float %load2, 1.0
/external/llvm/test/Bitcode/
Dcompatibility.ll660 %f.ninf = fadd ninf float %op1, %op2
661 ; CHECK: %f.ninf = fadd ninf float %op1, %op2
687 %call.nnan.ninf = tail call nnan ninf fastcc <4 x double> @fmf3()
688 ; CHECK: %call.nnan.ninf = tail call nnan ninf fastcc <4 x double> @fmf3()
Dcompatibility-3.7.ll652 %f.ninf = fadd ninf float %op1, %op2
653 ; CHECK: %f.ninf = fadd ninf float %op1, %op2
Dcompatibility-3.6.ll608 %f.ninf = fadd ninf float %op1, %op2
609 ; CHECK: %f.ninf = fadd ninf float %op1, %op2
/external/llvm/utils/vim/syntax/
Dllvm.vim31 syn keyword llvmStatement mul nand ne ninf nnan nsw nsz nuw oeq oge ogt ole
/external/llvm/lib/AsmParser/
DLLLexer.cpp550 KEYWORD(ninf); in LexIdentifier()
/external/v8/src/crankshaft/x64/
Dlithium-codegen-x64.cc3697 ExternalReference ninf = in DoMathLog() local
3699 Operand ninf_operand = masm()->ExternalOperand(ninf); in DoMathLog()
/external/v8/src/crankshaft/ia32/
Dlithium-codegen-ia32.cc3603 ExternalReference ninf = in DoMathLog() local
3605 __ movsd(input_reg, Operand::StaticVariable(ninf)); in DoMathLog()
/external/v8/src/crankshaft/x87/
Dlithium-codegen-x87.cc3912 ExternalReference ninf = ExternalReference::address_of_negative_infinity(); in DoMathLog() local
3914 __ fld_d(Operand::StaticVariable(ninf)); in DoMathLog()
/external/hyphenation-patterns/de/
Dhyph-de-1996.pat.txt12022 2ninf
Dhyph-de-1901.pat.txt12236 2ninf
Dhyph-de-ch-1901.pat.txt12114 2ninf
/external/llvm/docs/
DLangRef.rst2011 ``ninf``
8207 ``nnan``, ``ninf``, and ``nsz``. See :ref:`fastmath` for more information.
/external/hyphenation-patterns/nb/
Dhyph-nb.pat.txt15633 4ninf
/external/hyphenation-patterns/nn/
Dhyph-nn.pat.txt15633 4ninf
/external/bison/
DChangeLog-201213107 Declare to be of type suitable for the ninf value itself, not of
13109 be unsigned but the ninf value might be negative. This fixes a