2017-08-04 06:12:30 +08:00
|
|
|
//===- MipsConstantIslandPass.cpp - Emit Pc Relative loads ----------------===//
|
2013-02-27 11:33:58 +08:00
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This pass is used to make Pc relative loads of constants.
|
2013-11-05 20:04:37 +08:00
|
|
|
// For now, only Mips16 will use this.
|
2013-02-27 11:33:58 +08:00
|
|
|
//
|
|
|
|
// Loading constants inline is expensive on Mips16 and it's in general better
|
|
|
|
// to place the constant nearby in code space and then it can be loaded with a
|
|
|
|
// simple 16 bit load instruction.
|
|
|
|
//
|
|
|
|
// The constants can be not just numbers but addresses of functions and labels.
|
|
|
|
// This can be particularly helpful in static relocation mode for embedded
|
2013-12-05 13:44:44 +08:00
|
|
|
// non-linux targets.
|
2013-02-27 11:33:58 +08:00
|
|
|
//
|
2017-01-31 07:21:32 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
2013-02-27 11:33:58 +08:00
|
|
|
|
|
|
|
#include "Mips.h"
|
2013-11-13 12:37:52 +08:00
|
|
|
#include "Mips16InstrInfo.h"
|
2013-11-05 16:14:14 +08:00
|
|
|
#include "MipsMachineFunction.h"
|
2017-01-31 07:21:32 +08:00
|
|
|
#include "MipsSubtarget.h"
|
2017-06-06 19:49:48 +08:00
|
|
|
#include "llvm/ADT/STLExtras.h"
|
2017-01-31 07:21:32 +08:00
|
|
|
#include "llvm/ADT/SmallSet.h"
|
|
|
|
#include "llvm/ADT/SmallVector.h"
|
2013-02-27 11:33:58 +08:00
|
|
|
#include "llvm/ADT/Statistic.h"
|
2017-01-31 07:21:32 +08:00
|
|
|
#include "llvm/ADT/StringRef.h"
|
2013-10-28 05:57:36 +08:00
|
|
|
#include "llvm/CodeGen/MachineBasicBlock.h"
|
2014-09-03 06:28:02 +08:00
|
|
|
#include "llvm/CodeGen/MachineConstantPool.h"
|
2017-01-31 07:21:32 +08:00
|
|
|
#include "llvm/CodeGen/MachineFunction.h"
|
2013-02-27 11:33:58 +08:00
|
|
|
#include "llvm/CodeGen/MachineFunctionPass.h"
|
2017-01-31 07:21:32 +08:00
|
|
|
#include "llvm/CodeGen/MachineInstr.h"
|
2013-02-27 11:33:58 +08:00
|
|
|
#include "llvm/CodeGen/MachineInstrBuilder.h"
|
2017-01-31 07:21:32 +08:00
|
|
|
#include "llvm/CodeGen/MachineOperand.h"
|
2013-10-28 05:57:36 +08:00
|
|
|
#include "llvm/CodeGen/MachineRegisterInfo.h"
|
2017-01-31 07:21:32 +08:00
|
|
|
#include "llvm/IR/Constants.h"
|
|
|
|
#include "llvm/IR/DataLayout.h"
|
|
|
|
#include "llvm/IR/DebugLoc.h"
|
2013-02-27 11:33:58 +08:00
|
|
|
#include "llvm/IR/Function.h"
|
2017-01-31 07:21:32 +08:00
|
|
|
#include "llvm/IR/Type.h"
|
2013-02-27 11:33:58 +08:00
|
|
|
#include "llvm/Support/CommandLine.h"
|
2017-01-31 07:21:32 +08:00
|
|
|
#include "llvm/Support/Compiler.h"
|
2013-10-28 05:57:36 +08:00
|
|
|
#include "llvm/Support/Debug.h"
|
2017-01-31 07:21:32 +08:00
|
|
|
#include "llvm/Support/ErrorHandling.h"
|
2014-01-07 19:48:04 +08:00
|
|
|
#include "llvm/Support/Format.h"
|
2013-02-27 11:33:58 +08:00
|
|
|
#include "llvm/Support/MathExtras.h"
|
2013-10-28 05:57:36 +08:00
|
|
|
#include "llvm/Support/raw_ostream.h"
|
|
|
|
#include <algorithm>
|
2017-01-31 07:21:32 +08:00
|
|
|
#include <cassert>
|
|
|
|
#include <cstdint>
|
|
|
|
#include <iterator>
|
|
|
|
#include <vector>
|
2013-02-27 11:33:58 +08:00
|
|
|
|
|
|
|
using namespace llvm;
|
|
|
|
|
2014-04-22 10:41:26 +08:00
|
|
|
#define DEBUG_TYPE "mips-constant-islands"
|
|
|
|
|
2013-10-28 05:57:36 +08:00
|
|
|
STATISTIC(NumCPEs, "Number of constpool entries");
|
2013-11-05 16:14:14 +08:00
|
|
|
STATISTIC(NumSplit, "Number of uncond branches inserted");
|
|
|
|
STATISTIC(NumCBrFixed, "Number of cond branches fixed");
|
|
|
|
STATISTIC(NumUBrFixed, "Number of uncond branches fixed");
|
2013-10-28 05:57:36 +08:00
|
|
|
|
|
|
|
// FIXME: This option should be removed once it has received sufficient testing.
|
|
|
|
static cl::opt<bool>
|
|
|
|
AlignConstantIslands("mips-align-constant-islands", cl::Hidden, cl::init(true),
|
|
|
|
cl::desc("Align constant islands in code"));
|
|
|
|
|
2013-11-05 16:14:14 +08:00
|
|
|
// Rather than do make check tests with huge amounts of code, we force
|
|
|
|
// the test to use this amount.
|
|
|
|
static cl::opt<int> ConstantIslandsSmallOffset(
|
|
|
|
"mips-constant-islands-small-offset",
|
|
|
|
cl::init(0),
|
|
|
|
cl::desc("Make small offsets be this amount for testing purposes"),
|
|
|
|
cl::Hidden);
|
|
|
|
|
2013-11-10 08:09:26 +08:00
|
|
|
// For testing purposes we tell it to not use relaxed load forms so that it
|
|
|
|
// will split blocks.
|
|
|
|
static cl::opt<bool> NoLoadRelaxation(
|
|
|
|
"mips-constant-islands-no-load-relaxation",
|
|
|
|
cl::init(false),
|
|
|
|
cl::desc("Don't relax loads to long loads - for testing purposes"),
|
|
|
|
cl::Hidden);
|
|
|
|
|
2013-11-28 08:56:37 +08:00
|
|
|
static unsigned int branchTargetOperand(MachineInstr *MI) {
|
|
|
|
switch (MI->getOpcode()) {
|
|
|
|
case Mips::Bimm16:
|
|
|
|
case Mips::BimmX16:
|
|
|
|
case Mips::Bteqz16:
|
|
|
|
case Mips::BteqzX16:
|
|
|
|
case Mips::Btnez16:
|
|
|
|
case Mips::BtnezX16:
|
2013-11-30 06:32:56 +08:00
|
|
|
case Mips::JalB16:
|
2013-11-28 08:56:37 +08:00
|
|
|
return 0;
|
|
|
|
case Mips::BeqzRxImm16:
|
|
|
|
case Mips::BeqzRxImmX16:
|
|
|
|
case Mips::BnezRxImm16:
|
|
|
|
case Mips::BnezRxImmX16:
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
llvm_unreachable("Unknown branch type");
|
|
|
|
}
|
|
|
|
|
|
|
|
static unsigned int longformBranchOpcode(unsigned int Opcode) {
|
|
|
|
switch (Opcode) {
|
|
|
|
case Mips::Bimm16:
|
|
|
|
case Mips::BimmX16:
|
|
|
|
return Mips::BimmX16;
|
|
|
|
case Mips::Bteqz16:
|
|
|
|
case Mips::BteqzX16:
|
|
|
|
return Mips::BteqzX16;
|
|
|
|
case Mips::Btnez16:
|
|
|
|
case Mips::BtnezX16:
|
|
|
|
return Mips::BtnezX16;
|
2013-11-30 06:32:56 +08:00
|
|
|
case Mips::JalB16:
|
|
|
|
return Mips::JalB16;
|
2013-11-28 08:56:37 +08:00
|
|
|
case Mips::BeqzRxImm16:
|
|
|
|
case Mips::BeqzRxImmX16:
|
|
|
|
return Mips::BeqzRxImmX16;
|
|
|
|
case Mips::BnezRxImm16:
|
|
|
|
case Mips::BnezRxImmX16:
|
|
|
|
return Mips::BnezRxImmX16;
|
|
|
|
}
|
|
|
|
llvm_unreachable("Unknown branch type");
|
|
|
|
}
|
|
|
|
|
|
|
|
// FIXME: need to go through this whole constant islands port and check the math
|
|
|
|
// for branch ranges and clean this up and make some functions to calculate things
|
|
|
|
// that are done many times identically.
|
|
|
|
// Need to refactor some of the code to call this routine.
|
|
|
|
static unsigned int branchMaxOffsets(unsigned int Opcode) {
|
|
|
|
unsigned Bits, Scale;
|
|
|
|
switch (Opcode) {
|
|
|
|
case Mips::Bimm16:
|
|
|
|
Bits = 11;
|
|
|
|
Scale = 2;
|
|
|
|
break;
|
|
|
|
case Mips::BimmX16:
|
|
|
|
Bits = 16;
|
|
|
|
Scale = 2;
|
|
|
|
break;
|
|
|
|
case Mips::BeqzRxImm16:
|
|
|
|
Bits = 8;
|
|
|
|
Scale = 2;
|
|
|
|
break;
|
|
|
|
case Mips::BeqzRxImmX16:
|
|
|
|
Bits = 16;
|
|
|
|
Scale = 2;
|
|
|
|
break;
|
|
|
|
case Mips::BnezRxImm16:
|
|
|
|
Bits = 8;
|
|
|
|
Scale = 2;
|
|
|
|
break;
|
|
|
|
case Mips::BnezRxImmX16:
|
|
|
|
Bits = 16;
|
|
|
|
Scale = 2;
|
|
|
|
break;
|
|
|
|
case Mips::Bteqz16:
|
|
|
|
Bits = 8;
|
|
|
|
Scale = 2;
|
|
|
|
break;
|
|
|
|
case Mips::BteqzX16:
|
|
|
|
Bits = 16;
|
|
|
|
Scale = 2;
|
|
|
|
break;
|
|
|
|
case Mips::Btnez16:
|
|
|
|
Bits = 8;
|
|
|
|
Scale = 2;
|
|
|
|
break;
|
|
|
|
case Mips::BtnezX16:
|
|
|
|
Bits = 16;
|
|
|
|
Scale = 2;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
llvm_unreachable("Unknown branch type");
|
|
|
|
}
|
|
|
|
unsigned MaxOffs = ((1 << (Bits-1))-1) * Scale;
|
|
|
|
return MaxOffs;
|
|
|
|
}
|
2013-11-05 16:14:14 +08:00
|
|
|
|
2013-02-27 11:33:58 +08:00
|
|
|
namespace {
|
2013-11-05 16:14:14 +08:00
|
|
|
|
2017-08-04 06:12:30 +08:00
|
|
|
using Iter = MachineBasicBlock::iterator;
|
|
|
|
using ReverseIter = MachineBasicBlock::reverse_iterator;
|
2013-02-27 11:33:58 +08:00
|
|
|
|
2013-11-05 16:14:14 +08:00
|
|
|
/// MipsConstantIslands - Due to limited PC-relative displacements, Mips
|
|
|
|
/// requires constant pool entries to be scattered among the instructions
|
|
|
|
/// inside a function. To do this, it completely ignores the normal LLVM
|
|
|
|
/// constant pool; instead, it places constants wherever it feels like with
|
|
|
|
/// special instructions.
|
|
|
|
///
|
|
|
|
/// The terminology used in this pass includes:
|
|
|
|
/// Islands - Clumps of constants placed in the function.
|
|
|
|
/// Water - Potential places where an island could be formed.
|
|
|
|
/// CPE - A constant pool entry that has been placed somewhere, which
|
|
|
|
/// tracks a list of users.
|
|
|
|
|
2013-02-27 11:33:58 +08:00
|
|
|
class MipsConstantIslands : public MachineFunctionPass {
|
2013-11-05 16:14:14 +08:00
|
|
|
/// BasicBlockInfo - Information about the offset and size of a single
|
|
|
|
/// basic block.
|
|
|
|
struct BasicBlockInfo {
|
|
|
|
/// Offset - Distance from the beginning of the function to the beginning
|
|
|
|
/// of this basic block.
|
|
|
|
///
|
|
|
|
/// Offsets are computed assuming worst case padding before an aligned
|
|
|
|
/// block. This means that subtracting basic block offsets always gives a
|
|
|
|
/// conservative estimate of the real distance which may be smaller.
|
|
|
|
///
|
|
|
|
/// Because worst case padding is used, the computed offset of an aligned
|
|
|
|
/// block may not actually be aligned.
|
2017-01-31 07:21:32 +08:00
|
|
|
unsigned Offset = 0;
|
2013-11-05 16:14:14 +08:00
|
|
|
|
|
|
|
/// Size - Size of the basic block in bytes. If the block contains
|
|
|
|
/// inline assembly, this is a worst case estimate.
|
|
|
|
///
|
|
|
|
/// The size does not include any alignment padding whether from the
|
|
|
|
/// beginning of the block, or from an aligned jump table at the end.
|
2017-01-31 07:21:32 +08:00
|
|
|
unsigned Size = 0;
|
|
|
|
|
|
|
|
BasicBlockInfo() = default;
|
2013-11-05 16:14:14 +08:00
|
|
|
|
2013-11-06 07:36:58 +08:00
|
|
|
// FIXME: ignore LogAlign for this patch
|
|
|
|
//
|
2013-11-05 16:14:14 +08:00
|
|
|
unsigned postOffset(unsigned LogAlign = 0) const {
|
|
|
|
unsigned PO = Offset + Size;
|
|
|
|
return PO;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
std::vector<BasicBlockInfo> BBInfo;
|
|
|
|
|
|
|
|
/// WaterList - A sorted list of basic blocks where islands could be placed
|
|
|
|
/// (i.e. blocks that don't fall through to the following block, due
|
|
|
|
/// to a return, unreachable, or unconditional branch).
|
|
|
|
std::vector<MachineBasicBlock*> WaterList;
|
|
|
|
|
|
|
|
/// NewWaterList - The subset of WaterList that was created since the
|
|
|
|
/// previous iteration by inserting unconditional branches.
|
|
|
|
SmallSet<MachineBasicBlock*, 4> NewWaterList;
|
|
|
|
|
2017-08-04 06:12:30 +08:00
|
|
|
using water_iterator = std::vector<MachineBasicBlock *>::iterator;
|
2013-11-05 16:14:14 +08:00
|
|
|
|
|
|
|
/// CPUser - One user of a constant pool, keeping the machine instruction
|
|
|
|
/// pointer, the constant pool being referenced, and the max displacement
|
|
|
|
/// allowed from the instruction to the CP. The HighWaterMark records the
|
|
|
|
/// highest basic block where a new CPEntry can be placed. To ensure this
|
|
|
|
/// pass terminates, the CP entries are initially placed at the end of the
|
|
|
|
/// function and then move monotonically to lower addresses. The
|
|
|
|
/// exception to this rule is when the current CP entry for a particular
|
|
|
|
/// CPUser is out of range, but there is another CP entry for the same
|
|
|
|
/// constant value in range. We want to use the existing in-range CP
|
|
|
|
/// entry, but if it later moves out of range, the search for new water
|
|
|
|
/// should resume where it left off. The HighWaterMark is used to record
|
|
|
|
/// that point.
|
|
|
|
struct CPUser {
|
|
|
|
MachineInstr *MI;
|
|
|
|
MachineInstr *CPEMI;
|
|
|
|
MachineBasicBlock *HighWaterMark;
|
2017-01-31 07:21:32 +08:00
|
|
|
|
2013-11-05 16:14:14 +08:00
|
|
|
private:
|
|
|
|
unsigned MaxDisp;
|
|
|
|
unsigned LongFormMaxDisp; // mips16 has 16/32 bit instructions
|
|
|
|
// with different displacements
|
|
|
|
unsigned LongFormOpcode;
|
2017-01-31 07:21:32 +08:00
|
|
|
|
2013-11-05 16:14:14 +08:00
|
|
|
public:
|
|
|
|
bool NegOk;
|
2017-01-31 07:21:32 +08:00
|
|
|
|
2013-11-05 16:14:14 +08:00
|
|
|
CPUser(MachineInstr *mi, MachineInstr *cpemi, unsigned maxdisp,
|
2013-11-06 06:34:29 +08:00
|
|
|
bool neg,
|
2013-11-05 16:14:14 +08:00
|
|
|
unsigned longformmaxdisp, unsigned longformopcode)
|
|
|
|
: MI(mi), CPEMI(cpemi), MaxDisp(maxdisp),
|
|
|
|
LongFormMaxDisp(longformmaxdisp), LongFormOpcode(longformopcode),
|
2013-11-06 07:36:58 +08:00
|
|
|
NegOk(neg){
|
2013-11-05 16:14:14 +08:00
|
|
|
HighWaterMark = CPEMI->getParent();
|
|
|
|
}
|
2017-01-31 07:21:32 +08:00
|
|
|
|
2013-11-05 16:14:14 +08:00
|
|
|
/// getMaxDisp - Returns the maximum displacement supported by MI.
|
|
|
|
unsigned getMaxDisp() const {
|
|
|
|
unsigned xMaxDisp = ConstantIslandsSmallOffset?
|
|
|
|
ConstantIslandsSmallOffset: MaxDisp;
|
2013-11-06 07:36:58 +08:00
|
|
|
return xMaxDisp;
|
2013-11-05 16:14:14 +08:00
|
|
|
}
|
2017-01-31 07:21:32 +08:00
|
|
|
|
2013-11-10 08:09:26 +08:00
|
|
|
void setMaxDisp(unsigned val) {
|
|
|
|
MaxDisp = val;
|
|
|
|
}
|
2017-01-31 07:21:32 +08:00
|
|
|
|
2013-11-05 16:14:14 +08:00
|
|
|
unsigned getLongFormMaxDisp() const {
|
2013-11-06 07:36:58 +08:00
|
|
|
return LongFormMaxDisp;
|
2013-11-05 16:14:14 +08:00
|
|
|
}
|
2017-01-31 07:21:32 +08:00
|
|
|
|
2013-11-05 16:14:14 +08:00
|
|
|
unsigned getLongFormOpcode() const {
|
|
|
|
return LongFormOpcode;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
/// CPUsers - Keep track of all of the machine instructions that use various
|
|
|
|
/// constant pools and their max displacement.
|
|
|
|
std::vector<CPUser> CPUsers;
|
2013-10-28 05:57:36 +08:00
|
|
|
|
|
|
|
/// CPEntry - One per constant pool entry, keeping the machine instruction
|
|
|
|
/// pointer, the constpool index, and the number of CPUser's which
|
|
|
|
/// reference this entry.
|
|
|
|
struct CPEntry {
|
|
|
|
MachineInstr *CPEMI;
|
|
|
|
unsigned CPI;
|
|
|
|
unsigned RefCount;
|
2017-01-31 07:21:32 +08:00
|
|
|
|
2013-10-28 05:57:36 +08:00
|
|
|
CPEntry(MachineInstr *cpemi, unsigned cpi, unsigned rc = 0)
|
|
|
|
: CPEMI(cpemi), CPI(cpi), RefCount(rc) {}
|
|
|
|
};
|
|
|
|
|
|
|
|
/// CPEntries - Keep track of all of the constant pool entry machine
|
|
|
|
/// instructions. For each original constpool index (i.e. those that
|
|
|
|
/// existed upon entry to this pass), it keeps a vector of entries.
|
|
|
|
/// Original elements are cloned as we go along; the clones are
|
|
|
|
/// put in the vector of the original element, but have distinct CPIs.
|
2017-01-31 07:21:32 +08:00
|
|
|
std::vector<std::vector<CPEntry>> CPEntries;
|
2013-10-28 05:57:36 +08:00
|
|
|
|
2013-11-05 16:14:14 +08:00
|
|
|
/// ImmBranch - One per immediate branch, keeping the machine instruction
|
|
|
|
/// pointer, conditional or unconditional, the max displacement,
|
|
|
|
/// and (if isCond is true) the corresponding unconditional branch
|
|
|
|
/// opcode.
|
|
|
|
struct ImmBranch {
|
|
|
|
MachineInstr *MI;
|
|
|
|
unsigned MaxDisp : 31;
|
|
|
|
bool isCond : 1;
|
|
|
|
int UncondBr;
|
2017-01-31 07:21:32 +08:00
|
|
|
|
2013-11-05 16:14:14 +08:00
|
|
|
ImmBranch(MachineInstr *mi, unsigned maxdisp, bool cond, int ubr)
|
|
|
|
: MI(mi), MaxDisp(maxdisp), isCond(cond), UncondBr(ubr) {}
|
|
|
|
};
|
|
|
|
|
|
|
|
/// ImmBranches - Keep track of all the immediate branch instructions.
|
|
|
|
///
|
|
|
|
std::vector<ImmBranch> ImmBranches;
|
|
|
|
|
|
|
|
/// HasFarJump - True if any far jump instruction has been emitted during
|
|
|
|
/// the branch fix up pass.
|
|
|
|
bool HasFarJump;
|
|
|
|
|
2017-01-31 07:21:32 +08:00
|
|
|
const MipsSubtarget *STI = nullptr;
|
2013-11-13 12:37:52 +08:00
|
|
|
const Mips16InstrInfo *TII;
|
2013-11-05 16:14:14 +08:00
|
|
|
MipsFunctionInfo *MFI;
|
2017-01-31 07:21:32 +08:00
|
|
|
MachineFunction *MF = nullptr;
|
|
|
|
MachineConstantPool *MCP = nullptr;
|
2013-11-05 16:14:14 +08:00
|
|
|
|
|
|
|
unsigned PICLabelUId;
|
2017-01-31 07:21:32 +08:00
|
|
|
bool PrescannedForConstants = false;
|
2013-11-05 16:14:14 +08:00
|
|
|
|
|
|
|
void initPICLabelUId(unsigned UId) {
|
|
|
|
PICLabelUId = UId;
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned createPICLabelUId() {
|
|
|
|
return PICLabelUId++;
|
|
|
|
}
|
|
|
|
|
2013-02-27 11:33:58 +08:00
|
|
|
public:
|
|
|
|
static char ID;
|
2017-01-31 07:21:32 +08:00
|
|
|
|
|
|
|
MipsConstantIslands() : MachineFunctionPass(ID) {}
|
2013-02-27 11:33:58 +08:00
|
|
|
|
2016-10-01 10:56:57 +08:00
|
|
|
StringRef getPassName() const override { return "Mips Constant Islands"; }
|
2013-02-27 11:33:58 +08:00
|
|
|
|
2014-04-29 15:58:02 +08:00
|
|
|
bool runOnMachineFunction(MachineFunction &F) override;
|
2013-02-27 11:33:58 +08:00
|
|
|
|
2016-04-05 01:09:25 +08:00
|
|
|
MachineFunctionProperties getRequiredProperties() const override {
|
|
|
|
return MachineFunctionProperties().set(
|
2016-08-25 09:27:13 +08:00
|
|
|
MachineFunctionProperties::Property::NoVRegs);
|
2016-04-05 01:09:25 +08:00
|
|
|
}
|
|
|
|
|
2013-10-28 05:57:36 +08:00
|
|
|
void doInitialPlacement(std::vector<MachineInstr*> &CPEMIs);
|
2013-11-05 16:14:14 +08:00
|
|
|
CPEntry *findConstPoolEntry(unsigned CPI, const MachineInstr *CPEMI);
|
2016-07-16 07:09:47 +08:00
|
|
|
unsigned getCPELogAlign(const MachineInstr &CPEMI);
|
2013-11-05 16:14:14 +08:00
|
|
|
void initializeFunctionInfo(const std::vector<MachineInstr*> &CPEMIs);
|
|
|
|
unsigned getOffsetOf(MachineInstr *MI) const;
|
|
|
|
unsigned getUserOffset(CPUser&) const;
|
|
|
|
void dumpBBs();
|
|
|
|
|
|
|
|
bool isOffsetInRange(unsigned UserOffset, unsigned TrialOffset,
|
2013-11-06 06:34:29 +08:00
|
|
|
unsigned Disp, bool NegativeOK);
|
2013-11-05 16:14:14 +08:00
|
|
|
bool isOffsetInRange(unsigned UserOffset, unsigned TrialOffset,
|
|
|
|
const CPUser &U);
|
|
|
|
|
|
|
|
void computeBlockSize(MachineBasicBlock *MBB);
|
2016-07-16 07:09:47 +08:00
|
|
|
MachineBasicBlock *splitBlockBeforeInstr(MachineInstr &MI);
|
2013-11-05 16:14:14 +08:00
|
|
|
void updateForInsertedWaterBlock(MachineBasicBlock *NewBB);
|
|
|
|
void adjustBBOffsetsAfter(MachineBasicBlock *BB);
|
|
|
|
bool decrementCPEReferenceCount(unsigned CPI, MachineInstr* CPEMI);
|
|
|
|
int findInRangeCPEntry(CPUser& U, unsigned UserOffset);
|
|
|
|
int findLongFormInRangeCPEntry(CPUser& U, unsigned UserOffset);
|
|
|
|
bool findAvailableWater(CPUser&U, unsigned UserOffset,
|
|
|
|
water_iterator &WaterIter);
|
|
|
|
void createNewWater(unsigned CPUserIndex, unsigned UserOffset,
|
|
|
|
MachineBasicBlock *&NewMBB);
|
|
|
|
bool handleConstantPoolUser(unsigned CPUserIndex);
|
|
|
|
void removeDeadCPEMI(MachineInstr *CPEMI);
|
|
|
|
bool removeUnusedCPEntries();
|
|
|
|
bool isCPEntryInRange(MachineInstr *MI, unsigned UserOffset,
|
|
|
|
MachineInstr *CPEMI, unsigned Disp, bool NegOk,
|
|
|
|
bool DoDump = false);
|
|
|
|
bool isWaterInRange(unsigned UserOffset, MachineBasicBlock *Water,
|
|
|
|
CPUser &U, unsigned &Growth);
|
|
|
|
bool isBBInRange(MachineInstr *MI, MachineBasicBlock *BB, unsigned Disp);
|
|
|
|
bool fixupImmediateBr(ImmBranch &Br);
|
|
|
|
bool fixupConditionalBr(ImmBranch &Br);
|
|
|
|
bool fixupUnconditionalBr(ImmBranch &Br);
|
2013-10-28 05:57:36 +08:00
|
|
|
|
|
|
|
void prescanForConstants();
|
2013-02-27 11:33:58 +08:00
|
|
|
};
|
|
|
|
|
2017-01-31 07:21:32 +08:00
|
|
|
} // end anonymous namespace
|
2013-02-27 11:33:58 +08:00
|
|
|
|
2017-08-04 06:12:30 +08:00
|
|
|
char MipsConstantIslands::ID = 0;
|
|
|
|
|
2013-11-05 16:14:14 +08:00
|
|
|
bool MipsConstantIslands::isOffsetInRange
|
|
|
|
(unsigned UserOffset, unsigned TrialOffset,
|
|
|
|
const CPUser &U) {
|
|
|
|
return isOffsetInRange(UserOffset, TrialOffset,
|
2013-11-06 06:34:29 +08:00
|
|
|
U.getMaxDisp(), U.NegOk);
|
2013-11-05 16:14:14 +08:00
|
|
|
}
|
2017-01-31 07:21:32 +08:00
|
|
|
|
2017-10-15 22:32:27 +08:00
|
|
|
#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
|
2013-11-05 16:14:14 +08:00
|
|
|
/// print block size and offset information - debugging
|
2017-01-28 10:02:38 +08:00
|
|
|
LLVM_DUMP_METHOD void MipsConstantIslands::dumpBBs() {
|
|
|
|
for (unsigned J = 0, E = BBInfo.size(); J !=E; ++J) {
|
|
|
|
const BasicBlockInfo &BBI = BBInfo[J];
|
|
|
|
dbgs() << format("%08x BB#%u\t", BBI.Offset, J)
|
|
|
|
<< format(" size=%#x\n", BBInfo[J].Size);
|
|
|
|
}
|
2013-11-05 16:14:14 +08:00
|
|
|
}
|
2017-01-28 10:02:38 +08:00
|
|
|
#endif
|
2013-02-27 11:33:58 +08:00
|
|
|
|
2013-10-28 05:57:36 +08:00
|
|
|
bool MipsConstantIslands::runOnMachineFunction(MachineFunction &mf) {
|
2013-04-10 03:46:01 +08:00
|
|
|
// The intention is for this to be a mips16 only pass for now
|
|
|
|
// FIXME:
|
2013-10-28 05:57:36 +08:00
|
|
|
MF = &mf;
|
|
|
|
MCP = mf.getConstantPool();
|
2015-01-30 07:27:36 +08:00
|
|
|
STI = &static_cast<const MipsSubtarget &>(mf.getSubtarget());
|
2013-10-28 05:57:36 +08:00
|
|
|
DEBUG(dbgs() << "constant island machine function " << "\n");
|
2014-07-19 07:41:32 +08:00
|
|
|
if (!STI->inMips16Mode() || !MipsSubtarget::useConstantIslands()) {
|
2013-10-28 05:57:36 +08:00
|
|
|
return false;
|
|
|
|
}
|
2015-01-30 07:27:36 +08:00
|
|
|
TII = (const Mips16InstrInfo *)STI->getInstrInfo();
|
2013-11-05 16:14:14 +08:00
|
|
|
MFI = MF->getInfo<MipsFunctionInfo>();
|
2013-10-28 05:57:36 +08:00
|
|
|
DEBUG(dbgs() << "constant island processing " << "\n");
|
|
|
|
//
|
|
|
|
// will need to make predermination if there is any constants we need to
|
|
|
|
// put in constant islands. TBD.
|
|
|
|
//
|
2013-11-05 16:14:14 +08:00
|
|
|
if (!PrescannedForConstants) prescanForConstants();
|
2013-10-28 05:57:36 +08:00
|
|
|
|
2013-11-05 16:14:14 +08:00
|
|
|
HasFarJump = false;
|
2013-10-28 05:57:36 +08:00
|
|
|
// This pass invalidates liveness information when it splits basic blocks.
|
|
|
|
MF->getRegInfo().invalidateLiveness();
|
|
|
|
|
|
|
|
// Renumber all of the machine basic blocks in the function, guaranteeing that
|
|
|
|
// the numbers agree with the position of the block in the function.
|
|
|
|
MF->RenumberBlocks();
|
|
|
|
|
2013-11-05 16:14:14 +08:00
|
|
|
bool MadeChange = false;
|
|
|
|
|
2013-10-28 05:57:36 +08:00
|
|
|
// Perform the initial placement of the constant pool entries. To start with,
|
|
|
|
// we put them all at the end of the function.
|
|
|
|
std::vector<MachineInstr*> CPEMIs;
|
|
|
|
if (!MCP->isEmpty())
|
|
|
|
doInitialPlacement(CPEMIs);
|
|
|
|
|
2013-11-05 16:14:14 +08:00
|
|
|
/// The next UID to take is the first unused one.
|
|
|
|
initPICLabelUId(CPEMIs.size());
|
|
|
|
|
|
|
|
// Do the initial scan of the function, building up information about the
|
|
|
|
// sizes of each block, the location of all the water, and finding all of the
|
|
|
|
// constant pool users.
|
|
|
|
initializeFunctionInfo(CPEMIs);
|
|
|
|
CPEMIs.clear();
|
|
|
|
DEBUG(dumpBBs());
|
|
|
|
|
|
|
|
/// Remove dead constant pool entries.
|
|
|
|
MadeChange |= removeUnusedCPEntries();
|
|
|
|
|
|
|
|
// Iteratively place constant pool entries and fix up branches until there
|
|
|
|
// is no change.
|
|
|
|
unsigned NoCPIters = 0, NoBRIters = 0;
|
|
|
|
(void)NoBRIters;
|
|
|
|
while (true) {
|
|
|
|
DEBUG(dbgs() << "Beginning CP iteration #" << NoCPIters << '\n');
|
|
|
|
bool CPChange = false;
|
|
|
|
for (unsigned i = 0, e = CPUsers.size(); i != e; ++i)
|
|
|
|
CPChange |= handleConstantPoolUser(i);
|
|
|
|
if (CPChange && ++NoCPIters > 30)
|
|
|
|
report_fatal_error("Constant Island pass failed to converge!");
|
|
|
|
DEBUG(dumpBBs());
|
|
|
|
|
|
|
|
// Clear NewWaterList now. If we split a block for branches, it should
|
|
|
|
// appear as "new water" for the next iteration of constant pool placement.
|
|
|
|
NewWaterList.clear();
|
|
|
|
|
|
|
|
DEBUG(dbgs() << "Beginning BR iteration #" << NoBRIters << '\n');
|
|
|
|
bool BRChange = false;
|
|
|
|
for (unsigned i = 0, e = ImmBranches.size(); i != e; ++i)
|
|
|
|
BRChange |= fixupImmediateBr(ImmBranches[i]);
|
|
|
|
if (BRChange && ++NoBRIters > 30)
|
|
|
|
report_fatal_error("Branch Fix Up pass failed to converge!");
|
|
|
|
DEBUG(dumpBBs());
|
|
|
|
if (!CPChange && !BRChange)
|
|
|
|
break;
|
|
|
|
MadeChange = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
DEBUG(dbgs() << '\n'; dumpBBs());
|
|
|
|
|
|
|
|
BBInfo.clear();
|
|
|
|
WaterList.clear();
|
|
|
|
CPUsers.clear();
|
|
|
|
CPEntries.clear();
|
|
|
|
ImmBranches.clear();
|
|
|
|
return MadeChange;
|
2013-02-27 11:33:58 +08:00
|
|
|
}
|
|
|
|
|
2013-10-28 05:57:36 +08:00
|
|
|
/// doInitialPlacement - Perform the initial placement of the constant pool
|
|
|
|
/// entries. To start with, we put them all at the end of the function.
|
|
|
|
void
|
|
|
|
MipsConstantIslands::doInitialPlacement(std::vector<MachineInstr*> &CPEMIs) {
|
|
|
|
// Create the basic block to hold the CPE's.
|
|
|
|
MachineBasicBlock *BB = MF->CreateMachineBasicBlock();
|
|
|
|
MF->push_back(BB);
|
|
|
|
|
|
|
|
// MachineConstantPool measures alignment in bytes. We measure in log2(bytes).
|
|
|
|
unsigned MaxAlign = Log2_32(MCP->getConstantPoolAlignment());
|
|
|
|
|
|
|
|
// Mark the basic block as required by the const-pool.
|
|
|
|
// If AlignConstantIslands isn't set, use 4-byte alignment for everything.
|
|
|
|
BB->setAlignment(AlignConstantIslands ? MaxAlign : 2);
|
|
|
|
|
|
|
|
// The function needs to be as aligned as the basic blocks. The linker may
|
|
|
|
// move functions around based on their alignment.
|
|
|
|
MF->ensureAlignment(BB->getAlignment());
|
|
|
|
|
|
|
|
// Order the entries in BB by descending alignment. That ensures correct
|
|
|
|
// alignment of all entries as long as BB is sufficiently aligned. Keep
|
|
|
|
// track of the insertion point for each alignment. We are going to bucket
|
|
|
|
// sort the entries as they are created.
|
|
|
|
SmallVector<MachineBasicBlock::iterator, 8> InsPoint(MaxAlign + 1, BB->end());
|
|
|
|
|
|
|
|
// Add all of the constants from the constant pool to the end block, use an
|
|
|
|
// identity mapping of CPI's to CPE's.
|
|
|
|
const std::vector<MachineConstantPoolEntry> &CPs = MCP->getConstants();
|
|
|
|
|
2015-07-16 14:11:10 +08:00
|
|
|
const DataLayout &TD = MF->getDataLayout();
|
2013-10-28 05:57:36 +08:00
|
|
|
for (unsigned i = 0, e = CPs.size(); i != e; ++i) {
|
|
|
|
unsigned Size = TD.getTypeAllocSize(CPs[i].getType());
|
|
|
|
assert(Size >= 4 && "Too small constant pool entry");
|
|
|
|
unsigned Align = CPs[i].getAlignment();
|
|
|
|
assert(isPowerOf2_32(Align) && "Invalid alignment");
|
|
|
|
// Verify that all constant pool entries are a multiple of their alignment.
|
|
|
|
// If not, we would have to pad them out so that instructions stay aligned.
|
|
|
|
assert((Size % Align) == 0 && "CP Entry not multiple of 4 bytes!");
|
|
|
|
|
|
|
|
// Insert CONSTPOOL_ENTRY before entries with a smaller alignment.
|
|
|
|
unsigned LogAlign = Log2_32(Align);
|
|
|
|
MachineBasicBlock::iterator InsAt = InsPoint[LogAlign];
|
|
|
|
|
|
|
|
MachineInstr *CPEMI =
|
|
|
|
BuildMI(*BB, InsAt, DebugLoc(), TII->get(Mips::CONSTPOOL_ENTRY))
|
|
|
|
.addImm(i).addConstantPoolIndex(i).addImm(Size);
|
|
|
|
|
|
|
|
CPEMIs.push_back(CPEMI);
|
|
|
|
|
|
|
|
// Ensure that future entries with higher alignment get inserted before
|
|
|
|
// CPEMI. This is bucket sort with iterators.
|
|
|
|
for (unsigned a = LogAlign + 1; a <= MaxAlign; ++a)
|
|
|
|
if (InsPoint[a] == InsAt)
|
|
|
|
InsPoint[a] = CPEMI;
|
|
|
|
// Add a new CPEntry, but no corresponding CPUser yet.
|
2014-10-04 02:33:16 +08:00
|
|
|
CPEntries.emplace_back(1, CPEntry(CPEMI, i));
|
2013-10-28 05:57:36 +08:00
|
|
|
++NumCPEs;
|
|
|
|
DEBUG(dbgs() << "Moved CPI#" << i << " to end of function, size = "
|
|
|
|
<< Size << ", align = " << Align <<'\n');
|
|
|
|
}
|
|
|
|
DEBUG(BB->dump());
|
|
|
|
}
|
|
|
|
|
2013-11-05 16:14:14 +08:00
|
|
|
/// BBHasFallthrough - Return true if the specified basic block can fallthrough
|
|
|
|
/// into the block immediately after it.
|
|
|
|
static bool BBHasFallthrough(MachineBasicBlock *MBB) {
|
|
|
|
// Get the next machine basic block in the function.
|
2015-10-20 08:15:20 +08:00
|
|
|
MachineFunction::iterator MBBI = MBB->getIterator();
|
2013-11-05 16:14:14 +08:00
|
|
|
// Can't fall off end of function.
|
2014-03-02 20:27:27 +08:00
|
|
|
if (std::next(MBBI) == MBB->getParent()->end())
|
2013-11-05 16:14:14 +08:00
|
|
|
return false;
|
|
|
|
|
2015-10-20 08:15:20 +08:00
|
|
|
MachineBasicBlock *NextBB = &*std::next(MBBI);
|
2013-11-05 16:14:14 +08:00
|
|
|
for (MachineBasicBlock::succ_iterator I = MBB->succ_begin(),
|
|
|
|
E = MBB->succ_end(); I != E; ++I)
|
|
|
|
if (*I == NextBB)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// findConstPoolEntry - Given the constpool index and CONSTPOOL_ENTRY MI,
|
|
|
|
/// look up the corresponding CPEntry.
|
|
|
|
MipsConstantIslands::CPEntry
|
|
|
|
*MipsConstantIslands::findConstPoolEntry(unsigned CPI,
|
|
|
|
const MachineInstr *CPEMI) {
|
|
|
|
std::vector<CPEntry> &CPEs = CPEntries[CPI];
|
|
|
|
// Number of entries per constpool index should be small, just do a
|
|
|
|
// linear search.
|
|
|
|
for (unsigned i = 0, e = CPEs.size(); i != e; ++i) {
|
|
|
|
if (CPEs[i].CPEMI == CPEMI)
|
|
|
|
return &CPEs[i];
|
|
|
|
}
|
2014-04-25 13:30:21 +08:00
|
|
|
return nullptr;
|
2013-11-05 16:14:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/// getCPELogAlign - Returns the required alignment of the constant pool entry
|
|
|
|
/// represented by CPEMI. Alignment is measured in log2(bytes) units.
|
2016-07-16 07:09:47 +08:00
|
|
|
unsigned MipsConstantIslands::getCPELogAlign(const MachineInstr &CPEMI) {
|
|
|
|
assert(CPEMI.getOpcode() == Mips::CONSTPOOL_ENTRY);
|
2013-11-05 16:14:14 +08:00
|
|
|
|
|
|
|
// Everything is 4-byte aligned unless AlignConstantIslands is set.
|
|
|
|
if (!AlignConstantIslands)
|
|
|
|
return 2;
|
|
|
|
|
2016-07-16 07:09:47 +08:00
|
|
|
unsigned CPI = CPEMI.getOperand(1).getIndex();
|
2013-11-05 16:14:14 +08:00
|
|
|
assert(CPI < MCP->getConstants().size() && "Invalid constant pool index.");
|
|
|
|
unsigned Align = MCP->getConstants()[CPI].getAlignment();
|
|
|
|
assert(isPowerOf2_32(Align) && "Invalid CPE alignment");
|
|
|
|
return Log2_32(Align);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// initializeFunctionInfo - Do the initial scan of the function, building up
|
|
|
|
/// information about the sizes of each block, the location of all the water,
|
|
|
|
/// and finding all of the constant pool users.
|
|
|
|
void MipsConstantIslands::
|
|
|
|
initializeFunctionInfo(const std::vector<MachineInstr*> &CPEMIs) {
|
|
|
|
BBInfo.clear();
|
|
|
|
BBInfo.resize(MF->getNumBlockIDs());
|
|
|
|
|
|
|
|
// First thing, compute the size of all basic blocks, and see if the function
|
|
|
|
// has any inline assembly in it. If so, we have to be conservative about
|
|
|
|
// alignment assumptions, as we don't know for sure the size of any
|
|
|
|
// instructions in the inline assembly.
|
|
|
|
for (MachineFunction::iterator I = MF->begin(), E = MF->end(); I != E; ++I)
|
2015-10-20 08:15:20 +08:00
|
|
|
computeBlockSize(&*I);
|
2013-11-05 16:14:14 +08:00
|
|
|
|
|
|
|
// Compute block offsets.
|
2015-10-20 08:15:20 +08:00
|
|
|
adjustBBOffsetsAfter(&MF->front());
|
2013-11-05 16:14:14 +08:00
|
|
|
|
|
|
|
// Now go back through the instructions and build up our data structures.
|
2016-07-16 07:09:47 +08:00
|
|
|
for (MachineBasicBlock &MBB : *MF) {
|
2013-11-05 16:14:14 +08:00
|
|
|
// If this block doesn't fall through into the next MBB, then this is
|
|
|
|
// 'water' that a constant pool island could be placed.
|
|
|
|
if (!BBHasFallthrough(&MBB))
|
|
|
|
WaterList.push_back(&MBB);
|
2016-07-16 07:09:47 +08:00
|
|
|
for (MachineInstr &MI : MBB) {
|
|
|
|
if (MI.isDebugValue())
|
2013-11-05 16:14:14 +08:00
|
|
|
continue;
|
|
|
|
|
2016-07-16 07:09:47 +08:00
|
|
|
int Opc = MI.getOpcode();
|
|
|
|
if (MI.isBranch()) {
|
2013-11-05 16:14:14 +08:00
|
|
|
bool isCond = false;
|
|
|
|
unsigned Bits = 0;
|
|
|
|
unsigned Scale = 1;
|
|
|
|
int UOpc = Opc;
|
|
|
|
switch (Opc) {
|
|
|
|
default:
|
2013-11-14 07:52:18 +08:00
|
|
|
continue; // Ignore other branches for now
|
|
|
|
case Mips::Bimm16:
|
|
|
|
Bits = 11;
|
|
|
|
Scale = 2;
|
|
|
|
isCond = false;
|
|
|
|
break;
|
|
|
|
case Mips::BimmX16:
|
|
|
|
Bits = 16;
|
|
|
|
Scale = 2;
|
|
|
|
isCond = false;
|
2013-11-28 08:56:37 +08:00
|
|
|
break;
|
|
|
|
case Mips::BeqzRxImm16:
|
2013-12-04 07:42:51 +08:00
|
|
|
UOpc=Mips::Bimm16;
|
2013-11-28 08:56:37 +08:00
|
|
|
Bits = 8;
|
|
|
|
Scale = 2;
|
|
|
|
isCond = true;
|
|
|
|
break;
|
|
|
|
case Mips::BeqzRxImmX16:
|
2013-12-04 07:42:51 +08:00
|
|
|
UOpc=Mips::Bimm16;
|
2013-11-28 08:56:37 +08:00
|
|
|
Bits = 16;
|
|
|
|
Scale = 2;
|
|
|
|
isCond = true;
|
|
|
|
break;
|
|
|
|
case Mips::BnezRxImm16:
|
2013-12-04 07:42:51 +08:00
|
|
|
UOpc=Mips::Bimm16;
|
2013-11-28 08:56:37 +08:00
|
|
|
Bits = 8;
|
|
|
|
Scale = 2;
|
|
|
|
isCond = true;
|
|
|
|
break;
|
|
|
|
case Mips::BnezRxImmX16:
|
2013-12-04 07:42:51 +08:00
|
|
|
UOpc=Mips::Bimm16;
|
2013-11-28 08:56:37 +08:00
|
|
|
Bits = 16;
|
|
|
|
Scale = 2;
|
|
|
|
isCond = true;
|
|
|
|
break;
|
|
|
|
case Mips::Bteqz16:
|
2013-12-04 07:42:51 +08:00
|
|
|
UOpc=Mips::Bimm16;
|
2013-11-28 08:56:37 +08:00
|
|
|
Bits = 8;
|
|
|
|
Scale = 2;
|
|
|
|
isCond = true;
|
|
|
|
break;
|
|
|
|
case Mips::BteqzX16:
|
2013-12-04 07:42:51 +08:00
|
|
|
UOpc=Mips::Bimm16;
|
2013-11-28 08:56:37 +08:00
|
|
|
Bits = 16;
|
|
|
|
Scale = 2;
|
|
|
|
isCond = true;
|
|
|
|
break;
|
|
|
|
case Mips::Btnez16:
|
2013-12-04 07:42:51 +08:00
|
|
|
UOpc=Mips::Bimm16;
|
2013-11-28 08:56:37 +08:00
|
|
|
Bits = 8;
|
|
|
|
Scale = 2;
|
|
|
|
isCond = true;
|
|
|
|
break;
|
|
|
|
case Mips::BtnezX16:
|
2013-12-04 07:42:51 +08:00
|
|
|
UOpc=Mips::Bimm16;
|
2013-11-28 08:56:37 +08:00
|
|
|
Bits = 16;
|
|
|
|
Scale = 2;
|
|
|
|
isCond = true;
|
|
|
|
break;
|
2013-11-05 16:14:14 +08:00
|
|
|
}
|
|
|
|
// Record this immediate branch.
|
|
|
|
unsigned MaxOffs = ((1 << (Bits-1))-1) * Scale;
|
2016-07-16 07:09:47 +08:00
|
|
|
ImmBranches.push_back(ImmBranch(&MI, MaxOffs, isCond, UOpc));
|
2013-11-05 16:14:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
if (Opc == Mips::CONSTPOOL_ENTRY)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
// Scan the instructions for constant pool operands.
|
2016-07-16 07:09:47 +08:00
|
|
|
for (unsigned op = 0, e = MI.getNumOperands(); op != e; ++op)
|
|
|
|
if (MI.getOperand(op).isCPI()) {
|
2013-11-05 16:14:14 +08:00
|
|
|
// We found one. The addressing mode tells us the max displacement
|
|
|
|
// from the PC that this instruction permits.
|
|
|
|
|
|
|
|
// Basic size info comes from the TSFlags field.
|
|
|
|
unsigned Bits = 0;
|
|
|
|
unsigned Scale = 1;
|
|
|
|
bool NegOk = false;
|
|
|
|
unsigned LongFormBits = 0;
|
|
|
|
unsigned LongFormScale = 0;
|
|
|
|
unsigned LongFormOpcode = 0;
|
|
|
|
switch (Opc) {
|
|
|
|
default:
|
|
|
|
llvm_unreachable("Unknown addressing mode for CP reference!");
|
|
|
|
case Mips::LwRxPcTcp16:
|
|
|
|
Bits = 8;
|
2013-11-06 12:29:52 +08:00
|
|
|
Scale = 4;
|
2013-11-05 16:14:14 +08:00
|
|
|
LongFormOpcode = Mips::LwRxPcTcpX16;
|
2014-01-16 08:47:46 +08:00
|
|
|
LongFormBits = 14;
|
2013-11-10 08:09:26 +08:00
|
|
|
LongFormScale = 1;
|
2013-11-05 16:14:14 +08:00
|
|
|
break;
|
|
|
|
case Mips::LwRxPcTcpX16:
|
2014-01-16 08:47:46 +08:00
|
|
|
Bits = 14;
|
2013-11-06 12:29:52 +08:00
|
|
|
Scale = 1;
|
|
|
|
NegOk = true;
|
2013-11-05 16:14:14 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
// Remember that this is a user of a CP entry.
|
2016-07-16 07:09:47 +08:00
|
|
|
unsigned CPI = MI.getOperand(op).getIndex();
|
2013-11-05 16:14:14 +08:00
|
|
|
MachineInstr *CPEMI = CPEMIs[CPI];
|
|
|
|
unsigned MaxOffs = ((1 << Bits)-1) * Scale;
|
|
|
|
unsigned LongFormMaxOffs = ((1 << LongFormBits)-1) * LongFormScale;
|
2016-07-16 07:09:47 +08:00
|
|
|
CPUsers.push_back(CPUser(&MI, CPEMI, MaxOffs, NegOk, LongFormMaxOffs,
|
|
|
|
LongFormOpcode));
|
2013-11-05 16:14:14 +08:00
|
|
|
|
|
|
|
// Increment corresponding CPEntry reference count.
|
|
|
|
CPEntry *CPE = findConstPoolEntry(CPI, CPEMI);
|
|
|
|
assert(CPE && "Cannot find a corresponding CPEntry!");
|
|
|
|
CPE->RefCount++;
|
|
|
|
|
|
|
|
// Instructions can only use one CP entry, don't bother scanning the
|
|
|
|
// rest of the operands.
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// computeBlockSize - Compute the size and some alignment information for MBB.
|
|
|
|
/// This function updates BBInfo directly.
|
|
|
|
void MipsConstantIslands::computeBlockSize(MachineBasicBlock *MBB) {
|
|
|
|
BasicBlockInfo &BBI = BBInfo[MBB->getNumber()];
|
|
|
|
BBI.Size = 0;
|
|
|
|
|
2016-07-16 07:09:47 +08:00
|
|
|
for (const MachineInstr &MI : *MBB)
|
2016-07-29 00:32:22 +08:00
|
|
|
BBI.Size += TII->getInstSizeInBytes(MI);
|
2013-11-05 16:14:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/// getOffsetOf - Return the current offset of the specified machine instruction
|
|
|
|
/// from the start of the function. This offset changes as stuff is moved
|
|
|
|
/// around inside the function.
|
|
|
|
unsigned MipsConstantIslands::getOffsetOf(MachineInstr *MI) const {
|
|
|
|
MachineBasicBlock *MBB = MI->getParent();
|
|
|
|
|
|
|
|
// The offset is composed of two things: the sum of the sizes of all MBB's
|
|
|
|
// before this instruction's block, and the offset from the start of the block
|
|
|
|
// it is in.
|
|
|
|
unsigned Offset = BBInfo[MBB->getNumber()].Offset;
|
|
|
|
|
|
|
|
// Sum instructions before MI in MBB.
|
|
|
|
for (MachineBasicBlock::iterator I = MBB->begin(); &*I != MI; ++I) {
|
|
|
|
assert(I != MBB->end() && "Didn't find MI in its own basic block?");
|
2016-07-29 00:32:22 +08:00
|
|
|
Offset += TII->getInstSizeInBytes(*I);
|
2013-11-05 16:14:14 +08:00
|
|
|
}
|
|
|
|
return Offset;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// CompareMBBNumbers - Little predicate function to sort the WaterList by MBB
|
|
|
|
/// ID.
|
|
|
|
static bool CompareMBBNumbers(const MachineBasicBlock *LHS,
|
|
|
|
const MachineBasicBlock *RHS) {
|
|
|
|
return LHS->getNumber() < RHS->getNumber();
|
|
|
|
}
|
|
|
|
|
|
|
|
/// updateForInsertedWaterBlock - When a block is newly inserted into the
|
|
|
|
/// machine function, it upsets all of the block numbers. Renumber the blocks
|
|
|
|
/// and update the arrays that parallel this numbering.
|
|
|
|
void MipsConstantIslands::updateForInsertedWaterBlock
|
|
|
|
(MachineBasicBlock *NewBB) {
|
|
|
|
// Renumber the MBB's to keep them consecutive.
|
|
|
|
NewBB->getParent()->RenumberBlocks(NewBB);
|
|
|
|
|
|
|
|
// Insert an entry into BBInfo to align it properly with the (newly
|
|
|
|
// renumbered) block numbers.
|
|
|
|
BBInfo.insert(BBInfo.begin() + NewBB->getNumber(), BasicBlockInfo());
|
|
|
|
|
|
|
|
// Next, update WaterList. Specifically, we need to add NewMBB as having
|
|
|
|
// available water after it.
|
|
|
|
water_iterator IP =
|
|
|
|
std::lower_bound(WaterList.begin(), WaterList.end(), NewBB,
|
|
|
|
CompareMBBNumbers);
|
|
|
|
WaterList.insert(IP, NewBB);
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned MipsConstantIslands::getUserOffset(CPUser &U) const {
|
2013-11-06 05:39:57 +08:00
|
|
|
return getOffsetOf(U.MI);
|
2013-11-05 16:14:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/// Split the basic block containing MI into two blocks, which are joined by
|
|
|
|
/// an unconditional branch. Update data structures and renumber blocks to
|
|
|
|
/// account for this change and returns the newly created block.
|
2016-07-16 07:09:47 +08:00
|
|
|
MachineBasicBlock *
|
|
|
|
MipsConstantIslands::splitBlockBeforeInstr(MachineInstr &MI) {
|
|
|
|
MachineBasicBlock *OrigBB = MI.getParent();
|
2013-11-05 16:14:14 +08:00
|
|
|
|
|
|
|
// Create a new MBB for the code after the OrigBB.
|
|
|
|
MachineBasicBlock *NewBB =
|
|
|
|
MF->CreateMachineBasicBlock(OrigBB->getBasicBlock());
|
2015-10-20 08:15:20 +08:00
|
|
|
MachineFunction::iterator MBBI = ++OrigBB->getIterator();
|
2013-11-05 16:14:14 +08:00
|
|
|
MF->insert(MBBI, NewBB);
|
|
|
|
|
|
|
|
// Splice the instructions starting with MI over to NewBB.
|
|
|
|
NewBB->splice(NewBB->end(), OrigBB, MI, OrigBB->end());
|
|
|
|
|
|
|
|
// Add an unconditional branch from OrigBB to NewBB.
|
|
|
|
// Note the new unconditional branch is not being recorded.
|
|
|
|
// There doesn't seem to be meaningful DebugInfo available; this doesn't
|
|
|
|
// correspond to anything in the source.
|
2013-11-12 10:27:12 +08:00
|
|
|
BuildMI(OrigBB, DebugLoc(), TII->get(Mips::Bimm16)).addMBB(NewBB);
|
2013-11-05 16:14:14 +08:00
|
|
|
++NumSplit;
|
|
|
|
|
|
|
|
// Update the CFG. All succs of OrigBB are now succs of NewBB.
|
|
|
|
NewBB->transferSuccessors(OrigBB);
|
|
|
|
|
|
|
|
// OrigBB branches to NewBB.
|
|
|
|
OrigBB->addSuccessor(NewBB);
|
|
|
|
|
|
|
|
// Update internal data structures to account for the newly inserted MBB.
|
|
|
|
// This is almost the same as updateForInsertedWaterBlock, except that
|
|
|
|
// the Water goes after OrigBB, not NewBB.
|
|
|
|
MF->RenumberBlocks(NewBB);
|
|
|
|
|
|
|
|
// Insert an entry into BBInfo to align it properly with the (newly
|
|
|
|
// renumbered) block numbers.
|
|
|
|
BBInfo.insert(BBInfo.begin() + NewBB->getNumber(), BasicBlockInfo());
|
|
|
|
|
|
|
|
// Next, update WaterList. Specifically, we need to add OrigMBB as having
|
|
|
|
// available water after it (but not if it's already there, which happens
|
|
|
|
// when splitting before a conditional branch that is followed by an
|
|
|
|
// unconditional branch - in that case we want to insert NewBB).
|
|
|
|
water_iterator IP =
|
|
|
|
std::lower_bound(WaterList.begin(), WaterList.end(), OrigBB,
|
|
|
|
CompareMBBNumbers);
|
|
|
|
MachineBasicBlock* WaterBB = *IP;
|
|
|
|
if (WaterBB == OrigBB)
|
2014-03-02 20:27:27 +08:00
|
|
|
WaterList.insert(std::next(IP), NewBB);
|
2013-11-05 16:14:14 +08:00
|
|
|
else
|
|
|
|
WaterList.insert(IP, OrigBB);
|
|
|
|
NewWaterList.insert(OrigBB);
|
|
|
|
|
|
|
|
// Figure out how large the OrigBB is. As the first half of the original
|
|
|
|
// block, it cannot contain a tablejump. The size includes
|
|
|
|
// the new jump we added. (It should be possible to do this without
|
|
|
|
// recounting everything, but it's very confusing, and this is rarely
|
|
|
|
// executed.)
|
|
|
|
computeBlockSize(OrigBB);
|
|
|
|
|
|
|
|
// Figure out how large the NewMBB is. As the second half of the original
|
|
|
|
// block, it may contain a tablejump.
|
|
|
|
computeBlockSize(NewBB);
|
|
|
|
|
|
|
|
// All BBOffsets following these blocks must be modified.
|
|
|
|
adjustBBOffsetsAfter(OrigBB);
|
|
|
|
|
|
|
|
return NewBB;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// isOffsetInRange - Checks whether UserOffset (the location of a constant pool
|
|
|
|
/// reference) is within MaxDisp of TrialOffset (a proposed location of a
|
|
|
|
/// constant pool entry).
|
|
|
|
bool MipsConstantIslands::isOffsetInRange(unsigned UserOffset,
|
|
|
|
unsigned TrialOffset, unsigned MaxDisp,
|
2013-11-06 06:34:29 +08:00
|
|
|
bool NegativeOK) {
|
2013-11-05 16:14:14 +08:00
|
|
|
if (UserOffset <= TrialOffset) {
|
|
|
|
// User before the Trial.
|
|
|
|
if (TrialOffset - UserOffset <= MaxDisp)
|
|
|
|
return true;
|
|
|
|
} else if (NegativeOK) {
|
|
|
|
if (UserOffset - TrialOffset <= MaxDisp)
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// isWaterInRange - Returns true if a CPE placed after the specified
|
|
|
|
/// Water (a basic block) will be in range for the specific MI.
|
|
|
|
///
|
|
|
|
/// Compute how much the function will grow by inserting a CPE after Water.
|
|
|
|
bool MipsConstantIslands::isWaterInRange(unsigned UserOffset,
|
|
|
|
MachineBasicBlock* Water, CPUser &U,
|
|
|
|
unsigned &Growth) {
|
2016-07-16 07:09:47 +08:00
|
|
|
unsigned CPELogAlign = getCPELogAlign(*U.CPEMI);
|
2013-11-05 16:14:14 +08:00
|
|
|
unsigned CPEOffset = BBInfo[Water->getNumber()].postOffset(CPELogAlign);
|
|
|
|
unsigned NextBlockOffset, NextBlockAlignment;
|
2015-10-20 08:15:20 +08:00
|
|
|
MachineFunction::const_iterator NextBlock = ++Water->getIterator();
|
|
|
|
if (NextBlock == MF->end()) {
|
2013-11-05 16:14:14 +08:00
|
|
|
NextBlockOffset = BBInfo[Water->getNumber()].postOffset();
|
|
|
|
NextBlockAlignment = 0;
|
|
|
|
} else {
|
|
|
|
NextBlockOffset = BBInfo[NextBlock->getNumber()].Offset;
|
|
|
|
NextBlockAlignment = NextBlock->getAlignment();
|
|
|
|
}
|
|
|
|
unsigned Size = U.CPEMI->getOperand(2).getImm();
|
|
|
|
unsigned CPEEnd = CPEOffset + Size;
|
|
|
|
|
|
|
|
// The CPE may be able to hide in the alignment padding before the next
|
|
|
|
// block. It may also cause more padding to be required if it is more aligned
|
|
|
|
// that the next block.
|
|
|
|
if (CPEEnd > NextBlockOffset) {
|
|
|
|
Growth = CPEEnd - NextBlockOffset;
|
|
|
|
// Compute the padding that would go at the end of the CPE to align the next
|
|
|
|
// block.
|
2016-03-31 05:30:00 +08:00
|
|
|
Growth += OffsetToAlignment(CPEEnd, 1ULL << NextBlockAlignment);
|
2013-11-05 16:14:14 +08:00
|
|
|
|
|
|
|
// If the CPE is to be inserted before the instruction, that will raise
|
|
|
|
// the offset of the instruction. Also account for unknown alignment padding
|
|
|
|
// in blocks between CPE and the user.
|
|
|
|
if (CPEOffset < UserOffset)
|
2013-11-06 07:36:58 +08:00
|
|
|
UserOffset += Growth;
|
2013-11-05 16:14:14 +08:00
|
|
|
} else
|
|
|
|
// CPE fits in existing padding.
|
|
|
|
Growth = 0;
|
|
|
|
|
|
|
|
return isOffsetInRange(UserOffset, CPEOffset, U);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// isCPEntryInRange - Returns true if the distance between specific MI and
|
|
|
|
/// specific ConstPool entry instruction can fit in MI's displacement field.
|
|
|
|
bool MipsConstantIslands::isCPEntryInRange
|
|
|
|
(MachineInstr *MI, unsigned UserOffset,
|
|
|
|
MachineInstr *CPEMI, unsigned MaxDisp,
|
|
|
|
bool NegOk, bool DoDump) {
|
|
|
|
unsigned CPEOffset = getOffsetOf(CPEMI);
|
|
|
|
|
|
|
|
if (DoDump) {
|
|
|
|
DEBUG({
|
|
|
|
unsigned Block = MI->getParent()->getNumber();
|
|
|
|
const BasicBlockInfo &BBI = BBInfo[Block];
|
|
|
|
dbgs() << "User of CPE#" << CPEMI->getOperand(0).getImm()
|
|
|
|
<< " max delta=" << MaxDisp
|
|
|
|
<< format(" insn address=%#x", UserOffset)
|
|
|
|
<< " in BB#" << Block << ": "
|
|
|
|
<< format("%#x-%x\t", BBI.Offset, BBI.postOffset()) << *MI
|
|
|
|
<< format("CPE address=%#x offset=%+d: ", CPEOffset,
|
|
|
|
int(CPEOffset-UserOffset));
|
|
|
|
});
|
|
|
|
}
|
|
|
|
|
|
|
|
return isOffsetInRange(UserOffset, CPEOffset, MaxDisp, NegOk);
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef NDEBUG
|
|
|
|
/// BBIsJumpedOver - Return true of the specified basic block's only predecessor
|
|
|
|
/// unconditionally branches to its only successor.
|
|
|
|
static bool BBIsJumpedOver(MachineBasicBlock *MBB) {
|
|
|
|
if (MBB->pred_size() != 1 || MBB->succ_size() != 1)
|
|
|
|
return false;
|
|
|
|
MachineBasicBlock *Succ = *MBB->succ_begin();
|
|
|
|
MachineBasicBlock *Pred = *MBB->pred_begin();
|
|
|
|
MachineInstr *PredMI = &Pred->back();
|
2013-11-12 10:27:12 +08:00
|
|
|
if (PredMI->getOpcode() == Mips::Bimm16)
|
2013-11-05 16:14:14 +08:00
|
|
|
return PredMI->getOperand(0).getMBB() == Succ;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
void MipsConstantIslands::adjustBBOffsetsAfter(MachineBasicBlock *BB) {
|
|
|
|
unsigned BBNum = BB->getNumber();
|
|
|
|
for(unsigned i = BBNum + 1, e = MF->getNumBlockIDs(); i < e; ++i) {
|
|
|
|
// Get the offset and known bits at the end of the layout predecessor.
|
|
|
|
// Include the alignment of the current block.
|
2013-11-06 07:36:58 +08:00
|
|
|
unsigned Offset = BBInfo[i - 1].Offset + BBInfo[i - 1].Size;
|
2013-11-05 16:14:14 +08:00
|
|
|
BBInfo[i].Offset = Offset;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// decrementCPEReferenceCount - find the constant pool entry with index CPI
|
|
|
|
/// and instruction CPEMI, and decrement its refcount. If the refcount
|
|
|
|
/// becomes 0 remove the entry and instruction. Returns true if we removed
|
|
|
|
/// the entry, false if we didn't.
|
|
|
|
bool MipsConstantIslands::decrementCPEReferenceCount(unsigned CPI,
|
|
|
|
MachineInstr *CPEMI) {
|
|
|
|
// Find the old entry. Eliminate it if it is no longer used.
|
|
|
|
CPEntry *CPE = findConstPoolEntry(CPI, CPEMI);
|
|
|
|
assert(CPE && "Unexpected!");
|
|
|
|
if (--CPE->RefCount == 0) {
|
|
|
|
removeDeadCPEMI(CPEMI);
|
2014-04-25 13:30:21 +08:00
|
|
|
CPE->CPEMI = nullptr;
|
2013-11-05 16:14:14 +08:00
|
|
|
--NumCPEs;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// LookForCPEntryInRange - see if the currently referenced CPE is in range;
|
|
|
|
/// if not, see if an in-range clone of the CPE is in range, and if so,
|
|
|
|
/// change the data structures so the user references the clone. Returns:
|
|
|
|
/// 0 = no existing entry found
|
|
|
|
/// 1 = entry found, and there were no code insertions or deletions
|
|
|
|
/// 2 = entry found, and there were code insertions or deletions
|
|
|
|
int MipsConstantIslands::findInRangeCPEntry(CPUser& U, unsigned UserOffset)
|
|
|
|
{
|
|
|
|
MachineInstr *UserMI = U.MI;
|
|
|
|
MachineInstr *CPEMI = U.CPEMI;
|
|
|
|
|
|
|
|
// Check to see if the CPE is already in-range.
|
|
|
|
if (isCPEntryInRange(UserMI, UserOffset, CPEMI, U.getMaxDisp(), U.NegOk,
|
|
|
|
true)) {
|
|
|
|
DEBUG(dbgs() << "In range\n");
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
// No. Look for previously created clones of the CPE that are in range.
|
|
|
|
unsigned CPI = CPEMI->getOperand(1).getIndex();
|
|
|
|
std::vector<CPEntry> &CPEs = CPEntries[CPI];
|
|
|
|
for (unsigned i = 0, e = CPEs.size(); i != e; ++i) {
|
|
|
|
// We already tried this one
|
|
|
|
if (CPEs[i].CPEMI == CPEMI)
|
|
|
|
continue;
|
|
|
|
// Removing CPEs can leave empty entries, skip
|
2014-04-25 13:30:21 +08:00
|
|
|
if (CPEs[i].CPEMI == nullptr)
|
2013-11-05 16:14:14 +08:00
|
|
|
continue;
|
|
|
|
if (isCPEntryInRange(UserMI, UserOffset, CPEs[i].CPEMI, U.getMaxDisp(),
|
|
|
|
U.NegOk)) {
|
|
|
|
DEBUG(dbgs() << "Replacing CPE#" << CPI << " with CPE#"
|
|
|
|
<< CPEs[i].CPI << "\n");
|
|
|
|
// Point the CPUser node to the replacement
|
|
|
|
U.CPEMI = CPEs[i].CPEMI;
|
|
|
|
// Change the CPI in the instruction operand to refer to the clone.
|
|
|
|
for (unsigned j = 0, e = UserMI->getNumOperands(); j != e; ++j)
|
|
|
|
if (UserMI->getOperand(j).isCPI()) {
|
|
|
|
UserMI->getOperand(j).setIndex(CPEs[i].CPI);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
// Adjust the refcount of the clone...
|
|
|
|
CPEs[i].RefCount++;
|
|
|
|
// ...and the original. If we didn't remove the old entry, none of the
|
|
|
|
// addresses changed, so we don't need another pass.
|
|
|
|
return decrementCPEReferenceCount(CPI, CPEMI) ? 2 : 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// LookForCPEntryInRange - see if the currently referenced CPE is in range;
|
|
|
|
/// This version checks if the longer form of the instruction can be used to
|
|
|
|
/// to satisfy things.
|
|
|
|
/// if not, see if an in-range clone of the CPE is in range, and if so,
|
|
|
|
/// change the data structures so the user references the clone. Returns:
|
|
|
|
/// 0 = no existing entry found
|
|
|
|
/// 1 = entry found, and there were no code insertions or deletions
|
|
|
|
/// 2 = entry found, and there were code insertions or deletions
|
|
|
|
int MipsConstantIslands::findLongFormInRangeCPEntry
|
|
|
|
(CPUser& U, unsigned UserOffset)
|
|
|
|
{
|
|
|
|
MachineInstr *UserMI = U.MI;
|
|
|
|
MachineInstr *CPEMI = U.CPEMI;
|
|
|
|
|
|
|
|
// Check to see if the CPE is already in-range.
|
|
|
|
if (isCPEntryInRange(UserMI, UserOffset, CPEMI,
|
|
|
|
U.getLongFormMaxDisp(), U.NegOk,
|
|
|
|
true)) {
|
|
|
|
DEBUG(dbgs() << "In range\n");
|
|
|
|
UserMI->setDesc(TII->get(U.getLongFormOpcode()));
|
2013-11-10 08:09:26 +08:00
|
|
|
U.setMaxDisp(U.getLongFormMaxDisp());
|
2013-11-05 16:14:14 +08:00
|
|
|
return 2; // instruction is longer length now
|
|
|
|
}
|
|
|
|
|
|
|
|
// No. Look for previously created clones of the CPE that are in range.
|
|
|
|
unsigned CPI = CPEMI->getOperand(1).getIndex();
|
|
|
|
std::vector<CPEntry> &CPEs = CPEntries[CPI];
|
|
|
|
for (unsigned i = 0, e = CPEs.size(); i != e; ++i) {
|
|
|
|
// We already tried this one
|
|
|
|
if (CPEs[i].CPEMI == CPEMI)
|
|
|
|
continue;
|
|
|
|
// Removing CPEs can leave empty entries, skip
|
2014-04-25 13:30:21 +08:00
|
|
|
if (CPEs[i].CPEMI == nullptr)
|
2013-11-05 16:14:14 +08:00
|
|
|
continue;
|
|
|
|
if (isCPEntryInRange(UserMI, UserOffset, CPEs[i].CPEMI,
|
|
|
|
U.getLongFormMaxDisp(), U.NegOk)) {
|
|
|
|
DEBUG(dbgs() << "Replacing CPE#" << CPI << " with CPE#"
|
|
|
|
<< CPEs[i].CPI << "\n");
|
|
|
|
// Point the CPUser node to the replacement
|
|
|
|
U.CPEMI = CPEs[i].CPEMI;
|
|
|
|
// Change the CPI in the instruction operand to refer to the clone.
|
|
|
|
for (unsigned j = 0, e = UserMI->getNumOperands(); j != e; ++j)
|
|
|
|
if (UserMI->getOperand(j).isCPI()) {
|
|
|
|
UserMI->getOperand(j).setIndex(CPEs[i].CPI);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
// Adjust the refcount of the clone...
|
|
|
|
CPEs[i].RefCount++;
|
|
|
|
// ...and the original. If we didn't remove the old entry, none of the
|
|
|
|
// addresses changed, so we don't need another pass.
|
|
|
|
return decrementCPEReferenceCount(CPI, CPEMI) ? 2 : 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getUnconditionalBrDisp - Returns the maximum displacement that can fit in
|
|
|
|
/// the specific unconditional branch instruction.
|
|
|
|
static inline unsigned getUnconditionalBrDisp(int Opc) {
|
|
|
|
switch (Opc) {
|
2013-11-12 10:27:12 +08:00
|
|
|
case Mips::Bimm16:
|
|
|
|
return ((1<<10)-1)*2;
|
2013-11-05 16:14:14 +08:00
|
|
|
case Mips::BimmX16:
|
|
|
|
return ((1<<16)-1)*2;
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return ((1<<16)-1)*2;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// findAvailableWater - Look for an existing entry in the WaterList in which
|
|
|
|
/// we can place the CPE referenced from U so it's within range of U's MI.
|
|
|
|
/// Returns true if found, false if not. If it returns true, WaterIter
|
2013-11-05 20:04:37 +08:00
|
|
|
/// is set to the WaterList entry.
|
|
|
|
/// To ensure that this pass
|
2013-11-05 16:14:14 +08:00
|
|
|
/// terminates, the CPE location for a particular CPUser is only allowed to
|
|
|
|
/// move to a lower address, so search backward from the end of the list and
|
|
|
|
/// prefer the first water that is in range.
|
|
|
|
bool MipsConstantIslands::findAvailableWater(CPUser &U, unsigned UserOffset,
|
|
|
|
water_iterator &WaterIter) {
|
|
|
|
if (WaterList.empty())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
unsigned BestGrowth = ~0u;
|
2014-03-02 20:27:27 +08:00
|
|
|
for (water_iterator IP = std::prev(WaterList.end()), B = WaterList.begin();;
|
2013-11-05 16:14:14 +08:00
|
|
|
--IP) {
|
|
|
|
MachineBasicBlock* WaterBB = *IP;
|
|
|
|
// Check if water is in range and is either at a lower address than the
|
|
|
|
// current "high water mark" or a new water block that was created since
|
|
|
|
// the previous iteration by inserting an unconditional branch. In the
|
|
|
|
// latter case, we want to allow resetting the high water mark back to
|
|
|
|
// this new water since we haven't seen it before. Inserting branches
|
|
|
|
// should be relatively uncommon and when it does happen, we want to be
|
|
|
|
// sure to take advantage of it for all the CPEs near that block, so that
|
|
|
|
// we don't insert more branches than necessary.
|
|
|
|
unsigned Growth;
|
|
|
|
if (isWaterInRange(UserOffset, WaterBB, U, Growth) &&
|
|
|
|
(WaterBB->getNumber() < U.HighWaterMark->getNumber() ||
|
|
|
|
NewWaterList.count(WaterBB)) && Growth < BestGrowth) {
|
|
|
|
// This is the least amount of required padding seen so far.
|
|
|
|
BestGrowth = Growth;
|
|
|
|
WaterIter = IP;
|
|
|
|
DEBUG(dbgs() << "Found water after BB#" << WaterBB->getNumber()
|
|
|
|
<< " Growth=" << Growth << '\n');
|
|
|
|
|
|
|
|
// Keep looking unless it is perfect.
|
|
|
|
if (BestGrowth == 0)
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
if (IP == B)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return BestGrowth != ~0u;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// createNewWater - No existing WaterList entry will work for
|
|
|
|
/// CPUsers[CPUserIndex], so create a place to put the CPE. The end of the
|
|
|
|
/// block is used if in range, and the conditional branch munged so control
|
|
|
|
/// flow is correct. Otherwise the block is split to create a hole with an
|
|
|
|
/// unconditional branch around it. In either case NewMBB is set to a
|
|
|
|
/// block following which the new island can be inserted (the WaterList
|
|
|
|
/// is not adjusted).
|
|
|
|
void MipsConstantIslands::createNewWater(unsigned CPUserIndex,
|
|
|
|
unsigned UserOffset,
|
|
|
|
MachineBasicBlock *&NewMBB) {
|
|
|
|
CPUser &U = CPUsers[CPUserIndex];
|
|
|
|
MachineInstr *UserMI = U.MI;
|
|
|
|
MachineInstr *CPEMI = U.CPEMI;
|
2016-07-16 07:09:47 +08:00
|
|
|
unsigned CPELogAlign = getCPELogAlign(*CPEMI);
|
2013-11-05 16:14:14 +08:00
|
|
|
MachineBasicBlock *UserMBB = UserMI->getParent();
|
|
|
|
const BasicBlockInfo &UserBBI = BBInfo[UserMBB->getNumber()];
|
|
|
|
|
|
|
|
// If the block does not end in an unconditional branch already, and if the
|
2013-11-05 20:04:37 +08:00
|
|
|
// end of the block is within range, make new water there.
|
2013-11-05 16:14:14 +08:00
|
|
|
if (BBHasFallthrough(UserMBB)) {
|
|
|
|
// Size of branch to insert.
|
|
|
|
unsigned Delta = 2;
|
|
|
|
// Compute the offset where the CPE will begin.
|
|
|
|
unsigned CPEOffset = UserBBI.postOffset(CPELogAlign) + Delta;
|
|
|
|
|
|
|
|
if (isOffsetInRange(UserOffset, CPEOffset, U)) {
|
|
|
|
DEBUG(dbgs() << "Split at end of BB#" << UserMBB->getNumber()
|
|
|
|
<< format(", expected CPE offset %#x\n", CPEOffset));
|
2015-10-20 08:15:20 +08:00
|
|
|
NewMBB = &*++UserMBB->getIterator();
|
2013-11-05 16:14:14 +08:00
|
|
|
// Add an unconditional branch from UserMBB to fallthrough block. Record
|
|
|
|
// it for branch lengthening; this new branch will not get out of range,
|
|
|
|
// but if the preceding conditional branch is out of range, the targets
|
|
|
|
// will be exchanged, and the altered branch may be out of range, so the
|
|
|
|
// machinery has to know about it.
|
2013-11-12 10:27:12 +08:00
|
|
|
int UncondBr = Mips::Bimm16;
|
2013-11-05 16:14:14 +08:00
|
|
|
BuildMI(UserMBB, DebugLoc(), TII->get(UncondBr)).addMBB(NewMBB);
|
|
|
|
unsigned MaxDisp = getUnconditionalBrDisp(UncondBr);
|
|
|
|
ImmBranches.push_back(ImmBranch(&UserMBB->back(),
|
|
|
|
MaxDisp, false, UncondBr));
|
|
|
|
BBInfo[UserMBB->getNumber()].Size += Delta;
|
|
|
|
adjustBBOffsetsAfter(UserMBB);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-11-05 20:04:37 +08:00
|
|
|
// What a big block. Find a place within the block to split it.
|
2013-11-05 16:14:14 +08:00
|
|
|
|
|
|
|
// Try to split the block so it's fully aligned. Compute the latest split
|
|
|
|
// point where we can add a 4-byte branch instruction, and then align to
|
|
|
|
// LogAlign which is the largest possible alignment in the function.
|
|
|
|
unsigned LogAlign = MF->getAlignment();
|
|
|
|
assert(LogAlign >= CPELogAlign && "Over-aligned constant pool entry");
|
2013-11-06 07:36:58 +08:00
|
|
|
unsigned BaseInsertOffset = UserOffset + U.getMaxDisp();
|
2013-11-05 16:14:14 +08:00
|
|
|
DEBUG(dbgs() << format("Split in middle of big block before %#x",
|
|
|
|
BaseInsertOffset));
|
|
|
|
|
|
|
|
// The 4 in the following is for the unconditional branch we'll be inserting
|
2013-11-05 20:04:37 +08:00
|
|
|
// Alignment of the island is handled
|
2013-11-05 16:14:14 +08:00
|
|
|
// inside isOffsetInRange.
|
|
|
|
BaseInsertOffset -= 4;
|
|
|
|
|
|
|
|
DEBUG(dbgs() << format(", adjusted to %#x", BaseInsertOffset)
|
2013-11-06 07:36:58 +08:00
|
|
|
<< " la=" << LogAlign << '\n');
|
2013-11-05 16:14:14 +08:00
|
|
|
|
|
|
|
// This could point off the end of the block if we've already got constant
|
|
|
|
// pool entries following this block; only the last one is in the water list.
|
|
|
|
// Back past any possible branches (allow for a conditional and a maximally
|
|
|
|
// long unconditional).
|
|
|
|
if (BaseInsertOffset + 8 >= UserBBI.postOffset()) {
|
2013-11-06 07:36:58 +08:00
|
|
|
BaseInsertOffset = UserBBI.postOffset() - 8;
|
2013-11-05 16:14:14 +08:00
|
|
|
DEBUG(dbgs() << format("Move inside block: %#x\n", BaseInsertOffset));
|
|
|
|
}
|
2013-11-06 07:36:58 +08:00
|
|
|
unsigned EndInsertOffset = BaseInsertOffset + 4 +
|
2013-11-05 16:14:14 +08:00
|
|
|
CPEMI->getOperand(2).getImm();
|
|
|
|
MachineBasicBlock::iterator MI = UserMI;
|
|
|
|
++MI;
|
|
|
|
unsigned CPUIndex = CPUserIndex+1;
|
|
|
|
unsigned NumCPUsers = CPUsers.size();
|
|
|
|
//MachineInstr *LastIT = 0;
|
2016-07-29 00:32:22 +08:00
|
|
|
for (unsigned Offset = UserOffset + TII->getInstSizeInBytes(*UserMI);
|
2013-11-05 16:14:14 +08:00
|
|
|
Offset < BaseInsertOffset;
|
2016-07-29 00:32:22 +08:00
|
|
|
Offset += TII->getInstSizeInBytes(*MI), MI = std::next(MI)) {
|
2013-11-05 16:14:14 +08:00
|
|
|
assert(MI != UserMBB->end() && "Fell off end of block");
|
ADT: Remove all ilist_iterator => pointer casts, NFC
Remove all ilist_iterator to pointer casts. There were two reasons for
casts:
- Checking for an uninitialized (i.e., null) iterator. I added
MachineInstrBundleIterator::isValid() to check for that case.
- Comparing an iterator against the underlying pointer value while
avoiding converting the pointer value to an iterator. This is
occasionally necessary in MachineInstrBundleIterator, since there is
an assertion in the constructors that the underlying MachineInstr is
not bundled (but we don't care about that if we're just checking for
pointer equality).
To support the latter case, I rewrote the == and != operators for
ilist_iterator and MachineInstrBundleIterator.
- The implicit constructors now use enable_if to exclude
const-iterator => non-const-iterator conversions from overload
resolution (previously it was a compiler error on instantiation, now
it's SFINAE).
- The == and != operators are now global (friends), and are not
templated.
- MachineInstrBundleIterator has overloads to compare against both
const_pointer and const_reference. This avoids the implicit
conversions to MachineInstrBundleIterator that assert, instead just
checking the address (and I added unit tests to confirm this).
Notably, the only remaining uses of ilist_iterator::getNodePtrUnchecked
are in ilist.h, and no code outside of ilist*.h directly relies on this
UB end-iterator-to-pointer conversion anymore. It's still needed for
ilist_*sentinel_traits, but I'll clean that up soon.
llvm-svn: 278478
2016-08-12 13:05:36 +08:00
|
|
|
if (CPUIndex < NumCPUsers && CPUsers[CPUIndex].MI == MI) {
|
2013-11-05 16:14:14 +08:00
|
|
|
CPUser &U = CPUsers[CPUIndex];
|
|
|
|
if (!isOffsetInRange(Offset, EndInsertOffset, U)) {
|
|
|
|
// Shift intertion point by one unit of alignment so it is within reach.
|
|
|
|
BaseInsertOffset -= 1u << LogAlign;
|
|
|
|
EndInsertOffset -= 1u << LogAlign;
|
|
|
|
}
|
|
|
|
// This is overly conservative, as we don't account for CPEMIs being
|
|
|
|
// reused within the block, but it doesn't matter much. Also assume CPEs
|
|
|
|
// are added in order with alignment padding. We may eventually be able
|
|
|
|
// to pack the aligned CPEs better.
|
|
|
|
EndInsertOffset += U.CPEMI->getOperand(2).getImm();
|
|
|
|
CPUIndex++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-07-16 07:09:47 +08:00
|
|
|
NewMBB = splitBlockBeforeInstr(*--MI);
|
2013-11-05 16:14:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/// handleConstantPoolUser - Analyze the specified user, checking to see if it
|
|
|
|
/// is out-of-range. If so, pick up the constant pool value and move it some
|
|
|
|
/// place in-range. Return true if we changed any addresses (thus must run
|
|
|
|
/// another pass of branch lengthening), false otherwise.
|
|
|
|
bool MipsConstantIslands::handleConstantPoolUser(unsigned CPUserIndex) {
|
|
|
|
CPUser &U = CPUsers[CPUserIndex];
|
|
|
|
MachineInstr *UserMI = U.MI;
|
|
|
|
MachineInstr *CPEMI = U.CPEMI;
|
|
|
|
unsigned CPI = CPEMI->getOperand(1).getIndex();
|
|
|
|
unsigned Size = CPEMI->getOperand(2).getImm();
|
|
|
|
// Compute this only once, it's expensive.
|
|
|
|
unsigned UserOffset = getUserOffset(U);
|
|
|
|
|
|
|
|
// See if the current entry is within range, or there is a clone of it
|
|
|
|
// in range.
|
|
|
|
int result = findInRangeCPEntry(U, UserOffset);
|
|
|
|
if (result==1) return false;
|
|
|
|
else if (result==2) return true;
|
|
|
|
|
|
|
|
// Look for water where we can place this CPE.
|
|
|
|
MachineBasicBlock *NewIsland = MF->CreateMachineBasicBlock();
|
|
|
|
MachineBasicBlock *NewMBB;
|
|
|
|
water_iterator IP;
|
|
|
|
if (findAvailableWater(U, UserOffset, IP)) {
|
|
|
|
DEBUG(dbgs() << "Found water in range\n");
|
|
|
|
MachineBasicBlock *WaterBB = *IP;
|
|
|
|
|
|
|
|
// If the original WaterList entry was "new water" on this iteration,
|
|
|
|
// propagate that to the new island. This is just keeping NewWaterList
|
|
|
|
// updated to match the WaterList, which will be updated below.
|
|
|
|
if (NewWaterList.erase(WaterBB))
|
|
|
|
NewWaterList.insert(NewIsland);
|
|
|
|
|
|
|
|
// The new CPE goes before the following block (NewMBB).
|
2015-10-20 08:15:20 +08:00
|
|
|
NewMBB = &*++WaterBB->getIterator();
|
2013-11-05 16:14:14 +08:00
|
|
|
} else {
|
|
|
|
// No water found.
|
|
|
|
// we first see if a longer form of the instrucion could have reached
|
|
|
|
// the constant. in that case we won't bother to split
|
2013-11-10 08:09:26 +08:00
|
|
|
if (!NoLoadRelaxation) {
|
|
|
|
result = findLongFormInRangeCPEntry(U, UserOffset);
|
|
|
|
if (result != 0) return true;
|
|
|
|
}
|
2013-11-05 16:14:14 +08:00
|
|
|
DEBUG(dbgs() << "No water found\n");
|
|
|
|
createNewWater(CPUserIndex, UserOffset, NewMBB);
|
|
|
|
|
|
|
|
// splitBlockBeforeInstr adds to WaterList, which is important when it is
|
|
|
|
// called while handling branches so that the water will be seen on the
|
|
|
|
// next iteration for constant pools, but in this context, we don't want
|
|
|
|
// it. Check for this so it will be removed from the WaterList.
|
|
|
|
// Also remove any entry from NewWaterList.
|
2015-10-20 08:15:20 +08:00
|
|
|
MachineBasicBlock *WaterBB = &*--NewMBB->getIterator();
|
2017-01-31 07:21:32 +08:00
|
|
|
IP = llvm::find(WaterList, WaterBB);
|
2013-11-05 16:14:14 +08:00
|
|
|
if (IP != WaterList.end())
|
|
|
|
NewWaterList.erase(WaterBB);
|
|
|
|
|
|
|
|
// We are adding new water. Update NewWaterList.
|
|
|
|
NewWaterList.insert(NewIsland);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Remove the original WaterList entry; we want subsequent insertions in
|
|
|
|
// this vicinity to go after the one we're about to insert. This
|
|
|
|
// considerably reduces the number of times we have to move the same CPE
|
|
|
|
// more than once and is also important to ensure the algorithm terminates.
|
|
|
|
if (IP != WaterList.end())
|
|
|
|
WaterList.erase(IP);
|
|
|
|
|
|
|
|
// Okay, we know we can put an island before NewMBB now, do it!
|
2015-10-20 08:15:20 +08:00
|
|
|
MF->insert(NewMBB->getIterator(), NewIsland);
|
2013-11-05 16:14:14 +08:00
|
|
|
|
|
|
|
// Update internal data structures to account for the newly inserted MBB.
|
|
|
|
updateForInsertedWaterBlock(NewIsland);
|
|
|
|
|
|
|
|
// Decrement the old entry, and remove it if refcount becomes 0.
|
|
|
|
decrementCPEReferenceCount(CPI, CPEMI);
|
|
|
|
|
2013-11-24 10:53:09 +08:00
|
|
|
// No existing clone of this CPE is within range.
|
|
|
|
// We will be generating a new clone. Get a UID for it.
|
|
|
|
unsigned ID = createPICLabelUId();
|
|
|
|
|
2013-11-05 16:14:14 +08:00
|
|
|
// Now that we have an island to add the CPE to, clone the original CPE and
|
|
|
|
// add it to the island.
|
|
|
|
U.HighWaterMark = NewIsland;
|
|
|
|
U.CPEMI = BuildMI(NewIsland, DebugLoc(), TII->get(Mips::CONSTPOOL_ENTRY))
|
|
|
|
.addImm(ID).addConstantPoolIndex(CPI).addImm(Size);
|
|
|
|
CPEntries[CPI].push_back(CPEntry(U.CPEMI, ID, 1));
|
|
|
|
++NumCPEs;
|
|
|
|
|
|
|
|
// Mark the basic block as aligned as required by the const-pool entry.
|
2016-07-16 07:09:47 +08:00
|
|
|
NewIsland->setAlignment(getCPELogAlign(*U.CPEMI));
|
2013-11-05 16:14:14 +08:00
|
|
|
|
|
|
|
// Increase the size of the island block to account for the new entry.
|
|
|
|
BBInfo[NewIsland->getNumber()].Size += Size;
|
2015-10-20 08:15:20 +08:00
|
|
|
adjustBBOffsetsAfter(&*--NewIsland->getIterator());
|
2013-11-05 16:14:14 +08:00
|
|
|
|
|
|
|
// Finally, change the CPI in the instruction operand to be ID.
|
|
|
|
for (unsigned i = 0, e = UserMI->getNumOperands(); i != e; ++i)
|
|
|
|
if (UserMI->getOperand(i).isCPI()) {
|
|
|
|
UserMI->getOperand(i).setIndex(ID);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
DEBUG(dbgs() << " Moved CPE to #" << ID << " CPI=" << CPI
|
|
|
|
<< format(" offset=%#x\n", BBInfo[NewIsland->getNumber()].Offset));
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// removeDeadCPEMI - Remove a dead constant pool entry instruction. Update
|
|
|
|
/// sizes and offsets of impacted basic blocks.
|
|
|
|
void MipsConstantIslands::removeDeadCPEMI(MachineInstr *CPEMI) {
|
|
|
|
MachineBasicBlock *CPEBB = CPEMI->getParent();
|
|
|
|
unsigned Size = CPEMI->getOperand(2).getImm();
|
|
|
|
CPEMI->eraseFromParent();
|
|
|
|
BBInfo[CPEBB->getNumber()].Size -= Size;
|
|
|
|
// All succeeding offsets have the current size value added in, fix this.
|
|
|
|
if (CPEBB->empty()) {
|
|
|
|
BBInfo[CPEBB->getNumber()].Size = 0;
|
|
|
|
|
|
|
|
// This block no longer needs to be aligned.
|
|
|
|
CPEBB->setAlignment(0);
|
|
|
|
} else
|
|
|
|
// Entries are sorted by descending alignment, so realign from the front.
|
2016-07-16 07:09:47 +08:00
|
|
|
CPEBB->setAlignment(getCPELogAlign(*CPEBB->begin()));
|
2013-11-05 16:14:14 +08:00
|
|
|
|
|
|
|
adjustBBOffsetsAfter(CPEBB);
|
|
|
|
// An island has only one predecessor BB and one successor BB. Check if
|
|
|
|
// this BB's predecessor jumps directly to this BB's successor. This
|
|
|
|
// shouldn't happen currently.
|
|
|
|
assert(!BBIsJumpedOver(CPEBB) && "How did this happen?");
|
|
|
|
// FIXME: remove the empty blocks after all the work is done?
|
|
|
|
}
|
|
|
|
|
|
|
|
/// removeUnusedCPEntries - Remove constant pool entries whose refcounts
|
|
|
|
/// are zero.
|
|
|
|
bool MipsConstantIslands::removeUnusedCPEntries() {
|
|
|
|
unsigned MadeChange = false;
|
|
|
|
for (unsigned i = 0, e = CPEntries.size(); i != e; ++i) {
|
|
|
|
std::vector<CPEntry> &CPEs = CPEntries[i];
|
|
|
|
for (unsigned j = 0, ee = CPEs.size(); j != ee; ++j) {
|
|
|
|
if (CPEs[j].RefCount == 0 && CPEs[j].CPEMI) {
|
|
|
|
removeDeadCPEMI(CPEs[j].CPEMI);
|
2014-04-25 13:30:21 +08:00
|
|
|
CPEs[j].CPEMI = nullptr;
|
2013-11-05 16:14:14 +08:00
|
|
|
MadeChange = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return MadeChange;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// isBBInRange - Returns true if the distance between specific MI and
|
|
|
|
/// specific BB can fit in MI's displacement field.
|
|
|
|
bool MipsConstantIslands::isBBInRange
|
|
|
|
(MachineInstr *MI,MachineBasicBlock *DestBB, unsigned MaxDisp) {
|
2017-01-31 07:21:32 +08:00
|
|
|
unsigned PCAdj = 4;
|
2013-11-05 16:14:14 +08:00
|
|
|
unsigned BrOffset = getOffsetOf(MI) + PCAdj;
|
|
|
|
unsigned DestOffset = BBInfo[DestBB->getNumber()].Offset;
|
|
|
|
|
|
|
|
DEBUG(dbgs() << "Branch of destination BB#" << DestBB->getNumber()
|
|
|
|
<< " from BB#" << MI->getParent()->getNumber()
|
|
|
|
<< " max delta=" << MaxDisp
|
|
|
|
<< " from " << getOffsetOf(MI) << " to " << DestOffset
|
|
|
|
<< " offset " << int(DestOffset-BrOffset) << "\t" << *MI);
|
|
|
|
|
|
|
|
if (BrOffset <= DestOffset) {
|
|
|
|
// Branch before the Dest.
|
|
|
|
if (DestOffset-BrOffset <= MaxDisp)
|
|
|
|
return true;
|
|
|
|
} else {
|
|
|
|
if (BrOffset-DestOffset <= MaxDisp)
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// fixupImmediateBr - Fix up an immediate branch whose destination is too far
|
|
|
|
/// away to fit in its displacement field.
|
|
|
|
bool MipsConstantIslands::fixupImmediateBr(ImmBranch &Br) {
|
|
|
|
MachineInstr *MI = Br.MI;
|
2013-11-28 08:56:37 +08:00
|
|
|
unsigned TargetOperand = branchTargetOperand(MI);
|
|
|
|
MachineBasicBlock *DestBB = MI->getOperand(TargetOperand).getMBB();
|
2013-11-05 16:14:14 +08:00
|
|
|
|
|
|
|
// Check to see if the DestBB is already in-range.
|
|
|
|
if (isBBInRange(MI, DestBB, Br.MaxDisp))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!Br.isCond)
|
|
|
|
return fixupUnconditionalBr(Br);
|
|
|
|
return fixupConditionalBr(Br);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// fixupUnconditionalBr - Fix up an unconditional branch whose destination is
|
|
|
|
/// too far away to fit in its displacement field. If the LR register has been
|
|
|
|
/// spilled in the epilogue, then we can use BL to implement a far jump.
|
|
|
|
/// Otherwise, add an intermediate branch instruction to a branch.
|
|
|
|
bool
|
|
|
|
MipsConstantIslands::fixupUnconditionalBr(ImmBranch &Br) {
|
|
|
|
MachineInstr *MI = Br.MI;
|
|
|
|
MachineBasicBlock *MBB = MI->getParent();
|
2013-11-21 13:13:23 +08:00
|
|
|
MachineBasicBlock *DestBB = MI->getOperand(0).getMBB();
|
2013-11-05 16:14:14 +08:00
|
|
|
// Use BL to implement far jump.
|
2013-11-21 13:13:23 +08:00
|
|
|
unsigned BimmX16MaxDisp = ((1 << 16)-1) * 2;
|
|
|
|
if (isBBInRange(MI, DestBB, BimmX16MaxDisp)) {
|
|
|
|
Br.MaxDisp = BimmX16MaxDisp;
|
|
|
|
MI->setDesc(TII->get(Mips::BimmX16));
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
// need to give the math a more careful look here
|
|
|
|
// this is really a segment address and not
|
|
|
|
// a PC relative address. FIXME. But I think that
|
|
|
|
// just reducing the bits by 1 as I've done is correct.
|
|
|
|
// The basic block we are branching too much be longword aligned.
|
|
|
|
// we know that RA is saved because we always save it right now.
|
|
|
|
// this requirement will be relaxed later but we also have an alternate
|
|
|
|
// way to implement this that I will implement that does not need jal.
|
|
|
|
// We should have a way to back out this alignment restriction if we "can" later.
|
|
|
|
// but it is not harmful.
|
|
|
|
//
|
|
|
|
DestBB->setAlignment(2);
|
|
|
|
Br.MaxDisp = ((1<<24)-1) * 2;
|
2013-11-30 06:32:56 +08:00
|
|
|
MI->setDesc(TII->get(Mips::JalB16));
|
2013-11-21 13:13:23 +08:00
|
|
|
}
|
2013-11-05 16:14:14 +08:00
|
|
|
BBInfo[MBB->getNumber()].Size += 2;
|
|
|
|
adjustBBOffsetsAfter(MBB);
|
|
|
|
HasFarJump = true;
|
|
|
|
++NumUBrFixed;
|
|
|
|
|
|
|
|
DEBUG(dbgs() << " Changed B to long jump " << *MI);
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// fixupConditionalBr - Fix up a conditional branch whose destination is too
|
|
|
|
/// far away to fit in its displacement field. It is converted to an inverse
|
|
|
|
/// conditional branch + an unconditional branch to the destination.
|
|
|
|
bool
|
|
|
|
MipsConstantIslands::fixupConditionalBr(ImmBranch &Br) {
|
|
|
|
MachineInstr *MI = Br.MI;
|
2013-11-28 08:56:37 +08:00
|
|
|
unsigned TargetOperand = branchTargetOperand(MI);
|
|
|
|
MachineBasicBlock *DestBB = MI->getOperand(TargetOperand).getMBB();
|
|
|
|
unsigned Opcode = MI->getOpcode();
|
|
|
|
unsigned LongFormOpcode = longformBranchOpcode(Opcode);
|
|
|
|
unsigned LongFormMaxOff = branchMaxOffsets(LongFormOpcode);
|
|
|
|
|
|
|
|
// Check to see if the DestBB is already in-range.
|
|
|
|
if (isBBInRange(MI, DestBB, LongFormMaxOff)) {
|
|
|
|
Br.MaxDisp = LongFormMaxOff;
|
|
|
|
MI->setDesc(TII->get(LongFormOpcode));
|
|
|
|
return true;
|
|
|
|
}
|
2013-11-05 16:14:14 +08:00
|
|
|
|
|
|
|
// Add an unconditional branch to the destination and invert the branch
|
|
|
|
// condition to jump over it:
|
2013-11-30 06:32:56 +08:00
|
|
|
// bteqz L1
|
2013-11-05 16:14:14 +08:00
|
|
|
// =>
|
2013-11-30 06:32:56 +08:00
|
|
|
// bnez L2
|
2013-11-05 16:14:14 +08:00
|
|
|
// b L1
|
|
|
|
// L2:
|
|
|
|
|
|
|
|
// If the branch is at the end of its MBB and that has a fall-through block,
|
|
|
|
// direct the updated conditional branch to the fall-through block. Otherwise,
|
|
|
|
// split the MBB before the next instruction.
|
|
|
|
MachineBasicBlock *MBB = MI->getParent();
|
|
|
|
MachineInstr *BMI = &MBB->back();
|
|
|
|
bool NeedSplit = (BMI != MI) || !BBHasFallthrough(MBB);
|
2013-12-19 08:43:08 +08:00
|
|
|
unsigned OppositeBranchOpcode = TII->getOppositeBranchOpc(Opcode);
|
2013-11-30 06:32:56 +08:00
|
|
|
|
2013-11-05 16:14:14 +08:00
|
|
|
++NumCBrFixed;
|
|
|
|
if (BMI != MI) {
|
2014-03-02 20:27:27 +08:00
|
|
|
if (std::next(MachineBasicBlock::iterator(MI)) == std::prev(MBB->end()) &&
|
2016-05-06 21:23:51 +08:00
|
|
|
BMI->isUnconditionalBranch()) {
|
2013-11-05 16:14:14 +08:00
|
|
|
// Last MI in the BB is an unconditional branch. Can we simply invert the
|
|
|
|
// condition and swap destinations:
|
2013-11-30 06:32:56 +08:00
|
|
|
// beqz L1
|
2013-11-05 16:14:14 +08:00
|
|
|
// b L2
|
|
|
|
// =>
|
2013-11-30 06:32:56 +08:00
|
|
|
// bnez L2
|
2013-11-05 16:14:14 +08:00
|
|
|
// b L1
|
2013-11-30 06:32:56 +08:00
|
|
|
unsigned BMITargetOperand = branchTargetOperand(BMI);
|
|
|
|
MachineBasicBlock *NewDest =
|
|
|
|
BMI->getOperand(BMITargetOperand).getMBB();
|
2013-11-05 16:14:14 +08:00
|
|
|
if (isBBInRange(MI, NewDest, Br.MaxDisp)) {
|
|
|
|
DEBUG(dbgs() << " Invert Bcc condition and swap its destination with "
|
|
|
|
<< *BMI);
|
2013-12-04 07:42:51 +08:00
|
|
|
MI->setDesc(TII->get(OppositeBranchOpcode));
|
2013-11-30 06:32:56 +08:00
|
|
|
BMI->getOperand(BMITargetOperand).setMBB(DestBB);
|
|
|
|
MI->getOperand(TargetOperand).setMBB(NewDest);
|
2013-11-05 16:14:14 +08:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (NeedSplit) {
|
2016-07-16 07:09:47 +08:00
|
|
|
splitBlockBeforeInstr(*MI);
|
2013-11-05 16:14:14 +08:00
|
|
|
// No need for the branch to the next block. We're adding an unconditional
|
|
|
|
// branch to the destination.
|
2016-07-29 00:32:22 +08:00
|
|
|
int delta = TII->getInstSizeInBytes(MBB->back());
|
2013-11-05 16:14:14 +08:00
|
|
|
BBInfo[MBB->getNumber()].Size -= delta;
|
|
|
|
MBB->back().eraseFromParent();
|
|
|
|
// BBInfo[SplitBB].Offset is wrong temporarily, fixed below
|
|
|
|
}
|
2015-10-20 08:15:20 +08:00
|
|
|
MachineBasicBlock *NextBB = &*++MBB->getIterator();
|
2013-11-05 16:14:14 +08:00
|
|
|
|
|
|
|
DEBUG(dbgs() << " Insert B to BB#" << DestBB->getNumber()
|
|
|
|
<< " also invert condition and change dest. to BB#"
|
|
|
|
<< NextBB->getNumber() << "\n");
|
|
|
|
|
|
|
|
// Insert a new conditional branch and a new unconditional branch.
|
|
|
|
// Also update the ImmBranch as well as adding a new entry for the new branch.
|
2013-12-04 07:42:51 +08:00
|
|
|
if (MI->getNumExplicitOperands() == 2) {
|
|
|
|
BuildMI(MBB, DebugLoc(), TII->get(OppositeBranchOpcode))
|
|
|
|
.addReg(MI->getOperand(0).getReg())
|
|
|
|
.addMBB(NextBB);
|
2013-12-19 08:43:08 +08:00
|
|
|
} else {
|
|
|
|
BuildMI(MBB, DebugLoc(), TII->get(OppositeBranchOpcode))
|
|
|
|
.addMBB(NextBB);
|
2013-12-04 07:42:51 +08:00
|
|
|
}
|
2013-11-05 16:14:14 +08:00
|
|
|
Br.MI = &MBB->back();
|
2016-07-29 00:32:22 +08:00
|
|
|
BBInfo[MBB->getNumber()].Size += TII->getInstSizeInBytes(MBB->back());
|
2013-11-05 16:14:14 +08:00
|
|
|
BuildMI(MBB, DebugLoc(), TII->get(Br.UncondBr)).addMBB(DestBB);
|
2016-07-29 00:32:22 +08:00
|
|
|
BBInfo[MBB->getNumber()].Size += TII->getInstSizeInBytes(MBB->back());
|
2013-11-05 16:14:14 +08:00
|
|
|
unsigned MaxDisp = getUnconditionalBrDisp(Br.UncondBr);
|
|
|
|
ImmBranches.push_back(ImmBranch(&MBB->back(), MaxDisp, false, Br.UncondBr));
|
|
|
|
|
|
|
|
// Remove the old conditional branch. It may or may not still be in MBB.
|
2016-07-29 00:32:22 +08:00
|
|
|
BBInfo[MI->getParent()->getNumber()].Size -= TII->getInstSizeInBytes(*MI);
|
2013-11-05 16:14:14 +08:00
|
|
|
MI->eraseFromParent();
|
|
|
|
adjustBBOffsetsAfter(MBB);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2013-10-28 05:57:36 +08:00
|
|
|
void MipsConstantIslands::prescanForConstants() {
|
2013-11-05 16:14:14 +08:00
|
|
|
unsigned J = 0;
|
|
|
|
(void)J;
|
2013-10-28 05:57:36 +08:00
|
|
|
for (MachineFunction::iterator B =
|
|
|
|
MF->begin(), E = MF->end(); B != E; ++B) {
|
|
|
|
for (MachineBasicBlock::instr_iterator I =
|
|
|
|
B->instr_begin(), EB = B->instr_end(); I != EB; ++I) {
|
|
|
|
switch(I->getDesc().getOpcode()) {
|
|
|
|
case Mips::LwConstant32: {
|
2013-11-24 14:18:50 +08:00
|
|
|
PrescannedForConstants = true;
|
2013-10-28 05:57:36 +08:00
|
|
|
DEBUG(dbgs() << "constant island constant " << *I << "\n");
|
|
|
|
J = I->getNumOperands();
|
2017-01-31 07:21:32 +08:00
|
|
|
DEBUG(dbgs() << "num operands " << J << "\n");
|
2013-10-28 05:57:36 +08:00
|
|
|
MachineOperand& Literal = I->getOperand(1);
|
|
|
|
if (Literal.isImm()) {
|
|
|
|
int64_t V = Literal.getImm();
|
2017-01-31 07:21:32 +08:00
|
|
|
DEBUG(dbgs() << "literal " << V << "\n");
|
2013-10-28 05:57:36 +08:00
|
|
|
Type *Int32Ty =
|
|
|
|
Type::getInt32Ty(MF->getFunction()->getContext());
|
|
|
|
const Constant *C = ConstantInt::get(Int32Ty, V);
|
|
|
|
unsigned index = MCP->getConstantPoolIndex(C, 4);
|
|
|
|
I->getOperand(2).ChangeToImmediate(index);
|
|
|
|
DEBUG(dbgs() << "constant island constant " << *I << "\n");
|
2013-11-05 16:14:14 +08:00
|
|
|
I->setDesc(TII->get(Mips::LwRxPcTcp16));
|
2013-10-28 05:57:36 +08:00
|
|
|
I->RemoveOperand(1);
|
|
|
|
I->RemoveOperand(1);
|
|
|
|
I->addOperand(MachineOperand::CreateCPI(index, 0));
|
2013-11-05 16:14:14 +08:00
|
|
|
I->addOperand(MachineOperand::CreateImm(4));
|
2013-10-28 05:57:36 +08:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2017-01-31 07:21:32 +08:00
|
|
|
|
|
|
|
/// Returns a pass that converts branches to long branches.
|
|
|
|
FunctionPass *llvm::createMipsConstantIslandPass() {
|
|
|
|
return new MipsConstantIslands();
|
|
|
|
}
|