From 2b1f943444d1853204725c7b45b1e1032be39958 Mon Sep 17 00:00:00 2001 From: Chris Lattner Date: Mon, 6 Sep 2010 21:22:45 +0000 Subject: now that the opcode is trivially exposed, start matching instructions by doing a binary search over the mnemonic instead of doing a linear search through all possible instructions. This implements rdar://7785064 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@113171 91177308-0d34-0410-b5e6-96231b3b80d8 --- utils/TableGen/AsmMatcherEmitter.cpp | 28 ++++++++++++++++++++++------ 1 file changed, 22 insertions(+), 6 deletions(-) (limited to 'utils') diff --git a/utils/TableGen/AsmMatcherEmitter.cpp b/utils/TableGen/AsmMatcherEmitter.cpp index 8cc8a36208..a9dd6b6e97 100644 --- a/utils/TableGen/AsmMatcherEmitter.cpp +++ b/utils/TableGen/AsmMatcherEmitter.cpp @@ -1629,7 +1629,18 @@ void AsmMatcherEmitter::run(raw_ostream &OS) { OS << " ConversionKind ConvertFn;\n"; OS << " MatchClassKind Classes[" << MaxNumOperands << "];\n"; OS << " unsigned RequiredFeatures;\n"; + OS << " };\n\n"; + + OS << "// Predicate for searching for an opcode.\n"; + OS << " struct LessOpcode {\n"; + OS << " bool operator()(const MatchEntry &LHS, StringRef RHS) {\n"; + OS << " return StringRef(LHS.Mnemonic) < RHS;\n"; + OS << " }\n"; + OS << " bool operator()(StringRef LHS, const MatchEntry &RHS) {\n"; + OS << " return LHS < StringRef(RHS.Mnemonic);\n"; + OS << " }\n"; OS << " };\n"; + OS << "} // end anonymous namespace.\n\n"; OS << "static const MatchEntry MatchTable[" @@ -1699,16 +1710,21 @@ void AsmMatcherEmitter::run(raw_ostream &OS) { OS << " // Get the instruction mneumonic, which is the first token.\n"; OS << " StringRef Mnemonic = ((" << Target.getName() << "Operand*)Operands[0])->getToken();\n\n"; - + + OS << " bool HadMatchOtherThanFeatures = false;\n\n"; + // Emit code to search the table. OS << " // Search the table.\n"; - OS << " bool HadMatchOtherThanFeatures = false;\n"; - OS << " for (const MatchEntry *it = MatchTable, " - << "*ie = MatchTable + " << Info.Instructions.size() - << "; it != ie; ++it) {\n"; + OS << " std::pair MnemonicRange =\n"; + OS << " std::equal_range(MatchTable, MatchTable+" + << Info.Instructions.size() << ", Mnemonic, LessOpcode());\n\n"; + + OS << " for (const MatchEntry *it = MnemonicRange.first, " + << "*ie = MnemonicRange.second;\n" + OS << " it != ie; ++it) {\n"; OS << " // Instruction mneumonic must match.\n"; - OS << " if (Mnemonic != it->Mnemonic) continue;"; + OS << " if (Mnemonic != it->Mnemonic) continue;\n"; // Emit check that the subclasses match. for (unsigned i = 0; i != MaxNumOperands; ++i) { -- cgit v1.2.3