From ed686df9537160a52ca0c834241d36a905b5d4c5 Mon Sep 17 00:00:00 2001 From: Davide Italiano Date: Mon, 4 Jul 2016 19:21:42 +0000 Subject: [PATCH] [TableGen] Remove dead code. NFCI. llvm-svn: 274515 --- utils/TableGen/FixedLenDecoderEmitter.cpp | 28 ----------------------- 1 file changed, 28 deletions(-) diff --git a/utils/TableGen/FixedLenDecoderEmitter.cpp b/utils/TableGen/FixedLenDecoderEmitter.cpp index ca6fe501f73..0506400b90f 100644 --- a/utils/TableGen/FixedLenDecoderEmitter.cpp +++ b/utils/TableGen/FixedLenDecoderEmitter.cpp @@ -410,9 +410,6 @@ protected: return Filters[BestIndex]; } - // Called from Filter::recurse() when singleton exists. For debug purpose. - void SingletonExists(unsigned Opc) const; - bool PositionFiltered(unsigned i) const { return ValueSet(FilterBitValues[i]); } @@ -559,7 +556,6 @@ void Filter::recurse() { // No need to recurse for a singleton filtered instruction. // See also Filter::emit*(). if (getNumFiltered() == 1) { - //Owner->SingletonExists(LastOpcFiltered); assert(FilterChooserMap.size() == 1); return; } @@ -977,30 +973,6 @@ void FilterChooser::dumpStack(raw_ostream &o, const char *prefix) const { } } -// Called from Filter::recurse() when singleton exists. For debug purpose. -void FilterChooser::SingletonExists(unsigned Opc) const { - insn_t Insn0; - insnWithID(Insn0, Opc); - - errs() << "Singleton exists: " << nameWithID(Opc) - << " with its decoding dominating "; - for (unsigned i = 0; i < Opcodes.size(); ++i) { - if (Opcodes[i] == Opc) continue; - errs() << nameWithID(Opcodes[i]) << ' '; - } - errs() << '\n'; - - dumpStack(errs(), "\t\t"); - for (unsigned i = 0; i < Opcodes.size(); ++i) { - const std::string &Name = nameWithID(Opcodes[i]); - - errs() << '\t' << Name << " "; - dumpBits(errs(), - getBitsField(*AllInstructions[Opcodes[i]]->TheDef, "Inst")); - errs() << '\n'; - } -} - // Calculates the island(s) needed to decode the instruction. // This returns a list of undecoded bits of an instructions, for example, // Inst{20} = 1 && Inst{3-0} == 0b1111 represents two islands of yet-to-be