123 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_test_checks.py2; RUN: opt < %s -passes=newgvn -S | FileCheck %s3 4target datalayout = "e-m:o-i64:64-f80:128-n8:16:32:64-S128"5 6define i1 @patatino(ptr %blah, i32 %choice) {7; CHECK-LABEL: @patatino(8; CHECK-NEXT: entry:9; CHECK-NEXT: br label [[WHILE_COND:%.*]]10; CHECK: while.cond:11; CHECK-NEXT: [[FOO:%.*]] = phi ptr [ [[BLAH:%.*]], [[ENTRY:%.*]] ], [ null, [[WHILE_BODY:%.*]] ]12; CHECK-NEXT: switch i32 [[CHOICE:%.*]], label [[WHILE_BODY]] [13; CHECK-NEXT: i32 -1, label [[WHILE_END:%.*]]14; CHECK-NEXT: i32 40, label [[LAND_END:%.*]]15; CHECK-NEXT: ]16; CHECK: land.end:17; CHECK-NEXT: br label [[WHILE_END]]18; CHECK: while.body:19; CHECK-NEXT: br label [[WHILE_COND]]20; CHECK: while.end:21; CHECK-NEXT: store i8 0, ptr [[FOO]], align 122; CHECK-NEXT: [[TMP0:%.*]] = load i8, ptr [[BLAH]], align 123; CHECK-NEXT: [[LOADED:%.*]] = icmp eq i8 [[TMP0]], 024; CHECK-NEXT: store i8 0, ptr [[BLAH]], align 125; CHECK-NEXT: ret i1 [[LOADED]]26;27entry:28 br label %while.cond29 30while.cond:31 %foo = phi ptr [ %blah, %entry ], [ null, %while.body ]32 switch i32 %choice, label %while.body [33 i32 -1, label %while.end34 i32 40, label %land.end35 ]36 37land.end:38 br label %while.end39 40while.body:41 br label %while.cond42 43while.end:44 %foo.lcssa = phi ptr [ %foo, %land.end ], [ %foo, %while.cond ]45;; These two stores will initially be considered equivalent, but then proven not.46;; the second store would previously end up deciding it's equivalent to a previous47;; store, but it was really just finding an optimistic version of itself48;; in the congruence class.49 store i8 0, ptr %foo.lcssa, align 150 %0 = load i8, ptr %blah, align 151 %loaded = icmp eq i8 %0, 052 store i8 0, ptr %blah, align 153 ret i1 %loaded54}55 56 57;; This is an example of a case where the memory states are equivalent solely due to unreachability,58;; but the stores are not equal.59define void @foo(ptr %arg, i1 %arg2, i1 %arg3) {60; CHECK-LABEL: @foo(61; CHECK-NEXT: bb:62; CHECK-NEXT: br label [[BB1:%.*]]63; CHECK: bb1:64; CHECK-NEXT: [[TMP:%.*]] = phi ptr [ [[ARG:%.*]], [[BB:%.*]] ], [ null, [[BB2:%.*]] ]65; CHECK-NEXT: br i1 [[ARG2:%.*]], label [[BB3:%.*]], label [[BB2]]66; CHECK: bb2:67; CHECK-NEXT: br label [[BB1]]68; CHECK: bb3:69; CHECK-NEXT: store i8 0, ptr [[TMP]], align 1, !g [[META0:![0-9]+]]70; CHECK-NEXT: br label [[BB4:%.*]]71; CHECK: bb4:72; CHECK-NEXT: br label [[BB6:%.*]]73; CHECK: bb6:74; CHECK-NEXT: br i1 [[ARG3:%.*]], label [[BB9:%.*]], label [[BB7:%.*]]75; CHECK: bb7:76; CHECK-NEXT: switch i8 0, label [[BB6]] [77; CHECK-NEXT: i8 6, label [[BB8:%.*]]78; CHECK-NEXT: ]79; CHECK: bb8:80; CHECK-NEXT: store i8 poison, ptr null, align 181; CHECK-NEXT: br label [[BB4]]82; CHECK: bb9:83; CHECK-NEXT: store i8 0, ptr [[ARG]], align 1, !g [[META0]]84; CHECK-NEXT: unreachable85;86bb:87 br label %bb188 89bb1: ; preds = %bb2, %bb90 %tmp = phi ptr [ %arg, %bb ], [ null, %bb2 ]91 br i1 %arg2, label %bb3, label %bb292 93bb2: ; preds = %bb194 br label %bb195 96bb3: ; preds = %bb197 store i8 0, ptr %tmp, !g !098 br label %bb499 100bb4: ; preds = %bb8, %bb3101 %tmp5 = phi ptr [ null, %bb8 ], [ %arg, %bb3 ]102 br label %bb6103 104bb6: ; preds = %bb7, %bb4105 br i1 %arg3, label %bb9, label %bb7106 107bb7: ; preds = %bb6108 switch i8 0, label %bb6 [109 i8 6, label %bb8110 ]111 112bb8: ; preds = %bb7113 store i8 undef, ptr %tmp5, !g !0114 br label %bb4115 116bb9: ; preds = %bb6117 %tmp10 = phi ptr [ %tmp5, %bb6 ]118 store i8 0, ptr %tmp10, !g !0119 unreachable120}121 122!0 = !{}123