llvm-project/llvm/test/Transforms/InstCombine/memcmp-constant-fold.ll

Ignoring revisions in .git-blame-ignore-revs. Click here to bypass and see the normal blame view.

82 lines
3.8 KiB
LLVM
Raw Normal View History

; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; RUN: opt < %s -instcombine -S -data-layout=e-n32 | FileCheck %s --check-prefix=ALL --check-prefix=LE
; RUN: opt < %s -instcombine -S -data-layout=E-n32 | FileCheck %s --check-prefix=ALL --check-prefix=BE
declare i32 @memcmp(i8*, i8*, i64)
; The alignment of this constant does not matter. We constant fold the load.
@charbuf = private unnamed_addr constant [4 x i8] [i8 0, i8 0, i8 0, i8 1], align 1
define i1 @memcmp_4bytes_unaligned_constant_i8(i8* align 4 %x) {
; LE-LABEL: @memcmp_4bytes_unaligned_constant_i8(
; LE-NEXT: [[TMP1:%.*]] = bitcast i8* [[X:%.*]] to i32*
; LE-NEXT: [[LHSV:%.*]] = load i32, i32* [[TMP1]], align 4
; LE-NEXT: [[TMP2:%.*]] = icmp eq i32 [[LHSV]], 16777216
; LE-NEXT: ret i1 [[TMP2]]
;
; BE-LABEL: @memcmp_4bytes_unaligned_constant_i8(
; BE-NEXT: [[TMP1:%.*]] = bitcast i8* [[X:%.*]] to i32*
; BE-NEXT: [[LHSV:%.*]] = load i32, i32* [[TMP1]], align 4
; BE-NEXT: [[TMP2:%.*]] = icmp eq i32 [[LHSV]], 1
; BE-NEXT: ret i1 [[TMP2]]
;
%call = tail call i32 @memcmp(i8* %x, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @charbuf, i64 0, i64 0), i64 4)
%cmpeq0 = icmp eq i32 %call, 0
ret i1 %cmpeq0
}
; We still don't care about alignment of the constant. We are not limited to constant folding only i8 arrays.
; It doesn't matter if the constant operand is the first operand to the memcmp.
@intbuf_unaligned = private unnamed_addr constant [4 x i16] [i16 1, i16 2, i16 3, i16 4], align 1
define i1 @memcmp_4bytes_unaligned_constant_i16(i8* align 4 %x) {
; LE-LABEL: @memcmp_4bytes_unaligned_constant_i16(
; LE-NEXT: [[TMP1:%.*]] = bitcast i8* [[X:%.*]] to i32*
; LE-NEXT: [[RHSV:%.*]] = load i32, i32* [[TMP1]], align 4
; LE-NEXT: [[TMP2:%.*]] = icmp eq i32 [[RHSV]], 131073
; LE-NEXT: ret i1 [[TMP2]]
;
; BE-LABEL: @memcmp_4bytes_unaligned_constant_i16(
; BE-NEXT: [[TMP1:%.*]] = bitcast i8* [[X:%.*]] to i32*
; BE-NEXT: [[RHSV:%.*]] = load i32, i32* [[TMP1]], align 4
; BE-NEXT: [[TMP2:%.*]] = icmp eq i32 [[RHSV]], 65538
; BE-NEXT: ret i1 [[TMP2]]
;
%call = tail call i32 @memcmp(i8* bitcast (i16* getelementptr inbounds ([4 x i16], [4 x i16]* @intbuf_unaligned, i64 0, i64 0) to i8*), i8* %x, i64 4)
%cmpeq0 = icmp eq i32 %call, 0
ret i1 %cmpeq0
}
; TODO: Any memcmp where all arguments are constants should be constant folded. Currently, we only handle i8 array constants.
@intbuf = private unnamed_addr constant [2 x i32] [i32 0, i32 1], align 4
define i1 @memcmp_3bytes_aligned_constant_i32(i8* align 4 %x) {
; ALL-LABEL: @memcmp_3bytes_aligned_constant_i32(
; ALL-NEXT: [[CALL:%.*]] = tail call i32 @memcmp(i8* nonnull dereferenceable(3) bitcast (i32* getelementptr inbounds ([2 x i32], [2 x i32]* @intbuf, i64 0, i64 1) to i8*), i8* nonnull dereferenceable(3) bitcast ([2 x i32]* @intbuf to i8*), i64 3)
; ALL-NEXT: [[CMPEQ0:%.*]] = icmp eq i32 [[CALL]], 0
; ALL-NEXT: ret i1 [[CMPEQ0]]
;
%call = tail call i32 @memcmp(i8* bitcast (i32* getelementptr inbounds ([2 x i32], [2 x i32]* @intbuf, i64 0, i64 1) to i8*), i8* bitcast (i32* getelementptr inbounds ([2 x i32], [2 x i32]* @intbuf, i64 0, i64 0) to i8*), i64 3)
%cmpeq0 = icmp eq i32 %call, 0
ret i1 %cmpeq0
}
; A sloppy implementation would infinite loop by recreating the unused instructions.
define i1 @memcmp_4bytes_one_unaligned_i8(i8* align 4 %x, i8* align 1 %y) {
; ALL-LABEL: @memcmp_4bytes_one_unaligned_i8(
; ALL-NEXT: [[CALL:%.*]] = tail call i32 @memcmp(i8* nonnull dereferenceable(4) [[X:%.*]], i8* nonnull dereferenceable(4) [[Y:%.*]], i64 4)
; ALL-NEXT: [[CMPEQ0:%.*]] = icmp eq i32 [[CALL]], 0
; ALL-NEXT: ret i1 [[CMPEQ0]]
;
%bc = bitcast i8* %x to i32*
%lhsv = load i32, i32* %bc
%call = tail call i32 @memcmp(i8* %x, i8* %y, i64 4)
%cmpeq0 = icmp eq i32 %call, 0
ret i1 %cmpeq0
}