Lines Matching full:cases
197 R.Cases = {{std::move(M), std::move(Edits)}}; in makeRule()
283 auto Transformations = Rule.Cases[I].Edits(Result); in run()
361 for (auto &Case : Rule.Cases) in addInclude()
380 const SmallVectorImpl<std::pair<size_t, RewriteRule::Case>> &Cases, in taggedMatchers() argument
383 Matchers.reserve(Cases.size()); in taggedMatchers()
384 for (const auto &Case : Cases) { in taggedMatchers()
405 R.Cases.append(Rule.Cases.begin(), Rule.Cases.end()); in applyFirst()
411 // Map the cases into buckets of matchers -- one for each "root" AST kind, in buildMatchers()
418 const SmallVectorImpl<RewriteRule::Case> &Cases = Rule.Cases; in buildMatchers() local
419 for (int I = 0, N = Cases.size(); I < N; ++I) { in buildMatchers()
420 assert(hasValidKind(Cases[I].Matcher) && in buildMatchers()
422 Buckets[Cases[I].Matcher.getSupportedKind()].emplace_back(I, Cases[I]); in buildMatchers()
444 assert(Ms.size() == 1 && "Cases must have compatible matchers."); in buildMatcher()
467 if (Rule.Cases.size() == 1) in findSelectedCase()
471 for (size_t i = 0, N = Rule.Cases.size(); i < N; ++i) { in findSelectedCase()