| /minix/external/bsd/libc++/dist/libcxx/test/containers/sequences/list/list.modifiers/ |
| H A D | erase_iter_db2.pass.cpp | 30 std::list<int> l2(a1, a1+3); in main() local
31 std::list<int>::const_iterator i = l2.begin(); in main()
39 std::list<int, min_allocator<int>> l2(a1, a1+3); in main() local
40 std::list<int, min_allocator<int>>::const_iterator i = l2.begin(); in main()
|
| H A D | erase_iter_iter_db2.pass.cpp | 30 std::list<int> l2(a1, a1+3); in main() local
31 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin())); in main()
38 std::list<int, min_allocator<int>> l2(a1, a1+3); in main() local
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin())); in main()
|
| H A D | erase_iter_iter_db1.pass.cpp | 30 std::list<int> l2(a1, a1+3); in main() local
31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin())); in main()
38 std::list<int, min_allocator<int>> l2(a1, a1+3); in main() local
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin())); in main()
|
| /minix/external/bsd/libc++/dist/libcxx/test/containers/sequences/vector/vector.modifiers/ |
| H A D | erase_iter_db2.pass.cpp | 30 std::vector<int> l2(a1, a1+3); in main() local
31 std::vector<int>::const_iterator i = l2.begin(); in main()
39 std::vector<int, min_allocator<int>> l2(a1, a1+3); in main() local
40 std::vector<int, min_allocator<int>>::const_iterator i = l2.begin(); in main()
|
| H A D | erase_iter_iter_db1.pass.cpp | 30 std::vector<int> l2(a1, a1+3); in main() local
31 std::vector<int>::iterator i = l1.erase(l2.cbegin(), l1.cbegin()+1); in main()
38 std::vector<int, min_allocator<int>> l2(a1, a1+3); in main() local
39 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), l1.cbegin()+1); in main()
|
| H A D | erase_iter_iter_db2.pass.cpp | 30 std::vector<int> l2(a1, a1+3); in main() local
31 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l2.cbegin()+1); in main()
38 std::vector<int, min_allocator<int>> l2(a1, a1+3); in main() local
39 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), l2.cbegin()+1); in main()
|
| /minix/external/bsd/libc++/dist/libcxx/test/std/containers/sequences/list/list.modifiers/ |
| H A D | erase_iter_iter_db1.pass.cpp | 30 std::list<int> l2(a1, a1+3); in main() local
31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin())); in main()
38 std::list<int, min_allocator<int>> l2(a1, a1+3); in main() local
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin())); in main()
|
| H A D | erase_iter_iter_db2.pass.cpp | 30 std::list<int> l2(a1, a1+3); in main() local
31 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin())); in main()
38 std::list<int, min_allocator<int>> l2(a1, a1+3); in main() local
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin())); in main()
|
| /minix/external/bsd/libc++/dist/libcxx/test/std/containers/sequences/vector/vector.modifiers/ |
| H A D | erase_iter_iter_db1.pass.cpp | 30 std::vector<int> l2(a1, a1+3); in main() local
31 std::vector<int>::iterator i = l1.erase(l2.cbegin(), l1.cbegin()+1); in main()
38 std::vector<int, min_allocator<int>> l2(a1, a1+3); in main() local
39 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), l1.cbegin()+1); in main()
|
| H A D | erase_iter_iter_db2.pass.cpp | 30 std::vector<int> l2(a1, a1+3); in main() local
31 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l2.cbegin()+1); in main()
38 std::vector<int, min_allocator<int>> l2(a1, a1+3); in main() local
39 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), l2.cbegin()+1); in main()
|
| /minix/external/bsd/llvm/dist/llvm/test/CodeGen/X86/ |
| H A D | pr11202.ll | 3 @bb = constant [1 x i8*] [i8* blockaddress(@main, %l2)]
9 l1: ; preds = %l2, %entry
11 br label %l2
13 l2: ; preds = %l1
|
| /minix/lib/libc/stdlib/ |
| H A D | merge.c | 144 l2 = list1; in mergesort()
148 f1 = l2; in mergesort()
152 l2 = list1 + (p2 - list2); in mergesort()
153 while (f1 < l1 && f2 < l2) { in mergesort()
160 b = f2, t = l2; in mergesort()
227 if (f2 < l2) { in mergesort()
229 ICOPY_LIST(f2, tp2, l2); in mergesort()
231 CCOPY_LIST(f2, tp2, l2); in mergesort()
238 *p1 = l2; in mergesort()
285 u_char *f1, *f2, *s, *l2, *last, *p2; in setup() local
[all …]
|
| /minix/crypto/external/bsd/heimdal/dist/lib/wind/ |
| H A D | gen-punycode-examples.py | 59 l2 = f.readline() variable
60 if not l2:
62 l2 = re.sub('^ *', '', l2) variable
63 l = l[:-2] + l2
|
| /minix/crypto/external/bsd/openssl/dist/crypto/aes/asm/ |
| H A D | aes-sparcv9.pl | 49 $acc8="%l2";
548 sll %l2,8,%l2
552 or %l3,%l2,%l2
570 sll %l2,8,%l2
574 or %l3,%l2,%l2
593 srl %o0,8,%l2
609 srl %o2,8,%l2
1094 sll %l2,8,%l2
1098 or %l3,%l2,%l2
1116 sll %l2,8,%l2
[all …]
|
| /minix/external/bsd/libc++/dist/libcxx/test/std/containers/unord/unord.multiset/ |
| H A D | erase_iter_iter_db3.pass.cpp | 28 std::unordered_multiset<int> l2(a1, a1+3); in main() local
29 std::unordered_multiset<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin())); in main()
|
| /minix/external/bsd/libc++/dist/libcxx/test/std/containers/unord/unord.set/ |
| H A D | erase_iter_iter_db3.pass.cpp | 28 std::unordered_set<int> l2(a1, a1+3); in main() local
29 std::unordered_set<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin())); in main()
|
| /minix/external/bsd/libc++/dist/libcxx/test/containers/unord/unord.set/ |
| H A D | erase_iter_iter_db3.pass.cpp | 28 std::unordered_set<int> l2(a1, a1+3); in main() local
29 std::unordered_set<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin())); in main()
|
| /minix/external/bsd/libc++/dist/libcxx/test/containers/unord/unord.multiset/ |
| H A D | erase_iter_iter_db3.pass.cpp | 28 std::unordered_multiset<int> l2(a1, a1+3); in main() local
29 std::unordered_multiset<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin())); in main()
|
| /minix/external/bsd/llvm/dist/llvm/test/Integer/ |
| H A D | BitPacked.ll | 14 %l2 = load <2 x i10>* @foo2
15 %r1 = extractelement <2 x i10> %l2, i32 1
16 %r2 = extractelement <2 x i10> %l2, i32 0
18 %r3 = insertelement <2 x i10> %l2, i10 %t, i32 0
|
| /minix/crypto/external/bsd/openssl/lib/libcrypto/arch/sparc/ |
| H A D | sparcv9-mont.S | 19 ld [%i2],%l2 ! bp[0]
51 mulx %l5,%l2,%g4
104 mulx %o0,%l2,%o0
122 mulx %l5,%l2,%g4
211 mulx %l2,%l2,%o0 ! ap[0]*ap[0]
231 mulx %l5,%l2,%g4
295 mulx %l2,%l2,%o0
316 mulx %l5,%l2,%o3
339 mulx %l5,%l2,%o3
370 mulx %l2,%l2,%o0
[all …]
|
| /minix/crypto/external/bsd/openssl/lib/libcrypto/arch/sparc64/ |
| H A D | sparcv9-mont.S | 19 ld [%i2],%l2 ! bp[0]
51 mulx %l5,%l2,%g4
104 mulx %o0,%l2,%o0
122 mulx %l5,%l2,%g4
211 mulx %l2,%l2,%o0 ! ap[0]*ap[0]
231 mulx %l5,%l2,%g4
295 mulx %l2,%l2,%o0
316 mulx %l5,%l2,%o3
339 mulx %l5,%l2,%o3
370 mulx %l2,%l2,%o0
[all …]
|
| /minix/external/bsd/libc++/dist/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/ |
| H A D | erase_iter_iter_db3.pass.cpp | 29 std::unordered_map<int, int> l2(a1, a1+3); in main() local
30 std::unordered_map<int, int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin())); in main()
|
| /minix/external/bsd/libc++/dist/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| H A D | erase_iter_iter_db3.pass.cpp | 29 std::unordered_multimap<int, int> l2(a1, a1+3); in main() local
30 std::unordered_multimap<int, int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin())); in main()
|
| /minix/external/bsd/libc++/dist/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/ |
| H A D | erase_iter_iter_db3.pass.cpp | 29 std::unordered_map<int, int> l2(a1, a1+3); in main() local
30 std::unordered_map<int, int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin())); in main()
|
| /minix/external/bsd/libc++/dist/libcxx/test/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| H A D | erase_iter_iter_db3.pass.cpp | 29 std::unordered_multimap<int, int> l2(a1, a1+3); in main() local
30 std::unordered_multimap<int, int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin())); in main()
|