/external/tensorflow/tensorflow/compiler/xla/tests/ |
call_test.cc | 113 ComputationBuilder builder2(client_, "outer"); 120 TF_ASSERT_OK_AND_ASSIGN(Computation outer, builder2.Build()); 125 x = builder3.Call(outer, {x}); 126 x = builder3.Call(outer, {x}); 127 x = builder3.Call(outer, {x});
|
/external/tpm2/ |
OsslCryptoEngine.h | 72 UINT32 *outer; member in struct:__anon40440
|
/packages/providers/MediaProvider/tools/genfiles/ |
genfiles.sh | 133 sqlite3 $1 "select audio_playlists._data, audio._data from audio_playlists left outer join audio_playlists_map on audio_playlists._id=audio_playlists_map.playlist_id left outer join audio on audio_playlists_map.audio_id=audio._id order by audio_playlists_map.playlist_id,audio_playlists_map.play_order;" | {
|
/external/skqp/tests/ |
RegionTest.cpp | 125 static bool slow_contains(const SkRegion& outer, const SkRegion& inner) { 127 tmp.op(outer, inner, SkRegion::kUnion_Op); 128 return outer == tmp; 131 static bool slow_contains(const SkRegion& outer, const SkIRect& r) { 133 tmp.op(outer, SkRegion(r), SkRegion::kUnion_Op); 134 return outer == tmp; 137 static bool slow_intersects(const SkRegion& outer, const SkRegion& inner) { 139 return tmp.op(outer, inner, SkRegion::kIntersect_Op); 197 SkRegion outer; local 198 randRgn(rand, &outer, 8) [all...] |
PathOpsCubicIntersectionTest.cpp | 437 static void oneOff(skiatest::Reporter* reporter, int outer, int inner) { 438 const CubicPts& cubic1 = testSet[outer]; 443 static void newOneOff(skiatest::Reporter* reporter, int outer, int inner) { 444 const CubicPts& cubic1 = newTestSet[outer]; 456 for (int outer = 0; outer < testSetCount - 1; ++outer) { 457 for (int inner = outer + 1; inner < testSetCount; ++inner) { 458 oneOff(reporter, outer, inner); 461 for (int outer = 0; outer < newTestSetCount - 1; ++outer) [all...] |
/external/eigen/Eigen/src/SparseCore/ |
SparseTranspose.h | 69 EIGEN_STRONG_INLINE InnerIterator(const unary_evaluator& unaryOp, Index outer) 70 : EvalIterator(unaryOp.m_argImpl,outer)
|
/external/harfbuzz_ng/src/ |
hb-ot-var-hvar-table.hh | 45 unsigned int map (unsigned int v) const /* Returns 16.16 outer.inner. */ 65 unsigned int outer = u >> n; local 67 u = (outer<<16) | inner;
|
/external/valgrind/none/tests/amd64-solaris/ |
coredump_single_thread.post.exp | 26 outer
|
coredump_single_thread_sse.stderr.exp | 5 by 0x........: outer (coredump_single_thread_sse.c:58)
|
/external/valgrind/none/tests/x86-solaris/ |
coredump_single_thread.post.exp | 24 outer
|
coredump_single_thread_sse.stderr.exp | 5 by 0x........: outer (coredump_single_thread_sse.c:66)
|
/external/guava/guava/src/com/google/common/util/concurrent/ |
AtomicLongMap.java | 105 outer: for (;;) { 123 continue outer; local 154 outer: for (;;) { 172 continue outer; local 189 outer: for (;;) { 207 continue outer; local
|
/external/python/cpython3/Lib/ |
hashlib.py | 192 outer = new(hash_name) 198 outer.update(password.translate(_trans_5C)) 200 def prf(msg, inner=inner, outer=outer): 204 ocpy = outer.copy() 212 dklen = outer.digest_size
|
/external/eigen/test/ |
sparse_block.cpp | 31 const Index outer = ref.outerSize(); local 126 Index j0 = internal::random<Index>(0,outer-1); 127 Index j1 = internal::random<Index>(0,outer-1); 159 m3.reserve(VectorXi::Constant(outer,int(inner/2))); 160 for(Index j=0; j<outer; ++j) 163 for(Index j=0; j<(std::min)(outer, inner); ++j) 170 for(Index j=0; j<(std::min)(outer, inner); ++j) 190 Index j0 = internal::random<Index>(0,outer-2); 191 Index j1 = internal::random<Index>(0,outer-2); 192 Index n0 = internal::random<Index>(1,outer-(std::max)(j0,j1)) [all...] |
/external/python/cpython3/Lib/asyncio/ |
tasks.py | 572 Cancellation: if the outer Future is cancelled, all children (that 575 the outer Future is *not* cancelled in this case. (This is to 582 outer = loop.create_future() 583 outer.set_result([]) 584 return outer 605 outer = _GatheringFuture(children, loop=loop) 611 if outer.done(): 620 outer.set_exception(res) 625 outer.set_exception(res) 632 outer.set_result(results [all...] |
/external/v8/src/compiler/ |
osr.cc | 52 // Peel outer loops and rewire the graph so that control reduction can 63 // Make a copy of the graph for each outer loop. 78 // The outer loops are dead in this copy. 79 for (LoopTree::Loop* outer = loop->parent(); outer; 80 outer = outer->parent()) { 81 for (Node* node : loop_tree->HeaderNodes(outer)) { 233 // Kill the outer loops in the original graph. 234 TRACE("Killing outer loop headers...\n") [all...] |
/external/skia/tests/ |
PathOpsCubicIntersectionTest.cpp | 438 static void oneOff(skiatest::Reporter* reporter, int outer, int inner) { 439 const CubicPts& cubic1 = testSet[outer]; 444 static void newOneOff(skiatest::Reporter* reporter, int outer, int inner) { 445 const CubicPts& cubic1 = newTestSet[outer]; 457 for (int outer = 0; outer < testSetCount - 1; ++outer) { 458 for (int inner = outer + 1; inner < testSetCount; ++inner) { 459 oneOff(reporter, outer, inner); 462 for (int outer = 0; outer < newTestSetCount - 1; ++outer) [all...] |
/libcore/ojluni/src/main/java/java/util/ |
ComparableTimSort.java | 673 outer: 689 break outer; 695 break outer; 713 break outer; 717 break outer; 726 break outer; 730 break outer; 736 } // End of "outer" loop 793 outer: 809 break outer; [all...] |
TimSort.java | 706 outer: 722 break outer; 728 break outer; 746 break outer; 750 break outer; 759 break outer; 763 break outer; 769 } // End of "outer" loop 826 outer: [all...] |
/external/skia/src/core/ |
SkScan_Hairline.cpp | 270 static bool geometric_contains(const SkRect& outer, const SkRect& inner) { 271 SkASSERT(!is_inverted(outer) && !is_inverted(inner)); 272 return inner.fRight <= outer.fRight && inner.fLeft >= outer.fLeft && 273 inner.fBottom <= outer.fBottom && inner.fTop >= outer.fTop; 644 SkRect outer, tmp; 646 outer.set(r.fLeft - rx, r.fTop - ry, 650 SkScan::FillRect(outer, clip, blitter); 654 tmp.set(outer.fLeft, outer.fTop, outer.fRight, outer.fTop + dy) [all...] |
/external/skqp/src/core/ |
SkScan_Hairline.cpp | 270 static bool geometric_contains(const SkRect& outer, const SkRect& inner) { 271 SkASSERT(!is_inverted(outer) && !is_inverted(inner)); 272 return inner.fRight <= outer.fRight && inner.fLeft >= outer.fLeft && 273 inner.fBottom <= outer.fBottom && inner.fTop >= outer.fTop; 644 SkRect outer, tmp; 646 outer.set(r.fLeft - rx, r.fTop - ry, 650 SkScan::FillRect(outer, clip, blitter); 654 tmp.set(outer.fLeft, outer.fTop, outer.fRight, outer.fTop + dy) [all...] |
/external/guava/guava-gwt/test-super/com/google/common/base/super/com/google/common/base/ |
CaseFormatTest.java | 195 for (CaseFormat outer : CaseFormat.values()) { 197 assertNull(outer.converterTo(inner).convert(null)); 198 assertNull(outer.converterTo(inner).reverse().convert(null)); 210 for (CaseFormat outer : CaseFormat.values()) { 212 SerializableTester.reserializeAndAssert(outer.converterTo(inner));
|
/external/guava/guava-tests/test/com/google/common/base/ |
CaseFormatTest.java | 206 for (CaseFormat outer : CaseFormat.values()) { 208 assertNull(outer.converterTo(inner).convert(null)); 209 assertNull(outer.converterTo(inner).reverse().convert(null)); 221 for (CaseFormat outer : CaseFormat.values()) { 223 SerializableTester.reserializeAndAssert(outer.converterTo(inner));
|
/prebuilts/go/darwin-x86/src/cmd/vet/ |
deadcode.go | 114 outer := d.breakTarget 117 d.breakTarget = outer 120 outer := d.breakTarget 123 d.breakTarget = outer 126 outer := d.breakTarget 129 d.breakTarget = outer 132 outer := d.breakTarget 135 d.breakTarget = outer 138 outer := d.breakTarget 141 d.breakTarget = outer [all...] |
/prebuilts/go/linux-x86/src/cmd/vet/ |
deadcode.go | 114 outer := d.breakTarget 117 d.breakTarget = outer 120 outer := d.breakTarget 123 d.breakTarget = outer 126 outer := d.breakTarget 129 d.breakTarget = outer 132 outer := d.breakTarget 135 d.breakTarget = outer 138 outer := d.breakTarget 141 d.breakTarget = outer [all...] |