Cross Reference: /external/llvm/utils/TableGen/CodeGenDAGPatterns.cpp

Lines Matching defs:TreePattern
45 EEVT::TypeSet::TypeSet(MVT::SimpleValueType VT, TreePattern &TP) {
75 bool EEVT::TypeSet::FillWithPossibleTypes(TreePattern &TP,
155 bool EEVT::TypeSet::MergeInTypeInfo(const EEVT::TypeSet &InVT, TreePattern &TP){
236 bool EEVT::TypeSet::EnforceInteger(TreePattern &TP) {
261 bool EEVT::TypeSet::EnforceFloatingPoint(TreePattern &TP) {
287 bool EEVT::TypeSet::EnforceScalar(TreePattern &TP) {
314 bool EEVT::TypeSet::EnforceVector(TreePattern &TP) {
344 bool EEVT::TypeSet::EnforceSmallerThan(EEVT::TypeSet &Other, TreePattern &TP) {
539                                            TreePattern &TP) {
585                                                  TreePattern &TP) {
663 TreePredicateFn::TreePredicateFn(TreePattern *N) : PatFragRec(N) {
873                                            TreePattern &TP) const {
964                                              TreePattern &TP) {
1094     if (TreePattern *PFRec = CDP.getPatternFragmentIfRead(Operator))
1254 TreePatternNode *TreePatternNode::InlinePatternFragments(TreePattern &TP) {
1278   // TreePattern record.
1279   TreePattern *Frag = TP.getDAGPatterns().getPatternFragment(Op);
1335                                      TreePattern &TP) {
1496 bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP, bool NotRegisters) {
1800 // TreePattern implementation
1803 TreePattern::TreePattern(Record *TheRec, ListInit *RawPat, bool isInput,
1810 TreePattern::TreePattern(Record *TheRec, DagInit *Pat, bool isInput,
1816 TreePattern::TreePattern(Record *TheRec, TreePatternNode *Pat, bool isInput,
1822 void TreePattern::error(const std::string &Msg) {
1830 void TreePattern::ComputeNamedNodes() {
1835 void TreePattern::ComputeNamedNodes(TreePatternNode *N) {
1844 TreePatternNode *TreePattern::ParseTreePattern(Init *TheInit, StringRef OpName){
2027 bool TreePattern::
2098 void TreePattern::print(raw_ostream &OS) const {
2120 void TreePattern::dump() const { print(errs()); }
2216     TreePattern *P = new TreePattern(Fragments[i], Tree, true, *this);
2272     TreePattern *ThePat = PatternFragments[Fragments[i]];
2304     // Create a TreePattern to parse this.
2305     TreePattern P(DefaultOps[i], DI, false, *this);
2331 static bool HandleUse(TreePattern *I, TreePatternNode *Pat,
2382 FindPatternInputsAndOutputs(TreePattern *I, TreePatternNode *Pat,
2482   void Analyze(const TreePattern *Pat) {
2728     TreePattern *I = new TreePattern(Instrs[i], LI, true, *this);
2871     TreePattern Temp(I->getRecord(), ResultPattern, false, *this);
2885     TreePattern *I = TheInst.getPattern();
2916                       TreePattern *PatternTop) {
2933 void CodeGenDAGPatterns::AddPatternToMatch(TreePattern *Pattern,
2998     const TreePattern *Pattern = getInstruction(InstInfo.TheDef).getPattern();
3137 static bool ForceArbitraryInstResultType(TreePatternNode *N, TreePattern &TP) {
3174     TreePattern *Pattern = new TreePattern(CurPattern, Tree, true, *this);
3183     TreePattern *Result = new TreePattern(CurPattern, LI, false, *this);
3275     TreePattern Temp(Result->getRecord(), DstPattern, false, *this);