| /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()
84 void TIntermBinary::traverse(TIntermTraverser *it) in traverse() argument
91 if (it->preVisit) in traverse()
92 visit = it->visitBinary(EvPreVisit, this); in traverse()
98 it->incrementDepth(this); in traverse()
100 if (it->rightToLeft) { in traverse()
102 right->traverse(it); in traverse()
[all …]
|
| /external/angle/third_party/vulkan-deps/glslang/src/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()
84 void TIntermBinary::traverse(TIntermTraverser *it) in traverse() argument
91 if (it->preVisit) in traverse()
92 visit = it->visitBinary(EvPreVisit, this); in traverse()
98 it->incrementDepth(this); in traverse()
100 if (it->rightToLeft) { in traverse()
102 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/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/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/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/perfetto/src/trace_processor/ |
| D | trace_database_integrationtest.cc | 76 auto it = Query( in TEST_F() local
79 ASSERT_TRUE(it.Next()); in TEST_F()
80 ASSERT_EQ(it.Get(0).type, SqlValue::kLong); in TEST_F()
81 ASSERT_EQ(it.Get(0).long_value, 139787); in TEST_F()
82 ASSERT_EQ(it.Get(1).type, SqlValue::kLong); in TEST_F()
83 ASSERT_EQ(it.Get(1).long_value, 19684308497); in TEST_F()
84 ASSERT_FALSE(it.Next()); in TEST_F()
89 auto it = Query("select start_ts, end_ts from trace_bounds"); in TEST_F() local
90 ASSERT_TRUE(it.Next()); in TEST_F()
91 ASSERT_EQ(it.Get(0).type, SqlValue::kLong); in TEST_F()
[all …]
|
| /external/python/cpython3/Objects/ |
| D | iterobject.c | 17 seqiterobject *it; in PySeqIter_New() local
23 it = PyObject_GC_New(seqiterobject, &PySeqIter_Type); in PySeqIter_New()
24 if (it == NULL) in PySeqIter_New()
26 it->it_index = 0; in PySeqIter_New()
28 it->it_seq = seq; in PySeqIter_New()
29 _PyObject_GC_TRACK(it); in PySeqIter_New()
30 return (PyObject *)it; in PySeqIter_New()
34 iter_dealloc(seqiterobject *it) in iter_dealloc() argument
36 _PyObject_GC_UNTRACK(it); in iter_dealloc()
37 Py_XDECREF(it->it_seq); in iter_dealloc()
[all …]
|
| /external/rust/crates/quiche/deps/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/rust/crates/fallible-iterator/src/ |
| D | test.rs | 36 let it = a.chain(b); in chain() localVariable
38 assert_eq!(it.collect::<Vec<_>>().unwrap(), [0, 1, 2, 3, 4, 5, 6, 7]); in chain()
42 let it = a.chain(b).rev(); in chain() localVariable
44 assert_eq!(it.collect::<Vec<_>>().unwrap(), [7, 6, 5, 4, 3, 2, 1, 0]); in chain()
56 let it = Some(Ok(1)).into_iter().chain(iter::repeat(Err(()))); in count() localVariable
57 assert!(convert(it).count().is_err()); in count()
62 let it = convert(vec![5, 6, 7, 8].into_iter().map(Ok::<u32, ()>)).enumerate(); in enumerate() localVariable
65 it.collect::<Vec<_>>().unwrap(), in enumerate()
72 let it = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<u32, u32>)); in filter() localVariable
73 let it = it.filter(|&x| if x % 2 == 0 { Ok(x % 3 == 0) } else { Err(x) }); in filter() localVariable
[all …]
|
| /external/llvm-project/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()
76 recursive_directory_iterator it(testDir, ec); in TEST_CASE() local
81 TEST_REQUIRE(it != endIt); in TEST_CASE()
82 const path entry = *it; in TEST_CASE()
84 const path entry2 = *it++; in TEST_CASE()
[all …]
|
| D | recursion_pending.pass.cpp | 33 recursive_directory_iterator it(static_env.Dir); in TEST_CASE() local
34 TEST_REQUIRE(it.recursion_pending() == true); in TEST_CASE()
45 recursive_directory_iterator it(rec_pending_it); in TEST_CASE() local
46 TEST_CHECK(it.recursion_pending() == true); in TEST_CASE()
47 it.disable_recursion_pending(); in TEST_CASE()
54 recursive_directory_iterator it(static_env.Dir); in TEST_CASE() local
55 it.disable_recursion_pending(); in TEST_CASE()
56 it = rec_pending_it; in TEST_CASE()
57 TEST_CHECK(it.recursion_pending() == true); in TEST_CASE()
58 it.disable_recursion_pending(); in TEST_CASE()
[all …]
|
| D | copy_assign.pass.cpp | 40 recursive_directory_iterator it(testDir, in TEST_SUITE() local
42 TEST_ASSERT(it != endIt); in TEST_SUITE()
43 while (it.depth() != 1) { in TEST_SUITE()
44 ++it; in TEST_SUITE()
45 TEST_ASSERT(it != endIt); in TEST_SUITE()
47 TEST_ASSERT(it.depth() == 1); in TEST_SUITE()
48 it.disable_recursion_pending(); in TEST_SUITE()
49 return it; in TEST_SUITE()
63 recursive_directory_iterator it(testDir, in createDifferentInterestingIterator() local
65 TEST_ASSERT(it != endIt); in createDifferentInterestingIterator()
[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 …]
|
| /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/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);
75 static int ASN1_primitive_new(ASN1_VALUE **pval, const ASN1_ITEM *it);
76 static void asn1_primitive_clear(ASN1_VALUE **pval, const ASN1_ITEM *it);
78 ASN1_VALUE *ASN1_item_new(const ASN1_ITEM *it) in ASN1_item_new() argument
81 if (ASN1_item_ex_new(&ret, it) > 0) in ASN1_item_new()
88 int ASN1_item_ex_new(ASN1_VALUE **pval, const ASN1_ITEM *it) in ASN1_item_ex_new() argument
90 return asn1_item_ex_combine_new(pval, it, 0); in ASN1_item_ex_new()
93 static int asn1_item_ex_combine_new(ASN1_VALUE **pval, const ASN1_ITEM *it, in asn1_item_ex_combine_new() argument
98 const ASN1_AUX *aux = it->funcs; in asn1_item_ex_combine_new()
[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-10.0/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 127 for (changeset_ty::const_iterator it = S.begin(), ie = S.end(); it != ie; in ExecuteOneTest()
128 ++it) in ExecuteOneTest()
129 for (succ_iterator_ty it2 = succ_begin(*it), ie2 = succ_end(*it); in ExecuteOneTest()
183 for (changeset_ty::const_iterator it = Changes.begin(), in DAGDeltaAlgorithmImpl() local
184 ie = Changes.end(); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
185 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
186 Successors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
188 for (std::vector<edge_ty>::const_iterator it = Dependencies.begin(), in DAGDeltaAlgorithmImpl() local
189 ie = Dependencies.end(); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
190 Predecessors[it->second].push_back(it->first); in DAGDeltaAlgorithmImpl()
[all …]
|
| /external/llvm-project/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 127 for (changeset_ty::const_iterator it = S.begin(), ie = S.end(); it != ie; in ExecuteOneTest()
128 ++it) in ExecuteOneTest()
129 for (succ_iterator_ty it2 = succ_begin(*it), ie2 = succ_end(*it); in ExecuteOneTest()
183 for (changeset_ty::const_iterator it = Changes.begin(), in DAGDeltaAlgorithmImpl() local
184 ie = Changes.end(); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
185 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
186 Successors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
188 for (std::vector<edge_ty>::const_iterator it = Dependencies.begin(), in DAGDeltaAlgorithmImpl() local
189 ie = Dependencies.end(); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
190 Predecessors[it->second].push_back(it->first); in DAGDeltaAlgorithmImpl()
[all …]
|
| /external/jackson-databind/src/test/java/com/fasterxml/jackson/databind/seq/ |
| D | ReadValuesTest.java | 87 MappingIterator<Bean> it = _iterator(MAPPER.readerFor(Bean.class), in _testRootBeans() local
89 assertNotNull(it.getCurrentLocation()); in _testRootBeans()
90 assertTrue(it.hasNext()); in _testRootBeans()
91 Bean b = it.next(); in _testRootBeans()
93 assertTrue(it.hasNext()); in _testRootBeans()
94 b = it.next(); in _testRootBeans()
96 assertFalse(it.hasNext()); in _testRootBeans()
97 it.close(); in _testRootBeans()
100 it = _iterator(MAPPER.readerFor(Bean.class), JSON, srcType); in _testRootBeans()
101 List<Bean> all = it.readAll(); in _testRootBeans()
[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/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 …]
|