/external/valgrind/main/VEX/test/ |
H A D | fpspeed.c | 12 double* a2 = malloc(1000 * sizeof(double)); local 16 a2[i] = s; 23 s += (a1[i] - a2[i]) * (a1[i] + a2[i]) - sqrt(r + 1.0);
|
/external/valgrind/main/drd/ |
H A D | drd_suppression.h | 14 void DRD_(start_suppression)(const Addr a1, const Addr a2, 16 void DRD_(finish_suppression)(const Addr a1, const Addr a2); 17 Bool DRD_(is_suppressed)(const Addr a1, const Addr a2); 18 Bool DRD_(is_any_suppressed)(const Addr a1, const Addr a2); 20 Bool DRD_(range_contains_suppression_or_hbvar)(const Addr a1, const Addr a2); 21 void DRD_(start_tracing_address_range)(const Addr a1, const Addr a2, 23 void DRD_(stop_tracing_address_range)(const Addr a1, const Addr a2); 24 Bool DRD_(is_any_traced)(const Addr a1, const Addr a2); 25 void DRD_(suppression_stop_using_mem)(const Addr a1, const Addr a2);
|
/external/clang/test/SemaTemplate/ |
H A D | instantiate-default-assignment-operator.cpp | 12 A a1, a2; local 13 a1 = a2;
|
/external/eigen/doc/snippets/ |
H A D | Tutorial_AdvancedInitialization_Zero.cpp | 7 ArrayXf a2 = ArrayXf::Zero(3); variable 8 std::cout << a2 << "\n\n"; variable
|
/external/libcxx/test/utilities/allocator.adaptor/allocator.adaptor.members/ |
H A D | select_on_container_copy_construction.pass.cpp | 30 A a2 = std::allocator_traits<A>::select_on_container_copy_construction(a1); local 31 assert(a2.outer_allocator().id() == 3); 38 A a2 = std::allocator_traits<A>::select_on_container_copy_construction(a1); local 39 assert(a2.outer_allocator().id() == -1); 48 A a2 = std::allocator_traits<A>::select_on_container_copy_construction(a1); local 49 assert(a2.outer_allocator().id() == 1); 50 assert(a2.inner_allocator().outer_allocator().id() == 2); 51 assert(a2.inner_allocator().inner_allocator().outer_allocator().id() == -1);
|
/external/apache-http/src/org/apache/http/util/ |
H A D | LangUtils.java | 72 public static boolean equals(final Object[] a1, final Object[] a2) { argument 74 if (a2 == null) { 80 if (a2 != null && a1.length == a2.length) { 82 if (!equals(a1[i], a2[i])) {
|
/external/libcxx/test/containers/unord/unord.map/unord.map.swap/ |
H A D | db_swap_1.pass.cpp | 31 P a2[] = {P(0, 0), P(2, 2), P(4, 4), P(5, 5), P(6, 6), P(8, 8), P(11, 11)}; local 33 std::unordered_map<int, int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
|
/external/libcxx/test/containers/unord/unord.multimap/unord.multimap.swap/ |
H A D | db_swap_1.pass.cpp | 31 P a2[] = {P(0, 0), P(2, 2), P(4, 4), P(5, 5), P(6, 6), P(8, 8), P(11, 11)}; local 33 std::unordered_multimap<int, int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
|
/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/valgrind/main/none/tests/linux/ |
H A D | mremap3.c | 31 void *a2 = mremap(area, 4096, 40960, 0); local 32 if (a2 == MAP_FAILED) { 35 if (a2 != initial_area) 37 printf("increased area= %p\n", a2); 38 printf("%s\n", (char *)a2);
|
/external/libcxxabi/test/ |
H A D | dynamic_cast3.cpp | 48 A2 a2; local 51 assert(dynamic_cast<A1*>(a2.getA2()) == 0); 54 assert(dynamic_cast<A2*>(a2.getA2()) == a2.getA2()); 57 assert(dynamic_cast<A3*>(a2.getA2()) == 0); 102 A2 a2; local 105 assert(dynamic_cast<A1*>(a2.getA2()) == 0); 110 assert(dynamic_cast<A2*>(a2.getA2()) == a2.getA2()); 115 assert(dynamic_cast<A3*>(a2 153 A2 a2; local 205 A2 a2; local 256 A2 a2; local 317 A2 a2; local 374 A2 a2; local 431 A2 a2; local 487 A2 a2; local 543 A2 a2; local 600 A2 a2; local 656 A2 a2; local 712 A2 a2; local 767 A2 a2; local 822 A2 a2; local 888 A2 a2; local 949 A2 a2; local 1009 A2 a2; local 1066 A2 a2; local 1124 A2 a2; local 1184 A2 a2; local 1241 A2 a2; local 1299 A2 a2; local 1356 A2 a2; local 1413 A2 a2; local 1481 A2 a2; local 1542 A2 a2; local 1601 A2 a2; local 1661 A2 a2; local 1720 A2 a2; local 1780 A2 a2; local 1838 A2 a2; local 1896 A2 a2; local 1964 A2 a2; local 2026 A2 a2; local 2086 A2 a2; local 2148 A2 a2; local 2209 A2 a2; local 2269 A2 a2; local 2328 A2 a2; local 2387 A2 a2; local [all...] |
/external/libcxx/test/containers/sequences/list/list.modifiers/ |
H A D | insert_iter_size_value.pass.cpp | 46 int a2[] = {1, 4, 4, 4, 4, 4, 2, 3}; local 50 assert(l1 == std::list<int>(a2, a2+8)); 63 assert(l1 == std::list<int>(a2, a2+8)); 76 int a2[] = {1, 4, 4, 4, 4, 4, 2, 3}; local 80 assert((l1 == std::list<int, min_allocator<int>>(a2, a2+8))); 93 assert((l1 == std::list<int, min_allocator<int>>(a2, a2 [all...] |
/external/libcxx/test/numerics/numarray/template.valarray/valarray.members/ |
H A D | cshift.pass.cpp | 24 T a2[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; local 30 assert(v2[i] == a2[i]); 35 T a2[] = {4, 5, 6, 7, 8, 9, 10, 1, 2, 3}; local 41 assert(v2[i] == a2[i]); 46 T a2[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; local 52 assert(v2[i] == a2[i]); 57 T a2[] = {8, 9, 10, 1, 2, 3, 4, 5, 6, 7}; local 63 assert(v2[i] == a2[i]); 68 T a2[] = {8, 9, 10, 1, 2, 3, 4, 5, 6, 7}; local 74 assert(v2[i] == a2[ 79 T a2[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; local 90 T a2[] = {4, 5, 6, 7, 8, 9, 10, 1, 2, 3}; local 108 T a2[] = {8, 10, 12, 14, 16, 18, 20, 2, 4, 6}; local 119 T a2[] = {16, 18, 20, 2, 4, 6, 8, 10, 12, 14}; local [all...] |
H A D | shift.pass.cpp | 24 T a2[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; local 30 assert(v2[i] == a2[i]); 35 T a2[] = {2, 3, 4, 5, 6, 7, 8, 9, 10, 0}; local 41 assert(v2[i] == a2[i]); 46 T a2[] = {10, 0, 0, 0, 0, 0, 0, 0, 0, 0}; local 52 assert(v2[i] == a2[i]); 57 T a2[] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; local 63 assert(v2[i] == a2[i]); 68 T a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; local 74 assert(v2[i] == a2[ 79 T a2[] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 1}; local 90 T a2[] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; local 108 T a2[] = {8, 10, 12, 14, 16, 18, 20, 0, 0, 0}; local 119 T a2[] = {0, 0, 0, 2, 4, 6, 8, 10, 12, 14}; local [all...] |
/external/chromium_org/third_party/libxml/src/ |
H A D | triodef.h | 140 # define TRIO_ARGS2(list,a1,a2) list a1; a2; 141 # define TRIO_ARGS3(list,a1,a2,a3) list a1; a2; a3; 142 # define TRIO_ARGS4(list,a1,a2,a3,a4) list a1; a2; a3; a4; 143 # define TRIO_ARGS5(list,a1,a2,a3,a4,a5) list a1; a2; a3; a4; a5; 144 # define TRIO_ARGS6(list,a1,a2,a3,a4,a5,a6) list a1; a2; a [all...] |
/external/chromium_org/third_party/libxslt/libxslt/ |
H A D | triodef.h | 138 # define TRIO_ARGS2(list,a1,a2) list a1; a2; 139 # define TRIO_ARGS3(list,a1,a2,a3) list a1; a2; a3; 140 # define TRIO_ARGS4(list,a1,a2,a3,a4) list a1; a2; a3; a4; 141 # define TRIO_ARGS5(list,a1,a2,a3,a4,a5) list a1; a2; a3; a4; a5; 142 # define TRIO_ARGS6(list,a1,a2,a3,a4,a5,a6) list a1; a2; a [all...] |
/external/chromium_org/v8/test/mjsunit/regress/ |
H A D | regress-convert-hole.js | 102 var a2 = new Int32Array(10); 103 f_external(true, false, true, a2, 0); 104 f_external(true, true, true, a2, 0); 105 f_external(false, false, true, a2, 1); 106 f_external(false, true, true, a2, 1); 108 f_external(false, false, false, a2, 2); 109 assertEquals(1, a2[undefined]);
|
/external/libxml2/ |
H A D | triodef.h | 140 # define TRIO_ARGS2(list,a1,a2) list a1; a2; 141 # define TRIO_ARGS3(list,a1,a2,a3) list a1; a2; a3; 142 # define TRIO_ARGS4(list,a1,a2,a3,a4) list a1; a2; a3; a4; 143 # define TRIO_ARGS5(list,a1,a2,a3,a4,a5) list a1; a2; a3; a4; a5; 144 # define TRIO_ARGS6(list,a1,a2,a3,a4,a5,a6) list a1; a2; a [all...] |
/external/stressapptest/src/ |
H A D | adler32memcpy.cc | 38 // streams, and hence the two checksums a1, a2, b1 and b2. 39 // Initialize a1 and a2 with 1, b1 and b2 with 0 44 // add third dataunit to a2 45 // add a2 to b2 46 // add fourth dataunit to a2 47 // add a2 to b2 78 void AdlerChecksum::Set(uint64 a1, uint64 a2, uint64 b1, uint64 b2) { argument 80 a2_ = a2; 98 uint64 a2 = 1; local 113 a2 136 uint64 a2 = 1; local 177 uint64 a2 = 1; local [all...] |
/external/libcxx/test/depr/depr.function.objects/depr.adaptors/depr.member.pointer.adaptors/ |
H A D | mem_fun.pass.cpp | 22 short a2(int i) {return short(i+1);} function in struct:A
|
H A D | mem_fun_ref.pass.cpp | 22 short a2(int i) {return short(i+1);} function in struct:A
|
/external/libcxx/test/numerics/numarray/class.gslice/gslice.cons/ |
H A D | start_size_stride.pass.cpp | 23 std::size_t a2[] = {4, 5, 6}; local 25 std::valarray<std::size_t> stride(a2, sizeof(a2)/sizeof(a2[0]));
|
/external/libcxx/test/numerics/numarray/template.mask.array/mask.array.assign/ |
H A D | mask_array.pass.cpp | 25 int a2[] = {-1, -2, -3, -4, -5, -6, -7, -8}; local 26 const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); 30 const std::valarray<int> v2(a2, N2);
|
H A D | valarray.pass.cpp | 23 int a2[] = {1, 2, 3, 4, 5}; local 24 const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); 28 std::valarray<int> v2(a2, N2);
|