; Test case for PR44949.
+declare void @use(i1)
+
; We can remove `%res = and i64 %p, 255`, because %r = 0 and we can eliminate
; %p as well.
define i64 @constant_and_undef(i1 %c1, i64 %a) {
; CHECK-NEXT: [[R:%.*]] = and i64 [[A:%.*]], 0
; CHECK-NEXT: br label [[BB3]]
; CHECK: bb3:
+; CHECK-NEXT: call void @use(i1 false)
+; CHECK-NEXT: call void @use(i1 true)
; CHECK-NEXT: ret i64 0
;
entry:
bb3:
%p = phi i64 [ undef, %bb1 ], [ %r, %bb2 ]
%res = and i64 %p, 255
+ %f.1 = icmp eq i64 %p, 1
+ call void @use(i1 %f.1)
+ %t.1 = icmp eq i64 %p, 0
+ call void @use(i1 %t.1)
ret i64 %res
}
; Check that we go to overdefined when merging a constant range with undef. We
; cannot remove '%res = and i64 %p, 255'.
-; FIXME: should not remove '%res = and i64 %p, 255'
define i64 @constant_range_and_undef(i1 %cond, i64 %a) {
; CHECK-LABEL: @constant_range_and_undef(
; CHECK-NEXT: entry:
; CHECK: bb3:
; CHECK-NEXT: [[P:%.*]] = phi i64 [ undef, [[BB1]] ], [ [[R]], [[BB2]] ]
; CHECK-NEXT: [[RES:%.*]] = and i64 [[P]], 255
+; CHECK-NEXT: br label [[EXIT:%.*]]
+; CHECK: exit:
+; CHECK-NEXT: [[F_1:%.*]] = icmp eq i64 [[P]], 256
+; CHECK-NEXT: call void @use(i1 [[F_1]])
+; CHECK-NEXT: [[T_1:%.*]] = icmp ne i64 [[P]], 256
+; CHECK-NEXT: call void @use(i1 [[T_1]])
; CHECK-NEXT: ret i64 [[RES]]
;
entry:
bb3:
%p = phi i64 [ undef, %bb1 ], [ %r, %bb2 ]
%res = and i64 %p, 255
+ br label %exit
+
+exit: ; CVP only simplifies based on ranges for non-local conditions.
+ %f.1 = icmp eq i64 %p, 256
+ call void @use(i1 %f.1)
+ %t.1 = icmp ne i64 %p, 256
+ call void @use(i1 %t.1)
ret i64 %res
}
; CHECK: bb6:
; CHECK-NEXT: [[P2:%.*]] = phi i64 [ [[P]], [[BB4]] ], [ [[V3]], [[BB5]] ]
; CHECK-NEXT: [[RES:%.*]] = and i64 [[P2]], 255
+; CHECK-NEXT: br label [[EXIT:%.*]]
+; CHECK: exit:
+; CHECK-NEXT: [[F_1:%.*]] = icmp eq i64 [[P]], 256
+; CHECK-NEXT: call void @use(i1 [[F_1]])
+; CHECK-NEXT: [[T_1:%.*]] = icmp ne i64 [[P]], 256
+; CHECK-NEXT: call void @use(i1 [[T_1]])
; CHECK-NEXT: ret i64 [[RES]]
;
entry:
bb6:
%p2 = phi i64 [ %p, %bb4 ], [ %v3, %bb5 ]
%res = and i64 %p2, 255
+ br label %exit
+
+exit: ; CVP only simplifies based on ranges for non-local conditions.
+ %f.1 = icmp eq i64 %p, 256
+ call void @use(i1 %f.1)
+ %t.1 = icmp ne i64 %p, 256
+ call void @use(i1 %t.1)
ret i64 %res
}
; CHECK-NEXT: br label [[BB3]]
; CHECK: bb3:
; CHECK-NEXT: [[P:%.*]] = phi i64 [ undef, [[BB1]] ], [ [[R]], [[BB2]] ]
+; CHECK-NEXT: br label [[EXIT:%.*]]
+; CHECK: exit:
; CHECK-NEXT: [[C:%.*]] = icmp ult i64 [[P]], 256
+; CHECK-NEXT: [[F_1:%.*]] = icmp eq i64 [[P]], 256
+; CHECK-NEXT: call void @use(i1 [[F_1]])
+; CHECK-NEXT: [[T_1:%.*]] = icmp ne i64 [[P]], 256
+; CHECK-NEXT: call void @use(i1 [[T_1]])
; CHECK-NEXT: ret i1 [[C]]
;
entry:
bb3:
%p = phi i64 [ undef, %bb1 ], [ %r, %bb2 ]
+ br label %exit
+
+exit: ; CVP only simplifies based on ranges for non-local conditions.
%c = icmp ult i64 %p, 256
+ %f.1 = icmp eq i64 %p, 256
+ call void @use(i1 %f.1)
+ %t.1 = icmp ne i64 %p, 256
+ call void @use(i1 %t.1)
ret i1 %c
}
; CHECK: bb4:
; CHECK-NEXT: [[P:%.*]] = phi i64 [ [[R]], [[BB1]] ], [ 10, [[BB2]] ], [ undef, [[BB3]] ]
; CHECK-NEXT: [[RES:%.*]] = and i64 [[P]], 255
+; CHECK-NEXT: br label [[EXIT:%.*]]
+; CHECK: exit:
+; CHECK-NEXT: [[F_1:%.*]] = icmp eq i64 [[P]], 256
+; CHECK-NEXT: call void @use(i1 [[F_1]])
+; CHECK-NEXT: [[T_1:%.*]] = icmp ne i64 [[P]], 256
+; CHECK-NEXT: call void @use(i1 [[T_1]])
; CHECK-NEXT: ret i64 [[RES]]
;
entry:
bb4:
%p = phi i64 [ %r, %bb1 ], [ 10, %bb2], [ undef, %bb3 ]
%res = and i64 %p, 255
+ br label %exit
+
+exit: ; CVP only simplifies based on ranges for non-local conditions.
+ %f.1 = icmp eq i64 %p, 256
+ call void @use(i1 %f.1)
+ %t.1 = icmp ne i64 %p, 256
+ call void @use(i1 %t.1)
ret i64 %res
}
; CHECK: bb4:
; CHECK-NEXT: [[P:%.*]] = phi i64 [ undef, [[BB1]] ], [ 10, [[BB2]] ], [ [[R]], [[BB3]] ]
; CHECK-NEXT: [[RES:%.*]] = and i64 [[P]], 255
+; CHECK-NEXT: br label [[EXIT:%.*]]
+; CHECK: exit:
+; CHECK-NEXT: [[F_1:%.*]] = icmp eq i64 [[P]], 256
+; CHECK-NEXT: call void @use(i1 [[F_1]])
+; CHECK-NEXT: [[T_1:%.*]] = icmp ne i64 [[P]], 256
+; CHECK-NEXT: call void @use(i1 [[T_1]])
; CHECK-NEXT: ret i64 [[RES]]
;
entry:
bb4:
%p = phi i64 [ undef, %bb1 ], [ 10, %bb2], [ %r, %bb3 ]
%res = and i64 %p, 255
+ br label %exit
+
+exit: ; CVP only simplifies based on ranges for non-local conditions.
+ %f.1 = icmp eq i64 %p, 256
+ call void @use(i1 %f.1)
+ %t.1 = icmp ne i64 %p, 256
+ call void @use(i1 %t.1)
ret i64 %res
}
; CHECK: bb4:
; CHECK-NEXT: [[P:%.*]] = phi i64 [ [[R]], [[BB1]] ], [ undef, [[BB2]] ], [ 10, [[BB3]] ]
; CHECK-NEXT: [[RES:%.*]] = and i64 [[P]], 255
+; CHECK-NEXT: br label [[EXIT:%.*]]
+; CHECK: exit:
+; CHECK-NEXT: [[F_1:%.*]] = icmp eq i64 [[P]], 256
+; CHECK-NEXT: call void @use(i1 [[F_1]])
+; CHECK-NEXT: [[T_1:%.*]] = icmp ne i64 [[P]], 256
+; CHECK-NEXT: call void @use(i1 [[T_1]])
; CHECK-NEXT: ret i64 [[RES]]
;
entry:
bb4:
%p = phi i64 [ %r, %bb1 ], [ undef, %bb2], [ 10, %bb3 ]
%res = and i64 %p, 255
+ br label %exit
+
+exit: ; CVP only simplifies based on ranges for non-local conditions.
+ %f.1 = icmp eq i64 %p, 256
+ call void @use(i1 %f.1)
+ %t.1 = icmp ne i64 %p, 256
+ call void @use(i1 %t.1)
ret i64 %res
}
-
define i64 @constant_range_and_phi_constant_undef(i1 %c1, i1 %c2, i64 %a) {
; CHECK-LABEL: @constant_range_and_phi_constant_undef(
; CHECK-NEXT: entry:
; CHECK-NEXT: br label [[BB5]]
; CHECK: bb5:
; CHECK-NEXT: [[P:%.*]] = phi i64 [ [[R]], [[BB1]] ], [ 10, [[BB4]] ]
+; CHECK-NEXT: br label [[EXIT:%.*]]
+; CHECK: exit:
+; CHECK-NEXT: call void @use(i1 false)
+; CHECK-NEXT: call void @use(i1 true)
; CHECK-NEXT: ret i64 [[P]]
;
entry:
bb5:
%p = phi i64 [ %r, %bb1 ], [ %p.1, %bb4]
%res = and i64 %p, 255
+ br label %exit
+
+exit: ; CVP only simplifies based on ranges for non-local conditions.
+ %f.1 = icmp eq i64 %p, 256
+ call void @use(i1 %f.1)
+ %t.1 = icmp ne i64 %p, 256
+ call void @use(i1 %t.1)
ret i64 %res
}