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/SmallPtrSet.h"
79 #include "llvm/ADT/SmallVector.h"
80 #include "llvm/ADT/STLExtras.h"
81 #include "llvm/ADT/StringExtras.h"
82 #include "llvm/Support/CommandLine.h"
83 #include "llvm/Support/Debug.h"
88 static cl::opt<std::string>
89 MatchPrefix("match-prefix", cl::init(""),
90 cl::desc("Only match instructions with the given prefix"));
95 struct SubtargetFeatureInfo;
97 /// ClassInfo - Helper class for storing the information about a particular
98 /// class of operands which can be matched.
101 /// Invalid kind, for use as a sentinel value.
104 /// The class for a particular token.
107 /// The (first) register class, subsequent register classes are
108 /// RegisterClass0+1, and so on.
111 /// The (first) user defined class, subsequent user defined classes are
112 /// UserClass0+1, and so on.
116 /// Kind - The class kind, which is either a predefined kind, or (UserClass0 +
117 /// N) for the Nth user defined class.
120 /// SuperClasses - The super classes of this class. Note that for simplicities
121 /// sake user operands only record their immediate super class, while register
122 /// operands include all superclasses.
123 std::vector<ClassInfo*> SuperClasses;
125 /// Name - The full class name, suitable for use in an enum.
128 /// ClassName - The unadorned generic name for this class (e.g., Token).
129 std::string ClassName;
131 /// ValueName - The name of the value this class represents; for a token this
132 /// is the literal token string, for an operand it is the TableGen class (or
133 /// empty if this is a derived class).
134 std::string ValueName;
136 /// PredicateMethod - The name of the operand method to test whether the
137 /// operand matches this class; this is not valid for Token or register kinds.
138 std::string PredicateMethod;
140 /// RenderMethod - The name of the operand method to add this operand to an
141 /// MCInst; this is not valid for Token or register kinds.
142 std::string RenderMethod;
144 /// For register classes, the records for all the registers in this class.
145 std::set<Record*> Registers;
148 /// isRegisterClass() - Check if this is a register class.
149 bool isRegisterClass() const {
150 return Kind >= RegisterClass0 && Kind < UserClass0;
153 /// isUserClass() - Check if this is a user defined class.
154 bool isUserClass() const {
155 return Kind >= UserClass0;
158 /// isRelatedTo - Check whether this class is "related" to \arg RHS. Classes
159 /// are related if they are in the same class hierarchy.
160 bool isRelatedTo(const ClassInfo &RHS) const {
161 // Tokens are only related to tokens.
162 if (Kind == Token || RHS.Kind == Token)
163 return Kind == Token && RHS.Kind == Token;
165 // Registers classes are only related to registers classes, and only if
166 // their intersection is non-empty.
167 if (isRegisterClass() || RHS.isRegisterClass()) {
168 if (!isRegisterClass() || !RHS.isRegisterClass())
171 std::set<Record*> Tmp;
172 std::insert_iterator< std::set<Record*> > II(Tmp, Tmp.begin());
173 std::set_intersection(Registers.begin(), Registers.end(),
174 RHS.Registers.begin(), RHS.Registers.end(),
180 // Otherwise we have two users operands; they are related if they are in the
181 // same class hierarchy.
183 // FIXME: This is an oversimplification, they should only be related if they
184 // intersect, however we don't have that information.
185 assert(isUserClass() && RHS.isUserClass() && "Unexpected class!");
186 const ClassInfo *Root = this;
187 while (!Root->SuperClasses.empty())
188 Root = Root->SuperClasses.front();
190 const ClassInfo *RHSRoot = &RHS;
191 while (!RHSRoot->SuperClasses.empty())
192 RHSRoot = RHSRoot->SuperClasses.front();
194 return Root == RHSRoot;
197 /// isSubsetOf - Test whether this class is a subset of \arg RHS;
198 bool isSubsetOf(const ClassInfo &RHS) const {
199 // This is a subset of RHS if it is the same class...
203 // ... or if any of its super classes are a subset of RHS.
204 for (std::vector<ClassInfo*>::const_iterator it = SuperClasses.begin(),
205 ie = SuperClasses.end(); it != ie; ++it)
206 if ((*it)->isSubsetOf(RHS))
212 /// operator< - Compare two classes.
213 bool operator<(const ClassInfo &RHS) const {
217 // Unrelated classes can be ordered by kind.
218 if (!isRelatedTo(RHS))
219 return Kind < RHS.Kind;
223 assert(0 && "Invalid kind!");
225 // Tokens are comparable by value.
227 // FIXME: Compare by enum value.
228 return ValueName < RHS.ValueName;
231 // This class preceeds the RHS if it is a proper subset of the RHS.
234 if (RHS.isSubsetOf(*this))
237 // Otherwise, order by name to ensure we have a total ordering.
238 return ValueName < RHS.ValueName;
243 /// MatchableInfo - Helper class for storing the necessary information for an
244 /// instruction or alias which is capable of being matched.
245 struct MatchableInfo {
247 /// Token - This is the token that the operand came from.
250 /// The unique class instance this operand should match.
253 /// The operand name this is, if anything.
256 explicit AsmOperand(StringRef T) : Token(T), Class(0) {}
259 /// ResOperand - This represents a single operand in the result instruction
260 /// generated by the match. In cases (like addressing modes) where a single
261 /// assembler operand expands to multiple MCOperands, this represents the
262 /// single assembler operand, not the MCOperand.
265 /// RenderAsmOperand - This represents an operand result that is
266 /// generated by calling the render method on the assembly operand. The
267 /// corresponding AsmOperand is specified by AsmOperandNum.
270 /// TiedOperand - This represents a result operand that is a duplicate of
271 /// a previous result operand.
276 /// This is the operand # in the AsmOperands list that this should be
278 unsigned AsmOperandNum;
280 /// TiedOperandNum - This is the (earlier) result operand that should be
282 unsigned TiedOperandNum;
285 /// OpInfo - This is the information about the instruction operand that is
287 const CGIOperandList::OperandInfo *OpInfo;
289 static ResOperand getRenderedOp(unsigned AsmOpNum,
290 const CGIOperandList::OperandInfo *Op) {
292 X.Kind = RenderAsmOperand;
293 X.AsmOperandNum = AsmOpNum;
298 static ResOperand getTiedOp(unsigned TiedOperandNum,
299 const CGIOperandList::OperandInfo *Op) {
301 X.Kind = TiedOperand;
302 X.TiedOperandNum = TiedOperandNum;
308 /// InstrName - The target name for this instruction.
309 std::string InstrName;
311 /// TheDef - This is the definition of the instruction or InstAlias that this
312 /// matchable came from.
313 Record *const TheDef;
316 const CGIOperandList &TheOperandList;
319 /// ResOperands - This is the operand list that should be built for the result
321 std::vector<ResOperand> ResOperands;
323 /// AsmString - The assembly string for this instruction (with variants
324 /// removed), e.g. "movsx $src, $dst".
325 std::string AsmString;
327 /// Mnemonic - This is the first token of the matched instruction, its
331 /// AsmOperands - The textual operands that this instruction matches,
332 /// annotated with a class and where in the OperandList they were defined.
333 /// This directly corresponds to the tokenized AsmString after the mnemonic is
335 SmallVector<AsmOperand, 4> AsmOperands;
337 /// Predicates - The required subtarget features to match this instruction.
338 SmallVector<SubtargetFeatureInfo*, 4> RequiredFeatures;
340 /// ConversionFnKind - The enum value which is passed to the generated
341 /// ConvertToMCInst to convert parsed operands into an MCInst for this
343 std::string ConversionFnKind;
345 MatchableInfo(const CodeGenInstruction &CGI)
346 : TheDef(CGI.TheDef), TheOperandList(CGI.Operands), AsmString(CGI.AsmString) {
347 InstrName = TheDef->getName();
350 MatchableInfo(const CodeGenInstAlias *Alias)
351 : TheDef(Alias->TheDef), TheOperandList(Alias->Operands),
352 AsmString(Alias->AsmString) {
355 DefInit *DI = dynamic_cast<DefInit*>(Alias->Result->getOperator());
358 InstrName = DI->getDef()->getName();
361 void Initialize(const AsmMatcherInfo &Info,
362 SmallPtrSet<Record*, 16> &SingletonRegisters);
364 /// Validate - Return true if this matchable is a valid thing to match against
365 /// and perform a bunch of validity checking.
366 bool Validate(StringRef CommentDelimiter, bool Hack) const;
368 /// getSingletonRegisterForAsmOperand - If the specified token is a singleton
369 /// register, return the Record for it, otherwise return null.
370 Record *getSingletonRegisterForAsmOperand(unsigned i,
371 const AsmMatcherInfo &Info) const;
373 int FindAsmOperandNamed(StringRef N) const {
374 for (unsigned i = 0, e = AsmOperands.size(); i != e; ++i)
375 if (N == AsmOperands[i].SrcOpName)
380 void BuildResultOperands();
382 /// operator< - Compare two matchables.
383 bool operator<(const MatchableInfo &RHS) const {
384 // The primary comparator is the instruction mnemonic.
385 if (Mnemonic != RHS.Mnemonic)
386 return Mnemonic < RHS.Mnemonic;
388 if (AsmOperands.size() != RHS.AsmOperands.size())
389 return AsmOperands.size() < RHS.AsmOperands.size();
391 // Compare lexicographically by operand. The matcher validates that other
392 // orderings wouldn't be ambiguous using \see CouldMatchAmiguouslyWith().
393 for (unsigned i = 0, e = AsmOperands.size(); i != e; ++i) {
394 if (*AsmOperands[i].Class < *RHS.AsmOperands[i].Class)
396 if (*RHS.AsmOperands[i].Class < *AsmOperands[i].Class)
403 /// CouldMatchAmiguouslyWith - Check whether this matchable could
404 /// ambiguously match the same set of operands as \arg RHS (without being a
405 /// strictly superior match).
406 bool CouldMatchAmiguouslyWith(const MatchableInfo &RHS) {
407 // The primary comparator is the instruction mnemonic.
408 if (Mnemonic != RHS.Mnemonic)
411 // The number of operands is unambiguous.
412 if (AsmOperands.size() != RHS.AsmOperands.size())
415 // Otherwise, make sure the ordering of the two instructions is unambiguous
416 // by checking that either (a) a token or operand kind discriminates them,
417 // or (b) the ordering among equivalent kinds is consistent.
419 // Tokens and operand kinds are unambiguous (assuming a correct target
421 for (unsigned i = 0, e = AsmOperands.size(); i != e; ++i)
422 if (AsmOperands[i].Class->Kind != RHS.AsmOperands[i].Class->Kind ||
423 AsmOperands[i].Class->Kind == ClassInfo::Token)
424 if (*AsmOperands[i].Class < *RHS.AsmOperands[i].Class ||
425 *RHS.AsmOperands[i].Class < *AsmOperands[i].Class)
428 // Otherwise, this operand could commute if all operands are equivalent, or
429 // there is a pair of operands that compare less than and a pair that
430 // compare greater than.
431 bool HasLT = false, HasGT = false;
432 for (unsigned i = 0, e = AsmOperands.size(); i != e; ++i) {
433 if (*AsmOperands[i].Class < *RHS.AsmOperands[i].Class)
435 if (*RHS.AsmOperands[i].Class < *AsmOperands[i].Class)
439 return !(HasLT ^ HasGT);
445 void TokenizeAsmString(const AsmMatcherInfo &Info);
448 /// SubtargetFeatureInfo - Helper class for storing information on a subtarget
449 /// feature which participates in instruction matching.
450 struct SubtargetFeatureInfo {
451 /// \brief The predicate record for this feature.
454 /// \brief An unique index assigned to represent this feature.
457 SubtargetFeatureInfo(Record *D, unsigned Idx) : TheDef(D), Index(Idx) {}
459 /// \brief The name of the enumerated constant identifying this feature.
460 std::string getEnumName() const {
461 return "Feature_" + TheDef->getName();
465 class AsmMatcherInfo {
467 /// The tablegen AsmParser record.
470 /// Target - The target information.
471 CodeGenTarget &Target;
473 /// The AsmParser "RegisterPrefix" value.
474 std::string RegisterPrefix;
476 /// The classes which are needed for matching.
477 std::vector<ClassInfo*> Classes;
479 /// The information on the matchables to match.
480 std::vector<MatchableInfo*> Matchables;
482 /// Map of Register records to their class information.
483 std::map<Record*, ClassInfo*> RegisterClasses;
485 /// Map of Predicate records to their subtarget information.
486 std::map<Record*, SubtargetFeatureInfo*> SubtargetFeatures;
489 /// Map of token to class information which has already been constructed.
490 std::map<std::string, ClassInfo*> TokenClasses;
492 /// Map of RegisterClass records to their class information.
493 std::map<Record*, ClassInfo*> RegisterClassClasses;
495 /// Map of AsmOperandClass records to their class information.
496 std::map<Record*, ClassInfo*> AsmOperandClasses;
499 /// getTokenClass - Lookup or create the class for the given token.
500 ClassInfo *getTokenClass(StringRef Token);
502 /// getOperandClass - Lookup or create the class for the given operand.
503 ClassInfo *getOperandClass(const CGIOperandList::OperandInfo &OI);
505 /// BuildRegisterClasses - Build the ClassInfo* instances for register
507 void BuildRegisterClasses(SmallPtrSet<Record*, 16> &SingletonRegisters);
509 /// BuildOperandClasses - Build the ClassInfo* instances for user defined
511 void BuildOperandClasses();
513 void BuildInstructionOperandReference(MatchableInfo *II, StringRef OpName,
514 MatchableInfo::AsmOperand &Op);
517 AsmMatcherInfo(Record *AsmParser, CodeGenTarget &Target);
519 /// BuildInfo - Construct the various tables used during matching.
522 /// getSubtargetFeature - Lookup or create the subtarget feature info for the
524 SubtargetFeatureInfo *getSubtargetFeature(Record *Def) const {
525 assert(Def->isSubClassOf("Predicate") && "Invalid predicate type!");
526 std::map<Record*, SubtargetFeatureInfo*>::const_iterator I =
527 SubtargetFeatures.find(Def);
528 return I == SubtargetFeatures.end() ? 0 : I->second;
534 void MatchableInfo::dump() {
535 errs() << InstrName << " -- " << "flattened:\"" << AsmString << "\"\n";
537 for (unsigned i = 0, e = AsmOperands.size(); i != e; ++i) {
538 AsmOperand &Op = AsmOperands[i];
539 errs() << " op[" << i << "] = " << Op.Class->ClassName << " - ";
540 errs() << '\"' << Op.Token << "\"\n";
542 if (!Op.OperandInfo) {
543 errs() << "(singleton register)\n";
547 const CGIOperandList::OperandInfo &OI = *Op.OperandInfo;
548 errs() << OI.Name << " " << OI.Rec->getName()
549 << " (" << OI.MIOperandNo << ", " << OI.MINumOperands << ")\n";
554 void MatchableInfo::Initialize(const AsmMatcherInfo &Info,
555 SmallPtrSet<Record*, 16> &SingletonRegisters) {
556 // TODO: Eventually support asmparser for Variant != 0.
557 AsmString = CodeGenInstruction::FlattenAsmStringVariants(AsmString, 0);
559 TokenizeAsmString(Info);
561 // Compute the require features.
562 std::vector<Record*> Predicates =TheDef->getValueAsListOfDefs("Predicates");
563 for (unsigned i = 0, e = Predicates.size(); i != e; ++i)
564 if (SubtargetFeatureInfo *Feature =
565 Info.getSubtargetFeature(Predicates[i]))
566 RequiredFeatures.push_back(Feature);
568 // Collect singleton registers, if used.
569 for (unsigned i = 0, e = AsmOperands.size(); i != e; ++i) {
570 if (Record *Reg = getSingletonRegisterForAsmOperand(i, Info))
571 SingletonRegisters.insert(Reg);
575 /// TokenizeAsmString - Tokenize a simplified assembly string.
576 void MatchableInfo::TokenizeAsmString(const AsmMatcherInfo &Info) {
577 StringRef String = AsmString;
580 for (unsigned i = 0, e = String.size(); i != e; ++i) {
590 AsmOperands.push_back(AsmOperand(String.slice(Prev, i)));
593 if (!isspace(String[i]) && String[i] != ',')
594 AsmOperands.push_back(AsmOperand(String.substr(i, 1)));
600 AsmOperands.push_back(AsmOperand(String.slice(Prev, i)));
604 assert(i != String.size() && "Invalid quoted character");
605 AsmOperands.push_back(AsmOperand(String.substr(i, 1)));
610 // If this isn't "${", treat like a normal token.
611 if (i + 1 == String.size() || String[i + 1] != '{') {
613 AsmOperands.push_back(AsmOperand(String.slice(Prev, i)));
621 AsmOperands.push_back(AsmOperand(String.slice(Prev, i)));
625 StringRef::iterator End = std::find(String.begin() + i, String.end(),'}');
626 assert(End != String.end() && "Missing brace in operand reference!");
627 size_t EndPos = End - String.begin();
628 AsmOperands.push_back(AsmOperand(String.slice(i, EndPos+1)));
636 AsmOperands.push_back(AsmOperand(String.slice(Prev, i)));
645 if (InTok && Prev != String.size())
646 AsmOperands.push_back(AsmOperand(String.substr(Prev)));
648 // The first token of the instruction is the mnemonic, which must be a
649 // simple string, not a $foo variable or a singleton register.
650 assert(!AsmOperands.empty() && "Instruction has no tokens?");
651 Mnemonic = AsmOperands[0].Token;
652 if (Mnemonic[0] == '$' || getSingletonRegisterForAsmOperand(0, Info))
653 throw TGError(TheDef->getLoc(),
654 "Invalid instruction mnemonic '" + Mnemonic.str() + "'!");
656 // Remove the first operand, it is tracked in the mnemonic field.
657 AsmOperands.erase(AsmOperands.begin());
662 bool MatchableInfo::Validate(StringRef CommentDelimiter, bool Hack) const {
663 // Reject matchables with no .s string.
664 if (AsmString.empty())
665 throw TGError(TheDef->getLoc(), "instruction with empty asm string");
667 // Reject any matchables with a newline in them, they should be marked
668 // isCodeGenOnly if they are pseudo instructions.
669 if (AsmString.find('\n') != std::string::npos)
670 throw TGError(TheDef->getLoc(),
671 "multiline instruction is not valid for the asmparser, "
672 "mark it isCodeGenOnly");
674 // Remove comments from the asm string. We know that the asmstring only
676 if (!CommentDelimiter.empty() &&
677 StringRef(AsmString).find(CommentDelimiter) != StringRef::npos)
678 throw TGError(TheDef->getLoc(),
679 "asmstring for instruction has comment character in it, "
680 "mark it isCodeGenOnly");
682 // Reject matchables with operand modifiers, these aren't something we can
683 /// handle, the target should be refactored to use operands instead of
686 // Also, check for instructions which reference the operand multiple times;
687 // this implies a constraint we would not honor.
688 std::set<std::string> OperandNames;
689 for (unsigned i = 0, e = AsmOperands.size(); i != e; ++i) {
690 StringRef Tok = AsmOperands[i].Token;
691 if (Tok[0] == '$' && Tok.find(':') != StringRef::npos)
692 throw TGError(TheDef->getLoc(),
693 "matchable with operand modifier '" + Tok.str() +
694 "' not supported by asm matcher. Mark isCodeGenOnly!");
696 // Verify that any operand is only mentioned once.
697 // We reject aliases and ignore instructions for now.
698 if (Tok[0] == '$' && !OperandNames.insert(Tok).second) {
700 throw TGError(TheDef->getLoc(),
701 "ERROR: matchable with tied operand '" + Tok.str() +
702 "' can never be matched!");
703 // FIXME: Should reject these. The ARM backend hits this with $lane in a
704 // bunch of instructions. It is unclear what the right answer is.
706 errs() << "warning: '" << InstrName << "': "
707 << "ignoring instruction with tied operand '"
708 << Tok.str() << "'\n";
718 /// getSingletonRegisterForAsmOperand - If the specified token is a singleton
719 /// register, return the register name, otherwise return a null StringRef.
720 Record *MatchableInfo::
721 getSingletonRegisterForAsmOperand(unsigned i, const AsmMatcherInfo &Info) const{
722 StringRef Tok = AsmOperands[i].Token;
723 if (!Tok.startswith(Info.RegisterPrefix))
726 StringRef RegName = Tok.substr(Info.RegisterPrefix.size());
727 if (const CodeGenRegister *Reg = Info.Target.getRegisterByName(RegName))
730 // If there is no register prefix (i.e. "%" in "%eax"), then this may
731 // be some random non-register token, just ignore it.
732 if (Info.RegisterPrefix.empty())
735 // Otherwise, we have something invalid prefixed with the register prefix,
737 std::string Err = "unable to find register for '" + RegName.str() +
738 "' (which matches register prefix)";
739 throw TGError(TheDef->getLoc(), Err);
743 static std::string getEnumNameForToken(StringRef Str) {
746 for (StringRef::iterator it = Str.begin(), ie = Str.end(); it != ie; ++it) {
748 case '*': Res += "_STAR_"; break;
749 case '%': Res += "_PCT_"; break;
750 case ':': Res += "_COLON_"; break;
755 Res += "_" + utostr((unsigned) *it) + "_";
762 ClassInfo *AsmMatcherInfo::getTokenClass(StringRef Token) {
763 ClassInfo *&Entry = TokenClasses[Token];
766 Entry = new ClassInfo();
767 Entry->Kind = ClassInfo::Token;
768 Entry->ClassName = "Token";
769 Entry->Name = "MCK_" + getEnumNameForToken(Token);
770 Entry->ValueName = Token;
771 Entry->PredicateMethod = "<invalid>";
772 Entry->RenderMethod = "<invalid>";
773 Classes.push_back(Entry);
780 AsmMatcherInfo::getOperandClass(const CGIOperandList::OperandInfo &OI) {
781 if (OI.Rec->isSubClassOf("RegisterClass")) {
782 if (ClassInfo *CI = RegisterClassClasses[OI.Rec])
784 throw TGError(OI.Rec->getLoc(), "register class has no class info!");
787 assert(OI.Rec->isSubClassOf("Operand") && "Unexpected operand!");
788 Record *MatchClass = OI.Rec->getValueAsDef("ParserMatchClass");
789 if (ClassInfo *CI = AsmOperandClasses[MatchClass])
792 throw TGError(OI.Rec->getLoc(), "operand has no match class!");
795 void AsmMatcherInfo::
796 BuildRegisterClasses(SmallPtrSet<Record*, 16> &SingletonRegisters) {
797 const std::vector<CodeGenRegister> &Registers = Target.getRegisters();
798 const std::vector<CodeGenRegisterClass> &RegClassList =
799 Target.getRegisterClasses();
801 // The register sets used for matching.
802 std::set< std::set<Record*> > RegisterSets;
804 // Gather the defined sets.
805 for (std::vector<CodeGenRegisterClass>::const_iterator it =
806 RegClassList.begin(), ie = RegClassList.end(); it != ie; ++it)
807 RegisterSets.insert(std::set<Record*>(it->Elements.begin(),
808 it->Elements.end()));
810 // Add any required singleton sets.
811 for (SmallPtrSet<Record*, 16>::iterator it = SingletonRegisters.begin(),
812 ie = SingletonRegisters.end(); it != ie; ++it) {
814 RegisterSets.insert(std::set<Record*>(&Rec, &Rec + 1));
817 // Introduce derived sets where necessary (when a register does not determine
818 // a unique register set class), and build the mapping of registers to the set
819 // they should classify to.
820 std::map<Record*, std::set<Record*> > RegisterMap;
821 for (std::vector<CodeGenRegister>::const_iterator it = Registers.begin(),
822 ie = Registers.end(); it != ie; ++it) {
823 const CodeGenRegister &CGR = *it;
824 // Compute the intersection of all sets containing this register.
825 std::set<Record*> ContainingSet;
827 for (std::set< std::set<Record*> >::iterator it = RegisterSets.begin(),
828 ie = RegisterSets.end(); it != ie; ++it) {
829 if (!it->count(CGR.TheDef))
832 if (ContainingSet.empty()) {
837 std::set<Record*> Tmp;
838 std::swap(Tmp, ContainingSet);
839 std::insert_iterator< std::set<Record*> > II(ContainingSet,
840 ContainingSet.begin());
841 std::set_intersection(Tmp.begin(), Tmp.end(), it->begin(), it->end(), II);
844 if (!ContainingSet.empty()) {
845 RegisterSets.insert(ContainingSet);
846 RegisterMap.insert(std::make_pair(CGR.TheDef, ContainingSet));
850 // Construct the register classes.
851 std::map<std::set<Record*>, ClassInfo*> RegisterSetClasses;
853 for (std::set< std::set<Record*> >::iterator it = RegisterSets.begin(),
854 ie = RegisterSets.end(); it != ie; ++it, ++Index) {
855 ClassInfo *CI = new ClassInfo();
856 CI->Kind = ClassInfo::RegisterClass0 + Index;
857 CI->ClassName = "Reg" + utostr(Index);
858 CI->Name = "MCK_Reg" + utostr(Index);
860 CI->PredicateMethod = ""; // unused
861 CI->RenderMethod = "addRegOperands";
863 Classes.push_back(CI);
864 RegisterSetClasses.insert(std::make_pair(*it, CI));
867 // Find the superclasses; we could compute only the subgroup lattice edges,
868 // but there isn't really a point.
869 for (std::set< std::set<Record*> >::iterator it = RegisterSets.begin(),
870 ie = RegisterSets.end(); it != ie; ++it) {
871 ClassInfo *CI = RegisterSetClasses[*it];
872 for (std::set< std::set<Record*> >::iterator it2 = RegisterSets.begin(),
873 ie2 = RegisterSets.end(); it2 != ie2; ++it2)
875 std::includes(it2->begin(), it2->end(), it->begin(), it->end()))
876 CI->SuperClasses.push_back(RegisterSetClasses[*it2]);
879 // Name the register classes which correspond to a user defined RegisterClass.
880 for (std::vector<CodeGenRegisterClass>::const_iterator
881 it = RegClassList.begin(), ie = RegClassList.end(); it != ie; ++it) {
882 ClassInfo *CI = RegisterSetClasses[std::set<Record*>(it->Elements.begin(),
883 it->Elements.end())];
884 if (CI->ValueName.empty()) {
885 CI->ClassName = it->getName();
886 CI->Name = "MCK_" + it->getName();
887 CI->ValueName = it->getName();
889 CI->ValueName = CI->ValueName + "," + it->getName();
891 RegisterClassClasses.insert(std::make_pair(it->TheDef, CI));
894 // Populate the map for individual registers.
895 for (std::map<Record*, std::set<Record*> >::iterator it = RegisterMap.begin(),
896 ie = RegisterMap.end(); it != ie; ++it)
897 RegisterClasses[it->first] = RegisterSetClasses[it->second];
899 // Name the register classes which correspond to singleton registers.
900 for (SmallPtrSet<Record*, 16>::iterator it = SingletonRegisters.begin(),
901 ie = SingletonRegisters.end(); it != ie; ++it) {
903 ClassInfo *CI = RegisterClasses[Rec];
904 assert(CI && "Missing singleton register class info!");
906 if (CI->ValueName.empty()) {
907 CI->ClassName = Rec->getName();
908 CI->Name = "MCK_" + Rec->getName();
909 CI->ValueName = Rec->getName();
911 CI->ValueName = CI->ValueName + "," + Rec->getName();
915 void AsmMatcherInfo::BuildOperandClasses() {
916 std::vector<Record*> AsmOperands =
917 Records.getAllDerivedDefinitions("AsmOperandClass");
919 // Pre-populate AsmOperandClasses map.
920 for (std::vector<Record*>::iterator it = AsmOperands.begin(),
921 ie = AsmOperands.end(); it != ie; ++it)
922 AsmOperandClasses[*it] = new ClassInfo();
925 for (std::vector<Record*>::iterator it = AsmOperands.begin(),
926 ie = AsmOperands.end(); it != ie; ++it, ++Index) {
927 ClassInfo *CI = AsmOperandClasses[*it];
928 CI->Kind = ClassInfo::UserClass0 + Index;
930 ListInit *Supers = (*it)->getValueAsListInit("SuperClasses");
931 for (unsigned i = 0, e = Supers->getSize(); i != e; ++i) {
932 DefInit *DI = dynamic_cast<DefInit*>(Supers->getElement(i));
934 PrintError((*it)->getLoc(), "Invalid super class reference!");
938 ClassInfo *SC = AsmOperandClasses[DI->getDef()];
940 PrintError((*it)->getLoc(), "Invalid super class reference!");
942 CI->SuperClasses.push_back(SC);
944 CI->ClassName = (*it)->getValueAsString("Name");
945 CI->Name = "MCK_" + CI->ClassName;
946 CI->ValueName = (*it)->getName();
948 // Get or construct the predicate method name.
949 Init *PMName = (*it)->getValueInit("PredicateMethod");
950 if (StringInit *SI = dynamic_cast<StringInit*>(PMName)) {
951 CI->PredicateMethod = SI->getValue();
953 assert(dynamic_cast<UnsetInit*>(PMName) &&
954 "Unexpected PredicateMethod field!");
955 CI->PredicateMethod = "is" + CI->ClassName;
958 // Get or construct the render method name.
959 Init *RMName = (*it)->getValueInit("RenderMethod");
960 if (StringInit *SI = dynamic_cast<StringInit*>(RMName)) {
961 CI->RenderMethod = SI->getValue();
963 assert(dynamic_cast<UnsetInit*>(RMName) &&
964 "Unexpected RenderMethod field!");
965 CI->RenderMethod = "add" + CI->ClassName + "Operands";
968 AsmOperandClasses[*it] = CI;
969 Classes.push_back(CI);
973 AsmMatcherInfo::AsmMatcherInfo(Record *asmParser, CodeGenTarget &target)
974 : AsmParser(asmParser), Target(target),
975 RegisterPrefix(AsmParser->getValueAsString("RegisterPrefix")) {
979 void AsmMatcherInfo::BuildInfo() {
980 // Build information about all of the AssemblerPredicates.
981 std::vector<Record*> AllPredicates =
982 Records.getAllDerivedDefinitions("Predicate");
983 for (unsigned i = 0, e = AllPredicates.size(); i != e; ++i) {
984 Record *Pred = AllPredicates[i];
985 // Ignore predicates that are not intended for the assembler.
986 if (!Pred->getValueAsBit("AssemblerMatcherPredicate"))
989 if (Pred->getName().empty())
990 throw TGError(Pred->getLoc(), "Predicate has no name!");
992 unsigned FeatureNo = SubtargetFeatures.size();
993 SubtargetFeatures[Pred] = new SubtargetFeatureInfo(Pred, FeatureNo);
994 assert(FeatureNo < 32 && "Too many subtarget features!");
997 StringRef CommentDelimiter = AsmParser->getValueAsString("CommentDelimiter");
999 // Parse the instructions; we need to do this first so that we can gather the
1000 // singleton register classes.
1001 SmallPtrSet<Record*, 16> SingletonRegisters;
1002 for (CodeGenTarget::inst_iterator I = Target.inst_begin(),
1003 E = Target.inst_end(); I != E; ++I) {
1004 const CodeGenInstruction &CGI = **I;
1006 // If the tblgen -match-prefix option is specified (for tblgen hackers),
1007 // filter the set of instructions we consider.
1008 if (!StringRef(CGI.TheDef->getName()).startswith(MatchPrefix))
1011 // Ignore "codegen only" instructions.
1012 if (CGI.TheDef->getValueAsBit("isCodeGenOnly"))
1015 // Validate the operand list to ensure we can handle this instruction.
1016 for (unsigned i = 0, e = CGI.Operands.size(); i != e; ++i) {
1017 const CGIOperandList::OperandInfo &OI = CGI.Operands[i];
1019 // Validate tied operands.
1020 if (OI.getTiedRegister() != -1) {
1021 // If we have a tied operand that consists of multiple MCOperands, reject
1022 // it. We reject aliases and ignore instructions for now.
1023 if (OI.MINumOperands != 1) {
1024 // FIXME: Should reject these. The ARM backend hits this with $lane
1025 // in a bunch of instructions. It is unclear what the right answer is.
1027 errs() << "warning: '" << CGI.TheDef->getName() << "': "
1028 << "ignoring instruction with multi-operand tied operand '"
1029 << OI.Name << "'\n";
1036 OwningPtr<MatchableInfo> II(new MatchableInfo(CGI));
1038 II->Initialize(*this, SingletonRegisters);
1040 // Ignore instructions which shouldn't be matched and diagnose invalid
1041 // instruction definitions with an error.
1042 if (!II->Validate(CommentDelimiter, true))
1045 // Ignore "Int_*" and "*_Int" instructions, which are internal aliases.
1047 // FIXME: This is a total hack.
1048 if (StringRef(II->InstrName).startswith("Int_") ||
1049 StringRef(II->InstrName).endswith("_Int"))
1052 Matchables.push_back(II.take());
1055 // Parse all of the InstAlias definitions and stick them in the list of
1057 std::vector<Record*> AllInstAliases =
1058 Records.getAllDerivedDefinitions("InstAlias");
1059 for (unsigned i = 0, e = AllInstAliases.size(); i != e; ++i) {
1060 CodeGenInstAlias *Alias = new CodeGenInstAlias(AllInstAliases[i]);
1062 OwningPtr<MatchableInfo> II(new MatchableInfo(Alias));
1064 II->Initialize(*this, SingletonRegisters);
1066 // Validate the alias definitions.
1067 II->Validate(CommentDelimiter, false);
1069 Matchables.push_back(II.take());
1072 // Build info for the register classes.
1073 BuildRegisterClasses(SingletonRegisters);
1075 // Build info for the user defined assembly operand classes.
1076 BuildOperandClasses();
1078 // Build the information about matchables, now that we have fully formed
1080 for (std::vector<MatchableInfo*>::iterator it = Matchables.begin(),
1081 ie = Matchables.end(); it != ie; ++it) {
1082 MatchableInfo *II = *it;
1084 // Parse the tokens after the mnemonic.
1085 for (unsigned i = 0, e = II->AsmOperands.size(); i != e; ++i) {
1086 MatchableInfo::AsmOperand &Op = II->AsmOperands[i];
1087 StringRef Token = Op.Token;
1089 // Check for singleton registers.
1090 if (Record *RegRecord = II->getSingletonRegisterForAsmOperand(i, *this)) {
1091 Op.Class = RegisterClasses[RegRecord];
1092 assert(Op.Class && Op.Class->Registers.size() == 1 &&
1093 "Unexpected class for singleton register");
1097 // Check for simple tokens.
1098 if (Token[0] != '$') {
1099 Op.Class = getTokenClass(Token);
1103 StringRef OperandName;
1104 if (Token[1] == '{')
1105 OperandName = Token.substr(2, Token.size() - 3);
1107 OperandName = Token.substr(1);
1109 // Otherwise this is an operand reference.
1110 BuildInstructionOperandReference(II, OperandName, Op);
1113 II->BuildResultOperands();
1116 // Reorder classes so that classes preceed super classes.
1117 std::sort(Classes.begin(), Classes.end(), less_ptr<ClassInfo>());
1120 /// BuildInstructionOperandReference - The specified operand is a reference to a
1121 /// named operand such as $src. Resolve the Class and OperandInfo pointers.
1122 void AsmMatcherInfo::
1123 BuildInstructionOperandReference(MatchableInfo *II,
1124 StringRef OperandName,
1125 MatchableInfo::AsmOperand &Op) {
1126 const CGIOperandList &Operands = II->TheOperandList;
1129 // Map this token to an operand. FIXME: Move elsewhere.
1131 if (!Operands.hasOperandNamed(OperandName, Idx))
1132 throw TGError(II->TheDef->getLoc(), "error: unable to find operand: '" +
1133 OperandName.str() + "'");
1135 // Set up the operand class.
1136 Op.Class = getOperandClass(Operands[Idx]);
1138 // If the named operand is tied, canonicalize it to the untied operand.
1139 // For example, something like:
1140 // (outs GPR:$dst), (ins GPR:$src)
1141 // with an asmstring of
1143 // we want to canonicalize to:
1145 // so that we know how to provide the $dst operand when filling in the result.
1146 int OITied = Operands[Idx].getTiedRegister();
1148 // The tied operand index is an MIOperand index, find the operand that
1150 for (unsigned i = 0, e = Operands.size(); i != e; ++i) {
1151 if (Operands[i].MIOperandNo == unsigned(OITied)) {
1152 OperandName = Operands[i].Name;
1158 Op.SrcOpName = OperandName;
1161 void MatchableInfo::BuildResultOperands() {
1162 for (unsigned i = 0, e = TheOperandList.size(); i != e; ++i) {
1163 const CGIOperandList::OperandInfo &OpInfo = TheOperandList[i];
1165 // If this is a tied operand, just copy from the previously handled operand.
1166 int TiedOp = OpInfo.getTiedRegister();
1168 ResOperands.push_back(ResOperand::getTiedOp(TiedOp, &OpInfo));
1172 // Find out what operand from the asmparser that this MCInst operand comes
1174 int SrcOperand = FindAsmOperandNamed(OpInfo.Name);
1176 if (!OpInfo.Name.empty() && SrcOperand != -1) {
1177 ResOperands.push_back(ResOperand::getRenderedOp(SrcOperand, &OpInfo));
1181 throw TGError(TheDef->getLoc(), "Instruction '" +
1182 TheDef->getName() + "' has operand '" + OpInfo.Name +
1183 "' that doesn't appear in asm string!");
1188 static void EmitConvertToMCInst(CodeGenTarget &Target,
1189 std::vector<MatchableInfo*> &Infos,
1191 // Write the convert function to a separate stream, so we can drop it after
1193 std::string ConvertFnBody;
1194 raw_string_ostream CvtOS(ConvertFnBody);
1196 // Function we have already generated.
1197 std::set<std::string> GeneratedFns;
1199 // Start the unified conversion function.
1200 CvtOS << "static void ConvertToMCInst(ConversionKind Kind, MCInst &Inst, "
1201 << "unsigned Opcode,\n"
1202 << " const SmallVectorImpl<MCParsedAsmOperand*"
1203 << "> &Operands) {\n";
1204 CvtOS << " Inst.setOpcode(Opcode);\n";
1205 CvtOS << " switch (Kind) {\n";
1206 CvtOS << " default:\n";
1208 // Start the enum, which we will generate inline.
1210 OS << "// Unified function for converting operands to MCInst instances.\n\n";
1211 OS << "enum ConversionKind {\n";
1213 // TargetOperandClass - This is the target's operand class, like X86Operand.
1214 std::string TargetOperandClass = Target.getName() + "Operand";
1216 for (std::vector<MatchableInfo*>::const_iterator it = Infos.begin(),
1217 ie = Infos.end(); it != ie; ++it) {
1218 MatchableInfo &II = **it;
1220 // Build the conversion function signature.
1221 std::string Signature = "Convert";
1222 std::string CaseBody;
1223 raw_string_ostream CaseOS(CaseBody);
1225 // Compute the convert enum and the case body.
1226 for (unsigned i = 0, e = II.ResOperands.size(); i != e; ++i) {
1227 const MatchableInfo::ResOperand &OpInfo = II.ResOperands[i];
1229 // Generate code to populate each result operand.
1230 switch (OpInfo.Kind) {
1231 default: assert(0 && "Unknown result operand kind");
1232 case MatchableInfo::ResOperand::RenderAsmOperand: {
1233 // This comes from something we parsed.
1234 MatchableInfo::AsmOperand &Op = II.AsmOperands[OpInfo.AsmOperandNum];
1236 // Registers are always converted the same, don't duplicate the
1237 // conversion function based on them.
1239 if (Op.Class->isRegisterClass())
1242 Signature += Op.Class->ClassName;
1243 Signature += utostr(OpInfo.OpInfo->MINumOperands);
1244 Signature += "_" + itostr(OpInfo.AsmOperandNum);
1246 CaseOS << " ((" << TargetOperandClass << "*)Operands["
1247 << (OpInfo.AsmOperandNum+1) << "])->" << Op.Class->RenderMethod
1248 << "(Inst, " << OpInfo.OpInfo->MINumOperands << ");\n";
1252 case MatchableInfo::ResOperand::TiedOperand: {
1253 // If this operand is tied to a previous one, just copy the MCInst
1254 // operand from the earlier one.We can only tie single MCOperand values.
1255 //assert(OpInfo.OpInfo->MINumOperands == 1 && "Not a singular MCOperand");
1256 unsigned TiedOp = OpInfo.TiedOperandNum;
1257 assert(i > TiedOp && "Tied operand preceeds its target!");
1258 CaseOS << " Inst.addOperand(Inst.getOperand(" << TiedOp << "));\n";
1259 Signature += "__Tie" + utostr(TiedOp);
1265 II.ConversionFnKind = Signature;
1267 // Check if we have already generated this signature.
1268 if (!GeneratedFns.insert(Signature).second)
1271 // If not, emit it now. Add to the enum list.
1272 OS << " " << Signature << ",\n";
1274 CvtOS << " case " << Signature << ":\n";
1275 CvtOS << CaseOS.str();
1276 CvtOS << " return;\n";
1279 // Finish the convert function.
1284 // Finish the enum, and drop the convert function after it.
1286 OS << " NumConversionVariants\n";
1292 /// EmitMatchClassEnumeration - Emit the enumeration for match class kinds.
1293 static void EmitMatchClassEnumeration(CodeGenTarget &Target,
1294 std::vector<ClassInfo*> &Infos,
1296 OS << "namespace {\n\n";
1298 OS << "/// MatchClassKind - The kinds of classes which participate in\n"
1299 << "/// instruction matching.\n";
1300 OS << "enum MatchClassKind {\n";
1301 OS << " InvalidMatchClass = 0,\n";
1302 for (std::vector<ClassInfo*>::iterator it = Infos.begin(),
1303 ie = Infos.end(); it != ie; ++it) {
1304 ClassInfo &CI = **it;
1305 OS << " " << CI.Name << ", // ";
1306 if (CI.Kind == ClassInfo::Token) {
1307 OS << "'" << CI.ValueName << "'\n";
1308 } else if (CI.isRegisterClass()) {
1309 if (!CI.ValueName.empty())
1310 OS << "register class '" << CI.ValueName << "'\n";
1312 OS << "derived register class\n";
1314 OS << "user defined class '" << CI.ValueName << "'\n";
1317 OS << " NumMatchClassKinds\n";
1323 /// EmitClassifyOperand - Emit the function to classify an operand.
1324 static void EmitClassifyOperand(AsmMatcherInfo &Info,
1326 OS << "static MatchClassKind ClassifyOperand(MCParsedAsmOperand *GOp) {\n"
1327 << " " << Info.Target.getName() << "Operand &Operand = *("
1328 << Info.Target.getName() << "Operand*)GOp;\n";
1331 OS << " if (Operand.isToken())\n";
1332 OS << " return MatchTokenString(Operand.getToken());\n\n";
1334 // Classify registers.
1336 // FIXME: Don't hardcode isReg, getReg.
1337 OS << " if (Operand.isReg()) {\n";
1338 OS << " switch (Operand.getReg()) {\n";
1339 OS << " default: return InvalidMatchClass;\n";
1340 for (std::map<Record*, ClassInfo*>::iterator
1341 it = Info.RegisterClasses.begin(), ie = Info.RegisterClasses.end();
1343 OS << " case " << Info.Target.getName() << "::"
1344 << it->first->getName() << ": return " << it->second->Name << ";\n";
1348 // Classify user defined operands.
1349 for (std::vector<ClassInfo*>::iterator it = Info.Classes.begin(),
1350 ie = Info.Classes.end(); it != ie; ++it) {
1351 ClassInfo &CI = **it;
1353 if (!CI.isUserClass())
1356 OS << " // '" << CI.ClassName << "' class";
1357 if (!CI.SuperClasses.empty()) {
1358 OS << ", subclass of ";
1359 for (unsigned i = 0, e = CI.SuperClasses.size(); i != e; ++i) {
1361 OS << "'" << CI.SuperClasses[i]->ClassName << "'";
1362 assert(CI < *CI.SuperClasses[i] && "Invalid class relation!");
1367 OS << " if (Operand." << CI.PredicateMethod << "()) {\n";
1369 // Validate subclass relationships.
1370 if (!CI.SuperClasses.empty()) {
1371 for (unsigned i = 0, e = CI.SuperClasses.size(); i != e; ++i)
1372 OS << " assert(Operand." << CI.SuperClasses[i]->PredicateMethod
1373 << "() && \"Invalid class relationship!\");\n";
1376 OS << " return " << CI.Name << ";\n";
1379 OS << " return InvalidMatchClass;\n";
1383 /// EmitIsSubclass - Emit the subclass predicate function.
1384 static void EmitIsSubclass(CodeGenTarget &Target,
1385 std::vector<ClassInfo*> &Infos,
1387 OS << "/// IsSubclass - Compute whether \\arg A is a subclass of \\arg B.\n";
1388 OS << "static bool IsSubclass(MatchClassKind A, MatchClassKind B) {\n";
1389 OS << " if (A == B)\n";
1390 OS << " return true;\n\n";
1392 OS << " switch (A) {\n";
1393 OS << " default:\n";
1394 OS << " return false;\n";
1395 for (std::vector<ClassInfo*>::iterator it = Infos.begin(),
1396 ie = Infos.end(); it != ie; ++it) {
1397 ClassInfo &A = **it;
1399 if (A.Kind != ClassInfo::Token) {
1400 std::vector<StringRef> SuperClasses;
1401 for (std::vector<ClassInfo*>::iterator it = Infos.begin(),
1402 ie = Infos.end(); it != ie; ++it) {
1403 ClassInfo &B = **it;
1405 if (&A != &B && A.isSubsetOf(B))
1406 SuperClasses.push_back(B.Name);
1409 if (SuperClasses.empty())
1412 OS << "\n case " << A.Name << ":\n";
1414 if (SuperClasses.size() == 1) {
1415 OS << " return B == " << SuperClasses.back() << ";\n";
1419 OS << " switch (B) {\n";
1420 OS << " default: return false;\n";
1421 for (unsigned i = 0, e = SuperClasses.size(); i != e; ++i)
1422 OS << " case " << SuperClasses[i] << ": return true;\n";
1432 /// EmitMatchTokenString - Emit the function to match a token string to the
1433 /// appropriate match class value.
1434 static void EmitMatchTokenString(CodeGenTarget &Target,
1435 std::vector<ClassInfo*> &Infos,
1437 // Construct the match list.
1438 std::vector<StringMatcher::StringPair> Matches;
1439 for (std::vector<ClassInfo*>::iterator it = Infos.begin(),
1440 ie = Infos.end(); it != ie; ++it) {
1441 ClassInfo &CI = **it;
1443 if (CI.Kind == ClassInfo::Token)
1444 Matches.push_back(StringMatcher::StringPair(CI.ValueName,
1445 "return " + CI.Name + ";"));
1448 OS << "static MatchClassKind MatchTokenString(StringRef Name) {\n";
1450 StringMatcher("Name", Matches, OS).Emit();
1452 OS << " return InvalidMatchClass;\n";
1456 /// EmitMatchRegisterName - Emit the function to match a string to the target
1457 /// specific register enum.
1458 static void EmitMatchRegisterName(CodeGenTarget &Target, Record *AsmParser,
1460 // Construct the match list.
1461 std::vector<StringMatcher::StringPair> Matches;
1462 for (unsigned i = 0, e = Target.getRegisters().size(); i != e; ++i) {
1463 const CodeGenRegister &Reg = Target.getRegisters()[i];
1464 if (Reg.TheDef->getValueAsString("AsmName").empty())
1467 Matches.push_back(StringMatcher::StringPair(
1468 Reg.TheDef->getValueAsString("AsmName"),
1469 "return " + utostr(i + 1) + ";"));
1472 OS << "static unsigned MatchRegisterName(StringRef Name) {\n";
1474 StringMatcher("Name", Matches, OS).Emit();
1476 OS << " return 0;\n";
1480 /// EmitSubtargetFeatureFlagEnumeration - Emit the subtarget feature flag
1482 static void EmitSubtargetFeatureFlagEnumeration(AsmMatcherInfo &Info,
1484 OS << "// Flags for subtarget features that participate in "
1485 << "instruction matching.\n";
1486 OS << "enum SubtargetFeatureFlag {\n";
1487 for (std::map<Record*, SubtargetFeatureInfo*>::const_iterator
1488 it = Info.SubtargetFeatures.begin(),
1489 ie = Info.SubtargetFeatures.end(); it != ie; ++it) {
1490 SubtargetFeatureInfo &SFI = *it->second;
1491 OS << " " << SFI.getEnumName() << " = (1 << " << SFI.Index << "),\n";
1493 OS << " Feature_None = 0\n";
1497 /// EmitComputeAvailableFeatures - Emit the function to compute the list of
1498 /// available features given a subtarget.
1499 static void EmitComputeAvailableFeatures(AsmMatcherInfo &Info,
1501 std::string ClassName =
1502 Info.AsmParser->getValueAsString("AsmParserClassName");
1504 OS << "unsigned " << Info.Target.getName() << ClassName << "::\n"
1505 << "ComputeAvailableFeatures(const " << Info.Target.getName()
1506 << "Subtarget *Subtarget) const {\n";
1507 OS << " unsigned Features = 0;\n";
1508 for (std::map<Record*, SubtargetFeatureInfo*>::const_iterator
1509 it = Info.SubtargetFeatures.begin(),
1510 ie = Info.SubtargetFeatures.end(); it != ie; ++it) {
1511 SubtargetFeatureInfo &SFI = *it->second;
1512 OS << " if (" << SFI.TheDef->getValueAsString("CondString")
1514 OS << " Features |= " << SFI.getEnumName() << ";\n";
1516 OS << " return Features;\n";
1520 static std::string GetAliasRequiredFeatures(Record *R,
1521 const AsmMatcherInfo &Info) {
1522 std::vector<Record*> ReqFeatures = R->getValueAsListOfDefs("Predicates");
1524 unsigned NumFeatures = 0;
1525 for (unsigned i = 0, e = ReqFeatures.size(); i != e; ++i) {
1526 SubtargetFeatureInfo *F = Info.getSubtargetFeature(ReqFeatures[i]);
1529 throw TGError(R->getLoc(), "Predicate '" + ReqFeatures[i]->getName() +
1530 "' is not marked as an AssemblerPredicate!");
1535 Result += F->getEnumName();
1539 if (NumFeatures > 1)
1540 Result = '(' + Result + ')';
1544 /// EmitMnemonicAliases - If the target has any MnemonicAlias<> definitions,
1545 /// emit a function for them and return true, otherwise return false.
1546 static bool EmitMnemonicAliases(raw_ostream &OS, const AsmMatcherInfo &Info) {
1547 std::vector<Record*> Aliases =
1548 Records.getAllDerivedDefinitions("MnemonicAlias");
1549 if (Aliases.empty()) return false;
1551 OS << "static void ApplyMnemonicAliases(StringRef &Mnemonic, "
1552 "unsigned Features) {\n";
1554 // Keep track of all the aliases from a mnemonic. Use an std::map so that the
1555 // iteration order of the map is stable.
1556 std::map<std::string, std::vector<Record*> > AliasesFromMnemonic;
1558 for (unsigned i = 0, e = Aliases.size(); i != e; ++i) {
1559 Record *R = Aliases[i];
1560 AliasesFromMnemonic[R->getValueAsString("FromMnemonic")].push_back(R);
1563 // Process each alias a "from" mnemonic at a time, building the code executed
1564 // by the string remapper.
1565 std::vector<StringMatcher::StringPair> Cases;
1566 for (std::map<std::string, std::vector<Record*> >::iterator
1567 I = AliasesFromMnemonic.begin(), E = AliasesFromMnemonic.end();
1569 const std::vector<Record*> &ToVec = I->second;
1571 // Loop through each alias and emit code that handles each case. If there
1572 // are two instructions without predicates, emit an error. If there is one,
1574 std::string MatchCode;
1575 int AliasWithNoPredicate = -1;
1577 for (unsigned i = 0, e = ToVec.size(); i != e; ++i) {
1578 Record *R = ToVec[i];
1579 std::string FeatureMask = GetAliasRequiredFeatures(R, Info);
1581 // If this unconditionally matches, remember it for later and diagnose
1583 if (FeatureMask.empty()) {
1584 if (AliasWithNoPredicate != -1) {
1585 // We can't have two aliases from the same mnemonic with no predicate.
1586 PrintError(ToVec[AliasWithNoPredicate]->getLoc(),
1587 "two MnemonicAliases with the same 'from' mnemonic!");
1588 throw TGError(R->getLoc(), "this is the other MnemonicAlias.");
1591 AliasWithNoPredicate = i;
1595 if (!MatchCode.empty())
1596 MatchCode += "else ";
1597 MatchCode += "if ((Features & " + FeatureMask + ") == "+FeatureMask+")\n";
1598 MatchCode += " Mnemonic = \"" +R->getValueAsString("ToMnemonic")+"\";\n";
1601 if (AliasWithNoPredicate != -1) {
1602 Record *R = ToVec[AliasWithNoPredicate];
1603 if (!MatchCode.empty())
1604 MatchCode += "else\n ";
1605 MatchCode += "Mnemonic = \"" + R->getValueAsString("ToMnemonic")+"\";\n";
1608 MatchCode += "return;";
1610 Cases.push_back(std::make_pair(I->first, MatchCode));
1614 StringMatcher("Mnemonic", Cases, OS).Emit();
1620 void AsmMatcherEmitter::run(raw_ostream &OS) {
1621 CodeGenTarget Target;
1622 Record *AsmParser = Target.getAsmParser();
1623 std::string ClassName = AsmParser->getValueAsString("AsmParserClassName");
1625 // Compute the information on the instructions to match.
1626 AsmMatcherInfo Info(AsmParser, Target);
1629 // Sort the instruction table using the partial order on classes. We use
1630 // stable_sort to ensure that ambiguous instructions are still
1631 // deterministically ordered.
1632 std::stable_sort(Info.Matchables.begin(), Info.Matchables.end(),
1633 less_ptr<MatchableInfo>());
1635 DEBUG_WITH_TYPE("instruction_info", {
1636 for (std::vector<MatchableInfo*>::iterator
1637 it = Info.Matchables.begin(), ie = Info.Matchables.end();
1642 // Check for ambiguous matchables.
1643 DEBUG_WITH_TYPE("ambiguous_instrs", {
1644 unsigned NumAmbiguous = 0;
1645 for (unsigned i = 0, e = Info.Matchables.size(); i != e; ++i) {
1646 for (unsigned j = i + 1; j != e; ++j) {
1647 MatchableInfo &A = *Info.Matchables[i];
1648 MatchableInfo &B = *Info.Matchables[j];
1650 if (A.CouldMatchAmiguouslyWith(B)) {
1651 errs() << "warning: ambiguous matchables:\n";
1653 errs() << "\nis incomparable with:\n";
1661 errs() << "warning: " << NumAmbiguous
1662 << " ambiguous matchables!\n";
1665 // Write the output.
1667 EmitSourceFileHeader("Assembly Matcher Source Fragment", OS);
1669 // Information for the class declaration.
1670 OS << "\n#ifdef GET_ASSEMBLER_HEADER\n";
1671 OS << "#undef GET_ASSEMBLER_HEADER\n";
1672 OS << " // This should be included into the middle of the declaration of \n";
1673 OS << " // your subclasses implementation of TargetAsmParser.\n";
1674 OS << " unsigned ComputeAvailableFeatures(const " <<
1675 Target.getName() << "Subtarget *Subtarget) const;\n";
1676 OS << " enum MatchResultTy {\n";
1677 OS << " Match_Success, Match_MnemonicFail, Match_InvalidOperand,\n";
1678 OS << " Match_MissingFeature\n";
1680 OS << " MatchResultTy MatchInstructionImpl(const "
1681 << "SmallVectorImpl<MCParsedAsmOperand*>"
1682 << " &Operands, MCInst &Inst, unsigned &ErrorInfo);\n\n";
1683 OS << "#endif // GET_ASSEMBLER_HEADER_INFO\n\n";
1688 OS << "\n#ifdef GET_REGISTER_MATCHER\n";
1689 OS << "#undef GET_REGISTER_MATCHER\n\n";
1691 // Emit the subtarget feature enumeration.
1692 EmitSubtargetFeatureFlagEnumeration(Info, OS);
1694 // Emit the function to match a register name to number.
1695 EmitMatchRegisterName(Target, AsmParser, OS);
1697 OS << "#endif // GET_REGISTER_MATCHER\n\n";
1700 OS << "\n#ifdef GET_MATCHER_IMPLEMENTATION\n";
1701 OS << "#undef GET_MATCHER_IMPLEMENTATION\n\n";
1703 // Generate the function that remaps for mnemonic aliases.
1704 bool HasMnemonicAliases = EmitMnemonicAliases(OS, Info);
1706 // Generate the unified function to convert operands into an MCInst.
1707 EmitConvertToMCInst(Target, Info.Matchables, OS);
1709 // Emit the enumeration for classes which participate in matching.
1710 EmitMatchClassEnumeration(Target, Info.Classes, OS);
1712 // Emit the routine to match token strings to their match class.
1713 EmitMatchTokenString(Target, Info.Classes, OS);
1715 // Emit the routine to classify an operand.
1716 EmitClassifyOperand(Info, OS);
1718 // Emit the subclass predicate routine.
1719 EmitIsSubclass(Target, Info.Classes, OS);
1721 // Emit the available features compute function.
1722 EmitComputeAvailableFeatures(Info, OS);
1725 size_t MaxNumOperands = 0;
1726 for (std::vector<MatchableInfo*>::const_iterator it =
1727 Info.Matchables.begin(), ie = Info.Matchables.end();
1729 MaxNumOperands = std::max(MaxNumOperands, (*it)->AsmOperands.size());
1732 // Emit the static match table; unused classes get initalized to 0 which is
1733 // guaranteed to be InvalidMatchClass.
1735 // FIXME: We can reduce the size of this table very easily. First, we change
1736 // it so that store the kinds in separate bit-fields for each index, which
1737 // only needs to be the max width used for classes at that index (we also need
1738 // to reject based on this during classification). If we then make sure to
1739 // order the match kinds appropriately (putting mnemonics last), then we
1740 // should only end up using a few bits for each class, especially the ones
1741 // following the mnemonic.
1742 OS << "namespace {\n";
1743 OS << " struct MatchEntry {\n";
1744 OS << " unsigned Opcode;\n";
1745 OS << " const char *Mnemonic;\n";
1746 OS << " ConversionKind ConvertFn;\n";
1747 OS << " MatchClassKind Classes[" << MaxNumOperands << "];\n";
1748 OS << " unsigned RequiredFeatures;\n";
1751 OS << "// Predicate for searching for an opcode.\n";
1752 OS << " struct LessOpcode {\n";
1753 OS << " bool operator()(const MatchEntry &LHS, StringRef RHS) {\n";
1754 OS << " return StringRef(LHS.Mnemonic) < RHS;\n";
1756 OS << " bool operator()(StringRef LHS, const MatchEntry &RHS) {\n";
1757 OS << " return LHS < StringRef(RHS.Mnemonic);\n";
1759 OS << " bool operator()(const MatchEntry &LHS, const MatchEntry &RHS) {\n";
1760 OS << " return StringRef(LHS.Mnemonic) < StringRef(RHS.Mnemonic);\n";
1764 OS << "} // end anonymous namespace.\n\n";
1766 OS << "static const MatchEntry MatchTable["
1767 << Info.Matchables.size() << "] = {\n";
1769 for (std::vector<MatchableInfo*>::const_iterator it =
1770 Info.Matchables.begin(), ie = Info.Matchables.end();
1772 MatchableInfo &II = **it;
1774 OS << " { " << Target.getName() << "::" << II.InstrName
1775 << ", \"" << II.Mnemonic << "\""
1776 << ", " << II.ConversionFnKind << ", { ";
1777 for (unsigned i = 0, e = II.AsmOperands.size(); i != e; ++i) {
1778 MatchableInfo::AsmOperand &Op = II.AsmOperands[i];
1781 OS << Op.Class->Name;
1785 // Write the required features mask.
1786 if (!II.RequiredFeatures.empty()) {
1787 for (unsigned i = 0, e = II.RequiredFeatures.size(); i != e; ++i) {
1789 OS << II.RequiredFeatures[i]->getEnumName();
1799 // Finally, build the match function.
1800 OS << Target.getName() << ClassName << "::MatchResultTy "
1801 << Target.getName() << ClassName << "::\n"
1802 << "MatchInstructionImpl(const SmallVectorImpl<MCParsedAsmOperand*>"
1804 OS << " MCInst &Inst, unsigned &ErrorInfo) {\n";
1806 // Emit code to get the available features.
1807 OS << " // Get the current feature set.\n";
1808 OS << " unsigned AvailableFeatures = getAvailableFeatures();\n\n";
1810 OS << " // Get the instruction mnemonic, which is the first token.\n";
1811 OS << " StringRef Mnemonic = ((" << Target.getName()
1812 << "Operand*)Operands[0])->getToken();\n\n";
1814 if (HasMnemonicAliases) {
1815 OS << " // Process all MnemonicAliases to remap the mnemonic.\n";
1816 OS << " ApplyMnemonicAliases(Mnemonic, AvailableFeatures);\n\n";
1819 // Emit code to compute the class list for this operand vector.
1820 OS << " // Eliminate obvious mismatches.\n";
1821 OS << " if (Operands.size() > " << (MaxNumOperands+1) << ") {\n";
1822 OS << " ErrorInfo = " << (MaxNumOperands+1) << ";\n";
1823 OS << " return Match_InvalidOperand;\n";
1826 OS << " // Compute the class list for this operand vector.\n";
1827 OS << " MatchClassKind Classes[" << MaxNumOperands << "];\n";
1828 OS << " for (unsigned i = 1, e = Operands.size(); i != e; ++i) {\n";
1829 OS << " Classes[i-1] = ClassifyOperand(Operands[i]);\n\n";
1831 OS << " // Check for invalid operands before matching.\n";
1832 OS << " if (Classes[i-1] == InvalidMatchClass) {\n";
1833 OS << " ErrorInfo = i;\n";
1834 OS << " return Match_InvalidOperand;\n";
1838 OS << " // Mark unused classes.\n";
1839 OS << " for (unsigned i = Operands.size()-1, e = " << MaxNumOperands << "; "
1840 << "i != e; ++i)\n";
1841 OS << " Classes[i] = InvalidMatchClass;\n\n";
1843 OS << " // Some state to try to produce better error messages.\n";
1844 OS << " bool HadMatchOtherThanFeatures = false;\n\n";
1845 OS << " // Set ErrorInfo to the operand that mismatches if it is \n";
1846 OS << " // wrong for all instances of the instruction.\n";
1847 OS << " ErrorInfo = ~0U;\n";
1849 // Emit code to search the table.
1850 OS << " // Search the table.\n";
1851 OS << " std::pair<const MatchEntry*, const MatchEntry*> MnemonicRange =\n";
1852 OS << " std::equal_range(MatchTable, MatchTable+"
1853 << Info.Matchables.size() << ", Mnemonic, LessOpcode());\n\n";
1855 OS << " // Return a more specific error code if no mnemonics match.\n";
1856 OS << " if (MnemonicRange.first == MnemonicRange.second)\n";
1857 OS << " return Match_MnemonicFail;\n\n";
1859 OS << " for (const MatchEntry *it = MnemonicRange.first, "
1860 << "*ie = MnemonicRange.second;\n";
1861 OS << " it != ie; ++it) {\n";
1863 OS << " // equal_range guarantees that instruction mnemonic matches.\n";
1864 OS << " assert(Mnemonic == it->Mnemonic);\n";
1866 // Emit check that the subclasses match.
1867 OS << " bool OperandsValid = true;\n";
1868 OS << " for (unsigned i = 0; i != " << MaxNumOperands << "; ++i) {\n";
1869 OS << " if (IsSubclass(Classes[i], it->Classes[i]))\n";
1870 OS << " continue;\n";
1871 OS << " // If this operand is broken for all of the instances of this\n";
1872 OS << " // mnemonic, keep track of it so we can report loc info.\n";
1873 OS << " if (it == MnemonicRange.first || ErrorInfo == i+1)\n";
1874 OS << " ErrorInfo = i+1;\n";
1876 OS << " ErrorInfo = ~0U;";
1877 OS << " // Otherwise, just reject this instance of the mnemonic.\n";
1878 OS << " OperandsValid = false;\n";
1882 OS << " if (!OperandsValid) continue;\n";
1884 // Emit check that the required features are available.
1885 OS << " if ((AvailableFeatures & it->RequiredFeatures) "
1886 << "!= it->RequiredFeatures) {\n";
1887 OS << " HadMatchOtherThanFeatures = true;\n";
1888 OS << " continue;\n";
1892 OS << " ConvertToMCInst(it->ConvertFn, Inst, it->Opcode, Operands);\n";
1894 // Call the post-processing function, if used.
1895 std::string InsnCleanupFn =
1896 AsmParser->getValueAsString("AsmParserInstCleanup");
1897 if (!InsnCleanupFn.empty())
1898 OS << " " << InsnCleanupFn << "(Inst);\n";
1900 OS << " return Match_Success;\n";
1903 OS << " // Okay, we had no match. Try to return a useful error code.\n";
1904 OS << " if (HadMatchOtherThanFeatures) return Match_MissingFeature;\n";
1905 OS << " return Match_InvalidOperand;\n";
1908 OS << "#endif // GET_MATCHER_IMPLEMENTATION\n\n";