Lines Matching defs:predicates

64 /// Collect all of the predicates for the given operand position.
105         // Collect the predicates of the parent operation.
221 /// Collect the tree predicates anchored at the given value.
344 /// Collect all of the predicates that cannot be determined via walking the
581         // Obtain the tree predicates at the current value.
612 /// Given a pattern operation, build the set of matcher predicates necessary to
676   // predicates for the DAG rooted at bestRoot.
724 /// frequence sum and ordering predicates based on a cost model.
742   /// predicates within each pattern that contains this predicate. This allows
743   /// for favoring predicates that are more commonly shared within a pattern, as
748   /// among all the predicates with the same priority, depth, and position /
790 /// This class wraps a set of ordered predicates that are used within a specific
798   DenseSet<OrderedPredicate *> predicates;
825 /// order. A pattern will traverse as far as possible using common predicates
838   } else if (!list.predicates.contains(*current)) {
946   // The set of predicates contained within the pattern operations of the
950                       std::vector<PositionalPredicate> predicates)
951         : pattern(pattern), root(root), predicates(std::move(predicates)) {}
959     /// The extracted predicates for this pattern and root.
960     std::vector<PositionalPredicate> predicates;
974     for (auto &predicate : patternAndPredList.predicates) {
984   // Associate each pattern to a set of its ordered predicates for later lookup.
990     for (auto &predicate : patternAndPredList.predicates) {
992       list.predicates.insert(orderedPredicate);
1002   // shared predicates within rather than across patterns.
1005     for (auto *predicate : list.predicates)
1007     for (auto *predicate : list.predicates)
1011   // Sort the set of predicates now that the cost primary and secondary sums