; Test how we handle eliding (pointer) bitcast instructions.
; TODO(kschimpf) Expand these tests as further CL's are added for issue 3544.
; RUN: llvm-as < %s | pnacl-freeze --pnacl-version=1 \
; RUN: | pnacl-bcanalyzer -dump-records \
; RUN: | FileCheck %s -check-prefix=PF1
; RUN: llvm-as < %s | pnacl-freeze --pnacl-version=1 | pnacl-thaw \
; RUN: | llvm-dis - | FileCheck %s -check-prefix=TD1
; RUN: llvm-as < %s | pnacl-freeze --pnacl-version=2 \
; RUN: | pnacl-bcanalyzer -dump-records \
; RUN: | FileCheck %s -check-prefix=PF2
; RUN: llvm-as < %s | pnacl-freeze --pnacl-version=2 | pnacl-thaw \
; RUN: | llvm-dis - | FileCheck %s -check-prefix=TD2
; ------------------------------------------------------
@bytes = internal global [4 x i8] c"abcd"
; ------------------------------------------------------
; Test that we elide the simple case of global.
define void @SimpleLoad() {
%1 = bitcast [4 x i8]* @bytes to i32*
%2 = load i32* %1, align 4
ret void
}
; TD1: define void @SimpleLoad() {
; TD1-NEXT: %1 = bitcast [4 x i8]* @bytes to i32*
; TD1-NEXT: %2 = load i32* %1, align 4
; TD1-NEXT: ret void
; TD1-NEXT: }
; PF1:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; TD2: define void @SimpleLoad() {
; TD2-NEXT: %1 = bitcast [4 x i8]* @bytes to i32*
; TD2-NEXT: %2 = load i32* %1, align 4
; TD2-NEXT: ret void
; TD2-NEXT: }
; PF2:
; PF2-NEXT:
; PF2-NEXT:
; PF2-NEXT:
; PF2-NEXT:
; ------------------------------------------------------
; Test that we elide the simple case of an alloca.
define void @SimpleLoadAlloca() {
%1 = alloca i8, i32 4, align 4
%2 = bitcast i8* %1 to i32*
%3 = load i32* %2, align 4
ret void
}
; TD1: define void @SimpleLoadAlloca() {
; TD1-NEXT: %1 = alloca i8, i32 4, align 4
; TD1-NEXT: %2 = bitcast i8* %1 to i32*
; TD1-NEXT: %3 = load i32* %2, align 4
; TD1-NEXT: ret void
; TD1-NEXT: }
; PF1:
; PF1:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; TD2: define void @SimpleLoadAlloca() {
; TD2-NEXT: %1 = alloca i8, i32 4, align 4
; TD2-NEXT: %2 = bitcast i8* %1 to i32*
; TD2-NEXT: %3 = load i32* %2, align 4
; TD2-NEXT: ret void
; TD2-NEXT: }
; PF2:
; PF2:
; PF2-NEXT:
; PF2-NEXT:
; PF2-NEXT:
; PF2-NEXT:
; ------------------------------------------------------
; Test that we don't elide an bitcast if one of its uses is not a load.
define i32* @NonsimpleLoad(i32 %i) {
%1 = bitcast [4 x i8]* @bytes to i32*
%2 = load i32* %1, align 4
ret i32* %1
}
; TD1: define i32* @NonsimpleLoad(i32 %i) {
; TD1-NEXT: %1 = bitcast [4 x i8]* @bytes to i32*
; TD1-NEXT: %2 = load i32* %1, align 4
; TD1-NEXT: ret i32* %1
; TD1-NEXT: }
; PF1:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1:
; TD2: define i32* @NonsimpleLoad(i32 %i) {
; TD2-NEXT: %1 = bitcast [4 x i8]* @bytes to i32*
; TD2-NEXT: %2 = load i32* %1, align 4
; TD2-NEXT: ret i32* %1
; TD2-NEXT: }
; PF2:
; PF2-NEXT:
; PF2-NEXT:
; PF2-NEXT:
; PF2-NEXT:
; PF2:
; ------------------------------------------------------
; Test that we can handle multiple bitcasts.
define i32 @TwoLoads(i32 %i) {
%1 = bitcast [4 x i8]* @bytes to i32*
%2 = load i32* %1, align 4
%3 = bitcast [4 x i8]* @bytes to i32*
%4 = load i32* %3, align 4
%5 = add i32 %2, %4
ret i32 %5
}
; TD1: define i32 @TwoLoads(i32 %i) {
; TD1-NEXT: %1 = bitcast [4 x i8]* @bytes to i32*
; TD1-NEXT: %2 = load i32* %1, align 4
; TD1-NEXT: %3 = bitcast [4 x i8]* @bytes to i32*
; TD1-NEXT: %4 = load i32* %3, align 4
; TD1-NEXT: %5 = add i32 %2, %4
; TD1-NEXT: ret i32 %5
; TD1-NEXT: }
; PF1:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1:
; TD2: define i32 @TwoLoads(i32 %i) {
; TD2-NEXT: %1 = bitcast [4 x i8]* @bytes to i32*
; TD2-NEXT: %2 = load i32* %1, align 4
; TD2-NEXT: %3 = load i32* %1, align 4
; TD2-NEXT: %4 = add i32 %2, %3
; TD2-NEXT: ret i32 %4
; TD2-NEXT: }
; PF2:
; PF2-NEXT:
; PF2-NEXT:
; PF2-NEXT:
; PF2-NEXT:
; PF2-NEXT:
; PF2:
; ------------------------------------------------------
; Test how we handle bitcasts if optimized in the input file. This
; case tests within a single block.
define i32 @TwoLoadOptOneBlock(i32 %i) {
%1 = bitcast [4 x i8]* @bytes to i32*
%2 = load i32* %1, align 4
%3 = load i32* %1, align 4
%4 = add i32 %2, %3
ret i32 %4
}
; TD1: define i32 @TwoLoadOptOneBlock(i32 %i) {
; TD1-NEXT: %1 = bitcast [4 x i8]* @bytes to i32*
; TD1-NEXT: %2 = load i32* %1, align 4
; TD1-NEXT: %3 = load i32* %1, align 4
; TD1-NEXT: %4 = add i32 %2, %3
; TD1-NEXT: ret i32 %4
; TD1-NEXT: }
; PF1:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1:
; TD2: define i32 @TwoLoadOptOneBlock(i32 %i) {
; TD2-NEXT: %1 = bitcast [4 x i8]* @bytes to i32*
; TD2-NEXT: %2 = load i32* %1, align 4
; TD2-NEXT: %3 = load i32* %1, align 4
; TD2-NEXT: %4 = add i32 %2, %3
; TD2-NEXT: ret i32 %4
; TD2-NEXT: }
; PF2:
; PF2-NEXT:
; PF2-NEXT:
; PF2-NEXT:
; PF2-NEXT:
; PF2-NEXT:
; PF2:
; ------------------------------------------------------
; Test how we handle bitcasts if optimized in the input file. This
; case tests accross blocks.
define i32 @TwoLoadOptTwoBlocks(i32 %i) {
%1 = bitcast [4 x i8]* @bytes to i32*
%2 = load i32* %1, align 4
%3 = load i32* %1, align 4
%4 = add i32 %2, %3
br label %BB
BB:
%5 = load i32* %1, align 4
%6 = load i32* %1, align 4
%7 = add i32 %5, %6
ret i32 %4
}
; TD1: define i32 @TwoLoadOptTwoBlocks(i32 %i) {
; TD1-NEXT: %1 = bitcast [4 x i8]* @bytes to i32*
; TD1-NEXT: %2 = load i32* %1, align 4
; TD1-NEXT: %3 = load i32* %1, align 4
; TD1-NEXT: %4 = add i32 %2, %3
; TD1-NEXT: br label %BB
; TD1: BB:
; TD1-NEXT: %5 = load i32* %1, align 4
; TD1-NEXT: %6 = load i32* %1, align 4
; TD1-NEXT: %7 = add i32 %5, %6
; TD1-NEXT: ret i32 %4
; TD1-NEXT: }
; PF1:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1:
; TD2: define i32 @TwoLoadOptTwoBlocks(i32 %i) {
; TD2-NEXT: %1 = bitcast [4 x i8]* @bytes to i32*
; TD2-NEXT: %2 = load i32* %1, align 4
; TD2-NEXT: %3 = load i32* %1, align 4
; TD2-NEXT: %4 = add i32 %2, %3
; TD2-NEXT: br label %BB
; TD2: BB:
; TD2-NEXT: %5 = bitcast [4 x i8]* @bytes to i32*
; TD2-NEXT: %6 = load i32* %5, align 4
; TD2-NEXT: %7 = load i32* %5, align 4
; TD2-NEXT: %8 = add i32 %6, %7
; TD2-NEXT: ret i32 %4
; TD2-NEXT: }
; PF2:
; PF2-NEXT:
; PF2-NEXT:
; PF2-NEXT:
; PF2-NEXT:
; PF2-NEXT:
; PF2-NEXT:
; PF2-NEXT:
; PF2-NEXT:
; PF2-NEXT:
; PF2:
; ------------------------------------------------------
; Test that we elide the simple case of bitcast for a store.
define void @SimpleStore(i32 %i) {
%1 = bitcast [4 x i8]* @bytes to i32*
store i32 %i, i32* %1, align 4
ret void
}
; TD1: define void @SimpleStore(i32 %i) {
; TD1-NEXT: %1 = bitcast [4 x i8]* @bytes to i32*
; TD1-NEXT: store i32 %i, i32* %1, align 4
; TD1-NEXT: ret void
; TD1-NEXT: }
; PF1:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1-NEXT:
; PF1:
; TD2: define void @SimpleStore(i32 %i) {
; TD2-NEXT: %1 = bitcast [4 x i8]* @bytes to i32*
; TD2-NEXT: store i32 %i, i32* %1, align 4
; TD2-NEXT: ret void
; TD2-NEXT: }
; PF2:
; PF2-NEXT:
; PF2-NEXT:
; PF2-NEXT:
; PF2: