File: microsoft-abi-non-virtual-base-ordering.cpp

package info (click to toggle)
llvm-toolchain-11 1%3A11.0.1-2~deb10u1
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 995,836 kB
  • sloc: cpp: 4,767,656; ansic: 760,916; asm: 477,436; python: 170,940; objc: 69,804; lisp: 29,914; sh: 23,855; f90: 18,173; pascal: 7,551; perl: 7,471; ml: 5,603; awk: 3,489; makefile: 2,573; xml: 915; cs: 573; fortran: 503; javascript: 452
file content (10 lines) | stat: -rw-r--r-- 471 bytes parent folder | download | duplicates (40) 
1
2
3
4
5
6
7
8
9
10
 
// RUN: %clang_cc1 -fno-rtti -emit-llvm -triple=i686-pc-win32 -o - %s  2>/dev/null | FileCheck %s
// RUN: %clang_cc1 -fno-rtti -emit-llvm -triple=x86_64-pc-win32 -o - %s  2>/dev/null | FileCheck %s

struct C0 { int a; };
struct C1 { int a; virtual void C1M() {} };
struct C2 { int a; virtual void C2M() {} };
struct C3 : C0, C1, C2 {} a;

// Check to see that both C1 and C2 get laid out before C0 does.
// CHECK: %struct.C3 = type { %struct.C1, %struct.C2, %struct.C0 }