Home
last modified time | relevance | path

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

12345678910>>...13

/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/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/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/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
Dpreserve-analyses.ll16 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/Transforms/IndVarSimplify/
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/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 …]
Dnested_loops.ll10 br label %outer
12 outer:
19 br i1 1, label %end, label %outer
26 ; CHECK-NEXT: [1] outer => end
30 ; BBIT: entry, outer, body, exit172, end,
31 ; BBIT: outer, body, exit172,
33 ; RNIT: entry, outer => end, end,
34 ; RNIT: outer, body, exit172,
Dnext.ll9 br label %__label_002001.outer
11 __label_002001.outer: ; preds = %bb236, %bb92
14 __label_002001: ; preds = %bb229, %__label_002001.outer
27 br i1 1, label %__label_002001, label %__label_002001.outer
35 ; CHECK-NEXT: [1] __label_002001.outer => __label_000020
42 ; BBIT: entry, __label_002001.outer, __label_002001, bb93, __label_000020, bb197, bb229, bb224,
43 ; BBIT: __label_002001.outer, __label_002001, bb93, bb197, bb229, bb224,
47 ; RNIT: entry, __label_002001.outer => __label_000020, __label_000020,
48 ; RNIT: __label_002001.outer, __label_002001, bb93, bb197 => bb229, bb229,
Dexit_in_condition.ll9 br label %outer
11 outer:
24 br label %outer
31 ; CHECK-NEXT: [1] outer => end
35 ; BBIT: entry, outer, body, body.i, end, if.end, if.then64,
36 ; BBIT: outer, body, body.i, if.end, if.then64,
38 ; RNIT: entry, outer => end, end,
39 ; RNIT: outer, body, body.i, if.end, if.then64,
/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/eigen/Eigen/src/SparseCore/
DSparseMatrix.h173 const Index outer = IsRowMajor ? row : col;
175 …Index end = m_innerNonZeros ? m_outerIndex[outer] + m_innerNonZeros[outer] : m_outerIndex[outer+1];
176 return m_data.atInRange(m_outerIndex[outer], end, inner);
189 const Index outer = IsRowMajor ? row : col;
192 Index start = m_outerIndex[outer];
193 …Index end = m_innerNonZeros ? m_outerIndex[outer] + m_innerNonZeros[outer] : m_outerIndex[outer+1];
373 inline Scalar& insertBackByOuterInner(Index outer, Index inner)
375 …eigen_assert(size_t(m_outerIndex[outer+1]) == m_data.size() && "Invalid ordered insertion (invalid…
376 …eigen_assert( (m_outerIndex[outer+1]-m_outerIndex[outer]==0 || m_data.index(m_data.size()-1)<inner…
377 Index p = m_outerIndex[outer+1];
[all …]
DSparseTriangularView.h69 EIGEN_STRONG_INLINE InnerIterator(const SparseTriangularView& view, Index outer)
70 : Base(view.nestedExpression(), outer), m_returnOne(false)
74 while((*this) && (HasUnitDiag ? this->index()<=outer : this->index()<outer))
79 else if(HasUnitDiag && ((!Base::operator bool()) || Base::index()>=Base::outer()))
94 … if(HasUnitDiag && (!SkipFirst) && ((!Base::operator bool()) || Base::index()>=Base::outer()))
108 if(HasUnitDiag && m_returnOne) return Base::outer();
121 …rn (SkipFirst ? Base::operator bool() : (Base::operator bool() && this->index() <= this->outer()));
133 EIGEN_STRONG_INLINE ReverseInnerIterator(const SparseTriangularView& view, Index outer)
134 : Base(view.nestedExpression(), outer)
138 while((*this) && this->index()>outer)
[all …]
DMappedSparseMatrix.h68 const Index outer = IsRowMajor ? row : col;
71 Index start = m_outerIndex[outer];
72 Index end = m_outerIndex[outer+1];
87 const Index outer = IsRowMajor ? row : col;
90 Index start = m_outerIndex[outer];
91 Index end = m_outerIndex[outer+1];
119 InnerIterator(const MappedSparseMatrix& mat, Index outer)
121 m_outer(outer),
122 m_id(mat.outerIndexPtr()[outer]),
124 m_end(mat.outerIndexPtr()[outer+1])
[all …]
DSparseBlock.h47 inline InnerIterator(const SparseInnerVectorSet& xpr, Index outer)
48 : MatrixType::InnerIterator(xpr.m_matrix, xpr.m_outerStart + outer), m_outer(outer)
58 inline ReverseInnerIterator(const SparseInnerVectorSet& xpr, Index outer)
59 : MatrixType::ReverseInnerIterator(xpr.m_matrix, xpr.m_outerStart + outer), m_outer(outer)
73 inline SparseInnerVectorSet(const MatrixType& matrix, Index outer)
74 : m_matrix(matrix), m_outerStart(outer), m_outerSize(Size)
77 eigen_assert( (outer>=0) && (outer<matrix.outerSize()) );
120 inline InnerIterator(const SparseInnerVectorSet& xpr, Index outer)
121 : MatrixType::InnerIterator(xpr.m_matrix, xpr.m_outerStart + outer), m_outer(outer)
131 inline ReverseInnerIterator(const SparseInnerVectorSet& xpr, Index outer)
[all …]
/external/skia/src/effects/
DSkTestImageFilters.cpp31 SkImageFilter* outer = getInput(0); in onFilterImage() local
34 if (!outer && !inner) { in onFilterImage()
38 if (!outer || !inner) { in onFilterImage()
39 return (outer ? outer : inner)->filterImage(proxy, src, ctm, result, loc); in onFilterImage()
44 outer->filterImage(proxy, tmp, ctm, result, loc); in onFilterImage()
50 SkImageFilter* outer = getInput(0); in onFilterBounds() local
53 if (!outer && !inner) { in onFilterBounds()
57 if (!outer || !inner) { in onFilterBounds()
58 return (outer ? outer : inner)->filterBounds(src, ctm, dst); in onFilterBounds()
63 outer->filterBounds(tmp, ctm, dst); in onFilterBounds()
/external/llvm/test/CodeGen/Mips/
D2008-10-13-LegalizerBug.ll6 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/clang/test/Index/
Dannotate-nested-name-specifier.cpp1 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/
Dphi-speculation.ll41 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 …]
/external/llvm/test/Transforms/LoopUnroll/
Dunloop.ll16 br label %outer
18 outer:
22 %iv = phi i32 [ 0, %outer ], [ %inc, %tail ]
25 br i1 %wbucond, label %outer.backedge, label %tail
30 outer.backedge:
31 br label %outer
49 ; Now it is the outer loop backedge.
51 ; CHECK: br label %while.cond.outer
54 br label %while.cond.outer
56 while.cond.outer:
[all …]
/external/v8/test/mjsunit/regress/
Dregress-97116.js35 %DeoptimizeFunction(outer);
39 function outer(should_deopt) { function
47 outer(false);
48 outer(false);
49 %OptimizeFunctionOnNextCall(outer);
50 outer(true);
/external/webkit/Source/JavaScriptCore/tests/mozilla/js1_5/Scope/
Dregress-181834.js68 function outer(N) function
94 var s = outer.toString();
98 actual = outer(-5);
103 actual = outer(0);
108 actual = outer(5);
125 actual = outer(-5);
130 actual = outer(0);
135 actual = outer(5);
/external/llvm/test/Transforms/SimplifyCFG/
D2007-12-21-Crash.ll6 br label %bb5.outer
8 bb5.outer.loopexit: ; preds = %bb5
9 br label %bb5.outer
11 bb5.outer: ; preds = %bb5.outer.loopexit, %entry
12 %undo.0.ph = phi i32 [ 0, %entry ], [ 1, %bb5.outer.loopexit ] ; <i32> [#uses=1]
15 bb5: ; preds = %bb5, %bb5.outer
20 i32 110, label %bb5.outer.loopexit
/external/eigen/Eigen/src/Core/
DAssign.h138 outer = Index / Derived1::InnerSizeAtCompileTime, enumerator
144 dst.copyCoeffByOuterInner(outer, inner, src); in run()
158 static EIGEN_STRONG_INLINE void run(Derived1 &dst, const Derived2 &src, int outer)
160 dst.copyCoeffByOuterInner(outer, Index, src);
161 assign_DefaultTraversal_InnerUnrolling<Derived1, Derived2, Index+1, Stop>::run(dst, src, outer);
199 outer = Index / Derived1::InnerSizeAtCompileTime,
206 dst.template copyPacketByOuterInner<Derived2, Aligned, JointAlignment>(outer, inner, src);
221 static EIGEN_STRONG_INLINE void run(Derived1 &dst, const Derived2 &src, int outer)
223 dst.template copyPacketByOuterInner<Derived2, Aligned, Aligned>(outer, Index, src);
225 Index+packet_traits<typename Derived1::Scalar>::size, Stop>::run(dst, src, outer);
[all …]

12345678910>>...13