xref: /llvm-project/clang/lib/Basic/SourceManager.cpp (revision b8b9f28e24370d2866bd401a308ebe4c93c02178)
1 //===--- SourceManager.cpp - Track and cache source files -----------------===//
2 //
3 //                     The LLVM Compiler Infrastructure
4 //
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9 //
10 //  This file implements the SourceManager interface.
11 //
12 //===----------------------------------------------------------------------===//
13 
14 #include "clang/Basic/SourceManager.h"
15 #include "clang/Basic/SourceManagerInternals.h"
16 #include "clang/Basic/FileManager.h"
17 #include "llvm/Support/Compiler.h"
18 #include "llvm/Support/MemoryBuffer.h"
19 #include "llvm/Support/raw_ostream.h"
20 #include "llvm/System/Path.h"
21 #include <algorithm>
22 using namespace clang;
23 using namespace SrcMgr;
24 using llvm::MemoryBuffer;
25 
26 //===----------------------------------------------------------------------===//
27 // SourceManager Helper Classes
28 //===----------------------------------------------------------------------===//
29 
30 ContentCache::~ContentCache() {
31   delete Buffer;
32 }
33 
34 /// getSizeBytesMapped - Returns the number of bytes actually mapped for
35 ///  this ContentCache.  This can be 0 if the MemBuffer was not actually
36 ///  instantiated.
37 unsigned ContentCache::getSizeBytesMapped() const {
38   return Buffer ? Buffer->getBufferSize() : 0;
39 }
40 
41 /// getSize - Returns the size of the content encapsulated by this ContentCache.
42 ///  This can be the size of the source file or the size of an arbitrary
43 ///  scratch buffer.  If the ContentCache encapsulates a source file, that
44 ///  file is not lazily brought in from disk to satisfy this query.
45 unsigned ContentCache::getSize() const {
46   return Buffer ? Buffer->getBufferSize() : Entry->getSize();
47 }
48 
49 void ContentCache::replaceBuffer(const llvm::MemoryBuffer *B) {
50   assert(B != Buffer);
51 
52   delete Buffer;
53   Buffer = B;
54 }
55 
56 const llvm::MemoryBuffer *ContentCache::getBuffer(std::string *ErrorStr) const {
57   // Lazily create the Buffer for ContentCaches that wrap files.
58   if (!Buffer && Entry) {
59     Buffer = MemoryBuffer::getFile(Entry->getName(), ErrorStr,Entry->getSize());
60 
61     // If we were unable to open the file, then we are in an inconsistent
62     // situation where the content cache referenced a file which no longer
63     // exists. Most likely, we were using a stat cache with an invalid entry but
64     // the file could also have been removed during processing. Since we can't
65     // really deal with this situation, just create an empty buffer.
66     //
67     // FIXME: This is definitely not ideal, but our immediate clients can't
68     // currently handle returning a null entry here. Ideally we should detect
69     // that we are in an inconsistent situation and error out as quickly as
70     // possible.
71     if (!Buffer) {
72       const llvm::StringRef FillStr("<<<MISSING SOURCE FILE>>>\n");
73       Buffer = MemoryBuffer::getNewMemBuffer(Entry->getSize(), "<invalid>");
74       char *Ptr = const_cast<char*>(Buffer->getBufferStart());
75       for (unsigned i = 0, e = Entry->getSize(); i != e; ++i)
76         Ptr[i] = FillStr[i % FillStr.size()];
77     }
78   }
79   return Buffer;
80 }
81 
82 unsigned LineTableInfo::getLineTableFilenameID(const char *Ptr, unsigned Len) {
83   // Look up the filename in the string table, returning the pre-existing value
84   // if it exists.
85   llvm::StringMapEntry<unsigned> &Entry =
86     FilenameIDs.GetOrCreateValue(Ptr, Ptr+Len, ~0U);
87   if (Entry.getValue() != ~0U)
88     return Entry.getValue();
89 
90   // Otherwise, assign this the next available ID.
91   Entry.setValue(FilenamesByID.size());
92   FilenamesByID.push_back(&Entry);
93   return FilenamesByID.size()-1;
94 }
95 
96 /// AddLineNote - Add a line note to the line table that indicates that there
97 /// is a #line at the specified FID/Offset location which changes the presumed
98 /// location to LineNo/FilenameID.
99 void LineTableInfo::AddLineNote(unsigned FID, unsigned Offset,
100                                 unsigned LineNo, int FilenameID) {
101   std::vector<LineEntry> &Entries = LineEntries[FID];
102 
103   assert((Entries.empty() || Entries.back().FileOffset < Offset) &&
104          "Adding line entries out of order!");
105 
106   SrcMgr::CharacteristicKind Kind = SrcMgr::C_User;
107   unsigned IncludeOffset = 0;
108 
109   if (!Entries.empty()) {
110     // If this is a '#line 4' after '#line 42 "foo.h"', make sure to remember
111     // that we are still in "foo.h".
112     if (FilenameID == -1)
113       FilenameID = Entries.back().FilenameID;
114 
115     // If we are after a line marker that switched us to system header mode, or
116     // that set #include information, preserve it.
117     Kind = Entries.back().FileKind;
118     IncludeOffset = Entries.back().IncludeOffset;
119   }
120 
121   Entries.push_back(LineEntry::get(Offset, LineNo, FilenameID, Kind,
122                                    IncludeOffset));
123 }
124 
125 /// AddLineNote This is the same as the previous version of AddLineNote, but is
126 /// used for GNU line markers.  If EntryExit is 0, then this doesn't change the
127 /// presumed #include stack.  If it is 1, this is a file entry, if it is 2 then
128 /// this is a file exit.  FileKind specifies whether this is a system header or
129 /// extern C system header.
130 void LineTableInfo::AddLineNote(unsigned FID, unsigned Offset,
131                                 unsigned LineNo, int FilenameID,
132                                 unsigned EntryExit,
133                                 SrcMgr::CharacteristicKind FileKind) {
134   assert(FilenameID != -1 && "Unspecified filename should use other accessor");
135 
136   std::vector<LineEntry> &Entries = LineEntries[FID];
137 
138   assert((Entries.empty() || Entries.back().FileOffset < Offset) &&
139          "Adding line entries out of order!");
140 
141   unsigned IncludeOffset = 0;
142   if (EntryExit == 0) {  // No #include stack change.
143     IncludeOffset = Entries.empty() ? 0 : Entries.back().IncludeOffset;
144   } else if (EntryExit == 1) {
145     IncludeOffset = Offset-1;
146   } else if (EntryExit == 2) {
147     assert(!Entries.empty() && Entries.back().IncludeOffset &&
148        "PPDirectives should have caught case when popping empty include stack");
149 
150     // Get the include loc of the last entries' include loc as our include loc.
151     IncludeOffset = 0;
152     if (const LineEntry *PrevEntry =
153           FindNearestLineEntry(FID, Entries.back().IncludeOffset))
154       IncludeOffset = PrevEntry->IncludeOffset;
155   }
156 
157   Entries.push_back(LineEntry::get(Offset, LineNo, FilenameID, FileKind,
158                                    IncludeOffset));
159 }
160 
161 
162 /// FindNearestLineEntry - Find the line entry nearest to FID that is before
163 /// it.  If there is no line entry before Offset in FID, return null.
164 const LineEntry *LineTableInfo::FindNearestLineEntry(unsigned FID,
165                                                      unsigned Offset) {
166   const std::vector<LineEntry> &Entries = LineEntries[FID];
167   assert(!Entries.empty() && "No #line entries for this FID after all!");
168 
169   // It is very common for the query to be after the last #line, check this
170   // first.
171   if (Entries.back().FileOffset <= Offset)
172     return &Entries.back();
173 
174   // Do a binary search to find the maximal element that is still before Offset.
175   std::vector<LineEntry>::const_iterator I =
176     std::upper_bound(Entries.begin(), Entries.end(), Offset);
177   if (I == Entries.begin()) return 0;
178   return &*--I;
179 }
180 
181 /// \brief Add a new line entry that has already been encoded into
182 /// the internal representation of the line table.
183 void LineTableInfo::AddEntry(unsigned FID,
184                              const std::vector<LineEntry> &Entries) {
185   LineEntries[FID] = Entries;
186 }
187 
188 /// getLineTableFilenameID - Return the uniqued ID for the specified filename.
189 ///
190 unsigned SourceManager::getLineTableFilenameID(const char *Ptr, unsigned Len) {
191   if (LineTable == 0)
192     LineTable = new LineTableInfo();
193   return LineTable->getLineTableFilenameID(Ptr, Len);
194 }
195 
196 
197 /// AddLineNote - Add a line note to the line table for the FileID and offset
198 /// specified by Loc.  If FilenameID is -1, it is considered to be
199 /// unspecified.
200 void SourceManager::AddLineNote(SourceLocation Loc, unsigned LineNo,
201                                 int FilenameID) {
202   std::pair<FileID, unsigned> LocInfo = getDecomposedInstantiationLoc(Loc);
203 
204   const SrcMgr::FileInfo &FileInfo = getSLocEntry(LocInfo.first).getFile();
205 
206   // Remember that this file has #line directives now if it doesn't already.
207   const_cast<SrcMgr::FileInfo&>(FileInfo).setHasLineDirectives();
208 
209   if (LineTable == 0)
210     LineTable = new LineTableInfo();
211   LineTable->AddLineNote(LocInfo.first.ID, LocInfo.second, LineNo, FilenameID);
212 }
213 
214 /// AddLineNote - Add a GNU line marker to the line table.
215 void SourceManager::AddLineNote(SourceLocation Loc, unsigned LineNo,
216                                 int FilenameID, bool IsFileEntry,
217                                 bool IsFileExit, bool IsSystemHeader,
218                                 bool IsExternCHeader) {
219   // If there is no filename and no flags, this is treated just like a #line,
220   // which does not change the flags of the previous line marker.
221   if (FilenameID == -1) {
222     assert(!IsFileEntry && !IsFileExit && !IsSystemHeader && !IsExternCHeader &&
223            "Can't set flags without setting the filename!");
224     return AddLineNote(Loc, LineNo, FilenameID);
225   }
226 
227   std::pair<FileID, unsigned> LocInfo = getDecomposedInstantiationLoc(Loc);
228   const SrcMgr::FileInfo &FileInfo = getSLocEntry(LocInfo.first).getFile();
229 
230   // Remember that this file has #line directives now if it doesn't already.
231   const_cast<SrcMgr::FileInfo&>(FileInfo).setHasLineDirectives();
232 
233   if (LineTable == 0)
234     LineTable = new LineTableInfo();
235 
236   SrcMgr::CharacteristicKind FileKind;
237   if (IsExternCHeader)
238     FileKind = SrcMgr::C_ExternCSystem;
239   else if (IsSystemHeader)
240     FileKind = SrcMgr::C_System;
241   else
242     FileKind = SrcMgr::C_User;
243 
244   unsigned EntryExit = 0;
245   if (IsFileEntry)
246     EntryExit = 1;
247   else if (IsFileExit)
248     EntryExit = 2;
249 
250   LineTable->AddLineNote(LocInfo.first.ID, LocInfo.second, LineNo, FilenameID,
251                          EntryExit, FileKind);
252 }
253 
254 LineTableInfo &SourceManager::getLineTable() {
255   if (LineTable == 0)
256     LineTable = new LineTableInfo();
257   return *LineTable;
258 }
259 
260 //===----------------------------------------------------------------------===//
261 // Private 'Create' methods.
262 //===----------------------------------------------------------------------===//
263 
264 SourceManager::~SourceManager() {
265   delete LineTable;
266 
267   // Delete FileEntry objects corresponding to content caches.  Since the actual
268   // content cache objects are bump pointer allocated, we just have to run the
269   // dtors, but we call the deallocate method for completeness.
270   for (unsigned i = 0, e = MemBufferInfos.size(); i != e; ++i) {
271     MemBufferInfos[i]->~ContentCache();
272     ContentCacheAlloc.Deallocate(MemBufferInfos[i]);
273   }
274   for (llvm::DenseMap<const FileEntry*, SrcMgr::ContentCache*>::iterator
275        I = FileInfos.begin(), E = FileInfos.end(); I != E; ++I) {
276     I->second->~ContentCache();
277     ContentCacheAlloc.Deallocate(I->second);
278   }
279 }
280 
281 void SourceManager::clearIDTables() {
282   MainFileID = FileID();
283   SLocEntryTable.clear();
284   LastLineNoFileIDQuery = FileID();
285   LastLineNoContentCache = 0;
286   LastFileIDLookup = FileID();
287 
288   if (LineTable)
289     LineTable->clear();
290 
291   // Use up FileID #0 as an invalid instantiation.
292   NextOffset = 0;
293   createInstantiationLoc(SourceLocation(),SourceLocation(),SourceLocation(), 1);
294 }
295 
296 /// getOrCreateContentCache - Create or return a cached ContentCache for the
297 /// specified file.
298 const ContentCache *
299 SourceManager::getOrCreateContentCache(const FileEntry *FileEnt) {
300   assert(FileEnt && "Didn't specify a file entry to use?");
301 
302   // Do we already have information about this file?
303   ContentCache *&Entry = FileInfos[FileEnt];
304   if (Entry) return Entry;
305 
306   // Nope, create a new Cache entry.  Make sure it is at least 8-byte aligned
307   // so that FileInfo can use the low 3 bits of the pointer for its own
308   // nefarious purposes.
309   unsigned EntryAlign = llvm::AlignOf<ContentCache>::Alignment;
310   EntryAlign = std::max(8U, EntryAlign);
311   Entry = ContentCacheAlloc.Allocate<ContentCache>(1, EntryAlign);
312   new (Entry) ContentCache(FileEnt);
313   return Entry;
314 }
315 
316 
317 /// createMemBufferContentCache - Create a new ContentCache for the specified
318 ///  memory buffer.  This does no caching.
319 const ContentCache*
320 SourceManager::createMemBufferContentCache(const MemoryBuffer *Buffer) {
321   // Add a new ContentCache to the MemBufferInfos list and return it.  Make sure
322   // it is at least 8-byte aligned so that FileInfo can use the low 3 bits of
323   // the pointer for its own nefarious purposes.
324   unsigned EntryAlign = llvm::AlignOf<ContentCache>::Alignment;
325   EntryAlign = std::max(8U, EntryAlign);
326   ContentCache *Entry = ContentCacheAlloc.Allocate<ContentCache>(1, EntryAlign);
327   new (Entry) ContentCache();
328   MemBufferInfos.push_back(Entry);
329   Entry->setBuffer(Buffer);
330   return Entry;
331 }
332 
333 void SourceManager::PreallocateSLocEntries(ExternalSLocEntrySource *Source,
334                                            unsigned NumSLocEntries,
335                                            unsigned NextOffset) {
336   ExternalSLocEntries = Source;
337   this->NextOffset = NextOffset;
338   SLocEntryLoaded.resize(NumSLocEntries + 1);
339   SLocEntryLoaded[0] = true;
340   SLocEntryTable.resize(SLocEntryTable.size() + NumSLocEntries);
341 }
342 
343 void SourceManager::ClearPreallocatedSLocEntries() {
344   unsigned I = 0;
345   for (unsigned N = SLocEntryLoaded.size(); I != N; ++I)
346     if (!SLocEntryLoaded[I])
347       break;
348 
349   // We've already loaded all preallocated source location entries.
350   if (I == SLocEntryLoaded.size())
351     return;
352 
353   // Remove everything from location I onward.
354   SLocEntryTable.resize(I);
355   SLocEntryLoaded.clear();
356   ExternalSLocEntries = 0;
357 }
358 
359 
360 //===----------------------------------------------------------------------===//
361 // Methods to create new FileID's and instantiations.
362 //===----------------------------------------------------------------------===//
363 
364 /// createFileID - Create a new fileID for the specified ContentCache and
365 /// include position.  This works regardless of whether the ContentCache
366 /// corresponds to a file or some other input source.
367 FileID SourceManager::createFileID(const ContentCache *File,
368                                    SourceLocation IncludePos,
369                                    SrcMgr::CharacteristicKind FileCharacter,
370                                    unsigned PreallocatedID,
371                                    unsigned Offset) {
372   if (PreallocatedID) {
373     // If we're filling in a preallocated ID, just load in the file
374     // entry and return.
375     assert(PreallocatedID < SLocEntryLoaded.size() &&
376            "Preallocate ID out-of-range");
377     assert(!SLocEntryLoaded[PreallocatedID] &&
378            "Source location entry already loaded");
379     assert(Offset && "Preallocate source location cannot have zero offset");
380     SLocEntryTable[PreallocatedID]
381       = SLocEntry::get(Offset, FileInfo::get(IncludePos, File, FileCharacter));
382     SLocEntryLoaded[PreallocatedID] = true;
383     FileID FID = FileID::get(PreallocatedID);
384     return LastFileIDLookup = FID;
385   }
386 
387   SLocEntryTable.push_back(SLocEntry::get(NextOffset,
388                                           FileInfo::get(IncludePos, File,
389                                                         FileCharacter)));
390   unsigned FileSize = File->getSize();
391   assert(NextOffset+FileSize+1 > NextOffset && "Ran out of source locations!");
392   NextOffset += FileSize+1;
393 
394   // Set LastFileIDLookup to the newly created file.  The next getFileID call is
395   // almost guaranteed to be from that file.
396   FileID FID = FileID::get(SLocEntryTable.size()-1);
397   return LastFileIDLookup = FID;
398 }
399 
400 /// createInstantiationLoc - Return a new SourceLocation that encodes the fact
401 /// that a token from SpellingLoc should actually be referenced from
402 /// InstantiationLoc.
403 SourceLocation SourceManager::createInstantiationLoc(SourceLocation SpellingLoc,
404                                                      SourceLocation ILocStart,
405                                                      SourceLocation ILocEnd,
406                                                      unsigned TokLength,
407                                                      unsigned PreallocatedID,
408                                                      unsigned Offset) {
409   InstantiationInfo II = InstantiationInfo::get(ILocStart,ILocEnd, SpellingLoc);
410   if (PreallocatedID) {
411     // If we're filling in a preallocated ID, just load in the
412     // instantiation entry and return.
413     assert(PreallocatedID < SLocEntryLoaded.size() &&
414            "Preallocate ID out-of-range");
415     assert(!SLocEntryLoaded[PreallocatedID] &&
416            "Source location entry already loaded");
417     assert(Offset && "Preallocate source location cannot have zero offset");
418     SLocEntryTable[PreallocatedID] = SLocEntry::get(Offset, II);
419     SLocEntryLoaded[PreallocatedID] = true;
420     return SourceLocation::getMacroLoc(Offset);
421   }
422   SLocEntryTable.push_back(SLocEntry::get(NextOffset, II));
423   assert(NextOffset+TokLength+1 > NextOffset && "Ran out of source locations!");
424   NextOffset += TokLength+1;
425   return SourceLocation::getMacroLoc(NextOffset-(TokLength+1));
426 }
427 
428 const llvm::MemoryBuffer *
429 SourceManager::getMemoryBufferForFile(const FileEntry *File) {
430   const SrcMgr::ContentCache *IR = getOrCreateContentCache(File);
431   if (IR == 0)
432     return 0;
433 
434   return IR->getBuffer();
435 }
436 
437 bool SourceManager::overrideFileContents(const FileEntry *SourceFile,
438                                          const llvm::MemoryBuffer *Buffer) {
439   const SrcMgr::ContentCache *IR = getOrCreateContentCache(SourceFile);
440   if (IR == 0)
441     return true;
442 
443   const_cast<SrcMgr::ContentCache *>(IR)->replaceBuffer(Buffer);
444   return false;
445 }
446 
447 /// getBufferData - Return a pointer to the start and end of the source buffer
448 /// data for the specified FileID.
449 std::pair<const char*, const char*>
450 SourceManager::getBufferData(FileID FID) const {
451   const llvm::MemoryBuffer *Buf = getBuffer(FID);
452   return std::make_pair(Buf->getBufferStart(), Buf->getBufferEnd());
453 }
454 
455 
456 //===----------------------------------------------------------------------===//
457 // SourceLocation manipulation methods.
458 //===----------------------------------------------------------------------===//
459 
460 /// getFileIDSlow - Return the FileID for a SourceLocation.  This is a very hot
461 /// method that is used for all SourceManager queries that start with a
462 /// SourceLocation object.  It is responsible for finding the entry in
463 /// SLocEntryTable which contains the specified location.
464 ///
465 FileID SourceManager::getFileIDSlow(unsigned SLocOffset) const {
466   assert(SLocOffset && "Invalid FileID");
467 
468   // After the first and second level caches, I see two common sorts of
469   // behavior: 1) a lot of searched FileID's are "near" the cached file location
470   // or are "near" the cached instantiation location.  2) others are just
471   // completely random and may be a very long way away.
472   //
473   // To handle this, we do a linear search for up to 8 steps to catch #1 quickly
474   // then we fall back to a less cache efficient, but more scalable, binary
475   // search to find the location.
476 
477   // See if this is near the file point - worst case we start scanning from the
478   // most newly created FileID.
479   std::vector<SrcMgr::SLocEntry>::const_iterator I;
480 
481   if (SLocEntryTable[LastFileIDLookup.ID].getOffset() < SLocOffset) {
482     // Neither loc prunes our search.
483     I = SLocEntryTable.end();
484   } else {
485     // Perhaps it is near the file point.
486     I = SLocEntryTable.begin()+LastFileIDLookup.ID;
487   }
488 
489   // Find the FileID that contains this.  "I" is an iterator that points to a
490   // FileID whose offset is known to be larger than SLocOffset.
491   unsigned NumProbes = 0;
492   while (1) {
493     --I;
494     if (ExternalSLocEntries)
495       getSLocEntry(FileID::get(I - SLocEntryTable.begin()));
496     if (I->getOffset() <= SLocOffset) {
497 #if 0
498       printf("lin %d -> %d [%s] %d %d\n", SLocOffset,
499              I-SLocEntryTable.begin(),
500              I->isInstantiation() ? "inst" : "file",
501              LastFileIDLookup.ID,  int(SLocEntryTable.end()-I));
502 #endif
503       FileID Res = FileID::get(I-SLocEntryTable.begin());
504 
505       // If this isn't an instantiation, remember it.  We have good locality
506       // across FileID lookups.
507       if (!I->isInstantiation())
508         LastFileIDLookup = Res;
509       NumLinearScans += NumProbes+1;
510       return Res;
511     }
512     if (++NumProbes == 8)
513       break;
514   }
515 
516   // Convert "I" back into an index.  We know that it is an entry whose index is
517   // larger than the offset we are looking for.
518   unsigned GreaterIndex = I-SLocEntryTable.begin();
519   // LessIndex - This is the lower bound of the range that we're searching.
520   // We know that the offset corresponding to the FileID is is less than
521   // SLocOffset.
522   unsigned LessIndex = 0;
523   NumProbes = 0;
524   while (1) {
525     unsigned MiddleIndex = (GreaterIndex-LessIndex)/2+LessIndex;
526     unsigned MidOffset = getSLocEntry(FileID::get(MiddleIndex)).getOffset();
527 
528     ++NumProbes;
529 
530     // If the offset of the midpoint is too large, chop the high side of the
531     // range to the midpoint.
532     if (MidOffset > SLocOffset) {
533       GreaterIndex = MiddleIndex;
534       continue;
535     }
536 
537     // If the middle index contains the value, succeed and return.
538     if (isOffsetInFileID(FileID::get(MiddleIndex), SLocOffset)) {
539 #if 0
540       printf("bin %d -> %d [%s] %d %d\n", SLocOffset,
541              I-SLocEntryTable.begin(),
542              I->isInstantiation() ? "inst" : "file",
543              LastFileIDLookup.ID, int(SLocEntryTable.end()-I));
544 #endif
545       FileID Res = FileID::get(MiddleIndex);
546 
547       // If this isn't an instantiation, remember it.  We have good locality
548       // across FileID lookups.
549       if (!I->isInstantiation())
550         LastFileIDLookup = Res;
551       NumBinaryProbes += NumProbes;
552       return Res;
553     }
554 
555     // Otherwise, move the low-side up to the middle index.
556     LessIndex = MiddleIndex;
557   }
558 }
559 
560 SourceLocation SourceManager::
561 getInstantiationLocSlowCase(SourceLocation Loc) const {
562   do {
563     // Note: If Loc indicates an offset into a token that came from a macro
564     // expansion (e.g. the 5th character of the token) we do not want to add
565     // this offset when going to the instantiation location.  The instatiation
566     // location is the macro invocation, which the offset has nothing to do
567     // with.  This is unlike when we get the spelling loc, because the offset
568     // directly correspond to the token whose spelling we're inspecting.
569     Loc = getSLocEntry(getFileID(Loc)).getInstantiation()
570                    .getInstantiationLocStart();
571   } while (!Loc.isFileID());
572 
573   return Loc;
574 }
575 
576 SourceLocation SourceManager::getSpellingLocSlowCase(SourceLocation Loc) const {
577   do {
578     std::pair<FileID, unsigned> LocInfo = getDecomposedLoc(Loc);
579     Loc = getSLocEntry(LocInfo.first).getInstantiation().getSpellingLoc();
580     Loc = Loc.getFileLocWithOffset(LocInfo.second);
581   } while (!Loc.isFileID());
582   return Loc;
583 }
584 
585 
586 std::pair<FileID, unsigned>
587 SourceManager::getDecomposedInstantiationLocSlowCase(const SrcMgr::SLocEntry *E,
588                                                      unsigned Offset) const {
589   // If this is an instantiation record, walk through all the instantiation
590   // points.
591   FileID FID;
592   SourceLocation Loc;
593   do {
594     Loc = E->getInstantiation().getInstantiationLocStart();
595 
596     FID = getFileID(Loc);
597     E = &getSLocEntry(FID);
598     Offset += Loc.getOffset()-E->getOffset();
599   } while (!Loc.isFileID());
600 
601   return std::make_pair(FID, Offset);
602 }
603 
604 std::pair<FileID, unsigned>
605 SourceManager::getDecomposedSpellingLocSlowCase(const SrcMgr::SLocEntry *E,
606                                                 unsigned Offset) const {
607   // If this is an instantiation record, walk through all the instantiation
608   // points.
609   FileID FID;
610   SourceLocation Loc;
611   do {
612     Loc = E->getInstantiation().getSpellingLoc();
613 
614     FID = getFileID(Loc);
615     E = &getSLocEntry(FID);
616     Offset += Loc.getOffset()-E->getOffset();
617   } while (!Loc.isFileID());
618 
619   return std::make_pair(FID, Offset);
620 }
621 
622 /// getImmediateSpellingLoc - Given a SourceLocation object, return the
623 /// spelling location referenced by the ID.  This is the first level down
624 /// towards the place where the characters that make up the lexed token can be
625 /// found.  This should not generally be used by clients.
626 SourceLocation SourceManager::getImmediateSpellingLoc(SourceLocation Loc) const{
627   if (Loc.isFileID()) return Loc;
628   std::pair<FileID, unsigned> LocInfo = getDecomposedLoc(Loc);
629   Loc = getSLocEntry(LocInfo.first).getInstantiation().getSpellingLoc();
630   return Loc.getFileLocWithOffset(LocInfo.second);
631 }
632 
633 
634 /// getImmediateInstantiationRange - Loc is required to be an instantiation
635 /// location.  Return the start/end of the instantiation information.
636 std::pair<SourceLocation,SourceLocation>
637 SourceManager::getImmediateInstantiationRange(SourceLocation Loc) const {
638   assert(Loc.isMacroID() && "Not an instantiation loc!");
639   const InstantiationInfo &II = getSLocEntry(getFileID(Loc)).getInstantiation();
640   return II.getInstantiationLocRange();
641 }
642 
643 /// getInstantiationRange - Given a SourceLocation object, return the
644 /// range of tokens covered by the instantiation in the ultimate file.
645 std::pair<SourceLocation,SourceLocation>
646 SourceManager::getInstantiationRange(SourceLocation Loc) const {
647   if (Loc.isFileID()) return std::make_pair(Loc, Loc);
648 
649   std::pair<SourceLocation,SourceLocation> Res =
650     getImmediateInstantiationRange(Loc);
651 
652   // Fully resolve the start and end locations to their ultimate instantiation
653   // points.
654   while (!Res.first.isFileID())
655     Res.first = getImmediateInstantiationRange(Res.first).first;
656   while (!Res.second.isFileID())
657     Res.second = getImmediateInstantiationRange(Res.second).second;
658   return Res;
659 }
660 
661 
662 
663 //===----------------------------------------------------------------------===//
664 // Queries about the code at a SourceLocation.
665 //===----------------------------------------------------------------------===//
666 
667 /// getCharacterData - Return a pointer to the start of the specified location
668 /// in the appropriate MemoryBuffer.
669 const char *SourceManager::getCharacterData(SourceLocation SL) const {
670   // Note that this is a hot function in the getSpelling() path, which is
671   // heavily used by -E mode.
672   std::pair<FileID, unsigned> LocInfo = getDecomposedSpellingLoc(SL);
673 
674   // Note that calling 'getBuffer()' may lazily page in a source file.
675   return getSLocEntry(LocInfo.first).getFile().getContentCache()
676               ->getBuffer()->getBufferStart() + LocInfo.second;
677 }
678 
679 
680 /// getColumnNumber - Return the column # for the specified file position.
681 /// this is significantly cheaper to compute than the line number.
682 unsigned SourceManager::getColumnNumber(FileID FID, unsigned FilePos) const {
683   const char *Buf = getBuffer(FID)->getBufferStart();
684 
685   unsigned LineStart = FilePos;
686   while (LineStart && Buf[LineStart-1] != '\n' && Buf[LineStart-1] != '\r')
687     --LineStart;
688   return FilePos-LineStart+1;
689 }
690 
691 unsigned SourceManager::getSpellingColumnNumber(SourceLocation Loc) const {
692   if (Loc.isInvalid()) return 0;
693   std::pair<FileID, unsigned> LocInfo = getDecomposedSpellingLoc(Loc);
694   return getColumnNumber(LocInfo.first, LocInfo.second);
695 }
696 
697 unsigned SourceManager::getInstantiationColumnNumber(SourceLocation Loc) const {
698   if (Loc.isInvalid()) return 0;
699   std::pair<FileID, unsigned> LocInfo = getDecomposedInstantiationLoc(Loc);
700   return getColumnNumber(LocInfo.first, LocInfo.second);
701 }
702 
703 
704 
705 static DISABLE_INLINE void ComputeLineNumbers(ContentCache* FI,
706                                               llvm::BumpPtrAllocator &Alloc);
707 static void ComputeLineNumbers(ContentCache* FI, llvm::BumpPtrAllocator &Alloc){
708   // Note that calling 'getBuffer()' may lazily page in the file.
709   const MemoryBuffer *Buffer = FI->getBuffer();
710 
711   // Find the file offsets of all of the *physical* source lines.  This does
712   // not look at trigraphs, escaped newlines, or anything else tricky.
713   std::vector<unsigned> LineOffsets;
714 
715   // Line #1 starts at char 0.
716   LineOffsets.push_back(0);
717 
718   const unsigned char *Buf = (const unsigned char *)Buffer->getBufferStart();
719   const unsigned char *End = (const unsigned char *)Buffer->getBufferEnd();
720   unsigned Offs = 0;
721   while (1) {
722     // Skip over the contents of the line.
723     // TODO: Vectorize this?  This is very performance sensitive for programs
724     // with lots of diagnostics and in -E mode.
725     const unsigned char *NextBuf = (const unsigned char *)Buf;
726     while (*NextBuf != '\n' && *NextBuf != '\r' && *NextBuf != '\0')
727       ++NextBuf;
728     Offs += NextBuf-Buf;
729     Buf = NextBuf;
730 
731     if (Buf[0] == '\n' || Buf[0] == '\r') {
732       // If this is \n\r or \r\n, skip both characters.
733       if ((Buf[1] == '\n' || Buf[1] == '\r') && Buf[0] != Buf[1])
734         ++Offs, ++Buf;
735       ++Offs, ++Buf;
736       LineOffsets.push_back(Offs);
737     } else {
738       // Otherwise, this is a null.  If end of file, exit.
739       if (Buf == End) break;
740       // Otherwise, skip the null.
741       ++Offs, ++Buf;
742     }
743   }
744 
745   // Copy the offsets into the FileInfo structure.
746   FI->NumLines = LineOffsets.size();
747   FI->SourceLineCache = Alloc.Allocate<unsigned>(LineOffsets.size());
748   std::copy(LineOffsets.begin(), LineOffsets.end(), FI->SourceLineCache);
749 }
750 
751 /// getLineNumber - Given a SourceLocation, return the spelling line number
752 /// for the position indicated.  This requires building and caching a table of
753 /// line offsets for the MemoryBuffer, so this is not cheap: use only when
754 /// about to emit a diagnostic.
755 unsigned SourceManager::getLineNumber(FileID FID, unsigned FilePos) const {
756   ContentCache *Content;
757   if (LastLineNoFileIDQuery == FID)
758     Content = LastLineNoContentCache;
759   else
760     Content = const_cast<ContentCache*>(getSLocEntry(FID)
761                                         .getFile().getContentCache());
762 
763   // If this is the first use of line information for this buffer, compute the
764   /// SourceLineCache for it on demand.
765   if (Content->SourceLineCache == 0)
766     ComputeLineNumbers(Content, ContentCacheAlloc);
767 
768   // Okay, we know we have a line number table.  Do a binary search to find the
769   // line number that this character position lands on.
770   unsigned *SourceLineCache = Content->SourceLineCache;
771   unsigned *SourceLineCacheStart = SourceLineCache;
772   unsigned *SourceLineCacheEnd = SourceLineCache + Content->NumLines;
773 
774   unsigned QueriedFilePos = FilePos+1;
775 
776   // FIXME: I would like to be convinced that this code is worth being as
777   // complicated as it is, binary search isn't that slow.
778   //
779   // If it is worth being optimized, then in my opinion it could be more
780   // performant, simpler, and more obviously correct by just "galloping" outward
781   // from the queried file position. In fact, this could be incorporated into a
782   // generic algorithm such as lower_bound_with_hint.
783   //
784   // If someone gives me a test case where this matters, and I will do it! - DWD
785 
786   // If the previous query was to the same file, we know both the file pos from
787   // that query and the line number returned.  This allows us to narrow the
788   // search space from the entire file to something near the match.
789   if (LastLineNoFileIDQuery == FID) {
790     if (QueriedFilePos >= LastLineNoFilePos) {
791       // FIXME: Potential overflow?
792       SourceLineCache = SourceLineCache+LastLineNoResult-1;
793 
794       // The query is likely to be nearby the previous one.  Here we check to
795       // see if it is within 5, 10 or 20 lines.  It can be far away in cases
796       // where big comment blocks and vertical whitespace eat up lines but
797       // contribute no tokens.
798       if (SourceLineCache+5 < SourceLineCacheEnd) {
799         if (SourceLineCache[5] > QueriedFilePos)
800           SourceLineCacheEnd = SourceLineCache+5;
801         else if (SourceLineCache+10 < SourceLineCacheEnd) {
802           if (SourceLineCache[10] > QueriedFilePos)
803             SourceLineCacheEnd = SourceLineCache+10;
804           else if (SourceLineCache+20 < SourceLineCacheEnd) {
805             if (SourceLineCache[20] > QueriedFilePos)
806               SourceLineCacheEnd = SourceLineCache+20;
807           }
808         }
809       }
810     } else {
811       if (LastLineNoResult < Content->NumLines)
812         SourceLineCacheEnd = SourceLineCache+LastLineNoResult+1;
813     }
814   }
815 
816   // If the spread is large, do a "radix" test as our initial guess, based on
817   // the assumption that lines average to approximately the same length.
818   // NOTE: This is currently disabled, as it does not appear to be profitable in
819   // initial measurements.
820   if (0 && SourceLineCacheEnd-SourceLineCache > 20) {
821     unsigned FileLen = Content->SourceLineCache[Content->NumLines-1];
822 
823     // Take a stab at guessing where it is.
824     unsigned ApproxPos = Content->NumLines*QueriedFilePos / FileLen;
825 
826     // Check for -10 and +10 lines.
827     unsigned LowerBound = std::max(int(ApproxPos-10), 0);
828     unsigned UpperBound = std::min(ApproxPos+10, FileLen);
829 
830     // If the computed lower bound is less than the query location, move it in.
831     if (SourceLineCache < SourceLineCacheStart+LowerBound &&
832         SourceLineCacheStart[LowerBound] < QueriedFilePos)
833       SourceLineCache = SourceLineCacheStart+LowerBound;
834 
835     // If the computed upper bound is greater than the query location, move it.
836     if (SourceLineCacheEnd > SourceLineCacheStart+UpperBound &&
837         SourceLineCacheStart[UpperBound] >= QueriedFilePos)
838       SourceLineCacheEnd = SourceLineCacheStart+UpperBound;
839   }
840 
841   unsigned *Pos
842     = std::lower_bound(SourceLineCache, SourceLineCacheEnd, QueriedFilePos);
843   unsigned LineNo = Pos-SourceLineCacheStart;
844 
845   LastLineNoFileIDQuery = FID;
846   LastLineNoContentCache = Content;
847   LastLineNoFilePos = QueriedFilePos;
848   LastLineNoResult = LineNo;
849   return LineNo;
850 }
851 
852 unsigned SourceManager::getInstantiationLineNumber(SourceLocation Loc) const {
853   if (Loc.isInvalid()) return 0;
854   std::pair<FileID, unsigned> LocInfo = getDecomposedInstantiationLoc(Loc);
855   return getLineNumber(LocInfo.first, LocInfo.second);
856 }
857 unsigned SourceManager::getSpellingLineNumber(SourceLocation Loc) const {
858   if (Loc.isInvalid()) return 0;
859   std::pair<FileID, unsigned> LocInfo = getDecomposedSpellingLoc(Loc);
860   return getLineNumber(LocInfo.first, LocInfo.second);
861 }
862 
863 /// getFileCharacteristic - return the file characteristic of the specified
864 /// source location, indicating whether this is a normal file, a system
865 /// header, or an "implicit extern C" system header.
866 ///
867 /// This state can be modified with flags on GNU linemarker directives like:
868 ///   # 4 "foo.h" 3
869 /// which changes all source locations in the current file after that to be
870 /// considered to be from a system header.
871 SrcMgr::CharacteristicKind
872 SourceManager::getFileCharacteristic(SourceLocation Loc) const {
873   assert(!Loc.isInvalid() && "Can't get file characteristic of invalid loc!");
874   std::pair<FileID, unsigned> LocInfo = getDecomposedInstantiationLoc(Loc);
875   const SrcMgr::FileInfo &FI = getSLocEntry(LocInfo.first).getFile();
876 
877   // If there are no #line directives in this file, just return the whole-file
878   // state.
879   if (!FI.hasLineDirectives())
880     return FI.getFileCharacteristic();
881 
882   assert(LineTable && "Can't have linetable entries without a LineTable!");
883   // See if there is a #line directive before the location.
884   const LineEntry *Entry =
885     LineTable->FindNearestLineEntry(LocInfo.first.ID, LocInfo.second);
886 
887   // If this is before the first line marker, use the file characteristic.
888   if (!Entry)
889     return FI.getFileCharacteristic();
890 
891   return Entry->FileKind;
892 }
893 
894 /// Return the filename or buffer identifier of the buffer the location is in.
895 /// Note that this name does not respect #line directives.  Use getPresumedLoc
896 /// for normal clients.
897 const char *SourceManager::getBufferName(SourceLocation Loc) const {
898   if (Loc.isInvalid()) return "<invalid loc>";
899 
900   return getBuffer(getFileID(Loc))->getBufferIdentifier();
901 }
902 
903 
904 /// getPresumedLoc - This method returns the "presumed" location of a
905 /// SourceLocation specifies.  A "presumed location" can be modified by #line
906 /// or GNU line marker directives.  This provides a view on the data that a
907 /// user should see in diagnostics, for example.
908 ///
909 /// Note that a presumed location is always given as the instantiation point
910 /// of an instantiation location, not at the spelling location.
911 PresumedLoc SourceManager::getPresumedLoc(SourceLocation Loc) const {
912   if (Loc.isInvalid()) return PresumedLoc();
913 
914   // Presumed locations are always for instantiation points.
915   std::pair<FileID, unsigned> LocInfo = getDecomposedInstantiationLoc(Loc);
916 
917   const SrcMgr::FileInfo &FI = getSLocEntry(LocInfo.first).getFile();
918   const SrcMgr::ContentCache *C = FI.getContentCache();
919 
920   // To get the source name, first consult the FileEntry (if one exists)
921   // before the MemBuffer as this will avoid unnecessarily paging in the
922   // MemBuffer.
923   const char *Filename =
924     C->Entry ? C->Entry->getName() : C->getBuffer()->getBufferIdentifier();
925   unsigned LineNo = getLineNumber(LocInfo.first, LocInfo.second);
926   unsigned ColNo  = getColumnNumber(LocInfo.first, LocInfo.second);
927   SourceLocation IncludeLoc = FI.getIncludeLoc();
928 
929   // If we have #line directives in this file, update and overwrite the physical
930   // location info if appropriate.
931   if (FI.hasLineDirectives()) {
932     assert(LineTable && "Can't have linetable entries without a LineTable!");
933     // See if there is a #line directive before this.  If so, get it.
934     if (const LineEntry *Entry =
935           LineTable->FindNearestLineEntry(LocInfo.first.ID, LocInfo.second)) {
936       // If the LineEntry indicates a filename, use it.
937       if (Entry->FilenameID != -1)
938         Filename = LineTable->getFilename(Entry->FilenameID);
939 
940       // Use the line number specified by the LineEntry.  This line number may
941       // be multiple lines down from the line entry.  Add the difference in
942       // physical line numbers from the query point and the line marker to the
943       // total.
944       unsigned MarkerLineNo = getLineNumber(LocInfo.first, Entry->FileOffset);
945       LineNo = Entry->LineNo + (LineNo-MarkerLineNo-1);
946 
947       // Note that column numbers are not molested by line markers.
948 
949       // Handle virtual #include manipulation.
950       if (Entry->IncludeOffset) {
951         IncludeLoc = getLocForStartOfFile(LocInfo.first);
952         IncludeLoc = IncludeLoc.getFileLocWithOffset(Entry->IncludeOffset);
953       }
954     }
955   }
956 
957   return PresumedLoc(Filename, LineNo, ColNo, IncludeLoc);
958 }
959 
960 //===----------------------------------------------------------------------===//
961 // Other miscellaneous methods.
962 //===----------------------------------------------------------------------===//
963 
964 /// \brief Get the source location for the given file:line:col triplet.
965 ///
966 /// If the source file is included multiple times, the source location will
967 /// be based upon the first inclusion.
968 SourceLocation SourceManager::getLocation(const FileEntry *SourceFile,
969                                           unsigned Line, unsigned Col) const {
970   assert(SourceFile && "Null source file!");
971   assert(Line && Col && "Line and column should start from 1!");
972 
973   fileinfo_iterator FI = FileInfos.find(SourceFile);
974   if (FI == FileInfos.end())
975     return SourceLocation();
976   ContentCache *Content = FI->second;
977 
978   // If this is the first use of line information for this buffer, compute the
979   /// SourceLineCache for it on demand.
980   if (Content->SourceLineCache == 0)
981     ComputeLineNumbers(Content, ContentCacheAlloc);
982 
983   // Find the first file ID that corresponds to the given file.
984   FileID FirstFID;
985 
986   // First, check the main file ID, since it is common to look for a
987   // location in the main file.
988   if (!MainFileID.isInvalid()) {
989     const SLocEntry &MainSLoc = getSLocEntry(MainFileID);
990     if (MainSLoc.isFile() && MainSLoc.getFile().getContentCache() == Content)
991       FirstFID = MainFileID;
992   }
993 
994   if (FirstFID.isInvalid()) {
995     // The location we're looking for isn't in the main file; look
996     // through all of the source locations.
997     for (unsigned I = 0, N = sloc_entry_size(); I != N; ++I) {
998       const SLocEntry &SLoc = getSLocEntry(I);
999       if (SLoc.isFile() && SLoc.getFile().getContentCache() == Content) {
1000         FirstFID = FileID::get(I);
1001         break;
1002       }
1003     }
1004   }
1005 
1006   if (FirstFID.isInvalid())
1007     return SourceLocation();
1008 
1009   if (Line > Content->NumLines) {
1010     unsigned Size = Content->getBuffer()->getBufferSize();
1011     if (Size > 0)
1012       --Size;
1013     return getLocForStartOfFile(FirstFID).getFileLocWithOffset(Size);
1014   }
1015 
1016   unsigned FilePos = Content->SourceLineCache[Line - 1];
1017   const char *Buf = Content->getBuffer()->getBufferStart() + FilePos;
1018   unsigned BufLength = Content->getBuffer()->getBufferEnd() - Buf;
1019   unsigned i = 0;
1020 
1021   // Check that the given column is valid.
1022   while (i < BufLength-1 && i < Col-1 && Buf[i] != '\n' && Buf[i] != '\r')
1023     ++i;
1024   if (i < Col-1)
1025     return getLocForStartOfFile(FirstFID).getFileLocWithOffset(FilePos + i);
1026 
1027   return getLocForStartOfFile(FirstFID).getFileLocWithOffset(FilePos + Col - 1);
1028 }
1029 
1030 /// \brief Determines the order of 2 source locations in the translation unit.
1031 ///
1032 /// \returns true if LHS source location comes before RHS, false otherwise.
1033 bool SourceManager::isBeforeInTranslationUnit(SourceLocation LHS,
1034                                               SourceLocation RHS) const {
1035   assert(LHS.isValid() && RHS.isValid() && "Passed invalid source location!");
1036   if (LHS == RHS)
1037     return false;
1038 
1039   std::pair<FileID, unsigned> LOffs = getDecomposedLoc(LHS);
1040   std::pair<FileID, unsigned> ROffs = getDecomposedLoc(RHS);
1041 
1042   // If the source locations are in the same file, just compare offsets.
1043   if (LOffs.first == ROffs.first)
1044     return LOffs.second < ROffs.second;
1045 
1046   // If we are comparing a source location with multiple locations in the same
1047   // file, we get a big win by caching the result.
1048 
1049   if (LastLFIDForBeforeTUCheck == LOffs.first &&
1050       LastRFIDForBeforeTUCheck == ROffs.first)
1051     return LastResForBeforeTUCheck;
1052 
1053   LastLFIDForBeforeTUCheck = LOffs.first;
1054   LastRFIDForBeforeTUCheck = ROffs.first;
1055 
1056   // "Traverse" the include/instantiation stacks of both locations and try to
1057   // find a common "ancestor".
1058   //
1059   // First we traverse the stack of the right location and check each level
1060   // against the level of the left location, while collecting all levels in a
1061   // "stack map".
1062 
1063   std::map<FileID, unsigned> ROffsMap;
1064   ROffsMap[ROffs.first] = ROffs.second;
1065 
1066   while (1) {
1067     SourceLocation UpperLoc;
1068     const SrcMgr::SLocEntry &Entry = getSLocEntry(ROffs.first);
1069     if (Entry.isInstantiation())
1070       UpperLoc = Entry.getInstantiation().getInstantiationLocStart();
1071     else
1072       UpperLoc = Entry.getFile().getIncludeLoc();
1073 
1074     if (UpperLoc.isInvalid())
1075       break; // We reached the top.
1076 
1077     ROffs = getDecomposedLoc(UpperLoc);
1078 
1079     if (LOffs.first == ROffs.first)
1080       return LastResForBeforeTUCheck = LOffs.second < ROffs.second;
1081 
1082     ROffsMap[ROffs.first] = ROffs.second;
1083   }
1084 
1085   // We didn't find a common ancestor. Now traverse the stack of the left
1086   // location, checking against the stack map of the right location.
1087 
1088   while (1) {
1089     SourceLocation UpperLoc;
1090     const SrcMgr::SLocEntry &Entry = getSLocEntry(LOffs.first);
1091     if (Entry.isInstantiation())
1092       UpperLoc = Entry.getInstantiation().getInstantiationLocStart();
1093     else
1094       UpperLoc = Entry.getFile().getIncludeLoc();
1095 
1096     if (UpperLoc.isInvalid())
1097       break; // We reached the top.
1098 
1099     LOffs = getDecomposedLoc(UpperLoc);
1100 
1101     std::map<FileID, unsigned>::iterator I = ROffsMap.find(LOffs.first);
1102     if (I != ROffsMap.end())
1103       return LastResForBeforeTUCheck = LOffs.second < I->second;
1104   }
1105 
1106   // There is no common ancestor, most probably because one location is in the
1107   // predefines buffer.
1108   //
1109   // FIXME: We should rearrange the external interface so this simply never
1110   // happens; it can't conceptually happen. Also see PR5662.
1111 
1112   // If exactly one location is a memory buffer, assume it preceeds the other.
1113   bool LIsMB = !getSLocEntry(LOffs.first).getFile().getContentCache()->Entry;
1114   bool RIsMB = !getSLocEntry(ROffs.first).getFile().getContentCache()->Entry;
1115   if (LIsMB != RIsMB)
1116     return LastResForBeforeTUCheck = LIsMB;
1117 
1118   // Otherwise, just assume FileIDs were created in order.
1119   return LastResForBeforeTUCheck = (LOffs.first < ROffs.first);
1120 }
1121 
1122 /// PrintStats - Print statistics to stderr.
1123 ///
1124 void SourceManager::PrintStats() const {
1125   llvm::errs() << "\n*** Source Manager Stats:\n";
1126   llvm::errs() << FileInfos.size() << " files mapped, " << MemBufferInfos.size()
1127                << " mem buffers mapped.\n";
1128   llvm::errs() << SLocEntryTable.size() << " SLocEntry's allocated, "
1129                << NextOffset << "B of Sloc address space used.\n";
1130 
1131   unsigned NumLineNumsComputed = 0;
1132   unsigned NumFileBytesMapped = 0;
1133   for (fileinfo_iterator I = fileinfo_begin(), E = fileinfo_end(); I != E; ++I){
1134     NumLineNumsComputed += I->second->SourceLineCache != 0;
1135     NumFileBytesMapped  += I->second->getSizeBytesMapped();
1136   }
1137 
1138   llvm::errs() << NumFileBytesMapped << " bytes of files mapped, "
1139                << NumLineNumsComputed << " files with line #'s computed.\n";
1140   llvm::errs() << "FileID scans: " << NumLinearScans << " linear, "
1141                << NumBinaryProbes << " binary.\n";
1142 }
1143 
1144 ExternalSLocEntrySource::~ExternalSLocEntrySource() { }
1145