/external/clang/test/CXX/temp/temp.decls/temp.fct/temp.over.link/ |
H A D | p6.cpp | 4 struct A0 { struct 8 template<int X, int Y> void f0(A0<X, Y>) { } // expected-note{{previous}} 9 template<int N, int M> void f0(A0<M, N>) { } 10 template<int V1, int V2> void f0(A0<V1, V2>) { } // expected-error{{redefinition}} 12 template<int X, int Y> void f1(A0<0, (X + Y)>) { } // expected-note{{previous}} 13 template<int X, int Y> void f1(A0<0, (X - Y)>) { } 14 template<int A, int B> void f1(A0<0, (A + B)>) { } // expected-error{{redefinition}} 16 template<int X, int Y> void A0<X, Y>::g0() { }
|
/external/libcxx/test/utilities/memory/allocator.traits/allocator.traits.members/ |
H A D | destroy.pass.cpp | 47 struct A0 struct 50 ~A0() {++count;} 53 int A0::count = 0; 58 A0::count = 0; 60 std::aligned_storage<sizeof(A0)>::type a0; 61 std::allocator_traits<A<int> >::construct(a, (A0*)&a0); 62 assert(A0::count == 0); 63 std::allocator_traits<A<int> >::destroy(a, (A0*)&a0); 64 assert(A0::count == 1); 68 A0 [all...] |
H A D | construct.pass.cpp | 49 struct A0 struct 52 A0() {++count;} function in struct:A0 55 int A0::count = 0; 85 A0::count = 0; 87 std::aligned_storage<sizeof(A0)>::type a0; 88 assert(A0::count == 0); 89 std::allocator_traits<A<int> >::construct(a, (A0*)&a0); 90 assert(A0::count == 1); 110 A0::count = 0; 113 std::aligned_storage<sizeof(A0)> [all...] |
/external/libcxx/test/utilities/meta/meta.unary/meta.unary.prop/ |
H A D | is_trivially_constructible.pass.cpp | 23 template <class T, class A0> 26 static_assert(( std::is_trivially_constructible<T, A0>::value), ""); 35 template <class T, class A0> 38 static_assert((!std::is_trivially_constructible<T, A0>::value), ""); 41 template <class T, class A0, class A1> 44 static_assert((!std::is_trivially_constructible<T, A0, A1>::value), "");
|
H A D | is_constructible.pass.cpp | 33 template <class T, class A0> 36 static_assert( (std::is_constructible<T, A0>::value), ""); 39 template <class T, class A0, class A1> 42 static_assert( (std::is_constructible<T, A0, A1>::value), ""); 51 template <class T, class A0> 54 static_assert((!std::is_constructible<T, A0>::value), "");
|
H A D | is_nothrow_constructible.pass.cpp | 23 template <class T, class A0> 26 static_assert(( std::is_nothrow_constructible<T, A0>::value), ""); 35 template <class T, class A0> 38 static_assert((!std::is_nothrow_constructible<T, A0>::value), ""); 41 template <class T, class A0, class A1> 44 static_assert((!std::is_nothrow_constructible<T, A0, A1>::value), "");
|
/external/clang/test/CodeGen/ |
H A D | pr5406.c | 5 typedef struct { char x[3]; } A0; typedef in typeref:struct:__anon17895 12 A0 a3;
|
/external/clang/INPUTS/ |
H A D | macro_pounder_obj.c | 6 #define A0 a b macro 7 #define A1 A0 A0 A0 A0 A0 A0
|
H A D | macro_pounder_fn.c | 6 #define A0(A, B) A B macro 7 #define A1(A, B) A0(A,B) A0(A,B) A0(A,B) A0(A,B) A0(A,B) A0(A,B)
|
/external/clang/test/Index/ |
H A D | annotate-comments-preprocessor.c | 14 #define A0 0 macro 22 int A[] = { A0, A1, A2, A3, A4, A5, A6 }; 24 #if A0 /** Aaa. */
|
/external/linux-tools-perf/perf-3.12.0/arch/metag/lib/ |
H A D | memset.S | 15 ADD A0.2,D0Ar2,D0Re0 ! Duplicate byte value into 4 (A0.2) 33 MOV A1.2,A0.2 38 SETL [D1Ar1++],A0.2,A1.2 39 SETL [D1Ar1++],A0.2,A1.2 40 SETL [D1Ar1++],A0.2,A1.2 41 SETL [D1Ar1++],A0.2,A1.2 55 SETL [D1Ar1++],A0.2,A1.2 72 SETB [D1Ar1+#(-7)],A0.2 73 SETB [D1Ar1+#(-6)],A0 [all...] |
/external/chromium_org/third_party/openssl/openssl/crypto/bn/asm/ |
H A D | x86_64-mont.pl | 702 my @A0=("%r10","%r11"); 762 mov %rax,$A0[0] # a[1]*a[0] 764 mov %rdx,$A0[1] 765 mov $A0[0],-24($tptr,$i) # t[1] 767 xor $A0[0],$A0[0] 769 add %rax,$A0[1] 771 adc %rdx,$A0[0] 772 mov $A0[1],-16($tptr,$i) # t[2] 783 xor $A0[ [all...] |
/external/openssl/crypto/bn/asm/ |
H A D | x86_64-mont.pl | 702 my @A0=("%r10","%r11"); 762 mov %rax,$A0[0] # a[1]*a[0] 764 mov %rdx,$A0[1] 765 mov $A0[0],-24($tptr,$i) # t[1] 767 xor $A0[0],$A0[0] 769 add %rax,$A0[1] 771 adc %rdx,$A0[0] 772 mov $A0[1],-16($tptr,$i) # t[2] 783 xor $A0[ [all...] |
/external/bluetooth/bluedroid/conf/ |
H A D | auto_pair_devlist.conf | 13 AddressBlacklist=00:02:C7,00:16:FE,00:19:C1,00:1B:FB,00:1E:3D,00:21:4F,00:23:06,00:24:33,00:A0:79,00:0E:6D,00:13:E0,00:21:E8,00:60:57,00:0E:9F,00:12:1C,00:18:91,00:18:96,00:13:04,00:16:FD,00:22:A0,00:0B:4C,00:60:6F,00:23:3D,00:C0:59,00:0A:30,00:1E:AE,00:1C:D7,00:80:F0,00:12:8A,00:09:93,00:80:37,00:26:7E,00:26:e8
|
/external/clang/lib/CodeGen/ |
H A D | EHScopeStack.h | 180 template <class T, class A0> 182 typedef typename DominatingValue<A0>::saved_type A0_saved; 186 A0 a0 = DominatingValue<A0>::restore(CGF, a0_saved); 195 template <class T, class A0, class A1> 197 typedef typename DominatingValue<A0>::saved_type A0_saved; 203 A0 a0 = DominatingValue<A0>::restore(CGF, a0_saved); 213 template <class T, class A0, class A1, class A2> 215 typedef typename DominatingValue<A0> [all...] |
/external/clang/test/CXX/temp/temp.param/ |
H A D | p9-0x.cpp | 27 struct A0 { template<typename U> struct B; }; struct in namespace:PR8748 28 template<typename U = int> struct A0::B { };
|
/external/lldb/include/lldb/Utility/ |
H A D | CleanUp.h | 186 template <typename T, typename R, typename A0> 191 typedef R (*CallbackType)(value_type, A0); 198 CleanUp2 (value_type value, CallbackType callback, A0 arg) : 213 CleanUp2 (value_type value, value_type invalid, CallbackType callback, A0 arg) : 314 A0 m_argument;
|
H A D | SharingPtr.h | 96 template <class A0> 97 shared_ptr_emplace(A0& a0) 100 template <class A0, class A1> 101 shared_ptr_emplace(A0& a0, A1& a1) 104 template <class A0, class A1, class A2> 105 shared_ptr_emplace(A0& a0, A1& a1, A2& a2) 108 template <class A0, class A1, class A2, class A3> 109 shared_ptr_emplace(A0& a0, A1& a1, A2& a2, A3& a3) 112 template <class A0, class A1, class A2, class A3, class A4> 113 shared_ptr_emplace(A0 [all...] |
/external/eigen/Eigen/src/Core/products/ |
H A D | GeneralBlockPanelKernel.h | 598 LhsPacket A0, A1; local 603 traits.loadLhs(&blA[0*LhsProgress], A0); 606 traits.madd(A0,B_0,C0,T0); 609 traits.madd(A0,B_0,C1,T0); 612 traits.loadLhs(&blA[2*LhsProgress], A0); 615 traits.madd(A0,B_0,C0,T0); 618 traits.madd(A0,B_0,C1,T0); 621 traits.loadLhs(&blA[4*LhsProgress], A0); 624 traits.madd(A0,B_0,C0,T0); 627 traits.madd(A0,B_ 643 LhsPacket A0, A1; local 715 LhsPacket A0, A1; local 730 LhsPacket A0, A1; local 827 LhsPacket A0; local 853 LhsPacket A0; local 905 LhsPacket A0; local 916 LhsPacket A0; local 971 LhsScalar A0; local 982 LhsScalar A0; local 1027 LhsPacket A0, A1; local 1066 LhsPacket A0; local 1091 LhsScalar A0 = blA[k]; local [all...] |
H A D | SelfadjointMatrixVector.h | 82 const Scalar* EIGEN_RESTRICT A0 = lhs + j*lhsStride; local 101 res[j] += cjd.pmul(numext::real(A0[j]), t0); 110 res[j+1] += cj0.pmul(A0[j+1],t0); 111 t2 += cj1.pmul(A0[j+1], rhs[j+1]); 116 res[i] += t0 * A0[i] + t1 * A1[i]; 117 t2 += numext::conj(A0[i]) * rhs[i]; 122 const Scalar* EIGEN_RESTRICT a0It = A0 + alignedStart; 140 res[i] += cj0.pmul(A0[i], t0) + cj0.pmul(A1[i],t1); 141 t2 += cj1.pmul(A0[i], rhs[i]); 150 const Scalar* EIGEN_RESTRICT A0 local [all...] |
/external/linux-tools-perf/perf-3.12.0/arch/c6x/lib/ |
H A D | memcpy_64plus.S | 16 AND .L1 0x1,A6,A0 22 [A0] LDB .D2T1 *B4++,A5 29 [A0] STB .D1T1 A5,*A3++
|
/external/arduino/hardware/arduino/cores/arduino/ |
H A D | WProgram.h | 34 const static uint8_t A0 = 54; variable 51 const static uint8_t A0 = 14; variable
|
/external/clang/test/CXX/temp/temp.res/temp.dep/ |
H A D | p3.cpp | 2 struct A0 { struct 6 template <typename T> struct B0: A0 {
|
/external/clang/test/SemaCXX/ |
H A D | cxx1y-contextual-conversion-tweaks.cpp | 49 struct A0 { struct in namespace:extended_examples 79 void foo(A0 a0, A1 a1, A2 a2, A3 a3, A4 a4, B2 b2) {
|
/external/eigen/Eigen/src/SparseLU/ |
H A D | SparseLU_gemm_kernel.h | 86 const Scalar* A0 = A+ib+(k+0)*lda; local 94 a0 = pload<Packet>(A0); 113 a0 = pload<Packet>(A0+i+(I+1)*PacketSize); \ 130 prefetch((A0+i+(5)*PacketSize)); 154 C0[i] += A0[i]*Bc0[0]+A1[i]*Bc0[1]+A2[i]*Bc0[2]+A3[i]*Bc0[3]; 155 C1[i] += A0[i]*Bc1[0]+A1[i]*Bc1[1]+A2[i]*Bc1[2]+A3[i]*Bc1[3]; 159 C0[i] += A0[i]*Bc0[0]+A1[i]*Bc0[1]; 160 C1[i] += A0[i]*Bc1[0]+A1[i]*Bc1[1]; 185 const Scalar* A0 = A+ib+(k+0)*lda; local 192 a0 = pload<Packet>(A0); [all...] |