blob: 47f859cc0a87d34d2fdac487244cf03dbdbe0e77 [file] [log] [blame]
Chad Rosier7a21bb12016-03-14 18:10:20 +00001//===-- MipsHazardSchedule.cpp - Workaround pipeline hazards --------------===//
Daniel Sanderse8efff32016-03-14 16:24:05 +00002//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9/// \file
Simon Dardise8af7922016-12-13 11:10:53 +000010/// This pass is used to workaround certain pipeline hazards. For now, this
11/// covers compact branch hazards. In future this pass can be extended to other
12/// pipeline hazards, such as various MIPS1 hazards, processor errata that
13/// require instruction reorganization, etc.
Daniel Sanderse8efff32016-03-14 16:24:05 +000014///
15/// This pass has to run after the delay slot filler as that pass can introduce
16/// pipeline hazards, hence the existing hazard recognizer is not suitable.
17///
18/// Hazards handled: forbidden slots for MIPSR6.
19///
20/// A forbidden slot hazard occurs when a compact branch instruction is executed
Simon Dardise8af7922016-12-13 11:10:53 +000021/// and the adjacent instruction in memory is a control transfer instruction
22/// such as a branch or jump, ERET, ERETNC, DERET, WAIT and PAUSE.
Daniel Sanderse8efff32016-03-14 16:24:05 +000023///
24/// For example:
25///
NAKAMURA Takumife1202c2016-06-20 00:37:41 +000026/// 0x8004 bnec a1,v0,<P+0x18>
27/// 0x8008 beqc a1,a2,<P+0x54>
Daniel Sanderse8efff32016-03-14 16:24:05 +000028///
29/// In such cases, the processor is required to signal a Reserved Instruction
30/// exception.
31///
32/// Here, if the instruction at 0x8004 is executed, the processor will raise an
33/// exception as there is a control transfer instruction at 0x8008.
34///
35/// There are two sources of forbidden slot hazards:
36///
37/// A) A previous pass has created a compact branch directly.
38/// B) Transforming a delay slot branch into compact branch. This case can be
39/// difficult to process as lookahead for hazards is insufficent, as
40/// backwards delay slot fillling can also produce hazards in previously
41/// processed instuctions.
42///
43//===----------------------------------------------------------------------===//
44
45#include "Mips.h"
46#include "MipsInstrInfo.h"
47#include "MipsSEInstrInfo.h"
48#include "MipsTargetMachine.h"
Daniel Sanderse8efff32016-03-14 16:24:05 +000049#include "llvm/ADT/Statistic.h"
50#include "llvm/CodeGen/MachineFunctionPass.h"
51#include "llvm/CodeGen/MachineInstrBuilder.h"
Mehdi Aminib550cb12016-04-18 09:17:29 +000052#include "llvm/IR/Function.h"
Daniel Sanderse8efff32016-03-14 16:24:05 +000053#include "llvm/Target/TargetInstrInfo.h"
54#include "llvm/Target/TargetMachine.h"
55#include "llvm/Target/TargetRegisterInfo.h"
56
57using namespace llvm;
58
59#define DEBUG_TYPE "mips-hazard-schedule"
60
61STATISTIC(NumInsertedNops, "Number of nops inserted");
62
63namespace {
64
65typedef MachineBasicBlock::iterator Iter;
66typedef MachineBasicBlock::reverse_iterator ReverseIter;
67
68class MipsHazardSchedule : public MachineFunctionPass {
69
70public:
Chad Rosier7a21bb12016-03-14 18:10:20 +000071 MipsHazardSchedule() : MachineFunctionPass(ID) {}
Daniel Sanderse8efff32016-03-14 16:24:05 +000072
Mehdi Amini117296c2016-10-01 02:56:57 +000073 StringRef getPassName() const override { return "Mips Hazard Schedule"; }
Daniel Sanderse8efff32016-03-14 16:24:05 +000074
75 bool runOnMachineFunction(MachineFunction &F) override;
76
Derek Schuff1dbf7a52016-04-04 17:09:25 +000077 MachineFunctionProperties getRequiredProperties() const override {
78 return MachineFunctionProperties().set(
Matthias Braun1eb47362016-08-25 01:27:13 +000079 MachineFunctionProperties::Property::NoVRegs);
Derek Schuff1dbf7a52016-04-04 17:09:25 +000080 }
81
Daniel Sanderse8efff32016-03-14 16:24:05 +000082private:
83 static char ID;
Daniel Sanderse8efff32016-03-14 16:24:05 +000084};
85
86char MipsHazardSchedule::ID = 0;
87} // end of anonymous namespace
88
89/// Returns a pass that clears pipeline hazards.
Chad Rosier7a21bb12016-03-14 18:10:20 +000090FunctionPass *llvm::createMipsHazardSchedule() {
91 return new MipsHazardSchedule();
Daniel Sanderse8efff32016-03-14 16:24:05 +000092}
93
Simon Dardis43b5ce42016-12-13 11:07:51 +000094// Find the next real instruction from the current position in current basic
95// block.
96static Iter getNextMachineInstrInBB(Iter Position) {
Simon Dardis7383bfd82016-04-29 16:04:18 +000097 Iter I = Position, E = Position->getParent()->end();
Simon Dardis43b5ce42016-12-13 11:07:51 +000098 I = std::find_if_not(I, E,
99 [](const Iter &Insn) { return Insn->isTransient(); });
100
Simon Dardis7383bfd82016-04-29 16:04:18 +0000101 return I;
102}
103
Simon Dardis43b5ce42016-12-13 11:07:51 +0000104// Find the next real instruction from the current position, looking through
105// basic block boundaries.
106static Iter getNextMachineInstr(Iter Position) {
107 if (std::next(Position) == Position->getParent()->end()) {
108 const MachineBasicBlock * MBB = (&*Position)->getParent();
109 for (auto *Succ : MBB->successors()) {
110 if (MBB->isLayoutSuccessor(Succ)) {
111 Iter I = Succ->begin();
112 Iter Next = getNextMachineInstrInBB(I);
113 if (Next == Succ->end()) {
114 return getNextMachineInstr(I);
115 } else {
116 return I;
117 }
118 }
119 }
120 llvm_unreachable("Should have identified the end of the function earlier!");
121 }
122
123 return getNextMachineInstrInBB(Position);
124}
125
Daniel Sanderse8efff32016-03-14 16:24:05 +0000126bool MipsHazardSchedule::runOnMachineFunction(MachineFunction &MF) {
127
128 const MipsSubtarget *STI =
129 &static_cast<const MipsSubtarget &>(MF.getSubtarget());
130
Simon Dardis43b5ce42016-12-13 11:07:51 +0000131 // Forbidden slot hazards are only defined for MIPSR6 but not microMIPSR6.
Daniel Sanderse8efff32016-03-14 16:24:05 +0000132 if (!STI->hasMips32r6() || STI->inMicroMipsMode())
133 return false;
134
135 bool Changed = false;
136 const MipsInstrInfo *TII = STI->getInstrInfo();
137
138 for (MachineFunction::iterator FI = MF.begin(); FI != MF.end(); ++FI) {
139 for (Iter I = FI->begin(); I != FI->end(); ++I) {
140
141 // Forbidden slot hazard handling. Use lookahead over state.
142 if (!TII->HasForbiddenSlot(*I))
143 continue;
144
Simon Dardis43b5ce42016-12-13 11:07:51 +0000145 Iter Inst;
146 bool LastInstInFunction =
147 std::next(I) == FI->end() && std::next(FI) == MF.end();
148 if (!LastInstInFunction) {
149 if (std::next(I) != FI->end()) {
150 // Start looking from the next instruction in the basic block.
151 Inst = getNextMachineInstr(std::next(I));
152 } else {
153 // Next instruction in the physical successor basic block.
154 Inst = getNextMachineInstr(I);
Daniel Sanderse8efff32016-03-14 16:24:05 +0000155 }
156 }
157
Simon Dardis43b5ce42016-12-13 11:07:51 +0000158 if (LastInstInFunction || !TII->SafeInForbiddenSlot(*Inst)) {
Daniel Sanderse8efff32016-03-14 16:24:05 +0000159 Changed = true;
Simon Dardis43b5ce42016-12-13 11:07:51 +0000160 MIBundleBuilder(&*I)
161 .append(BuildMI(MF, I->getDebugLoc(), TII->get(Mips::NOP)));
Daniel Sanderse8efff32016-03-14 16:24:05 +0000162 NumInsertedNops++;
163 }
164 }
165 }
166 return Changed;
167}