| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| remove_indvar.ll | 2 ; RUN: opt < %s -loop-reduce -S | not grep INDVAR
|
| variable_stride.ll | 2 ; RUN: opt < %s -loop-reduce -S | not grep mul
|
| var_stride_used_by_compare.ll | 2 ; RUN: opt < %s -loop-reduce -S | \
6 ; RUN: opt < %s -loop-reduce -S | \
|
| /external/v8/test/mjsunit/regress/ |
| regress-1436.js | 28 // Check that reduce and reduceRight call the callback function with
32 // Check receiver for reduce and reduceRight.
39 [2, 3].reduce(non_strict);
40 [2, 3].reduce(strict);
|
| /frameworks/compile/mclinker/ |
| mcld-device-build.mk | 3 # The three inline options together reduce libbcc.so almost 1MB.
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonIntrinsicsV3.td | 17 // MTYPE / COMPLEX / Vector reduce complex multiply real or imaginary.
32 // MTYPE / VB / Vector reduce add unsigned bytes.
|
| /external/stlport/stlport/stl/ |
| _abbrevs.h | 24 // ugliness is intentional - to reduce conflicts
43 // ugliness is intentional - to reduce conflicts probability
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _abbrevs.h | 24 // ugliness is intentional - to reduce conflicts
43 // ugliness is intentional - to reduce conflicts probability
|
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _abbrevs.h | 24 // ugliness is intentional - to reduce conflicts
43 // ugliness is intentional - to reduce conflicts probability
|
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _abbrevs.h | 24 // ugliness is intentional - to reduce conflicts
43 // ugliness is intentional - to reduce conflicts probability
|
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _abbrevs.h | 24 // ugliness is intentional - to reduce conflicts
43 // ugliness is intentional - to reduce conflicts probability
|
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _abbrevs.h | 24 // ugliness is intentional - to reduce conflicts
43 // ugliness is intentional - to reduce conflicts probability
|
| /cts/tools/dasm/src/java_cup/ |
| reduce_action.java | 4 /** This class represents a reduce action within the parse table.
34 /** The production we reduce with. */
37 /** The production we reduce with. */
45 public int kind() {return REDUCE;}
79 return "REDUCE(" + reduce_with().index() + ")";
|
| lalr_state.java | 29 * of these states to parse. The parser has two operations, shift and reduce.
33 * the end of the transition). For a reduce operation, the parser is
430 * action table and a reduce-goto table. The rows in each table
434 * previous state saved on the stack (reduce entries). All entries in the
436 * reduce-goto table is indexed by non terminals and represents transitions
439 * action table (this cannot happen with the reduce-goto table). Conflicts
440 * are resolved by always shifting for shift/reduce conflicts and choosing
442 * the specification) in reduce/reduce conflicts. All conflicts are
447 * @param reduce_table the reduce-goto table to put entries in
[all...] |
| action_production.java | 18 * @param action_str the trailing reduce action for this production.
|
| /external/qemu/slirp/ |
| cksum.c | 45 #define REDUCE {l_util.l = sum; sum = l_util.s[0] + l_util.s[1]; ADDCARRY(sum);}
76 REDUCE;
102 REDUCE;
108 REDUCE;
135 REDUCE;
|
| /external/qemu/slirp-android/ |
| cksum.c | 45 #define REDUCE {l_util.l = sum; sum = l_util.s[0] + l_util.s[1]; ADDCARRY(sum);}
76 REDUCE;
102 REDUCE;
108 REDUCE;
135 REDUCE;
|
| /frameworks/native/libs/utils/ |
| LinearTransform.cpp | 213 template <class T> void LinearTransform::reduce(T* N, T* D) { function in class:android::LinearTransform
250 template void LinearTransform::reduce<uint64_t>(uint64_t* N, uint64_t* D);
251 template void LinearTransform::reduce<uint32_t>(uint32_t* N, uint32_t* D);
253 void LinearTransform::reduce(int32_t* N, uint32_t* D) { function in class:android::LinearTransform
257 reduce(reinterpret_cast<uint32_t*>(N), D);
260 reduce(reinterpret_cast<uint32_t*>(N), D);
|
| /external/dropbear/libtommath/ |
| bn_mp_dr_reduce.c | 18 /* reduce "x" in place modulo "n" using the Diminished Radix algorithm.
81 /* if x >= n then subtract and reduce again
|
| /external/bison/po/ |
| bison.pot | 41 msgid " Conflict between rule %d and token %s resolved as reduce"
51 msgid "conflicts: %d shift/reduce, %d reduce/reduce\n"
56 msgid "conflicts: %d shift/reduce\n"
61 msgid "conflicts: %d reduce/reduce\n"
76 msgid "expected %d shift/reduce conflict"
77 msgid_plural "expected %d shift/reduce conflicts"
83 msgid "expected %d reduce/reduce conflict
[all...] |
| /external/llvm/docs/ |
| Bugpoint.rst | 14 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 tes
[all...] |
| /external/chromium/build/ |
| sanitize-mac-build-log.sed | 7 # Use this sed script to reduce a Mac build log into something readable.
|
| /external/libsepol/include/sepol/ |
| handle.h | 21 * This should reduce the amount of memory required to expand the policy. */
|
| /external/llvm/test/CodeGen/X86/ |
| test-shrink-bug.ll | 3 ; Codegen shouldn't reduce the comparison down to testb $-1, %al
|
| /external/llvm/test/Transforms/InstCombine/ |
| bit-tracking.ll | 6 ; Reduce down to a single XOR
|
