a105877646
The idea behind this canonicalization is that it allows us to handle less patterns, because we know that some will be canonicalized away. This is indeed very useful to e.g. know that constants are always on the right. However, this is only useful if the canonicalization is actually reliable. This is the case for constants, but not for arguments: Moving these to the right makes it look like the "more complex" expression is guaranteed to be on the left, but this is not actually the case in practice. It fails as soon as you replace the argument with another instruction. The end result is that it looks like things correctly work in tests, while they actually don't. We use the "thwart complexity-based canonicalization" trick to handle this in tests, but it's often a challenge for new contributors to get this right, and based on the regressions this PR originally exposed, we clearly don't get this right in many cases. For this reason, I think that it's better to remove this complexity canonicalization. It will make it much easier to write tests for commuted cases and make sure that they are handled.
64 lines
1.8 KiB
LLVM
64 lines
1.8 KiB
LLVM
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
|
|
; RUN: opt -O1 -S < %s | FileCheck %s
|
|
|
|
; Make sure we reassociate and1 with and2 before instcombine to allow
|
|
; Demorgan logic fold:
|
|
; (a & ~b) & ~c --> a & ~(b | c)
|
|
define i4 @not_reassociate_and_and_not(i4 %a, i4 %b, i4 %c, i4 %d) {
|
|
; CHECK-LABEL: @not_reassociate_and_and_not(
|
|
; CHECK-NEXT: [[TMP1:%.*]] = or i4 [[B:%.*]], [[C:%.*]]
|
|
; CHECK-NEXT: [[TMP2:%.*]] = xor i4 [[TMP1]], -1
|
|
; CHECK-NEXT: [[AND2:%.*]] = and i4 [[A:%.*]], [[TMP2]]
|
|
; CHECK-NEXT: [[AND3:%.*]] = and i4 [[AND2]], [[D:%.*]]
|
|
; CHECK-NEXT: ret i4 [[AND3]]
|
|
;
|
|
%notb = xor i4 %b, -1
|
|
%notc = xor i4 %c, -1
|
|
%and1 = and i4 %a, %notb
|
|
%and2 = and i4 %and1, %d
|
|
%and3 = and i4 %and2, %notc
|
|
ret i4 %and3
|
|
}
|
|
|
|
; (a | ~b) | ~c --> a | ~(b & c)
|
|
define i32 @not_reassociate_or_or_not(i32 %a, i32 %b, i32 %c, i32 %d) {
|
|
; CHECK-LABEL: @not_reassociate_or_or_not(
|
|
; CHECK-NEXT: [[TMP1:%.*]] = and i32 [[B:%.*]], [[C:%.*]]
|
|
; CHECK-NEXT: [[TMP2:%.*]] = xor i32 [[TMP1]], -1
|
|
; CHECK-NEXT: [[B2:%.*]] = or i32 [[A:%.*]], [[TMP2]]
|
|
; CHECK-NEXT: [[B3:%.*]] = or i32 [[B2]], [[D:%.*]]
|
|
; CHECK-NEXT: ret i32 [[B3]]
|
|
;
|
|
%notb = xor i32 %b, -1
|
|
%notc = xor i32 %c, -1
|
|
%b1 = or i32 %a, %notb
|
|
%b2 = or i32 %b1, %d
|
|
%b3 = or i32 %b2, %notc
|
|
ret i32 %b3
|
|
}
|
|
|
|
define i32 @PR58137_sdiv(i32 %a, i32 %b) {
|
|
; CHECK-LABEL: @PR58137_sdiv(
|
|
; CHECK-NEXT: ret i32 [[B:%.*]]
|
|
;
|
|
%mul = mul nsw i32 2, %b
|
|
%mul1 = mul nsw i32 %mul, %a
|
|
%mul2 = mul nsw i32 2, %a
|
|
%div = sdiv i32 %mul1, %mul2
|
|
ret i32 %div
|
|
}
|
|
|
|
define i32 @PR58137_udiv(i32 %x, i32 %y) {
|
|
; CHECK-LABEL: @PR58137_udiv(
|
|
; CHECK-NEXT: ret i32 [[X:%.*]]
|
|
;
|
|
%zx = zext i32 %x to i64
|
|
%zy = zext i32 %y to i64
|
|
%m1 = mul nuw i64 %zx, %zy
|
|
%m2 = mul nuw i64 4, %m1
|
|
%m3 = mul nuw i64 4, %zy
|
|
%d = udiv i64 %m2, %m3
|
|
%t = trunc i64 %d to i32
|
|
ret i32 %t
|
|
}
|