From 1631d6ce13037e11bd6a740f317ae87158bc62c6 Mon Sep 17 00:00:00 2001 From: Simon Dardis Date: Mon, 20 Nov 2017 15:59:18 +0000 Subject: [PATCH] [mips] Reorder target specific passes Move the hazard scheduling pass to after the long branch pass, as the long branch pass can create forbiddden slot hazards. Rather than complicating the implementation of the long branch pass to handle forbidden slot hazards, just reorder the passes. llvm-svn: 318657 --- llvm/lib/Target/Mips/MipsTargetMachine.cpp | 9 +- .../compact-branches-long-branch.ll | 154 ++++++++++++++++++ 2 files changed, 158 insertions(+), 5 deletions(-) create mode 100644 llvm/test/CodeGen/Mips/longbranch/compact-branches-long-branch.ll diff --git a/llvm/lib/Target/Mips/MipsTargetMachine.cpp b/llvm/lib/Target/Mips/MipsTargetMachine.cpp index 6199ffd789c3..9a12b98984e8 100644 --- a/llvm/lib/Target/Mips/MipsTargetMachine.cpp +++ b/llvm/lib/Target/Mips/MipsTargetMachine.cpp @@ -278,12 +278,11 @@ TargetIRAnalysis MipsTargetMachine::getTargetIRAnalysis() { void MipsPassConfig::addPreEmitPass() { addPass(createMicroMipsSizeReductionPass()); - // The delay slot filler pass can potientially create forbidden slot (FS) - // hazards for MIPSR6 which the hazard schedule pass (HSP) will fix. Any - // (new) pass that creates compact branches after the HSP must handle FS - // hazards itself or be pipelined before the HSP. + // The delay slot filler and the long branch passes can potientially create + // forbidden slot/ hazards for MIPSR6 which the hazard schedule pass will + // fix. Any new pass must come before the hazard schedule pass. addPass(createMipsDelaySlotFillerPass()); - addPass(createMipsHazardSchedule()); addPass(createMipsLongBranchPass()); + addPass(createMipsHazardSchedule()); addPass(createMipsConstantIslandPass()); } diff --git a/llvm/test/CodeGen/Mips/longbranch/compact-branches-long-branch.ll b/llvm/test/CodeGen/Mips/longbranch/compact-branches-long-branch.ll new file mode 100644 index 000000000000..709cd477a778 --- /dev/null +++ b/llvm/test/CodeGen/Mips/longbranch/compact-branches-long-branch.ll @@ -0,0 +1,154 @@ +; RUN: llc < %s -march=mips -mcpu=mips32r6 -force-mips-long-branch | FileCheck %s + +; Check that when MIPS32R6 with the static relocation model with the usage of +; long branches, that there is a nop between any compact branch and the static +; relocation method of expanding branches. Previously, it could result in 'j' +; following a b(ne|eq)zc, which would raise a reserved instruction exception. + +declare i32 @f(i32) + +declare i32 @g() + +; CHECK-LABEL: test1: +; CHECK: bnezc +; CHECK-NEXT: nop + +define i32 @test1(i32 %a) { +entry: + %0 = icmp eq i32 %a, 0 + br i1 %0, label %cond.true, label %cond.false +cond.true: + %1 = call i32 @f(i32 %a) + ret i32 %1 +cond.false: + %2 = call i32 @g() + ret i32 %2 +} + +; CHECK-LABEL: test2: +; CHECK: bgezc +; CHECK-NEXT: nop + +define i32 @test2(i32 %a) { +entry: + %0 = icmp sge i32 %a, 0 + br i1 %0, label %cond.true, label %cond.false +cond.true: + %1 = call i32 @f(i32 %a) + ret i32 %1 +cond.false: + %2 = call i32 @g() + ret i32 %2 +} + +; CHECK-LABEL: test3: +; CHECK: blezc +; CHECK-NEXT: nop + +define i32 @test3(i32 %a) { +entry: + %0 = icmp sle i32 %a, 0 + br i1 %0, label %cond.true, label %cond.false +cond.true: + %1 = call i32 @f(i32 %a) + ret i32 %1 +cond.false: + %2 = call i32 @g() + ret i32 %2 +} + +; CHECK-LABEL: test4: +; CHECK: bgtzc +; CHECK-NEXT: nop + +define i32 @test4(i32 %a) { +entry: + %0 = icmp sgt i32 %a, 0 + br i1 %0, label %cond.true, label %cond.false +cond.true: + %1 = call i32 @f(i32 %a) + ret i32 %1 +cond.false: + %2 = call i32 @g() + ret i32 %2 +} + +; CHECK-LABEL: test5: +; CHECK: bgezc +; CHECK-NEXT: nop + +define i32 @test5(i32 %a) { +entry: + %0 = icmp slt i32 %a, 0 + br i1 %0, label %cond.true, label %cond.false +cond.true: + %1 = call i32 @f(i32 %a) + ret i32 %1 +cond.false: + %2 = call i32 @g() + ret i32 %2 +} + +; CHECK-LABEL: test6: +; CHECK: bnezc +; CHECK-NEXT: nop + +define i32 @test6(i32 %a, i32 %b) { +entry: + %0 = icmp ugt i32 %a, %b + br i1 %0, label %cond.true, label %cond.false +cond.true: + %1 = call i32 @f(i32 %a) + ret i32 %1 +cond.false: + %2 = call i32 @g() + ret i32 %2 +} + +; CHECK-LABEL: test7: +; CHECK: beqzc +; CHECK-NEXT: nop + +define i32 @test7(i32 %a, i32 %b) { +entry: + %0 = icmp uge i32 %a, %b + br i1 %0, label %cond.true, label %cond.false +cond.true: + %1 = call i32 @f(i32 %a) + ret i32 %1 +cond.false: + %2 = call i32 @g() + ret i32 %2 +} + +; CHECK-LABEL: test8: +; CHECK: bnezc +; CHECK-NEXT: nop + +define i32 @test8(i32 %a, i32 %b) { +entry: + %0 = icmp ult i32 %a, %b + br i1 %0, label %cond.true, label %cond.false +cond.true: + %1 = call i32 @f(i32 %a) + ret i32 %1 +cond.false: + %2 = call i32 @g() + ret i32 %2 +} + +; CHECK-LABEL: test9: +; CHECK: beqzc +; CHECK-NEXT: nop + +define i32 @test9(i32 %a, i32 %b) { +entry: + %0 = icmp ule i32 %a, %b + br i1 %0, label %cond.true, label %cond.false +cond.true: + %1 = call i32 @f(i32 %a) + ret i32 %1 +cond.false: + %2 = call i32 @g() + ret i32 %2 +}