mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-23 19:23:23 +01:00
ce5e2d8b37
ValueTracking has to strike a balance when attempting to propagate information backwards from assumes, because if the information is trivially propagated backwards, it can appear to LLVM that the assumption is known to be true, and therefore can be removed. This is sound (because an assumption has no semantic effect except for causing UB), but prevents the assume from allowing further optimizations. The isEphemeralValueOf check exists to try and prevent this issue by not removing the source of an assumption. This tries to make it a little bit more general to handle the case of side-effectful instructions, such as in %0 = call i1 @get_val() %1 = xor i1 %0, true call void @llvm.assume(i1 %1) Patch by Ariel Ben-Yehuda, thanks! Differential Revision: https://reviews.llvm.org/D36590 llvm-svn: 310859
34 lines
929 B
LLVM
34 lines
929 B
LLVM
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
|
|
; RUN: opt < %s -instcombine -S | FileCheck %s
|
|
|
|
define i32 @assume_add(i32 %a, i32 %b) {
|
|
; CHECK-LABEL: @assume_add(
|
|
; CHECK-NEXT: [[T1:%.*]] = add i32 [[A:%.*]], [[B:%.*]]
|
|
; CHECK-NEXT: [[LAST_TWO_DIGITS:%.*]] = and i32 [[T1]], 3
|
|
; CHECK-NEXT: [[T2:%.*]] = icmp eq i32 [[LAST_TWO_DIGITS]], 0
|
|
; CHECK-NEXT: call void @llvm.assume(i1 [[T2]])
|
|
; CHECK-NEXT: [[T3:%.*]] = or i32 [[T1]], 3
|
|
; CHECK-NEXT: ret i32 [[T3]]
|
|
;
|
|
%t1 = add i32 %a, %b
|
|
%last_two_digits = and i32 %t1, 3
|
|
%t2 = icmp eq i32 %last_two_digits, 0
|
|
call void @llvm.assume(i1 %t2)
|
|
%t3 = add i32 %t1, 3
|
|
ret i32 %t3
|
|
}
|
|
|
|
|
|
define void @assume_not() {
|
|
; CHECK-LABEL: @assume_not(
|
|
entry-block:
|
|
%0 = call i1 @get_val()
|
|
; CHECK: call void @llvm.assume
|
|
%1 = xor i1 %0, true
|
|
call void @llvm.assume(i1 %1)
|
|
ret void
|
|
}
|
|
|
|
declare i1 @get_val()
|
|
declare void @llvm.assume(i1)
|