| /external/clang/test/CodeGen/ |
| regparm.c | 14 extern void FASTCALL reduced(char b, double c, foo* d, double e, int f);
23 // CHECK: call void @reduced(i8 inreg signext 0, {{.*}} %struct.foo* inreg null
24 reduced(0, 0.0, 0, 0.0, 0);
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/nds32/ |
| to-16bit-v2.d | 3 #as: -Os -mno-reduced-regs
|
| to-16bit-v3.d | 3 #as: -Os -mno-reduced-regs
|
| to-16bit-v1.d | 3 #as: -Os -mno-reduced-regs
|
| /external/skia/tests/ |
| ClipStackTest.cpp | 856 // reduced stack.
1024 const GrReducedClip* reduced = new (storage.get()) GrReducedClip(stack, queryBounds); local
1093 const GrReducedClip* reduced = new (storage.get()) GrReducedClip(stack, bounds); local
[all...] |
| PathOpsConicLineIntersectionTest.cpp | 110 SkPoint reduced[3]; local
113 SkPath::Verb order1 = SkReduceOrder::Conic(floatConic, reduced);
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/ |
| btm_utils.py | 130 reduced = reduce_tree(child, new_node)
131 if reduced is not None:
132 new_node.children.append(reduced)
138 reduced = reduce_tree(child, new_node)
139 if reduced:
140 new_node.children.append(reduced)
142 # delete the group if all of the children were reduced to None
230 reduced = reduce_tree(child, new_node)
231 if reduced is not None:
232 new_node.children.append(reduced)
[all...] |
| /external/python/cpython2/Lib/lib2to3/ |
| btm_utils.py | 130 reduced = reduce_tree(child, new_node)
131 if reduced is not None:
132 new_node.children.append(reduced)
138 reduced = reduce_tree(child, new_node)
139 if reduced:
140 new_node.children.append(reduced)
142 # delete the group if all of the children were reduced to None
230 reduced = reduce_tree(child, new_node)
231 if reduced is not None:
232 new_node.children.append(reduced)
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/ |
| btm_utils.py | 130 reduced = reduce_tree(child, new_node)
131 if reduced is not None:
132 new_node.children.append(reduced)
138 reduced = reduce_tree(child, new_node)
139 if reduced:
140 new_node.children.append(reduced)
142 # delete the group if all of the children were reduced to None
230 reduced = reduce_tree(child, new_node)
231 if reduced is not None:
232 new_node.children.append(reduced)
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/ |
| btm_utils.py | 130 reduced = reduce_tree(child, new_node)
131 if reduced is not None:
132 new_node.children.append(reduced)
138 reduced = reduce_tree(child, new_node)
139 if reduced:
140 new_node.children.append(reduced)
142 # delete the group if all of the children were reduced to None
230 reduced = reduce_tree(child, new_node)
231 if reduced is not None:
232 new_node.children.append(reduced)
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/ |
| btm_utils.py | 130 reduced = reduce_tree(child, new_node)
131 if reduced is not None:
132 new_node.children.append(reduced)
138 reduced = reduce_tree(child, new_node)
139 if reduced:
140 new_node.children.append(reduced)
142 # delete the group if all of the children were reduced to None
230 reduced = reduce_tree(child, new_node)
231 if reduced is not None:
232 new_node.children.append(reduced)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/ |
| btm_utils.py | 130 reduced = reduce_tree(child, new_node)
131 if reduced is not None:
132 new_node.children.append(reduced)
138 reduced = reduce_tree(child, new_node)
139 if reduced:
140 new_node.children.append(reduced)
142 # delete the group if all of the children were reduced to None
230 reduced = reduce_tree(child, new_node)
231 if reduced is not None:
232 new_node.children.append(reduced)
[all...] |
| /external/eigen/unsupported/test/ |
| cxx11_tensor_argmax.cpp | 64 Tensor<Tuple<DenseIndex, float>, 0, DataLayout> reduced; local
66 reduced = index_tuples.reduce(
71 VERIFY_IS_EQUAL(maxi(), reduced(0).second);
96 Tensor<Tuple<DenseIndex, float>, 0, DataLayout> reduced; local
98 reduced = index_tuples.reduce(
103 VERIFY_IS_EQUAL(mini(), reduced(0).second);
190 // Expect max to be in the first index of the reduced dimension
212 // Expect max to be in the last index of the reduced dimension
248 // Expect min to be in the first index of the reduced dimension
270 // Expect min to be in the last index of the reduced dimensio
[all...] |
| /external/clang/utils/analyzer/ |
| reducer.pl | 64 `cp $srcFile $file.reduced`;
65 print "$prog: generated '$file.reduced";
|
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-mmix/ |
| orph-d-awp.d | 11 # reduced to be relative to the register section, which is an error.
|
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-m68hc11/ |
| adj-brset.s | 9 ;;; branch must be fixed and reduced by 1. We check for different
|
| /external/gemmlowp/meta/generators/ |
| streams_common.py | 126 reduced = aggregators[:reduced_count]
128 emitter.EmitVSumReduce('u32', len(aggregators), 4, reduced, aggregators)
130 for temp in reduced:
133 for temp in reduced:
136 emitter.EmitVStoreA(1, 32, reduced,
|
| quantized_mul_kernels_common.py | 521 reduced = aggregators[:reduced_count]
522 emitter.EmitVSumReduce('u32', len(aggregators), 4, reduced, aggregators)
523 return reduced
572 reduced = _GenerateAggregatorReduce(self.asm_emitter, aggregators, kernel_m,
576 registers, reduced,
|
| /external/bison/src/ |
| reduce.c | 149 Consider only the (partially) reduced grammar which has only
152 The result is the set P of productions in the reduced grammar,
153 and the set V of symbols in the reduced grammar.
402 bool reduced;
404 /* Allocate the global sets used to compute the reduced grammar */
414 reduced = (nuseless_nonterminals + nuseless_productions > 0);
415 if (!reduced)
427 renumbered only in the reduced grammar. */
435 grammar_dump (stderr, "Reduced Grammar");
437 fprintf (stderr, "reduced %s defines %d terminals, %d nonterminals
399 bool reduced; local
[all...] |
| /packages/apps/ExactCalculator/src/com/android/calculator2/ |
| BoundedRational.java | 124 BoundedRational reduced = reduce(); local
125 if (!reduced.mDen.equals(BigInteger.ONE)) {
128 return reduced.mNum.intValue();
173 * Return a possibly reduced version of r that's not tooBig().
337 * Compute integral power of this, assuming this has been reduced and exp is >= 0.
|
| /frameworks/base/services/core/java/com/android/server/wm/ |
| TaskSnapshotPersister.java | 344 final Bitmap reduced = mSnapshot.isReducedResolution() local
351 reduced.compress(JPEG, QUALITY, reducedFos);
358 // For snapshots with reduced resolution, do not create or save full sized bitmaps
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| zcse.go | 9 // to begin with a reduced number of values. Values are just relinked,
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| zcse.go | 9 // to begin with a reduced number of values. Values are just relinked,
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/streams/ |
| rewrite.rb | 213 reduced = []
257 reduced.unshift( operation ) if operation
260 @operations.replace( reduced )
|
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| BitmapFactoryTest.java | 466 Bitmap reduced = BitmapFactory.decodeResource(mRes, R.drawable.robot, options); local
468 options.inBitmap = reduced;
488 Bitmap reduced = BitmapFactory.decodeResource(mRes, R.drawable.robot, options); local
490 assertSame(original, reduced);
491 assertEquals(originalSize, reduced.getAllocationByteCount());
492 assertEquals(originalSize, reduced.getByteCount() * 16);
[all...] |
