HomeSort by relevance Sort by last modified time
    Searched refs:a2 (Results 1 - 25 of 2409) 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
  /toolchain/binutils/binutils-2.25/gas/testsuite/gas/mn10200/
movx.s 2 movx (8,a2),d1
3 movx (256,a2),d1
4 movx (131071,a2),d1
5 movx d1,(8,a2)
6 movx d1,(256,a2)
7 movx d1,(131071,a2)
movb.s 2 movb (8,a2),d1
3 movb (256,a2),d1
4 movb (131071,a2),d1
5 movb (d2,a2),d3
7 movb d1,(a2)
8 movb d1,(8,a2)
9 movb d1,(256,a2)
10 movb d1,(131071,a2)
11 movb d1,(d2,a2)
mov3.s 2 mov d1,(a2)
3 mov d1,(32,a2)
4 mov d1,(256,a2)
5 mov d1,(131071,a2)
6 mov d1,(d2,a2)
9 mov a1,(32,a2)
10 mov a1,(256,a2)
11 mov a1,(131071,a2)
mov1.s 2 mov d1,a2
3 mov a2,d1
5 mov a2,a1
10 mov (a2),d1
11 mov (8,a2),d1
12 mov (256,a2),d1
13 mov (131071,a2),d1
  /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|%a2, %a1}}
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|%a2, %a1}}
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_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...]
  /external/clang/test/Modules/
explicit-build-missing-files.cpp 3 // RUN: echo 'extern int a; template<typename T> int a2 = T::error;' > %t/a.h
46 int y = a2<int>;
  /external/clang/test/CodeGenCXX/
debug-info-anon-namespace.cpp 15 int a2 = 7; member in namespace:__anon8926
18 int *b2 = &a2;
  /external/clang/test/Sema/
array-declared-as-incorrect-type.c 6 extern int a2[]; // expected-note {{previous declaration is here}}
7 float a2[1]; // expected-error {{redefinition of 'a2'}} variable
  /art/runtime/interpreter/mterp/mips/
op_iget_quick.S 4 GET_OPB(a2) # a2 <- B
5 GET_VREG(a3, a2) # a3 <- object we're operating on
7 GET_OPA4(a2) # a2 <- A(+)
14 SET_VREG_GOTO(a0, a2, t0) # fp[A] <- a0
op_iget_wide_quick.S 2 GET_OPB(a2) # a2 <- B
3 GET_VREG(a3, a2) # a3 <- object we're operating on
5 GET_OPA4(a2) # a2 <- A(+)
12 SET_VREG64(a0, a1, a2) # fp[A] <- a0/a1
  /external/valgrind/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/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/std/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...]
  /toolchain/binutils/binutils-2.25/gas/testsuite/gas/mn10300/
other.s 4 inc a2
6 jmp (a2)
9 call 256,[a2,a3],9
10 call 131071,[a2,a3],32
11 calls (a2)
14 ret [a2,a3],7
15 retf [a2,a3],5

Completed in 471 milliseconds

1 2 3 4 5 6 7 8 91011>>