mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-23 11:13:28 +01:00
b60e3f65de
Original commit message: [InstCombine] Fold IntToPtr and PtrToInt into preceding loads. Currently we only fold a BitCast into a Load when the BitCast is its only user. Do the same for any no-op cast. Patch by Philip Pfaffe! Differential Revision: http://reviews.llvm.org/D9152 llvm-svn: 260612
131 lines
4.5 KiB
LLVM
131 lines
4.5 KiB
LLVM
; Test lib call simplification of __memset_chk calls with various values
|
|
; for dstlen and len.
|
|
;
|
|
; RUN: opt < %s -instcombine -S | FileCheck %s
|
|
; rdar://7719085
|
|
|
|
target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64"
|
|
|
|
%struct.T = type { [100 x i32], [100 x i32], [1024 x i8] }
|
|
@t = common global %struct.T zeroinitializer
|
|
|
|
; Check cases where dstlen >= len.
|
|
|
|
define i8* @test_simplify1() {
|
|
; CHECK-LABEL: @test_simplify1(
|
|
%dst = bitcast %struct.T* @t to i8*
|
|
|
|
; CHECK-NEXT: call void @llvm.memset.p0i8.i64(i8* bitcast (%struct.T* @t to i8*), i8 0, i64 1824, i32 4, i1 false)
|
|
; CHECK-NEXT: ret i8* bitcast (%struct.T* @t to i8*)
|
|
%ret = call i8* @__memset_chk(i8* %dst, i32 0, i64 1824, i64 1824)
|
|
ret i8* %ret
|
|
}
|
|
|
|
define i8* @test_simplify2() {
|
|
; CHECK-LABEL: @test_simplify2(
|
|
%dst = bitcast %struct.T* @t to i8*
|
|
|
|
; CHECK-NEXT: call void @llvm.memset.p0i8.i64(i8* bitcast (%struct.T* @t to i8*), i8 0, i64 1824, i32 4, i1 false)
|
|
; CHECK-NEXT: ret i8* bitcast (%struct.T* @t to i8*)
|
|
%ret = call i8* @__memset_chk(i8* %dst, i32 0, i64 1824, i64 3648)
|
|
ret i8* %ret
|
|
}
|
|
|
|
define i8* @test_simplify3() {
|
|
; CHECK-LABEL: @test_simplify3(
|
|
%dst = bitcast %struct.T* @t to i8*
|
|
|
|
; CHECK-NEXT: call void @llvm.memset.p0i8.i64(i8* bitcast (%struct.T* @t to i8*), i8 0, i64 1824, i32 4, i1 false)
|
|
; CHECK-NEXT: ret i8* bitcast (%struct.T* @t to i8*)
|
|
%ret = call i8* @__memset_chk(i8* %dst, i32 0, i64 1824, i64 -1)
|
|
ret i8* %ret
|
|
}
|
|
|
|
; Check cases where dstlen < len.
|
|
|
|
define i8* @test_no_simplify1() {
|
|
; CHECK-LABEL: @test_no_simplify1(
|
|
%dst = bitcast %struct.T* @t to i8*
|
|
|
|
; CHECK-NEXT: %ret = call i8* @__memset_chk(i8* bitcast (%struct.T* @t to i8*), i32 0, i64 1824, i64 400)
|
|
; CHECK-NEXT: ret i8* %ret
|
|
%ret = call i8* @__memset_chk(i8* %dst, i32 0, i64 1824, i64 400)
|
|
ret i8* %ret
|
|
}
|
|
|
|
define i8* @test_no_simplify2() {
|
|
; CHECK-LABEL: @test_no_simplify2(
|
|
%dst = bitcast %struct.T* @t to i8*
|
|
|
|
; CHECK-NEXT: %ret = call i8* @__memset_chk(i8* bitcast (%struct.T* @t to i8*), i32 0, i64 1824, i64 0)
|
|
; CHECK-NEXT: ret i8* %ret
|
|
%ret = call i8* @__memset_chk(i8* %dst, i32 0, i64 1824, i64 0)
|
|
ret i8* %ret
|
|
}
|
|
|
|
; Test that RAUW in SimplifyLibCalls for __memset_chk generates valid IR
|
|
define i32 @test_rauw(i8* %a, i8* %b, i8** %c) {
|
|
; CHECK-LABEL: test_rauw
|
|
entry:
|
|
%call49 = call i64 @strlen(i8* %a)
|
|
%add180 = add i64 %call49, 1
|
|
%yo107 = call i64 @llvm.objectsize.i64.p0i8(i8* %b, i1 false)
|
|
%call50 = call i8* @__memmove_chk(i8* %b, i8* %a, i64 %add180, i64 %yo107)
|
|
; CHECK: %strlen = call i64 @strlen(i8* %b)
|
|
; CHECK-NEXT: %strchr2 = getelementptr i8, i8* %b, i64 %strlen
|
|
%call51i = call i8* @strrchr(i8* %b, i32 0)
|
|
%d = load i8*, i8** %c, align 8
|
|
%sub182 = ptrtoint i8* %d to i64
|
|
%sub183 = ptrtoint i8* %b to i64
|
|
%sub184 = sub i64 %sub182, %sub183
|
|
%add52.i.i = add nsw i64 %sub184, 1
|
|
; CHECK: call void @llvm.memset.p0i8.i64(i8* %strchr2
|
|
%call185 = call i8* @__memset_chk(i8* %call51i, i32 0, i64 %add52.i.i, i64 -1)
|
|
ret i32 4
|
|
}
|
|
|
|
declare i8* @__memmove_chk(i8*, i8*, i64, i64)
|
|
declare i8* @strrchr(i8*, i32)
|
|
declare i64 @strlen(i8* nocapture)
|
|
declare i64 @llvm.objectsize.i64.p0i8(i8*, i1)
|
|
|
|
declare i8* @__memset_chk(i8*, i32, i64, i64)
|
|
|
|
; FIXME: memset(malloc(x), 0, x) -> calloc(1, x)
|
|
|
|
define float* @pr25892(i64 %size) #0 {
|
|
entry:
|
|
%call = tail call i8* @malloc(i64 %size) #1
|
|
%cmp = icmp eq i8* %call, null
|
|
br i1 %cmp, label %cleanup, label %if.end
|
|
if.end:
|
|
%bc = bitcast i8* %call to float*
|
|
%call2 = tail call i64 @llvm.objectsize.i64.p0i8(i8* nonnull %call, i1 false)
|
|
%call3 = tail call i8* @__memset_chk(i8* nonnull %call, i32 0, i64 %size, i64 %call2) #1
|
|
br label %cleanup
|
|
cleanup:
|
|
%retval.0 = phi float* [ %bc, %if.end ], [ null, %entry ]
|
|
ret float* %retval.0
|
|
|
|
; CHECK-LABEL: @pr25892(
|
|
; CHECK: entry:
|
|
; CHECK-NEXT: %call = tail call i8* @malloc(i64 %size)
|
|
; CHECK-NEXT: %cmp = icmp eq i8* %call, null
|
|
; CHECK-NEXT: br i1 %cmp, label %cleanup, label %if.end
|
|
; CHECK: if.end:
|
|
; CHECK-NEXT: %bc = bitcast i8* %call to float*
|
|
; CHECK-NEXT: %call2 = tail call i64 @llvm.objectsize.i64.p0i8(i8* nonnull %call, i1 false)
|
|
; CHECK-NEXT: %call3 = tail call i8* @__memset_chk(i8* nonnull %call, i32 0, i64 %size, i64 %call2)
|
|
; CHECK-NEXT: br label %cleanup
|
|
; CHECK: cleanup:
|
|
; CHECK-NEXT: %retval.0 = phi float* [ %bc, %if.end ], [ null, %entry ]
|
|
; CHECK-NEXT: ret float* %retval.0
|
|
}
|
|
|
|
declare noalias i8* @malloc(i64) #1
|
|
|
|
attributes #0 = { nounwind ssp uwtable }
|
|
attributes #1 = { nounwind }
|
|
attributes #2 = { nounwind readnone }
|
|
|