RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2024-12-27 22:55:15 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

fix computation of ambiguous instructions to not ignore the mnemonic.

Browse Source 
FWIW, X86 has 254 ambiguous instructions.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@117979 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2010-11-01 23:57:23 +00:00
parent 9af3d1c0dc
commit e66b7ebfb4
1 changed files with 7 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
utils/TableGen/AsmMatcherEmitter.cpp
View File

@ -411,6 +411,10 @@ struct MatchableInfo {
/// ambiguously match the same set of operands as \arg RHS (without being a
/// strictly superior match).
bool CouldMatchAmiguouslyWith(const MatchableInfo &RHS) {
// The primary comparator is the instruction mnemonic.
if (Tokens[0] != RHS.Tokens[0])
return false;
// The number of operands is unambiguous.
if (Operands.size() != RHS.Operands.size())
return false;
@ -849,8 +853,8 @@ BuildRegisterClasses(SmallPtrSet<Record*, 16> &SingletonRegisters) {
}
void AsmMatcherInfo::BuildOperandClasses() {
std::vector<Record*> AsmOperands;
AsmOperands = Records.getAllDerivedDefinitions("AsmOperandClass");
std::vector<Record*> AsmOperands =
Records.getAllDerivedDefinitions("AsmOperandClass");
// Pre-populate AsmOperandClasses map.
for (std::vector<Record*>::iterator it = AsmOperands.begin(),
@ -1127,7 +1131,7 @@ static void EmitConvertToMCInst(CodeGenTarget &Target,
}
}
std::sort(MIOperandList.begin(), MIOperandList.end());
array_pod_sort(MIOperandList.begin(), MIOperandList.end());
// Compute the total number of operands.
unsigned NumMIOperands = 0;