| /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/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/webrtc/webrtc/libjingle/xmllite/ |
| D | xmlnsstack_unittest.cc | 29 EXPECT_EQ(std::string(NS_XML), stack.NsForPrefix("xml").first); in TEST()
30 EXPECT_EQ(std::string(NS_XMLNS), stack.NsForPrefix("xmlns").first); in TEST()
31 EXPECT_EQ("", stack.NsForPrefix("").first); in TEST()
33 EXPECT_EQ("xml", stack.PrefixForNs(NS_XML, false).first); in TEST()
34 EXPECT_EQ("xmlns", stack.PrefixForNs(NS_XMLNS, false).first); in TEST()
35 EXPECT_EQ("", stack.PrefixForNs("", false).first); in TEST()
36 EXPECT_EQ("", stack.PrefixForNs("", true).first); in TEST()
46 EXPECT_EQ("ns3", stack.NsForPrefix("pre1").first); in TEST()
48 EXPECT_EQ("ns2", stack.NsForPrefix("pre2").first); in TEST()
49 EXPECT_EQ("ns4", stack.NsForPrefix("").first); in TEST()
[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/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/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 …]
|
| D | sssort.c | 168 saidx_t *first, saidx_t *last, saidx_t depth) { in ss_insertionsort() argument
173 for(i = last - 2; first <= i; --i) { in ss_insertionsort()
263 ss_pivot(const sauchar_t *Td, const saidx_t *PA, saidx_t *first, saidx_t *last) { in ss_pivot() argument
267 t = last - first; in ss_pivot()
268 middle = first + t / 2; in ss_pivot()
272 return ss_median3(Td, PA, first, middle, last - 1); in ss_pivot()
275 return ss_median5(Td, PA, first, first + t, middle, last - 1 - t, last - 1); in ss_pivot()
279 first = ss_median3(Td, PA, first, first + t, first + (t << 1)); in ss_pivot()
282 return ss_median3(Td, PA, first, middle, last); in ss_pivot()
292 saidx_t *first, saidx_t *last, saidx_t depth) { in ss_partition() argument
[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 …]
|
| D | erase_iter.pass.cpp | 51 assert(m.begin()->first == 1); in main()
53 assert(next(m.begin())->first == 2); in main()
55 assert(next(m.begin(), 2)->first == 3); in main()
57 assert(next(m.begin(), 3)->first == 5); in main()
59 assert(next(m.begin(), 4)->first == 6); in main()
61 assert(next(m.begin(), 5)->first == 7); in main()
63 assert(next(m.begin(), 6)->first == 8); in main()
69 assert(m.begin()->first == 2); in main()
71 assert(next(m.begin())->first == 3); in main()
73 assert(next(m.begin(), 2)->first == 5); in main()
[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/webrtc/webrtc/system_wrappers/source/spreadsortlib/ |
| D | spreadsort.hpp | 130 …spread_sort_rec(RandomAccessIter first, RandomAccessIter last, std::vector<RandomAccessIter> &bin_… in spread_sort_rec() argument
136 find_extremes(first, last, max, min); in spread_sort_rec()
141 …unsigned log_divisor = get_log_divisor(last - first, rough_log_2_size((size_t)(*max >> 0) - (*min … in spread_sort_rec()
149 for (RandomAccessIter current = first; current != last;) in spread_sort_rec()
152 bins[0] = first; in spread_sort_rec()
158 RandomAccessIter nextbinstart = first; in spread_sort_rec()
192 size_t max_count = get_max_count(log_divisor, last - first); in spread_sort_rec()
193 RandomAccessIter lastPos = first; in spread_sort_rec()
247 …spread_sort_rec(RandomAccessIter first, RandomAccessIter last, std::vector<RandomAccessIter> &bin_… in spread_sort_rec() argument
251 find_extremes(first, last, max, min, comp); in spread_sort_rec()
[all …]
|
| /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/ |
| D | init.pass.cpp | 54 assert(std::distance(eq.first, eq.second) == 2); in main()
55 C::const_iterator i = eq.first; in main()
56 assert(i->first == 1); in main()
59 assert(i->first == 1); in main()
62 assert(std::distance(eq.first, eq.second) == 2); in main()
63 i = eq.first; in main()
64 assert(i->first == 2); in main()
67 assert(i->first == 2); in main()
71 assert(std::distance(eq.first, eq.second) == 1); in main()
72 i = eq.first; in main()
[all …]
|
| D | assign_move.pass.cpp | 69 assert(std::distance(eq.first, eq.second) == 2); in main()
70 C::const_iterator i = eq.first; in main()
71 assert(i->first == 1); in main()
74 assert(i->first == 1); in main()
77 assert(std::distance(eq.first, eq.second) == 2); in main()
78 i = eq.first; in main()
79 assert(i->first == 2); in main()
82 assert(i->first == 2); in main()
86 assert(std::distance(eq.first, eq.second) == 1); in main()
87 i = eq.first; in main()
[all …]
|
| D | move_alloc.pass.cpp | 65 assert(std::distance(eq.first, eq.second) == 2); in main()
66 C::const_iterator i = eq.first; in main()
67 assert(i->first == 1); in main()
70 assert(i->first == 1); in main()
73 assert(std::distance(eq.first, eq.second) == 2); in main()
74 i = eq.first; in main()
75 assert(i->first == 2); in main()
78 assert(i->first == 2); in main()
82 assert(std::distance(eq.first, eq.second) == 1); in main()
83 i = eq.first; in main()
[all …]
|
| D | range.pass.cpp | 57 assert(std::distance(eq.first, eq.second) == 2); in main()
58 C::const_iterator i = eq.first; in main()
59 assert(i->first == 1); in main()
62 assert(i->first == 1); in main()
65 assert(std::distance(eq.first, eq.second) == 2); in main()
66 i = eq.first; in main()
67 assert(i->first == 2); in main()
70 assert(i->first == 2); in main()
74 assert(std::distance(eq.first, eq.second) == 1); in main()
75 i = eq.first; in main()
[all …]
|
| D | init_size_hash_equal_allocator.pass.cpp | 60 assert(std::distance(eq.first, eq.second) == 2); in main()
61 C::const_iterator i = eq.first; in main()
62 assert(i->first == 1); in main()
65 assert(i->first == 1); in main()
68 assert(std::distance(eq.first, eq.second) == 2); in main()
69 i = eq.first; in main()
70 assert(i->first == 2); in main()
73 assert(i->first == 2); in main()
77 assert(std::distance(eq.first, eq.second) == 1); in main()
78 i = eq.first; in main()
[all …]
|
| /external/libcxx/test/std/containers/associative/multimap/multimap.modifiers/ |
| D | erase_iter.pass.cpp | 52 assert(m.begin()->first == 1); in main()
54 assert(next(m.begin())->first == 1); in main()
56 assert(next(m.begin(), 2)->first == 1); in main()
58 assert(next(m.begin(), 3)->first == 2); in main()
60 assert(next(m.begin(), 4)->first == 2); in main()
62 assert(next(m.begin(), 5)->first == 3); in main()
64 assert(next(m.begin(), 6)->first == 3); in main()
66 assert(next(m.begin(), 7)->first == 3); in main()
72 assert(next(m.begin(), 0)->first == 1); in main()
74 assert(next(m.begin(), 1)->first == 1); in main()
[all …]
|
| /external/libcxx/test/std/containers/associative/set/ |
| D | equal_range.pass.cpp | 44 assert(r.first == next(m.begin(), 0)); in main()
47 assert(r.first == next(m.begin(), 1)); in main()
50 assert(r.first == next(m.begin(), 2)); in main()
53 assert(r.first == next(m.begin(), 3)); in main()
56 assert(r.first == next(m.begin(), 4)); in main()
59 assert(r.first == next(m.begin(), 5)); in main()
62 assert(r.first == next(m.begin(), 6)); in main()
65 assert(r.first == next(m.begin(), 7)); in main()
68 assert(r.first == next(m.begin(), 0)); in main()
71 assert(r.first == next(m.begin(), 1)); in main()
[all …]
|
| /external/libcxx/test/std/containers/associative/map/map.ops/ |
| D | equal_range.pass.cpp | 45 assert(r.first == next(m.begin(), 0)); in main()
48 assert(r.first == next(m.begin(), 1)); in main()
51 assert(r.first == next(m.begin(), 2)); in main()
54 assert(r.first == next(m.begin(), 3)); in main()
57 assert(r.first == next(m.begin(), 4)); in main()
60 assert(r.first == next(m.begin(), 5)); in main()
63 assert(r.first == next(m.begin(), 6)); in main()
66 assert(r.first == next(m.begin(), 7)); in main()
69 assert(r.first == next(m.begin(), 0)); in main()
72 assert(r.first == next(m.begin(), 1)); in main()
[all …]
|
| /external/elfutils/lib/ |
| D | list.h | 33 #define CDBL_LIST_ADD_REAR(first, newp) \ argument
38 if (unlikely ((first) == NULL)) \
39 (first) = _newp->next = _newp->previous = _newp; \
42 _newp->next = (first); \
43 _newp->previous = (first)->previous; \
49 #define CDBL_LIST_DEL(first, elem) \ argument
53 assert (first != NULL && _elem != NULL \
54 && (first != elem \
55 || ({ __typeof (elem) _runp = first->next; \
56 while (_runp != first) \
[all …]
|
| /external/archive-patcher/generator/src/main/java/com/google/archivepatcher/generator/bsdiff/ |
| D | DivSuffixSorter.java | 314 final int PA, int first, int last, int buf, int bufsize, int depth, int n, boolean lastsuffix) in ssSort() argument
323 ++first; in ssSort()
327 && (bufsize < (last - first)) in ssSort()
328 && (bufsize < (limit = ssIsqrt(last - first)))) { in ssSort()
338 for (a = first, i = 0; SS_BLOCKSIZE < (middle - a); a += SS_BLOCKSIZE, ++i) { in ssSort()
359 ssInplaceMerge(PA, first, middle, last, depth); in ssSort()
363 int p1 = readSuffixArray(PA + readSuffixArray(first - 1)); in ssSort()
365 for (a = first, i = readSuffixArray(first - 1); in ssSort()
402 private final void ssInplaceMerge(int PA, int first, int middle, int last, int depth) in ssInplaceMerge() argument
418 for (a = first, len = middle - first, half = len >> 1, r = -1; in ssInplaceMerge()
[all …]
|