mirror of
https://github.com/RPCS3/llvm.git
synced 2024-11-24 04:09:47 +00:00
Convert some tab stops into spaces.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@108130 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
490b8f5d64
commit
3472766f9e
@ -400,7 +400,7 @@ Value *CallExprAST::Codegen() {
|
||||
|
||||
Function *PrototypeAST::Codegen() {
|
||||
// Make the function type: double(double,double) etc.
|
||||
std::vector<const Type*> Doubles(Args.size(),
|
||||
std::vector<const Type*> Doubles(Args.size(),
|
||||
Type::getDoubleTy(getGlobalContext()));
|
||||
FunctionType *FT = FunctionType::get(Type::getDoubleTy(getGlobalContext()),
|
||||
Doubles, false);
|
||||
|
@ -407,7 +407,7 @@ Value *CallExprAST::Codegen() {
|
||||
|
||||
Function *PrototypeAST::Codegen() {
|
||||
// Make the function type: double(double,double) etc.
|
||||
std::vector<const Type*> Doubles(Args.size(),
|
||||
std::vector<const Type*> Doubles(Args.size(),
|
||||
Type::getDoubleTy(getGlobalContext()));
|
||||
FunctionType *FT = FunctionType::get(Type::getDoubleTy(getGlobalContext()),
|
||||
Doubles, false);
|
||||
|
@ -652,7 +652,7 @@ Value *ForExprAST::Codegen() {
|
||||
|
||||
Function *PrototypeAST::Codegen() {
|
||||
// Make the function type: double(double,double) etc.
|
||||
std::vector<const Type*> Doubles(Args.size(),
|
||||
std::vector<const Type*> Doubles(Args.size(),
|
||||
Type::getDoubleTy(getGlobalContext()));
|
||||
FunctionType *FT = FunctionType::get(Type::getDoubleTy(getGlobalContext()),
|
||||
Doubles, false);
|
||||
|
@ -756,7 +756,7 @@ Value *ForExprAST::Codegen() {
|
||||
|
||||
Function *PrototypeAST::Codegen() {
|
||||
// Make the function type: double(double,double) etc.
|
||||
std::vector<const Type*> Doubles(Args.size(),
|
||||
std::vector<const Type*> Doubles(Args.size(),
|
||||
Type::getDoubleTy(getGlobalContext()));
|
||||
FunctionType *FT = FunctionType::get(Type::getDoubleTy(getGlobalContext()),
|
||||
Doubles, false);
|
||||
|
@ -174,8 +174,8 @@ public:
|
||||
CodeGenOpt::Level OptLevel =
|
||||
CodeGenOpt::Default,
|
||||
bool GVsWithCode = true,
|
||||
CodeModel::Model CMM =
|
||||
CodeModel::Default);
|
||||
CodeModel::Model CMM =
|
||||
CodeModel::Default);
|
||||
|
||||
/// addModule - Add a Module to the list of modules that we can JIT from.
|
||||
/// Note that this takes ownership of the Module: when the ExecutionEngine is
|
||||
|
@ -43,10 +43,10 @@ struct DOTGraphTraits<DomTreeNode*> : public DefaultDOTGraphTraits {
|
||||
|
||||
if (isSimple())
|
||||
return DOTGraphTraits<const Function*>
|
||||
::getSimpleNodeLabel(BB, BB->getParent());
|
||||
::getSimpleNodeLabel(BB, BB->getParent());
|
||||
else
|
||||
return DOTGraphTraits<const Function*>
|
||||
::getCompleteNodeLabel(BB, BB->getParent());
|
||||
::getCompleteNodeLabel(BB, BB->getParent());
|
||||
}
|
||||
};
|
||||
|
||||
|
@ -406,7 +406,7 @@ namespace PBQP {
|
||||
|
||||
// Create node data objects.
|
||||
for (Graph::NodeItr nItr = g.nodesBegin(), nEnd = g.nodesEnd();
|
||||
nItr != nEnd; ++nItr) {
|
||||
nItr != nEnd; ++nItr) {
|
||||
nodeDataList.push_back(NodeData());
|
||||
g.setNodeData(nItr, &nodeDataList.back());
|
||||
}
|
||||
|
@ -3573,24 +3573,24 @@ SDValue DAGCombiner::visitSIGN_EXTEND(SDNode *N) {
|
||||
// we know that the element size of the sext'd result matches the
|
||||
// element size of the compare operands.
|
||||
if (VT.getSizeInBits() == N0VT.getSizeInBits())
|
||||
return DAG.getVSetCC(N->getDebugLoc(), VT, N0.getOperand(0),
|
||||
N0.getOperand(1),
|
||||
cast<CondCodeSDNode>(N0.getOperand(2))->get());
|
||||
return DAG.getVSetCC(N->getDebugLoc(), VT, N0.getOperand(0),
|
||||
N0.getOperand(1),
|
||||
cast<CondCodeSDNode>(N0.getOperand(2))->get());
|
||||
// If the desired elements are smaller or larger than the source
|
||||
// elements we can use a matching integer vector type and then
|
||||
// truncate/sign extend
|
||||
else {
|
||||
EVT MatchingElementType =
|
||||
EVT::getIntegerVT(*DAG.getContext(),
|
||||
N0VT.getScalarType().getSizeInBits());
|
||||
EVT MatchingVectorType =
|
||||
EVT::getVectorVT(*DAG.getContext(), MatchingElementType,
|
||||
N0VT.getVectorNumElements());
|
||||
SDValue VsetCC =
|
||||
DAG.getVSetCC(N->getDebugLoc(), MatchingVectorType, N0.getOperand(0),
|
||||
N0.getOperand(1),
|
||||
cast<CondCodeSDNode>(N0.getOperand(2))->get());
|
||||
return DAG.getSExtOrTrunc(VsetCC, N->getDebugLoc(), VT);
|
||||
EVT MatchingElementType =
|
||||
EVT::getIntegerVT(*DAG.getContext(),
|
||||
N0VT.getScalarType().getSizeInBits());
|
||||
EVT MatchingVectorType =
|
||||
EVT::getVectorVT(*DAG.getContext(), MatchingElementType,
|
||||
N0VT.getVectorNumElements());
|
||||
SDValue VsetCC =
|
||||
DAG.getVSetCC(N->getDebugLoc(), MatchingVectorType, N0.getOperand(0),
|
||||
N0.getOperand(1),
|
||||
cast<CondCodeSDNode>(N0.getOperand(2))->get());
|
||||
return DAG.getSExtOrTrunc(VsetCC, N->getDebugLoc(), VT);
|
||||
}
|
||||
}
|
||||
|
||||
@ -3964,24 +3964,24 @@ SDValue DAGCombiner::visitANY_EXTEND(SDNode *N) {
|
||||
// we know that the element size of the sext'd result matches the
|
||||
// element size of the compare operands.
|
||||
if (VT.getSizeInBits() == N0VT.getSizeInBits())
|
||||
return DAG.getVSetCC(N->getDebugLoc(), VT, N0.getOperand(0),
|
||||
N0.getOperand(1),
|
||||
cast<CondCodeSDNode>(N0.getOperand(2))->get());
|
||||
return DAG.getVSetCC(N->getDebugLoc(), VT, N0.getOperand(0),
|
||||
N0.getOperand(1),
|
||||
cast<CondCodeSDNode>(N0.getOperand(2))->get());
|
||||
// If the desired elements are smaller or larger than the source
|
||||
// elements we can use a matching integer vector type and then
|
||||
// truncate/sign extend
|
||||
else {
|
||||
EVT MatchingElementType =
|
||||
EVT::getIntegerVT(*DAG.getContext(),
|
||||
N0VT.getScalarType().getSizeInBits());
|
||||
EVT MatchingVectorType =
|
||||
EVT::getVectorVT(*DAG.getContext(), MatchingElementType,
|
||||
N0VT.getVectorNumElements());
|
||||
SDValue VsetCC =
|
||||
DAG.getVSetCC(N->getDebugLoc(), MatchingVectorType, N0.getOperand(0),
|
||||
N0.getOperand(1),
|
||||
cast<CondCodeSDNode>(N0.getOperand(2))->get());
|
||||
return DAG.getSExtOrTrunc(VsetCC, N->getDebugLoc(), VT);
|
||||
EVT MatchingElementType =
|
||||
EVT::getIntegerVT(*DAG.getContext(),
|
||||
N0VT.getScalarType().getSizeInBits());
|
||||
EVT MatchingVectorType =
|
||||
EVT::getVectorVT(*DAG.getContext(), MatchingElementType,
|
||||
N0VT.getVectorNumElements());
|
||||
SDValue VsetCC =
|
||||
DAG.getVSetCC(N->getDebugLoc(), MatchingVectorType, N0.getOperand(0),
|
||||
N0.getOperand(1),
|
||||
cast<CondCodeSDNode>(N0.getOperand(2))->get());
|
||||
return DAG.getSExtOrTrunc(VsetCC, N->getDebugLoc(), VT);
|
||||
}
|
||||
}
|
||||
|
||||
|
@ -505,7 +505,7 @@ SDValue DAGTypeLegalizer::SoftenFloatRes_VAARG(SDNode *N) {
|
||||
|
||||
SDValue NewVAARG;
|
||||
NewVAARG = DAG.getVAArg(NVT, dl, Chain, Ptr, N->getOperand(2),
|
||||
N->getConstantOperandVal(3));
|
||||
N->getConstantOperandVal(3));
|
||||
|
||||
// Legalized the chain result - switch anything that used the old chain to
|
||||
// use the new one.
|
||||
|
@ -278,7 +278,7 @@ std::string ScheduleDAGSDNodes::getGraphNodeLabel(const SUnit *SU) const {
|
||||
FlaggedNodes.push_back(N);
|
||||
while (!FlaggedNodes.empty()) {
|
||||
O << DOTGraphTraits<SelectionDAG*>
|
||||
::getSimpleNodeLabel(FlaggedNodes.back(), DAG);
|
||||
::getSimpleNodeLabel(FlaggedNodes.back(), DAG);
|
||||
FlaggedNodes.pop_back();
|
||||
if (!FlaggedNodes.empty())
|
||||
O << "\n ";
|
||||
|
@ -266,7 +266,7 @@ GenericValue Interpreter::callExternalFunction(Function *F,
|
||||
RawFn = (RawFunc)(intptr_t)
|
||||
sys::DynamicLibrary::SearchForAddressOfSymbol(F->getName());
|
||||
if (!RawFn)
|
||||
RawFn = (RawFunc)(intptr_t)getPointerToGlobalIfAvailable(F);
|
||||
RawFn = (RawFunc)(intptr_t)getPointerToGlobalIfAvailable(F);
|
||||
if (RawFn != 0)
|
||||
RawFunctions->insert(std::make_pair(F, RawFn)); // Cache for later
|
||||
} else {
|
||||
|
@ -100,9 +100,9 @@ public:
|
||||
CodeGenOpt::Level OptLevel =
|
||||
CodeGenOpt::Default,
|
||||
bool GVsWithCode = true,
|
||||
CodeModel::Model CMM = CodeModel::Default) {
|
||||
CodeModel::Model CMM = CodeModel::Default) {
|
||||
return ExecutionEngine::createJIT(M, Err, JMM, OptLevel, GVsWithCode,
|
||||
CMM);
|
||||
CMM);
|
||||
}
|
||||
|
||||
virtual void addModule(Module *M);
|
||||
|
@ -97,14 +97,14 @@ MCSymbol *MCContext::CreateDirectionalLocalSymbol(int64_t LocalLabelVal) {
|
||||
return GetOrCreateSymbol(Twine(MAI.getPrivateGlobalPrefix()) +
|
||||
Twine(LocalLabelVal) +
|
||||
"\2" +
|
||||
Twine(NextInstance(LocalLabelVal)));
|
||||
Twine(NextInstance(LocalLabelVal)));
|
||||
}
|
||||
MCSymbol *MCContext::GetDirectionalLocalSymbol(int64_t LocalLabelVal,
|
||||
int bORf) {
|
||||
return GetOrCreateSymbol(Twine(MAI.getPrivateGlobalPrefix()) +
|
||||
Twine(LocalLabelVal) +
|
||||
"\2" +
|
||||
Twine(GetInstance(LocalLabelVal) + bORf));
|
||||
Twine(GetInstance(LocalLabelVal) + bORf));
|
||||
}
|
||||
|
||||
MCSymbol *MCContext::LookupSymbol(StringRef Name) const {
|
||||
|
@ -40,7 +40,7 @@ void MCExpr::print(raw_ostream &OS) const {
|
||||
const MCSymbol &Sym = SRE.getSymbol();
|
||||
|
||||
if (SRE.getKind() == MCSymbolRefExpr::VK_ARM_HI16 ||
|
||||
SRE.getKind() == MCSymbolRefExpr::VK_ARM_LO16)
|
||||
SRE.getKind() == MCSymbolRefExpr::VK_ARM_LO16)
|
||||
OS << MCSymbolRefExpr::getVariantKindName(SRE.getKind());
|
||||
|
||||
// Parenthesize names that start with $ so that they don't look like
|
||||
@ -51,8 +51,8 @@ void MCExpr::print(raw_ostream &OS) const {
|
||||
OS << Sym;
|
||||
|
||||
if (SRE.getKind() != MCSymbolRefExpr::VK_None &&
|
||||
SRE.getKind() != MCSymbolRefExpr::VK_ARM_HI16 &&
|
||||
SRE.getKind() != MCSymbolRefExpr::VK_ARM_LO16)
|
||||
SRE.getKind() != MCSymbolRefExpr::VK_ARM_HI16 &&
|
||||
SRE.getKind() != MCSymbolRefExpr::VK_ARM_LO16)
|
||||
OS << '@' << MCSymbolRefExpr::getVariantKindName(SRE.getKind());
|
||||
|
||||
return;
|
||||
|
@ -229,7 +229,7 @@ StringRef AsmLexer::LexUntilEndOfStatement() {
|
||||
TokStart = CurPtr;
|
||||
|
||||
while (!isAtStartOfComment(*CurPtr) && // Start of line comment.
|
||||
*CurPtr != ';' && // End of statement marker.
|
||||
*CurPtr != ';' && // End of statement marker.
|
||||
*CurPtr != '\n' &&
|
||||
*CurPtr != '\r' &&
|
||||
(*CurPtr != 0 || CurPtr != CurBuf->getBufferEnd())) {
|
||||
|
@ -453,8 +453,8 @@ bool AsmParser::ParseStatement() {
|
||||
IDVal = getTok().getString();
|
||||
Lex(); // Consume the integer token to be used as an identifier token.
|
||||
if (Lexer.getKind() != AsmToken::Colon) {
|
||||
if (!TheCondState.Ignore)
|
||||
return TokError("unexpected token at start of statement");
|
||||
if (!TheCondState.Ignore)
|
||||
return TokError("unexpected token at start of statement");
|
||||
}
|
||||
}
|
||||
}
|
||||
|
@ -283,7 +283,7 @@ static LONG WINAPI LLVMUnhandledExceptionFilter(LPEXCEPTION_POINTERS ep) {
|
||||
|
||||
#ifdef _MSC_VER
|
||||
if (ExitOnUnhandledExceptions)
|
||||
_exit(-3);
|
||||
_exit(-3);
|
||||
#endif
|
||||
|
||||
// Allow dialog box to pop up allowing choice to start debugger.
|
||||
|
@ -425,7 +425,7 @@ bool ARMAsmParser::ParseMemory(OwningPtr<ARMOperand> &Op) {
|
||||
const AsmToken &NextTok = Parser.getTok();
|
||||
if (NextTok.isNot(AsmToken::EndOfStatement)) {
|
||||
if (NextTok.isNot(AsmToken::Comma))
|
||||
return Error(NextTok.getLoc(), "',' expected");
|
||||
return Error(NextTok.getLoc(), "',' expected");
|
||||
Parser.Lex(); // Eat comma token.
|
||||
if(ParseMemoryOffsetReg(Negative, OffsetRegShifted, ShiftType,
|
||||
ShiftAmount, Offset, OffsetIsReg, OffsetRegNum,
|
||||
@ -488,7 +488,7 @@ bool ARMAsmParser::ParseMemoryOffsetReg(bool &Negative,
|
||||
|
||||
const AsmToken &Tok = Parser.getTok();
|
||||
if (ParseShift(ShiftType, ShiftAmount, E))
|
||||
return Error(Tok.getLoc(), "shift expected");
|
||||
return Error(Tok.getLoc(), "shift expected");
|
||||
OffsetRegShifted = true;
|
||||
}
|
||||
}
|
||||
|
@ -1397,11 +1397,11 @@ void ARMAsmPrinter::printInstructionThroughMCStreamer(const MachineInstr *MI) {
|
||||
} else if (MO.isGlobal()) {
|
||||
MCSymbol *Symbol = MCInstLowering.GetGlobalAddressSymbol(MO);
|
||||
const MCSymbolRefExpr *SymRef1 =
|
||||
MCSymbolRefExpr::Create(Symbol,
|
||||
MCSymbolRefExpr::VK_ARM_LO16, OutContext);
|
||||
MCSymbolRefExpr::Create(Symbol,
|
||||
MCSymbolRefExpr::VK_ARM_LO16, OutContext);
|
||||
const MCSymbolRefExpr *SymRef2 =
|
||||
MCSymbolRefExpr::Create(Symbol,
|
||||
MCSymbolRefExpr::VK_ARM_HI16, OutContext);
|
||||
MCSymbolRefExpr::Create(Symbol,
|
||||
MCSymbolRefExpr::VK_ARM_HI16, OutContext);
|
||||
V1 = MCOperand::CreateExpr(SymRef1);
|
||||
V2 = MCOperand::CreateExpr(SymRef2);
|
||||
} else {
|
||||
|
@ -34,7 +34,7 @@
|
||||
/// Uses and Defs by this instr. For the Uses part, the pred:$p operand is
|
||||
/// defined with two components:
|
||||
///
|
||||
/// def pred { // Operand PredicateOperand
|
||||
/// def pred { // Operand PredicateOperand
|
||||
/// ValueType Type = OtherVT;
|
||||
/// string PrintMethod = "printPredicateOperand";
|
||||
/// string AsmOperandLowerMethod = ?;
|
||||
@ -54,7 +54,7 @@
|
||||
///
|
||||
/// For the Defs part, in the simple case of only cc_out:$s, we have:
|
||||
///
|
||||
/// def cc_out { // Operand OptionalDefOperand
|
||||
/// def cc_out { // Operand OptionalDefOperand
|
||||
/// ValueType Type = OtherVT;
|
||||
/// string PrintMethod = "printSBitModifierOperand";
|
||||
/// string AsmOperandLowerMethod = ?;
|
||||
|
@ -117,7 +117,7 @@ bool MemSelOpt::processBasicBlock(MachineFunction &MF, MachineBasicBlock &BB) {
|
||||
DebugLoc dl = I->getDebugLoc();
|
||||
BuildMI(*MBB, I, dl, TII->get(PIC16::pagesel)).addExternalSymbol("$");
|
||||
Changed = true;
|
||||
PageChanged = 0;
|
||||
PageChanged = 0;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
@ -1446,7 +1446,7 @@ Instruction *InstCombiner::visitICmpInstWithInstAndIntCst(ICmpInst &ICI,
|
||||
}
|
||||
break;
|
||||
default:
|
||||
break;
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
@ -230,7 +230,7 @@ class ABCD : public FunctionPass {
|
||||
DenseMapIterator<Value*, MemoizedResultChart> begin = map.begin();
|
||||
DenseMapIterator<Value*, MemoizedResultChart> end = map.end();
|
||||
for (; begin != end; ++begin) {
|
||||
begin->second.clear();
|
||||
begin->second.clear();
|
||||
}
|
||||
map.clear();
|
||||
}
|
||||
@ -396,8 +396,8 @@ class ABCD : public FunctionPass {
|
||||
/// this case the method returns true, otherwise false. It also obtains the
|
||||
/// Instruction and ConstantInt from the BinaryOperator and returns it.
|
||||
bool createBinaryOperatorInfo(BinaryOperator *BO, Instruction **I1,
|
||||
Instruction **I2, ConstantInt **C1,
|
||||
ConstantInt **C2);
|
||||
Instruction **I2, ConstantInt **C1,
|
||||
ConstantInt **C2);
|
||||
|
||||
/// This method creates a constraint between a Sigma and an Instruction.
|
||||
/// These constraints are created as soon as we find a comparator that uses a
|
||||
|
@ -958,11 +958,11 @@ bool LoopIndexSplit::splitLoop() {
|
||||
continue;
|
||||
|
||||
for (BasicBlock::iterator BI = BB->begin(), BE = BB->end();
|
||||
BI != BE; ++BI) {
|
||||
BI != BE; ++BI) {
|
||||
Instruction *Inst = BI;
|
||||
|
||||
if (!Inst->isSafeToSpeculativelyExecute() && !isa<PHINode>(Inst)
|
||||
&& !isa<BranchInst>(Inst) && !isa<DbgInfoIntrinsic>(Inst))
|
||||
&& !isa<BranchInst>(Inst) && !isa<DbgInfoIntrinsic>(Inst))
|
||||
return false;
|
||||
}
|
||||
}
|
||||
|
@ -2036,7 +2036,7 @@ void AssemblyWriter::printInstruction(const Instruction &I) {
|
||||
}
|
||||
|
||||
static void WriteMDNodeComment(const MDNode *Node,
|
||||
formatted_raw_ostream &Out) {
|
||||
formatted_raw_ostream &Out) {
|
||||
if (Node->getNumOperands() < 1)
|
||||
return;
|
||||
ConstantInt *CI = dyn_cast_or_null<ConstantInt>(Node->getOperand(0));
|
||||
|
@ -471,7 +471,7 @@ static Instruction *createMalloc(Instruction *InsertBefore,
|
||||
Instruction *CallInst::CreateMalloc(Instruction *InsertBefore,
|
||||
const Type *IntPtrTy, const Type *AllocTy,
|
||||
Value *AllocSize, Value *ArraySize,
|
||||
Function * MallocF,
|
||||
Function * MallocF,
|
||||
const Twine &Name) {
|
||||
return createMalloc(InsertBefore, NULL, IntPtrTy, AllocTy, AllocSize,
|
||||
ArraySize, MallocF, Name);
|
||||
|
@ -269,7 +269,7 @@ public:
|
||||
/// recreate the failure. This returns true if a compiler error is found.
|
||||
///
|
||||
bool runManyPasses(const std::vector<const PassInfo*> &AllPasses,
|
||||
std::string &ErrMsg);
|
||||
std::string &ErrMsg);
|
||||
|
||||
/// writeProgramToFile - This writes the current "Program" to the named
|
||||
/// bitcode file. If an error occurs, true is returned.
|
||||
|
@ -183,8 +183,8 @@ Backjump:
|
||||
--i; // Don't skip an element of the list
|
||||
Changed = true;
|
||||
}
|
||||
if (!Error.empty())
|
||||
return true;
|
||||
if (!Error.empty())
|
||||
return true;
|
||||
}
|
||||
// This can take a long time if left uncontrolled. For now, don't
|
||||
// iterate.
|
||||
|
@ -64,7 +64,7 @@ public:
|
||||
FileType fileType,
|
||||
const std::string &InputFile,
|
||||
const std::string &OutputFile,
|
||||
std::string *Error = 0,
|
||||
std::string *Error = 0,
|
||||
const std::vector<std::string> &GCCArgs =
|
||||
std::vector<std::string>(),
|
||||
unsigned Timeout = 0,
|
||||
|
@ -112,7 +112,7 @@ OptLevelO3("O3",
|
||||
static cl::opt<bool>
|
||||
UnitAtATime("funit-at-a-time",
|
||||
cl::desc("Enable IPO. This is same as llvm-gcc's -funit-at-a-time"),
|
||||
cl::init(true));
|
||||
cl::init(true));
|
||||
|
||||
static cl::opt<bool>
|
||||
DisableSimplifyLibCalls("disable-simplify-libcalls",
|
||||
|
@ -31,7 +31,7 @@ public:
|
||||
~ARMDecoderEmitter() {
|
||||
shutdownBackend();
|
||||
}
|
||||
|
||||
|
||||
// run - Output the code emitter
|
||||
void run(raw_ostream &o);
|
||||
|
||||
|
@ -407,9 +407,9 @@ public:
|
||||
default:
|
||||
// This class preceeds the RHS if it is a proper subset of the RHS.
|
||||
if (isSubsetOf(RHS))
|
||||
return true;
|
||||
return true;
|
||||
if (RHS.isSubsetOf(*this))
|
||||
return false;
|
||||
return false;
|
||||
|
||||
// Otherwise, order by name to ensure we have a total ordering.
|
||||
return ValueName < RHS.ValueName;
|
||||
|
@ -33,7 +33,7 @@ using namespace llvm;
|
||||
MAP(C9, 38) \
|
||||
MAP(E8, 39) \
|
||||
MAP(F0, 40) \
|
||||
MAP(F8, 41) \
|
||||
MAP(F8, 41) \
|
||||
MAP(F9, 42)
|
||||
|
||||
// A clone of X86 since we can't depend on something that is generated.
|
||||
|
Loading…
Reference in New Issue
Block a user