| /external/libcxx/test/std/containers/sequences/list/list.ops/ |
| D | splice_pos_list_iter.pass.cpp | 25 std::list<int> l1; in main() local
27 l1.splice(l1.end(), l2, l2.begin()); in main()
28 assert(l1.size() == 1); in main()
29 assert(distance(l1.begin(), l1.end()) == 1); in main()
32 std::list<int>::const_iterator i = l1.begin(); in main()
36 std::list<int> l1; in main() local
38 l1.splice(l1.end(), l2, l2.begin()); in main()
39 assert(l1.size() == 1); in main()
40 assert(distance(l1.begin(), l1.end()) == 1); in main()
43 std::list<int>::const_iterator i = l1.begin(); in main()
[all …]
|
| D | splice_pos_list.pass.cpp | 25 std::list<int> l1; in main() local
27 l1.splice(l1.end(), l2); in main()
28 assert(l1.size() == 0); in main()
29 assert(distance(l1.begin(), l1.end()) == 0); in main()
34 std::list<int> l1; in main() local
36 l1.splice(l1.end(), l2); in main()
37 assert(l1.size() == 1); in main()
38 assert(distance(l1.begin(), l1.end()) == 1); in main()
41 std::list<int>::const_iterator i = l1.begin(); in main()
45 std::list<int> l1; in main() local
[all …]
|
| D | splice_pos_list_iter_iter.pass.cpp | 25 std::list<int> l1(a1, a1+3); in main() local
26 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin())); in main()
27 assert(l1.size() == 3); in main()
28 assert(distance(l1.begin(), l1.end()) == 3); in main()
29 std::list<int>::const_iterator i = l1.begin(); in main()
37 std::list<int> l1(a1, a1+3); in main() local
38 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin(), 2)); in main()
39 assert(l1.size() == 3); in main()
40 assert(distance(l1.begin(), l1.end()) == 3); in main()
41 std::list<int>::const_iterator i = l1.begin(); in main()
[all …]
|
| /external/libcxx/test/std/containers/sequences/vector/vector.modifiers/ |
| D | erase_iter_iter.pass.cpp | 25 std::vector<int> l1(a1, a1+3); in main() local
26 assert(is_contiguous_container_asan_correct(l1)); in main()
27 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in main()
28 assert(l1.size() == 3); in main()
29 assert(distance(l1.cbegin(), l1.cend()) == 3); in main()
30 assert(i == l1.begin()); in main()
31 assert(is_contiguous_container_asan_correct(l1)); in main()
34 std::vector<int> l1(a1, a1+3); in main() local
35 assert(is_contiguous_container_asan_correct(l1)); in main()
36 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin())); in main()
[all …]
|
| D | erase_iter.pass.cpp | 25 std::vector<int> l1(a1, a1+3); in main() local
26 std::vector<int>::const_iterator i = l1.begin(); in main()
27 assert(is_contiguous_container_asan_correct(l1)); in main()
29 std::vector<int>::iterator j = l1.erase(i); in main()
30 assert(l1.size() == 2); in main()
31 assert(distance(l1.begin(), l1.end()) == 2); in main()
33 assert(*l1.begin() == 1); in main()
34 assert(*next(l1.begin()) == 3); in main()
35 assert(is_contiguous_container_asan_correct(l1)); in main()
36 j = l1.erase(j); in main()
[all …]
|
| /external/libcxx/test/std/containers/sequences/list/list.modifiers/ |
| D | erase_iter_iter.pass.cpp | 23 std::list<int> l1(a1, a1+3); in main() local
24 std::list<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in main()
25 assert(l1.size() == 3); in main()
26 assert(distance(l1.cbegin(), l1.cend()) == 3); in main()
27 assert(i == l1.begin()); in main()
30 std::list<int> l1(a1, a1+3); in main() local
31 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin())); in main()
32 assert(l1.size() == 2); in main()
33 assert(distance(l1.cbegin(), l1.cend()) == 2); in main()
34 assert(i == l1.begin()); in main()
[all …]
|
| D | erase_iter.pass.cpp | 23 std::list<int> l1(a1, a1+3); in main() local
24 std::list<int>::const_iterator i = l1.begin(); in main()
26 std::list<int>::iterator j = l1.erase(i); in main()
27 assert(l1.size() == 2); in main()
28 assert(distance(l1.begin(), l1.end()) == 2); in main()
30 assert(*l1.begin() == 1); in main()
31 assert(*next(l1.begin()) == 3); in main()
32 j = l1.erase(j); in main()
33 assert(j == l1.end()); in main()
34 assert(l1.size() == 1); in main()
[all …]
|
| D | insert_iter_rvalue.pass.cpp | 25 std::list<MoveOnly> l1; in main() local
26 l1.insert(l1.cend(), MoveOnly(1)); in main()
27 assert(l1.size() == 1); in main()
28 assert(l1.front() == MoveOnly(1)); in main()
29 l1.insert(l1.cbegin(), MoveOnly(2)); in main()
30 assert(l1.size() == 2); in main()
31 assert(l1.front() == MoveOnly(2)); in main()
32 assert(l1.back() == MoveOnly(1)); in main()
35 std::list<MoveOnly, min_allocator<MoveOnly>> l1; in main() local
36 l1.insert(l1.cend(), MoveOnly(1)); in main()
[all …]
|
| D | push_back_rvalue.pass.cpp | 24 std::list<MoveOnly> l1; in main() local
25 l1.push_back(MoveOnly(1)); in main()
26 assert(l1.size() == 1); in main()
27 assert(l1.front() == MoveOnly(1)); in main()
28 l1.push_back(MoveOnly(2)); in main()
29 assert(l1.size() == 2); in main()
30 assert(l1.front() == MoveOnly(1)); in main()
31 assert(l1.back() == MoveOnly(2)); in main()
35 std::list<MoveOnly, min_allocator<MoveOnly>> l1; in main() local
36 l1.push_back(MoveOnly(1)); in main()
[all …]
|
| D | push_front_rvalue.pass.cpp | 24 std::list<MoveOnly> l1; in main() local
25 l1.push_front(MoveOnly(1)); in main()
26 assert(l1.size() == 1); in main()
27 assert(l1.front() == MoveOnly(1)); in main()
28 l1.push_front(MoveOnly(2)); in main()
29 assert(l1.size() == 2); in main()
30 assert(l1.front() == MoveOnly(2)); in main()
31 assert(l1.back() == MoveOnly(1)); in main()
35 std::list<MoveOnly, min_allocator<MoveOnly>> l1; in main() local
36 l1.push_front(MoveOnly(1)); in main()
[all …]
|
| D | insert_iter_iter_iter.pass.cpp | 27 List l1; in test() local
28 typename List::iterator i = l1.insert(l1.begin(), a1, a1+3); in test()
29 assert(i == l1.begin()); in test()
30 assert(l1.size() == 3); in test()
31 assert(distance(l1.begin(), l1.end()) == 3); in test()
32 i = l1.begin(); in test()
39 i = l1.insert(i, a2, a2+3); in test()
41 assert(l1.size() == 6); in test()
42 assert(distance(l1.begin(), l1.end()) == 6); in test()
43 i = l1.begin(); in test()
[all …]
|
| D | insert_iter_value.pass.cpp | 27 List l1(a1, a1+3); in test() local
28 typename List::iterator i = l1.insert(next(l1.cbegin()), 4); in test()
29 assert(i == next(l1.begin())); in test()
30 assert(l1.size() == 4); in test()
31 assert(distance(l1.begin(), l1.end()) == 4); in test()
32 assert(l1 == List(a2, a2+4)); in test()
39 i = l1.insert(i, 5); in test()
46 assert(l1 == List(a2, a2+4)); in test()
|
| /external/libcxx/test/std/containers/sequences/vector.bool/ |
| D | erase_iter_iter.pass.cpp | 24 std::vector<bool> l1(a1, a1+3); in main() local
25 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in main()
26 assert(l1.size() == 3); in main()
27 assert(distance(l1.cbegin(), l1.cend()) == 3); in main()
28 assert(i == l1.begin()); in main()
31 std::vector<bool> l1(a1, a1+3); in main() local
32 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin())); in main()
33 assert(l1.size() == 2); in main()
34 assert(distance(l1.cbegin(), l1.cend()) == 2); in main()
35 assert(i == l1.begin()); in main()
[all …]
|
| D | erase_iter.pass.cpp | 24 std::vector<bool> l1(a1, a1+3); in main() local
25 std::vector<bool>::const_iterator i = l1.begin(); in main()
27 std::vector<bool>::iterator j = l1.erase(i); in main()
28 assert(l1.size() == 2); in main()
29 assert(distance(l1.begin(), l1.end()) == 2); in main()
31 assert(*l1.begin() == 1); in main()
32 assert(*next(l1.begin()) == true); in main()
33 j = l1.erase(j); in main()
34 assert(j == l1.end()); in main()
35 assert(l1.size() == 1); in main()
[all …]
|
| /external/libcxx/test/std/thread/thread.mutex/thread.lock.algorithm/ |
| D | try_lock.pass.cpp | 80 L0 l1; in main() local
81 assert(std::try_lock(l0, l1) == -1); in main()
83 assert(l1.locked()); in main()
87 L1 l1; in main() local
88 assert(std::try_lock(l0, l1) == 1); in main()
90 assert(!l1.locked()); in main()
94 L0 l1; in main() local
95 assert(std::try_lock(l0, l1) == 0); in main()
97 assert(!l1.locked()); in main()
102 L2 l1; in main() local
[all …]
|
| D | lock.pass.cpp | 100 L0 l1; in main() local
101 std::lock(l0, l1); in main()
103 assert(l1.locked()); in main()
107 L1 l1; in main() local
108 std::lock(l0, l1); in main()
110 assert(l1.locked()); in main()
114 L0 l1; in main() local
115 std::lock(l0, l1); in main()
117 assert(l1.locked()); in main()
122 L2 l1; in main() local
[all …]
|
| /external/valgrind/none/tests/s390x/ |
| D | clcle.c | 13 register unsigned long l1 asm ("3") = *_l1; in clcle()
23 :"=d" (cc), "+d" (a1),"+d" (l1), "+d" (a3), "+d" (l3) in clcle()
28 *_l1 = l1; in clcle()
37 unsigned long a1,a3,l1,l3; in testrun() local
40 a1 = (unsigned long) _a1; l1 = _l1; a3 = (unsigned long) _a3; l3 = _l3; in testrun()
41 cc = clcle(&a1, &l1, &a3, &l3, pad); in testrun()
43 cc, l1, _l1, l3, _l3, a1-(unsigned long) _a1, a3-(unsigned long) _a3); in testrun()
47 void multiplex(unsigned long l1, unsigned long l3, char pad) in multiplex() argument
49 testrun(b1, l1, b1, l3, pad); in multiplex()
50 testrun(b1, l1, b2, l3, pad); in multiplex()
[all …]
|
| /external/apache-harmony/beans/src/test/java/org/apache/harmony/beans/tests/java/beans/ |
| D | PropertyChangeSupportTest.java | 75 PropertyChangeListener l1 = new MockPropertyChangeListener(); in testAddPropertyChangeListener_PropertyChangeListener_Normal() local
82 sup.addPropertyChangeListener(l1); in testAddPropertyChangeListener_PropertyChangeListener_Normal()
85 assertSame(l1, sup.getPropertyChangeListeners()[0]); in testAddPropertyChangeListener_PropertyChangeListener_Normal()
87 sup.removePropertyChangeListener(l1); in testAddPropertyChangeListener_PropertyChangeListener_Normal()
128 PropertyChangeListener l1 = new MockPropertyChangeListener(); in testAddPropertyChangeListener_PropertyChangeListener_Duplicate() local
130 sup.addPropertyChangeListener(l1); in testAddPropertyChangeListener_PropertyChangeListener_Duplicate()
131 sup.addPropertyChangeListener(l1); in testAddPropertyChangeListener_PropertyChangeListener_Duplicate()
135 assertSame(l1, listeners[0]); in testAddPropertyChangeListener_PropertyChangeListener_Duplicate()
136 assertSame(l1, listeners[1]); in testAddPropertyChangeListener_PropertyChangeListener_Duplicate()
146 PropertyChangeListener l1 = new MockPropertyChangeListener(); in testAddPropertyChangeListener_PropertyChangeListener_String_Normal() local
[all …]
|
| /external/llvm/test/Transforms/LoopUnroll/ |
| D | basic.ll | 7 ; CHECK: store i8* blockaddress(@test1, %l1), i8** %P
8 ; CHECK: l1:
13 store i8* blockaddress(@test1, %l1), i8** %P
14 br label %l1
16 l1: ; preds = %l1, %entry
17 %x.0 = phi i32 [ 0, %entry ], [ %inc, %l1 ]
20 br i1 %exitcond, label %l2, label %l1
22 l2: ; preds = %l1
31 br label %l1
33 l1: ; preds = %l1, %entry
[all …]
|
| /external/boringssl/src/decrepit/ |
| D | macros.h | 62 #define n2ln(c, l1, l2, n) \ argument
65 l1 = l2 = 0; \
76 l1 = ((unsigned long)(*(--(c)))); \
78 l1 |= ((unsigned long)(*(--(c)))) << 8; \
80 l1 |= ((unsigned long)(*(--(c)))) << 16; \
82 l1 |= ((unsigned long)(*(--(c)))) << 24; \
87 #define l2nn(l1, l2, c, n) \ argument
100 *(--(c)) = (unsigned char)(((l1)) & 0xff); \
102 *(--(c)) = (unsigned char)(((l1) >> 8) & 0xff); \
104 *(--(c)) = (unsigned char)(((l1) >> 16) & 0xff); \
[all …]
|
| /external/compiler-rt/lib/dfsan/ |
| D | dfsan.cc | 129 static atomic_dfsan_label *union_table(dfsan_label l1, dfsan_label l2) { in union_table() argument
130 return &(*(dfsan_union_table_t *) UnionTableAddr())[l1][l2]; in union_table()
144 dfsan_label __dfsan_union(dfsan_label l1, dfsan_label l2) { in __dfsan_union() argument
145 DCHECK_NE(l1, l2); in __dfsan_union()
147 if (l1 == 0) in __dfsan_union()
150 return l1; in __dfsan_union()
152 if (l1 > l2) in __dfsan_union()
153 Swap(l1, l2); in __dfsan_union()
155 atomic_dfsan_label *table_ent = union_table(l1, l2); in __dfsan_union()
167 if (__dfsan_label_info[l2].l1 == l1 || in __dfsan_union()
[all …]
|
| /external/clang/test/CXX/expr/expr.prim/expr.prim.lambda/ |
| D | default-arguments.cpp | 4 auto l1 = [](int i, int j = 17, int k = 18) { return i + j + k; }; in defargs() local
5 int i1 = l1(1); in defargs()
6 int i2 = l1(1, 2); in defargs()
7 int i3 = l1(1, 2, 3); in defargs()
12 auto l1 = [](int i, in defargs_errors() local
36 …auto l1 = [](const T& value = T()) { }; // expected-error{{no matching constructor for initializa… in defargs_in_template_unused() local
37 l1(t); in defargs_in_template_unused()
45 …auto l1 = [](const T& value = T()) { }; // expected-error{{no matching constructor for initializat… in defargs_in_template_used() local
48 l1(); // expected-error{{no matching function for call to object of type '(lambda at }} in defargs_in_template_used()
|
| /external/libvorbis/lib/ |
| D | smallft.c | 43 int k1, l1, l2, ib; in drfti1() local
80 l1=1; in drfti1()
87 l2=l1*ip; in drfti1()
92 ld+=l1; in drfti1()
104 l1=l2; in drfti1()
114 static void dradf2(int ido,int l1,float *cc,float *ch,float *wa1){ in dradf2() argument
120 t0=(t2=l1*ido); in dradf2()
122 for(k=0;k<l1;k++){ in dradf2()
134 for(k=0;k<l1;k++){ in dradf2()
160 for(k=0;k<l1;k++){ in dradf2()
[all …]
|
| /external/speex/libspeex/ |
| D | smallft.c | 45 int k1, l1, l2, ib; in drfti1() local
82 l1=1; in drfti1()
89 l2=l1*ip; in drfti1()
94 ld+=l1; in drfti1()
106 l1=l2; in drfti1()
116 static void dradf2(int ido,int l1,float *cc,float *ch,float *wa1){ in dradf2() argument
122 t0=(t2=l1*ido); in dradf2()
124 for(k=0;k<l1;k++){ in dradf2()
136 for(k=0;k<l1;k++){ in dradf2()
162 for(k=0;k<l1;k++){ in dradf2()
[all …]
|
| /external/llvm/test/Transforms/LICM/ |
| D | alias-set-tracker-loss.ll | 11 br label %l1
13 l2.l1.loopexit_crit_edge:
14 br label %l1.loopexit
16 l1.loopexit:
17 br label %l1.backedge
19 l1:
20 br i1 undef, label %l1.backedge, label %l2.preheader
22 l1.backedge:
23 br label %l1
26 br i1 true, label %l1.loopexit, label %l3.preheader.lr.ph
[all …]
|