This patch canonicalizes getelementptr instructions with constant indices to use the `i8` source element type. This makes it easier for optimizations to recognize that two GEPs are identical, because they don't need to see past many different ways to express the same offset. This is a first step towards https://discourse.llvm.org/t/rfc-replacing-getelementptr-with-ptradd/68699. This is limited to constant GEPs only for now, as they have a clear canonical form, while we're not yet sure how exactly to deal with variable indices. The test llvm/test/Transforms/PhaseOrdering/switch_with_geps.ll gives two representative examples of the kind of optimization improvement we expect from this change. In the first test SimplifyCFG can now realize that all switch branches are actually the same. In the second test it can convert it into simple arithmetic. These are representative of common optimization failures we see in Rust. Fixes https://github.com/llvm/llvm-project/issues/69841.
467 lines
17 KiB
LLVM
467 lines
17 KiB
LLVM
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
|
|
; RUN: opt -passes=instcombine -S -o - %s | FileCheck %s
|
|
|
|
target datalayout="p5:32:32-A5"
|
|
|
|
@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:
|
|
; 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: [[PTR1:%.*]] = 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 [[PTR1]], align 1
|
|
; CHECK-NEXT: ret i8 [[LOAD]]
|
|
;
|
|
entry:
|
|
%alloca = alloca [32 x i8], align 4, addrspace(1)
|
|
call void @llvm.memcpy.p1.p0.i64(ptr addrspace(1) %alloca, ptr @g1, i64 32, 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(32) [[ALLOCA]], ptr noundef nonnull align 16 dereferenceable(32) @g1, i64 32, i1 false)
|
|
; CHECK-NEXT: br i1 [[COND:%.*]], label [[IF:%.*]], label [[ELSE:%.*]]
|
|
; CHECK: if:
|
|
; CHECK-NEXT: [[VAL_IF:%.*]] = getelementptr inbounds i8, ptr addrspace(1) [[ALLOCA]], i64 1
|
|
; CHECK-NEXT: br label [[SINK:%.*]]
|
|
; CHECK: else:
|
|
; CHECK-NEXT: [[VAL_ELSE:%.*]] = getelementptr inbounds i8, ptr addrspace(1) [[ALLOCA]], 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.p1.p0.i64(ptr addrspace(1) %alloca, ptr @g1, i64 32, 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
|
|
|
|
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 i8, ptr addrspace(1) [[ALLOCA]], i64 1
|
|
; CHECK-NEXT: br label [[SINK:%.*]]
|
|
; CHECK: else:
|
|
; CHECK-NEXT: [[VAL_ELSE:%.*]] = getelementptr inbounds i8, ptr addrspace(1) [[ALLOCA]], 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: [[PTR1:%.*]] = 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 [[PTR1]], align 1
|
|
; CHECK-NEXT: ret i8 [[LOAD]]
|
|
;
|
|
entry:
|
|
%alloca = alloca [32 x i8], align 4, addrspace(1)
|
|
call void @llvm.memcpy.p1.p0.i64(ptr addrspace(1) %alloca, ptr @g1, i64 32, 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_remove_alloca(i1 %cond) {
|
|
; CHECK-LABEL: @loop_phi_late_memtransfer_remove_alloca(
|
|
; CHECK-NEXT: entry:
|
|
; CHECK-NEXT: br label [[BB_0:%.*]]
|
|
; CHECK: bb.0:
|
|
; CHECK-NEXT: [[PTR1:%.*]] = 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 [[PTR1]], 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.p1.p0.i64(ptr addrspace(1) %alloca, ptr @g1, i64 32, 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: [[A:%.*]] = alloca [32 x i8], align 1
|
|
; CHECK-NEXT: call void @llvm.memcpy.p0.p1.i64(ptr noundef nonnull align 1 dereferenceable(32) [[A]], ptr addrspace(1) noundef align 16 dereferenceable(32) @g2, i64 32, i1 false)
|
|
; 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]] ], [ [[X:%.*]], [[ENTRY:%.*]] ]
|
|
; CHECK-NEXT: [[V:%.*]] = load i32, ptr [[PHI]], align 4
|
|
; CHECK-NEXT: ret i32 [[V]]
|
|
;
|
|
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
|
|
}
|
|
|
|
define i32 @addrspace_diff_keep_alloca_extra_gep(i1 %cond, ptr %x) {
|
|
; CHECK-LABEL: @addrspace_diff_keep_alloca_extra_gep(
|
|
; CHECK-NEXT: entry:
|
|
; CHECK-NEXT: [[A:%.*]] = alloca [32 x i8], align 1
|
|
; CHECK-NEXT: call void @llvm.memcpy.p0.p1.i64(ptr noundef nonnull align 1 dereferenceable(32) [[A]], ptr addrspace(1) noundef align 16 dereferenceable(32) @g2, i64 32, i1 false)
|
|
; CHECK-NEXT: br i1 [[COND:%.*]], label [[IF:%.*]], label [[JOIN:%.*]]
|
|
; CHECK: if:
|
|
; CHECK-NEXT: [[GEP:%.*]] = getelementptr inbounds i8, ptr [[A]], i64 4
|
|
; CHECK-NEXT: br label [[JOIN]]
|
|
; CHECK: join:
|
|
; CHECK-NEXT: [[PHI:%.*]] = phi ptr [ [[GEP]], [[IF]] ], [ [[X:%.*]], [[ENTRY:%.*]] ]
|
|
; CHECK-NEXT: [[V:%.*]] = load i32, ptr [[PHI]], align 4
|
|
; CHECK-NEXT: ret i32 [[V]]
|
|
;
|
|
entry:
|
|
%a = alloca [32 x i8]
|
|
call void @llvm.memcpy.p0.p1.i64(ptr %a, ptr addrspace(1) @g2, i64 32, i1 false)
|
|
%gep = getelementptr i8, ptr %a, i64 4
|
|
br i1 %cond, label %if, label %join
|
|
|
|
if:
|
|
br label %join
|
|
|
|
join:
|
|
%phi = phi ptr [ %gep, %if ], [ %x, %entry ]
|
|
%v = load i32, ptr %phi
|
|
ret i32 %v
|
|
}
|
|
|
|
define i32 @addrspace_diff_remove_alloca(i1 %cond) {
|
|
; CHECK-LABEL: @addrspace_diff_remove_alloca(
|
|
; CHECK-NEXT: entry:
|
|
; CHECK-NEXT: br i1 [[COND:%.*]], label [[IF:%.*]], label [[JOIN:%.*]]
|
|
; CHECK: if:
|
|
; CHECK-NEXT: br label [[JOIN]]
|
|
; CHECK: join:
|
|
; CHECK-NEXT: [[PHI1:%.*]] = phi ptr addrspace(1) [ @g2, [[IF]] ], [ getelementptr inbounds ([32 x i8], ptr addrspace(1) @g2, i64 0, i64 2), [[ENTRY:%.*]] ]
|
|
; CHECK-NEXT: [[V:%.*]] = load i32, ptr addrspace(1) [[PHI1]], align 4
|
|
; CHECK-NEXT: ret i32 [[V]]
|
|
;
|
|
entry:
|
|
%a = alloca [32 x i8]
|
|
call void @llvm.memcpy.p0.p1.i64(ptr %a, ptr addrspace(1) @g2, i64 32, i1 false)
|
|
%gep = getelementptr inbounds [32 x i8], ptr %a, i32 0, i32 2
|
|
br i1 %cond, label %if, label %join
|
|
|
|
if:
|
|
br label %join
|
|
|
|
join:
|
|
%phi = phi ptr [ %a, %if ], [ %gep, %entry ]
|
|
%v = load i32, ptr %phi
|
|
ret i32 %v
|
|
}
|
|
|
|
define i32 @phi_loop(i1 %c) {
|
|
; CHECK-LABEL: @phi_loop(
|
|
; CHECK-NEXT: entry:
|
|
; CHECK-NEXT: br label [[LOOP:%.*]]
|
|
; CHECK: loop:
|
|
; CHECK-NEXT: [[PTR:%.*]] = phi ptr [ @g1, [[ENTRY:%.*]] ], [ [[PTR_NEXT:%.*]], [[LOOP]] ]
|
|
; CHECK-NEXT: [[PTR_NEXT]] = getelementptr i8, ptr [[PTR]], i64 4
|
|
; CHECK-NEXT: br i1 [[C:%.*]], label [[EXIT:%.*]], label [[LOOP]]
|
|
; CHECK: exit:
|
|
; CHECK-NEXT: [[V:%.*]] = load i32, ptr [[PTR]], 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 label %loop
|
|
|
|
loop:
|
|
%ptr = phi ptr [ %alloca, %entry ], [ %ptr.next, %loop ]
|
|
%ptr.next = getelementptr i8, ptr %ptr, i64 4
|
|
br i1 %c, label %exit, label %loop
|
|
|
|
exit:
|
|
%v = load i32, ptr %ptr
|
|
ret i32 %v
|
|
}
|
|
|
|
define i32 @phi_loop_different_addrspace(i1 %c) {
|
|
; CHECK-LABEL: @phi_loop_different_addrspace(
|
|
; 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 label [[LOOP:%.*]]
|
|
; CHECK: loop:
|
|
; CHECK-NEXT: [[PTR:%.*]] = phi ptr [ [[ALLOCA]], [[ENTRY:%.*]] ], [ [[PTR_NEXT:%.*]], [[LOOP]] ]
|
|
; CHECK-NEXT: [[PTR_NEXT]] = getelementptr i8, ptr [[PTR]], i64 4
|
|
; CHECK-NEXT: br i1 [[C:%.*]], label [[EXIT:%.*]], label [[LOOP]]
|
|
; CHECK: exit:
|
|
; CHECK-NEXT: [[V:%.*]] = load i32, ptr [[PTR]], align 4
|
|
; CHECK-NEXT: ret i32 [[V]]
|
|
;
|
|
entry:
|
|
%alloca = alloca [32 x i8]
|
|
call void @llvm.memcpy.p0.p1.i64(ptr %alloca, ptr addrspace(1) @g2, i64 32, i1 false)
|
|
br label %loop
|
|
|
|
loop:
|
|
%ptr = phi ptr [ %alloca, %entry ], [ %ptr.next, %loop ]
|
|
%ptr.next = getelementptr i8, ptr %ptr, i64 4
|
|
br i1 %c, label %exit, label %loop
|
|
|
|
exit:
|
|
%v = load i32, ptr %ptr
|
|
ret i32 %v
|
|
}
|
|
|
|
define i8 @select_same_addrspace_remove_alloca(i1 %cond, ptr %p) {
|
|
; CHECK-LABEL: @select_same_addrspace_remove_alloca(
|
|
; CHECK-NEXT: entry:
|
|
; CHECK-NEXT: [[PTR:%.*]] = select i1 [[COND:%.*]], ptr @g1, ptr [[P:%.*]]
|
|
; CHECK-NEXT: [[LOAD:%.*]] = load i8, ptr [[PTR]], align 1
|
|
; CHECK-NEXT: ret i8 [[LOAD]]
|
|
;
|
|
entry:
|
|
%alloca = alloca [32 x i8]
|
|
call void @llvm.memcpy.p0.p0.i64(ptr %alloca, ptr @g1, i64 32, i1 false)
|
|
%ptr = select i1 %cond, ptr %alloca, ptr %p
|
|
%load = load i8, ptr %ptr
|
|
ret i8 %load
|
|
}
|
|
|
|
define i8 @select_after_memcpy_keep_alloca(i1 %cond, ptr %p) {
|
|
; CHECK-LABEL: @select_after_memcpy_keep_alloca(
|
|
; CHECK-NEXT: entry:
|
|
; CHECK-NEXT: [[ALLOCA:%.*]] = alloca [32 x i8], align 1
|
|
; CHECK-NEXT: [[PTR:%.*]] = select i1 [[COND:%.*]], ptr [[ALLOCA]], ptr [[P:%.*]]
|
|
; CHECK-NEXT: call void @llvm.memcpy.p0.p0.i64(ptr noundef nonnull align 1 dereferenceable(32) [[PTR]], ptr noundef nonnull align 16 dereferenceable(32) @g1, i64 32, i1 false)
|
|
; CHECK-NEXT: [[LOAD:%.*]] = load i8, ptr [[PTR]], align 1
|
|
; CHECK-NEXT: ret i8 [[LOAD]]
|
|
;
|
|
entry:
|
|
%alloca = alloca [32 x i8]
|
|
%ptr = select i1 %cond, ptr %alloca, ptr %p
|
|
call void @llvm.memcpy.p0.p0.i64(ptr %ptr, ptr @g1, i64 32, i1 false)
|
|
%load = load i8, ptr %ptr
|
|
ret i8 %load
|
|
}
|
|
|
|
define i8 @select_diff_addrspace_keep_alloca(i1 %cond, ptr addrspace(1) %p) {
|
|
; CHECK-LABEL: @select_diff_addrspace_keep_alloca(
|
|
; CHECK-NEXT: entry:
|
|
; CHECK-NEXT: [[ALLOCA:%.*]] = alloca [32 x i8], align 1, addrspace(1)
|
|
; CHECK-NEXT: call void @llvm.memcpy.p1.p0.i64(ptr addrspace(1) noundef align 1 dereferenceable(32) [[ALLOCA]], ptr noundef nonnull align 16 dereferenceable(32) @g1, i64 32, i1 false)
|
|
; CHECK-NEXT: [[PTR:%.*]] = select i1 [[COND:%.*]], ptr addrspace(1) [[ALLOCA]], ptr addrspace(1) [[P:%.*]]
|
|
; CHECK-NEXT: [[LOAD:%.*]] = load i8, ptr addrspace(1) [[PTR]], align 1
|
|
; CHECK-NEXT: ret i8 [[LOAD]]
|
|
;
|
|
entry:
|
|
%alloca = alloca [32 x i8], addrspace(1)
|
|
call void @llvm.memcpy.p1.p0.i64(ptr addrspace(1) %alloca, ptr @g1, i64 32, i1 false)
|
|
%ptr = select i1 %cond, ptr addrspace(1) %alloca, ptr addrspace(1) %p
|
|
%load = load i8, ptr addrspace(1) %ptr
|
|
ret i8 %load
|
|
}
|
|
|
|
define i8 @select_diff_addrspace_remove_alloca(i1 %cond, ptr %p) {
|
|
; CHECK-LABEL: @select_diff_addrspace_remove_alloca(
|
|
; CHECK-NEXT: entry:
|
|
; CHECK-NEXT: ret i8 0
|
|
;
|
|
entry:
|
|
%alloca = alloca [32 x i8]
|
|
call void @llvm.memcpy.p0.p1.i64(ptr %alloca, ptr addrspace(1) @g2, i64 32, i1 false)
|
|
%gep = getelementptr inbounds [32 x i8], ptr %alloca, i32 0, i32 2
|
|
%sel = select i1 %cond, ptr %alloca, ptr %gep
|
|
%gep2 = getelementptr inbounds i8, ptr %sel, i64 4
|
|
%load = load i8, ptr %gep2
|
|
ret i8 %load
|
|
}
|
|
|
|
declare i8 @readonly_callee(ptr readonly nocapture)
|
|
|
|
define i8 @call_readonly_remove_alloca() {
|
|
; CHECK-LABEL: @call_readonly_remove_alloca(
|
|
; CHECK-NEXT: [[V:%.*]] = call i8 @readonly_callee(ptr nonnull @g1)
|
|
; CHECK-NEXT: ret i8 [[V]]
|
|
;
|
|
%alloca = alloca [32 x i8], addrspace(1)
|
|
call void @llvm.memcpy.p1.p0.i64(ptr addrspace(1) %alloca, ptr @g1, i64 32, i1 false)
|
|
%p = addrspacecast ptr addrspace(1) %alloca to ptr
|
|
%v = call i8 @readonly_callee(ptr %p)
|
|
ret i8 %v
|
|
}
|
|
|
|
define i8 @call_readonly_keep_alloca2() {
|
|
; CHECK-LABEL: @call_readonly_keep_alloca2(
|
|
; CHECK-NEXT: [[ALLOCA:%.*]] = alloca [32 x i8], align 1, addrspace(1)
|
|
; CHECK-NEXT: call void @llvm.memcpy.p1.p0.i64(ptr addrspace(1) noundef align 1 dereferenceable(16) [[ALLOCA]], ptr noundef nonnull align 16 dereferenceable(16) @g1, i64 16, i1 false)
|
|
; CHECK-NEXT: [[A1:%.*]] = getelementptr inbounds i8, ptr addrspace(1) [[ALLOCA]], i64 16
|
|
; CHECK-NEXT: call void @llvm.memcpy.p1.p1.i64(ptr addrspace(1) noundef align 1 dereferenceable(16) [[A1]], ptr addrspace(1) noundef align 16 dereferenceable(16) @g2, i64 16, i1 false)
|
|
; CHECK-NEXT: [[P:%.*]] = addrspacecast ptr addrspace(1) [[ALLOCA]] to ptr
|
|
; CHECK-NEXT: [[V:%.*]] = call i8 @readonly_callee(ptr [[P]])
|
|
; CHECK-NEXT: ret i8 [[V]]
|
|
;
|
|
%alloca = alloca [32 x i8], addrspace(1)
|
|
call void @llvm.memcpy.p1.p0.i64(ptr addrspace(1) %alloca, ptr @g1, i64 16, i1 false)
|
|
%a1 = getelementptr inbounds [32 x i8], ptr addrspace(1) %alloca, i32 0, i32 16
|
|
call void @llvm.memcpy.p1.p1.i64(ptr addrspace(1) %a1, ptr addrspace(1) @g2, i64 16, i1 false)
|
|
%p = addrspacecast ptr addrspace(1) %alloca to ptr
|
|
%v = call i8 @readonly_callee(ptr %p)
|
|
ret i8 %v
|
|
}
|
|
|
|
declare void @llvm.memcpy.p1.p0.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)
|
|
declare void @llvm.memcpy.p1.p1.i64(ptr addrspace(1), ptr addrspace(1), i64, i1)
|