2008-01-01 20:36:19 +00:00
|
|
|
//===-- lib/CodeGen/MachineInstr.cpp --------------------------------------===//
|
2005-04-21 22:36:52 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 20:36:04 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-21 22:36:52 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2004-02-13 04:39:32 +00:00
|
|
|
//
|
|
|
|
// Methods common to all machine instructions.
|
|
|
|
//
|
2002-08-09 20:08:06 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2001-07-21 12:41:50 +00:00
|
|
|
|
2001-09-07 17:18:30 +00:00
|
|
|
#include "llvm/CodeGen/MachineInstr.h"
|
2009-03-23 08:01:15 +00:00
|
|
|
#include "llvm/Constants.h"
|
2009-10-30 01:27:03 +00:00
|
|
|
#include "llvm/Function.h"
|
2009-03-23 08:01:15 +00:00
|
|
|
#include "llvm/InlineAsm.h"
|
2010-03-13 08:14:18 +00:00
|
|
|
#include "llvm/Metadata.h"
|
2009-12-28 08:30:43 +00:00
|
|
|
#include "llvm/Type.h"
|
2007-12-31 04:13:23 +00:00
|
|
|
#include "llvm/Value.h"
|
2009-09-23 01:33:16 +00:00
|
|
|
#include "llvm/Assembly/Writer.h"
|
2010-03-03 01:44:33 +00:00
|
|
|
#include "llvm/CodeGen/MachineConstantPool.h"
|
2004-02-19 16:17:08 +00:00
|
|
|
#include "llvm/CodeGen/MachineFunction.h"
|
2009-09-25 20:36:54 +00:00
|
|
|
#include "llvm/CodeGen/MachineMemOperand.h"
|
2008-01-01 01:12:31 +00:00
|
|
|
#include "llvm/CodeGen/MachineRegisterInfo.h"
|
2008-02-06 22:27:42 +00:00
|
|
|
#include "llvm/CodeGen/PseudoSourceValue.h"
|
2010-03-13 08:14:18 +00:00
|
|
|
#include "llvm/MC/MCSymbol.h"
|
2002-10-30 00:48:05 +00:00
|
|
|
#include "llvm/Target/TargetMachine.h"
|
2008-01-31 09:59:15 +00:00
|
|
|
#include "llvm/Target/TargetInstrInfo.h"
|
2008-01-07 07:42:25 +00:00
|
|
|
#include "llvm/Target/TargetInstrDesc.h"
|
2008-02-10 18:45:23 +00:00
|
|
|
#include "llvm/Target/TargetRegisterInfo.h"
|
2009-10-07 17:38:06 +00:00
|
|
|
#include "llvm/Analysis/AliasAnalysis.h"
|
2009-04-30 23:22:31 +00:00
|
|
|
#include "llvm/Analysis/DebugInfo.h"
|
2010-01-04 23:48:20 +00:00
|
|
|
#include "llvm/Support/Debug.h"
|
2009-07-11 20:10:48 +00:00
|
|
|
#include "llvm/Support/ErrorHandling.h"
|
2008-07-17 23:49:46 +00:00
|
|
|
#include "llvm/Support/LeakDetector.h"
|
2008-07-07 20:32:02 +00:00
|
|
|
#include "llvm/Support/MathExtras.h"
|
2008-08-24 20:37:32 +00:00
|
|
|
#include "llvm/Support/raw_ostream.h"
|
2008-08-20 15:58:01 +00:00
|
|
|
#include "llvm/ADT/FoldingSet.h"
|
2004-02-23 18:38:20 +00:00
|
|
|
using namespace llvm;
|
2003-11-11 22:41:34 +00:00
|
|
|
|
2007-12-30 21:56:09 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// MachineOperand Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2008-01-01 01:12:31 +00:00
|
|
|
/// AddRegOperandToRegInfo - Add this register operand to the specified
|
|
|
|
/// MachineRegisterInfo. If it is null, then the next/prev fields should be
|
|
|
|
/// explicitly nulled out.
|
|
|
|
void MachineOperand::AddRegOperandToRegInfo(MachineRegisterInfo *RegInfo) {
|
2008-10-03 15:45:36 +00:00
|
|
|
assert(isReg() && "Can only add reg operand to use lists");
|
2008-01-01 01:12:31 +00:00
|
|
|
|
|
|
|
// If the reginfo pointer is null, just explicitly null out or next/prev
|
|
|
|
// pointers, to ensure they are not garbage.
|
|
|
|
if (RegInfo == 0) {
|
|
|
|
Contents.Reg.Prev = 0;
|
|
|
|
Contents.Reg.Next = 0;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Otherwise, add this operand to the head of the registers use/def list.
|
2008-01-01 21:08:22 +00:00
|
|
|
MachineOperand **Head = &RegInfo->getRegUseDefListHead(getReg());
|
2008-01-01 01:12:31 +00:00
|
|
|
|
2008-01-01 21:08:22 +00:00
|
|
|
// For SSA values, we prefer to keep the definition at the start of the list.
|
|
|
|
// we do this by skipping over the definition if it is at the head of the
|
|
|
|
// list.
|
|
|
|
if (*Head && (*Head)->isDef())
|
|
|
|
Head = &(*Head)->Contents.Reg.Next;
|
|
|
|
|
|
|
|
Contents.Reg.Next = *Head;
|
2008-01-01 01:12:31 +00:00
|
|
|
if (Contents.Reg.Next) {
|
|
|
|
assert(getReg() == Contents.Reg.Next->getReg() &&
|
|
|
|
"Different regs on the same list!");
|
|
|
|
Contents.Reg.Next->Contents.Reg.Prev = &Contents.Reg.Next;
|
|
|
|
}
|
|
|
|
|
2008-01-01 21:08:22 +00:00
|
|
|
Contents.Reg.Prev = Head;
|
|
|
|
*Head = this;
|
2008-01-01 01:12:31 +00:00
|
|
|
}
|
|
|
|
|
2009-04-15 01:17:37 +00:00
|
|
|
/// RemoveRegOperandFromRegInfo - Remove this register operand from the
|
|
|
|
/// MachineRegisterInfo it is linked with.
|
|
|
|
void MachineOperand::RemoveRegOperandFromRegInfo() {
|
|
|
|
assert(isOnRegUseList() && "Reg operand is not on a use list");
|
|
|
|
// Unlink this from the doubly linked list of operands.
|
|
|
|
MachineOperand *NextOp = Contents.Reg.Next;
|
|
|
|
*Contents.Reg.Prev = NextOp;
|
|
|
|
if (NextOp) {
|
|
|
|
assert(NextOp->getReg() == getReg() && "Corrupt reg use/def chain!");
|
|
|
|
NextOp->Contents.Reg.Prev = Contents.Reg.Prev;
|
|
|
|
}
|
|
|
|
Contents.Reg.Prev = 0;
|
|
|
|
Contents.Reg.Next = 0;
|
|
|
|
}
|
|
|
|
|
2008-01-01 01:12:31 +00:00
|
|
|
void MachineOperand::setReg(unsigned Reg) {
|
|
|
|
if (getReg() == Reg) return; // No change.
|
|
|
|
|
|
|
|
// Otherwise, we have to change the register. If this operand is embedded
|
|
|
|
// into a machine function, we need to update the old and new register's
|
|
|
|
// use/def lists.
|
|
|
|
if (MachineInstr *MI = getParent())
|
|
|
|
if (MachineBasicBlock *MBB = MI->getParent())
|
|
|
|
if (MachineFunction *MF = MBB->getParent()) {
|
|
|
|
RemoveRegOperandFromRegInfo();
|
|
|
|
Contents.Reg.RegNo = Reg;
|
|
|
|
AddRegOperandToRegInfo(&MF->getRegInfo());
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Otherwise, just change the register, no problem. :)
|
|
|
|
Contents.Reg.RegNo = Reg;
|
|
|
|
}
|
|
|
|
|
2010-05-28 18:18:53 +00:00
|
|
|
void MachineOperand::substVirtReg(unsigned Reg, unsigned SubIdx,
|
|
|
|
const TargetRegisterInfo &TRI) {
|
|
|
|
assert(TargetRegisterInfo::isVirtualRegister(Reg));
|
|
|
|
if (SubIdx && getSubReg())
|
|
|
|
SubIdx = TRI.composeSubRegIndices(SubIdx, getSubReg());
|
|
|
|
setReg(Reg);
|
2010-06-01 22:39:25 +00:00
|
|
|
if (SubIdx)
|
|
|
|
setSubReg(SubIdx);
|
2010-05-28 18:18:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void MachineOperand::substPhysReg(unsigned Reg, const TargetRegisterInfo &TRI) {
|
|
|
|
assert(TargetRegisterInfo::isPhysicalRegister(Reg));
|
|
|
|
if (getSubReg()) {
|
|
|
|
Reg = TRI.getSubReg(Reg, getSubReg());
|
|
|
|
assert(Reg && "Invalid SubReg for physical register");
|
|
|
|
setSubReg(0);
|
|
|
|
}
|
|
|
|
setReg(Reg);
|
|
|
|
}
|
|
|
|
|
2008-01-01 01:12:31 +00:00
|
|
|
/// ChangeToImmediate - Replace this operand with a new immediate operand of
|
|
|
|
/// the specified value. If an operand is known to be an immediate already,
|
|
|
|
/// the setImm method should be used.
|
|
|
|
void MachineOperand::ChangeToImmediate(int64_t ImmVal) {
|
|
|
|
// If this operand is currently a register operand, and if this is in a
|
|
|
|
// function, deregister the operand from the register's use/def list.
|
2008-10-03 15:45:36 +00:00
|
|
|
if (isReg() && getParent() && getParent()->getParent() &&
|
2008-01-01 01:12:31 +00:00
|
|
|
getParent()->getParent()->getParent())
|
|
|
|
RemoveRegOperandFromRegInfo();
|
|
|
|
|
|
|
|
OpKind = MO_Immediate;
|
|
|
|
Contents.ImmVal = ImmVal;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// ChangeToRegister - Replace this operand with a new register operand of
|
|
|
|
/// the specified value. If an operand is known to be an register already,
|
|
|
|
/// the setReg method should be used.
|
|
|
|
void MachineOperand::ChangeToRegister(unsigned Reg, bool isDef, bool isImp,
|
2010-02-10 00:41:49 +00:00
|
|
|
bool isKill, bool isDead, bool isUndef,
|
|
|
|
bool isDebug) {
|
2008-01-01 01:12:31 +00:00
|
|
|
// If this operand is already a register operand, use setReg to update the
|
|
|
|
// register's use/def lists.
|
2008-10-03 15:45:36 +00:00
|
|
|
if (isReg()) {
|
2008-09-14 01:44:36 +00:00
|
|
|
assert(!isEarlyClobber());
|
2008-01-01 01:12:31 +00:00
|
|
|
setReg(Reg);
|
|
|
|
} else {
|
|
|
|
// Otherwise, change this to a register and set the reg#.
|
|
|
|
OpKind = MO_Register;
|
|
|
|
Contents.Reg.RegNo = Reg;
|
|
|
|
|
|
|
|
// If this operand is embedded in a function, add the operand to the
|
|
|
|
// register's use/def list.
|
|
|
|
if (MachineInstr *MI = getParent())
|
|
|
|
if (MachineBasicBlock *MBB = MI->getParent())
|
|
|
|
if (MachineFunction *MF = MBB->getParent())
|
|
|
|
AddRegOperandToRegInfo(&MF->getRegInfo());
|
|
|
|
}
|
|
|
|
|
|
|
|
IsDef = isDef;
|
|
|
|
IsImp = isImp;
|
|
|
|
IsKill = isKill;
|
|
|
|
IsDead = isDead;
|
2009-06-30 08:49:04 +00:00
|
|
|
IsUndef = isUndef;
|
2008-09-14 01:44:36 +00:00
|
|
|
IsEarlyClobber = false;
|
2010-02-10 00:41:49 +00:00
|
|
|
IsDebug = isDebug;
|
2008-01-01 01:12:31 +00:00
|
|
|
SubReg = 0;
|
|
|
|
}
|
|
|
|
|
2007-12-30 21:56:09 +00:00
|
|
|
/// isIdenticalTo - Return true if this operand is identical to the specified
|
|
|
|
/// operand.
|
|
|
|
bool MachineOperand::isIdenticalTo(const MachineOperand &Other) const {
|
2009-06-24 17:54:48 +00:00
|
|
|
if (getType() != Other.getType() ||
|
|
|
|
getTargetFlags() != Other.getTargetFlags())
|
|
|
|
return false;
|
2007-12-30 21:56:09 +00:00
|
|
|
|
|
|
|
switch (getType()) {
|
2009-07-14 16:55:14 +00:00
|
|
|
default: llvm_unreachable("Unrecognized operand type");
|
2007-12-30 21:56:09 +00:00
|
|
|
case MachineOperand::MO_Register:
|
|
|
|
return getReg() == Other.getReg() && isDef() == Other.isDef() &&
|
|
|
|
getSubReg() == Other.getSubReg();
|
|
|
|
case MachineOperand::MO_Immediate:
|
|
|
|
return getImm() == Other.getImm();
|
2008-02-14 07:39:30 +00:00
|
|
|
case MachineOperand::MO_FPImmediate:
|
|
|
|
return getFPImm() == Other.getFPImm();
|
2007-12-30 21:56:09 +00:00
|
|
|
case MachineOperand::MO_MachineBasicBlock:
|
|
|
|
return getMBB() == Other.getMBB();
|
|
|
|
case MachineOperand::MO_FrameIndex:
|
2007-12-30 23:10:15 +00:00
|
|
|
return getIndex() == Other.getIndex();
|
2007-12-30 21:56:09 +00:00
|
|
|
case MachineOperand::MO_ConstantPoolIndex:
|
2007-12-30 23:10:15 +00:00
|
|
|
return getIndex() == Other.getIndex() && getOffset() == Other.getOffset();
|
2007-12-30 21:56:09 +00:00
|
|
|
case MachineOperand::MO_JumpTableIndex:
|
2007-12-30 23:10:15 +00:00
|
|
|
return getIndex() == Other.getIndex();
|
2007-12-30 21:56:09 +00:00
|
|
|
case MachineOperand::MO_GlobalAddress:
|
|
|
|
return getGlobal() == Other.getGlobal() && getOffset() == Other.getOffset();
|
|
|
|
case MachineOperand::MO_ExternalSymbol:
|
|
|
|
return !strcmp(getSymbolName(), Other.getSymbolName()) &&
|
|
|
|
getOffset() == Other.getOffset();
|
2009-10-30 01:27:03 +00:00
|
|
|
case MachineOperand::MO_BlockAddress:
|
|
|
|
return getBlockAddress() == Other.getBlockAddress();
|
2010-03-13 08:14:18 +00:00
|
|
|
case MachineOperand::MO_MCSymbol:
|
|
|
|
return getMCSymbol() == Other.getMCSymbol();
|
2010-04-07 18:03:19 +00:00
|
|
|
case MachineOperand::MO_Metadata:
|
|
|
|
return getMetadata() == Other.getMetadata();
|
2007-12-30 21:56:09 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// print - Print the specified machine operand.
|
|
|
|
///
|
2008-10-10 01:43:55 +00:00
|
|
|
void MachineOperand::print(raw_ostream &OS, const TargetMachine *TM) const {
|
Print "..." instead of all the uninteresting register clobbers on call
instructions. This makes CodeGen dumps significantly less noisy.
Example before:
BL <ga:@bar>, %R0<imp-def>, %R1<imp-def,dead>, %R2<imp-def,dead>, %R3<imp-def,dead>, %R12<imp-def,dead>, %LR<imp-def,dead>, %D0<imp-def,dead>, %D1<imp-def,dead>, %D2<imp-def,dead>, %D3<imp-def,dead>, %D4<imp-def,dead>, %D5<imp-def,dead>, %D6<imp-def,dead>, %D7<imp-def,dead>, %D16<imp-def,dead>, %D17<imp-def,dead>, %D18<imp-def,dead>, %D19<imp-def,dead>, %D20<imp-def,dead>, %D21<imp-def,dead>, %D22<imp-def,dead>, %D23<imp-def,dead>, %D24<imp-def,dead>, %D25<imp-def,dead>, %D26<imp-def,dead>, %D27<imp-def,dead>, %D28<imp-def,dead>, %D29<imp-def,dead>, %D30<imp-def,dead>, %D31<imp-def,dead>, %CPSR<imp-def,dead>, %FPSCR<imp-def,dead>
Same example after:
BL <ga:@bar>, %R0<imp-def>, %R1<imp-def,dead>, %LR<imp-def,dead>, %CPSR<imp-def,dead>, ...
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@86583 91177308-0d34-0410-b5e6-96231b3b80d8
2009-11-09 19:38:45 +00:00
|
|
|
// If the instruction is embedded into a basic block, we can find the
|
|
|
|
// target info for the instruction.
|
|
|
|
if (!TM)
|
|
|
|
if (const MachineInstr *MI = getParent())
|
|
|
|
if (const MachineBasicBlock *MBB = MI->getParent())
|
|
|
|
if (const MachineFunction *MF = MBB->getParent())
|
|
|
|
TM = &MF->getTarget();
|
|
|
|
|
2007-12-30 21:56:09 +00:00
|
|
|
switch (getType()) {
|
|
|
|
case MachineOperand::MO_Register:
|
2008-02-10 18:45:23 +00:00
|
|
|
if (getReg() == 0 || TargetRegisterInfo::isVirtualRegister(getReg())) {
|
2007-12-30 21:56:09 +00:00
|
|
|
OS << "%reg" << getReg();
|
|
|
|
} else {
|
|
|
|
if (TM)
|
2008-02-26 21:47:57 +00:00
|
|
|
OS << "%" << TM->getRegisterInfo()->get(getReg()).Name;
|
2007-12-30 21:56:09 +00:00
|
|
|
else
|
2009-10-31 20:19:03 +00:00
|
|
|
OS << "%physreg" << getReg();
|
2007-12-30 21:56:09 +00:00
|
|
|
}
|
2008-12-18 21:51:27 +00:00
|
|
|
|
2010-05-25 19:49:38 +00:00
|
|
|
if (getSubReg() != 0) {
|
|
|
|
if (TM)
|
|
|
|
OS << ':' << TM->getRegisterInfo()->getSubRegIndexName(getSubReg());
|
|
|
|
else
|
|
|
|
OS << ':' << getSubReg();
|
|
|
|
}
|
2008-12-18 21:51:27 +00:00
|
|
|
|
2009-06-30 08:49:04 +00:00
|
|
|
if (isDef() || isKill() || isDead() || isImplicit() || isUndef() ||
|
|
|
|
isEarlyClobber()) {
|
2009-06-24 17:54:48 +00:00
|
|
|
OS << '<';
|
2007-12-30 21:56:09 +00:00
|
|
|
bool NeedComma = false;
|
2009-10-14 23:37:31 +00:00
|
|
|
if (isDef()) {
|
2009-06-24 17:54:48 +00:00
|
|
|
if (NeedComma) OS << ',';
|
2008-09-12 17:49:03 +00:00
|
|
|
if (isEarlyClobber())
|
|
|
|
OS << "earlyclobber,";
|
2009-10-14 23:37:31 +00:00
|
|
|
if (isImplicit())
|
|
|
|
OS << "imp-";
|
2007-12-30 21:56:09 +00:00
|
|
|
OS << "def";
|
|
|
|
NeedComma = true;
|
2009-10-21 07:56:02 +00:00
|
|
|
} else if (isImplicit()) {
|
2009-10-14 23:37:31 +00:00
|
|
|
OS << "imp-use";
|
2009-10-21 07:56:02 +00:00
|
|
|
NeedComma = true;
|
|
|
|
}
|
2009-10-14 23:37:31 +00:00
|
|
|
|
2009-06-30 08:49:04 +00:00
|
|
|
if (isKill() || isDead() || isUndef()) {
|
2009-06-24 17:54:48 +00:00
|
|
|
if (NeedComma) OS << ',';
|
2008-02-24 00:56:13 +00:00
|
|
|
if (isKill()) OS << "kill";
|
|
|
|
if (isDead()) OS << "dead";
|
2009-06-30 08:49:04 +00:00
|
|
|
if (isUndef()) {
|
|
|
|
if (isKill() || isDead())
|
|
|
|
OS << ',';
|
|
|
|
OS << "undef";
|
|
|
|
}
|
2007-12-30 21:56:09 +00:00
|
|
|
}
|
2009-06-24 17:54:48 +00:00
|
|
|
OS << '>';
|
2007-12-30 21:56:09 +00:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
case MachineOperand::MO_Immediate:
|
|
|
|
OS << getImm();
|
|
|
|
break;
|
2008-02-14 07:39:30 +00:00
|
|
|
case MachineOperand::MO_FPImmediate:
|
2009-10-05 05:54:46 +00:00
|
|
|
if (getFPImm()->getType()->isFloatTy())
|
2008-02-14 07:39:30 +00:00
|
|
|
OS << getFPImm()->getValueAPF().convertToFloat();
|
2009-06-24 17:54:48 +00:00
|
|
|
else
|
2008-02-14 07:39:30 +00:00
|
|
|
OS << getFPImm()->getValueAPF().convertToDouble();
|
|
|
|
break;
|
2007-12-30 21:56:09 +00:00
|
|
|
case MachineOperand::MO_MachineBasicBlock:
|
2009-10-31 20:19:03 +00:00
|
|
|
OS << "<BB#" << getMBB()->getNumber() << ">";
|
2007-12-30 21:56:09 +00:00
|
|
|
break;
|
|
|
|
case MachineOperand::MO_FrameIndex:
|
2009-06-24 17:54:48 +00:00
|
|
|
OS << "<fi#" << getIndex() << '>';
|
2007-12-30 21:56:09 +00:00
|
|
|
break;
|
|
|
|
case MachineOperand::MO_ConstantPoolIndex:
|
2007-12-30 23:10:15 +00:00
|
|
|
OS << "<cp#" << getIndex();
|
2007-12-30 21:56:09 +00:00
|
|
|
if (getOffset()) OS << "+" << getOffset();
|
2009-06-24 17:54:48 +00:00
|
|
|
OS << '>';
|
2007-12-30 21:56:09 +00:00
|
|
|
break;
|
|
|
|
case MachineOperand::MO_JumpTableIndex:
|
2009-06-24 17:54:48 +00:00
|
|
|
OS << "<jt#" << getIndex() << '>';
|
2007-12-30 21:56:09 +00:00
|
|
|
break;
|
|
|
|
case MachineOperand::MO_GlobalAddress:
|
2009-11-06 18:03:10 +00:00
|
|
|
OS << "<ga:";
|
|
|
|
WriteAsOperand(OS, getGlobal(), /*PrintType=*/false);
|
2007-12-30 21:56:09 +00:00
|
|
|
if (getOffset()) OS << "+" << getOffset();
|
2009-06-24 17:54:48 +00:00
|
|
|
OS << '>';
|
2007-12-30 21:56:09 +00:00
|
|
|
break;
|
|
|
|
case MachineOperand::MO_ExternalSymbol:
|
|
|
|
OS << "<es:" << getSymbolName();
|
|
|
|
if (getOffset()) OS << "+" << getOffset();
|
2009-06-24 17:54:48 +00:00
|
|
|
OS << '>';
|
2007-12-30 21:56:09 +00:00
|
|
|
break;
|
2009-10-30 01:27:03 +00:00
|
|
|
case MachineOperand::MO_BlockAddress:
|
2010-01-13 00:00:24 +00:00
|
|
|
OS << '<';
|
2009-10-31 20:19:03 +00:00
|
|
|
WriteAsOperand(OS, getBlockAddress(), /*PrintType=*/false);
|
2009-10-30 01:27:03 +00:00
|
|
|
OS << '>';
|
|
|
|
break;
|
2010-01-13 00:00:24 +00:00
|
|
|
case MachineOperand::MO_Metadata:
|
|
|
|
OS << '<';
|
|
|
|
WriteAsOperand(OS, getMetadata(), /*PrintType=*/false);
|
|
|
|
OS << '>';
|
|
|
|
break;
|
2010-03-13 08:14:18 +00:00
|
|
|
case MachineOperand::MO_MCSymbol:
|
|
|
|
OS << "<MCSym=" << *getMCSymbol() << '>';
|
|
|
|
break;
|
2007-12-30 21:56:09 +00:00
|
|
|
default:
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable("Unrecognized operand type");
|
2007-12-30 21:56:09 +00:00
|
|
|
}
|
2009-06-24 17:54:48 +00:00
|
|
|
|
|
|
|
if (unsigned TF = getTargetFlags())
|
|
|
|
OS << "[TF=" << TF << ']';
|
2007-12-30 21:56:09 +00:00
|
|
|
}
|
|
|
|
|
2008-07-07 20:32:02 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// MachineMemOperand Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
MachineMemOperand::MachineMemOperand(const Value *v, unsigned int f,
|
|
|
|
int64_t o, uint64_t s, unsigned int a)
|
|
|
|
: Offset(o), Size(s), V(v),
|
2010-02-15 16:48:31 +00:00
|
|
|
Flags((f & ((1 << MOMaxBits) - 1)) | ((Log2_32(a) + 1) << MOMaxBits)) {
|
2009-09-21 19:47:04 +00:00
|
|
|
assert(getBaseAlignment() == a && "Alignment is not a power of 2!");
|
2008-07-16 15:56:42 +00:00
|
|
|
assert((isLoad() || isStore()) && "Not a load/store!");
|
2008-07-07 20:32:02 +00:00
|
|
|
}
|
|
|
|
|
2008-08-20 15:58:01 +00:00
|
|
|
/// Profile - Gather unique data for the object.
|
|
|
|
///
|
|
|
|
void MachineMemOperand::Profile(FoldingSetNodeID &ID) const {
|
|
|
|
ID.AddInteger(Offset);
|
|
|
|
ID.AddInteger(Size);
|
|
|
|
ID.AddPointer(V);
|
|
|
|
ID.AddInteger(Flags);
|
|
|
|
}
|
|
|
|
|
2009-09-25 20:36:54 +00:00
|
|
|
void MachineMemOperand::refineAlignment(const MachineMemOperand *MMO) {
|
|
|
|
// The Value and Offset may differ due to CSE. But the flags and size
|
|
|
|
// should be the same.
|
|
|
|
assert(MMO->getFlags() == getFlags() && "Flags mismatch!");
|
|
|
|
assert(MMO->getSize() == getSize() && "Size mismatch!");
|
|
|
|
|
|
|
|
if (MMO->getBaseAlignment() >= getBaseAlignment()) {
|
|
|
|
// Update the alignment value.
|
2010-02-15 16:48:31 +00:00
|
|
|
Flags = (Flags & ((1 << MOMaxBits) - 1)) |
|
|
|
|
((Log2_32(MMO->getBaseAlignment()) + 1) << MOMaxBits);
|
2009-09-25 20:36:54 +00:00
|
|
|
// Also update the base and offset, because the new alignment may
|
|
|
|
// not be applicable with the old ones.
|
|
|
|
V = MMO->getValue();
|
|
|
|
Offset = MMO->getOffset();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-09-25 23:33:20 +00:00
|
|
|
/// getAlignment - Return the minimum known alignment in bytes of the
|
|
|
|
/// actual memory reference.
|
|
|
|
uint64_t MachineMemOperand::getAlignment() const {
|
|
|
|
return MinAlign(getBaseAlignment(), getOffset());
|
|
|
|
}
|
|
|
|
|
2009-09-25 20:36:54 +00:00
|
|
|
raw_ostream &llvm::operator<<(raw_ostream &OS, const MachineMemOperand &MMO) {
|
|
|
|
assert((MMO.isLoad() || MMO.isStore()) &&
|
2009-09-23 01:33:16 +00:00
|
|
|
"SV has to be a load, store or both.");
|
|
|
|
|
2009-09-25 20:36:54 +00:00
|
|
|
if (MMO.isVolatile())
|
2009-09-23 01:33:16 +00:00
|
|
|
OS << "Volatile ";
|
|
|
|
|
2009-09-25 20:36:54 +00:00
|
|
|
if (MMO.isLoad())
|
2009-09-23 01:33:16 +00:00
|
|
|
OS << "LD";
|
2009-09-25 20:36:54 +00:00
|
|
|
if (MMO.isStore())
|
2009-09-23 01:33:16 +00:00
|
|
|
OS << "ST";
|
2009-09-25 20:36:54 +00:00
|
|
|
OS << MMO.getSize();
|
2009-09-23 01:33:16 +00:00
|
|
|
|
|
|
|
// Print the address information.
|
|
|
|
OS << "[";
|
2009-09-25 20:36:54 +00:00
|
|
|
if (!MMO.getValue())
|
2009-09-23 01:33:16 +00:00
|
|
|
OS << "<unknown>";
|
|
|
|
else
|
2009-09-25 20:36:54 +00:00
|
|
|
WriteAsOperand(OS, MMO.getValue(), /*PrintType=*/false);
|
2009-09-23 01:33:16 +00:00
|
|
|
|
|
|
|
// If the alignment of the memory reference itself differs from the alignment
|
|
|
|
// of the base pointer, print the base alignment explicitly, next to the base
|
|
|
|
// pointer.
|
2009-09-25 20:36:54 +00:00
|
|
|
if (MMO.getBaseAlignment() != MMO.getAlignment())
|
|
|
|
OS << "(align=" << MMO.getBaseAlignment() << ")";
|
2009-09-23 01:33:16 +00:00
|
|
|
|
2009-09-25 20:36:54 +00:00
|
|
|
if (MMO.getOffset() != 0)
|
|
|
|
OS << "+" << MMO.getOffset();
|
2009-09-23 01:33:16 +00:00
|
|
|
OS << "]";
|
|
|
|
|
|
|
|
// Print the alignment of the reference.
|
2009-09-25 20:36:54 +00:00
|
|
|
if (MMO.getBaseAlignment() != MMO.getAlignment() ||
|
|
|
|
MMO.getBaseAlignment() != MMO.getSize())
|
|
|
|
OS << "(align=" << MMO.getAlignment() << ")";
|
2009-09-23 01:33:16 +00:00
|
|
|
|
|
|
|
return OS;
|
|
|
|
}
|
|
|
|
|
2007-12-30 21:56:09 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// MachineInstr Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2006-11-27 23:37:22 +00:00
|
|
|
/// MachineInstr ctor - This constructor creates a dummy MachineInstr with
|
2006-11-30 07:08:44 +00:00
|
|
|
/// TID NULL and no operands.
|
2006-11-27 23:37:22 +00:00
|
|
|
MachineInstr::MachineInstr()
|
2009-11-16 22:49:38 +00:00
|
|
|
: TID(0), NumImplicitOps(0), AsmPrinterFlags(0), MemRefs(0), MemRefsEnd(0),
|
2010-04-02 20:17:23 +00:00
|
|
|
Parent(0) {
|
2008-07-17 23:49:46 +00:00
|
|
|
// Make sure that we get added to a machine basicblock
|
|
|
|
LeakDetector::addGarbageObject(this);
|
2002-10-28 20:59:49 +00:00
|
|
|
}
|
|
|
|
|
2006-11-30 07:08:44 +00:00
|
|
|
void MachineInstr::addImplicitDefUseOperands() {
|
|
|
|
if (TID->ImplicitDefs)
|
2007-12-30 00:12:25 +00:00
|
|
|
for (const unsigned *ImpDefs = TID->ImplicitDefs; *ImpDefs; ++ImpDefs)
|
2007-12-30 00:41:17 +00:00
|
|
|
addOperand(MachineOperand::CreateReg(*ImpDefs, true, true));
|
2006-11-30 07:08:44 +00:00
|
|
|
if (TID->ImplicitUses)
|
2007-12-30 00:12:25 +00:00
|
|
|
for (const unsigned *ImpUses = TID->ImplicitUses; *ImpUses; ++ImpUses)
|
2007-12-30 00:41:17 +00:00
|
|
|
addOperand(MachineOperand::CreateReg(*ImpUses, false, true));
|
2006-11-13 23:34:06 +00:00
|
|
|
}
|
|
|
|
|
2010-04-09 04:34:03 +00:00
|
|
|
/// MachineInstr ctor - This constructor creates a MachineInstr and adds the
|
|
|
|
/// implicit operands. It reserves space for the number of operands specified by
|
|
|
|
/// the TargetInstrDesc.
|
2008-01-07 07:27:27 +00:00
|
|
|
MachineInstr::MachineInstr(const TargetInstrDesc &tid, bool NoImp)
|
2009-11-16 22:49:38 +00:00
|
|
|
: TID(&tid), NumImplicitOps(0), AsmPrinterFlags(0),
|
2010-04-02 20:17:23 +00:00
|
|
|
MemRefs(0), MemRefsEnd(0), Parent(0) {
|
2010-04-09 04:46:43 +00:00
|
|
|
if (!NoImp)
|
|
|
|
NumImplicitOps = TID->getNumImplicitDefs() + TID->getNumImplicitUses();
|
2008-01-07 03:13:06 +00:00
|
|
|
Operands.reserve(NumImplicitOps + TID->getNumOperands());
|
2007-10-13 02:23:01 +00:00
|
|
|
if (!NoImp)
|
|
|
|
addImplicitDefUseOperands();
|
2008-07-17 23:49:46 +00:00
|
|
|
// Make sure that we get added to a machine basicblock
|
|
|
|
LeakDetector::addGarbageObject(this);
|
2006-11-13 23:34:06 +00:00
|
|
|
}
|
|
|
|
|
2009-01-27 23:20:29 +00:00
|
|
|
/// MachineInstr ctor - As above, but with a DebugLoc.
|
|
|
|
MachineInstr::MachineInstr(const TargetInstrDesc &tid, const DebugLoc dl,
|
|
|
|
bool NoImp)
|
2009-11-16 22:49:38 +00:00
|
|
|
: TID(&tid), NumImplicitOps(0), AsmPrinterFlags(0), MemRefs(0), MemRefsEnd(0),
|
2009-09-25 20:36:54 +00:00
|
|
|
Parent(0), debugLoc(dl) {
|
2010-04-09 04:46:43 +00:00
|
|
|
if (!NoImp)
|
|
|
|
NumImplicitOps = TID->getNumImplicitDefs() + TID->getNumImplicitUses();
|
2009-01-27 23:20:29 +00:00
|
|
|
Operands.reserve(NumImplicitOps + TID->getNumOperands());
|
|
|
|
if (!NoImp)
|
|
|
|
addImplicitDefUseOperands();
|
|
|
|
// Make sure that we get added to a machine basicblock
|
|
|
|
LeakDetector::addGarbageObject(this);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// MachineInstr ctor - Work exactly the same as the ctor two above, except
|
|
|
|
/// that the MachineInstr is created and added to the end of the specified
|
|
|
|
/// basic block.
|
|
|
|
MachineInstr::MachineInstr(MachineBasicBlock *MBB, const TargetInstrDesc &tid)
|
2009-11-16 22:49:38 +00:00
|
|
|
: TID(&tid), NumImplicitOps(0), AsmPrinterFlags(0),
|
2010-04-02 20:17:23 +00:00
|
|
|
MemRefs(0), MemRefsEnd(0), Parent(0) {
|
2009-01-27 23:20:29 +00:00
|
|
|
assert(MBB && "Cannot use inserting ctor with null basic block!");
|
2010-04-09 04:46:43 +00:00
|
|
|
NumImplicitOps = TID->getNumImplicitDefs() + TID->getNumImplicitUses();
|
2009-01-27 23:20:29 +00:00
|
|
|
Operands.reserve(NumImplicitOps + TID->getNumOperands());
|
|
|
|
addImplicitDefUseOperands();
|
|
|
|
// Make sure that we get added to a machine basicblock
|
|
|
|
LeakDetector::addGarbageObject(this);
|
|
|
|
MBB->push_back(this); // Add instruction to end of basic block!
|
|
|
|
}
|
|
|
|
|
|
|
|
/// MachineInstr ctor - As above, but with a DebugLoc.
|
2002-10-29 23:19:00 +00:00
|
|
|
///
|
2009-01-27 23:20:29 +00:00
|
|
|
MachineInstr::MachineInstr(MachineBasicBlock *MBB, const DebugLoc dl,
|
2008-01-07 07:27:27 +00:00
|
|
|
const TargetInstrDesc &tid)
|
2009-11-16 22:49:38 +00:00
|
|
|
: TID(&tid), NumImplicitOps(0), AsmPrinterFlags(0), MemRefs(0), MemRefsEnd(0),
|
2009-09-25 20:36:54 +00:00
|
|
|
Parent(0), debugLoc(dl) {
|
2002-10-29 23:19:00 +00:00
|
|
|
assert(MBB && "Cannot use inserting ctor with null basic block!");
|
2010-04-09 04:46:43 +00:00
|
|
|
NumImplicitOps = TID->getNumImplicitDefs() + TID->getNumImplicitUses();
|
2008-01-07 03:13:06 +00:00
|
|
|
Operands.reserve(NumImplicitOps + TID->getNumOperands());
|
2006-11-30 07:08:44 +00:00
|
|
|
addImplicitDefUseOperands();
|
2008-07-17 23:49:46 +00:00
|
|
|
// Make sure that we get added to a machine basicblock
|
|
|
|
LeakDetector::addGarbageObject(this);
|
2002-10-29 23:19:00 +00:00
|
|
|
MBB->push_back(this); // Add instruction to end of basic block!
|
|
|
|
}
|
|
|
|
|
2004-07-09 14:45:17 +00:00
|
|
|
/// MachineInstr ctor - Copies MachineInstr arg exactly
|
|
|
|
///
|
2008-07-19 00:37:25 +00:00
|
|
|
MachineInstr::MachineInstr(MachineFunction &MF, const MachineInstr &MI)
|
2009-11-16 22:49:38 +00:00
|
|
|
: TID(&MI.getDesc()), NumImplicitOps(0), AsmPrinterFlags(0),
|
2009-09-25 20:36:54 +00:00
|
|
|
MemRefs(MI.MemRefs), MemRefsEnd(MI.MemRefsEnd),
|
|
|
|
Parent(0), debugLoc(MI.getDebugLoc()) {
|
2006-05-04 19:14:44 +00:00
|
|
|
Operands.reserve(MI.getNumOperands());
|
2004-05-23 20:58:02 +00:00
|
|
|
|
2004-07-09 14:45:17 +00:00
|
|
|
// Add operands
|
2008-07-19 00:37:25 +00:00
|
|
|
for (unsigned i = 0; i != MI.getNumOperands(); ++i)
|
|
|
|
addOperand(MI.getOperand(i));
|
|
|
|
NumImplicitOps = MI.NumImplicitOps;
|
2004-05-24 03:14:18 +00:00
|
|
|
|
2008-07-07 23:14:23 +00:00
|
|
|
// Set parent to null.
|
2007-12-31 04:56:33 +00:00
|
|
|
Parent = 0;
|
2008-07-21 18:47:29 +00:00
|
|
|
|
|
|
|
LeakDetector::addGarbageObject(this);
|
2004-05-23 19:35:12 +00:00
|
|
|
}
|
|
|
|
|
2004-07-09 14:45:17 +00:00
|
|
|
MachineInstr::~MachineInstr() {
|
2008-07-17 23:49:46 +00:00
|
|
|
LeakDetector::removeGarbageObject(this);
|
2007-12-30 06:11:04 +00:00
|
|
|
#ifndef NDEBUG
|
2008-01-01 01:12:31 +00:00
|
|
|
for (unsigned i = 0, e = Operands.size(); i != e; ++i) {
|
2007-12-30 06:11:04 +00:00
|
|
|
assert(Operands[i].ParentMI == this && "ParentMI mismatch!");
|
2008-10-03 15:45:36 +00:00
|
|
|
assert((!Operands[i].isReg() || !Operands[i].isOnRegUseList()) &&
|
2008-01-01 01:12:31 +00:00
|
|
|
"Reg operand def/use list corrupted");
|
|
|
|
}
|
2007-12-30 06:11:04 +00:00
|
|
|
#endif
|
2004-02-16 07:17:43 +00:00
|
|
|
}
|
|
|
|
|
2008-01-01 01:12:31 +00:00
|
|
|
/// getRegInfo - If this instruction is embedded into a MachineFunction,
|
|
|
|
/// return the MachineRegisterInfo object for the current function, otherwise
|
|
|
|
/// return null.
|
|
|
|
MachineRegisterInfo *MachineInstr::getRegInfo() {
|
|
|
|
if (MachineBasicBlock *MBB = getParent())
|
2008-07-08 23:59:09 +00:00
|
|
|
return &MBB->getParent()->getRegInfo();
|
2008-01-01 01:12:31 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// RemoveRegOperandsFromUseLists - Unlink all of the register operands in
|
|
|
|
/// this instruction from their respective use lists. This requires that the
|
|
|
|
/// operands already be on their use lists.
|
|
|
|
void MachineInstr::RemoveRegOperandsFromUseLists() {
|
|
|
|
for (unsigned i = 0, e = Operands.size(); i != e; ++i) {
|
2008-10-03 15:45:36 +00:00
|
|
|
if (Operands[i].isReg())
|
2008-01-01 01:12:31 +00:00
|
|
|
Operands[i].RemoveRegOperandFromRegInfo();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// AddRegOperandsToUseLists - Add all of the register operands in
|
|
|
|
/// this instruction from their respective use lists. This requires that the
|
|
|
|
/// operands not be on their use lists yet.
|
|
|
|
void MachineInstr::AddRegOperandsToUseLists(MachineRegisterInfo &RegInfo) {
|
|
|
|
for (unsigned i = 0, e = Operands.size(); i != e; ++i) {
|
2008-10-03 15:45:36 +00:00
|
|
|
if (Operands[i].isReg())
|
2008-01-01 01:12:31 +00:00
|
|
|
Operands[i].AddRegOperandToRegInfo(&RegInfo);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/// addOperand - Add the specified operand to the instruction. If it is an
|
|
|
|
/// implicit operand, it is added to the end of the operand list. If it is
|
|
|
|
/// an explicit operand it is added at the end of the explicit operand list
|
|
|
|
/// (before the first implicit operand).
|
|
|
|
void MachineInstr::addOperand(const MachineOperand &Op) {
|
2008-10-03 15:45:36 +00:00
|
|
|
bool isImpReg = Op.isReg() && Op.isImplicit();
|
2008-01-01 01:12:31 +00:00
|
|
|
assert((isImpReg || !OperandsComplete()) &&
|
|
|
|
"Trying to add an operand to a machine instr that is already done!");
|
|
|
|
|
2008-12-09 22:45:08 +00:00
|
|
|
MachineRegisterInfo *RegInfo = getRegInfo();
|
|
|
|
|
2008-01-01 01:12:31 +00:00
|
|
|
// If we are adding the operand to the end of the list, our job is simpler.
|
|
|
|
// This is true most of the time, so this is a reasonable optimization.
|
|
|
|
if (isImpReg || NumImplicitOps == 0) {
|
|
|
|
// We can only do this optimization if we know that the operand list won't
|
|
|
|
// reallocate.
|
|
|
|
if (Operands.empty() || Operands.size()+1 <= Operands.capacity()) {
|
|
|
|
Operands.push_back(Op);
|
|
|
|
|
|
|
|
// Set the parent of the operand.
|
|
|
|
Operands.back().ParentMI = this;
|
|
|
|
|
|
|
|
// If the operand is a register, update the operand's use list.
|
2009-12-16 19:43:02 +00:00
|
|
|
if (Op.isReg()) {
|
2008-12-09 22:45:08 +00:00
|
|
|
Operands.back().AddRegOperandToRegInfo(RegInfo);
|
2009-12-16 19:43:02 +00:00
|
|
|
// If the register operand is flagged as early, mark the operand as such
|
|
|
|
unsigned OpNo = Operands.size() - 1;
|
|
|
|
if (TID->getOperandConstraint(OpNo, TOI::EARLY_CLOBBER) != -1)
|
|
|
|
Operands[OpNo].setIsEarlyClobber(true);
|
|
|
|
}
|
2008-01-01 01:12:31 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Otherwise, we have to insert a real operand before any implicit ones.
|
|
|
|
unsigned OpNo = Operands.size()-NumImplicitOps;
|
|
|
|
|
|
|
|
// If this instruction isn't embedded into a function, then we don't need to
|
|
|
|
// update any operand lists.
|
|
|
|
if (RegInfo == 0) {
|
|
|
|
// Simple insertion, no reginfo update needed for other register operands.
|
|
|
|
Operands.insert(Operands.begin()+OpNo, Op);
|
|
|
|
Operands[OpNo].ParentMI = this;
|
|
|
|
|
|
|
|
// Do explicitly set the reginfo for this operand though, to ensure the
|
|
|
|
// next/prev fields are properly nulled out.
|
2009-12-16 19:43:02 +00:00
|
|
|
if (Operands[OpNo].isReg()) {
|
2008-01-01 01:12:31 +00:00
|
|
|
Operands[OpNo].AddRegOperandToRegInfo(0);
|
2009-12-16 19:43:02 +00:00
|
|
|
// If the register operand is flagged as early, mark the operand as such
|
|
|
|
if (TID->getOperandConstraint(OpNo, TOI::EARLY_CLOBBER) != -1)
|
|
|
|
Operands[OpNo].setIsEarlyClobber(true);
|
|
|
|
}
|
2008-01-01 01:12:31 +00:00
|
|
|
|
|
|
|
} else if (Operands.size()+1 <= Operands.capacity()) {
|
|
|
|
// Otherwise, we have to remove register operands from their register use
|
|
|
|
// list, add the operand, then add the register operands back to their use
|
|
|
|
// list. This also must handle the case when the operand list reallocates
|
|
|
|
// to somewhere else.
|
|
|
|
|
|
|
|
// If insertion of this operand won't cause reallocation of the operand
|
|
|
|
// list, just remove the implicit operands, add the operand, then re-add all
|
|
|
|
// the rest of the operands.
|
|
|
|
for (unsigned i = OpNo, e = Operands.size(); i != e; ++i) {
|
2008-10-03 15:45:36 +00:00
|
|
|
assert(Operands[i].isReg() && "Should only be an implicit reg!");
|
2008-01-01 01:12:31 +00:00
|
|
|
Operands[i].RemoveRegOperandFromRegInfo();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Add the operand. If it is a register, add it to the reg list.
|
|
|
|
Operands.insert(Operands.begin()+OpNo, Op);
|
|
|
|
Operands[OpNo].ParentMI = this;
|
|
|
|
|
2009-12-16 19:43:02 +00:00
|
|
|
if (Operands[OpNo].isReg()) {
|
2008-01-01 01:12:31 +00:00
|
|
|
Operands[OpNo].AddRegOperandToRegInfo(RegInfo);
|
2009-12-16 19:43:02 +00:00
|
|
|
// If the register operand is flagged as early, mark the operand as such
|
|
|
|
if (TID->getOperandConstraint(OpNo, TOI::EARLY_CLOBBER) != -1)
|
|
|
|
Operands[OpNo].setIsEarlyClobber(true);
|
|
|
|
}
|
2008-01-01 01:12:31 +00:00
|
|
|
|
|
|
|
// Re-add all the implicit ops.
|
|
|
|
for (unsigned i = OpNo+1, e = Operands.size(); i != e; ++i) {
|
2008-10-03 15:45:36 +00:00
|
|
|
assert(Operands[i].isReg() && "Should only be an implicit reg!");
|
2008-01-01 01:12:31 +00:00
|
|
|
Operands[i].AddRegOperandToRegInfo(RegInfo);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// Otherwise, we will be reallocating the operand list. Remove all reg
|
|
|
|
// operands from their list, then readd them after the operand list is
|
|
|
|
// reallocated.
|
|
|
|
RemoveRegOperandsFromUseLists();
|
|
|
|
|
|
|
|
Operands.insert(Operands.begin()+OpNo, Op);
|
|
|
|
Operands[OpNo].ParentMI = this;
|
|
|
|
|
|
|
|
// Re-add all the operands.
|
|
|
|
AddRegOperandsToUseLists(*RegInfo);
|
2009-12-16 19:43:02 +00:00
|
|
|
|
|
|
|
// If the register operand is flagged as early, mark the operand as such
|
|
|
|
if (Operands[OpNo].isReg()
|
|
|
|
&& TID->getOperandConstraint(OpNo, TOI::EARLY_CLOBBER) != -1)
|
|
|
|
Operands[OpNo].setIsEarlyClobber(true);
|
2008-01-01 01:12:31 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// RemoveOperand - Erase an operand from an instruction, leaving it with one
|
|
|
|
/// fewer operand than it started with.
|
|
|
|
///
|
|
|
|
void MachineInstr::RemoveOperand(unsigned OpNo) {
|
|
|
|
assert(OpNo < Operands.size() && "Invalid operand number");
|
|
|
|
|
|
|
|
// Special case removing the last one.
|
|
|
|
if (OpNo == Operands.size()-1) {
|
|
|
|
// If needed, remove from the reg def/use list.
|
2008-10-03 15:45:36 +00:00
|
|
|
if (Operands.back().isReg() && Operands.back().isOnRegUseList())
|
2008-01-01 01:12:31 +00:00
|
|
|
Operands.back().RemoveRegOperandFromRegInfo();
|
|
|
|
|
|
|
|
Operands.pop_back();
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Otherwise, we are removing an interior operand. If we have reginfo to
|
|
|
|
// update, remove all operands that will be shifted down from their reg lists,
|
|
|
|
// move everything down, then re-add them.
|
|
|
|
MachineRegisterInfo *RegInfo = getRegInfo();
|
|
|
|
if (RegInfo) {
|
|
|
|
for (unsigned i = OpNo, e = Operands.size(); i != e; ++i) {
|
2008-10-03 15:45:36 +00:00
|
|
|
if (Operands[i].isReg())
|
2008-01-01 01:12:31 +00:00
|
|
|
Operands[i].RemoveRegOperandFromRegInfo();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Operands.erase(Operands.begin()+OpNo);
|
|
|
|
|
|
|
|
if (RegInfo) {
|
|
|
|
for (unsigned i = OpNo, e = Operands.size(); i != e; ++i) {
|
2008-10-03 15:45:36 +00:00
|
|
|
if (Operands[i].isReg())
|
2008-01-01 01:12:31 +00:00
|
|
|
Operands[i].AddRegOperandToRegInfo(RegInfo);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-09-25 20:36:54 +00:00
|
|
|
/// addMemOperand - Add a MachineMemOperand to the machine instruction.
|
|
|
|
/// This function should be used only occasionally. The setMemRefs function
|
|
|
|
/// is the primary method for setting up a MachineInstr's MemRefs list.
|
2008-07-07 23:14:23 +00:00
|
|
|
void MachineInstr::addMemOperand(MachineFunction &MF,
|
2009-09-25 20:36:54 +00:00
|
|
|
MachineMemOperand *MO) {
|
|
|
|
mmo_iterator OldMemRefs = MemRefs;
|
|
|
|
mmo_iterator OldMemRefsEnd = MemRefsEnd;
|
2008-07-07 23:14:23 +00:00
|
|
|
|
2009-09-25 20:36:54 +00:00
|
|
|
size_t NewNum = (MemRefsEnd - MemRefs) + 1;
|
|
|
|
mmo_iterator NewMemRefs = MF.allocateMemRefsArray(NewNum);
|
|
|
|
mmo_iterator NewMemRefsEnd = NewMemRefs + NewNum;
|
2008-07-07 23:14:23 +00:00
|
|
|
|
2009-09-25 20:36:54 +00:00
|
|
|
std::copy(OldMemRefs, OldMemRefsEnd, NewMemRefs);
|
|
|
|
NewMemRefs[NewNum - 1] = MO;
|
|
|
|
|
|
|
|
MemRefs = NewMemRefs;
|
|
|
|
MemRefsEnd = NewMemRefsEnd;
|
|
|
|
}
|
2008-01-01 01:12:31 +00:00
|
|
|
|
2010-03-03 01:44:33 +00:00
|
|
|
bool MachineInstr::isIdenticalTo(const MachineInstr *Other,
|
|
|
|
MICheckType Check) const {
|
2010-03-03 21:54:14 +00:00
|
|
|
// If opcodes or number of operands are not the same then the two
|
|
|
|
// instructions are obviously not identical.
|
|
|
|
if (Other->getOpcode() != getOpcode() ||
|
|
|
|
Other->getNumOperands() != getNumOperands())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Check operands to make sure they match.
|
|
|
|
for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
|
|
|
|
const MachineOperand &MO = getOperand(i);
|
|
|
|
const MachineOperand &OMO = Other->getOperand(i);
|
|
|
|
// Clients may or may not want to ignore defs when testing for equality.
|
|
|
|
// For example, machine CSE pass only cares about finding common
|
|
|
|
// subexpressions, so it's safe to ignore virtual register defs.
|
|
|
|
if (Check != CheckDefs && MO.isReg() && MO.isDef()) {
|
|
|
|
if (Check == IgnoreDefs)
|
|
|
|
continue;
|
|
|
|
// Check == IgnoreVRegDefs
|
|
|
|
if (TargetRegisterInfo::isPhysicalRegister(MO.getReg()) ||
|
|
|
|
TargetRegisterInfo::isPhysicalRegister(OMO.getReg()))
|
|
|
|
if (MO.getReg() != OMO.getReg())
|
|
|
|
return false;
|
|
|
|
} else if (!MO.isIdenticalTo(OMO))
|
2010-03-03 01:44:33 +00:00
|
|
|
return false;
|
2010-03-03 21:54:14 +00:00
|
|
|
}
|
|
|
|
return true;
|
2010-03-03 01:44:33 +00:00
|
|
|
}
|
|
|
|
|
2006-04-17 21:35:41 +00:00
|
|
|
/// removeFromParent - This method unlinks 'this' from the containing basic
|
|
|
|
/// block, and returns it, but does not delete it.
|
|
|
|
MachineInstr *MachineInstr::removeFromParent() {
|
|
|
|
assert(getParent() && "Not embedded in a basic block!");
|
|
|
|
getParent()->remove(this);
|
|
|
|
return this;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-07-07 23:14:23 +00:00
|
|
|
/// eraseFromParent - This method unlinks 'this' from the containing basic
|
|
|
|
/// block, and deletes it.
|
|
|
|
void MachineInstr::eraseFromParent() {
|
|
|
|
assert(getParent() && "Not embedded in a basic block!");
|
|
|
|
getParent()->erase(this);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-02-13 04:39:32 +00:00
|
|
|
/// OperandComplete - Return true if it's illegal to add a new operand
|
|
|
|
///
|
2004-02-12 16:09:53 +00:00
|
|
|
bool MachineInstr::OperandsComplete() const {
|
2008-01-07 03:13:06 +00:00
|
|
|
unsigned short NumOperands = TID->getNumOperands();
|
2008-01-07 05:19:29 +00:00
|
|
|
if (!TID->isVariadic() && getNumOperands()-NumImplicitOps >= NumOperands)
|
2003-05-31 07:39:06 +00:00
|
|
|
return true; // Broken: we have all the operands of this instruction!
|
2002-10-28 20:48:39 +00:00
|
|
|
return false;
|
2001-07-21 12:41:50 +00:00
|
|
|
}
|
|
|
|
|
2007-05-15 01:26:09 +00:00
|
|
|
/// getNumExplicitOperands - Returns the number of non-implicit operands.
|
|
|
|
///
|
|
|
|
unsigned MachineInstr::getNumExplicitOperands() const {
|
2008-01-07 03:13:06 +00:00
|
|
|
unsigned NumOperands = TID->getNumOperands();
|
2008-01-07 05:19:29 +00:00
|
|
|
if (!TID->isVariadic())
|
2007-05-15 01:26:09 +00:00
|
|
|
return NumOperands;
|
|
|
|
|
2009-04-15 17:59:11 +00:00
|
|
|
for (unsigned i = NumOperands, e = getNumOperands(); i != e; ++i) {
|
|
|
|
const MachineOperand &MO = getOperand(i);
|
2008-10-03 15:45:36 +00:00
|
|
|
if (!MO.isReg() || !MO.isImplicit())
|
2007-05-15 01:26:09 +00:00
|
|
|
NumOperands++;
|
|
|
|
}
|
|
|
|
return NumOperands;
|
|
|
|
}
|
|
|
|
|
2006-10-20 22:39:59 +00:00
|
|
|
|
2007-04-26 19:00:32 +00:00
|
|
|
/// findRegisterUseOperandIdx() - Returns the MachineOperand that is a use of
|
2009-09-17 17:57:26 +00:00
|
|
|
/// the specific register or -1 if it is not found. It further tightens
|
2007-02-23 01:04:26 +00:00
|
|
|
/// the search criteria to a use that kills the register if isKill is true.
|
2008-03-05 00:59:57 +00:00
|
|
|
int MachineInstr::findRegisterUseOperandIdx(unsigned Reg, bool isKill,
|
|
|
|
const TargetRegisterInfo *TRI) const {
|
2006-12-06 08:27:42 +00:00
|
|
|
for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
|
2007-05-29 18:35:22 +00:00
|
|
|
const MachineOperand &MO = getOperand(i);
|
2008-10-03 15:45:36 +00:00
|
|
|
if (!MO.isReg() || !MO.isUse())
|
2008-03-05 00:59:57 +00:00
|
|
|
continue;
|
|
|
|
unsigned MOReg = MO.getReg();
|
|
|
|
if (!MOReg)
|
|
|
|
continue;
|
|
|
|
if (MOReg == Reg ||
|
|
|
|
(TRI &&
|
|
|
|
TargetRegisterInfo::isPhysicalRegister(MOReg) &&
|
|
|
|
TargetRegisterInfo::isPhysicalRegister(Reg) &&
|
|
|
|
TRI->isSubRegister(MOReg, Reg)))
|
2007-02-23 01:04:26 +00:00
|
|
|
if (!isKill || MO.isKill())
|
2007-03-26 22:37:45 +00:00
|
|
|
return i;
|
2007-02-19 21:49:54 +00:00
|
|
|
}
|
2007-03-26 22:37:45 +00:00
|
|
|
return -1;
|
2007-02-19 21:49:54 +00:00
|
|
|
}
|
2010-05-19 20:36:22 +00:00
|
|
|
|
2010-05-21 20:02:01 +00:00
|
|
|
/// readsWritesVirtualRegister - Return a pair of bools (reads, writes)
|
|
|
|
/// indicating if this instruction reads or writes Reg. This also considers
|
|
|
|
/// partial defines.
|
|
|
|
std::pair<bool,bool>
|
|
|
|
MachineInstr::readsWritesVirtualRegister(unsigned Reg,
|
|
|
|
SmallVectorImpl<unsigned> *Ops) const {
|
|
|
|
bool PartDef = false; // Partial redefine.
|
|
|
|
bool FullDef = false; // Full define.
|
|
|
|
bool Use = false;
|
2010-05-19 20:36:22 +00:00
|
|
|
|
|
|
|
for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
|
|
|
|
const MachineOperand &MO = getOperand(i);
|
|
|
|
if (!MO.isReg() || MO.getReg() != Reg)
|
|
|
|
continue;
|
2010-05-21 20:02:01 +00:00
|
|
|
if (Ops)
|
|
|
|
Ops->push_back(i);
|
2010-05-19 20:36:22 +00:00
|
|
|
if (MO.isUse())
|
2010-05-21 20:02:01 +00:00
|
|
|
Use |= !MO.isUndef();
|
|
|
|
else if (MO.getSubReg())
|
2010-05-19 20:36:22 +00:00
|
|
|
PartDef = true;
|
|
|
|
else
|
|
|
|
FullDef = true;
|
|
|
|
}
|
2010-05-21 20:02:01 +00:00
|
|
|
// A partial redefine uses Reg unless there is also a full define.
|
|
|
|
return std::make_pair(Use || (PartDef && !FullDef), PartDef || FullDef);
|
2010-05-19 20:36:22 +00:00
|
|
|
}
|
|
|
|
|
2008-03-05 00:59:57 +00:00
|
|
|
/// findRegisterDefOperandIdx() - Returns the operand index that is a def of
|
2008-05-06 00:20:10 +00:00
|
|
|
/// the specified register or -1 if it is not found. If isDead is true, defs
|
|
|
|
/// that are not dead are skipped. If TargetRegisterInfo is non-null, then it
|
|
|
|
/// also checks if there is a def of a super-register.
|
2010-05-21 20:53:24 +00:00
|
|
|
int
|
|
|
|
MachineInstr::findRegisterDefOperandIdx(unsigned Reg, bool isDead, bool Overlap,
|
|
|
|
const TargetRegisterInfo *TRI) const {
|
|
|
|
bool isPhys = TargetRegisterInfo::isPhysicalRegister(Reg);
|
2007-02-19 21:49:54 +00:00
|
|
|
for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
|
2008-03-05 00:59:57 +00:00
|
|
|
const MachineOperand &MO = getOperand(i);
|
2008-10-03 15:45:36 +00:00
|
|
|
if (!MO.isReg() || !MO.isDef())
|
2008-03-05 00:59:57 +00:00
|
|
|
continue;
|
|
|
|
unsigned MOReg = MO.getReg();
|
2010-05-21 20:53:24 +00:00
|
|
|
bool Found = (MOReg == Reg);
|
|
|
|
if (!Found && TRI && isPhys &&
|
|
|
|
TargetRegisterInfo::isPhysicalRegister(MOReg)) {
|
|
|
|
if (Overlap)
|
|
|
|
Found = TRI->regsOverlap(MOReg, Reg);
|
|
|
|
else
|
|
|
|
Found = TRI->isSubRegister(MOReg, Reg);
|
|
|
|
}
|
|
|
|
if (Found && (!isDead || MO.isDead()))
|
|
|
|
return i;
|
2006-12-06 08:27:42 +00:00
|
|
|
}
|
2008-03-05 00:59:57 +00:00
|
|
|
return -1;
|
2006-12-06 08:27:42 +00:00
|
|
|
}
|
2007-05-15 01:26:09 +00:00
|
|
|
|
2007-05-29 18:35:22 +00:00
|
|
|
/// findFirstPredOperandIdx() - Find the index of the first operand in the
|
|
|
|
/// operand list that is used to represent the predicate. It returns -1 if
|
|
|
|
/// none is found.
|
|
|
|
int MachineInstr::findFirstPredOperandIdx() const {
|
2008-01-07 07:27:27 +00:00
|
|
|
const TargetInstrDesc &TID = getDesc();
|
|
|
|
if (TID.isPredicable()) {
|
2007-05-15 01:26:09 +00:00
|
|
|
for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
|
2008-01-07 07:27:27 +00:00
|
|
|
if (TID.OpInfo[i].isPredicate())
|
2007-05-29 18:35:22 +00:00
|
|
|
return i;
|
2007-05-15 01:26:09 +00:00
|
|
|
}
|
|
|
|
|
2007-05-29 18:35:22 +00:00
|
|
|
return -1;
|
2007-05-15 01:26:09 +00:00
|
|
|
}
|
2006-12-06 08:27:42 +00:00
|
|
|
|
2009-04-09 17:16:43 +00:00
|
|
|
/// isRegTiedToUseOperand - Given the index of a register def operand,
|
|
|
|
/// check if the register def is tied to a source operand, due to either
|
|
|
|
/// two-address elimination or inline assembly constraints. Returns the
|
|
|
|
/// first tied use operand index by reference is UseOpIdx is not null.
|
2009-04-29 20:57:16 +00:00
|
|
|
bool MachineInstr::
|
|
|
|
isRegTiedToUseOperand(unsigned DefOpIdx, unsigned *UseOpIdx) const {
|
2010-02-09 19:54:29 +00:00
|
|
|
if (isInlineAsm()) {
|
2009-04-09 17:16:43 +00:00
|
|
|
assert(DefOpIdx >= 2);
|
|
|
|
const MachineOperand &MO = getOperand(DefOpIdx);
|
2009-04-09 23:33:34 +00:00
|
|
|
if (!MO.isReg() || !MO.isDef() || MO.getReg() == 0)
|
2009-03-23 08:01:15 +00:00
|
|
|
return false;
|
2009-06-24 02:05:51 +00:00
|
|
|
// Determine the actual operand index that corresponds to this index.
|
2009-03-23 08:01:15 +00:00
|
|
|
unsigned DefNo = 0;
|
2009-06-24 02:05:51 +00:00
|
|
|
unsigned DefPart = 0;
|
2009-03-23 08:01:15 +00:00
|
|
|
for (unsigned i = 1, e = getNumOperands(); i < e; ) {
|
|
|
|
const MachineOperand &FMO = getOperand(i);
|
2009-07-19 19:09:59 +00:00
|
|
|
// After the normal asm operands there may be additional imp-def regs.
|
|
|
|
if (!FMO.isImm())
|
|
|
|
return false;
|
2009-03-23 08:01:15 +00:00
|
|
|
// Skip over this def.
|
2009-06-24 02:05:51 +00:00
|
|
|
unsigned NumOps = InlineAsm::getNumOperandRegisters(FMO.getImm());
|
|
|
|
unsigned PrevDef = i + 1;
|
|
|
|
i = PrevDef + NumOps;
|
|
|
|
if (i > DefOpIdx) {
|
|
|
|
DefPart = DefOpIdx - PrevDef;
|
2009-03-23 08:01:15 +00:00
|
|
|
break;
|
2009-06-24 02:05:51 +00:00
|
|
|
}
|
2009-03-23 08:01:15 +00:00
|
|
|
++DefNo;
|
|
|
|
}
|
2009-06-24 02:05:51 +00:00
|
|
|
for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
|
2009-03-23 08:01:15 +00:00
|
|
|
const MachineOperand &FMO = getOperand(i);
|
|
|
|
if (!FMO.isImm())
|
|
|
|
continue;
|
|
|
|
if (i+1 >= e || !getOperand(i+1).isReg() || !getOperand(i+1).isUse())
|
|
|
|
continue;
|
|
|
|
unsigned Idx;
|
2009-06-24 02:05:51 +00:00
|
|
|
if (InlineAsm::isUseOperandTiedToDef(FMO.getImm(), Idx) &&
|
2009-04-09 17:16:43 +00:00
|
|
|
Idx == DefNo) {
|
|
|
|
if (UseOpIdx)
|
2009-06-24 02:05:51 +00:00
|
|
|
*UseOpIdx = (unsigned)i + 1 + DefPart;
|
2009-03-23 08:01:15 +00:00
|
|
|
return true;
|
2009-04-09 17:16:43 +00:00
|
|
|
}
|
2009-03-23 08:01:15 +00:00
|
|
|
}
|
2009-06-24 02:05:51 +00:00
|
|
|
return false;
|
2009-03-23 08:01:15 +00:00
|
|
|
}
|
|
|
|
|
2009-04-09 17:16:43 +00:00
|
|
|
assert(getOperand(DefOpIdx).isDef() && "DefOpIdx is not a def!");
|
2008-01-07 07:27:27 +00:00
|
|
|
const TargetInstrDesc &TID = getDesc();
|
2008-07-10 07:35:43 +00:00
|
|
|
for (unsigned i = 0, e = TID.getNumOperands(); i != e; ++i) {
|
|
|
|
const MachineOperand &MO = getOperand(i);
|
2008-12-05 05:45:42 +00:00
|
|
|
if (MO.isReg() && MO.isUse() &&
|
2009-04-09 17:16:43 +00:00
|
|
|
TID.getOperandConstraint(i, TOI::TIED_TO) == (int)DefOpIdx) {
|
|
|
|
if (UseOpIdx)
|
|
|
|
*UseOpIdx = (unsigned)i;
|
2008-07-10 07:35:43 +00:00
|
|
|
return true;
|
2009-04-09 17:16:43 +00:00
|
|
|
}
|
2007-10-12 08:50:34 +00:00
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2009-03-19 20:30:06 +00:00
|
|
|
/// isRegTiedToDefOperand - Return true if the operand of the specified index
|
|
|
|
/// is a register use and it is tied to an def operand. It also returns the def
|
|
|
|
/// operand index by reference.
|
2009-04-29 20:57:16 +00:00
|
|
|
bool MachineInstr::
|
|
|
|
isRegTiedToDefOperand(unsigned UseOpIdx, unsigned *DefOpIdx) const {
|
2010-02-09 19:54:29 +00:00
|
|
|
if (isInlineAsm()) {
|
2009-03-23 08:01:15 +00:00
|
|
|
const MachineOperand &MO = getOperand(UseOpIdx);
|
2009-04-09 16:50:43 +00:00
|
|
|
if (!MO.isReg() || !MO.isUse() || MO.getReg() == 0)
|
2009-03-23 08:01:15 +00:00
|
|
|
return false;
|
2009-07-16 20:58:34 +00:00
|
|
|
|
|
|
|
// Find the flag operand corresponding to UseOpIdx
|
|
|
|
unsigned FlagIdx, NumOps=0;
|
|
|
|
for (FlagIdx = 1; FlagIdx < UseOpIdx; FlagIdx += NumOps+1) {
|
|
|
|
const MachineOperand &UFMO = getOperand(FlagIdx);
|
2009-07-19 19:09:59 +00:00
|
|
|
// After the normal asm operands there may be additional imp-def regs.
|
|
|
|
if (!UFMO.isImm())
|
|
|
|
return false;
|
2009-07-16 20:58:34 +00:00
|
|
|
NumOps = InlineAsm::getNumOperandRegisters(UFMO.getImm());
|
|
|
|
assert(NumOps < getNumOperands() && "Invalid inline asm flag");
|
|
|
|
if (UseOpIdx < FlagIdx+NumOps+1)
|
|
|
|
break;
|
2009-06-24 02:05:51 +00:00
|
|
|
}
|
2009-07-16 20:58:34 +00:00
|
|
|
if (FlagIdx >= UseOpIdx)
|
2009-06-24 02:05:51 +00:00
|
|
|
return false;
|
2009-07-16 20:58:34 +00:00
|
|
|
const MachineOperand &UFMO = getOperand(FlagIdx);
|
2009-03-23 08:01:15 +00:00
|
|
|
unsigned DefNo;
|
|
|
|
if (InlineAsm::isUseOperandTiedToDef(UFMO.getImm(), DefNo)) {
|
|
|
|
if (!DefOpIdx)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
unsigned DefIdx = 1;
|
|
|
|
// Remember to adjust the index. First operand is asm string, then there
|
|
|
|
// is a flag for each.
|
|
|
|
while (DefNo) {
|
|
|
|
const MachineOperand &FMO = getOperand(DefIdx);
|
|
|
|
assert(FMO.isImm());
|
|
|
|
// Skip over this def.
|
|
|
|
DefIdx += InlineAsm::getNumOperandRegisters(FMO.getImm()) + 1;
|
|
|
|
--DefNo;
|
|
|
|
}
|
2009-06-24 02:05:51 +00:00
|
|
|
*DefOpIdx = DefIdx + UseOpIdx - FlagIdx;
|
2009-03-23 08:01:15 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2009-03-19 20:30:06 +00:00
|
|
|
const TargetInstrDesc &TID = getDesc();
|
|
|
|
if (UseOpIdx >= TID.getNumOperands())
|
|
|
|
return false;
|
|
|
|
const MachineOperand &MO = getOperand(UseOpIdx);
|
|
|
|
if (!MO.isReg() || !MO.isUse())
|
|
|
|
return false;
|
|
|
|
int DefIdx = TID.getOperandConstraint(UseOpIdx, TOI::TIED_TO);
|
|
|
|
if (DefIdx == -1)
|
|
|
|
return false;
|
|
|
|
if (DefOpIdx)
|
|
|
|
*DefOpIdx = (unsigned)DefIdx;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2010-05-13 20:34:42 +00:00
|
|
|
/// clearKillInfo - Clears kill flags on all operands.
|
|
|
|
///
|
|
|
|
void MachineInstr::clearKillInfo() {
|
|
|
|
for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
|
|
|
|
MachineOperand &MO = getOperand(i);
|
|
|
|
if (MO.isReg() && MO.isUse())
|
|
|
|
MO.setIsKill(false);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-12-06 08:27:42 +00:00
|
|
|
/// copyKillDeadInfo - Copies kill / dead operand properties from MI.
|
|
|
|
///
|
|
|
|
void MachineInstr::copyKillDeadInfo(const MachineInstr *MI) {
|
|
|
|
for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
|
|
|
|
const MachineOperand &MO = MI->getOperand(i);
|
2008-10-03 15:45:36 +00:00
|
|
|
if (!MO.isReg() || (!MO.isKill() && !MO.isDead()))
|
2006-12-06 08:27:42 +00:00
|
|
|
continue;
|
|
|
|
for (unsigned j = 0, ee = getNumOperands(); j != ee; ++j) {
|
|
|
|
MachineOperand &MOp = getOperand(j);
|
|
|
|
if (!MOp.isIdenticalTo(MO))
|
|
|
|
continue;
|
|
|
|
if (MO.isKill())
|
|
|
|
MOp.setIsKill();
|
|
|
|
else
|
|
|
|
MOp.setIsDead();
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-05-15 01:26:09 +00:00
|
|
|
/// copyPredicates - Copies predicate operand(s) from MI.
|
|
|
|
void MachineInstr::copyPredicates(const MachineInstr *MI) {
|
2008-01-07 07:27:27 +00:00
|
|
|
const TargetInstrDesc &TID = MI->getDesc();
|
2008-03-13 00:44:09 +00:00
|
|
|
if (!TID.isPredicable())
|
|
|
|
return;
|
|
|
|
for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
|
|
|
|
if (TID.OpInfo[i].isPredicate()) {
|
|
|
|
// Predicated operands must be last operands.
|
|
|
|
addOperand(MI->getOperand(i));
|
2007-05-15 01:26:09 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-06-02 22:47:25 +00:00
|
|
|
void MachineInstr::substituteRegister(unsigned FromReg,
|
|
|
|
unsigned ToReg,
|
|
|
|
unsigned SubIdx,
|
|
|
|
const TargetRegisterInfo &RegInfo) {
|
|
|
|
if (TargetRegisterInfo::isPhysicalRegister(ToReg)) {
|
|
|
|
if (SubIdx)
|
|
|
|
ToReg = RegInfo.getSubReg(ToReg, SubIdx);
|
|
|
|
for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
|
|
|
|
MachineOperand &MO = getOperand(i);
|
|
|
|
if (!MO.isReg() || MO.getReg() != FromReg)
|
|
|
|
continue;
|
|
|
|
MO.substPhysReg(ToReg, RegInfo);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
|
|
|
|
MachineOperand &MO = getOperand(i);
|
|
|
|
if (!MO.isReg() || MO.getReg() != FromReg)
|
|
|
|
continue;
|
|
|
|
MO.substVirtReg(ToReg, SubIdx, RegInfo);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-07-03 09:09:37 +00:00
|
|
|
/// isSafeToMove - Return true if it is safe to move this instruction. If
|
|
|
|
/// SawStore is set to true, it means that there is a store (or call) between
|
|
|
|
/// the instruction's location and its intended destination.
|
2008-11-18 19:04:29 +00:00
|
|
|
bool MachineInstr::isSafeToMove(const TargetInstrInfo *TII,
|
2010-03-02 19:03:01 +00:00
|
|
|
AliasAnalysis *AA,
|
|
|
|
bool &SawStore) const {
|
2008-03-13 00:44:09 +00:00
|
|
|
// Ignore stuff that we obviously can't move.
|
|
|
|
if (TID->mayStore() || TID->isCall()) {
|
|
|
|
SawStore = true;
|
|
|
|
return false;
|
|
|
|
}
|
2008-12-23 17:28:50 +00:00
|
|
|
if (TID->isTerminator() || TID->hasUnmodeledSideEffects())
|
2008-03-13 00:44:09 +00:00
|
|
|
return false;
|
|
|
|
|
|
|
|
// See if this instruction does a load. If so, we have to guarantee that the
|
|
|
|
// loaded value doesn't change between the load and the its intended
|
|
|
|
// destination. The check for isInvariantLoad gives the targe the chance to
|
|
|
|
// classify the load as always returning a constant, e.g. a constant pool
|
|
|
|
// load.
|
2009-10-09 23:27:56 +00:00
|
|
|
if (TID->mayLoad() && !isInvariantLoad(AA))
|
2008-03-13 00:44:09 +00:00
|
|
|
// Otherwise, this is a real load. If there is a store between the load and
|
2009-07-28 21:49:18 +00:00
|
|
|
// end of block, or if the load is volatile, we can't move it.
|
2008-10-02 15:04:30 +00:00
|
|
|
return !SawStore && !hasVolatileMemoryRef();
|
2008-09-24 00:06:15 +00:00
|
|
|
|
2008-03-13 00:44:09 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2008-08-27 20:33:50 +00:00
|
|
|
/// isSafeToReMat - Return true if it's safe to rematerialize the specified
|
|
|
|
/// instruction which defined the specified register instead of copying it.
|
2008-11-18 19:04:29 +00:00
|
|
|
bool MachineInstr::isSafeToReMat(const TargetInstrInfo *TII,
|
2010-03-02 19:03:01 +00:00
|
|
|
AliasAnalysis *AA,
|
|
|
|
unsigned DstReg) const {
|
2008-08-27 20:33:50 +00:00
|
|
|
bool SawStore = false;
|
2009-10-09 23:27:56 +00:00
|
|
|
if (!TII->isTriviallyReMaterializable(this, AA) ||
|
2010-03-02 19:03:01 +00:00
|
|
|
!isSafeToMove(TII, AA, SawStore))
|
2008-08-27 20:33:50 +00:00
|
|
|
return false;
|
|
|
|
for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
|
2008-11-18 19:49:32 +00:00
|
|
|
const MachineOperand &MO = getOperand(i);
|
2008-10-03 15:45:36 +00:00
|
|
|
if (!MO.isReg())
|
2008-08-27 20:33:50 +00:00
|
|
|
continue;
|
|
|
|
// FIXME: For now, do not remat any instruction with register operands.
|
|
|
|
// Later on, we can loosen the restriction is the register operands have
|
|
|
|
// not been modified between the def and use. Note, this is different from
|
2008-08-27 20:58:54 +00:00
|
|
|
// MachineSink because the code is no longer in two-address form (at least
|
2008-08-27 20:33:50 +00:00
|
|
|
// partially).
|
|
|
|
if (MO.isUse())
|
|
|
|
return false;
|
|
|
|
else if (!MO.isDead() && MO.getReg() != DstReg)
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2008-09-24 00:06:15 +00:00
|
|
|
/// hasVolatileMemoryRef - Return true if this instruction may have a
|
|
|
|
/// volatile memory reference, or if the information describing the
|
|
|
|
/// memory reference is not available. Return false if it is known to
|
|
|
|
/// have no volatile memory references.
|
|
|
|
bool MachineInstr::hasVolatileMemoryRef() const {
|
|
|
|
// An instruction known never to access memory won't have a volatile access.
|
|
|
|
if (!TID->mayStore() &&
|
|
|
|
!TID->mayLoad() &&
|
|
|
|
!TID->isCall() &&
|
|
|
|
!TID->hasUnmodeledSideEffects())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Otherwise, if the instruction has no memory reference information,
|
|
|
|
// conservatively assume it wasn't preserved.
|
|
|
|
if (memoperands_empty())
|
|
|
|
return true;
|
|
|
|
|
|
|
|
// Check the memory reference information for volatile references.
|
2009-09-25 20:36:54 +00:00
|
|
|
for (mmo_iterator I = memoperands_begin(), E = memoperands_end(); I != E; ++I)
|
|
|
|
if ((*I)->isVolatile())
|
2008-09-24 00:06:15 +00:00
|
|
|
return true;
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2009-10-07 17:38:06 +00:00
|
|
|
/// isInvariantLoad - Return true if this instruction is loading from a
|
|
|
|
/// location whose value is invariant across the function. For example,
|
2010-02-10 16:03:48 +00:00
|
|
|
/// loading a value from the constant pool or from the argument area
|
2009-10-07 17:38:06 +00:00
|
|
|
/// of a function if it does not change. This should only return true of
|
|
|
|
/// *all* loads the instruction does are invariant (if it does multiple loads).
|
|
|
|
bool MachineInstr::isInvariantLoad(AliasAnalysis *AA) const {
|
|
|
|
// If the instruction doesn't load at all, it isn't an invariant load.
|
|
|
|
if (!TID->mayLoad())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// If the instruction has lost its memoperands, conservatively assume that
|
|
|
|
// it may not be an invariant load.
|
|
|
|
if (memoperands_empty())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
const MachineFrameInfo *MFI = getParent()->getParent()->getFrameInfo();
|
|
|
|
|
|
|
|
for (mmo_iterator I = memoperands_begin(),
|
|
|
|
E = memoperands_end(); I != E; ++I) {
|
|
|
|
if ((*I)->isVolatile()) return false;
|
|
|
|
if ((*I)->isStore()) return false;
|
|
|
|
|
|
|
|
if (const Value *V = (*I)->getValue()) {
|
|
|
|
// A load from a constant PseudoSourceValue is invariant.
|
|
|
|
if (const PseudoSourceValue *PSV = dyn_cast<PseudoSourceValue>(V))
|
|
|
|
if (PSV->isConstant(MFI))
|
|
|
|
continue;
|
|
|
|
// If we have an AliasAnalysis, ask it whether the memory is constant.
|
|
|
|
if (AA && AA->pointsToConstantMemory(V))
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Otherwise assume conservatively.
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Everything checks out.
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2009-12-03 02:31:43 +00:00
|
|
|
/// isConstantValuePHI - If the specified instruction is a PHI that always
|
|
|
|
/// merges together the same virtual register, return the register, otherwise
|
|
|
|
/// return 0.
|
|
|
|
unsigned MachineInstr::isConstantValuePHI() const {
|
2010-02-09 19:54:29 +00:00
|
|
|
if (!isPHI())
|
2009-12-03 02:31:43 +00:00
|
|
|
return 0;
|
2009-12-07 23:10:34 +00:00
|
|
|
assert(getNumOperands() >= 3 &&
|
|
|
|
"It's illegal to have a PHI without source operands");
|
2009-12-03 02:31:43 +00:00
|
|
|
|
|
|
|
unsigned Reg = getOperand(1).getReg();
|
|
|
|
for (unsigned i = 3, e = getNumOperands(); i < e; i += 2)
|
|
|
|
if (getOperand(i).getReg() != Reg)
|
|
|
|
return 0;
|
|
|
|
return Reg;
|
|
|
|
}
|
|
|
|
|
2010-04-08 20:02:37 +00:00
|
|
|
/// allDefsAreDead - Return true if all the defs of this instruction are dead.
|
|
|
|
///
|
|
|
|
bool MachineInstr::allDefsAreDead() const {
|
|
|
|
for (unsigned i = 0, e = getNumOperands(); i < e; ++i) {
|
|
|
|
const MachineOperand &MO = getOperand(i);
|
|
|
|
if (!MO.isReg() || MO.isUse())
|
|
|
|
continue;
|
|
|
|
if (!MO.isDead())
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2004-02-13 04:39:32 +00:00
|
|
|
void MachineInstr::dump() const {
|
2010-01-04 23:48:20 +00:00
|
|
|
dbgs() << " " << *this;
|
2008-10-10 01:43:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void MachineInstr::print(raw_ostream &OS, const TargetMachine *TM) const {
|
Print "..." instead of all the uninteresting register clobbers on call
instructions. This makes CodeGen dumps significantly less noisy.
Example before:
BL <ga:@bar>, %R0<imp-def>, %R1<imp-def,dead>, %R2<imp-def,dead>, %R3<imp-def,dead>, %R12<imp-def,dead>, %LR<imp-def,dead>, %D0<imp-def,dead>, %D1<imp-def,dead>, %D2<imp-def,dead>, %D3<imp-def,dead>, %D4<imp-def,dead>, %D5<imp-def,dead>, %D6<imp-def,dead>, %D7<imp-def,dead>, %D16<imp-def,dead>, %D17<imp-def,dead>, %D18<imp-def,dead>, %D19<imp-def,dead>, %D20<imp-def,dead>, %D21<imp-def,dead>, %D22<imp-def,dead>, %D23<imp-def,dead>, %D24<imp-def,dead>, %D25<imp-def,dead>, %D26<imp-def,dead>, %D27<imp-def,dead>, %D28<imp-def,dead>, %D29<imp-def,dead>, %D30<imp-def,dead>, %D31<imp-def,dead>, %CPSR<imp-def,dead>, %FPSCR<imp-def,dead>
Same example after:
BL <ga:@bar>, %R0<imp-def>, %R1<imp-def,dead>, %LR<imp-def,dead>, %CPSR<imp-def,dead>, ...
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@86583 91177308-0d34-0410-b5e6-96231b3b80d8
2009-11-09 19:38:45 +00:00
|
|
|
// We can be a bit tidier if we know the TargetMachine and/or MachineFunction.
|
|
|
|
const MachineFunction *MF = 0;
|
|
|
|
if (const MachineBasicBlock *MBB = getParent()) {
|
|
|
|
MF = MBB->getParent();
|
|
|
|
if (!TM && MF)
|
|
|
|
TM = &MF->getTarget();
|
|
|
|
}
|
2009-10-31 20:19:03 +00:00
|
|
|
|
|
|
|
// Print explicitly defined operands on the left of an assignment syntax.
|
Print "..." instead of all the uninteresting register clobbers on call
instructions. This makes CodeGen dumps significantly less noisy.
Example before:
BL <ga:@bar>, %R0<imp-def>, %R1<imp-def,dead>, %R2<imp-def,dead>, %R3<imp-def,dead>, %R12<imp-def,dead>, %LR<imp-def,dead>, %D0<imp-def,dead>, %D1<imp-def,dead>, %D2<imp-def,dead>, %D3<imp-def,dead>, %D4<imp-def,dead>, %D5<imp-def,dead>, %D6<imp-def,dead>, %D7<imp-def,dead>, %D16<imp-def,dead>, %D17<imp-def,dead>, %D18<imp-def,dead>, %D19<imp-def,dead>, %D20<imp-def,dead>, %D21<imp-def,dead>, %D22<imp-def,dead>, %D23<imp-def,dead>, %D24<imp-def,dead>, %D25<imp-def,dead>, %D26<imp-def,dead>, %D27<imp-def,dead>, %D28<imp-def,dead>, %D29<imp-def,dead>, %D30<imp-def,dead>, %D31<imp-def,dead>, %CPSR<imp-def,dead>, %FPSCR<imp-def,dead>
Same example after:
BL <ga:@bar>, %R0<imp-def>, %R1<imp-def,dead>, %LR<imp-def,dead>, %CPSR<imp-def,dead>, ...
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@86583 91177308-0d34-0410-b5e6-96231b3b80d8
2009-11-09 19:38:45 +00:00
|
|
|
unsigned StartOp = 0, e = getNumOperands();
|
2009-10-31 20:19:03 +00:00
|
|
|
for (; StartOp < e && getOperand(StartOp).isReg() &&
|
|
|
|
getOperand(StartOp).isDef() &&
|
|
|
|
!getOperand(StartOp).isImplicit();
|
|
|
|
++StartOp) {
|
|
|
|
if (StartOp != 0) OS << ", ";
|
|
|
|
getOperand(StartOp).print(OS, TM);
|
2002-10-30 01:55:38 +00:00
|
|
|
}
|
2004-06-25 00:13:11 +00:00
|
|
|
|
2009-10-31 20:19:03 +00:00
|
|
|
if (StartOp != 0)
|
|
|
|
OS << " = ";
|
|
|
|
|
|
|
|
// Print the opcode name.
|
2008-01-07 07:27:27 +00:00
|
|
|
OS << getDesc().getName();
|
2005-04-21 22:36:52 +00:00
|
|
|
|
2009-10-31 20:19:03 +00:00
|
|
|
// Print the rest of the operands.
|
Print "..." instead of all the uninteresting register clobbers on call
instructions. This makes CodeGen dumps significantly less noisy.
Example before:
BL <ga:@bar>, %R0<imp-def>, %R1<imp-def,dead>, %R2<imp-def,dead>, %R3<imp-def,dead>, %R12<imp-def,dead>, %LR<imp-def,dead>, %D0<imp-def,dead>, %D1<imp-def,dead>, %D2<imp-def,dead>, %D3<imp-def,dead>, %D4<imp-def,dead>, %D5<imp-def,dead>, %D6<imp-def,dead>, %D7<imp-def,dead>, %D16<imp-def,dead>, %D17<imp-def,dead>, %D18<imp-def,dead>, %D19<imp-def,dead>, %D20<imp-def,dead>, %D21<imp-def,dead>, %D22<imp-def,dead>, %D23<imp-def,dead>, %D24<imp-def,dead>, %D25<imp-def,dead>, %D26<imp-def,dead>, %D27<imp-def,dead>, %D28<imp-def,dead>, %D29<imp-def,dead>, %D30<imp-def,dead>, %D31<imp-def,dead>, %CPSR<imp-def,dead>, %FPSCR<imp-def,dead>
Same example after:
BL <ga:@bar>, %R0<imp-def>, %R1<imp-def,dead>, %LR<imp-def,dead>, %CPSR<imp-def,dead>, ...
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@86583 91177308-0d34-0410-b5e6-96231b3b80d8
2009-11-09 19:38:45 +00:00
|
|
|
bool OmittedAnyCallClobbers = false;
|
|
|
|
bool FirstOp = true;
|
2002-10-30 01:55:38 +00:00
|
|
|
for (unsigned i = StartOp, e = getNumOperands(); i != e; ++i) {
|
Print "..." instead of all the uninteresting register clobbers on call
instructions. This makes CodeGen dumps significantly less noisy.
Example before:
BL <ga:@bar>, %R0<imp-def>, %R1<imp-def,dead>, %R2<imp-def,dead>, %R3<imp-def,dead>, %R12<imp-def,dead>, %LR<imp-def,dead>, %D0<imp-def,dead>, %D1<imp-def,dead>, %D2<imp-def,dead>, %D3<imp-def,dead>, %D4<imp-def,dead>, %D5<imp-def,dead>, %D6<imp-def,dead>, %D7<imp-def,dead>, %D16<imp-def,dead>, %D17<imp-def,dead>, %D18<imp-def,dead>, %D19<imp-def,dead>, %D20<imp-def,dead>, %D21<imp-def,dead>, %D22<imp-def,dead>, %D23<imp-def,dead>, %D24<imp-def,dead>, %D25<imp-def,dead>, %D26<imp-def,dead>, %D27<imp-def,dead>, %D28<imp-def,dead>, %D29<imp-def,dead>, %D30<imp-def,dead>, %D31<imp-def,dead>, %CPSR<imp-def,dead>, %FPSCR<imp-def,dead>
Same example after:
BL <ga:@bar>, %R0<imp-def>, %R1<imp-def,dead>, %LR<imp-def,dead>, %CPSR<imp-def,dead>, ...
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@86583 91177308-0d34-0410-b5e6-96231b3b80d8
2009-11-09 19:38:45 +00:00
|
|
|
const MachineOperand &MO = getOperand(i);
|
|
|
|
|
|
|
|
// Omit call-clobbered registers which aren't used anywhere. This makes
|
|
|
|
// call instructions much less noisy on targets where calls clobber lots
|
|
|
|
// of registers. Don't rely on MO.isDead() because we may be called before
|
|
|
|
// LiveVariables is run, or we may be looking at a non-allocatable reg.
|
|
|
|
if (MF && getDesc().isCall() &&
|
|
|
|
MO.isReg() && MO.isImplicit() && MO.isDef()) {
|
|
|
|
unsigned Reg = MO.getReg();
|
|
|
|
if (Reg != 0 && TargetRegisterInfo::isPhysicalRegister(Reg)) {
|
|
|
|
const MachineRegisterInfo &MRI = MF->getRegInfo();
|
|
|
|
if (MRI.use_empty(Reg) && !MRI.isLiveOut(Reg)) {
|
|
|
|
bool HasAliasLive = false;
|
|
|
|
for (const unsigned *Alias = TM->getRegisterInfo()->getAliasSet(Reg);
|
|
|
|
unsigned AliasReg = *Alias; ++Alias)
|
|
|
|
if (!MRI.use_empty(AliasReg) || MRI.isLiveOut(AliasReg)) {
|
|
|
|
HasAliasLive = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (!HasAliasLive) {
|
|
|
|
OmittedAnyCallClobbers = true;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (FirstOp) FirstOp = false; else OS << ",";
|
2002-10-30 01:55:38 +00:00
|
|
|
OS << " ";
|
2010-01-19 22:08:34 +00:00
|
|
|
if (i < getDesc().NumOperands) {
|
|
|
|
const TargetOperandInfo &TOI = getDesc().OpInfo[i];
|
|
|
|
if (TOI.isPredicate())
|
|
|
|
OS << "pred:";
|
|
|
|
if (TOI.isOptionalDef())
|
|
|
|
OS << "opt:";
|
|
|
|
}
|
2010-04-28 20:03:13 +00:00
|
|
|
if (isDebugValue() && MO.isMetadata()) {
|
|
|
|
// Pretty print DBG_VALUE instructions.
|
|
|
|
const MDNode *MD = MO.getMetadata();
|
|
|
|
if (const MDString *MDS = dyn_cast<MDString>(MD->getOperand(2)))
|
|
|
|
OS << "!\"" << MDS->getString() << '\"';
|
|
|
|
else
|
|
|
|
MO.print(OS, TM);
|
|
|
|
} else
|
|
|
|
MO.print(OS, TM);
|
Print "..." instead of all the uninteresting register clobbers on call
instructions. This makes CodeGen dumps significantly less noisy.
Example before:
BL <ga:@bar>, %R0<imp-def>, %R1<imp-def,dead>, %R2<imp-def,dead>, %R3<imp-def,dead>, %R12<imp-def,dead>, %LR<imp-def,dead>, %D0<imp-def,dead>, %D1<imp-def,dead>, %D2<imp-def,dead>, %D3<imp-def,dead>, %D4<imp-def,dead>, %D5<imp-def,dead>, %D6<imp-def,dead>, %D7<imp-def,dead>, %D16<imp-def,dead>, %D17<imp-def,dead>, %D18<imp-def,dead>, %D19<imp-def,dead>, %D20<imp-def,dead>, %D21<imp-def,dead>, %D22<imp-def,dead>, %D23<imp-def,dead>, %D24<imp-def,dead>, %D25<imp-def,dead>, %D26<imp-def,dead>, %D27<imp-def,dead>, %D28<imp-def,dead>, %D29<imp-def,dead>, %D30<imp-def,dead>, %D31<imp-def,dead>, %CPSR<imp-def,dead>, %FPSCR<imp-def,dead>
Same example after:
BL <ga:@bar>, %R0<imp-def>, %R1<imp-def,dead>, %LR<imp-def,dead>, %CPSR<imp-def,dead>, ...
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@86583 91177308-0d34-0410-b5e6-96231b3b80d8
2009-11-09 19:38:45 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Briefly indicate whether any call clobbers were omitted.
|
|
|
|
if (OmittedAnyCallClobbers) {
|
2009-12-25 13:45:50 +00:00
|
|
|
if (!FirstOp) OS << ",";
|
Print "..." instead of all the uninteresting register clobbers on call
instructions. This makes CodeGen dumps significantly less noisy.
Example before:
BL <ga:@bar>, %R0<imp-def>, %R1<imp-def,dead>, %R2<imp-def,dead>, %R3<imp-def,dead>, %R12<imp-def,dead>, %LR<imp-def,dead>, %D0<imp-def,dead>, %D1<imp-def,dead>, %D2<imp-def,dead>, %D3<imp-def,dead>, %D4<imp-def,dead>, %D5<imp-def,dead>, %D6<imp-def,dead>, %D7<imp-def,dead>, %D16<imp-def,dead>, %D17<imp-def,dead>, %D18<imp-def,dead>, %D19<imp-def,dead>, %D20<imp-def,dead>, %D21<imp-def,dead>, %D22<imp-def,dead>, %D23<imp-def,dead>, %D24<imp-def,dead>, %D25<imp-def,dead>, %D26<imp-def,dead>, %D27<imp-def,dead>, %D28<imp-def,dead>, %D29<imp-def,dead>, %D30<imp-def,dead>, %D31<imp-def,dead>, %CPSR<imp-def,dead>, %FPSCR<imp-def,dead>
Same example after:
BL <ga:@bar>, %R0<imp-def>, %R1<imp-def,dead>, %LR<imp-def,dead>, %CPSR<imp-def,dead>, ...
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@86583 91177308-0d34-0410-b5e6-96231b3b80d8
2009-11-09 19:38:45 +00:00
|
|
|
OS << " ...";
|
2002-10-30 00:48:05 +00:00
|
|
|
}
|
2005-04-21 22:36:52 +00:00
|
|
|
|
2009-10-31 20:19:03 +00:00
|
|
|
bool HaveSemi = false;
|
2008-07-07 23:14:23 +00:00
|
|
|
if (!memoperands_empty()) {
|
2009-10-31 20:19:03 +00:00
|
|
|
if (!HaveSemi) OS << ";"; HaveSemi = true;
|
|
|
|
|
|
|
|
OS << " mem:";
|
2009-09-25 20:36:54 +00:00
|
|
|
for (mmo_iterator i = memoperands_begin(), e = memoperands_end();
|
|
|
|
i != e; ++i) {
|
|
|
|
OS << **i;
|
2009-09-23 01:33:16 +00:00
|
|
|
if (next(i) != e)
|
|
|
|
OS << " ";
|
2008-02-06 22:27:42 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
Print "..." instead of all the uninteresting register clobbers on call
instructions. This makes CodeGen dumps significantly less noisy.
Example before:
BL <ga:@bar>, %R0<imp-def>, %R1<imp-def,dead>, %R2<imp-def,dead>, %R3<imp-def,dead>, %R12<imp-def,dead>, %LR<imp-def,dead>, %D0<imp-def,dead>, %D1<imp-def,dead>, %D2<imp-def,dead>, %D3<imp-def,dead>, %D4<imp-def,dead>, %D5<imp-def,dead>, %D6<imp-def,dead>, %D7<imp-def,dead>, %D16<imp-def,dead>, %D17<imp-def,dead>, %D18<imp-def,dead>, %D19<imp-def,dead>, %D20<imp-def,dead>, %D21<imp-def,dead>, %D22<imp-def,dead>, %D23<imp-def,dead>, %D24<imp-def,dead>, %D25<imp-def,dead>, %D26<imp-def,dead>, %D27<imp-def,dead>, %D28<imp-def,dead>, %D29<imp-def,dead>, %D30<imp-def,dead>, %D31<imp-def,dead>, %CPSR<imp-def,dead>, %FPSCR<imp-def,dead>
Same example after:
BL <ga:@bar>, %R0<imp-def>, %R1<imp-def,dead>, %LR<imp-def,dead>, %CPSR<imp-def,dead>, ...
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@86583 91177308-0d34-0410-b5e6-96231b3b80d8
2009-11-09 19:38:45 +00:00
|
|
|
if (!debugLoc.isUnknown() && MF) {
|
2009-12-25 13:44:36 +00:00
|
|
|
if (!HaveSemi) OS << ";";
|
2009-10-31 20:19:03 +00:00
|
|
|
|
|
|
|
// TODO: print InlinedAtLoc information
|
|
|
|
|
2010-04-02 19:42:39 +00:00
|
|
|
DIScope Scope(debugLoc.getScope(MF->getFunction()->getContext()));
|
2009-11-23 21:29:08 +00:00
|
|
|
OS << " dbg:";
|
2009-12-05 00:20:51 +00:00
|
|
|
// Omit the directory, since it's usually long and uninteresting.
|
2010-03-08 20:52:55 +00:00
|
|
|
if (Scope.Verify())
|
2009-12-05 00:20:51 +00:00
|
|
|
OS << Scope.getFilename();
|
|
|
|
else
|
|
|
|
OS << "<unknown>";
|
2010-04-02 19:42:39 +00:00
|
|
|
OS << ':' << debugLoc.getLine();
|
|
|
|
if (debugLoc.getCol() != 0)
|
|
|
|
OS << ':' << debugLoc.getCol();
|
2009-02-19 21:44:55 +00:00
|
|
|
}
|
|
|
|
|
2002-10-30 00:48:05 +00:00
|
|
|
OS << "\n";
|
|
|
|
}
|
|
|
|
|
2008-01-24 01:10:07 +00:00
|
|
|
bool MachineInstr::addRegisterKilled(unsigned IncomingReg,
|
2008-02-10 18:45:23 +00:00
|
|
|
const TargetRegisterInfo *RegInfo,
|
2008-01-24 01:10:07 +00:00
|
|
|
bool AddIfNotFound) {
|
2008-04-16 09:41:59 +00:00
|
|
|
bool isPhysReg = TargetRegisterInfo::isPhysicalRegister(IncomingReg);
|
2008-07-03 01:18:51 +00:00
|
|
|
bool hasAliases = isPhysReg && RegInfo->getAliasSet(IncomingReg);
|
2008-09-03 15:56:16 +00:00
|
|
|
bool Found = false;
|
2008-04-16 09:41:59 +00:00
|
|
|
SmallVector<unsigned,4> DeadOps;
|
2008-03-03 22:14:33 +00:00
|
|
|
for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
|
|
|
|
MachineOperand &MO = getOperand(i);
|
2009-08-04 20:09:25 +00:00
|
|
|
if (!MO.isReg() || !MO.isUse() || MO.isUndef())
|
2008-04-16 09:41:59 +00:00
|
|
|
continue;
|
|
|
|
unsigned Reg = MO.getReg();
|
|
|
|
if (!Reg)
|
|
|
|
continue;
|
2008-03-03 22:14:33 +00:00
|
|
|
|
2008-04-16 09:41:59 +00:00
|
|
|
if (Reg == IncomingReg) {
|
2008-09-03 15:56:16 +00:00
|
|
|
if (!Found) {
|
|
|
|
if (MO.isKill())
|
|
|
|
// The register is already marked kill.
|
|
|
|
return true;
|
2009-08-02 19:13:03 +00:00
|
|
|
if (isPhysReg && isRegTiedToDefOperand(i))
|
|
|
|
// Two-address uses of physregs must not be marked kill.
|
|
|
|
return true;
|
2008-09-03 15:56:16 +00:00
|
|
|
MO.setIsKill();
|
|
|
|
Found = true;
|
|
|
|
}
|
|
|
|
} else if (hasAliases && MO.isKill() &&
|
|
|
|
TargetRegisterInfo::isPhysicalRegister(Reg)) {
|
2008-04-16 09:41:59 +00:00
|
|
|
// A super-register kill already exists.
|
|
|
|
if (RegInfo->isSuperRegister(IncomingReg, Reg))
|
2008-07-03 01:18:51 +00:00
|
|
|
return true;
|
|
|
|
if (RegInfo->isSubRegister(IncomingReg, Reg))
|
2008-04-16 09:41:59 +00:00
|
|
|
DeadOps.push_back(i);
|
2008-01-24 01:10:07 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-04-16 09:41:59 +00:00
|
|
|
// Trim unneeded kill operands.
|
|
|
|
while (!DeadOps.empty()) {
|
|
|
|
unsigned OpIdx = DeadOps.back();
|
|
|
|
if (getOperand(OpIdx).isImplicit())
|
|
|
|
RemoveOperand(OpIdx);
|
|
|
|
else
|
|
|
|
getOperand(OpIdx).setIsKill(false);
|
|
|
|
DeadOps.pop_back();
|
|
|
|
}
|
|
|
|
|
2008-03-03 22:14:33 +00:00
|
|
|
// If not found, this means an alias of one of the operands is killed. Add a
|
2008-01-24 01:10:07 +00:00
|
|
|
// new implicit operand if required.
|
2008-09-03 15:56:16 +00:00
|
|
|
if (!Found && AddIfNotFound) {
|
2008-03-03 22:14:33 +00:00
|
|
|
addOperand(MachineOperand::CreateReg(IncomingReg,
|
|
|
|
false /*IsDef*/,
|
|
|
|
true /*IsImp*/,
|
|
|
|
true /*IsKill*/));
|
2008-01-24 01:10:07 +00:00
|
|
|
return true;
|
|
|
|
}
|
2008-09-03 15:56:16 +00:00
|
|
|
return Found;
|
2008-01-24 01:10:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
bool MachineInstr::addRegisterDead(unsigned IncomingReg,
|
2008-02-10 18:45:23 +00:00
|
|
|
const TargetRegisterInfo *RegInfo,
|
2008-01-24 01:10:07 +00:00
|
|
|
bool AddIfNotFound) {
|
2008-04-16 09:41:59 +00:00
|
|
|
bool isPhysReg = TargetRegisterInfo::isPhysicalRegister(IncomingReg);
|
2008-06-27 22:11:49 +00:00
|
|
|
bool hasAliases = isPhysReg && RegInfo->getAliasSet(IncomingReg);
|
2008-09-03 15:56:16 +00:00
|
|
|
bool Found = false;
|
2008-04-16 09:41:59 +00:00
|
|
|
SmallVector<unsigned,4> DeadOps;
|
2008-01-24 01:10:07 +00:00
|
|
|
for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
|
|
|
|
MachineOperand &MO = getOperand(i);
|
2008-10-03 15:45:36 +00:00
|
|
|
if (!MO.isReg() || !MO.isDef())
|
2008-04-16 09:41:59 +00:00
|
|
|
continue;
|
|
|
|
unsigned Reg = MO.getReg();
|
2008-09-03 15:56:16 +00:00
|
|
|
if (!Reg)
|
|
|
|
continue;
|
|
|
|
|
2008-04-16 09:41:59 +00:00
|
|
|
if (Reg == IncomingReg) {
|
2008-09-03 15:56:16 +00:00
|
|
|
if (!Found) {
|
|
|
|
if (MO.isDead())
|
|
|
|
// The register is already marked dead.
|
|
|
|
return true;
|
|
|
|
MO.setIsDead();
|
|
|
|
Found = true;
|
|
|
|
}
|
|
|
|
} else if (hasAliases && MO.isDead() &&
|
|
|
|
TargetRegisterInfo::isPhysicalRegister(Reg)) {
|
2008-04-16 09:41:59 +00:00
|
|
|
// There exists a super-register that's marked dead.
|
|
|
|
if (RegInfo->isSuperRegister(IncomingReg, Reg))
|
2008-07-03 01:18:51 +00:00
|
|
|
return true;
|
2008-08-14 18:34:18 +00:00
|
|
|
if (RegInfo->getSubRegisters(IncomingReg) &&
|
|
|
|
RegInfo->getSuperRegisters(Reg) &&
|
|
|
|
RegInfo->isSubRegister(IncomingReg, Reg))
|
2008-04-16 09:41:59 +00:00
|
|
|
DeadOps.push_back(i);
|
2008-01-24 01:10:07 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-04-16 09:41:59 +00:00
|
|
|
// Trim unneeded dead operands.
|
|
|
|
while (!DeadOps.empty()) {
|
|
|
|
unsigned OpIdx = DeadOps.back();
|
|
|
|
if (getOperand(OpIdx).isImplicit())
|
|
|
|
RemoveOperand(OpIdx);
|
|
|
|
else
|
|
|
|
getOperand(OpIdx).setIsDead(false);
|
|
|
|
DeadOps.pop_back();
|
|
|
|
}
|
|
|
|
|
2008-09-03 15:56:16 +00:00
|
|
|
// If not found, this means an alias of one of the operands is dead. Add a
|
|
|
|
// new implicit operand if required.
|
2009-06-24 17:54:48 +00:00
|
|
|
if (Found || !AddIfNotFound)
|
|
|
|
return Found;
|
|
|
|
|
|
|
|
addOperand(MachineOperand::CreateReg(IncomingReg,
|
|
|
|
true /*IsDef*/,
|
|
|
|
true /*IsImp*/,
|
|
|
|
false /*IsKill*/,
|
|
|
|
true /*IsDead*/));
|
|
|
|
return true;
|
2008-01-24 01:10:07 +00:00
|
|
|
}
|
2010-01-06 00:29:28 +00:00
|
|
|
|
|
|
|
void MachineInstr::addRegisterDefined(unsigned IncomingReg,
|
|
|
|
const TargetRegisterInfo *RegInfo) {
|
2010-05-21 16:32:16 +00:00
|
|
|
if (TargetRegisterInfo::isPhysicalRegister(IncomingReg)) {
|
|
|
|
MachineOperand *MO = findRegisterDefOperand(IncomingReg, false, RegInfo);
|
|
|
|
if (MO)
|
|
|
|
return;
|
|
|
|
} else {
|
|
|
|
for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
|
|
|
|
const MachineOperand &MO = getOperand(i);
|
|
|
|
if (MO.isReg() && MO.getReg() == IncomingReg && MO.isDef() &&
|
|
|
|
MO.getSubReg() == 0)
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
addOperand(MachineOperand::CreateReg(IncomingReg,
|
|
|
|
true /*IsDef*/,
|
|
|
|
true /*IsImp*/));
|
2010-01-06 00:29:28 +00:00
|
|
|
}
|
2010-03-03 23:37:30 +00:00
|
|
|
|
|
|
|
unsigned
|
|
|
|
MachineInstrExpressionTrait::getHashValue(const MachineInstr* const &MI) {
|
|
|
|
unsigned Hash = MI->getOpcode() * 37;
|
|
|
|
for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
|
|
|
|
const MachineOperand &MO = MI->getOperand(i);
|
|
|
|
uint64_t Key = (uint64_t)MO.getType() << 32;
|
|
|
|
switch (MO.getType()) {
|
2010-03-13 08:14:18 +00:00
|
|
|
default: break;
|
|
|
|
case MachineOperand::MO_Register:
|
|
|
|
if (MO.isDef() && MO.getReg() &&
|
|
|
|
TargetRegisterInfo::isVirtualRegister(MO.getReg()))
|
|
|
|
continue; // Skip virtual register defs.
|
|
|
|
Key |= MO.getReg();
|
|
|
|
break;
|
|
|
|
case MachineOperand::MO_Immediate:
|
|
|
|
Key |= MO.getImm();
|
|
|
|
break;
|
|
|
|
case MachineOperand::MO_FrameIndex:
|
|
|
|
case MachineOperand::MO_ConstantPoolIndex:
|
|
|
|
case MachineOperand::MO_JumpTableIndex:
|
|
|
|
Key |= MO.getIndex();
|
|
|
|
break;
|
|
|
|
case MachineOperand::MO_MachineBasicBlock:
|
|
|
|
Key |= DenseMapInfo<void*>::getHashValue(MO.getMBB());
|
|
|
|
break;
|
|
|
|
case MachineOperand::MO_GlobalAddress:
|
|
|
|
Key |= DenseMapInfo<void*>::getHashValue(MO.getGlobal());
|
|
|
|
break;
|
|
|
|
case MachineOperand::MO_BlockAddress:
|
|
|
|
Key |= DenseMapInfo<void*>::getHashValue(MO.getBlockAddress());
|
|
|
|
break;
|
|
|
|
case MachineOperand::MO_MCSymbol:
|
|
|
|
Key |= DenseMapInfo<void*>::getHashValue(MO.getMCSymbol());
|
|
|
|
break;
|
2010-03-03 23:37:30 +00:00
|
|
|
}
|
|
|
|
Key += ~(Key << 32);
|
|
|
|
Key ^= (Key >> 22);
|
|
|
|
Key += ~(Key << 13);
|
|
|
|
Key ^= (Key >> 8);
|
|
|
|
Key += (Key << 3);
|
|
|
|
Key ^= (Key >> 15);
|
|
|
|
Key += ~(Key << 27);
|
|
|
|
Key ^= (Key >> 31);
|
|
|
|
Hash = (unsigned)Key + Hash * 37;
|
|
|
|
}
|
|
|
|
return Hash;
|
|
|
|
}
|