2010-11-18 08:00:57 +00:00
|
|
|
; RUN: opt < %s -basicaa -memcpyopt -dse -S | FileCheck %s
|
2008-02-04 02:59:58 +00:00
|
|
|
|
|
|
|
target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f32:32:32-f64:32:64-v64:64:64-v128:128:128-a0:0:64-f80:128:128"
|
|
|
|
target triple = "i686-apple-darwin9"
|
|
|
|
|
2011-06-18 06:05:24 +00:00
|
|
|
%0 = type { x86_fp80, x86_fp80 }
|
|
|
|
%1 = type { i32, i32 }
|
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
define void @test1(%0* sret %agg.result, x86_fp80 %z.0, x86_fp80 %z.1) nounwind {
|
2008-02-04 02:59:58 +00:00
|
|
|
entry:
|
2011-06-18 06:05:24 +00:00
|
|
|
%tmp2 = alloca %0
|
|
|
|
%memtmp = alloca %0, align 16
|
|
|
|
%tmp5 = fsub x86_fp80 0xK80000000000000000000, %z.1
|
|
|
|
call void @ccoshl(%0* sret %memtmp, x86_fp80 %tmp5, x86_fp80 %z.0) nounwind
|
|
|
|
%tmp219 = bitcast %0* %tmp2 to i8*
|
|
|
|
%memtmp20 = bitcast %0* %memtmp to i8*
|
|
|
|
call void @llvm.memcpy.p0i8.p0i8.i32(i8* %tmp219, i8* %memtmp20, i32 32, i32 16, i1 false)
|
|
|
|
%agg.result21 = bitcast %0* %agg.result to i8*
|
|
|
|
call void @llvm.memcpy.p0i8.p0i8.i32(i8* %agg.result21, i8* %tmp219, i32 32, i32 16, i1 false)
|
|
|
|
ret void
|
2010-11-18 07:49:32 +00:00
|
|
|
|
|
|
|
; Check that one of the memcpy's are removed.
|
|
|
|
;; FIXME: PR 8643 We should be able to eliminate the last memcpy here.
|
|
|
|
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test1(
|
2010-11-18 07:49:32 +00:00
|
|
|
; CHECK: call void @ccoshl
|
2010-11-18 08:00:57 +00:00
|
|
|
; CHECK: call void @llvm.memcpy
|
2010-11-18 07:49:32 +00:00
|
|
|
; CHECK-NOT: llvm.memcpy
|
|
|
|
; CHECK: ret void
|
2008-02-04 02:59:58 +00:00
|
|
|
}
|
|
|
|
|
2014-07-14 18:52:02 +00:00
|
|
|
declare void @ccoshl(%0* nocapture sret, x86_fp80, x86_fp80) nounwind
|
2008-02-04 02:59:58 +00:00
|
|
|
|
2010-11-18 08:00:57 +00:00
|
|
|
|
|
|
|
; The intermediate alloca and one of the memcpy's should be eliminated, the
|
|
|
|
; other should be related with a memmove.
|
|
|
|
define void @test2(i8* %P, i8* %Q) nounwind {
|
2011-06-18 06:05:24 +00:00
|
|
|
%memtmp = alloca %0, align 16
|
|
|
|
%R = bitcast %0* %memtmp to i8*
|
|
|
|
call void @llvm.memcpy.p0i8.p0i8.i32(i8* %R, i8* %P, i32 32, i32 16, i1 false)
|
|
|
|
call void @llvm.memcpy.p0i8.p0i8.i32(i8* %Q, i8* %R, i32 32, i32 16, i1 false)
|
|
|
|
ret void
|
2010-11-18 08:00:57 +00:00
|
|
|
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test2(
|
2010-11-18 08:00:57 +00:00
|
|
|
; CHECK-NEXT: call void @llvm.memmove{{.*}}(i8* %Q, i8* %P
|
|
|
|
; CHECK-NEXT: ret void
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
@x = external global %0
|
2010-11-18 08:00:57 +00:00
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
define void @test3(%0* noalias sret %agg.result) nounwind {
|
2011-06-18 06:05:24 +00:00
|
|
|
%x.0 = alloca %0
|
|
|
|
%x.01 = bitcast %0* %x.0 to i8*
|
|
|
|
call void @llvm.memcpy.p0i8.p0i8.i32(i8* %x.01, i8* bitcast (%0* @x to i8*), i32 32, i32 16, i1 false)
|
|
|
|
%agg.result2 = bitcast %0* %agg.result to i8*
|
|
|
|
call void @llvm.memcpy.p0i8.p0i8.i32(i8* %agg.result2, i8* %x.01, i32 32, i32 16, i1 false)
|
|
|
|
ret void
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test3(
|
2011-10-16 20:13:32 +00:00
|
|
|
; CHECK-NEXT: %agg.result1 = bitcast
|
2010-11-18 08:00:57 +00:00
|
|
|
; CHECK-NEXT: call void @llvm.memcpy
|
|
|
|
; CHECK-NEXT: ret void
|
|
|
|
}
|
2010-11-21 00:28:59 +00:00
|
|
|
|
|
|
|
|
|
|
|
; PR8644
|
|
|
|
define void @test4(i8 *%P) {
|
2011-06-18 06:05:24 +00:00
|
|
|
%A = alloca %1
|
|
|
|
%a = bitcast %1* %A to i8*
|
2010-11-21 00:28:59 +00:00
|
|
|
call void @llvm.memcpy.p0i8.p0i8.i64(i8* %a, i8* %P, i64 8, i32 4, i1 false)
|
2013-01-31 23:16:25 +00:00
|
|
|
call void @test4a(i8* align 1 byval %a)
|
2010-11-21 00:28:59 +00:00
|
|
|
ret void
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test4(
|
2010-11-21 00:28:59 +00:00
|
|
|
; CHECK-NEXT: call void @test4a(
|
|
|
|
}
|
|
|
|
|
2013-01-31 23:16:25 +00:00
|
|
|
declare void @test4a(i8* align 1 byval)
|
2010-11-21 00:28:59 +00:00
|
|
|
declare void @llvm.memcpy.p0i8.p0i8.i64(i8* nocapture, i8* nocapture, i64, i32, i1) nounwind
|
2014-01-22 21:53:19 +00:00
|
|
|
declare void @llvm.memcpy.p1i8.p1i8.i64(i8 addrspace(1)* nocapture, i8 addrspace(1)* nocapture, i64, i32, i1) nounwind
|
2010-12-01 01:24:55 +00:00
|
|
|
|
|
|
|
%struct.S = type { i128, [4 x i8]}
|
|
|
|
|
|
|
|
@sS = external global %struct.S, align 16
|
|
|
|
|
2013-01-31 23:16:25 +00:00
|
|
|
declare void @test5a(%struct.S* align 16 byval) nounwind ssp
|
2010-12-01 01:24:55 +00:00
|
|
|
|
|
|
|
|
|
|
|
; rdar://8713376 - This memcpy can't be eliminated.
|
|
|
|
define i32 @test5(i32 %x) nounwind ssp {
|
|
|
|
entry:
|
|
|
|
%y = alloca %struct.S, align 16
|
|
|
|
%tmp = bitcast %struct.S* %y to i8*
|
|
|
|
call void @llvm.memcpy.p0i8.p0i8.i64(i8* %tmp, i8* bitcast (%struct.S* @sS to i8*), i64 32, i32 16, i1 false)
|
|
|
|
%a = getelementptr %struct.S* %y, i64 0, i32 1, i64 0
|
|
|
|
store i8 4, i8* %a
|
2013-01-31 23:16:25 +00:00
|
|
|
call void @test5a(%struct.S* align 16 byval %y)
|
2010-12-01 01:24:55 +00:00
|
|
|
ret i32 0
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test5(
|
2010-12-01 01:24:55 +00:00
|
|
|
; CHECK: store i8 4
|
2013-02-15 05:25:26 +00:00
|
|
|
; CHECK: call void @test5a(%struct.S* byval align 16 %y)
|
2010-12-01 01:24:55 +00:00
|
|
|
}
|
2010-12-09 07:45:45 +00:00
|
|
|
|
|
|
|
;; Noop memcpy should be zapped.
|
|
|
|
define void @test6(i8 *%P) {
|
|
|
|
call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %P, i64 8, i32 4, i1 false)
|
|
|
|
ret void
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test6(
|
2010-12-09 07:45:45 +00:00
|
|
|
; CHECK-NEXT: ret void
|
|
|
|
}
|
|
|
|
|
2011-05-23 00:03:39 +00:00
|
|
|
|
|
|
|
; PR9794 - Should forward memcpy into byval argument even though the memcpy
|
|
|
|
; isn't itself 8 byte aligned.
|
|
|
|
%struct.p = type { i32, i32, i32, i32, i32, i32, i32, i32, i32, i32, i32, i32 }
|
|
|
|
|
2013-01-31 23:16:25 +00:00
|
|
|
define i32 @test7(%struct.p* nocapture align 8 byval %q) nounwind ssp {
|
2011-05-23 00:03:39 +00:00
|
|
|
entry:
|
|
|
|
%agg.tmp = alloca %struct.p, align 4
|
|
|
|
%tmp = bitcast %struct.p* %agg.tmp to i8*
|
|
|
|
%tmp1 = bitcast %struct.p* %q to i8*
|
|
|
|
call void @llvm.memcpy.p0i8.p0i8.i64(i8* %tmp, i8* %tmp1, i64 48, i32 4, i1 false)
|
2013-01-31 23:16:25 +00:00
|
|
|
%call = call i32 @g(%struct.p* align 8 byval %agg.tmp) nounwind
|
2011-05-23 00:03:39 +00:00
|
|
|
ret i32 %call
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test7(
|
2013-02-22 09:09:42 +00:00
|
|
|
; CHECK: call i32 @g(%struct.p* byval align 8 %q) [[NUW:#[0-9]+]]
|
2011-05-23 00:03:39 +00:00
|
|
|
}
|
|
|
|
|
2013-01-31 23:16:25 +00:00
|
|
|
declare i32 @g(%struct.p* align 8 byval)
|
2011-05-23 00:03:39 +00:00
|
|
|
|
2011-06-18 06:05:24 +00:00
|
|
|
declare void @llvm.memcpy.p0i8.p0i8.i32(i8* nocapture, i8* nocapture, i32, i32, i1) nounwind
|
2011-05-23 00:03:39 +00:00
|
|
|
|
2011-10-16 20:13:32 +00:00
|
|
|
; PR11142 - When looking for a memcpy-memcpy dependency, don't get stuck on
|
|
|
|
; instructions between the memcpy's that only affect the destination pointer.
|
|
|
|
@test8.str = internal constant [7 x i8] c"ABCDEF\00"
|
|
|
|
|
|
|
|
define void @test8() {
|
|
|
|
; CHECK: test8
|
2011-10-22 22:07:31 +00:00
|
|
|
; CHECK-NOT: memcpy
|
2011-10-16 20:13:32 +00:00
|
|
|
%A = tail call i8* @malloc(i32 10)
|
|
|
|
%B = getelementptr inbounds i8* %A, i64 2
|
|
|
|
tail call void @llvm.memcpy.p0i8.p0i8.i32(i8* %B, i8* getelementptr inbounds ([7 x i8]* @test8.str, i64 0, i64 0), i32 7, i32 1, i1 false)
|
|
|
|
%C = tail call i8* @malloc(i32 10)
|
|
|
|
%D = getelementptr inbounds i8* %C, i64 2
|
|
|
|
tail call void @llvm.memcpy.p0i8.p0i8.i32(i8* %D, i8* %B, i32 7, i32 1, i1 false)
|
|
|
|
ret void
|
2011-10-22 22:07:31 +00:00
|
|
|
; CHECK: ret void
|
2011-10-16 20:13:32 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
declare noalias i8* @malloc(i32)
|
2012-05-14 20:35:04 +00:00
|
|
|
|
|
|
|
; rdar://11341081
|
|
|
|
%struct.big = type { [50 x i32] }
|
|
|
|
|
2014-01-22 21:53:19 +00:00
|
|
|
define void @test9_addrspacecast() nounwind ssp uwtable {
|
|
|
|
entry:
|
|
|
|
; CHECK-LABEL: @test9_addrspacecast(
|
|
|
|
; CHECK: f1
|
|
|
|
; CHECK-NOT: memcpy
|
|
|
|
; CHECK: f2
|
|
|
|
%b = alloca %struct.big, align 4
|
|
|
|
%tmp = alloca %struct.big, align 4
|
|
|
|
call void @f1(%struct.big* sret %tmp)
|
|
|
|
%0 = addrspacecast %struct.big* %b to i8 addrspace(1)*
|
|
|
|
%1 = addrspacecast %struct.big* %tmp to i8 addrspace(1)*
|
|
|
|
call void @llvm.memcpy.p1i8.p1i8.i64(i8 addrspace(1)* %0, i8 addrspace(1)* %1, i64 200, i32 4, i1 false)
|
|
|
|
call void @f2(%struct.big* %b)
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
2013-01-31 23:16:25 +00:00
|
|
|
define void @test9() nounwind ssp uwtable {
|
2012-05-14 20:35:04 +00:00
|
|
|
entry:
|
|
|
|
; CHECK: test9
|
|
|
|
; CHECK: f1
|
|
|
|
; CHECK-NOT: memcpy
|
|
|
|
; CHECK: f2
|
|
|
|
%b = alloca %struct.big, align 4
|
|
|
|
%tmp = alloca %struct.big, align 4
|
|
|
|
call void @f1(%struct.big* sret %tmp)
|
|
|
|
%0 = bitcast %struct.big* %b to i8*
|
|
|
|
%1 = bitcast %struct.big* %tmp to i8*
|
|
|
|
call void @llvm.memcpy.p0i8.p0i8.i64(i8* %0, i8* %1, i64 200, i32 4, i1 false)
|
|
|
|
call void @f2(%struct.big* %b)
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
2013-06-07 22:45:21 +00:00
|
|
|
; rdar://14073661.
|
|
|
|
; Test10 triggered assertion when the compiler try to get the size of the
|
|
|
|
; opaque type of *x, where the x is the formal argument with attribute 'sret'.
|
|
|
|
|
|
|
|
%opaque = type opaque
|
|
|
|
declare void @foo(i32* noalias nocapture)
|
|
|
|
|
|
|
|
define void @test10(%opaque* noalias nocapture sret %x, i32 %y) {
|
|
|
|
%a = alloca i32, align 4
|
|
|
|
store i32 %y, i32* %a
|
|
|
|
call void @foo(i32* noalias nocapture %a)
|
|
|
|
%c = load i32* %a
|
|
|
|
%d = bitcast %opaque* %x to i32*
|
|
|
|
store i32 %c, i32* %d
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
2014-07-14 18:52:02 +00:00
|
|
|
declare void @f1(%struct.big* nocapture sret)
|
2012-05-14 20:35:04 +00:00
|
|
|
declare void @f2(%struct.big*)
|
2013-02-22 09:09:42 +00:00
|
|
|
|
|
|
|
; CHECK: attributes [[NUW]] = { nounwind }
|
|
|
|
; CHECK: attributes #1 = { nounwind ssp }
|
|
|
|
; CHECK: attributes #2 = { nounwind ssp uwtable }
|