with getType() == MVT::i32 etc. Teach it that two different
integer constants are contradictory. This cuts 1K off the X86
table, down to 98k
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@97314
91177308-0d34-0410-b5e6-
96231b3b80d8
}
// TODO: CheckMultiOpcodeMatcher?
- // TODO: CheckType?
+
+ // This is a special common case we see a lot in the X86 backend, we know that
+ // ISD::STORE nodes can't have non-void type.
+ if (const CheckTypeMatcher *CT = dyn_cast<CheckTypeMatcher>(M))
+ return getOpcodeName() == "ISD::STORE" && CT->getType() != MVT::isVoid;
+
return false;
}
return false;
}
-
+bool CheckIntegerMatcher::isContradictoryImpl(const Matcher *M) const {
+ if (const CheckIntegerMatcher *CIM = dyn_cast<CheckIntegerMatcher>(M))
+ return CIM->getValue() != getValue();
+ return false;
+}
return cast<CheckIntegerMatcher>(M)->Value == Value;
}
virtual unsigned getHashImpl() const { return Value; }
+ virtual bool isContradictoryImpl(const Matcher *M) const;
};
/// CheckCondCodeMatcher - This checks to see if the current node is a
}
if (Scan != e) {
- DEBUG(errs() << "Couldn't merge this:\n ";
- Optn->printOne(errs());
- errs() << "into this:\n ";
- OptionsToMatch[OptionIdx]->printOne(errs());
+ DEBUG(errs() << "Couldn't merge this:\n";
+ Optn->print(errs(), 4);
+ errs() << "into this:\n";
+ OptionsToMatch[Scan]->print(errs(), 4);
if (OptionIdx+1 != e)
- OptionsToMatch[OptionIdx+1]->printOne(errs());
+ OptionsToMatch[Scan+1]->printOne(errs());
if (OptionIdx+2 < e)
- OptionsToMatch[OptionIdx+2]->printOne(errs());
+ OptionsToMatch[Scan+2]->printOne(errs());
errs() << "\n");
}