| /external/bison/tests/ |
| reduce.at | 582 [[$default]])[ reduce using rule 5 (A)
584 Conflict between rule 5 and token 'a' resolved as reduce (%left 'a').
612 [[$default]])[ reduce using rule 5 (A)
620 [[$default]])[ reduce using rule 7 (c)
628 [[$default]])[ reduce using rule 3 (S)
643 [[$default]])[ reduce using rule 4 (A)
651 [[$default]])[ reduce using rule 1 (S)
659 [[$default]])[ reduce using rule 2 (S)
667 [[$default]])[ reduce using rule 6 (c)]AT_COND_CASE([[LALR]],
680 [[$default]])[ reduce using rule 5 (A)]AT_COND_CASE([[canonical LR]], [
[all...] |
| /external/v8/src/compiler/ |
| graph-reducer.cc | 27 bool reduce = true; local
29 if (!reduce) return;
30 reduce = false; // Assume we don't need to rerun any reducers.
35 Reduction reduction = (*i)->Reduce(node);
43 reduce = true;
68 reduce = true;
|
| change-lowering-unittest.cc | 75 Reduction Reduce(Node* node) {
83 return reducer.Reduce(node);
128 Reduction reduction = Reduce(node);
145 Reduction reduction = Reduce(node);
155 Reduction reduction = Reduce(node);
174 Reduction reduction = Reduce(node);
199 Reduction reduction = Reduce(node);
229 Reduction reduction = Reduce(node);
258 Reduction reduction = Reduce(node);
284 Reduction reduction = Reduce(node)
[all...] |
| machine-operator-reducer-unittest.cc | 21 Reduction Reduce(Node* node) {
26 return reducer.Reduce(node);
235 Reduce(graph()->NewNode((machine()->*unop.constructor)(), Parameter(0)));
251 Reduction reduction = Reduce(graph()->NewNode(
266 Reduction reduction = Reduce(graph()->NewNode(
276 Reduction reduction = Reduce(graph()->NewNode(
291 Reduction reduction = Reduce(graph()->NewNode(
301 Reduction reduction = Reduce(graph()->NewNode(
315 Reduction reduction = Reduce(
329 Reduction reduction = Reduce(
[all...] |
| simplified-operator-reducer-unittest.cc | 23 Reduction Reduce(Node* node) {
29 return reducer.Reduce(node);
164 Reduction reduction = Reduce(
181 Reduction reduction = Reduce(
191 Reduce(graph()->NewNode(simplified()->BooleanNot(), FalseConstant()));
199 Reduce(graph()->NewNode(simplified()->BooleanNot(), TrueConstant()));
211 Reduction reduction = Reduce(graph()->NewNode(
220 Reduction reduction = Reduce(
228 Reduction reduction = Reduce(
240 Reduction reduction = Reduce(
[all...] |
| js-builtin-reducer-unittest.cc | 23 Reduction Reduce(Node* node) {
28 return reducer.Reduce(node);
74 Reduction r = Reduce(call);
92 Reduction r = Reduce(call);
107 Reduction r = Reduce(call);
126 Reduction r = Reduce(call);
162 Reduction r = Reduce(call);
|
| simplified-operator-reducer.h | 27 virtual Reduction Reduce(Node* node) OVERRIDE;
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib-dynload/ |
| _functools.so | |
| /external/skia/tests/ |
| PathOpsQuadReduceOrderTest.cpp | 24 SkDEBUGCODE(int result = ) reducer.reduce(quad);
51 order = reducer.reduce(quad);
58 order = reducer.reduce(quad);
|
| PathOpsCubicReduceOrderTest.cpp | 110 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics);
119 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics);
122 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics);
129 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics);
138 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics);
147 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics);
156 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics);
159 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics);
166 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics);
176 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics)
[all...] |
| /system/core/include/utils/ |
| LinearTransform.h | 56 // Helpers which will reduce the fraction N/D using Euclid's method.
57 template <class T> static void reduce(T* N, T* D);
58 static void reduce(int32_t* N, uint32_t* D);
|
| /external/junit/src/org/junit/runner/manipulation/ |
| Sortable.java | 5 * failed first, you can reduce the average time to the first test failing. Test sorting should not be used to
|
| /development/ndk/platforms/android-18/samples/gles3jni/ |
| README | 22 * Instanced rendering and vertex attribute divisor to reduce the number of
24 * Vertex array objects to reduce the number of calls required to set up
|
| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| different-type-ivs.ll | 1 ; RUN: opt < %s -loop-reduce -disable-output
2 ; Test to make sure that loop-reduce never crashes on IV's
|
| dead-phi.ll | 1 ; RUN: opt < %s -loop-reduce -S | grep phi | count 1
|
| dont_reverse.ll | 1 ; RUN: opt < %s -loop-reduce -S \
|
| exit_compare_live_range.ll | 5 ; RUN: opt -S -loop-reduce < %s | FileCheck %s
|
| pr2537.ll | 1 ; RUN: opt < %s -loop-reduce -disable-output
|
| variable_stride.ll | 2 ; RUN: opt < %s -loop-reduce -S | not grep mul
|
| /frameworks/base/libs/common_time/ |
| common_clock.cpp | 52 LinearTransform::reduce(&numer, &denom);
54 ALOGE("Overflow in CommonClock::init while trying to reduce %" PRIu64 "/%" PRIu64,
139 LinearTransform::reduce(&n1, &d2);
140 LinearTransform::reduce(&n2, &d1);
141 LinearTransform::reduce(&n2, &d2);
|
| /external/v8/test/webkit/ |
| array-enumerators-functions-expected.txt | 141 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduce(forwarders[f], returnFalse, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(simpleArray), forwarders[f], returnFalse, 0)
142 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], returnFalse, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(emptyArray), forwarders[f], returnFalse, 0)
143 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], returnFalse, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeEmptyArray), forwarders[f], returnFalse, 0)
144 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduce(forwarders[f], returnFalse, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeSparseArray), forwarders[f], returnFalse, 0)
145 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduce(forwarders[f], returnTrue, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(simpleArray), forwarders[f], returnTrue, 0
[all...] |
| /external/bison/src/ |
| conflicts.c | 88 " resolved as reduce"),
160 " type=\"reduce\">",
217 | specified state. Used when we resolve a shift-reduce conflict in |
236 | Turn off the reduce recorded for the specified token in the |
237 | specified lookahead set. Used when we resolve a shift-reduce |
249 | Attempt to resolve shift-reduce conflict for one rule by means of |
252 | shift or reduce tables so that there is no longer a conflict. |
265 /* Find the rule to reduce by to get precedence of reduction. */
275 /* Shift-reduce conflict occurs for token number i
345 check for shift-reduce conflict, and try to resolve usin
[all...] |
| /device/htc/flounder/ |
| init.flounder_svelte.rc | 7 # Reduce screen resolution
|
| /external/bison/po/ |
| POTFILES.in | 14 src/reduce.c
|
| /external/guava/guava-tests/test/com/google/common/jdk5backport/ |
| Arrays.java | 5 * to support JDK 1.5 with a few pass-through methods to reduce import
|
