Home
last modified time | relevance | path

Searched refs:outer (Results 1 – 25 of 566) sorted by relevance

12345678910>>...23

/external/llvm/test/Transforms/SCCP/
Dundef-resolve.ll18 br label %control.outer.outer
20 control.outer.loopexit.us-lcssa: ; preds = %control
21 br label %control.outer.loopexit
23 control.outer.loopexit: ; preds = %control.outer.loopexit.us-lcssa.us, %c…
24 br label %control.outer.outer.backedge
26 control.outer.outer: ; preds = %control.outer.outer.backedge, %init
27 %switchCond.0.ph.ph = phi i32 [ 2, %init ], [ 3, %control.outer.outer.backedge ] ; <i32> [#uses=2]
28 …%i.0.ph.ph = phi i32 [ undef, %init ], [ %i.0.ph.ph.be, %control.outer.outer.backedge ] ; <i32> [#…
30 …br i1 %tmp4, label %control.outer.outer.split.us, label %control.outer.outer.control.outer.outer.s…
32 control.outer.outer.control.outer.outer.split_crit_edge: ; preds = %control.outer.outer
[all …]
/external/eigen/unsupported/Eigen/src/Skyline/
DSkylineMatrix.h147 const Index outer = IsRowMajor ? row : col;
150 eigen_assert(outer < outerSize());
153 if (outer == inner)
154 return this->m_data.diag(outer);
157 if (inner > outer) //upper matrix
160 if (outer >= minOuterIndex)
161 … return this->m_data.upper(m_colStartIndex[inner] + outer - (inner - m_data.upperProfile(inner)));
165 if (inner < outer) //lower matrix
167 const Index minInnerIndex = outer - m_data.lowerProfile(outer);
169 … return this->m_data.lower(m_rowStartIndex[outer] + inner - (outer - m_data.lowerProfile(outer)));
[all …]
/external/protobuf/java/src/test/java/com/google/protobuf/
DLazyMessageLiteTest.java74 LazyMessageLite outer = LazyMessageLite.newBuilder() in testSetValues() local
81 assertEquals(1, outer.getNum()); in testSetValues()
82 assertEquals(421, outer.getNumWithDefault()); in testSetValues()
84 assertEquals(2, outer.getInner().getNum()); in testSetValues()
85 assertEquals(42, outer.getInner().getNumWithDefault()); in testSetValues()
87 assertEquals(3, outer.getInner().getNested().getNum()); in testSetValues()
88 assertEquals(4, outer.getInner().getNested().getNumWithDefault()); in testSetValues()
90 assertFalse(outer.hasOneofNum()); in testSetValues()
91 assertTrue(outer.hasOneofInner()); in testSetValues()
93 assertEquals(2, outer.getOneofInner().getNum()); in testSetValues()
[all …]
/external/clang/test/CXX/expr/expr.prim/expr.prim.general/
Dp8-0x.cpp7 struct outer { struct
23 operator decltype(outer::middle::inner()) ();
24 operator decltype(outer::middle())::inner2 ();
25 operator decltype(outer())::middle::inner3 ();
26 str(int (decltype(outer::middle::inner())::*n)(),
27 int (decltype(outer::middle())::inner::*o)(),
28 int (decltype(outer())::middle::inner::*p)());
31 decltype(outer::middle::inner()) a;
33 …a.decltype(outer::middle())::mfunc(); // expected-error{{'PR10127::outer::middle::mfunc' is not a … in scope() argument
34 a.decltype(outer::middle::inner())::func(); in scope()
[all …]
/external/google-tv-pairing-protocol/cpp/tests/polo/wire/protobuf/
Dprotobufwireadaptertest.cc133 OuterMessage outer; in TEST_F() local
134 outer.set_type(OuterMessage_MessageType_MESSAGE_TYPE_CONFIGURATION); in TEST_F()
135 outer.set_payload(proto.SerializeAsString()); in TEST_F()
136 outer.set_protocol_version(1); in TEST_F()
137 outer.set_status(OuterMessage_Status_STATUS_OK); in TEST_F()
139 ExpectSend(outer); in TEST_F()
154 OuterMessage outer; in TEST_F() local
155 outer.set_type(OuterMessage_MessageType_MESSAGE_TYPE_CONFIGURATION_ACK); in TEST_F()
156 outer.set_payload(proto.SerializeAsString()); in TEST_F()
157 outer.set_protocol_version(1); in TEST_F()
[all …]
/external/skia/bench/
DGeometryBench.cpp69 for (int outer = 0; outer < loops; ++outer) { in onDraw() local
86 for (int outer = 0; outer < loops; ++outer) { in onDraw() local
103 for (int outer = 0; outer < loops; ++outer) { in onDraw() local
119 for (int outer = 0; outer < loops; ++outer) { in onDraw() local
153 for (int outer = 0; outer < loops; ++outer) { in onDraw() local
169 for (int outer = 0; outer < loops; ++outer) { in onDraw() local
187 for (int outer = 0; outer < loops; ++outer) { in onDraw() local
203 for (int outer = 0; outer < loops; ++outer) { in onDraw() local
221 for (int outer = 0; outer < loops; ++outer) { in onDraw() local
237 for (int outer = 0; outer < loops; ++outer) { in onDraw() local
/external/v8/test/mjsunit/compiler/
Dreceiver-conversion.js12 function test(outer, inner, check) { argument
13 check(outer());
14 check(outer());
15 %OptimizeFunctionOnNextCall(outer);
16 check(outer());
30 function outer() { function in UndefinedSloppy
34 test(outer, inner, check);
49 function outer() { function in UndefinedStrict
53 test(outer, inner, check);
67 function outer() { function in NumberSloppy
[all …]
Dinline-arguments.js174 function outer(x, y) { function
178 %OptimizeFunctionOnNextCall(outer);
180 assertEquals(2, outer(1, 2));
196 function outer(x, y) { function
200 assertEquals(2, outer(1, 2));
201 assertEquals(2, outer(1, 2));
202 assertEquals(2, outer(1, 2));
203 %OptimizeFunctionOnNextCall(outer);
204 assertEquals(2, outer(1, 2));
234 function outer(x,y) { function
[all …]
/external/libcxx/test/std/containers/sequences/vector/vector.modifiers/
Derase_iter_iter.pass.cpp63 std::vector<std::vector<int> > outer(2, std::vector<int>(1)); in main() local
64 assert(is_contiguous_container_asan_correct(outer)); in main()
65 assert(is_contiguous_container_asan_correct(outer[0])); in main()
66 assert(is_contiguous_container_asan_correct(outer[1])); in main()
67 outer.erase(outer.begin(), outer.begin()); in main()
68 assert(outer.size() == 2); in main()
69 assert(outer[0].size() == 1); in main()
70 assert(outer[1].size() == 1); in main()
71 assert(is_contiguous_container_asan_correct(outer)); in main()
72 assert(is_contiguous_container_asan_correct(outer[0])); in main()
[all …]
/external/llvm/test/Transforms/LICM/
Dlcssa-ssa-promoter.ll16 br i1 undef, label %return, label %outer.preheader
18 outer.preheader:
19 br label %outer.header
20 ; CHECK: outer.preheader:
21 ; CHECK: br label %outer.header
23 outer.header:
25 br i1 undef, label %outer.latch, label %inner.preheader
26 ; CHECK: outer.header:
27 ; CHECK-NEXT: br i1 undef, label %outer.latch, label %inner.preheader
55 br label %outer.latch
[all …]
/external/v8/test/mjsunit/regress/
Dregress-2261.js69 function outer(x) { function
73 assertEquals(1, outer(1));
74 assertEquals(1, outer(1));
75 %OptimizeFunctionOnNextCall(outer);
76 assertEquals(1, outer(1));
78 assertEquals(1, outer(1));
103 function outer(x) { function
107 assertEquals(21, outer(1));
108 assertEquals(21, outer(1));
109 %OptimizeFunctionOnNextCall(outer);
[all …]
Dregress-4023.js26 var outer = new Outer(); variable
30 SetInner(outer, inner);
35 KeepMapAlive(outer);
36 KeepMapAlive(outer);
38 KeepMapAlive(outer);
41 print(Crash(outer));
42 print(Crash(outer));
44 print(Crash(outer));
50 outer = undefined;
/external/eigen/unsupported/Eigen/src/SparseExtra/
DDynamicSparseMatrix.h94 const Index outer = IsRowMajor ? row : col;
96 return m_data[outer].at(inner);
105 const Index outer = IsRowMajor ? row : col;
107 return m_data[outer].atWithInsertion(inner);
156 inline Scalar& insertBackByOuterInner(Index outer, Index inner)
158 eigen_assert(outer<Index(m_data.size()) && inner<m_innerSize && "out of range");
159 … eigen_assert(((m_data[outer].size()==0) || (m_data[outer].index(m_data[outer].size()-1)<inner))
161 m_data[outer].append(0, inner);
162 return m_data[outer].value(m_data[outer].size()-1);
167 const Index outer = IsRowMajor ? row : col;
[all …]
/external/llvm/test/Transforms/LoopUnroll/
Dpr18861.ll11 ; ( outer.header ) <--
18 ; ( inner.latch ) ( outer.latch )
26 ; %storemerge1.lcssa, breaking LCSSA form for the outer loop.
31 br label %outer.header
33 outer.header: ; preds = %outer.latch, %entry
34 %storemerge1 = phi i32 [ 0, %entry ], [ %inc9, %outer.latch ]
37 inner.header: ; preds = %inner.latch, %outer.header
38 %storemerge = phi i32 [ %add, %inner.latch ], [ 0, %outer.header ]
40 br i1 %cmp, label %inner.latch, label %outer.latch
52 outer.latch: ; preds = %inner.header
[all …]
/external/llvm/test/Analysis/BlockFrequencyInfo/
Ddouble_exit.ll10 br label %outer
18 ; CHECK-NEXT: outer: float = 1.5,
19 outer:
20 %I.0 = phi i32 [ 0, %entry ], [ %inc6, %outer.inc ]
21 %Return.0 = phi i32 [ 0, %entry ], [ %Return.1, %outer.inc ]
28 ; Pseudo-edges = outer.inc @ 1/5, exit @ 1/5
33 %Return.1 = phi i32 [ %Return.0, %outer ], [ %call4, %inner.inc ]
34 %J.0 = phi i32 [ %I.0, %outer ], [ %inc, %inner.inc ]
36 br i1 %cmp2, label %inner.body, label %outer.inc, !prof !1 ; 4:1
56 ; CHECK-NEXT: outer.inc: float = 0.5,
[all …]
/external/llvm/test/Transforms/IndVarSimplify/
Dlcssa-preservation.ll9 br label %outer.header
10 ; CHECK: br label %outer.header
12 outer.header:
13 ; CHECK: outer.header:
14 %outer.iv = phi i32 [ 0, %entry ], [ %x, %outer.latch ]
21 %inner.iv = phi i32 [ undef, %outer.header ], [ %inc, %inner.latch ]
22 %cmp1 = icmp slt i32 %inner.iv, %outer.iv
23 br i1 %cmp1, label %inner.latch, label %outer.latch
24 ; CHECK: br i1 {{.*}}, label %inner.latch, label %outer.latch
29 %cmp2 = icmp slt i32 %inner.iv, %outer.iv
[all …]
D2009-05-24-useafterfree.ll7 br i1 false, label %bb.nph1.preheader, label %.outer._crit_edge
14 bb.nph1: ; preds = %.outer, %bb.nph1.preheader
15 br i1 undef, label %bb.nph3.preheader, label %.outer
27 br i1 %5, label %bb.nph3, label %.outer.loopexit
29 .outer.loopexit: ; preds = %bb.nph3
31 br label %.outer
33 .outer: ; preds = %.outer.loopexit, %bb.nph1
34 br i1 undef, label %bb.nph1, label %.outer._crit_edge.loopexit
36 .outer._crit_edge.loopexit: ; preds = %.outer
37 br label %.outer._crit_edge
[all …]
/external/llvm/test/Transforms/LoopRotate/
Dpreserve-loop-simplify.ll10 br label %outer.header
11 ; CHECK: br label %outer.header
13 outer.header:
14 ; CHECK: outer.header:
15 br i1 undef, label %inner.header, label %outer.body
16 ; CHECK-NEXT: br i1 {{[^,]*}}, label %[[INNER_PREROTATE_PREHEADER:[^,]*]], label %outer.body
33 br i1 undef, label %outer.latch, label %inner.latch
40 outer.body:
41 ; CHECK: outer.body:
42 br label %outer.latch
[all …]
/external/skia/src/pathops/
DSkOpCoincidence.cpp145 bool SkOpCoincidence::addIfMissing(const SkCoincidentSpans* outer, SkOpPtT* over1s, in addIfMissing() argument
150 && check->fOppPtTStart->span() == outer->fOppPtTStart->span()) { in addIfMissing()
153 SkASSERT(check->fOppPtTEnd->span() == outer->fOppPtTEnd->span() in addIfMissing()
157 if (check->fCoinPtTStart->span() == outer->fCoinPtTStart->span() in addIfMissing()
159 SkASSERT(check->fCoinPtTEnd->span() == outer->fCoinPtTEnd->span() in addIfMissing()
166 this->add(outer->fCoinPtTStart, outer->fCoinPtTEnd, over1s, over1e, allocator); in addIfMissing()
233 SkCoincidentSpans* outer = fHead; in addMissing() local
234 if (!outer) { in addMissing()
238 fTop = outer; in addMissing()
244 const SkOpSegment* outerCoin = outer->fCoinPtTStart->segment(); in addMissing()
[all …]
/external/llvm/test/Transforms/LoopUnswitch/
D2007-07-18-DomInfo.ll21 br label %bb1855.outer.outer
23 cond_true1831: ; preds = %bb1855.outer
30 br i1 false, label %bb1855.outer, label %cond_true1849
33 br label %bb1855.outer.outer
35 bb1855.outer.outer: ; preds = %cond_true1849, %bb1734
37 br label %bb1855.outer
39 bb1855.outer: ; preds = %bb1855.outer.outer, %cond_next1844
40 …%b.10.ph = phi i8* [ null, %cond_next1844 ], [ %b.10.ph.ph, %bb1855.outer.outer ] ; …
44 cond_next1915: ; preds = %cond_next1961, %bb1855.outer
/external/llvm/test/Transforms/PGOProfile/
Dloop2.ll13 br label %for.cond.outer
15 for.cond.outer:
16 ; GEN: for.cond.outer:
18 %i.0 = phi i32 [ 0, %entry ], [ %inc.2, %for.inc.outer ]
19 %sum.0 = phi i32 [ 1, %entry ], [ %sum.1, %for.inc.outer ]
21 br i1 %cmp, label %for.body.outer, label %for.end.outer
22 ; USE: br i1 %cmp, label %for.body.outer, label %for.end.outer
25 for.body.outer:
26 ; GEN: for.body.outer:
33 %j.0 = phi i32 [ 0, %for.body.outer ], [ %inc.1, %for.inc.inner ]
[all …]
/external/eigen/Eigen/src/SparseCore/
DSparseTriangularView.h72 EIGEN_STRONG_INLINE InnerIterator(const SparseTriangularView& view, Index outer)
73 : Base(view.nestedExpression(), outer), m_returnOne(false)
77 while((*this) && ((HasUnitDiag||SkipDiag) ? this->index()<=outer : this->index()<outer))
82 else if(HasUnitDiag && ((!Base::operator bool()) || Base::index()>=Base::outer()))
97 … if(HasUnitDiag && (!SkipFirst) && ((!Base::operator bool()) || Base::index()>=Base::outer()))
107 …inline Index row() const { return (MatrixType::Flags&RowMajorBit ? Base::outer() : this->index());…
108 …inline Index col() const { return (MatrixType::Flags&RowMajorBit ? this->index() : Base::outer());…
111 if(HasUnitDiag && m_returnOne) return Base::outer();
127 if (SkipDiag) return (Base::operator bool() && this->index() < this->outer());
128 else return (Base::operator bool() && this->index() <= this->outer());
[all …]
/external/llvm/test/CodeGen/X86/
D2007-10-30-LSRCrash.ll14 br i1 false, label %bb103, label %bb69.outer
16 bb76.split: ; preds = %bb69.outer.split.split, %bb69.us208
17 br i1 false, label %bb103, label %bb69.outer
19 bb69.outer: ; preds = %bb76.split, %bb98.preheader
23 br i1 false, label %bb69.us208, label %bb69.outer.split.split
25 bb69.us208: ; preds = %bb69.outer
32 bb69.outer.split.split: ; preds = %bb69.outer
39 bb89: ; preds = %bb69.outer.split.split, %bb69.outer.split.split, %bb69.outer.split.split, %bb69.u…
40 …mp75, %bb69.us208 ], [ %tmp75, %bb69.outer.split.split ], [ %tmp75, %bb69.outer.split.split ], [ %…
/external/llvm/test/Analysis/RegionInfo/
Dtwo_loops_same_header.ll9 br label %outer
11 outer:
21 br label %outer
27 br i1 1, label %end, label %outer
35 ; CHECK-NEXT: [1] outer => end
36 ; CHECK-NEXT: [2] outer => else
41 ; BBIT: entry, outer, body, else, else106, end, true77, then83,
42 ; BBIT: outer, body, else, else106, true77, then83,
43 ; BBIT: outer, body, true77, then83,
45 ; RNIT: entry, outer => end, end,
[all …]
/external/llvm/test/DebugInfo/X86/
Dpieces-3.ll13 ; int foo(Outer outer) {
14 ; Inner i1 = outer.inner[1];
20 ; CHECK-NEXT: DW_AT_name {{.*}}"outer"
38 define i32 @foo(i64 %outer.coerce0, i64 %outer.coerce1) #0 !dbg !4 {
39 …call void @llvm.dbg.value(metadata i64 %outer.coerce0, i64 0, metadata !24, metadata !25), !dbg !26
41 …call void @llvm.dbg.value(metadata i64 %outer.coerce1, i64 0, metadata !29, metadata !30), !dbg !26
43 %outer.sroa.1.8.extract.trunc = trunc i64 %outer.coerce1 to i32, !dbg !33
44 …call void @llvm.dbg.value(metadata i32 %outer.sroa.1.8.extract.trunc, i64 0, metadata !34, metadat…
45 %outer.sroa.1.12.extract.shift = lshr i64 %outer.coerce1, 32, !dbg !33
46 %outer.sroa.1.12.extract.trunc = trunc i64 %outer.sroa.1.12.extract.shift to i32, !dbg !33
[all …]

12345678910>>...23