/external/clang/test/CodeGen/ |
H A D | pr5406.c | 5 typedef struct { char x[3]; } A0; typedef in typeref:struct:__anon1859 12 A0 a3;
|
/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/std/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/clang/INPUTS/ |
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)
|
H A D | macro_pounder_obj.c | 6 #define A0 a b macro 7 #define A1 A0 A0 A0 A0 A0 A0
|
/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/clang/test/Analysis/ |
H A D | NewDeleteLeaks-PR19102.cpp | 3 class A0 {}; class 26 new A0; // expected-warning@+1 {{Potential memory leak}}
|
/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/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/llvm/lib/Transforms/ObjCARC/ |
H A D | ARCInstKind.cpp | 94 const Argument *A0 = AI++; local 97 if (PointerType *PTy = dyn_cast<PointerType>(A0->getType())) { 134 if (PointerType *PTy = dyn_cast<PointerType>(A0->getType()))
|
/external/llvm/unittests/IR/ |
H A D | ValueHandleTest.cpp | 391 AssertingVH<Value> &A0, AssertingVH<Value> &A1) 393 ToClear[0] = &A0; 390 ClearingVH(Value *V, AssertingVH<Value> &A0, AssertingVH<Value> &A1) argument
|
/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/clang/test/SemaTemplate/ |
H A D | class-template-spec.cpp | 55 template<typename T> struct A0; 60 struct A0<void> { struct in namespace:N 67 struct A0 { struct in namespace:N 68 void foo(A0<void>::pointer p = 0);
|
H A D | instantiate-method.cpp | 77 template<class T> struct A0 { operator T*(); }; struct 80 int *a(A0<int> &x0, A1<int> &x1) {
|
H A D | temp_class_spec.cpp | 328 template<typename T, T N, typename U> class A0; 330 template<typename T, T N> class A0<T, N, int> { }; // expected-note{{here}} class 331 template<typename T, T N> class A0<T, N, int>; 332 template<typename T, T N> class A0<T, N, int> { }; // expected-error{{redef}} class
|
/external/eigen/Eigen/src/Core/products/ |
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...] |
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...] |
/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...] |
/external/eigen/bench/btl/libs/eigen3/ |
H A D | eigen3_interface.hh | 122 Scalar* A0 = dst.data() + j*dst.stride(); local 125 int alignedStart = (starti) + internal::first_aligned(&A0[starti], size-starti);
|
/external/llvm/lib/Transforms/Instrumentation/ |
H A D | SanitizerCoverage.cpp | 328 Value *A0 = ICMP->getOperand(0); local 330 if (!A0->getType()->isIntegerTy()) continue; 331 uint64_t TypeSize = DL->getTypeStoreSizeInBits(A0->getType()); 332 // __sanitizer_cov_indir_call((type_size << 32) | predicate, A0, A1); 336 IRB.CreateIntCast(A0, Int64Ty, true),
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | MergedLoadStoreMotion.cpp | 338 Instruction *A0 = dyn_cast<Instruction>(L0->getPointerOperand()); local 340 if (A0 && A1 && A0->isIdenticalTo(A1) && isSafeToHoist(A0) && 341 A0->hasOneUse() && (A0->getParent() == L0->getParent()) && 343 isa<GetElementPtrInst>(A0)) { 347 hoistInstruction(BB, A0, A1); 479 Instruction *A0 = dyn_cast<Instruction>(S0->getPointerOperand()); local 481 if (A0 [all...] |
/external/llvm/lib/IR/ |
H A D | Attributes.cpp | 709 AttributeSetImpl *A0 = Attrs[0].pImpl; local 710 if (A0) 711 AttrNodeVec.append(A0->getNode(0), A0->getNode(A0->getNumAttributes()));
|
/external/llvm/unittests/ADT/ |
H A D | SmallVectorTest.cpp | 793 EmplaceableArg<0> A0; member in struct:__anon11224::Emplaceable 802 explicit Emplaceable(A0Ty &&A0) argument 803 : A0(std::forward<A0Ty>(A0)), State(ES_Emplaced) {} 806 Emplaceable(A0Ty &&A0, A1Ty &&A1) argument 807 : A0(std::forward<A0Ty>(A0)), A1(std::forward<A1Ty>(A1)), 811 Emplaceable(A0Ty &&A0, A1Ty &&A1, A2Ty &&A2) argument 812 : A0(std::forward<A0Ty>(A0)), A 816 Emplaceable(A0Ty &&A0, A1Ty &&A1, A2Ty &&A2, A3Ty &&A3) argument [all...] |
/external/libvpx/libvpx/vpx_dsp/arm/ |
H A D | intrapred_neon.c | 245 const uint8x16_t A0 = vld1q_u8(above); // top row local 247 const uint16x8_t p0 = vpaddlq_u8(A0); // cascading summation of the top 320 const uint64x1_t A0 = vreinterpret_u64_u8(vld1_u8(above)); // top row local 321 const uint64x1_t A1 = vshr_n_u64(A0, 8); 322 const uint64x1_t A2 = vshr_n_u64(A0, 16); 323 const uint8x8_t ABCDEFGH = vreinterpret_u8_u64(A0); 347 const uint8x8_t A0 = vld1_u8(above); // top row local 348 const uint8x8_t A1 = vtbl1_u8(A0, sh_12345677); 349 const uint8x8_t A2 = vtbl1_u8(A0, sh_23456777); 350 const uint8x8_t avg1 = vhadd_u8(A0, A 363 const uint8x16_t A0 = vld1q_u8(above); // top row local [all...] |