/external/clang/test/CodeGenCXX/ |
H A D | ptr-to-member-function.cpp | 48 struct B1 { struct 51 B1(int i) : pmf(&A::foo), im(i) { function in struct:B1 62 B1 b = B1(1); 63 B1 c = B1(2);
|
H A D | vtt-layout.cpp | 29 class B1 { int i; }; class in namespace:Test3 31 class V2 : public B1, public B2, public virtual V1 { int i; }; 48 class B1 { int i; }; class in namespace:Test4 50 class V2 : public B1, public B2, public virtual V1 { int i; };
|
H A D | copy-assign-synthesis-1.cpp | 9 B() : B1(3.14), B2(3.15), auB2(3.16) {} 10 float B1; member in struct:B 13 printf("B1 = %f B2 = %f auB1 = %f\n", B1, B2, auB1); 16 B& operator=(const B& arg) { B1 = arg.B1; B2 = arg.B2; 45 printf("arr_b[%d][%d] = %f\n", i,j,arr_b[i][j].B1);
|
H A D | ptr-to-datamember.cpp | 21 struct B1 : virtual V{ struct in inherits:V 26 class A : public B, public B1 { 89 printf("%d\n", &A::B1::iB1); 92 printf("%d\n", &A::B1::iV); 94 printf("%d\n", &A::B1::V::iV);
|
/external/clang/test/Layout/ |
H A D | ms-x86-empty-nonvirtual-bases.cpp | 9 struct __declspec(align(8)) B1 { B1() {printf("B1 : %p\n", this);} }; function 49 struct C : B0, B1, B2, B3, B4 { 61 // CHECK-NEXT: 8 | struct B1 (base) (empty) 74 B1 b1; 99 // CHECK: 24 | struct B1 b1 (empty) 106 struct E : B0, C0, C1, C2, B1 { 120 // CHECK-NEXT: 16 | struct B1 (base) (empty) 125 struct F : C0, B0, B1, C 158 struct __declspec(align(32)) H : B0, B1, B2, B3, B4 { variable [all...] |
H A D | ms-x86-primary-bases.cpp | 9 struct B1 { int a; B1() : a(0xf00000B1) { printf("B1 = %p\n", this); } virtual void g() { printf("B1"); } }; function in struct:B1 10 struct B2 { int a; B2() : a(0xf00000B2) { printf("B1 = %p\n", this); } }; 111 struct E : B0, virtual B1 { 123 // CHECK-NEXT: 12 | struct B1 (virtual base) 124 // CHECK-NEXT: 12 | (B1 vftable pointer) 135 // CHECK-X64-NEXT: 24 | struct B1 (virtual base) 136 // CHECK-X64-NEXT: 24 | (B1 vftabl [all...] |
H A D | ms-x86-vfvb-alignment.cpp | 9 struct B1 { char a; B1() : a(0xB1) {} }; function in struct:B1 10 struct B2 : virtual B1 { int a; B2() : a(0xf00000B2) {} }; 16 struct A : B0, virtual B1 { __declspec(align(16)) int a; A() : a(0xf000000A) {} virtual void f() { printf("A"); } }; 27 // CHECK-NEXT: 64 | struct B1 (virtual base) 40 // CHECK-X64-NEXT: 64 | struct B1 (virtual base) 60 // CHECK-NEXT: 80 | struct B1 (virtual base) 77 // CHECK-X64-NEXT: 96 | struct B1 (virtual base) 198 struct G : B2, B6, virtual B1 { int a; G() : a(0xf0000010) {} }; 210 // CHECK-NEXT: 20 | struct B1 (virtua [all...] |
H A D | ms-x86-aligned-tail-padding.cpp | 12 struct __declspec(align(16)) B1 { 14 B1() : a(0xf00000B1) {} function 72 struct A : B1, B0, B2, virtual V { 83 // CHECK-NEXT: 0 | struct B1 (base) 101 // CHECK-X64-NEXT: 0 | struct B1 (base) 114 struct B : B2, B0, B1, virtual V { 125 // CHECK-NEXT: 32 | struct B1 (base) 139 // CHECK-X64-NEXT: 32 | struct B1 (base) 148 struct C : B1, B0, virtual V { 156 // CHECK-NEXT: 0 | struct B1 (bas [all...] |
H A D | ms-x86-pack-and-align.cpp | 127 struct B1 : virtual A1 { char a; }; struct in inherits:A1 129 struct C1 : B1 {}; 135 // CHECK-NEXT: 0 | struct B1 (base) 136 // CHECK-NEXT: 0 | (B1 vbtable pointer) 146 // CHECK-X64-NEXT: 0 | struct B1 (base) 147 // CHECK-X64-NEXT: 0 | (B1 vbtable pointer)
|
H A D | ms-x86-vtordisp.cpp | 14 struct __declspec(align(16)) B1 { 16 B1() : a(0xf00000B1) {} function 17 virtual void f() { printf("B1"); } 25 struct A : virtual B0, virtual B1 { 43 // CHECK-NEXT: 44 | (vtordisp for vbase B1) 44 // CHECK-NEXT: 48 | struct B1 (virtual base) 45 // CHECK-NEXT: 48 | (B1 vftable pointer) 60 // CHECK-X64-NEXT: 76 | (vtordisp for vbase B1) 61 // CHECK-X64-NEXT: 80 | struct B1 (virtual base) 62 // CHECK-X64-NEXT: 80 | (B1 vftabl [all...] |
/external/clang/test/SemaCXX/ |
H A D | conversion-delete-expr.cpp | 18 struct B1 { struct 22 struct D1 : B1 {
|
H A D | warn-overloaded-virtual.cpp | 3 struct B1 { struct 8 struct S1 : public B1 { 12 struct S2 : public B1 {
|
H A D | cxx1y-contextual-conversion-tweaks.cpp | 69 struct B1 { struct in namespace:extended_examples 115 struct B1 { // leads to one viable match in both cases struct in namespace:extended_examples_cxx1y 137 void foo(A1 a1, A2 a2, B1 b1, B2 b2, C c, D d) {
|
H A D | default-assignment-operator.cpp | 61 class B1 { class 63 B1(); 64 B1 &operator = (B1 b); 67 class D1 : B1 {};
|
H A D | warn-enum-compare.cpp | 10 enum Baz {B1, B2, B3}; enumerator in enum:name1::Baz 14 enum Baz {B1, B2, B3}; enumerator in enum:name2::Baz 18 using name1::B1; 40 while (B1 == name1::B2); 41 while (B2 == name2::B1); 55 while ((B1) == (name1::B2)); 56 while ((B2) == (name2::B1)); 65 while ((((((B1))))) == (((name1::B2)))); 66 while (B2 == ((((((name2::B1))))))); 68 while (B1 [all...] |
H A D | warn-reorder-ctor-initialization.cpp | 61 struct B1 { struct 62 B1(); 65 struct F : public A1, public B1, private virtual V {
|
/external/clang/test/SemaTemplate/ |
H A D | dependent-base-member-init.cpp | 12 template<class C> class B1 : public A1 { class in inherits:A1 13 B1(C x) : A1(x.x) {} function in class:B1
|
/external/clang/test/Sema/ |
H A D | ms_bitfield_layout.c | 141 typedef struct B1 {
struct 146 } B1;
typedef in typeref:struct:B1 148 // CHECK: Type: struct B1
257 sizeof(B1) +
|
/external/llvm/include/llvm/Analysis/ |
H A D | Trace.h | 76 /// Returns true if B1 occurs before B2 in the trace, or if it is the same 79 bool dominates(const BasicBlock *B1, const BasicBlock *B2) const { argument 80 int B1Idx = getBlockIndex(B1), B2Idx = getBlockIndex(B2);
|
/external/llvm/unittests/Analysis/ |
H A D | LazyCallGraphTest.cpp | 137 LazyCallGraph::Node &B1 = *I++; local 138 EXPECT_EQ("b1", B1.getFunction().getName()); 174 for (LazyCallGraph::Node &N : B1) 456 LazyCallGraph::Node &B1 = *CG.lookup(lookupFunction(*M, "b1")); local 466 LazyCallGraph::SCC &BC = *CG.lookupSCC(B1); 500 EXPECT_EQ(&BC, CG.lookupSCC(B1));
|
/external/aac/libSBRenc/src/ |
H A D | resampler.cpp | 99 #define B1 0 macro 108 const FIXP_SGL *coeffa; /*! SOS matrix One row/section. Scaled using BQC(). Order of coefficients: B1,B2,A1,A2. B0=A0=1.0 */ 405 state0 = input + fMult(state1, coeff[B1]) + fMult(state2, coeff[B2]); 441 y = state0 + fMult(state1, coeff[B1]) + fMult(state2, coeff[B2]);
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | CubeRoot.cpp | 77 const unsigned int B1 = 715094163; local 81 pt[1]=px[1]/3+B1; 93 const unsigned int B1 = 71509416*5/3; 97 pt[1]=px[1]/5+B1;
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkPathOpsTypes.cpp | 168 const unsigned int B1 = 715094163; local 172 pt[1] = px[1] / 3 + B1;
|
/external/clang/test/CXX/special/class.copy/ |
H A D | p23-cxx11.cpp | 77 struct B1 { struct 86 template struct CopyAssign<B1>; // expected-note {{here}} 87 template struct MoveAssign<B1>; // expected-note {{here}}
|
/external/clang/test/CXX/special/class.dtor/ |
H A D | p5-0x.cpp | 44 struct B1 { struct 45 B1(); 48 B1 b1; // expected-error {{deleted function}}
|