Please use GitHub pull requests for new patches. Phabricator shutdown timeline
Changeset View
Standalone View
llvm/test/Transforms/InstCombine/replace-alloca-phi.ll
- This file was added.
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py | |||||
; RUN: opt -passes=instcombine -S -o - %s | FileCheck %s | |||||
arsenm: Don't need the target here; it just requires the target to be built | |||||
Use update_test_checks.py. nikic: Use `update_test_checks.py`. | |||||
Please use opaque pointers for new tests ([32 x i8] addrspace(4)* -> ptr addrspace(4) etc). nikic: Please use opaque pointers for new tests (`[32 x i8] addrspace(4)*` -> `ptr addrspace(4)` etc). | |||||
target datalayout="p5:32:32-A5" | |||||
Drop the triple, this just needs target datalayout ="A5". Otherwise this will fail without amdgpu built arsenm: Drop the triple, this just needs target datalayout ="A5". Otherwise this will fail without… | |||||
Probably should do "p5-32-A5" arsenm: Probably should do "p5-32-A5" | |||||
Is that a complete specification? I am getting the following error: error: Missing size specification for pointer in datalayout string gandhi21299: Is that a complete specification? I am getting the following error:
`error: Missing size… | |||||
target datalayout = "p5:32:32-A5" arsenm: target datalayout = "p5:32:32-A5"
| |||||
isOnlyCopiedFromConstantMemory seems to depend on AMDGPUAliasAnalysis results. It returns false for the tests I added when I replace the triple string with the datalayout you suggested. cc @bcahoon gandhi21299: `isOnlyCopiedFromConstantMemory` seems to depend on AMDGPUAliasAnalysis results. It returns… | |||||
You should be able to avoid making this AMDGPU specific by copying from a constant global, instead of copying from a special AMDGPU address space. nikic: You should be able to avoid making this AMDGPU specific by copying from a constant global… | |||||
No checks? arsenm: No checks? | |||||
@g1 = constant [32 x i8] zeroinitializer | |||||
@g2 = addrspace(1) constant [32 x i8] zeroinitializer | |||||
define i8 @remove_alloca_use_arg(i1 %cond) { | |||||
; CHECK-LABEL: @remove_alloca_use_arg( | |||||
; CHECK-NEXT: entry: | |||||
Broken check line (should be CHECK). nikic: Broken check line (should be `CHECK`). | |||||
; CHECK-NEXT: br i1 [[COND:%.*]], label [[IF:%.*]], label [[ELSE:%.*]] | |||||
; CHECK: if: | |||||
; CHECK-NEXT: br label [[SINK:%.*]] | |||||
; CHECK: else: | |||||
; CHECK-NEXT: br label [[SINK]] | |||||
; CHECK: sink: | |||||
; CHECK-NEXT: [[PTR:%.*]] = phi ptr [ getelementptr inbounds ([32 x i8], ptr @g1, i64 0, i64 2), [[IF]] ], [ getelementptr inbounds ([32 x i8], ptr @g1, i64 0, i64 1), [[ELSE]] ] | |||||
; CHECK-NEXT: [[LOAD:%.*]] = load i8, ptr [[PTR]], align 1 | |||||
; CHECK-NEXT: ret i8 [[LOAD]] | |||||
; | |||||
entry: | |||||
%alloca = alloca [32 x i8], align 4, addrspace(1) | |||||
call void @llvm.memcpy.p1i8.p0i8.i64(ptr addrspace(1) %alloca, ptr @g1, i64 256, i1 false) | |||||
br i1 %cond, label %if, label %else | |||||
if: | |||||
%val.if = getelementptr inbounds [32 x i8], ptr addrspace(1) %alloca, i32 0, i32 2 | |||||
br label %sink | |||||
else: | |||||
%val.else = getelementptr inbounds [32 x i8], ptr addrspace(1) %alloca, i32 0, i32 1 | |||||
br label %sink | |||||
sink: | |||||
%ptr = phi ptr addrspace(1) [ %val.if, %if ], [ %val.else, %else ] | |||||
%load = load i8, ptr addrspace(1) %ptr | |||||
ret i8 %load | |||||
} | |||||
define i8 @volatile_load_keep_alloca(i1 %cond) { | |||||
; CHECK-LABEL: @volatile_load_keep_alloca( | |||||
; CHECK-NEXT: entry: | |||||
; CHECK-NEXT: [[ALLOCA:%.*]] = alloca [32 x i8], align 4, addrspace(1) | |||||
; CHECK-NEXT: call void @llvm.memcpy.p1.p0.i64(ptr addrspace(1) noundef align 4 dereferenceable(256) [[ALLOCA]], ptr noundef nonnull align 16 dereferenceable(256) @g1, i64 256, i1 false) | |||||
; CHECK-NEXT: br i1 [[COND:%.*]], label [[IF:%.*]], label [[ELSE:%.*]] | |||||
; CHECK: if: | |||||
; CHECK-NEXT: [[VAL_IF:%.*]] = getelementptr inbounds [32 x i8], ptr addrspace(1) [[ALLOCA]], i64 0, i64 1 | |||||
; CHECK-NEXT: br label [[SINK:%.*]] | |||||
; CHECK: else: | |||||
; CHECK-NEXT: [[VAL_ELSE:%.*]] = getelementptr inbounds [32 x i8], ptr addrspace(1) [[ALLOCA]], i64 0, i64 2 | |||||
; CHECK-NEXT: br label [[SINK]] | |||||
; CHECK: sink: | |||||
; CHECK-NEXT: [[PTR:%.*]] = phi ptr addrspace(1) [ [[VAL_IF]], [[IF]] ], [ [[VAL_ELSE]], [[ELSE]] ] | |||||
; CHECK-NEXT: [[LOAD:%.*]] = load volatile i8, ptr addrspace(1) [[PTR]], align 1 | |||||
; CHECK-NEXT: ret i8 [[LOAD]] | |||||
; | |||||
entry: | |||||
%alloca = alloca [32 x i8], align 4, addrspace(1) | |||||
call void @llvm.memcpy.p1i8.p0i8.i64(ptr addrspace(1) %alloca, ptr @g1, i64 256, i1 false) | |||||
br i1 %cond, label %if, label %else | |||||
if: | |||||
%val.if = getelementptr inbounds [32 x i8], ptr addrspace(1) %alloca, i32 0, i32 1 | |||||
br label %sink | |||||
else: | |||||
%val.else = getelementptr inbounds [32 x i8], ptr addrspace(1) %alloca, i32 0, i32 2 | |||||
br label %sink | |||||
This test is too complicated. Please reduce it to the minimum needed to show the new transform. There also needs to be a negative test where there is an unsupported use of the phi. nikic: This test is too complicated. Please reduce it to the minimum needed to show the new transform. | |||||
sink: | |||||
%ptr = phi ptr addrspace(1) [ %val.if, %if ], [ %val.else, %else ] | |||||
%load = load volatile i8, ptr addrspace(1) %ptr | |||||
ret i8 %load | |||||
} | |||||
define i8 @no_memcpy_keep_alloca(i1 %cond) { | |||||
; CHECK-LABEL: @no_memcpy_keep_alloca( | |||||
; CHECK-NEXT: entry: | |||||
; CHECK-NEXT: [[ALLOCA:%.*]] = alloca [32 x i8], align 4, addrspace(1) | |||||
; CHECK-NEXT: br i1 [[COND:%.*]], label [[IF:%.*]], label [[ELSE:%.*]] | |||||
; CHECK: if: | |||||
; CHECK-NEXT: [[VAL_IF:%.*]] = getelementptr inbounds [32 x i8], ptr addrspace(1) [[ALLOCA]], i64 0, i64 1 | |||||
; CHECK-NEXT: br label [[SINK:%.*]] | |||||
; CHECK: else: | |||||
; CHECK-NEXT: [[VAL_ELSE:%.*]] = getelementptr inbounds [32 x i8], ptr addrspace(1) [[ALLOCA]], i64 0, i64 2 | |||||
; CHECK-NEXT: br label [[SINK]] | |||||
; CHECK: sink: | |||||
; CHECK-NEXT: [[PTR:%.*]] = phi ptr addrspace(1) [ [[VAL_IF]], [[IF]] ], [ [[VAL_ELSE]], [[ELSE]] ] | |||||
; CHECK-NEXT: [[LOAD:%.*]] = load volatile i8, ptr addrspace(1) [[PTR]], align 1 | |||||
; CHECK-NEXT: ret i8 [[LOAD]] | |||||
; | |||||
entry: | |||||
%alloca = alloca [32 x i8], align 4, addrspace(1) | |||||
br i1 %cond, label %if, label %else | |||||
if: | |||||
%val.if = getelementptr inbounds [32 x i8], ptr addrspace(1) %alloca, i32 0, i32 1 | |||||
br label %sink | |||||
else: | |||||
%val.else = getelementptr inbounds [32 x i8], ptr addrspace(1) %alloca, i32 0, i32 2 | |||||
br label %sink | |||||
sink: | |||||
%ptr = phi ptr addrspace(1) [ %val.if, %if ], [ %val.else, %else ] | |||||
%load = load volatile i8, ptr addrspace(1) %ptr | |||||
ret i8 %load | |||||
} | |||||
define i8 @loop_phi_remove_alloca(i1 %cond) { | |||||
; CHECK-LABEL: @loop_phi_remove_alloca( | |||||
; CHECK-NEXT: entry: | |||||
; CHECK-NEXT: br label [[BB_0:%.*]] | |||||
; CHECK: bb.0: | |||||
; CHECK-NEXT: [[PTR:%.*]] = phi ptr [ getelementptr inbounds ([32 x i8], ptr @g1, i64 0, i64 1), [[ENTRY:%.*]] ], [ getelementptr inbounds ([32 x i8], ptr @g1, i64 0, i64 2), [[BB_1:%.*]] ] | |||||
; CHECK-NEXT: br i1 [[COND:%.*]], label [[BB_1]], label [[EXIT:%.*]] | |||||
; CHECK: bb.1: | |||||
; CHECK-NEXT: br label [[BB_0]] | |||||
; CHECK: exit: | |||||
; CHECK-NEXT: [[LOAD:%.*]] = load i8, ptr [[PTR]], align 1 | |||||
; CHECK-NEXT: ret i8 [[LOAD]] | |||||
; | |||||
entry: | |||||
%alloca = alloca [32 x i8], align 4, addrspace(1) | |||||
call void @llvm.memcpy.p1i8.p0i8.i64(ptr addrspace(1) %alloca, ptr @g1, i64 256, i1 false) | |||||
%val1 = getelementptr inbounds [32 x i8], ptr addrspace(1) %alloca, i32 0, i32 1 | |||||
br label %bb.0 | |||||
bb.0: | |||||
%ptr = phi ptr addrspace(1) [ %val1, %entry ], [ %val2, %bb.1 ] | |||||
br i1 %cond, label %bb.1, label %exit | |||||
bb.1: | |||||
%val2 = getelementptr inbounds [32 x i8], ptr addrspace(1) %alloca, i32 0, i32 2 | |||||
br label %bb.0 | |||||
exit: | |||||
%load = load i8, ptr addrspace(1) %ptr | |||||
ret i8 %load | |||||
} | |||||
define i32 @remove_alloca_ptr_arg(i1 %c, ptr %ptr) { | |||||
; CHECK-LABEL: @remove_alloca_ptr_arg( | |||||
; CHECK-NEXT: entry: | |||||
; CHECK-NEXT: br i1 [[C:%.*]], label [[IF:%.*]], label [[JOIN:%.*]] | |||||
; CHECK: if: | |||||
; CHECK-NEXT: br label [[JOIN]] | |||||
; CHECK: join: | |||||
; CHECK-NEXT: [[PHI:%.*]] = phi ptr [ @g1, [[IF]] ], [ [[PTR:%.*]], [[ENTRY:%.*]] ] | |||||
; CHECK-NEXT: [[V:%.*]] = load i32, ptr [[PHI]], align 4 | |||||
; CHECK-NEXT: ret i32 [[V]] | |||||
; | |||||
entry: | |||||
%alloca = alloca [32 x i8] | |||||
call void @llvm.memcpy.p0.p0.i64(ptr %alloca, ptr @g1, i64 32, i1 false) | |||||
br i1 %c, label %if, label %join | |||||
if: | |||||
br label %join | |||||
join: | |||||
%phi = phi ptr [ %alloca, %if ], [ %ptr, %entry ] | |||||
%v = load i32, ptr %phi | |||||
ret i32 %v | |||||
} | |||||
define i8 @loop_phi_late_memtransfer(i1 %cond) { | |||||
; CHECK-LABEL: @loop_phi_late_memtransfer( | |||||
; CHECK-NEXT: entry: | |||||
; CHECK-NEXT: br label [[BB_0:%.*]] | |||||
; CHECK: bb.0: | |||||
; CHECK-NEXT: [[PTR:%.*]] = phi ptr [ getelementptr inbounds ([32 x i8], ptr @g1, i64 0, i64 1), [[ENTRY:%.*]] ], [ getelementptr inbounds ([32 x i8], ptr @g1, i64 0, i64 2), [[BB_1:%.*]] ] | |||||
; CHECK-NEXT: br i1 [[COND:%.*]], label [[BB_1]], label [[EXIT:%.*]] | |||||
; CHECK: bb.1: | |||||
; CHECK-NEXT: br label [[BB_0]] | |||||
; CHECK: exit: | |||||
; CHECK-NEXT: [[LOAD:%.*]] = load i8, ptr [[PTR]], align 1 | |||||
; CHECK-NEXT: ret i8 [[LOAD]] | |||||
; | |||||
entry: | |||||
%alloca = alloca [32 x i8], align 4, addrspace(1) | |||||
%val1 = getelementptr inbounds [32 x i8], ptr addrspace(1) %alloca, i32 0, i32 1 | |||||
br label %bb.0 | |||||
bb.0: | |||||
%ptr = phi ptr addrspace(1) [ %val1, %entry ], [ %val2, %bb.1 ] | |||||
br i1 %cond, label %bb.1, label %exit | |||||
bb.1: | |||||
%val2 = getelementptr inbounds [32 x i8], ptr addrspace(1) %alloca, i32 0, i32 2 | |||||
call void @llvm.memcpy.p1i8.p0i8.i64(ptr addrspace(1) %alloca, ptr @g1, i64 256, i1 false) | |||||
br label %bb.0 | |||||
exit: | |||||
%load = load i8, ptr addrspace(1) %ptr | |||||
ret i8 %load | |||||
} | |||||
define i32 @test_memcpy_after_phi(i1 %cond, ptr %ptr) { | |||||
; CHECK-LABEL: @test_memcpy_after_phi( | |||||
; CHECK-NEXT: entry: | |||||
; CHECK-NEXT: [[A:%.*]] = alloca [32 x i8], align 1 | |||||
; CHECK-NEXT: br i1 [[COND:%.*]], label [[IF:%.*]], label [[JOIN:%.*]] | |||||
; CHECK: if: | |||||
; CHECK-NEXT: br label [[JOIN]] | |||||
; CHECK: join: | |||||
; CHECK-NEXT: [[PHI:%.*]] = phi ptr [ [[A]], [[IF]] ], [ [[PTR:%.*]], [[ENTRY:%.*]] ] | |||||
; CHECK-NEXT: call void @llvm.memcpy.p0.p0.i64(ptr noundef nonnull align 1 dereferenceable(32) [[PHI]], ptr noundef nonnull align 16 dereferenceable(32) @g1, i64 32, i1 false) | |||||
; CHECK-NEXT: [[V:%.*]] = load i32, ptr [[PHI]], align 4 | |||||
; CHECK-NEXT: ret i32 [[V]] | |||||
; | |||||
entry: | |||||
%a = alloca [32 x i8] | |||||
br i1 %cond, label %if, label %join | |||||
if: | |||||
br label %join | |||||
join: | |||||
%phi = phi ptr [ %a, %if ], [ %ptr, %entry ] | |||||
call void @llvm.memcpy.p0.p0.i64(ptr %phi, ptr @g1, i64 32, i1 false) | |||||
%v = load i32, ptr %phi | |||||
ret i32 %v | |||||
} | |||||
define i32 @addrspace_diff_keep_alloca(i1 %cond, ptr %x) { | |||||
; CHECK-LABEL: @addrspace_diff_keep_alloca( | |||||
; CHECK-NEXT: entry: | |||||
; CHECK-NEXT: [[ALLOCA:%.*]] = alloca [32 x i8], align 1 | |||||
; CHECK-NEXT: call void @llvm.memcpy.p0.p1.i64(ptr noundef nonnull align 1 dereferenceable(32) [[ALLOCA]], ptr addrspace(1) noundef align 16 dereferenceable(32) [[G2:@.*]], i64 32, i1 false) | |||||
; CHECK-NEXT: br i1 %cond, label [[IF:%.*]], label [[JOIN:%.*]] | |||||
; CHECK: if: ; preds = %entry | |||||
; CHECK-NEXT: br label [[JOIN]] | |||||
; CHECK: join: ; preds = %if, %entry | |||||
; CHECK-NEXT: [[PHI:%.*]] = phi ptr [ [[ALLOCA]], [[IF]] ], [ [[X:%.*]], %entry ] | |||||
; CHECK-NEXT: [[VAL:%.*]] = load i32, ptr [[PHI]], align 4 | |||||
; CHECK-NEXT: ret i32 [[VAL]] | |||||
; CHECK-NEXT: } | |||||
; | |||||
entry: | |||||
%a = alloca [32 x i8] | |||||
call void @llvm.memcpy.p0.p1.i64(ptr %a, ptr addrspace(1) @g2, i64 32, i1 false) | |||||
br i1 %cond, label %if, label %join | |||||
if: | |||||
br label %join | |||||
join: | |||||
%phi = phi ptr [ %a, %if ], [ %x, %entry ] | |||||
%v = load i32, ptr %phi | |||||
ret i32 %v | |||||
} | |||||
declare void @llvm.memcpy.p1i8.p0i8.i64(ptr addrspace(1), ptr, i64, i1) | |||||
declare void @llvm.memcpy.p0.p0.i64(ptr, ptr, i64, i1) | |||||
declare void @llvm.memcpy.p0.p1.i64(ptr, ptr addrspace(1), i64, i1) |
Don't need the target here; it just requires the target to be built