1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
|
; RUN: opt < %s -passes=globalopt -S -o - | FileCheck %s
%class.Class = type { i8, i8, i8, i8 }
@A = local_unnamed_addr global %class.Class undef, align 4
@B = local_unnamed_addr global %class.Class undef, align 4
@llvm.global_ctors = appending global [2 x { i32, ptr, ptr }] [
{ i32, ptr, ptr } { i32 65535, ptr @initA, ptr null },
{ i32, ptr, ptr } { i32 65535, ptr @initB, ptr null }
]
define internal void @initA() section "__TEXT,__StaticInit,regular,pure_instructions" {
entry:
store i32 -1, ptr @A, align 4
ret void
}
define internal void @initB() section "__TEXT,__StaticInit,regular,pure_instructions" {
entry:
store i8 -1, ptr @B, align 4
ret void
}
; rdar://79503568
; Check that we don't miscompile when the store covers the whole struct.
; CHECK-NOT: @A = local_unnamed_addr global %class.Class { i8 -1, i8 undef, i8 undef, i8 undef }, align 4
; FIXME: We could optimzie this as { i8 -1, i8 -1, i8 -1, i8 -1 } if constant folding were a little smarter.
; CHECK: @A = local_unnamed_addr global %class.Class undef, align 4
; Check that we still perform the transform when store is smaller than the width of the 0th element.
; CHECK: @B = local_unnamed_addr global %class.Class { i8 -1, i8 undef, i8 undef, i8 undef }, align 4
; CHECK: define internal void @initA()
; CHECK-NOT: define internal void @initB()
|
