| /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/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/buildtools/third_party/libc++/trunk/test/std/algorithms/ |
| D | robust_against_adl.compile.pass.cpp | 46 Holder<Incomplete> **first = t.data; in all_the_algorithms() local
55 (void)std::adjacent_find(first, last); in all_the_algorithms()
56 (void)std::adjacent_find(first, last, std::equal_to<void*>()); in all_the_algorithms()
58 (void)std::all_of(first, last, UnaryTrue()); in all_the_algorithms()
59 (void)std::any_of(first, last, UnaryTrue()); in all_the_algorithms()
61 (void)std::binary_search(first, last, value); in all_the_algorithms()
62 (void)std::binary_search(first, last, value, std::less<void*>()); in all_the_algorithms()
67 (void)std::copy(first, last, first2); in all_the_algorithms()
68 (void)std::copy_backward(first, last, last2); in all_the_algorithms()
69 (void)std::copy_n(first, count, first2); in all_the_algorithms()
[all …]
|
| D | robust_re_difference_type.compile.pass.cpp | 78 auto first = PickyIterator<void**, long>(a); in all_the_algorithms() local
87 (void)std::adjacent_find(first, last); in all_the_algorithms()
88 (void)std::adjacent_find(first, last, std::equal_to<void*>()); in all_the_algorithms()
90 (void)std::all_of(first, last, UnaryTrue()); in all_the_algorithms()
91 (void)std::any_of(first, last, UnaryTrue()); in all_the_algorithms()
93 (void)std::binary_search(first, last, value); in all_the_algorithms()
94 (void)std::binary_search(first, last, value, std::less<void*>()); in all_the_algorithms()
99 (void)std::copy(first, last, first2); in all_the_algorithms()
100 (void)std::copy_backward(first, last, last2); in all_the_algorithms()
101 (void)std::copy_n(first, count, first2); in all_the_algorithms()
[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/buildtools/third_party/libc++/trunk/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/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 …]
|
| D | receiver_session_unittest.cc | 966 ReceiverSession::VideoLimits first{}; in TEST_F() local
967 ReceiverSession::VideoLimits second = first; in TEST_F()
969 EXPECT_TRUE(first.IsSupersetOf(second)); in TEST_F()
970 EXPECT_TRUE(second.IsSupersetOf(first)); in TEST_F()
972 first.max_pixels_per_second += 1; in TEST_F()
973 EXPECT_TRUE(first.IsSupersetOf(second)); in TEST_F()
974 EXPECT_FALSE(second.IsSupersetOf(first)); in TEST_F()
975 first.max_pixels_per_second = second.max_pixels_per_second; in TEST_F()
977 first.max_dimensions = {1921, 1090, {kDefaultFrameRate, 1}}; in TEST_F()
978 EXPECT_TRUE(first.IsSupersetOf(second)); in TEST_F()
[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 …]
|
| D | numeral.frag.out | 25 0:5 move second child to first child ( temp int)
30 0:6 move second child to first child ( temp int)
35 0:7 move second child to first child ( temp int)
40 0:8 move second child to first child ( temp int)
45 0:9 move second child to first child ( temp int)
50 0:10 move second child to first child ( temp int)
55 0:11 move second child to first child ( temp int)
60 0:12 move second child to first child ( temp int)
65 0:13 move second child to first child ( temp int)
70 0:14 move second child to first child ( temp int)
[all …]
|
| /external/angle/third_party/vulkan-deps/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 …]
|
| D | numeral.frag.out | 25 0:5 move second child to first child ( temp int)
30 0:6 move second child to first child ( temp int)
35 0:7 move second child to first child ( temp int)
40 0:8 move second child to first child ( temp int)
45 0:9 move second child to first child ( temp int)
50 0:10 move second child to first child ( temp int)
55 0:11 move second child to first child ( temp int)
60 0:12 move second child to first child ( temp int)
65 0:13 move second child to first child ( temp int)
70 0:14 move second child to first child ( temp int)
[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 …]
|
| D | erase_range.pass.cpp | 47 assert(std::distance(eq.first, eq.second) == 2); in main()
48 k = eq.first; in main()
49 assert(k->first == 1); in main()
52 assert(k->first == 1); in main()
55 assert(std::distance(eq.first, eq.second) == 2); in main()
56 k = eq.first; in main()
57 assert(k->first == 2); in main()
60 assert(k->first == 2); in main()
63 assert(std::distance(eq.first, eq.second) == 1); in main()
64 k = eq.first; in main()
[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/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/libcxx/test/std/containers/associative/map/map.modifiers/ |
| D | erase_key.pass.cpp | 43 assert(m.begin()->first == 1); in main()
45 assert(next(m.begin())->first == 2); in main()
47 assert(next(m.begin(), 2)->first == 3); in main()
49 assert(next(m.begin(), 3)->first == 4); in main()
51 assert(next(m.begin(), 4)->first == 5); in main()
53 assert(next(m.begin(), 5)->first == 6); in main()
55 assert(next(m.begin(), 6)->first == 7); in main()
57 assert(next(m.begin(), 7)->first == 8); in main()
63 assert(m.begin()->first == 1); in main()
65 assert(next(m.begin())->first == 2); in main()
[all …]
|
| 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/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/cronet/buildtools/third_party/libc++/trunk/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 …]
|
| D | erase_key.pass.cpp | 43 assert(m.begin()->first == 1); in main()
45 assert(std::next(m.begin())->first == 2); in main()
47 assert(std::next(m.begin(), 2)->first == 3); in main()
49 assert(std::next(m.begin(), 3)->first == 4); in main()
51 assert(std::next(m.begin(), 4)->first == 5); in main()
53 assert(std::next(m.begin(), 5)->first == 6); in main()
55 assert(std::next(m.begin(), 6)->first == 7); in main()
57 assert(std::next(m.begin(), 7)->first == 8); in main()
63 assert(m.begin()->first == 1); in main()
65 assert(std::next(m.begin())->first == 2); in main()
[all …]
|
| /external/elfutils/libcpu/ |
| D | riscv_disasm.c | 137 uint16_t first = read_2ubyte_unaligned (data); in riscv_disasm() local
141 if ((first & 0x3) != 0x3) in riscv_disasm()
143 else if ((first & 0x1f) != 0x1f) in riscv_disasm()
145 else if ((first & 0x3f) != 0x3f) in riscv_disasm()
147 else if ((first & 0x7f) != 0x7f) in riscv_disasm()
151 uint16_t nnn = (first >> 12) & 0x7; in riscv_disasm()
177 size_t idx = (first >> 13) * 3 + (first & 0x3); in riscv_disasm()
185 if ((first & 0x1fe0) != 0) in riscv_disasm()
188 op[0] = REGP ((first & 0x1c) >> 2); in riscv_disasm()
190 opaddr = (((first >> 1) & 0x3c0) in riscv_disasm()
[all …]
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/libcxx/algorithms/ |
| D | robust_against_copying_comparators.pass.cpp | 97 T *first = a; in all_the_algorithms() local
107 (void)std::adjacent_find(first, last, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms()
109 (void)std::all_of(first, last, UnaryTrue<T>(&copies)); assert(copies == 0); in all_the_algorithms()
110 (void)std::any_of(first, last, UnaryTrue<T>(&copies)); assert(copies == 0); in all_the_algorithms()
112 (void)std::binary_search(first, last, value, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
116 (void)std::count_if(first, last, UnaryTrue<T>(&copies)); assert(copies == 0); in all_the_algorithms()
117 (void)std::copy_if(first, last, first2, UnaryTrue<T>(&copies)); assert(copies == 0); in all_the_algorithms()
118 (void)std::equal(first, last, first2, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms()
120 (void)std::equal(first, last, first2, last2, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms()
122 (void)std::equal_range(first, last, value, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| /external/pigweed/pw_containers/ |
| D | flat_map_test.cc | 66 EXPECT_EQ(kEmpty.equal_range(0).first, kEmpty.end()); in TEST()
79 EXPECT_EQ(&item, kOddMap.find(item.first)); in TEST()
86 EXPECT_EQ(1, pair.first->first); in TEST()
87 EXPECT_EQ(50, pair.second->first); in TEST()
90 EXPECT_EQ(100, pair.first->first); in TEST()
91 EXPECT_EQ(100, pair.second->first); in TEST()
96 EXPECT_EQ(50, it->first); in TEST()
104 EXPECT_EQ(-3, kOddMap.upper_bound(std::numeric_limits<int>::min())->first); in TEST()
105 EXPECT_EQ(-3, kOddMap.upper_bound(-123)->first); in TEST()
106 EXPECT_EQ(-3, kOddMap.upper_bound(-4)->first); in TEST()
[all …]
|