HomeSort by relevance Sort by last modified time
    Searched refs:a2 (Results 1 - 25 of 1382) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/clang/test/Modules/Inputs/normal-module-map/
a2.h 1 int a2; variable
  /external/clang/test/CodeGen/
arm64_vca.c 6 uint32x2_t test_vcale_f32(float32x2_t a1, float32x2_t a2) {
8 return vcale_f32(a1, a2);
13 uint32x4_t test_vcaleq_f32(float32x4_t a1, float32x4_t a2) {
15 return vcaleq_f32(a1, a2);
16 // CHECK: llvm.aarch64.neon.facge.v4i32.v4f32{{.*a2,.*a1}}
20 uint32x2_t test_vcalt_f32(float32x2_t a1, float32x2_t a2) {
22 return vcalt_f32(a1, a2);
23 // CHECK: llvm.aarch64.neon.facgt.v2i32.v2f32{{.*a2,.*a1}}
27 uint32x4_t test_vcaltq_f32(float32x4_t a1, float32x4_t a2) {
29 return vcaltq_f32(a1, a2);
    [all...]
arm64_vtst.c 6 uint64x2_t test_vtstq_s64(int64x2_t a1, int64x2_t a2) {
8 return vtstq_s64(a1, a2);
9 // CHECK: [[COMMONBITS:%[A-Za-z0-9.]+]] = and <2 x i64> %a1, %a2
15 uint64x2_t test_vtstq_u64(uint64x2_t a1, uint64x2_t a2) {
17 return vtstq_u64(a1, a2);
18 // CHECK: [[COMMONBITS:%[A-Za-z0-9.]+]] = and <2 x i64> %a1, %a2
arm64_vLdStNum_lane.c 6 int64x2x2_t test_vld2q_lane_s64(const void * a1, int64x2x2_t a2) {
8 return vld2q_lane_s64(a1, a2, 1);
12 uint64x2x2_t test_vld2q_lane_u64(const void * a1, uint64x2x2_t a2) {
14 return vld2q_lane_u64(a1, a2, 1);
18 int64x1x2_t test_vld2_lane_s64(const void * a1, int64x1x2_t a2) {
20 return vld2_lane_s64(a1, a2, 0);
24 uint64x1x2_t test_vld2_lane_u64(const void * a1, uint64x1x2_t a2) {
26 return vld2_lane_u64(a1, a2, 0);
30 poly8x16x2_t test_vld2q_lane_p8(const void * a1, poly8x16x2_t a2) {
32 return vld2q_lane_p8(a1, a2, 0)
    [all...]
arm64_vset_lane.c 6 float16x4_t test_vset_lane_f16(float16_t *a1, float16x4_t a2) {
8 return vset_lane_f16(*a1, a2, 1);
9 // CHECK insertelement <4 x i16> %a2, i16 %a1, i32 1
12 float16x8_t test_vsetq_lane_f16(float16_t *a1, float16x8_t a2) {
14 return vsetq_lane_f16(*a1, a2, 4);
15 // CHECK insertelement <8 x i16> %a2, i16 %a1, i32 4
20 float64x1_t test_vset_lane_f64(float64_t a1, float64x1_t a2) {
22 return vset_lane_f64(a1, a2, 0);
27 float64x2_t test_vsetq_lane_f64(float64_t a1, float64x2_t a2) {
29 return vsetq_lane_f64(a1, a2, 0)
    [all...]
arm64_vsli.c 9 int8x8_t test_vsli_n_s8(int8x8_t a1, int8x8_t a2) {
11 return vsli_n_s8(a1, a2, 3);
16 int16x4_t test_vsli_n_s16(int16x4_t a1, int16x4_t a2) {
18 return vsli_n_s16(a1, a2, 3);
23 int32x2_t test_vsli_n_s32(int32x2_t a1, int32x2_t a2) {
25 return vsli_n_s32(a1, a2, 1);
30 int64x1_t test_vsli_n_s64(int64x1_t a1, int64x1_t a2) {
32 return vsli_n_s64(a1, a2, 1);
37 uint8x8_t test_vsli_n_u8(uint8x8_t a1, uint8x8_t a2) {
39 return vsli_n_u8(a1, a2, 3)
    [all...]
arm64_vsri.c 10 int8x8_t test_vsri_n_s8(int8x8_t a1, int8x8_t a2) {
12 return vsri_n_s8(a1, a2, 3);
17 int16x4_t test_vsri_n_s16(int16x4_t a1, int16x4_t a2) {
19 return vsri_n_s16(a1, a2, 3);
24 int32x2_t test_vsri_n_s32(int32x2_t a1, int32x2_t a2) {
26 return vsri_n_s32(a1, a2, 1);
31 int64x1_t test_vsri_n_s64(int64x1_t a1, int64x1_t a2) {
33 return vsri_n_s64(a1, a2, 1);
38 uint8x8_t test_vsri_n_u8(uint8x8_t a1, uint8x8_t a2) {
40 return vsri_n_u8(a1, a2, 3)
    [all...]
arm64_vcopy.c 7 int8x16_t test_vcopyq_laneq_s8(int8x16_t a1, int8x16_t a2) {
9 return vcopyq_laneq_s8(a1, (int64_t) 3, a2, (int64_t) 13);
10 // CHECK: shufflevector <16 x i8> %a1, <16 x i8> %a2, <16 x i32> <i32 0, i32 1, i32 2, i32 29, i32 4, i32 5, i32 6, i32 7, i32 8, i32 9, i32 10, i32 11, i32 12, i32 13, i32 14, i32 15>
13 uint8x16_t test_vcopyq_laneq_u8(uint8x16_t a1, uint8x16_t a2) {
15 return vcopyq_laneq_u8(a1, (int64_t) 3, a2, (int64_t) 13);
16 // CHECK: shufflevector <16 x i8> %a1, <16 x i8> %a2, <16 x i32> <i32 0, i32 1, i32 2, i32 29, i32 4, i32 5, i32 6, i32 7, i32 8, i32 9, i32 10, i32 11, i32 12, i32 13, i32 14, i32 15>
20 int16x8_t test_vcopyq_laneq_s16(int16x8_t a1, int16x8_t a2) {
22 return vcopyq_laneq_s16(a1, (int64_t) 3, a2, (int64_t) 7);
23 // CHECK: shufflevector <8 x i16> %a1, <8 x i16> %a2, <8 x i32> <i32 0, i32 1, i32 2, i32 15, i32 4, i32 5, i32 6, i32 7>
27 uint16x8_t test_vcopyq_laneq_u16(uint16x8_t a1, uint16x8_t a2) {
    [all...]
arm64_vCMP.c 14 int64_t test_vceqd_s64(int64_t a1, int64_t a2) {
16 return vceqd_s64(a1, a2);
17 // CHECK: [[BIT:%[0-9a-zA-Z.]+]] = icmp eq i64 %a1, %a2
21 int64_t test_vceqd_f64(float64_t a1, float64_t a2) {
23 return vceqd_f64(a1, a2);
24 // CHECK: [[BIT:%[0-9a-zA-Z.]+]] = fcmp oeq double %a1, %a2
28 uint64_t test_vcgtd_u64(uint64_t a1, uint64_t a2) {
30 return vcgtd_u64(a1, a2);
31 // CHECK: [[BIT:%[0-9a-zA-Z.]+]] = icmp ugt i64 %a1, %a2
35 uint64_t test_vcled_u64(uint64_t a1, uint64_t a2) {
    [all...]
le32-libcall-pow.c 13 void test_pow(float a0, double a1, long double a2) {
21 long double l2 = powl(a2, a2);
  /external/clang/test/Sema/
array-declared-as-incorrect-type.c 6 extern int a2[]; // expected-note {{previous definition is here}}
7 float a2[1]; // expected-error {{redefinition of 'a2'}} variable
  /external/valgrind/main/none/tests/ppc32/
lsw.c 20 char* a2 = malloc(100); local
29 : : "b"(a1), "b"(a2) : "r3", "r4", "r5",
31 printf("%s\n", a2);
33 printf("%d = 0x%2x\n", i, a2[i]);
42 : : "b"(a1), "b"(a2) : "r3", "r4", "r5",
44 printf("%s\n", a2);
46 printf("%d = 0x%2x\n", i, a2[i]);
51 free(a2);
52 a2 = malloc(100);
59 : : "b"(a1), "b"(a2), "b"(16) : "r3", "r4", "r5", "r8",
    [all...]
  /external/valgrind/main/none/tests/ppc64/
lsw.c 20 char* a2 = malloc(100); local
29 : : "b"(a1), "b"(a2) : "r3", "r4", "r5",
31 printf("%s\n", a2);
33 printf("%d = 0x%2x\n", i, a2[i]);
42 : : "b"(a1), "b"(a2) : "r3", "r4", "r5",
44 printf("%s\n", a2);
46 printf("%d = 0x%2x\n", i, a2[i]);
51 free(a2);
52 a2 = malloc(100);
59 : : "b"(a1), "b"(a2), "b"(16) : "r3", "r4", "r5", "r8",
    [all...]
  /external/libcxx/test/containers/sequences/list/list.ops/
reverse.pass.cpp 23 int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}; local
26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
31 int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}; local
34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))))
    [all...]
sort.pass.cpp 23 int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}; local
26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
31 int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}; local
34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))))
    [all...]
sort_comp.pass.cpp 24 int a2[] = {11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; local
27 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
32 int a2[] = {11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; local
35 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))))
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/
reverse.pass.cpp 23 int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}; local
26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
31 int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}; local
34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))))
    [all...]
sort.pass.cpp 23 int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}; local
26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
31 int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}; local
34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))))
    [all...]
sort_comp.pass.cpp 24 int a2[] = {11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; local
27 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
32 int a2[] = {11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; local
35 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))))
    [all...]
  /bionic/libm/
fake_long_double.c 27 long double copysignl(long double a1, long double a2) { return copysign(a1, a2); }
29 long double fmaxl(long double a1, long double a2) { return fmax(a1, a2); }
30 long double fmodl(long double a1, long double a2) { return fmod(a1, a2); }
31 long double fminl(long double a1, long double a2) { return fmin(a1, a2); }
37 long double modfl(long double a1, long double* a2) { double i; double f = modf(a1, &i); *a2 = i; return f;
    [all...]
  /external/clang/test/Index/
complete-recovery.m 11 A *a2;
12 z = [a2 method:1];
13 blah ? blech : [a2 method:1];
14 (a * a2)([a2 method:1]);
15 B *a = [a2 method:1];
  /external/libcxx/test/containers/sequences/list/list.special/
swap.pass.cpp 24 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
26 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
28 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
33 int a2[] = {0, 2, 4, 5, 6, 8, 11} local
43 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
53 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
66 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
79 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
92 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
101 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
111 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
121 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
134 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
    [all...]
  /external/libcxx/test/containers/sequences/vector/vector.special/
swap.pass.cpp 24 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
26 std::vector<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
28 assert(c1 == std::vector<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
33 int a2[] = {0, 2, 4, 5, 6, 8, 11} local
43 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
53 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
66 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
79 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
92 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
101 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
111 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
121 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
134 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
    [all...]
  /external/libcxx/test/utilities/allocator.adaptor/scoped.adaptor.operators/
eq.pass.cpp 37 A a2 = a1; local
38 assert(a2 == a1);
39 assert(!(a2 != a1));
42 typedef std::scoped_allocator_adaptor<A1<int>, A2<int>> A;
43 A a1(A1<int>(4), A2<int>(5));
44 A a2 = a1; local
45 assert(a2 == a1);
46 assert(!(a2 != a1));
49 typedef std::scoped_allocator_adaptor<A1<int>, A2<int>, A3<int>> A;
50 A a1(A1<int>(4), A2<int>(5), A3<int>(6))
51 A a2 = a1; local
    [all...]
  /external/libcxx/test/utilities/memory/default.allocator/allocator.globals/
eq.pass.cpp 28 std::allocator<int> a2; local
29 assert(a1 == a2);
30 assert(!(a1 != a2));

Completed in 468 milliseconds

1 2 3 4 5 6 7 8 91011>>