| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/mips/ |
| elf-rel13-mips16.s | 5 lw $4,%got(l1)($2)
9 lw $4,%got(l1+0x400)($2)
10 addiu $4,%lo(l1)
11 addiu $4,%lo(l1+0x400)
18 l1: .word 1 label
|
| elf-rel13.s | 3 lw $4,%got(l1)($gp)
7 lw $4,%got(l1+0x400)($gp)
8 addiu $4,$4,%lo(l1)
9 addiu $4,$4,%lo(l1+0x400)
16 l1: .word 1 label
|
| /external/boringssl/src/decrepit/ |
| macros.h | 62 #define n2ln(c, l1, l2, n) \
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) \
100 *(--(c)) = (unsigned char)(((l1)) & 0xff); \
102 *(--(c)) = (unsigned char)(((l1) >> 8) & 0xff); \
104 *(--(c)) = (unsigned char)(((l1) >> 16) & 0xff);
[all...] |
| /external/libcxx/test/std/containers/sequences/list/list.modifiers/ |
| erase_iter_iter_db1.pass.cpp | 29 std::list<int> l1(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 29 std::list<int> l1(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| insert_iter_iter_iter.pass.cpp | 49 std::list<int> l1; local
50 std::list<int>::iterator i = l1.insert(l1.begin(), a1, a1+3);
51 assert(i == l1.begin());
52 assert(l1.size() == 3);
53 assert(distance(l1.begin(), l1.end()) == 3);
54 i = l1.begin();
61 i = l1.insert(i, a2, a2+3);
63 assert(l1.size() == 6)
118 std::list<int, min_allocator<int>> l1; local
[all...] |
| /external/libcxx/test/std/containers/sequences/vector/vector.modifiers/ |
| erase_iter_iter_db1.pass.cpp | 29 std::vector<int> l1(a1, a1+3);
31 std::vector<int>::iterator i = l1.erase(l2.cbegin(), l1.cbegin()+1);
37 std::vector<int, min_allocator<int>> l1(a1, a1+3);
39 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), l1.cbegin()+1);
|
| erase_iter_iter_db2.pass.cpp | 29 std::vector<int> l1(a1, a1+3);
31 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l2.cbegin()+1);
37 std::vector<int, min_allocator<int>> l1(a1, a1+3);
39 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), l2.cbegin()+1);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| erase_iter_iter_db1.pass.cpp | 29 std::list<int> l1(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 29 std::list<int> l1(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.modifiers/ |
| erase_iter_iter_db1.pass.cpp | 29 std::vector<int> l1(a1, a1+3);
31 std::vector<int>::iterator i = l1.erase(l2.cbegin(), l1.cbegin()+1);
37 std::vector<int, min_allocator<int>> l1(a1, a1+3);
39 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), l1.cbegin()+1);
|
| erase_iter_iter_db2.pass.cpp | 29 std::vector<int> l1(a1, a1+3);
31 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l2.cbegin()+1);
37 std::vector<int, min_allocator<int>> l1(a1, a1+3);
39 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), l2.cbegin()+1);
|
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/ |
| erase_iter_db1.pass.cpp | 26 std::unordered_map<int, int> l1(a1, a1+3);
27 std::unordered_map<int, int>::const_iterator i = l1.end();
28 l1.erase(i);
|
| /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| erase_iter_db1.pass.cpp | 26 std::unordered_multimap<int, int> l1(a1, a1+3);
27 std::unordered_multimap<int, int>::const_iterator i = l1.end();
28 l1.erase(i);
|
| /external/libcxx/test/std/containers/unord/unord.multiset/ |
| erase_iter_iter_db1.pass.cpp | 27 std::unordered_multiset<int> l1(a1, a1+3);
29 std::unordered_multiset<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 27 std::unordered_multiset<int> l1(a1, a1+3);
29 std::unordered_multiset<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| /external/libcxx/test/std/containers/unord/unord.set/ |
| erase_iter_iter_db1.pass.cpp | 27 std::unordered_set<int> l1(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 27 std::unordered_set<int> l1(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| /external/llvm/test/MC/ELF/ |
| subsection.s | 20 l1: label
23 .subsection l2-l1
24 .byte l1-l0
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/ |
| erase_iter_db1.pass.cpp | 26 std::unordered_map<int, int> l1(a1, a1+3);
27 std::unordered_map<int, int>::const_iterator i = l1.end();
28 l1.erase(i);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| erase_iter_db1.pass.cpp | 26 std::unordered_multimap<int, int> l1(a1, a1+3);
27 std::unordered_multimap<int, int>::const_iterator i = l1.end();
28 l1.erase(i);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| erase_iter_iter_db1.pass.cpp | 27 std::unordered_multiset<int> l1(a1, a1+3);
29 std::unordered_multiset<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 27 std::unordered_multiset<int> l1(a1, a1+3);
29 std::unordered_multiset<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| erase_iter_iter_db1.pass.cpp | 27 std::unordered_set<int> l1(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 27 std::unordered_set<int> l1(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
