Lines Matching refs:Patterns
1 //===- CodeGenDAGPatterns.cpp - Read DAG patterns from .td file -----------===//
11 // represent the patterns present in a .td file for instructions.
381 // Handle int and fp as disjoint sets. This won't work for patterns
594 /// Find dependent variables within child patterns
688 /// patterns before small ones. This is used to determine the size of a
698 // FIXME: This is a hack to statically increase the priority of patterns
702 // calculate the complexity of all patterns a dag can potentially map to.
1912 /// patterns as possible. Return true if all types are inferred, false
2026 // Generate variants. For example, commutative patterns can match
2310 I->error("Cannot have void nodes inside of patterns!");
2720 // If we can, convert the instructions to be patterns that are matched!
2864 std::vector<Record*> Patterns = Records.getAllDerivedDefinitions("Pattern");
2866 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
2867 Record *CurPattern = Patterns[i];
2920 // output patterns should have register classes, not MVTs.
3214 // GenerateVariants - Generate variants. For example, commutative patterns can
3219 // Loop over all of the patterns we've collected, checking to see if we can
3224 // Note that this loop adds new patterns to the PatternsToMatch list, but we
3225 // intentionally do not reconsider these. Any variants of added patterns have
3273 // Otherwise, add it to the list of patterns we have.
