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

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,998,520 kB
  • sloc: cpp: 6,951,680; ansic: 1,486,157; asm: 913,598; python: 232,024; f90: 80,126; objc: 75,281; lisp: 37,276; pascal: 16,990; sh: 10,009; ml: 5,058; perl: 4,724; awk: 3,523; makefile: 3,167; javascript: 2,504; xml: 892; fortran: 664; cs: 573
file content (10 lines) | stat: -rw-r--r-- 471 bytes parent folder | download | duplicates (36)
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 }