2009-06-21 05:36:54 +02:00
|
|
|
//===- SourceMgr.cpp - Manager for Simple Source Buffers & Diagnostics ----===//
|
2009-03-13 08:05:43 +01:00
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2009-06-21 05:36:54 +02:00
|
|
|
// This file implements the SourceMgr class. This class is used as a simple
|
|
|
|
// substrate for diagnostics, #include handling, and other low level things for
|
|
|
|
// simple parsers.
|
2009-03-13 08:05:43 +01:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2009-06-21 05:36:54 +02:00
|
|
|
#include "llvm/Support/SourceMgr.h"
|
2010-12-16 04:29:14 +01:00
|
|
|
#include "llvm/ADT/OwningPtr.h"
|
2013-01-10 19:50:15 +01:00
|
|
|
#include "llvm/ADT/SmallString.h"
|
2012-12-03 17:50:05 +01:00
|
|
|
#include "llvm/ADT/Twine.h"
|
2013-01-10 19:50:15 +01:00
|
|
|
#include "llvm/Support/Locale.h"
|
2012-12-03 17:50:05 +01:00
|
|
|
#include "llvm/Support/MemoryBuffer.h"
|
2009-03-13 08:05:43 +01:00
|
|
|
#include "llvm/Support/raw_ostream.h"
|
2010-12-09 18:36:48 +01:00
|
|
|
#include "llvm/Support/system_error.h"
|
2009-03-13 08:05:43 +01:00
|
|
|
using namespace llvm;
|
|
|
|
|
2013-01-10 19:50:15 +01:00
|
|
|
static const size_t TabStop = 8;
|
|
|
|
|
2009-08-11 19:49:14 +02:00
|
|
|
namespace {
|
|
|
|
struct LineNoCacheTy {
|
|
|
|
int LastQueryBufferID;
|
|
|
|
const char *LastQuery;
|
|
|
|
unsigned LineNoOfQuery;
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
|
|
|
static LineNoCacheTy *getCache(void *Ptr) {
|
|
|
|
return (LineNoCacheTy*)Ptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-06-21 05:41:50 +02:00
|
|
|
SourceMgr::~SourceMgr() {
|
2009-08-11 19:49:14 +02:00
|
|
|
// Delete the line # cache if allocated.
|
|
|
|
if (LineNoCacheTy *Cache = getCache(LineNoCache))
|
|
|
|
delete Cache;
|
2010-01-27 11:13:11 +01:00
|
|
|
|
2009-03-13 08:05:43 +01:00
|
|
|
while (!Buffers.empty()) {
|
|
|
|
delete Buffers.back().Buffer;
|
|
|
|
Buffers.pop_back();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-06-21 07:06:04 +02:00
|
|
|
/// AddIncludeFile - Search for a file with the specified name in the current
|
|
|
|
/// directory or in one of the IncludeDirs. If no file is found, this returns
|
|
|
|
/// ~0, otherwise it returns the buffer ID of the stacked file.
|
2013-07-20 02:20:10 +02:00
|
|
|
size_t SourceMgr::AddIncludeFile(const std::string &Filename,
|
|
|
|
SMLoc IncludeLoc,
|
|
|
|
std::string &IncludedFile) {
|
2010-12-16 04:29:14 +01:00
|
|
|
OwningPtr<MemoryBuffer> NewBuf;
|
2011-06-01 15:10:15 +02:00
|
|
|
IncludedFile = Filename;
|
|
|
|
MemoryBuffer::getFile(IncludedFile.c_str(), NewBuf);
|
2009-06-21 07:06:04 +02:00
|
|
|
|
|
|
|
// If the file didn't exist directly, see if it's in an include path.
|
|
|
|
for (unsigned i = 0, e = IncludeDirectories.size(); i != e && !NewBuf; ++i) {
|
2011-06-01 15:10:15 +02:00
|
|
|
IncludedFile = IncludeDirectories[i] + "/" + Filename;
|
|
|
|
MemoryBuffer::getFile(IncludedFile.c_str(), NewBuf);
|
2009-06-21 07:06:04 +02:00
|
|
|
}
|
2010-01-27 11:13:11 +01:00
|
|
|
|
2013-05-15 09:36:59 +02:00
|
|
|
if (!NewBuf) return ~0U;
|
2009-06-21 07:06:04 +02:00
|
|
|
|
2010-12-16 04:29:14 +01:00
|
|
|
return AddNewSourceBuffer(NewBuf.take(), IncludeLoc);
|
2009-06-21 07:06:04 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-03-13 08:05:43 +01:00
|
|
|
/// FindBufferContainingLoc - Return the ID of the buffer containing the
|
|
|
|
/// specified location, returning -1 if not found.
|
2009-06-21 05:41:50 +02:00
|
|
|
int SourceMgr::FindBufferContainingLoc(SMLoc Loc) const {
|
2009-03-13 08:05:43 +01:00
|
|
|
for (unsigned i = 0, e = Buffers.size(); i != e; ++i)
|
2009-03-13 17:01:53 +01:00
|
|
|
if (Loc.getPointer() >= Buffers[i].Buffer->getBufferStart() &&
|
2009-03-18 21:36:45 +01:00
|
|
|
// Use <= here so that a pointer to the null at the end of the buffer
|
|
|
|
// is included as part of the buffer.
|
|
|
|
Loc.getPointer() <= Buffers[i].Buffer->getBufferEnd())
|
2009-03-13 08:05:43 +01:00
|
|
|
return i;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2012-05-06 00:17:32 +02:00
|
|
|
/// getLineAndColumn - Find the line and column number for the specified
|
|
|
|
/// location in the specified file. This is not a fast method.
|
|
|
|
std::pair<unsigned, unsigned>
|
|
|
|
SourceMgr::getLineAndColumn(SMLoc Loc, int BufferID) const {
|
2009-03-13 08:05:43 +01:00
|
|
|
if (BufferID == -1) BufferID = FindBufferContainingLoc(Loc);
|
|
|
|
assert(BufferID != -1 && "Invalid Location!");
|
2010-01-27 11:13:11 +01:00
|
|
|
|
2009-03-13 08:05:43 +01:00
|
|
|
MemoryBuffer *Buff = getBufferInfo(BufferID).Buffer;
|
2010-01-27 11:13:11 +01:00
|
|
|
|
2009-03-13 08:05:43 +01:00
|
|
|
// Count the number of \n's between the start of the file and the specified
|
|
|
|
// location.
|
|
|
|
unsigned LineNo = 1;
|
2010-01-27 11:13:11 +01:00
|
|
|
|
2012-05-06 00:17:32 +02:00
|
|
|
const char *BufStart = Buff->getBufferStart();
|
|
|
|
const char *Ptr = BufStart;
|
2009-03-13 08:05:43 +01:00
|
|
|
|
2009-08-11 19:49:14 +02:00
|
|
|
// If we have a line number cache, and if the query is to a later point in the
|
|
|
|
// same file, start searching from the last query location. This optimizes
|
|
|
|
// for the case when multiple diagnostics come out of one file in order.
|
|
|
|
if (LineNoCacheTy *Cache = getCache(LineNoCache))
|
2010-01-27 11:13:11 +01:00
|
|
|
if (Cache->LastQueryBufferID == BufferID &&
|
2009-08-11 19:49:14 +02:00
|
|
|
Cache->LastQuery <= Loc.getPointer()) {
|
|
|
|
Ptr = Cache->LastQuery;
|
|
|
|
LineNo = Cache->LineNoOfQuery;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Scan for the location being queried, keeping track of the number of lines
|
|
|
|
// we see.
|
2009-06-21 05:39:35 +02:00
|
|
|
for (; SMLoc::getFromPointer(Ptr) != Loc; ++Ptr)
|
2009-03-13 08:05:43 +01:00
|
|
|
if (*Ptr == '\n') ++LineNo;
|
2010-01-27 11:13:11 +01:00
|
|
|
|
2009-08-11 19:49:14 +02:00
|
|
|
// Allocate the line number cache if it doesn't exist.
|
|
|
|
if (LineNoCache == 0)
|
|
|
|
LineNoCache = new LineNoCacheTy();
|
2010-01-27 11:13:11 +01:00
|
|
|
|
2009-08-11 19:49:14 +02:00
|
|
|
// Update the line # cache.
|
|
|
|
LineNoCacheTy &Cache = *getCache(LineNoCache);
|
|
|
|
Cache.LastQueryBufferID = BufferID;
|
|
|
|
Cache.LastQuery = Ptr;
|
|
|
|
Cache.LineNoOfQuery = LineNo;
|
2012-05-06 00:17:32 +02:00
|
|
|
|
|
|
|
size_t NewlineOffs = StringRef(BufStart, Ptr-BufStart).find_last_of("\n\r");
|
2012-05-07 20:12:42 +02:00
|
|
|
if (NewlineOffs == StringRef::npos) NewlineOffs = ~(size_t)0;
|
2012-05-06 00:17:32 +02:00
|
|
|
return std::make_pair(LineNo, Ptr-BufStart-NewlineOffs);
|
2009-03-13 08:05:43 +01:00
|
|
|
}
|
|
|
|
|
2009-07-03 00:24:20 +02:00
|
|
|
void SourceMgr::PrintIncludeStack(SMLoc IncludeLoc, raw_ostream &OS) const {
|
2009-06-21 05:39:35 +02:00
|
|
|
if (IncludeLoc == SMLoc()) return; // Top of stack.
|
2010-01-27 11:13:11 +01:00
|
|
|
|
2009-03-13 08:05:43 +01:00
|
|
|
int CurBuf = FindBufferContainingLoc(IncludeLoc);
|
|
|
|
assert(CurBuf != -1 && "Invalid or unspecified location!");
|
|
|
|
|
2009-07-03 00:24:20 +02:00
|
|
|
PrintIncludeStack(getBufferInfo(CurBuf).IncludeLoc, OS);
|
2010-01-27 11:13:11 +01:00
|
|
|
|
2009-07-03 00:24:20 +02:00
|
|
|
OS << "Included from "
|
|
|
|
<< getBufferInfo(CurBuf).Buffer->getBufferIdentifier()
|
|
|
|
<< ":" << FindLineNumber(IncludeLoc, CurBuf) << ":\n";
|
2009-03-13 08:05:43 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-07-03 01:08:13 +02:00
|
|
|
/// GetMessage - Return an SMDiagnostic at the specified location with the
|
|
|
|
/// specified string.
|
|
|
|
///
|
|
|
|
/// @param Type - If non-null, the kind of message (e.g., "error") which is
|
|
|
|
/// prefixed to the message.
|
2011-10-16 07:43:57 +02:00
|
|
|
SMDiagnostic SourceMgr::GetMessage(SMLoc Loc, SourceMgr::DiagKind Kind,
|
2011-10-16 07:47:55 +02:00
|
|
|
const Twine &Msg,
|
2013-01-10 19:50:15 +01:00
|
|
|
ArrayRef<SMRange> Ranges,
|
|
|
|
ArrayRef<SMFixIt> FixIts) const {
|
2010-01-27 11:13:11 +01:00
|
|
|
|
2009-03-13 08:05:43 +01:00
|
|
|
// First thing to do: find the current buffer containing the specified
|
2012-05-06 18:20:49 +02:00
|
|
|
// location to pull out the source line.
|
2011-10-16 06:47:35 +02:00
|
|
|
SmallVector<std::pair<unsigned, unsigned>, 4> ColRanges;
|
2012-05-06 18:20:49 +02:00
|
|
|
std::pair<unsigned, unsigned> LineAndCol;
|
|
|
|
const char *BufferID = "<unknown>";
|
|
|
|
std::string LineStr;
|
|
|
|
|
|
|
|
if (Loc.isValid()) {
|
|
|
|
int CurBuf = FindBufferContainingLoc(Loc);
|
|
|
|
assert(CurBuf != -1 && "Invalid or unspecified location!");
|
|
|
|
|
|
|
|
MemoryBuffer *CurMB = getBufferInfo(CurBuf).Buffer;
|
|
|
|
BufferID = CurMB->getBufferIdentifier();
|
2011-10-16 06:47:35 +02:00
|
|
|
|
2012-05-06 18:20:49 +02:00
|
|
|
// Scan backward to find the start of the line.
|
|
|
|
const char *LineStart = Loc.getPointer();
|
|
|
|
const char *BufStart = CurMB->getBufferStart();
|
|
|
|
while (LineStart != BufStart && LineStart[-1] != '\n' &&
|
|
|
|
LineStart[-1] != '\r')
|
|
|
|
--LineStart;
|
|
|
|
|
|
|
|
// Get the end of the line.
|
|
|
|
const char *LineEnd = Loc.getPointer();
|
|
|
|
const char *BufEnd = CurMB->getBufferEnd();
|
|
|
|
while (LineEnd != BufEnd && LineEnd[0] != '\n' && LineEnd[0] != '\r')
|
|
|
|
++LineEnd;
|
|
|
|
LineStr = std::string(LineStart, LineEnd);
|
|
|
|
|
|
|
|
// Convert any ranges to column ranges that only intersect the line of the
|
|
|
|
// location.
|
|
|
|
for (unsigned i = 0, e = Ranges.size(); i != e; ++i) {
|
|
|
|
SMRange R = Ranges[i];
|
|
|
|
if (!R.isValid()) continue;
|
|
|
|
|
|
|
|
// If the line doesn't contain any part of the range, then ignore it.
|
|
|
|
if (R.Start.getPointer() > LineEnd || R.End.getPointer() < LineStart)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
// Ignore pieces of the range that go onto other lines.
|
|
|
|
if (R.Start.getPointer() < LineStart)
|
|
|
|
R.Start = SMLoc::getFromPointer(LineStart);
|
|
|
|
if (R.End.getPointer() > LineEnd)
|
|
|
|
R.End = SMLoc::getFromPointer(LineEnd);
|
|
|
|
|
|
|
|
// Translate from SMLoc ranges to column ranges.
|
2013-01-10 19:50:15 +01:00
|
|
|
// FIXME: Handle multibyte characters.
|
2012-05-06 18:20:49 +02:00
|
|
|
ColRanges.push_back(std::make_pair(R.Start.getPointer()-LineStart,
|
|
|
|
R.End.getPointer()-LineStart));
|
|
|
|
}
|
|
|
|
|
|
|
|
LineAndCol = getLineAndColumn(Loc, CurBuf);
|
2011-10-16 06:47:35 +02:00
|
|
|
}
|
2012-05-06 18:20:49 +02:00
|
|
|
|
|
|
|
return SMDiagnostic(*this, Loc, BufferID, LineAndCol.first,
|
2012-05-06 00:17:32 +02:00
|
|
|
LineAndCol.second-1, Kind, Msg.str(),
|
2013-01-10 19:50:15 +01:00
|
|
|
LineStr, ColRanges, FixIts);
|
2009-07-03 01:08:13 +02:00
|
|
|
}
|
|
|
|
|
2013-09-27 23:09:25 +02:00
|
|
|
void SourceMgr::PrintMessage(raw_ostream &OS, SMLoc Loc,
|
|
|
|
SourceMgr::DiagKind Kind,
|
2012-04-18 21:04:15 +02:00
|
|
|
const Twine &Msg, ArrayRef<SMRange> Ranges,
|
2013-01-10 19:50:15 +01:00
|
|
|
ArrayRef<SMFixIt> FixIts, bool ShowColors) const {
|
|
|
|
SMDiagnostic Diagnostic = GetMessage(Loc, Kind, Msg, Ranges, FixIts);
|
2011-10-16 07:43:57 +02:00
|
|
|
|
2010-04-06 02:26:48 +02:00
|
|
|
// Report the message with the diagnostic handler if present.
|
|
|
|
if (DiagHandler) {
|
2011-10-16 07:43:57 +02:00
|
|
|
DiagHandler(Diagnostic, DiagContext);
|
2010-04-06 02:26:48 +02:00
|
|
|
return;
|
|
|
|
}
|
2010-12-09 18:37:32 +01:00
|
|
|
|
2012-05-06 18:20:49 +02:00
|
|
|
if (Loc != SMLoc()) {
|
|
|
|
int CurBuf = FindBufferContainingLoc(Loc);
|
|
|
|
assert(CurBuf != -1 && "Invalid or unspecified location!");
|
|
|
|
PrintIncludeStack(getBufferInfo(CurBuf).IncludeLoc, OS);
|
|
|
|
}
|
2009-07-03 01:08:13 +02:00
|
|
|
|
2012-04-18 21:04:15 +02:00
|
|
|
Diagnostic.print(0, OS, ShowColors);
|
2009-03-13 08:05:43 +01:00
|
|
|
}
|
2009-07-03 00:24:20 +02:00
|
|
|
|
2013-09-27 23:09:25 +02:00
|
|
|
void SourceMgr::PrintMessage(SMLoc Loc, SourceMgr::DiagKind Kind,
|
|
|
|
const Twine &Msg, ArrayRef<SMRange> Ranges,
|
|
|
|
ArrayRef<SMFixIt> FixIts, bool ShowColors) const {
|
|
|
|
PrintMessage(llvm::errs(), Loc, Kind, Msg, Ranges, FixIts, ShowColors);
|
|
|
|
}
|
|
|
|
|
2009-07-03 00:24:20 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// SMDiagnostic Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2013-01-10 19:50:15 +01:00
|
|
|
SMDiagnostic::SMDiagnostic(const SourceMgr &sm, SMLoc L, StringRef FN,
|
2011-10-16 07:43:57 +02:00
|
|
|
int Line, int Col, SourceMgr::DiagKind Kind,
|
2013-01-10 19:50:15 +01:00
|
|
|
StringRef Msg, StringRef LineStr,
|
|
|
|
ArrayRef<std::pair<unsigned,unsigned> > Ranges,
|
|
|
|
ArrayRef<SMFixIt> Hints)
|
2011-10-16 07:43:57 +02:00
|
|
|
: SM(&sm), Loc(L), Filename(FN), LineNo(Line), ColumnNo(Col), Kind(Kind),
|
2013-01-10 19:50:15 +01:00
|
|
|
Message(Msg), LineContents(LineStr), Ranges(Ranges.vec()),
|
|
|
|
FixIts(Hints.begin(), Hints.end()) {
|
|
|
|
std::sort(FixIts.begin(), FixIts.end());
|
|
|
|
}
|
|
|
|
|
2013-02-15 13:30:38 +01:00
|
|
|
static void buildFixItLine(std::string &CaretLine, std::string &FixItLine,
|
|
|
|
ArrayRef<SMFixIt> FixIts, ArrayRef<char> SourceLine){
|
2013-01-10 19:50:15 +01:00
|
|
|
if (FixIts.empty())
|
|
|
|
return;
|
|
|
|
|
|
|
|
const char *LineStart = SourceLine.begin();
|
|
|
|
const char *LineEnd = SourceLine.end();
|
|
|
|
|
|
|
|
size_t PrevHintEndCol = 0;
|
|
|
|
|
|
|
|
for (ArrayRef<SMFixIt>::iterator I = FixIts.begin(), E = FixIts.end();
|
|
|
|
I != E; ++I) {
|
|
|
|
// If the fixit contains a newline or tab, ignore it.
|
|
|
|
if (I->getText().find_first_of("\n\r\t") != StringRef::npos)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
SMRange R = I->getRange();
|
|
|
|
|
|
|
|
// If the line doesn't contain any part of the range, then ignore it.
|
|
|
|
if (R.Start.getPointer() > LineEnd || R.End.getPointer() < LineStart)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
// Translate from SMLoc to column.
|
|
|
|
// Ignore pieces of the range that go onto other lines.
|
|
|
|
// FIXME: Handle multibyte characters in the source line.
|
|
|
|
unsigned FirstCol;
|
|
|
|
if (R.Start.getPointer() < LineStart)
|
|
|
|
FirstCol = 0;
|
|
|
|
else
|
|
|
|
FirstCol = R.Start.getPointer() - LineStart;
|
|
|
|
|
|
|
|
// If we inserted a long previous hint, push this one forwards, and add
|
|
|
|
// an extra space to show that this is not part of the previous
|
|
|
|
// completion. This is sort of the best we can do when two hints appear
|
|
|
|
// to overlap.
|
|
|
|
//
|
|
|
|
// Note that if this hint is located immediately after the previous
|
|
|
|
// hint, no space will be added, since the location is more important.
|
|
|
|
unsigned HintCol = FirstCol;
|
|
|
|
if (HintCol < PrevHintEndCol)
|
|
|
|
HintCol = PrevHintEndCol + 1;
|
|
|
|
|
|
|
|
// FIXME: This assertion is intended to catch unintended use of multibyte
|
|
|
|
// characters in fixits. If we decide to do this, we'll have to track
|
|
|
|
// separate byte widths for the source and fixit lines.
|
|
|
|
assert((size_t)llvm::sys::locale::columnWidth(I->getText()) ==
|
|
|
|
I->getText().size());
|
|
|
|
|
|
|
|
// This relies on one byte per column in our fixit hints.
|
|
|
|
unsigned LastColumnModified = HintCol + I->getText().size();
|
|
|
|
if (LastColumnModified > FixItLine.size())
|
|
|
|
FixItLine.resize(LastColumnModified, ' ');
|
|
|
|
|
|
|
|
std::copy(I->getText().begin(), I->getText().end(),
|
|
|
|
FixItLine.begin() + HintCol);
|
|
|
|
|
|
|
|
PrevHintEndCol = LastColumnModified;
|
|
|
|
|
|
|
|
// For replacements, mark the removal range with '~'.
|
|
|
|
// FIXME: Handle multibyte characters in the source line.
|
|
|
|
unsigned LastCol;
|
|
|
|
if (R.End.getPointer() >= LineEnd)
|
|
|
|
LastCol = LineEnd - LineStart;
|
|
|
|
else
|
|
|
|
LastCol = R.End.getPointer() - LineStart;
|
|
|
|
|
|
|
|
std::fill(&CaretLine[FirstCol], &CaretLine[LastCol], '~');
|
|
|
|
}
|
2011-10-16 07:43:57 +02:00
|
|
|
}
|
2011-10-16 06:47:35 +02:00
|
|
|
|
2013-01-10 19:50:15 +01:00
|
|
|
static void printSourceLine(raw_ostream &S, StringRef LineContents) {
|
|
|
|
// Print out the source line one character at a time, so we can expand tabs.
|
|
|
|
for (unsigned i = 0, e = LineContents.size(), OutCol = 0; i != e; ++i) {
|
|
|
|
if (LineContents[i] != '\t') {
|
|
|
|
S << LineContents[i];
|
|
|
|
++OutCol;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// If we have a tab, emit at least one space, then round up to 8 columns.
|
|
|
|
do {
|
|
|
|
S << ' ';
|
|
|
|
++OutCol;
|
|
|
|
} while ((OutCol % TabStop) != 0);
|
|
|
|
}
|
|
|
|
S << '\n';
|
|
|
|
}
|
2011-10-16 06:47:35 +02:00
|
|
|
|
2013-01-11 03:37:55 +01:00
|
|
|
static bool isNonASCII(char c) {
|
|
|
|
return c & 0x80;
|
|
|
|
}
|
|
|
|
|
2012-04-18 21:04:15 +02:00
|
|
|
void SMDiagnostic::print(const char *ProgName, raw_ostream &S,
|
|
|
|
bool ShowColors) const {
|
2012-07-20 20:29:44 +02:00
|
|
|
// Display colors only if OS supports colors.
|
|
|
|
ShowColors &= S.has_colors();
|
2012-04-18 21:04:15 +02:00
|
|
|
|
|
|
|
if (ShowColors)
|
|
|
|
S.changeColor(raw_ostream::SAVEDCOLOR, true);
|
|
|
|
|
2009-07-03 00:24:20 +02:00
|
|
|
if (ProgName && ProgName[0])
|
|
|
|
S << ProgName << ": ";
|
|
|
|
|
2010-01-21 11:13:27 +01:00
|
|
|
if (!Filename.empty()) {
|
|
|
|
if (Filename == "-")
|
|
|
|
S << "<stdin>";
|
|
|
|
else
|
|
|
|
S << Filename;
|
2010-01-27 11:13:11 +01:00
|
|
|
|
2010-01-21 11:13:27 +01:00
|
|
|
if (LineNo != -1) {
|
|
|
|
S << ':' << LineNo;
|
|
|
|
if (ColumnNo != -1)
|
|
|
|
S << ':' << (ColumnNo+1);
|
|
|
|
}
|
|
|
|
S << ": ";
|
2009-07-03 00:24:20 +02:00
|
|
|
}
|
2010-01-27 11:13:11 +01:00
|
|
|
|
2011-10-16 07:43:57 +02:00
|
|
|
switch (Kind) {
|
2012-04-18 21:04:15 +02:00
|
|
|
case SourceMgr::DK_Error:
|
|
|
|
if (ShowColors)
|
|
|
|
S.changeColor(raw_ostream::RED, true);
|
|
|
|
S << "error: ";
|
|
|
|
break;
|
|
|
|
case SourceMgr::DK_Warning:
|
|
|
|
if (ShowColors)
|
|
|
|
S.changeColor(raw_ostream::MAGENTA, true);
|
|
|
|
S << "warning: ";
|
|
|
|
break;
|
|
|
|
case SourceMgr::DK_Note:
|
|
|
|
if (ShowColors)
|
|
|
|
S.changeColor(raw_ostream::BLACK, true);
|
|
|
|
S << "note: ";
|
|
|
|
break;
|
2011-10-16 07:43:57 +02:00
|
|
|
}
|
2012-04-18 21:04:15 +02:00
|
|
|
|
|
|
|
if (ShowColors) {
|
|
|
|
S.resetColor();
|
|
|
|
S.changeColor(raw_ostream::SAVEDCOLOR, true);
|
|
|
|
}
|
|
|
|
|
2010-01-21 11:13:27 +01:00
|
|
|
S << Message << '\n';
|
2009-11-22 23:08:00 +01:00
|
|
|
|
2012-04-18 21:04:15 +02:00
|
|
|
if (ShowColors)
|
|
|
|
S.resetColor();
|
|
|
|
|
2011-10-16 07:47:55 +02:00
|
|
|
if (LineNo == -1 || ColumnNo == -1)
|
2011-10-16 06:47:35 +02:00
|
|
|
return;
|
2010-01-27 11:13:11 +01:00
|
|
|
|
2013-01-11 03:37:55 +01:00
|
|
|
// FIXME: If there are multibyte or multi-column characters in the source, all
|
|
|
|
// our ranges will be wrong. To do this properly, we'll need a byte-to-column
|
|
|
|
// map like Clang's TextDiagnostic. For now, we'll just handle tabs by
|
|
|
|
// expanding them later, and bail out rather than show incorrect ranges and
|
|
|
|
// misaligned fixits for any other odd characters.
|
|
|
|
if (std::find_if(LineContents.begin(), LineContents.end(), isNonASCII) !=
|
|
|
|
LineContents.end()) {
|
2013-01-10 19:50:15 +01:00
|
|
|
printSourceLine(S, LineContents);
|
|
|
|
return;
|
|
|
|
}
|
2013-01-11 03:37:55 +01:00
|
|
|
size_t NumColumns = LineContents.size();
|
2013-01-10 19:50:15 +01:00
|
|
|
|
2011-10-16 06:47:35 +02:00
|
|
|
// Build the line with the caret and ranges.
|
2013-01-10 19:50:15 +01:00
|
|
|
std::string CaretLine(NumColumns+1, ' ');
|
2011-10-16 06:47:35 +02:00
|
|
|
|
|
|
|
// Expand any ranges.
|
|
|
|
for (unsigned r = 0, e = Ranges.size(); r != e; ++r) {
|
|
|
|
std::pair<unsigned, unsigned> R = Ranges[r];
|
2013-01-10 19:50:15 +01:00
|
|
|
std::fill(&CaretLine[R.first],
|
|
|
|
&CaretLine[std::min((size_t)R.second, CaretLine.size())],
|
|
|
|
'~');
|
2011-10-16 06:47:35 +02:00
|
|
|
}
|
2013-01-10 19:50:15 +01:00
|
|
|
|
|
|
|
// Add any fix-its.
|
|
|
|
// FIXME: Find the beginning of the line properly for multibyte characters.
|
|
|
|
std::string FixItInsertionLine;
|
|
|
|
buildFixItLine(CaretLine, FixItInsertionLine, FixIts,
|
|
|
|
makeArrayRef(Loc.getPointer() - ColumnNo,
|
|
|
|
LineContents.size()));
|
|
|
|
|
2011-10-16 06:47:35 +02:00
|
|
|
// Finally, plop on the caret.
|
2013-01-10 19:50:15 +01:00
|
|
|
if (unsigned(ColumnNo) <= NumColumns)
|
2011-10-16 06:47:35 +02:00
|
|
|
CaretLine[ColumnNo] = '^';
|
|
|
|
else
|
2013-01-10 19:50:15 +01:00
|
|
|
CaretLine[NumColumns] = '^';
|
2011-10-16 06:47:35 +02:00
|
|
|
|
|
|
|
// ... and remove trailing whitespace so the output doesn't wrap for it. We
|
|
|
|
// know that the line isn't completely empty because it has the caret in it at
|
|
|
|
// least.
|
|
|
|
CaretLine.erase(CaretLine.find_last_not_of(' ')+1);
|
|
|
|
|
2013-01-10 19:50:15 +01:00
|
|
|
printSourceLine(S, LineContents);
|
2011-10-16 06:47:35 +02:00
|
|
|
|
2012-04-18 21:04:15 +02:00
|
|
|
if (ShowColors)
|
|
|
|
S.changeColor(raw_ostream::GREEN, true);
|
|
|
|
|
2011-10-16 06:47:35 +02:00
|
|
|
// Print out the caret line, matching tabs in the source line.
|
|
|
|
for (unsigned i = 0, e = CaretLine.size(), OutCol = 0; i != e; ++i) {
|
|
|
|
if (i >= LineContents.size() || LineContents[i] != '\t') {
|
|
|
|
S << CaretLine[i];
|
|
|
|
++OutCol;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Okay, we have a tab. Insert the appropriate number of characters.
|
|
|
|
do {
|
|
|
|
S << CaretLine[i];
|
|
|
|
++OutCol;
|
2013-01-10 19:50:15 +01:00
|
|
|
} while ((OutCol % TabStop) != 0);
|
2009-07-03 00:24:20 +02:00
|
|
|
}
|
2013-01-10 19:50:15 +01:00
|
|
|
S << '\n';
|
2012-04-18 21:04:15 +02:00
|
|
|
|
|
|
|
if (ShowColors)
|
|
|
|
S.resetColor();
|
2013-01-10 19:50:15 +01:00
|
|
|
|
|
|
|
// Print out the replacement line, matching tabs in the source line.
|
|
|
|
if (FixItInsertionLine.empty())
|
|
|
|
return;
|
2011-10-16 06:47:35 +02:00
|
|
|
|
2013-09-27 23:24:36 +02:00
|
|
|
for (size_t i = 0, e = FixItInsertionLine.size(), OutCol = 0; i < e; ++i) {
|
2013-01-10 19:50:15 +01:00
|
|
|
if (i >= LineContents.size() || LineContents[i] != '\t') {
|
|
|
|
S << FixItInsertionLine[i];
|
|
|
|
++OutCol;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Okay, we have a tab. Insert the appropriate number of characters.
|
|
|
|
do {
|
|
|
|
S << FixItInsertionLine[i];
|
|
|
|
// FIXME: This is trying not to break up replacements, but then to re-sync
|
|
|
|
// with the tabs between replacements. This will fail, though, if two
|
|
|
|
// fix-it replacements are exactly adjacent, or if a fix-it contains a
|
|
|
|
// space. Really we should be precomputing column widths, which we'll
|
|
|
|
// need anyway for multibyte chars.
|
|
|
|
if (FixItInsertionLine[i] != ' ')
|
|
|
|
++i;
|
|
|
|
++OutCol;
|
|
|
|
} while (((OutCol % TabStop) != 0) && i != e);
|
|
|
|
}
|
2011-10-16 06:47:35 +02:00
|
|
|
S << '\n';
|
2009-07-03 00:24:20 +02:00
|
|
|
}
|