2006-06-18 13:43:12 +08:00
|
|
|
//===--- Diagnostic.cpp - C Language Family Diagnostic Handling -----------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-30 03:59:25 +08:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2006-06-18 13:43:12 +08:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file implements the Diagnostic-related interfaces.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2010-04-13 03:54:17 +08:00
|
|
|
#include "clang/Basic/Diagnostic.h"
|
2008-11-19 15:32:16 +08:00
|
|
|
#include "clang/Basic/IdentifierTable.h"
|
2010-04-13 03:54:17 +08:00
|
|
|
#include "clang/Basic/PartialDiagnostic.h"
|
2008-11-19 14:51:40 +08:00
|
|
|
#include "llvm/ADT/SmallVector.h"
|
2009-10-18 02:12:14 +08:00
|
|
|
#include "llvm/Support/raw_ostream.h"
|
2011-03-22 02:40:07 +08:00
|
|
|
#include "llvm/Support/CrashRecoveryContext.h"
|
|
|
|
|
2006-06-18 13:43:12 +08:00
|
|
|
using namespace clang;
|
|
|
|
|
2011-09-26 07:23:43 +08:00
|
|
|
static void DummyArgToStringFn(DiagnosticsEngine::ArgumentKind AK, intptr_t QT,
|
2008-11-23 17:21:17 +08:00
|
|
|
const char *Modifier, unsigned ML,
|
|
|
|
const char *Argument, unsigned ArgLen,
|
2011-09-26 07:23:43 +08:00
|
|
|
const DiagnosticsEngine::ArgumentValue *PrevArgs,
|
2009-10-20 13:25:22 +08:00
|
|
|
unsigned NumPrevArgs,
|
2011-07-23 18:55:15 +08:00
|
|
|
SmallVectorImpl<char> &Output,
|
2011-07-12 01:49:21 +08:00
|
|
|
void *Cookie,
|
2011-07-23 18:55:15 +08:00
|
|
|
SmallVectorImpl<intptr_t> &QualTypeVals) {
|
2008-11-23 17:21:17 +08:00
|
|
|
const char *Str = "<can't format argument>";
|
2008-11-23 17:13:29 +08:00
|
|
|
Output.append(Str, Str+strlen(Str));
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-09-26 07:23:43 +08:00
|
|
|
DiagnosticsEngine::DiagnosticsEngine(
|
|
|
|
const llvm::IntrusiveRefCntPtr<DiagnosticIDs> &diags,
|
2011-09-26 07:39:51 +08:00
|
|
|
DiagnosticConsumer *client, bool ShouldOwnClient)
|
2010-11-19 04:06:41 +08:00
|
|
|
: Diags(diags), Client(client), OwnsDiagClient(ShouldOwnClient),
|
|
|
|
SourceMgr(0) {
|
2008-11-23 17:21:17 +08:00
|
|
|
ArgToStringFn = DummyArgToStringFn;
|
2009-02-20 07:53:20 +08:00
|
|
|
ArgToStringCookie = 0;
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2010-07-31 08:40:00 +08:00
|
|
|
AllExtensionsSilenced = 0;
|
|
|
|
IgnoreAllWarnings = false;
|
|
|
|
WarningsAsErrors = false;
|
2011-08-18 09:12:56 +08:00
|
|
|
EnableAllWarnings = false;
|
2010-07-31 08:40:00 +08:00
|
|
|
ErrorsAsFatal = false;
|
|
|
|
SuppressSystemWarnings = false;
|
|
|
|
SuppressAllDiagnostics = false;
|
|
|
|
ShowOverloads = Ovl_All;
|
|
|
|
ExtBehavior = Ext_Ignore;
|
|
|
|
|
|
|
|
ErrorLimit = 0;
|
|
|
|
TemplateBacktraceLimit = 0;
|
|
|
|
|
2010-07-20 05:46:24 +08:00
|
|
|
Reset();
|
2007-12-02 09:09:57 +08:00
|
|
|
}
|
|
|
|
|
2011-09-26 07:23:43 +08:00
|
|
|
DiagnosticsEngine::~DiagnosticsEngine() {
|
2010-11-19 04:06:41 +08:00
|
|
|
if (OwnsDiagClient)
|
|
|
|
delete Client;
|
2007-12-02 09:09:57 +08:00
|
|
|
}
|
|
|
|
|
2011-09-26 07:39:51 +08:00
|
|
|
void DiagnosticsEngine::setClient(DiagnosticConsumer *client,
|
2011-09-26 07:23:43 +08:00
|
|
|
bool ShouldOwnClient) {
|
2011-02-01 06:04:05 +08:00
|
|
|
if (OwnsDiagClient && Client)
|
|
|
|
delete Client;
|
|
|
|
|
|
|
|
Client = client;
|
|
|
|
OwnsDiagClient = ShouldOwnClient;
|
|
|
|
}
|
2009-07-13 05:18:45 +08:00
|
|
|
|
2011-09-26 07:23:43 +08:00
|
|
|
void DiagnosticsEngine::pushMappings(SourceLocation Loc) {
|
2010-12-16 02:44:22 +08:00
|
|
|
DiagStateOnPushStack.push_back(GetCurDiagState());
|
2009-07-13 05:18:45 +08:00
|
|
|
}
|
|
|
|
|
2011-09-26 07:23:43 +08:00
|
|
|
bool DiagnosticsEngine::popMappings(SourceLocation Loc) {
|
2010-12-16 02:44:22 +08:00
|
|
|
if (DiagStateOnPushStack.empty())
|
2009-07-13 05:18:45 +08:00
|
|
|
return false;
|
|
|
|
|
2010-12-16 02:44:22 +08:00
|
|
|
if (DiagStateOnPushStack.back() != GetCurDiagState()) {
|
|
|
|
// State changed at some point between push/pop.
|
|
|
|
PushDiagStatePoint(DiagStateOnPushStack.back(), Loc);
|
|
|
|
}
|
|
|
|
DiagStateOnPushStack.pop_back();
|
2009-07-13 05:18:45 +08:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2011-09-26 07:23:43 +08:00
|
|
|
void DiagnosticsEngine::Reset() {
|
2010-07-20 05:46:24 +08:00
|
|
|
ErrorOccurred = false;
|
|
|
|
FatalErrorOccurred = false;
|
2011-07-07 01:40:26 +08:00
|
|
|
UnrecoverableErrorOccurred = false;
|
2010-07-20 05:46:24 +08:00
|
|
|
|
|
|
|
NumWarnings = 0;
|
|
|
|
NumErrors = 0;
|
|
|
|
NumErrorsSuppressed = 0;
|
2011-07-29 09:25:44 +08:00
|
|
|
TrapNumErrorsOccurred = 0;
|
|
|
|
TrapNumUnrecoverableErrorsOccurred = 0;
|
2011-07-07 01:40:26 +08:00
|
|
|
|
2010-07-20 05:46:24 +08:00
|
|
|
CurDiagID = ~0U;
|
2010-11-19 04:06:41 +08:00
|
|
|
// Set LastDiagLevel to an "unset" state. If we set it to 'Ignored', notes
|
2011-09-26 07:23:43 +08:00
|
|
|
// using a DiagnosticsEngine associated to a translation unit that follow
|
|
|
|
// diagnostics from a DiagnosticsEngine associated to anoter t.u. will not be
|
2010-11-19 04:06:41 +08:00
|
|
|
// displayed.
|
|
|
|
LastDiagLevel = (DiagnosticIDs::Level)-1;
|
2010-07-20 05:46:24 +08:00
|
|
|
DelayedDiagID = 0;
|
2011-03-27 02:58:17 +08:00
|
|
|
|
|
|
|
// Clear state related to #pragma diagnostic.
|
|
|
|
DiagStates.clear();
|
|
|
|
DiagStatePoints.clear();
|
|
|
|
DiagStateOnPushStack.clear();
|
|
|
|
|
|
|
|
// Create a DiagState and DiagStatePoint representing diagnostic changes
|
|
|
|
// through command-line.
|
|
|
|
DiagStates.push_back(DiagState());
|
|
|
|
PushDiagStatePoint(&DiagStates.back(), SourceLocation());
|
2010-07-20 05:46:24 +08:00
|
|
|
}
|
2006-06-18 13:43:12 +08:00
|
|
|
|
2011-09-26 07:23:43 +08:00
|
|
|
void DiagnosticsEngine::SetDelayedDiagnostic(unsigned DiagID, StringRef Arg1,
|
2011-07-23 18:55:15 +08:00
|
|
|
StringRef Arg2) {
|
2010-03-22 23:10:57 +08:00
|
|
|
if (DelayedDiagID)
|
|
|
|
return;
|
|
|
|
|
|
|
|
DelayedDiagID = DiagID;
|
2010-03-22 23:47:45 +08:00
|
|
|
DelayedDiagArg1 = Arg1.str();
|
|
|
|
DelayedDiagArg2 = Arg2.str();
|
2010-03-22 23:10:57 +08:00
|
|
|
}
|
|
|
|
|
2011-09-26 07:23:43 +08:00
|
|
|
void DiagnosticsEngine::ReportDelayed() {
|
2010-03-22 23:10:57 +08:00
|
|
|
Report(DelayedDiagID) << DelayedDiagArg1 << DelayedDiagArg2;
|
|
|
|
DelayedDiagID = 0;
|
|
|
|
DelayedDiagArg1.clear();
|
|
|
|
DelayedDiagArg2.clear();
|
|
|
|
}
|
|
|
|
|
2011-09-26 07:23:43 +08:00
|
|
|
DiagnosticsEngine::DiagStatePointsTy::iterator
|
|
|
|
DiagnosticsEngine::GetDiagStatePointForLoc(SourceLocation L) const {
|
2010-12-16 02:44:22 +08:00
|
|
|
assert(!DiagStatePoints.empty());
|
|
|
|
assert(DiagStatePoints.front().Loc.isInvalid() &&
|
|
|
|
"Should have created a DiagStatePoint for command-line");
|
|
|
|
|
|
|
|
FullSourceLoc Loc(L, *SourceMgr);
|
|
|
|
if (Loc.isInvalid())
|
|
|
|
return DiagStatePoints.end() - 1;
|
|
|
|
|
|
|
|
DiagStatePointsTy::iterator Pos = DiagStatePoints.end();
|
|
|
|
FullSourceLoc LastStateChangePos = DiagStatePoints.back().Loc;
|
|
|
|
if (LastStateChangePos.isValid() &&
|
|
|
|
Loc.isBeforeInTranslationUnitThan(LastStateChangePos))
|
|
|
|
Pos = std::upper_bound(DiagStatePoints.begin(), DiagStatePoints.end(),
|
|
|
|
DiagStatePoint(0, Loc));
|
|
|
|
--Pos;
|
|
|
|
return Pos;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// \brief This allows the client to specify that certain
|
|
|
|
/// warnings are ignored. Notes can never be mapped, errors can only be
|
|
|
|
/// mapped to fatal, and WARNINGs and EXTENSIONs can be mapped arbitrarily.
|
|
|
|
///
|
|
|
|
/// \param The source location that this change of diagnostic state should
|
|
|
|
/// take affect. It can be null if we are setting the latest state.
|
2011-09-26 07:23:43 +08:00
|
|
|
void DiagnosticsEngine::setDiagnosticMapping(diag::kind Diag, diag::Mapping Map,
|
2010-12-16 02:44:22 +08:00
|
|
|
SourceLocation L) {
|
|
|
|
assert(Diag < diag::DIAG_UPPER_LIMIT &&
|
|
|
|
"Can only map builtin diagnostics");
|
|
|
|
assert((Diags->isBuiltinWarningOrExtension(Diag) ||
|
|
|
|
(Map == diag::MAP_FATAL || Map == diag::MAP_ERROR)) &&
|
|
|
|
"Cannot map errors into warnings!");
|
|
|
|
assert(!DiagStatePoints.empty());
|
|
|
|
|
2011-01-15 04:54:07 +08:00
|
|
|
bool isPragma = L.isValid();
|
2010-12-16 02:44:22 +08:00
|
|
|
FullSourceLoc Loc(L, *SourceMgr);
|
|
|
|
FullSourceLoc LastStateChangePos = DiagStatePoints.back().Loc;
|
|
|
|
|
|
|
|
// Common case; setting all the diagnostics of a group in one place.
|
|
|
|
if (Loc.isInvalid() || Loc == LastStateChangePos) {
|
2011-01-15 04:54:07 +08:00
|
|
|
setDiagnosticMappingInternal(Diag, Map, GetCurDiagState(), true, isPragma);
|
2010-12-16 02:44:22 +08:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Another common case; modifying diagnostic state in a source location
|
|
|
|
// after the previous one.
|
|
|
|
if ((Loc.isValid() && LastStateChangePos.isInvalid()) ||
|
|
|
|
LastStateChangePos.isBeforeInTranslationUnitThan(Loc)) {
|
2011-04-15 13:22:18 +08:00
|
|
|
// A diagnostic pragma occurred, create a new DiagState initialized with
|
2010-12-16 02:44:22 +08:00
|
|
|
// the current one and a new DiagStatePoint to record at which location
|
|
|
|
// the new state became active.
|
|
|
|
DiagStates.push_back(*GetCurDiagState());
|
|
|
|
PushDiagStatePoint(&DiagStates.back(), Loc);
|
2011-01-15 04:54:07 +08:00
|
|
|
setDiagnosticMappingInternal(Diag, Map, GetCurDiagState(), true, isPragma);
|
2010-12-16 02:44:22 +08:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// We allow setting the diagnostic state in random source order for
|
|
|
|
// completeness but it should not be actually happening in normal practice.
|
|
|
|
|
|
|
|
DiagStatePointsTy::iterator Pos = GetDiagStatePointForLoc(Loc);
|
|
|
|
assert(Pos != DiagStatePoints.end());
|
|
|
|
|
|
|
|
// Update all diagnostic states that are active after the given location.
|
|
|
|
for (DiagStatePointsTy::iterator
|
|
|
|
I = Pos+1, E = DiagStatePoints.end(); I != E; ++I) {
|
2011-01-15 04:54:07 +08:00
|
|
|
setDiagnosticMappingInternal(Diag, Map, I->State, true, isPragma);
|
2010-12-16 02:44:22 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// If the location corresponds to an existing point, just update its state.
|
|
|
|
if (Pos->Loc == Loc) {
|
2011-01-15 04:54:07 +08:00
|
|
|
setDiagnosticMappingInternal(Diag, Map, Pos->State, true, isPragma);
|
2010-12-16 02:44:22 +08:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Create a new state/point and fit it into the vector of DiagStatePoints
|
|
|
|
// so that the vector is always ordered according to location.
|
|
|
|
Pos->Loc.isBeforeInTranslationUnitThan(Loc);
|
|
|
|
DiagStates.push_back(*Pos->State);
|
|
|
|
DiagState *NewState = &DiagStates.back();
|
2011-01-15 04:54:07 +08:00
|
|
|
setDiagnosticMappingInternal(Diag, Map, NewState, true, isPragma);
|
2010-12-16 02:44:22 +08:00
|
|
|
DiagStatePoints.insert(Pos+1, DiagStatePoint(NewState,
|
|
|
|
FullSourceLoc(Loc, *SourceMgr)));
|
|
|
|
}
|
|
|
|
|
2011-09-29 08:53:47 +08:00
|
|
|
bool DiagnosticsEngine::setDiagnosticGroupWarningAsError(StringRef Group,
|
|
|
|
bool Enabled) {
|
|
|
|
diag::Mapping Map = Enabled ? diag::MAP_ERROR : diag::MAP_WARNING_NO_WERROR;
|
|
|
|
return setDiagnosticGroupMapping(Group, Map);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool DiagnosticsEngine::setDiagnosticGroupErrorAsFatal(StringRef Group,
|
|
|
|
bool Enabled) {
|
|
|
|
diag::Mapping Map = Enabled ? diag::MAP_FATAL : diag::MAP_ERROR_NO_WFATAL;
|
|
|
|
return setDiagnosticGroupMapping(Group, Map);
|
|
|
|
}
|
|
|
|
|
2011-09-26 07:23:43 +08:00
|
|
|
void DiagnosticsEngine::Report(const StoredDiagnostic &storedDiag) {
|
2011-05-05 15:54:59 +08:00
|
|
|
assert(CurDiagID == ~0U && "Multiple diagnostics in flight at once!");
|
|
|
|
|
|
|
|
CurDiagLoc = storedDiag.getLocation();
|
|
|
|
CurDiagID = storedDiag.getID();
|
|
|
|
NumDiagArgs = 0;
|
|
|
|
|
|
|
|
NumDiagRanges = storedDiag.range_size();
|
|
|
|
assert(NumDiagRanges < sizeof(DiagRanges)/sizeof(DiagRanges[0]) &&
|
|
|
|
"Too many arguments to diagnostic!");
|
|
|
|
unsigned i = 0;
|
|
|
|
for (StoredDiagnostic::range_iterator
|
|
|
|
RI = storedDiag.range_begin(),
|
|
|
|
RE = storedDiag.range_end(); RI != RE; ++RI)
|
|
|
|
DiagRanges[i++] = *RI;
|
|
|
|
|
|
|
|
NumFixItHints = storedDiag.fixit_size();
|
2011-09-26 07:23:43 +08:00
|
|
|
assert(NumFixItHints < DiagnosticsEngine::MaxFixItHints &&
|
|
|
|
"Too many fix-it hints!");
|
2011-05-05 15:54:59 +08:00
|
|
|
i = 0;
|
|
|
|
for (StoredDiagnostic::fixit_iterator
|
|
|
|
FI = storedDiag.fixit_begin(),
|
|
|
|
FE = storedDiag.fixit_end(); FI != FE; ++FI)
|
|
|
|
FixItHints[i++] = *FI;
|
|
|
|
|
2011-09-26 07:39:51 +08:00
|
|
|
assert(Client && "DiagnosticConsumer not set!");
|
2011-05-05 15:54:59 +08:00
|
|
|
Level DiagLevel = storedDiag.getLevel();
|
2011-09-26 09:18:08 +08:00
|
|
|
Diagnostic Info(this, storedDiag.getMessage());
|
2011-05-05 15:54:59 +08:00
|
|
|
Client->HandleDiagnostic(DiagLevel, Info);
|
|
|
|
if (Client->IncludeInDiagnosticCounts()) {
|
2011-09-26 07:23:43 +08:00
|
|
|
if (DiagLevel == DiagnosticsEngine::Warning)
|
2011-05-05 15:54:59 +08:00
|
|
|
++NumWarnings;
|
|
|
|
}
|
|
|
|
|
|
|
|
CurDiagID = ~0U;
|
|
|
|
}
|
|
|
|
|
2010-10-14 01:22:14 +08:00
|
|
|
void DiagnosticBuilder::FlushCounts() {
|
|
|
|
DiagObj->NumDiagArgs = NumArgs;
|
|
|
|
DiagObj->NumDiagRanges = NumRanges;
|
|
|
|
DiagObj->NumFixItHints = NumFixItHints;
|
|
|
|
}
|
|
|
|
|
2010-03-22 23:10:57 +08:00
|
|
|
bool DiagnosticBuilder::Emit() {
|
|
|
|
// If DiagObj is null, then its soul was stolen by the copy ctor
|
|
|
|
// or the user called Emit().
|
|
|
|
if (DiagObj == 0) return false;
|
|
|
|
|
|
|
|
// When emitting diagnostics, we set the final argument count into
|
2011-09-26 07:23:43 +08:00
|
|
|
// the DiagnosticsEngine object.
|
2010-10-14 01:22:14 +08:00
|
|
|
FlushCounts();
|
2010-03-22 23:10:57 +08:00
|
|
|
|
|
|
|
// Process the diagnostic, sending the accumulated information to the
|
2011-09-26 07:39:51 +08:00
|
|
|
// DiagnosticConsumer.
|
2010-03-22 23:10:57 +08:00
|
|
|
bool Emitted = DiagObj->ProcessDiag();
|
|
|
|
|
|
|
|
// Clear out the current diagnostic object.
|
2010-03-22 23:47:45 +08:00
|
|
|
unsigned DiagID = DiagObj->CurDiagID;
|
2010-03-22 23:10:57 +08:00
|
|
|
DiagObj->Clear();
|
|
|
|
|
|
|
|
// If there was a delayed diagnostic, emit it now.
|
2010-03-22 23:47:45 +08:00
|
|
|
if (DiagObj->DelayedDiagID && DiagObj->DelayedDiagID != DiagID)
|
2010-03-22 23:10:57 +08:00
|
|
|
DiagObj->ReportDelayed();
|
|
|
|
|
|
|
|
// This diagnostic is dead.
|
|
|
|
DiagObj = 0;
|
|
|
|
|
|
|
|
return Emitted;
|
|
|
|
}
|
|
|
|
|
2008-08-11 03:59:06 +08:00
|
|
|
|
2011-09-26 07:39:51 +08:00
|
|
|
DiagnosticConsumer::~DiagnosticConsumer() {}
|
2008-08-11 03:59:06 +08:00
|
|
|
|
2011-09-26 07:39:51 +08:00
|
|
|
void DiagnosticConsumer::HandleDiagnostic(DiagnosticsEngine::Level DiagLevel,
|
2011-09-26 09:18:08 +08:00
|
|
|
const Diagnostic &Info) {
|
2010-11-19 04:06:46 +08:00
|
|
|
if (!IncludeInDiagnosticCounts())
|
|
|
|
return;
|
|
|
|
|
2011-09-26 07:23:43 +08:00
|
|
|
if (DiagLevel == DiagnosticsEngine::Warning)
|
2010-11-19 04:06:46 +08:00
|
|
|
++NumWarnings;
|
2011-09-26 07:23:43 +08:00
|
|
|
else if (DiagLevel >= DiagnosticsEngine::Error)
|
2010-11-19 04:06:46 +08:00
|
|
|
++NumErrors;
|
|
|
|
}
|
2008-11-19 14:51:40 +08:00
|
|
|
|
2008-11-21 15:50:02 +08:00
|
|
|
/// ModifierIs - Return true if the specified modifier matches specified string.
|
|
|
|
template <std::size_t StrLen>
|
|
|
|
static bool ModifierIs(const char *Modifier, unsigned ModifierLen,
|
|
|
|
const char (&Str)[StrLen]) {
|
|
|
|
return StrLen-1 == ModifierLen && !memcmp(Modifier, Str, StrLen-1);
|
|
|
|
}
|
|
|
|
|
2010-01-15 04:11:39 +08:00
|
|
|
/// ScanForward - Scans forward, looking for the given character, skipping
|
|
|
|
/// nested clauses and escaped characters.
|
|
|
|
static const char *ScanFormat(const char *I, const char *E, char Target) {
|
|
|
|
unsigned Depth = 0;
|
|
|
|
|
|
|
|
for ( ; I != E; ++I) {
|
|
|
|
if (Depth == 0 && *I == Target) return I;
|
|
|
|
if (Depth != 0 && *I == '}') Depth--;
|
|
|
|
|
|
|
|
if (*I == '%') {
|
|
|
|
I++;
|
|
|
|
if (I == E) break;
|
|
|
|
|
|
|
|
// Escaped characters get implicitly skipped here.
|
|
|
|
|
|
|
|
// Format specifier.
|
|
|
|
if (!isdigit(*I) && !ispunct(*I)) {
|
|
|
|
for (I++; I != E && !isdigit(*I) && *I != '{'; I++) ;
|
|
|
|
if (I == E) break;
|
|
|
|
if (*I == '{')
|
|
|
|
Depth++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return E;
|
|
|
|
}
|
|
|
|
|
2008-11-21 15:50:02 +08:00
|
|
|
/// HandleSelectModifier - Handle the integer 'select' modifier. This is used
|
|
|
|
/// like this: %select{foo|bar|baz}2. This means that the integer argument
|
|
|
|
/// "%2" has a value from 0-2. If the value is 0, the diagnostic prints 'foo'.
|
|
|
|
/// If the value is 1, it prints 'bar'. If it has the value 2, it prints 'baz'.
|
|
|
|
/// This is very useful for certain classes of variant diagnostics.
|
2011-09-26 09:18:08 +08:00
|
|
|
static void HandleSelectModifier(const Diagnostic &DInfo, unsigned ValNo,
|
2008-11-21 15:50:02 +08:00
|
|
|
const char *Argument, unsigned ArgumentLen,
|
2011-07-23 18:55:15 +08:00
|
|
|
SmallVectorImpl<char> &OutStr) {
|
2008-11-21 15:50:02 +08:00
|
|
|
const char *ArgumentEnd = Argument+ArgumentLen;
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2008-11-21 15:50:02 +08:00
|
|
|
// Skip over 'ValNo' |'s.
|
|
|
|
while (ValNo) {
|
2010-01-15 04:11:39 +08:00
|
|
|
const char *NextVal = ScanFormat(Argument, ArgumentEnd, '|');
|
2008-11-21 15:50:02 +08:00
|
|
|
assert(NextVal != ArgumentEnd && "Value for integer select modifier was"
|
|
|
|
" larger than the number of options in the diagnostic string!");
|
|
|
|
Argument = NextVal+1; // Skip this string.
|
|
|
|
--ValNo;
|
|
|
|
}
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2008-11-21 15:50:02 +08:00
|
|
|
// Get the end of the value. This is either the } or the |.
|
2010-01-15 04:11:39 +08:00
|
|
|
const char *EndPtr = ScanFormat(Argument, ArgumentEnd, '|');
|
2010-01-14 07:58:20 +08:00
|
|
|
|
|
|
|
// Recursively format the result of the select clause into the output string.
|
|
|
|
DInfo.FormatDiagnostic(Argument, EndPtr, OutStr);
|
2008-11-21 15:50:02 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/// HandleIntegerSModifier - Handle the integer 's' modifier. This adds the
|
|
|
|
/// letter 's' to the string if the value is not 1. This is used in cases like
|
|
|
|
/// this: "you idiot, you have %4 parameter%s4!".
|
|
|
|
static void HandleIntegerSModifier(unsigned ValNo,
|
2011-07-23 18:55:15 +08:00
|
|
|
SmallVectorImpl<char> &OutStr) {
|
2008-11-21 15:50:02 +08:00
|
|
|
if (ValNo != 1)
|
|
|
|
OutStr.push_back('s');
|
|
|
|
}
|
|
|
|
|
2010-01-14 08:50:32 +08:00
|
|
|
/// HandleOrdinalModifier - Handle the integer 'ord' modifier. This
|
|
|
|
/// prints the ordinal form of the given integer, with 1 corresponding
|
|
|
|
/// to the first ordinal. Currently this is hard-coded to use the
|
|
|
|
/// English form.
|
|
|
|
static void HandleOrdinalModifier(unsigned ValNo,
|
2011-07-23 18:55:15 +08:00
|
|
|
SmallVectorImpl<char> &OutStr) {
|
2010-01-14 08:50:32 +08:00
|
|
|
assert(ValNo != 0 && "ValNo must be strictly positive!");
|
|
|
|
|
|
|
|
llvm::raw_svector_ostream Out(OutStr);
|
|
|
|
|
|
|
|
// We could use text forms for the first N ordinals, but the numeric
|
|
|
|
// forms are actually nicer in diagnostics because they stand out.
|
|
|
|
Out << ValNo;
|
|
|
|
|
|
|
|
// It is critically important that we do this perfectly for
|
|
|
|
// user-written sequences with over 100 elements.
|
|
|
|
switch (ValNo % 100) {
|
|
|
|
case 11:
|
|
|
|
case 12:
|
|
|
|
case 13:
|
|
|
|
Out << "th"; return;
|
|
|
|
default:
|
|
|
|
switch (ValNo % 10) {
|
|
|
|
case 1: Out << "st"; return;
|
|
|
|
case 2: Out << "nd"; return;
|
|
|
|
case 3: Out << "rd"; return;
|
|
|
|
default: Out << "th"; return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-11-21 15:50:02 +08:00
|
|
|
|
2008-11-22 21:44:36 +08:00
|
|
|
/// PluralNumber - Parse an unsigned integer and advance Start.
|
2009-04-16 01:13:42 +08:00
|
|
|
static unsigned PluralNumber(const char *&Start, const char *End) {
|
2008-11-22 21:44:36 +08:00
|
|
|
// Programming 101: Parse a decimal number :-)
|
|
|
|
unsigned Val = 0;
|
|
|
|
while (Start != End && *Start >= '0' && *Start <= '9') {
|
|
|
|
Val *= 10;
|
|
|
|
Val += *Start - '0';
|
|
|
|
++Start;
|
|
|
|
}
|
|
|
|
return Val;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// TestPluralRange - Test if Val is in the parsed range. Modifies Start.
|
2009-04-16 01:13:42 +08:00
|
|
|
static bool TestPluralRange(unsigned Val, const char *&Start, const char *End) {
|
2008-11-22 21:44:36 +08:00
|
|
|
if (*Start != '[') {
|
|
|
|
unsigned Ref = PluralNumber(Start, End);
|
|
|
|
return Ref == Val;
|
|
|
|
}
|
|
|
|
|
|
|
|
++Start;
|
|
|
|
unsigned Low = PluralNumber(Start, End);
|
|
|
|
assert(*Start == ',' && "Bad plural expression syntax: expected ,");
|
|
|
|
++Start;
|
|
|
|
unsigned High = PluralNumber(Start, End);
|
|
|
|
assert(*Start == ']' && "Bad plural expression syntax: expected )");
|
|
|
|
++Start;
|
|
|
|
return Low <= Val && Val <= High;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// EvalPluralExpr - Actual expression evaluator for HandlePluralModifier.
|
2009-04-16 01:13:42 +08:00
|
|
|
static bool EvalPluralExpr(unsigned ValNo, const char *Start, const char *End) {
|
2008-11-22 21:44:36 +08:00
|
|
|
// Empty condition?
|
|
|
|
if (*Start == ':')
|
|
|
|
return true;
|
|
|
|
|
|
|
|
while (1) {
|
|
|
|
char C = *Start;
|
|
|
|
if (C == '%') {
|
|
|
|
// Modulo expression
|
|
|
|
++Start;
|
|
|
|
unsigned Arg = PluralNumber(Start, End);
|
|
|
|
assert(*Start == '=' && "Bad plural expression syntax: expected =");
|
|
|
|
++Start;
|
|
|
|
unsigned ValMod = ValNo % Arg;
|
|
|
|
if (TestPluralRange(ValMod, Start, End))
|
|
|
|
return true;
|
|
|
|
} else {
|
2008-11-27 15:28:14 +08:00
|
|
|
assert((C == '[' || (C >= '0' && C <= '9')) &&
|
2008-11-22 21:44:36 +08:00
|
|
|
"Bad plural expression syntax: unexpected character");
|
|
|
|
// Range expression
|
|
|
|
if (TestPluralRange(ValNo, Start, End))
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Scan for next or-expr part.
|
|
|
|
Start = std::find(Start, End, ',');
|
2009-09-09 23:08:12 +08:00
|
|
|
if (Start == End)
|
2008-11-22 21:44:36 +08:00
|
|
|
break;
|
|
|
|
++Start;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// HandlePluralModifier - Handle the integer 'plural' modifier. This is used
|
|
|
|
/// for complex plural forms, or in languages where all plurals are complex.
|
|
|
|
/// The syntax is: %plural{cond1:form1|cond2:form2|:form3}, where condn are
|
|
|
|
/// conditions that are tested in order, the form corresponding to the first
|
|
|
|
/// that applies being emitted. The empty condition is always true, making the
|
|
|
|
/// last form a default case.
|
|
|
|
/// Conditions are simple boolean expressions, where n is the number argument.
|
|
|
|
/// Here are the rules.
|
|
|
|
/// condition := expression | empty
|
|
|
|
/// empty := -> always true
|
|
|
|
/// expression := numeric [',' expression] -> logical or
|
|
|
|
/// numeric := range -> true if n in range
|
|
|
|
/// | '%' number '=' range -> true if n % number in range
|
|
|
|
/// range := number
|
|
|
|
/// | '[' number ',' number ']' -> ranges are inclusive both ends
|
|
|
|
///
|
|
|
|
/// Here are some examples from the GNU gettext manual written in this form:
|
|
|
|
/// English:
|
|
|
|
/// {1:form0|:form1}
|
|
|
|
/// Latvian:
|
|
|
|
/// {0:form2|%100=11,%10=0,%10=[2,9]:form1|:form0}
|
|
|
|
/// Gaeilge:
|
|
|
|
/// {1:form0|2:form1|:form2}
|
|
|
|
/// Romanian:
|
|
|
|
/// {1:form0|0,%100=[1,19]:form1|:form2}
|
|
|
|
/// Lithuanian:
|
|
|
|
/// {%10=0,%100=[10,19]:form2|%10=1:form0|:form1}
|
|
|
|
/// Russian (requires repeated form):
|
|
|
|
/// {%100=[11,14]:form2|%10=1:form0|%10=[2,4]:form1|:form2}
|
|
|
|
/// Slovak
|
|
|
|
/// {1:form0|[2,4]:form1|:form2}
|
|
|
|
/// Polish (requires repeated form):
|
|
|
|
/// {1:form0|%100=[10,20]:form2|%10=[2,4]:form1|:form2}
|
2011-09-26 09:18:08 +08:00
|
|
|
static void HandlePluralModifier(const Diagnostic &DInfo, unsigned ValNo,
|
2008-11-22 21:44:36 +08:00
|
|
|
const char *Argument, unsigned ArgumentLen,
|
2011-07-23 18:55:15 +08:00
|
|
|
SmallVectorImpl<char> &OutStr) {
|
2008-11-22 21:44:36 +08:00
|
|
|
const char *ArgumentEnd = Argument + ArgumentLen;
|
|
|
|
while (1) {
|
|
|
|
assert(Argument < ArgumentEnd && "Plural expression didn't match.");
|
|
|
|
const char *ExprEnd = Argument;
|
|
|
|
while (*ExprEnd != ':') {
|
|
|
|
assert(ExprEnd != ArgumentEnd && "Plural missing expression end");
|
|
|
|
++ExprEnd;
|
|
|
|
}
|
|
|
|
if (EvalPluralExpr(ValNo, Argument, ExprEnd)) {
|
|
|
|
Argument = ExprEnd + 1;
|
2010-01-15 04:11:39 +08:00
|
|
|
ExprEnd = ScanFormat(Argument, ArgumentEnd, '|');
|
2010-10-14 09:55:31 +08:00
|
|
|
|
|
|
|
// Recursively format the result of the plural clause into the
|
|
|
|
// output string.
|
|
|
|
DInfo.FormatDiagnostic(Argument, ExprEnd, OutStr);
|
2008-11-22 21:44:36 +08:00
|
|
|
return;
|
|
|
|
}
|
2010-01-15 04:11:39 +08:00
|
|
|
Argument = ScanFormat(Argument, ArgumentEnd - 1, '|') + 1;
|
2008-11-22 21:44:36 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-11-19 14:51:40 +08:00
|
|
|
/// FormatDiagnostic - Format this diagnostic into a string, substituting the
|
|
|
|
/// formal arguments into the %0 slots. The result is appended onto the Str
|
|
|
|
/// array.
|
2011-09-26 09:18:08 +08:00
|
|
|
void Diagnostic::
|
2011-07-23 18:55:15 +08:00
|
|
|
FormatDiagnostic(SmallVectorImpl<char> &OutStr) const {
|
2011-05-05 15:54:59 +08:00
|
|
|
if (!StoredDiagMessage.empty()) {
|
|
|
|
OutStr.append(StoredDiagMessage.begin(), StoredDiagMessage.end());
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2011-07-23 18:55:15 +08:00
|
|
|
StringRef Diag =
|
2011-05-25 13:05:01 +08:00
|
|
|
getDiags()->getDiagnosticIDs()->getDescription(getID());
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2011-05-25 13:05:01 +08:00
|
|
|
FormatDiagnostic(Diag.begin(), Diag.end(), OutStr);
|
2010-01-14 07:58:20 +08:00
|
|
|
}
|
|
|
|
|
2011-09-26 09:18:08 +08:00
|
|
|
void Diagnostic::
|
2010-01-14 07:58:20 +08:00
|
|
|
FormatDiagnostic(const char *DiagStr, const char *DiagEnd,
|
2011-07-23 18:55:15 +08:00
|
|
|
SmallVectorImpl<char> &OutStr) const {
|
2010-01-14 07:58:20 +08:00
|
|
|
|
2009-10-20 13:25:22 +08:00
|
|
|
/// FormattedArgs - Keep track of all of the arguments formatted by
|
|
|
|
/// ConvertArgToString and pass them into subsequent calls to
|
|
|
|
/// ConvertArgToString, allowing the implementation to avoid redundancies in
|
|
|
|
/// obvious cases.
|
2011-09-26 07:23:43 +08:00
|
|
|
SmallVector<DiagnosticsEngine::ArgumentValue, 8> FormattedArgs;
|
2011-07-12 01:49:21 +08:00
|
|
|
|
|
|
|
/// QualTypeVals - Pass a vector of arrays so that QualType names can be
|
|
|
|
/// compared to see if more information is needed to be printed.
|
2011-07-23 18:55:15 +08:00
|
|
|
SmallVector<intptr_t, 2> QualTypeVals;
|
2011-07-12 01:49:21 +08:00
|
|
|
for (unsigned i = 0, e = getNumArgs(); i < e; ++i)
|
2011-09-26 07:23:43 +08:00
|
|
|
if (getArgKind(i) == DiagnosticsEngine::ak_qualtype)
|
2011-07-12 01:49:21 +08:00
|
|
|
QualTypeVals.push_back(getRawArg(i));
|
|
|
|
|
2008-11-19 14:51:40 +08:00
|
|
|
while (DiagStr != DiagEnd) {
|
|
|
|
if (DiagStr[0] != '%') {
|
|
|
|
// Append non-%0 substrings to Str if we have one.
|
|
|
|
const char *StrEnd = std::find(DiagStr, DiagEnd, '%');
|
|
|
|
OutStr.append(DiagStr, StrEnd);
|
|
|
|
DiagStr = StrEnd;
|
2008-11-21 15:50:02 +08:00
|
|
|
continue;
|
2010-01-15 04:11:39 +08:00
|
|
|
} else if (ispunct(DiagStr[1])) {
|
|
|
|
OutStr.push_back(DiagStr[1]); // %% -> %.
|
2008-11-19 14:51:40 +08:00
|
|
|
DiagStr += 2;
|
2008-11-21 15:50:02 +08:00
|
|
|
continue;
|
|
|
|
}
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2008-11-21 15:50:02 +08:00
|
|
|
// Skip the %.
|
|
|
|
++DiagStr;
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2008-11-21 15:50:02 +08:00
|
|
|
// This must be a placeholder for a diagnostic argument. The format for a
|
|
|
|
// placeholder is one of "%0", "%modifier0", or "%modifier{arguments}0".
|
|
|
|
// The digit is a number from 0-9 indicating which argument this comes from.
|
|
|
|
// The modifier is a string of digits from the set [-a-z]+, arguments is a
|
|
|
|
// brace enclosed string.
|
|
|
|
const char *Modifier = 0, *Argument = 0;
|
|
|
|
unsigned ModifierLen = 0, ArgumentLen = 0;
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2008-11-21 15:50:02 +08:00
|
|
|
// Check to see if we have a modifier. If so eat it.
|
|
|
|
if (!isdigit(DiagStr[0])) {
|
|
|
|
Modifier = DiagStr;
|
|
|
|
while (DiagStr[0] == '-' ||
|
|
|
|
(DiagStr[0] >= 'a' && DiagStr[0] <= 'z'))
|
|
|
|
++DiagStr;
|
|
|
|
ModifierLen = DiagStr-Modifier;
|
2008-11-19 14:51:40 +08:00
|
|
|
|
2008-11-21 15:50:02 +08:00
|
|
|
// If we have an argument, get it next.
|
|
|
|
if (DiagStr[0] == '{') {
|
|
|
|
++DiagStr; // Skip {.
|
|
|
|
Argument = DiagStr;
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2010-01-15 04:11:39 +08:00
|
|
|
DiagStr = ScanFormat(DiagStr, DiagEnd, '}');
|
|
|
|
assert(DiagStr != DiagEnd && "Mismatched {}'s in diagnostic string!");
|
2008-11-21 15:50:02 +08:00
|
|
|
ArgumentLen = DiagStr-Argument;
|
|
|
|
++DiagStr; // Skip }.
|
2008-11-19 14:51:40 +08:00
|
|
|
}
|
2008-11-21 15:50:02 +08:00
|
|
|
}
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2008-11-21 15:50:02 +08:00
|
|
|
assert(isdigit(*DiagStr) && "Invalid format for argument in diagnostic");
|
2008-11-23 17:13:29 +08:00
|
|
|
unsigned ArgNo = *DiagStr++ - '0';
|
2008-11-21 15:50:02 +08:00
|
|
|
|
2011-09-26 07:23:43 +08:00
|
|
|
DiagnosticsEngine::ArgumentKind Kind = getArgKind(ArgNo);
|
2009-10-20 13:25:22 +08:00
|
|
|
|
|
|
|
switch (Kind) {
|
2008-11-24 05:45:46 +08:00
|
|
|
// ---- STRINGS ----
|
2011-09-26 07:23:43 +08:00
|
|
|
case DiagnosticsEngine::ak_std_string: {
|
2008-11-23 17:13:29 +08:00
|
|
|
const std::string &S = getArgStdStr(ArgNo);
|
2008-11-21 15:50:02 +08:00
|
|
|
assert(ModifierLen == 0 && "No modifiers for strings yet");
|
|
|
|
OutStr.append(S.begin(), S.end());
|
|
|
|
break;
|
|
|
|
}
|
2011-09-26 07:23:43 +08:00
|
|
|
case DiagnosticsEngine::ak_c_string: {
|
2008-11-23 17:13:29 +08:00
|
|
|
const char *S = getArgCStr(ArgNo);
|
2008-11-21 15:50:02 +08:00
|
|
|
assert(ModifierLen == 0 && "No modifiers for strings yet");
|
2009-04-20 14:13:16 +08:00
|
|
|
|
|
|
|
// Don't crash if get passed a null pointer by accident.
|
|
|
|
if (!S)
|
|
|
|
S = "(null)";
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2008-11-21 15:50:02 +08:00
|
|
|
OutStr.append(S, S + strlen(S));
|
|
|
|
break;
|
|
|
|
}
|
2008-11-24 05:45:46 +08:00
|
|
|
// ---- INTEGERS ----
|
2011-09-26 07:23:43 +08:00
|
|
|
case DiagnosticsEngine::ak_sint: {
|
2008-11-23 17:13:29 +08:00
|
|
|
int Val = getArgSInt(ArgNo);
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2008-11-21 15:50:02 +08:00
|
|
|
if (ModifierIs(Modifier, ModifierLen, "select")) {
|
2010-10-14 09:55:31 +08:00
|
|
|
HandleSelectModifier(*this, (unsigned)Val, Argument, ArgumentLen,
|
|
|
|
OutStr);
|
2008-11-21 15:50:02 +08:00
|
|
|
} else if (ModifierIs(Modifier, ModifierLen, "s")) {
|
|
|
|
HandleIntegerSModifier(Val, OutStr);
|
2008-11-22 21:44:36 +08:00
|
|
|
} else if (ModifierIs(Modifier, ModifierLen, "plural")) {
|
2010-10-14 09:55:31 +08:00
|
|
|
HandlePluralModifier(*this, (unsigned)Val, Argument, ArgumentLen,
|
|
|
|
OutStr);
|
2010-01-14 08:50:32 +08:00
|
|
|
} else if (ModifierIs(Modifier, ModifierLen, "ordinal")) {
|
|
|
|
HandleOrdinalModifier((unsigned)Val, OutStr);
|
2008-11-21 15:50:02 +08:00
|
|
|
} else {
|
|
|
|
assert(ModifierLen == 0 && "Unknown integer modifier");
|
2009-10-18 02:12:14 +08:00
|
|
|
llvm::raw_svector_ostream(OutStr) << Val;
|
2008-11-19 15:22:31 +08:00
|
|
|
}
|
2008-11-21 15:50:02 +08:00
|
|
|
break;
|
|
|
|
}
|
2011-09-26 07:23:43 +08:00
|
|
|
case DiagnosticsEngine::ak_uint: {
|
2008-11-23 17:13:29 +08:00
|
|
|
unsigned Val = getArgUInt(ArgNo);
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2008-11-21 15:50:02 +08:00
|
|
|
if (ModifierIs(Modifier, ModifierLen, "select")) {
|
2010-01-14 07:58:20 +08:00
|
|
|
HandleSelectModifier(*this, Val, Argument, ArgumentLen, OutStr);
|
2008-11-21 15:50:02 +08:00
|
|
|
} else if (ModifierIs(Modifier, ModifierLen, "s")) {
|
|
|
|
HandleIntegerSModifier(Val, OutStr);
|
2008-11-22 21:44:36 +08:00
|
|
|
} else if (ModifierIs(Modifier, ModifierLen, "plural")) {
|
2010-10-14 09:55:31 +08:00
|
|
|
HandlePluralModifier(*this, (unsigned)Val, Argument, ArgumentLen,
|
|
|
|
OutStr);
|
2010-01-14 08:50:32 +08:00
|
|
|
} else if (ModifierIs(Modifier, ModifierLen, "ordinal")) {
|
|
|
|
HandleOrdinalModifier(Val, OutStr);
|
2008-11-21 15:50:02 +08:00
|
|
|
} else {
|
|
|
|
assert(ModifierLen == 0 && "Unknown integer modifier");
|
2009-10-18 02:12:14 +08:00
|
|
|
llvm::raw_svector_ostream(OutStr) << Val;
|
2008-11-19 15:22:31 +08:00
|
|
|
}
|
2008-11-23 17:13:29 +08:00
|
|
|
break;
|
2008-11-21 15:50:02 +08:00
|
|
|
}
|
2008-11-24 05:45:46 +08:00
|
|
|
// ---- NAMES and TYPES ----
|
2011-09-26 07:23:43 +08:00
|
|
|
case DiagnosticsEngine::ak_identifierinfo: {
|
2008-11-24 05:45:46 +08:00
|
|
|
const IdentifierInfo *II = getArgIdentifier(ArgNo);
|
|
|
|
assert(ModifierLen == 0 && "No modifiers for strings yet");
|
2009-04-20 14:13:16 +08:00
|
|
|
|
|
|
|
// Don't crash if get passed a null pointer by accident.
|
|
|
|
if (!II) {
|
|
|
|
const char *S = "(null)";
|
|
|
|
OutStr.append(S, S + strlen(S));
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2009-10-19 05:17:35 +08:00
|
|
|
llvm::raw_svector_ostream(OutStr) << '\'' << II->getName() << '\'';
|
2008-11-24 05:45:46 +08:00
|
|
|
break;
|
|
|
|
}
|
2011-09-26 07:23:43 +08:00
|
|
|
case DiagnosticsEngine::ak_qualtype:
|
|
|
|
case DiagnosticsEngine::ak_declarationname:
|
|
|
|
case DiagnosticsEngine::ak_nameddecl:
|
|
|
|
case DiagnosticsEngine::ak_nestednamespec:
|
|
|
|
case DiagnosticsEngine::ak_declcontext:
|
2009-10-20 13:25:22 +08:00
|
|
|
getDiags()->ConvertArgToString(Kind, getRawArg(ArgNo),
|
2008-11-23 17:21:17 +08:00
|
|
|
Modifier, ModifierLen,
|
2009-10-20 13:25:22 +08:00
|
|
|
Argument, ArgumentLen,
|
|
|
|
FormattedArgs.data(), FormattedArgs.size(),
|
2011-07-12 01:49:21 +08:00
|
|
|
OutStr, QualTypeVals);
|
2008-11-23 17:13:29 +08:00
|
|
|
break;
|
2008-08-11 03:59:06 +08:00
|
|
|
}
|
2009-10-20 13:25:22 +08:00
|
|
|
|
|
|
|
// Remember this argument info for subsequent formatting operations. Turn
|
|
|
|
// std::strings into a null terminated string to make it be the same case as
|
|
|
|
// all the other ones.
|
2011-09-26 07:23:43 +08:00
|
|
|
if (Kind != DiagnosticsEngine::ak_std_string)
|
2009-10-20 13:25:22 +08:00
|
|
|
FormattedArgs.push_back(std::make_pair(Kind, getRawArg(ArgNo)));
|
|
|
|
else
|
2011-09-26 07:23:43 +08:00
|
|
|
FormattedArgs.push_back(std::make_pair(DiagnosticsEngine::ak_c_string,
|
2009-10-20 13:25:22 +08:00
|
|
|
(intptr_t)getArgStdStr(ArgNo).c_str()));
|
|
|
|
|
2008-08-11 03:59:06 +08:00
|
|
|
}
|
|
|
|
}
|
2009-01-24 04:28:53 +08:00
|
|
|
|
2010-02-19 02:08:43 +08:00
|
|
|
StoredDiagnostic::StoredDiagnostic() { }
|
|
|
|
|
2011-09-26 07:23:43 +08:00
|
|
|
StoredDiagnostic::StoredDiagnostic(DiagnosticsEngine::Level Level, unsigned ID,
|
2011-07-23 18:55:15 +08:00
|
|
|
StringRef Message)
|
2010-11-20 01:36:51 +08:00
|
|
|
: ID(ID), Level(Level), Loc(), Message(Message) { }
|
2010-02-19 02:08:43 +08:00
|
|
|
|
2011-09-26 07:23:43 +08:00
|
|
|
StoredDiagnostic::StoredDiagnostic(DiagnosticsEngine::Level Level,
|
2011-09-26 09:18:08 +08:00
|
|
|
const Diagnostic &Info)
|
2010-11-20 00:18:16 +08:00
|
|
|
: ID(Info.getID()), Level(Level)
|
|
|
|
{
|
2010-11-19 04:06:41 +08:00
|
|
|
assert((Info.getLocation().isInvalid() || Info.hasSourceManager()) &&
|
|
|
|
"Valid source location without setting a source manager for diagnostic");
|
|
|
|
if (Info.getLocation().isValid())
|
|
|
|
Loc = FullSourceLoc(Info.getLocation(), Info.getSourceManager());
|
2010-02-19 02:08:43 +08:00
|
|
|
llvm::SmallString<64> Message;
|
|
|
|
Info.FormatDiagnostic(Message);
|
|
|
|
this->Message.assign(Message.begin(), Message.end());
|
|
|
|
|
|
|
|
Ranges.reserve(Info.getNumRanges());
|
|
|
|
for (unsigned I = 0, N = Info.getNumRanges(); I != N; ++I)
|
|
|
|
Ranges.push_back(Info.getRange(I));
|
|
|
|
|
2010-04-01 01:46:05 +08:00
|
|
|
FixIts.reserve(Info.getNumFixItHints());
|
|
|
|
for (unsigned I = 0, N = Info.getNumFixItHints(); I != N; ++I)
|
|
|
|
FixIts.push_back(Info.getFixItHint(I));
|
2010-02-19 02:08:43 +08:00
|
|
|
}
|
|
|
|
|
2011-09-26 07:23:43 +08:00
|
|
|
StoredDiagnostic::StoredDiagnostic(DiagnosticsEngine::Level Level, unsigned ID,
|
2011-07-23 18:55:15 +08:00
|
|
|
StringRef Message, FullSourceLoc Loc,
|
2011-07-24 01:14:25 +08:00
|
|
|
ArrayRef<CharSourceRange> Ranges,
|
|
|
|
ArrayRef<FixItHint> Fixits)
|
Revamp the SourceManager to separate the representation of parsed
source locations from source locations loaded from an AST/PCH file.
Previously, loading an AST/PCH file involved carefully pre-allocating
space at the beginning of the source manager for the source locations
and FileIDs that correspond to the prefix, and then appending the
source locations/FileIDs used for parsing the remaining translation
unit. This design forced us into loading PCH files early, as a prefix,
whic has become a rather significant limitation.
This patch splits the SourceManager space into two parts: for source
location "addresses", the lower values (growing upward) are used to
describe parsed code, while upper values (growing downward) are used
for source locations loaded from AST/PCH files. Similarly, positive
FileIDs are used to describe parsed code while negative FileIDs are
used to file/macro locations loaded from AST/PCH files. As a result,
we can load PCH/AST files even during parsing, making various
improvemnts in the future possible, e.g., teaching #include <foo.h> to
look for and load <foo.h.gch> if it happens to be already available.
This patch was originally written by Sebastian Redl, then brought
forward to the modern age by Jonathan Turner, and finally
polished/finished by me to be committed.
llvm-svn: 135484
2011-07-20 00:10:42 +08:00
|
|
|
: ID(ID), Level(Level), Loc(Loc), Message(Message)
|
|
|
|
{
|
|
|
|
this->Ranges.assign(Ranges.begin(), Ranges.end());
|
|
|
|
this->FixIts.assign(FixIts.begin(), FixIts.end());
|
|
|
|
}
|
|
|
|
|
2010-02-19 02:08:43 +08:00
|
|
|
StoredDiagnostic::~StoredDiagnostic() { }
|
|
|
|
|
2009-01-24 04:28:53 +08:00
|
|
|
/// IncludeInDiagnosticCounts - This method (whose default implementation
|
|
|
|
/// returns true) indicates whether the diagnostics handled by this
|
2011-09-26 07:39:51 +08:00
|
|
|
/// DiagnosticConsumer should be included in the number of diagnostics
|
2011-09-26 07:23:43 +08:00
|
|
|
/// reported by DiagnosticsEngine.
|
2011-09-26 07:39:51 +08:00
|
|
|
bool DiagnosticConsumer::IncludeInDiagnosticCounts() const { return true; }
|
2010-03-30 07:34:08 +08:00
|
|
|
|
|
|
|
PartialDiagnostic::StorageAllocator::StorageAllocator() {
|
|
|
|
for (unsigned I = 0; I != NumCached; ++I)
|
|
|
|
FreeList[I] = Cached + I;
|
|
|
|
NumFreeListEntries = NumCached;
|
|
|
|
}
|
|
|
|
|
|
|
|
PartialDiagnostic::StorageAllocator::~StorageAllocator() {
|
2011-03-22 02:40:07 +08:00
|
|
|
// Don't assert if we are in a CrashRecovery context, as this
|
|
|
|
// invariant may be invalidated during a crash.
|
2011-03-22 02:40:10 +08:00
|
|
|
assert((NumFreeListEntries == NumCached || llvm::CrashRecoveryContext::isRecoveringFromCrash()) && "A partial is on the lamb");
|
2010-03-30 07:34:08 +08:00
|
|
|
}
|