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 // 2. The input can now be treated as a tuple of classes (static tokens are
67 // simple singleton sets). Each such tuple should generally map to a single
68 // instruction (we currently ignore cases where this isn't true, whee!!!),
69 // which we can emit a simple matcher for.
71 //===----------------------------------------------------------------------===//
73 #include "AsmMatcherEmitter.h"
74 #include "CodeGenTarget.h"
76 #include "StringMatcher.h"
77 #include "llvm/ADT/OwningPtr.h"
78 #include "llvm/ADT/PointerUnion.h"
79 #include "llvm/ADT/SmallPtrSet.h"
80 #include "llvm/ADT/SmallVector.h"
81 #include "llvm/ADT/STLExtras.h"
82 #include "llvm/ADT/StringExtras.h"
83 #include "llvm/Support/CommandLine.h"
84 #include "llvm/Support/Debug.h"
89 static cl::opt<std::string>
90 MatchPrefix("match-prefix", cl::init(""),
91 cl::desc("Only match instructions with the given prefix"));
96 struct SubtargetFeatureInfo;
98 /// ClassInfo - Helper class for storing the information about a particular
99 /// class of operands which can be matched.
102 /// Invalid kind, for use as a sentinel value.
105 /// The class for a particular token.
108 /// The (first) register class, subsequent register classes are
109 /// RegisterClass0+1, and so on.
112 /// The (first) user defined class, subsequent user defined classes are
113 /// UserClass0+1, and so on.
117 /// Kind - The class kind, which is either a predefined kind, or (UserClass0 +
118 /// N) for the Nth user defined class.
121 /// SuperClasses - The super classes of this class. Note that for simplicities
122 /// sake user operands only record their immediate super class, while register
123 /// operands include all superclasses.
124 std::vector<ClassInfo*> SuperClasses;
126 /// Name - The full class name, suitable for use in an enum.
129 /// ClassName - The unadorned generic name for this class (e.g., Token).
130 std::string ClassName;
132 /// ValueName - The name of the value this class represents; for a token this
133 /// is the literal token string, for an operand it is the TableGen class (or
134 /// empty if this is a derived class).
135 std::string ValueName;
137 /// PredicateMethod - The name of the operand method to test whether the
138 /// operand matches this class; this is not valid for Token or register kinds.
139 std::string PredicateMethod;
141 /// RenderMethod - The name of the operand method to add this operand to an
142 /// MCInst; this is not valid for Token or register kinds.
143 std::string RenderMethod;
145 /// For register classes, the records for all the registers in this class.
146 std::set<Record*> Registers;
149 /// isRegisterClass() - Check if this is a register class.
150 bool isRegisterClass() const {
151 return Kind >= RegisterClass0 && Kind < UserClass0;
154 /// isUserClass() - Check if this is a user defined class.
155 bool isUserClass() const {
156 return Kind >= UserClass0;
159 /// isRelatedTo - Check whether this class is "related" to \arg RHS. Classes
160 /// are related if they are in the same class hierarchy.
161 bool isRelatedTo(const ClassInfo &RHS) const {
162 // Tokens are only related to tokens.
163 if (Kind == Token || RHS.Kind == Token)
164 return Kind == Token && RHS.Kind == Token;
166 // Registers classes are only related to registers classes, and only if
167 // their intersection is non-empty.
168 if (isRegisterClass() || RHS.isRegisterClass()) {
169 if (!isRegisterClass() || !RHS.isRegisterClass())
172 std::set<Record*> Tmp;
173 std::insert_iterator< std::set<Record*> > II(Tmp, Tmp.begin());
174 std::set_intersection(Registers.begin(), Registers.end(),
175 RHS.Registers.begin(), RHS.Registers.end(),
181 // Otherwise we have two users operands; they are related if they are in the
182 // same class hierarchy.
184 // FIXME: This is an oversimplification, they should only be related if they
185 // intersect, however we don't have that information.
186 assert(isUserClass() && RHS.isUserClass() && "Unexpected class!");
187 const ClassInfo *Root = this;
188 while (!Root->SuperClasses.empty())
189 Root = Root->SuperClasses.front();
191 const ClassInfo *RHSRoot = &RHS;
192 while (!RHSRoot->SuperClasses.empty())
193 RHSRoot = RHSRoot->SuperClasses.front();
195 return Root == RHSRoot;
198 /// isSubsetOf - Test whether this class is a subset of \arg RHS;
199 bool isSubsetOf(const ClassInfo &RHS) const {
200 // This is a subset of RHS if it is the same class...
204 // ... or if any of its super classes are a subset of RHS.
205 for (std::vector<ClassInfo*>::const_iterator it = SuperClasses.begin(),
206 ie = SuperClasses.end(); it != ie; ++it)
207 if ((*it)->isSubsetOf(RHS))
213 /// operator< - Compare two classes.
214 bool operator<(const ClassInfo &RHS) const {
218 // Unrelated classes can be ordered by kind.
219 if (!isRelatedTo(RHS))
220 return Kind < RHS.Kind;
224 assert(0 && "Invalid kind!");
226 // Tokens are comparable by value.
228 // FIXME: Compare by enum value.
229 return ValueName < RHS.ValueName;
232 // This class preceeds the RHS if it is a proper subset of the RHS.
235 if (RHS.isSubsetOf(*this))
238 // Otherwise, order by name to ensure we have a total ordering.
239 return ValueName < RHS.ValueName;
244 /// MatchableInfo - Helper class for storing the necessary information for an
245 /// instruction or alias which is capable of being matched.
246 struct MatchableInfo {
248 /// Token - This is the token that the operand came from.
251 /// The unique class instance this operand should match.
254 /// The operand name this is, if anything.
257 explicit AsmOperand(StringRef T) : Token(T), Class(0) {}
260 /// ResOperand - This represents a single operand in the result instruction
261 /// generated by the match. In cases (like addressing modes) where a single
262 /// assembler operand expands to multiple MCOperands, this represents the
263 /// single assembler operand, not the MCOperand.
266 /// RenderAsmOperand - This represents an operand result that is
267 /// generated by calling the render method on the assembly operand. The
268 /// corresponding AsmOperand is specified by AsmOperandNum.
271 /// TiedOperand - This represents a result operand that is a duplicate of
272 /// a previous result operand.
275 /// ImmOperand - This represents an immediate value that is dumped into
279 /// RegOperand - This represents a fixed register that is dumped in.
284 /// This is the operand # in the AsmOperands list that this should be
286 unsigned AsmOperandNum;
288 /// TiedOperandNum - This is the (earlier) result operand that should be
290 unsigned TiedOperandNum;
292 /// ImmVal - This is the immediate value added to the instruction.
295 /// Register - This is the register record.
299 /// OpInfo - This is the information about the instruction operand that is
301 const CGIOperandList::OperandInfo *OpInfo;
303 static ResOperand getRenderedOp(unsigned AsmOpNum,
304 const CGIOperandList::OperandInfo *Op) {
306 X.Kind = RenderAsmOperand;
307 X.AsmOperandNum = AsmOpNum;
312 static ResOperand getTiedOp(unsigned TiedOperandNum,
313 const CGIOperandList::OperandInfo *Op) {
315 X.Kind = TiedOperand;
316 X.TiedOperandNum = TiedOperandNum;
321 static ResOperand getImmOp(int64_t Val,
322 const CGIOperandList::OperandInfo *Op) {
330 static ResOperand getRegOp(Record *Reg,
331 const CGIOperandList::OperandInfo *Op) {
341 /// TheDef - This is the definition of the instruction or InstAlias that this
342 /// matchable came from.
343 Record *const TheDef;
345 /// DefRec - This is the definition that it came from.
346 PointerUnion<const CodeGenInstruction*, const CodeGenInstAlias*> DefRec;
348 const CodeGenInstruction *getResultInst() const {
349 if (DefRec.is<const CodeGenInstruction*>())
350 return DefRec.get<const CodeGenInstruction*>();
351 return DefRec.get<const CodeGenInstAlias*>()->ResultInst;
354 /// ResOperands - This is the operand list that should be built for the result
356 std::vector<ResOperand> ResOperands;
358 /// AsmString - The assembly string for this instruction (with variants
359 /// removed), e.g. "movsx $src, $dst".
360 std::string AsmString;
362 /// Mnemonic - This is the first token of the matched instruction, its
366 /// AsmOperands - The textual operands that this instruction matches,
367 /// annotated with a class and where in the OperandList they were defined.
368 /// This directly corresponds to the tokenized AsmString after the mnemonic is
370 SmallVector<AsmOperand, 4> AsmOperands;
372 /// Predicates - The required subtarget features to match this instruction.
373 SmallVector<SubtargetFeatureInfo*, 4> RequiredFeatures;
375 /// ConversionFnKind - The enum value which is passed to the generated
376 /// ConvertToMCInst to convert parsed operands into an MCInst for this
378 std::string ConversionFnKind;
380 MatchableInfo(const CodeGenInstruction &CGI)
381 : TheDef(CGI.TheDef), DefRec(&CGI), AsmString(CGI.AsmString) {
384 MatchableInfo(const CodeGenInstAlias *Alias)
385 : TheDef(Alias->TheDef), DefRec(Alias), AsmString(Alias->AsmString) {
388 void Initialize(const AsmMatcherInfo &Info,
389 SmallPtrSet<Record*, 16> &SingletonRegisters);
391 /// Validate - Return true if this matchable is a valid thing to match against
392 /// and perform a bunch of validity checking.
393 bool Validate(StringRef CommentDelimiter, bool Hack) const;
395 /// getSingletonRegisterForAsmOperand - If the specified token is a singleton
396 /// register, return the Record for it, otherwise return null.
397 Record *getSingletonRegisterForAsmOperand(unsigned i,
398 const AsmMatcherInfo &Info) const;
400 int FindAsmOperandNamed(StringRef N) const {
401 for (unsigned i = 0, e = AsmOperands.size(); i != e; ++i)
402 if (N == AsmOperands[i].SrcOpName)
407 void BuildInstructionResultOperands();
408 void BuildAliasResultOperands();
410 /// operator< - Compare two matchables.
411 bool operator<(const MatchableInfo &RHS) const {
412 // The primary comparator is the instruction mnemonic.
413 if (Mnemonic != RHS.Mnemonic)
414 return Mnemonic < RHS.Mnemonic;
416 if (AsmOperands.size() != RHS.AsmOperands.size())
417 return AsmOperands.size() < RHS.AsmOperands.size();
419 // Compare lexicographically by operand. The matcher validates that other
420 // orderings wouldn't be ambiguous using \see CouldMatchAmiguouslyWith().
421 for (unsigned i = 0, e = AsmOperands.size(); i != e; ++i) {
422 if (*AsmOperands[i].Class < *RHS.AsmOperands[i].Class)
424 if (*RHS.AsmOperands[i].Class < *AsmOperands[i].Class)
431 /// CouldMatchAmiguouslyWith - Check whether this matchable could
432 /// ambiguously match the same set of operands as \arg RHS (without being a
433 /// strictly superior match).
434 bool CouldMatchAmiguouslyWith(const MatchableInfo &RHS) {
435 // The primary comparator is the instruction mnemonic.
436 if (Mnemonic != RHS.Mnemonic)
439 // The number of operands is unambiguous.
440 if (AsmOperands.size() != RHS.AsmOperands.size())
443 // Otherwise, make sure the ordering of the two instructions is unambiguous
444 // by checking that either (a) a token or operand kind discriminates them,
445 // or (b) the ordering among equivalent kinds is consistent.
447 // Tokens and operand kinds are unambiguous (assuming a correct target
449 for (unsigned i = 0, e = AsmOperands.size(); i != e; ++i)
450 if (AsmOperands[i].Class->Kind != RHS.AsmOperands[i].Class->Kind ||
451 AsmOperands[i].Class->Kind == ClassInfo::Token)
452 if (*AsmOperands[i].Class < *RHS.AsmOperands[i].Class ||
453 *RHS.AsmOperands[i].Class < *AsmOperands[i].Class)
456 // Otherwise, this operand could commute if all operands are equivalent, or
457 // there is a pair of operands that compare less than and a pair that
458 // compare greater than.
459 bool HasLT = false, HasGT = false;
460 for (unsigned i = 0, e = AsmOperands.size(); i != e; ++i) {
461 if (*AsmOperands[i].Class < *RHS.AsmOperands[i].Class)
463 if (*RHS.AsmOperands[i].Class < *AsmOperands[i].Class)
467 return !(HasLT ^ HasGT);
473 void TokenizeAsmString(const AsmMatcherInfo &Info);
476 /// SubtargetFeatureInfo - Helper class for storing information on a subtarget
477 /// feature which participates in instruction matching.
478 struct SubtargetFeatureInfo {
479 /// \brief The predicate record for this feature.
482 /// \brief An unique index assigned to represent this feature.
485 SubtargetFeatureInfo(Record *D, unsigned Idx) : TheDef(D), Index(Idx) {}
487 /// \brief The name of the enumerated constant identifying this feature.
488 std::string getEnumName() const {
489 return "Feature_" + TheDef->getName();
493 class AsmMatcherInfo {
496 RecordKeeper &Records;
498 /// The tablegen AsmParser record.
501 /// Target - The target information.
502 CodeGenTarget &Target;
504 /// The AsmParser "RegisterPrefix" value.
505 std::string RegisterPrefix;
507 /// The classes which are needed for matching.
508 std::vector<ClassInfo*> Classes;
510 /// The information on the matchables to match.
511 std::vector<MatchableInfo*> Matchables;
513 /// Map of Register records to their class information.
514 std::map<Record*, ClassInfo*> RegisterClasses;
516 /// Map of Predicate records to their subtarget information.
517 std::map<Record*, SubtargetFeatureInfo*> SubtargetFeatures;
520 /// Map of token to class information which has already been constructed.
521 std::map<std::string, ClassInfo*> TokenClasses;
523 /// Map of RegisterClass records to their class information.
524 std::map<Record*, ClassInfo*> RegisterClassClasses;
526 /// Map of AsmOperandClass records to their class information.
527 std::map<Record*, ClassInfo*> AsmOperandClasses;
530 /// getTokenClass - Lookup or create the class for the given token.
531 ClassInfo *getTokenClass(StringRef Token);
533 /// getOperandClass - Lookup or create the class for the given operand.
534 ClassInfo *getOperandClass(const CGIOperandList::OperandInfo &OI);
536 /// BuildRegisterClasses - Build the ClassInfo* instances for register
538 void BuildRegisterClasses(SmallPtrSet<Record*, 16> &SingletonRegisters);
540 /// BuildOperandClasses - Build the ClassInfo* instances for user defined
542 void BuildOperandClasses();
544 void BuildInstructionOperandReference(MatchableInfo *II,
546 MatchableInfo::AsmOperand &Op);
547 void BuildAliasOperandReference(MatchableInfo *II,
549 MatchableInfo::AsmOperand &Op);
552 AsmMatcherInfo(Record *AsmParser,
553 CodeGenTarget &Target,
554 RecordKeeper &Records);
556 /// BuildInfo - Construct the various tables used during matching.
559 /// getSubtargetFeature - Lookup or create the subtarget feature info for the
561 SubtargetFeatureInfo *getSubtargetFeature(Record *Def) const {
562 assert(Def->isSubClassOf("Predicate") && "Invalid predicate type!");
563 std::map<Record*, SubtargetFeatureInfo*>::const_iterator I =
564 SubtargetFeatures.find(Def);
565 return I == SubtargetFeatures.end() ? 0 : I->second;
568 RecordKeeper &getRecords() const {
575 void MatchableInfo::dump() {
576 errs() << TheDef->getName() << " -- " << "flattened:\"" << AsmString <<"\"\n";
578 for (unsigned i = 0, e = AsmOperands.size(); i != e; ++i) {
579 AsmOperand &Op = AsmOperands[i];
580 errs() << " op[" << i << "] = " << Op.Class->ClassName << " - ";
581 errs() << '\"' << Op.Token << "\"\n";
585 void MatchableInfo::Initialize(const AsmMatcherInfo &Info,
586 SmallPtrSet<Record*, 16> &SingletonRegisters) {
587 // TODO: Eventually support asmparser for Variant != 0.
588 AsmString = CodeGenInstruction::FlattenAsmStringVariants(AsmString, 0);
590 TokenizeAsmString(Info);
592 // Compute the require features.
593 std::vector<Record*> Predicates =TheDef->getValueAsListOfDefs("Predicates");
594 for (unsigned i = 0, e = Predicates.size(); i != e; ++i)
595 if (SubtargetFeatureInfo *Feature =
596 Info.getSubtargetFeature(Predicates[i]))
597 RequiredFeatures.push_back(Feature);
599 // Collect singleton registers, if used.
600 for (unsigned i = 0, e = AsmOperands.size(); i != e; ++i) {
601 if (Record *Reg = getSingletonRegisterForAsmOperand(i, Info))
602 SingletonRegisters.insert(Reg);
606 /// TokenizeAsmString - Tokenize a simplified assembly string.
607 void MatchableInfo::TokenizeAsmString(const AsmMatcherInfo &Info) {
608 StringRef String = AsmString;
611 for (unsigned i = 0, e = String.size(); i != e; ++i) {
621 AsmOperands.push_back(AsmOperand(String.slice(Prev, i)));
624 if (!isspace(String[i]) && String[i] != ',')
625 AsmOperands.push_back(AsmOperand(String.substr(i, 1)));
631 AsmOperands.push_back(AsmOperand(String.slice(Prev, i)));
635 assert(i != String.size() && "Invalid quoted character");
636 AsmOperands.push_back(AsmOperand(String.substr(i, 1)));
642 AsmOperands.push_back(AsmOperand(String.slice(Prev, i)));
646 // If this isn't "${", treat like a normal token.
647 if (i + 1 == String.size() || String[i + 1] != '{') {
652 StringRef::iterator End = std::find(String.begin() + i, String.end(),'}');
653 assert(End != String.end() && "Missing brace in operand reference!");
654 size_t EndPos = End - String.begin();
655 AsmOperands.push_back(AsmOperand(String.slice(i, EndPos+1)));
663 AsmOperands.push_back(AsmOperand(String.slice(Prev, i)));
672 if (InTok && Prev != String.size())
673 AsmOperands.push_back(AsmOperand(String.substr(Prev)));
675 // The first token of the instruction is the mnemonic, which must be a
676 // simple string, not a $foo variable or a singleton register.
677 assert(!AsmOperands.empty() && "Instruction has no tokens?");
678 Mnemonic = AsmOperands[0].Token;
679 if (Mnemonic[0] == '$' || getSingletonRegisterForAsmOperand(0, Info))
680 throw TGError(TheDef->getLoc(),
681 "Invalid instruction mnemonic '" + Mnemonic.str() + "'!");
683 // Remove the first operand, it is tracked in the mnemonic field.
684 AsmOperands.erase(AsmOperands.begin());
689 bool MatchableInfo::Validate(StringRef CommentDelimiter, bool Hack) const {
690 // Reject matchables with no .s string.
691 if (AsmString.empty())
692 throw TGError(TheDef->getLoc(), "instruction with empty asm string");
694 // Reject any matchables with a newline in them, they should be marked
695 // isCodeGenOnly if they are pseudo instructions.
696 if (AsmString.find('\n') != std::string::npos)
697 throw TGError(TheDef->getLoc(),
698 "multiline instruction is not valid for the asmparser, "
699 "mark it isCodeGenOnly");
701 // Remove comments from the asm string. We know that the asmstring only
703 if (!CommentDelimiter.empty() &&
704 StringRef(AsmString).find(CommentDelimiter) != StringRef::npos)
705 throw TGError(TheDef->getLoc(),
706 "asmstring for instruction has comment character in it, "
707 "mark it isCodeGenOnly");
709 // Reject matchables with operand modifiers, these aren't something we can
710 // handle, the target should be refactored to use operands instead of
713 // Also, check for instructions which reference the operand multiple times;
714 // this implies a constraint we would not honor.
715 std::set<std::string> OperandNames;
716 for (unsigned i = 0, e = AsmOperands.size(); i != e; ++i) {
717 StringRef Tok = AsmOperands[i].Token;
718 if (Tok[0] == '$' && Tok.find(':') != StringRef::npos)
719 throw TGError(TheDef->getLoc(),
720 "matchable with operand modifier '" + Tok.str() +
721 "' not supported by asm matcher. Mark isCodeGenOnly!");
723 // Verify that any operand is only mentioned once.
724 // We reject aliases and ignore instructions for now.
725 if (Tok[0] == '$' && !OperandNames.insert(Tok).second) {
727 throw TGError(TheDef->getLoc(),
728 "ERROR: matchable with tied operand '" + Tok.str() +
729 "' can never be matched!");
730 // FIXME: Should reject these. The ARM backend hits this with $lane in a
731 // bunch of instructions. It is unclear what the right answer is.
733 errs() << "warning: '" << TheDef->getName() << "': "
734 << "ignoring instruction with tied operand '"
735 << Tok.str() << "'\n";
745 /// getSingletonRegisterForAsmOperand - If the specified token is a singleton
746 /// register, return the register name, otherwise return a null StringRef.
747 Record *MatchableInfo::
748 getSingletonRegisterForAsmOperand(unsigned i, const AsmMatcherInfo &Info) const{
749 StringRef Tok = AsmOperands[i].Token;
750 if (!Tok.startswith(Info.RegisterPrefix))
753 StringRef RegName = Tok.substr(Info.RegisterPrefix.size());
754 if (const CodeGenRegister *Reg = Info.Target.getRegisterByName(RegName))
757 // If there is no register prefix (i.e. "%" in "%eax"), then this may
758 // be some random non-register token, just ignore it.
759 if (Info.RegisterPrefix.empty())
762 // Otherwise, we have something invalid prefixed with the register prefix,
764 std::string Err = "unable to find register for '" + RegName.str() +
765 "' (which matches register prefix)";
766 throw TGError(TheDef->getLoc(), Err);
770 static std::string getEnumNameForToken(StringRef Str) {
773 for (StringRef::iterator it = Str.begin(), ie = Str.end(); it != ie; ++it) {
775 case '*': Res += "_STAR_"; break;
776 case '%': Res += "_PCT_"; break;
777 case ':': Res += "_COLON_"; break;
778 case '!': Res += "_EXCLAIM_"; break;
779 case '.': Res += "_DOT_"; break;
784 Res += "_" + utostr((unsigned) *it) + "_";
791 ClassInfo *AsmMatcherInfo::getTokenClass(StringRef Token) {
792 ClassInfo *&Entry = TokenClasses[Token];
795 Entry = new ClassInfo();
796 Entry->Kind = ClassInfo::Token;
797 Entry->ClassName = "Token";
798 Entry->Name = "MCK_" + getEnumNameForToken(Token);
799 Entry->ValueName = Token;
800 Entry->PredicateMethod = "<invalid>";
801 Entry->RenderMethod = "<invalid>";
802 Classes.push_back(Entry);
809 AsmMatcherInfo::getOperandClass(const CGIOperandList::OperandInfo &OI) {
810 if (OI.Rec->isSubClassOf("RegisterClass")) {
811 if (ClassInfo *CI = RegisterClassClasses[OI.Rec])
813 throw TGError(OI.Rec->getLoc(), "register class has no class info!");
816 assert(OI.Rec->isSubClassOf("Operand") && "Unexpected operand!");
817 Record *MatchClass = OI.Rec->getValueAsDef("ParserMatchClass");
818 if (ClassInfo *CI = AsmOperandClasses[MatchClass])
821 throw TGError(OI.Rec->getLoc(), "operand has no match class!");
824 void AsmMatcherInfo::
825 BuildRegisterClasses(SmallPtrSet<Record*, 16> &SingletonRegisters) {
826 const std::vector<CodeGenRegister> &Registers = Target.getRegisters();
827 const std::vector<CodeGenRegisterClass> &RegClassList =
828 Target.getRegisterClasses();
830 // The register sets used for matching.
831 std::set< std::set<Record*> > RegisterSets;
833 // Gather the defined sets.
834 for (std::vector<CodeGenRegisterClass>::const_iterator it =
835 RegClassList.begin(), ie = RegClassList.end(); it != ie; ++it)
836 RegisterSets.insert(std::set<Record*>(it->Elements.begin(),
837 it->Elements.end()));
839 // Add any required singleton sets.
840 for (SmallPtrSet<Record*, 16>::iterator it = SingletonRegisters.begin(),
841 ie = SingletonRegisters.end(); it != ie; ++it) {
843 RegisterSets.insert(std::set<Record*>(&Rec, &Rec + 1));
846 // Introduce derived sets where necessary (when a register does not determine
847 // a unique register set class), and build the mapping of registers to the set
848 // they should classify to.
849 std::map<Record*, std::set<Record*> > RegisterMap;
850 for (std::vector<CodeGenRegister>::const_iterator it = Registers.begin(),
851 ie = Registers.end(); it != ie; ++it) {
852 const CodeGenRegister &CGR = *it;
853 // Compute the intersection of all sets containing this register.
854 std::set<Record*> ContainingSet;
856 for (std::set< std::set<Record*> >::iterator it = RegisterSets.begin(),
857 ie = RegisterSets.end(); it != ie; ++it) {
858 if (!it->count(CGR.TheDef))
861 if (ContainingSet.empty()) {
866 std::set<Record*> Tmp;
867 std::swap(Tmp, ContainingSet);
868 std::insert_iterator< std::set<Record*> > II(ContainingSet,
869 ContainingSet.begin());
870 std::set_intersection(Tmp.begin(), Tmp.end(), it->begin(), it->end(), II);
873 if (!ContainingSet.empty()) {
874 RegisterSets.insert(ContainingSet);
875 RegisterMap.insert(std::make_pair(CGR.TheDef, ContainingSet));
879 // Construct the register classes.
880 std::map<std::set<Record*>, ClassInfo*> RegisterSetClasses;
882 for (std::set< std::set<Record*> >::iterator it = RegisterSets.begin(),
883 ie = RegisterSets.end(); it != ie; ++it, ++Index) {
884 ClassInfo *CI = new ClassInfo();
885 CI->Kind = ClassInfo::RegisterClass0 + Index;
886 CI->ClassName = "Reg" + utostr(Index);
887 CI->Name = "MCK_Reg" + utostr(Index);
889 CI->PredicateMethod = ""; // unused
890 CI->RenderMethod = "addRegOperands";
892 Classes.push_back(CI);
893 RegisterSetClasses.insert(std::make_pair(*it, CI));
896 // Find the superclasses; we could compute only the subgroup lattice edges,
897 // but there isn't really a point.
898 for (std::set< std::set<Record*> >::iterator it = RegisterSets.begin(),
899 ie = RegisterSets.end(); it != ie; ++it) {
900 ClassInfo *CI = RegisterSetClasses[*it];
901 for (std::set< std::set<Record*> >::iterator it2 = RegisterSets.begin(),
902 ie2 = RegisterSets.end(); it2 != ie2; ++it2)
904 std::includes(it2->begin(), it2->end(), it->begin(), it->end()))
905 CI->SuperClasses.push_back(RegisterSetClasses[*it2]);
908 // Name the register classes which correspond to a user defined RegisterClass.
909 for (std::vector<CodeGenRegisterClass>::const_iterator
910 it = RegClassList.begin(), ie = RegClassList.end(); it != ie; ++it) {
911 ClassInfo *CI = RegisterSetClasses[std::set<Record*>(it->Elements.begin(),
912 it->Elements.end())];
913 if (CI->ValueName.empty()) {
914 CI->ClassName = it->getName();
915 CI->Name = "MCK_" + it->getName();
916 CI->ValueName = it->getName();
918 CI->ValueName = CI->ValueName + "," + it->getName();
920 RegisterClassClasses.insert(std::make_pair(it->TheDef, CI));
923 // Populate the map for individual registers.
924 for (std::map<Record*, std::set<Record*> >::iterator it = RegisterMap.begin(),
925 ie = RegisterMap.end(); it != ie; ++it)
926 RegisterClasses[it->first] = RegisterSetClasses[it->second];
928 // Name the register classes which correspond to singleton registers.
929 for (SmallPtrSet<Record*, 16>::iterator it = SingletonRegisters.begin(),
930 ie = SingletonRegisters.end(); it != ie; ++it) {
932 ClassInfo *CI = RegisterClasses[Rec];
933 assert(CI && "Missing singleton register class info!");
935 if (CI->ValueName.empty()) {
936 CI->ClassName = Rec->getName();
937 CI->Name = "MCK_" + Rec->getName();
938 CI->ValueName = Rec->getName();
940 CI->ValueName = CI->ValueName + "," + Rec->getName();
944 void AsmMatcherInfo::BuildOperandClasses() {
945 std::vector<Record*> AsmOperands =
946 Records.getAllDerivedDefinitions("AsmOperandClass");
948 // Pre-populate AsmOperandClasses map.
949 for (std::vector<Record*>::iterator it = AsmOperands.begin(),
950 ie = AsmOperands.end(); it != ie; ++it)
951 AsmOperandClasses[*it] = new ClassInfo();
954 for (std::vector<Record*>::iterator it = AsmOperands.begin(),
955 ie = AsmOperands.end(); it != ie; ++it, ++Index) {
956 ClassInfo *CI = AsmOperandClasses[*it];
957 CI->Kind = ClassInfo::UserClass0 + Index;
959 ListInit *Supers = (*it)->getValueAsListInit("SuperClasses");
960 for (unsigned i = 0, e = Supers->getSize(); i != e; ++i) {
961 DefInit *DI = dynamic_cast<DefInit*>(Supers->getElement(i));
963 PrintError((*it)->getLoc(), "Invalid super class reference!");
967 ClassInfo *SC = AsmOperandClasses[DI->getDef()];
969 PrintError((*it)->getLoc(), "Invalid super class reference!");
971 CI->SuperClasses.push_back(SC);
973 CI->ClassName = (*it)->getValueAsString("Name");
974 CI->Name = "MCK_" + CI->ClassName;
975 CI->ValueName = (*it)->getName();
977 // Get or construct the predicate method name.
978 Init *PMName = (*it)->getValueInit("PredicateMethod");
979 if (StringInit *SI = dynamic_cast<StringInit*>(PMName)) {
980 CI->PredicateMethod = SI->getValue();
982 assert(dynamic_cast<UnsetInit*>(PMName) &&
983 "Unexpected PredicateMethod field!");
984 CI->PredicateMethod = "is" + CI->ClassName;
987 // Get or construct the render method name.
988 Init *RMName = (*it)->getValueInit("RenderMethod");
989 if (StringInit *SI = dynamic_cast<StringInit*>(RMName)) {
990 CI->RenderMethod = SI->getValue();
992 assert(dynamic_cast<UnsetInit*>(RMName) &&
993 "Unexpected RenderMethod field!");
994 CI->RenderMethod = "add" + CI->ClassName + "Operands";
997 AsmOperandClasses[*it] = CI;
998 Classes.push_back(CI);
1002 AsmMatcherInfo::AsmMatcherInfo(Record *asmParser,
1003 CodeGenTarget &target,
1004 RecordKeeper &records)
1005 : Records(records), AsmParser(asmParser), Target(target),
1006 RegisterPrefix(AsmParser->getValueAsString("RegisterPrefix")) {
1010 void AsmMatcherInfo::BuildInfo() {
1011 // Build information about all of the AssemblerPredicates.
1012 std::vector<Record*> AllPredicates =
1013 Records.getAllDerivedDefinitions("Predicate");
1014 for (unsigned i = 0, e = AllPredicates.size(); i != e; ++i) {
1015 Record *Pred = AllPredicates[i];
1016 // Ignore predicates that are not intended for the assembler.
1017 if (!Pred->getValueAsBit("AssemblerMatcherPredicate"))
1020 if (Pred->getName().empty())
1021 throw TGError(Pred->getLoc(), "Predicate has no name!");
1023 unsigned FeatureNo = SubtargetFeatures.size();
1024 SubtargetFeatures[Pred] = new SubtargetFeatureInfo(Pred, FeatureNo);
1025 assert(FeatureNo < 32 && "Too many subtarget features!");
1028 StringRef CommentDelimiter = AsmParser->getValueAsString("CommentDelimiter");
1030 // Parse the instructions; we need to do this first so that we can gather the
1031 // singleton register classes.
1032 SmallPtrSet<Record*, 16> SingletonRegisters;
1033 for (CodeGenTarget::inst_iterator I = Target.inst_begin(),
1034 E = Target.inst_end(); I != E; ++I) {
1035 const CodeGenInstruction &CGI = **I;
1037 // If the tblgen -match-prefix option is specified (for tblgen hackers),
1038 // filter the set of instructions we consider.
1039 if (!StringRef(CGI.TheDef->getName()).startswith(MatchPrefix))
1042 // Ignore "codegen only" instructions.
1043 if (CGI.TheDef->getValueAsBit("isCodeGenOnly"))
1046 // Validate the operand list to ensure we can handle this instruction.
1047 for (unsigned i = 0, e = CGI.Operands.size(); i != e; ++i) {
1048 const CGIOperandList::OperandInfo &OI = CGI.Operands[i];
1050 // Validate tied operands.
1051 if (OI.getTiedRegister() != -1) {
1052 // If we have a tied operand that consists of multiple MCOperands, reject
1053 // it. We reject aliases and ignore instructions for now.
1054 if (OI.MINumOperands != 1) {
1055 // FIXME: Should reject these. The ARM backend hits this with $lane
1056 // in a bunch of instructions. It is unclear what the right answer is.
1058 errs() << "warning: '" << CGI.TheDef->getName() << "': "
1059 << "ignoring instruction with multi-operand tied operand '"
1060 << OI.Name << "'\n";
1067 OwningPtr<MatchableInfo> II(new MatchableInfo(CGI));
1069 II->Initialize(*this, SingletonRegisters);
1071 // Ignore instructions which shouldn't be matched and diagnose invalid
1072 // instruction definitions with an error.
1073 if (!II->Validate(CommentDelimiter, true))
1076 // Ignore "Int_*" and "*_Int" instructions, which are internal aliases.
1078 // FIXME: This is a total hack.
1079 if (StringRef(II->TheDef->getName()).startswith("Int_") ||
1080 StringRef(II->TheDef->getName()).endswith("_Int"))
1083 Matchables.push_back(II.take());
1086 // Parse all of the InstAlias definitions and stick them in the list of
1088 std::vector<Record*> AllInstAliases =
1089 Records.getAllDerivedDefinitions("InstAlias");
1090 for (unsigned i = 0, e = AllInstAliases.size(); i != e; ++i) {
1091 CodeGenInstAlias *Alias = new CodeGenInstAlias(AllInstAliases[i], Target);
1093 OwningPtr<MatchableInfo> II(new MatchableInfo(Alias));
1095 II->Initialize(*this, SingletonRegisters);
1097 // Validate the alias definitions.
1098 II->Validate(CommentDelimiter, false);
1100 Matchables.push_back(II.take());
1103 // Build info for the register classes.
1104 BuildRegisterClasses(SingletonRegisters);
1106 // Build info for the user defined assembly operand classes.
1107 BuildOperandClasses();
1109 // Build the information about matchables, now that we have fully formed
1111 for (std::vector<MatchableInfo*>::iterator it = Matchables.begin(),
1112 ie = Matchables.end(); it != ie; ++it) {
1113 MatchableInfo *II = *it;
1115 // Parse the tokens after the mnemonic.
1116 for (unsigned i = 0, e = II->AsmOperands.size(); i != e; ++i) {
1117 MatchableInfo::AsmOperand &Op = II->AsmOperands[i];
1118 StringRef Token = Op.Token;
1120 // Check for singleton registers.
1121 if (Record *RegRecord = II->getSingletonRegisterForAsmOperand(i, *this)) {
1122 Op.Class = RegisterClasses[RegRecord];
1123 assert(Op.Class && Op.Class->Registers.size() == 1 &&
1124 "Unexpected class for singleton register");
1128 // Check for simple tokens.
1129 if (Token[0] != '$') {
1130 Op.Class = getTokenClass(Token);
1134 if (Token.size() > 1 && isdigit(Token[1])) {
1135 Op.Class = getTokenClass(Token);
1139 // Otherwise this is an operand reference.
1140 StringRef OperandName;
1141 if (Token[1] == '{')
1142 OperandName = Token.substr(2, Token.size() - 3);
1144 OperandName = Token.substr(1);
1146 if (II->DefRec.is<const CodeGenInstruction*>())
1147 BuildInstructionOperandReference(II, OperandName, Op);
1149 BuildAliasOperandReference(II, OperandName, Op);
1152 if (II->DefRec.is<const CodeGenInstruction*>())
1153 II->BuildInstructionResultOperands();
1155 II->BuildAliasResultOperands();
1158 // Reorder classes so that classes preceed super classes.
1159 std::sort(Classes.begin(), Classes.end(), less_ptr<ClassInfo>());
1162 /// BuildInstructionOperandReference - The specified operand is a reference to a
1163 /// named operand such as $src. Resolve the Class and OperandInfo pointers.
1164 void AsmMatcherInfo::
1165 BuildInstructionOperandReference(MatchableInfo *II,
1166 StringRef OperandName,
1167 MatchableInfo::AsmOperand &Op) {
1168 const CodeGenInstruction &CGI = *II->DefRec.get<const CodeGenInstruction*>();
1169 const CGIOperandList &Operands = CGI.Operands;
1171 // Map this token to an operand.
1173 if (!Operands.hasOperandNamed(OperandName, Idx))
1174 throw TGError(II->TheDef->getLoc(), "error: unable to find operand: '" +
1175 OperandName.str() + "'");
1177 // Set up the operand class.
1178 Op.Class = getOperandClass(Operands[Idx]);
1180 // If the named operand is tied, canonicalize it to the untied operand.
1181 // For example, something like:
1182 // (outs GPR:$dst), (ins GPR:$src)
1183 // with an asmstring of
1185 // we want to canonicalize to:
1187 // so that we know how to provide the $dst operand when filling in the result.
1188 int OITied = Operands[Idx].getTiedRegister();
1190 // The tied operand index is an MIOperand index, find the operand that
1192 for (unsigned i = 0, e = Operands.size(); i != e; ++i) {
1193 if (Operands[i].MIOperandNo == unsigned(OITied)) {
1194 OperandName = Operands[i].Name;
1200 Op.SrcOpName = OperandName;
1203 /// BuildAliasOperandReference - When parsing an operand reference out of the
1204 /// matching string (e.g. "movsx $src, $dst"), determine what the class of the
1205 /// operand reference is by looking it up in the result pattern definition.
1206 void AsmMatcherInfo::BuildAliasOperandReference(MatchableInfo *II,
1207 StringRef OperandName,
1208 MatchableInfo::AsmOperand &Op) {
1209 const CodeGenInstAlias &CGA = *II->DefRec.get<const CodeGenInstAlias*>();
1211 // Set up the operand class.
1212 for (unsigned i = 0, e = CGA.ResultOperands.size(); i != e; ++i)
1213 if (CGA.ResultOperands[i].isRecord() &&
1214 CGA.ResultOperands[i].getName() == OperandName) {
1215 // It's safe to go with the first one we find, because CodeGenInstAlias
1216 // validates that all operands with the same name have the same record.
1217 unsigned ResultIdx = CGA.ResultInstOperandIndex[i];
1218 Op.Class = getOperandClass(CGA.ResultInst->Operands[ResultIdx]);
1219 Op.SrcOpName = OperandName;
1223 throw TGError(II->TheDef->getLoc(), "error: unable to find operand: '" +
1224 OperandName.str() + "'");
1227 void MatchableInfo::BuildInstructionResultOperands() {
1228 const CodeGenInstruction *ResultInst = getResultInst();
1230 // Loop over all operands of the result instruction, determining how to
1232 for (unsigned i = 0, e = ResultInst->Operands.size(); i != e; ++i) {
1233 const CGIOperandList::OperandInfo &OpInfo = ResultInst->Operands[i];
1235 // If this is a tied operand, just copy from the previously handled operand.
1236 int TiedOp = OpInfo.getTiedRegister();
1238 ResOperands.push_back(ResOperand::getTiedOp(TiedOp, &OpInfo));
1242 // Find out what operand from the asmparser that this MCInst operand comes
1244 int SrcOperand = FindAsmOperandNamed(OpInfo.Name);
1246 if (!OpInfo.Name.empty() && SrcOperand != -1) {
1247 ResOperands.push_back(ResOperand::getRenderedOp(SrcOperand, &OpInfo));
1251 throw TGError(TheDef->getLoc(), "Instruction '" +
1252 TheDef->getName() + "' has operand '" + OpInfo.Name +
1253 "' that doesn't appear in asm string!");
1257 void MatchableInfo::BuildAliasResultOperands() {
1258 const CodeGenInstAlias &CGA = *DefRec.get<const CodeGenInstAlias*>();
1259 const CodeGenInstruction *ResultInst = getResultInst();
1261 // Loop over all operands of the result instruction, determining how to
1263 unsigned AliasOpNo = 0;
1264 for (unsigned i = 0, e = ResultInst->Operands.size(); i != e; ++i) {
1265 const CGIOperandList::OperandInfo &OpInfo = ResultInst->Operands[i];
1267 // If this is a tied operand, just copy from the previously handled operand.
1268 int TiedOp = OpInfo.getTiedRegister();
1270 ResOperands.push_back(ResOperand::getTiedOp(TiedOp, &OpInfo));
1274 // Find out what operand from the asmparser that this MCInst operand comes
1276 switch (CGA.ResultOperands[AliasOpNo].Kind) {
1277 case CodeGenInstAlias::ResultOperand::K_Record: {
1278 StringRef Name = CGA.ResultOperands[AliasOpNo++].getName();
1279 int SrcOperand = FindAsmOperandNamed(Name);
1280 if (SrcOperand != -1) {
1281 ResOperands.push_back(ResOperand::getRenderedOp(SrcOperand, &OpInfo));
1285 throw TGError(TheDef->getLoc(), "Instruction '" +
1286 TheDef->getName() + "' has operand '" + OpInfo.Name +
1287 "' that doesn't appear in asm string!");
1289 case CodeGenInstAlias::ResultOperand::K_Imm: {
1290 int64_t ImmVal = CGA.ResultOperands[AliasOpNo++].getImm();
1291 ResOperands.push_back(ResOperand::getImmOp(ImmVal, &OpInfo));
1295 case CodeGenInstAlias::ResultOperand::K_Reg: {
1296 Record *Reg = CGA.ResultOperands[AliasOpNo++].getRegister();
1297 ResOperands.push_back(ResOperand::getRegOp(Reg, &OpInfo));
1304 static void EmitConvertToMCInst(CodeGenTarget &Target,
1305 std::vector<MatchableInfo*> &Infos,
1307 // Write the convert function to a separate stream, so we can drop it after
1309 std::string ConvertFnBody;
1310 raw_string_ostream CvtOS(ConvertFnBody);
1312 // Function we have already generated.
1313 std::set<std::string> GeneratedFns;
1315 // Start the unified conversion function.
1316 CvtOS << "static void ConvertToMCInst(ConversionKind Kind, MCInst &Inst, "
1317 << "unsigned Opcode,\n"
1318 << " const SmallVectorImpl<MCParsedAsmOperand*"
1319 << "> &Operands) {\n";
1320 CvtOS << " Inst.setOpcode(Opcode);\n";
1321 CvtOS << " switch (Kind) {\n";
1322 CvtOS << " default:\n";
1324 // Start the enum, which we will generate inline.
1326 OS << "// Unified function for converting operands to MCInst instances.\n\n";
1327 OS << "enum ConversionKind {\n";
1329 // TargetOperandClass - This is the target's operand class, like X86Operand.
1330 std::string TargetOperandClass = Target.getName() + "Operand";
1332 for (std::vector<MatchableInfo*>::const_iterator it = Infos.begin(),
1333 ie = Infos.end(); it != ie; ++it) {
1334 MatchableInfo &II = **it;
1336 // Build the conversion function signature.
1337 std::string Signature = "Convert";
1338 std::string CaseBody;
1339 raw_string_ostream CaseOS(CaseBody);
1341 // Compute the convert enum and the case body.
1342 for (unsigned i = 0, e = II.ResOperands.size(); i != e; ++i) {
1343 const MatchableInfo::ResOperand &OpInfo = II.ResOperands[i];
1345 // Generate code to populate each result operand.
1346 switch (OpInfo.Kind) {
1347 case MatchableInfo::ResOperand::RenderAsmOperand: {
1348 // This comes from something we parsed.
1349 MatchableInfo::AsmOperand &Op = II.AsmOperands[OpInfo.AsmOperandNum];
1351 // Registers are always converted the same, don't duplicate the
1352 // conversion function based on them.
1354 if (Op.Class->isRegisterClass())
1357 Signature += Op.Class->ClassName;
1358 Signature += utostr(OpInfo.OpInfo->MINumOperands);
1359 Signature += "_" + itostr(OpInfo.AsmOperandNum);
1361 CaseOS << " ((" << TargetOperandClass << "*)Operands["
1362 << (OpInfo.AsmOperandNum+1) << "])->" << Op.Class->RenderMethod
1363 << "(Inst, " << OpInfo.OpInfo->MINumOperands << ");\n";
1367 case MatchableInfo::ResOperand::TiedOperand: {
1368 // If this operand is tied to a previous one, just copy the MCInst
1369 // operand from the earlier one.We can only tie single MCOperand values.
1370 //assert(OpInfo.OpInfo->MINumOperands == 1 && "Not a singular MCOperand");
1371 unsigned TiedOp = OpInfo.TiedOperandNum;
1372 assert(i > TiedOp && "Tied operand preceeds its target!");
1373 CaseOS << " Inst.addOperand(Inst.getOperand(" << TiedOp << "));\n";
1374 Signature += "__Tie" + utostr(TiedOp);
1377 case MatchableInfo::ResOperand::ImmOperand: {
1378 int64_t Val = OpInfo.ImmVal;
1379 CaseOS << " Inst.addOperand(MCOperand::CreateImm(" << Val << "));\n";
1380 Signature += "__imm" + itostr(Val);
1383 case MatchableInfo::ResOperand::RegOperand: {
1384 if (OpInfo.Register == 0) {
1385 CaseOS << " Inst.addOperand(MCOperand::CreateReg(0));\n";
1386 Signature += "__reg0";
1388 std::string N = getQualifiedName(OpInfo.Register);
1389 CaseOS << " Inst.addOperand(MCOperand::CreateReg(" << N << "));\n";
1390 Signature += "__reg" + OpInfo.Register->getName();
1396 II.ConversionFnKind = Signature;
1398 // Check if we have already generated this signature.
1399 if (!GeneratedFns.insert(Signature).second)
1402 // If not, emit it now. Add to the enum list.
1403 OS << " " << Signature << ",\n";
1405 CvtOS << " case " << Signature << ":\n";
1406 CvtOS << CaseOS.str();
1407 CvtOS << " return;\n";
1410 // Finish the convert function.
1415 // Finish the enum, and drop the convert function after it.
1417 OS << " NumConversionVariants\n";
1423 /// EmitMatchClassEnumeration - Emit the enumeration for match class kinds.
1424 static void EmitMatchClassEnumeration(CodeGenTarget &Target,
1425 std::vector<ClassInfo*> &Infos,
1427 OS << "namespace {\n\n";
1429 OS << "/// MatchClassKind - The kinds of classes which participate in\n"
1430 << "/// instruction matching.\n";
1431 OS << "enum MatchClassKind {\n";
1432 OS << " InvalidMatchClass = 0,\n";
1433 for (std::vector<ClassInfo*>::iterator it = Infos.begin(),
1434 ie = Infos.end(); it != ie; ++it) {
1435 ClassInfo &CI = **it;
1436 OS << " " << CI.Name << ", // ";
1437 if (CI.Kind == ClassInfo::Token) {
1438 OS << "'" << CI.ValueName << "'\n";
1439 } else if (CI.isRegisterClass()) {
1440 if (!CI.ValueName.empty())
1441 OS << "register class '" << CI.ValueName << "'\n";
1443 OS << "derived register class\n";
1445 OS << "user defined class '" << CI.ValueName << "'\n";
1448 OS << " NumMatchClassKinds\n";
1454 /// EmitClassifyOperand - Emit the function to classify an operand.
1455 static void EmitClassifyOperand(AsmMatcherInfo &Info,
1457 OS << "static MatchClassKind ClassifyOperand(MCParsedAsmOperand *GOp) {\n"
1458 << " " << Info.Target.getName() << "Operand &Operand = *("
1459 << Info.Target.getName() << "Operand*)GOp;\n";
1462 OS << " if (Operand.isToken())\n";
1463 OS << " return MatchTokenString(Operand.getToken());\n\n";
1465 // Classify registers.
1467 // FIXME: Don't hardcode isReg, getReg.
1468 OS << " if (Operand.isReg()) {\n";
1469 OS << " switch (Operand.getReg()) {\n";
1470 OS << " default: return InvalidMatchClass;\n";
1471 for (std::map<Record*, ClassInfo*>::iterator
1472 it = Info.RegisterClasses.begin(), ie = Info.RegisterClasses.end();
1474 OS << " case " << Info.Target.getName() << "::"
1475 << it->first->getName() << ": return " << it->second->Name << ";\n";
1479 // Classify user defined operands. To do so, we need to perform a topological
1480 // sort of the superclass relationship graph so that we always match the
1481 // narrowest type first.
1483 // Collect the incoming edge counts for each class.
1484 std::map<ClassInfo*, unsigned> IncomingEdges;
1485 for (std::vector<ClassInfo*>::iterator it = Info.Classes.begin(),
1486 ie = Info.Classes.end(); it != ie; ++it) {
1487 ClassInfo &CI = **it;
1489 if (!CI.isUserClass())
1492 for (std::vector<ClassInfo*>::iterator SI = CI.SuperClasses.begin(),
1493 SE = CI.SuperClasses.end(); SI != SE; ++SI)
1494 ++IncomingEdges[*SI];
1497 // Initialize a worklist of classes with no incoming edges.
1498 std::vector<ClassInfo*> LeafClasses;
1499 for (std::vector<ClassInfo*>::iterator it = Info.Classes.begin(),
1500 ie = Info.Classes.end(); it != ie; ++it) {
1501 if (!IncomingEdges[*it])
1502 LeafClasses.push_back(*it);
1505 // Iteratively pop the list, process that class, and update the incoming
1506 // edge counts for its super classes. When a superclass reaches zero
1507 // incoming edges, push it onto the worklist for processing.
1508 while (!LeafClasses.empty()) {
1509 ClassInfo &CI = *LeafClasses.back();
1510 LeafClasses.pop_back();
1512 if (!CI.isUserClass())
1515 OS << " // '" << CI.ClassName << "' class";
1516 if (!CI.SuperClasses.empty()) {
1517 OS << ", subclass of ";
1518 for (unsigned i = 0, e = CI.SuperClasses.size(); i != e; ++i) {
1520 OS << "'" << CI.SuperClasses[i]->ClassName << "'";
1521 assert(CI < *CI.SuperClasses[i] && "Invalid class relation!");
1523 --IncomingEdges[CI.SuperClasses[i]];
1524 if (!IncomingEdges[CI.SuperClasses[i]])
1525 LeafClasses.push_back(CI.SuperClasses[i]);
1530 OS << " if (Operand." << CI.PredicateMethod << "()) {\n";
1532 // Validate subclass relationships.
1533 if (!CI.SuperClasses.empty()) {
1534 for (unsigned i = 0, e = CI.SuperClasses.size(); i != e; ++i)
1535 OS << " assert(Operand." << CI.SuperClasses[i]->PredicateMethod
1536 << "() && \"Invalid class relationship!\");\n";
1539 OS << " return " << CI.Name << ";\n";
1543 OS << " return InvalidMatchClass;\n";
1547 /// EmitIsSubclass - Emit the subclass predicate function.
1548 static void EmitIsSubclass(CodeGenTarget &Target,
1549 std::vector<ClassInfo*> &Infos,
1551 OS << "/// IsSubclass - Compute whether \\arg A is a subclass of \\arg B.\n";
1552 OS << "static bool IsSubclass(MatchClassKind A, MatchClassKind B) {\n";
1553 OS << " if (A == B)\n";
1554 OS << " return true;\n\n";
1556 OS << " switch (A) {\n";
1557 OS << " default:\n";
1558 OS << " return false;\n";
1559 for (std::vector<ClassInfo*>::iterator it = Infos.begin(),
1560 ie = Infos.end(); it != ie; ++it) {
1561 ClassInfo &A = **it;
1563 if (A.Kind != ClassInfo::Token) {
1564 std::vector<StringRef> SuperClasses;
1565 for (std::vector<ClassInfo*>::iterator it = Infos.begin(),
1566 ie = Infos.end(); it != ie; ++it) {
1567 ClassInfo &B = **it;
1569 if (&A != &B && A.isSubsetOf(B))
1570 SuperClasses.push_back(B.Name);
1573 if (SuperClasses.empty())
1576 OS << "\n case " << A.Name << ":\n";
1578 if (SuperClasses.size() == 1) {
1579 OS << " return B == " << SuperClasses.back() << ";\n";
1583 OS << " switch (B) {\n";
1584 OS << " default: return false;\n";
1585 for (unsigned i = 0, e = SuperClasses.size(); i != e; ++i)
1586 OS << " case " << SuperClasses[i] << ": return true;\n";
1596 /// EmitMatchTokenString - Emit the function to match a token string to the
1597 /// appropriate match class value.
1598 static void EmitMatchTokenString(CodeGenTarget &Target,
1599 std::vector<ClassInfo*> &Infos,
1601 // Construct the match list.
1602 std::vector<StringMatcher::StringPair> Matches;
1603 for (std::vector<ClassInfo*>::iterator it = Infos.begin(),
1604 ie = Infos.end(); it != ie; ++it) {
1605 ClassInfo &CI = **it;
1607 if (CI.Kind == ClassInfo::Token)
1608 Matches.push_back(StringMatcher::StringPair(CI.ValueName,
1609 "return " + CI.Name + ";"));
1612 OS << "static MatchClassKind MatchTokenString(StringRef Name) {\n";
1614 StringMatcher("Name", Matches, OS).Emit();
1616 OS << " return InvalidMatchClass;\n";
1620 /// EmitMatchRegisterName - Emit the function to match a string to the target
1621 /// specific register enum.
1622 static void EmitMatchRegisterName(CodeGenTarget &Target, Record *AsmParser,
1624 // Construct the match list.
1625 std::vector<StringMatcher::StringPair> Matches;
1626 for (unsigned i = 0, e = Target.getRegisters().size(); i != e; ++i) {
1627 const CodeGenRegister &Reg = Target.getRegisters()[i];
1628 if (Reg.TheDef->getValueAsString("AsmName").empty())
1631 Matches.push_back(StringMatcher::StringPair(
1632 Reg.TheDef->getValueAsString("AsmName"),
1633 "return " + utostr(i + 1) + ";"));
1636 OS << "static unsigned MatchRegisterName(StringRef Name) {\n";
1638 StringMatcher("Name", Matches, OS).Emit();
1640 OS << " return 0;\n";
1644 /// EmitSubtargetFeatureFlagEnumeration - Emit the subtarget feature flag
1646 static void EmitSubtargetFeatureFlagEnumeration(AsmMatcherInfo &Info,
1648 OS << "// Flags for subtarget features that participate in "
1649 << "instruction matching.\n";
1650 OS << "enum SubtargetFeatureFlag {\n";
1651 for (std::map<Record*, SubtargetFeatureInfo*>::const_iterator
1652 it = Info.SubtargetFeatures.begin(),
1653 ie = Info.SubtargetFeatures.end(); it != ie; ++it) {
1654 SubtargetFeatureInfo &SFI = *it->second;
1655 OS << " " << SFI.getEnumName() << " = (1 << " << SFI.Index << "),\n";
1657 OS << " Feature_None = 0\n";
1661 /// EmitComputeAvailableFeatures - Emit the function to compute the list of
1662 /// available features given a subtarget.
1663 static void EmitComputeAvailableFeatures(AsmMatcherInfo &Info,
1665 std::string ClassName =
1666 Info.AsmParser->getValueAsString("AsmParserClassName");
1668 OS << "unsigned " << Info.Target.getName() << ClassName << "::\n"
1669 << "ComputeAvailableFeatures(const " << Info.Target.getName()
1670 << "Subtarget *Subtarget) const {\n";
1671 OS << " unsigned Features = 0;\n";
1672 for (std::map<Record*, SubtargetFeatureInfo*>::const_iterator
1673 it = Info.SubtargetFeatures.begin(),
1674 ie = Info.SubtargetFeatures.end(); it != ie; ++it) {
1675 SubtargetFeatureInfo &SFI = *it->second;
1676 OS << " if (" << SFI.TheDef->getValueAsString("CondString")
1678 OS << " Features |= " << SFI.getEnumName() << ";\n";
1680 OS << " return Features;\n";
1684 static std::string GetAliasRequiredFeatures(Record *R,
1685 const AsmMatcherInfo &Info) {
1686 std::vector<Record*> ReqFeatures = R->getValueAsListOfDefs("Predicates");
1688 unsigned NumFeatures = 0;
1689 for (unsigned i = 0, e = ReqFeatures.size(); i != e; ++i) {
1690 SubtargetFeatureInfo *F = Info.getSubtargetFeature(ReqFeatures[i]);
1693 throw TGError(R->getLoc(), "Predicate '" + ReqFeatures[i]->getName() +
1694 "' is not marked as an AssemblerPredicate!");
1699 Result += F->getEnumName();
1703 if (NumFeatures > 1)
1704 Result = '(' + Result + ')';
1708 /// EmitMnemonicAliases - If the target has any MnemonicAlias<> definitions,
1709 /// emit a function for them and return true, otherwise return false.
1710 static bool EmitMnemonicAliases(raw_ostream &OS, const AsmMatcherInfo &Info) {
1711 std::vector<Record*> Aliases =
1712 Info.getRecords().getAllDerivedDefinitions("MnemonicAlias");
1713 if (Aliases.empty()) return false;
1715 OS << "static void ApplyMnemonicAliases(StringRef &Mnemonic, "
1716 "unsigned Features) {\n";
1718 // Keep track of all the aliases from a mnemonic. Use an std::map so that the
1719 // iteration order of the map is stable.
1720 std::map<std::string, std::vector<Record*> > AliasesFromMnemonic;
1722 for (unsigned i = 0, e = Aliases.size(); i != e; ++i) {
1723 Record *R = Aliases[i];
1724 AliasesFromMnemonic[R->getValueAsString("FromMnemonic")].push_back(R);
1727 // Process each alias a "from" mnemonic at a time, building the code executed
1728 // by the string remapper.
1729 std::vector<StringMatcher::StringPair> Cases;
1730 for (std::map<std::string, std::vector<Record*> >::iterator
1731 I = AliasesFromMnemonic.begin(), E = AliasesFromMnemonic.end();
1733 const std::vector<Record*> &ToVec = I->second;
1735 // Loop through each alias and emit code that handles each case. If there
1736 // are two instructions without predicates, emit an error. If there is one,
1738 std::string MatchCode;
1739 int AliasWithNoPredicate = -1;
1741 for (unsigned i = 0, e = ToVec.size(); i != e; ++i) {
1742 Record *R = ToVec[i];
1743 std::string FeatureMask = GetAliasRequiredFeatures(R, Info);
1745 // If this unconditionally matches, remember it for later and diagnose
1747 if (FeatureMask.empty()) {
1748 if (AliasWithNoPredicate != -1) {
1749 // We can't have two aliases from the same mnemonic with no predicate.
1750 PrintError(ToVec[AliasWithNoPredicate]->getLoc(),
1751 "two MnemonicAliases with the same 'from' mnemonic!");
1752 throw TGError(R->getLoc(), "this is the other MnemonicAlias.");
1755 AliasWithNoPredicate = i;
1759 if (!MatchCode.empty())
1760 MatchCode += "else ";
1761 MatchCode += "if ((Features & " + FeatureMask + ") == "+FeatureMask+")\n";
1762 MatchCode += " Mnemonic = \"" +R->getValueAsString("ToMnemonic")+"\";\n";
1765 if (AliasWithNoPredicate != -1) {
1766 Record *R = ToVec[AliasWithNoPredicate];
1767 if (!MatchCode.empty())
1768 MatchCode += "else\n ";
1769 MatchCode += "Mnemonic = \"" + R->getValueAsString("ToMnemonic")+"\";\n";
1772 MatchCode += "return;";
1774 Cases.push_back(std::make_pair(I->first, MatchCode));
1778 StringMatcher("Mnemonic", Cases, OS).Emit();
1784 void AsmMatcherEmitter::run(raw_ostream &OS) {
1785 CodeGenTarget Target(Records);
1786 Record *AsmParser = Target.getAsmParser();
1787 std::string ClassName = AsmParser->getValueAsString("AsmParserClassName");
1789 // Compute the information on the instructions to match.
1790 AsmMatcherInfo Info(AsmParser, Target, Records);
1793 // Sort the instruction table using the partial order on classes. We use
1794 // stable_sort to ensure that ambiguous instructions are still
1795 // deterministically ordered.
1796 std::stable_sort(Info.Matchables.begin(), Info.Matchables.end(),
1797 less_ptr<MatchableInfo>());
1799 DEBUG_WITH_TYPE("instruction_info", {
1800 for (std::vector<MatchableInfo*>::iterator
1801 it = Info.Matchables.begin(), ie = Info.Matchables.end();
1806 // Check for ambiguous matchables.
1807 DEBUG_WITH_TYPE("ambiguous_instrs", {
1808 unsigned NumAmbiguous = 0;
1809 for (unsigned i = 0, e = Info.Matchables.size(); i != e; ++i) {
1810 for (unsigned j = i + 1; j != e; ++j) {
1811 MatchableInfo &A = *Info.Matchables[i];
1812 MatchableInfo &B = *Info.Matchables[j];
1814 if (A.CouldMatchAmiguouslyWith(B)) {
1815 errs() << "warning: ambiguous matchables:\n";
1817 errs() << "\nis incomparable with:\n";
1825 errs() << "warning: " << NumAmbiguous
1826 << " ambiguous matchables!\n";
1829 // Write the output.
1831 EmitSourceFileHeader("Assembly Matcher Source Fragment", OS);
1833 // Information for the class declaration.
1834 OS << "\n#ifdef GET_ASSEMBLER_HEADER\n";
1835 OS << "#undef GET_ASSEMBLER_HEADER\n";
1836 OS << " // This should be included into the middle of the declaration of \n";
1837 OS << " // your subclasses implementation of TargetAsmParser.\n";
1838 OS << " unsigned ComputeAvailableFeatures(const " <<
1839 Target.getName() << "Subtarget *Subtarget) const;\n";
1840 OS << " enum MatchResultTy {\n";
1841 OS << " Match_Success, Match_MnemonicFail, Match_InvalidOperand,\n";
1842 OS << " Match_MissingFeature\n";
1844 OS << " MatchResultTy MatchInstructionImpl(\n";
1845 OS << " const SmallVectorImpl<MCParsedAsmOperand*> &Operands,\n";
1846 OS << " MCInst &Inst, unsigned &ErrorInfo);\n\n";
1847 OS << "#endif // GET_ASSEMBLER_HEADER_INFO\n\n";
1849 OS << "\n#ifdef GET_REGISTER_MATCHER\n";
1850 OS << "#undef GET_REGISTER_MATCHER\n\n";
1852 // Emit the subtarget feature enumeration.
1853 EmitSubtargetFeatureFlagEnumeration(Info, OS);
1855 // Emit the function to match a register name to number.
1856 EmitMatchRegisterName(Target, AsmParser, OS);
1858 OS << "#endif // GET_REGISTER_MATCHER\n\n";
1861 OS << "\n#ifdef GET_MATCHER_IMPLEMENTATION\n";
1862 OS << "#undef GET_MATCHER_IMPLEMENTATION\n\n";
1864 // Generate the function that remaps for mnemonic aliases.
1865 bool HasMnemonicAliases = EmitMnemonicAliases(OS, Info);
1867 // Generate the unified function to convert operands into an MCInst.
1868 EmitConvertToMCInst(Target, Info.Matchables, OS);
1870 // Emit the enumeration for classes which participate in matching.
1871 EmitMatchClassEnumeration(Target, Info.Classes, OS);
1873 // Emit the routine to match token strings to their match class.
1874 EmitMatchTokenString(Target, Info.Classes, OS);
1876 // Emit the routine to classify an operand.
1877 EmitClassifyOperand(Info, OS);
1879 // Emit the subclass predicate routine.
1880 EmitIsSubclass(Target, Info.Classes, OS);
1882 // Emit the available features compute function.
1883 EmitComputeAvailableFeatures(Info, OS);
1886 size_t MaxNumOperands = 0;
1887 for (std::vector<MatchableInfo*>::const_iterator it =
1888 Info.Matchables.begin(), ie = Info.Matchables.end();
1890 MaxNumOperands = std::max(MaxNumOperands, (*it)->AsmOperands.size());
1893 // Emit the static match table; unused classes get initalized to 0 which is
1894 // guaranteed to be InvalidMatchClass.
1896 // FIXME: We can reduce the size of this table very easily. First, we change
1897 // it so that store the kinds in separate bit-fields for each index, which
1898 // only needs to be the max width used for classes at that index (we also need
1899 // to reject based on this during classification). If we then make sure to
1900 // order the match kinds appropriately (putting mnemonics last), then we
1901 // should only end up using a few bits for each class, especially the ones
1902 // following the mnemonic.
1903 OS << "namespace {\n";
1904 OS << " struct MatchEntry {\n";
1905 OS << " unsigned Opcode;\n";
1906 OS << " const char *Mnemonic;\n";
1907 OS << " ConversionKind ConvertFn;\n";
1908 OS << " MatchClassKind Classes[" << MaxNumOperands << "];\n";
1909 OS << " unsigned RequiredFeatures;\n";
1912 OS << "// Predicate for searching for an opcode.\n";
1913 OS << " struct LessOpcode {\n";
1914 OS << " bool operator()(const MatchEntry &LHS, StringRef RHS) {\n";
1915 OS << " return StringRef(LHS.Mnemonic) < RHS;\n";
1917 OS << " bool operator()(StringRef LHS, const MatchEntry &RHS) {\n";
1918 OS << " return LHS < StringRef(RHS.Mnemonic);\n";
1920 OS << " bool operator()(const MatchEntry &LHS, const MatchEntry &RHS) {\n";
1921 OS << " return StringRef(LHS.Mnemonic) < StringRef(RHS.Mnemonic);\n";
1925 OS << "} // end anonymous namespace.\n\n";
1927 OS << "static const MatchEntry MatchTable["
1928 << Info.Matchables.size() << "] = {\n";
1930 for (std::vector<MatchableInfo*>::const_iterator it =
1931 Info.Matchables.begin(), ie = Info.Matchables.end();
1933 MatchableInfo &II = **it;
1936 OS << " { " << Target.getName() << "::"
1937 << II.getResultInst()->TheDef->getName() << ", \"" << II.Mnemonic << "\""
1938 << ", " << II.ConversionFnKind << ", { ";
1939 for (unsigned i = 0, e = II.AsmOperands.size(); i != e; ++i) {
1940 MatchableInfo::AsmOperand &Op = II.AsmOperands[i];
1943 OS << Op.Class->Name;
1947 // Write the required features mask.
1948 if (!II.RequiredFeatures.empty()) {
1949 for (unsigned i = 0, e = II.RequiredFeatures.size(); i != e; ++i) {
1951 OS << II.RequiredFeatures[i]->getEnumName();
1961 // Finally, build the match function.
1962 OS << Target.getName() << ClassName << "::MatchResultTy "
1963 << Target.getName() << ClassName << "::\n"
1964 << "MatchInstructionImpl(const SmallVectorImpl<MCParsedAsmOperand*>"
1966 OS << " MCInst &Inst, unsigned &ErrorInfo) {\n";
1968 // Emit code to get the available features.
1969 OS << " // Get the current feature set.\n";
1970 OS << " unsigned AvailableFeatures = getAvailableFeatures();\n\n";
1972 OS << " // Get the instruction mnemonic, which is the first token.\n";
1973 OS << " StringRef Mnemonic = ((" << Target.getName()
1974 << "Operand*)Operands[0])->getToken();\n\n";
1976 if (HasMnemonicAliases) {
1977 OS << " // Process all MnemonicAliases to remap the mnemonic.\n";
1978 OS << " ApplyMnemonicAliases(Mnemonic, AvailableFeatures);\n\n";
1981 // Emit code to compute the class list for this operand vector.
1982 OS << " // Eliminate obvious mismatches.\n";
1983 OS << " if (Operands.size() > " << (MaxNumOperands+1) << ") {\n";
1984 OS << " ErrorInfo = " << (MaxNumOperands+1) << ";\n";
1985 OS << " return Match_InvalidOperand;\n";
1988 OS << " // Compute the class list for this operand vector.\n";
1989 OS << " MatchClassKind Classes[" << MaxNumOperands << "];\n";
1990 OS << " for (unsigned i = 1, e = Operands.size(); i != e; ++i) {\n";
1991 OS << " Classes[i-1] = ClassifyOperand(Operands[i]);\n\n";
1993 OS << " // Check for invalid operands before matching.\n";
1994 OS << " if (Classes[i-1] == InvalidMatchClass) {\n";
1995 OS << " ErrorInfo = i;\n";
1996 OS << " return Match_InvalidOperand;\n";
2000 OS << " // Mark unused classes.\n";
2001 OS << " for (unsigned i = Operands.size()-1, e = " << MaxNumOperands << "; "
2002 << "i != e; ++i)\n";
2003 OS << " Classes[i] = InvalidMatchClass;\n\n";
2005 OS << " // Some state to try to produce better error messages.\n";
2006 OS << " bool HadMatchOtherThanFeatures = false;\n\n";
2007 OS << " // Set ErrorInfo to the operand that mismatches if it is \n";
2008 OS << " // wrong for all instances of the instruction.\n";
2009 OS << " ErrorInfo = ~0U;\n";
2011 // Emit code to search the table.
2012 OS << " // Search the table.\n";
2013 OS << " std::pair<const MatchEntry*, const MatchEntry*> MnemonicRange =\n";
2014 OS << " std::equal_range(MatchTable, MatchTable+"
2015 << Info.Matchables.size() << ", Mnemonic, LessOpcode());\n\n";
2017 OS << " // Return a more specific error code if no mnemonics match.\n";
2018 OS << " if (MnemonicRange.first == MnemonicRange.second)\n";
2019 OS << " return Match_MnemonicFail;\n\n";
2021 OS << " for (const MatchEntry *it = MnemonicRange.first, "
2022 << "*ie = MnemonicRange.second;\n";
2023 OS << " it != ie; ++it) {\n";
2025 OS << " // equal_range guarantees that instruction mnemonic matches.\n";
2026 OS << " assert(Mnemonic == it->Mnemonic);\n";
2028 // Emit check that the subclasses match.
2029 OS << " bool OperandsValid = true;\n";
2030 OS << " for (unsigned i = 0; i != " << MaxNumOperands << "; ++i) {\n";
2031 OS << " if (IsSubclass(Classes[i], it->Classes[i]))\n";
2032 OS << " continue;\n";
2033 OS << " // If this operand is broken for all of the instances of this\n";
2034 OS << " // mnemonic, keep track of it so we can report loc info.\n";
2035 OS << " if (it == MnemonicRange.first || ErrorInfo == i+1)\n";
2036 OS << " ErrorInfo = i+1;\n";
2038 OS << " ErrorInfo = ~0U;";
2039 OS << " // Otherwise, just reject this instance of the mnemonic.\n";
2040 OS << " OperandsValid = false;\n";
2044 OS << " if (!OperandsValid) continue;\n";
2046 // Emit check that the required features are available.
2047 OS << " if ((AvailableFeatures & it->RequiredFeatures) "
2048 << "!= it->RequiredFeatures) {\n";
2049 OS << " HadMatchOtherThanFeatures = true;\n";
2050 OS << " continue;\n";
2054 OS << " ConvertToMCInst(it->ConvertFn, Inst, it->Opcode, Operands);\n";
2056 // Call the post-processing function, if used.
2057 std::string InsnCleanupFn =
2058 AsmParser->getValueAsString("AsmParserInstCleanup");
2059 if (!InsnCleanupFn.empty())
2060 OS << " " << InsnCleanupFn << "(Inst);\n";
2062 OS << " return Match_Success;\n";
2065 OS << " // Okay, we had no match. Try to return a useful error code.\n";
2066 OS << " if (HadMatchOtherThanFeatures) return Match_MissingFeature;\n";
2067 OS << " return Match_InvalidOperand;\n";
2070 OS << "#endif // GET_MATCHER_IMPLEMENTATION\n\n";