/external/valgrind/main/none/tests/ppc32/ |
H A D | 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), " [all...] |
/external/valgrind/main/none/tests/ppc64/ |
H A D | 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), " [all...] |
/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]);
|
/external/clang/test/CXX/class/class.bit/ |
H A D | p2.cpp | 9 A a2 = { 1 }; // expected-error{{excess elements in struct initializer}} variable
|
/external/clang/test/CodeGen/ |
H A D | le32-libcall-pow.c | 13 void test_pow(float a0, double a1, long double a2) { argument 21 long double l2 = powl(a2, a2);
|
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/clang/test/CodeGenCXX/ |
H A D | global-dtor-no-atexit.cpp | 43 static A a1, a2; local
|
/external/clang/test/SemaTemplate/ |
H A D | temp_arg.cpp | 11 A<float, 1, X, double> *a2; // expected-error{{too many template arguments for class template 'A'}} variable
|
/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/containers/sequences/list/list.ops/ |
H A D | splice_pos_list.pass.cpp | 26 int a2[] = {4, 5, 6}; local 38 std::list<int> l2(a2, a2+1); 49 std::list<int> l2(a2, a2+2); 62 std::list<int> l2(a2, a2+3); 99 std::list<int> l2(a2, a2+1); 112 std::list<int> l2(a2, a [all...] |
H A D | splice_pos_list_iter.pass.cpp | 26 int a2[] = {4, 5, 6}; local 29 std::list<int> l2(a2, a2+1); 40 std::list<int> l2(a2, a2+2); 53 std::list<int> l2(a2, a2+2); 66 std::list<int> l2(a2, a2+3); 81 std::list<int> l2(a2, a [all...] |
H A D | splice_pos_list_iter_iter.pass.cpp | 26 int a2[] = {4, 5, 6}; local 65 std::list<int> l2(a2, a2+3); 85 std::list<int> l2(a2, a2+3); 105 std::list<int> l2(a2, a2+3); 170 std::list<int, min_allocator<int>> l2(a2, a2+3); 190 std::list<int, min_allocator<int>> l2(a2, a [all...] |
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/libcxx/test/containers/sequences/list/list.special/ |
H A D | db_swap_1.pass.cpp | 30 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local 32 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0])); 45 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local 47 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[ [all...] |
/external/libcxx/test/containers/sequences/vector/vector.special/ |
H A D | db_swap_1.pass.cpp | 29 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local 31 std::vector<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0])); 43 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local 45 std::vector<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[ [all...] |
/external/libcxx/test/containers/unord/unord.multiset/unord.multiset.swap/ |
H A D | db_swap_1.pass.cpp | 30 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local 32 std::unordered_multiset<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
|
/external/libcxx/test/containers/unord/unord.set/unord.set.swap/ |
H A D | db_swap_1.pass.cpp | 30 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local 32 std::unordered_set<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
|
/external/libcxx/test/numerics/numarray/template.gslice.array/gslice.array.assign/ |
H A D | gslice_array.pass.cpp | 25 int a2[] = { -0, -1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -11, local 30 const std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
H A D | valarray.pass.cpp | 25 int a2[] = { -0, -1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -11, local 28 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
/external/libcxx/test/numerics/numarray/template.gslice.array/gslice.array.comp.assign/ |
H A D | addition.pass.cpp | 25 int a2[] = { -0, -1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -11, local 28 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
H A D | and.pass.cpp | 25 int a2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, local 28 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
H A D | divide.pass.cpp | 25 int a2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, local 28 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
H A D | modulo.pass.cpp | 25 int a2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, local 28 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
H A D | multiply.pass.cpp | 25 int a2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, local 28 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|