2012-02-18 20:03:15 +08:00
|
|
|
//===-- PPCBranchSelector.cpp - Emit long conditional branches ------------===//
|
2005-04-22 07:30:14 +08:00
|
|
|
//
|
2019-01-19 16:50:56 +08:00
|
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
2005-04-22 07:30:14 +08:00
|
|
|
//
|
2004-07-28 02:33:06 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2005-04-22 07:30:14 +08:00
|
|
|
// This file contains a pass that scans a machine function to determine which
|
2004-07-28 02:33:06 +08:00
|
|
|
// conditional branches need more than 16 bits of displacement to reach their
|
|
|
|
// target basic block. It does this in two passes; a calculation of basic block
|
2010-08-24 04:30:51 +08:00
|
|
|
// positions pass, and a branch pseudo op to machine branch opcode pass. This
|
2004-07-28 02:33:06 +08:00
|
|
|
// pass should be run last, just before the assembly printer.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2012-12-04 00:50:05 +08:00
|
|
|
#include "MCTargetDesc/PPCPredicates.h"
|
2017-06-06 19:49:48 +08:00
|
|
|
#include "PPC.h"
|
2005-10-15 07:45:43 +08:00
|
|
|
#include "PPCInstrBuilder.h"
|
2005-10-15 07:59:06 +08:00
|
|
|
#include "PPCInstrInfo.h"
|
2016-10-03 12:06:44 +08:00
|
|
|
#include "PPCSubtarget.h"
|
2006-11-17 02:13:49 +08:00
|
|
|
#include "llvm/ADT/Statistic.h"
|
2012-12-04 00:50:05 +08:00
|
|
|
#include "llvm/CodeGen/MachineFunctionPass.h"
|
2016-10-03 12:06:44 +08:00
|
|
|
#include "llvm/CodeGen/MachineRegisterInfo.h"
|
2017-11-17 09:07:10 +08:00
|
|
|
#include "llvm/CodeGen/TargetSubtargetInfo.h"
|
2006-11-18 08:32:03 +08:00
|
|
|
#include "llvm/Support/MathExtras.h"
|
2012-12-04 00:50:05 +08:00
|
|
|
#include "llvm/Target/TargetMachine.h"
|
2019-03-07 02:22:22 +08:00
|
|
|
#include <algorithm>
|
2004-07-28 02:33:06 +08:00
|
|
|
using namespace llvm;
|
|
|
|
|
2014-04-22 10:41:26 +08:00
|
|
|
#define DEBUG_TYPE "ppc-branch-select"
|
|
|
|
|
2006-12-20 06:59:26 +08:00
|
|
|
STATISTIC(NumExpanded, "Number of branches expanded to long format");
|
2006-11-17 02:13:49 +08:00
|
|
|
|
2004-07-28 02:33:06 +08:00
|
|
|
namespace {
|
2009-10-25 14:33:48 +08:00
|
|
|
struct PPCBSel : public MachineFunctionPass {
|
2007-05-03 09:11:54 +08:00
|
|
|
static char ID;
|
2013-02-14 01:40:07 +08:00
|
|
|
PPCBSel() : MachineFunctionPass(ID) {
|
|
|
|
initializePPCBSelPass(*PassRegistry::getPassRegistry());
|
|
|
|
}
|
2007-05-02 05:15:47 +08:00
|
|
|
|
2016-09-04 22:18:29 +08:00
|
|
|
// The sizes of the basic blocks in the function (the first
|
|
|
|
// element of the pair); the second element of the pair is the amount of the
|
|
|
|
// size that is due to potential padding.
|
|
|
|
std::vector<std::pair<unsigned, unsigned>> BlockSizes;
|
2004-07-28 02:33:06 +08:00
|
|
|
|
2019-03-27 05:27:38 +08:00
|
|
|
// The first block number which has imprecise instruction address.
|
|
|
|
int FirstImpreciseBlock = -1;
|
|
|
|
|
|
|
|
unsigned GetAlignmentAdjustment(MachineBasicBlock &MBB, unsigned Offset);
|
|
|
|
unsigned ComputeBlockSizes(MachineFunction &Fn);
|
|
|
|
void modifyAdjustment(MachineFunction &Fn);
|
|
|
|
int computeBranchSize(MachineFunction &Fn,
|
|
|
|
const MachineBasicBlock *Src,
|
|
|
|
const MachineBasicBlock *Dest,
|
|
|
|
unsigned BrOffset);
|
|
|
|
|
2014-04-29 15:57:37 +08:00
|
|
|
bool runOnMachineFunction(MachineFunction &Fn) override;
|
2004-07-28 02:33:06 +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
|
|
|
}
|
|
|
|
|
2016-10-01 10:56:57 +08:00
|
|
|
StringRef getPassName() const override { return "PowerPC Branch Selector"; }
|
2004-07-28 02:33:06 +08:00
|
|
|
};
|
2007-05-03 09:11:54 +08:00
|
|
|
char PPCBSel::ID = 0;
|
2015-06-23 17:49:53 +08:00
|
|
|
}
|
2004-07-28 02:33:06 +08:00
|
|
|
|
2013-02-14 01:40:07 +08:00
|
|
|
INITIALIZE_PASS(PPCBSel, "ppc-branch-select", "PowerPC Branch Selector",
|
|
|
|
false, false)
|
|
|
|
|
2004-07-28 02:33:06 +08:00
|
|
|
/// createPPCBranchSelectionPass - returns an instance of the Branch Selection
|
|
|
|
/// Pass
|
|
|
|
///
|
|
|
|
FunctionPass *llvm::createPPCBranchSelectionPass() {
|
2006-02-09 03:33:26 +08:00
|
|
|
return new PPCBSel();
|
|
|
|
}
|
|
|
|
|
2019-03-27 05:27:38 +08:00
|
|
|
/// In order to make MBB aligned, we need to add an adjustment value to the
|
|
|
|
/// original Offset.
|
|
|
|
unsigned PPCBSel::GetAlignmentAdjustment(MachineBasicBlock &MBB,
|
|
|
|
unsigned Offset) {
|
|
|
|
unsigned Align = MBB.getAlignment();
|
|
|
|
if (!Align)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
unsigned AlignAmt = 1 << Align;
|
|
|
|
unsigned ParentAlign = MBB.getParent()->getAlignment();
|
|
|
|
|
|
|
|
if (Align <= ParentAlign)
|
|
|
|
return OffsetToAlignment(Offset, AlignAmt);
|
|
|
|
|
|
|
|
// The alignment of this MBB is larger than the function's alignment, so we
|
|
|
|
// can't tell whether or not it will insert nops. Assume that it will.
|
|
|
|
if (FirstImpreciseBlock < 0)
|
|
|
|
FirstImpreciseBlock = MBB.getNumber();
|
|
|
|
return AlignAmt + OffsetToAlignment(Offset, AlignAmt);
|
|
|
|
}
|
2015-01-03 22:58:25 +08:00
|
|
|
|
2019-03-27 05:27:38 +08:00
|
|
|
/// We need to be careful about the offset of the first block in the function
|
|
|
|
/// because it might not have the function's alignment. This happens because,
|
|
|
|
/// under the ELFv2 ABI, for functions which require a TOC pointer, we add a
|
|
|
|
/// two-instruction sequence to the start of the function.
|
|
|
|
/// Note: This needs to be synchronized with the check in
|
|
|
|
/// PPCLinuxAsmPrinter::EmitFunctionBodyStart.
|
|
|
|
static inline unsigned GetInitialOffset(MachineFunction &Fn) {
|
2016-10-03 12:06:44 +08:00
|
|
|
unsigned InitialOffset = 0;
|
|
|
|
if (Fn.getSubtarget<PPCSubtarget>().isELFv2ABI() &&
|
|
|
|
!Fn.getRegInfo().use_empty(PPC::X2))
|
|
|
|
InitialOffset = 8;
|
2019-03-27 05:27:38 +08:00
|
|
|
return InitialOffset;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Measure each MBB and compute a size for the entire function.
|
|
|
|
unsigned PPCBSel::ComputeBlockSizes(MachineFunction &Fn) {
|
|
|
|
const PPCInstrInfo *TII =
|
|
|
|
static_cast<const PPCInstrInfo *>(Fn.getSubtarget().getInstrInfo());
|
|
|
|
unsigned FuncSize = GetInitialOffset(Fn);
|
2016-10-03 12:06:44 +08:00
|
|
|
|
2006-02-09 03:33:26 +08:00
|
|
|
for (MachineFunction::iterator MFI = Fn.begin(), E = Fn.end(); MFI != E;
|
|
|
|
++MFI) {
|
2015-10-20 09:07:37 +08:00
|
|
|
MachineBasicBlock *MBB = &*MFI;
|
2006-11-18 08:32:03 +08:00
|
|
|
|
2015-01-03 22:58:25 +08:00
|
|
|
// The end of the previous block may have extra nops if this block has an
|
|
|
|
// alignment requirement.
|
|
|
|
if (MBB->getNumber() > 0) {
|
|
|
|
unsigned AlignExtra = GetAlignmentAdjustment(*MBB, FuncSize);
|
2016-09-04 22:18:29 +08:00
|
|
|
|
|
|
|
auto &BS = BlockSizes[MBB->getNumber()-1];
|
|
|
|
BS.first += AlignExtra;
|
|
|
|
BS.second = AlignExtra;
|
|
|
|
|
2015-01-03 22:58:25 +08:00
|
|
|
FuncSize += AlignExtra;
|
|
|
|
}
|
|
|
|
|
2006-11-18 08:32:03 +08:00
|
|
|
unsigned BlockSize = 0;
|
2019-03-07 02:22:22 +08:00
|
|
|
for (MachineInstr &MI : *MBB) {
|
2016-07-29 00:32:22 +08:00
|
|
|
BlockSize += TII->getInstSizeInBytes(MI);
|
2019-03-07 02:22:22 +08:00
|
|
|
if (MI.isInlineAsm() && (FirstImpreciseBlock < 0))
|
|
|
|
FirstImpreciseBlock = MBB->getNumber();
|
|
|
|
}
|
2016-06-30 08:01:54 +08:00
|
|
|
|
2016-09-04 22:18:29 +08:00
|
|
|
BlockSizes[MBB->getNumber()].first = BlockSize;
|
2006-11-18 08:32:03 +08:00
|
|
|
FuncSize += BlockSize;
|
2006-02-09 03:33:26 +08:00
|
|
|
}
|
2018-07-31 03:41:25 +08:00
|
|
|
|
2019-03-27 05:27:38 +08:00
|
|
|
return FuncSize;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Modify the basic block align adjustment.
|
|
|
|
void PPCBSel::modifyAdjustment(MachineFunction &Fn) {
|
|
|
|
unsigned Offset = GetInitialOffset(Fn);
|
|
|
|
for (MachineFunction::iterator MFI = Fn.begin(), E = Fn.end(); MFI != E;
|
|
|
|
++MFI) {
|
|
|
|
MachineBasicBlock *MBB = &*MFI;
|
|
|
|
|
|
|
|
if (MBB->getNumber() > 0) {
|
|
|
|
auto &BS = BlockSizes[MBB->getNumber()-1];
|
|
|
|
BS.first -= BS.second;
|
|
|
|
Offset -= BS.second;
|
|
|
|
|
|
|
|
unsigned AlignExtra = GetAlignmentAdjustment(*MBB, Offset);
|
|
|
|
|
|
|
|
BS.first += AlignExtra;
|
|
|
|
BS.second = AlignExtra;
|
|
|
|
|
|
|
|
Offset += AlignExtra;
|
|
|
|
}
|
|
|
|
|
|
|
|
Offset += BlockSizes[MBB->getNumber()].first;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Determine the offset from the branch in Src block to the Dest block.
|
|
|
|
/// BrOffset is the offset of the branch instruction inside Src block.
|
|
|
|
int PPCBSel::computeBranchSize(MachineFunction &Fn,
|
|
|
|
const MachineBasicBlock *Src,
|
|
|
|
const MachineBasicBlock *Dest,
|
|
|
|
unsigned BrOffset) {
|
|
|
|
int BranchSize;
|
|
|
|
unsigned MaxAlign = 2;
|
|
|
|
bool NeedExtraAdjustment = false;
|
|
|
|
if (Dest->getNumber() <= Src->getNumber()) {
|
|
|
|
// If this is a backwards branch, the delta is the offset from the
|
|
|
|
// start of this block to this branch, plus the sizes of all blocks
|
|
|
|
// from this block to the dest.
|
|
|
|
BranchSize = BrOffset;
|
|
|
|
MaxAlign = std::max(MaxAlign, Src->getAlignment());
|
|
|
|
|
|
|
|
int DestBlock = Dest->getNumber();
|
|
|
|
BranchSize += BlockSizes[DestBlock].first;
|
|
|
|
for (unsigned i = DestBlock+1, e = Src->getNumber(); i < e; ++i) {
|
|
|
|
BranchSize += BlockSizes[i].first;
|
|
|
|
MaxAlign = std::max(MaxAlign,
|
|
|
|
Fn.getBlockNumbered(i)->getAlignment());
|
|
|
|
}
|
|
|
|
|
|
|
|
NeedExtraAdjustment = (FirstImpreciseBlock >= 0) &&
|
|
|
|
(DestBlock >= FirstImpreciseBlock);
|
|
|
|
} else {
|
|
|
|
// Otherwise, add the size of the blocks between this block and the
|
|
|
|
// dest to the number of bytes left in this block.
|
|
|
|
unsigned StartBlock = Src->getNumber();
|
|
|
|
BranchSize = BlockSizes[StartBlock].first - BrOffset;
|
|
|
|
|
|
|
|
MaxAlign = std::max(MaxAlign, Dest->getAlignment());
|
|
|
|
for (unsigned i = StartBlock+1, e = Dest->getNumber(); i != e; ++i) {
|
|
|
|
BranchSize += BlockSizes[i].first;
|
|
|
|
MaxAlign = std::max(MaxAlign,
|
|
|
|
Fn.getBlockNumbered(i)->getAlignment());
|
|
|
|
}
|
|
|
|
|
|
|
|
NeedExtraAdjustment = (FirstImpreciseBlock >= 0) &&
|
|
|
|
(Src->getNumber() >= FirstImpreciseBlock);
|
|
|
|
}
|
|
|
|
|
|
|
|
// We tend to over estimate code size due to large alignment and
|
|
|
|
// inline assembly. Usually it causes larger computed branch offset.
|
|
|
|
// But sometimes it may also causes smaller computed branch offset
|
|
|
|
// than actual branch offset. If the offset is close to the limit of
|
|
|
|
// encoding, it may cause problem at run time.
|
|
|
|
// Following is a simplified example.
|
|
|
|
//
|
|
|
|
// actual estimated
|
|
|
|
// address address
|
|
|
|
// ...
|
|
|
|
// bne Far 100 10c
|
|
|
|
// .p2align 4
|
|
|
|
// Near: 110 110
|
|
|
|
// ...
|
|
|
|
// Far: 8108 8108
|
|
|
|
//
|
|
|
|
// Actual offset: 0x8108 - 0x100 = 0x8008
|
|
|
|
// Computed offset: 0x8108 - 0x10c = 0x7ffc
|
|
|
|
//
|
|
|
|
// This example also shows when we can get the largest gap between
|
|
|
|
// estimated offset and actual offset. If there is an aligned block
|
|
|
|
// ABB between branch and target, assume its alignment is <align>
|
|
|
|
// bits. Now consider the accumulated function size FSIZE till the end
|
|
|
|
// of previous block PBB. If the estimated FSIZE is multiple of
|
|
|
|
// 2^<align>, we don't need any padding for the estimated address of
|
|
|
|
// ABB. If actual FSIZE at the end of PBB is 4 bytes more than
|
|
|
|
// multiple of 2^<align>, then we need (2^<align> - 4) bytes of
|
|
|
|
// padding. It also means the actual branch offset is (2^<align> - 4)
|
|
|
|
// larger than computed offset. Other actual FSIZE needs less padding
|
|
|
|
// bytes, so causes smaller gap between actual and computed offset.
|
|
|
|
//
|
|
|
|
// On the other hand, if the inline asm or large alignment occurs
|
|
|
|
// between the branch block and destination block, the estimated address
|
|
|
|
// can be <delta> larger than actual address. If padding bytes are
|
|
|
|
// needed for a later aligned block, the actual number of padding bytes
|
|
|
|
// is at most <delta> more than estimated padding bytes. So the actual
|
|
|
|
// aligned block address is less than or equal to the estimated aligned
|
|
|
|
// block address. So the actual branch offset is less than or equal to
|
|
|
|
// computed branch offset.
|
|
|
|
//
|
|
|
|
// The computed offset is at most ((1 << alignment) - 4) bytes smaller
|
|
|
|
// than actual offset. So we add this number to the offset for safety.
|
|
|
|
if (NeedExtraAdjustment)
|
|
|
|
BranchSize += (1 << MaxAlign) - 4;
|
|
|
|
|
|
|
|
return BranchSize;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool PPCBSel::runOnMachineFunction(MachineFunction &Fn) {
|
|
|
|
const PPCInstrInfo *TII =
|
|
|
|
static_cast<const PPCInstrInfo *>(Fn.getSubtarget().getInstrInfo());
|
|
|
|
// Give the blocks of the function a dense, in-order, numbering.
|
|
|
|
Fn.RenumberBlocks();
|
|
|
|
BlockSizes.resize(Fn.getNumBlockIDs());
|
|
|
|
FirstImpreciseBlock = -1;
|
|
|
|
|
|
|
|
// Measure each MBB and compute a size for the entire function.
|
|
|
|
unsigned FuncSize = ComputeBlockSizes(Fn);
|
|
|
|
|
2006-11-18 08:32:03 +08:00
|
|
|
// If the entire function is smaller than the displacement of a branch field,
|
|
|
|
// we know we don't need to shrink any branches in this function. This is a
|
|
|
|
// common case.
|
|
|
|
if (FuncSize < (1 << 15)) {
|
|
|
|
BlockSizes.clear();
|
|
|
|
return false;
|
|
|
|
}
|
2018-07-31 03:41:25 +08:00
|
|
|
|
2006-11-18 08:32:03 +08:00
|
|
|
// For each conditional branch, if the offset to its destination is larger
|
|
|
|
// than the offset field allows, transform it into a long branch sequence
|
|
|
|
// like this:
|
|
|
|
// short branch:
|
|
|
|
// bCC MBB
|
|
|
|
// long branch:
|
|
|
|
// b!CC $PC+8
|
|
|
|
// b MBB
|
2006-02-09 03:33:26 +08:00
|
|
|
//
|
2006-11-18 08:32:03 +08:00
|
|
|
bool MadeChange = true;
|
|
|
|
bool EverMadeChange = false;
|
|
|
|
while (MadeChange) {
|
|
|
|
// Iteratively expand branches until we reach a fixed point.
|
|
|
|
MadeChange = false;
|
2018-07-31 03:41:25 +08:00
|
|
|
|
2006-11-18 08:32:03 +08:00
|
|
|
for (MachineFunction::iterator MFI = Fn.begin(), E = Fn.end(); MFI != E;
|
|
|
|
++MFI) {
|
|
|
|
MachineBasicBlock &MBB = *MFI;
|
|
|
|
unsigned MBBStartOffset = 0;
|
|
|
|
for (MachineBasicBlock::iterator I = MBB.begin(), E = MBB.end();
|
|
|
|
I != E; ++I) {
|
2014-04-25 13:30:21 +08:00
|
|
|
MachineBasicBlock *Dest = nullptr;
|
2013-05-21 22:21:09 +08:00
|
|
|
if (I->getOpcode() == PPC::BCC && !I->getOperand(2).isImm())
|
|
|
|
Dest = I->getOperand(2).getMBB();
|
Add CR-bit tracking to the PowerPC backend for i1 values
This change enables tracking i1 values in the PowerPC backend using the
condition register bits. These bits can be treated on PowerPC as separate
registers; individual bit operations (and, or, xor, etc.) are supported.
Tracking booleans in CR bits has several advantages:
- Reduction in register pressure (because we no longer need GPRs to store
boolean values).
- Logical operations on booleans can be handled more efficiently; we used to
have to move all results from comparisons into GPRs, perform promoted
logical operations in GPRs, and then move the result back into condition
register bits to be used by conditional branches. This can be very
inefficient, because the throughput of these CR <-> GPR moves have high
latency and low throughput (especially when other associated instructions
are accounted for).
- On the POWER7 and similar cores, we can increase total throughput by using
the CR bits. CR bit operations have a dedicated functional unit.
Most of this is more-or-less mechanical: Adjustments were needed in the
calling-convention code, support was added for spilling/restoring individual
condition-register bits, and conditional branch instruction definitions taking
specific CR bits were added (plus patterns and code for generating bit-level
operations).
This is enabled by default when running at -O2 and higher. For -O0 and -O1,
where the ability to debug is more important, this feature is disabled by
default. Individual CR bits do not have assigned DWARF register numbers,
and storing values in CR bits makes them invisible to the debugger.
It is critical, however, that we don't move i1 values that have been promoted
to larger values (such as those passed as function arguments) into bit
registers only to quickly turn around and move the values back into GPRs (such
as happens when values are returned by functions). A pair of target-specific
DAG combines are added to remove the trunc/extends in:
trunc(binary-ops(binary-ops(zext(x), zext(y)), ...)
and:
zext(binary-ops(binary-ops(trunc(x), trunc(y)), ...)
In short, we only want to use CR bits where some of the i1 values come from
comparisons or are used by conditional branches or selects. To put it another
way, if we can do the entire i1 computation in GPRs, then we probably should
(on the POWER7, the GPR-operation throughput is higher, and for all cores, the
CR <-> GPR moves are expensive).
POWER7 test-suite performance results (from 10 runs in each configuration):
SingleSource/Benchmarks/Misc/mandel-2: 35% speedup
MultiSource/Benchmarks/Prolangs-C++/city/city: 21% speedup
MultiSource/Benchmarks/MiBench/automotive-susan: 23% speedup
SingleSource/Benchmarks/CoyoteBench/huffbench: 13% speedup
SingleSource/Benchmarks/Misc-C++/Large/sphereflake: 13% speedup
SingleSource/Benchmarks/Misc-C++/mandel-text: 10% speedup
SingleSource/Benchmarks/Misc-C++-EH/spirit: 10% slowdown
MultiSource/Applications/lemon/lemon: 8% slowdown
llvm-svn: 202451
2014-02-28 08:27:01 +08:00
|
|
|
else if ((I->getOpcode() == PPC::BC || I->getOpcode() == PPC::BCn) &&
|
|
|
|
!I->getOperand(1).isImm())
|
|
|
|
Dest = I->getOperand(1).getMBB();
|
2013-05-21 22:21:09 +08:00
|
|
|
else if ((I->getOpcode() == PPC::BDNZ8 || I->getOpcode() == PPC::BDNZ ||
|
|
|
|
I->getOpcode() == PPC::BDZ8 || I->getOpcode() == PPC::BDZ) &&
|
|
|
|
!I->getOperand(0).isImm())
|
|
|
|
Dest = I->getOperand(0).getMBB();
|
|
|
|
|
|
|
|
if (!Dest) {
|
2016-07-29 00:32:22 +08:00
|
|
|
MBBStartOffset += TII->getInstSizeInBytes(*I);
|
2006-11-18 08:32:03 +08:00
|
|
|
continue;
|
|
|
|
}
|
2018-07-31 03:41:25 +08:00
|
|
|
|
2006-11-18 08:32:03 +08:00
|
|
|
// Determine the offset from the current branch to the destination
|
|
|
|
// block.
|
2019-03-27 05:27:38 +08:00
|
|
|
int BranchSize = computeBranchSize(Fn, &MBB, Dest, MBBStartOffset);
|
2019-03-07 02:22:22 +08:00
|
|
|
|
2006-11-18 08:32:03 +08:00
|
|
|
// If this branch is in range, ignore it.
|
2010-03-30 05:13:41 +08:00
|
|
|
if (isInt<16>(BranchSize)) {
|
2006-11-18 08:32:03 +08:00
|
|
|
MBBStartOffset += 4;
|
|
|
|
continue;
|
|
|
|
}
|
2012-06-08 23:38:21 +08:00
|
|
|
|
2006-11-18 08:32:03 +08:00
|
|
|
// Otherwise, we have to expand it to a long branch.
|
2016-07-27 21:24:16 +08:00
|
|
|
MachineInstr &OldBranch = *I;
|
|
|
|
DebugLoc dl = OldBranch.getDebugLoc();
|
|
|
|
|
2012-06-08 23:38:21 +08:00
|
|
|
if (I->getOpcode() == PPC::BCC) {
|
|
|
|
// The BCC operands are:
|
|
|
|
// 0. PPC branch predicate
|
|
|
|
// 1. CR register
|
|
|
|
// 2. Target MBB
|
|
|
|
PPC::Predicate Pred = (PPC::Predicate)I->getOperand(0).getImm();
|
|
|
|
unsigned CRReg = I->getOperand(1).getReg();
|
2018-07-31 03:41:25 +08:00
|
|
|
|
2012-06-08 23:38:21 +08:00
|
|
|
// Jump over the uncond branch inst (i.e. $PC+8) on opposite condition.
|
|
|
|
BuildMI(MBB, I, dl, TII->get(PPC::BCC))
|
|
|
|
.addImm(PPC::InvertPredicate(Pred)).addReg(CRReg).addImm(2);
|
Add CR-bit tracking to the PowerPC backend for i1 values
This change enables tracking i1 values in the PowerPC backend using the
condition register bits. These bits can be treated on PowerPC as separate
registers; individual bit operations (and, or, xor, etc.) are supported.
Tracking booleans in CR bits has several advantages:
- Reduction in register pressure (because we no longer need GPRs to store
boolean values).
- Logical operations on booleans can be handled more efficiently; we used to
have to move all results from comparisons into GPRs, perform promoted
logical operations in GPRs, and then move the result back into condition
register bits to be used by conditional branches. This can be very
inefficient, because the throughput of these CR <-> GPR moves have high
latency and low throughput (especially when other associated instructions
are accounted for).
- On the POWER7 and similar cores, we can increase total throughput by using
the CR bits. CR bit operations have a dedicated functional unit.
Most of this is more-or-less mechanical: Adjustments were needed in the
calling-convention code, support was added for spilling/restoring individual
condition-register bits, and conditional branch instruction definitions taking
specific CR bits were added (plus patterns and code for generating bit-level
operations).
This is enabled by default when running at -O2 and higher. For -O0 and -O1,
where the ability to debug is more important, this feature is disabled by
default. Individual CR bits do not have assigned DWARF register numbers,
and storing values in CR bits makes them invisible to the debugger.
It is critical, however, that we don't move i1 values that have been promoted
to larger values (such as those passed as function arguments) into bit
registers only to quickly turn around and move the values back into GPRs (such
as happens when values are returned by functions). A pair of target-specific
DAG combines are added to remove the trunc/extends in:
trunc(binary-ops(binary-ops(zext(x), zext(y)), ...)
and:
zext(binary-ops(binary-ops(trunc(x), trunc(y)), ...)
In short, we only want to use CR bits where some of the i1 values come from
comparisons or are used by conditional branches or selects. To put it another
way, if we can do the entire i1 computation in GPRs, then we probably should
(on the POWER7, the GPR-operation throughput is higher, and for all cores, the
CR <-> GPR moves are expensive).
POWER7 test-suite performance results (from 10 runs in each configuration):
SingleSource/Benchmarks/Misc/mandel-2: 35% speedup
MultiSource/Benchmarks/Prolangs-C++/city/city: 21% speedup
MultiSource/Benchmarks/MiBench/automotive-susan: 23% speedup
SingleSource/Benchmarks/CoyoteBench/huffbench: 13% speedup
SingleSource/Benchmarks/Misc-C++/Large/sphereflake: 13% speedup
SingleSource/Benchmarks/Misc-C++/mandel-text: 10% speedup
SingleSource/Benchmarks/Misc-C++-EH/spirit: 10% slowdown
MultiSource/Applications/lemon/lemon: 8% slowdown
llvm-svn: 202451
2014-02-28 08:27:01 +08:00
|
|
|
} else if (I->getOpcode() == PPC::BC) {
|
|
|
|
unsigned CRBit = I->getOperand(0).getReg();
|
|
|
|
BuildMI(MBB, I, dl, TII->get(PPC::BCn)).addReg(CRBit).addImm(2);
|
|
|
|
} else if (I->getOpcode() == PPC::BCn) {
|
|
|
|
unsigned CRBit = I->getOperand(0).getReg();
|
|
|
|
BuildMI(MBB, I, dl, TII->get(PPC::BC)).addReg(CRBit).addImm(2);
|
2012-06-08 23:38:21 +08:00
|
|
|
} else if (I->getOpcode() == PPC::BDNZ) {
|
|
|
|
BuildMI(MBB, I, dl, TII->get(PPC::BDZ)).addImm(2);
|
|
|
|
} else if (I->getOpcode() == PPC::BDNZ8) {
|
|
|
|
BuildMI(MBB, I, dl, TII->get(PPC::BDZ8)).addImm(2);
|
|
|
|
} else if (I->getOpcode() == PPC::BDZ) {
|
|
|
|
BuildMI(MBB, I, dl, TII->get(PPC::BDNZ)).addImm(2);
|
|
|
|
} else if (I->getOpcode() == PPC::BDZ8) {
|
|
|
|
BuildMI(MBB, I, dl, TII->get(PPC::BDNZ8)).addImm(2);
|
|
|
|
} else {
|
|
|
|
llvm_unreachable("Unhandled branch type!");
|
|
|
|
}
|
2018-07-31 03:41:25 +08:00
|
|
|
|
2006-11-18 08:32:03 +08:00
|
|
|
// Uncond branch to the real destination.
|
2009-02-13 10:27:39 +08:00
|
|
|
I = BuildMI(MBB, I, dl, TII->get(PPC::B)).addMBB(Dest);
|
2006-11-18 08:32:03 +08:00
|
|
|
|
|
|
|
// Remove the old branch from the function.
|
2016-07-27 21:24:16 +08:00
|
|
|
OldBranch.eraseFromParent();
|
|
|
|
|
2006-11-18 08:32:03 +08:00
|
|
|
// Remember that this instruction is 8-bytes, increase the size of the
|
|
|
|
// block by 4, remember to iterate.
|
2016-09-04 22:18:29 +08:00
|
|
|
BlockSizes[MBB.getNumber()].first += 4;
|
2006-11-18 08:32:03 +08:00
|
|
|
MBBStartOffset += 8;
|
2006-11-17 07:49:52 +08:00
|
|
|
++NumExpanded;
|
2006-11-18 08:32:03 +08:00
|
|
|
MadeChange = true;
|
2006-11-17 07:49:52 +08:00
|
|
|
}
|
2006-02-09 03:33:26 +08:00
|
|
|
}
|
2016-09-04 22:18:29 +08:00
|
|
|
|
|
|
|
if (MadeChange) {
|
|
|
|
// If we're going to iterate again, make sure we've updated our
|
|
|
|
// padding-based contributions to the block sizes.
|
2019-03-27 05:27:38 +08:00
|
|
|
modifyAdjustment(Fn);
|
2016-09-04 22:18:29 +08:00
|
|
|
}
|
|
|
|
|
2006-11-18 08:32:03 +08:00
|
|
|
EverMadeChange |= MadeChange;
|
2006-02-09 03:33:26 +08:00
|
|
|
}
|
2018-07-31 03:41:25 +08:00
|
|
|
|
2006-11-18 08:32:03 +08:00
|
|
|
BlockSizes.clear();
|
2006-02-09 03:33:26 +08:00
|
|
|
return true;
|
|
|
|
}
|