forked from OSchip/llvm-project
89 lines
3.1 KiB
LLVM
89 lines
3.1 KiB
LLVM
; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py
|
|
; RUN: llc -relocation-model=pic -verify-machineinstrs -mtriple=powerpc64-unknown-linux-gnu -O2 \
|
|
; RUN: -ppc-gpr-icmps=all -ppc-asm-full-reg-names -mcpu=pwr8 < %s | FileCheck %s \
|
|
; RUN: --implicit-check-not cmpw --implicit-check-not cmpd --implicit-check-not cmpl \
|
|
; RUN: --check-prefixes=CHECK,BE
|
|
; RUN: llc -relocation-model=pic -verify-machineinstrs -mtriple=powerpc64le-unknown-linux-gnu -O2 \
|
|
; RUN: -ppc-gpr-icmps=all -ppc-asm-full-reg-names -mcpu=pwr8 < %s | FileCheck %s \
|
|
; RUN: --implicit-check-not cmpw --implicit-check-not cmpd --implicit-check-not cmpl \
|
|
; RUN: --check-prefixes=CHECK,LE
|
|
|
|
%struct.tree_common = type { i8, [3 x i8] }
|
|
declare signext i32 @fn2(...) local_unnamed_addr #1
|
|
|
|
; Function Attrs: nounwind
|
|
define i32 @testCompare1(%struct.tree_common* nocapture readonly %arg1) nounwind {
|
|
; BE-LABEL: testCompare1:
|
|
; BE: # %bb.0: # %entry
|
|
; BE-NEXT: mflr r0
|
|
; BE-NEXT: std r0, 16(r1)
|
|
; BE-NEXT: stdu r1, -112(r1)
|
|
; BE-NEXT: addis r4, r2, .LC0@toc@ha
|
|
; BE-NEXT: lbz r3, 0(r3)
|
|
; BE-NEXT: ld r4, .LC0@toc@l(r4)
|
|
; BE-NEXT: clrlwi r3, r3, 31
|
|
; BE-NEXT: clrldi r3, r3, 32
|
|
; BE-NEXT: lbz r4, 0(r4)
|
|
; BE-NEXT: clrlwi r4, r4, 31
|
|
; BE-NEXT: clrldi r4, r4, 32
|
|
; BE-NEXT: sub r3, r4, r3
|
|
; BE-NEXT: rldicl r3, r3, 1, 63
|
|
; BE-NEXT: bl fn2
|
|
; BE-NEXT: nop
|
|
; BE-NEXT: addi r1, r1, 112
|
|
; BE-NEXT: ld r0, 16(r1)
|
|
; BE-NEXT: mtlr r0
|
|
; BE-NEXT: blr
|
|
;
|
|
; LE-LABEL: testCompare1:
|
|
; LE: # %bb.0: # %entry
|
|
; LE-NEXT: mflr r0
|
|
; LE-NEXT: std r0, 16(r1)
|
|
; LE-NEXT: stdu r1, -32(r1)
|
|
; LE-NEXT: addis r4, r2, .LC0@toc@ha
|
|
; LE-NEXT: lbz r3, 0(r3)
|
|
; LE-NEXT: ld r4, .LC0@toc@l(r4)
|
|
; LE-NEXT: clrlwi r3, r3, 31
|
|
; LE-NEXT: clrldi r3, r3, 32
|
|
; LE-NEXT: lbz r4, 0(r4)
|
|
; LE-NEXT: clrlwi r4, r4, 31
|
|
; LE-NEXT: clrldi r4, r4, 32
|
|
; LE-NEXT: sub r3, r4, r3
|
|
; LE-NEXT: rldicl r3, r3, 1, 63
|
|
; LE-NEXT: bl fn2
|
|
; LE-NEXT: nop
|
|
; LE-NEXT: addi r1, r1, 32
|
|
; LE-NEXT: ld r0, 16(r1)
|
|
; LE-NEXT: mtlr r0
|
|
; LE-NEXT: blr
|
|
entry:
|
|
%bf.load = load i8, i8* bitcast (i32 (%struct.tree_common*)* @testCompare1 to i8*), align 4
|
|
%bf.clear = and i8 %bf.load, 1
|
|
%0 = getelementptr inbounds %struct.tree_common, %struct.tree_common* %arg1, i64 0, i32 0
|
|
%bf.load1 = load i8, i8* %0, align 4
|
|
%bf.clear2 = and i8 %bf.load1, 1
|
|
%cmp = icmp ult i8 %bf.clear, %bf.clear2
|
|
%conv = zext i1 %cmp to i32
|
|
%call = tail call signext i32 bitcast (i32 (...)* @fn2 to i32 (i32)*)(i32 signext %conv) #2
|
|
ret i32 undef
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define signext i32 @testCompare2(i32 zeroext %a, i32 zeroext %b) {
|
|
; CHECK-LABEL: testCompare2:
|
|
; CHECK: # %bb.0: # %entry
|
|
; CHECK-NEXT: rlwinm r3, r3, 0, 31, 31
|
|
; CHECK-NEXT: rlwinm r4, r4, 0, 31, 31
|
|
; CHECK-NEXT: clrldi r3, r3, 32
|
|
; CHECK-NEXT: clrldi r4, r4, 32
|
|
; CHECK-NEXT: sub r3, r3, r4
|
|
; CHECK-NEXT: rldicl r3, r3, 1, 63
|
|
; CHECK-NEXT: blr
|
|
entry:
|
|
%and = and i32 %a, 1
|
|
%and1 = and i32 %b, 1
|
|
%cmp = icmp ult i32 %and, %and1
|
|
%conv = zext i1 %cmp to i32
|
|
ret i32 %conv
|
|
}
|