Searched refs:a1 (Results 201 - 225 of 1137) sorted by relevance

1234567891011>>

/external/libcxx/test/utilities/allocator.adaptor/allocator.adaptor.cnstr/
H A Dconverting_copy.pass.cpp31 B a1(A1<int>(3));
34 A a2 = a1;
36 assert(a2 == a1);
41 B a1(A1<int>(4), A2<int>(5));
46 A a2 = a1;
49 assert(a2 == a1);
54 B a1(A1<int>(4), A2<int>(5), A3<int>(6));
61 A a2 = a1;
65 assert(a2 == a1);
H A Dcopy.pass.cpp28 A a1(A1<int>(3));
31 A a2 = a1;
34 assert(a2 == a1);
38 A a1(A1<int>(4), A2<int>(5));
43 A a2 = a1;
48 assert(a2 == a1);
52 A a1(A1<int>(4), A2<int>(5), A3<int>(6));
59 A a2 = a1;
66 assert(a2 == a1);
/external/libvpx/libvpx/vp8/common/mips/dspr2/
H A Dreconinter_dspr2.c34 unsigned int a0, a1, a2, a3; local
44 "ulw %[a1], 4(%[src]) \n\t"
48 "sw %[a1], 4(%[dst]) \n\t"
51 : [a0] "=&r" (a0), [a1] "=&r" (a1),
69 unsigned int a0, a1; local
79 "ulw %[a1], 4(%[src]) \n\t"
81 "sw %[a1], 4(%[dst]) \n\t"
82 : [a0] "=&r" (a0), [a1] "=&r" (a1)
99 unsigned int a0, a1; local
[all...]
H A Didctllm_dspr2.c47 int a1, b1, c1, d1; local
62 a1 = ip[0] + ip[8];
81 op[0] = a1 + d1;
82 op[12] = a1 - d1;
86 a1 = ip[1] + ip[9];
89 op[1] = a1 + d2;
90 op[13] = a1 - d2;
94 a1 = ip[2] + ip[10];
113 op[2] = a1 + d1;
114 op[14] = a1
214 int a1; local
285 int a1, b1, c1, d1; local
342 int a1; local
[all...]
/external/valgrind/main/VEX/test/
H A Dfpspeed.c11 double* a1 = malloc(1000 * sizeof(double)); local
14 a1[i] = s;
23 s += (a1[i] - a2[i]) * (a1[i] + a2[i]) - sqrt(r + 1.0);
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/
H A Ddct.c17 int a1, b1, c1, d1; local
23 a1 = ((ip[0] + ip[3]) * 8);
28 op[0] = a1 + b1;
29 op[2] = a1 - b1;
42 a1 = ip[0] + ip[12];
47 op[0] = ( a1 + b1 + 7)>>4;
48 op[8] = ( a1 - b1 + 7)>>4;
67 int a1, b1, c1, d1; local
75 a1 = ((ip[0] + ip[2]) * 4);
80 op[0] = a1
[all...]
/external/libvpx/libvpx/vp8/encoder/
H A Ddct.c17 int a1, b1, c1, d1; local
23 a1 = ((ip[0] + ip[3]) * 8);
28 op[0] = a1 + b1;
29 op[2] = a1 - b1;
42 a1 = ip[0] + ip[12];
47 op[0] = ( a1 + b1 + 7)>>4;
48 op[8] = ( a1 - b1 + 7)>>4;
67 int a1, b1, c1, d1; local
75 a1 = ((ip[0] + ip[2]) * 4);
80 op[0] = a1
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/mips/dspr2/
H A Didctllm_dspr2.c47 int a1, b1, c1, d1; local
62 a1 = ip[0] + ip[8];
81 op[0] = a1 + d1;
82 op[12] = a1 - d1;
86 a1 = ip[1] + ip[9];
89 op[1] = a1 + d2;
90 op[13] = a1 - d2;
94 a1 = ip[2] + ip[10];
113 op[2] = a1 + d1;
114 op[14] = a1
214 int a1; local
285 int a1, b1, c1, d1; local
342 int a1; local
[all...]
/external/chromium_org/third_party/libxml/src/
H A Dtriodef.h139 # define TRIO_ARGS1(list,a1) list a1;
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; a
[all...]
/external/chromium_org/third_party/libxslt/libxslt/
H A Dtriodef.h137 # define TRIO_ARGS1(list,a1) list a1;
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; a
[all...]
/external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.type/
H A Dp22.cpp8 template<class T1, class ... Args> float& f(T1 a1, Args ... args);
9 template<class T1, class T2> double& f(T1 a1, T2 a2);
/external/clang/test/SemaTemplate/
H A Ddependent-sized_array.cpp15 int a1[] = { 1, 2, 3, N }; local
16 int a3[sizeof(a1)/sizeof(int) != 4? 1 : -1]; // expected-error{{negative}}
H A Dinstantiate-default-assignment-operator.cpp12 A a1, a2; local
13 a1 = a2;
/external/eigen/doc/snippets/
H A DTutorial_AdvancedInitialization_Zero.cpp2 Array33f a1 = Array33f::Zero(); variable
3 std::cout << a1 << "\n\n"; variable
/external/libcxx/test/numerics/numarray/template.valarray/valarray.members/
H A Dapply_cref.pass.cpp26 T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; local
28 const unsigned N1 = sizeof(a1)/sizeof(a1[0]);
29 std::valarray<T> v1(a1, N1);
42 T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; local
44 const unsigned N1 = sizeof(a1)/sizeof(a1[0]);
45 std::valarray<T> v1(a1, N1);
H A Dapply_value.pass.cpp26 T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; local
28 const unsigned N1 = sizeof(a1)/sizeof(a1[0]);
29 std::valarray<T> v1(a1, N1);
42 T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; local
44 const unsigned N1 = sizeof(a1)/sizeof(a1[0]);
45 std::valarray<T> v1(a1, N1);
/external/libxml2/
H A Dtriodef.h139 # define TRIO_ARGS1(list,a1) list a1;
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; a
[all...]
/external/valgrind/main/none/tests/ppc32/
H A Dlsw.c19 char* a1 = malloc(100); local
21 strcpy(a1,"here is a stringHERE IS A STRING");
29 : : "b"(a1), "b"(a2) : "r3", "r4", "r5",
42 : : "b"(a1), "b"(a2) : "r3", "r4", "r5",
59 : : "b"(a1), "b"(a2), "b"(16) : "r3", "r4", "r5", "r8",
72 : : "b"(a1), "b"(a2) : "r3","r4","r5","r6","r7",
83 : : "b"(a1), "b"(a2) : "r3","r4","r5","r6","r7",
96 : : "b"(a1), "b"(a2), "b"(16) : "r3", "r4", "r5", "r8",
/external/valgrind/main/none/tests/ppc64/
H A Dlsw.c19 char* a1 = malloc(100); local
21 strcpy(a1,"here is a stringHERE IS A STRING");
29 : : "b"(a1), "b"(a2) : "r3", "r4", "r5",
42 : : "b"(a1), "b"(a2) : "r3", "r4", "r5",
59 : : "b"(a1), "b"(a2), "b"(16) : "r3", "r4", "r5", "r8",
72 : : "b"(a1), "b"(a2) : "r3","r4","r5","r6","r7",
83 : : "b"(a1), "b"(a2) : "r3","r4","r5","r6","r7",
96 : : "b"(a1), "b"(a2), "b"(16) : "r3", "r4", "r5", "r8",
/external/valgrind/main/drd/
H A Ddrd_bitmap.c100 * Cache initialization. a1 is initialized with a value that never can
102 * bits of a1 are always zero for a valid cache entry.
106 bm->cache[i].a1 = ~(UWord)1;
130 const Addr a1, const Addr a2,
136 return DRD_(bm_access_range_load)(bm, a1, a2);
138 return DRD_(bm_access_range_store)(bm, a1, a2);
141 void DRD_(bm_access_range_load)(struct bitmap* const bm, Addr a1, Addr a2) argument
146 tl_assert(a1 <= a2);
148 tl_assert(a1 == first_address_with_same_lsb(a1));
129 bm_access_range(struct bitmap* const bm, const Addr a1, const Addr a2, const BmAccessTypeT access_type) argument
203 bm_access_load_1(struct bitmap* const bm, const Addr a1) argument
208 bm_access_load_2(struct bitmap* const bm, const Addr a1) argument
216 bm_access_load_4(struct bitmap* const bm, const Addr a1) argument
224 bm_access_load_8(struct bitmap* const bm, const Addr a1) argument
237 bm_access_range_store(struct bitmap* const bm, const Addr a1, const Addr a2) argument
300 bm_access_store_1(struct bitmap* const bm, const Addr a1) argument
305 bm_access_store_2(struct bitmap* const bm, const Addr a1) argument
313 bm_access_store_4(struct bitmap* const bm, const Addr a1) argument
321 bm_access_store_8(struct bitmap* const bm, const Addr a1) argument
334 bm_has(struct bitmap* const bm, const Addr a1, const Addr a2, const BmAccessTypeT access_type) argument
369 bm_has_any_load(struct bitmap* const bm, const Addr a1, const Addr a2) argument
421 bm_has_any_store(struct bitmap* const bm, const Addr a1, const Addr a2) argument
476 bm_has_any_access(struct bitmap* const bm, const Addr a1, const Addr a2) argument
557 bm_clear(struct bitmap* const bm, Addr a1, Addr a2) argument
634 bm_clear_load(struct bitmap* const bm, Addr a1, Addr a2) argument
715 bm_clear_store(struct bitmap* const bm, const Addr a1, const Addr a2) argument
798 bm_test_and_clear(struct bitmap* const bm, const Addr a1, const Addr a2) argument
808 bm_has_conflict_with(struct bitmap* const bm, const Addr a1, const Addr a2, const BmAccessTypeT access_type) argument
874 bm_load_has_conflict_with(struct bitmap* const bm, const Addr a1, const Addr a2) argument
880 bm_load_1_has_conflict_with(struct bitmap* const bm, const Addr a1) argument
885 bm_load_2_has_conflict_with(struct bitmap* const bm, const Addr a1) argument
893 bm_load_4_has_conflict_with(struct bitmap* const bm, const Addr a1) argument
901 bm_load_8_has_conflict_with(struct bitmap* const bm, const Addr a1) argument
909 bm_store_1_has_conflict_with(struct bitmap* const bm, const Addr a1) argument
914 bm_store_2_has_conflict_with(struct bitmap* const bm, const Addr a1) argument
922 bm_store_4_has_conflict_with(struct bitmap* const bm, const Addr a1) argument
930 bm_store_8_has_conflict_with(struct bitmap* const bm, const Addr a1) argument
938 bm_store_has_conflict_with(struct bitmap* const bm, const Addr a1, const Addr a2) argument
1145 const UWord a1 = bm2->addr; local
[all...]
/external/apache-http/src/org/apache/http/util/
H A DLangUtils.java72 public static boolean equals(final Object[] a1, final Object[] a2) { argument
73 if (a1 == null) {
80 if (a2 != null && a1.length == a2.length) {
81 for (int i = 0; i < a1.length; i++) {
82 if (!equals(a1[i], a2[i])) {
/external/libcxx/test/containers/unord/unord.map/unord.map.swap/
H A Ddb_swap_1.pass.cpp30 P a1[] = {P(1, 1), P(3, 3), P(7, 7), P(9, 9), P(10, 10)}; local
32 std::unordered_map<int, int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
/external/libcxx/test/containers/unord/unord.multimap/unord.multimap.swap/
H A Ddb_swap_1.pass.cpp30 P a1[] = {P(1, 1), P(3, 3), P(7, 7), P(9, 9), P(10, 10)}; local
32 std::unordered_multimap<int, int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
/external/libcxx/test/containers/unord/unord.multiset/unord.multiset.swap/
H A Ddb_swap_1.pass.cpp29 int a1[] = {1, 3, 7, 9, 10}; local
31 std::unordered_multiset<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
/external/libcxx/test/containers/unord/unord.set/unord.set.swap/
H A Ddb_swap_1.pass.cpp29 int a1[] = {1, 3, 7, 9, 10}; local
31 std::unordered_set<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));

Completed in 3274 milliseconds

1234567891011>>