Lines Matching full:mappings

284   auto It = llvm::partition_point(File.Mappings, [&](const Mapping &M) {
288   if (It == File.Mappings.begin()) {
313   auto It = llvm::partition_point(F.Mappings, [SpelledI](const Mapping &M) {
316   if (It == F.Mappings.begin())
346     // between 2 mappings, or between a mapping and end of the file).
411   // Mapping an empty range is ambiguous in case of empty mappings at either end
446   // Otherwise, use the fast version based on Mappings.
496   auto M = llvm::partition_point(File.Mappings, [&](const Mapping &M) {
499   if (M == File.Mappings.end() || M->BeginSpelled != SpelledIndex)
513   auto M = llvm::partition_point(File.Mappings, [&](const Mapping &M) {
517   for (; M != File.Mappings.end() && M->BeginSpelled < SpelledEndIndex; ++M)
567   for (auto Mapping : File.Mappings) {
613 /// Records information reqired to construct mappings for the token buffer that
639     // from an expansion. The best we can do is merge the mappings for both.
675 /// - records mappings from the spelled to expanded token ranges, e.g. for macro
704 /// Builds mappings and spelled tokens in the TokenBuffer based on the expanded
727       // Create empty mappings for spelled tokens that expanded to nothing here.
738     // Create empty mappings up until the end of the file.
744       auto &mappings = pair.second.Mappings;
745       assert(llvm::is_sorted(mappings, [](const TokenBuffer::Mapping &M1,
778     // We may want to split into several adjacent empty mappings.
783         Result.Files[File].Mappings.push_back(Mapping);
849       Result.Files[File].Mappings.push_back(Mapping);
959     if (File.Mappings.empty()) {
960       OS << "  no mappings.\n";
963     OS << "  mappings:\n";
964     for (auto &M : File.Mappings) {