/netbsd-current/external/gpl3/gcc.old/dist/gcc/ |
H A D | postreload-gcse.c | 140 Return nonzero if exp1 is equivalent to exp2. */ 143 expr_hasher::equal (const expr *exp1, const expr *exp2) 145 int equiv_p = exp_equiv_p (exp1->expr, exp2->expr, 0, true); 147 gcc_assert (!equiv_p || exp1->hash == exp2->hash); 142 equal(const expr *exp1, const expr *exp2) argument
|
H A D | tree-ssa-reassoc.c | 3158 tree exp2; local 3165 exp2 = TREE_OPERAND (ranges[j].exp, 0); 3166 if (exp2 == exp) 3168 else if (TREE_CODE (exp2) == PLUS_EXPR) 3170 exp2 = TREE_OPERAND (exp2, 0); 3171 STRIP_NOPS (exp2); 3172 if (exp2 != exp) 3187 exp2 = extract_bit_test_mask (ranges[j].exp, prec, lowi, lowj, 3189 if (exp2 ! [all...] |
/netbsd-current/external/gpl3/gcc/dist/gcc/ |
H A D | postreload-gcse.cc | 140 Return nonzero if exp1 is equivalent to exp2. */ 143 expr_hasher::equal (const expr *exp1, const expr *exp2) 145 int equiv_p = exp_equiv_p (exp1->expr, exp2->expr, 0, true); 147 gcc_assert (!equiv_p || exp1->hash == exp2->hash); 142 equal(const expr *exp1, const expr *exp2) argument
|
H A D | tree-ssa-reassoc.cc | 3320 tree exp2; local 3327 exp2 = TREE_OPERAND (ranges[j].exp, 0); 3328 if (exp2 == exp) 3330 else if (TREE_CODE (exp2) == PLUS_EXPR) 3332 exp2 = TREE_OPERAND (exp2, 0); 3333 STRIP_NOPS (exp2); 3334 if (exp2 != exp) 3349 exp2 = extract_bit_test_mask (ranges[j].exp, prec, lowi, lowj, 3351 if (exp2 ! [all...] |
/netbsd-current/external/apache2/llvm/dist/libcxx/include/ |
H A D | math.h | 180 floating_point exp2 (arithmetic x); 1180 // exp2 1182 inline _LIBCPP_INLINE_VISIBILITY float exp2(float __lcpp_x) _NOEXCEPT {return ::exp2f(__lcpp_x);} 1183 inline _LIBCPP_INLINE_VISIBILITY long double exp2(long double __lcpp_x) _NOEXCEPT {return ::exp2l(__lcpp_x);} 1188 exp2(_A1 __lcpp_x) _NOEXCEPT {return ::exp2((double)__lcpp_x);}
|
/netbsd-current/external/lgpl3/mpfr/lib/libmpfr/ |
H A D | Makefile | 93 exp2.c \
|
/netbsd-current/external/lgpl3/mpfr/dist/src/ |
H A D | Makefile.am | 42 div_2ui.c div.c div_ui.c dot.c dump.c eq.c exp10.c exp2.c exp3.c exp.c \
|
H A D | Makefile.in | 170 dump.lo eq.lo exp10.lo exp2.lo exp3.lo exp.lo frac.lo frexp.lo \ 266 ./$(DEPDIR)/exp10m1.Plo ./$(DEPDIR)/exp2.Plo \ 557 div_2ui.c div.c div_ui.c dot.c dump.c eq.c exp10.c exp2.c exp3.c exp.c \ 806 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/exp2.Plo@am__quote@ # am--include-marker 1276 -rm -f ./$(DEPDIR)/exp2.Plo 1579 -rm -f ./$(DEPDIR)/exp2.Plo
|
/netbsd-current/external/gpl3/binutils.old/dist/gas/config/ |
H A D | tc-v850.c | 1479 expressionS exp2; 1485 if (! register_name (&exp2)) 1490 if (exp.X_add_number > exp2.X_add_number) 1496 for (j = exp.X_add_number + 1; j <= exp2.X_add_number; j++) 1515 exp = exp2; 1477 expressionS exp2; local
|
/netbsd-current/external/gpl3/binutils/dist/gas/config/ |
H A D | tc-v850.c | 1479 expressionS exp2; 1485 if (! register_name (&exp2)) 1490 if (exp.X_add_number > exp2.X_add_number) 1496 for (j = exp.X_add_number + 1; j <= exp2.X_add_number; j++) 1515 exp = exp2; 1477 expressionS exp2; local
|
/netbsd-current/external/gpl3/gcc.old/dist/libgfortran/io/ |
H A D | list_read.c | 1353 goto exp2; 1379 exp2: 1702 goto exp2; 1810 goto exp2; 1830 exp2:
|
/netbsd-current/external/gpl3/gdb.old/dist/gas/config/ |
H A D | tc-v850.c | 1479 expressionS exp2; 1485 if (! register_name (&exp2)) 1490 if (exp.X_add_number > exp2.X_add_number) 1496 for (j = exp.X_add_number + 1; j <= exp2.X_add_number; j++) 1515 exp = exp2; 1477 expressionS exp2; local
|
/netbsd-current/external/gpl3/gcc/dist/libgfortran/io/ |
H A D | list_read.c | 1352 goto exp2; 1378 exp2: 1701 goto exp2; 1809 goto exp2; 1829 exp2:
|
/netbsd-current/lib/libm/noieee_src/ |
H A D | n_exp2.c | 54 /* exp2(z + eps) eps */ 314 * exp2(x): compute the base 2 exponential of x 322 * Thus we have exp2(x) = 2**k * exp2(y). 326 * Thus we have exp2(y) = exp2(i/TBLSIZE) * exp2(z - eps[i]), 329 * We compute exp2(i/TBLSIZE) via table lookup and exp2(z - eps[i]) via 332 * exp2t[i] = exp2( 345 exp2(double x) function [all...] |
/netbsd-current/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
H A D | IntrinsicLowering.cpp | 393 case Intrinsic::exp2: { 394 ReplaceFPIntrinsicWithCall(CI, "exp2f", "exp2", "exp2l");
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineMulDivRem.cpp | 568 // exp2(X) * exp2(Y) -> exp2(X + Y) 569 // Match as long as at least one of exp2 has only one use. 570 if (match(Op0, m_Intrinsic<Intrinsic::exp2>(m_Value(X))) && 571 match(Op1, m_Intrinsic<Intrinsic::exp2>(m_Value(Y))) && 574 Value *Exp2 = Builder.CreateUnaryIntrinsic(Intrinsic::exp2, XY, &I); 1309 case Intrinsic::exp2:
|
/netbsd-current/external/apache2/llvm/dist/clang/lib/Headers/ |
H A D | __clang_cuda_math.h | 107 __DEVICE__ double exp2(double __a) { return __nv_exp2(__a); } function
|
/netbsd-current/external/gpl3/gcc/dist/libphobos/src/std/math/ |
H A D | algebraic.d | 253 import std.math.exponential : exp2; 256 return copysign(exp2(core.math.yl2x(fabs(x), 1.0L/3.0L)), x);
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
H A D | SimplifyLibCalls.cpp | 1444 /// ldexp(1.0, x) for pow(2.0, itofp(x)); exp2(n * x) for pow(2.0 ** n, x); 1445 /// exp10(x) for pow(10.0, x); exp2(log2(n) * x) for pow(n, x). 1456 // pow(exp2(x), y) -> exp2(x * y) 1492 ID = Intrinsic::exp2; 1533 // pow(2.0 ** n, x) -> exp2(n * x) 1548 return B.CreateCall(Intrinsic::getDeclaration(Mod, Intrinsic::exp2, Ty), 1549 FMul, "exp2"); 1563 // pow(x, y) -> exp2(log2(x) * y) 1566 // pow(1, inf) is defined to be 1 but exp2(log [all...] |
/netbsd-current/external/mit/isl/dist/ |
H A D | isl_coalesce.c | 3433 int *exp2 = NULL; local 3452 exp2 = isl_alloc_array(ctx, int, div_j->n_row); 3453 if ((div_i->n_row && !exp1) || (div_j->n_row && !exp2)) 3456 div = isl_merge_divs(div_i, div_j, exp1, exp2); 3471 free(exp2); 3479 free(exp2);
|
H A D | isl_aff.c | 1960 int *exp2 = NULL; local 1989 exp2 = isl_alloc_array(ctx, int, n_div2); 1990 if ((n_div1 && !exp1) || (n_div2 && !exp2)) 1993 div = isl_merge_divs(aff1->ls->div, aff2->ls->div, exp1, exp2); 1995 aff2 = isl_aff_expand_divs(aff2, div, exp2); 1997 free(exp2); 2002 free(exp2); 6191 int *exp2 = NULL; local 6217 exp2 = isl_alloc_array(ctx, int, dst_n_div); 6218 if (!exp1 || (dst_n_div && !exp2)) [all...] |
H A D | isl_polynomial.c | 1799 int *exp2 = NULL; variable 1815 exp2 = isl_alloc_array(qp2->div->ctx, int, n_div2); 1816 if ((n_div1 && !exp1) || (n_div2 && !exp2)) 1819 div = isl_merge_divs(qp1->div, qp2->div, exp1, exp2); 1829 qp2->poly = expand(qp2->poly, exp2, div->n_col - div->n_row - 2); 1836 free(exp2); variable 1842 free(exp2); variable
|
/netbsd-current/external/gpl3/gcc.old/dist/libphobos/src/std/ |
H A D | math.d | 34 $(MYREF pow) $(MYREF exp) $(MYREF exp2) $(MYREF expm1) $(MYREF ldexp) 116 * D implementations of tan, atan, atan2, exp, expm1, exp2, log, log10, log1p, 1758 // and exp2 are so similar). 1759 return exp2(LOG2E*x); 1765 // and exp2 are so similar). 1766 return exp2(LOG2E*x); 1917 * Implementation is otherwise the same as for exp2() 2008 * Implementation is otherwise the same as for exp2() 2160 * $(TR $(TH x) $(TH exp2(x)) ) 2167 real exp2(rea [all...] |
/netbsd-current/external/gpl3/gcc/dist/gcc/d/dmd/ |
H A D | typesem.d | 3120 auto exp2 = mt.exp.expressionSemantic(sc2); 3121 exp2 = resolvePropertiesOnly(sc2, exp2); 3124 if (exp2.op == EXP.error) 3127 mt.exp = exp2; 3130 mt.exp = exp2;
|
/netbsd-current/external/gpl3/gcc/dist/gcc/c/ |
H A D | c-parser.cc | 5894 tree exp1, exp2; 5905 exp2 = c_parser_expr_no_commas (parser, NULL).value; 5907 label = do_case (loc1, exp1, exp2); 7617 struct c_expr cond, exp1, exp2, ret; 7682 exp2 = c_parser_conditional_expression (parser, NULL, NULL_TREE); 7683 exp2 = convert_lvalue_to_rvalue (exp2_loc, exp2, true, true); 7687 location_t loc2 = make_location (exp2.get_start (), exp2.src_range); 7692 && c_tree_equal (exp2 5892 tree exp1, exp2; local 7615 struct c_expr cond, exp1, exp2, ret; local [all...] |