llvm-project/llvm/test/Transforms/InstCombine/bitreverse-known-bits.ll
Yingwei Zheng 29f98d6c25
[InstCombine] Fold bitwise logic with intrinsics (#77460)
This patch does the following folds:
```
bitwise(fshl (A, B, ShAmt), fshl(C, D, ShAmt)) -> fshl(bitwise(A, C), bitwise(B, D), ShAmt)
bitwise(fshr (A, B, ShAmt), fshr(C, D, ShAmt)) -> fshr(bitwise(A, C), bitwise(B, D), ShAmt)
bitwise(bswap(A), bswap(B)) -> bswap(bitwise(A, B))
bitwise(bswap(A), C) -> bswap(bitwise(A, bswap(C)))
bitwise(bitreverse(A), bitreverse(B)) -> bitreverse(bitwise(A, B))
bitwise(bitreverse(A), C) -> bitreverse(bitwise(A, bitreverse(C)))
```
Alive2: https://alive2.llvm.org/ce/z/iZN_TL
2024-01-10 19:33:18 +08:00

59 lines
1.5 KiB
LLVM

; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; RUN: opt < %s -S -passes=instcombine | FileCheck %s
declare i8 @llvm.bitreverse.i8(i8)
declare i32 @llvm.bitreverse.i32(i32)
define i1 @test1(i32 %arg) {
; CHECK-LABEL: @test1(
; CHECK-NEXT: ret i1 true
;
%a = or i32 %arg, 4294901760
%b = call i32 @llvm.bitreverse.i32(i32 %a)
%and = and i32 %b, 65535
%res = icmp eq i32 %and, 65535
ret i1 %res
}
define i1 @test2(i32 %arg) {
; CHECK-LABEL: @test2(
; CHECK-NEXT: ret i1 true
;
%a = or i32 %arg, 1
%b = call i32 @llvm.bitreverse.i32(i32 %a)
%c = and i32 %b, 2147483648
%d = call i32 @llvm.bitreverse.i32(i32 %c)
%res = icmp eq i32 %d, 1
ret i1 %res
}
define i1 @test3(i32 %arg) {
; CHECK-LABEL: @test3(
; CHECK-NEXT: ret i1 false
;
%a = or i32 %arg, 65536
%b = call i32 @llvm.bitreverse.i32(i32 %a)
%and = and i32 %b, 32768
%res = icmp eq i32 %and, 0
ret i1 %res
}
; known bits for the bitreverse will say the result is in the range [0, 64)
; but the metadata says [0, 16). So make sure the range metadata wins.
; add %reverse, 1111 0000
; should become
; or %reverse, 1111 0000
define i8 @add_bitreverse(i8 %a) {
; CHECK-LABEL: @add_bitreverse(
; CHECK-NEXT: [[TMP1:%.*]] = or i8 [[A:%.*]], 15
; CHECK-NEXT: [[C:%.*]] = call i8 @llvm.bitreverse.i8(i8 [[TMP1]])
; CHECK-NEXT: ret i8 [[C]]
;
%b = and i8 %a, 252
%reverse = call i8 @llvm.bitreverse.i8(i8 %b), !range !1
%c = add i8 %reverse, -16
ret i8 %c
}
!1 = !{i8 0, i8 16}