1 //===- AsmMatcherEmitter.cpp - Generate an assembly matcher ---------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This tablegen backend emits a target specifier matcher for converting parsed
11 // assembly operands in the MCInst structures.
13 // The input to the target specific matcher is a list of literal tokens and
14 // operands. The target specific parser should generally eliminate any syntax
15 // which is not relevant for matching; for example, comma tokens should have
16 // already been consumed and eliminated by the parser. Most instructions will
17 // end up with a single literal token (the instruction name) and some number of
20 // Some example inputs, for X86:
21 // 'addl' (immediate ...) (register ...)
22 // 'add' (immediate ...) (memory ...)
25 // The assembly matcher is responsible for converting this input into a precise
26 // machine instruction (i.e., an instruction with a well defined encoding). This
27 // mapping has several properties which complicate matching:
29 // - It may be ambiguous; many architectures can legally encode particular
30 // variants of an instruction in different ways (for example, using a smaller
31 // encoding for small immediates). Such ambiguities should never be
32 // arbitrarily resolved by the assembler, the assembler is always responsible
33 // for choosing the "best" available instruction.
35 // - It may depend on the subtarget or the assembler context. Instructions
36 // which are invalid for the current mode, but otherwise unambiguous (e.g.,
37 // an SSE instruction in a file being assembled for i486) should be accepted
38 // and rejected by the assembler front end. However, if the proper encoding
39 // for an instruction is dependent on the assembler context then the matcher
40 // is responsible for selecting the correct machine instruction for the
43 // The core matching algorithm attempts to exploit the regularity in most
44 // instruction sets to quickly determine the set of possibly matching
45 // instructions, and the simplify the generated code. Additionally, this helps
46 // to ensure that the ambiguities are intentionally resolved by the user.
48 // The matching is divided into two distinct phases:
50 // 1. Classification: Each operand is mapped to the unique set which (a)
51 // contains it, and (b) is the largest such subset for which a single
52 // instruction could match all members.
54 // For register classes, we can generate these subgroups automatically. For
55 // arbitrary operands, we expect the user to define the classes and their
56 // relations to one another (for example, 8-bit signed immediates as a
57 // subset of 32-bit immediates).
59 // By partitioning the operands in this way, we guarantee that for any
60 // tuple of classes, any single instruction must match either all or none
61 // of the sets of operands which could classify to that tuple.
63 // In addition, the subset relation amongst classes induces a partial order
64 // on such tuples, which we use to resolve ambiguities.
66 // FIXME: What do we do if a crazy case shows up where this is the wrong
69 // 2. The input can now be treated as a tuple of classes (static tokens are
70 // simple singleton sets). Each such tuple should generally map to a single
71 // instruction (we currently ignore cases where this isn't true, whee!!!),
72 // which we can emit a simple matcher for.
74 //===----------------------------------------------------------------------===//
76 #include "AsmMatcherEmitter.h"
77 #include "CodeGenTarget.h"
79 #include "StringMatcher.h"
80 #include "llvm/ADT/OwningPtr.h"
81 #include "llvm/ADT/SmallVector.h"
82 #include "llvm/ADT/STLExtras.h"
83 #include "llvm/ADT/StringExtras.h"
84 #include "llvm/Support/CommandLine.h"
85 #include "llvm/Support/Debug.h"
91 static cl::opt<std::string>
92 MatchPrefix("match-prefix", cl::init(""),
93 cl::desc("Only match instructions with the given prefix"));
95 /// FlattenVariants - Flatten an .td file assembly string by selecting the
96 /// variant at index \arg N.
97 static std::string FlattenVariants(const std::string &AsmString,
99 StringRef Cur = AsmString;
100 std::string Res = "";
103 // Find the start of the next variant string.
104 size_t VariantsStart = 0;
105 for (size_t e = Cur.size(); VariantsStart != e; ++VariantsStart)
106 if (Cur[VariantsStart] == '{' &&
107 (VariantsStart == 0 || (Cur[VariantsStart-1] != '$' &&
108 Cur[VariantsStart-1] != '\\')))
111 // Add the prefix to the result.
112 Res += Cur.slice(0, VariantsStart);
113 if (VariantsStart == Cur.size())
116 ++VariantsStart; // Skip the '{'.
118 // Scan to the end of the variants string.
119 size_t VariantsEnd = VariantsStart;
120 unsigned NestedBraces = 1;
121 for (size_t e = Cur.size(); VariantsEnd != e; ++VariantsEnd) {
122 if (Cur[VariantsEnd] == '}' && Cur[VariantsEnd-1] != '\\') {
123 if (--NestedBraces == 0)
125 } else if (Cur[VariantsEnd] == '{')
129 // Select the Nth variant (or empty).
130 StringRef Selection = Cur.slice(VariantsStart, VariantsEnd);
131 for (unsigned i = 0; i != N; ++i)
132 Selection = Selection.split('|').second;
133 Res += Selection.split('|').first;
135 assert(VariantsEnd != Cur.size() &&
136 "Unterminated variants in assembly string!");
137 Cur = Cur.substr(VariantsEnd + 1);
143 /// TokenizeAsmString - Tokenize a simplified assembly string.
144 static void TokenizeAsmString(StringRef AsmString,
145 SmallVectorImpl<StringRef> &Tokens) {
148 for (unsigned i = 0, e = AsmString.size(); i != e; ++i) {
149 switch (AsmString[i]) {
158 Tokens.push_back(AsmString.slice(Prev, i));
161 if (!isspace(AsmString[i]) && AsmString[i] != ',')
162 Tokens.push_back(AsmString.substr(i, 1));
168 Tokens.push_back(AsmString.slice(Prev, i));
172 assert(i != AsmString.size() && "Invalid quoted character");
173 Tokens.push_back(AsmString.substr(i, 1));
178 // If this isn't "${", treat like a normal token.
179 if (i + 1 == AsmString.size() || AsmString[i + 1] != '{') {
181 Tokens.push_back(AsmString.slice(Prev, i));
189 Tokens.push_back(AsmString.slice(Prev, i));
193 StringRef::iterator End =
194 std::find(AsmString.begin() + i, AsmString.end(), '}');
195 assert(End != AsmString.end() && "Missing brace in operand reference!");
196 size_t EndPos = End - AsmString.begin();
197 Tokens.push_back(AsmString.slice(i, EndPos+1));
205 Tokens.push_back(AsmString.slice(Prev, i));
215 if (InTok && Prev != AsmString.size())
216 Tokens.push_back(AsmString.substr(Prev));
219 static bool IsAssemblerInstruction(StringRef Name,
220 const CodeGenInstruction &CGI,
221 const SmallVectorImpl<StringRef> &Tokens) {
222 // Ignore "codegen only" instructions.
223 if (CGI.TheDef->getValueAsBit("isCodeGenOnly"))
226 // Ignore pseudo ops.
228 // FIXME: This is a hack; can we convert these instructions to set the
229 // "codegen only" bit instead?
230 if (const RecordVal *Form = CGI.TheDef->getValue("Form"))
231 if (Form->getValue()->getAsString() == "Pseudo")
234 // Ignore "Int_*" and "*_Int" instructions, which are internal aliases.
236 // FIXME: This is a total hack.
237 if (StringRef(Name).startswith("Int_") || StringRef(Name).endswith("_Int"))
240 // Ignore instructions with no .s string.
242 // FIXME: What are these?
243 if (CGI.AsmString.empty())
246 // FIXME: Hack; ignore any instructions with a newline in them.
247 if (std::find(CGI.AsmString.begin(),
248 CGI.AsmString.end(), '\n') != CGI.AsmString.end())
251 // Ignore instructions with attributes, these are always fake instructions for
252 // simplifying codegen.
254 // FIXME: Is this true?
256 // Also, check for instructions which reference the operand multiple times;
257 // this implies a constraint we would not honor.
258 std::set<std::string> OperandNames;
259 for (unsigned i = 1, e = Tokens.size(); i < e; ++i) {
260 if (Tokens[i][0] == '$' &&
261 Tokens[i].find(':') != StringRef::npos) {
262 PrintError(CGI.TheDef->getLoc(),
263 "instruction with operand modifier '" + Tokens[i].str() +
264 "' not supported by asm matcher. Mark isCodeGenOnly!");
265 throw std::string("ERROR: Invalid instruction");
268 if (Tokens[i][0] == '$' && !OperandNames.insert(Tokens[i]).second) {
270 errs() << "warning: '" << Name << "': "
271 << "ignoring instruction with tied operand '"
272 << Tokens[i].str() << "'\n";
283 struct SubtargetFeatureInfo;
285 /// ClassInfo - Helper class for storing the information about a particular
286 /// class of operands which can be matched.
289 /// Invalid kind, for use as a sentinel value.
292 /// The class for a particular token.
295 /// The (first) register class, subsequent register classes are
296 /// RegisterClass0+1, and so on.
299 /// The (first) user defined class, subsequent user defined classes are
300 /// UserClass0+1, and so on.
304 /// Kind - The class kind, which is either a predefined kind, or (UserClass0 +
305 /// N) for the Nth user defined class.
308 /// SuperClasses - The super classes of this class. Note that for simplicities
309 /// sake user operands only record their immediate super class, while register
310 /// operands include all superclasses.
311 std::vector<ClassInfo*> SuperClasses;
313 /// Name - The full class name, suitable for use in an enum.
316 /// ClassName - The unadorned generic name for this class (e.g., Token).
317 std::string ClassName;
319 /// ValueName - The name of the value this class represents; for a token this
320 /// is the literal token string, for an operand it is the TableGen class (or
321 /// empty if this is a derived class).
322 std::string ValueName;
324 /// PredicateMethod - The name of the operand method to test whether the
325 /// operand matches this class; this is not valid for Token or register kinds.
326 std::string PredicateMethod;
328 /// RenderMethod - The name of the operand method to add this operand to an
329 /// MCInst; this is not valid for Token or register kinds.
330 std::string RenderMethod;
332 /// For register classes, the records for all the registers in this class.
333 std::set<Record*> Registers;
336 /// isRegisterClass() - Check if this is a register class.
337 bool isRegisterClass() const {
338 return Kind >= RegisterClass0 && Kind < UserClass0;
341 /// isUserClass() - Check if this is a user defined class.
342 bool isUserClass() const {
343 return Kind >= UserClass0;
346 /// isRelatedTo - Check whether this class is "related" to \arg RHS. Classes
347 /// are related if they are in the same class hierarchy.
348 bool isRelatedTo(const ClassInfo &RHS) const {
349 // Tokens are only related to tokens.
350 if (Kind == Token || RHS.Kind == Token)
351 return Kind == Token && RHS.Kind == Token;
353 // Registers classes are only related to registers classes, and only if
354 // their intersection is non-empty.
355 if (isRegisterClass() || RHS.isRegisterClass()) {
356 if (!isRegisterClass() || !RHS.isRegisterClass())
359 std::set<Record*> Tmp;
360 std::insert_iterator< std::set<Record*> > II(Tmp, Tmp.begin());
361 std::set_intersection(Registers.begin(), Registers.end(),
362 RHS.Registers.begin(), RHS.Registers.end(),
368 // Otherwise we have two users operands; they are related if they are in the
369 // same class hierarchy.
371 // FIXME: This is an oversimplification, they should only be related if they
372 // intersect, however we don't have that information.
373 assert(isUserClass() && RHS.isUserClass() && "Unexpected class!");
374 const ClassInfo *Root = this;
375 while (!Root->SuperClasses.empty())
376 Root = Root->SuperClasses.front();
378 const ClassInfo *RHSRoot = &RHS;
379 while (!RHSRoot->SuperClasses.empty())
380 RHSRoot = RHSRoot->SuperClasses.front();
382 return Root == RHSRoot;
385 /// isSubsetOf - Test whether this class is a subset of \arg RHS;
386 bool isSubsetOf(const ClassInfo &RHS) const {
387 // This is a subset of RHS if it is the same class...
391 // ... or if any of its super classes are a subset of RHS.
392 for (std::vector<ClassInfo*>::const_iterator it = SuperClasses.begin(),
393 ie = SuperClasses.end(); it != ie; ++it)
394 if ((*it)->isSubsetOf(RHS))
400 /// operator< - Compare two classes.
401 bool operator<(const ClassInfo &RHS) const {
405 // Unrelated classes can be ordered by kind.
406 if (!isRelatedTo(RHS))
407 return Kind < RHS.Kind;
411 assert(0 && "Invalid kind!");
413 // Tokens are comparable by value.
415 // FIXME: Compare by enum value.
416 return ValueName < RHS.ValueName;
419 // This class preceeds the RHS if it is a proper subset of the RHS.
422 if (RHS.isSubsetOf(*this))
425 // Otherwise, order by name to ensure we have a total ordering.
426 return ValueName < RHS.ValueName;
431 /// InstructionInfo - Helper class for storing the necessary information for an
432 /// instruction which is capable of being matched.
433 struct InstructionInfo {
435 /// The unique class instance this operand should match.
438 /// The original operand this corresponds to, if any.
439 const CodeGenInstruction::OperandInfo *OperandInfo;
442 /// InstrName - The target name for this instruction.
443 std::string InstrName;
445 /// Instr - The instruction this matches.
446 const CodeGenInstruction *Instr;
448 /// AsmString - The assembly string for this instruction (with variants
450 std::string AsmString;
452 /// Tokens - The tokenized assembly pattern that this instruction matches.
453 SmallVector<StringRef, 4> Tokens;
455 /// Operands - The operands that this instruction matches.
456 SmallVector<Operand, 4> Operands;
458 /// Predicates - The required subtarget features to match this instruction.
459 SmallVector<SubtargetFeatureInfo*, 4> RequiredFeatures;
461 /// ConversionFnKind - The enum value which is passed to the generated
462 /// ConvertToMCInst to convert parsed operands into an MCInst for this
464 std::string ConversionFnKind;
466 /// operator< - Compare two instructions.
467 bool operator<(const InstructionInfo &RHS) const {
468 // The primary comparator is the instruction mnemonic.
469 if (Tokens[0] != RHS.Tokens[0])
470 return Tokens[0] < RHS.Tokens[0];
472 if (Operands.size() != RHS.Operands.size())
473 return Operands.size() < RHS.Operands.size();
475 // Compare lexicographically by operand. The matcher validates that other
476 // orderings wouldn't be ambiguous using \see CouldMatchAmiguouslyWith().
477 for (unsigned i = 0, e = Operands.size(); i != e; ++i) {
478 if (*Operands[i].Class < *RHS.Operands[i].Class)
480 if (*RHS.Operands[i].Class < *Operands[i].Class)
487 /// CouldMatchAmiguouslyWith - Check whether this instruction could
488 /// ambiguously match the same set of operands as \arg RHS (without being a
489 /// strictly superior match).
490 bool CouldMatchAmiguouslyWith(const InstructionInfo &RHS) {
491 // The number of operands is unambiguous.
492 if (Operands.size() != RHS.Operands.size())
495 // Otherwise, make sure the ordering of the two instructions is unambiguous
496 // by checking that either (a) a token or operand kind discriminates them,
497 // or (b) the ordering among equivalent kinds is consistent.
499 // Tokens and operand kinds are unambiguous (assuming a correct target
501 for (unsigned i = 0, e = Operands.size(); i != e; ++i)
502 if (Operands[i].Class->Kind != RHS.Operands[i].Class->Kind ||
503 Operands[i].Class->Kind == ClassInfo::Token)
504 if (*Operands[i].Class < *RHS.Operands[i].Class ||
505 *RHS.Operands[i].Class < *Operands[i].Class)
508 // Otherwise, this operand could commute if all operands are equivalent, or
509 // there is a pair of operands that compare less than and a pair that
510 // compare greater than.
511 bool HasLT = false, HasGT = false;
512 for (unsigned i = 0, e = Operands.size(); i != e; ++i) {
513 if (*Operands[i].Class < *RHS.Operands[i].Class)
515 if (*RHS.Operands[i].Class < *Operands[i].Class)
519 return !(HasLT ^ HasGT);
526 /// SubtargetFeatureInfo - Helper class for storing information on a subtarget
527 /// feature which participates in instruction matching.
528 struct SubtargetFeatureInfo {
529 /// \brief The predicate record for this feature.
532 /// \brief An unique index assigned to represent this feature.
535 SubtargetFeatureInfo(Record *D, unsigned Idx) : TheDef(D), Index(Idx) {}
537 /// \brief The name of the enumerated constant identifying this feature.
538 std::string getEnumName() const {
539 return "Feature_" + TheDef->getName();
543 class AsmMatcherInfo {
545 /// The tablegen AsmParser record.
548 /// The AsmParser "CommentDelimiter" value.
549 std::string CommentDelimiter;
551 /// The AsmParser "RegisterPrefix" value.
552 std::string RegisterPrefix;
554 /// The classes which are needed for matching.
555 std::vector<ClassInfo*> Classes;
557 /// The information on the instruction to match.
558 std::vector<InstructionInfo*> Instructions;
560 /// Map of Register records to their class information.
561 std::map<Record*, ClassInfo*> RegisterClasses;
563 /// Map of Predicate records to their subtarget information.
564 std::map<Record*, SubtargetFeatureInfo*> SubtargetFeatures;
567 /// Map of token to class information which has already been constructed.
568 std::map<std::string, ClassInfo*> TokenClasses;
570 /// Map of RegisterClass records to their class information.
571 std::map<Record*, ClassInfo*> RegisterClassClasses;
573 /// Map of AsmOperandClass records to their class information.
574 std::map<Record*, ClassInfo*> AsmOperandClasses;
577 /// getTokenClass - Lookup or create the class for the given token.
578 ClassInfo *getTokenClass(StringRef Token);
580 /// getOperandClass - Lookup or create the class for the given operand.
581 ClassInfo *getOperandClass(StringRef Token,
582 const CodeGenInstruction::OperandInfo &OI);
584 /// BuildRegisterClasses - Build the ClassInfo* instances for register
586 void BuildRegisterClasses(CodeGenTarget &Target,
587 std::set<std::string> &SingletonRegisterNames);
589 /// BuildOperandClasses - Build the ClassInfo* instances for user defined
591 void BuildOperandClasses(CodeGenTarget &Target);
594 AsmMatcherInfo(Record *_AsmParser);
596 /// BuildInfo - Construct the various tables used during matching.
597 void BuildInfo(CodeGenTarget &Target);
599 /// getSubtargetFeature - Lookup or create the subtarget feature info for the
601 SubtargetFeatureInfo *getSubtargetFeature(Record *Def) const {
602 assert(Def->isSubClassOf("Predicate") && "Invalid predicate type!");
603 std::map<Record*, SubtargetFeatureInfo*>::const_iterator I =
604 SubtargetFeatures.find(Def);
605 return I == SubtargetFeatures.end() ? 0 : I->second;
611 void InstructionInfo::dump() {
612 errs() << InstrName << " -- " << "flattened:\"" << AsmString << '\"'
614 for (unsigned i = 0, e = Tokens.size(); i != e; ++i) {
621 for (unsigned i = 0, e = Operands.size(); i != e; ++i) {
622 Operand &Op = Operands[i];
623 errs() << " op[" << i << "] = " << Op.Class->ClassName << " - ";
624 if (Op.Class->Kind == ClassInfo::Token) {
625 errs() << '\"' << Tokens[i] << "\"\n";
629 if (!Op.OperandInfo) {
630 errs() << "(singleton register)\n";
634 const CodeGenInstruction::OperandInfo &OI = *Op.OperandInfo;
635 errs() << OI.Name << " " << OI.Rec->getName()
636 << " (" << OI.MIOperandNo << ", " << OI.MINumOperands << ")\n";
640 static std::string getEnumNameForToken(StringRef Str) {
643 for (StringRef::iterator it = Str.begin(), ie = Str.end(); it != ie; ++it) {
645 case '*': Res += "_STAR_"; break;
646 case '%': Res += "_PCT_"; break;
647 case ':': Res += "_COLON_"; break;
652 Res += "_" + utostr((unsigned) *it) + "_";
659 /// getRegisterRecord - Get the register record for \arg name, or 0.
660 static Record *getRegisterRecord(CodeGenTarget &Target, StringRef Name) {
661 for (unsigned i = 0, e = Target.getRegisters().size(); i != e; ++i) {
662 const CodeGenRegister &Reg = Target.getRegisters()[i];
663 if (Name == Reg.TheDef->getValueAsString("AsmName"))
670 ClassInfo *AsmMatcherInfo::getTokenClass(StringRef Token) {
671 ClassInfo *&Entry = TokenClasses[Token];
674 Entry = new ClassInfo();
675 Entry->Kind = ClassInfo::Token;
676 Entry->ClassName = "Token";
677 Entry->Name = "MCK_" + getEnumNameForToken(Token);
678 Entry->ValueName = Token;
679 Entry->PredicateMethod = "<invalid>";
680 Entry->RenderMethod = "<invalid>";
681 Classes.push_back(Entry);
688 AsmMatcherInfo::getOperandClass(StringRef Token,
689 const CodeGenInstruction::OperandInfo &OI) {
690 if (OI.Rec->isSubClassOf("RegisterClass")) {
691 ClassInfo *CI = RegisterClassClasses[OI.Rec];
694 PrintError(OI.Rec->getLoc(), "register class has no class info!");
695 throw std::string("ERROR: Missing register class!");
701 assert(OI.Rec->isSubClassOf("Operand") && "Unexpected operand!");
702 Record *MatchClass = OI.Rec->getValueAsDef("ParserMatchClass");
703 ClassInfo *CI = AsmOperandClasses[MatchClass];
706 PrintError(OI.Rec->getLoc(), "operand has no match class!");
707 throw std::string("ERROR: Missing match class!");
713 void AsmMatcherInfo::BuildRegisterClasses(CodeGenTarget &Target,
714 std::set<std::string>
715 &SingletonRegisterNames) {
716 std::vector<CodeGenRegisterClass> RegisterClasses;
717 std::vector<CodeGenRegister> Registers;
719 RegisterClasses = Target.getRegisterClasses();
720 Registers = Target.getRegisters();
722 // The register sets used for matching.
723 std::set< std::set<Record*> > RegisterSets;
725 // Gather the defined sets.
726 for (std::vector<CodeGenRegisterClass>::iterator it = RegisterClasses.begin(),
727 ie = RegisterClasses.end(); it != ie; ++it)
728 RegisterSets.insert(std::set<Record*>(it->Elements.begin(),
729 it->Elements.end()));
731 // Add any required singleton sets.
732 for (std::set<std::string>::iterator it = SingletonRegisterNames.begin(),
733 ie = SingletonRegisterNames.end(); it != ie; ++it)
734 if (Record *Rec = getRegisterRecord(Target, *it))
735 RegisterSets.insert(std::set<Record*>(&Rec, &Rec + 1));
737 // Introduce derived sets where necessary (when a register does not determine
738 // a unique register set class), and build the mapping of registers to the set
739 // they should classify to.
740 std::map<Record*, std::set<Record*> > RegisterMap;
741 for (std::vector<CodeGenRegister>::iterator it = Registers.begin(),
742 ie = Registers.end(); it != ie; ++it) {
743 CodeGenRegister &CGR = *it;
744 // Compute the intersection of all sets containing this register.
745 std::set<Record*> ContainingSet;
747 for (std::set< std::set<Record*> >::iterator it = RegisterSets.begin(),
748 ie = RegisterSets.end(); it != ie; ++it) {
749 if (!it->count(CGR.TheDef))
752 if (ContainingSet.empty()) {
755 std::set<Record*> Tmp;
756 std::swap(Tmp, ContainingSet);
757 std::insert_iterator< std::set<Record*> > II(ContainingSet,
758 ContainingSet.begin());
759 std::set_intersection(Tmp.begin(), Tmp.end(), it->begin(), it->end(),
764 if (!ContainingSet.empty()) {
765 RegisterSets.insert(ContainingSet);
766 RegisterMap.insert(std::make_pair(CGR.TheDef, ContainingSet));
770 // Construct the register classes.
771 std::map<std::set<Record*>, ClassInfo*> RegisterSetClasses;
773 for (std::set< std::set<Record*> >::iterator it = RegisterSets.begin(),
774 ie = RegisterSets.end(); it != ie; ++it, ++Index) {
775 ClassInfo *CI = new ClassInfo();
776 CI->Kind = ClassInfo::RegisterClass0 + Index;
777 CI->ClassName = "Reg" + utostr(Index);
778 CI->Name = "MCK_Reg" + utostr(Index);
780 CI->PredicateMethod = ""; // unused
781 CI->RenderMethod = "addRegOperands";
783 Classes.push_back(CI);
784 RegisterSetClasses.insert(std::make_pair(*it, CI));
787 // Find the superclasses; we could compute only the subgroup lattice edges,
788 // but there isn't really a point.
789 for (std::set< std::set<Record*> >::iterator it = RegisterSets.begin(),
790 ie = RegisterSets.end(); it != ie; ++it) {
791 ClassInfo *CI = RegisterSetClasses[*it];
792 for (std::set< std::set<Record*> >::iterator it2 = RegisterSets.begin(),
793 ie2 = RegisterSets.end(); it2 != ie2; ++it2)
795 std::includes(it2->begin(), it2->end(), it->begin(), it->end()))
796 CI->SuperClasses.push_back(RegisterSetClasses[*it2]);
799 // Name the register classes which correspond to a user defined RegisterClass.
800 for (std::vector<CodeGenRegisterClass>::iterator it = RegisterClasses.begin(),
801 ie = RegisterClasses.end(); it != ie; ++it) {
802 ClassInfo *CI = RegisterSetClasses[std::set<Record*>(it->Elements.begin(),
803 it->Elements.end())];
804 if (CI->ValueName.empty()) {
805 CI->ClassName = it->getName();
806 CI->Name = "MCK_" + it->getName();
807 CI->ValueName = it->getName();
809 CI->ValueName = CI->ValueName + "," + it->getName();
811 RegisterClassClasses.insert(std::make_pair(it->TheDef, CI));
814 // Populate the map for individual registers.
815 for (std::map<Record*, std::set<Record*> >::iterator it = RegisterMap.begin(),
816 ie = RegisterMap.end(); it != ie; ++it)
817 this->RegisterClasses[it->first] = RegisterSetClasses[it->second];
819 // Name the register classes which correspond to singleton registers.
820 for (std::set<std::string>::iterator it = SingletonRegisterNames.begin(),
821 ie = SingletonRegisterNames.end(); it != ie; ++it) {
822 if (Record *Rec = getRegisterRecord(Target, *it)) {
823 ClassInfo *CI = this->RegisterClasses[Rec];
824 assert(CI && "Missing singleton register class info!");
826 if (CI->ValueName.empty()) {
827 CI->ClassName = Rec->getName();
828 CI->Name = "MCK_" + Rec->getName();
829 CI->ValueName = Rec->getName();
831 CI->ValueName = CI->ValueName + "," + Rec->getName();
836 void AsmMatcherInfo::BuildOperandClasses(CodeGenTarget &Target) {
837 std::vector<Record*> AsmOperands;
838 AsmOperands = Records.getAllDerivedDefinitions("AsmOperandClass");
840 // Pre-populate AsmOperandClasses map.
841 for (std::vector<Record*>::iterator it = AsmOperands.begin(),
842 ie = AsmOperands.end(); it != ie; ++it)
843 AsmOperandClasses[*it] = new ClassInfo();
846 for (std::vector<Record*>::iterator it = AsmOperands.begin(),
847 ie = AsmOperands.end(); it != ie; ++it, ++Index) {
848 ClassInfo *CI = AsmOperandClasses[*it];
849 CI->Kind = ClassInfo::UserClass0 + Index;
851 ListInit *Supers = (*it)->getValueAsListInit("SuperClasses");
852 for (unsigned i = 0, e = Supers->getSize(); i != e; ++i) {
853 DefInit *DI = dynamic_cast<DefInit*>(Supers->getElement(i));
855 PrintError((*it)->getLoc(), "Invalid super class reference!");
859 ClassInfo *SC = AsmOperandClasses[DI->getDef()];
861 PrintError((*it)->getLoc(), "Invalid super class reference!");
863 CI->SuperClasses.push_back(SC);
865 CI->ClassName = (*it)->getValueAsString("Name");
866 CI->Name = "MCK_" + CI->ClassName;
867 CI->ValueName = (*it)->getName();
869 // Get or construct the predicate method name.
870 Init *PMName = (*it)->getValueInit("PredicateMethod");
871 if (StringInit *SI = dynamic_cast<StringInit*>(PMName)) {
872 CI->PredicateMethod = SI->getValue();
874 assert(dynamic_cast<UnsetInit*>(PMName) &&
875 "Unexpected PredicateMethod field!");
876 CI->PredicateMethod = "is" + CI->ClassName;
879 // Get or construct the render method name.
880 Init *RMName = (*it)->getValueInit("RenderMethod");
881 if (StringInit *SI = dynamic_cast<StringInit*>(RMName)) {
882 CI->RenderMethod = SI->getValue();
884 assert(dynamic_cast<UnsetInit*>(RMName) &&
885 "Unexpected RenderMethod field!");
886 CI->RenderMethod = "add" + CI->ClassName + "Operands";
889 AsmOperandClasses[*it] = CI;
890 Classes.push_back(CI);
894 AsmMatcherInfo::AsmMatcherInfo(Record *asmParser)
895 : AsmParser(asmParser),
896 CommentDelimiter(AsmParser->getValueAsString("CommentDelimiter")),
897 RegisterPrefix(AsmParser->getValueAsString("RegisterPrefix"))
901 void AsmMatcherInfo::BuildInfo(CodeGenTarget &Target) {
902 // Build information about all of the AssemblerPredicates.
903 std::vector<Record*> AllPredicates =
904 Records.getAllDerivedDefinitions("Predicate");
905 for (unsigned i = 0, e = AllPredicates.size(); i != e; ++i) {
906 Record *Pred = AllPredicates[i];
907 // Ignore predicates that are not intended for the assembler.
908 if (!Pred->getValueAsBit("AssemblerMatcherPredicate"))
911 if (Pred->getName().empty()) {
912 PrintError(Pred->getLoc(), "Predicate has no name!");
913 throw std::string("ERROR: Predicate defs must be named");
916 unsigned FeatureNo = SubtargetFeatures.size();
917 SubtargetFeatures[Pred] = new SubtargetFeatureInfo(Pred, FeatureNo);
918 assert(FeatureNo < 32 && "Too many subtarget features!");
921 // Parse the instructions; we need to do this first so that we can gather the
922 // singleton register classes.
923 std::set<std::string> SingletonRegisterNames;
924 const std::vector<const CodeGenInstruction*> &InstrList =
925 Target.getInstructionsByEnumValue();
926 for (unsigned i = 0, e = InstrList.size(); i != e; ++i) {
927 const CodeGenInstruction &CGI = *InstrList[i];
929 // If the tblgen -match-prefix option is specified (for tblgen hackers),
930 // filter the set of instructions we consider.
931 if (!StringRef(CGI.TheDef->getName()).startswith(MatchPrefix))
934 OwningPtr<InstructionInfo> II(new InstructionInfo());
936 II->InstrName = CGI.TheDef->getName();
938 II->AsmString = FlattenVariants(CGI.AsmString, 0);
940 // Remove comments from the asm string. We know that the asmstring only
942 if (!CommentDelimiter.empty()) {
943 size_t Idx = StringRef(II->AsmString).find(CommentDelimiter);
944 if (Idx != StringRef::npos)
945 II->AsmString = II->AsmString.substr(0, Idx);
948 TokenizeAsmString(II->AsmString, II->Tokens);
950 // Ignore instructions which shouldn't be matched.
951 if (!IsAssemblerInstruction(CGI.TheDef->getName(), CGI, II->Tokens))
954 // Collect singleton registers, if used.
955 for (unsigned i = 0, e = II->Tokens.size(); i != e; ++i) {
956 if (!II->Tokens[i].startswith(RegisterPrefix))
959 StringRef RegName = II->Tokens[i].substr(RegisterPrefix.size());
960 Record *Rec = getRegisterRecord(Target, RegName);
963 // If there is no register prefix (i.e. "%" in "%eax"), then this may
964 // be some random non-register token, just ignore it.
965 if (RegisterPrefix.empty())
968 std::string Err = "unable to find register for '" + RegName.str() +
969 "' (which matches register prefix)";
970 throw TGError(CGI.TheDef->getLoc(), Err);
973 SingletonRegisterNames.insert(RegName);
976 // Compute the require features.
977 std::vector<Record*> Predicates =
978 CGI.TheDef->getValueAsListOfDefs("Predicates");
979 for (unsigned i = 0, e = Predicates.size(); i != e; ++i)
980 if (SubtargetFeatureInfo *Feature = getSubtargetFeature(Predicates[i]))
981 II->RequiredFeatures.push_back(Feature);
983 Instructions.push_back(II.take());
986 // Build info for the register classes.
987 BuildRegisterClasses(Target, SingletonRegisterNames);
989 // Build info for the user defined assembly operand classes.
990 BuildOperandClasses(Target);
992 // Build the instruction information.
993 for (std::vector<InstructionInfo*>::iterator it = Instructions.begin(),
994 ie = Instructions.end(); it != ie; ++it) {
995 InstructionInfo *II = *it;
997 // The first token of the instruction is the mnemonic, which must be a
999 assert(!II->Tokens.empty() && "Instruction has no tokens?");
1000 StringRef Mnemonic = II->Tokens[0];
1001 assert(Mnemonic[0] != '$' &&
1002 (RegisterPrefix.empty() || !Mnemonic.startswith(RegisterPrefix)));
1004 // Parse the tokens after the mnemonic.
1005 for (unsigned i = 1, e = II->Tokens.size(); i != e; ++i) {
1006 StringRef Token = II->Tokens[i];
1008 // Check for singleton registers.
1009 if (Token.startswith(RegisterPrefix)) {
1010 StringRef RegName = II->Tokens[i].substr(RegisterPrefix.size());
1011 if (Record *RegRecord = getRegisterRecord(Target, RegName)) {
1012 InstructionInfo::Operand Op;
1013 Op.Class = RegisterClasses[RegRecord];
1015 assert(Op.Class && Op.Class->Registers.size() == 1 &&
1016 "Unexpected class for singleton register");
1017 II->Operands.push_back(Op);
1021 if (!RegisterPrefix.empty()) {
1022 std::string Err = "unable to find register for '" + RegName.str() +
1023 "' (which matches register prefix)";
1024 throw TGError(II->Instr->TheDef->getLoc(), Err);
1028 // Check for simple tokens.
1029 if (Token[0] != '$') {
1030 InstructionInfo::Operand Op;
1031 Op.Class = getTokenClass(Token);
1033 II->Operands.push_back(Op);
1037 // Otherwise this is an operand reference.
1038 StringRef OperandName;
1039 if (Token[1] == '{')
1040 OperandName = Token.substr(2, Token.size() - 3);
1042 OperandName = Token.substr(1);
1044 // Map this token to an operand. FIXME: Move elsewhere.
1047 Idx = II->Instr->getOperandNamed(OperandName);
1049 throw std::string("error: unable to find operand: '" +
1050 OperandName.str() + "'");
1053 // FIXME: This is annoying, the named operand may be tied (e.g.,
1054 // XCHG8rm). What we want is the untied operand, which we now have to
1055 // grovel for. Only worry about this for single entry operands, we have to
1056 // clean this up anyway.
1057 const CodeGenInstruction::OperandInfo *OI = &II->Instr->OperandList[Idx];
1058 if (OI->Constraints[0].isTied()) {
1059 unsigned TiedOp = OI->Constraints[0].getTiedOperand();
1061 // The tied operand index is an MIOperand index, find the operand that
1063 for (unsigned i = 0, e = II->Instr->OperandList.size(); i != e; ++i) {
1064 if (II->Instr->OperandList[i].MIOperandNo == TiedOp) {
1065 OI = &II->Instr->OperandList[i];
1070 assert(OI && "Unable to find tied operand target!");
1073 InstructionInfo::Operand Op;
1074 Op.Class = getOperandClass(Token, *OI);
1075 Op.OperandInfo = OI;
1076 II->Operands.push_back(Op);
1080 // Reorder classes so that classes preceed super classes.
1081 std::sort(Classes.begin(), Classes.end(), less_ptr<ClassInfo>());
1084 static std::pair<unsigned, unsigned> *
1085 GetTiedOperandAtIndex(SmallVectorImpl<std::pair<unsigned, unsigned> > &List,
1087 for (unsigned i = 0, e = List.size(); i != e; ++i)
1088 if (Index == List[i].first)
1094 static void EmitConvertToMCInst(CodeGenTarget &Target,
1095 std::vector<InstructionInfo*> &Infos,
1097 // Write the convert function to a separate stream, so we can drop it after
1099 std::string ConvertFnBody;
1100 raw_string_ostream CvtOS(ConvertFnBody);
1102 // Function we have already generated.
1103 std::set<std::string> GeneratedFns;
1105 // Start the unified conversion function.
1107 CvtOS << "static void ConvertToMCInst(ConversionKind Kind, MCInst &Inst, "
1108 << "unsigned Opcode,\n"
1109 << " const SmallVectorImpl<MCParsedAsmOperand*"
1110 << "> &Operands) {\n";
1111 CvtOS << " Inst.setOpcode(Opcode);\n";
1112 CvtOS << " switch (Kind) {\n";
1113 CvtOS << " default:\n";
1115 // Start the enum, which we will generate inline.
1117 OS << "// Unified function for converting operants to MCInst instances.\n\n";
1118 OS << "enum ConversionKind {\n";
1120 // TargetOperandClass - This is the target's operand class, like X86Operand.
1121 std::string TargetOperandClass = Target.getName() + "Operand";
1123 for (std::vector<InstructionInfo*>::const_iterator it = Infos.begin(),
1124 ie = Infos.end(); it != ie; ++it) {
1125 InstructionInfo &II = **it;
1127 // Order the (class) operands by the order to convert them into an MCInst.
1128 SmallVector<std::pair<unsigned, unsigned>, 4> MIOperandList;
1129 for (unsigned i = 0, e = II.Operands.size(); i != e; ++i) {
1130 InstructionInfo::Operand &Op = II.Operands[i];
1132 MIOperandList.push_back(std::make_pair(Op.OperandInfo->MIOperandNo, i));
1135 // Find any tied operands.
1136 SmallVector<std::pair<unsigned, unsigned>, 4> TiedOperands;
1137 for (unsigned i = 0, e = II.Instr->OperandList.size(); i != e; ++i) {
1138 const CodeGenInstruction::OperandInfo &OpInfo = II.Instr->OperandList[i];
1139 for (unsigned j = 0, e = OpInfo.Constraints.size(); j != e; ++j) {
1140 const CodeGenInstruction::ConstraintInfo &CI = OpInfo.Constraints[j];
1142 TiedOperands.push_back(std::make_pair(OpInfo.MIOperandNo + j,
1143 CI.getTiedOperand()));
1147 std::sort(MIOperandList.begin(), MIOperandList.end());
1149 // Compute the total number of operands.
1150 unsigned NumMIOperands = 0;
1151 for (unsigned i = 0, e = II.Instr->OperandList.size(); i != e; ++i) {
1152 const CodeGenInstruction::OperandInfo &OI = II.Instr->OperandList[i];
1153 NumMIOperands = std::max(NumMIOperands,
1154 OI.MIOperandNo + OI.MINumOperands);
1157 // Build the conversion function signature.
1158 std::string Signature = "Convert";
1159 unsigned CurIndex = 0;
1160 for (unsigned i = 0, e = MIOperandList.size(); i != e; ++i) {
1161 InstructionInfo::Operand &Op = II.Operands[MIOperandList[i].second];
1162 assert(CurIndex <= Op.OperandInfo->MIOperandNo &&
1163 "Duplicate match for instruction operand!");
1165 // Skip operands which weren't matched by anything, this occurs when the
1166 // .td file encodes "implicit" operands as explicit ones.
1168 // FIXME: This should be removed from the MCInst structure.
1169 for (; CurIndex != Op.OperandInfo->MIOperandNo; ++CurIndex) {
1170 std::pair<unsigned, unsigned> *Tie = GetTiedOperandAtIndex(TiedOperands,
1173 Signature += "__Imp";
1175 Signature += "__Tie" + utostr(Tie->second);
1180 // Registers are always converted the same, don't duplicate the conversion
1181 // function based on them.
1183 // FIXME: We could generalize this based on the render method, if it
1185 if (Op.Class->isRegisterClass())
1188 Signature += Op.Class->ClassName;
1189 Signature += utostr(Op.OperandInfo->MINumOperands);
1190 Signature += "_" + utostr(MIOperandList[i].second);
1192 CurIndex += Op.OperandInfo->MINumOperands;
1195 // Add any trailing implicit operands.
1196 for (; CurIndex != NumMIOperands; ++CurIndex) {
1197 std::pair<unsigned, unsigned> *Tie = GetTiedOperandAtIndex(TiedOperands,
1200 Signature += "__Imp";
1202 Signature += "__Tie" + utostr(Tie->second);
1205 II.ConversionFnKind = Signature;
1207 // Check if we have already generated this signature.
1208 if (!GeneratedFns.insert(Signature).second)
1211 // If not, emit it now.
1213 // Add to the enum list.
1214 OS << " " << Signature << ",\n";
1216 // And to the convert function.
1217 CvtOS << " case " << Signature << ":\n";
1219 for (unsigned i = 0, e = MIOperandList.size(); i != e; ++i) {
1220 InstructionInfo::Operand &Op = II.Operands[MIOperandList[i].second];
1222 // Add the implicit operands.
1223 for (; CurIndex != Op.OperandInfo->MIOperandNo; ++CurIndex) {
1224 // See if this is a tied operand.
1225 std::pair<unsigned, unsigned> *Tie = GetTiedOperandAtIndex(TiedOperands,
1229 // If not, this is some implicit operand. Just assume it is a register
1231 CvtOS << " Inst.addOperand(MCOperand::CreateReg(0));\n";
1233 // Copy the tied operand.
1234 assert(Tie->first>Tie->second && "Tied operand preceeds its target!");
1235 CvtOS << " Inst.addOperand(Inst.getOperand("
1236 << Tie->second << "));\n";
1240 CvtOS << " ((" << TargetOperandClass << "*)Operands["
1241 << MIOperandList[i].second
1242 << "+1])->" << Op.Class->RenderMethod
1243 << "(Inst, " << Op.OperandInfo->MINumOperands << ");\n";
1244 CurIndex += Op.OperandInfo->MINumOperands;
1247 // And add trailing implicit operands.
1248 for (; CurIndex != NumMIOperands; ++CurIndex) {
1249 std::pair<unsigned, unsigned> *Tie = GetTiedOperandAtIndex(TiedOperands,
1253 // If not, this is some implicit operand. Just assume it is a register
1255 CvtOS << " Inst.addOperand(MCOperand::CreateReg(0));\n";
1257 // Copy the tied operand.
1258 assert(Tie->first>Tie->second && "Tied operand preceeds its target!");
1259 CvtOS << " Inst.addOperand(Inst.getOperand("
1260 << Tie->second << "));\n";
1264 CvtOS << " return;\n";
1267 // Finish the convert function.
1272 // Finish the enum, and drop the convert function after it.
1274 OS << " NumConversionVariants\n";
1280 /// EmitMatchClassEnumeration - Emit the enumeration for match class kinds.
1281 static void EmitMatchClassEnumeration(CodeGenTarget &Target,
1282 std::vector<ClassInfo*> &Infos,
1284 OS << "namespace {\n\n";
1286 OS << "/// MatchClassKind - The kinds of classes which participate in\n"
1287 << "/// instruction matching.\n";
1288 OS << "enum MatchClassKind {\n";
1289 OS << " InvalidMatchClass = 0,\n";
1290 for (std::vector<ClassInfo*>::iterator it = Infos.begin(),
1291 ie = Infos.end(); it != ie; ++it) {
1292 ClassInfo &CI = **it;
1293 OS << " " << CI.Name << ", // ";
1294 if (CI.Kind == ClassInfo::Token) {
1295 OS << "'" << CI.ValueName << "'\n";
1296 } else if (CI.isRegisterClass()) {
1297 if (!CI.ValueName.empty())
1298 OS << "register class '" << CI.ValueName << "'\n";
1300 OS << "derived register class\n";
1302 OS << "user defined class '" << CI.ValueName << "'\n";
1305 OS << " NumMatchClassKinds\n";
1311 /// EmitClassifyOperand - Emit the function to classify an operand.
1312 static void EmitClassifyOperand(CodeGenTarget &Target,
1313 AsmMatcherInfo &Info,
1315 OS << "static MatchClassKind ClassifyOperand(MCParsedAsmOperand *GOp) {\n"
1316 << " " << Target.getName() << "Operand &Operand = *("
1317 << Target.getName() << "Operand*)GOp;\n";
1320 OS << " if (Operand.isToken())\n";
1321 OS << " return MatchTokenString(Operand.getToken());\n\n";
1323 // Classify registers.
1325 // FIXME: Don't hardcode isReg, getReg.
1326 OS << " if (Operand.isReg()) {\n";
1327 OS << " switch (Operand.getReg()) {\n";
1328 OS << " default: return InvalidMatchClass;\n";
1329 for (std::map<Record*, ClassInfo*>::iterator
1330 it = Info.RegisterClasses.begin(), ie = Info.RegisterClasses.end();
1332 OS << " case " << Target.getName() << "::"
1333 << it->first->getName() << ": return " << it->second->Name << ";\n";
1337 // Classify user defined operands.
1338 for (std::vector<ClassInfo*>::iterator it = Info.Classes.begin(),
1339 ie = Info.Classes.end(); it != ie; ++it) {
1340 ClassInfo &CI = **it;
1342 if (!CI.isUserClass())
1345 OS << " // '" << CI.ClassName << "' class";
1346 if (!CI.SuperClasses.empty()) {
1347 OS << ", subclass of ";
1348 for (unsigned i = 0, e = CI.SuperClasses.size(); i != e; ++i) {
1350 OS << "'" << CI.SuperClasses[i]->ClassName << "'";
1351 assert(CI < *CI.SuperClasses[i] && "Invalid class relation!");
1356 OS << " if (Operand." << CI.PredicateMethod << "()) {\n";
1358 // Validate subclass relationships.
1359 if (!CI.SuperClasses.empty()) {
1360 for (unsigned i = 0, e = CI.SuperClasses.size(); i != e; ++i)
1361 OS << " assert(Operand." << CI.SuperClasses[i]->PredicateMethod
1362 << "() && \"Invalid class relationship!\");\n";
1365 OS << " return " << CI.Name << ";\n";
1368 OS << " return InvalidMatchClass;\n";
1372 /// EmitIsSubclass - Emit the subclass predicate function.
1373 static void EmitIsSubclass(CodeGenTarget &Target,
1374 std::vector<ClassInfo*> &Infos,
1376 OS << "/// IsSubclass - Compute whether \\arg A is a subclass of \\arg B.\n";
1377 OS << "static bool IsSubclass(MatchClassKind A, MatchClassKind B) {\n";
1378 OS << " if (A == B)\n";
1379 OS << " return true;\n\n";
1381 OS << " switch (A) {\n";
1382 OS << " default:\n";
1383 OS << " return false;\n";
1384 for (std::vector<ClassInfo*>::iterator it = Infos.begin(),
1385 ie = Infos.end(); it != ie; ++it) {
1386 ClassInfo &A = **it;
1388 if (A.Kind != ClassInfo::Token) {
1389 std::vector<StringRef> SuperClasses;
1390 for (std::vector<ClassInfo*>::iterator it = Infos.begin(),
1391 ie = Infos.end(); it != ie; ++it) {
1392 ClassInfo &B = **it;
1394 if (&A != &B && A.isSubsetOf(B))
1395 SuperClasses.push_back(B.Name);
1398 if (SuperClasses.empty())
1401 OS << "\n case " << A.Name << ":\n";
1403 if (SuperClasses.size() == 1) {
1404 OS << " return B == " << SuperClasses.back() << ";\n";
1408 OS << " switch (B) {\n";
1409 OS << " default: return false;\n";
1410 for (unsigned i = 0, e = SuperClasses.size(); i != e; ++i)
1411 OS << " case " << SuperClasses[i] << ": return true;\n";
1421 /// EmitMatchTokenString - Emit the function to match a token string to the
1422 /// appropriate match class value.
1423 static void EmitMatchTokenString(CodeGenTarget &Target,
1424 std::vector<ClassInfo*> &Infos,
1426 // Construct the match list.
1427 std::vector<StringMatcher::StringPair> Matches;
1428 for (std::vector<ClassInfo*>::iterator it = Infos.begin(),
1429 ie = Infos.end(); it != ie; ++it) {
1430 ClassInfo &CI = **it;
1432 if (CI.Kind == ClassInfo::Token)
1433 Matches.push_back(StringMatcher::StringPair(CI.ValueName,
1434 "return " + CI.Name + ";"));
1437 OS << "static MatchClassKind MatchTokenString(StringRef Name) {\n";
1439 StringMatcher("Name", Matches, OS).Emit();
1441 OS << " return InvalidMatchClass;\n";
1445 /// EmitMatchRegisterName - Emit the function to match a string to the target
1446 /// specific register enum.
1447 static void EmitMatchRegisterName(CodeGenTarget &Target, Record *AsmParser,
1449 // Construct the match list.
1450 std::vector<StringMatcher::StringPair> Matches;
1451 for (unsigned i = 0, e = Target.getRegisters().size(); i != e; ++i) {
1452 const CodeGenRegister &Reg = Target.getRegisters()[i];
1453 if (Reg.TheDef->getValueAsString("AsmName").empty())
1456 Matches.push_back(StringMatcher::StringPair(
1457 Reg.TheDef->getValueAsString("AsmName"),
1458 "return " + utostr(i + 1) + ";"));
1461 OS << "static unsigned MatchRegisterName(StringRef Name) {\n";
1463 StringMatcher("Name", Matches, OS).Emit();
1465 OS << " return 0;\n";
1469 /// EmitSubtargetFeatureFlagEnumeration - Emit the subtarget feature flag
1471 static void EmitSubtargetFeatureFlagEnumeration(CodeGenTarget &Target,
1472 AsmMatcherInfo &Info,
1474 OS << "// Flags for subtarget features that participate in "
1475 << "instruction matching.\n";
1476 OS << "enum SubtargetFeatureFlag {\n";
1477 for (std::map<Record*, SubtargetFeatureInfo*>::const_iterator
1478 it = Info.SubtargetFeatures.begin(),
1479 ie = Info.SubtargetFeatures.end(); it != ie; ++it) {
1480 SubtargetFeatureInfo &SFI = *it->second;
1481 OS << " " << SFI.getEnumName() << " = (1 << " << SFI.Index << "),\n";
1483 OS << " Feature_None = 0\n";
1487 /// EmitComputeAvailableFeatures - Emit the function to compute the list of
1488 /// available features given a subtarget.
1489 static void EmitComputeAvailableFeatures(CodeGenTarget &Target,
1490 AsmMatcherInfo &Info,
1492 std::string ClassName =
1493 Info.AsmParser->getValueAsString("AsmParserClassName");
1495 OS << "unsigned " << Target.getName() << ClassName << "::\n"
1496 << "ComputeAvailableFeatures(const " << Target.getName()
1497 << "Subtarget *Subtarget) const {\n";
1498 OS << " unsigned Features = 0;\n";
1499 for (std::map<Record*, SubtargetFeatureInfo*>::const_iterator
1500 it = Info.SubtargetFeatures.begin(),
1501 ie = Info.SubtargetFeatures.end(); it != ie; ++it) {
1502 SubtargetFeatureInfo &SFI = *it->second;
1503 OS << " if (" << SFI.TheDef->getValueAsString("CondString")
1505 OS << " Features |= " << SFI.getEnumName() << ";\n";
1507 OS << " return Features;\n";
1511 static std::string GetAliasRequiredFeatures(Record *R,
1512 const AsmMatcherInfo &Info) {
1513 std::vector<Record*> ReqFeatures = R->getValueAsListOfDefs("Predicates");
1515 unsigned NumFeatures = 0;
1516 for (unsigned i = 0, e = ReqFeatures.size(); i != e; ++i) {
1517 if (SubtargetFeatureInfo *F = Info.getSubtargetFeature(ReqFeatures[i])) {
1521 Result += F->getEnumName();
1526 if (NumFeatures > 1)
1527 Result = '(' + Result + ')';
1531 /// EmitMnemonicAliases - If the target has any MnemonicAlias<> definitions,
1532 /// emit a function for them and return true, otherwise return false.
1533 static bool EmitMnemonicAliases(raw_ostream &OS, const AsmMatcherInfo &Info) {
1534 std::vector<Record*> Aliases =
1535 Records.getAllDerivedDefinitions("MnemonicAlias");
1536 if (Aliases.empty()) return false;
1538 OS << "static void ApplyMnemonicAliases(StringRef &Mnemonic, "
1539 "unsigned Features) {\n";
1541 // Keep track of all the aliases from a mnemonic. Use an std::map so that the
1542 // iteration order of the map is stable.
1543 std::map<std::string, std::vector<Record*> > AliasesFromMnemonic;
1545 for (unsigned i = 0, e = Aliases.size(); i != e; ++i) {
1546 Record *R = Aliases[i];
1547 AliasesFromMnemonic[R->getValueAsString("FromMnemonic")].push_back(R);
1550 // Process each alias a "from" mnemonic at a time, building the code executed
1551 // by the string remapper.
1552 std::vector<StringMatcher::StringPair> Cases;
1553 for (std::map<std::string, std::vector<Record*> >::iterator
1554 I = AliasesFromMnemonic.begin(), E = AliasesFromMnemonic.end();
1556 const std::vector<Record*> &ToVec = I->second;
1558 // Loop through each alias and emit code that handles each case. If there
1559 // are two instructions without predicates, emit an error. If there is one,
1561 std::string MatchCode;
1562 int AliasWithNoPredicate = -1;
1564 for (unsigned i = 0, e = ToVec.size(); i != e; ++i) {
1565 Record *R = ToVec[i];
1566 std::string FeatureMask = GetAliasRequiredFeatures(R, Info);
1568 // If this unconditionally matches, remember it for later and diagnose
1570 if (FeatureMask.empty()) {
1571 if (AliasWithNoPredicate != -1) {
1572 // We can't have two aliases from the same mnemonic with no predicate.
1573 PrintError(ToVec[AliasWithNoPredicate]->getLoc(),
1574 "two MnemonicAliases with the same 'from' mnemonic!");
1575 PrintError(R->getLoc(), "this is the other MnemonicAlias.");
1576 throw std::string("ERROR: Invalid MnemonicAlias definitions!");
1579 AliasWithNoPredicate = i;
1583 if (!MatchCode.empty())
1584 MatchCode += "else ";
1585 MatchCode += "if ((Features & " + FeatureMask + ") == "+FeatureMask+")\n";
1586 MatchCode += " Mnemonic = \"" +R->getValueAsString("ToMnemonic")+"\";\n";
1589 if (AliasWithNoPredicate != -1) {
1590 Record *R = ToVec[AliasWithNoPredicate];
1591 if (!MatchCode.empty())
1592 MatchCode += "else\n ";
1593 MatchCode += "Mnemonic = \"" + R->getValueAsString("ToMnemonic")+"\";\n";
1596 MatchCode += "return;";
1598 Cases.push_back(std::make_pair(I->first, MatchCode));
1602 StringMatcher("Mnemonic", Cases, OS).Emit();
1608 void AsmMatcherEmitter::run(raw_ostream &OS) {
1609 CodeGenTarget Target;
1610 Record *AsmParser = Target.getAsmParser();
1611 std::string ClassName = AsmParser->getValueAsString("AsmParserClassName");
1613 // Compute the information on the instructions to match.
1614 AsmMatcherInfo Info(AsmParser);
1615 Info.BuildInfo(Target);
1617 // Sort the instruction table using the partial order on classes. We use
1618 // stable_sort to ensure that ambiguous instructions are still
1619 // deterministically ordered.
1620 std::stable_sort(Info.Instructions.begin(), Info.Instructions.end(),
1621 less_ptr<InstructionInfo>());
1623 DEBUG_WITH_TYPE("instruction_info", {
1624 for (std::vector<InstructionInfo*>::iterator
1625 it = Info.Instructions.begin(), ie = Info.Instructions.end();
1630 // Check for ambiguous instructions.
1631 DEBUG_WITH_TYPE("ambiguous_instrs", {
1632 unsigned NumAmbiguous = 0;
1633 for (unsigned i = 0, e = Info.Instructions.size(); i != e; ++i) {
1634 for (unsigned j = i + 1; j != e; ++j) {
1635 InstructionInfo &A = *Info.Instructions[i];
1636 InstructionInfo &B = *Info.Instructions[j];
1638 if (A.CouldMatchAmiguouslyWith(B)) {
1639 errs() << "warning: ambiguous instruction match:\n";
1641 errs() << "\nis incomparable with:\n";
1649 errs() << "warning: " << NumAmbiguous
1650 << " ambiguous instructions!\n";
1653 // Write the output.
1655 EmitSourceFileHeader("Assembly Matcher Source Fragment", OS);
1657 // Information for the class declaration.
1658 OS << "\n#ifdef GET_ASSEMBLER_HEADER\n";
1659 OS << "#undef GET_ASSEMBLER_HEADER\n";
1660 OS << " // This should be included into the middle of the declaration of \n";
1661 OS << " // your subclasses implementation of TargetAsmParser.\n";
1662 OS << " unsigned ComputeAvailableFeatures(const " <<
1663 Target.getName() << "Subtarget *Subtarget) const;\n";
1664 OS << " enum MatchResultTy {\n";
1665 OS << " Match_Success, Match_MnemonicFail, Match_InvalidOperand,\n";
1666 OS << " Match_MissingFeature\n";
1668 OS << " MatchResultTy MatchInstructionImpl(const "
1669 << "SmallVectorImpl<MCParsedAsmOperand*>"
1670 << " &Operands, MCInst &Inst, unsigned &ErrorInfo);\n\n";
1671 OS << "#endif // GET_ASSEMBLER_HEADER_INFO\n\n";
1676 OS << "\n#ifdef GET_REGISTER_MATCHER\n";
1677 OS << "#undef GET_REGISTER_MATCHER\n\n";
1679 // Emit the subtarget feature enumeration.
1680 EmitSubtargetFeatureFlagEnumeration(Target, Info, OS);
1682 // Emit the function to match a register name to number.
1683 EmitMatchRegisterName(Target, AsmParser, OS);
1685 OS << "#endif // GET_REGISTER_MATCHER\n\n";
1688 OS << "\n#ifdef GET_MATCHER_IMPLEMENTATION\n";
1689 OS << "#undef GET_MATCHER_IMPLEMENTATION\n\n";
1691 // Generate the function that remaps for mnemonic aliases.
1692 bool HasMnemonicAliases = EmitMnemonicAliases(OS, Info);
1694 // Generate the unified function to convert operands into an MCInst.
1695 EmitConvertToMCInst(Target, Info.Instructions, OS);
1697 // Emit the enumeration for classes which participate in matching.
1698 EmitMatchClassEnumeration(Target, Info.Classes, OS);
1700 // Emit the routine to match token strings to their match class.
1701 EmitMatchTokenString(Target, Info.Classes, OS);
1703 // Emit the routine to classify an operand.
1704 EmitClassifyOperand(Target, Info, OS);
1706 // Emit the subclass predicate routine.
1707 EmitIsSubclass(Target, Info.Classes, OS);
1709 // Emit the available features compute function.
1710 EmitComputeAvailableFeatures(Target, Info, OS);
1713 size_t MaxNumOperands = 0;
1714 for (std::vector<InstructionInfo*>::const_iterator it =
1715 Info.Instructions.begin(), ie = Info.Instructions.end();
1717 MaxNumOperands = std::max(MaxNumOperands, (*it)->Operands.size());
1720 // Emit the static match table; unused classes get initalized to 0 which is
1721 // guaranteed to be InvalidMatchClass.
1723 // FIXME: We can reduce the size of this table very easily. First, we change
1724 // it so that store the kinds in separate bit-fields for each index, which
1725 // only needs to be the max width used for classes at that index (we also need
1726 // to reject based on this during classification). If we then make sure to
1727 // order the match kinds appropriately (putting mnemonics last), then we
1728 // should only end up using a few bits for each class, especially the ones
1729 // following the mnemonic.
1730 OS << "namespace {\n";
1731 OS << " struct MatchEntry {\n";
1732 OS << " unsigned Opcode;\n";
1733 OS << " const char *Mnemonic;\n";
1734 OS << " ConversionKind ConvertFn;\n";
1735 OS << " MatchClassKind Classes[" << MaxNumOperands << "];\n";
1736 OS << " unsigned RequiredFeatures;\n";
1739 OS << "// Predicate for searching for an opcode.\n";
1740 OS << " struct LessOpcode {\n";
1741 OS << " bool operator()(const MatchEntry &LHS, StringRef RHS) {\n";
1742 OS << " return StringRef(LHS.Mnemonic) < RHS;\n";
1744 OS << " bool operator()(StringRef LHS, const MatchEntry &RHS) {\n";
1745 OS << " return LHS < StringRef(RHS.Mnemonic);\n";
1747 OS << " bool operator()(const MatchEntry &LHS, const MatchEntry &RHS) {\n";
1748 OS << " return StringRef(LHS.Mnemonic) < StringRef(RHS.Mnemonic);\n";
1752 OS << "} // end anonymous namespace.\n\n";
1754 OS << "static const MatchEntry MatchTable["
1755 << Info.Instructions.size() << "] = {\n";
1757 for (std::vector<InstructionInfo*>::const_iterator it =
1758 Info.Instructions.begin(), ie = Info.Instructions.end();
1760 InstructionInfo &II = **it;
1762 OS << " { " << Target.getName() << "::" << II.InstrName
1763 << ", \"" << II.Tokens[0] << "\""
1764 << ", " << II.ConversionFnKind << ", { ";
1765 for (unsigned i = 0, e = II.Operands.size(); i != e; ++i) {
1766 InstructionInfo::Operand &Op = II.Operands[i];
1769 OS << Op.Class->Name;
1773 // Write the required features mask.
1774 if (!II.RequiredFeatures.empty()) {
1775 for (unsigned i = 0, e = II.RequiredFeatures.size(); i != e; ++i) {
1777 OS << II.RequiredFeatures[i]->getEnumName();
1787 // Finally, build the match function.
1788 OS << Target.getName() << ClassName << "::MatchResultTy "
1789 << Target.getName() << ClassName << "::\n"
1790 << "MatchInstructionImpl(const SmallVectorImpl<MCParsedAsmOperand*>"
1792 OS << " MCInst &Inst, unsigned &ErrorInfo) {\n";
1794 // Emit code to get the available features.
1795 OS << " // Get the current feature set.\n";
1796 OS << " unsigned AvailableFeatures = getAvailableFeatures();\n\n";
1798 OS << " // Get the instruction mnemonic, which is the first token.\n";
1799 OS << " StringRef Mnemonic = ((" << Target.getName()
1800 << "Operand*)Operands[0])->getToken();\n\n";
1802 if (HasMnemonicAliases) {
1803 OS << " // Process all MnemonicAliases to remap the mnemonic.\n";
1804 OS << " ApplyMnemonicAliases(Mnemonic, AvailableFeatures);\n\n";
1807 // Emit code to compute the class list for this operand vector.
1808 OS << " // Eliminate obvious mismatches.\n";
1809 OS << " if (Operands.size() > " << (MaxNumOperands+1) << ") {\n";
1810 OS << " ErrorInfo = " << (MaxNumOperands+1) << ";\n";
1811 OS << " return Match_InvalidOperand;\n";
1814 OS << " // Compute the class list for this operand vector.\n";
1815 OS << " MatchClassKind Classes[" << MaxNumOperands << "];\n";
1816 OS << " for (unsigned i = 1, e = Operands.size(); i != e; ++i) {\n";
1817 OS << " Classes[i-1] = ClassifyOperand(Operands[i]);\n\n";
1819 OS << " // Check for invalid operands before matching.\n";
1820 OS << " if (Classes[i-1] == InvalidMatchClass) {\n";
1821 OS << " ErrorInfo = i;\n";
1822 OS << " return Match_InvalidOperand;\n";
1826 OS << " // Mark unused classes.\n";
1827 OS << " for (unsigned i = Operands.size()-1, e = " << MaxNumOperands << "; "
1828 << "i != e; ++i)\n";
1829 OS << " Classes[i] = InvalidMatchClass;\n\n";
1831 OS << " // Some state to try to produce better error messages.\n";
1832 OS << " bool HadMatchOtherThanFeatures = false;\n\n";
1833 OS << " // Set ErrorInfo to the operand that mismatches if it is \n";
1834 OS << " // wrong for all instances of the instruction.\n";
1835 OS << " ErrorInfo = ~0U;\n";
1837 // Emit code to search the table.
1838 OS << " // Search the table.\n";
1839 OS << " std::pair<const MatchEntry*, const MatchEntry*> MnemonicRange =\n";
1840 OS << " std::equal_range(MatchTable, MatchTable+"
1841 << Info.Instructions.size() << ", Mnemonic, LessOpcode());\n\n";
1843 OS << " // Return a more specific error code if no mnemonics match.\n";
1844 OS << " if (MnemonicRange.first == MnemonicRange.second)\n";
1845 OS << " return Match_MnemonicFail;\n\n";
1847 OS << " for (const MatchEntry *it = MnemonicRange.first, "
1848 << "*ie = MnemonicRange.second;\n";
1849 OS << " it != ie; ++it) {\n";
1851 OS << " // equal_range guarantees that instruction mnemonic matches.\n";
1852 OS << " assert(Mnemonic == it->Mnemonic);\n";
1854 // Emit check that the subclasses match.
1855 OS << " bool OperandsValid = true;\n";
1856 OS << " for (unsigned i = 0; i != " << MaxNumOperands << "; ++i) {\n";
1857 OS << " if (IsSubclass(Classes[i], it->Classes[i]))\n";
1858 OS << " continue;\n";
1859 OS << " // If this operand is broken for all of the instances of this\n";
1860 OS << " // mnemonic, keep track of it so we can report loc info.\n";
1861 OS << " if (it == MnemonicRange.first || ErrorInfo == i+1)\n";
1862 OS << " ErrorInfo = i+1;\n";
1864 OS << " ErrorInfo = ~0U;";
1865 OS << " // Otherwise, just reject this instance of the mnemonic.\n";
1866 OS << " OperandsValid = false;\n";
1870 OS << " if (!OperandsValid) continue;\n";
1872 // Emit check that the required features are available.
1873 OS << " if ((AvailableFeatures & it->RequiredFeatures) "
1874 << "!= it->RequiredFeatures) {\n";
1875 OS << " HadMatchOtherThanFeatures = true;\n";
1876 OS << " continue;\n";
1880 OS << " ConvertToMCInst(it->ConvertFn, Inst, it->Opcode, Operands);\n";
1882 // Call the post-processing function, if used.
1883 std::string InsnCleanupFn =
1884 AsmParser->getValueAsString("AsmParserInstCleanup");
1885 if (!InsnCleanupFn.empty())
1886 OS << " " << InsnCleanupFn << "(Inst);\n";
1888 OS << " return Match_Success;\n";
1891 OS << " // Okay, we had no match. Try to return a useful error code.\n";
1892 OS << " if (HadMatchOtherThanFeatures) return Match_MissingFeature;\n";
1893 OS << " return Match_InvalidOperand;\n";
1896 OS << "#endif // GET_MATCHER_IMPLEMENTATION\n\n";