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"
|
2012-06-28 00:05:13 +00:00
|
|
|
#include "llvm/DebugInfo.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"
|
2011-07-02 03:53:34 +00:00
|
|
|
#include "llvm/LLVMContext.h"
|
2010-03-13 08:14:18 +00:00
|
|
|
#include "llvm/Metadata.h"
|
2011-07-02 03:53:34 +00:00
|
|
|
#include "llvm/Module.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"
|
2011-07-02 03:53:34 +00:00
|
|
|
#include "llvm/CodeGen/MachineModuleInfo.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"
|
2011-06-28 19:10:37 +00:00
|
|
|
#include "llvm/MC/MCInstrDesc.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-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"
|
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"
|
2012-03-07 09:39:46 +00:00
|
|
|
#include "llvm/ADT/Hashing.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
|
|
|
void MachineOperand::setReg(unsigned Reg) {
|
|
|
|
if (getReg() == Reg) return; // No change.
|
2011-08-24 16:44:17 +00:00
|
|
|
|
2008-01-01 01:12:31 +00:00
|
|
|
// 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()) {
|
2012-08-09 22:49:37 +00:00
|
|
|
MachineRegisterInfo &MRI = MF->getRegInfo();
|
|
|
|
MRI.removeRegOperandFromUseList(this);
|
2010-10-19 20:56:32 +00:00
|
|
|
SmallContents.RegNo = Reg;
|
2012-08-09 22:49:37 +00:00
|
|
|
MRI.addRegOperandToUseList(this);
|
2008-01-01 01:12:31 +00:00
|
|
|
return;
|
|
|
|
}
|
2011-08-24 16:44:17 +00:00
|
|
|
|
2008-01-01 01:12:31 +00:00
|
|
|
// Otherwise, just change the register, no problem. :)
|
2010-10-19 20:56:32 +00:00
|
|
|
SmallContents.RegNo = Reg;
|
2008-01-01 01:12:31 +00:00
|
|
|
}
|
|
|
|
|
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());
|
2011-05-08 19:21:08 +00:00
|
|
|
// Note that getSubReg() may return 0 if the sub-register doesn't exist.
|
|
|
|
// That won't happen in legal code.
|
2010-05-28 18:18:53 +00:00
|
|
|
setSubReg(0);
|
|
|
|
}
|
|
|
|
setReg(Reg);
|
|
|
|
}
|
|
|
|
|
2012-08-10 00:21:26 +00:00
|
|
|
/// Change a def to a use, or a use to a def.
|
|
|
|
void MachineOperand::setIsDef(bool Val) {
|
|
|
|
assert(isReg() && "Wrong MachineOperand accessor");
|
|
|
|
assert((!Val || !isDebug()) && "Marking a debug operation as def");
|
|
|
|
if (IsDef == Val)
|
|
|
|
return;
|
|
|
|
// MRI may keep uses and defs in different list positions.
|
|
|
|
if (MachineInstr *MI = getParent())
|
|
|
|
if (MachineBasicBlock *MBB = MI->getParent())
|
|
|
|
if (MachineFunction *MF = MBB->getParent()) {
|
|
|
|
MachineRegisterInfo &MRI = MF->getRegInfo();
|
|
|
|
MRI.removeRegOperandFromUseList(this);
|
|
|
|
IsDef = Val;
|
|
|
|
MRI.addRegOperandToUseList(this);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
IsDef = Val;
|
|
|
|
}
|
|
|
|
|
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.
|
2012-08-09 22:49:37 +00:00
|
|
|
if (isReg() && isOnRegUseList())
|
|
|
|
if (MachineInstr *MI = getParent())
|
|
|
|
if (MachineBasicBlock *MBB = MI->getParent())
|
|
|
|
if (MachineFunction *MF = MBB->getParent())
|
|
|
|
MF->getRegInfo().removeRegOperandFromUseList(this);
|
2011-08-24 16:44:17 +00:00
|
|
|
|
2008-01-01 01:12:31 +00:00
|
|
|
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) {
|
2012-08-10 00:21:26 +00:00
|
|
|
MachineRegisterInfo *RegInfo = 0;
|
|
|
|
if (MachineInstr *MI = getParent())
|
|
|
|
if (MachineBasicBlock *MBB = MI->getParent())
|
|
|
|
if (MachineFunction *MF = MBB->getParent())
|
|
|
|
RegInfo = &MF->getRegInfo();
|
|
|
|
// If this operand is already a register operand, remove it from the
|
2008-01-01 01:12:31 +00:00
|
|
|
// register's use/def lists.
|
2012-08-10 00:21:26 +00:00
|
|
|
if (RegInfo && isReg())
|
|
|
|
RegInfo->removeRegOperandFromUseList(this);
|
2008-01-01 01:12:31 +00:00
|
|
|
|
2012-08-10 00:21:26 +00:00
|
|
|
// Change this to a register and set the reg#.
|
|
|
|
OpKind = MO_Register;
|
|
|
|
SmallContents.RegNo = Reg;
|
|
|
|
SubReg = 0;
|
2008-01-01 01:12:31 +00:00
|
|
|
IsDef = isDef;
|
|
|
|
IsImp = isImp;
|
|
|
|
IsKill = isKill;
|
|
|
|
IsDead = isDead;
|
2009-06-30 08:49:04 +00:00
|
|
|
IsUndef = isUndef;
|
2011-12-07 00:22:07 +00:00
|
|
|
IsInternalRead = false;
|
2008-09-14 01:44:36 +00:00
|
|
|
IsEarlyClobber = false;
|
2010-02-10 00:41:49 +00:00
|
|
|
IsDebug = isDebug;
|
2012-08-10 00:21:26 +00:00
|
|
|
// Ensure isOnRegUseList() returns false.
|
|
|
|
Contents.Reg.Prev = 0;
|
|
|
|
|
|
|
|
// If this operand is embedded in a function, add the operand to the
|
|
|
|
// register's use/def list.
|
|
|
|
if (RegInfo)
|
|
|
|
RegInfo->addRegOperandToUseList(this);
|
2008-01-01 01:12:31 +00:00
|
|
|
}
|
|
|
|
|
2007-12-30 21:56:09 +00:00
|
|
|
/// isIdenticalTo - Return true if this operand is identical to the specified
|
2012-07-05 11:06:22 +00:00
|
|
|
/// operand. Note that this should stay in sync with the hash_value overload
|
|
|
|
/// below.
|
2007-12-30 21:56:09 +00:00
|
|
|
bool MachineOperand::isIdenticalTo(const MachineOperand &Other) const {
|
2009-06-24 17:54:48 +00:00
|
|
|
if (getType() != Other.getType() ||
|
|
|
|
getTargetFlags() != Other.getTargetFlags())
|
|
|
|
return false;
|
2011-08-24 16:44:17 +00:00
|
|
|
|
2007-12-30 21:56:09 +00:00
|
|
|
switch (getType()) {
|
|
|
|
case MachineOperand::MO_Register:
|
|
|
|
return getReg() == Other.getReg() && isDef() == Other.isDef() &&
|
|
|
|
getSubReg() == Other.getSubReg();
|
|
|
|
case MachineOperand::MO_Immediate:
|
|
|
|
return getImm() == Other.getImm();
|
2011-07-01 23:45:21 +00:00
|
|
|
case MachineOperand::MO_CImmediate:
|
|
|
|
return getCImm() == Other.getCImm();
|
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:
|
2012-08-07 18:56:39 +00:00
|
|
|
case MachineOperand::MO_TargetIndex:
|
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();
|
2012-01-16 19:22:00 +00:00
|
|
|
case MO_RegisterMask:
|
|
|
|
return getRegMask() == Other.getRegMask();
|
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
|
|
|
}
|
2012-01-10 18:08:01 +00:00
|
|
|
llvm_unreachable("Invalid machine operand type");
|
2007-12-30 21:56:09 +00:00
|
|
|
}
|
|
|
|
|
2012-07-05 11:06:22 +00:00
|
|
|
// Note: this must stay exactly in sync with isIdenticalTo above.
|
|
|
|
hash_code llvm::hash_value(const MachineOperand &MO) {
|
|
|
|
switch (MO.getType()) {
|
|
|
|
case MachineOperand::MO_Register:
|
|
|
|
return hash_combine(MO.getType(), MO.getTargetFlags(), MO.getReg(),
|
|
|
|
MO.getSubReg(), MO.isDef());
|
|
|
|
case MachineOperand::MO_Immediate:
|
|
|
|
return hash_combine(MO.getType(), MO.getTargetFlags(), MO.getImm());
|
|
|
|
case MachineOperand::MO_CImmediate:
|
|
|
|
return hash_combine(MO.getType(), MO.getTargetFlags(), MO.getCImm());
|
|
|
|
case MachineOperand::MO_FPImmediate:
|
|
|
|
return hash_combine(MO.getType(), MO.getTargetFlags(), MO.getFPImm());
|
|
|
|
case MachineOperand::MO_MachineBasicBlock:
|
|
|
|
return hash_combine(MO.getType(), MO.getTargetFlags(), MO.getMBB());
|
|
|
|
case MachineOperand::MO_FrameIndex:
|
|
|
|
return hash_combine(MO.getType(), MO.getTargetFlags(), MO.getIndex());
|
|
|
|
case MachineOperand::MO_ConstantPoolIndex:
|
2012-08-07 18:56:39 +00:00
|
|
|
case MachineOperand::MO_TargetIndex:
|
2012-07-05 11:06:22 +00:00
|
|
|
return hash_combine(MO.getType(), MO.getTargetFlags(), MO.getIndex(),
|
|
|
|
MO.getOffset());
|
|
|
|
case MachineOperand::MO_JumpTableIndex:
|
|
|
|
return hash_combine(MO.getType(), MO.getTargetFlags(), MO.getIndex());
|
|
|
|
case MachineOperand::MO_ExternalSymbol:
|
|
|
|
return hash_combine(MO.getType(), MO.getTargetFlags(), MO.getOffset(),
|
|
|
|
MO.getSymbolName());
|
|
|
|
case MachineOperand::MO_GlobalAddress:
|
|
|
|
return hash_combine(MO.getType(), MO.getTargetFlags(), MO.getGlobal(),
|
|
|
|
MO.getOffset());
|
|
|
|
case MachineOperand::MO_BlockAddress:
|
|
|
|
return hash_combine(MO.getType(), MO.getTargetFlags(),
|
|
|
|
MO.getBlockAddress());
|
|
|
|
case MachineOperand::MO_RegisterMask:
|
|
|
|
return hash_combine(MO.getType(), MO.getTargetFlags(), MO.getRegMask());
|
|
|
|
case MachineOperand::MO_Metadata:
|
|
|
|
return hash_combine(MO.getType(), MO.getTargetFlags(), MO.getMetadata());
|
|
|
|
case MachineOperand::MO_MCSymbol:
|
|
|
|
return hash_combine(MO.getType(), MO.getTargetFlags(), MO.getMCSymbol());
|
|
|
|
}
|
|
|
|
llvm_unreachable("Invalid machine operand type");
|
|
|
|
}
|
|
|
|
|
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();
|
2011-01-09 03:05:53 +00:00
|
|
|
const TargetRegisterInfo *TRI = TM ? TM->getRegisterInfo() : 0;
|
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
|
|
|
|
2007-12-30 21:56:09 +00:00
|
|
|
switch (getType()) {
|
|
|
|
case MachineOperand::MO_Register:
|
2011-01-09 03:05:53 +00:00
|
|
|
OS << PrintReg(getReg(), TRI, getSubReg());
|
2008-12-18 21:51:27 +00:00
|
|
|
|
2009-06-30 08:49:04 +00:00
|
|
|
if (isDef() || isKill() || isDead() || isImplicit() || isUndef() ||
|
2011-12-07 01:08:22 +00:00
|
|
|
isInternalRead() || 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;
|
2012-04-20 21:45:33 +00:00
|
|
|
// <def,read-undef> only makes sense when getSubReg() is set.
|
|
|
|
// Don't clutter the output otherwise.
|
|
|
|
if (isUndef() && getSubReg())
|
|
|
|
OS << ",read-undef";
|
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
|
|
|
|
2012-05-04 22:53:26 +00:00
|
|
|
if (isKill() || isDead() || (isUndef() && isUse()) || isInternalRead()) {
|
2009-06-24 17:54:48 +00:00
|
|
|
if (NeedComma) OS << ',';
|
2011-12-07 00:22:07 +00:00
|
|
|
NeedComma = false;
|
|
|
|
if (isKill()) {
|
|
|
|
OS << "kill";
|
|
|
|
NeedComma = true;
|
|
|
|
}
|
|
|
|
if (isDead()) {
|
|
|
|
OS << "dead";
|
|
|
|
NeedComma = true;
|
|
|
|
}
|
2012-04-20 21:45:33 +00:00
|
|
|
if (isUndef() && isUse()) {
|
2011-12-07 00:22:07 +00:00
|
|
|
if (NeedComma) OS << ',';
|
2009-06-30 08:49:04 +00:00
|
|
|
OS << "undef";
|
2011-12-07 00:22:07 +00:00
|
|
|
NeedComma = true;
|
|
|
|
}
|
|
|
|
if (isInternalRead()) {
|
|
|
|
if (NeedComma) OS << ',';
|
|
|
|
OS << "internal";
|
|
|
|
NeedComma = true;
|
2009-06-30 08:49:04 +00:00
|
|
|
}
|
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;
|
2011-06-24 20:46:11 +00:00
|
|
|
case MachineOperand::MO_CImmediate:
|
|
|
|
getCImm()->getValue().print(OS, false);
|
|
|
|
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;
|
2012-08-07 18:56:39 +00:00
|
|
|
case MachineOperand::MO_TargetIndex:
|
|
|
|
OS << "<ti#" << getIndex();
|
|
|
|
if (getOffset()) OS << "+" << getOffset();
|
|
|
|
OS << '>';
|
|
|
|
break;
|
2007-12-30 21:56:09 +00:00
|
|
|
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;
|
2012-01-16 19:22:00 +00:00
|
|
|
case MachineOperand::MO_RegisterMask:
|
2012-02-02 23:52:57 +00:00
|
|
|
OS << "<regmask>";
|
2012-01-16 19:22:00 +00:00
|
|
|
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
|
|
|
}
|
2011-08-24 16:44:17 +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
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2010-09-21 05:39:30 +00:00
|
|
|
/// getAddrSpace - Return the LLVM IR address space number that this pointer
|
|
|
|
/// points into.
|
|
|
|
unsigned MachinePointerInfo::getAddrSpace() const {
|
|
|
|
if (V == 0) return 0;
|
|
|
|
return cast<PointerType>(V->getType())->getAddressSpace();
|
|
|
|
}
|
|
|
|
|
2010-09-21 06:22:23 +00:00
|
|
|
/// getConstantPool - Return a MachinePointerInfo record that refers to the
|
|
|
|
/// constant pool.
|
|
|
|
MachinePointerInfo MachinePointerInfo::getConstantPool() {
|
|
|
|
return MachinePointerInfo(PseudoSourceValue::getConstantPool());
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getFixedStack - Return a MachinePointerInfo record that refers to the
|
|
|
|
/// the specified FrameIndex.
|
|
|
|
MachinePointerInfo MachinePointerInfo::getFixedStack(int FI, int64_t offset) {
|
|
|
|
return MachinePointerInfo(PseudoSourceValue::getFixedStack(FI), offset);
|
|
|
|
}
|
|
|
|
|
2010-09-21 06:43:24 +00:00
|
|
|
MachinePointerInfo MachinePointerInfo::getJumpTable() {
|
|
|
|
return MachinePointerInfo(PseudoSourceValue::getJumpTable());
|
|
|
|
}
|
|
|
|
|
|
|
|
MachinePointerInfo MachinePointerInfo::getGOT() {
|
|
|
|
return MachinePointerInfo(PseudoSourceValue::getGOT());
|
|
|
|
}
|
2010-09-21 05:39:30 +00:00
|
|
|
|
2010-09-21 18:51:21 +00:00
|
|
|
MachinePointerInfo MachinePointerInfo::getStack(int64_t Offset) {
|
|
|
|
return MachinePointerInfo(PseudoSourceValue::getStack(), Offset);
|
|
|
|
}
|
|
|
|
|
2010-09-21 04:32:08 +00:00
|
|
|
MachineMemOperand::MachineMemOperand(MachinePointerInfo ptrinfo, unsigned f,
|
2010-10-20 00:31:05 +00:00
|
|
|
uint64_t s, unsigned int a,
|
2012-03-31 18:14:00 +00:00
|
|
|
const MDNode *TBAAInfo,
|
|
|
|
const MDNode *Ranges)
|
2010-09-21 04:32:08 +00:00
|
|
|
: PtrInfo(ptrinfo), Size(s),
|
2010-10-20 00:31:05 +00:00
|
|
|
Flags((f & ((1 << MOMaxBits) - 1)) | ((Log2_32(a) + 1) << MOMaxBits)),
|
2012-03-31 18:14:00 +00:00
|
|
|
TBAAInfo(TBAAInfo), Ranges(Ranges) {
|
2010-09-21 04:32:08 +00:00
|
|
|
assert((PtrInfo.V == 0 || isa<PointerType>(PtrInfo.V->getType())) &&
|
|
|
|
"invalid pointer value");
|
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 {
|
2010-09-21 04:23:39 +00:00
|
|
|
ID.AddInteger(getOffset());
|
2008-08-20 15:58:01 +00:00
|
|
|
ID.AddInteger(Size);
|
2010-09-21 04:23:39 +00:00
|
|
|
ID.AddPointer(getValue());
|
2008-08-20 15:58:01 +00:00
|
|
|
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.
|
2010-09-21 04:23:39 +00:00
|
|
|
PtrInfo = MMO->PtrInfo;
|
2009-09-25 20:36:54 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
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.");
|
2011-08-24 16:44:17 +00:00
|
|
|
|
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();
|
2011-08-24 16:44:17 +00:00
|
|
|
|
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
|
|
|
|
2010-10-20 00:31:05 +00:00
|
|
|
// Print TBAA info.
|
|
|
|
if (const MDNode *TBAAInfo = MMO.getTBAAInfo()) {
|
|
|
|
OS << "(tbaa=";
|
|
|
|
if (TBAAInfo->getNumOperands() > 0)
|
|
|
|
WriteAsOperand(OS, TBAAInfo->getOperand(0), /*PrintType=*/false);
|
|
|
|
else
|
|
|
|
OS << "<unknown>";
|
|
|
|
OS << ")";
|
|
|
|
}
|
|
|
|
|
2011-04-29 23:45:22 +00:00
|
|
|
// Print nontemporal info.
|
|
|
|
if (MMO.isNonTemporal())
|
|
|
|
OS << "(nontemporal)";
|
|
|
|
|
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
|
2011-06-28 19:10:37 +00:00
|
|
|
/// MCID NULL and no operands.
|
2006-11-27 23:37:22 +00:00
|
|
|
MachineInstr::MachineInstr()
|
2011-09-29 01:47:36 +00:00
|
|
|
: MCID(0), Flags(0), AsmPrinterFlags(0),
|
2012-03-16 16:39:27 +00:00
|
|
|
NumMemRefs(0), MemRefs(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() {
|
2011-06-28 19:10:37 +00:00
|
|
|
if (MCID->ImplicitDefs)
|
2012-03-08 08:22:45 +00:00
|
|
|
for (const uint16_t *ImpDefs = MCID->getImplicitDefs(); *ImpDefs; ++ImpDefs)
|
2007-12-30 00:41:17 +00:00
|
|
|
addOperand(MachineOperand::CreateReg(*ImpDefs, true, true));
|
2011-06-28 19:10:37 +00:00
|
|
|
if (MCID->ImplicitUses)
|
2012-03-08 08:22:45 +00:00
|
|
|
for (const uint16_t *ImpUses = MCID->getImplicitUses(); *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
|
2011-06-28 19:10:37 +00:00
|
|
|
/// the MCInstrDesc.
|
|
|
|
MachineInstr::MachineInstr(const MCInstrDesc &tid, bool NoImp)
|
2011-09-29 01:47:36 +00:00
|
|
|
: MCID(&tid), Flags(0), AsmPrinterFlags(0),
|
2012-03-16 16:39:27 +00:00
|
|
|
NumMemRefs(0), MemRefs(0), Parent(0) {
|
2011-09-29 01:47:36 +00:00
|
|
|
unsigned NumImplicitOps = 0;
|
2010-04-09 04:46:43 +00:00
|
|
|
if (!NoImp)
|
2011-06-28 19:10:37 +00:00
|
|
|
NumImplicitOps = MCID->getNumImplicitDefs() + MCID->getNumImplicitUses();
|
|
|
|
Operands.reserve(NumImplicitOps + MCID->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.
|
2011-06-28 19:10:37 +00:00
|
|
|
MachineInstr::MachineInstr(const MCInstrDesc &tid, const DebugLoc dl,
|
2009-01-27 23:20:29 +00:00
|
|
|
bool NoImp)
|
2011-09-29 01:47:36 +00:00
|
|
|
: MCID(&tid), Flags(0), AsmPrinterFlags(0),
|
2012-03-16 16:39:27 +00:00
|
|
|
NumMemRefs(0), MemRefs(0), Parent(0), debugLoc(dl) {
|
2011-09-29 01:47:36 +00:00
|
|
|
unsigned NumImplicitOps = 0;
|
2010-04-09 04:46:43 +00:00
|
|
|
if (!NoImp)
|
2011-06-28 19:10:37 +00:00
|
|
|
NumImplicitOps = MCID->getNumImplicitDefs() + MCID->getNumImplicitUses();
|
|
|
|
Operands.reserve(NumImplicitOps + MCID->getNumOperands());
|
2009-01-27 23:20:29 +00:00
|
|
|
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
|
2011-08-24 16:44:17 +00:00
|
|
|
/// that the MachineInstr is created and added to the end of the specified
|
2009-01-27 23:20:29 +00:00
|
|
|
/// basic block.
|
2011-06-28 19:10:37 +00:00
|
|
|
MachineInstr::MachineInstr(MachineBasicBlock *MBB, const MCInstrDesc &tid)
|
2011-09-29 01:47:36 +00:00
|
|
|
: MCID(&tid), Flags(0), AsmPrinterFlags(0),
|
2012-03-16 16:39:27 +00:00
|
|
|
NumMemRefs(0), MemRefs(0), Parent(0) {
|
2009-01-27 23:20:29 +00:00
|
|
|
assert(MBB && "Cannot use inserting ctor with null basic block!");
|
2011-09-29 01:47:36 +00:00
|
|
|
unsigned NumImplicitOps =
|
|
|
|
MCID->getNumImplicitDefs() + MCID->getNumImplicitUses();
|
2011-06-28 19:10:37 +00:00
|
|
|
Operands.reserve(NumImplicitOps + MCID->getNumOperands());
|
2009-01-27 23:20:29 +00:00
|
|
|
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,
|
2011-06-28 19:10:37 +00:00
|
|
|
const MCInstrDesc &tid)
|
2011-09-29 01:47:36 +00:00
|
|
|
: MCID(&tid), Flags(0), AsmPrinterFlags(0),
|
2012-03-16 16:39:27 +00:00
|
|
|
NumMemRefs(0), MemRefs(0), Parent(0), debugLoc(dl) {
|
2002-10-29 23:19:00 +00:00
|
|
|
assert(MBB && "Cannot use inserting ctor with null basic block!");
|
2011-09-29 01:47:36 +00:00
|
|
|
unsigned NumImplicitOps =
|
|
|
|
MCID->getNumImplicitDefs() + MCID->getNumImplicitUses();
|
2011-06-28 19:10:37 +00:00
|
|
|
Operands.reserve(NumImplicitOps + MCID->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)
|
2011-09-29 01:47:36 +00:00
|
|
|
: MCID(&MI.getDesc()), Flags(0), AsmPrinterFlags(0),
|
2012-03-16 16:39:27 +00:00
|
|
|
NumMemRefs(MI.NumMemRefs), MemRefs(MI.MemRefs),
|
2009-09-25 20:36:54 +00:00
|
|
|
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));
|
2004-05-24 03:14:18 +00:00
|
|
|
|
2011-03-05 18:43:04 +00:00
|
|
|
// Copy all the flags.
|
|
|
|
Flags = MI.Flags;
|
|
|
|
|
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.
|
2012-08-09 22:49:37 +00:00
|
|
|
void MachineInstr::RemoveRegOperandsFromUseLists(MachineRegisterInfo &MRI) {
|
|
|
|
for (unsigned i = 0, e = Operands.size(); i != e; ++i)
|
2008-10-03 15:45:36 +00:00
|
|
|
if (Operands[i].isReg())
|
2012-08-09 22:49:37 +00:00
|
|
|
MRI.removeRegOperandFromUseList(&Operands[i]);
|
2008-01-01 01:12:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// 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.
|
2012-08-09 22:49:37 +00:00
|
|
|
void MachineInstr::AddRegOperandsToUseLists(MachineRegisterInfo &MRI) {
|
|
|
|
for (unsigned i = 0, e = Operands.size(); i != e; ++i)
|
2008-10-03 15:45:36 +00:00
|
|
|
if (Operands[i].isReg())
|
2012-08-09 22:49:37 +00:00
|
|
|
MRI.addRegOperandToUseList(&Operands[i]);
|
2008-01-01 01:12:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// 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
|
2011-08-24 16:44:17 +00:00
|
|
|
/// (before the first implicit operand).
|
2008-01-01 01:12:31 +00:00
|
|
|
void MachineInstr::addOperand(const MachineOperand &Op) {
|
2011-09-29 00:40:51 +00:00
|
|
|
assert(MCID && "Cannot add operands before providing an instr descriptor");
|
2008-10-03 15:45:36 +00:00
|
|
|
bool isImpReg = Op.isReg() && Op.isImplicit();
|
2008-12-09 22:45:08 +00:00
|
|
|
MachineRegisterInfo *RegInfo = getRegInfo();
|
|
|
|
|
2011-09-29 00:40:51 +00:00
|
|
|
// If the Operands backing store is reallocated, all register operands must
|
|
|
|
// be removed and re-added to RegInfo. It is storing pointers to operands.
|
|
|
|
bool Reallocate = RegInfo &&
|
|
|
|
!Operands.empty() && Operands.size() == Operands.capacity();
|
|
|
|
|
|
|
|
// Find the insert location for the new operand. Implicit registers go at
|
|
|
|
// the end, everything goes before the implicit regs.
|
|
|
|
unsigned OpNo = Operands.size();
|
|
|
|
|
|
|
|
// Remove all the implicit operands from RegInfo if they need to be shifted.
|
|
|
|
// FIXME: Allow mixed explicit and implicit operands on inline asm.
|
|
|
|
// InstrEmitter::EmitSpecialNode() is marking inline asm clobbers as
|
|
|
|
// implicit-defs, but they must not be moved around. See the FIXME in
|
|
|
|
// InstrEmitter.cpp.
|
|
|
|
if (!isImpReg && !isInlineAsm()) {
|
|
|
|
while (OpNo && Operands[OpNo-1].isReg() && Operands[OpNo-1].isImplicit()) {
|
|
|
|
--OpNo;
|
|
|
|
if (RegInfo)
|
2012-08-09 22:49:37 +00:00
|
|
|
RegInfo->removeRegOperandFromUseList(&Operands[OpNo]);
|
2008-01-01 01:12:31 +00:00
|
|
|
}
|
|
|
|
}
|
2011-08-24 16:44:17 +00:00
|
|
|
|
2011-09-29 00:40:51 +00:00
|
|
|
// OpNo now points as the desired insertion point. Unless this is a variadic
|
|
|
|
// instruction, only implicit regs are allowed beyond MCID->getNumOperands().
|
2012-07-04 23:53:23 +00:00
|
|
|
// RegMask operands go between the explicit and implicit operands.
|
|
|
|
assert((isImpReg || Op.isRegMask() || MCID->isVariadic() ||
|
|
|
|
OpNo < MCID->getNumOperands()) &&
|
2011-09-29 00:40:51 +00:00
|
|
|
"Trying to add an operand to a machine instr that is already done!");
|
2008-01-01 01:12:31 +00:00
|
|
|
|
2011-09-29 00:40:51 +00:00
|
|
|
// All operands from OpNo have been removed from RegInfo. If the Operands
|
|
|
|
// backing store needs to be reallocated, we also need to remove any other
|
|
|
|
// register operands.
|
|
|
|
if (Reallocate)
|
|
|
|
for (unsigned i = 0; i != OpNo; ++i)
|
|
|
|
if (Operands[i].isReg())
|
2012-08-09 22:49:37 +00:00
|
|
|
RegInfo->removeRegOperandFromUseList(&Operands[i]);
|
2011-08-24 16:44:17 +00:00
|
|
|
|
2011-09-29 00:40:51 +00:00
|
|
|
// Insert the new operand at OpNo.
|
|
|
|
Operands.insert(Operands.begin() + OpNo, Op);
|
|
|
|
Operands[OpNo].ParentMI = this;
|
2011-08-24 16:44:17 +00:00
|
|
|
|
2011-09-29 00:40:51 +00:00
|
|
|
// The Operands backing store has now been reallocated, so we can re-add the
|
|
|
|
// operands before OpNo.
|
|
|
|
if (Reallocate)
|
|
|
|
for (unsigned i = 0; i != OpNo; ++i)
|
|
|
|
if (Operands[i].isReg())
|
2012-08-09 22:49:37 +00:00
|
|
|
RegInfo->addRegOperandToUseList(&Operands[i]);
|
2008-01-01 01:12:31 +00:00
|
|
|
|
2011-09-29 00:40:51 +00:00
|
|
|
// When adding a register operand, tell RegInfo about it.
|
|
|
|
if (Operands[OpNo].isReg()) {
|
2012-08-09 22:49:37 +00:00
|
|
|
// Ensure isOnRegUseList() returns false, regardless of Op's status.
|
|
|
|
Operands[OpNo].Contents.Reg.Prev = 0;
|
|
|
|
// Add the new operand to RegInfo.
|
|
|
|
if (RegInfo)
|
|
|
|
RegInfo->addRegOperandToUseList(&Operands[OpNo]);
|
2011-09-29 00:40:51 +00:00
|
|
|
// If the register operand is flagged as early, mark the operand as such.
|
|
|
|
if (MCID->getOperandConstraint(OpNo, MCOI::EARLY_CLOBBER) != -1)
|
|
|
|
Operands[OpNo].setIsEarlyClobber(true);
|
|
|
|
}
|
2011-08-24 16:44:17 +00:00
|
|
|
|
2011-09-29 00:40:51 +00:00
|
|
|
// Re-add all the implicit ops.
|
|
|
|
if (RegInfo) {
|
|
|
|
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!");
|
2012-08-09 22:49:37 +00:00
|
|
|
RegInfo->addRegOperandToUseList(&Operands[i]);
|
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");
|
2012-08-09 22:49:37 +00:00
|
|
|
MachineRegisterInfo *RegInfo = getRegInfo();
|
2011-08-24 16:44:17 +00:00
|
|
|
|
2008-01-01 01:12:31 +00:00
|
|
|
// Special case removing the last one.
|
|
|
|
if (OpNo == Operands.size()-1) {
|
|
|
|
// If needed, remove from the reg def/use list.
|
2012-08-09 22:49:37 +00:00
|
|
|
if (RegInfo && Operands.back().isReg() && Operands.back().isOnRegUseList())
|
|
|
|
RegInfo->removeRegOperandFromUseList(&Operands.back());
|
2011-08-24 16:44:17 +00:00
|
|
|
|
2008-01-01 01:12:31 +00:00
|
|
|
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.
|
|
|
|
if (RegInfo) {
|
|
|
|
for (unsigned i = OpNo, e = Operands.size(); i != e; ++i) {
|
2008-10-03 15:45:36 +00:00
|
|
|
if (Operands[i].isReg())
|
2012-08-09 22:49:37 +00:00
|
|
|
RegInfo->removeRegOperandFromUseList(&Operands[i]);
|
2008-01-01 01:12:31 +00:00
|
|
|
}
|
|
|
|
}
|
2011-08-24 16:44:17 +00:00
|
|
|
|
2008-01-01 01:12:31 +00:00
|
|
|
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())
|
2012-08-09 22:49:37 +00:00
|
|
|
RegInfo->addRegOperandToUseList(&Operands[i]);
|
2008-01-01 01:12:31 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
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;
|
2012-03-16 16:39:27 +00:00
|
|
|
uint16_t OldNumMemRefs = NumMemRefs;
|
2008-07-07 23:14:23 +00:00
|
|
|
|
2012-03-16 16:39:27 +00:00
|
|
|
uint16_t NewNum = NumMemRefs + 1;
|
2009-09-25 20:36:54 +00:00
|
|
|
mmo_iterator NewMemRefs = MF.allocateMemRefsArray(NewNum);
|
2008-07-07 23:14:23 +00:00
|
|
|
|
2012-03-16 16:39:27 +00:00
|
|
|
std::copy(OldMemRefs, OldMemRefs + OldNumMemRefs, NewMemRefs);
|
2009-09-25 20:36:54 +00:00
|
|
|
NewMemRefs[NewNum - 1] = MO;
|
|
|
|
|
|
|
|
MemRefs = NewMemRefs;
|
2012-03-16 16:39:27 +00:00
|
|
|
NumMemRefs = NewNum;
|
2009-09-25 20:36:54 +00:00
|
|
|
}
|
2008-01-01 01:12:31 +00:00
|
|
|
|
2012-03-17 17:03:45 +00:00
|
|
|
bool MachineInstr::hasPropertyInBundle(unsigned Mask, QueryType Type) const {
|
2011-12-06 22:12:01 +00:00
|
|
|
const MachineBasicBlock *MBB = getParent();
|
2011-12-14 02:11:42 +00:00
|
|
|
MachineBasicBlock::const_instr_iterator MII = *this; ++MII;
|
2011-12-06 22:12:01 +00:00
|
|
|
while (MII != MBB->end() && MII->isInsideBundle()) {
|
2012-03-17 17:03:45 +00:00
|
|
|
if (MII->getDesc().getFlags() & Mask) {
|
2011-12-08 19:23:10 +00:00
|
|
|
if (Type == AnyInBundle)
|
2011-12-07 07:15:52 +00:00
|
|
|
return true;
|
|
|
|
} else {
|
2011-12-08 19:23:10 +00:00
|
|
|
if (Type == AllInBundle)
|
2011-12-07 07:15:52 +00:00
|
|
|
return false;
|
|
|
|
}
|
2011-12-06 22:12:01 +00:00
|
|
|
++MII;
|
|
|
|
}
|
2011-12-07 07:15:52 +00:00
|
|
|
|
2011-12-08 19:23:10 +00:00
|
|
|
return Type == AllInBundle;
|
2011-12-06 22:12:01 +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;
|
|
|
|
|
2011-12-14 02:11:42 +00:00
|
|
|
if (isBundle()) {
|
|
|
|
// Both instructions are bundles, compare MIs inside the bundle.
|
|
|
|
MachineBasicBlock::const_instr_iterator I1 = *this;
|
|
|
|
MachineBasicBlock::const_instr_iterator E1 = getParent()->instr_end();
|
|
|
|
MachineBasicBlock::const_instr_iterator I2 = *Other;
|
|
|
|
MachineBasicBlock::const_instr_iterator E2= Other->getParent()->instr_end();
|
|
|
|
while (++I1 != E1 && I1->isInsideBundle()) {
|
|
|
|
++I2;
|
|
|
|
if (I2 == E2 || !I2->isInsideBundle() || !I1->isIdenticalTo(I2, Check))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-03-03 21:54:14 +00:00
|
|
|
// 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);
|
2011-05-12 00:56:58 +00:00
|
|
|
if (!MO.isReg()) {
|
|
|
|
if (!MO.isIdenticalTo(OMO))
|
|
|
|
return false;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2010-03-03 21:54:14 +00:00
|
|
|
// 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.
|
2011-05-12 00:56:58 +00:00
|
|
|
if (MO.isDef()) {
|
2010-03-03 21:54:14 +00:00
|
|
|
if (Check == IgnoreDefs)
|
|
|
|
continue;
|
2011-05-12 00:56:58 +00:00
|
|
|
else if (Check == IgnoreVRegDefs) {
|
|
|
|
if (TargetRegisterInfo::isPhysicalRegister(MO.getReg()) ||
|
|
|
|
TargetRegisterInfo::isPhysicalRegister(OMO.getReg()))
|
|
|
|
if (MO.getReg() != OMO.getReg())
|
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
if (!MO.isIdenticalTo(OMO))
|
|
|
|
return false;
|
|
|
|
if (Check == CheckKillDead && MO.isDead() != OMO.isDead())
|
2010-03-03 21:54:14 +00:00
|
|
|
return false;
|
2011-05-12 00:56:58 +00:00
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (!MO.isIdenticalTo(OMO))
|
|
|
|
return false;
|
|
|
|
if (Check == CheckKillDead && MO.isKill() != OMO.isKill())
|
|
|
|
return false;
|
|
|
|
}
|
2010-03-03 21:54:14 +00:00
|
|
|
}
|
2011-07-07 17:45:33 +00:00
|
|
|
// If DebugLoc does not match then two dbg.values are not identical.
|
|
|
|
if (isDebugValue())
|
|
|
|
if (!getDebugLoc().isUnknown() && !Other->getDebugLoc().isUnknown()
|
|
|
|
&& getDebugLoc() != Other->getDebugLoc())
|
|
|
|
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!");
|
2011-12-06 22:12:01 +00:00
|
|
|
|
|
|
|
// If it's a bundle then remove the MIs inside the bundle as well.
|
2011-12-14 02:11:42 +00:00
|
|
|
if (isBundle()) {
|
2011-12-06 22:12:01 +00:00
|
|
|
MachineBasicBlock *MBB = getParent();
|
2011-12-14 02:11:42 +00:00
|
|
|
MachineBasicBlock::instr_iterator MII = *this; ++MII;
|
|
|
|
MachineBasicBlock::instr_iterator E = MBB->instr_end();
|
|
|
|
while (MII != E && MII->isInsideBundle()) {
|
2011-12-06 22:12:01 +00:00
|
|
|
MachineInstr *MI = &*MII;
|
|
|
|
++MII;
|
|
|
|
MBB->remove(MI);
|
|
|
|
}
|
|
|
|
}
|
2006-04-17 21:35:41 +00:00
|
|
|
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!");
|
2011-12-06 22:12:01 +00:00
|
|
|
// If it's a bundle then remove the MIs inside the bundle as well.
|
2011-12-14 02:11:42 +00:00
|
|
|
if (isBundle()) {
|
2011-12-06 22:12:01 +00:00
|
|
|
MachineBasicBlock *MBB = getParent();
|
2011-12-14 02:11:42 +00:00
|
|
|
MachineBasicBlock::instr_iterator MII = *this; ++MII;
|
|
|
|
MachineBasicBlock::instr_iterator E = MBB->instr_end();
|
|
|
|
while (MII != E && MII->isInsideBundle()) {
|
2011-12-06 22:12:01 +00:00
|
|
|
MachineInstr *MI = &*MII;
|
|
|
|
++MII;
|
|
|
|
MBB->erase(MI);
|
|
|
|
}
|
|
|
|
}
|
2012-06-05 21:44:23 +00:00
|
|
|
// Erase the individual instruction, which may itself be inside a bundle.
|
|
|
|
getParent()->erase_instr(this);
|
2008-07-07 23:14:23 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2007-05-15 01:26:09 +00:00
|
|
|
/// getNumExplicitOperands - Returns the number of non-implicit operands.
|
|
|
|
///
|
|
|
|
unsigned MachineInstr::getNumExplicitOperands() const {
|
2011-06-28 19:10:37 +00:00
|
|
|
unsigned NumOperands = MCID->getNumOperands();
|
|
|
|
if (!MCID->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;
|
|
|
|
}
|
|
|
|
|
2012-02-08 02:17:25 +00:00
|
|
|
/// isBundled - Return true if this instruction part of a bundle. This is true
|
|
|
|
/// if either itself or its following instruction is marked "InsideBundle".
|
|
|
|
bool MachineInstr::isBundled() const {
|
|
|
|
if (isInsideBundle())
|
|
|
|
return true;
|
|
|
|
MachineBasicBlock::const_instr_iterator nextMI = this;
|
|
|
|
++nextMI;
|
|
|
|
return nextMI != Parent->instr_end() && nextMI->isInsideBundle();
|
|
|
|
}
|
|
|
|
|
2011-01-07 23:50:32 +00:00
|
|
|
bool MachineInstr::isStackAligningInlineAsm() const {
|
|
|
|
if (isInlineAsm()) {
|
|
|
|
unsigned ExtraInfo = getOperand(InlineAsm::MIOp_ExtraInfo).getImm();
|
|
|
|
if (ExtraInfo & InlineAsm::Extra_IsAlignStack)
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
2006-10-20 22:39:59 +00:00
|
|
|
|
2011-10-12 23:37:33 +00:00
|
|
|
int MachineInstr::findInlineAsmFlagIdx(unsigned OpIdx,
|
|
|
|
unsigned *GroupNo) const {
|
|
|
|
assert(isInlineAsm() && "Expected an inline asm instruction");
|
|
|
|
assert(OpIdx < getNumOperands() && "OpIdx out of range");
|
|
|
|
|
|
|
|
// Ignore queries about the initial operands.
|
|
|
|
if (OpIdx < InlineAsm::MIOp_FirstOperand)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
unsigned Group = 0;
|
|
|
|
unsigned NumOps;
|
|
|
|
for (unsigned i = InlineAsm::MIOp_FirstOperand, e = getNumOperands(); i < e;
|
|
|
|
i += NumOps) {
|
|
|
|
const MachineOperand &FlagMO = getOperand(i);
|
|
|
|
// If we reach the implicit register operands, stop looking.
|
|
|
|
if (!FlagMO.isImm())
|
|
|
|
return -1;
|
|
|
|
NumOps = 1 + InlineAsm::getNumOperandRegisters(FlagMO.getImm());
|
|
|
|
if (i + NumOps > OpIdx) {
|
|
|
|
if (GroupNo)
|
|
|
|
*GroupNo = Group;
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
++Group;
|
|
|
|
}
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2011-10-12 23:37:36 +00:00
|
|
|
const TargetRegisterClass*
|
|
|
|
MachineInstr::getRegClassConstraint(unsigned OpIdx,
|
|
|
|
const TargetInstrInfo *TII,
|
|
|
|
const TargetRegisterInfo *TRI) const {
|
2012-05-07 22:10:26 +00:00
|
|
|
assert(getParent() && "Can't have an MBB reference here!");
|
|
|
|
assert(getParent()->getParent() && "Can't have an MF reference here!");
|
|
|
|
const MachineFunction &MF = *getParent()->getParent();
|
|
|
|
|
2011-10-12 23:37:36 +00:00
|
|
|
// Most opcodes have fixed constraints in their MCInstrDesc.
|
|
|
|
if (!isInlineAsm())
|
2012-05-07 22:10:26 +00:00
|
|
|
return TII->getRegClass(getDesc(), OpIdx, TRI, MF);
|
2011-10-12 23:37:36 +00:00
|
|
|
|
|
|
|
if (!getOperand(OpIdx).isReg())
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
// For tied uses on inline asm, get the constraint from the def.
|
|
|
|
unsigned DefIdx;
|
|
|
|
if (getOperand(OpIdx).isUse() && isRegTiedToDefOperand(OpIdx, &DefIdx))
|
|
|
|
OpIdx = DefIdx;
|
|
|
|
|
|
|
|
// Inline asm stores register class constraints in the flag word.
|
|
|
|
int FlagIdx = findInlineAsmFlagIdx(OpIdx);
|
|
|
|
if (FlagIdx < 0)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
unsigned Flag = getOperand(FlagIdx).getImm();
|
|
|
|
unsigned RCID;
|
|
|
|
if (InlineAsm::hasRegClassConstraint(Flag, RCID))
|
|
|
|
return TRI->getRegClass(RCID);
|
|
|
|
|
|
|
|
// Assume that all registers in a memory operand are pointers.
|
|
|
|
if (InlineAsm::getKind(Flag) == InlineAsm::Kind_Mem)
|
2012-05-07 22:10:26 +00:00
|
|
|
return TRI->getPointerRegClass(MF);
|
2011-10-12 23:37:36 +00:00
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2011-12-14 02:11:42 +00:00
|
|
|
/// getBundleSize - Return the number of instructions inside the MI bundle.
|
|
|
|
unsigned MachineInstr::getBundleSize() const {
|
|
|
|
assert(isBundle() && "Expecting a bundle");
|
|
|
|
|
|
|
|
MachineBasicBlock::const_instr_iterator I = *this;
|
|
|
|
unsigned Size = 0;
|
|
|
|
while ((++I)->isInsideBundle()) {
|
|
|
|
++Size;
|
|
|
|
}
|
|
|
|
assert(Size > 1 && "Malformed bundle");
|
|
|
|
|
|
|
|
return Size;
|
|
|
|
}
|
|
|
|
|
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();
|
2011-08-19 00:30:17 +00:00
|
|
|
else if (MO.getSubReg() && !MO.isUndef())
|
|
|
|
// A partial <def,undef> doesn't count as reading the register.
|
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);
|
2012-02-14 23:49:37 +00:00
|
|
|
// Accept regmask operands when Overlap is set.
|
|
|
|
// Ignore them when looking for a specific def operand (Overlap == false).
|
|
|
|
if (isPhys && Overlap && MO.isRegMask() && MO.clobbersPhysReg(Reg))
|
|
|
|
return 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 {
|
2011-08-29 22:24:09 +00:00
|
|
|
// Don't call MCID.findFirstPredOperandIdx() because this variant
|
|
|
|
// is sometimes called on an instruction that's not yet complete, and
|
|
|
|
// so the number of operands is less than the MCID indicates. In
|
|
|
|
// particular, the PTX target does this.
|
2011-06-28 19:10:37 +00:00
|
|
|
const MCInstrDesc &MCID = getDesc();
|
|
|
|
if (MCID.isPredicable()) {
|
2007-05-15 01:26:09 +00:00
|
|
|
for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
|
2011-06-28 19:10:37 +00:00
|
|
|
if (MCID.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
|
|
|
}
|
2011-08-24 16:44:17 +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()) {
|
2011-01-07 23:50:32 +00:00
|
|
|
assert(DefOpIdx > InlineAsm::MIOp_FirstOperand);
|
2009-04-09 17:16:43 +00:00
|
|
|
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;
|
2011-10-12 23:37:33 +00:00
|
|
|
int FlagIdx = findInlineAsmFlagIdx(DefOpIdx, &DefNo);
|
|
|
|
if (FlagIdx < 0)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Which part of the group is DefOpIdx?
|
|
|
|
unsigned DefPart = DefOpIdx - (FlagIdx + 1);
|
|
|
|
|
2011-01-07 23:50:32 +00:00
|
|
|
for (unsigned i = InlineAsm::MIOp_FirstOperand, 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!");
|
2011-06-28 19:10:37 +00:00
|
|
|
const MCInstrDesc &MCID = getDesc();
|
|
|
|
for (unsigned i = 0, e = MCID.getNumOperands(); i != e; ++i) {
|
2008-07-10 07:35:43 +00:00
|
|
|
const MachineOperand &MO = getOperand(i);
|
2008-12-05 05:45:42 +00:00
|
|
|
if (MO.isReg() && MO.isUse() &&
|
2011-06-28 19:10:37 +00:00
|
|
|
MCID.getOperandConstraint(i, MCOI::TIED_TO) == (int)DefOpIdx) {
|
2009-04-09 17:16:43 +00:00
|
|
|
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
|
2011-10-12 23:37:33 +00:00
|
|
|
int FlagIdx = findInlineAsmFlagIdx(UseOpIdx);
|
|
|
|
if (FlagIdx < 0)
|
2009-06-24 02:05:51 +00:00
|
|
|
return false;
|
2011-10-12 23:37:33 +00:00
|
|
|
|
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;
|
|
|
|
|
2011-01-07 23:50:32 +00:00
|
|
|
unsigned DefIdx = InlineAsm::MIOp_FirstOperand;
|
2010-07-02 20:16:09 +00:00
|
|
|
// Remember to adjust the index. First operand is asm string, second is
|
2011-01-07 23:50:32 +00:00
|
|
|
// the HasSideEffects and AlignStack bits, then there is a flag for each.
|
2009-03-23 08:01:15 +00:00
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
2011-06-28 19:10:37 +00:00
|
|
|
const MCInstrDesc &MCID = getDesc();
|
|
|
|
if (UseOpIdx >= MCID.getNumOperands())
|
2009-03-19 20:30:06 +00:00
|
|
|
return false;
|
|
|
|
const MachineOperand &MO = getOperand(UseOpIdx);
|
|
|
|
if (!MO.isReg() || !MO.isUse())
|
|
|
|
return false;
|
2011-06-28 19:10:37 +00:00
|
|
|
int DefIdx = MCID.getOperandConstraint(UseOpIdx, MCOI::TIED_TO);
|
2009-03-19 20:30:06 +00:00
|
|
|
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) {
|
2011-12-14 02:11:42 +00:00
|
|
|
assert(!isBundle() && "MachineInstr::copyPredicates() can't handle bundles");
|
2011-12-07 07:15:52 +00:00
|
|
|
|
2011-06-28 19:10:37 +00:00
|
|
|
const MCInstrDesc &MCID = MI->getDesc();
|
|
|
|
if (!MCID.isPredicable())
|
2008-03-13 00:44:09 +00:00
|
|
|
return;
|
|
|
|
for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
|
2011-06-28 19:10:37 +00:00
|
|
|
if (MCID.OpInfo[i].isPredicate()) {
|
2008-03-13 00:44:09 +00:00
|
|
|
// 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.
|
2011-12-07 07:15:52 +00:00
|
|
|
if (mayStore() || isCall()) {
|
2008-03-13 00:44:09 +00:00
|
|
|
SawStore = true;
|
|
|
|
return false;
|
|
|
|
}
|
2011-01-07 21:08:26 +00:00
|
|
|
|
|
|
|
if (isLabel() || isDebugValue() ||
|
2011-12-07 07:15:52 +00:00
|
|
|
isTerminator() || 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.
|
2011-12-07 07:15:52 +00:00
|
|
|
if (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.
|
2011-12-07 07:15:52 +00:00
|
|
|
if (!mayStore() &&
|
|
|
|
!mayLoad() &&
|
|
|
|
!isCall() &&
|
2011-01-07 23:50:32 +00:00
|
|
|
!hasUnmodeledSideEffects())
|
2008-09-24 00:06:15 +00:00
|
|
|
return false;
|
|
|
|
|
|
|
|
// Otherwise, if the instruction has no memory reference information,
|
|
|
|
// conservatively assume it wasn't preserved.
|
|
|
|
if (memoperands_empty())
|
|
|
|
return true;
|
2011-08-24 16:44:17 +00:00
|
|
|
|
2008-09-24 00:06:15 +00:00
|
|
|
// 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.
|
2011-12-07 07:15:52 +00:00
|
|
|
if (!mayLoad())
|
2009-10-07 17:38:06 +00:00
|
|
|
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;
|
2011-11-08 18:42:53 +00:00
|
|
|
if ((*I)->isInvariant()) return true;
|
2009-10-07 17:38:06 +00:00
|
|
|
|
|
|
|
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.
|
2010-10-20 00:31:05 +00:00
|
|
|
if (AA && AA->pointsToConstantMemory(
|
|
|
|
AliasAnalysis::Location(V, (*I)->getSize(),
|
|
|
|
(*I)->getTBAAInfo())))
|
2009-10-07 17:38:06 +00:00
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
2011-01-07 23:50:32 +00:00
|
|
|
bool MachineInstr::hasUnmodeledSideEffects() const {
|
2011-12-07 07:15:52 +00:00
|
|
|
if (hasProperty(MCID::UnmodeledSideEffects))
|
2011-01-07 23:50:32 +00:00
|
|
|
return true;
|
|
|
|
if (isInlineAsm()) {
|
|
|
|
unsigned ExtraInfo = getOperand(InlineAsm::MIOp_ExtraInfo).getImm();
|
|
|
|
if (ExtraInfo & InlineAsm::Extra_HasSideEffects)
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
2010-10-22 21:49:09 +00:00
|
|
|
/// copyImplicitOps - Copy implicit register operands from specified
|
|
|
|
/// instruction to this instruction.
|
|
|
|
void MachineInstr::copyImplicitOps(const MachineInstr *MI) {
|
|
|
|
for (unsigned i = MI->getDesc().getNumOperands(), e = MI->getNumOperands();
|
|
|
|
i != e; ++i) {
|
|
|
|
const MachineOperand &MO = MI->getOperand(i);
|
|
|
|
if (MO.isReg() && MO.isImplicit())
|
|
|
|
addOperand(MO);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
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
|
|
|
}
|
|
|
|
|
2011-08-24 16:44:17 +00:00
|
|
|
static void printDebugLoc(DebugLoc DL, const MachineFunction *MF,
|
2010-06-29 21:51:32 +00:00
|
|
|
raw_ostream &CommentOS) {
|
|
|
|
const LLVMContext &Ctx = MF->getFunction()->getContext();
|
|
|
|
if (!DL.isUnknown()) { // Print source line info.
|
|
|
|
DIScope Scope(DL.getScope(Ctx));
|
|
|
|
// Omit the directory, because it's likely to be long and uninteresting.
|
|
|
|
if (Scope.Verify())
|
|
|
|
CommentOS << Scope.getFilename();
|
|
|
|
else
|
|
|
|
CommentOS << "<unknown>";
|
|
|
|
CommentOS << ':' << DL.getLine();
|
|
|
|
if (DL.getCol() != 0)
|
|
|
|
CommentOS << ':' << DL.getCol();
|
|
|
|
DebugLoc InlinedAtDL = DebugLoc::getFromDILocation(DL.getInlinedAt(Ctx));
|
|
|
|
if (!InlinedAtDL.isUnknown()) {
|
|
|
|
CommentOS << " @[ ";
|
|
|
|
printDebugLoc(InlinedAtDL, MF, CommentOS);
|
|
|
|
CommentOS << " ]";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
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;
|
2010-07-28 18:35:46 +00:00
|
|
|
const MachineRegisterInfo *MRI = 0;
|
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 (const MachineBasicBlock *MBB = getParent()) {
|
|
|
|
MF = MBB->getParent();
|
|
|
|
if (!TM && MF)
|
|
|
|
TM = &MF->getTarget();
|
2010-07-28 18:35:46 +00:00
|
|
|
if (MF)
|
|
|
|
MRI = &MF->getRegInfo();
|
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
|
|
|
}
|
2009-10-31 20:19:03 +00:00
|
|
|
|
2010-07-28 18:35:46 +00:00
|
|
|
// Save a list of virtual registers.
|
|
|
|
SmallVector<unsigned, 8> VirtRegs;
|
|
|
|
|
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);
|
2010-07-28 18:35:46 +00:00
|
|
|
unsigned Reg = getOperand(StartOp).getReg();
|
2011-01-10 02:58:51 +00:00
|
|
|
if (TargetRegisterInfo::isVirtualRegister(Reg))
|
2010-07-28 18:35:46 +00:00
|
|
|
VirtRegs.push_back(Reg);
|
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.
|
2012-02-10 13:18:44 +00:00
|
|
|
if (TM && TM->getInstrInfo())
|
|
|
|
OS << TM->getInstrInfo()->getName(getOpcode());
|
|
|
|
else
|
|
|
|
OS << "UNKNOWN";
|
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;
|
Decode and pretty print inline asm operand descriptors.
The INLINEASM MachineInstrs have an immediate operand describing each
original inline asm operand. Decode the bits in MachineInstr::print() so
it is easier to read:
INLINEASM <es:rorq $1,$0>, $0:[regdef], %vreg0<def>, %vreg1<def>, $1:[imm], 1, $2:[reguse] [tiedto:$0], %vreg2, %vreg3, $3:[regdef-ec], %EFLAGS<earlyclobber,imp-def>
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@133901 91177308-0d34-0410-b5e6-96231b3b80d8
2011-06-27 04:08:29 +00:00
|
|
|
unsigned AsmDescOp = ~0u;
|
|
|
|
unsigned AsmOpCount = 0;
|
2011-01-07 23:50:32 +00:00
|
|
|
|
2011-09-29 00:40:51 +00:00
|
|
|
if (isInlineAsm() && e >= InlineAsm::MIOp_FirstOperand) {
|
2011-01-07 23:50:32 +00:00
|
|
|
// Print asm string.
|
|
|
|
OS << " ";
|
|
|
|
getOperand(InlineAsm::MIOp_AsmString).print(OS, TM);
|
|
|
|
|
|
|
|
// Print HasSideEffects, IsAlignStack
|
|
|
|
unsigned ExtraInfo = getOperand(InlineAsm::MIOp_ExtraInfo).getImm();
|
|
|
|
if (ExtraInfo & InlineAsm::Extra_HasSideEffects)
|
|
|
|
OS << " [sideeffect]";
|
|
|
|
if (ExtraInfo & InlineAsm::Extra_IsAlignStack)
|
|
|
|
OS << " [alignstack]";
|
|
|
|
|
Decode and pretty print inline asm operand descriptors.
The INLINEASM MachineInstrs have an immediate operand describing each
original inline asm operand. Decode the bits in MachineInstr::print() so
it is easier to read:
INLINEASM <es:rorq $1,$0>, $0:[regdef], %vreg0<def>, %vreg1<def>, $1:[imm], 1, $2:[reguse] [tiedto:$0], %vreg2, %vreg3, $3:[regdef-ec], %EFLAGS<earlyclobber,imp-def>
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@133901 91177308-0d34-0410-b5e6-96231b3b80d8
2011-06-27 04:08:29 +00:00
|
|
|
StartOp = AsmDescOp = InlineAsm::MIOp_FirstOperand;
|
2011-01-07 23:50:32 +00:00
|
|
|
FirstOp = false;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
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);
|
|
|
|
|
2011-01-10 02:58:51 +00:00
|
|
|
if (MO.isReg() && TargetRegisterInfo::isVirtualRegister(MO.getReg()))
|
2010-07-28 18:35:46 +00:00
|
|
|
VirtRegs.push_back(MO.getReg());
|
|
|
|
|
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
|
|
|
// 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.
|
2011-12-07 07:15:52 +00:00
|
|
|
if (MF && isCall() &&
|
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
|
|
|
MO.isReg() && MO.isImplicit() && MO.isDef()) {
|
|
|
|
unsigned Reg = MO.getReg();
|
2011-01-10 02:58:51 +00:00
|
|
|
if (TargetRegisterInfo::isPhysicalRegister(Reg)) {
|
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 MachineRegisterInfo &MRI = MF->getRegInfo();
|
|
|
|
if (MRI.use_empty(Reg) && !MRI.isLiveOut(Reg)) {
|
|
|
|
bool HasAliasLive = false;
|
2012-06-01 23:28:30 +00:00
|
|
|
for (MCRegAliasIterator AI(Reg, TM->getRegisterInfo(), true);
|
|
|
|
AI.isValid(); ++AI) {
|
|
|
|
unsigned AliasReg = *AI;
|
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 (!MRI.use_empty(AliasReg) || MRI.isLiveOut(AliasReg)) {
|
|
|
|
HasAliasLive = true;
|
|
|
|
break;
|
|
|
|
}
|
2012-06-01 23:28:30 +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 (!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) {
|
2011-06-28 19:10:37 +00:00
|
|
|
const MCOperandInfo &MCOI = getDesc().OpInfo[i];
|
|
|
|
if (MCOI.isPredicate())
|
2010-01-19 22:08:34 +00:00
|
|
|
OS << "pred:";
|
2011-06-28 19:10:37 +00:00
|
|
|
if (MCOI.isOptionalDef())
|
2010-01-19 22:08:34 +00:00
|
|
|
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);
|
2010-07-04 23:24:23 +00:00
|
|
|
} else if (TM && (isInsertSubreg() || isRegSequence()) && MO.isImm()) {
|
|
|
|
OS << TM->getRegisterInfo()->getSubRegIndexName(MO.getImm());
|
Decode and pretty print inline asm operand descriptors.
The INLINEASM MachineInstrs have an immediate operand describing each
original inline asm operand. Decode the bits in MachineInstr::print() so
it is easier to read:
INLINEASM <es:rorq $1,$0>, $0:[regdef], %vreg0<def>, %vreg1<def>, $1:[imm], 1, $2:[reguse] [tiedto:$0], %vreg2, %vreg3, $3:[regdef-ec], %EFLAGS<earlyclobber,imp-def>
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@133901 91177308-0d34-0410-b5e6-96231b3b80d8
2011-06-27 04:08:29 +00:00
|
|
|
} else if (i == AsmDescOp && MO.isImm()) {
|
|
|
|
// Pretty print the inline asm operand descriptor.
|
|
|
|
OS << '$' << AsmOpCount++;
|
|
|
|
unsigned Flag = MO.getImm();
|
|
|
|
switch (InlineAsm::getKind(Flag)) {
|
2011-10-12 23:37:29 +00:00
|
|
|
case InlineAsm::Kind_RegUse: OS << ":[reguse"; break;
|
|
|
|
case InlineAsm::Kind_RegDef: OS << ":[regdef"; break;
|
|
|
|
case InlineAsm::Kind_RegDefEarlyClobber: OS << ":[regdef-ec"; break;
|
|
|
|
case InlineAsm::Kind_Clobber: OS << ":[clobber"; break;
|
|
|
|
case InlineAsm::Kind_Imm: OS << ":[imm"; break;
|
|
|
|
case InlineAsm::Kind_Mem: OS << ":[mem"; break;
|
|
|
|
default: OS << ":[??" << InlineAsm::getKind(Flag); break;
|
Decode and pretty print inline asm operand descriptors.
The INLINEASM MachineInstrs have an immediate operand describing each
original inline asm operand. Decode the bits in MachineInstr::print() so
it is easier to read:
INLINEASM <es:rorq $1,$0>, $0:[regdef], %vreg0<def>, %vreg1<def>, $1:[imm], 1, $2:[reguse] [tiedto:$0], %vreg2, %vreg3, $3:[regdef-ec], %EFLAGS<earlyclobber,imp-def>
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@133901 91177308-0d34-0410-b5e6-96231b3b80d8
2011-06-27 04:08:29 +00:00
|
|
|
}
|
|
|
|
|
2011-10-12 23:37:29 +00:00
|
|
|
unsigned RCID = 0;
|
2011-10-13 00:54:59 +00:00
|
|
|
if (InlineAsm::hasRegClassConstraint(Flag, RCID)) {
|
2011-10-12 23:37:29 +00:00
|
|
|
if (TM)
|
|
|
|
OS << ':' << TM->getRegisterInfo()->getRegClass(RCID)->getName();
|
|
|
|
else
|
|
|
|
OS << ":RC" << RCID;
|
2011-10-13 00:54:59 +00:00
|
|
|
}
|
2011-10-12 23:37:29 +00:00
|
|
|
|
Decode and pretty print inline asm operand descriptors.
The INLINEASM MachineInstrs have an immediate operand describing each
original inline asm operand. Decode the bits in MachineInstr::print() so
it is easier to read:
INLINEASM <es:rorq $1,$0>, $0:[regdef], %vreg0<def>, %vreg1<def>, $1:[imm], 1, $2:[reguse] [tiedto:$0], %vreg2, %vreg3, $3:[regdef-ec], %EFLAGS<earlyclobber,imp-def>
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@133901 91177308-0d34-0410-b5e6-96231b3b80d8
2011-06-27 04:08:29 +00:00
|
|
|
unsigned TiedTo = 0;
|
|
|
|
if (InlineAsm::isUseOperandTiedToDef(Flag, TiedTo))
|
2011-10-12 23:37:29 +00:00
|
|
|
OS << " tiedto:$" << TiedTo;
|
|
|
|
|
|
|
|
OS << ']';
|
Decode and pretty print inline asm operand descriptors.
The INLINEASM MachineInstrs have an immediate operand describing each
original inline asm operand. Decode the bits in MachineInstr::print() so
it is easier to read:
INLINEASM <es:rorq $1,$0>, $0:[regdef], %vreg0<def>, %vreg1<def>, $1:[imm], 1, $2:[reguse] [tiedto:$0], %vreg2, %vreg3, $3:[regdef-ec], %EFLAGS<earlyclobber,imp-def>
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@133901 91177308-0d34-0410-b5e6-96231b3b80d8
2011-06-27 04:08:29 +00:00
|
|
|
|
|
|
|
// Compute the index of the next operand descriptor.
|
|
|
|
AsmDescOp += 1 + InlineAsm::getNumOperandRegisters(Flag);
|
2010-04-28 20:03:13 +00:00
|
|
|
} 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;
|
2011-03-05 18:43:04 +00:00
|
|
|
if (Flags) {
|
|
|
|
if (!HaveSemi) OS << ";"; HaveSemi = true;
|
|
|
|
OS << " flags: ";
|
|
|
|
|
|
|
|
if (Flags & FrameSetup)
|
|
|
|
OS << "FrameSetup";
|
|
|
|
}
|
|
|
|
|
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;
|
2010-08-02 06:00:15 +00:00
|
|
|
if (llvm::next(i) != e)
|
2009-09-23 01:33:16 +00:00
|
|
|
OS << " ";
|
2008-02-06 22:27:42 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-07-28 18:35:46 +00:00
|
|
|
// Print the regclass of any virtual registers encountered.
|
|
|
|
if (MRI && !VirtRegs.empty()) {
|
|
|
|
if (!HaveSemi) OS << ";"; HaveSemi = true;
|
|
|
|
for (unsigned i = 0; i != VirtRegs.size(); ++i) {
|
|
|
|
const TargetRegisterClass *RC = MRI->getRegClass(VirtRegs[i]);
|
2011-01-09 03:05:53 +00:00
|
|
|
OS << " " << RC->getName() << ':' << PrintReg(VirtRegs[i]);
|
2010-07-28 18:35:46 +00:00
|
|
|
for (unsigned j = i+1; j != VirtRegs.size();) {
|
|
|
|
if (MRI->getRegClass(VirtRegs[j]) != RC) {
|
|
|
|
++j;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (VirtRegs[i] != VirtRegs[j])
|
2011-01-09 03:05:53 +00:00
|
|
|
OS << "," << PrintReg(VirtRegs[j]);
|
2010-07-28 18:35:46 +00:00
|
|
|
VirtRegs.erase(VirtRegs.begin()+j);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-03-05 18:43:04 +00:00
|
|
|
// Print debug location information.
|
2011-08-04 20:44:26 +00:00
|
|
|
if (isDebugValue() && getOperand(e - 1).isMetadata()) {
|
|
|
|
if (!HaveSemi) OS << ";"; HaveSemi = true;
|
|
|
|
DIVariable DV(getOperand(e - 1).getMetadata());
|
|
|
|
OS << " line no:" << DV.getLineNumber();
|
|
|
|
if (MDNode *InlinedAt = DV.getInlinedAt()) {
|
|
|
|
DebugLoc InlinedAtDL = DebugLoc::getFromDILocation(InlinedAt);
|
|
|
|
if (!InlinedAtDL.isUnknown()) {
|
|
|
|
OS << " inlined @[ ";
|
|
|
|
printDebugLoc(InlinedAtDL, MF, OS);
|
|
|
|
OS << " ]";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else if (!debugLoc.isUnknown() && MF) {
|
2011-03-05 18:43:04 +00:00
|
|
|
if (!HaveSemi) OS << ";"; HaveSemi = true;
|
2009-11-23 21:29:08 +00:00
|
|
|
OS << " dbg:";
|
2010-06-29 21:51:32 +00:00
|
|
|
printDebugLoc(debugLoc, MF, OS);
|
2009-02-19 21:44:55 +00:00
|
|
|
}
|
|
|
|
|
2011-03-05 18:43:04 +00:00
|
|
|
OS << '\n';
|
2002-10-30 00:48:05 +00:00
|
|
|
}
|
|
|
|
|
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);
|
2012-06-01 23:28:30 +00:00
|
|
|
bool hasAliases = isPhysReg &&
|
|
|
|
MCRegAliasIterator(IncomingReg, RegInfo, false).isValid();
|
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
|
|
|
}
|
|
|
|
|
2012-01-26 17:52:15 +00:00
|
|
|
void MachineInstr::clearRegisterKills(unsigned Reg,
|
|
|
|
const TargetRegisterInfo *RegInfo) {
|
|
|
|
if (!TargetRegisterInfo::isPhysicalRegister(Reg))
|
|
|
|
RegInfo = 0;
|
|
|
|
for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
|
|
|
|
MachineOperand &MO = getOperand(i);
|
|
|
|
if (!MO.isReg() || !MO.isUse() || !MO.isKill())
|
|
|
|
continue;
|
|
|
|
unsigned OpReg = MO.getReg();
|
|
|
|
if (OpReg == Reg || (RegInfo && RegInfo->isSuperRegister(Reg, OpReg)))
|
|
|
|
MO.setIsKill(false);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
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);
|
2012-06-01 23:28:30 +00:00
|
|
|
bool hasAliases = isPhysReg &&
|
|
|
|
MCRegAliasIterator(IncomingReg, RegInfo, false).isValid();
|
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) {
|
2011-04-05 16:53:50 +00:00
|
|
|
MO.setIsDead();
|
|
|
|
Found = true;
|
2008-09-03 15:56:16 +00:00
|
|
|
} 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;
|
2012-05-30 18:38:56 +00:00
|
|
|
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 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;
|
2011-08-24 16:44:17 +00:00
|
|
|
|
2009-06-24 17:54:48 +00:00
|
|
|
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
|
|
|
|
2012-02-03 20:43:39 +00:00
|
|
|
void MachineInstr::setPhysRegsDeadExcept(ArrayRef<unsigned> UsedRegs,
|
2010-06-18 23:28:01 +00:00
|
|
|
const TargetRegisterInfo &TRI) {
|
2012-02-03 21:23:14 +00:00
|
|
|
bool HasRegMask = false;
|
2010-06-18 23:28:01 +00:00
|
|
|
for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
|
|
|
|
MachineOperand &MO = getOperand(i);
|
2012-02-03 21:23:14 +00:00
|
|
|
if (MO.isRegMask()) {
|
|
|
|
HasRegMask = true;
|
|
|
|
continue;
|
|
|
|
}
|
2010-06-18 23:28:01 +00:00
|
|
|
if (!MO.isReg() || !MO.isDef()) continue;
|
|
|
|
unsigned Reg = MO.getReg();
|
2012-02-03 20:43:35 +00:00
|
|
|
if (!TargetRegisterInfo::isPhysicalRegister(Reg)) continue;
|
2010-06-18 23:28:01 +00:00
|
|
|
bool Dead = true;
|
2012-02-03 20:43:39 +00:00
|
|
|
for (ArrayRef<unsigned>::iterator I = UsedRegs.begin(), E = UsedRegs.end();
|
|
|
|
I != E; ++I)
|
2010-06-18 23:28:01 +00:00
|
|
|
if (TRI.regsOverlap(*I, Reg)) {
|
|
|
|
Dead = false;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
// If there are no uses, including partial uses, the def is dead.
|
|
|
|
if (Dead) MO.setIsDead();
|
|
|
|
}
|
2012-02-03 21:23:14 +00:00
|
|
|
|
|
|
|
// This is a call with a register mask operand.
|
|
|
|
// Mask clobbers are always dead, so add defs for the non-dead defines.
|
|
|
|
if (HasRegMask)
|
|
|
|
for (ArrayRef<unsigned>::iterator I = UsedRegs.begin(), E = UsedRegs.end();
|
|
|
|
I != E; ++I)
|
|
|
|
addRegisterDefined(*I, &TRI);
|
2010-06-18 23:28:01 +00:00
|
|
|
}
|
|
|
|
|
2010-03-03 23:37:30 +00:00
|
|
|
unsigned
|
|
|
|
MachineInstrExpressionTrait::getHashValue(const MachineInstr* const &MI) {
|
2012-03-07 09:39:46 +00:00
|
|
|
// Build up a buffer of hash code components.
|
|
|
|
SmallVector<size_t, 8> HashComponents;
|
|
|
|
HashComponents.reserve(MI->getNumOperands() + 1);
|
|
|
|
HashComponents.push_back(MI->getOpcode());
|
2010-03-03 23:37:30 +00:00
|
|
|
for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
|
|
|
|
const MachineOperand &MO = MI->getOperand(i);
|
2012-07-05 11:06:22 +00:00
|
|
|
if (MO.isReg() && MO.isDef() &&
|
|
|
|
TargetRegisterInfo::isVirtualRegister(MO.getReg()))
|
|
|
|
continue; // Skip virtual register defs.
|
|
|
|
|
|
|
|
HashComponents.push_back(hash_value(MO));
|
2012-03-07 09:39:46 +00:00
|
|
|
}
|
|
|
|
return hash_combine_range(HashComponents.begin(), HashComponents.end());
|
2010-03-03 23:37:30 +00:00
|
|
|
}
|
2011-07-02 03:53:34 +00:00
|
|
|
|
|
|
|
void MachineInstr::emitError(StringRef Msg) const {
|
|
|
|
// Find the source location cookie.
|
|
|
|
unsigned LocCookie = 0;
|
|
|
|
const MDNode *LocMD = 0;
|
|
|
|
for (unsigned i = getNumOperands(); i != 0; --i) {
|
|
|
|
if (getOperand(i-1).isMetadata() &&
|
|
|
|
(LocMD = getOperand(i-1).getMetadata()) &&
|
|
|
|
LocMD->getNumOperands() != 0) {
|
|
|
|
if (const ConstantInt *CI = dyn_cast<ConstantInt>(LocMD->getOperand(0))) {
|
|
|
|
LocCookie = CI->getZExtValue();
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (const MachineBasicBlock *MBB = getParent())
|
|
|
|
if (const MachineFunction *MF = MBB->getParent())
|
|
|
|
return MF->getMMI().getModule()->getContext().emitError(LocCookie, Msg);
|
|
|
|
report_fatal_error(Msg);
|
|
|
|
}
|