| /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...] |
| /cts/tools/dasm/src/java_cup/ |
| action_production.java | 18 * @param action_str the trailing reduce action for this production.
|
| /external/chromium-trace/trace-viewer/tracing/third_party/vinn/third_party/parse5/tools/ |
| named_entity_trie_generator.js | 7 var trie = Object.keys(entitiesData).reduce(function (trie, entity) {
|
| /external/libhevc/common/ |
| ihevc_trans_macros.h | 48 quant_multiplier = 4 ; /* because quant_coeff are multiplied by 16. Instead of multiplying, we can reduce the division factor q_bits by 4 */ \
73 quant_multiplier = 4 ; /* because quant_coeff are multiplied by 16. Instead of multiplying, we can reduce the division factor q_bits by 4 */ \
98 quant_multiplier = 4 ; /* because quant_coeff are multiplied by 16. Instead of multiplying, we can reduce the division factor q_bits by 4 */ \
123 quant_multiplier = 4 ; /* because quant_coeff are multiplied by 16. Instead of multiplying, we can reduce the division factor q_bits by 4 */ \
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| pr22856.ll | 1 ; RUN: opt -loop-reduce -verify < %s
|
| /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
|
| stack-overalign.ll | 11 ; issue. Some late phase could be smart enough to reduce alloca
|
| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| 2005-08-17-OutOfLoopVariant.ll | 1 ; RUN: opt < %s -loop-reduce -disable-output
|
| 2011-10-14-IntPtr.ll | 1 ; RUN: opt -loop-reduce -S < %s | FileCheck %s
|
| hoist-parent-preheader.ll | 1 ; RUN: opt < %s -loop-reduce -verify
|
| invariant_value_first.ll | 2 ; RUN: opt < %s -loop-reduce -S | \
|
| invariant_value_first_arg.ll | 2 ; RUN: opt < %s -loop-reduce -S | \
|
| nonlinear-postinc.ll | 1 ; RUN: opt < %s -loop-reduce
|
| ops_after_indvar.ll | 4 ; RUN: opt < %s -loop-reduce -S | not grep INDVAR
|
| pr12691.ll | 1 ; RUN: opt < %s -loop-reduce -S | FileCheck %s
|
| pr3086.ll | 1 ; RUN: opt < %s -loop-reduce
|
| pr3399.ll | 1 ; RUN: opt < %s -loop-reduce | llvm-dis
|
| pr3571.ll | 1 ; RUN: opt < %s -loop-reduce | llvm-dis
|
| related_indvars.ll | 1 ; RUN: opt < %s -loop-reduce -S | grep phi | count 1
|
| remove_indvar.ll | 2 ; RUN: opt < %s -loop-reduce -S | not grep INDVAR
|
| share_ivs.ll | 1 ; RUN: opt < %s -loop-reduce -S | grep phi | count 1
|
| /external/naver-fonts/ |
| README | 7 were made to reduce the size of the NanumGothicBold.ttf and NanumGothic.ttf
|
| /external/regex-re2/re2/ |
| unicode_groups.h | 14 // Adding an extra table of 16-bit singletons would reduce
|
