/external/libcxx/test/utilities/utility/operators/ |
H A D | rel_ops.pass.cpp | 40 A a2(2); 42 assert(a1 != a2); 43 assert(a1 < a2); 44 assert(a2 > a1); 46 assert(a1 <= a2); 47 assert(a2 >= a2); 48 assert(a2 >= a1);
|
/external/clang/test/CodeGen/ |
H A D | arm64_vfma.c | 6 float32x2_t test_vfma_f32(float32x2_t a1, float32x2_t a2, float32x2_t a3) { argument 8 return vfma_f32(a1, a2, a3); 9 // CHECK: llvm.fma.v2f32({{.*a2, .*a3, .*a1}}) 13 float32x4_t test_vfmaq_f32(float32x4_t a1, float32x4_t a2, float32x4_t a3) { argument 15 return vfmaq_f32(a1, a2, a3); 16 // CHECK: llvm.fma.v4f32({{.*a2, .*a3, .*a1}}) 20 float64x2_t test_vfmaq_f64(float64x2_t a1, float64x2_t a2, float64x2_t a3) { argument 22 return vfmaq_f64(a1, a2, a3); 23 // CHECK: llvm.fma.v2f64({{.*a2, .*a3, .*a1}}) 27 float32x2_t test_vfma_lane_f32(float32x2_t a1, float32x2_t a2, float32x2_ argument 36 test_vfmaq_lane_f32(float32x4_t a1, float32x4_t a2, float32x2_t a3) argument 45 test_vfmaq_lane_f64(float64x2_t a1, float64x2_t a2, float64x1_t a3) argument 54 test_vfma_n_f32(float32x2_t a1, float32x2_t a2, float32_t a3) argument 63 test_vfmaq_n_f32(float32x4_t a1, float32x4_t a2, float32_t a3) argument 72 test_vfmaq_n_f64(float64x2_t a1, float64x2_t a2, float64_t a3) argument 81 test_vfms_f32(float32x2_t a1, float32x2_t a2, float32x2_t a3) argument 89 test_vfmsq_f32(float32x4_t a1, float32x4_t a2, float32x4_t a3) argument 97 test_vfmsq_f64(float64x2_t a1, float64x2_t a2, float64x2_t a3) argument 105 test_vfms_lane_f32(float32x2_t a1, float32x2_t a2, float32x2_t a3) argument 116 test_vfmsq_lane_f32(float32x4_t a1, float32x4_t a2, float32x2_t a3) argument 127 test_vfmsq_lane_f64(float64x2_t a1, float64x2_t a2, float64x1_t a3) argument [all...] |
H A D | mips-vector-arg.c | 11 // O32: define void @test_v4sf(i32 %a1.coerce0, i32 %a1.coerce1, i32 %a1.coerce2, i32 %a1.coerce3, i32 %a2, i32, i32 %a3.coerce0, i32 %a3.coerce1, i32 %a3.coerce2, i32 %a3.coerce3) [[NUW:#[0-9]+]] 13 // N64: define void @test_v4sf(i64 %a1.coerce0, i64 %a1.coerce1, i32 %a2, i64, i64 %a3.coerce0, i64 %a3.coerce1) [[NUW:#[0-9]+]] 16 void test_v4sf(v4sf a1, int a2, v4sf a3) { argument 17 test_v4sf_2(a3, a2, a1); 20 // O32: define void @test_v4i32(i32 %a1.coerce0, i32 %a1.coerce1, i32 %a1.coerce2, i32 %a1.coerce3, i32 %a2, i32, i32 %a3.coerce0, i32 %a3.coerce1, i32 %a3.coerce2, i32 %a3.coerce3) [[NUW]] 22 // N64: define void @test_v4i32(i64 %a1.coerce0, i64 %a1.coerce1, i32 %a2, i64, i64 %a3.coerce0, i64 %a3.coerce1) [[NUW]] 25 void test_v4i32(v4i32 a1, int a2, v4i32 a3) { argument 26 test_v4i32_2(a3, a2, a1);
|
H A D | mrtd.c | 20 void quux(int a1, int a2, int a3) { argument 21 qux(a1, a2, a3);
|
/external/chromium_org/v8/test/mjsunit/compiler/ |
H A D | array-length.js | 32 function Test(a0, a2, a5) { 34 assertEquals(2, ArrayLength(a2)); 39 var a2 = [1,2]; variable 41 for (var i = 0; i < 5; i++) Test(a0, a2, a5); 44 Test(a0, a2, a5); 46 for (var i = 0; i < 5; i++) Test(a0, a2, a5); 48 Test(a0, a2, a5);
|
/external/libcxx/test/containers/sequences/list/list.ops/ |
H A D | merge.pass.cpp | 23 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local 26 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0])); 33 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local 36 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[ [all...] |
H A D | merge_comp.pass.cpp | 24 int a2[] = {11, 8, 6, 5, 4, 2, 0}; local 27 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0])); 34 int a2[] = {11, 8, 6, 5, 4, 2, 0}; local 37 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[ [all...] |
H A D | remove_if.pass.cpp | 29 int a2[] = {3, 4}; local 32 assert(c == std::list<int>(a2, a2+2)); 37 int a2[] = {3, 4}; local 40 assert((c == std::list<int, min_allocator<int>>(a2, a2+2)));
|
H A D | unique_pred.pass.cpp | 28 int a2[] = {2, 1, 4, 3}; local 31 assert(c == std::list<int>(a2, a2+4)); 36 int a2[] = {2, 1, 4, 3}; local 39 assert((c == std::list<int, min_allocator<int>>(a2, a2+4)));
|
/external/chromium_org/v8/test/mjsunit/regress/ |
H A D | regress-crbug-162085.js | 43 var a2 = [1.3]; variable 44 grow_store(a2,1,1.4); 45 a2.length = 0; 46 grow_store(a2,0,1.5); 47 assertEquals(1.5, a2[0]); 48 assertEquals(undefined, a2[1]); 49 assertEquals(undefined, a2[2]); 50 assertEquals(undefined, a2[3]);
|
H A D | regress-crbug-349465.js | 13 var a2 = new Array(128); 15 f(a2, -2);
|
/external/clang/test/CXX/expr/ |
H A D | p8.cpp | 6 int a2[16]; variable 17 f1(a2);
|
/external/compiler-rt/test/asan/TestCases/ |
H A D | memcmp_test.cc | 11 char a2[] = {1, 2*argc, 3, 4}; local 12 int res = memcmp(a1, a2, 4 + argc); // BOOM
|
/external/libcxx/test/depr/depr.function.objects/depr.adaptors/depr.member.pointer.adaptors/ |
H A D | mem_fun1.pass.cpp | 22 short a2(int i) {return short(i+1);} function in struct:A 30 assert(std::mem_fun(&A::a2)(&a, 5) == 6);
|
H A D | mem_fun_ref1.pass.cpp | 22 short a2(int i) {return short(i+1);} function in struct:A 30 assert(std::mem_fun_ref(&A::a2)(a, 5) == 6);
|
/external/libcxx/test/numerics/numarray/valarray.nonmembers/valarray.comparison/ |
H A D | and_value_valarray.pass.cpp | 25 T a2[] = {1, 2, 3, 4, 0}; local 27 const unsigned N = sizeof(a2)/sizeof(a2[0]); 28 std::valarray<T> v2(a2, N); 36 T a2[] = {1, 2, 3, 4, 0}; local 38 const unsigned N = sizeof(a2)/sizeof(a2[0]); 39 std::valarray<T> v2(a2, N);
|
H A D | or_value_valarray.pass.cpp | 25 T a2[] = {1, 2, 3, 4, 0}; local 27 const unsigned N = sizeof(a2)/sizeof(a2[0]); 28 std::valarray<T> v2(a2, N); 36 T a2[] = {1, 2, 3, 4, 0}; local 38 const unsigned N = sizeof(a2)/sizeof(a2[0]); 39 std::valarray<T> v2(a2, N);
|
H A D | equal_value_valarray.pass.cpp | 25 T a2[] = {1, 2, 3, 4, 0}; local 27 const unsigned N = sizeof(a2)/sizeof(a2[0]); 28 std::valarray<T> v2(a2, N);
|
H A D | greater_equal_value_valarray.pass.cpp | 25 T a2[] = {1, 2, 3, 4, 0}; local 27 const unsigned N = sizeof(a2)/sizeof(a2[0]); 28 std::valarray<T> v2(a2, N);
|
H A D | greater_value_valarray.pass.cpp | 25 T a2[] = {1, 2, 3, 4, 0}; local 27 const unsigned N = sizeof(a2)/sizeof(a2[0]); 28 std::valarray<T> v2(a2, N);
|
H A D | less_equal_value_valarray.pass.cpp | 25 T a2[] = {1, 2, 3, 4, 0}; local 27 const unsigned N = sizeof(a2)/sizeof(a2[0]); 28 std::valarray<T> v2(a2, N);
|
H A D | less_value_valarray.pass.cpp | 25 T a2[] = {1, 2, 3, 4, 0}; local 27 const unsigned N = sizeof(a2)/sizeof(a2[0]); 28 std::valarray<T> v2(a2, N);
|
H A D | not_equal_value_valarray.pass.cpp | 25 T a2[] = {1, 2, 3, 4, 0}; local 27 const unsigned N = sizeof(a2)/sizeof(a2[0]); 28 std::valarray<T> v2(a2, N);
|
/external/valgrind/main/drd/ |
H A D | drd_suppression.c | 62 void DRD_(start_suppression)(const Addr a1, const Addr a2, argument 67 a1, a2 - a1, reason); 69 tl_assert(a1 <= a2); 70 DRD_(bm_access_range_store)(s_suppressed, a1, a2); 73 void DRD_(finish_suppression)(const Addr a1, const Addr a2) argument 77 a1, a2 - a1); 81 tl_assert(a1 <= a2); 82 DRD_(bm_clear_store)(s_suppressed, a1, a2); 87 * bytes in the range a1 .. a2 - 1 inclusive. Return false in case the range 90 Bool DRD_(is_suppressed)(const Addr a1, const Addr a2) argument 100 is_any_suppressed(const Addr a1, const Addr a2) argument 110 range_contains_suppression_or_hbvar(const Addr a1, const Addr a2) argument 119 start_tracing_address_range(const Addr a1, const Addr a2, const Bool persistent) argument 138 stop_tracing_address_range(const Addr a1, const Addr a2) argument 152 is_any_traced(const Addr a1, const Addr a2) argument 161 suppression_stop_using_mem(const Addr a1, const Addr a2) argument [all...] |
/external/clang/test/CodeGenCXX/ |
H A D | global-dtor-no-atexit.cpp | 43 static A a1, a2; local
|