| /external/clang/test/Index/ |
| D | recursive-member-access.c | 2 struct rdar8650865 *first; member
7 return ((((((s->first)->first) in test_rdar8650865()
8 ->first) in test_rdar8650865()
9 ->first) in test_rdar8650865()
10 ->first) in test_rdar8650865()
11 ->first) in test_rdar8650865()
12 ->first in test_rdar8650865()
13 ->first in test_rdar8650865()
14 ->first in test_rdar8650865()
15 ->first in test_rdar8650865()
[all …]
|
| /external/swiftshader/third_party/llvm-subzero/lib/Demangle/ |
| D | ItaniumDemangle.cpp | 40 static const char *parse_type(const char *first, const char *last, C &db);
42 static const char *parse_encoding(const char *first, const char *last, C &db);
44 static const char *parse_name(const char *first, const char *last, C &db,
47 static const char *parse_expression(const char *first, const char *last, C &db);
49 static const char *parse_template_args(const char *first, const char *last,
52 static const char *parse_operator_name(const char *first, const char *last,
55 static const char *parse_unqualified_name(const char *first, const char *last,
58 static const char *parse_decltype(const char *first, const char *last, C &db);
62 static const char *parse_number(const char *first, const char *last) { in parse_number() argument
63 if (first != last) { in parse_number()
[all …]
|
| /external/sdv/vsomeip/third_party/boost/algorithm/include/boost/algorithm/ |
| D | minmax_element.hpp | 58 basic_minmax_element(ForwardIter first, ForwardIter last, Compare comp) in basic_minmax_element() argument
60 if (first == last) in basic_minmax_element()
63 ForwardIter min_result = first; in basic_minmax_element()
64 ForwardIter max_result = first; in basic_minmax_element()
67 ForwardIter second = first; ++second; in basic_minmax_element()
73 if (comp(first, second)) in basic_minmax_element()
77 potential_min_result = first; in basic_minmax_element()
81 first = ++second; if (first != last) ++second; in basic_minmax_element()
83 if (comp(first, second)) { in basic_minmax_element()
84 if (comp(first, min_result)) { in basic_minmax_element()
[all …]
|
| /external/arm-optimized-routines/string/arm/ |
| D | asmdefs.h | 101 .macro cfirestorelist first, last
103 .if \last-\first
104 cfirestorelist \first, \last-1
109 .macro cfisavelist first, last, index=1
111 .if \last-\first
112 cfisavelist \first, \last-1, \index+1
116 .macro _prologue first=-1, last=-1, push_ip=PAC_LEAF_PUSH_IP, push_lr=0
123 .if \first != -1
126 _prologue \first, \first, \push_ip, \push_lr
142 .if \first != -1
[all …]
|
| /external/cronet/tot/third_party/libc++/src/test/std/algorithms/ |
| D | robust_against_adl.compile.pass.cpp | 41 Holder<Incomplete> **first = t.data; in all_the_algorithms() local
50 (void)std::adjacent_find(first, last); in all_the_algorithms()
51 (void)std::adjacent_find(first, last, std::equal_to<void*>()); in all_the_algorithms()
53 (void)std::all_of(first, last, UnaryTrue()); in all_the_algorithms()
54 (void)std::any_of(first, last, UnaryTrue()); in all_the_algorithms()
56 (void)std::binary_search(first, last, value); in all_the_algorithms()
57 (void)std::binary_search(first, last, value, std::less<void*>()); in all_the_algorithms()
62 (void)std::copy(first, last, first2); in all_the_algorithms()
63 (void)std::copy_backward(first, last, last2); in all_the_algorithms()
64 (void)std::copy_n(first, count, first2); in all_the_algorithms()
[all …]
|
| D | robust_re_difference_type.compile.pass.cpp | 79 auto first = PickyIterator<void**, long>(a); in all_the_algorithms() local
88 (void)std::adjacent_find(first, last); in all_the_algorithms()
89 (void)std::adjacent_find(first, last, std::equal_to<void*>()); in all_the_algorithms()
91 (void)std::all_of(first, last, UnaryTrue()); in all_the_algorithms()
92 (void)std::any_of(first, last, UnaryTrue()); in all_the_algorithms()
94 (void)std::binary_search(first, last, value); in all_the_algorithms()
95 (void)std::binary_search(first, last, value, std::less<void*>()); in all_the_algorithms()
100 (void)std::copy(first, last, first2); in all_the_algorithms()
101 (void)std::copy_backward(first, last, last2); in all_the_algorithms()
102 (void)std::copy_n(first, count, first2); in all_the_algorithms()
[all …]
|
| /external/cronet/stable/third_party/libc++/src/test/std/algorithms/ |
| D | robust_against_adl.compile.pass.cpp | 41 Holder<Incomplete> **first = t.data; in all_the_algorithms() local
50 (void)std::adjacent_find(first, last); in all_the_algorithms()
51 (void)std::adjacent_find(first, last, std::equal_to<void*>()); in all_the_algorithms()
53 (void)std::all_of(first, last, UnaryTrue()); in all_the_algorithms()
54 (void)std::any_of(first, last, UnaryTrue()); in all_the_algorithms()
56 (void)std::binary_search(first, last, value); in all_the_algorithms()
57 (void)std::binary_search(first, last, value, std::less<void*>()); in all_the_algorithms()
62 (void)std::copy(first, last, first2); in all_the_algorithms()
63 (void)std::copy_backward(first, last, last2); in all_the_algorithms()
64 (void)std::copy_n(first, count, first2); in all_the_algorithms()
[all …]
|
| D | robust_re_difference_type.compile.pass.cpp | 79 auto first = PickyIterator<void**, long>(a); in all_the_algorithms() local
88 (void)std::adjacent_find(first, last); in all_the_algorithms()
89 (void)std::adjacent_find(first, last, std::equal_to<void*>()); in all_the_algorithms()
91 (void)std::all_of(first, last, UnaryTrue()); in all_the_algorithms()
92 (void)std::any_of(first, last, UnaryTrue()); in all_the_algorithms()
94 (void)std::binary_search(first, last, value); in all_the_algorithms()
95 (void)std::binary_search(first, last, value, std::less<void*>()); in all_the_algorithms()
100 (void)std::copy(first, last, first2); in all_the_algorithms()
101 (void)std::copy_backward(first, last, last2); in all_the_algorithms()
102 (void)std::copy_n(first, count, first2); in all_the_algorithms()
[all …]
|
| /external/sdv/vsomeip/third_party/boost/algorithm/minmax/test/ |
| D | minmax_element_test.cpp | 28 void do_shuffle(RandomIt first, RandomIt last) in do_shuffle() argument
29 { std::shuffle(first, last, gen); } in do_shuffle()
32 void do_shuffle(RandomIt first, RandomIt last) in do_shuffle() argument
33 { std::random_shuffle(first, last); } in do_shuffle()
76 void tie(std::pair<T1, T2> p, T3& first, T4& second) in tie() argument
78 first = T3(p.first); second = T4(p.second); in tie()
111 #define CHECK_EQUAL_ITERATORS( left, right, first ) \ argument
112 BOOST_CHECK_EQUAL( std::distance( first, left ), std::distance( first, right ) )
115 void test_minmax(CIterator first, CIterator last, int n) in test_minmax() argument
123 RCIterator rfirst(last), rlast(first), rmin, rmax; in test_minmax()
[all …]
|
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/ |
| D | insert_rvalue.pass.cpp | 38 assert(r.first->first == 3.5); in main()
39 assert(r.first->second == 3); in main()
44 assert(r.first->first == 3.5); in main()
45 assert(r.first->second == 3); in main()
50 assert(r.first->first == 4.5); in main()
51 assert(r.first->second == 4); in main()
56 assert(r.first->first == 5.5); in main()
57 assert(r.first->second == 4); in main()
67 assert(r.first->first == 3); in main()
68 assert(r.first->second == 3); in main()
[all …]
|
| /external/cronet/tot/third_party/libc++/src/test/std/containers/unord/unord.map/unord.map.modifiers/ |
| D | insert_rvalue.pass.cpp | 38 assert(r.first->first == 3.5); in main()
39 assert(r.first->second == 3); in main()
44 assert(r.first->first == 3.5); in main()
45 assert(r.first->second == 3); in main()
50 assert(r.first->first == 4.5); in main()
51 assert(r.first->second == 4); in main()
56 assert(r.first->first == 5.5); in main()
57 assert(r.first->second == 4); in main()
67 assert(r.first->first == 3); in main()
68 assert(r.first->second == 3); in main()
[all …]
|
| /external/cronet/stable/third_party/libc++/src/test/std/containers/unord/unord.map/unord.map.modifiers/ |
| D | insert_rvalue.pass.cpp | 38 assert(r.first->first == 3.5); in main()
39 assert(r.first->second == 3); in main()
44 assert(r.first->first == 3.5); in main()
45 assert(r.first->second == 3); in main()
50 assert(r.first->first == 4.5); in main()
51 assert(r.first->second == 4); in main()
56 assert(r.first->first == 5.5); in main()
57 assert(r.first->second == 4); in main()
67 assert(r.first->first == 3); in main()
68 assert(r.first->second == 3); in main()
[all …]
|
| /external/sdv/vsomeip/third_party/boost/spirit/include/boost/spirit/home/x3/numeric/ |
| D | real_policies.hpp | 36 parse_n(Iterator& first, Iterator const& last, Attribute& attr_) in parse_n()
38 return extract_uint<T, 10, 1, -1>::call(first, last, attr_); in parse_n()
43 parse_dot(Iterator& first, Iterator const& last) in parse_dot()
45 if (first == last || *first != '.') in parse_dot()
47 ++first; in parse_dot()
53 parse_frac_n(Iterator& first, Iterator const& last, Attribute& attr_) in parse_frac_n()
55 return extract_uint<T, 10, 1, -1, true>::call(first, last, attr_); in parse_frac_n()
60 parse_exp(Iterator& first, Iterator const& last) in parse_exp()
62 if (first == last || (*first != 'e' && *first != 'E')) in parse_exp()
64 ++first; in parse_exp()
[all …]
|
| /external/sdv/vsomeip/third_party/boost/spirit/include/boost/spirit/home/qi/numeric/ |
| D | real_policies.hpp | 66 parse_n(Iterator& first, Iterator const& last, Attribute& attr_) in parse_n()
72 return extract_uint::call(first, last, attr_); in parse_n()
78 ignore_excess_digits(Iterator& first, Iterator const& last) in ignore_excess_digits()
80 Iterator save = first; in ignore_excess_digits()
81 if (extract_uint<unused_type, 10, 1, -1>::call(first, last, unused)) in ignore_excess_digits()
82 return static_cast<std::size_t>(std::distance(save, first)); in ignore_excess_digits()
88 parse_dot(Iterator& first, Iterator const& last) in parse_dot()
90 if (first == last || *first != '.') in parse_dot()
92 ++first; in parse_dot()
98 parse_frac_n(Iterator& first, Iterator const& last, Attribute& attr_, int& frac_digits) in parse_frac_n()
[all …]
|
| /external/sdv/vsomeip/third_party/boost/move/include/boost/move/algo/detail/ |
| D | merge_sort.hpp | 45 void inplace_stable_sort(RandIt first, RandIt last, Compare comp) in inplace_stable_sort() argument
48 if (size_type(last - first) <= size_type(MergeSortInsertionSortThreshold)) { in inplace_stable_sort()
49 insertion_sort(first, last, comp); in inplace_stable_sort()
52 RandIt middle = first + (last - first) / 2; in inplace_stable_sort()
53 inplace_stable_sort(first, middle, comp); in inplace_stable_sort()
56 (first, middle, last, size_type(middle - first), size_type(last - middle), comp); in inplace_stable_sort()
62 void merge_sort_copy( RandIt first, RandIt last in merge_sort_copy() argument
67 size_type const count = size_type(last - first); in merge_sort_copy()
69 insertion_sort_copy(first, last, dest, comp); in merge_sort_copy()
73 merge_sort_copy(first + half, last , dest+half , comp); in merge_sort_copy()
[all …]
|
| /external/openscreen/cast/streaming/ |
| D | compound_rtcp_parser_unittest.cc | 45 parser()->Parse(absl::Span<const uint8_t>(kEmpty, 0), FrameId::first())); in TEST_F()
54 EXPECT_FALSE(parser()->Parse(kGarbage, FrameId::first())); in TEST_F()
69 parser()->Parse(kReceiverReportWithoutReportBlock, FrameId::first())); in TEST_F()
94 parser()->Parse(kReceiverReportWithReportBlock, FrameId::first())); in TEST_F()
135 EXPECT_TRUE(parser()->Parse(kPictureLossIndicatorPacket, FrameId::first())); in TEST_F()
142 FrameId::first())); in TEST_F()
146 FrameId::first())); in TEST_F()
202 EXPECT_TRUE(parser()->Parse(kNotStaleCompoundPacket, FrameId::first())); in TEST_F()
203 EXPECT_TRUE(parser()->Parse(kStaleCompoundPacketWithPli, FrameId::first())); in TEST_F()
245 parser()->Parse(kPacketWithThreeExtendedReports, FrameId::first())); in TEST_F()
[all …]
|
| /external/sdv/vsomeip/third_party/boost/detail/include/boost/detail/ |
| D | binary_search.hpp | 37 ForwardIter lower_bound(ForwardIter first, ForwardIter last, in lower_bound() argument
42 typename traits::difference_type len = std::distance(first, last); in lower_bound()
48 middle = first; in lower_bound()
51 first = middle; in lower_bound()
52 ++first; in lower_bound()
58 return first; in lower_bound()
62 ForwardIter lower_bound(ForwardIter first, ForwardIter last, in lower_bound() argument
67 typename traits::difference_type len = std::distance(first, last); in lower_bound()
73 middle = first; in lower_bound()
76 first = middle; in lower_bound()
[all …]
|
| /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| D | erase_key.pass.cpp | 60 assert(std::distance(eq.first, eq.second) == 2); in main()
61 C::const_iterator k = eq.first; in main()
62 assert(k->first == 1); in main()
65 assert(k->first == 1); in main()
68 assert(std::distance(eq.first, eq.second) == 2); in main()
69 k = eq.first; in main()
70 assert(k->first == 2); in main()
73 assert(k->first == 2); in main()
76 assert(std::distance(eq.first, eq.second) == 1); in main()
77 k = eq.first; in main()
[all …]
|
| /external/angle/third_party/glslang/src/Test/baseResults/ |
| D | stringToDouble.vert.out | 9 0:5 move second child to first child ( temp float)
14 0:6 move second child to first child ( temp float)
19 0:7 move second child to first child ( temp float)
24 0:8 move second child to first child ( temp float)
29 0:9 move second child to first child ( temp float)
34 0:10 move second child to first child ( temp double)
39 0:11 move second child to first child ( temp double)
44 0:12 move second child to first child ( temp double)
49 0:13 move second child to first child ( temp double)
54 0:14 move second child to first child ( temp double)
[all …]
|
| /external/deqp-deps/glslang/Test/baseResults/ |
| D | stringToDouble.vert.out | 9 0:5 move second child to first child ( temp float)
14 0:6 move second child to first child ( temp float)
19 0:7 move second child to first child ( temp float)
24 0:8 move second child to first child ( temp float)
29 0:9 move second child to first child ( temp float)
34 0:10 move second child to first child ( temp double)
39 0:11 move second child to first child ( temp double)
44 0:12 move second child to first child ( temp double)
49 0:13 move second child to first child ( temp double)
54 0:14 move second child to first child ( temp double)
[all …]
|
| /external/libdivsufsort/lib/ |
| D | trsort.c | 79 tr_insertionsort(const saidx_t *ISAd, saidx_t *first, saidx_t *last) { in tr_insertionsort() argument
83 for(a = first + 1; a < last; ++a) { in tr_insertionsort()
85 do { *(b + 1) = *b; } while((first <= --b) && (*b < 0)); in tr_insertionsort()
86 if(b < first) { break; } in tr_insertionsort()
167 tr_pivot(const saidx_t *ISAd, saidx_t *first, saidx_t *last) { in tr_pivot() argument
171 t = last - first; in tr_pivot()
172 middle = first + t / 2; in tr_pivot()
176 return tr_median3(ISAd, first, middle, last - 1); in tr_pivot()
179 return tr_median5(ISAd, first, first + t, middle, last - 1 - t, last - 1); in tr_pivot()
183 first = tr_median3(ISAd, first, first + t, first + (t << 1)); in tr_pivot()
[all …]
|
| /external/clang/test/Sema/ |
| D | loop-control.c | 5 int first = 1; in pr8880_1() local
6 for ( ; ({ if (first) { first = 0; continue; } 0; }); ) in pr8880_1()
11 void pr8880_2(int first) { in pr8880_2() argument
12 for ( ; ({ if (first) { first = 0; break; } 0; }); ) {} in pr8880_2()
15 void pr8880_3(int first) { in pr8880_3() argument
16 for ( ; ; (void)({ if (first) { first = 0; continue; } 0; })) {} in pr8880_3()
19 void pr8880_4(int first) { in pr8880_4() argument
20 for ( ; ; (void)({ if (first) { first = 0; break; } 0; })) {} in pr8880_4()
23 void pr8880_5 (int first) { in pr8880_5() argument
24 while(({ if (first) { first = 0; continue; } 0; })) {} in pr8880_5()
[all …]
|
| /external/XNNPACK/test/ |
| D | average-pooling-nhwc.cc | 39 .input_height(pooling_size.first + 3) in TEST()
41 .pooling_height(pooling_size.first) in TEST()
47 .input_width(pooling_size.first + 2) in TEST()
49 .pooling_width(pooling_size.first) in TEST()
66 .input_height(pooling_size.first + 3) in TEST()
68 .pooling_height(pooling_size.first) in TEST()
76 .input_width(pooling_size.first + 2) in TEST()
78 .pooling_width(pooling_size.first) in TEST()
96 .input_height(pooling_size.first + 3) in TEST()
100 .pooling_height(pooling_size.first) in TEST()
[all …]
|
| /external/libcxx/test/std/containers/associative/map/map.modifiers/ |
| D | insert_rv.pass.cpp | 36 assert(r.first == m.begin()); in do_insert_rv_test()
38 assert(r.first->first == 2); in do_insert_rv_test()
39 assert(r.first->second == 2); in do_insert_rv_test()
43 assert(r.first == m.begin()); in do_insert_rv_test()
45 assert(r.first->first == 1); in do_insert_rv_test()
46 assert(r.first->second == 1); in do_insert_rv_test()
50 assert(r.first == prev(m.end())); in do_insert_rv_test()
52 assert(r.first->first == 3); in do_insert_rv_test()
53 assert(r.first->second == 3); in do_insert_rv_test()
57 assert(r.first == prev(m.end())); in do_insert_rv_test()
[all …]
|
| /external/cronet/stable/third_party/libc++/src/test/std/containers/associative/map/map.modifiers/ |
| D | insert_rv.pass.cpp | 35 assert(r.first == m.begin()); in do_insert_rv_test()
37 assert(r.first->first == 2); in do_insert_rv_test()
38 assert(r.first->second == 2); in do_insert_rv_test()
42 assert(r.first == m.begin()); in do_insert_rv_test()
44 assert(r.first->first == 1); in do_insert_rv_test()
45 assert(r.first->second == 1); in do_insert_rv_test()
49 assert(r.first == std::prev(m.end())); in do_insert_rv_test()
51 assert(r.first->first == 3); in do_insert_rv_test()
52 assert(r.first->second == 3); in do_insert_rv_test()
56 assert(r.first == std::prev(m.end())); in do_insert_rv_test()
[all …]
|