1 ; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
2 ; RUN: opt < %s -simplifycfg -simplifycfg-require-and-preserve-domtree=1 -S | FileCheck %s
4 ; In PR17073 ( http://llvm.org/pr17073 ), we illegally hoisted an operation that can trap.
5 ; The first test confirms that we don't do that when the trapping op is reached by the current BB (block1).
6 ; The second test confirms that we don't do that when the trapping op is reached by the previous BB (entry).
7 ; The third test confirms that we can still do this optimization for an operation (add) that doesn't trap.
8 ; The tests must be complicated enough to prevent previous SimplifyCFG actions from optimizing away
9 ; the instructions that we're checking for.
11 target datalayout = "e-m:o-p:32:32-f64:32:64-f80:128-n8:16:32-S128"
12 target triple = "i386-apple-macosx10.9.0"
14 @a = common global i32 0, align 4
15 @b = common global i8 0, align 1
17 define i32* @can_trap1() {
18 ; CHECK-LABEL: @can_trap1(
20 ; CHECK-NEXT: [[TMP0:%.*]] = load i32, i32* @a, align 4
21 ; CHECK-NEXT: [[TOBOOL:%.*]] = icmp eq i32 [[TMP0]], 0
22 ; CHECK-NEXT: br i1 [[TOBOOL]], label [[EXIT:%.*]], label [[BLOCK1:%.*]]
24 ; CHECK-NEXT: br i1 icmp eq (i32* bitcast (i8* @b to i32*), i32* @a), label [[EXIT]], label [[BLOCK2:%.*]]
26 ; CHECK-NEXT: br label [[EXIT]]
28 ; CHECK-NEXT: [[STOREMERGE:%.*]] = phi i32* [ null, [[ENTRY:%.*]] ], [ null, [[BLOCK2]] ], [ select (i1 icmp eq (i64 urem (i64 2, i64 zext (i1 icmp eq (i32* bitcast (i8* @b to i32*), i32* @a) to i64)), i64 0), i32* null, i32* @a), [[BLOCK1]] ]
29 ; CHECK-NEXT: ret i32* [[STOREMERGE]]
32 %0 = load i32, i32* @a, align 4
33 %tobool = icmp eq i32 %0, 0
34 br i1 %tobool, label %exit, label %block1
37 br i1 icmp eq (i32* bitcast (i8* @b to i32*), i32* @a), label %exit, label %block2
43 %storemerge = phi i32* [ null, %entry ],[ null, %block2 ], [ select (i1 icmp eq (i64 urem (i64 2, i64 zext (i1 icmp eq (i32* bitcast (i8* @b to i32*), i32* @a) to i64)), i64 0), i32* null, i32* @a), %block1 ]
47 define i32* @can_trap2() {
48 ; CHECK-LABEL: @can_trap2(
50 ; CHECK-NEXT: [[TMP0:%.*]] = load i32, i32* @a, align 4
51 ; CHECK-NEXT: [[TOBOOL:%.*]] = icmp eq i32 [[TMP0]], 0
52 ; CHECK-NEXT: br i1 [[TOBOOL]], label [[EXIT:%.*]], label [[BLOCK1:%.*]]
54 ; CHECK-NEXT: br label [[EXIT]]
56 ; CHECK-NEXT: [[STOREMERGE:%.*]] = phi i32* [ select (i1 icmp eq (i64 urem (i64 2, i64 zext (i1 icmp eq (i32* bitcast (i8* @b to i32*), i32* @a) to i64)), i64 0), i32* null, i32* @a), [[ENTRY:%.*]] ], [ null, [[BLOCK1]] ]
57 ; CHECK-NEXT: ret i32* [[STOREMERGE]]
60 %0 = load i32, i32* @a, align 4
61 %tobool = icmp eq i32 %0, 0
62 br i1 %tobool, label %exit, label %block1
65 br i1 icmp eq (i32* bitcast (i8* @b to i32*), i32* @a), label %exit, label %block2
71 %storemerge = phi i32* [ select (i1 icmp eq (i64 urem (i64 2, i64 zext (i1 icmp eq (i32* bitcast (i8* @b to i32*), i32* @a) to i64)), i64 0), i32* null, i32* @a), %entry ],[ null, %block2 ], [ null, %block1 ]
75 define i32* @cannot_trap() {
76 ; CHECK-LABEL: @cannot_trap(
78 ; CHECK-NEXT: [[TMP0:%.*]] = load i32, i32* @a, align 4
79 ; CHECK-NEXT: [[TOBOOL:%.*]] = icmp eq i32 [[TMP0]], 0
80 ; CHECK-NEXT: [[SPEC_SELECT:%.*]] = select i1 icmp eq (i32* bitcast (i8* @b to i32*), i32* @a), i32* select (i1 icmp eq (i64 add (i64 zext (i1 icmp eq (i32* bitcast (i8* @b to i32*), i32* @a) to i64), i64 2), i64 0), i32* null, i32* @a), i32* null
81 ; CHECK-NEXT: [[STOREMERGE:%.*]] = select i1 [[TOBOOL]], i32* null, i32* [[SPEC_SELECT]]
82 ; CHECK-NEXT: ret i32* [[STOREMERGE]]
85 %0 = load i32, i32* @a, align 4
86 %tobool = icmp eq i32 %0, 0
87 br i1 %tobool, label %exit, label %block1
90 br i1 icmp eq (i32* bitcast (i8* @b to i32*), i32* @a), label %exit, label %block2
96 %storemerge = phi i32* [ null, %entry ],[ null, %block2 ], [ select (i1 icmp eq (i64 add (i64 2, i64 zext (i1 icmp eq (i32* bitcast (i8* @b to i32*), i32* @a) to i64)), i64 0), i32* null, i32* @a), %block1 ]