HomeSort by: relevance | last modified time | path
    Searched refs:reduce (Results 1 - 25 of 105) sorted by relevancy

1 2 3 4 5

  /src/external/apache2/llvm/bin/llvm-reduce/
Makefile 8 .PATH: ${LLVM_SRCDIR}/tools/llvm-reduce
12 llvm-reduce.cpp
14 .PATH: ${LLVM_SRCDIR}/tools/llvm-reduce/deltas
  /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/usr.bin/make/unit-tests/
opt-x-reduce-exported.mk 1 # $NetBSD: opt-x-reduce-exported.mk,v 1.3 2022/05/08 07:27:50 rillig Exp $
  /src/external/lgpl3/gmp/dist/rand/
randmts.c 51 reduce:
65 goto reduce;
124 mpz_mod (seed1, seed, mod); /* Reduce `seed' modulo `mod'. */
  /src/external/gpl3/gcc/dist/gcc/config/riscv/
multilib-generator 41 from functools import reduce
121 ext = list(reduce(lambda x, y: x + y, ext_combs, []))
126 ext = map(lambda e : reduce(lambda x, y: x + y, e), ext)
arch-canonicalize 32 from functools import reduce
  /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...]
ConversionController.cpp 253 //! elftosb::ExprASTNode::reduce() method, and updates the evaluation context member so
357 ExprASTNode * expr = externNode->getSourceNumberExpr()->reduce(m_context);
419 ExprASTNode * idExpr = node->getSectionNumberExpr()->reduce(m_context);
569 ExprASTNode * reducedExpr = expr->reduce(m_context);
742 argExprNode = argExprNode->reduce(m_context);
838 modeExprNode = modeExprNode->reduce(m_context);
878 // Reduce the conditional to a single integer.
879 conditionalExpr = conditionalExpr->reduce(m_context);
1100 // reduce the expression first
1101 exprNode = exprNode->reduce(m_context)
    [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/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/gpl2/gettext/dist/gettext-tools/libuniname/
gen-uninames 113 (reduce #'+ (mapcar #'length (word-list-sorted word-list)))
238 (reduce #'+ (mapcar (lambda (uc) (length (unicode-char-word-indices uc))) all-chars))
284 (reduce #'max (mapcar (lambda (uc) (length (unicode-char-name uc))) all-chars))
287 (reduce #'max (mapcar (lambda (uc) (length (unicode-char-word-indices uc))) all-chars))
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/pstl/
glue_numeric_defs.h 17 // [reduce]
21 reduce(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Tp __init,
26 reduce(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Tp __init);
31 reduce(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last);
  /src/external/gpl3/gcc.old/dist/gcc/config/riscv/
multilib-generator 41 from functools import reduce
121 ext = list(reduce(lambda x, y: x + y, ext_combs, []))
126 ext = map(lambda e : reduce(lambda x, y: x + y, e), ext)
arch-canonicalize 32 from functools import reduce
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/pstl/
glue_numeric_defs.h 17 // [reduce]
21 reduce(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Tp __init,
26 reduce(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Tp __init);
31 reduce(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last);
  /src/external/mpl/bind/dist/bin/tests/system/doth/
stress_http_quota.py 14 from functools import reduce namespace
178 return reduce(
183 return reduce(lambda a, b: (a and b), map(lambda p: (p.alive()), self.digs))
  /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/share/mk/
bsd.klinks.mk 41 # XXX. This should be done a better way. It's @'d to reduce visual spew.
  /src/external/gpl3/gcc/dist/libgcc/config/epiphany/
udivsi3-float.S 58 ; this label here to reduce average branch penalties.
  /src/external/gpl3/gcc.old/dist/libgcc/config/epiphany/
udivsi3-float.S 58 ; this label here to reduce average branch penalties.
  /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/gpl3/gcc.old/dist/libphobos/src/std/
parallelism.d 3 These include parallel foreach, parallel reduce, parallel eager map, pipelining
14 supported parallelism paradigms (parallel foreach, map, reduce, pipelining)
60 // Parallel reduce can be combined with
64 // std.algorithm.map and TaskPool.reduce.
66 // TaskPool.reduce.
71 // TaskPool.reduce: 1.067 s
72 // std.algorithm.reduce: 4.011 s
83 immutable pi = 4.0 * taskPool.reduce!"a + b"(n.iota.map!getTerm);
295 // Should be private, but std.algorithm.reduce is used in the zero-thread case
2469 template reduce(functions...
    [all...]
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/
iteration.d 47 $(T2 reduce,
48 `reduce!((a, b) => a + b)([1, 2, 3, 4])` returns `10`.
4266 The call `reduce!(fun)(seed, range)` first assigns `seed` to
4270 The one-argument version `reduce!(fun)(range)`
4287 $(LREF sum) is similar to `reduce!((a, b) => a + b)` that offers
4290 template reduce(fun...)
4318 auto reduce(R)(R r)
4332 enforce(!r.empty, "Cannot reduce an empty input range w/o an explicit seed value.");
4351 `reduce` will operate on an unqualified copy. If this happens
4354 Use `fold` instead of `reduce` to use the seed version in a UFCS chain
    [all...]

Completed in 105 milliseconds

1 2 3 4 5