Home
last modified time | relevance | path

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

12345678910>>...16

/openbsd/gnu/usr.bin/perl/cpan/Scalar-List-Utils/t/
H A Dreduce.t6 use List::Util qw(reduce min);
10 my $v = reduce {};
14 $v = reduce { $a / $b } 756,3,7,4;
17 $v = reduce { $a / $b } 6;
25 $v = reduce { $a . $b } @a;
49 $v = reduce \&add2, 1,2,3;
52 $v = reduce { add2() } 3,4,5;
124 eval { &reduce({},1,2) };
154 eval { &reduce(1) };
156 eval { &reduce(1,2) };
[all …]
H A Dstack-corruption.t13 use List::Util qw(reduce);
21 reduce { return "bogus"; } qw/some thing/;
H A Dundefined-block.t7 BEGIN { @subs = qw(reduce first none all any notall pairfirst pairgrep pairmap) };
/openbsd/gnu/usr.bin/perl/cpan/version/t/
H A D09_list_util.t11 eval "use List::Util qw(reduce)";
13 plan skip_all => "No List::Util::reduce() available";
21 use List::Util qw(reduce);
24 my $ret = reduce {
29 is $fail, 0, 'reduce() with parse';
34 my $ret = reduce {
39 is $fail, 0, 'reduce() with qv';
/openbsd/gnu/llvm/libcxx/include/__numeric/
H A Dreduce.h25 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 _Tp reduce(_InputIterator __first, _InputIt… in reduce() function
33 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 _Tp reduce(_InputIterator __first, _InputIt… in reduce() function
35 return _VSTD::reduce(__first, __last, __init, _VSTD::plus<>()); in reduce()
40 reduce(_InputIterator __first, _InputIterator __last) { in reduce() function
41 return _VSTD::reduce(__first, __last, typename iterator_traits<_InputIterator>::value_type{}); in reduce()
/openbsd/regress/lib/libcrypto/bn/
H A Dbn_mod_exp.c264 if (reduce) { in generate_test_quintuple()
378 if (!generate_test_triple(reduce, a, p, m, ctx)) in bn_mod_exp_test()
406 int reduce; in test_bn_mod_exp() local
423 reduce = 0; in test_bn_mod_exp()
425 failed |= bn_mod_exp_test(reduce, want, a, p, m, ctx); in test_bn_mod_exp()
427 reduce = 1; in test_bn_mod_exp()
429 failed |= bn_mod_exp_test(reduce, want, a, p, m, ctx); in test_bn_mod_exp()
472 if (!generate_test_quintuple(reduce, a, p, b, q, m, ctx)) in bn_mod_exp2_test()
503 int reduce; in test_bn_mod_exp2() local
526 reduce = 0; in test_bn_mod_exp2()
[all …]
/openbsd/gnu/gcc/gcc/
H A Dipa-utils.c71 bool reduce; member
138 if (env->reduce) in searchc()
147 if (env->reduce) in searchc()
159 bool reduce, bool allow_overwritable) in ipa_utils_reduced_inorder() argument
170 env.reduce = reduce; in ipa_utils_reduced_inorder()
/openbsd/usr.bin/indent/
H A Dparse.c39 void reduce(void);
54 reduce(); /* see if this allows any reduction */ in parse()
192 reduce(); /* see if any reduction can be done */ in parse()
243 reduce(void) in reduce() function
/openbsd/gnu/llvm/llvm/lib/Target/Hexagon/
H A DHexagonIntrinsicsV5.td13 // Vector reduce add unsigned halfwords
23 // Vector reduce multiply word by signed half (32x16)
80 // Vector reduce add unsigned halfwords
160 // Vector reduce maximum halfwords
164 // Vector reduce maximum words
168 // Vector reduce minimum halfwords
172 // Vector reduce minimum words
176 // Rotate and reduce bytes
181 // Rotate and reduce bytes with accumulation
/openbsd/gnu/usr.bin/perl/cpan/podlators/t/data/snippets/man/
H A Dzero-width-space7 …>>][:start=I<E<lt>timeE<gt>>]E<0x200B>[:end=I<E<lt>timeE<gt>>]E<0x200B>[:reduce=I<E<lt>B<CF>E<gt>>…
10 …<CF>\fR[:step=\fI<step>\fR][:start=\fI<time>\fR]\:[:end=\fI<time>\fR]\:[:reduce=\fI<\fR\f(BICF\fR\…
/openbsd/gnu/llvm/llvm/docs/
H A DBugpoint.rst14 and JIT compilers). It aims to reduce large test cases to small, useful ones.
16 optimization (or combination of optimizations) that causes the crash, and reduce
31 (unattended) time to reduce a test case, but we feel it is still worth it. Note
66 can to reduce the list of passes (for optimizer crashes) and the size of the
71 Next, ``bugpoint`` tries removing functions from the test program, to reduce its
72 size. Usually it is able to reduce a test program to a single function, when
75 reduce the size of the function as much as possible. Finally, ``bugpoint``
90 the JIT or the static LLC compiler. It uses several techniques to reduce the
91 amount of code pushed through the LLVM code generator, to reduce the potential
107 which are causing the miscompilation, then reduce the portion of the test
[all …]
H A DBugpointRedesign.md33 We are proposing to reduce the plethora of bugpoint’s options to just two: an
39 The interesting-ness test that’s going to be run to reduce the code is given
80 reduction) would be added to the tool, to even further reduce IR.
91 when the IR crashes, it tries to reduce it by performing some sub-optimal
H A DHowToSubmitABug.rst78 reduce the preprocessed file down to the smallest amount of code that still
79 replicates the problem. You're encouraged to use creduce to reduce the code
115 If bugpoint doesn't reproduce the crash, ``llvm-reduce`` is an alternative
116 way to reduce LLVM IR. Create a script that repros the crash and run:
120 llvm-reduce --test=path/to/script foo.bc
123 ``llvm-reduce`` is still fairly immature and may crash.
144 bug<frontend-crash>`. If one of these do crash, you should be able to reduce
/openbsd/gnu/llvm/llvm/include/llvm/IR/
H A DVPIntrinsics.def517 // llvm.vp.reduce.add(start,x,mask,vlen)
521 // llvm.vp.reduce.mul(start,x,mask,vlen)
525 // llvm.vp.reduce.and(start,x,mask,vlen)
529 // llvm.vp.reduce.or(start,x,mask,vlen)
533 // llvm.vp.reduce.xor(start,x,mask,vlen)
537 // llvm.vp.reduce.smax(start,x,mask,vlen)
541 // llvm.vp.reduce.smin(start,x,mask,vlen)
545 // llvm.vp.reduce.umax(start,x,mask,vlen)
549 // llvm.vp.reduce.umin(start,x,mask,vlen)
553 // llvm.vp.reduce.fmax(start,x,mask,vlen)
[all …]
/openbsd/gnu/llvm/llvm/tools/llvm-reduce/
H A DCMakeLists.txt22 add_llvm_tool(llvm-reduce
62 llvm-reduce.cpp
/openbsd/gnu/llvm/llvm/utils/gn/secondary/llvm/tools/llvm-reduce/
H A DBUILD.gn1 executable("llvm-reduce") {
55 "llvm-reduce.cpp",
/openbsd/gnu/llvm/llvm/docs/Proposals/
H A DVectorPredication.rst61 4. Deprecate llvm.masked.* / llvm.experimental.reduce.*
64 - Modernize llvm.masked.* / llvm.experimental.reduce* by translating to VP.
75 vectorized scalar instructions (reduce, shuffles, ..)
/openbsd/gnu/llvm/libcxx/include/
H A Dnumeric29 reduce(InputIterator first, InputIterator last); // C++17
33 reduce(InputIterator first, InputIterator last, T init); // C++17
37 reduce(InputIterator first, InputIterator last, T init, BinaryOperation binary_op); // C++17
161 #include <__numeric/reduce.h>
/openbsd/gnu/llvm/compiler-rt/lib/scudo/standalone/
H A Dflags.inc15 "deallocation of chunks. Lower value may reduce memory usage but "
20 "quarantine. Lower value may reduce memory usage but might increase "
/openbsd/regress/usr.bin/sed/
H A Dmath.sed55 # reduce a^b^c -> a^(b^c)
111 # reduce all number factorials
231 # look in hold space for stack to reduce
/openbsd/gnu/llvm/libcxx/docs/DesignDocs/
H A DCapturingConfigInfo.rst12 In order to support persistent configurations and reduce arbitrary preprocessor logic
41 header in order to reduce arbitrary hardcoded choices elsewhere in the code. For
/openbsd/usr.bin/awk/
H A DREADME.md95 awkgram.y: warning: 44 shift/reduce conflicts [-Wconflicts-sr]
96 awkgram.y: warning: 85 reduce/reduce conflicts [-Wconflicts-rr]
/openbsd/regress/usr.bin/mandoc/roff/ti/
H A Dbasic-man.out_ascii12 It is also possible to temporarily reduce the indentation, but that will
H A Dbasic-mdoc.out_ascii12 It is also possible to temporarily reduce the indentation, but that will
/openbsd/gnu/llvm/compiler-rt/lib/asan/
H A Dasan_flags.inc23 "errors. Lower value may reduce memory usage but increase the "
27 "use-after-free errors. Lower value may reduce memory usage but "
137 "poisoning) to reduce memory consumption as much as possible, and "

12345678910>>...16