TextDiagnosticPrinter.cpp revision 06d10728b86ebb2bd73b593146e95e0c1688acc4
1//===--- TextDiagnosticPrinter.cpp - Diagnostic Printer -------------------===//
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 diagnostic client prints out their diagnostic messages.
11//
12//===----------------------------------------------------------------------===//
13
14#include "clang/Frontend/TextDiagnosticPrinter.h"
15#include "clang/Basic/SourceManager.h"
16#include "clang/Lex/Lexer.h"
17#include "llvm/Support/MemoryBuffer.h"
18#include "llvm/Support/raw_ostream.h"
19#include "llvm/ADT/SmallString.h"
20#include <algorithm>
21using namespace clang;
22
23static const enum llvm::raw_ostream::Colors noteColor =
24  llvm::raw_ostream::BLACK;
25static const enum llvm::raw_ostream::Colors fixitColor =
26  llvm::raw_ostream::GREEN;
27static const enum llvm::raw_ostream::Colors caretColor =
28  llvm::raw_ostream::GREEN;
29static const enum llvm::raw_ostream::Colors warningColor =
30  llvm::raw_ostream::MAGENTA;
31static const enum llvm::raw_ostream::Colors errorColor = llvm::raw_ostream::RED;
32static const enum llvm::raw_ostream::Colors fatalColor = llvm::raw_ostream::RED;
33// used for changing only the bold attribute
34static const enum llvm::raw_ostream::Colors savedColor =
35  llvm::raw_ostream::SAVEDCOLOR;
36
37/// \brief Number of spaces to indent when word-wrapping.
38const unsigned WordWrapIndentation = 6;
39
40void TextDiagnosticPrinter::
41PrintIncludeStack(SourceLocation Loc, const SourceManager &SM) {
42  if (Loc.isInvalid()) return;
43
44  PresumedLoc PLoc = SM.getPresumedLoc(Loc);
45
46  // Print out the other include frames first.
47  PrintIncludeStack(PLoc.getIncludeLoc(), SM);
48
49  if (ShowLocation)
50    OS << "In file included from " << PLoc.getFilename()
51       << ':' << PLoc.getLine() << ":\n";
52  else
53    OS << "In included file:\n";
54}
55
56/// HighlightRange - Given a SourceRange and a line number, highlight (with ~'s)
57/// any characters in LineNo that intersect the SourceRange.
58void TextDiagnosticPrinter::HighlightRange(const SourceRange &R,
59                                           const SourceManager &SM,
60                                           unsigned LineNo, FileID FID,
61                                           std::string &CaretLine,
62                                           const std::string &SourceLine) {
63  assert(CaretLine.size() == SourceLine.size() &&
64         "Expect a correspondence between source and caret line!");
65  if (!R.isValid()) return;
66
67  SourceLocation Begin = SM.getInstantiationLoc(R.getBegin());
68  SourceLocation End = SM.getInstantiationLoc(R.getEnd());
69
70  // If the End location and the start location are the same and are a macro
71  // location, then the range was something that came from a macro expansion
72  // or _Pragma.  If this is an object-like macro, the best we can do is to
73  // highlight the range.  If this is a function-like macro, we'd also like to
74  // highlight the arguments.
75  if (Begin == End && R.getEnd().isMacroID())
76    End = SM.getInstantiationRange(R.getEnd()).second;
77
78  unsigned StartLineNo = SM.getInstantiationLineNumber(Begin);
79  if (StartLineNo > LineNo || SM.getFileID(Begin) != FID)
80    return;  // No intersection.
81
82  unsigned EndLineNo = SM.getInstantiationLineNumber(End);
83  if (EndLineNo < LineNo || SM.getFileID(End) != FID)
84    return;  // No intersection.
85
86  // Compute the column number of the start.
87  unsigned StartColNo = 0;
88  if (StartLineNo == LineNo) {
89    StartColNo = SM.getInstantiationColumnNumber(Begin);
90    if (StartColNo) --StartColNo;  // Zero base the col #.
91  }
92
93  // Pick the first non-whitespace column.
94  while (StartColNo < SourceLine.size() &&
95         (SourceLine[StartColNo] == ' ' || SourceLine[StartColNo] == '\t'))
96    ++StartColNo;
97
98  // Compute the column number of the end.
99  unsigned EndColNo = CaretLine.size();
100  if (EndLineNo == LineNo) {
101    EndColNo = SM.getInstantiationColumnNumber(End);
102    if (EndColNo) {
103      --EndColNo;  // Zero base the col #.
104
105      // Add in the length of the token, so that we cover multi-char tokens.
106      EndColNo += Lexer::MeasureTokenLength(End, SM, *LangOpts);
107    } else {
108      EndColNo = CaretLine.size();
109    }
110  }
111
112  // Pick the last non-whitespace column.
113  if (EndColNo <= SourceLine.size())
114    while (EndColNo-1 &&
115           (SourceLine[EndColNo-1] == ' ' || SourceLine[EndColNo-1] == '\t'))
116      --EndColNo;
117  else
118    EndColNo = SourceLine.size();
119
120  // Fill the range with ~'s.
121  assert(StartColNo <= EndColNo && "Invalid range!");
122  for (unsigned i = StartColNo; i < EndColNo; ++i)
123    CaretLine[i] = '~';
124}
125
126/// \brief When the source code line we want to print is too long for
127/// the terminal, select the "interesting" region.
128static void SelectInterestingSourceRegion(std::string &SourceLine,
129                                          std::string &CaretLine,
130                                          std::string &FixItInsertionLine,
131                                          unsigned EndOfCaretToken,
132                                          unsigned Columns) {
133  if (CaretLine.size() > SourceLine.size())
134    SourceLine.resize(CaretLine.size(), ' ');
135
136  // Find the slice that we need to display the full caret line
137  // correctly.
138  unsigned CaretStart = 0, CaretEnd = CaretLine.size();
139  for (; CaretStart != CaretEnd; ++CaretStart)
140    if (!isspace(CaretLine[CaretStart]))
141      break;
142
143  for (; CaretEnd != CaretStart; --CaretEnd)
144    if (!isspace(CaretLine[CaretEnd - 1]))
145      break;
146
147  // Make sure we don't chop the string shorter than the caret token
148  // itself.
149  if (CaretEnd < EndOfCaretToken)
150    CaretEnd = EndOfCaretToken;
151
152  // If we have a fix-it line, make sure the slice includes all of the
153  // fix-it information.
154  if (!FixItInsertionLine.empty()) {
155    unsigned FixItStart = 0, FixItEnd = FixItInsertionLine.size();
156    for (; FixItStart != FixItEnd; ++FixItStart)
157      if (!isspace(FixItInsertionLine[FixItStart]))
158        break;
159
160    for (; FixItEnd != FixItStart; --FixItEnd)
161      if (!isspace(FixItInsertionLine[FixItEnd - 1]))
162        break;
163
164    if (FixItStart < CaretStart)
165      CaretStart = FixItStart;
166    if (FixItEnd > CaretEnd)
167      CaretEnd = FixItEnd;
168  }
169
170  // CaretLine[CaretStart, CaretEnd) contains all of the interesting
171  // parts of the caret line. While this slice is smaller than the
172  // number of columns we have, try to grow the slice to encompass
173  // more context.
174
175  // If the end of the interesting region comes before we run out of
176  // space in the terminal, start at the beginning of the line.
177  if (Columns > 3 && CaretEnd < Columns - 3)
178    CaretStart = 0;
179
180  unsigned TargetColumns = Columns;
181  if (TargetColumns > 8)
182    TargetColumns -= 8; // Give us extra room for the ellipses.
183  unsigned SourceLength = SourceLine.size();
184  while ((CaretEnd - CaretStart) < TargetColumns) {
185    bool ExpandedRegion = false;
186    // Move the start of the interesting region left until we've
187    // pulled in something else interesting.
188    if (CaretStart == 1)
189      CaretStart = 0;
190    else if (CaretStart > 1) {
191      unsigned NewStart = CaretStart - 1;
192
193      // Skip over any whitespace we see here; we're looking for
194      // another bit of interesting text.
195      while (NewStart && isspace(SourceLine[NewStart]))
196        --NewStart;
197
198      // Skip over this bit of "interesting" text.
199      while (NewStart && !isspace(SourceLine[NewStart]))
200        --NewStart;
201
202      // Move up to the non-whitespace character we just saw.
203      if (NewStart)
204        ++NewStart;
205
206      // If we're still within our limit, update the starting
207      // position within the source/caret line.
208      if (CaretEnd - NewStart <= TargetColumns) {
209        CaretStart = NewStart;
210        ExpandedRegion = true;
211      }
212    }
213
214    // Move the end of the interesting region right until we've
215    // pulled in something else interesting.
216    if (CaretEnd != SourceLength) {
217      assert(CaretEnd < SourceLength && "Unexpected caret position!");
218      unsigned NewEnd = CaretEnd;
219
220      // Skip over any whitespace we see here; we're looking for
221      // another bit of interesting text.
222      while (NewEnd != SourceLength && isspace(SourceLine[NewEnd - 1]))
223        ++NewEnd;
224
225      // Skip over this bit of "interesting" text.
226      while (NewEnd != SourceLength && !isspace(SourceLine[NewEnd - 1]))
227        ++NewEnd;
228
229      if (NewEnd - CaretStart <= TargetColumns) {
230        CaretEnd = NewEnd;
231        ExpandedRegion = true;
232      }
233    }
234
235    if (!ExpandedRegion)
236      break;
237  }
238
239  // [CaretStart, CaretEnd) is the slice we want. Update the various
240  // output lines to show only this slice, with two-space padding
241  // before the lines so that it looks nicer.
242  if (CaretEnd < SourceLine.size())
243    SourceLine.replace(CaretEnd, std::string::npos, "...");
244  if (CaretEnd < CaretLine.size())
245    CaretLine.erase(CaretEnd, std::string::npos);
246  if (FixItInsertionLine.size() > CaretEnd)
247    FixItInsertionLine.erase(CaretEnd, std::string::npos);
248
249  if (CaretStart > 2) {
250    SourceLine.replace(0, CaretStart, "  ...");
251    CaretLine.replace(0, CaretStart, "     ");
252    if (FixItInsertionLine.size() >= CaretStart)
253      FixItInsertionLine.replace(0, CaretStart, "     ");
254  }
255}
256
257void TextDiagnosticPrinter::EmitCaretDiagnostic(SourceLocation Loc,
258                                                SourceRange *Ranges,
259                                                unsigned NumRanges,
260                                                SourceManager &SM,
261                                          const CodeModificationHint *Hints,
262                                                unsigned NumHints,
263                                                unsigned Columns) {
264  assert(!Loc.isInvalid() && "must have a valid source location here");
265
266  // If this is a macro ID, first emit information about where this was
267  // instantiated (recursively) then emit information about where. the token was
268  // spelled from.
269  if (!Loc.isFileID()) {
270    SourceLocation OneLevelUp = SM.getImmediateInstantiationRange(Loc).first;
271    // FIXME: Map ranges?
272    EmitCaretDiagnostic(OneLevelUp, Ranges, NumRanges, SM, 0, 0, Columns);
273
274    Loc = SM.getImmediateSpellingLoc(Loc);
275
276    // Map the ranges.
277    for (unsigned i = 0; i != NumRanges; ++i) {
278      SourceLocation S = Ranges[i].getBegin(), E = Ranges[i].getEnd();
279      if (S.isMacroID()) S = SM.getImmediateSpellingLoc(S);
280      if (E.isMacroID()) E = SM.getImmediateSpellingLoc(E);
281      Ranges[i] = SourceRange(S, E);
282    }
283
284    if (ShowLocation) {
285      std::pair<FileID, unsigned> IInfo = SM.getDecomposedInstantiationLoc(Loc);
286
287      // Emit the file/line/column that this expansion came from.
288      OS << SM.getBuffer(IInfo.first)->getBufferIdentifier() << ':'
289         << SM.getLineNumber(IInfo.first, IInfo.second) << ':';
290      if (ShowColumn)
291        OS << SM.getColumnNumber(IInfo.first, IInfo.second) << ':';
292      OS << ' ';
293    }
294    OS << "note: instantiated from:\n";
295
296    EmitCaretDiagnostic(Loc, Ranges, NumRanges, SM, Hints, NumHints, Columns);
297    return;
298  }
299
300  // Decompose the location into a FID/Offset pair.
301  std::pair<FileID, unsigned> LocInfo = SM.getDecomposedLoc(Loc);
302  FileID FID = LocInfo.first;
303  unsigned FileOffset = LocInfo.second;
304
305  // Get information about the buffer it points into.
306  std::pair<const char*, const char*> BufferInfo = SM.getBufferData(FID);
307  const char *BufStart = BufferInfo.first;
308
309  unsigned ColNo = SM.getColumnNumber(FID, FileOffset);
310  unsigned CaretEndColNo
311    = ColNo + Lexer::MeasureTokenLength(Loc, SM, *LangOpts);
312
313  // Rewind from the current position to the start of the line.
314  const char *TokPtr = BufStart+FileOffset;
315  const char *LineStart = TokPtr-ColNo+1; // Column # is 1-based.
316
317
318  // Compute the line end.  Scan forward from the error position to the end of
319  // the line.
320  const char *LineEnd = TokPtr;
321  while (*LineEnd != '\n' && *LineEnd != '\r' && *LineEnd != '\0')
322    ++LineEnd;
323
324  // FIXME: This shouldn't be necessary, but the CaretEndColNo can extend past
325  // the source line length as currently being computed. See
326  // test/Misc/message-length.c.
327  CaretEndColNo = std::min(CaretEndColNo, unsigned(LineEnd - LineStart));
328
329  // Copy the line of code into an std::string for ease of manipulation.
330  std::string SourceLine(LineStart, LineEnd);
331
332  // Create a line for the caret that is filled with spaces that is the same
333  // length as the line of source code.
334  std::string CaretLine(LineEnd-LineStart, ' ');
335
336  // Highlight all of the characters covered by Ranges with ~ characters.
337  if (NumRanges) {
338    unsigned LineNo = SM.getLineNumber(FID, FileOffset);
339
340    for (unsigned i = 0, e = NumRanges; i != e; ++i)
341      HighlightRange(Ranges[i], SM, LineNo, FID, CaretLine, SourceLine);
342  }
343
344  // Next, insert the caret itself.
345  if (ColNo-1 < CaretLine.size())
346    CaretLine[ColNo-1] = '^';
347  else
348    CaretLine.push_back('^');
349
350  // Scan the source line, looking for tabs.  If we find any, manually expand
351  // them to 8 characters and update the CaretLine to match.
352  for (unsigned i = 0; i != SourceLine.size(); ++i) {
353    if (SourceLine[i] != '\t') continue;
354
355    // Replace this tab with at least one space.
356    SourceLine[i] = ' ';
357
358    // Compute the number of spaces we need to insert.
359    unsigned NumSpaces = ((i+8)&~7) - (i+1);
360    assert(NumSpaces < 8 && "Invalid computation of space amt");
361
362    // Insert spaces into the SourceLine.
363    SourceLine.insert(i+1, NumSpaces, ' ');
364
365    // Insert spaces or ~'s into CaretLine.
366    CaretLine.insert(i+1, NumSpaces, CaretLine[i] == '~' ? '~' : ' ');
367  }
368
369  // If we are in -fdiagnostics-print-source-range-info mode, we are trying to
370  // produce easily machine parsable output.  Add a space before the source line
371  // and the caret to make it trivial to tell the main diagnostic line from what
372  // the user is intended to see.
373  if (PrintRangeInfo) {
374    SourceLine = ' ' + SourceLine;
375    CaretLine = ' ' + CaretLine;
376  }
377
378  std::string FixItInsertionLine;
379  if (NumHints && PrintFixItInfo) {
380    for (const CodeModificationHint *Hint = Hints, *LastHint = Hints + NumHints;
381         Hint != LastHint; ++Hint) {
382      if (Hint->InsertionLoc.isValid()) {
383        // We have an insertion hint. Determine whether the inserted
384        // code is on the same line as the caret.
385        std::pair<FileID, unsigned> HintLocInfo
386          = SM.getDecomposedInstantiationLoc(Hint->InsertionLoc);
387        if (SM.getLineNumber(HintLocInfo.first, HintLocInfo.second) ==
388              SM.getLineNumber(FID, FileOffset)) {
389          // Insert the new code into the line just below the code
390          // that the user wrote.
391          unsigned HintColNo
392            = SM.getColumnNumber(HintLocInfo.first, HintLocInfo.second);
393          unsigned LastColumnModified
394            = HintColNo - 1 + Hint->CodeToInsert.size();
395          if (LastColumnModified > FixItInsertionLine.size())
396            FixItInsertionLine.resize(LastColumnModified, ' ');
397          std::copy(Hint->CodeToInsert.begin(), Hint->CodeToInsert.end(),
398                    FixItInsertionLine.begin() + HintColNo - 1);
399        } else {
400          FixItInsertionLine.clear();
401          break;
402        }
403      }
404    }
405  }
406
407  // If the source line is too long for our terminal, select only the
408  // "interesting" source region within that line.
409  if (Columns && SourceLine.size() > Columns)
410    SelectInterestingSourceRegion(SourceLine, CaretLine, FixItInsertionLine,
411                                  CaretEndColNo, Columns);
412
413  // Finally, remove any blank spaces from the end of CaretLine.
414  while (CaretLine[CaretLine.size()-1] == ' ')
415    CaretLine.erase(CaretLine.end()-1);
416
417  // Emit what we have computed.
418  OS << SourceLine << '\n';
419
420  if (UseColors)
421    OS.changeColor(caretColor, true);
422  OS << CaretLine << '\n';
423  if (UseColors)
424    OS.resetColor();
425
426  if (!FixItInsertionLine.empty()) {
427    if (UseColors)
428      // Print fixit line in color
429      OS.changeColor(fixitColor, false);
430    if (PrintRangeInfo)
431      OS << ' ';
432    OS << FixItInsertionLine << '\n';
433    if (UseColors)
434      OS.resetColor();
435  }
436}
437
438/// \brief Skip over whitespace in the string, starting at the given
439/// index.
440///
441/// \returns The index of the first non-whitespace character that is
442/// greater than or equal to Idx or, if no such character exists,
443/// returns the end of the string.
444static unsigned skipWhitespace(unsigned Idx,
445                               const llvm::SmallVectorImpl<char> &Str,
446                               unsigned Length) {
447  while (Idx < Length && isspace(Str[Idx]))
448    ++Idx;
449  return Idx;
450}
451
452/// \brief If the given character is the start of some kind of
453/// balanced punctuation (e.g., quotes or parentheses), return the
454/// character that will terminate the punctuation.
455///
456/// \returns The ending punctuation character, if any, or the NULL
457/// character if the input character does not start any punctuation.
458static inline char findMatchingPunctuation(char c) {
459  switch (c) {
460  case '\'': return '\'';
461  case '`': return '\'';
462  case '"':  return '"';
463  case '(':  return ')';
464  case '[': return ']';
465  case '{': return '}';
466  default: break;
467  }
468
469  return 0;
470}
471
472/// \brief Find the end of the word starting at the given offset
473/// within a string.
474///
475/// \returns the index pointing one character past the end of the
476/// word.
477unsigned findEndOfWord(unsigned Start,
478                       const llvm::SmallVectorImpl<char> &Str,
479                       unsigned Length, unsigned Column,
480                       unsigned Columns) {
481  unsigned End = Start + 1;
482
483  // Determine if the start of the string is actually opening
484  // punctuation, e.g., a quote or parentheses.
485  char EndPunct = findMatchingPunctuation(Str[Start]);
486  if (!EndPunct) {
487    // This is a normal word. Just find the first space character.
488    while (End < Length && !isspace(Str[End]))
489      ++End;
490    return End;
491  }
492
493  // We have the start of a balanced punctuation sequence (quotes,
494  // parentheses, etc.). Determine the full sequence is.
495  llvm::SmallVector<char, 16> PunctuationEndStack;
496  PunctuationEndStack.push_back(EndPunct);
497  while (End < Length && !PunctuationEndStack.empty()) {
498    if (Str[End] == PunctuationEndStack.back())
499      PunctuationEndStack.pop_back();
500    else if (char SubEndPunct = findMatchingPunctuation(Str[End]))
501      PunctuationEndStack.push_back(SubEndPunct);
502
503    ++End;
504  }
505
506  // Find the first space character after the punctuation ended.
507  while (End < Length && !isspace(Str[End]))
508    ++End;
509
510  unsigned PunctWordLength = End - Start;
511  if (// If the word fits on this line
512      Column + PunctWordLength <= Columns ||
513      // ... or the word is "short enough" to take up the next line
514      // without too much ugly white space
515      PunctWordLength < Columns/3)
516    return End; // Take the whole thing as a single "word".
517
518  // The whole quoted/parenthesized string is too long to print as a
519  // single "word". Instead, find the "word" that starts just after
520  // the punctuation and use that end-point instead. This will recurse
521  // until it finds something small enough to consider a word.
522  return findEndOfWord(Start + 1, Str, Length, Column + 1, Columns);
523}
524
525/// \brief Print the given string to a stream, word-wrapping it to
526/// some number of columns in the process.
527///
528/// \brief OS the stream to which the word-wrapping string will be
529/// emitted.
530///
531/// \brief Str the string to word-wrap and output.
532///
533/// \brief Columns the number of columns to word-wrap to.
534///
535/// \brief Column the column number at which the first character of \p
536/// Str will be printed. This will be non-zero when part of the first
537/// line has already been printed.
538///
539/// \brief Indentation the number of spaces to indent any lines beyond
540/// the first line.
541///
542/// \returns true if word-wrapping was required, or false if the
543/// string fit on the first line.
544static bool PrintWordWrapped(llvm::raw_ostream &OS,
545                             const llvm::SmallVectorImpl<char> &Str,
546                             unsigned Columns,
547                             unsigned Column = 0,
548                             unsigned Indentation = WordWrapIndentation) {
549  unsigned Length = Str.size();
550
551  // If there is a newline in this message somewhere, find that
552  // newline and split the message into the part before the newline
553  // (which will be word-wrapped) and the part from the newline one
554  // (which will be emitted unchanged).
555  for (unsigned I = 0; I != Length; ++I)
556    if (Str[I] == '\n') {
557      Length = I;
558      break;
559    }
560
561  // The string used to indent each line.
562  llvm::SmallString<16> IndentStr;
563  IndentStr.assign(Indentation, ' ');
564  bool Wrapped = false;
565  for (unsigned WordStart = 0, WordEnd; WordStart < Length;
566       WordStart = WordEnd) {
567    // Find the beginning of the next word.
568    WordStart = skipWhitespace(WordStart, Str, Length);
569    if (WordStart == Length)
570      break;
571
572    // Find the end of this word.
573    WordEnd = findEndOfWord(WordStart, Str, Length, Column, Columns);
574
575    // Does this word fit on the current line?
576    unsigned WordLength = WordEnd - WordStart;
577    if (Column + WordLength < Columns) {
578      // This word fits on the current line; print it there.
579      if (WordStart) {
580        OS << ' ';
581        Column += 1;
582      }
583      OS.write(&Str[WordStart], WordLength);
584      Column += WordLength;
585      continue;
586    }
587
588    // This word does not fit on the current line, so wrap to the next
589    // line.
590    OS << '\n';
591    OS.write(&IndentStr[0], Indentation);
592    OS.write(&Str[WordStart], WordLength);
593    Column = Indentation + WordLength;
594    Wrapped = true;
595  }
596
597  if (Length == Str.size())
598    return Wrapped; // We're done.
599
600  // There is a newline in the message, followed by something that
601  // will not be word-wrapped. Print that.
602  OS.write(&Str[Length], Str.size() - Length);
603  return true;
604}
605
606void TextDiagnosticPrinter::HandleDiagnostic(Diagnostic::Level Level,
607                                             const DiagnosticInfo &Info) {
608  // Keeps track of the the starting position of the location
609  // information (e.g., "foo.c:10:4:") that precedes the error
610  // message. We use this information to determine how long the
611  // file+line+column number prefix is.
612  uint64_t StartOfLocationInfo = OS.tell();
613
614  // If the location is specified, print out a file/line/col and include trace
615  // if enabled.
616  if (Info.getLocation().isValid()) {
617    const SourceManager &SM = Info.getLocation().getManager();
618    PresumedLoc PLoc = SM.getPresumedLoc(Info.getLocation());
619    unsigned LineNo = PLoc.getLine();
620
621    // First, if this diagnostic is not in the main file, print out the
622    // "included from" lines.
623    if (LastWarningLoc != PLoc.getIncludeLoc()) {
624      LastWarningLoc = PLoc.getIncludeLoc();
625      PrintIncludeStack(LastWarningLoc, SM);
626      StartOfLocationInfo = OS.tell();
627    }
628
629    // Compute the column number.
630    if (ShowLocation) {
631      if (UseColors)
632        OS.changeColor(savedColor, true);
633      OS << PLoc.getFilename() << ':' << LineNo << ':';
634      if (ShowColumn)
635        if (unsigned ColNo = PLoc.getColumn())
636          OS << ColNo << ':';
637
638      if (PrintRangeInfo && Info.getNumRanges()) {
639        FileID CaretFileID =
640          SM.getFileID(SM.getInstantiationLoc(Info.getLocation()));
641        bool PrintedRange = false;
642
643        for (unsigned i = 0, e = Info.getNumRanges(); i != e; ++i) {
644          // Ignore invalid ranges.
645          if (!Info.getRange(i).isValid()) continue;
646
647          SourceLocation B = Info.getRange(i).getBegin();
648          SourceLocation E = Info.getRange(i).getEnd();
649          B = SM.getInstantiationLoc(B);
650          E = SM.getInstantiationLoc(E);
651
652          // If the End location and the start location are the same and are a
653          // macro location, then the range was something that came from a macro
654          // expansion or _Pragma.  If this is an object-like macro, the best we
655          // can do is to highlight the range.  If this is a function-like
656          // macro, we'd also like to highlight the arguments.
657          if (B == E && Info.getRange(i).getEnd().isMacroID())
658            E = SM.getInstantiationRange(Info.getRange(i).getEnd()).second;
659
660          std::pair<FileID, unsigned> BInfo = SM.getDecomposedLoc(B);
661          std::pair<FileID, unsigned> EInfo = SM.getDecomposedLoc(E);
662
663          // If the start or end of the range is in another file, just discard
664          // it.
665          if (BInfo.first != CaretFileID || EInfo.first != CaretFileID)
666            continue;
667
668          // Add in the length of the token, so that we cover multi-char tokens.
669          unsigned TokSize = Lexer::MeasureTokenLength(E, SM, *LangOpts);
670
671          OS << '{' << SM.getLineNumber(BInfo.first, BInfo.second) << ':'
672             << SM.getColumnNumber(BInfo.first, BInfo.second) << '-'
673             << SM.getLineNumber(EInfo.first, EInfo.second) << ':'
674             << (SM.getColumnNumber(EInfo.first, EInfo.second)+TokSize) << '}';
675          PrintedRange = true;
676        }
677
678        if (PrintedRange)
679          OS << ':';
680      }
681      OS << ' ';
682      if (UseColors)
683        OS.resetColor();
684    }
685  }
686
687  if (UseColors) {
688    // Print diagnostic category in bold and color
689    switch (Level) {
690    case Diagnostic::Ignored: assert(0 && "Invalid diagnostic type");
691    case Diagnostic::Note:    OS.changeColor(noteColor, true); break;
692    case Diagnostic::Warning: OS.changeColor(warningColor, true); break;
693    case Diagnostic::Error:   OS.changeColor(errorColor, true); break;
694    case Diagnostic::Fatal:   OS.changeColor(fatalColor, true); break;
695    }
696  }
697
698  switch (Level) {
699  case Diagnostic::Ignored: assert(0 && "Invalid diagnostic type");
700  case Diagnostic::Note:    OS << "note: "; break;
701  case Diagnostic::Warning: OS << "warning: "; break;
702  case Diagnostic::Error:   OS << "error: "; break;
703  case Diagnostic::Fatal:   OS << "fatal error: "; break;
704  }
705
706  if (UseColors)
707    OS.resetColor();
708
709  llvm::SmallString<100> OutStr;
710  Info.FormatDiagnostic(OutStr);
711
712  if (PrintDiagnosticOption)
713    if (const char *Opt = Diagnostic::getWarningOptionForDiag(Info.getID())) {
714      OutStr += " [-W";
715      OutStr += Opt;
716      OutStr += ']';
717    }
718
719  if (UseColors) {
720    // Print warnings, errors and fatal errors in bold, no color
721    switch (Level) {
722    case Diagnostic::Warning: OS.changeColor(savedColor, true); break;
723    case Diagnostic::Error:   OS.changeColor(savedColor, true); break;
724    case Diagnostic::Fatal:   OS.changeColor(savedColor, true); break;
725    default: break; //don't bold notes
726    }
727  }
728
729  if (MessageLength) {
730    // We will be word-wrapping the error message, so compute the
731    // column number where we currently are (after printing the
732    // location information).
733    unsigned Column = OS.tell() - StartOfLocationInfo;
734    PrintWordWrapped(OS, OutStr, MessageLength, Column);
735  } else {
736    OS.write(OutStr.begin(), OutStr.size());
737  }
738  OS << '\n';
739  if (UseColors)
740    OS.resetColor();
741
742  // If caret diagnostics are enabled and we have location, we want to
743  // emit the caret.  However, we only do this if the location moved
744  // from the last diagnostic, if the last diagnostic was a note that
745  // was part of a different warning or error diagnostic, or if the
746  // diagnostic has ranges.  We don't want to emit the same caret
747  // multiple times if one loc has multiple diagnostics.
748  if (CaretDiagnostics && Info.getLocation().isValid() &&
749      ((LastLoc != Info.getLocation()) || Info.getNumRanges() ||
750       (LastCaretDiagnosticWasNote && Level != Diagnostic::Note) ||
751       Info.getNumCodeModificationHints())) {
752    // Cache the LastLoc, it allows us to omit duplicate source/caret spewage.
753    LastLoc = Info.getLocation();
754    LastCaretDiagnosticWasNote = (Level == Diagnostic::Note);
755
756    // Get the ranges into a local array we can hack on.
757    SourceRange Ranges[20];
758    unsigned NumRanges = Info.getNumRanges();
759    assert(NumRanges < 20 && "Out of space");
760    for (unsigned i = 0; i != NumRanges; ++i)
761      Ranges[i] = Info.getRange(i);
762
763    unsigned NumHints = Info.getNumCodeModificationHints();
764    for (unsigned idx = 0; idx < NumHints; ++idx) {
765      const CodeModificationHint &Hint = Info.getCodeModificationHint(idx);
766      if (Hint.RemoveRange.isValid()) {
767        assert(NumRanges < 20 && "Out of space");
768        Ranges[NumRanges++] = Hint.RemoveRange;
769      }
770    }
771
772    EmitCaretDiagnostic(LastLoc, Ranges, NumRanges, LastLoc.getManager(),
773                        Info.getCodeModificationHints(),
774                        Info.getNumCodeModificationHints(),
775                        MessageLength);
776  }
777
778  OS.flush();
779}
780