| /external/swiftshader/src/OpenGL/compiler/ |
| D | IntermTraverse.cpp | 34 void TIntermSymbol::traverse(TIntermTraverser* it) in traverse() argument
36 it->visitSymbol(this); in traverse()
39 void TIntermConstantUnion::traverse(TIntermTraverser* it) in traverse() argument
41 it->visitConstantUnion(this); in traverse()
47 void TIntermBinary::traverse(TIntermTraverser* it) in traverse() argument
54 if(it->preVisit) in traverse()
56 visit = it->visitBinary(PreVisit, this); in traverse()
64 it->incrementDepth(this); in traverse()
66 if(it->rightToLeft) in traverse()
70 right->traverse(it); in traverse()
[all …]
|
| /external/deqp-deps/glslang/glslang/MachineIndependent/ |
| D | IntermTraverse.cpp | 64 void TIntermSymbol::traverse(TIntermTraverser *it) in traverse() argument
66 it->visitSymbol(this); in traverse()
69 void TIntermConstantUnion::traverse(TIntermTraverser *it) in traverse() argument
71 it->visitConstantUnion(this); in traverse()
77 void TIntermBinary::traverse(TIntermTraverser *it) in traverse() argument
84 if (it->preVisit) in traverse()
85 visit = it->visitBinary(EvPreVisit, this); in traverse()
91 it->incrementDepth(this); in traverse()
93 if (it->rightToLeft) { in traverse()
95 right->traverse(it); in traverse()
[all …]
|
| /external/webp/src/enc/ |
| D | iterator_enc.c | 22 static void InitLeft(VP8EncIterator* const it) { in InitLeft() argument
23 it->y_left_[-1] = it->u_left_[-1] = it->v_left_[-1] = in InitLeft()
24 (it->y_ > 0) ? 129 : 127; in InitLeft()
25 memset(it->y_left_, 129, 16); in InitLeft()
26 memset(it->u_left_, 129, 8); in InitLeft()
27 memset(it->v_left_, 129, 8); in InitLeft()
28 it->left_nz_[8] = 0; in InitLeft()
29 if (it->top_derr_ != NULL) { in InitLeft()
30 memset(&it->left_derr_, 0, sizeof(it->left_derr_)); in InitLeft()
34 static void InitTop(VP8EncIterator* const it) { in InitTop() argument
[all …]
|
| /external/icu/icu4c/source/data/zone/ |
| D | lb.txt | 265 ld{"Iresch Summerzäit"}
274 ld{"Britesch Summerzäit"}
340 ld{"Acre-Summerzäit"}
341 lg{"Acre-Zäit"}
342 ls{"Acre-Normalzäit"}
345 ls{"Afghanistan-Zäit"}
348 ls{"Zentralafrikanesch Zäit"}
351 ls{"Ostafrikanesch Zäit"}
354 ls{"Südafrikanesch Zäit"}
357 ld{"Westafrikanesch Summerzäit"}
[all …]
|
| /external/pdfium/core/fxcrt/ |
| D | fx_bidi_unittest.cpp | 133 auto it = bidi.begin(); in TEST() local
134 ASSERT_FALSE(it == bidi.end()); in TEST()
135 EXPECT_EQ(0, it->start); in TEST()
136 EXPECT_EQ(1, it->count); in TEST()
137 EXPECT_EQ(CFX_BidiChar::NEUTRAL, it->direction); in TEST()
138 ++it; in TEST()
139 EXPECT_TRUE(it == bidi.end()); in TEST()
146 auto it = bidi.begin(); in TEST() local
147 ASSERT_FALSE(it == bidi.end()); in TEST()
148 EXPECT_EQ(0, it->start); in TEST()
[all …]
|
| /external/libmtp/logs/ |
| D | mtp-detect-amazon-fire-hd8.txt | 11 Error 7: Found a bad handle, trying to ignore it.
12 Error 7: Found a bad handle, trying to ignore it.
13 Error 7: Found a bad handle, trying to ignore it.
14 Error 7: Found a bad handle, trying to ignore it.
15 Error 7: Found a bad handle, trying to ignore it.
16 Error 7: Found a bad handle, trying to ignore it.
17 Error 7: Found a bad handle, trying to ignore it.
18 Error 7: Found a bad handle, trying to ignore it.
19 Error 7: Found a bad handle, trying to ignore it.
20 Error 7: Found a bad handle, trying to ignore it.
[all …]
|
| /external/python/cpython3/Objects/ |
| D | iterobject.c | 16 seqiterobject *it; in PySeqIter_New() local
22 it = PyObject_GC_New(seqiterobject, &PySeqIter_Type); in PySeqIter_New()
23 if (it == NULL) in PySeqIter_New()
25 it->it_index = 0; in PySeqIter_New()
27 it->it_seq = seq; in PySeqIter_New()
28 _PyObject_GC_TRACK(it); in PySeqIter_New()
29 return (PyObject *)it; in PySeqIter_New()
33 iter_dealloc(seqiterobject *it) in iter_dealloc() argument
35 _PyObject_GC_UNTRACK(it); in iter_dealloc()
36 Py_XDECREF(it->it_seq); in iter_dealloc()
[all …]
|
| /external/boringssl/src/crypto/asn1/ |
| D | tasn_new.c | 70 static int asn1_item_ex_combine_new(ASN1_VALUE **pval, const ASN1_ITEM *it,
72 static void asn1_item_clear(ASN1_VALUE **pval, const ASN1_ITEM *it);
74 static void asn1_primitive_clear(ASN1_VALUE **pval, const ASN1_ITEM *it);
76 ASN1_VALUE *ASN1_item_new(const ASN1_ITEM *it) in ASN1_item_new() argument
79 if (ASN1_item_ex_new(&ret, it) > 0) in ASN1_item_new()
86 int ASN1_item_ex_new(ASN1_VALUE **pval, const ASN1_ITEM *it) in ASN1_item_ex_new() argument
88 return asn1_item_ex_combine_new(pval, it, 0); in ASN1_item_ex_new()
91 static int asn1_item_ex_combine_new(ASN1_VALUE **pval, const ASN1_ITEM *it, in asn1_item_ex_combine_new() argument
97 const ASN1_AUX *aux = it->funcs; in asn1_item_ex_combine_new()
107 if (it->sname) in asn1_item_ex_combine_new()
[all …]
|
| /external/libcxx/test/std/input.output/filesystems/class.rec.dir.itr/rec.dir.itr.members/ |
| D | increment.pass.cpp | 52 recursive_directory_iterator it(testDir, ec); in TEST_CASE() local
57 TEST_REQUIRE(it != endIt); in TEST_CASE()
58 const path entry = *it; in TEST_CASE()
60 recursive_directory_iterator& it_ref = ++it; in TEST_CASE()
61 TEST_CHECK(&it_ref == &it); in TEST_CASE()
64 TEST_CHECK(it == endIt); in TEST_CASE()
75 recursive_directory_iterator it(testDir, ec); in TEST_CASE() local
80 TEST_REQUIRE(it != endIt); in TEST_CASE()
81 const path entry = *it; in TEST_CASE()
83 const path entry2 = *it++; in TEST_CASE()
[all …]
|
| D | recursion_pending.pass.cpp | 33 recursive_directory_iterator it(StaticEnv::Dir); in TEST_CASE() local
34 TEST_REQUIRE(it.recursion_pending() == true); in TEST_CASE()
44 recursive_directory_iterator it(rec_pending_it); in TEST_CASE() local
45 TEST_CHECK(it.recursion_pending() == true); in TEST_CASE()
46 it.disable_recursion_pending(); in TEST_CASE()
53 recursive_directory_iterator it(StaticEnv::Dir); in TEST_CASE() local
54 it.disable_recursion_pending(); in TEST_CASE()
55 it = rec_pending_it; in TEST_CASE()
56 TEST_CHECK(it.recursion_pending() == true); in TEST_CASE()
57 it.disable_recursion_pending(); in TEST_CASE()
[all …]
|
| D | copy_assign.pass.cpp | 41 recursive_directory_iterator it(testDir, in TEST_SUITE() local
43 TEST_ASSERT(it != endIt); in TEST_SUITE()
44 while (it.depth() != 1) { in TEST_SUITE()
45 ++it; in TEST_SUITE()
46 TEST_ASSERT(it != endIt); in TEST_SUITE()
48 TEST_ASSERT(it.depth() == 1); in TEST_SUITE()
49 it.disable_recursion_pending(); in TEST_SUITE()
50 return it; in TEST_SUITE()
64 recursive_directory_iterator it(testDir, in createDifferentInterestingIterator() local
66 TEST_ASSERT(it != endIt); in createDifferentInterestingIterator()
[all …]
|
| D | move_assign.pass.cpp | 47 recursive_directory_iterator it(testDir, in TEST_SUITE() local
49 TEST_ASSERT(it != endIt); in TEST_SUITE()
50 while (it.depth() != 1) { in TEST_SUITE()
51 ++it; in TEST_SUITE()
52 TEST_ASSERT(it != endIt); in TEST_SUITE()
54 TEST_ASSERT(it.depth() == 1); in TEST_SUITE()
55 it.disable_recursion_pending(); in TEST_SUITE()
56 return it; in TEST_SUITE()
69 recursive_directory_iterator it(testDir, in createDifferentInterestingIterator() local
71 TEST_ASSERT(it != endIt); in createDifferentInterestingIterator()
[all …]
|
| /external/python/cpython2/Objects/ |
| D | iterobject.c | 14 seqiterobject *it; in PySeqIter_New() local
20 it = PyObject_GC_New(seqiterobject, &PySeqIter_Type); in PySeqIter_New()
21 if (it == NULL) in PySeqIter_New()
23 it->it_index = 0; in PySeqIter_New()
25 it->it_seq = seq; in PySeqIter_New()
26 _PyObject_GC_TRACK(it); in PySeqIter_New()
27 return (PyObject *)it; in PySeqIter_New()
31 iter_dealloc(seqiterobject *it) in iter_dealloc() argument
33 _PyObject_GC_UNTRACK(it); in iter_dealloc()
34 Py_XDECREF(it->it_seq); in iter_dealloc()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 128 for (changeset_ty::const_iterator it = S.begin(), ie = S.end(); it != ie; in ExecuteOneTest()
129 ++it) in ExecuteOneTest()
130 for (succ_iterator_ty it2 = succ_begin(*it), ie2 = succ_end(*it); in ExecuteOneTest()
184 for (changeset_ty::const_iterator it = Changes.begin(), in DAGDeltaAlgorithmImpl() local
185 ie = Changes.end(); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
186 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
187 Successors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
189 for (std::vector<edge_ty>::const_iterator it = Dependencies.begin(), in DAGDeltaAlgorithmImpl() local
190 ie = Dependencies.end(); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
191 Predecessors[it->second].push_back(it->first); in DAGDeltaAlgorithmImpl()
[all …]
|
| /external/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 128 for (changeset_ty::const_iterator it = S.begin(), in ExecuteOneTest()
129 ie = S.end(); it != ie; ++it) in ExecuteOneTest()
130 for (succ_iterator_ty it2 = succ_begin(*it), in ExecuteOneTest()
131 ie2 = succ_end(*it); it2 != ie2; ++it2) in ExecuteOneTest()
184 for (changeset_ty::const_iterator it = Changes.begin(), in DAGDeltaAlgorithmImpl() local
185 ie = Changes.end(); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
186 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
187 Successors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
189 for (std::vector<edge_ty>::const_iterator it = Dependencies.begin(), in DAGDeltaAlgorithmImpl() local
190 ie = Dependencies.end(); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
[all …]
|
| /external/swiftshader/third_party/LLVM/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 129 for (changeset_ty::const_iterator it = S.begin(), in ExecuteOneTest()
130 ie = S.end(); it != ie; ++it) in ExecuteOneTest()
131 for (succ_iterator_ty it2 = succ_begin(*it), in ExecuteOneTest()
132 ie2 = succ_end(*it); it2 != ie2; ++it2) in ExecuteOneTest()
190 for (changeset_ty::const_iterator it = Changes.begin(), in DAGDeltaAlgorithmImpl() local
191 ie = Changes.end(); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
192 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
193 Successors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
195 for (std::vector<edge_ty>::const_iterator it = Dependencies.begin(), in DAGDeltaAlgorithmImpl() local
196 ie = Dependencies.end(); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
[all …]
|
| /external/capstone/suite/MC/ARM/ |
| D | thumb2-narrow-dp.ll.cs | 16 0x08,0xbf = it eq
18 0x08,0xbf = it eq
20 0x08,0xbf = it eq
22 0x08,0xbf = it eq
24 0x08,0xbf = it eq
26 0x08,0xbf = it eq
28 0x08,0xbf = it eq
30 0x08,0xbf = it eq
32 0x08,0xbf = it eq
34 0x08,0xbf = it eq
[all …]
|
| /external/llvm/lib/Option/ |
| D | ArgList.cpp | 49 for (const_reverse_iterator it = rbegin(), ie = rend(); it != ie; ++it) in getLastArgNoClaim() local
50 if ((*it)->getOption().matches(Id)) in getLastArgNoClaim()
51 return *it; in getLastArgNoClaim()
57 for (const_reverse_iterator it = rbegin(), ie = rend(); it != ie; ++it) in getLastArgNoClaim() local
58 if ((*it)->getOption().matches(Id0) || in getLastArgNoClaim()
59 (*it)->getOption().matches(Id1)) in getLastArgNoClaim()
60 return *it; in getLastArgNoClaim()
67 for (const_reverse_iterator it = rbegin(), ie = rend(); it != ie; ++it) in getLastArgNoClaim() local
68 if ((*it)->getOption().matches(Id0) || (*it)->getOption().matches(Id1) || in getLastArgNoClaim()
69 (*it)->getOption().matches(Id2)) in getLastArgNoClaim()
[all …]
|
| /external/webrtc/webrtc/base/ |
| D | sigslot.h | 431 const_iterator it = hs.m_senders.begin(); in has_slots() local
434 while(it != itEnd) in has_slots()
436 (*it)->slot_duplicate(&hs, this); in has_slots()
437 m_senders.insert(*it); in has_slots()
438 ++it; in has_slots()
462 const_iterator it = m_senders.begin(); in disconnect_all() local
465 while(it != itEnd) in disconnect_all()
467 (*it)->slot_disconnect(this); in disconnect_all()
468 ++it; in disconnect_all()
493 typename connections_list::const_iterator it = s.m_connected_slots.begin(); in _signal_base0() local
[all …]
|
| /external/androidplot/AndroidPlot-Core/src/test/java/com/androidplot/ui/ |
| D | FixedTableModelTest.java | 49 Iterator<RectF> it = model.getIterator(tableRect, 5); in testIterator() local
51 assertTrue(it.hasNext()); in testIterator()
52 RectF cellRect = it.next(); in testIterator()
54 assertTrue(it.hasNext()); in testIterator()
55 cellRect = it.next(); in testIterator()
57 assertTrue(it.hasNext()); in testIterator()
58 cellRect = it.next(); in testIterator()
60 assertTrue(it.hasNext()); in testIterator()
61 cellRect = it.next(); in testIterator()
63 assertTrue(it.hasNext()); in testIterator()
[all …]
|
| /external/llvm/test/MC/ARM/ |
| D | v8_IT_manual.s | 5 it ge label
9 it ge label
12 it ge label
15 it ge label
19 it ge label
23 it ge label
27 it ge label
31 it ge label
35 it ge label
39 it ge label
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/MC/ARM/ |
| D | v8_IT_manual.s | 5 it ge label
9 it ge label
12 it ge label
15 it ge label
19 it ge label
23 it ge label
27 it ge label
31 it ge label
35 it ge label
39 it ge label
[all …]
|
| /external/v8/tools/clang/blink_gc_plugin/ |
| D | RecordInfo.cpp | 69 for (TemplateArgs::iterator it = args.begin(); it != args.end(); ++it) { in IsHeapAllocatedCollection() local
70 if (CXXRecordDecl* decl = (*it)->getAsCXXRecordDecl()) in IsHeapAllocatedCollection()
146 for (const auto& it : base_record->bases()) { in walkBases() local
147 const RecordType* type = it.getType()->getAs<RecordType>(); in walkBases()
150 base = GetDependentTemplatedDecl(*it.getType()); in walkBases()
228 Cache::iterator it = cache_.find(record); in Lookup() local
229 if (it != cache_.end()) in Lookup()
230 return &it->second; in Lookup()
238 for (Bases::iterator it = GetBases().begin(); in IsStackAllocated() local
239 it != GetBases().end(); in IsStackAllocated()
[all …]
|
| /external/eigen/Eigen/src/SparseCore/ |
| D | TriangularSolver.h | 43 for(LhsIterator it(lhsEval, i); it; ++it)
45 lastVal = it.value();
46 lastIndex = it.index();
79 LhsIterator it(lhsEval, i);
80 while(it && it.index()<i)
81 ++it;
84 eigen_assert(it && it.index()==i);
85 l_ii = it.value();
86 ++it;
88 else if (it && it.index() == i)
[all …]
|
| /external/webrtc/webrtc/modules/rtp_rtcp/source/ |
| D | rtp_header_extension.cc | 28 std::map<uint8_t, HeaderExtension*>::iterator it = in Erase() local
30 delete it->second; in Erase()
31 extensionMap_.erase(it); in Erase()
51 std::map<uint8_t, HeaderExtension*>::iterator it = in Register() local
53 if (it != extensionMap_.end()) { in Register()
54 if (it->second->type != type) { in Register()
61 it->second->active = active; in Register()
84 std::map<uint8_t, HeaderExtension*>::iterator it = in Deregister() local
86 assert(it != extensionMap_.end()); in Deregister()
87 delete it->second; in Deregister()
[all …]
|