| /src/external/gpl3/gcc/dist/libstdc++-v3/include/pstl/ |
| glue_numeric_impl.h | 21 // [reduce]
25 reduce(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Tp __init, function in namespace:std
34 reduce(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Tp __init) function in namespace:std
43 reduce(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last) function in namespace:std
50 // [transform.reduce]
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/pstl/ |
| glue_numeric_impl.h | 21 // [reduce]
25 reduce(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Tp __init, function in namespace:std
34 reduce(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Tp __init) function in namespace:std
43 reduce(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last) function in namespace:std
50 // [transform.reduce]
|
| /src/external/lgpl3/mpfr/dist/src/ |
| sin.c | 43 int inexact, sign, reduce; local
118 if (expx >= 2) /* If Pi < x < 4, we need to reduce too, to determine
122 reduce = 1;
154 reduce = 0;
181 err = 2 * MPFR_GET_EXP (c) + (mpfr_exp_t) m - 3 - (reduce != 0);
|
| cos.c | 136 int inexact, reduce = 0; local
183 reduce = 1;
196 /* If |x| >= 4, first reduce x cmod (2*Pi) into xr, using mpfr_remainder:
205 if (reduce)
218 /* now |x| < 4 (or xr if reduce = 1), thus |r| <= 16 */
248 if (reduce)
283 if (reduce)
292 if (reduce)
|
| sin_cos.c | 32 int neg, reduce; local
141 if (expx >= 2) /* reduce the argument */
143 reduce = 1;
163 reduce = 0;
174 if (reduce == 0)
187 2^(5-m) if reduce=1, and by 2^(2-m)
189 mpfr_ui_sub (c, 1, c, MPFR_RNDN); /* error bounded by 2^(6-m) if reduce
192 2^(6-m-Exp(c)) if reduce=1, and
194 err = 3 + 3 * reduce - MPFR_GET_EXP (c);
237 reduce (mpz_t Q, mpz_srcptr R, mpfr_prec_t prec function
[all...] |
| /src/external/historical/nawk/dist/testdir/ |
| chem.awk | 352 d = reduce(d)
376 return sprintf("V%d.%s", int(reduce(d-rd)/(360/verts)) + 1, corner(d))
380 return dc[reduce(45 * int((dir+22.5)/45))]
406 return reduce($(cf++))
408 return reduce(dc[$(cf++)])
415 function reduce(d) { # reduces d to 0 <= d < 360 function
|
| /src/external/lgpl3/gmp/dist/mpz/ |
| powm_ui.c | 107 reduce (mp_ptr tp, mp_srcptr ap, mp_size_t an, mp_srcptr mp, mp_size_t mn, gmp_pi1_t *dinv) function
173 /* Reduce possibly huge base. Use a function call to reduce, since we
176 reduce (new_bp, bp, bn, mp, mn, &dinv);
|
| /src/external/bsd/elftosb/dist/elftosb2/ |
| ElftosbAST.cpp | 243 ExprASTNode * VariableExprASTNode::reduce(EvalContext & context) function in class:VariableExprASTNode
270 ExprASTNode * SymbolRefExprASTNode::reduce(EvalContext & context) function in class:SymbolRefExprASTNode
355 ExprASTNode * NegativeExprASTNode::reduce(EvalContext & context) function in class:NegativeExprASTNode
362 m_expr = m_expr->reduce(context);
389 ExprASTNode * BooleanNotExprASTNode::reduce(EvalContext & context) function in class:BooleanNotExprASTNode
396 m_expr = m_expr->reduce(context);
424 // even though the first line of reduce() below has the same expression, just in parentheses. stupid compiler.
431 ExprASTNode * SourceFileFunctionASTNode::reduce(EvalContext & context) function in class:SourceFileFunctionASTNode
476 ExprASTNode * DefinedOperatorASTNode::reduce(EvalContext & context) function in class:DefinedOperatorASTNode
510 ExprASTNode * SizeofOperatorASTNode::reduce(EvalContext & context function in class:SizeofOperatorASTNode
665 ExprASTNode * BinaryOpExprASTNode::reduce(EvalContext & context) function in class:BinaryOpExprASTNode
848 ExprASTNode * IntSizeExprASTNode::reduce(EvalContext & context) function in class:IntSizeExprASTNode
[all...] |
| ElftosbAST.h | 246 virtual ExprASTNode * reduce(EvalContext & context) { return this; } function in class:elftosb::ExprASTNode
295 virtual ExprASTNode * reduce(EvalContext & context);
318 virtual ExprASTNode * reduce(EvalContext & context);
339 virtual ExprASTNode * reduce(EvalContext & context);
362 virtual ExprASTNode * reduce(EvalContext & context);
385 virtual ExprASTNode * reduce(EvalContext & context);
410 virtual ExprASTNode * reduce(EvalContext & context);
436 virtual ExprASTNode * reduce(EvalContext & context);
488 virtual ExprASTNode * reduce(EvalContext & context);
517 virtual ExprASTNode * reduce(EvalContext & context)
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| ipa-utils.cc | 65 bool reduce; member in struct:searchc_env
137 if (env->reduce)
146 if (env->reduce)
153 The REDUCE flag is true if you want the cycles reduced to single nodes.
163 bool reduce,
175 env.reduce = reduce;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 295 S = backpropagate(G, reduce());
427 std::vector<GraphBase::NodeId> reduce() { function in class:llvm::PBQP::RegAlloc::RegAllocSolverImpl
428 assert(!G.empty() && "Cannot reduce empty graph.");
|
| /src/external/gpl3/gcc/dist/gcc/ |
| ipa-utils.cc | 75 bool reduce; member in struct:searchc_env
147 if (env->reduce)
156 if (env->reduce)
163 The REDUCE flag is true if you want the cycles reduced to single nodes.
173 bool reduce,
185 env.reduce = reduce;
|
| /src/external/gpl3/gcc/dist/libcpp/ |
| expr.cc | 62 static struct op *reduce (cpp_reader *, struct op *, enum cpp_ttype);
1292 than the operator on the top of the stack, we reduce the stack by one
1293 operator and repeat the test. Since equal priorities do not reduce,
1304 reduce() exits immediately. If the normal exit route sees a ')', then
1344 However, there are some special cases for these in reduce(). */
1472 top = reduce (pfile, top, op.op);
1533 /* Reduce the operator / value stack if possible, in preparation for
1537 reduce (cpp_reader *pfile, struct op *top, enum cpp_ttype op)
1671 /* COMMA and COLON should not reduce a QUERY operator. */
1536 reduce (cpp_reader *pfile, struct op *top, enum cpp_ttype op) function
|
| /src/external/gpl3/gcc.old/dist/libcpp/ |
| expr.cc | 62 static struct op *reduce (cpp_reader *, struct op *, enum cpp_ttype);
1234 than the operator on the top of the stack, we reduce the stack by one
1235 operator and repeat the test. Since equal priorities do not reduce,
1246 reduce() exits immediately. If the normal exit route sees a ')', then
1286 However, there are some special cases for these in reduce(). */
1414 top = reduce (pfile, top, op.op);
1475 /* Reduce the operator / value stack if possible, in preparation for
1479 reduce (cpp_reader *pfile, struct op *top, enum cpp_ttype op)
1613 /* COMMA and COLON should not reduce a QUERY operator. */
1478 reduce (cpp_reader *pfile, struct op *top, enum cpp_ttype op) function
|
| /src/crypto/external/apache2/openssl/dist/crypto/ml_kem/ |
| ml_kem.c | 801 * Constant-time reduce x mod kPrime using Barrett reduction. x must be less
802 * than kPrime + 2 * kPrime^2. This is sufficient to reduce a product of
806 static __owur uint16_t reduce(uint32_t x) function
821 tmp = reduce(*curr * a);
851 odd = reduce(*peer * zeta);
884 *peer++ = reduce(zeta * (even - odd + kPrime));
933 *curr++ = reduce(l0 * r0 + reduce(l1 * r1) * zetapow);
934 *curr++ = reduce(l0 * r1 + l1 * r0);
953 *c0 = reduce(*c0 + l0 * r0 + reduce(l1 * r1) * zetapow)
[all...] |
| /src/external/mit/isl/dist/ |
| isl_map_simplify.c | 114 /* Reduce the coefficient of the variable at position "pos"
177 /* Reduce the coefficients (including the constant term) of
192 isl_bool reduce; local
194 reduce = needs_reduction(bmap, div, i);
195 if (reduce < 0)
197 if (!reduce)
207 /* Reduce the coefficients (including the constant term) of
2794 * compute the gist inside this intersection and then reduce
3104 /* Reduce the "n" stride constraints in "bmap" based on a copy "A"
3806 * In particular, we reduce the equalities and inequalities o
[all...] |
