2008-01-06 09:35:39 +08:00
|
|
|
//===- CodeGenInstruction.cpp - CodeGen Instruction Class Wrapper ---------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file implements the CodeGenInstruction class.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "CodeGenInstruction.h"
|
2010-03-28 04:09:24 +08:00
|
|
|
#include "CodeGenTarget.h"
|
2012-12-04 18:37:14 +08:00
|
|
|
#include "llvm/ADT/STLExtras.h"
|
2008-01-06 09:35:39 +08:00
|
|
|
#include "llvm/ADT/StringExtras.h"
|
2010-11-06 15:06:09 +08:00
|
|
|
#include "llvm/ADT/StringMap.h"
|
2012-12-04 18:37:14 +08:00
|
|
|
#include "llvm/TableGen/Error.h"
|
|
|
|
#include "llvm/TableGen/Record.h"
|
2008-01-06 09:35:39 +08:00
|
|
|
#include <set>
|
|
|
|
using namespace llvm;
|
|
|
|
|
2010-11-01 12:03:32 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// CGIOperandList Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
2008-01-06 09:35:39 +08:00
|
|
|
|
2010-11-01 12:03:32 +08:00
|
|
|
CGIOperandList::CGIOperandList(Record *R) : TheDef(R) {
|
|
|
|
isPredicable = false;
|
2008-01-06 09:35:39 +08:00
|
|
|
hasOptionalDef = false;
|
2008-01-07 13:19:29 +08:00
|
|
|
isVariadic = false;
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2011-07-30 06:43:06 +08:00
|
|
|
DagInit *OutDI = R->getValueAsDag("OutOperandList");
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2012-10-11 04:24:43 +08:00
|
|
|
if (DefInit *Init = dyn_cast<DefInit>(OutDI->getOperator())) {
|
2010-03-19 04:56:35 +08:00
|
|
|
if (Init->getDef()->getName() != "outs")
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError(R->getName() + ": invalid def name for output list: use 'outs'");
|
2010-03-19 04:50:52 +08:00
|
|
|
} else
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError(R->getName() + ": invalid output list: use 'outs'");
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-03-19 05:07:39 +08:00
|
|
|
NumDefs = OutDI->getNumArgs();
|
2010-11-01 12:03:32 +08:00
|
|
|
|
2011-07-30 06:43:06 +08:00
|
|
|
DagInit *InDI = R->getValueAsDag("InOperandList");
|
2012-10-11 04:24:43 +08:00
|
|
|
if (DefInit *Init = dyn_cast<DefInit>(InDI->getOperator())) {
|
2010-03-19 04:56:35 +08:00
|
|
|
if (Init->getDef()->getName() != "ins")
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError(R->getName() + ": invalid def name for input list: use 'ins'");
|
2010-03-19 04:50:52 +08:00
|
|
|
} else
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError(R->getName() + ": invalid input list: use 'ins'");
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2008-01-06 09:35:39 +08:00
|
|
|
unsigned MIOperandNo = 0;
|
|
|
|
std::set<std::string> OperandNames;
|
2010-03-19 05:07:39 +08:00
|
|
|
for (unsigned i = 0, e = InDI->getNumArgs()+OutDI->getNumArgs(); i != e; ++i){
|
2011-07-30 06:43:06 +08:00
|
|
|
Init *ArgInit;
|
2010-03-19 05:07:39 +08:00
|
|
|
std::string ArgName;
|
|
|
|
if (i < NumDefs) {
|
|
|
|
ArgInit = OutDI->getArg(i);
|
|
|
|
ArgName = OutDI->getArgName(i);
|
|
|
|
} else {
|
|
|
|
ArgInit = InDI->getArg(i-NumDefs);
|
|
|
|
ArgName = InDI->getArgName(i-NumDefs);
|
|
|
|
}
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2012-10-11 04:24:43 +08:00
|
|
|
DefInit *Arg = dyn_cast<DefInit>(ArgInit);
|
2008-01-06 09:35:39 +08:00
|
|
|
if (!Arg)
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError("Illegal operand for the '" + R->getName() + "' instruction!");
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2008-01-06 09:35:39 +08:00
|
|
|
Record *Rec = Arg->getDef();
|
|
|
|
std::string PrintMethod = "printOperand";
|
2010-10-13 06:21:57 +08:00
|
|
|
std::string EncoderMethod;
|
2011-07-15 05:47:18 +08:00
|
|
|
std::string OperandType = "OPERAND_UNKNOWN";
|
2008-01-06 09:35:39 +08:00
|
|
|
unsigned NumOps = 1;
|
2011-07-30 06:43:06 +08:00
|
|
|
DagInit *MIOpInfo = 0;
|
2011-06-28 05:06:21 +08:00
|
|
|
if (Rec->isSubClassOf("RegisterOperand")) {
|
|
|
|
PrintMethod = Rec->getValueAsString("PrintMethod");
|
|
|
|
} else if (Rec->isSubClassOf("Operand")) {
|
2008-01-06 09:35:39 +08:00
|
|
|
PrintMethod = Rec->getValueAsString("PrintMethod");
|
2011-07-15 05:47:18 +08:00
|
|
|
OperandType = Rec->getValueAsString("OperandType");
|
2010-10-13 06:21:57 +08:00
|
|
|
// If there is an explicit encoder method, use it.
|
2010-11-15 13:19:05 +08:00
|
|
|
EncoderMethod = Rec->getValueAsString("EncoderMethod");
|
2008-01-06 09:35:39 +08:00
|
|
|
MIOpInfo = Rec->getValueAsDag("MIOperandInfo");
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2008-01-06 09:35:39 +08:00
|
|
|
// Verify that MIOpInfo has an 'ops' root value.
|
2012-10-11 04:24:47 +08:00
|
|
|
if (!isa<DefInit>(MIOpInfo->getOperator()) ||
|
|
|
|
cast<DefInit>(MIOpInfo->getOperator())->getDef()->getName() != "ops")
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError("Bad value for MIOperandInfo in operand '" + Rec->getName() +
|
|
|
|
"'\n");
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2008-01-06 09:35:39 +08:00
|
|
|
// If we have MIOpInfo, then we have #operands equal to number of entries
|
|
|
|
// in MIOperandInfo.
|
|
|
|
if (unsigned NumArgs = MIOpInfo->getNumArgs())
|
|
|
|
NumOps = NumArgs;
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2013-08-22 17:57:11 +08:00
|
|
|
if (Rec->isSubClassOf("PredicateOp"))
|
2008-01-06 09:35:39 +08:00
|
|
|
isPredicable = true;
|
|
|
|
else if (Rec->isSubClassOf("OptionalDefOperand"))
|
|
|
|
hasOptionalDef = true;
|
|
|
|
} else if (Rec->getName() == "variable_ops") {
|
2008-01-07 13:19:29 +08:00
|
|
|
isVariadic = true;
|
2008-01-06 09:35:39 +08:00
|
|
|
continue;
|
2011-07-15 05:47:18 +08:00
|
|
|
} else if (Rec->isSubClassOf("RegisterClass")) {
|
|
|
|
OperandType = "OPERAND_REGISTER";
|
|
|
|
} else if (!Rec->isSubClassOf("PointerLikeRegClass") &&
|
2012-09-12 07:47:08 +08:00
|
|
|
!Rec->isSubClassOf("unknown_class"))
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError("Unknown operand class '" + Rec->getName() +
|
|
|
|
"' in '" + R->getName() + "' instruction!");
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2008-01-06 09:35:39 +08:00
|
|
|
// Check that the operand has a name and that it's unique.
|
2010-03-19 05:07:39 +08:00
|
|
|
if (ArgName.empty())
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError("In instruction '" + R->getName() + "', operand #" + utostr(i) +
|
|
|
|
" has no name!");
|
2010-03-19 05:07:39 +08:00
|
|
|
if (!OperandNames.insert(ArgName).second)
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError("In instruction '" + R->getName() + "', operand #" + utostr(i) +
|
|
|
|
" has the same name as a previous operand!");
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-10-13 06:21:57 +08:00
|
|
|
OperandList.push_back(OperandInfo(Rec, ArgName, PrintMethod, EncoderMethod,
|
2011-07-15 05:47:18 +08:00
|
|
|
OperandType, MIOperandNo, NumOps,
|
|
|
|
MIOpInfo));
|
2008-01-06 09:35:39 +08:00
|
|
|
MIOperandNo += NumOps;
|
|
|
|
}
|
2011-01-26 10:03:37 +08:00
|
|
|
|
|
|
|
|
2010-11-01 13:34:34 +08:00
|
|
|
// Make sure the constraints list for each operand is large enough to hold
|
|
|
|
// constraint info, even if none is present.
|
|
|
|
for (unsigned i = 0, e = OperandList.size(); i != e; ++i)
|
|
|
|
OperandList[i].Constraints.resize(OperandList[i].MINumOperands);
|
2008-01-06 09:35:39 +08:00
|
|
|
}
|
|
|
|
|
2010-11-01 12:03:32 +08:00
|
|
|
|
2008-01-06 09:35:39 +08:00
|
|
|
/// getOperandNamed - Return the index of the operand with the specified
|
|
|
|
/// non-empty name. If the instruction does not have an operand with the
|
2012-10-26 04:33:17 +08:00
|
|
|
/// specified name, abort.
|
2008-01-06 09:35:39 +08:00
|
|
|
///
|
2010-11-01 12:03:32 +08:00
|
|
|
unsigned CGIOperandList::getOperandNamed(StringRef Name) const {
|
2010-10-12 02:25:51 +08:00
|
|
|
unsigned OpIdx;
|
|
|
|
if (hasOperandNamed(Name, OpIdx)) return OpIdx;
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError("'" + TheDef->getName() + "' does not have an operand named '$" +
|
|
|
|
Name.str() + "'!");
|
2008-01-06 09:35:39 +08:00
|
|
|
}
|
|
|
|
|
2010-10-12 02:25:51 +08:00
|
|
|
/// hasOperandNamed - Query whether the instruction has an operand of the
|
|
|
|
/// given name. If so, return true and set OpIdx to the index of the
|
|
|
|
/// operand. Otherwise, return false.
|
2010-11-01 12:03:32 +08:00
|
|
|
bool CGIOperandList::hasOperandNamed(StringRef Name, unsigned &OpIdx) const {
|
2010-10-12 02:25:51 +08:00
|
|
|
assert(!Name.empty() && "Cannot search for operand with no name!");
|
|
|
|
for (unsigned i = 0, e = OperandList.size(); i != e; ++i)
|
|
|
|
if (OperandList[i].Name == Name) {
|
|
|
|
OpIdx = i;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2009-12-16 03:28:13 +08:00
|
|
|
std::pair<unsigned,unsigned>
|
2010-11-01 12:03:32 +08:00
|
|
|
CGIOperandList::ParseOperandName(const std::string &Op, bool AllowWholeOp) {
|
2008-01-06 09:35:39 +08:00
|
|
|
if (Op.empty() || Op[0] != '$')
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError(TheDef->getName() + ": Illegal operand name: '" + Op + "'");
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2008-01-06 09:35:39 +08:00
|
|
|
std::string OpName = Op.substr(1);
|
|
|
|
std::string SubOpName;
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2008-01-06 09:35:39 +08:00
|
|
|
// Check to see if this is $foo.bar.
|
|
|
|
std::string::size_type DotIdx = OpName.find_first_of(".");
|
|
|
|
if (DotIdx != std::string::npos) {
|
|
|
|
SubOpName = OpName.substr(DotIdx+1);
|
|
|
|
if (SubOpName.empty())
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError(TheDef->getName() + ": illegal empty suboperand name in '" +Op +"'");
|
2008-01-06 09:35:39 +08:00
|
|
|
OpName = OpName.substr(0, DotIdx);
|
|
|
|
}
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2008-01-06 09:35:39 +08:00
|
|
|
unsigned OpIdx = getOperandNamed(OpName);
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2008-01-06 09:35:39 +08:00
|
|
|
if (SubOpName.empty()) { // If no suboperand name was specified:
|
|
|
|
// If one was needed, throw.
|
|
|
|
if (OperandList[OpIdx].MINumOperands > 1 && !AllowWholeOp &&
|
|
|
|
SubOpName.empty())
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError(TheDef->getName() + ": Illegal to refer to"
|
|
|
|
" whole operand part of complex operand '" + Op + "'");
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2008-01-06 09:35:39 +08:00
|
|
|
// Otherwise, return the operand.
|
|
|
|
return std::make_pair(OpIdx, 0U);
|
|
|
|
}
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2008-01-06 09:35:39 +08:00
|
|
|
// Find the suboperand number involved.
|
2011-07-30 06:43:06 +08:00
|
|
|
DagInit *MIOpInfo = OperandList[OpIdx].MIOperandInfo;
|
2008-01-06 09:35:39 +08:00
|
|
|
if (MIOpInfo == 0)
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError(TheDef->getName() + ": unknown suboperand name in '" + Op + "'");
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2008-01-06 09:35:39 +08:00
|
|
|
// Find the operand with the right name.
|
|
|
|
for (unsigned i = 0, e = MIOpInfo->getNumArgs(); i != e; ++i)
|
|
|
|
if (MIOpInfo->getArgName(i) == SubOpName)
|
|
|
|
return std::make_pair(OpIdx, i);
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2008-01-06 09:35:39 +08:00
|
|
|
// Otherwise, didn't find it!
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError(TheDef->getName() + ": unknown suboperand name in '" + Op + "'");
|
2013-08-16 09:43:31 +08:00
|
|
|
return std::make_pair(0U, 0U);
|
2008-01-06 09:35:39 +08:00
|
|
|
}
|
2010-03-28 04:09:24 +08:00
|
|
|
|
2010-11-01 12:03:32 +08:00
|
|
|
static void ParseConstraint(const std::string &CStr, CGIOperandList &Ops) {
|
|
|
|
// EARLY_CLOBBER: @early $reg
|
|
|
|
std::string::size_type wpos = CStr.find_first_of(" \t");
|
|
|
|
std::string::size_type start = CStr.find_first_not_of(" \t");
|
|
|
|
std::string Tok = CStr.substr(start, wpos - start);
|
|
|
|
if (Tok == "@earlyclobber") {
|
|
|
|
std::string Name = CStr.substr(wpos+1);
|
|
|
|
wpos = Name.find_first_not_of(" \t");
|
|
|
|
if (wpos == std::string::npos)
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError("Illegal format for @earlyclobber constraint: '" + CStr + "'");
|
2010-11-01 12:03:32 +08:00
|
|
|
Name = Name.substr(wpos);
|
|
|
|
std::pair<unsigned,unsigned> Op = Ops.ParseOperandName(Name, false);
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-11-01 12:03:32 +08:00
|
|
|
// Build the string for the operand
|
|
|
|
if (!Ops[Op.first].Constraints[Op.second].isNone())
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError("Operand '" + Name + "' cannot have multiple constraints!");
|
2010-11-01 12:03:32 +08:00
|
|
|
Ops[Op.first].Constraints[Op.second] =
|
|
|
|
CGIOperandList::ConstraintInfo::getEarlyClobber();
|
|
|
|
return;
|
|
|
|
}
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-11-01 12:03:32 +08:00
|
|
|
// Only other constraint is "TIED_TO" for now.
|
|
|
|
std::string::size_type pos = CStr.find_first_of('=');
|
|
|
|
assert(pos != std::string::npos && "Unrecognized constraint");
|
|
|
|
start = CStr.find_first_not_of(" \t");
|
|
|
|
std::string Name = CStr.substr(start, pos - start);
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-11-01 12:03:32 +08:00
|
|
|
// TIED_TO: $src1 = $dst
|
|
|
|
wpos = Name.find_first_of(" \t");
|
|
|
|
if (wpos == std::string::npos)
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError("Illegal format for tied-to constraint: '" + CStr + "'");
|
2010-11-01 12:03:32 +08:00
|
|
|
std::string DestOpName = Name.substr(0, wpos);
|
|
|
|
std::pair<unsigned,unsigned> DestOp = Ops.ParseOperandName(DestOpName, false);
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-11-01 12:03:32 +08:00
|
|
|
Name = CStr.substr(pos+1);
|
|
|
|
wpos = Name.find_first_not_of(" \t");
|
|
|
|
if (wpos == std::string::npos)
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError("Illegal format for tied-to constraint: '" + CStr + "'");
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2012-10-21 06:44:13 +08:00
|
|
|
std::string SrcOpName = Name.substr(wpos);
|
|
|
|
std::pair<unsigned,unsigned> SrcOp = Ops.ParseOperandName(SrcOpName, false);
|
|
|
|
if (SrcOp > DestOp) {
|
|
|
|
std::swap(SrcOp, DestOp);
|
|
|
|
std::swap(SrcOpName, DestOpName);
|
|
|
|
}
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-11-01 12:03:32 +08:00
|
|
|
unsigned FlatOpNo = Ops.getFlattenedOperandNumber(SrcOp);
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-11-01 12:03:32 +08:00
|
|
|
if (!Ops[DestOp.first].Constraints[DestOp.second].isNone())
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError("Operand '" + DestOpName +
|
|
|
|
"' cannot have multiple constraints!");
|
2010-11-01 12:03:32 +08:00
|
|
|
Ops[DestOp.first].Constraints[DestOp.second] =
|
2011-11-15 09:05:12 +08:00
|
|
|
CGIOperandList::ConstraintInfo::getTied(FlatOpNo);
|
2010-11-01 12:03:32 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static void ParseConstraints(const std::string &CStr, CGIOperandList &Ops) {
|
|
|
|
if (CStr.empty()) return;
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-11-01 12:03:32 +08:00
|
|
|
const std::string delims(",");
|
|
|
|
std::string::size_type bidx, eidx;
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-11-01 12:03:32 +08:00
|
|
|
bidx = CStr.find_first_not_of(delims);
|
|
|
|
while (bidx != std::string::npos) {
|
|
|
|
eidx = CStr.find_first_of(delims, bidx);
|
|
|
|
if (eidx == std::string::npos)
|
|
|
|
eidx = CStr.length();
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-11-01 12:03:32 +08:00
|
|
|
ParseConstraint(CStr.substr(bidx, eidx - bidx), Ops);
|
|
|
|
bidx = CStr.find_first_not_of(delims, eidx);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void CGIOperandList::ProcessDisableEncoding(std::string DisableEncoding) {
|
|
|
|
while (1) {
|
2011-07-21 14:21:31 +08:00
|
|
|
std::pair<StringRef, StringRef> P = getToken(DisableEncoding, " ,\t");
|
|
|
|
std::string OpName = P.first;
|
|
|
|
DisableEncoding = P.second;
|
2010-11-01 12:03:32 +08:00
|
|
|
if (OpName.empty()) break;
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-11-01 12:03:32 +08:00
|
|
|
// Figure out which operand this is.
|
|
|
|
std::pair<unsigned,unsigned> Op = ParseOperandName(OpName, false);
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-11-01 12:03:32 +08:00
|
|
|
// Mark the operand as not-to-be encoded.
|
|
|
|
if (Op.second >= OperandList[Op.first].DoNotEncode.size())
|
|
|
|
OperandList[Op.first].DoNotEncode.resize(Op.second+1);
|
|
|
|
OperandList[Op.first].DoNotEncode[Op.second] = true;
|
|
|
|
}
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-11-01 12:03:32 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// CodeGenInstruction Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2012-08-24 08:31:16 +08:00
|
|
|
CodeGenInstruction::CodeGenInstruction(Record *R)
|
|
|
|
: TheDef(R), Operands(R), InferredFrom(0) {
|
2010-11-01 12:03:32 +08:00
|
|
|
Namespace = R->getValueAsString("Namespace");
|
|
|
|
AsmString = R->getValueAsString("AsmString");
|
|
|
|
|
|
|
|
isReturn = R->getValueAsBit("isReturn");
|
|
|
|
isBranch = R->getValueAsBit("isBranch");
|
|
|
|
isIndirectBranch = R->getValueAsBit("isIndirectBranch");
|
|
|
|
isCompare = R->getValueAsBit("isCompare");
|
2010-11-18 04:13:28 +08:00
|
|
|
isMoveImm = R->getValueAsBit("isMoveImm");
|
2011-03-15 13:09:26 +08:00
|
|
|
isBitcast = R->getValueAsBit("isBitcast");
|
2012-08-17 07:11:47 +08:00
|
|
|
isSelect = R->getValueAsBit("isSelect");
|
2010-11-01 12:03:32 +08:00
|
|
|
isBarrier = R->getValueAsBit("isBarrier");
|
|
|
|
isCall = R->getValueAsBit("isCall");
|
|
|
|
canFoldAsLoad = R->getValueAsBit("canFoldAsLoad");
|
|
|
|
isPredicable = Operands.isPredicable || R->getValueAsBit("isPredicable");
|
|
|
|
isConvertibleToThreeAddress = R->getValueAsBit("isConvertibleToThreeAddress");
|
|
|
|
isCommutable = R->getValueAsBit("isCommutable");
|
|
|
|
isTerminator = R->getValueAsBit("isTerminator");
|
|
|
|
isReMaterializable = R->getValueAsBit("isReMaterializable");
|
|
|
|
hasDelaySlot = R->getValueAsBit("hasDelaySlot");
|
|
|
|
usesCustomInserter = R->getValueAsBit("usesCustomInserter");
|
2011-09-21 02:22:31 +08:00
|
|
|
hasPostISelHook = R->getValueAsBit("hasPostISelHook");
|
2010-11-01 12:03:32 +08:00
|
|
|
hasCtrlDep = R->getValueAsBit("hasCtrlDep");
|
|
|
|
isNotDuplicable = R->getValueAsBit("isNotDuplicable");
|
2012-08-24 03:34:46 +08:00
|
|
|
|
2014-02-05 17:10:40 +08:00
|
|
|
bool Unset;
|
|
|
|
mayLoad = R->getValueAsBitOrUnset("mayLoad", Unset);
|
|
|
|
mayLoad_Unset = Unset;
|
|
|
|
mayStore = R->getValueAsBitOrUnset("mayStore", Unset);
|
|
|
|
mayStore_Unset = Unset;
|
|
|
|
hasSideEffects = R->getValueAsBitOrUnset("hasSideEffects", Unset);
|
|
|
|
hasSideEffects_Unset = Unset;
|
2010-11-01 12:03:32 +08:00
|
|
|
neverHasSideEffects = R->getValueAsBit("neverHasSideEffects");
|
2012-08-24 03:34:46 +08:00
|
|
|
|
2010-11-01 12:03:32 +08:00
|
|
|
isAsCheapAsAMove = R->getValueAsBit("isAsCheapAsAMove");
|
|
|
|
hasExtraSrcRegAllocReq = R->getValueAsBit("hasExtraSrcRegAllocReq");
|
|
|
|
hasExtraDefRegAllocReq = R->getValueAsBit("hasExtraDefRegAllocReq");
|
2011-07-07 08:48:02 +08:00
|
|
|
isCodeGenOnly = R->getValueAsBit("isCodeGenOnly");
|
2011-07-07 05:33:38 +08:00
|
|
|
isPseudo = R->getValueAsBit("isPseudo");
|
2010-11-01 12:03:32 +08:00
|
|
|
ImplicitDefs = R->getValueAsListOfDefs("Defs");
|
|
|
|
ImplicitUses = R->getValueAsListOfDefs("Uses");
|
|
|
|
|
|
|
|
if (neverHasSideEffects + hasSideEffects > 1)
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError(R->getName() + ": multiple conflicting side-effect flags set!");
|
2010-11-01 12:03:32 +08:00
|
|
|
|
|
|
|
// Parse Constraints.
|
|
|
|
ParseConstraints(R->getValueAsString("Constraints"), Operands);
|
|
|
|
|
|
|
|
// Parse the DisableEncoding field.
|
|
|
|
Operands.ProcessDisableEncoding(R->getValueAsString("DisableEncoding"));
|
2013-09-12 18:28:05 +08:00
|
|
|
|
|
|
|
// First check for a ComplexDeprecationPredicate.
|
|
|
|
if (R->getValue("ComplexDeprecationPredicate")) {
|
|
|
|
HasComplexDeprecationPredicate = true;
|
|
|
|
DeprecatedReason = R->getValueAsString("ComplexDeprecationPredicate");
|
|
|
|
} else if (RecordVal *Dep = R->getValue("DeprecatedFeatureMask")) {
|
|
|
|
// Check if we have a Subtarget feature mask.
|
|
|
|
HasComplexDeprecationPredicate = false;
|
|
|
|
DeprecatedReason = Dep->getValue()->getAsString();
|
|
|
|
} else {
|
|
|
|
// This instruction isn't deprecated.
|
|
|
|
HasComplexDeprecationPredicate = false;
|
|
|
|
DeprecatedReason = "";
|
|
|
|
}
|
2010-11-01 12:03:32 +08:00
|
|
|
}
|
2010-03-28 04:09:24 +08:00
|
|
|
|
|
|
|
/// HasOneImplicitDefWithKnownVT - If the instruction has at least one
|
|
|
|
/// implicit def and it has a known VT, return the VT, otherwise return
|
|
|
|
/// MVT::Other.
|
|
|
|
MVT::SimpleValueType CodeGenInstruction::
|
|
|
|
HasOneImplicitDefWithKnownVT(const CodeGenTarget &TargetInfo) const {
|
|
|
|
if (ImplicitDefs.empty()) return MVT::Other;
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-03-28 04:09:24 +08:00
|
|
|
// Check to see if the first implicit def has a resolvable type.
|
|
|
|
Record *FirstImplicitDef = ImplicitDefs[0];
|
|
|
|
assert(FirstImplicitDef->isSubClassOf("Register"));
|
2011-01-26 10:03:37 +08:00
|
|
|
const std::vector<MVT::SimpleValueType> &RegVTs =
|
2010-03-28 04:09:24 +08:00
|
|
|
TargetInfo.getRegisterVTs(FirstImplicitDef);
|
|
|
|
if (RegVTs.size() == 1)
|
|
|
|
return RegVTs[0];
|
|
|
|
return MVT::Other;
|
|
|
|
}
|
|
|
|
|
2010-11-01 09:07:14 +08:00
|
|
|
|
|
|
|
/// FlattenAsmStringVariants - Flatten the specified AsmString to only
|
|
|
|
/// include text from the specified variant, returning the new string.
|
|
|
|
std::string CodeGenInstruction::
|
|
|
|
FlattenAsmStringVariants(StringRef Cur, unsigned Variant) {
|
|
|
|
std::string Res = "";
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-11-01 09:07:14 +08:00
|
|
|
for (;;) {
|
|
|
|
// Find the start of the next variant string.
|
|
|
|
size_t VariantsStart = 0;
|
|
|
|
for (size_t e = Cur.size(); VariantsStart != e; ++VariantsStart)
|
|
|
|
if (Cur[VariantsStart] == '{' &&
|
|
|
|
(VariantsStart == 0 || (Cur[VariantsStart-1] != '$' &&
|
|
|
|
Cur[VariantsStart-1] != '\\')))
|
|
|
|
break;
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-11-01 09:07:14 +08:00
|
|
|
// Add the prefix to the result.
|
|
|
|
Res += Cur.slice(0, VariantsStart);
|
|
|
|
if (VariantsStart == Cur.size())
|
|
|
|
break;
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-11-01 09:07:14 +08:00
|
|
|
++VariantsStart; // Skip the '{'.
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-11-01 09:07:14 +08:00
|
|
|
// Scan to the end of the variants string.
|
|
|
|
size_t VariantsEnd = VariantsStart;
|
|
|
|
unsigned NestedBraces = 1;
|
|
|
|
for (size_t e = Cur.size(); VariantsEnd != e; ++VariantsEnd) {
|
|
|
|
if (Cur[VariantsEnd] == '}' && Cur[VariantsEnd-1] != '\\') {
|
|
|
|
if (--NestedBraces == 0)
|
|
|
|
break;
|
|
|
|
} else if (Cur[VariantsEnd] == '{')
|
|
|
|
++NestedBraces;
|
|
|
|
}
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-11-01 09:07:14 +08:00
|
|
|
// Select the Nth variant (or empty).
|
|
|
|
StringRef Selection = Cur.slice(VariantsStart, VariantsEnd);
|
|
|
|
for (unsigned i = 0; i != Variant; ++i)
|
|
|
|
Selection = Selection.split('|').second;
|
|
|
|
Res += Selection.split('|').first;
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-11-01 09:07:14 +08:00
|
|
|
assert(VariantsEnd != Cur.size() &&
|
|
|
|
"Unterminated variants in assembly string!");
|
|
|
|
Cur = Cur.substr(VariantsEnd + 1);
|
|
|
|
}
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-11-01 09:07:14 +08:00
|
|
|
return Res;
|
|
|
|
}
|
|
|
|
|
2010-11-01 12:05:41 +08:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
/// CodeGenInstAlias Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2011-01-27 03:44:55 +08:00
|
|
|
/// tryAliasOpMatch - This is a helper function for the CodeGenInstAlias
|
|
|
|
/// constructor. It checks if an argument in an InstAlias pattern matches
|
|
|
|
/// the corresponding operand of the instruction. It returns true on a
|
|
|
|
/// successful match, with ResOp set to the result operand to be used.
|
2011-07-30 06:43:06 +08:00
|
|
|
bool CodeGenInstAlias::tryAliasOpMatch(DagInit *Result, unsigned AliasOpNo,
|
2011-01-27 03:44:55 +08:00
|
|
|
Record *InstOpRec, bool hasSubOps,
|
Print out the location of expanded multiclass defs in TableGen errors.
When reporting an error for a defm, we would previously only report the
location of the outer defm, which is not always where the error is.
Now we also print the location of the expanded multiclass defs:
lib/Target/X86/X86InstrSSE.td:2902:12: error: foo
defm ADD : basic_sse12_fp_binop_s<0x58, "add", fadd, SSE_ALU_ITINS_S>,
^
lib/Target/X86/X86InstrSSE.td:2801:11: note: instantiated from multiclass
defm PD : sse12_fp_packed<opc, !strconcat(OpcodeStr, "pd"), OpNode, VR128,
^
lib/Target/X86/X86InstrSSE.td:194:5: note: instantiated from multiclass
def rm : PI<opc, MRMSrcMem, (outs RC:$dst), (ins RC:$src1, x86memop:$src2),
^
llvm-svn: 162409
2012-08-23 07:33:58 +08:00
|
|
|
ArrayRef<SMLoc> Loc, CodeGenTarget &T,
|
2011-01-27 03:44:55 +08:00
|
|
|
ResultOperand &ResOp) {
|
2011-07-30 06:43:06 +08:00
|
|
|
Init *Arg = Result->getArg(AliasOpNo);
|
2012-10-11 04:24:43 +08:00
|
|
|
DefInit *ADI = dyn_cast<DefInit>(Arg);
|
2011-01-27 03:44:55 +08:00
|
|
|
|
|
|
|
if (ADI && ADI->getDef() == InstOpRec) {
|
|
|
|
// If the operand is a record, it must have a name, and the record type
|
|
|
|
// must match up with the instruction's argument type.
|
|
|
|
if (Result->getArgName(AliasOpNo).empty())
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError(Loc, "result argument #" + utostr(AliasOpNo) +
|
2011-01-27 03:44:55 +08:00
|
|
|
" must have a name!");
|
|
|
|
ResOp = ResultOperand(Result->getArgName(AliasOpNo), ADI->getDef());
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2011-10-29 00:43:40 +08:00
|
|
|
// For register operands, the source register class can be a subclass
|
|
|
|
// of the instruction register class, not just an exact match.
|
|
|
|
if (ADI && ADI->getDef()->isSubClassOf("RegisterClass")) {
|
|
|
|
if (!InstOpRec->isSubClassOf("RegisterClass"))
|
|
|
|
return false;
|
2011-10-29 06:32:53 +08:00
|
|
|
if (!T.getRegisterClass(InstOpRec)
|
|
|
|
.hasSubClass(&T.getRegisterClass(ADI->getDef())))
|
|
|
|
return false;
|
|
|
|
ResOp = ResultOperand(Result->getArgName(AliasOpNo), ADI->getDef());
|
|
|
|
return true;
|
2011-10-29 00:43:40 +08:00
|
|
|
}
|
|
|
|
|
2011-01-27 03:44:55 +08:00
|
|
|
// Handle explicit registers.
|
|
|
|
if (ADI && ADI->getDef()->isSubClassOf("Register")) {
|
2011-08-20 04:33:06 +08:00
|
|
|
if (InstOpRec->isSubClassOf("OptionalDefOperand")) {
|
|
|
|
DagInit *DI = InstOpRec->getValueAsDag("MIOperandInfo");
|
|
|
|
// The operand info should only have a single (register) entry. We
|
|
|
|
// want the register class of it.
|
2012-10-11 04:24:47 +08:00
|
|
|
InstOpRec = cast<DefInit>(DI->getArg(0))->getDef();
|
2011-08-20 04:33:06 +08:00
|
|
|
}
|
|
|
|
|
2011-06-28 05:06:21 +08:00
|
|
|
if (InstOpRec->isSubClassOf("RegisterOperand"))
|
|
|
|
InstOpRec = InstOpRec->getValueAsDef("RegClass");
|
|
|
|
|
2011-01-27 03:44:55 +08:00
|
|
|
if (!InstOpRec->isSubClassOf("RegisterClass"))
|
|
|
|
return false;
|
|
|
|
|
2011-06-15 12:50:36 +08:00
|
|
|
if (!T.getRegisterClass(InstOpRec)
|
|
|
|
.contains(T.getRegBank().getReg(ADI->getDef())))
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError(Loc, "fixed register " + ADI->getDef()->getName() +
|
|
|
|
" is not a member of the " + InstOpRec->getName() +
|
|
|
|
" register class!");
|
2011-01-27 03:44:55 +08:00
|
|
|
|
|
|
|
if (!Result->getArgName(AliasOpNo).empty())
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError(Loc, "result fixed register argument must "
|
|
|
|
"not have a name!");
|
2011-01-27 03:44:55 +08:00
|
|
|
|
|
|
|
ResOp = ResultOperand(ADI->getDef());
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Handle "zero_reg" for optional def operands.
|
|
|
|
if (ADI && ADI->getDef()->getName() == "zero_reg") {
|
|
|
|
|
|
|
|
// Check if this is an optional def.
|
2011-11-15 09:46:57 +08:00
|
|
|
// Tied operands where the source is a sub-operand of a complex operand
|
|
|
|
// need to represent both operands in the alias destination instruction.
|
|
|
|
// Allow zero_reg for the tied portion. This can and should go away once
|
|
|
|
// the MC representation of things doesn't use tied operands at all.
|
|
|
|
//if (!InstOpRec->isSubClassOf("OptionalDefOperand"))
|
|
|
|
// throw TGError(Loc, "reg0 used for result that is not an "
|
|
|
|
// "OptionalDefOperand!");
|
2011-01-27 03:44:55 +08:00
|
|
|
|
|
|
|
ResOp = ResultOperand(static_cast<Record*>(0));
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2011-10-29 06:32:53 +08:00
|
|
|
// Literal integers.
|
2012-10-11 04:24:43 +08:00
|
|
|
if (IntInit *II = dyn_cast<IntInit>(Arg)) {
|
2011-01-27 03:44:55 +08:00
|
|
|
if (hasSubOps || !InstOpRec->isSubClassOf("Operand"))
|
|
|
|
return false;
|
|
|
|
// Integer arguments can't have names.
|
|
|
|
if (!Result->getArgName(AliasOpNo).empty())
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError(Loc, "result argument #" + utostr(AliasOpNo) +
|
|
|
|
" must not have a name!");
|
2011-01-27 03:44:55 +08:00
|
|
|
ResOp = ResultOperand(II->getValue());
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2011-10-29 06:32:53 +08:00
|
|
|
// If both are Operands with the same MVT, allow the conversion. It's
|
|
|
|
// up to the user to make sure the values are appropriate, just like
|
|
|
|
// for isel Pat's.
|
|
|
|
if (InstOpRec->isSubClassOf("Operand") &&
|
|
|
|
ADI->getDef()->isSubClassOf("Operand")) {
|
|
|
|
// FIXME: What other attributes should we check here? Identical
|
|
|
|
// MIOperandInfo perhaps?
|
|
|
|
if (InstOpRec->getValueInit("Type") != ADI->getDef()->getValueInit("Type"))
|
|
|
|
return false;
|
|
|
|
ResOp = ResultOperand(Result->getArgName(AliasOpNo), ADI->getDef());
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2011-01-27 03:44:55 +08:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
Reimplement BuildResultOperands to be in terms of the result instruction's
operand list instead of the operand list redundantly declared on the alias
or instruction.
With this change, we finally remove the ins/outs list on the alias. Before:
def : InstAlias<(outs GR16:$dst), (ins GR8 :$src),
"movsx $src, $dst",
(MOVSX16rr8W GR16:$dst, GR8:$src)>;
After:
def : InstAlias<"movsx $src, $dst",
(MOVSX16rr8W GR16:$dst, GR8:$src)>;
This also makes the alias mechanism more general and powerful, which will
be exploited in subsequent patches.
llvm-svn: 118329
2010-11-06 15:14:44 +08:00
|
|
|
CodeGenInstAlias::CodeGenInstAlias(Record *R, CodeGenTarget &T) : TheDef(R) {
|
2010-11-01 12:05:41 +08:00
|
|
|
AsmString = R->getValueAsString("AsmString");
|
2010-11-01 13:34:34 +08:00
|
|
|
Result = R->getValueAsDag("ResultInst");
|
2010-11-06 14:39:47 +08:00
|
|
|
|
|
|
|
// Verify that the root of the result is an instruction.
|
2012-10-11 04:24:43 +08:00
|
|
|
DefInit *DI = dyn_cast<DefInit>(Result->getOperator());
|
2010-11-06 14:39:47 +08:00
|
|
|
if (DI == 0 || !DI->getDef()->isSubClassOf("Instruction"))
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError(R->getLoc(),
|
|
|
|
"result of inst alias should be an instruction");
|
2010-11-06 14:39:47 +08:00
|
|
|
|
|
|
|
ResultInst = &T.getInstruction(DI->getDef());
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-11-06 15:06:09 +08:00
|
|
|
// NameClass - If argument names are repeated, we need to verify they have
|
|
|
|
// the same class.
|
|
|
|
StringMap<Record*> NameClass;
|
2011-01-21 02:38:10 +08:00
|
|
|
for (unsigned i = 0, e = Result->getNumArgs(); i != e; ++i) {
|
2012-10-11 04:24:43 +08:00
|
|
|
DefInit *ADI = dyn_cast<DefInit>(Result->getArg(i));
|
2011-01-21 02:38:10 +08:00
|
|
|
if (!ADI || Result->getArgName(i).empty())
|
|
|
|
continue;
|
|
|
|
// Verify we don't have something like: (someinst GR16:$foo, GR32:$foo)
|
|
|
|
// $foo can exist multiple times in the result list, but it must have the
|
|
|
|
// same type.
|
|
|
|
Record *&Entry = NameClass[Result->getArgName(i)];
|
|
|
|
if (Entry && Entry != ADI->getDef())
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError(R->getLoc(), "result value $" + Result->getArgName(i) +
|
|
|
|
" is both " + Entry->getName() + " and " +
|
|
|
|
ADI->getDef()->getName() + "!");
|
2011-01-21 02:38:10 +08:00
|
|
|
Entry = ADI->getDef();
|
|
|
|
}
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-11-06 14:54:38 +08:00
|
|
|
// Decode and validate the arguments of the result.
|
2010-11-06 15:31:43 +08:00
|
|
|
unsigned AliasOpNo = 0;
|
|
|
|
for (unsigned i = 0, e = ResultInst->Operands.size(); i != e; ++i) {
|
2011-01-27 03:44:55 +08:00
|
|
|
|
2011-11-15 09:46:57 +08:00
|
|
|
// Tied registers don't have an entry in the result dag unless they're part
|
|
|
|
// of a complex operand, in which case we include them anyways, as we
|
|
|
|
// don't have any other way to specify the whole operand.
|
|
|
|
if (ResultInst->Operands[i].MINumOperands == 1 &&
|
|
|
|
ResultInst->Operands[i].getTiedRegister() != -1)
|
2010-11-06 15:31:43 +08:00
|
|
|
continue;
|
|
|
|
|
|
|
|
if (AliasOpNo >= Result->getNumArgs())
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError(R->getLoc(), "not enough arguments for instruction!");
|
2011-01-27 03:44:55 +08:00
|
|
|
|
|
|
|
Record *InstOpRec = ResultInst->Operands[i].Rec;
|
|
|
|
unsigned NumSubOps = ResultInst->Operands[i].MINumOperands;
|
|
|
|
ResultOperand ResOp(static_cast<int64_t>(0));
|
|
|
|
if (tryAliasOpMatch(Result, AliasOpNo, InstOpRec, (NumSubOps > 1),
|
|
|
|
R->getLoc(), T, ResOp)) {
|
2012-06-08 08:25:03 +08:00
|
|
|
// If this is a simple operand, or a complex operand with a custom match
|
|
|
|
// class, then we can match is verbatim.
|
|
|
|
if (NumSubOps == 1 ||
|
|
|
|
(InstOpRec->getValue("ParserMatchClass") &&
|
|
|
|
InstOpRec->getValueAsDef("ParserMatchClass")
|
|
|
|
->getValueAsString("Name") != "Imm")) {
|
|
|
|
ResultOperands.push_back(ResOp);
|
|
|
|
ResultInstOperandIndex.push_back(std::make_pair(i, -1));
|
|
|
|
++AliasOpNo;
|
|
|
|
|
|
|
|
// Otherwise, we need to match each of the suboperands individually.
|
|
|
|
} else {
|
|
|
|
DagInit *MIOI = ResultInst->Operands[i].MIOperandInfo;
|
|
|
|
for (unsigned SubOp = 0; SubOp != NumSubOps; ++SubOp) {
|
2012-10-11 04:24:47 +08:00
|
|
|
Record *SubRec = cast<DefInit>(MIOI->getArg(SubOp))->getDef();
|
2012-06-08 08:25:03 +08:00
|
|
|
|
|
|
|
// Take care to instantiate each of the suboperands with the correct
|
|
|
|
// nomenclature: $foo.bar
|
|
|
|
ResultOperands.push_back(
|
|
|
|
ResultOperand(Result->getArgName(AliasOpNo) + "." +
|
|
|
|
MIOI->getArgName(SubOp), SubRec));
|
|
|
|
ResultInstOperandIndex.push_back(std::make_pair(i, SubOp));
|
|
|
|
}
|
|
|
|
++AliasOpNo;
|
|
|
|
}
|
2010-11-06 14:54:38 +08:00
|
|
|
continue;
|
|
|
|
}
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2011-01-27 03:44:55 +08:00
|
|
|
// If the argument did not match the instruction operand, and the operand
|
|
|
|
// is composed of multiple suboperands, try matching the suboperands.
|
|
|
|
if (NumSubOps > 1) {
|
2011-07-30 06:43:06 +08:00
|
|
|
DagInit *MIOI = ResultInst->Operands[i].MIOperandInfo;
|
2011-01-27 03:44:55 +08:00
|
|
|
for (unsigned SubOp = 0; SubOp != NumSubOps; ++SubOp) {
|
|
|
|
if (AliasOpNo >= Result->getNumArgs())
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError(R->getLoc(), "not enough arguments for instruction!");
|
2012-10-11 04:24:47 +08:00
|
|
|
Record *SubRec = cast<DefInit>(MIOI->getArg(SubOp))->getDef();
|
2011-01-27 03:44:55 +08:00
|
|
|
if (tryAliasOpMatch(Result, AliasOpNo, SubRec, false,
|
|
|
|
R->getLoc(), T, ResOp)) {
|
|
|
|
ResultOperands.push_back(ResOp);
|
|
|
|
ResultInstOperandIndex.push_back(std::make_pair(i, SubOp));
|
|
|
|
++AliasOpNo;
|
|
|
|
} else {
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError(R->getLoc(), "result argument #" + utostr(AliasOpNo) +
|
2011-01-27 03:44:55 +08:00
|
|
|
" does not match instruction operand class " +
|
|
|
|
(SubOp == 0 ? InstOpRec->getName() :SubRec->getName()));
|
|
|
|
}
|
|
|
|
}
|
2010-11-07 03:25:43 +08:00
|
|
|
continue;
|
|
|
|
}
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError(R->getLoc(), "result argument #" + utostr(AliasOpNo) +
|
|
|
|
" does not match instruction operand class " +
|
|
|
|
InstOpRec->getName());
|
2010-11-06 14:54:38 +08:00
|
|
|
}
|
2011-01-26 10:03:37 +08:00
|
|
|
|
2010-11-06 15:31:43 +08:00
|
|
|
if (AliasOpNo != Result->getNumArgs())
|
2012-10-26 04:33:17 +08:00
|
|
|
PrintFatalError(R->getLoc(), "too many operands for instruction!");
|
2010-11-01 12:05:41 +08:00
|
|
|
}
|