maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

[TableGen] Remove dead code. NFCI. 

llvm-svn: 274515
This commit is contained in:
Davide Italiano 2016-07-04 19:21:42 +00:00
parent 391e3a873e
commit 774e41cc47
1 changed files with 0 additions and 28 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

28
llvm/utils/TableGen/FixedLenDecoderEmitter.cpp
View File

@ -410,9 +410,6 @@ protected:
return Filters[BestIndex]; return Filters[BestIndex];
} }
// Called from Filter::recurse() when singleton exists. For debug purpose.
void SingletonExists(unsigned Opc) const;
bool PositionFiltered(unsigned i) const { bool PositionFiltered(unsigned i) const {
return ValueSet(FilterBitValues[i]); return ValueSet(FilterBitValues[i]);
} }
@ -559,7 +556,6 @@ void Filter::recurse() {
// No need to recurse for a singleton filtered instruction. // No need to recurse for a singleton filtered instruction.
// See also Filter::emit*(). // See also Filter::emit*().
if (getNumFiltered() == 1) { if (getNumFiltered() == 1) {
//Owner->SingletonExists(LastOpcFiltered);
assert(FilterChooserMap.size() == 1); assert(FilterChooserMap.size() == 1);
return; 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. // Calculates the island(s) needed to decode the instruction.
// This returns a list of undecoded bits of an instructions, for example, // 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 // Inst{20} = 1 && Inst{3-0} == 0b1111 represents two islands of yet-to-be