2017-04-19 15:29:46 +08:00
|
|
|
; RUN: llc -mtriple arm-unknown -mattr=+vfp2,+v6 -global-isel %s -o - | FileCheck %s
|
2016-12-16 20:54:46 +08:00
|
|
|
|
|
|
|
define void @test_void_return() {
|
|
|
|
; CHECK-LABEL: test_void_return:
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
2017-04-24 14:30:56 +08:00
|
|
|
define i32 @test_constant_return_i32() {
|
|
|
|
; CHECK-LABEL: test_constant_return_i32:
|
|
|
|
; CHECK: mov r0, #42
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
ret i32 42
|
|
|
|
}
|
|
|
|
|
2017-01-25 16:47:40 +08:00
|
|
|
define zeroext i1 @test_zext_i1(i1 %x) {
|
|
|
|
; CHECK-LABEL: test_zext_i1
|
|
|
|
; CHECK: and r0, r0, #1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
ret i1 %x
|
|
|
|
}
|
|
|
|
|
|
|
|
define signext i1 @test_sext_i1(i1 %x) {
|
|
|
|
; CHECK-LABEL: test_sext_i1
|
[GISel]: Rework legalization algorithm for better elimination of
artifacts along with DCE
Legalization Artifacts are all those insts that are there to make the
type system happy. Currently, the target needs to say all combinations
of extends and truncs are legal and there's no way of verifying that
post legalization, we only have *truly* legal instructions. This patch
changes roughly the legalization algorithm to process all illegal insts
at one go, and then process all truncs/extends that were added to
satisfy the type constraints separately trying to combine trivial cases
until they converge. This has the added benefit that, the target
legalizerinfo can only say which truncs and extends are okay and the
artifact combiner would combine away other exts and truncs.
Updated legalization algorithm to roughly the following pseudo code.
WorkList Insts, Artifacts;
collect_all_insts_and_artifacts(Insts, Artifacts);
do {
for (Inst in Insts)
legalizeInstrStep(Inst, Insts, Artifacts);
for (Artifact in Artifacts)
tryCombineArtifact(Artifact, Insts, Artifacts);
} while(!Insts.empty());
Also, wrote a simple wrapper equivalent to SetVector, except for
erasing, it avoids moving all elements over by one and instead just
nulls them out.
llvm-svn: 318210
2017-11-15 06:42:19 +08:00
|
|
|
; CHECK: mov r1, #31
|
|
|
|
; CHECK: lsl r0, r0, r1
|
|
|
|
; CHECK: asr r0, r0, r1
|
2017-01-25 16:47:40 +08:00
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
ret i1 %x
|
|
|
|
}
|
|
|
|
|
2017-01-25 16:10:40 +08:00
|
|
|
define zeroext i8 @test_ext_i8(i8 %x) {
|
|
|
|
; CHECK-LABEL: test_ext_i8:
|
2017-12-01 02:48:35 +08:00
|
|
|
; CHECK: uxtb r0, r0
|
2017-01-25 16:10:40 +08:00
|
|
|
; CHECK: bx lr
|
[GISel]: Rework legalization algorithm for better elimination of
artifacts along with DCE
Legalization Artifacts are all those insts that are there to make the
type system happy. Currently, the target needs to say all combinations
of extends and truncs are legal and there's no way of verifying that
post legalization, we only have *truly* legal instructions. This patch
changes roughly the legalization algorithm to process all illegal insts
at one go, and then process all truncs/extends that were added to
satisfy the type constraints separately trying to combine trivial cases
until they converge. This has the added benefit that, the target
legalizerinfo can only say which truncs and extends are okay and the
artifact combiner would combine away other exts and truncs.
Updated legalization algorithm to roughly the following pseudo code.
WorkList Insts, Artifacts;
collect_all_insts_and_artifacts(Insts, Artifacts);
do {
for (Inst in Insts)
legalizeInstrStep(Inst, Insts, Artifacts);
for (Artifact in Artifacts)
tryCombineArtifact(Artifact, Insts, Artifacts);
} while(!Insts.empty());
Also, wrote a simple wrapper equivalent to SetVector, except for
erasing, it avoids moving all elements over by one and instead just
nulls them out.
llvm-svn: 318210
2017-11-15 06:42:19 +08:00
|
|
|
|
2017-01-25 16:10:40 +08:00
|
|
|
entry:
|
|
|
|
ret i8 %x
|
|
|
|
}
|
|
|
|
|
|
|
|
define signext i16 @test_ext_i16(i16 %x) {
|
|
|
|
; CHECK-LABEL: test_ext_i16:
|
[GISel]: Rework legalization algorithm for better elimination of
artifacts along with DCE
Legalization Artifacts are all those insts that are there to make the
type system happy. Currently, the target needs to say all combinations
of extends and truncs are legal and there's no way of verifying that
post legalization, we only have *truly* legal instructions. This patch
changes roughly the legalization algorithm to process all illegal insts
at one go, and then process all truncs/extends that were added to
satisfy the type constraints separately trying to combine trivial cases
until they converge. This has the added benefit that, the target
legalizerinfo can only say which truncs and extends are okay and the
artifact combiner would combine away other exts and truncs.
Updated legalization algorithm to roughly the following pseudo code.
WorkList Insts, Artifacts;
collect_all_insts_and_artifacts(Insts, Artifacts);
do {
for (Inst in Insts)
legalizeInstrStep(Inst, Insts, Artifacts);
for (Artifact in Artifacts)
tryCombineArtifact(Artifact, Insts, Artifacts);
} while(!Insts.empty());
Also, wrote a simple wrapper equivalent to SetVector, except for
erasing, it avoids moving all elements over by one and instead just
nulls them out.
llvm-svn: 318210
2017-11-15 06:42:19 +08:00
|
|
|
; CHECK: mov r1, #16
|
|
|
|
; CHECK: lsl r0, r0, r1
|
|
|
|
; CHECK: asr r0, r0, r1
|
2017-01-25 16:10:40 +08:00
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
ret i16 %x
|
|
|
|
}
|
|
|
|
|
2017-04-21 21:16:50 +08:00
|
|
|
define void @test_trunc_i32_i16(i32 %v, i16 *%p) {
|
|
|
|
; CHECK-LABEL: test_trunc_i32_i16:
|
|
|
|
; The trunc doesn't result in any instructions, but we
|
|
|
|
; expect the store to be explicitly 16-bit.
|
|
|
|
; CHECK: strh r0, [r1]
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%v16 = trunc i32 %v to i16
|
|
|
|
store i16 %v16, i16 *%p
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
|
|
|
define void @test_trunc_i32_i8(i32 %v, i8 *%p) {
|
|
|
|
; CHECK-LABEL: test_trunc_i32_i8:
|
|
|
|
; The trunc doesn't result in any instructions, but we
|
|
|
|
; expect the store to be explicitly 8-bit.
|
|
|
|
; CHECK: strb r0, [r1]
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%v8 = trunc i32 %v to i8
|
|
|
|
store i8 %v8, i8 *%p
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
2016-12-19 22:08:02 +08:00
|
|
|
define i8 @test_add_i8(i8 %x, i8 %y) {
|
|
|
|
; CHECK-LABEL: test_add_i8:
|
|
|
|
; CHECK: add r0, r0, r1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%sum = add i8 %x, %y
|
|
|
|
ret i8 %sum
|
|
|
|
}
|
|
|
|
|
|
|
|
define i16 @test_add_i16(i16 %x, i16 %y) {
|
|
|
|
; CHECK-LABEL: test_add_i16:
|
|
|
|
; CHECK: add r0, r0, r1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%sum = add i16 %x, %y
|
|
|
|
ret i16 %sum
|
|
|
|
}
|
|
|
|
|
|
|
|
define i32 @test_add_i32(i32 %x, i32 %y) {
|
|
|
|
; CHECK-LABEL: test_add_i32:
|
2016-12-16 20:54:46 +08:00
|
|
|
; CHECK: add r0, r0, r1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%sum = add i32 %x, %y
|
|
|
|
ret i32 %sum
|
|
|
|
}
|
2016-12-19 19:55:41 +08:00
|
|
|
|
2017-04-18 20:35:28 +08:00
|
|
|
define i8 @test_sub_i8(i8 %x, i8 %y) {
|
|
|
|
; CHECK-LABEL: test_sub_i8:
|
|
|
|
; CHECK: sub r0, r0, r1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%sum = sub i8 %x, %y
|
|
|
|
ret i8 %sum
|
|
|
|
}
|
|
|
|
|
|
|
|
define i16 @test_sub_i16(i16 %x, i16 %y) {
|
|
|
|
; CHECK-LABEL: test_sub_i16:
|
|
|
|
; CHECK: sub r0, r0, r1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%sum = sub i16 %x, %y
|
|
|
|
ret i16 %sum
|
|
|
|
}
|
|
|
|
|
|
|
|
define i32 @test_sub_i32(i32 %x, i32 %y) {
|
|
|
|
; CHECK-LABEL: test_sub_i32:
|
|
|
|
; CHECK: sub r0, r0, r1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%sum = sub i32 %x, %y
|
|
|
|
ret i32 %sum
|
|
|
|
}
|
|
|
|
|
2017-04-19 15:29:46 +08:00
|
|
|
define i8 @test_mul_i8(i8 %x, i8 %y) {
|
|
|
|
; CHECK-LABEL: test_mul_i8:
|
|
|
|
; CHECK: mul r0, r0, r1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%sum = mul i8 %x, %y
|
|
|
|
ret i8 %sum
|
|
|
|
}
|
|
|
|
|
|
|
|
define i16 @test_mul_i16(i16 %x, i16 %y) {
|
|
|
|
; CHECK-LABEL: test_mul_i16:
|
|
|
|
; CHECK: mul r0, r0, r1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%sum = mul i16 %x, %y
|
|
|
|
ret i16 %sum
|
|
|
|
}
|
|
|
|
|
|
|
|
define i32 @test_mul_i32(i32 %x, i32 %y) {
|
|
|
|
; CHECK-LABEL: test_mul_i32:
|
|
|
|
; CHECK: mul r0, r0, r1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%sum = mul i32 %x, %y
|
|
|
|
ret i32 %sum
|
|
|
|
}
|
|
|
|
|
2017-06-07 17:17:41 +08:00
|
|
|
define i8 @test_and_i8(i8 %x, i8 %y) {
|
|
|
|
; CHECK-LABEL: test_and_i8:
|
|
|
|
; CHECK: and r0, r0, r1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%sum = and i8 %x, %y
|
|
|
|
ret i8 %sum
|
|
|
|
}
|
|
|
|
|
|
|
|
define i16 @test_and_i16(i16 %x, i16 %y) {
|
|
|
|
; CHECK-LABEL: test_and_i16:
|
|
|
|
; CHECK: and r0, r0, r1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%sum = and i16 %x, %y
|
|
|
|
ret i16 %sum
|
|
|
|
}
|
|
|
|
|
|
|
|
define i32 @test_and_i32(i32 %x, i32 %y) {
|
|
|
|
; CHECK-LABEL: test_and_i32:
|
|
|
|
; CHECK: and r0, r0, r1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%sum = and i32 %x, %y
|
|
|
|
ret i32 %sum
|
|
|
|
}
|
|
|
|
|
2017-06-07 18:14:23 +08:00
|
|
|
define i8 @test_or_i8(i8 %x, i8 %y) {
|
|
|
|
; CHECK-LABEL: test_or_i8:
|
|
|
|
; CHECK: orr r0, r0, r1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%sum = or i8 %x, %y
|
|
|
|
ret i8 %sum
|
|
|
|
}
|
|
|
|
|
|
|
|
define i16 @test_or_i16(i16 %x, i16 %y) {
|
|
|
|
; CHECK-LABEL: test_or_i16:
|
|
|
|
; CHECK: orr r0, r0, r1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%sum = or i16 %x, %y
|
|
|
|
ret i16 %sum
|
|
|
|
}
|
|
|
|
|
|
|
|
define i32 @test_or_i32(i32 %x, i32 %y) {
|
|
|
|
; CHECK-LABEL: test_or_i32:
|
|
|
|
; CHECK: orr r0, r0, r1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%sum = or i32 %x, %y
|
|
|
|
ret i32 %sum
|
|
|
|
}
|
|
|
|
|
2017-06-07 19:57:30 +08:00
|
|
|
define i8 @test_xor_i8(i8 %x, i8 %y) {
|
|
|
|
; CHECK-LABEL: test_xor_i8:
|
|
|
|
; CHECK: eor r0, r0, r1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%sum = xor i8 %x, %y
|
|
|
|
ret i8 %sum
|
|
|
|
}
|
|
|
|
|
|
|
|
define i16 @test_xor_i16(i16 %x, i16 %y) {
|
|
|
|
; CHECK-LABEL: test_xor_i16:
|
|
|
|
; CHECK: eor r0, r0, r1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%sum = xor i16 %x, %y
|
|
|
|
ret i16 %sum
|
|
|
|
}
|
|
|
|
|
|
|
|
define i32 @test_xor_i32(i32 %x, i32 %y) {
|
|
|
|
; CHECK-LABEL: test_xor_i32:
|
|
|
|
; CHECK: eor r0, r0, r1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%sum = xor i32 %x, %y
|
|
|
|
ret i32 %sum
|
|
|
|
}
|
|
|
|
|
2017-01-26 17:20:47 +08:00
|
|
|
define i32 @test_stack_args_i32(i32 %p0, i32 %p1, i32 %p2, i32 %p3, i32 %p4, i32 %p5) {
|
|
|
|
; CHECK-LABEL: test_stack_args_i32:
|
2016-12-19 19:55:41 +08:00
|
|
|
; CHECK: add [[P5ADDR:r[0-9]+]], sp, #4
|
|
|
|
; CHECK: ldr [[P5:r[0-9]+]], {{.*}}[[P5ADDR]]
|
|
|
|
; CHECK: add r0, r2, [[P5]]
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%sum = add i32 %p2, %p5
|
|
|
|
ret i32 %sum
|
|
|
|
}
|
2017-01-26 17:20:47 +08:00
|
|
|
|
|
|
|
define i16 @test_stack_args_mixed(i32 %p0, i16 %p1, i8 %p2, i1 %p3, i8 %p4, i16 %p5) {
|
|
|
|
; CHECK-LABEL: test_stack_args_mixed:
|
|
|
|
; CHECK: add [[P5ADDR:r[0-9]+]], sp, #4
|
|
|
|
; CHECK: ldrh [[P5:r[0-9]+]], {{.*}}[[P5ADDR]]
|
|
|
|
; CHECK: add r0, r1, [[P5]]
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%sum = add i16 %p1, %p5
|
|
|
|
ret i16 %sum
|
|
|
|
}
|
|
|
|
|
|
|
|
define i16 @test_stack_args_zeroext(i32 %p0, i16 %p1, i8 %p2, i1 %p3, i16 zeroext %p4) {
|
|
|
|
; CHECK-LABEL: test_stack_args_zeroext:
|
|
|
|
; CHECK: mov [[P4ADDR:r[0-9]+]], sp
|
|
|
|
; CHECK: ldr [[P4:r[0-9]+]], {{.*}}[[P4ADDR]]
|
|
|
|
; CHECK: add r0, r1, [[P4]]
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%sum = add i16 %p1, %p4
|
|
|
|
ret i16 %sum
|
|
|
|
}
|
|
|
|
|
|
|
|
define i8 @test_stack_args_signext(i32 %p0, i16 %p1, i8 %p2, i1 %p3, i8 signext %p4) {
|
|
|
|
; CHECK-LABEL: test_stack_args_signext:
|
|
|
|
; CHECK: mov [[P4ADDR:r[0-9]+]], sp
|
|
|
|
; CHECK: ldr [[P4:r[0-9]+]], {{.*}}[[P4ADDR]]
|
|
|
|
; CHECK: add r0, r2, [[P4]]
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%sum = add i8 %p2, %p4
|
|
|
|
ret i8 %sum
|
|
|
|
}
|
2017-02-02 22:01:00 +08:00
|
|
|
|
2017-04-27 18:23:30 +08:00
|
|
|
define i8 @test_stack_args_noext(i32 %p0, i16 %p1, i8 %p2, i1 %p3, i8 %p4) {
|
|
|
|
; CHECK-LABEL: test_stack_args_noext:
|
|
|
|
; CHECK: mov [[P4ADDR:r[0-9]+]], sp
|
|
|
|
; CHECK: ldrb [[P4:r[0-9]+]], {{.*}}[[P4ADDR]]
|
|
|
|
; CHECK: add r0, r2, [[P4]]
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%sum = add i8 %p2, %p4
|
|
|
|
ret i8 %sum
|
|
|
|
}
|
|
|
|
|
2017-02-02 22:01:00 +08:00
|
|
|
define i32 @test_ptr_arg_in_reg(i32* %p) {
|
|
|
|
; CHECK-LABEL: test_ptr_arg_in_reg:
|
|
|
|
; CHECK: ldr r0, [r0]
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%v = load i32, i32* %p
|
|
|
|
ret i32 %v
|
|
|
|
}
|
|
|
|
|
|
|
|
define i32 @test_ptr_arg_on_stack(i32 %f0, i32 %f1, i32 %f2, i32 %f3, i32* %p) {
|
|
|
|
; CHECK-LABEL: test_ptr_arg_on_stack:
|
|
|
|
; CHECK: mov r0, sp
|
|
|
|
; CHECK: ldr r0, [r0]
|
|
|
|
; CHECK: ldr r0, [r0]
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%v = load i32, i32* %p
|
|
|
|
ret i32 %v
|
|
|
|
}
|
|
|
|
|
|
|
|
define i8* @test_ptr_ret(i8** %p) {
|
|
|
|
; CHECK-LABEL: test_ptr_ret:
|
|
|
|
; CHECK: ldr r0, [r0]
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%v = load i8*, i8** %p
|
|
|
|
ret i8* %v
|
|
|
|
}
|
2017-02-09 21:09:59 +08:00
|
|
|
|
|
|
|
define arm_aapcs_vfpcc float @test_float_hard(float %f0, float %f1) {
|
|
|
|
; CHECK-LABEL: test_float_hard:
|
|
|
|
; CHECK: vadd.f32 s0, s0, s1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%v = fadd float %f0, %f1
|
|
|
|
ret float %v
|
|
|
|
}
|
|
|
|
|
|
|
|
define arm_aapcscc float @test_float_softfp(float %f0, float %f1) {
|
|
|
|
; CHECK-LABEL: test_float_softfp:
|
|
|
|
; CHECK-DAG: vmov [[F0:s[0-9]+]], r0
|
|
|
|
; CHECK-DAG: vmov [[F1:s[0-9]+]], r1
|
|
|
|
; CHECK: vadd.f32 [[FV:s[0-9]+]], [[F0]], [[F1]]
|
|
|
|
; CHECK: vmov r0, [[FV]]
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%v = fadd float %f0, %f1
|
|
|
|
ret float %v
|
|
|
|
}
|
2017-02-17 19:25:11 +08:00
|
|
|
|
|
|
|
define arm_aapcs_vfpcc double @test_double_hard(double %f0, double %f1) {
|
|
|
|
; CHECK-LABEL: test_double_hard:
|
|
|
|
; CHECK: vadd.f64 d0, d0, d1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%v = fadd double %f0, %f1
|
|
|
|
ret double %v
|
|
|
|
}
|
|
|
|
|
|
|
|
define arm_aapcscc double @test_double_softfp(double %f0, double %f1) {
|
|
|
|
; CHECK-LABEL: test_double_softfp:
|
|
|
|
; CHECK-DAG: vmov [[F0:d[0-9]+]], r0, r1
|
|
|
|
; CHECK-DAG: vmov [[F1:d[0-9]+]], r2, r3
|
|
|
|
; CHECK: vadd.f64 [[FV:d[0-9]+]], [[F0]], [[F1]]
|
2017-06-07 20:35:05 +08:00
|
|
|
; CHECK: vmov r0, r1, [[FV]]
|
2017-02-17 19:25:11 +08:00
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%v = fadd double %f0, %f1
|
|
|
|
ret double %v
|
|
|
|
}
|
2017-06-19 17:40:51 +08:00
|
|
|
|
|
|
|
define arm_aapcscc i32 @test_cmp_i32_eq(i32 %a, i32 %b) {
|
|
|
|
; CHECK-LABEL: test_cmp_i32_eq:
|
|
|
|
; CHECK: mov [[V:r[0-9]+]], #0
|
|
|
|
; CHECK: cmp r0, r1
|
|
|
|
; CHECK: moveq [[V]], #1
|
|
|
|
; CHECK: and r0, [[V]], #1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%v = icmp eq i32 %a, %b
|
|
|
|
%r = zext i1 %v to i32
|
|
|
|
ret i32 %r
|
|
|
|
}
|
|
|
|
|
|
|
|
define arm_aapcscc i32 @test_cmp_ptr_neq(double *%a, double *%b) {
|
|
|
|
; CHECK-LABEL: test_cmp_ptr_neq:
|
|
|
|
; CHECK: mov [[V:r[0-9]+]], #0
|
|
|
|
; CHECK: cmp r0, r1
|
|
|
|
; CHECK: movne [[V]], #1
|
|
|
|
; CHECK: and r0, [[V]], #1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%v = icmp ne double * %a, %b
|
|
|
|
%r = zext i1 %v to i32
|
|
|
|
ret i32 %r
|
|
|
|
}
|
2017-06-19 19:47:28 +08:00
|
|
|
|
|
|
|
define arm_aapcscc i32 @test_cmp_i16_slt(i16 %a, i16 %b) {
|
|
|
|
; CHECK-LABEL: test_cmp_i16_slt:
|
|
|
|
; CHECK-DAG: mov [[V:r[0-9]+]], #0
|
|
|
|
; CHECK: cmp r0, r1
|
|
|
|
; CHECK: movlt [[V]], #1
|
|
|
|
; CHECK: and r0, [[V]], #1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%v = icmp slt i16 %a, %b
|
|
|
|
%r = zext i1 %v to i32
|
|
|
|
ret i32 %r
|
|
|
|
}
|
2017-06-27 17:19:51 +08:00
|
|
|
|
|
|
|
define arm_aapcscc i32 @test_select_i32(i32 %a, i32 %b, i1 %cond) {
|
|
|
|
; CHECK-LABEL: test_select_i32
|
|
|
|
; CHECK: cmp r2, #0
|
|
|
|
; CHECK: moveq r0, r1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%r = select i1 %cond, i32 %a, i32 %b
|
|
|
|
ret i32 %r
|
|
|
|
}
|
2017-06-27 18:29:50 +08:00
|
|
|
|
|
|
|
define arm_aapcscc i32* @test_select_ptr(i32* %a, i32* %b, i1 %cond) {
|
|
|
|
; CHECK-LABEL: test_select_ptr
|
|
|
|
; CHECK: cmp r2, #0
|
|
|
|
; CHECK: moveq r0, r1
|
|
|
|
; CHECK: bx lr
|
|
|
|
entry:
|
|
|
|
%r = select i1 %cond, i32* %a, i32* %b
|
|
|
|
ret i32* %r
|
|
|
|
}
|
2017-07-13 19:09:34 +08:00
|
|
|
|
|
|
|
define arm_aapcscc void @test_br() {
|
|
|
|
; CHECK-LABEL: test_br
|
|
|
|
; CHECK: [[LABEL:.L[[:alnum:]_]+]]:
|
|
|
|
; CHECK: b [[LABEL]]
|
|
|
|
entry:
|
|
|
|
br label %infinite
|
|
|
|
|
|
|
|
infinite:
|
|
|
|
br label %infinite
|
|
|
|
}
|
2017-07-14 17:46:06 +08:00
|
|
|
|
|
|
|
declare arm_aapcscc void @brcond1()
|
|
|
|
declare arm_aapcscc void @brcond2()
|
|
|
|
|
|
|
|
define arm_aapcscc void @test_brcond(i32 %n) {
|
|
|
|
; CHECK-LABEL: test_brcond
|
|
|
|
; CHECK: cmp r0
|
|
|
|
; CHECK-NEXT: movgt [[RCMP:r[0-9]+]], #1
|
|
|
|
; CHECK: tst [[RCMP]], #1
|
2017-11-29 22:20:06 +08:00
|
|
|
; CHECK-NEXT: beq [[FALSE:.L[[:alnum:]_]+]]
|
2017-10-25 19:42:40 +08:00
|
|
|
; CHECK: bl brcond1
|
2017-07-14 17:46:06 +08:00
|
|
|
; CHECK: [[FALSE]]:
|
2017-10-25 19:42:40 +08:00
|
|
|
; CHECK: bl brcond2
|
2017-07-14 17:46:06 +08:00
|
|
|
entry:
|
|
|
|
%cmp = icmp sgt i32 %n, 0
|
|
|
|
br i1 %cmp, label %if.true, label %if.false
|
|
|
|
|
|
|
|
if.true:
|
|
|
|
call arm_aapcscc void @brcond1()
|
|
|
|
br label %if.end
|
|
|
|
|
|
|
|
if.false:
|
|
|
|
call arm_aapcscc void @brcond2()
|
|
|
|
br label %if.end
|
|
|
|
|
|
|
|
if.end:
|
|
|
|
ret void
|
|
|
|
}
|