/external/libcxx/test/std/experimental/memory/memory.polymorphic.allocator.class/memory.polymorphic.allocator.eq/ |
equal.pass.cpp | 33 typedef ex::polymorphic_allocator<int> A2; 37 A2 const a2; local 38 static_assert(std::is_same<decltype(a1 == a2), bool>::value, ""); 39 static_assert(noexcept(a1 == a2), ""); 46 A1 const a2(&d2); 48 assert(a1 == a2); 54 assert(a2 == a1); 62 A1 const a2(&d1); 64 assert(a1 == a2); [all...] |
not_equal.pass.cpp | 33 typedef ex::polymorphic_allocator<int> A2; 37 A2 const a2; local 38 static_assert(std::is_same<decltype(a1 != a2), bool>::value, ""); 39 static_assert(noexcept(a1 != a2), ""); 46 A1 const a2(&d2); 48 assert(a1 != a2); 54 assert(a2 != a1); 62 A1 const a2(&d1); 64 assert(!(a1 != a2)); [all...] |
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/experimental/memory/memory.polymorphic.allocator.class/memory.polymorphic.allocator.eq/ |
equal.pass.cpp | 33 typedef ex::polymorphic_allocator<int> A2; 37 A2 const a2; local 38 static_assert(std::is_same<decltype(a1 == a2), bool>::value, ""); 39 static_assert(noexcept(a1 == a2), ""); 46 A1 const a2(&d2); 48 assert(a1 == a2); 54 assert(a2 == a1); 62 A1 const a2(&d1); 64 assert(a1 == a2); [all...] |
not_equal.pass.cpp | 33 typedef ex::polymorphic_allocator<int> A2; 37 A2 const a2; local 38 static_assert(std::is_same<decltype(a1 != a2), bool>::value, ""); 39 static_assert(noexcept(a1 != a2), ""); 46 A1 const a2(&d2); 48 assert(a1 != a2); 54 assert(a2 != a1); 62 A1 const a2(&d1); 64 assert(!(a1 != a2)); [all...] |
/external/libcxx/test/std/containers/sequences/list/list.ops/ |
remove.pass.cpp | 39 int a2[] = {1, 2, 4}; local 42 assert(c == std::list<int>(a2, a2 + 3)); 46 int a2[] = {2, 3, 5, 8, 11}; local 49 assert(c == std::list<int>(a2, a2 + 5)); 53 int a2[] = {2, 3, 5, 8, 11}; local 59 for (int *ip = a2; ip < a2 + 5; ++ip, ++it) { 69 int a2[] = {1, 2, 4} local 77 int a2[] = {1, 2, 4}; local [all...] |
sort_comp.pass.cpp | 43 int a2[] = {11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; local 46 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0]))); 73 int a2[] = {11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; local 76 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0])))) [all...] |
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.ops/ |
remove.pass.cpp | 39 int a2[] = {1, 2, 4}; local 42 assert(c == std::list<int>(a2, a2 + 3)); 46 int a2[] = {2, 3, 5, 8, 11}; local 49 assert(c == std::list<int>(a2, a2 + 5)); 53 int a2[] = {2, 3, 5, 8, 11}; local 59 for (int *ip = a2; ip < a2 + 5; ++ip, ++it) { 69 int a2[] = {1, 2, 4} local 77 int a2[] = {1, 2, 4}; local [all...] |
/art/runtime/interpreter/mterp/mips/ |
op_cmp_long.S | 15 and a2, a0, 255 # a2 <- BB 17 EAS2(a2, rFP, a2) # a2 <- &fp[BB] 19 LOAD64(a0, a1, a2) # a0/a1 <- vBB/vBB+1 20 LOAD64(a2, a3, a3) # a2/a3 <- vCC/vCC+1 28 sltu t0, a0, a2 # compare lo 29 sgtu t1, a0, a2 [all...] |
op_const_string_jumbo.S | 4 FETCH(a2, 2) # a2 <- BBBB (high) 6 INSERT_HIGH_HALF(a0, a2) # a0 <- BBBBbbbb 7 addu a2, rFP, OFF_FP_SHADOWFRAME # a2 <- shadow frame
|
op_iput.S | 13 GET_OPA4(a2) # a2 <- A+ 14 GET_VREG(a2, a2) # a2 <- fp[A]
|
op_iput_wide.S | 7 GET_OPA4(a2) # a2 <- A+ 8 EAS2(a2, rFP, a2) # a2 <- &fp[A]
|
/art/runtime/interpreter/mterp/mips64/ |
op_aput_wide.S | 6 lbu a2, 2(rPC) # a2 <- BB 9 GET_VREG_U a0, a2 # a0 <- vBB (array object) 15 GET_VREG_WIDE a2, a4 # a2 <- vAA 18 sw a2, MIRROR_WIDE_ARRAY_DATA_OFFSET(a0) 19 dsrl32 a2, a2, 0 20 sw a2, (MIRROR_WIDE_ARRAY_DATA_OFFSET+4)(a0) # vBB[vCC] <- a2 [all...] |
op_iput_wide_quick.S | 2 srl a2, rINST, 12 # a2 <- B 4 GET_VREG_U a2, a2 # a2 <- fp[B], the object pointer 6 beqz a2, common_errNullObject # object was null 9 daddu a1, a2, a3 # create a direct pointer
|
op_cmp_long.S | 2 lbu a2, 2(rPC) # a2 <- BB 5 GET_VREG_WIDE a0, a2 # a0 <- vBB 8 slt a2, a0, a1 10 subu a0, a0, a2
|
op_iput.S | 13 ext a2, rINST, 8, 4 # a2 <- A 14 GET_VREG a2, a2 # a2 <- fp[A]
|
op_iput_wide.S | 7 ext a2, rINST, 8, 4 # a2 <- A 8 dlsa a2, a2, rFP, 2 # a2 <- &fp[A]
|
op_sget.S | 12 move a2, rSELF 15 srl a2, rINST, 8 # a2 <- AA 20 SET_VREG_OBJECT v0, a2 # fp[AA] <- v0 22 SET_VREG v0, a2 # fp[AA] <- v0
|
/external/libcxx/test/std/experimental/memory/memory.polymorphic.allocator.class/memory.polymorphic.allocator.ctor/ |
copy.pass.cpp | 38 A1 const a2(a); 39 assert(a.resource() == a2.resource()); 44 A1 a2(std::move(a)); 45 assert(a.resource() == a2.resource()); 46 assert(a2.resource() == (ex::memory_resource*)42);
|
/external/webrtc/talk/media/webrtc/ |
webrtccommon.h | 43 #define LOG_RTCERR2(func, a1, a2) \ 44 LOG_RTCERR2_EX(func, a1, a2, GetLastEngineError()) 45 #define LOG_RTCERR3(func, a1, a2, a3) \ 46 LOG_RTCERR3_EX(func, a1, a2, a3, GetLastEngineError()) 47 #define LOG_RTCERR4(func, a1, a2, a3, a4) \ 48 LOG_RTCERR4_EX(func, a1, a2, a3, a4, GetLastEngineError()) 49 #define LOG_RTCERR5(func, a1, a2, a3, a4, a5) \ 50 LOG_RTCERR5_EX(func, a1, a2, a3, a4, a5, GetLastEngineError()) 51 #define LOG_RTCERR6(func, a1, a2, a3, a4, a5, a6) \ 52 LOG_RTCERR6_EX(func, a1, a2, a3, a4, a5, a6, GetLastEngineError() [all...] |
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/experimental/memory/memory.polymorphic.allocator.class/memory.polymorphic.allocator.ctor/ |
copy.pass.cpp | 38 A1 const a2(a); 39 assert(a.resource() == a2.resource()); 44 A1 a2(std::move(a)); 45 assert(a.resource() == a2.resource()); 46 assert(a2.resource() == (ex::memory_resource*)42);
|
/tools/apksig/src/main/java/com/android/apksig/internal/apk/v1/ |
DigestAlgorithm.java | 49 public int compare(DigestAlgorithm a1, DigestAlgorithm a2) { 52 switch (a2) { 58 throw new RuntimeException("Unsupported algorithm: " + a2); 61 switch (a2) { 67 throw new RuntimeException("Unsupported algorithm: " + a2);
|
/external/libcxx/test/std/containers/sequences/deque/deque.special/ |
swap.pass.cpp | 66 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local 69 std::deque<int, A> c2(a2, a2+sizeof(a2)/sizeof(a2[0]), A(1, 2)); 71 assert((c1 == std::deque<int, A>(a2, a2+sizeof(a2)/sizeof(a2[0])))); 78 int a2[] = {0, 2, 4, 5, 6, 8, 11} local 99 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local [all...] |
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.special/ |
swap.pass.cpp | 66 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local 69 std::deque<int, A> c2(a2, a2+sizeof(a2)/sizeof(a2[0]), A(1, 2)); 71 assert((c1 == std::deque<int, A>(a2, a2+sizeof(a2)/sizeof(a2[0])))); 78 int a2[] = {0, 2, 4, 5, 6, 8, 11} local 99 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local [all...] |
/toolchain/binutils/binutils-2.27/gas/testsuite/gas/mips/ |
vr4120-2.d | 8 .* <[^>]*> macc a0,a1,a2 12 .* <[^>]*> dmacc a0,a1,a2 16 .* <[^>]*> macc a0,a1,a2 20 .* <[^>]*> dmacc a0,a1,a2 24 .* <[^>]*> macc a0,a1,a2 28 .* <[^>]*> dmacc a0,a1,a2 32 .* <[^>]*> macc a0,a1,a2 36 .* <[^>]*> dmacc a0,a1,a2 42 .* <[^>]*> dmult a2,a3 46 .* <[^>]*> dmultu a2,a [all...] |
/toolchain/binutils/binutils-2.27/gas/testsuite/gas/mn10300/ |
mov2.s | 6 mov (a2),a1 7 mov (8,a2),a1 8 mov (256,a2),a1 9 mov (131071,a2),a1 13 mov (d1,a1),a2
|