/external/llvm/test/MC/ARM/ |
H A D | cmp-immediate-fixup-error.s | 4 cmp r0, #(l1 - unknownLabel + 4) >> 2 7 l1: label
|
H A D | cmp-immediate-fixup-error2.s | 4 cmp r0, #(l1 - unknownLabel) 7 l1: label
|
H A D | cmp-immediate-fixup.s | 7 cmp r2, #(l2 - l1 + 4) >> 2 8 l1: label
|
H A D | cmp-immediate-fixup2.s | 7 cmp r2, #(l2 - l1) 8 l1: label
|
/external/libcxx/test/std/containers/sequences/list/list.modifiers/ |
H A D | push_back_rvalue.pass.cpp | 24 std::list<MoveOnly> l1; local 25 l1.push_back(MoveOnly(1)); 26 assert(l1.size() == 1); 27 assert(l1.front() == MoveOnly(1)); 28 l1.push_back(MoveOnly(2)); 29 assert(l1.size() == 2); 30 assert(l1.front() == MoveOnly(1)); 31 assert(l1.back() == MoveOnly(2)); 35 std::list<MoveOnly, min_allocator<MoveOnly>> l1; local 36 l1 [all...] |
H A D | push_front_rvalue.pass.cpp | 24 std::list<MoveOnly> l1; local 25 l1.push_front(MoveOnly(1)); 26 assert(l1.size() == 1); 27 assert(l1.front() == MoveOnly(1)); 28 l1.push_front(MoveOnly(2)); 29 assert(l1.size() == 2); 30 assert(l1.front() == MoveOnly(2)); 31 assert(l1.back() == MoveOnly(1)); 35 std::list<MoveOnly, min_allocator<MoveOnly>> l1; local 36 l1 [all...] |
H A D | insert_iter_rvalue.pass.cpp | 28 std::list<MoveOnly> l1; local 29 l1.insert(l1.cend(), MoveOnly(1)); 30 assert(l1.size() == 1); 31 assert(l1.front() == MoveOnly(1)); 32 l1.insert(l1.cbegin(), MoveOnly(2)); 33 assert(l1.size() == 2); 34 assert(l1.front() == MoveOnly(2)); 35 assert(l1 49 std::list<MoveOnly, min_allocator<MoveOnly>> l1; local [all...] |
H A D | 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 118 std::list<int, min_allocator<int>> l1; local [all...] |
/external/llvm/test/MC/AArch64/ |
H A D | optional-hash.s | 16 l1: label
|
/external/libcxx/test/std/containers/sequences/list/list.cons/ |
H A D | move.pass.cpp | 66 std::list<int> l1 = {1, 2, 3}; local 67 std::list<int>::iterator i = l1.begin(); 68 std::list<int> l2 = std::move(l1);
|
/external/llvm/test/MC/ELF/ |
H A D | subsection.s | 20 l1: label 23 .subsection l2-l1 24 .byte l1-l0
|
/external/clang/test/CodeGen/ |
H A D | le32-libcall-pow.c | 18 double l1 = pow(a1, a1); local
|
/external/clang/test/Sema/ |
H A D | attr-used.c | 4 __private_extern__ int l1 __attribute__((used)); // expected-warning {{'used' attribute ignored}} variable
|
/external/libcxx/test/std/containers/sequences/list/list.ops/ |
H A D | splice_pos_list.pass.cpp | 28 std::list<int> l1; local 30 l1.splice(l1.end(), l2); 31 assert(l1.size() == 0); 32 assert(distance(l1.begin(), l1.end()) == 0); 37 std::list<int> l1; local 39 l1.splice(l1.end(), l2); 40 assert(l1 48 std::list<int> l1; local 61 std::list<int> l1; local 416 std::list<int, min_allocator<int>> l1; local 425 std::list<int, min_allocator<int>> l1; local 436 std::list<int, min_allocator<int>> l1; local 449 std::list<int, min_allocator<int>> l1; local [all...] |
H A D | splice_pos_list_iter.pass.cpp | 28 std::list<int> l1; local 30 l1.splice(l1.end(), l2, l2.begin()); 31 assert(l1.size() == 1); 32 assert(distance(l1.begin(), l1.end()) == 1); 35 std::list<int>::const_iterator i = l1.begin(); 39 std::list<int> l1; local 41 l1.splice(l1 52 std::list<int> l1; local 65 std::list<int> l1; local 80 std::list<int> l1; local 95 std::list<int> l1; local 165 l1.splice(next(l1.begin()), l1, l1.begin()); local 175 l1.splice(next(l1.begin()), l1, next(l1.begin())); local 193 std::list<int, min_allocator<int>> l1; local 204 std::list<int, min_allocator<int>> l1; local 217 std::list<int, min_allocator<int>> l1; local 230 std::list<int, min_allocator<int>> l1; local 245 std::list<int, min_allocator<int>> l1; local 260 std::list<int, min_allocator<int>> l1; local 330 l1.splice(next(l1.begin()), l1, l1.begin()); local 340 l1.splice(next(l1.begin()), l1, next(l1.begin())); local [all...] |
/external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.attr.depend/ |
H A D | p1.cpp | 28 auto l1 = [](int n [[carries_dependency]]) {}; variable
|
/external/clang/test/CodeGenCXX/ |
H A D | exceptions-seh-filter-captures.cpp | 9 int l1 = 13; local 13 } __except(basic_filter(p1, l1, s1)) { 29 // CHECK: %[[l1:[^ ]*]] = load i32, i32* %[[l1_ptr]] 31 // CHECK: call i32 (i32, ...) @basic_filter(i32 %[[p1]], i32 %[[l1]], i32 %[[s1]]) 39 int l1 = 13; local 42 } __except(basic_filter(l1)) { 55 // CHECK: %[[l1:[^ ]*]] = load i32, i32* %[[l1_ptr]] 56 // CHECK: call i32 (i32, ...) @basic_filter(i32 %[[l1]]) 59 int l1 = 13; local 65 // FIXME: Test 'l1' whe [all...] |
/external/clang/test/CXX/expr/expr.prim/expr.prim.lambda/ |
H A D | default-arguments.cpp | 4 auto l1 = [](int i, int j = 17, int k = 18) { return i + j + k; }; local 5 int i1 = l1(1); 6 int i2 = l1(1, 2); 7 int i3 = l1(1, 2, 3); 12 auto l1 = [](int i, local 35 auto l1 = [](const T& value = T()) { }; local 36 l1(t); 44 auto l1 = [](const T& value = T()) { }; // expected-error{{no matching constructor for initialization of 'NoDefaultCtor'}} local 45 l1(); // expected-note{{in instantiation of default function argument expression for 'operator()<NoDefaultCtor>' required here}}
|
/external/compiler-rt/include/sanitizer/ |
H A D | dfsan_interface.h | 34 dfsan_label l1; member in struct:dfsan_label_info 45 /// Computes the union of \c l1 and \c l2, possibly creating a union label in 47 dfsan_label dfsan_union(dfsan_label l1, dfsan_label l2);
|
/external/compiler-rt/lib/dfsan/ |
H A D | dfsan.h | 24 dfsan_label l1; member in struct:dfsan_label_info 34 dfsan_label dfsan_union(dfsan_label l1, dfsan_label l2);
|
/external/eigen/test/ |
H A D | product_large.cpp | 41 std::ptrdiff_t l1 = internal::random<int>(10000,20000); local 43 setCpuCacheSizes(l1,l2); 44 VERIFY(l1==l1CacheSize());
|
/external/libcxx/test/std/thread/thread.mutex/thread.lock.algorithm/ |
H A D | lock.pass.cpp | 93 L0 l1; local 94 std::lock(l0, l1); 96 assert(l1.locked()); 100 L1 l1; local 101 std::lock(l0, l1); 103 assert(l1.locked()); 107 L0 l1; local 108 std::lock(l0, l1); 110 assert(l1.locked()); 114 L2 l1; local 128 L0 l1; local 142 L2 l1; local 156 L1 l1; local 170 L2 l1; local 185 L0 l1; local 194 L2 l1; local 210 L0 l1; local 219 L1 l1; local 228 L0 l1; local 237 L0 l1; local 253 L2 l1; local 269 L0 l1; local 285 L2 l1; local 301 L0 l1; local 317 L2 l1; local 333 L2 l1; local 349 L1 l1; local 365 L2 l1; local 381 L0 l1; local 392 L0 l1; local 403 L0 l1; local 414 L1 l1; local 425 L0 l1; local 436 L0 l1; local 454 L0 l1; local 472 L2 l1; local 490 L0 l1; local [all...] |
H A D | try_lock.pass.cpp | 78 L0 l1; local 79 assert(std::try_lock(l0, l1) == -1); 81 assert(l1.locked()); 85 L1 l1; local 86 assert(std::try_lock(l0, l1) == 1); 88 assert(!l1.locked()); 92 L0 l1; local 93 assert(std::try_lock(l0, l1) == 0); 95 assert(!l1.locked()); 99 L2 l1; local 113 L0 l1; local 128 L0 l1; local 137 L1 l1; local 146 L2 l1; local 162 L1 l1; local 171 L0 l1; local 180 L1 l1; local 189 L0 l1; local 198 L0 l1; local 214 L2 l1; local 230 L0 l1; local 246 L1 l1; local 255 L0 l1; local 264 L1 l1; local 273 L1 l1; local 282 L2 l1; local 291 L1 l1; local 307 L2 l1; local 323 L0 l1; local 339 L2 l1; local 355 L2 l1; local 371 L1 l1; local 387 L2 l1; local 396 L2 l1; local 412 L0 l1; local 421 L2 l1; local 430 L0 l1; local 446 L1 l1; local 462 L0 l1; local 473 L0 l1; local 484 L1 l1; local 495 L0 l1; local 506 L0 l1; local [all...] |
/external/compiler-rt/lib/tsan/tests/rtl/ |
H A D | tsan_mop.cc | 27 MemLoc l1, l2; local 28 t1.Write1(l1);
|
/external/eigen/bench/ |
H A D | check_cache_queries.cpp | 22 int l1, l2, l3; local 23 internal::queryCacheSizes(l1, l2, l3); 24 cout << "Eigen's L1, L2, L3 = " << l1 << " " << l2 << " " << l3 << endl; 43 internal::queryCacheSizes_intel_codes(l1, l2, l3); 44 cout << "Eigen's intel codes L1, L2, L3 = " << l1 << " " << l2 << " " << l3 << endl; 47 internal::queryCacheSizes_intel_direct(l1, l2, l3); 48 cout << "Eigen's intel direct L1, L2, L3 = " << l1 << " " << l2 << " " << l3 << endl; 50 internal::queryCacheSizes_amd(l1, l2, l3); 51 cout << "Eigen's amd L1, L2, L3 = " << l1 << " " << l2 << " " << l3 << endl; 57 l1 [all...] |