Home
last modified time | relevance | path

Searched refs:inner (Results 1 – 25 of 618) sorted by relevance

12345678910>>...25

/external/eigen/unsupported/Eigen/src/Skyline/
DSkylineMatrix.h148 const Index inner = IsRowMajor ? col : row;
151 eigen_assert(inner < innerSize());
153 if (outer == inner)
157 if (inner > outer) //upper matrix
159 const Index minOuterIndex = inner - m_data.upperProfile(inner);
161 … return this->m_data.upper(m_colStartIndex[inner] + outer - (inner - m_data.upperProfile(inner)));
165 if (inner < outer) //lower matrix
168 if (inner >= minInnerIndex)
169 … return this->m_data.lower(m_rowStartIndex[outer] + inner - (outer - m_data.lowerProfile(outer)));
173 return m_data.upper(m_colStartIndex[inner] + outer - inner);
[all …]
/external/clang/test/Index/
Dannotate-nested-name-specifier.cpp2 namespace inner { namespace
14 using outer_alias::inner::vector;
16 struct X_vector : outer_alias::inner::vector<X> {
17 using outer_alias::inner::vector<X>::iterator;
21 namespace inner { 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;
[all …]
/external/llvm/test/Transforms/LICM/
Dlcssa-ssa-promoter.ll26 br i1 undef, label %outer.latch, label %inner.preheader
28 ; CHECK-NEXT: br i1 undef, label %outer.latch, label %inner.preheader
30 inner.preheader:
31 br label %inner.header
32 ; CHECK: inner.preheader:
33 ; CHECK-NEXT: br label %inner.header
35 inner.header:
36 br i1 undef, label %inner.body.rhs, label %inner.latch
37 ; CHECK: inner.header:
38 ; CHECK-NEXT: %[[PHI0:[^,]+]] = phi i32 [ %{{[^,]+}}, %inner.latch ], [ 0, %inner.preheader ]
[all …]
/external/skia/tests/
DPathOpsBuilderTest.cpp212 SkPath inner; in DEF_TEST() local
215 inner.addRect(10, 30, 10+0, 30+60); // <rect x="10" y="30" width="0" height="60" /> in DEF_TEST()
216 inner.addRect(10, 30, 10+0, 30+60); // <rect x="10" y="30" width="0" height="60" /> in DEF_TEST()
217 inner.addRect(10, 30, 10+100, 30+60); // <rect x="10" y="30" width="100" height="60" /> in DEF_TEST()
218 inner.addRect(10, 30, 10+32668, 30+0); // <rect x="10" y="30" width="32668" /> in DEF_TEST()
219 …inner.addRect(10, 30, 10+100, 30+18446744073709551615.f); // <rect x="10" y="30" width="100" heigh… in DEF_TEST()
220 inner.addRect(10, 255, 10+100, 255+60); // <rect x="10" y="255" width="100" height="60" /> in DEF_TEST()
221 inner.addRect(0, 0, 0+100, 0+60); // <rect width="100" height="60" /> in DEF_TEST()
222 inner.addRect(10, 30, 10+100, 30+60); // <rect x="10" y="30" width="100" height="60" /> in DEF_TEST()
223 …inner.addRect(10, 30, 10+100, 30+4294967236.f); // <rect x="10" y="30" width="100" height="4294967… in DEF_TEST()
[all …]
DPathOpsLineParametetersTest.cpp52 size_t inner; in DEF_TEST() local
53 for (inner = 0; inner < 2; ++inner) { in DEF_TEST()
54 double distSq = denormalizedDistance[inner]; in DEF_TEST()
56 double answersSq = answers[index][inner]; in DEF_TEST()
63 __FUNCTION__, static_cast<int>(index), (int)inner, in DEF_TEST()
64 denormalizedDistance[inner], answers[index][inner], in DEF_TEST()
71 for (inner = 0; inner < 2; ++inner) { in DEF_TEST()
72 if (AlmostEqualUlps(fabs(normalizedDistance[inner]), answers[index][inner])) { in DEF_TEST()
76 __FUNCTION__, static_cast<int>(index), (int)inner, in DEF_TEST()
77 normalizedDistance[inner], answers[index][inner]); in DEF_TEST()
/external/swiftshader/third_party/LLVM/test/CodeGen/MBlaze/
Dloop.ll21 %inner.0 = phi i32 [ %a, %loop_outer ], [ %inner.3, %loop_inner_finish ]
22 %inner.1 = phi i32 [ %b, %loop_outer ], [ %inner.4, %loop_inner_finish ]
23 %inner.2 = phi i32 [ 0, %loop_outer ], [ %inner.5, %loop_inner_finish ]
24 %inner.3 = add i32 %inner.0, %inner.1
25 %inner.4 = mul i32 %inner.2, 11
29 %inner.5 = add i32 %inner.2, 1
31 i32 %inner.0, i32 %inner.1, i32 %inner.2 )
33 %inner.6 = icmp eq i32 %inner.5, 100
36 br i1 %inner.6, label %loop_inner, label %loop_outer_finish
/external/llvm/test/Transforms/SimplifyCFG/
Dempty-catchpad.ll40 to label %via.catchswitch unwind label %cleanup.inner
41 cleanup.inner:
42 %cp.inner = cleanuppad within none []
44 cleanupret from %cp.inner unwind label %exn.dispatch
45 ; CHECK: cleanupret from %cp.inner unwind to caller
48 to label %exit unwind label %dispatch.inner
49 dispatch.inner:
50 %cs.inner = catchswitch within none [label %pad.inner] unwind label %exn.dispatch
51 ; CHECK: %cs.inner = catchswitch within none [label %pad.inner] unwind to caller
52 pad.inner:
[all …]
/external/clang/test/CXX/expr/expr.prim/expr.prim.general/
Dp8-0x.cpp9 struct inner { struct
23 operator decltype(outer::middle::inner()) ();
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;
34 a.decltype(outer::middle::inner())::func(); in scope()
35 a.decltype(outer::middle())::inner::func(); in scope()
36 a.decltype(outer())::middle::inner::func(); in scope()
38 a.decltype(outer())::middle::inner::~inner(); in scope()
[all …]
/external/llvm/test/Transforms/LoopUnroll/
Dpr18861.ll14 ; --> ( inner.header ) |
18 ; ( inner.latch ) ( outer.latch )
23 ; When the inner loop is unrolled, we inner.latch block has only one
35 br label %inner.header
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
42 inner.latch: ; preds = %inner.header
45 br i1 %tobool4, label %inner.header, label %exit
47 exit: ; preds = %inner.latch
[all …]
Dupdate-loop-info-in-subloops.ll7 ; CHECK: L.inner:
8 ; CHECK: L.inner.latch:
10 ; CHECK: L.inner.1:
11 ; CHECK: L.inner.latch.1:
20 br label %L.inner
22 L.inner:
23 br label %L.inner.latch
25 L.inner.latch:
26 br i1 false, label %L.latch, label %L.inner
/external/llvm/test/Transforms/IndVarSimplify/
Dlcssa-preservation.ll15 br label %inner.header
17 ; CHECK: br label %inner.header
19 inner.header:
20 ; CHECK: inner.header:
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
26 inner.latch:
27 ; CHECK: inner.latch:
[all …]
Dpr26973.ll20 br label %inner.loop
22 inner.loop:
23 %iv.inner = phi i32 [ %iv.outer, %outer.loop ], [ %iv.inner.dec, %inner.loop ]
26 %iv.inner.dec = add nsw i32 %iv.inner, -1
27 %cmp = icmp slt i32 %iv.outer, %iv.inner.dec
28 br i1 %cmp, label %outer.be, label %inner.loop
/external/clang/test/Analysis/
Dfields.c58 } inner; member
66 if (foo() && bits.inner.e) // expected-warning {{garbage}} in testBitfields()
84 bits.inner.e = 50; in testBitfields()
85 if (foo() && bits.inner.e) // no-warning in testBitfields()
87 if (foo() && bits.inner.y) // expected-warning {{garbage}} in testBitfields()
89 if (foo() && bits.inner.f) // expected-warning {{garbage}} in testBitfields()
93 bits.inner = getInner(); in testBitfields()
95 if (foo() && bits.inner.e) // no-warning in testBitfields()
97 if (foo() && bits.inner.y) // no-warning in testBitfields()
99 if (foo() && bits.inner.f) // no-warning in testBitfields()
[all …]
Dproperties.mm36 @property IntWrapperStruct inner; property
40 @synthesize inner;
44 clang_analyzer_eval(w.inner.value == w.inner.value); // expected-warning{{TRUE}}
46 int origValue = w.inner.value;
50 clang_analyzer_eval(w.inner.value == 42); // expected-warning{{TRUE}}
64 @property CustomCopy inner; property
68 //@synthesize inner;
72 clang_analyzer_eval(w.inner.value == w.inner.value); // expected-warning{{TRUE}}
74 int origValue = w.inner.value;
78 clang_analyzer_eval(w.inner.value == 42); // expected-warning{{TRUE}}
/external/elfutils/libdw/
Ddwarf_getsrc_file.c116 size_t inner; in dwarf_getsrc_file() local
117 for (inner = 0; inner < cur_match; ++inner) in dwarf_getsrc_file()
118 if (match[inner]->files == line->files in dwarf_getsrc_file()
119 && match[inner]->file == line->file) in dwarf_getsrc_file()
121 if (inner < cur_match in dwarf_getsrc_file()
122 && (match[inner]->line != line->line in dwarf_getsrc_file()
123 || match[inner]->line != lineno in dwarf_getsrc_file()
125 && (match[inner]->column != line->column in dwarf_getsrc_file()
126 || match[inner]->column != column)))) in dwarf_getsrc_file()
130 if (match[inner]->line >= line->line in dwarf_getsrc_file()
[all …]
/external/guava/guava-tests/test/com/google/common/util/concurrent/
DAsyncSettableFutureTest.java125 SettableFuture<Object> inner = SettableFuture.create(); in testCancel_innerCancelsAsync() local
126 async.setFuture(inner); in testCancel_innerCancelsAsync()
127 inner.cancel(true); in testCancel_innerCancelsAsync()
137 MyFuture<Object> inner = new MyFuture<Object>(); in testCancel_resultCancelsInner_interrupted() local
138 async.setFuture(inner); in testCancel_resultCancelsInner_interrupted()
140 assertTrue(inner.isCancelled()); in testCancel_resultCancelsInner_interrupted()
141 assertTrue(inner.myWasInterrupted()); in testCancel_resultCancelsInner_interrupted()
143 inner.get(); in testCancel_resultCancelsInner_interrupted()
150 MyFuture<Object> inner = new MyFuture<Object>(); in testCancel_resultCancelsInner() local
151 async.setFuture(inner); in testCancel_resultCancelsInner()
[all …]
/external/llvm/test/Analysis/BlockFrequencyInfo/
Ddouble_exit.ll24 br i1 %cmp, label %inner, label %exit, !prof !2 ; 2:1
32 ; CHECK-NEXT: inner: float = 2.5,
33 inner:
34 %Return.1 = phi i32 [ %Return.0, %outer ], [ %call4, %inner.inc ]
35 %J.0 = phi i32 [ %I.0, %outer ], [ %inc, %inner.inc ]
37 br i1 %cmp2, label %inner.body, label %outer.inc, !prof !1 ; 4:1
41 ; CHECK-NEXT: inner.body: float = 2.0,
42 inner.body:
45 br i1 %tobool, label %exit, label %inner.inc, !prof !0 ; 3:1
49 ; CHECK-NEXT: inner.inc: float = 1.5,
[all …]
/external/elfutils/tests/
Dasm-tst3.c239 size_t inner; in main() local
241 for (inner = 1; in main()
242 inner < (shdr->sh_size in main()
244 ++inner) in main()
249 sym = gelf_getsym (data, inner, &sym_mem); in main()
253 inner, elf_errmsg (-1)); in main()
282 if (strcmp (names[inner], in main()
286 printf ("symbol %zu has different name\n", inner); in main()
290 if (sym->st_value != value[inner]) in main()
292 printf ("symbol %zu has wrong value\n", inner); in main()
[all …]
/external/elfutils/libdwfl/
Ddwfl_module_getsrc_file.c115 size_t inner; in dwfl_module_getsrc_file() local
116 for (inner = 0; inner < cur_match; ++inner) in dwfl_module_getsrc_file()
117 if (dwfl_line_file (match[inner]) in dwfl_module_getsrc_file()
120 if (inner < cur_match in dwfl_module_getsrc_file()
121 && (dwfl_line (match[inner])->line != line->line in dwfl_module_getsrc_file()
122 || dwfl_line (match[inner])->line != lineno in dwfl_module_getsrc_file()
124 && (dwfl_line (match[inner])->column != line->column in dwfl_module_getsrc_file()
125 || dwfl_line (match[inner])->column != column)))) in dwfl_module_getsrc_file()
129 if (dwfl_line (match[inner])->line >= line->line in dwfl_module_getsrc_file()
130 && (dwfl_line (match[inner])->line != line->line in dwfl_module_getsrc_file()
[all …]
/external/skia/src/effects/
DSkComposeImageFilter.cpp15 sk_sp<SkImageFilter> inner) { in Make() argument
17 return inner; in Make()
19 if (!inner) { in Make()
22 sk_sp<SkImageFilter> inputs[2] = { std::move(outer), std::move(inner) }; in Make()
28 SkImageFilter* inner = this->getInput(1); in computeFastBounds() local
30 return outer->computeFastBounds(inner->computeFastBounds(src)); in computeFastBounds()
43 sk_sp<SkSpecialImage> inner(this->filterInput(1, source, innerContext, &innerOffset)); in onFilterImage() local
44 if (!inner) { in onFilterImage()
55 sk_sp<SkSpecialImage> outer(this->filterInput(0, inner.get(), outerContext, &outerOffset)); in onFilterImage()
78 SkImageFilter* inner = this->getInput(1); in onFilterBounds() local
[all …]
/external/r8/src/test/java/com/android/tools/r8/rewrite/logarguments/
DTestInner.java37 Inner inner = new TestInner().createInner(); in main() local
38 inner.a(); in main()
39 inner.a(1); in main()
40 inner.a(1, 2); in main()
41 inner.a(new Object()); in main()
42 inner.a(null); in main()
43 inner.a(new Integer(0), ""); in main()
44 inner.a(null, null); in main()
/external/llvm/test/Transforms/PGOProfile/
Dloop2.ll32 br label %for.cond.inner
34 for.cond.inner:
35 ; GEN: for.cond.inner:
37 %j.0 = phi i32 [ 0, %for.body.outer ], [ %inc.1, %for.inc.inner ]
38 %sum.1 = phi i32 [ %sum.0, %for.body.outer ], [ %inc, %for.inc.inner ]
40 br i1 %cmp2, label %for.body.inner, label %for.end.inner
41 ; USE: br i1 %cmp2, label %for.body.inner, label %for.end.inner
44 for.body.inner:
45 ; GEN: for.body.inner:
48 br label %for.inc.inner
[all …]
/external/llvm/test/Transforms/LoopVectorize/
Dnoalias-md-licm.ll6 ; In order to vectorize the inner loop, it needs to be versioned with
14 ; LICM'ed from the inner loop.
22 %i.2 = phi i64 [ 0, %entry ], [ %i, %inner.end ]
24 br label %inner.ph
26 inner.ph:
30 br label %inner
32 inner:
33 %j.2 = phi i64 [ 0, %inner.ph ], [ %j, %inner ]
50 br i1 %cond1, label %inner.end, label %inner
52 inner.end:
/external/llvm/test/Transforms/LoopRotate/
Dpreserve-loop-simplify.ll15 br i1 undef, label %inner.header, label %outer.body
22 ; CHECK-NEXT: br label %inner.body
24 inner.header:
26 ; CHECK: inner.header:
27 br i1 undef, label %return, label %inner.body
28 ; CHECK-NEXT: br i1 {{[^,]*}}, label %[[INNER_SPLIT_RETURN:[^,]*]], label %inner.body
30 inner.body:
32 ; CHECK: inner.body:
33 br i1 undef, label %outer.latch, label %inner.latch
34 ; CHECK-NEXT: br i1 {{[^,]*}}, label %[[INNER_SPLIT_OUTER_LATCH:[^,]*]], label %inner.header
[all …]
/external/elfutils/src/
Dobjdump.c592 for (size_t inner = 0; inner < 16; inner += 4) in show_full_content() local
594 cp[inner], cp[inner + 1], cp[inner + 2], in show_full_content()
595 cp[inner + 3]); in show_full_content()
598 for (size_t inner = 0; inner < 16; ++inner) in show_full_content() local
599 fputc_unlocked (isascii (cp[inner]) && isprint (cp[inner]) in show_full_content()
600 ? cp[inner] : '.', stdout); in show_full_content()
607 size_t inner; in show_full_content() local
608 for (inner = 0; inner + 4 <= remaining; inner += 4) in show_full_content()
610 cp[inner], cp[inner + 1], cp[inner + 2], cp[inner + 3]); in show_full_content()
612 for (; inner < remaining; ++inner) in show_full_content()
[all …]

12345678910>>...25