/external/llvm/test/Transforms/SCCP/ |
D | undef-resolve.ll | 18 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/ |
D | SkylineMatrix.h | 147 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/clang/test/CXX/expr/expr.prim/expr.prim.general/ |
D | p8-0x.cpp | 7 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/ |
D | protobufwireadaptertest.cc | 133 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/experimental/Intersection/ |
D | SimplifyAddIntersectingTs_Test.cpp | 58 static SkPath::Verb setPath(size_t outer, SkPath& path, const SkPoint*& pts1) { in setPath() argument 60 if (outer < lineCount) { in setPath() 61 path.moveTo(lines[outer][0].fX, lines[outer][0].fY); in setPath() 62 path.lineTo(lines[outer][1].fX, lines[outer][1].fY); in setPath() 64 pts1 = lines[outer]; in setPath() 66 outer -= lineCount; in setPath() 67 if (outer < quadCount) { in setPath() 68 path.moveTo(quads[outer][0].fX, quads[outer][0].fY); in setPath() 69 path.quadTo(quads[outer][1].fX, quads[outer][1].fY, in setPath() 70 quads[outer][2].fX, quads[outer][2].fY); in setPath() [all …]
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
D | SimplifyAddIntersectingTs_Test.cpp | 58 static SkPath::Verb setPath(size_t outer, SkPath& path, const SkPoint*& pts1) { in setPath() argument 60 if (outer < lineCount) { in setPath() 61 path.moveTo(lines[outer][0].fX, lines[outer][0].fY); in setPath() 62 path.lineTo(lines[outer][1].fX, lines[outer][1].fY); in setPath() 64 pts1 = lines[outer]; in setPath() 66 outer -= lineCount; in setPath() 67 if (outer < quadCount) { in setPath() 68 path.moveTo(quads[outer][0].fX, quads[outer][0].fY); in setPath() 69 path.quadTo(quads[outer][1].fX, quads[outer][1].fY, in setPath() 70 quads[outer][2].fX, quads[outer][2].fY); in setPath() [all …]
|
/external/chromium_org/v8/test/mjsunit/regress/ |
D | regress-2261.js | 69 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 …]
|
/external/chromium_org/v8/test/mjsunit/compiler/ |
D | inline-arguments.js | 174 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/llvm/test/Transforms/LICM/ |
D | lcssa-ssa-promoter.ll | 16 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/skia/src/effects/ |
D | SkComposeImageFilter.cpp | 21 SkImageFilter* outer = getInput(0); in onFilterImage() local 24 if (!outer && !inner) { in onFilterImage() 28 if (!outer || !inner) { in onFilterImage() 29 return (outer ? outer : inner)->filterImage(proxy, src, ctx, result, offset); in onFilterImage() 34 outer->filterImage(proxy, tmp, ctx, result, offset); in onFilterImage() 40 SkImageFilter* outer = getInput(0); in onFilterBounds() local 43 if (!outer && !inner) { in onFilterBounds() 47 if (!outer || !inner) { in onFilterBounds() 48 return (outer ? outer : inner)->filterBounds(src, ctm, dst); in onFilterBounds() 53 outer->filterBounds(tmp, ctm, dst); in onFilterBounds()
|
/external/eigen/unsupported/Eigen/src/SparseExtra/ |
D | DynamicSparseMatrix.h | 94 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/IndVarSimplify/ |
D | lcssa-preservation.ll | 10 br label %outer.header 11 ; CHECK: br label %outer.header 13 outer.header: 14 ; CHECK: outer.header: 15 %outer.iv = phi i32 [ 0, %entry ], [ %x, %outer.latch ] 22 %inner.iv = phi i32 [ undef, %outer.header ], [ %inc, %inner.latch ] 23 %cmp1 = icmp slt i32 %inner.iv, %outer.iv 24 br i1 %cmp1, label %inner.latch, label %outer.latch 25 ; CHECK: br i1 {{.*}}, label %inner.latch, label %outer.latch 30 %cmp2 = icmp slt i32 %inner.iv, %outer.iv [all …]
|
D | 2009-05-24-useafterfree.ll | 7 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/Analysis/BlockFrequencyInfo/ |
D | double_exit.ll | 10 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/LoopRotate/ |
D | preserve-loop-simplify.ll | 10 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/llvm/test/Transforms/LoopUnswitch/ |
D | 2007-07-18-DomInfo.ll | 21 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
|
D | preserve-analyses.ll | 16 br label %bb8.outer 34 br i1 %4, label %bb8.outer.loopexit, label %bb5 45 br label %bb8.outer.backedge 47 bb8.outer.backedge: ; preds = %bb8.outer.loopexit, %bb7 48 %.lcssa2 = phi i8* [ %.lcssa1, %bb7 ], [ %.lcssa, %bb8.outer.loopexit ] ; <i8*> [#uses=1] 49 %ineq.0.ph.be = phi i32 [ 0, %bb7 ], [ 1, %bb8.outer.loopexit ] ; <i32> [#uses=1] 50 br label %bb8.outer 52 bb8.outer.loopexit: ; preds = %bb3 54 br label %bb8.outer.backedge 56 bb8.outer: ; preds = %bb8.outer.backedge, %entry [all …]
|
/external/llvm/test/Analysis/RegionInfo/ |
D | two_loops_same_header.ll | 9 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/CodeGen/X86/ |
D | 2007-10-30-LSRCrash.ll | 14 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/eigen/Eigen/src/SparseCore/ |
D | SparseTriangularView.h | 72 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/chromium_org/third_party/WebKit/Source/core/dom/ |
D | RangeTest.cpp | 92 Element* outer = document().getElementById(AtomicString::fromUTF8("outer")); in TEST_F() local 95 Text* oldText = toText(outer->childNodes()->item(2)); in TEST_F() 97 RefPtrWillBeRawPtr<Range> rangeOuterOutside = Range::create(document(), outer, 0, outer, 5); in TEST_F() 98 RefPtrWillBeRawPtr<Range> rangeOuterInside = Range::create(document(), outer, 1, outer, 4); in TEST_F() 99 …RefPtrWillBeRawPtr<Range> rangeOuterSurroundingText = Range::create(document(), outer, 2, outer, 3… in TEST_F() 102 …llBeRawPtr<Range> rangeFromTextToMiddleOfElement = Range::create(document(), oldText, 6, outer, 3); in TEST_F() 108 EXPECT_EQ(outer, rangeOuterOutside->startContainer()); in TEST_F() 110 EXPECT_EQ(outer, rangeOuterOutside->endContainer()); in TEST_F() 114 EXPECT_EQ(outer, rangeOuterInside->startContainer()); in TEST_F() 116 EXPECT_EQ(outer, rangeOuterInside->endContainer()); in TEST_F() [all …]
|
/external/llvm/test/CodeGen/Mips/ |
D | 2008-10-13-LegalizerBug.ll | 6 br label %continue.outer 8 continue.outer: ; preds = %case4, %entry 20 case4: ; preds = %continue.outer, %continue.outer, %continue.outer, %continue.outer 22 br label %continue.outer 24 return.split: ; preds = %continue.outer 27 infloop: ; preds = %infloop, %continue.outer
|
/external/libcxx/test/containers/sequences/vector/vector.modifiers/ |
D | erase_iter_iter.pass.cpp | 53 std::vector<std::vector<int> > outer(2, std::vector<int>(1)); in main() local 54 outer.erase(outer.begin(), outer.begin()); in main() 55 assert(outer.size() == 2); in main() 56 assert(outer[0].size() == 1); in main() 57 assert(outer[1].size() == 1); in main() 91 …min_allocator<int>>, min_allocator<std::vector<int, min_allocator<int>>>> outer(2, std::vector<int… in main() local 92 outer.erase(outer.begin(), outer.begin()); in main() 93 assert(outer.size() == 2); in main() 94 assert(outer[0].size() == 1); in main() 95 assert(outer[1].size() == 1); in main()
|
/external/clang/test/Index/ |
D | annotate-nested-name-specifier.cpp | 1 namespace outer { namespace 10 namespace outer_alias = outer; 20 namespace outer { namespace 31 void outer::inner::array<T, N>::foo() { in foo() 35 int outer::inner::array<T, N>::max_size = 17; 38 struct X2 : outer::inner::vector<T> { 40 using typename outer::inner::vector<type>::iterator; 41 using outer::inner::vector<type>::push_back; 44 namespace outer { namespace 61 namespace outer { namespace [all …]
|
/external/llvm/test/Analysis/BasicAA/ |
D | phi-speculation.ll | 41 br label %outer.while.header 43 outer.while.header: 44 %ptr_outer_phi = phi i32* [%ptr_inc_outer, %outer.while.backedge], [ %ptr, %entry] 45 %ptr_outer_phi2 = phi i32* [%ptr2_inc_outer, %outer.while.backedge], [ %ptr2, %entry] 46 %num.outer = phi i32 [ %count, %entry ], [ %dec.outer, %outer.while.backedge ] 50 %num = phi i32 [ %count, %outer.while.header ], [ %dec, %while.body ] 51 %ptr_phi = phi i32* [ %ptr_outer_phi, %outer.while.header ], [ %ptr_inc, %while.body ] 52 %ptr2_phi = phi i32* [ %ptr_outer_phi2, %outer.while.header ], [ %ptr2_inc, %while.body ] 53 %result.09 = phi i32 [ 0 , %outer.while.header ], [ %add, %while.body ] 64 br i1 %tobool, label %outer.while.backedge, label %while.body [all …]
|