Lines Matching refs:mappings
242 auto It = llvm::partition_point(File.Mappings, [&](const Mapping &M) {
246 if (It == File.Mappings.begin()) {
271 auto It = llvm::partition_point(F.Mappings, [SpelledI](const Mapping &M) {
274 if (It == F.Mappings.begin())
304 // between 2 mappings, or between a mapping and end of the file).
362 // Mapping an empty range is ambiguous in case of empty mappings at either end
450 auto M = llvm::partition_point(File.Mappings, [&](const Mapping &M) {
453 if (M == File.Mappings.end() || M->BeginSpelled != SpelledIndex)
467 auto M = llvm::partition_point(File.Mappings, [&](const Mapping &M) {
471 for (; M != File.Mappings.end() && M->BeginSpelled < SpelledEndIndex; ++M)
521 for (auto Mapping : File.Mappings) {
567 /// Records information reqired to construct mappings for the token buffer that
593 // from an expansion. The best we can do is merge the mappings for both.
629 /// - records mappings from the spelled to expanded token ranges, e.g. for macro
658 /// Builds mappings and spelled tokens in the TokenBuffer based on the expanded
681 // Create empty mappings for spelled tokens that expanded to nothing here.
692 // Create empty mappings up until the end of the file.
698 auto &mappings = pair.second.Mappings;
699 assert(llvm::is_sorted(mappings, [](const TokenBuffer::Mapping &M1,
732 // We may want to split into several adjacent empty mappings.
737 Result.Files[File].Mappings.push_back(Mapping);
803 Result.Files[File].Mappings.push_back(Mapping);
913 if (File.Mappings.empty()) {
914 OS << " no mappings.\n";
917 OS << " mappings:\n";
918 for (auto &M : File.Mappings) {
Indexes created Mon Apr 27 00:23:16 UTC 2026