35 static void logImpossibleToMatch(const Pattern &pattern) {  in logImpossibleToMatch()  argument
36   llvm::dbgs() << "Ignoring pattern '" << pattern.getRootKind()  in logImpossibleToMatch()
68     for (const RewritePattern *pattern : it.second) {  in applyCostModel()  local
69       if (pattern->getBenefit().isImpossibleToMatch())  in applyCostModel()
70         LLVM_DEBUG(logImpossibleToMatch(*pattern));  in applyCostModel()
72         patterns[it.first].push_back(pattern);  in applyCostModel()
76   for (const RewritePattern &pattern :  in applyCostModel()  local
78     if (pattern.getBenefit().isImpossibleToMatch())  in applyCostModel()
79       LLVM_DEBUG(logImpossibleToMatch(pattern));  in applyCostModel()
81       anyOpPatterns.push_back(&pattern);  in applyCostModel()
120     for (const auto &pattern : it.second)  in walkAllPatterns()  local
121       walk(*pattern);  in walkAllPatterns()
177       bestPattern = pdlMatch->pattern;  in matchAndRewrite()
210             const auto *pattern =  in matchAndRewrite()  local
212             result = pattern->matchAndRewrite(op, rewriter);  in matchAndRewrite()