Testcase for a recent checkin for vbase layout ordering. I hate to

optimize and check for non-optimal code, but until the frontend is as
powerful as fold...

git-svn-id: https://llvm.org/svn/llvm-project/cfe/trunk@78309 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/test/CodeGenCXX/virt.cpp b/test/CodeGenCXX/virt.cpp
index a90e7228d3ecfc224af7c0b4911d79faf436048f..35548de04360e3d6a637f9ec310093a9baafe66d 100644 (file)
--- a/test/CodeGenCXX/virt.cpp
+++ b/test/CodeGenCXX/virt.cpp
@@ -1,6 +1,6 @@
-// RUN: clang-cc -triple x86_64-apple-darwin -frtti=0 -std=c++0x -S %s -o %t-64.s &&
+// RUN: clang-cc -triple x86_64-apple-darwin -frtti=0 -std=c++0x -O3 -S %s -o %t-64.s &&
 // RUN: FileCheck -check-prefix LP64 --input-file=%t-64.s %s &&
-// RUN: clang-cc -triple i386-apple-darwin -frtti=0 -std=c++0x -S %s -o %t-32.s &&
+// RUN: clang-cc -triple i386-apple-darwin -frtti=0 -std=c++0x -O3 -S %s -o %t-32.s &&
 // RUN: FileCheck -check-prefix LP32 -input-file=%t-32.s %s &&
 // RUN: true
 
@@ -24,6 +24,30 @@ struct D {
 };
 void D::boo() { }
 
+struct D1 {
+  virtual void bar();
+  void *d1;
+};
+void D1::bar() { }
+
+class F : virtual public D1, virtual public D {
+public:
+  virtual void foo();
+  void *f;
+};
+void F::foo() { }
+
+int j;
+void test2() {
+  F f;
+  static int sz = (char *)(&f.f) - (char *)(&f);
+  j = sz;
+  // CHECK-LP32: movl $4, __ZZ5test2vE2sz
+  // CHECK-LP64: movl $8, __ZZ5test2vE2sz(%rip)
+}
+  
+static_assert(sizeof(F) == sizeof(void*)*4, "invalid vbase size");
+
 struct E {
   int e;
 };
@@ -90,23 +114,3 @@ int main() {
 // CHECK-LP32: .space 4
 // CHECK-LP32: .long __ZN1C4bee1Ev
 // CHECK-LP32: .long __ZN1C4bee2Ev
-
-struct D1 {
-  virtual void bar();
-  void *d1;
-};
-void D1::bar() { }
-
-class F : virtual public D1, virtual public D {
-public:
-  virtual void foo();
-  void *f;
-};
-void F::foo() { }
-
-void test2() {
-  F f;
-  f.f = 0;
-}
-  
-static_assert(sizeof(F) == sizeof(void*)*4, "invalid vbase size");