blob: b50a66b2974fb14d5b215cc8b33a08dcbd6ebbb9 [file] [log] [blame]
Chris Lattner1b30e1ac2009-06-21 03:36:54 +00001//===- SourceMgr.cpp - Manager for Simple Source Buffers & Diagnostics ----===//
Chris Lattner8db9bc72009-03-13 07:05:43 +00002//
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//
Chris Lattner1b30e1ac2009-06-21 03:36:54 +000010// This file implements the SourceMgr class. This class is used as a simple
11// substrate for diagnostics, #include handling, and other low level things for
12// simple parsers.
Chris Lattner8db9bc72009-03-13 07:05:43 +000013//
14//===----------------------------------------------------------------------===//
15
Chris Lattner1b30e1ac2009-06-21 03:36:54 +000016#include "llvm/Support/SourceMgr.h"
Jordan Roseefd8f802013-01-10 18:50:15 +000017#include "llvm/ADT/SmallString.h"
Chandler Carruthed0881b2012-12-03 16:50:05 +000018#include "llvm/ADT/Twine.h"
Jordan Roseefd8f802013-01-10 18:50:15 +000019#include "llvm/Support/Locale.h"
Chandler Carruthed0881b2012-12-03 16:50:05 +000020#include "llvm/Support/MemoryBuffer.h"
Yaron Keren15217202014-05-16 13:16:30 +000021#include "llvm/Support/Path.h"
Chris Lattner8db9bc72009-03-13 07:05:43 +000022#include "llvm/Support/raw_ostream.h"
Rafael Espindolaa6e9c3e2014-06-12 17:38:55 +000023#include <system_error>
Chris Lattner8db9bc72009-03-13 07:05:43 +000024using namespace llvm;
25
Jordan Roseefd8f802013-01-10 18:50:15 +000026static const size_t TabStop = 8;
27
Chris Lattner5d47e932009-08-11 17:49:14 +000028namespace {
29 struct LineNoCacheTy {
Alp Tokera55b95b2014-07-06 10:33:31 +000030 unsigned LastQueryBufferID;
Chris Lattner5d47e932009-08-11 17:49:14 +000031 const char *LastQuery;
32 unsigned LineNoOfQuery;
33 };
34}
35
36static LineNoCacheTy *getCache(void *Ptr) {
37 return (LineNoCacheTy*)Ptr;
38}
39
40
Chris Lattnerfd255752009-06-21 03:41:50 +000041SourceMgr::~SourceMgr() {
Chris Lattner5d47e932009-08-11 17:49:14 +000042 // Delete the line # cache if allocated.
43 if (LineNoCacheTy *Cache = getCache(LineNoCache))
44 delete Cache;
Chris Lattner8db9bc72009-03-13 07:05:43 +000045}
46
Dmitri Gribenkoa5b27a72014-07-09 08:30:15 +000047unsigned SourceMgr::AddIncludeFile(const std::string &Filename,
48 SMLoc IncludeLoc,
49 std::string &IncludedFile) {
Joerg Sonnenbergeraf5f23e2011-06-01 13:10:15 +000050 IncludedFile = Filename;
Rafael Espindolaadf21f22014-07-06 17:43:13 +000051 ErrorOr<std::unique_ptr<MemoryBuffer>> NewBufOrErr =
Matt Arsenault6e863d12014-11-06 01:13:27 +000052 MemoryBuffer::getFile(IncludedFile);
Chris Lattner976af622009-06-21 05:06:04 +000053
54 // If the file didn't exist directly, see if it's in an include path.
Rafael Espindolaadf21f22014-07-06 17:43:13 +000055 for (unsigned i = 0, e = IncludeDirectories.size(); i != e && !NewBufOrErr;
56 ++i) {
57 IncludedFile =
58 IncludeDirectories[i] + sys::path::get_separator().data() + Filename;
Matt Arsenault6e863d12014-11-06 01:13:27 +000059 NewBufOrErr = MemoryBuffer::getFile(IncludedFile);
Chris Lattner976af622009-06-21 05:06:04 +000060 }
Mikhail Glushenkov84afae32010-01-27 10:13:11 +000061
Rafael Espindolaadf21f22014-07-06 17:43:13 +000062 if (!NewBufOrErr)
Alp Tokera55b95b2014-07-06 10:33:31 +000063 return 0;
Chris Lattner976af622009-06-21 05:06:04 +000064
David Blaikie1961f142014-08-21 20:44:56 +000065 return AddNewSourceBuffer(std::move(*NewBufOrErr), IncludeLoc);
Chris Lattner976af622009-06-21 05:06:04 +000066}
67
Alp Tokera55b95b2014-07-06 10:33:31 +000068unsigned SourceMgr::FindBufferContainingLoc(SMLoc Loc) const {
Chris Lattner8db9bc72009-03-13 07:05:43 +000069 for (unsigned i = 0, e = Buffers.size(); i != e; ++i)
Chris Lattner87710ca2009-03-13 16:01:53 +000070 if (Loc.getPointer() >= Buffers[i].Buffer->getBufferStart() &&
Chris Lattner0f6dc782009-03-18 20:36:45 +000071 // Use <= here so that a pointer to the null at the end of the buffer
72 // is included as part of the buffer.
73 Loc.getPointer() <= Buffers[i].Buffer->getBufferEnd())
Alp Tokera55b95b2014-07-06 10:33:31 +000074 return i + 1;
75 return 0;
Chris Lattner8db9bc72009-03-13 07:05:43 +000076}
77
Chris Lattner9322ba82012-05-05 22:17:32 +000078std::pair<unsigned, unsigned>
Alp Tokera55b95b2014-07-06 10:33:31 +000079SourceMgr::getLineAndColumn(SMLoc Loc, unsigned BufferID) const {
80 if (!BufferID)
81 BufferID = FindBufferContainingLoc(Loc);
82 assert(BufferID && "Invalid Location!");
Mikhail Glushenkov84afae32010-01-27 10:13:11 +000083
Alp Toker7899d502014-06-25 00:41:15 +000084 const MemoryBuffer *Buff = getMemoryBuffer(BufferID);
Mikhail Glushenkov84afae32010-01-27 10:13:11 +000085
Chris Lattner8db9bc72009-03-13 07:05:43 +000086 // Count the number of \n's between the start of the file and the specified
87 // location.
88 unsigned LineNo = 1;
Mikhail Glushenkov84afae32010-01-27 10:13:11 +000089
Chris Lattner9322ba82012-05-05 22:17:32 +000090 const char *BufStart = Buff->getBufferStart();
91 const char *Ptr = BufStart;
Chris Lattner8db9bc72009-03-13 07:05:43 +000092
Chris Lattner5d47e932009-08-11 17:49:14 +000093 // If we have a line number cache, and if the query is to a later point in the
94 // same file, start searching from the last query location. This optimizes
95 // for the case when multiple diagnostics come out of one file in order.
96 if (LineNoCacheTy *Cache = getCache(LineNoCache))
Mikhail Glushenkov84afae32010-01-27 10:13:11 +000097 if (Cache->LastQueryBufferID == BufferID &&
Chris Lattner5d47e932009-08-11 17:49:14 +000098 Cache->LastQuery <= Loc.getPointer()) {
99 Ptr = Cache->LastQuery;
100 LineNo = Cache->LineNoOfQuery;
101 }
102
103 // Scan for the location being queried, keeping track of the number of lines
104 // we see.
Chris Lattner526c8cb2009-06-21 03:39:35 +0000105 for (; SMLoc::getFromPointer(Ptr) != Loc; ++Ptr)
Chris Lattner8db9bc72009-03-13 07:05:43 +0000106 if (*Ptr == '\n') ++LineNo;
Mikhail Glushenkov84afae32010-01-27 10:13:11 +0000107
Chris Lattner5d47e932009-08-11 17:49:14 +0000108 // Allocate the line number cache if it doesn't exist.
Craig Topper8d399f82014-04-09 04:20:00 +0000109 if (!LineNoCache)
Chris Lattner5d47e932009-08-11 17:49:14 +0000110 LineNoCache = new LineNoCacheTy();
Mikhail Glushenkov84afae32010-01-27 10:13:11 +0000111
Chris Lattner5d47e932009-08-11 17:49:14 +0000112 // Update the line # cache.
113 LineNoCacheTy &Cache = *getCache(LineNoCache);
114 Cache.LastQueryBufferID = BufferID;
115 Cache.LastQuery = Ptr;
116 Cache.LineNoOfQuery = LineNo;
Chris Lattner9322ba82012-05-05 22:17:32 +0000117
118 size_t NewlineOffs = StringRef(BufStart, Ptr-BufStart).find_last_of("\n\r");
Matt Beaumont-Gaya1b3b002012-05-07 18:12:42 +0000119 if (NewlineOffs == StringRef::npos) NewlineOffs = ~(size_t)0;
Chris Lattner9322ba82012-05-05 22:17:32 +0000120 return std::make_pair(LineNo, Ptr-BufStart-NewlineOffs);
Chris Lattner8db9bc72009-03-13 07:05:43 +0000121}
122
Chris Lattnercc64cc92009-07-02 22:24:20 +0000123void SourceMgr::PrintIncludeStack(SMLoc IncludeLoc, raw_ostream &OS) const {
Chris Lattner526c8cb2009-06-21 03:39:35 +0000124 if (IncludeLoc == SMLoc()) return; // Top of stack.
Mikhail Glushenkov84afae32010-01-27 10:13:11 +0000125
Alp Tokera55b95b2014-07-06 10:33:31 +0000126 unsigned CurBuf = FindBufferContainingLoc(IncludeLoc);
127 assert(CurBuf && "Invalid or unspecified location!");
Chris Lattner8db9bc72009-03-13 07:05:43 +0000128
Chris Lattnercc64cc92009-07-02 22:24:20 +0000129 PrintIncludeStack(getBufferInfo(CurBuf).IncludeLoc, OS);
Mikhail Glushenkov84afae32010-01-27 10:13:11 +0000130
Chris Lattnercc64cc92009-07-02 22:24:20 +0000131 OS << "Included from "
132 << getBufferInfo(CurBuf).Buffer->getBufferIdentifier()
133 << ":" << FindLineNumber(IncludeLoc, CurBuf) << ":\n";
Chris Lattner8db9bc72009-03-13 07:05:43 +0000134}
135
136
Chris Lattner03b80a42011-10-16 05:43:57 +0000137SMDiagnostic SourceMgr::GetMessage(SMLoc Loc, SourceMgr::DiagKind Kind,
Chris Lattner72845262011-10-16 05:47:55 +0000138 const Twine &Msg,
Jordan Roseefd8f802013-01-10 18:50:15 +0000139 ArrayRef<SMRange> Ranges,
140 ArrayRef<SMFixIt> FixIts) const {
Mikhail Glushenkov84afae32010-01-27 10:13:11 +0000141
Chris Lattner8db9bc72009-03-13 07:05:43 +0000142 // First thing to do: find the current buffer containing the specified
Chris Lattner854f3662012-05-06 16:20:49 +0000143 // location to pull out the source line.
Chris Lattnera3a06812011-10-16 04:47:35 +0000144 SmallVector<std::pair<unsigned, unsigned>, 4> ColRanges;
Chris Lattner854f3662012-05-06 16:20:49 +0000145 std::pair<unsigned, unsigned> LineAndCol;
146 const char *BufferID = "<unknown>";
147 std::string LineStr;
Chris Lattnera3a06812011-10-16 04:47:35 +0000148
Chris Lattner854f3662012-05-06 16:20:49 +0000149 if (Loc.isValid()) {
Alp Tokera55b95b2014-07-06 10:33:31 +0000150 unsigned CurBuf = FindBufferContainingLoc(Loc);
151 assert(CurBuf && "Invalid or unspecified location!");
Chris Lattner854f3662012-05-06 16:20:49 +0000152
Alp Toker7899d502014-06-25 00:41:15 +0000153 const MemoryBuffer *CurMB = getMemoryBuffer(CurBuf);
Chris Lattner854f3662012-05-06 16:20:49 +0000154 BufferID = CurMB->getBufferIdentifier();
155
156 // Scan backward to find the start of the line.
157 const char *LineStart = Loc.getPointer();
158 const char *BufStart = CurMB->getBufferStart();
159 while (LineStart != BufStart && LineStart[-1] != '\n' &&
160 LineStart[-1] != '\r')
161 --LineStart;
162
163 // Get the end of the line.
164 const char *LineEnd = Loc.getPointer();
165 const char *BufEnd = CurMB->getBufferEnd();
166 while (LineEnd != BufEnd && LineEnd[0] != '\n' && LineEnd[0] != '\r')
167 ++LineEnd;
168 LineStr = std::string(LineStart, LineEnd);
169
170 // Convert any ranges to column ranges that only intersect the line of the
171 // location.
172 for (unsigned i = 0, e = Ranges.size(); i != e; ++i) {
173 SMRange R = Ranges[i];
174 if (!R.isValid()) continue;
175
176 // If the line doesn't contain any part of the range, then ignore it.
177 if (R.Start.getPointer() > LineEnd || R.End.getPointer() < LineStart)
178 continue;
179
180 // Ignore pieces of the range that go onto other lines.
181 if (R.Start.getPointer() < LineStart)
182 R.Start = SMLoc::getFromPointer(LineStart);
183 if (R.End.getPointer() > LineEnd)
184 R.End = SMLoc::getFromPointer(LineEnd);
185
186 // Translate from SMLoc ranges to column ranges.
Jordan Roseefd8f802013-01-10 18:50:15 +0000187 // FIXME: Handle multibyte characters.
Chris Lattner854f3662012-05-06 16:20:49 +0000188 ColRanges.push_back(std::make_pair(R.Start.getPointer()-LineStart,
189 R.End.getPointer()-LineStart));
190 }
191
192 LineAndCol = getLineAndColumn(Loc, CurBuf);
193 }
194
195 return SMDiagnostic(*this, Loc, BufferID, LineAndCol.first,
Chris Lattner9322ba82012-05-05 22:17:32 +0000196 LineAndCol.second-1, Kind, Msg.str(),
Jordan Roseefd8f802013-01-10 18:50:15 +0000197 LineStr, ColRanges, FixIts);
Chris Lattner200e0752009-07-02 23:08:13 +0000198}
199
Jordan Rose57ffdb02014-06-17 02:15:40 +0000200void SourceMgr::PrintMessage(raw_ostream &OS, const SMDiagnostic &Diagnostic,
201 bool ShowColors) const {
Chris Lattner3c799812010-04-06 00:26:48 +0000202 // Report the message with the diagnostic handler if present.
203 if (DiagHandler) {
Chris Lattner03b80a42011-10-16 05:43:57 +0000204 DiagHandler(Diagnostic, DiagContext);
Chris Lattner3c799812010-04-06 00:26:48 +0000205 return;
206 }
Michael J. Spencerdb97c0b2010-12-09 17:37:32 +0000207
Jordan Rose57ffdb02014-06-17 02:15:40 +0000208 if (Diagnostic.getLoc().isValid()) {
Alp Tokera55b95b2014-07-06 10:33:31 +0000209 unsigned CurBuf = FindBufferContainingLoc(Diagnostic.getLoc());
210 assert(CurBuf && "Invalid or unspecified location!");
Chris Lattner854f3662012-05-06 16:20:49 +0000211 PrintIncludeStack(getBufferInfo(CurBuf).IncludeLoc, OS);
212 }
Chris Lattner200e0752009-07-02 23:08:13 +0000213
Craig Topperc10719f2014-04-07 04:17:22 +0000214 Diagnostic.print(nullptr, OS, ShowColors);
Chris Lattner8db9bc72009-03-13 07:05:43 +0000215}
Chris Lattnercc64cc92009-07-02 22:24:20 +0000216
Jordan Rose57ffdb02014-06-17 02:15:40 +0000217void SourceMgr::PrintMessage(raw_ostream &OS, SMLoc Loc,
218 SourceMgr::DiagKind Kind,
219 const Twine &Msg, ArrayRef<SMRange> Ranges,
220 ArrayRef<SMFixIt> FixIts, bool ShowColors) const {
221 PrintMessage(OS, GetMessage(Loc, Kind, Msg, Ranges, FixIts), ShowColors);
222}
223
Dmitri Gribenko8f944622013-09-27 21:09:25 +0000224void SourceMgr::PrintMessage(SMLoc Loc, SourceMgr::DiagKind Kind,
225 const Twine &Msg, ArrayRef<SMRange> Ranges,
226 ArrayRef<SMFixIt> FixIts, bool ShowColors) const {
227 PrintMessage(llvm::errs(), Loc, Kind, Msg, Ranges, FixIts, ShowColors);
228}
229
Chris Lattnercc64cc92009-07-02 22:24:20 +0000230//===----------------------------------------------------------------------===//
231// SMDiagnostic Implementation
232//===----------------------------------------------------------------------===//
233
Jordan Roseefd8f802013-01-10 18:50:15 +0000234SMDiagnostic::SMDiagnostic(const SourceMgr &sm, SMLoc L, StringRef FN,
Chris Lattner03b80a42011-10-16 05:43:57 +0000235 int Line, int Col, SourceMgr::DiagKind Kind,
Jordan Roseefd8f802013-01-10 18:50:15 +0000236 StringRef Msg, StringRef LineStr,
237 ArrayRef<std::pair<unsigned,unsigned> > Ranges,
238 ArrayRef<SMFixIt> Hints)
Chris Lattner03b80a42011-10-16 05:43:57 +0000239 : SM(&sm), Loc(L), Filename(FN), LineNo(Line), ColumnNo(Col), Kind(Kind),
Jordan Roseefd8f802013-01-10 18:50:15 +0000240 Message(Msg), LineContents(LineStr), Ranges(Ranges.vec()),
241 FixIts(Hints.begin(), Hints.end()) {
242 std::sort(FixIts.begin(), FixIts.end());
Chris Lattner03b80a42011-10-16 05:43:57 +0000243}
Chris Lattnera3a06812011-10-16 04:47:35 +0000244
Benjamin Kramer6ecb1e72013-02-15 12:30:38 +0000245static void buildFixItLine(std::string &CaretLine, std::string &FixItLine,
246 ArrayRef<SMFixIt> FixIts, ArrayRef<char> SourceLine){
Jordan Roseefd8f802013-01-10 18:50:15 +0000247 if (FixIts.empty())
248 return;
249
250 const char *LineStart = SourceLine.begin();
251 const char *LineEnd = SourceLine.end();
252
253 size_t PrevHintEndCol = 0;
254
255 for (ArrayRef<SMFixIt>::iterator I = FixIts.begin(), E = FixIts.end();
256 I != E; ++I) {
257 // If the fixit contains a newline or tab, ignore it.
258 if (I->getText().find_first_of("\n\r\t") != StringRef::npos)
259 continue;
260
261 SMRange R = I->getRange();
262
263 // If the line doesn't contain any part of the range, then ignore it.
264 if (R.Start.getPointer() > LineEnd || R.End.getPointer() < LineStart)
265 continue;
266
267 // Translate from SMLoc to column.
268 // Ignore pieces of the range that go onto other lines.
269 // FIXME: Handle multibyte characters in the source line.
270 unsigned FirstCol;
271 if (R.Start.getPointer() < LineStart)
272 FirstCol = 0;
273 else
274 FirstCol = R.Start.getPointer() - LineStart;
275
276 // If we inserted a long previous hint, push this one forwards, and add
277 // an extra space to show that this is not part of the previous
278 // completion. This is sort of the best we can do when two hints appear
279 // to overlap.
280 //
281 // Note that if this hint is located immediately after the previous
282 // hint, no space will be added, since the location is more important.
283 unsigned HintCol = FirstCol;
284 if (HintCol < PrevHintEndCol)
285 HintCol = PrevHintEndCol + 1;
286
287 // FIXME: This assertion is intended to catch unintended use of multibyte
288 // characters in fixits. If we decide to do this, we'll have to track
289 // separate byte widths for the source and fixit lines.
290 assert((size_t)llvm::sys::locale::columnWidth(I->getText()) ==
291 I->getText().size());
292
293 // This relies on one byte per column in our fixit hints.
294 unsigned LastColumnModified = HintCol + I->getText().size();
295 if (LastColumnModified > FixItLine.size())
296 FixItLine.resize(LastColumnModified, ' ');
297
298 std::copy(I->getText().begin(), I->getText().end(),
299 FixItLine.begin() + HintCol);
300
301 PrevHintEndCol = LastColumnModified;
302
303 // For replacements, mark the removal range with '~'.
304 // FIXME: Handle multibyte characters in the source line.
305 unsigned LastCol;
306 if (R.End.getPointer() >= LineEnd)
307 LastCol = LineEnd - LineStart;
308 else
309 LastCol = R.End.getPointer() - LineStart;
310
311 std::fill(&CaretLine[FirstCol], &CaretLine[LastCol], '~');
312 }
313}
314
315static void printSourceLine(raw_ostream &S, StringRef LineContents) {
316 // Print out the source line one character at a time, so we can expand tabs.
317 for (unsigned i = 0, e = LineContents.size(), OutCol = 0; i != e; ++i) {
318 if (LineContents[i] != '\t') {
319 S << LineContents[i];
320 ++OutCol;
321 continue;
322 }
323
324 // If we have a tab, emit at least one space, then round up to 8 columns.
325 do {
326 S << ' ';
327 ++OutCol;
328 } while ((OutCol % TabStop) != 0);
329 }
330 S << '\n';
331}
Chris Lattnera3a06812011-10-16 04:47:35 +0000332
Jordan Roseceb1dbb2013-01-11 02:37:55 +0000333static bool isNonASCII(char c) {
334 return c & 0x80;
335}
336
Benjamin Kramerbb73d192012-04-18 19:04:15 +0000337void SMDiagnostic::print(const char *ProgName, raw_ostream &S,
338 bool ShowColors) const {
Daniel Dunbarc8b8c492012-07-20 18:29:44 +0000339 // Display colors only if OS supports colors.
340 ShowColors &= S.has_colors();
Benjamin Kramerbb73d192012-04-18 19:04:15 +0000341
342 if (ShowColors)
343 S.changeColor(raw_ostream::SAVEDCOLOR, true);
344
Chris Lattnercc64cc92009-07-02 22:24:20 +0000345 if (ProgName && ProgName[0])
346 S << ProgName << ": ";
347
Dan Gohman7c675902010-01-21 10:13:27 +0000348 if (!Filename.empty()) {
349 if (Filename == "-")
350 S << "<stdin>";
351 else
352 S << Filename;
Mikhail Glushenkov84afae32010-01-27 10:13:11 +0000353
Dan Gohman7c675902010-01-21 10:13:27 +0000354 if (LineNo != -1) {
355 S << ':' << LineNo;
356 if (ColumnNo != -1)
357 S << ':' << (ColumnNo+1);
358 }
359 S << ": ";
Chris Lattnercc64cc92009-07-02 22:24:20 +0000360 }
Mikhail Glushenkov84afae32010-01-27 10:13:11 +0000361
Chris Lattner03b80a42011-10-16 05:43:57 +0000362 switch (Kind) {
Benjamin Kramerbb73d192012-04-18 19:04:15 +0000363 case SourceMgr::DK_Error:
364 if (ShowColors)
365 S.changeColor(raw_ostream::RED, true);
366 S << "error: ";
367 break;
368 case SourceMgr::DK_Warning:
369 if (ShowColors)
370 S.changeColor(raw_ostream::MAGENTA, true);
371 S << "warning: ";
372 break;
373 case SourceMgr::DK_Note:
374 if (ShowColors)
375 S.changeColor(raw_ostream::BLACK, true);
376 S << "note: ";
377 break;
Chris Lattner03b80a42011-10-16 05:43:57 +0000378 }
Benjamin Kramerbb73d192012-04-18 19:04:15 +0000379
380 if (ShowColors) {
381 S.resetColor();
382 S.changeColor(raw_ostream::SAVEDCOLOR, true);
383 }
384
Dan Gohman7c675902010-01-21 10:13:27 +0000385 S << Message << '\n';
Daniel Dunbar5a308f52009-11-22 22:08:00 +0000386
Benjamin Kramerbb73d192012-04-18 19:04:15 +0000387 if (ShowColors)
388 S.resetColor();
389
Chris Lattner72845262011-10-16 05:47:55 +0000390 if (LineNo == -1 || ColumnNo == -1)
Chris Lattnera3a06812011-10-16 04:47:35 +0000391 return;
Mikhail Glushenkov84afae32010-01-27 10:13:11 +0000392
Jordan Roseceb1dbb2013-01-11 02:37:55 +0000393 // FIXME: If there are multibyte or multi-column characters in the source, all
394 // our ranges will be wrong. To do this properly, we'll need a byte-to-column
395 // map like Clang's TextDiagnostic. For now, we'll just handle tabs by
396 // expanding them later, and bail out rather than show incorrect ranges and
397 // misaligned fixits for any other odd characters.
398 if (std::find_if(LineContents.begin(), LineContents.end(), isNonASCII) !=
399 LineContents.end()) {
Jordan Roseefd8f802013-01-10 18:50:15 +0000400 printSourceLine(S, LineContents);
401 return;
402 }
Jordan Roseceb1dbb2013-01-11 02:37:55 +0000403 size_t NumColumns = LineContents.size();
Jordan Roseefd8f802013-01-10 18:50:15 +0000404
Chris Lattnera3a06812011-10-16 04:47:35 +0000405 // Build the line with the caret and ranges.
Jordan Roseefd8f802013-01-10 18:50:15 +0000406 std::string CaretLine(NumColumns+1, ' ');
Chris Lattnera3a06812011-10-16 04:47:35 +0000407
408 // Expand any ranges.
409 for (unsigned r = 0, e = Ranges.size(); r != e; ++r) {
410 std::pair<unsigned, unsigned> R = Ranges[r];
Jordan Roseefd8f802013-01-10 18:50:15 +0000411 std::fill(&CaretLine[R.first],
412 &CaretLine[std::min((size_t)R.second, CaretLine.size())],
413 '~');
Chris Lattnercc64cc92009-07-02 22:24:20 +0000414 }
Jordan Roseefd8f802013-01-10 18:50:15 +0000415
416 // Add any fix-its.
417 // FIXME: Find the beginning of the line properly for multibyte characters.
418 std::string FixItInsertionLine;
419 buildFixItLine(CaretLine, FixItInsertionLine, FixIts,
420 makeArrayRef(Loc.getPointer() - ColumnNo,
421 LineContents.size()));
422
Chris Lattnera3a06812011-10-16 04:47:35 +0000423 // Finally, plop on the caret.
Jordan Roseefd8f802013-01-10 18:50:15 +0000424 if (unsigned(ColumnNo) <= NumColumns)
Chris Lattnera3a06812011-10-16 04:47:35 +0000425 CaretLine[ColumnNo] = '^';
426 else
Jordan Roseefd8f802013-01-10 18:50:15 +0000427 CaretLine[NumColumns] = '^';
Chris Lattnera3a06812011-10-16 04:47:35 +0000428
429 // ... and remove trailing whitespace so the output doesn't wrap for it. We
430 // know that the line isn't completely empty because it has the caret in it at
431 // least.
432 CaretLine.erase(CaretLine.find_last_not_of(' ')+1);
433
Jordan Roseefd8f802013-01-10 18:50:15 +0000434 printSourceLine(S, LineContents);
Chris Lattnera3a06812011-10-16 04:47:35 +0000435
Benjamin Kramerbb73d192012-04-18 19:04:15 +0000436 if (ShowColors)
437 S.changeColor(raw_ostream::GREEN, true);
438
Chris Lattnera3a06812011-10-16 04:47:35 +0000439 // Print out the caret line, matching tabs in the source line.
440 for (unsigned i = 0, e = CaretLine.size(), OutCol = 0; i != e; ++i) {
441 if (i >= LineContents.size() || LineContents[i] != '\t') {
442 S << CaretLine[i];
443 ++OutCol;
444 continue;
445 }
446
447 // Okay, we have a tab. Insert the appropriate number of characters.
448 do {
449 S << CaretLine[i];
450 ++OutCol;
Jordan Roseefd8f802013-01-10 18:50:15 +0000451 } while ((OutCol % TabStop) != 0);
Chris Lattnera3a06812011-10-16 04:47:35 +0000452 }
Jordan Roseefd8f802013-01-10 18:50:15 +0000453 S << '\n';
Benjamin Kramerbb73d192012-04-18 19:04:15 +0000454
455 if (ShowColors)
456 S.resetColor();
Jordan Roseefd8f802013-01-10 18:50:15 +0000457
458 // Print out the replacement line, matching tabs in the source line.
459 if (FixItInsertionLine.empty())
460 return;
Chris Lattnera3a06812011-10-16 04:47:35 +0000461
Dmitri Gribenko78fe2ba2013-09-27 21:24:36 +0000462 for (size_t i = 0, e = FixItInsertionLine.size(), OutCol = 0; i < e; ++i) {
Jordan Roseefd8f802013-01-10 18:50:15 +0000463 if (i >= LineContents.size() || LineContents[i] != '\t') {
464 S << FixItInsertionLine[i];
465 ++OutCol;
466 continue;
467 }
468
469 // Okay, we have a tab. Insert the appropriate number of characters.
470 do {
471 S << FixItInsertionLine[i];
472 // FIXME: This is trying not to break up replacements, but then to re-sync
473 // with the tabs between replacements. This will fail, though, if two
474 // fix-it replacements are exactly adjacent, or if a fix-it contains a
475 // space. Really we should be precomputing column widths, which we'll
476 // need anyway for multibyte chars.
477 if (FixItInsertionLine[i] != ' ')
478 ++i;
479 ++OutCol;
480 } while (((OutCol % TabStop) != 0) && i != e);
481 }
Chris Lattnera3a06812011-10-16 04:47:35 +0000482 S << '\n';
Chris Lattnercc64cc92009-07-02 22:24:20 +0000483}