2004-08-01 13:59:33 +08:00
|
|
|
//===- AsmWriterEmitter.cpp - Generate an assembly writer -----------------===//
|
2005-04-22 08:00:37 +08:00
|
|
|
//
|
2004-08-01 13:59:33 +08:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-30 04:37:13 +08:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-22 08:00:37 +08:00
|
|
|
//
|
2004-08-01 13:59:33 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This tablegen backend is emits an assembly printer for the current target.
|
|
|
|
// Note that this is currently fairly skeletal, but will grow over time.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "AsmWriterEmitter.h"
|
2010-02-10 05:50:41 +08:00
|
|
|
#include "AsmWriterInst.h"
|
2004-08-01 13:59:33 +08:00
|
|
|
#include "CodeGenTarget.h"
|
2004-08-15 06:50:53 +08:00
|
|
|
#include "Record.h"
|
2009-09-14 09:19:16 +08:00
|
|
|
#include "StringToOffsetTable.h"
|
2006-07-19 01:18:03 +08:00
|
|
|
#include "llvm/Support/Debug.h"
|
|
|
|
#include "llvm/Support/MathExtras.h"
|
2005-01-23 02:50:10 +08:00
|
|
|
#include <algorithm>
|
2004-08-01 13:59:33 +08:00
|
|
|
using namespace llvm;
|
|
|
|
|
This is the final big of factoring. This shares cases in suboperand
differences, which means that identical instructions (after stripping off
the first literal string) do not run any different code at all. On the X86,
this turns this code:
switch (MI->getOpcode()) {
case X86::ADC32mi: printOperand(MI, 4, MVT::i32); break;
case X86::ADC32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::ADC32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ADD32mi: printOperand(MI, 4, MVT::i32); break;
case X86::ADD32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::ADD32mr: printOperand(MI, 4, MVT::i32); break;
case X86::AND32mi: printOperand(MI, 4, MVT::i32); break;
case X86::AND32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::AND32mr: printOperand(MI, 4, MVT::i32); break;
case X86::CMP32mi: printOperand(MI, 4, MVT::i32); break;
case X86::CMP32mr: printOperand(MI, 4, MVT::i32); break;
case X86::MOV32mi: printOperand(MI, 4, MVT::i32); break;
case X86::MOV32mr: printOperand(MI, 4, MVT::i32); break;
case X86::OR32mi: printOperand(MI, 4, MVT::i32); break;
case X86::OR32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::OR32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ROL32mi: printOperand(MI, 4, MVT::i8); break;
case X86::ROR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SAR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SBB32mi: printOperand(MI, 4, MVT::i32); break;
case X86::SBB32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::SBB32mr: printOperand(MI, 4, MVT::i32); break;
case X86::SHL32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SHLD32mrCL: printOperand(MI, 4, MVT::i32); break;
case X86::SHR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SHRD32mrCL: printOperand(MI, 4, MVT::i32); break;
case X86::SUB32mi: printOperand(MI, 4, MVT::i32); break;
case X86::SUB32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::SUB32mr: printOperand(MI, 4, MVT::i32); break;
case X86::TEST32mi: printOperand(MI, 4, MVT::i32); break;
case X86::TEST32mr: printOperand(MI, 4, MVT::i32); break;
case X86::TEST8mi: printOperand(MI, 4, MVT::i8); break;
case X86::XCHG32mr: printOperand(MI, 4, MVT::i32); break;
case X86::XOR32mi: printOperand(MI, 4, MVT::i32); break;
case X86::XOR32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::XOR32mr: printOperand(MI, 4, MVT::i32); break;
}
into this:
switch (MI->getOpcode()) {
case X86::ADC32mi:
case X86::ADC32mr:
case X86::ADD32mi:
case X86::ADD32mr:
case X86::AND32mi:
case X86::AND32mr:
case X86::CMP32mi:
case X86::CMP32mr:
case X86::MOV32mi:
case X86::MOV32mr:
case X86::OR32mi:
case X86::OR32mr:
case X86::SBB32mi:
case X86::SBB32mr:
case X86::SHLD32mrCL:
case X86::SHRD32mrCL:
case X86::SUB32mi:
case X86::SUB32mr:
case X86::TEST32mi:
case X86::TEST32mr:
case X86::XCHG32mr:
case X86::XOR32mi:
case X86::XOR32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ADC32mi8:
case X86::ADD32mi8:
case X86::AND32mi8:
case X86::OR32mi8:
case X86::ROL32mi:
case X86::ROR32mi:
case X86::SAR32mi:
case X86::SBB32mi8:
case X86::SHL32mi:
case X86::SHR32mi:
case X86::SUB32mi8:
case X86::TEST8mi:
case X86::XOR32mi8: printOperand(MI, 4, MVT::i8); break;
}
After this, the generated asmwriters look pretty much as though they were
generated by hand. This shrinks the X86 asmwriter.inc files from 55101->39669
and 55429->39551 bytes each, and PPC from 16766->12859 bytes.
llvm-svn: 19760
2005-01-23 04:31:17 +08:00
|
|
|
static void PrintCases(std::vector<std::pair<std::string,
|
2009-07-03 08:10:29 +08:00
|
|
|
AsmWriterOperand> > &OpsToPrint, raw_ostream &O) {
|
This is the final big of factoring. This shares cases in suboperand
differences, which means that identical instructions (after stripping off
the first literal string) do not run any different code at all. On the X86,
this turns this code:
switch (MI->getOpcode()) {
case X86::ADC32mi: printOperand(MI, 4, MVT::i32); break;
case X86::ADC32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::ADC32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ADD32mi: printOperand(MI, 4, MVT::i32); break;
case X86::ADD32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::ADD32mr: printOperand(MI, 4, MVT::i32); break;
case X86::AND32mi: printOperand(MI, 4, MVT::i32); break;
case X86::AND32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::AND32mr: printOperand(MI, 4, MVT::i32); break;
case X86::CMP32mi: printOperand(MI, 4, MVT::i32); break;
case X86::CMP32mr: printOperand(MI, 4, MVT::i32); break;
case X86::MOV32mi: printOperand(MI, 4, MVT::i32); break;
case X86::MOV32mr: printOperand(MI, 4, MVT::i32); break;
case X86::OR32mi: printOperand(MI, 4, MVT::i32); break;
case X86::OR32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::OR32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ROL32mi: printOperand(MI, 4, MVT::i8); break;
case X86::ROR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SAR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SBB32mi: printOperand(MI, 4, MVT::i32); break;
case X86::SBB32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::SBB32mr: printOperand(MI, 4, MVT::i32); break;
case X86::SHL32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SHLD32mrCL: printOperand(MI, 4, MVT::i32); break;
case X86::SHR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SHRD32mrCL: printOperand(MI, 4, MVT::i32); break;
case X86::SUB32mi: printOperand(MI, 4, MVT::i32); break;
case X86::SUB32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::SUB32mr: printOperand(MI, 4, MVT::i32); break;
case X86::TEST32mi: printOperand(MI, 4, MVT::i32); break;
case X86::TEST32mr: printOperand(MI, 4, MVT::i32); break;
case X86::TEST8mi: printOperand(MI, 4, MVT::i8); break;
case X86::XCHG32mr: printOperand(MI, 4, MVT::i32); break;
case X86::XOR32mi: printOperand(MI, 4, MVT::i32); break;
case X86::XOR32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::XOR32mr: printOperand(MI, 4, MVT::i32); break;
}
into this:
switch (MI->getOpcode()) {
case X86::ADC32mi:
case X86::ADC32mr:
case X86::ADD32mi:
case X86::ADD32mr:
case X86::AND32mi:
case X86::AND32mr:
case X86::CMP32mi:
case X86::CMP32mr:
case X86::MOV32mi:
case X86::MOV32mr:
case X86::OR32mi:
case X86::OR32mr:
case X86::SBB32mi:
case X86::SBB32mr:
case X86::SHLD32mrCL:
case X86::SHRD32mrCL:
case X86::SUB32mi:
case X86::SUB32mr:
case X86::TEST32mi:
case X86::TEST32mr:
case X86::XCHG32mr:
case X86::XOR32mi:
case X86::XOR32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ADC32mi8:
case X86::ADD32mi8:
case X86::AND32mi8:
case X86::OR32mi8:
case X86::ROL32mi:
case X86::ROR32mi:
case X86::SAR32mi:
case X86::SBB32mi8:
case X86::SHL32mi:
case X86::SHR32mi:
case X86::SUB32mi8:
case X86::TEST8mi:
case X86::XOR32mi8: printOperand(MI, 4, MVT::i8); break;
}
After this, the generated asmwriters look pretty much as though they were
generated by hand. This shrinks the X86 asmwriter.inc files from 55101->39669
and 55429->39551 bytes each, and PPC from 16766->12859 bytes.
llvm-svn: 19760
2005-01-23 04:31:17 +08:00
|
|
|
O << " case " << OpsToPrint.back().first << ": ";
|
|
|
|
AsmWriterOperand TheOp = OpsToPrint.back().second;
|
|
|
|
OpsToPrint.pop_back();
|
|
|
|
|
|
|
|
// Check to see if any other operands are identical in this list, and if so,
|
|
|
|
// emit a case label for them.
|
|
|
|
for (unsigned i = OpsToPrint.size(); i != 0; --i)
|
|
|
|
if (OpsToPrint[i-1].second == TheOp) {
|
|
|
|
O << "\n case " << OpsToPrint[i-1].first << ": ";
|
|
|
|
OpsToPrint.erase(OpsToPrint.begin()+i-1);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Finally, emit the code.
|
2006-07-19 01:18:03 +08:00
|
|
|
O << TheOp.getCode();
|
This is the final big of factoring. This shares cases in suboperand
differences, which means that identical instructions (after stripping off
the first literal string) do not run any different code at all. On the X86,
this turns this code:
switch (MI->getOpcode()) {
case X86::ADC32mi: printOperand(MI, 4, MVT::i32); break;
case X86::ADC32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::ADC32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ADD32mi: printOperand(MI, 4, MVT::i32); break;
case X86::ADD32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::ADD32mr: printOperand(MI, 4, MVT::i32); break;
case X86::AND32mi: printOperand(MI, 4, MVT::i32); break;
case X86::AND32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::AND32mr: printOperand(MI, 4, MVT::i32); break;
case X86::CMP32mi: printOperand(MI, 4, MVT::i32); break;
case X86::CMP32mr: printOperand(MI, 4, MVT::i32); break;
case X86::MOV32mi: printOperand(MI, 4, MVT::i32); break;
case X86::MOV32mr: printOperand(MI, 4, MVT::i32); break;
case X86::OR32mi: printOperand(MI, 4, MVT::i32); break;
case X86::OR32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::OR32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ROL32mi: printOperand(MI, 4, MVT::i8); break;
case X86::ROR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SAR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SBB32mi: printOperand(MI, 4, MVT::i32); break;
case X86::SBB32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::SBB32mr: printOperand(MI, 4, MVT::i32); break;
case X86::SHL32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SHLD32mrCL: printOperand(MI, 4, MVT::i32); break;
case X86::SHR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SHRD32mrCL: printOperand(MI, 4, MVT::i32); break;
case X86::SUB32mi: printOperand(MI, 4, MVT::i32); break;
case X86::SUB32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::SUB32mr: printOperand(MI, 4, MVT::i32); break;
case X86::TEST32mi: printOperand(MI, 4, MVT::i32); break;
case X86::TEST32mr: printOperand(MI, 4, MVT::i32); break;
case X86::TEST8mi: printOperand(MI, 4, MVT::i8); break;
case X86::XCHG32mr: printOperand(MI, 4, MVT::i32); break;
case X86::XOR32mi: printOperand(MI, 4, MVT::i32); break;
case X86::XOR32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::XOR32mr: printOperand(MI, 4, MVT::i32); break;
}
into this:
switch (MI->getOpcode()) {
case X86::ADC32mi:
case X86::ADC32mr:
case X86::ADD32mi:
case X86::ADD32mr:
case X86::AND32mi:
case X86::AND32mr:
case X86::CMP32mi:
case X86::CMP32mr:
case X86::MOV32mi:
case X86::MOV32mr:
case X86::OR32mi:
case X86::OR32mr:
case X86::SBB32mi:
case X86::SBB32mr:
case X86::SHLD32mrCL:
case X86::SHRD32mrCL:
case X86::SUB32mi:
case X86::SUB32mr:
case X86::TEST32mi:
case X86::TEST32mr:
case X86::XCHG32mr:
case X86::XOR32mi:
case X86::XOR32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ADC32mi8:
case X86::ADD32mi8:
case X86::AND32mi8:
case X86::OR32mi8:
case X86::ROL32mi:
case X86::ROR32mi:
case X86::SAR32mi:
case X86::SBB32mi8:
case X86::SHL32mi:
case X86::SHR32mi:
case X86::SUB32mi8:
case X86::TEST8mi:
case X86::XOR32mi8: printOperand(MI, 4, MVT::i8); break;
}
After this, the generated asmwriters look pretty much as though they were
generated by hand. This shrinks the X86 asmwriter.inc files from 55101->39669
and 55429->39551 bytes each, and PPC from 16766->12859 bytes.
llvm-svn: 19760
2005-01-23 04:31:17 +08:00
|
|
|
O << "break;\n";
|
|
|
|
}
|
|
|
|
|
Implement factoring of instruction pattern strings. In particular, instead of
emitting code like this:
case PPC::ADD: O << "add "; printOperand(MI, 0, MVT::i64); O << ", "; prin
tOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '\n
'; break;
case PPC::ADDC: O << "addc "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
case PPC::ADDE: O << "adde "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
...
Emit code like this:
case PPC::ADD:
case PPC::ADDC:
case PPC::ADDE:
...
switch (MI->getOpcode()) {
case PPC::ADD: O << "add "; break;
case PPC::ADDC: O << "addc "; break;
case PPC::ADDE: O << "adde "; break;
...
}
printOperand(MI, 0, MVT::i64);
O << ", ";
printOperand(MI, 1, MVT::i64);
O << ", ";
printOperand(MI, 2, MVT::i64);
O << "\n";
break;
This shrinks the PPC asm writer from 24785->15205 bytes (even though the new
asmwriter has much more whitespace than the old one), and the X86 printers shrink
quite a bit too. The important implication of this is that GCC no longer hits swap
when building the PPC backend in optimized mode. Thus this fixes PR448.
-Chris
llvm-svn: 19755
2005-01-23 02:38:13 +08:00
|
|
|
|
|
|
|
/// EmitInstructions - Emit the last instruction in the vector and any other
|
|
|
|
/// instructions that are suitably similar to it.
|
|
|
|
static void EmitInstructions(std::vector<AsmWriterInst> &Insts,
|
2009-07-03 08:10:29 +08:00
|
|
|
raw_ostream &O) {
|
Implement factoring of instruction pattern strings. In particular, instead of
emitting code like this:
case PPC::ADD: O << "add "; printOperand(MI, 0, MVT::i64); O << ", "; prin
tOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '\n
'; break;
case PPC::ADDC: O << "addc "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
case PPC::ADDE: O << "adde "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
...
Emit code like this:
case PPC::ADD:
case PPC::ADDC:
case PPC::ADDE:
...
switch (MI->getOpcode()) {
case PPC::ADD: O << "add "; break;
case PPC::ADDC: O << "addc "; break;
case PPC::ADDE: O << "adde "; break;
...
}
printOperand(MI, 0, MVT::i64);
O << ", ";
printOperand(MI, 1, MVT::i64);
O << ", ";
printOperand(MI, 2, MVT::i64);
O << "\n";
break;
This shrinks the PPC asm writer from 24785->15205 bytes (even though the new
asmwriter has much more whitespace than the old one), and the X86 printers shrink
quite a bit too. The important implication of this is that GCC no longer hits swap
when building the PPC backend in optimized mode. Thus this fixes PR448.
-Chris
llvm-svn: 19755
2005-01-23 02:38:13 +08:00
|
|
|
AsmWriterInst FirstInst = Insts.back();
|
|
|
|
Insts.pop_back();
|
|
|
|
|
|
|
|
std::vector<AsmWriterInst> SimilarInsts;
|
|
|
|
unsigned DifferingOperand = ~0;
|
|
|
|
for (unsigned i = Insts.size(); i != 0; --i) {
|
2005-01-23 03:22:23 +08:00
|
|
|
unsigned DiffOp = Insts[i-1].MatchesAllButOneOp(FirstInst);
|
|
|
|
if (DiffOp != ~1U) {
|
Implement factoring of instruction pattern strings. In particular, instead of
emitting code like this:
case PPC::ADD: O << "add "; printOperand(MI, 0, MVT::i64); O << ", "; prin
tOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '\n
'; break;
case PPC::ADDC: O << "addc "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
case PPC::ADDE: O << "adde "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
...
Emit code like this:
case PPC::ADD:
case PPC::ADDC:
case PPC::ADDE:
...
switch (MI->getOpcode()) {
case PPC::ADD: O << "add "; break;
case PPC::ADDC: O << "addc "; break;
case PPC::ADDE: O << "adde "; break;
...
}
printOperand(MI, 0, MVT::i64);
O << ", ";
printOperand(MI, 1, MVT::i64);
O << ", ";
printOperand(MI, 2, MVT::i64);
O << "\n";
break;
This shrinks the PPC asm writer from 24785->15205 bytes (even though the new
asmwriter has much more whitespace than the old one), and the X86 printers shrink
quite a bit too. The important implication of this is that GCC no longer hits swap
when building the PPC backend in optimized mode. Thus this fixes PR448.
-Chris
llvm-svn: 19755
2005-01-23 02:38:13 +08:00
|
|
|
if (DifferingOperand == ~0U) // First match!
|
|
|
|
DifferingOperand = DiffOp;
|
|
|
|
|
|
|
|
// If this differs in the same operand as the rest of the instructions in
|
|
|
|
// this class, move it to the SimilarInsts list.
|
2005-01-23 03:22:23 +08:00
|
|
|
if (DifferingOperand == DiffOp || DiffOp == ~0U) {
|
Implement factoring of instruction pattern strings. In particular, instead of
emitting code like this:
case PPC::ADD: O << "add "; printOperand(MI, 0, MVT::i64); O << ", "; prin
tOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '\n
'; break;
case PPC::ADDC: O << "addc "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
case PPC::ADDE: O << "adde "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
...
Emit code like this:
case PPC::ADD:
case PPC::ADDC:
case PPC::ADDE:
...
switch (MI->getOpcode()) {
case PPC::ADD: O << "add "; break;
case PPC::ADDC: O << "addc "; break;
case PPC::ADDE: O << "adde "; break;
...
}
printOperand(MI, 0, MVT::i64);
O << ", ";
printOperand(MI, 1, MVT::i64);
O << ", ";
printOperand(MI, 2, MVT::i64);
O << "\n";
break;
This shrinks the PPC asm writer from 24785->15205 bytes (even though the new
asmwriter has much more whitespace than the old one), and the X86 printers shrink
quite a bit too. The important implication of this is that GCC no longer hits swap
when building the PPC backend in optimized mode. Thus this fixes PR448.
-Chris
llvm-svn: 19755
2005-01-23 02:38:13 +08:00
|
|
|
SimilarInsts.push_back(Insts[i-1]);
|
|
|
|
Insts.erase(Insts.begin()+i-1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-05-02 01:01:17 +08:00
|
|
|
O << " case " << FirstInst.CGI->Namespace << "::"
|
Implement factoring of instruction pattern strings. In particular, instead of
emitting code like this:
case PPC::ADD: O << "add "; printOperand(MI, 0, MVT::i64); O << ", "; prin
tOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '\n
'; break;
case PPC::ADDC: O << "addc "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
case PPC::ADDE: O << "adde "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
...
Emit code like this:
case PPC::ADD:
case PPC::ADDC:
case PPC::ADDE:
...
switch (MI->getOpcode()) {
case PPC::ADD: O << "add "; break;
case PPC::ADDC: O << "addc "; break;
case PPC::ADDE: O << "adde "; break;
...
}
printOperand(MI, 0, MVT::i64);
O << ", ";
printOperand(MI, 1, MVT::i64);
O << ", ";
printOperand(MI, 2, MVT::i64);
O << "\n";
break;
This shrinks the PPC asm writer from 24785->15205 bytes (even though the new
asmwriter has much more whitespace than the old one), and the X86 printers shrink
quite a bit too. The important implication of this is that GCC no longer hits swap
when building the PPC backend in optimized mode. Thus this fixes PR448.
-Chris
llvm-svn: 19755
2005-01-23 02:38:13 +08:00
|
|
|
<< FirstInst.CGI->TheDef->getName() << ":\n";
|
|
|
|
for (unsigned i = 0, e = SimilarInsts.size(); i != e; ++i)
|
2006-05-02 01:01:17 +08:00
|
|
|
O << " case " << SimilarInsts[i].CGI->Namespace << "::"
|
Implement factoring of instruction pattern strings. In particular, instead of
emitting code like this:
case PPC::ADD: O << "add "; printOperand(MI, 0, MVT::i64); O << ", "; prin
tOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '\n
'; break;
case PPC::ADDC: O << "addc "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
case PPC::ADDE: O << "adde "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
...
Emit code like this:
case PPC::ADD:
case PPC::ADDC:
case PPC::ADDE:
...
switch (MI->getOpcode()) {
case PPC::ADD: O << "add "; break;
case PPC::ADDC: O << "addc "; break;
case PPC::ADDE: O << "adde "; break;
...
}
printOperand(MI, 0, MVT::i64);
O << ", ";
printOperand(MI, 1, MVT::i64);
O << ", ";
printOperand(MI, 2, MVT::i64);
O << "\n";
break;
This shrinks the PPC asm writer from 24785->15205 bytes (even though the new
asmwriter has much more whitespace than the old one), and the X86 printers shrink
quite a bit too. The important implication of this is that GCC no longer hits swap
when building the PPC backend in optimized mode. Thus this fixes PR448.
-Chris
llvm-svn: 19755
2005-01-23 02:38:13 +08:00
|
|
|
<< SimilarInsts[i].CGI->TheDef->getName() << ":\n";
|
|
|
|
for (unsigned i = 0, e = FirstInst.Operands.size(); i != e; ++i) {
|
|
|
|
if (i != DifferingOperand) {
|
|
|
|
// If the operand is the same for all instructions, just print it.
|
2006-07-19 01:18:03 +08:00
|
|
|
O << " " << FirstInst.Operands[i].getCode();
|
Implement factoring of instruction pattern strings. In particular, instead of
emitting code like this:
case PPC::ADD: O << "add "; printOperand(MI, 0, MVT::i64); O << ", "; prin
tOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '\n
'; break;
case PPC::ADDC: O << "addc "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
case PPC::ADDE: O << "adde "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
...
Emit code like this:
case PPC::ADD:
case PPC::ADDC:
case PPC::ADDE:
...
switch (MI->getOpcode()) {
case PPC::ADD: O << "add "; break;
case PPC::ADDC: O << "addc "; break;
case PPC::ADDE: O << "adde "; break;
...
}
printOperand(MI, 0, MVT::i64);
O << ", ";
printOperand(MI, 1, MVT::i64);
O << ", ";
printOperand(MI, 2, MVT::i64);
O << "\n";
break;
This shrinks the PPC asm writer from 24785->15205 bytes (even though the new
asmwriter has much more whitespace than the old one), and the X86 printers shrink
quite a bit too. The important implication of this is that GCC no longer hits swap
when building the PPC backend in optimized mode. Thus this fixes PR448.
-Chris
llvm-svn: 19755
2005-01-23 02:38:13 +08:00
|
|
|
} else {
|
|
|
|
// If this is the operand that varies between all of the instructions,
|
|
|
|
// emit a switch for just this operand now.
|
|
|
|
O << " switch (MI->getOpcode()) {\n";
|
This is the final big of factoring. This shares cases in suboperand
differences, which means that identical instructions (after stripping off
the first literal string) do not run any different code at all. On the X86,
this turns this code:
switch (MI->getOpcode()) {
case X86::ADC32mi: printOperand(MI, 4, MVT::i32); break;
case X86::ADC32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::ADC32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ADD32mi: printOperand(MI, 4, MVT::i32); break;
case X86::ADD32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::ADD32mr: printOperand(MI, 4, MVT::i32); break;
case X86::AND32mi: printOperand(MI, 4, MVT::i32); break;
case X86::AND32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::AND32mr: printOperand(MI, 4, MVT::i32); break;
case X86::CMP32mi: printOperand(MI, 4, MVT::i32); break;
case X86::CMP32mr: printOperand(MI, 4, MVT::i32); break;
case X86::MOV32mi: printOperand(MI, 4, MVT::i32); break;
case X86::MOV32mr: printOperand(MI, 4, MVT::i32); break;
case X86::OR32mi: printOperand(MI, 4, MVT::i32); break;
case X86::OR32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::OR32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ROL32mi: printOperand(MI, 4, MVT::i8); break;
case X86::ROR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SAR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SBB32mi: printOperand(MI, 4, MVT::i32); break;
case X86::SBB32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::SBB32mr: printOperand(MI, 4, MVT::i32); break;
case X86::SHL32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SHLD32mrCL: printOperand(MI, 4, MVT::i32); break;
case X86::SHR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SHRD32mrCL: printOperand(MI, 4, MVT::i32); break;
case X86::SUB32mi: printOperand(MI, 4, MVT::i32); break;
case X86::SUB32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::SUB32mr: printOperand(MI, 4, MVT::i32); break;
case X86::TEST32mi: printOperand(MI, 4, MVT::i32); break;
case X86::TEST32mr: printOperand(MI, 4, MVT::i32); break;
case X86::TEST8mi: printOperand(MI, 4, MVT::i8); break;
case X86::XCHG32mr: printOperand(MI, 4, MVT::i32); break;
case X86::XOR32mi: printOperand(MI, 4, MVT::i32); break;
case X86::XOR32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::XOR32mr: printOperand(MI, 4, MVT::i32); break;
}
into this:
switch (MI->getOpcode()) {
case X86::ADC32mi:
case X86::ADC32mr:
case X86::ADD32mi:
case X86::ADD32mr:
case X86::AND32mi:
case X86::AND32mr:
case X86::CMP32mi:
case X86::CMP32mr:
case X86::MOV32mi:
case X86::MOV32mr:
case X86::OR32mi:
case X86::OR32mr:
case X86::SBB32mi:
case X86::SBB32mr:
case X86::SHLD32mrCL:
case X86::SHRD32mrCL:
case X86::SUB32mi:
case X86::SUB32mr:
case X86::TEST32mi:
case X86::TEST32mr:
case X86::XCHG32mr:
case X86::XOR32mi:
case X86::XOR32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ADC32mi8:
case X86::ADD32mi8:
case X86::AND32mi8:
case X86::OR32mi8:
case X86::ROL32mi:
case X86::ROR32mi:
case X86::SAR32mi:
case X86::SBB32mi8:
case X86::SHL32mi:
case X86::SHR32mi:
case X86::SUB32mi8:
case X86::TEST8mi:
case X86::XOR32mi8: printOperand(MI, 4, MVT::i8); break;
}
After this, the generated asmwriters look pretty much as though they were
generated by hand. This shrinks the X86 asmwriter.inc files from 55101->39669
and 55429->39551 bytes each, and PPC from 16766->12859 bytes.
llvm-svn: 19760
2005-01-23 04:31:17 +08:00
|
|
|
std::vector<std::pair<std::string, AsmWriterOperand> > OpsToPrint;
|
2006-05-02 01:01:17 +08:00
|
|
|
OpsToPrint.push_back(std::make_pair(FirstInst.CGI->Namespace + "::" +
|
This is the final big of factoring. This shares cases in suboperand
differences, which means that identical instructions (after stripping off
the first literal string) do not run any different code at all. On the X86,
this turns this code:
switch (MI->getOpcode()) {
case X86::ADC32mi: printOperand(MI, 4, MVT::i32); break;
case X86::ADC32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::ADC32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ADD32mi: printOperand(MI, 4, MVT::i32); break;
case X86::ADD32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::ADD32mr: printOperand(MI, 4, MVT::i32); break;
case X86::AND32mi: printOperand(MI, 4, MVT::i32); break;
case X86::AND32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::AND32mr: printOperand(MI, 4, MVT::i32); break;
case X86::CMP32mi: printOperand(MI, 4, MVT::i32); break;
case X86::CMP32mr: printOperand(MI, 4, MVT::i32); break;
case X86::MOV32mi: printOperand(MI, 4, MVT::i32); break;
case X86::MOV32mr: printOperand(MI, 4, MVT::i32); break;
case X86::OR32mi: printOperand(MI, 4, MVT::i32); break;
case X86::OR32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::OR32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ROL32mi: printOperand(MI, 4, MVT::i8); break;
case X86::ROR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SAR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SBB32mi: printOperand(MI, 4, MVT::i32); break;
case X86::SBB32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::SBB32mr: printOperand(MI, 4, MVT::i32); break;
case X86::SHL32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SHLD32mrCL: printOperand(MI, 4, MVT::i32); break;
case X86::SHR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SHRD32mrCL: printOperand(MI, 4, MVT::i32); break;
case X86::SUB32mi: printOperand(MI, 4, MVT::i32); break;
case X86::SUB32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::SUB32mr: printOperand(MI, 4, MVT::i32); break;
case X86::TEST32mi: printOperand(MI, 4, MVT::i32); break;
case X86::TEST32mr: printOperand(MI, 4, MVT::i32); break;
case X86::TEST8mi: printOperand(MI, 4, MVT::i8); break;
case X86::XCHG32mr: printOperand(MI, 4, MVT::i32); break;
case X86::XOR32mi: printOperand(MI, 4, MVT::i32); break;
case X86::XOR32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::XOR32mr: printOperand(MI, 4, MVT::i32); break;
}
into this:
switch (MI->getOpcode()) {
case X86::ADC32mi:
case X86::ADC32mr:
case X86::ADD32mi:
case X86::ADD32mr:
case X86::AND32mi:
case X86::AND32mr:
case X86::CMP32mi:
case X86::CMP32mr:
case X86::MOV32mi:
case X86::MOV32mr:
case X86::OR32mi:
case X86::OR32mr:
case X86::SBB32mi:
case X86::SBB32mr:
case X86::SHLD32mrCL:
case X86::SHRD32mrCL:
case X86::SUB32mi:
case X86::SUB32mr:
case X86::TEST32mi:
case X86::TEST32mr:
case X86::XCHG32mr:
case X86::XOR32mi:
case X86::XOR32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ADC32mi8:
case X86::ADD32mi8:
case X86::AND32mi8:
case X86::OR32mi8:
case X86::ROL32mi:
case X86::ROR32mi:
case X86::SAR32mi:
case X86::SBB32mi8:
case X86::SHL32mi:
case X86::SHR32mi:
case X86::SUB32mi8:
case X86::TEST8mi:
case X86::XOR32mi8: printOperand(MI, 4, MVT::i8); break;
}
After this, the generated asmwriters look pretty much as though they were
generated by hand. This shrinks the X86 asmwriter.inc files from 55101->39669
and 55429->39551 bytes each, and PPC from 16766->12859 bytes.
llvm-svn: 19760
2005-01-23 04:31:17 +08:00
|
|
|
FirstInst.CGI->TheDef->getName(),
|
|
|
|
FirstInst.Operands[i]));
|
2005-04-22 08:00:37 +08:00
|
|
|
|
Implement factoring of instruction pattern strings. In particular, instead of
emitting code like this:
case PPC::ADD: O << "add "; printOperand(MI, 0, MVT::i64); O << ", "; prin
tOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '\n
'; break;
case PPC::ADDC: O << "addc "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
case PPC::ADDE: O << "adde "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
...
Emit code like this:
case PPC::ADD:
case PPC::ADDC:
case PPC::ADDE:
...
switch (MI->getOpcode()) {
case PPC::ADD: O << "add "; break;
case PPC::ADDC: O << "addc "; break;
case PPC::ADDE: O << "adde "; break;
...
}
printOperand(MI, 0, MVT::i64);
O << ", ";
printOperand(MI, 1, MVT::i64);
O << ", ";
printOperand(MI, 2, MVT::i64);
O << "\n";
break;
This shrinks the PPC asm writer from 24785->15205 bytes (even though the new
asmwriter has much more whitespace than the old one), and the X86 printers shrink
quite a bit too. The important implication of this is that GCC no longer hits swap
when building the PPC backend in optimized mode. Thus this fixes PR448.
-Chris
llvm-svn: 19755
2005-01-23 02:38:13 +08:00
|
|
|
for (unsigned si = 0, e = SimilarInsts.size(); si != e; ++si) {
|
This is the final big of factoring. This shares cases in suboperand
differences, which means that identical instructions (after stripping off
the first literal string) do not run any different code at all. On the X86,
this turns this code:
switch (MI->getOpcode()) {
case X86::ADC32mi: printOperand(MI, 4, MVT::i32); break;
case X86::ADC32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::ADC32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ADD32mi: printOperand(MI, 4, MVT::i32); break;
case X86::ADD32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::ADD32mr: printOperand(MI, 4, MVT::i32); break;
case X86::AND32mi: printOperand(MI, 4, MVT::i32); break;
case X86::AND32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::AND32mr: printOperand(MI, 4, MVT::i32); break;
case X86::CMP32mi: printOperand(MI, 4, MVT::i32); break;
case X86::CMP32mr: printOperand(MI, 4, MVT::i32); break;
case X86::MOV32mi: printOperand(MI, 4, MVT::i32); break;
case X86::MOV32mr: printOperand(MI, 4, MVT::i32); break;
case X86::OR32mi: printOperand(MI, 4, MVT::i32); break;
case X86::OR32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::OR32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ROL32mi: printOperand(MI, 4, MVT::i8); break;
case X86::ROR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SAR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SBB32mi: printOperand(MI, 4, MVT::i32); break;
case X86::SBB32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::SBB32mr: printOperand(MI, 4, MVT::i32); break;
case X86::SHL32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SHLD32mrCL: printOperand(MI, 4, MVT::i32); break;
case X86::SHR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SHRD32mrCL: printOperand(MI, 4, MVT::i32); break;
case X86::SUB32mi: printOperand(MI, 4, MVT::i32); break;
case X86::SUB32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::SUB32mr: printOperand(MI, 4, MVT::i32); break;
case X86::TEST32mi: printOperand(MI, 4, MVT::i32); break;
case X86::TEST32mr: printOperand(MI, 4, MVT::i32); break;
case X86::TEST8mi: printOperand(MI, 4, MVT::i8); break;
case X86::XCHG32mr: printOperand(MI, 4, MVT::i32); break;
case X86::XOR32mi: printOperand(MI, 4, MVT::i32); break;
case X86::XOR32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::XOR32mr: printOperand(MI, 4, MVT::i32); break;
}
into this:
switch (MI->getOpcode()) {
case X86::ADC32mi:
case X86::ADC32mr:
case X86::ADD32mi:
case X86::ADD32mr:
case X86::AND32mi:
case X86::AND32mr:
case X86::CMP32mi:
case X86::CMP32mr:
case X86::MOV32mi:
case X86::MOV32mr:
case X86::OR32mi:
case X86::OR32mr:
case X86::SBB32mi:
case X86::SBB32mr:
case X86::SHLD32mrCL:
case X86::SHRD32mrCL:
case X86::SUB32mi:
case X86::SUB32mr:
case X86::TEST32mi:
case X86::TEST32mr:
case X86::XCHG32mr:
case X86::XOR32mi:
case X86::XOR32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ADC32mi8:
case X86::ADD32mi8:
case X86::AND32mi8:
case X86::OR32mi8:
case X86::ROL32mi:
case X86::ROR32mi:
case X86::SAR32mi:
case X86::SBB32mi8:
case X86::SHL32mi:
case X86::SHR32mi:
case X86::SUB32mi8:
case X86::TEST8mi:
case X86::XOR32mi8: printOperand(MI, 4, MVT::i8); break;
}
After this, the generated asmwriters look pretty much as though they were
generated by hand. This shrinks the X86 asmwriter.inc files from 55101->39669
and 55429->39551 bytes each, and PPC from 16766->12859 bytes.
llvm-svn: 19760
2005-01-23 04:31:17 +08:00
|
|
|
AsmWriterInst &AWI = SimilarInsts[si];
|
2006-05-02 01:01:17 +08:00
|
|
|
OpsToPrint.push_back(std::make_pair(AWI.CGI->Namespace+"::"+
|
This is the final big of factoring. This shares cases in suboperand
differences, which means that identical instructions (after stripping off
the first literal string) do not run any different code at all. On the X86,
this turns this code:
switch (MI->getOpcode()) {
case X86::ADC32mi: printOperand(MI, 4, MVT::i32); break;
case X86::ADC32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::ADC32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ADD32mi: printOperand(MI, 4, MVT::i32); break;
case X86::ADD32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::ADD32mr: printOperand(MI, 4, MVT::i32); break;
case X86::AND32mi: printOperand(MI, 4, MVT::i32); break;
case X86::AND32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::AND32mr: printOperand(MI, 4, MVT::i32); break;
case X86::CMP32mi: printOperand(MI, 4, MVT::i32); break;
case X86::CMP32mr: printOperand(MI, 4, MVT::i32); break;
case X86::MOV32mi: printOperand(MI, 4, MVT::i32); break;
case X86::MOV32mr: printOperand(MI, 4, MVT::i32); break;
case X86::OR32mi: printOperand(MI, 4, MVT::i32); break;
case X86::OR32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::OR32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ROL32mi: printOperand(MI, 4, MVT::i8); break;
case X86::ROR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SAR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SBB32mi: printOperand(MI, 4, MVT::i32); break;
case X86::SBB32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::SBB32mr: printOperand(MI, 4, MVT::i32); break;
case X86::SHL32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SHLD32mrCL: printOperand(MI, 4, MVT::i32); break;
case X86::SHR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SHRD32mrCL: printOperand(MI, 4, MVT::i32); break;
case X86::SUB32mi: printOperand(MI, 4, MVT::i32); break;
case X86::SUB32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::SUB32mr: printOperand(MI, 4, MVT::i32); break;
case X86::TEST32mi: printOperand(MI, 4, MVT::i32); break;
case X86::TEST32mr: printOperand(MI, 4, MVT::i32); break;
case X86::TEST8mi: printOperand(MI, 4, MVT::i8); break;
case X86::XCHG32mr: printOperand(MI, 4, MVT::i32); break;
case X86::XOR32mi: printOperand(MI, 4, MVT::i32); break;
case X86::XOR32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::XOR32mr: printOperand(MI, 4, MVT::i32); break;
}
into this:
switch (MI->getOpcode()) {
case X86::ADC32mi:
case X86::ADC32mr:
case X86::ADD32mi:
case X86::ADD32mr:
case X86::AND32mi:
case X86::AND32mr:
case X86::CMP32mi:
case X86::CMP32mr:
case X86::MOV32mi:
case X86::MOV32mr:
case X86::OR32mi:
case X86::OR32mr:
case X86::SBB32mi:
case X86::SBB32mr:
case X86::SHLD32mrCL:
case X86::SHRD32mrCL:
case X86::SUB32mi:
case X86::SUB32mr:
case X86::TEST32mi:
case X86::TEST32mr:
case X86::XCHG32mr:
case X86::XOR32mi:
case X86::XOR32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ADC32mi8:
case X86::ADD32mi8:
case X86::AND32mi8:
case X86::OR32mi8:
case X86::ROL32mi:
case X86::ROR32mi:
case X86::SAR32mi:
case X86::SBB32mi8:
case X86::SHL32mi:
case X86::SHR32mi:
case X86::SUB32mi8:
case X86::TEST8mi:
case X86::XOR32mi8: printOperand(MI, 4, MVT::i8); break;
}
After this, the generated asmwriters look pretty much as though they were
generated by hand. This shrinks the X86 asmwriter.inc files from 55101->39669
and 55429->39551 bytes each, and PPC from 16766->12859 bytes.
llvm-svn: 19760
2005-01-23 04:31:17 +08:00
|
|
|
AWI.CGI->TheDef->getName(),
|
|
|
|
AWI.Operands[i]));
|
Implement factoring of instruction pattern strings. In particular, instead of
emitting code like this:
case PPC::ADD: O << "add "; printOperand(MI, 0, MVT::i64); O << ", "; prin
tOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '\n
'; break;
case PPC::ADDC: O << "addc "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
case PPC::ADDE: O << "adde "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
...
Emit code like this:
case PPC::ADD:
case PPC::ADDC:
case PPC::ADDE:
...
switch (MI->getOpcode()) {
case PPC::ADD: O << "add "; break;
case PPC::ADDC: O << "addc "; break;
case PPC::ADDE: O << "adde "; break;
...
}
printOperand(MI, 0, MVT::i64);
O << ", ";
printOperand(MI, 1, MVT::i64);
O << ", ";
printOperand(MI, 2, MVT::i64);
O << "\n";
break;
This shrinks the PPC asm writer from 24785->15205 bytes (even though the new
asmwriter has much more whitespace than the old one), and the X86 printers shrink
quite a bit too. The important implication of this is that GCC no longer hits swap
when building the PPC backend in optimized mode. Thus this fixes PR448.
-Chris
llvm-svn: 19755
2005-01-23 02:38:13 +08:00
|
|
|
}
|
This is the final big of factoring. This shares cases in suboperand
differences, which means that identical instructions (after stripping off
the first literal string) do not run any different code at all. On the X86,
this turns this code:
switch (MI->getOpcode()) {
case X86::ADC32mi: printOperand(MI, 4, MVT::i32); break;
case X86::ADC32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::ADC32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ADD32mi: printOperand(MI, 4, MVT::i32); break;
case X86::ADD32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::ADD32mr: printOperand(MI, 4, MVT::i32); break;
case X86::AND32mi: printOperand(MI, 4, MVT::i32); break;
case X86::AND32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::AND32mr: printOperand(MI, 4, MVT::i32); break;
case X86::CMP32mi: printOperand(MI, 4, MVT::i32); break;
case X86::CMP32mr: printOperand(MI, 4, MVT::i32); break;
case X86::MOV32mi: printOperand(MI, 4, MVT::i32); break;
case X86::MOV32mr: printOperand(MI, 4, MVT::i32); break;
case X86::OR32mi: printOperand(MI, 4, MVT::i32); break;
case X86::OR32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::OR32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ROL32mi: printOperand(MI, 4, MVT::i8); break;
case X86::ROR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SAR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SBB32mi: printOperand(MI, 4, MVT::i32); break;
case X86::SBB32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::SBB32mr: printOperand(MI, 4, MVT::i32); break;
case X86::SHL32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SHLD32mrCL: printOperand(MI, 4, MVT::i32); break;
case X86::SHR32mi: printOperand(MI, 4, MVT::i8); break;
case X86::SHRD32mrCL: printOperand(MI, 4, MVT::i32); break;
case X86::SUB32mi: printOperand(MI, 4, MVT::i32); break;
case X86::SUB32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::SUB32mr: printOperand(MI, 4, MVT::i32); break;
case X86::TEST32mi: printOperand(MI, 4, MVT::i32); break;
case X86::TEST32mr: printOperand(MI, 4, MVT::i32); break;
case X86::TEST8mi: printOperand(MI, 4, MVT::i8); break;
case X86::XCHG32mr: printOperand(MI, 4, MVT::i32); break;
case X86::XOR32mi: printOperand(MI, 4, MVT::i32); break;
case X86::XOR32mi8: printOperand(MI, 4, MVT::i8); break;
case X86::XOR32mr: printOperand(MI, 4, MVT::i32); break;
}
into this:
switch (MI->getOpcode()) {
case X86::ADC32mi:
case X86::ADC32mr:
case X86::ADD32mi:
case X86::ADD32mr:
case X86::AND32mi:
case X86::AND32mr:
case X86::CMP32mi:
case X86::CMP32mr:
case X86::MOV32mi:
case X86::MOV32mr:
case X86::OR32mi:
case X86::OR32mr:
case X86::SBB32mi:
case X86::SBB32mr:
case X86::SHLD32mrCL:
case X86::SHRD32mrCL:
case X86::SUB32mi:
case X86::SUB32mr:
case X86::TEST32mi:
case X86::TEST32mr:
case X86::XCHG32mr:
case X86::XOR32mi:
case X86::XOR32mr: printOperand(MI, 4, MVT::i32); break;
case X86::ADC32mi8:
case X86::ADD32mi8:
case X86::AND32mi8:
case X86::OR32mi8:
case X86::ROL32mi:
case X86::ROR32mi:
case X86::SAR32mi:
case X86::SBB32mi8:
case X86::SHL32mi:
case X86::SHR32mi:
case X86::SUB32mi8:
case X86::TEST8mi:
case X86::XOR32mi8: printOperand(MI, 4, MVT::i8); break;
}
After this, the generated asmwriters look pretty much as though they were
generated by hand. This shrinks the X86 asmwriter.inc files from 55101->39669
and 55429->39551 bytes each, and PPC from 16766->12859 bytes.
llvm-svn: 19760
2005-01-23 04:31:17 +08:00
|
|
|
std::reverse(OpsToPrint.begin(), OpsToPrint.end());
|
|
|
|
while (!OpsToPrint.empty())
|
|
|
|
PrintCases(OpsToPrint, O);
|
Implement factoring of instruction pattern strings. In particular, instead of
emitting code like this:
case PPC::ADD: O << "add "; printOperand(MI, 0, MVT::i64); O << ", "; prin
tOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '\n
'; break;
case PPC::ADDC: O << "addc "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
case PPC::ADDE: O << "adde "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
...
Emit code like this:
case PPC::ADD:
case PPC::ADDC:
case PPC::ADDE:
...
switch (MI->getOpcode()) {
case PPC::ADD: O << "add "; break;
case PPC::ADDC: O << "addc "; break;
case PPC::ADDE: O << "adde "; break;
...
}
printOperand(MI, 0, MVT::i64);
O << ", ";
printOperand(MI, 1, MVT::i64);
O << ", ";
printOperand(MI, 2, MVT::i64);
O << "\n";
break;
This shrinks the PPC asm writer from 24785->15205 bytes (even though the new
asmwriter has much more whitespace than the old one), and the X86 printers shrink
quite a bit too. The important implication of this is that GCC no longer hits swap
when building the PPC backend in optimized mode. Thus this fixes PR448.
-Chris
llvm-svn: 19755
2005-01-23 02:38:13 +08:00
|
|
|
O << " }";
|
|
|
|
}
|
|
|
|
O << "\n";
|
|
|
|
}
|
|
|
|
O << " break;\n";
|
|
|
|
}
|
2005-01-23 01:32:42 +08:00
|
|
|
|
2006-07-19 01:18:03 +08:00
|
|
|
void AsmWriterEmitter::
|
2010-09-30 06:32:50 +08:00
|
|
|
FindUniqueOperandCommands(std::vector<std::string> &UniqueOperandCommands,
|
2006-07-19 02:28:27 +08:00
|
|
|
std::vector<unsigned> &InstIdxs,
|
|
|
|
std::vector<unsigned> &InstOpsUsed) const {
|
2006-07-19 03:27:30 +08:00
|
|
|
InstIdxs.assign(NumberedInstructions.size(), ~0U);
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 01:18:03 +08:00
|
|
|
// This vector parallels UniqueOperandCommands, keeping track of which
|
|
|
|
// instructions each case are used for. It is a comma separated string of
|
|
|
|
// enums.
|
|
|
|
std::vector<std::string> InstrsForCase;
|
|
|
|
InstrsForCase.resize(UniqueOperandCommands.size());
|
2006-07-19 02:28:27 +08:00
|
|
|
InstOpsUsed.assign(UniqueOperandCommands.size(), 0);
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 01:18:03 +08:00
|
|
|
for (unsigned i = 0, e = NumberedInstructions.size(); i != e; ++i) {
|
|
|
|
const AsmWriterInst *Inst = getAsmWriterInstByID(i);
|
2010-07-17 07:10:00 +08:00
|
|
|
if (Inst == 0) continue; // PHI, INLINEASM, PROLOG_LABEL, etc.
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 01:18:03 +08:00
|
|
|
std::string Command;
|
2006-07-19 01:56:07 +08:00
|
|
|
if (Inst->Operands.empty())
|
2006-07-19 01:18:03 +08:00
|
|
|
continue; // Instruction already done.
|
2006-07-19 01:50:22 +08:00
|
|
|
|
2006-07-19 01:56:07 +08:00
|
|
|
Command = " " + Inst->Operands[0].getCode() + "\n";
|
2006-07-19 01:50:22 +08:00
|
|
|
|
2006-07-19 01:18:03 +08:00
|
|
|
// Check to see if we already have 'Command' in UniqueOperandCommands.
|
|
|
|
// If not, add it.
|
|
|
|
bool FoundIt = false;
|
|
|
|
for (unsigned idx = 0, e = UniqueOperandCommands.size(); idx != e; ++idx)
|
|
|
|
if (UniqueOperandCommands[idx] == Command) {
|
|
|
|
InstIdxs[i] = idx;
|
|
|
|
InstrsForCase[idx] += ", ";
|
|
|
|
InstrsForCase[idx] += Inst->CGI->TheDef->getName();
|
|
|
|
FoundIt = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (!FoundIt) {
|
|
|
|
InstIdxs[i] = UniqueOperandCommands.size();
|
|
|
|
UniqueOperandCommands.push_back(Command);
|
|
|
|
InstrsForCase.push_back(Inst->CGI->TheDef->getName());
|
2006-07-19 02:28:27 +08:00
|
|
|
|
|
|
|
// This command matches one operand so far.
|
|
|
|
InstOpsUsed.push_back(1);
|
|
|
|
}
|
|
|
|
}
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 02:28:27 +08:00
|
|
|
// For each entry of UniqueOperandCommands, there is a set of instructions
|
|
|
|
// that uses it. If the next command of all instructions in the set are
|
|
|
|
// identical, fold it into the command.
|
|
|
|
for (unsigned CommandIdx = 0, e = UniqueOperandCommands.size();
|
|
|
|
CommandIdx != e; ++CommandIdx) {
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 02:28:27 +08:00
|
|
|
for (unsigned Op = 1; ; ++Op) {
|
|
|
|
// Scan for the first instruction in the set.
|
|
|
|
std::vector<unsigned>::iterator NIT =
|
|
|
|
std::find(InstIdxs.begin(), InstIdxs.end(), CommandIdx);
|
|
|
|
if (NIT == InstIdxs.end()) break; // No commonality.
|
|
|
|
|
|
|
|
// If this instruction has no more operands, we isn't anything to merge
|
|
|
|
// into this command.
|
2010-09-30 06:32:50 +08:00
|
|
|
const AsmWriterInst *FirstInst =
|
2006-07-19 02:28:27 +08:00
|
|
|
getAsmWriterInstByID(NIT-InstIdxs.begin());
|
|
|
|
if (!FirstInst || FirstInst->Operands.size() == Op)
|
|
|
|
break;
|
|
|
|
|
|
|
|
// Otherwise, scan to see if all of the other instructions in this command
|
|
|
|
// set share the operand.
|
|
|
|
bool AllSame = true;
|
2009-07-30 04:10:24 +08:00
|
|
|
// Keep track of the maximum, number of operands or any
|
|
|
|
// instruction we see in the group.
|
|
|
|
size_t MaxSize = FirstInst->Operands.size();
|
|
|
|
|
2006-07-19 02:28:27 +08:00
|
|
|
for (NIT = std::find(NIT+1, InstIdxs.end(), CommandIdx);
|
|
|
|
NIT != InstIdxs.end();
|
|
|
|
NIT = std::find(NIT+1, InstIdxs.end(), CommandIdx)) {
|
|
|
|
// Okay, found another instruction in this command set. If the operand
|
|
|
|
// matches, we're ok, otherwise bail out.
|
2010-09-30 06:32:50 +08:00
|
|
|
const AsmWriterInst *OtherInst =
|
2006-07-19 02:28:27 +08:00
|
|
|
getAsmWriterInstByID(NIT-InstIdxs.begin());
|
2009-07-30 04:10:24 +08:00
|
|
|
|
|
|
|
if (OtherInst &&
|
|
|
|
OtherInst->Operands.size() > FirstInst->Operands.size())
|
|
|
|
MaxSize = std::max(MaxSize, OtherInst->Operands.size());
|
|
|
|
|
2006-07-19 02:28:27 +08:00
|
|
|
if (!OtherInst || OtherInst->Operands.size() == Op ||
|
|
|
|
OtherInst->Operands[Op] != FirstInst->Operands[Op]) {
|
|
|
|
AllSame = false;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!AllSame) break;
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 02:28:27 +08:00
|
|
|
// Okay, everything in this command set has the same next operand. Add it
|
|
|
|
// to UniqueOperandCommands and remember that it was consumed.
|
|
|
|
std::string Command = " " + FirstInst->Operands[Op].getCode() + "\n";
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 02:28:27 +08:00
|
|
|
UniqueOperandCommands[CommandIdx] += Command;
|
|
|
|
InstOpsUsed[CommandIdx]++;
|
2006-07-19 01:18:03 +08:00
|
|
|
}
|
|
|
|
}
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 01:18:03 +08:00
|
|
|
// Prepend some of the instructions each case is used for onto the case val.
|
|
|
|
for (unsigned i = 0, e = InstrsForCase.size(); i != e; ++i) {
|
|
|
|
std::string Instrs = InstrsForCase[i];
|
|
|
|
if (Instrs.size() > 70) {
|
|
|
|
Instrs.erase(Instrs.begin()+70, Instrs.end());
|
|
|
|
Instrs += "...";
|
|
|
|
}
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 01:18:03 +08:00
|
|
|
if (!Instrs.empty())
|
2010-09-30 06:32:50 +08:00
|
|
|
UniqueOperandCommands[i] = " // " + Instrs + "\n" +
|
2006-07-19 01:18:03 +08:00
|
|
|
UniqueOperandCommands[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-10-18 04:43:42 +08:00
|
|
|
static void UnescapeString(std::string &Str) {
|
|
|
|
for (unsigned i = 0; i != Str.size(); ++i) {
|
|
|
|
if (Str[i] == '\\' && i != Str.size()-1) {
|
|
|
|
switch (Str[i+1]) {
|
|
|
|
default: continue; // Don't execute the code after the switch.
|
|
|
|
case 'a': Str[i] = '\a'; break;
|
|
|
|
case 'b': Str[i] = '\b'; break;
|
|
|
|
case 'e': Str[i] = 27; break;
|
|
|
|
case 'f': Str[i] = '\f'; break;
|
|
|
|
case 'n': Str[i] = '\n'; break;
|
|
|
|
case 'r': Str[i] = '\r'; break;
|
|
|
|
case 't': Str[i] = '\t'; break;
|
|
|
|
case 'v': Str[i] = '\v'; break;
|
|
|
|
case '"': Str[i] = '\"'; break;
|
|
|
|
case '\'': Str[i] = '\''; break;
|
|
|
|
case '\\': Str[i] = '\\'; break;
|
|
|
|
}
|
|
|
|
// Nuke the second character.
|
|
|
|
Str.erase(Str.begin()+i+1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-09-14 04:08:00 +08:00
|
|
|
/// EmitPrintInstruction - Generate the code for the "printInstruction" method
|
|
|
|
/// implementation.
|
|
|
|
void AsmWriterEmitter::EmitPrintInstruction(raw_ostream &O) {
|
2010-12-13 08:23:57 +08:00
|
|
|
CodeGenTarget Target(Records);
|
2004-08-15 06:50:53 +08:00
|
|
|
Record *AsmWriter = Target.getAsmWriter();
|
2004-10-04 04:19:02 +08:00
|
|
|
std::string ClassName = AsmWriter->getValueAsString("AsmWriterClassName");
|
2010-09-30 09:29:54 +08:00
|
|
|
bool isMC = AsmWriter->getValueAsBit("isMCAsmWriter");
|
|
|
|
const char *MachineInstrClassName = isMC ? "MCInst" : "MachineInstr";
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2004-08-01 13:59:33 +08:00
|
|
|
O <<
|
|
|
|
"/// printInstruction - This method is automatically generated by tablegen\n"
|
2009-09-14 04:08:00 +08:00
|
|
|
"/// from the instruction set description.\n"
|
2009-08-08 09:32:19 +08:00
|
|
|
"void " << Target.getName() << ClassName
|
2010-09-30 09:29:54 +08:00
|
|
|
<< "::printInstruction(const " << MachineInstrClassName
|
|
|
|
<< " *MI, raw_ostream &O) {\n";
|
2004-08-01 13:59:33 +08:00
|
|
|
|
2005-01-23 01:40:38 +08:00
|
|
|
std::vector<AsmWriterInst> Instructions;
|
|
|
|
|
2004-08-01 13:59:33 +08:00
|
|
|
for (CodeGenTarget::inst_iterator I = Target.inst_begin(),
|
|
|
|
E = Target.inst_end(); I != E; ++I)
|
2010-03-19 09:00:55 +08:00
|
|
|
if (!(*I)->AsmString.empty() &&
|
|
|
|
(*I)->TheDef->getName() != "PHI")
|
2010-02-10 07:06:35 +08:00
|
|
|
Instructions.push_back(
|
2010-09-30 06:32:50 +08:00
|
|
|
AsmWriterInst(**I,
|
2010-02-10 07:06:35 +08:00
|
|
|
AsmWriter->getValueAsInt("Variant"),
|
|
|
|
AsmWriter->getValueAsInt("FirstOperandColumn"),
|
|
|
|
AsmWriter->getValueAsInt("OperandSpacing")));
|
2005-01-23 01:40:38 +08:00
|
|
|
|
2006-07-19 01:18:03 +08:00
|
|
|
// Get the instruction numbering.
|
2010-03-19 08:34:35 +08:00
|
|
|
NumberedInstructions = Target.getInstructionsByEnumValue();
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-15 06:59:11 +08:00
|
|
|
// Compute the CodeGenInstruction -> AsmWriterInst mapping. Note that not
|
|
|
|
// all machine instructions are necessarily being printed, so there may be
|
|
|
|
// target instructions not in this map.
|
|
|
|
for (unsigned i = 0, e = Instructions.size(); i != e; ++i)
|
|
|
|
CGIAWIMap.insert(std::make_pair(Instructions[i].CGI, &Instructions[i]));
|
|
|
|
|
|
|
|
// Build an aggregate string, and build a table of offsets into it.
|
2009-09-14 09:16:36 +08:00
|
|
|
StringToOffsetTable StringTable;
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-09-28 00:44:09 +08:00
|
|
|
/// OpcodeInfo - This encodes the index of the string to use for the first
|
2006-07-19 01:32:27 +08:00
|
|
|
/// chunk of the output as well as indices used for operand printing.
|
|
|
|
std::vector<unsigned> OpcodeInfo;
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 01:32:27 +08:00
|
|
|
unsigned MaxStringIdx = 0;
|
2006-07-15 06:59:11 +08:00
|
|
|
for (unsigned i = 0, e = NumberedInstructions.size(); i != e; ++i) {
|
|
|
|
AsmWriterInst *AWI = CGIAWIMap[NumberedInstructions[i]];
|
|
|
|
unsigned Idx;
|
2006-07-19 09:39:06 +08:00
|
|
|
if (AWI == 0) {
|
2006-07-15 06:59:11 +08:00
|
|
|
// Something not handled by the asmwriter printer.
|
2009-09-14 09:16:36 +08:00
|
|
|
Idx = ~0U;
|
2010-09-30 06:32:50 +08:00
|
|
|
} else if (AWI->Operands[0].OperandType !=
|
2006-07-19 09:39:06 +08:00
|
|
|
AsmWriterOperand::isLiteralTextOperand ||
|
|
|
|
AWI->Operands[0].Str.empty()) {
|
|
|
|
// Something handled by the asmwriter printer, but with no leading string.
|
2009-09-14 09:16:36 +08:00
|
|
|
Idx = StringTable.GetOrAddStringOffset("");
|
2006-07-15 06:59:11 +08:00
|
|
|
} else {
|
2009-09-14 09:16:36 +08:00
|
|
|
std::string Str = AWI->Operands[0].Str;
|
|
|
|
UnescapeString(Str);
|
|
|
|
Idx = StringTable.GetOrAddStringOffset(Str);
|
|
|
|
MaxStringIdx = std::max(MaxStringIdx, Idx);
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-15 06:59:11 +08:00
|
|
|
// Nuke the string from the operand list. It is now handled!
|
|
|
|
AWI->Operands.erase(AWI->Operands.begin());
|
|
|
|
}
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2009-09-14 09:16:36 +08:00
|
|
|
// Bias offset by one since we want 0 as a sentinel.
|
|
|
|
OpcodeInfo.push_back(Idx+1);
|
2006-07-19 01:18:03 +08:00
|
|
|
}
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 01:32:27 +08:00
|
|
|
// Figure out how many bits we used for the string index.
|
2009-09-14 09:16:36 +08:00
|
|
|
unsigned AsmStrBits = Log2_32_Ceil(MaxStringIdx+2);
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 01:18:03 +08:00
|
|
|
// To reduce code size, we compactify common instructions into a few bits
|
|
|
|
// in the opcode-indexed table.
|
2006-07-19 01:38:46 +08:00
|
|
|
unsigned BitsLeft = 32-AsmStrBits;
|
2006-07-19 01:18:03 +08:00
|
|
|
|
|
|
|
std::vector<std::vector<std::string> > TableDrivenOperandPrinters;
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 01:56:07 +08:00
|
|
|
while (1) {
|
2006-07-19 01:18:03 +08:00
|
|
|
std::vector<std::string> UniqueOperandCommands;
|
|
|
|
std::vector<unsigned> InstIdxs;
|
2006-07-19 02:28:27 +08:00
|
|
|
std::vector<unsigned> NumInstOpsHandled;
|
|
|
|
FindUniqueOperandCommands(UniqueOperandCommands, InstIdxs,
|
|
|
|
NumInstOpsHandled);
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 01:18:03 +08:00
|
|
|
// If we ran out of operands to print, we're done.
|
|
|
|
if (UniqueOperandCommands.empty()) break;
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 01:18:03 +08:00
|
|
|
// Compute the number of bits we need to represent these cases, this is
|
|
|
|
// ceil(log2(numentries)).
|
|
|
|
unsigned NumBits = Log2_32_Ceil(UniqueOperandCommands.size());
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 01:18:03 +08:00
|
|
|
// If we don't have enough bits for this operand, don't include it.
|
|
|
|
if (NumBits > BitsLeft) {
|
2009-08-23 12:44:11 +08:00
|
|
|
DEBUG(errs() << "Not enough bits to densely encode " << NumBits
|
|
|
|
<< " more bits\n");
|
2006-07-19 01:18:03 +08:00
|
|
|
break;
|
|
|
|
}
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 01:18:03 +08:00
|
|
|
// Otherwise, we can include this in the initial lookup table. Add it in.
|
|
|
|
BitsLeft -= NumBits;
|
|
|
|
for (unsigned i = 0, e = InstIdxs.size(); i != e; ++i)
|
2006-07-19 03:27:30 +08:00
|
|
|
if (InstIdxs[i] != ~0U)
|
|
|
|
OpcodeInfo[i] |= InstIdxs[i] << (BitsLeft+AsmStrBits);
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 01:56:07 +08:00
|
|
|
// Remove the info about this operand.
|
|
|
|
for (unsigned i = 0, e = NumberedInstructions.size(); i != e; ++i) {
|
|
|
|
if (AsmWriterInst *Inst = getAsmWriterInstByID(i))
|
2006-07-19 02:28:27 +08:00
|
|
|
if (!Inst->Operands.empty()) {
|
|
|
|
unsigned NumOps = NumInstOpsHandled[InstIdxs[i]];
|
2006-07-19 03:06:01 +08:00
|
|
|
assert(NumOps <= Inst->Operands.size() &&
|
|
|
|
"Can't remove this many ops!");
|
2006-07-19 02:28:27 +08:00
|
|
|
Inst->Operands.erase(Inst->Operands.begin(),
|
|
|
|
Inst->Operands.begin()+NumOps);
|
|
|
|
}
|
2006-07-19 01:56:07 +08:00
|
|
|
}
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 01:56:07 +08:00
|
|
|
// Remember the handlers for this set of operands.
|
2006-07-19 01:18:03 +08:00
|
|
|
TableDrivenOperandPrinters.push_back(UniqueOperandCommands);
|
|
|
|
}
|
2010-09-30 06:32:50 +08:00
|
|
|
|
|
|
|
|
|
|
|
|
2006-07-19 01:32:27 +08:00
|
|
|
O<<" static const unsigned OpInfo[] = {\n";
|
2006-07-19 01:18:03 +08:00
|
|
|
for (unsigned i = 0, e = NumberedInstructions.size(); i != e; ++i) {
|
2006-07-19 01:38:46 +08:00
|
|
|
O << " " << OpcodeInfo[i] << "U,\t// "
|
2006-07-19 01:32:27 +08:00
|
|
|
<< NumberedInstructions[i]->TheDef->getName() << "\n";
|
2006-07-15 06:59:11 +08:00
|
|
|
}
|
2006-07-19 01:18:03 +08:00
|
|
|
// Add a dummy entry so the array init doesn't end with a comma.
|
2006-07-19 01:32:27 +08:00
|
|
|
O << " 0U\n";
|
2006-07-15 06:59:11 +08:00
|
|
|
O << " };\n\n";
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-15 06:59:11 +08:00
|
|
|
// Emit the string itself.
|
2009-09-14 09:16:36 +08:00
|
|
|
O << " const char *AsmStrs = \n";
|
|
|
|
StringTable.EmitString(O);
|
|
|
|
O << ";\n\n";
|
2006-07-15 06:59:11 +08:00
|
|
|
|
2008-02-02 16:39:46 +08:00
|
|
|
O << " O << \"\\t\";\n\n";
|
|
|
|
|
2006-07-15 06:59:11 +08:00
|
|
|
O << " // Emit the opcode for the instruction.\n"
|
2006-07-19 01:32:27 +08:00
|
|
|
<< " unsigned Bits = OpInfo[MI->getOpcode()];\n"
|
2009-08-08 09:32:19 +08:00
|
|
|
<< " assert(Bits != 0 && \"Cannot print this instruction.\");\n"
|
2009-09-14 09:16:36 +08:00
|
|
|
<< " O << AsmStrs+(Bits & " << (1 << AsmStrBits)-1 << ")-1;\n\n";
|
2009-08-06 05:00:52 +08:00
|
|
|
|
2006-07-19 01:18:03 +08:00
|
|
|
// Output the table driven operand information.
|
2006-07-19 01:38:46 +08:00
|
|
|
BitsLeft = 32-AsmStrBits;
|
2006-07-19 01:18:03 +08:00
|
|
|
for (unsigned i = 0, e = TableDrivenOperandPrinters.size(); i != e; ++i) {
|
|
|
|
std::vector<std::string> &Commands = TableDrivenOperandPrinters[i];
|
2005-01-23 03:22:23 +08:00
|
|
|
|
2006-07-19 01:18:03 +08:00
|
|
|
// Compute the number of bits we need to represent these cases, this is
|
|
|
|
// ceil(log2(numentries)).
|
|
|
|
unsigned NumBits = Log2_32_Ceil(Commands.size());
|
|
|
|
assert(NumBits <= BitsLeft && "consistency error");
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 01:18:03 +08:00
|
|
|
// Emit code to extract this field from Bits.
|
|
|
|
BitsLeft -= NumBits;
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 01:18:03 +08:00
|
|
|
O << "\n // Fragment " << i << " encoded into " << NumBits
|
2006-07-19 01:43:54 +08:00
|
|
|
<< " bits for " << Commands.size() << " unique commands.\n";
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 02:28:27 +08:00
|
|
|
if (Commands.size() == 2) {
|
2006-07-19 01:43:54 +08:00
|
|
|
// Emit two possibilitys with if/else.
|
|
|
|
O << " if ((Bits >> " << (BitsLeft+AsmStrBits) << ") & "
|
|
|
|
<< ((1 << NumBits)-1) << ") {\n"
|
|
|
|
<< Commands[1]
|
|
|
|
<< " } else {\n"
|
|
|
|
<< Commands[0]
|
|
|
|
<< " }\n\n";
|
2010-09-19 02:50:27 +08:00
|
|
|
} else if (Commands.size() == 1) {
|
|
|
|
// Emit a single possibility.
|
|
|
|
O << Commands[0] << "\n\n";
|
2006-07-19 01:43:54 +08:00
|
|
|
} else {
|
|
|
|
O << " switch ((Bits >> " << (BitsLeft+AsmStrBits) << ") & "
|
|
|
|
<< ((1 << NumBits)-1) << ") {\n"
|
|
|
|
<< " default: // unreachable.\n";
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 01:43:54 +08:00
|
|
|
// Print out all the cases.
|
|
|
|
for (unsigned i = 0, e = Commands.size(); i != e; ++i) {
|
|
|
|
O << " case " << i << ":\n";
|
|
|
|
O << Commands[i];
|
|
|
|
O << " break;\n";
|
|
|
|
}
|
|
|
|
O << " }\n\n";
|
2006-07-19 01:18:03 +08:00
|
|
|
}
|
|
|
|
}
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 01:56:07 +08:00
|
|
|
// Okay, delete instructions with no operand info left.
|
2006-07-19 01:18:03 +08:00
|
|
|
for (unsigned i = 0, e = Instructions.size(); i != e; ++i) {
|
|
|
|
// Entire instruction has been emitted?
|
|
|
|
AsmWriterInst &Inst = Instructions[i];
|
2006-07-19 01:56:07 +08:00
|
|
|
if (Inst.Operands.empty()) {
|
2006-07-19 01:18:03 +08:00
|
|
|
Instructions.erase(Instructions.begin()+i);
|
2006-07-19 01:56:07 +08:00
|
|
|
--i; --e;
|
2006-07-19 01:18:03 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2006-07-19 01:18:03 +08:00
|
|
|
// Because this is a vector, we want to emit from the end. Reverse all of the
|
Implement factoring of instruction pattern strings. In particular, instead of
emitting code like this:
case PPC::ADD: O << "add "; printOperand(MI, 0, MVT::i64); O << ", "; prin
tOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '\n
'; break;
case PPC::ADDC: O << "addc "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
case PPC::ADDE: O << "adde "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
...
Emit code like this:
case PPC::ADD:
case PPC::ADDC:
case PPC::ADDE:
...
switch (MI->getOpcode()) {
case PPC::ADD: O << "add "; break;
case PPC::ADDC: O << "addc "; break;
case PPC::ADDE: O << "adde "; break;
...
}
printOperand(MI, 0, MVT::i64);
O << ", ";
printOperand(MI, 1, MVT::i64);
O << ", ";
printOperand(MI, 2, MVT::i64);
O << "\n";
break;
This shrinks the PPC asm writer from 24785->15205 bytes (even though the new
asmwriter has much more whitespace than the old one), and the X86 printers shrink
quite a bit too. The important implication of this is that GCC no longer hits swap
when building the PPC backend in optimized mode. Thus this fixes PR448.
-Chris
llvm-svn: 19755
2005-01-23 02:38:13 +08:00
|
|
|
// elements in the vector.
|
|
|
|
std::reverse(Instructions.begin(), Instructions.end());
|
2010-09-30 06:32:50 +08:00
|
|
|
|
|
|
|
|
2009-09-19 02:10:19 +08:00
|
|
|
// Now that we've emitted all of the operand info that fit into 32 bits, emit
|
|
|
|
// information for those instructions that are left. This is a less dense
|
|
|
|
// encoding, but we expect the main 32-bit table to handle the majority of
|
|
|
|
// instructions.
|
2006-07-19 01:38:46 +08:00
|
|
|
if (!Instructions.empty()) {
|
|
|
|
// Find the opcode # of inline asm.
|
|
|
|
O << " switch (MI->getOpcode()) {\n";
|
|
|
|
while (!Instructions.empty())
|
|
|
|
EmitInstructions(Instructions, O);
|
Implement factoring of instruction pattern strings. In particular, instead of
emitting code like this:
case PPC::ADD: O << "add "; printOperand(MI, 0, MVT::i64); O << ", "; prin
tOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '\n
'; break;
case PPC::ADDC: O << "addc "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
case PPC::ADDE: O << "adde "; printOperand(MI, 0, MVT::i64); O << ", "; pr
intOperand(MI, 1, MVT::i64); O << ", "; printOperand(MI, 2, MVT::i64); O << '
\n'; break;
...
Emit code like this:
case PPC::ADD:
case PPC::ADDC:
case PPC::ADDE:
...
switch (MI->getOpcode()) {
case PPC::ADD: O << "add "; break;
case PPC::ADDC: O << "addc "; break;
case PPC::ADDE: O << "adde "; break;
...
}
printOperand(MI, 0, MVT::i64);
O << ", ";
printOperand(MI, 1, MVT::i64);
O << ", ";
printOperand(MI, 2, MVT::i64);
O << "\n";
break;
This shrinks the PPC asm writer from 24785->15205 bytes (even though the new
asmwriter has much more whitespace than the old one), and the X86 printers shrink
quite a bit too. The important implication of this is that GCC no longer hits swap
when building the PPC backend in optimized mode. Thus this fixes PR448.
-Chris
llvm-svn: 19755
2005-01-23 02:38:13 +08:00
|
|
|
|
2006-07-19 01:38:46 +08:00
|
|
|
O << " }\n";
|
2009-08-08 09:32:19 +08:00
|
|
|
O << " return;\n";
|
2006-07-19 01:38:46 +08:00
|
|
|
}
|
2009-07-30 04:10:24 +08:00
|
|
|
|
2006-07-19 03:06:01 +08:00
|
|
|
O << "}\n";
|
2004-08-01 13:59:33 +08:00
|
|
|
}
|
2009-09-14 04:08:00 +08:00
|
|
|
|
|
|
|
|
|
|
|
void AsmWriterEmitter::EmitGetRegisterName(raw_ostream &O) {
|
2010-12-13 08:23:57 +08:00
|
|
|
CodeGenTarget Target(Records);
|
2009-09-14 04:08:00 +08:00
|
|
|
Record *AsmWriter = Target.getAsmWriter();
|
|
|
|
std::string ClassName = AsmWriter->getValueAsString("AsmWriterClassName");
|
|
|
|
const std::vector<CodeGenRegister> &Registers = Target.getRegisters();
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2009-09-14 09:26:18 +08:00
|
|
|
StringToOffsetTable StringTable;
|
2009-09-14 04:08:00 +08:00
|
|
|
O <<
|
|
|
|
"\n\n/// getRegisterName - This method is automatically generated by tblgen\n"
|
|
|
|
"/// from the register set description. This returns the assembler name\n"
|
|
|
|
"/// for the specified register.\n"
|
|
|
|
"const char *" << Target.getName() << ClassName
|
2009-09-14 04:19:22 +08:00
|
|
|
<< "::getRegisterName(unsigned RegNo) {\n"
|
2009-09-14 04:08:00 +08:00
|
|
|
<< " assert(RegNo && RegNo < " << (Registers.size()+1)
|
|
|
|
<< " && \"Invalid register number!\");\n"
|
|
|
|
<< "\n"
|
2009-09-14 09:27:50 +08:00
|
|
|
<< " static const unsigned RegAsmOffset[] = {";
|
2009-09-14 04:08:00 +08:00
|
|
|
for (unsigned i = 0, e = Registers.size(); i != e; ++i) {
|
|
|
|
const CodeGenRegister &Reg = Registers[i];
|
|
|
|
|
|
|
|
std::string AsmName = Reg.TheDef->getValueAsString("AsmName");
|
|
|
|
if (AsmName.empty())
|
|
|
|
AsmName = Reg.getName();
|
2010-09-30 06:32:50 +08:00
|
|
|
|
|
|
|
|
2009-09-14 09:27:50 +08:00
|
|
|
if ((i % 14) == 0)
|
2009-09-14 09:26:18 +08:00
|
|
|
O << "\n ";
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2009-09-14 09:26:18 +08:00
|
|
|
O << StringTable.GetOrAddStringOffset(AsmName) << ", ";
|
2009-09-14 04:08:00 +08:00
|
|
|
}
|
2009-09-14 09:26:18 +08:00
|
|
|
O << "0\n"
|
2009-09-14 04:08:00 +08:00
|
|
|
<< " };\n"
|
2009-09-14 09:26:18 +08:00
|
|
|
<< "\n";
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2009-09-14 09:26:18 +08:00
|
|
|
O << " const char *AsmStrs =\n";
|
|
|
|
StringTable.EmitString(O);
|
|
|
|
O << ";\n";
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2009-09-14 09:26:18 +08:00
|
|
|
O << " return AsmStrs+RegAsmOffset[RegNo-1];\n"
|
2009-09-14 04:08:00 +08:00
|
|
|
<< "}\n";
|
|
|
|
}
|
|
|
|
|
2010-02-12 06:57:32 +08:00
|
|
|
void AsmWriterEmitter::EmitGetInstructionName(raw_ostream &O) {
|
2010-12-13 08:23:57 +08:00
|
|
|
CodeGenTarget Target(Records);
|
2010-02-12 06:57:32 +08:00
|
|
|
Record *AsmWriter = Target.getAsmWriter();
|
|
|
|
std::string ClassName = AsmWriter->getValueAsString("AsmWriterClassName");
|
|
|
|
|
2010-03-19 08:34:35 +08:00
|
|
|
const std::vector<const CodeGenInstruction*> &NumberedInstructions =
|
|
|
|
Target.getInstructionsByEnumValue();
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2010-02-12 06:57:32 +08:00
|
|
|
StringToOffsetTable StringTable;
|
|
|
|
O <<
|
|
|
|
"\n\n#ifdef GET_INSTRUCTION_NAME\n"
|
|
|
|
"#undef GET_INSTRUCTION_NAME\n\n"
|
|
|
|
"/// getInstructionName: This method is automatically generated by tblgen\n"
|
|
|
|
"/// from the instruction set description. This returns the enum name of the\n"
|
|
|
|
"/// specified instruction.\n"
|
|
|
|
"const char *" << Target.getName() << ClassName
|
|
|
|
<< "::getInstructionName(unsigned Opcode) {\n"
|
|
|
|
<< " assert(Opcode < " << NumberedInstructions.size()
|
|
|
|
<< " && \"Invalid instruction number!\");\n"
|
|
|
|
<< "\n"
|
|
|
|
<< " static const unsigned InstAsmOffset[] = {";
|
|
|
|
for (unsigned i = 0, e = NumberedInstructions.size(); i != e; ++i) {
|
|
|
|
const CodeGenInstruction &Inst = *NumberedInstructions[i];
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2010-02-12 06:57:32 +08:00
|
|
|
std::string AsmName = Inst.TheDef->getName();
|
|
|
|
if ((i % 14) == 0)
|
|
|
|
O << "\n ";
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2010-02-12 06:57:32 +08:00
|
|
|
O << StringTable.GetOrAddStringOffset(AsmName) << ", ";
|
|
|
|
}
|
|
|
|
O << "0\n"
|
|
|
|
<< " };\n"
|
|
|
|
<< "\n";
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2010-02-12 06:57:32 +08:00
|
|
|
O << " const char *Strs =\n";
|
|
|
|
StringTable.EmitString(O);
|
|
|
|
O << ";\n";
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2010-02-12 06:57:32 +08:00
|
|
|
O << " return Strs+InstAsmOffset[Opcode];\n"
|
|
|
|
<< "}\n\n#endif\n";
|
|
|
|
}
|
|
|
|
|
2011-03-21 16:31:53 +08:00
|
|
|
namespace {
|
2011-02-26 11:09:12 +08:00
|
|
|
|
2011-03-21 16:31:53 +08:00
|
|
|
/// SubtargetFeatureInfo - Helper class for storing information on a subtarget
|
|
|
|
/// feature which participates in instruction matching.
|
|
|
|
struct SubtargetFeatureInfo {
|
|
|
|
/// \brief The predicate record for this feature.
|
|
|
|
const Record *TheDef;
|
|
|
|
|
|
|
|
/// \brief An unique index assigned to represent this feature.
|
|
|
|
unsigned Index;
|
|
|
|
|
|
|
|
SubtargetFeatureInfo(const Record *D, unsigned Idx) : TheDef(D), Index(Idx) {}
|
|
|
|
|
|
|
|
/// \brief The name of the enumerated constant identifying this feature.
|
|
|
|
std::string getEnumName() const {
|
|
|
|
return "Feature_" + TheDef->getName();
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
struct AsmWriterInfo {
|
|
|
|
/// Map of Predicate records to their subtarget information.
|
|
|
|
std::map<const Record*, SubtargetFeatureInfo*> SubtargetFeatures;
|
|
|
|
|
|
|
|
/// getSubtargetFeature - Lookup or create the subtarget feature info for the
|
|
|
|
/// given operand.
|
|
|
|
SubtargetFeatureInfo *getSubtargetFeature(const Record *Def) const {
|
|
|
|
assert(Def->isSubClassOf("Predicate") && "Invalid predicate type!");
|
|
|
|
std::map<const Record*, SubtargetFeatureInfo*>::const_iterator I =
|
|
|
|
SubtargetFeatures.find(Def);
|
|
|
|
return I == SubtargetFeatures.end() ? 0 : I->second;
|
|
|
|
}
|
|
|
|
|
|
|
|
void addReqFeatures(const std::vector<Record*> &Features) {
|
|
|
|
for (std::vector<Record*>::const_iterator
|
|
|
|
I = Features.begin(), E = Features.end(); I != E; ++I) {
|
|
|
|
const Record *Pred = *I;
|
|
|
|
|
|
|
|
// Ignore predicates that are not intended for the assembler.
|
|
|
|
if (!Pred->getValueAsBit("AssemblerMatcherPredicate"))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (Pred->getName().empty())
|
|
|
|
throw TGError(Pred->getLoc(), "Predicate has no name!");
|
|
|
|
|
|
|
|
// Don't add the predicate again.
|
|
|
|
if (getSubtargetFeature(Pred))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
unsigned FeatureNo = SubtargetFeatures.size();
|
|
|
|
SubtargetFeatures[Pred] = new SubtargetFeatureInfo(Pred, FeatureNo);
|
|
|
|
assert(FeatureNo < 32 && "Too many subtarget features!");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
const SubtargetFeatureInfo *getFeatureInfo(const Record *R) {
|
|
|
|
return SubtargetFeatures[R];
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2011-03-21 16:40:31 +08:00
|
|
|
// IAPrinter - Holds information about an InstAlias. Two InstAliases match if
|
|
|
|
// they both have the same conditionals. In which case, we cannot print out the
|
|
|
|
// alias for that pattern.
|
|
|
|
class IAPrinter {
|
|
|
|
AsmWriterInfo &AWI;
|
|
|
|
std::vector<std::string> Conds;
|
|
|
|
std::map<StringRef, unsigned> OpMap;
|
|
|
|
std::string Result;
|
|
|
|
std::string AsmString;
|
|
|
|
std::vector<Record*> ReqFeatures;
|
|
|
|
public:
|
|
|
|
IAPrinter(AsmWriterInfo &Info, std::string R, std::string AS)
|
|
|
|
: AWI(Info), Result(R), AsmString(AS) {}
|
|
|
|
|
|
|
|
void addCond(const std::string &C) { Conds.push_back(C); }
|
|
|
|
void addReqFeatures(const std::vector<Record*> &Features) {
|
|
|
|
AWI.addReqFeatures(Features);
|
|
|
|
ReqFeatures = Features;
|
|
|
|
}
|
|
|
|
|
|
|
|
void addOperand(StringRef Op, unsigned Idx) { OpMap[Op] = Idx; }
|
|
|
|
unsigned getOpIndex(StringRef Op) { return OpMap[Op]; }
|
|
|
|
bool isOpMapped(StringRef Op) { return OpMap.find(Op) != OpMap.end(); }
|
|
|
|
|
2011-04-08 12:08:57 +08:00
|
|
|
bool print(raw_ostream &O) {
|
2011-04-08 05:20:06 +08:00
|
|
|
if (Conds.empty() && ReqFeatures.empty()) {
|
|
|
|
O.indent(6) << "return true;\n";
|
2011-04-08 12:08:57 +08:00
|
|
|
return false;
|
2011-04-08 05:20:06 +08:00
|
|
|
}
|
2011-03-21 16:59:17 +08:00
|
|
|
|
2011-04-08 05:20:06 +08:00
|
|
|
O << "if (";
|
2011-03-21 16:40:31 +08:00
|
|
|
|
|
|
|
for (std::vector<std::string>::iterator
|
|
|
|
I = Conds.begin(), E = Conds.end(); I != E; ++I) {
|
|
|
|
if (I != Conds.begin()) {
|
|
|
|
O << " &&\n";
|
2011-04-08 05:20:06 +08:00
|
|
|
O.indent(8);
|
2011-03-21 16:40:31 +08:00
|
|
|
}
|
2011-03-21 16:59:17 +08:00
|
|
|
|
2011-03-21 16:40:31 +08:00
|
|
|
O << *I;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!ReqFeatures.empty()) {
|
2011-04-08 05:20:06 +08:00
|
|
|
if (Conds.begin() != Conds.end()) {
|
2011-03-21 16:59:17 +08:00
|
|
|
O << " &&\n";
|
2011-04-08 05:20:06 +08:00
|
|
|
O.indent(8);
|
|
|
|
} else {
|
2011-03-21 16:59:17 +08:00
|
|
|
O << "if (";
|
2011-04-08 05:20:06 +08:00
|
|
|
}
|
2011-03-21 16:59:17 +08:00
|
|
|
|
2011-03-21 16:40:31 +08:00
|
|
|
std::string Req;
|
|
|
|
raw_string_ostream ReqO(Req);
|
|
|
|
|
|
|
|
for (std::vector<Record*>::iterator
|
|
|
|
I = ReqFeatures.begin(), E = ReqFeatures.end(); I != E; ++I) {
|
|
|
|
if (I != ReqFeatures.begin()) ReqO << " | ";
|
|
|
|
ReqO << AWI.getFeatureInfo(*I)->getEnumName();
|
|
|
|
}
|
|
|
|
|
|
|
|
O << "(AvailableFeatures & (" << ReqO.str() << ")) == ("
|
|
|
|
<< ReqO.str() << ')';
|
|
|
|
}
|
|
|
|
|
2011-04-08 05:20:06 +08:00
|
|
|
O << ") {\n";
|
|
|
|
O.indent(6) << "// " << Result << "\n";
|
|
|
|
O.indent(6) << "AsmString = \"" << AsmString << "\";\n";
|
2011-03-21 16:40:31 +08:00
|
|
|
|
|
|
|
for (std::map<StringRef, unsigned>::iterator
|
|
|
|
I = OpMap.begin(), E = OpMap.end(); I != E; ++I)
|
2011-05-23 08:18:33 +08:00
|
|
|
O.indent(6) << "OpMap.push_back(std::make_pair(\"" << I->first << "\", "
|
|
|
|
<< I->second << "));\n";
|
2011-03-21 16:40:31 +08:00
|
|
|
|
2011-04-08 05:20:06 +08:00
|
|
|
O.indent(6) << "break;\n";
|
|
|
|
O.indent(4) << '}';
|
2011-04-08 12:08:57 +08:00
|
|
|
return !ReqFeatures.empty();
|
2011-03-21 16:40:31 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
bool operator==(const IAPrinter &RHS) {
|
|
|
|
if (Conds.size() != RHS.Conds.size())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
unsigned Idx = 0;
|
|
|
|
for (std::vector<std::string>::iterator
|
|
|
|
I = Conds.begin(), E = Conds.end(); I != E; ++I)
|
|
|
|
if (*I != RHS.Conds[Idx++])
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool operator()(const IAPrinter &RHS) {
|
|
|
|
if (Conds.size() < RHS.Conds.size())
|
|
|
|
return true;
|
|
|
|
|
|
|
|
unsigned Idx = 0;
|
|
|
|
for (std::vector<std::string>::iterator
|
|
|
|
I = Conds.begin(), E = Conds.end(); I != E; ++I)
|
|
|
|
if (*I != RHS.Conds[Idx++])
|
|
|
|
return *I < RHS.Conds[Idx++];
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2011-03-21 16:31:53 +08:00
|
|
|
} // end anonymous namespace
|
|
|
|
|
|
|
|
/// EmitSubtargetFeatureFlagEnumeration - Emit the subtarget feature flag
|
|
|
|
/// definitions.
|
|
|
|
static void EmitSubtargetFeatureFlagEnumeration(AsmWriterInfo &Info,
|
|
|
|
raw_ostream &O) {
|
|
|
|
O << "namespace {\n\n";
|
|
|
|
O << "// Flags for subtarget features that participate in "
|
|
|
|
<< "alias instruction matching.\n";
|
|
|
|
O << "enum SubtargetFeatureFlag {\n";
|
|
|
|
|
|
|
|
for (std::map<const Record*, SubtargetFeatureInfo*>::const_iterator
|
|
|
|
I = Info.SubtargetFeatures.begin(),
|
|
|
|
E = Info.SubtargetFeatures.end(); I != E; ++I) {
|
|
|
|
SubtargetFeatureInfo &SFI = *I->second;
|
|
|
|
O << " " << SFI.getEnumName() << " = (1 << " << SFI.Index << "),\n";
|
|
|
|
}
|
|
|
|
|
|
|
|
O << " Feature_None = 0\n";
|
|
|
|
O << "};\n\n";
|
2011-04-08 05:20:06 +08:00
|
|
|
O << "} // end anonymous namespace\n\n";
|
2011-03-21 16:31:53 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/// EmitComputeAvailableFeatures - Emit the function to compute the list of
|
|
|
|
/// available features given a subtarget.
|
|
|
|
static void EmitComputeAvailableFeatures(AsmWriterInfo &Info,
|
|
|
|
Record *AsmWriter,
|
|
|
|
CodeGenTarget &Target,
|
|
|
|
raw_ostream &O) {
|
|
|
|
std::string ClassName = AsmWriter->getValueAsString("AsmWriterClassName");
|
|
|
|
|
|
|
|
O << "unsigned " << Target.getName() << ClassName << "::\n"
|
|
|
|
<< "ComputeAvailableFeatures(const " << Target.getName()
|
|
|
|
<< "Subtarget *Subtarget) const {\n";
|
|
|
|
O << " unsigned Features = 0;\n";
|
|
|
|
|
|
|
|
for (std::map<const Record*, SubtargetFeatureInfo*>::const_iterator
|
|
|
|
I = Info.SubtargetFeatures.begin(),
|
|
|
|
E = Info.SubtargetFeatures.end(); I != E; ++I) {
|
|
|
|
SubtargetFeatureInfo &SFI = *I->second;
|
|
|
|
O << " if (" << SFI.TheDef->getValueAsString("CondString")
|
|
|
|
<< ")\n";
|
|
|
|
O << " Features |= " << SFI.getEnumName() << ";\n";
|
|
|
|
}
|
|
|
|
|
|
|
|
O << " return Features;\n";
|
|
|
|
O << "}\n\n";
|
|
|
|
}
|
|
|
|
|
2011-05-23 08:18:33 +08:00
|
|
|
static void EmitGetMapOperandNumber(raw_ostream &O) {
|
|
|
|
O << "static unsigned getMapOperandNumber("
|
|
|
|
<< "const SmallVectorImpl<std::pair<StringRef, unsigned> > &OpMap,\n";
|
|
|
|
O << " StringRef Name) {\n";
|
|
|
|
O << " for (SmallVectorImpl<std::pair<StringRef, unsigned> >::"
|
|
|
|
<< "const_iterator\n";
|
|
|
|
O << " I = OpMap.begin(), E = OpMap.end(); I != E; ++I)\n";
|
|
|
|
O << " if (I->first == Name)\n";
|
|
|
|
O << " return I->second;\n";
|
|
|
|
O << " assert(false && \"Operand not in map!\");\n";
|
|
|
|
O << " return 0;\n";
|
|
|
|
O << "}\n\n";
|
|
|
|
}
|
|
|
|
|
2011-03-21 16:31:53 +08:00
|
|
|
void AsmWriterEmitter::EmitRegIsInRegClass(raw_ostream &O) {
|
|
|
|
CodeGenTarget Target(Records);
|
2011-02-26 11:09:12 +08:00
|
|
|
|
|
|
|
// Enumerate the register classes.
|
|
|
|
const std::vector<CodeGenRegisterClass> &RegisterClasses =
|
|
|
|
Target.getRegisterClasses();
|
|
|
|
|
|
|
|
O << "namespace { // Register classes\n";
|
|
|
|
O << " enum RegClass {\n";
|
|
|
|
|
|
|
|
// Emit the register enum value for each RegisterClass.
|
|
|
|
for (unsigned I = 0, E = RegisterClasses.size(); I != E; ++I) {
|
|
|
|
if (I != 0) O << ",\n";
|
|
|
|
O << " RC_" << RegisterClasses[I].TheDef->getName();
|
|
|
|
}
|
|
|
|
|
|
|
|
O << "\n };\n";
|
|
|
|
O << "} // end anonymous namespace\n\n";
|
|
|
|
|
|
|
|
// Emit a function that returns 'true' if a regsiter is part of a particular
|
|
|
|
// register class. I.e., RAX is part of GR64 on X86.
|
|
|
|
O << "static bool regIsInRegisterClass"
|
|
|
|
<< "(unsigned RegClass, unsigned Reg) {\n";
|
|
|
|
|
|
|
|
// Emit the switch that checks if a register belongs to a particular register
|
|
|
|
// class.
|
|
|
|
O << " switch (RegClass) {\n";
|
|
|
|
O << " default: break;\n";
|
|
|
|
|
|
|
|
for (unsigned I = 0, E = RegisterClasses.size(); I != E; ++I) {
|
|
|
|
const CodeGenRegisterClass &RC = RegisterClasses[I];
|
|
|
|
|
|
|
|
// Give the register class a legal C name if it's anonymous.
|
|
|
|
std::string Name = RC.TheDef->getName();
|
|
|
|
O << " case RC_" << Name << ":\n";
|
|
|
|
|
|
|
|
// Emit the register list now.
|
|
|
|
unsigned IE = RC.Elements.size();
|
|
|
|
if (IE == 1) {
|
|
|
|
O << " if (Reg == " << getQualifiedName(RC.Elements[0]) << ")\n";
|
|
|
|
O << " return true;\n";
|
|
|
|
} else {
|
|
|
|
O << " switch (Reg) {\n";
|
|
|
|
O << " default: break;\n";
|
|
|
|
|
|
|
|
for (unsigned II = 0; II != IE; ++II) {
|
|
|
|
Record *Reg = RC.Elements[II];
|
|
|
|
O << " case " << getQualifiedName(Reg) << ":\n";
|
|
|
|
}
|
|
|
|
|
|
|
|
O << " return true;\n";
|
|
|
|
O << " }\n";
|
|
|
|
}
|
|
|
|
|
|
|
|
O << " break;\n";
|
|
|
|
}
|
|
|
|
|
|
|
|
O << " }\n\n";
|
|
|
|
O << " return false;\n";
|
|
|
|
O << "}\n\n";
|
2011-03-21 16:31:53 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void AsmWriterEmitter::EmitPrintAliasInstruction(raw_ostream &O) {
|
|
|
|
CodeGenTarget Target(Records);
|
|
|
|
Record *AsmWriter = Target.getAsmWriter();
|
|
|
|
|
|
|
|
O << "\n#ifdef PRINT_ALIAS_INSTR\n";
|
|
|
|
O << "#undef PRINT_ALIAS_INSTR\n\n";
|
|
|
|
|
|
|
|
EmitRegIsInRegClass(O);
|
2011-02-26 11:09:12 +08:00
|
|
|
|
|
|
|
// Emit the method that prints the alias instruction.
|
|
|
|
std::string ClassName = AsmWriter->getValueAsString("AsmWriterClassName");
|
2010-02-12 06:57:32 +08:00
|
|
|
|
2011-02-26 11:09:12 +08:00
|
|
|
bool isMC = AsmWriter->getValueAsBit("isMCAsmWriter");
|
|
|
|
const char *MachineInstrClassName = isMC ? "MCInst" : "MachineInstr";
|
|
|
|
|
|
|
|
std::vector<Record*> AllInstAliases =
|
|
|
|
Records.getAllDerivedDefinitions("InstAlias");
|
|
|
|
|
|
|
|
// Create a map from the qualified name to a list of potential matches.
|
|
|
|
std::map<std::string, std::vector<CodeGenInstAlias*> > AliasMap;
|
|
|
|
for (std::vector<Record*>::iterator
|
|
|
|
I = AllInstAliases.begin(), E = AllInstAliases.end(); I != E; ++I) {
|
|
|
|
CodeGenInstAlias *Alias = new CodeGenInstAlias(*I, Target);
|
|
|
|
const Record *R = *I;
|
2011-04-14 07:36:21 +08:00
|
|
|
if (!R->getValueAsBit("EmitAlias"))
|
|
|
|
continue; // We were told not to emit the alias, but to emit the aliasee.
|
2011-02-26 11:09:12 +08:00
|
|
|
const DagInit *DI = R->getValueAsDag("ResultInst");
|
|
|
|
const DefInit *Op = dynamic_cast<const DefInit*>(DI->getOperator());
|
|
|
|
AliasMap[getQualifiedName(Op->getDef())].push_back(Alias);
|
|
|
|
}
|
|
|
|
|
2011-03-21 16:59:17 +08:00
|
|
|
// A map of which conditions need to be met for each instruction operand
|
|
|
|
// before it can be matched to the mnemonic.
|
|
|
|
std::map<std::string, std::vector<IAPrinter*> > IAPrinterMap;
|
|
|
|
AsmWriterInfo AWI;
|
|
|
|
|
|
|
|
for (std::map<std::string, std::vector<CodeGenInstAlias*> >::iterator
|
|
|
|
I = AliasMap.begin(), E = AliasMap.end(); I != E; ++I) {
|
|
|
|
std::vector<CodeGenInstAlias*> &Aliases = I->second;
|
|
|
|
|
|
|
|
for (std::vector<CodeGenInstAlias*>::iterator
|
|
|
|
II = Aliases.begin(), IE = Aliases.end(); II != IE; ++II) {
|
|
|
|
const CodeGenInstAlias *CGA = *II;
|
|
|
|
IAPrinter *IAP = new IAPrinter(AWI, CGA->Result->getAsString(),
|
|
|
|
CGA->AsmString);
|
|
|
|
|
|
|
|
IAP->addReqFeatures(CGA->TheDef->getValueAsListOfDefs("Predicates"));
|
|
|
|
|
|
|
|
unsigned LastOpNo = CGA->ResultInstOperandIndex.size();
|
|
|
|
|
|
|
|
std::string Cond;
|
|
|
|
Cond = std::string("MI->getNumOperands() == ") + llvm::utostr(LastOpNo);
|
|
|
|
IAP->addCond(Cond);
|
|
|
|
|
|
|
|
std::map<StringRef, unsigned> OpMap;
|
|
|
|
bool CantHandle = false;
|
|
|
|
|
|
|
|
for (unsigned i = 0, e = LastOpNo; i != e; ++i) {
|
|
|
|
const CodeGenInstAlias::ResultOperand &RO = CGA->ResultOperands[i];
|
|
|
|
|
|
|
|
switch (RO.Kind) {
|
|
|
|
default: assert(0 && "unexpected InstAlias operand kind");
|
|
|
|
case CodeGenInstAlias::ResultOperand::K_Record: {
|
|
|
|
const Record *Rec = RO.getRecord();
|
|
|
|
StringRef ROName = RO.getName();
|
|
|
|
|
|
|
|
if (Rec->isSubClassOf("RegisterClass")) {
|
|
|
|
Cond = std::string("MI->getOperand(")+llvm::utostr(i)+").isReg()";
|
|
|
|
IAP->addCond(Cond);
|
|
|
|
|
|
|
|
if (!IAP->isOpMapped(ROName)) {
|
|
|
|
IAP->addOperand(ROName, i);
|
|
|
|
Cond = std::string("regIsInRegisterClass(RC_") +
|
|
|
|
CGA->ResultOperands[i].getRecord()->getName() +
|
|
|
|
", MI->getOperand(" + llvm::utostr(i) + ").getReg())";
|
|
|
|
IAP->addCond(Cond);
|
|
|
|
} else {
|
|
|
|
Cond = std::string("MI->getOperand(") +
|
|
|
|
llvm::utostr(i) + ").getReg() == MI->getOperand(" +
|
|
|
|
llvm::utostr(IAP->getOpIndex(ROName)) + ").getReg()";
|
|
|
|
IAP->addCond(Cond);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
assert(Rec->isSubClassOf("Operand") && "Unexpected operand!");
|
|
|
|
// FIXME: We need to handle these situations.
|
|
|
|
delete IAP;
|
|
|
|
IAP = 0;
|
|
|
|
CantHandle = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case CodeGenInstAlias::ResultOperand::K_Imm:
|
|
|
|
Cond = std::string("MI->getOperand(") +
|
|
|
|
llvm::utostr(i) + ").getImm() == " +
|
|
|
|
llvm::utostr(CGA->ResultOperands[i].getImm());
|
|
|
|
IAP->addCond(Cond);
|
|
|
|
break;
|
|
|
|
case CodeGenInstAlias::ResultOperand::K_Reg:
|
|
|
|
Cond = std::string("MI->getOperand(") +
|
|
|
|
llvm::utostr(i) + ").getReg() == " + Target.getName() +
|
|
|
|
"::" + CGA->ResultOperands[i].getRegister()->getName();
|
|
|
|
IAP->addCond(Cond);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!IAP) break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (CantHandle) continue;
|
|
|
|
IAPrinterMap[I->first].push_back(IAP);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
EmitSubtargetFeatureFlagEnumeration(AWI, O);
|
|
|
|
EmitComputeAvailableFeatures(AWI, AsmWriter, Target, O);
|
|
|
|
|
2011-05-23 08:18:33 +08:00
|
|
|
std::string Header;
|
|
|
|
raw_string_ostream HeaderO(Header);
|
|
|
|
|
|
|
|
HeaderO << "bool " << Target.getName() << ClassName
|
|
|
|
<< "::printAliasInstr(const " << MachineInstrClassName
|
|
|
|
<< " *MI, raw_ostream &OS) {\n";
|
2011-03-21 16:59:17 +08:00
|
|
|
|
2011-04-08 05:20:06 +08:00
|
|
|
std::string Cases;
|
|
|
|
raw_string_ostream CasesO(Cases);
|
2011-04-08 12:08:57 +08:00
|
|
|
bool NeedAvailableFeatures = false;
|
2011-04-08 05:20:06 +08:00
|
|
|
|
|
|
|
for (std::map<std::string, std::vector<IAPrinter*> >::iterator
|
|
|
|
I = IAPrinterMap.begin(), E = IAPrinterMap.end(); I != E; ++I) {
|
|
|
|
std::vector<IAPrinter*> &IAPs = I->second;
|
|
|
|
std::vector<IAPrinter*> UniqueIAPs;
|
|
|
|
|
|
|
|
for (std::vector<IAPrinter*>::iterator
|
|
|
|
II = IAPs.begin(), IE = IAPs.end(); II != IE; ++II) {
|
|
|
|
IAPrinter *LHS = *II;
|
|
|
|
bool IsDup = false;
|
|
|
|
for (std::vector<IAPrinter*>::iterator
|
|
|
|
III = IAPs.begin(), IIE = IAPs.end(); III != IIE; ++III) {
|
|
|
|
IAPrinter *RHS = *III;
|
|
|
|
if (LHS != RHS && *LHS == *RHS) {
|
|
|
|
IsDup = true;
|
2011-02-26 11:09:12 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-04-08 05:20:06 +08:00
|
|
|
if (!IsDup) UniqueIAPs.push_back(LHS);
|
|
|
|
}
|
2011-02-26 11:09:12 +08:00
|
|
|
|
2011-04-08 05:20:06 +08:00
|
|
|
if (UniqueIAPs.empty()) continue;
|
2011-02-26 11:09:12 +08:00
|
|
|
|
2011-04-08 05:20:06 +08:00
|
|
|
CasesO.indent(2) << "case " << I->first << ":\n";
|
2011-02-26 11:09:12 +08:00
|
|
|
|
2011-04-08 05:20:06 +08:00
|
|
|
for (std::vector<IAPrinter*>::iterator
|
|
|
|
II = UniqueIAPs.begin(), IE = UniqueIAPs.end(); II != IE; ++II) {
|
|
|
|
IAPrinter *IAP = *II;
|
|
|
|
CasesO.indent(4);
|
2011-04-08 12:08:57 +08:00
|
|
|
NeedAvailableFeatures |= IAP->print(CasesO);
|
2011-04-08 05:20:06 +08:00
|
|
|
CasesO << '\n';
|
2011-02-26 11:09:12 +08:00
|
|
|
}
|
|
|
|
|
2011-04-19 05:28:11 +08:00
|
|
|
CasesO.indent(4) << "return false;\n";
|
2011-04-08 05:20:06 +08:00
|
|
|
}
|
2011-02-26 11:09:12 +08:00
|
|
|
|
2011-04-08 05:20:06 +08:00
|
|
|
if (CasesO.str().empty() || !isMC) {
|
2011-05-23 08:18:33 +08:00
|
|
|
O << HeaderO.str();
|
2011-04-19 05:28:11 +08:00
|
|
|
O << " return false;\n";
|
2011-04-08 05:20:06 +08:00
|
|
|
O << "}\n\n";
|
|
|
|
O << "#endif // PRINT_ALIAS_INSTR\n";
|
|
|
|
return;
|
2011-02-26 11:09:12 +08:00
|
|
|
}
|
|
|
|
|
2011-05-23 08:18:33 +08:00
|
|
|
EmitGetMapOperandNumber(O);
|
|
|
|
|
|
|
|
O << HeaderO.str();
|
2011-04-08 05:20:06 +08:00
|
|
|
O.indent(2) << "StringRef AsmString;\n";
|
2011-05-23 08:18:33 +08:00
|
|
|
O.indent(2) << "SmallVector<std::pair<StringRef, unsigned>, 4> OpMap;\n";
|
2011-04-08 12:08:57 +08:00
|
|
|
if (NeedAvailableFeatures)
|
|
|
|
O.indent(2) << "unsigned AvailableFeatures = getAvailableFeatures();\n\n";
|
2011-04-08 05:20:06 +08:00
|
|
|
O.indent(2) << "switch (MI->getOpcode()) {\n";
|
2011-04-19 05:28:11 +08:00
|
|
|
O.indent(2) << "default: return false;\n";
|
2011-04-08 05:20:06 +08:00
|
|
|
O << CasesO.str();
|
|
|
|
O.indent(2) << "}\n\n";
|
2011-02-26 11:09:12 +08:00
|
|
|
|
|
|
|
// Code that prints the alias, replacing the operands with the ones from the
|
|
|
|
// MCInst.
|
|
|
|
O << " std::pair<StringRef, StringRef> ASM = AsmString.split(' ');\n";
|
|
|
|
O << " OS << '\\t' << ASM.first;\n";
|
|
|
|
|
|
|
|
O << " if (!ASM.second.empty()) {\n";
|
|
|
|
O << " OS << '\\t';\n";
|
|
|
|
O << " for (StringRef::iterator\n";
|
|
|
|
O << " I = ASM.second.begin(), E = ASM.second.end(); I != E; ) {\n";
|
|
|
|
O << " if (*I == '$') {\n";
|
|
|
|
O << " StringRef::iterator Start = ++I;\n";
|
|
|
|
O << " while (I != E &&\n";
|
|
|
|
O << " ((*I >= 'a' && *I <= 'z') ||\n";
|
|
|
|
O << " (*I >= 'A' && *I <= 'Z') ||\n";
|
|
|
|
O << " (*I >= '0' && *I <= '9') ||\n";
|
|
|
|
O << " *I == '_'))\n";
|
|
|
|
O << " ++I;\n";
|
|
|
|
O << " StringRef Name(Start, I - Start);\n";
|
2011-05-23 08:18:33 +08:00
|
|
|
O << " printOperand(MI, getMapOperandNumber(OpMap, Name), OS);\n";
|
2011-02-26 11:09:12 +08:00
|
|
|
O << " } else {\n";
|
|
|
|
O << " OS << *I++;\n";
|
|
|
|
O << " }\n";
|
|
|
|
O << " }\n";
|
|
|
|
O << " }\n\n";
|
|
|
|
|
2011-04-19 05:28:11 +08:00
|
|
|
O << " return true;\n";
|
2011-02-26 11:09:12 +08:00
|
|
|
O << "}\n\n";
|
|
|
|
|
|
|
|
O << "#endif // PRINT_ALIAS_INSTR\n";
|
|
|
|
}
|
2009-09-14 04:08:00 +08:00
|
|
|
|
|
|
|
void AsmWriterEmitter::run(raw_ostream &O) {
|
|
|
|
EmitSourceFileHeader("Assembly Writer Source Fragment", O);
|
2010-09-30 06:32:50 +08:00
|
|
|
|
2009-09-14 04:08:00 +08:00
|
|
|
EmitPrintInstruction(O);
|
|
|
|
EmitGetRegisterName(O);
|
2010-02-12 06:57:32 +08:00
|
|
|
EmitGetInstructionName(O);
|
2011-02-26 11:09:12 +08:00
|
|
|
EmitPrintAliasInstruction(O);
|
2009-09-14 04:08:00 +08:00
|
|
|
}
|
|
|
|
|