clang  8.0.0svn
LiteralSupport.cpp
Go to the documentation of this file.
1 //===--- LiteralSupport.cpp - Code to parse and process literals ----------===//
2 //
3 // The LLVM Compiler Infrastructure
4 //
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9 //
10 // This file implements the NumericLiteralParser, CharLiteralParser, and
11 // StringLiteralParser interfaces.
12 //
13 //===----------------------------------------------------------------------===//
14 
16 #include "clang/Basic/CharInfo.h"
19 #include "clang/Basic/TargetInfo.h"
21 #include "clang/Lex/Lexer.h"
22 #include "clang/Lex/Preprocessor.h"
23 #include "clang/Lex/Token.h"
24 #include "llvm/ADT/APInt.h"
25 #include "llvm/ADT/SmallVector.h"
26 #include "llvm/ADT/StringExtras.h"
27 #include "llvm/ADT/StringSwitch.h"
28 #include "llvm/Support/ConvertUTF.h"
29 #include "llvm/Support/ErrorHandling.h"
30 #include <algorithm>
31 #include <cassert>
32 #include <cstddef>
33 #include <cstdint>
34 #include <cstring>
35 #include <string>
36 
37 using namespace clang;
38 
39 static unsigned getCharWidth(tok::TokenKind kind, const TargetInfo &Target) {
40  switch (kind) {
41  default: llvm_unreachable("Unknown token type!");
42  case tok::char_constant:
43  case tok::string_literal:
44  case tok::utf8_char_constant:
45  case tok::utf8_string_literal:
46  return Target.getCharWidth();
47  case tok::wide_char_constant:
48  case tok::wide_string_literal:
49  return Target.getWCharWidth();
50  case tok::utf16_char_constant:
51  case tok::utf16_string_literal:
52  return Target.getChar16Width();
53  case tok::utf32_char_constant:
54  case tok::utf32_string_literal:
55  return Target.getChar32Width();
56  }
57 }
58 
60  FullSourceLoc TokLoc,
61  const char *TokBegin,
62  const char *TokRangeBegin,
63  const char *TokRangeEnd) {
65  Lexer::AdvanceToTokenCharacter(TokLoc, TokRangeBegin - TokBegin,
66  TokLoc.getManager(), Features);
68  Lexer::AdvanceToTokenCharacter(Begin, TokRangeEnd - TokRangeBegin,
69  TokLoc.getManager(), Features);
70  return CharSourceRange::getCharRange(Begin, End);
71 }
72 
73 /// Produce a diagnostic highlighting some portion of a literal.
74 ///
75 /// Emits the diagnostic \p DiagID, highlighting the range of characters from
76 /// \p TokRangeBegin (inclusive) to \p TokRangeEnd (exclusive), which must be
77 /// a substring of a spelling buffer for the token beginning at \p TokBegin.
79  const LangOptions &Features, FullSourceLoc TokLoc,
80  const char *TokBegin, const char *TokRangeBegin,
81  const char *TokRangeEnd, unsigned DiagID) {
83  Lexer::AdvanceToTokenCharacter(TokLoc, TokRangeBegin - TokBegin,
84  TokLoc.getManager(), Features);
85  return Diags->Report(Begin, DiagID) <<
86  MakeCharSourceRange(Features, TokLoc, TokBegin, TokRangeBegin, TokRangeEnd);
87 }
88 
89 /// ProcessCharEscape - Parse a standard C escape sequence, which can occur in
90 /// either a character or a string literal.
91 static unsigned ProcessCharEscape(const char *ThisTokBegin,
92  const char *&ThisTokBuf,
93  const char *ThisTokEnd, bool &HadError,
94  FullSourceLoc Loc, unsigned CharWidth,
95  DiagnosticsEngine *Diags,
96  const LangOptions &Features) {
97  const char *EscapeBegin = ThisTokBuf;
98 
99  // Skip the '\' char.
100  ++ThisTokBuf;
101 
102  // We know that this character can't be off the end of the buffer, because
103  // that would have been \", which would not have been the end of string.
104  unsigned ResultChar = *ThisTokBuf++;
105  switch (ResultChar) {
106  // These map to themselves.
107  case '\\': case '\'': case '"': case '?': break;
108 
109  // These have fixed mappings.
110  case 'a':
111  // TODO: K&R: the meaning of '\\a' is different in traditional C
112  ResultChar = 7;
113  break;
114  case 'b':
115  ResultChar = 8;
116  break;
117  case 'e':
118  if (Diags)
119  Diag(Diags, Features, Loc, ThisTokBegin, EscapeBegin, ThisTokBuf,
120  diag::ext_nonstandard_escape) << "e";
121  ResultChar = 27;
122  break;
123  case 'E':
124  if (Diags)
125  Diag(Diags, Features, Loc, ThisTokBegin, EscapeBegin, ThisTokBuf,
126  diag::ext_nonstandard_escape) << "E";
127  ResultChar = 27;
128  break;
129  case 'f':
130  ResultChar = 12;
131  break;
132  case 'n':
133  ResultChar = 10;
134  break;
135  case 'r':
136  ResultChar = 13;
137  break;
138  case 't':
139  ResultChar = 9;
140  break;
141  case 'v':
142  ResultChar = 11;
143  break;
144  case 'x': { // Hex escape.
145  ResultChar = 0;
146  if (ThisTokBuf == ThisTokEnd || !isHexDigit(*ThisTokBuf)) {
147  if (Diags)
148  Diag(Diags, Features, Loc, ThisTokBegin, EscapeBegin, ThisTokBuf,
149  diag::err_hex_escape_no_digits) << "x";
150  HadError = true;
151  break;
152  }
153 
154  // Hex escapes are a maximal series of hex digits.
155  bool Overflow = false;
156  for (; ThisTokBuf != ThisTokEnd; ++ThisTokBuf) {
157  int CharVal = llvm::hexDigitValue(ThisTokBuf[0]);
158  if (CharVal == -1) break;
159  // About to shift out a digit?
160  if (ResultChar & 0xF0000000)
161  Overflow = true;
162  ResultChar <<= 4;
163  ResultChar |= CharVal;
164  }
165 
166  // See if any bits will be truncated when evaluated as a character.
167  if (CharWidth != 32 && (ResultChar >> CharWidth) != 0) {
168  Overflow = true;
169  ResultChar &= ~0U >> (32-CharWidth);
170  }
171 
172  // Check for overflow.
173  if (Overflow && Diags) // Too many digits to fit in
174  Diag(Diags, Features, Loc, ThisTokBegin, EscapeBegin, ThisTokBuf,
175  diag::err_escape_too_large) << 0;
176  break;
177  }
178  case '0': case '1': case '2': case '3':
179  case '4': case '5': case '6': case '7': {
180  // Octal escapes.
181  --ThisTokBuf;
182  ResultChar = 0;
183 
184  // Octal escapes are a series of octal digits with maximum length 3.
185  // "\0123" is a two digit sequence equal to "\012" "3".
186  unsigned NumDigits = 0;
187  do {
188  ResultChar <<= 3;
189  ResultChar |= *ThisTokBuf++ - '0';
190  ++NumDigits;
191  } while (ThisTokBuf != ThisTokEnd && NumDigits < 3 &&
192  ThisTokBuf[0] >= '0' && ThisTokBuf[0] <= '7');
193 
194  // Check for overflow. Reject '\777', but not L'\777'.
195  if (CharWidth != 32 && (ResultChar >> CharWidth) != 0) {
196  if (Diags)
197  Diag(Diags, Features, Loc, ThisTokBegin, EscapeBegin, ThisTokBuf,
198  diag::err_escape_too_large) << 1;
199  ResultChar &= ~0U >> (32-CharWidth);
200  }
201  break;
202  }
203 
204  // Otherwise, these are not valid escapes.
205  case '(': case '{': case '[': case '%':
206  // GCC accepts these as extensions. We warn about them as such though.
207  if (Diags)
208  Diag(Diags, Features, Loc, ThisTokBegin, EscapeBegin, ThisTokBuf,
209  diag::ext_nonstandard_escape)
210  << std::string(1, ResultChar);
211  break;
212  default:
213  if (!Diags)
214  break;
215 
216  if (isPrintable(ResultChar))
217  Diag(Diags, Features, Loc, ThisTokBegin, EscapeBegin, ThisTokBuf,
218  diag::ext_unknown_escape)
219  << std::string(1, ResultChar);
220  else
221  Diag(Diags, Features, Loc, ThisTokBegin, EscapeBegin, ThisTokBuf,
222  diag::ext_unknown_escape)
223  << "x" + llvm::utohexstr(ResultChar);
224  break;
225  }
226 
227  return ResultChar;
228 }
229 
230 static void appendCodePoint(unsigned Codepoint,
232  char ResultBuf[4];
233  char *ResultPtr = ResultBuf;
234  bool Res = llvm::ConvertCodePointToUTF8(Codepoint, ResultPtr);
235  (void)Res;
236  assert(Res && "Unexpected conversion failure");
237  Str.append(ResultBuf, ResultPtr);
238 }
239 
240 void clang::expandUCNs(SmallVectorImpl<char> &Buf, StringRef Input) {
241  for (StringRef::iterator I = Input.begin(), E = Input.end(); I != E; ++I) {
242  if (*I != '\\') {
243  Buf.push_back(*I);
244  continue;
245  }
246 
247  ++I;
248  assert(*I == 'u' || *I == 'U');
249 
250  unsigned NumHexDigits;
251  if (*I == 'u')
252  NumHexDigits = 4;
253  else
254  NumHexDigits = 8;
255 
256  assert(I + NumHexDigits <= E);
257 
258  uint32_t CodePoint = 0;
259  for (++I; NumHexDigits != 0; ++I, --NumHexDigits) {
260  unsigned Value = llvm::hexDigitValue(*I);
261  assert(Value != -1U);
262 
263  CodePoint <<= 4;
264  CodePoint += Value;
265  }
266 
267  appendCodePoint(CodePoint, Buf);
268  --I;
269  }
270 }
271 
272 /// ProcessUCNEscape - Read the Universal Character Name, check constraints and
273 /// return the UTF32.
274 static bool ProcessUCNEscape(const char *ThisTokBegin, const char *&ThisTokBuf,
275  const char *ThisTokEnd,
276  uint32_t &UcnVal, unsigned short &UcnLen,
277  FullSourceLoc Loc, DiagnosticsEngine *Diags,
278  const LangOptions &Features,
279  bool in_char_string_literal = false) {
280  const char *UcnBegin = ThisTokBuf;
281 
282  // Skip the '\u' char's.
283  ThisTokBuf += 2;
284 
285  if (ThisTokBuf == ThisTokEnd || !isHexDigit(*ThisTokBuf)) {
286  if (Diags)
287  Diag(Diags, Features, Loc, ThisTokBegin, UcnBegin, ThisTokBuf,
288  diag::err_hex_escape_no_digits) << StringRef(&ThisTokBuf[-1], 1);
289  return false;
290  }
291  UcnLen = (ThisTokBuf[-1] == 'u' ? 4 : 8);
292  unsigned short UcnLenSave = UcnLen;
293  for (; ThisTokBuf != ThisTokEnd && UcnLenSave; ++ThisTokBuf, UcnLenSave--) {
294  int CharVal = llvm::hexDigitValue(ThisTokBuf[0]);
295  if (CharVal == -1) break;
296  UcnVal <<= 4;
297  UcnVal |= CharVal;
298  }
299  // If we didn't consume the proper number of digits, there is a problem.
300  if (UcnLenSave) {
301  if (Diags)
302  Diag(Diags, Features, Loc, ThisTokBegin, UcnBegin, ThisTokBuf,
303  diag::err_ucn_escape_incomplete);
304  return false;
305  }
306 
307  // Check UCN constraints (C99 6.4.3p2) [C++11 lex.charset p2]
308  if ((0xD800 <= UcnVal && UcnVal <= 0xDFFF) || // surrogate codepoints
309  UcnVal > 0x10FFFF) { // maximum legal UTF32 value
310  if (Diags)
311  Diag(Diags, Features, Loc, ThisTokBegin, UcnBegin, ThisTokBuf,
312  diag::err_ucn_escape_invalid);
313  return false;
314  }
315 
316  // C++11 allows UCNs that refer to control characters and basic source
317  // characters inside character and string literals
318  if (UcnVal < 0xa0 &&
319  (UcnVal != 0x24 && UcnVal != 0x40 && UcnVal != 0x60)) { // $, @, `
320  bool IsError = (!Features.CPlusPlus11 || !in_char_string_literal);
321  if (Diags) {
322  char BasicSCSChar = UcnVal;
323  if (UcnVal >= 0x20 && UcnVal < 0x7f)
324  Diag(Diags, Features, Loc, ThisTokBegin, UcnBegin, ThisTokBuf,
325  IsError ? diag::err_ucn_escape_basic_scs :
326  diag::warn_cxx98_compat_literal_ucn_escape_basic_scs)
327  << StringRef(&BasicSCSChar, 1);
328  else
329  Diag(Diags, Features, Loc, ThisTokBegin, UcnBegin, ThisTokBuf,
330  IsError ? diag::err_ucn_control_character :
331  diag::warn_cxx98_compat_literal_ucn_control_character);
332  }
333  if (IsError)
334  return false;
335  }
336 
337  if (!Features.CPlusPlus && !Features.C99 && Diags)
338  Diag(Diags, Features, Loc, ThisTokBegin, UcnBegin, ThisTokBuf,
339  diag::warn_ucn_not_valid_in_c89_literal);
340 
341  return true;
342 }
343 
344 /// MeasureUCNEscape - Determine the number of bytes within the resulting string
345 /// which this UCN will occupy.
346 static int MeasureUCNEscape(const char *ThisTokBegin, const char *&ThisTokBuf,
347  const char *ThisTokEnd, unsigned CharByteWidth,
348  const LangOptions &Features, bool &HadError) {
349  // UTF-32: 4 bytes per escape.
350  if (CharByteWidth == 4)
351  return 4;
352 
353  uint32_t UcnVal = 0;
354  unsigned short UcnLen = 0;
355  FullSourceLoc Loc;
356 
357  if (!ProcessUCNEscape(ThisTokBegin, ThisTokBuf, ThisTokEnd, UcnVal,
358  UcnLen, Loc, nullptr, Features, true)) {
359  HadError = true;
360  return 0;
361  }
362 
363  // UTF-16: 2 bytes for BMP, 4 bytes otherwise.
364  if (CharByteWidth == 2)
365  return UcnVal <= 0xFFFF ? 2 : 4;
366 
367  // UTF-8.
368  if (UcnVal < 0x80)
369  return 1;
370  if (UcnVal < 0x800)
371  return 2;
372  if (UcnVal < 0x10000)
373  return 3;
374  return 4;
375 }
376 
377 /// EncodeUCNEscape - Read the Universal Character Name, check constraints and
378 /// convert the UTF32 to UTF8 or UTF16. This is a subroutine of
379 /// StringLiteralParser. When we decide to implement UCN's for identifiers,
380 /// we will likely rework our support for UCN's.
381 static void EncodeUCNEscape(const char *ThisTokBegin, const char *&ThisTokBuf,
382  const char *ThisTokEnd,
383  char *&ResultBuf, bool &HadError,
384  FullSourceLoc Loc, unsigned CharByteWidth,
385  DiagnosticsEngine *Diags,
386  const LangOptions &Features) {
387  typedef uint32_t UTF32;
388  UTF32 UcnVal = 0;
389  unsigned short UcnLen = 0;
390  if (!ProcessUCNEscape(ThisTokBegin, ThisTokBuf, ThisTokEnd, UcnVal, UcnLen,
391  Loc, Diags, Features, true)) {
392  HadError = true;
393  return;
394  }
395 
396  assert((CharByteWidth == 1 || CharByteWidth == 2 || CharByteWidth == 4) &&
397  "only character widths of 1, 2, or 4 bytes supported");
398 
399  (void)UcnLen;
400  assert((UcnLen== 4 || UcnLen== 8) && "only ucn length of 4 or 8 supported");
401 
402  if (CharByteWidth == 4) {
403  // FIXME: Make the type of the result buffer correct instead of
404  // using reinterpret_cast.
405  llvm::UTF32 *ResultPtr = reinterpret_cast<llvm::UTF32*>(ResultBuf);
406  *ResultPtr = UcnVal;
407  ResultBuf += 4;
408  return;
409  }
410 
411  if (CharByteWidth == 2) {
412  // FIXME: Make the type of the result buffer correct instead of
413  // using reinterpret_cast.
414  llvm::UTF16 *ResultPtr = reinterpret_cast<llvm::UTF16*>(ResultBuf);
415 
416  if (UcnVal <= (UTF32)0xFFFF) {
417  *ResultPtr = UcnVal;
418  ResultBuf += 2;
419  return;
420  }
421 
422  // Convert to UTF16.
423  UcnVal -= 0x10000;
424  *ResultPtr = 0xD800 + (UcnVal >> 10);
425  *(ResultPtr+1) = 0xDC00 + (UcnVal & 0x3FF);
426  ResultBuf += 4;
427  return;
428  }
429 
430  assert(CharByteWidth == 1 && "UTF-8 encoding is only for 1 byte characters");
431 
432  // Now that we've parsed/checked the UCN, we convert from UTF32->UTF8.
433  // The conversion below was inspired by:
434  // http://www.unicode.org/Public/PROGRAMS/CVTUTF/ConvertUTF.c
435  // First, we determine how many bytes the result will require.
436  typedef uint8_t UTF8;
437 
438  unsigned short bytesToWrite = 0;
439  if (UcnVal < (UTF32)0x80)
440  bytesToWrite = 1;
441  else if (UcnVal < (UTF32)0x800)
442  bytesToWrite = 2;
443  else if (UcnVal < (UTF32)0x10000)
444  bytesToWrite = 3;
445  else
446  bytesToWrite = 4;
447 
448  const unsigned byteMask = 0xBF;
449  const unsigned byteMark = 0x80;
450 
451  // Once the bits are split out into bytes of UTF8, this is a mask OR-ed
452  // into the first byte, depending on how many bytes follow.
453  static const UTF8 firstByteMark[5] = {
454  0x00, 0x00, 0xC0, 0xE0, 0xF0
455  };
456  // Finally, we write the bytes into ResultBuf.
457  ResultBuf += bytesToWrite;
458  switch (bytesToWrite) { // note: everything falls through.
459  case 4:
460  *--ResultBuf = (UTF8)((UcnVal | byteMark) & byteMask); UcnVal >>= 6;
461  LLVM_FALLTHROUGH;
462  case 3:
463  *--ResultBuf = (UTF8)((UcnVal | byteMark) & byteMask); UcnVal >>= 6;
464  LLVM_FALLTHROUGH;
465  case 2:
466  *--ResultBuf = (UTF8)((UcnVal | byteMark) & byteMask); UcnVal >>= 6;
467  LLVM_FALLTHROUGH;
468  case 1:
469  *--ResultBuf = (UTF8) (UcnVal | firstByteMark[bytesToWrite]);
470  }
471  // Update the buffer.
472  ResultBuf += bytesToWrite;
473 }
474 
475 /// integer-constant: [C99 6.4.4.1]
476 /// decimal-constant integer-suffix
477 /// octal-constant integer-suffix
478 /// hexadecimal-constant integer-suffix
479 /// binary-literal integer-suffix [GNU, C++1y]
480 /// user-defined-integer-literal: [C++11 lex.ext]
481 /// decimal-literal ud-suffix
482 /// octal-literal ud-suffix
483 /// hexadecimal-literal ud-suffix
484 /// binary-literal ud-suffix [GNU, C++1y]
485 /// decimal-constant:
486 /// nonzero-digit
487 /// decimal-constant digit
488 /// octal-constant:
489 /// 0
490 /// octal-constant octal-digit
491 /// hexadecimal-constant:
492 /// hexadecimal-prefix hexadecimal-digit
493 /// hexadecimal-constant hexadecimal-digit
494 /// hexadecimal-prefix: one of
495 /// 0x 0X
496 /// binary-literal:
497 /// 0b binary-digit
498 /// 0B binary-digit
499 /// binary-literal binary-digit
500 /// integer-suffix:
501 /// unsigned-suffix [long-suffix]
502 /// unsigned-suffix [long-long-suffix]
503 /// long-suffix [unsigned-suffix]
504 /// long-long-suffix [unsigned-sufix]
505 /// nonzero-digit:
506 /// 1 2 3 4 5 6 7 8 9
507 /// octal-digit:
508 /// 0 1 2 3 4 5 6 7
509 /// hexadecimal-digit:
510 /// 0 1 2 3 4 5 6 7 8 9
511 /// a b c d e f
512 /// A B C D E F
513 /// binary-digit:
514 /// 0
515 /// 1
516 /// unsigned-suffix: one of
517 /// u U
518 /// long-suffix: one of
519 /// l L
520 /// long-long-suffix: one of
521 /// ll LL
522 ///
523 /// floating-constant: [C99 6.4.4.2]
524 /// TODO: add rules...
525 ///
527  SourceLocation TokLoc,
528  Preprocessor &PP)
529  : PP(PP), ThisTokBegin(TokSpelling.begin()), ThisTokEnd(TokSpelling.end()) {
530 
531  // This routine assumes that the range begin/end matches the regex for integer
532  // and FP constants (specifically, the 'pp-number' regex), and assumes that
533  // the byte at "*end" is both valid and not part of the regex. Because of
534  // this, it doesn't have to check for 'overscan' in various places.
535  assert(!isPreprocessingNumberBody(*ThisTokEnd) && "didn't maximally munch?");
536 
537  s = DigitsBegin = ThisTokBegin;
538  saw_exponent = false;
539  saw_period = false;
540  saw_ud_suffix = false;
541  saw_fixed_point_suffix = false;
542  isLong = false;
543  isUnsigned = false;
544  isLongLong = false;
545  isHalf = false;
546  isFloat = false;
547  isImaginary = false;
548  isFloat16 = false;
549  isFloat128 = false;
550  MicrosoftInteger = 0;
551  isFract = false;
552  isAccum = false;
553  hadError = false;
554 
555  if (*s == '0') { // parse radix
556  ParseNumberStartingWithZero(TokLoc);
557  if (hadError)
558  return;
559  } else { // the first digit is non-zero
560  radix = 10;
561  s = SkipDigits(s);
562  if (s == ThisTokEnd) {
563  // Done.
564  } else {
565  ParseDecimalOrOctalCommon(TokLoc);
566  if (hadError)
567  return;
568  }
569  }
570 
571  SuffixBegin = s;
572  checkSeparator(TokLoc, s, CSK_AfterDigits);
573 
574  // Initial scan to lookahead for fixed point suffix.
575  if (PP.getLangOpts().FixedPoint) {
576  for (const char *c = s; c != ThisTokEnd; ++c) {
577  if (*c == 'r' || *c == 'k' || *c == 'R' || *c == 'K') {
578  saw_fixed_point_suffix = true;
579  break;
580  }
581  }
582  }
583 
584  // Parse the suffix. At this point we can classify whether we have an FP or
585  // integer constant.
586  bool isFPConstant = isFloatingLiteral();
587 
588  // Loop over all of the characters of the suffix. If we see something bad,
589  // we break out of the loop.
590  for (; s != ThisTokEnd; ++s) {
591  switch (*s) {
592  case 'R':
593  case 'r':
594  if (!PP.getLangOpts().FixedPoint) break;
595  if (isFract || isAccum) break;
596  if (!(saw_period || saw_exponent)) break;
597  isFract = true;
598  continue;
599  case 'K':
600  case 'k':
601  if (!PP.getLangOpts().FixedPoint) break;
602  if (isFract || isAccum) break;
603  if (!(saw_period || saw_exponent)) break;
604  isAccum = true;
605  continue;
606  case 'h': // FP Suffix for "half".
607  case 'H':
608  // OpenCL Extension v1.2 s9.5 - h or H suffix for half type.
609  if (!(PP.getLangOpts().Half || PP.getLangOpts().FixedPoint)) break;
610  if (isIntegerLiteral()) break; // Error for integer constant.
611  if (isHalf || isFloat || isLong) break; // HH, FH, LH invalid.
612  isHalf = true;
613  continue; // Success.
614  case 'f': // FP Suffix for "float"
615  case 'F':
616  if (!isFPConstant) break; // Error for integer constant.
617  if (isHalf || isFloat || isLong || isFloat128)
618  break; // HF, FF, LF, QF invalid.
619 
620  if (s + 2 < ThisTokEnd && s[1] == '1' && s[2] == '6') {
621  s += 2; // success, eat up 2 characters.
622  isFloat16 = true;
623  continue;
624  }
625 
626  isFloat = true;
627  continue; // Success.
628  case 'q': // FP Suffix for "__float128"
629  case 'Q':
630  if (!isFPConstant) break; // Error for integer constant.
631  if (isHalf || isFloat || isLong || isFloat128)
632  break; // HQ, FQ, LQ, QQ invalid.
633  isFloat128 = true;
634  continue; // Success.
635  case 'u':
636  case 'U':
637  if (isFPConstant) break; // Error for floating constant.
638  if (isUnsigned) break; // Cannot be repeated.
639  isUnsigned = true;
640  continue; // Success.
641  case 'l':
642  case 'L':
643  if (isLong || isLongLong) break; // Cannot be repeated.
644  if (isHalf || isFloat || isFloat128) break; // LH, LF, LQ invalid.
645 
646  // Check for long long. The L's need to be adjacent and the same case.
647  if (s[1] == s[0]) {
648  assert(s + 1 < ThisTokEnd && "didn't maximally munch?");
649  if (isFPConstant) break; // long long invalid for floats.
650  isLongLong = true;
651  ++s; // Eat both of them.
652  } else {
653  isLong = true;
654  }
655  continue; // Success.
656  case 'i':
657  case 'I':
658  if (PP.getLangOpts().MicrosoftExt) {
660  break;
661 
662  if (!isFPConstant) {
663  // Allow i8, i16, i32, and i64.
664  switch (s[1]) {
665  case '8':
666  s += 2; // i8 suffix
667  MicrosoftInteger = 8;
668  break;
669  case '1':
670  if (s[2] == '6') {
671  s += 3; // i16 suffix
672  MicrosoftInteger = 16;
673  }
674  break;
675  case '3':
676  if (s[2] == '2') {
677  s += 3; // i32 suffix
678  MicrosoftInteger = 32;
679  }
680  break;
681  case '6':
682  if (s[2] == '4') {
683  s += 3; // i64 suffix
684  MicrosoftInteger = 64;
685  }
686  break;
687  default:
688  break;
689  }
690  }
691  if (MicrosoftInteger) {
692  assert(s <= ThisTokEnd && "didn't maximally munch?");
693  break;
694  }
695  }
696  // fall through.
697  case 'j':
698  case 'J':
699  if (isImaginary) break; // Cannot be repeated.
700  isImaginary = true;
701  continue; // Success.
702  }
703  // If we reached here, there was an error or a ud-suffix.
704  break;
705  }
706 
707  // "i", "if", and "il" are user-defined suffixes in C++1y.
708  if (s != ThisTokEnd || isImaginary) {
709  // FIXME: Don't bother expanding UCNs if !tok.hasUCN().
710  expandUCNs(UDSuffixBuf, StringRef(SuffixBegin, ThisTokEnd - SuffixBegin));
711  if (isValidUDSuffix(PP.getLangOpts(), UDSuffixBuf)) {
712  if (!isImaginary) {
713  // Any suffix pieces we might have parsed are actually part of the
714  // ud-suffix.
715  isLong = false;
716  isUnsigned = false;
717  isLongLong = false;
718  isFloat = false;
719  isFloat16 = false;
720  isHalf = false;
721  isImaginary = false;
722  MicrosoftInteger = 0;
723  saw_fixed_point_suffix = false;
724  isFract = false;
725  isAccum = false;
726  }
727 
728  saw_ud_suffix = true;
729  return;
730  }
731 
732  if (s != ThisTokEnd) {
733  // Report an error if there are any.
734  PP.Diag(PP.AdvanceToTokenCharacter(TokLoc, SuffixBegin - ThisTokBegin),
735  diag::err_invalid_suffix_constant)
736  << StringRef(SuffixBegin, ThisTokEnd - SuffixBegin) << isFPConstant;
737  hadError = true;
738  }
739  }
740 
741  if (!hadError && saw_fixed_point_suffix) {
742  assert(isFract || isAccum);
743  }
744 }
745 
746 /// ParseDecimalOrOctalCommon - This method is called for decimal or octal
747 /// numbers. It issues an error for illegal digits, and handles floating point
748 /// parsing. If it detects a floating point number, the radix is set to 10.
749 void NumericLiteralParser::ParseDecimalOrOctalCommon(SourceLocation TokLoc){
750  assert((radix == 8 || radix == 10) && "Unexpected radix");
751 
752  // If we have a hex digit other than 'e' (which denotes a FP exponent) then
753  // the code is using an incorrect base.
754  if (isHexDigit(*s) && *s != 'e' && *s != 'E' &&
755  !isValidUDSuffix(PP.getLangOpts(), StringRef(s, ThisTokEnd - s))) {
756  PP.Diag(PP.AdvanceToTokenCharacter(TokLoc, s-ThisTokBegin),
757  diag::err_invalid_digit) << StringRef(s, 1) << (radix == 8 ? 1 : 0);
758  hadError = true;
759  return;
760  }
761 
762  if (*s == '.') {
763  checkSeparator(TokLoc, s, CSK_AfterDigits);
764  s++;
765  radix = 10;
766  saw_period = true;
767  checkSeparator(TokLoc, s, CSK_BeforeDigits);
768  s = SkipDigits(s); // Skip suffix.
769  }
770  if (*s == 'e' || *s == 'E') { // exponent
771  checkSeparator(TokLoc, s, CSK_AfterDigits);
772  const char *Exponent = s;
773  s++;
774  radix = 10;
775  saw_exponent = true;
776  if (s != ThisTokEnd && (*s == '+' || *s == '-')) s++; // sign
777  const char *first_non_digit = SkipDigits(s);
778  if (containsDigits(s, first_non_digit)) {
779  checkSeparator(TokLoc, s, CSK_BeforeDigits);
780  s = first_non_digit;
781  } else {
782  if (!hadError) {
783  PP.Diag(PP.AdvanceToTokenCharacter(TokLoc, Exponent-ThisTokBegin),
784  diag::err_exponent_has_no_digits);
785  hadError = true;
786  }
787  return;
788  }
789  }
790 }
791 
792 /// Determine whether a suffix is a valid ud-suffix. We avoid treating reserved
793 /// suffixes as ud-suffixes, because the diagnostic experience is better if we
794 /// treat it as an invalid suffix.
796  StringRef Suffix) {
797  if (!LangOpts.CPlusPlus11 || Suffix.empty())
798  return false;
799 
800  // By C++11 [lex.ext]p10, ud-suffixes starting with an '_' are always valid.
801  if (Suffix[0] == '_')
802  return true;
803 
804  // In C++11, there are no library suffixes.
805  if (!LangOpts.CPlusPlus14)
806  return false;
807 
808  // In C++14, "s", "h", "min", "ms", "us", and "ns" are used in the library.
809  // Per tweaked N3660, "il", "i", and "if" are also used in the library.
810  // In C++2a "d" and "y" are used in the library.
811  return llvm::StringSwitch<bool>(Suffix)
812  .Cases("h", "min", "s", true)
813  .Cases("ms", "us", "ns", true)
814  .Cases("il", "i", "if", true)
815  .Cases("d", "y", LangOpts.CPlusPlus2a)
816  .Default(false);
817 }
818 
819 void NumericLiteralParser::checkSeparator(SourceLocation TokLoc,
820  const char *Pos,
821  CheckSeparatorKind IsAfterDigits) {
822  if (IsAfterDigits == CSK_AfterDigits) {
823  if (Pos == ThisTokBegin)
824  return;
825  --Pos;
826  } else if (Pos == ThisTokEnd)
827  return;
828 
829  if (isDigitSeparator(*Pos)) {
830  PP.Diag(PP.AdvanceToTokenCharacter(TokLoc, Pos - ThisTokBegin),
831  diag::err_digit_separator_not_between_digits)
832  << IsAfterDigits;
833  hadError = true;
834  }
835 }
836 
837 /// ParseNumberStartingWithZero - This method is called when the first character
838 /// of the number is found to be a zero. This means it is either an octal
839 /// number (like '04') or a hex number ('0x123a') a binary number ('0b1010') or
840 /// a floating point number (01239.123e4). Eat the prefix, determining the
841 /// radix etc.
842 void NumericLiteralParser::ParseNumberStartingWithZero(SourceLocation TokLoc) {
843  assert(s[0] == '0' && "Invalid method call");
844  s++;
845 
846  int c1 = s[0];
847 
848  // Handle a hex number like 0x1234.
849  if ((c1 == 'x' || c1 == 'X') && (isHexDigit(s[1]) || s[1] == '.')) {
850  s++;
851  assert(s < ThisTokEnd && "didn't maximally munch?");
852  radix = 16;
853  DigitsBegin = s;
854  s = SkipHexDigits(s);
855  bool HasSignificandDigits = containsDigits(DigitsBegin, s);
856  if (s == ThisTokEnd) {
857  // Done.
858  } else if (*s == '.') {
859  s++;
860  saw_period = true;
861  const char *floatDigitsBegin = s;
862  s = SkipHexDigits(s);
863  if (containsDigits(floatDigitsBegin, s))
864  HasSignificandDigits = true;
865  if (HasSignificandDigits)
866  checkSeparator(TokLoc, floatDigitsBegin, CSK_BeforeDigits);
867  }
868 
869  if (!HasSignificandDigits) {
870  PP.Diag(PP.AdvanceToTokenCharacter(TokLoc, s - ThisTokBegin),
871  diag::err_hex_constant_requires)
872  << PP.getLangOpts().CPlusPlus << 1;
873  hadError = true;
874  return;
875  }
876 
877  // A binary exponent can appear with or with a '.'. If dotted, the
878  // binary exponent is required.
879  if (*s == 'p' || *s == 'P') {
880  checkSeparator(TokLoc, s, CSK_AfterDigits);
881  const char *Exponent = s;
882  s++;
883  saw_exponent = true;
884  if (s != ThisTokEnd && (*s == '+' || *s == '-')) s++; // sign
885  const char *first_non_digit = SkipDigits(s);
886  if (!containsDigits(s, first_non_digit)) {
887  if (!hadError) {
888  PP.Diag(PP.AdvanceToTokenCharacter(TokLoc, Exponent-ThisTokBegin),
889  diag::err_exponent_has_no_digits);
890  hadError = true;
891  }
892  return;
893  }
894  checkSeparator(TokLoc, s, CSK_BeforeDigits);
895  s = first_non_digit;
896 
897  if (!PP.getLangOpts().HexFloats)
898  PP.Diag(TokLoc, PP.getLangOpts().CPlusPlus
899  ? diag::ext_hex_literal_invalid
900  : diag::ext_hex_constant_invalid);
901  else if (PP.getLangOpts().CPlusPlus17)
902  PP.Diag(TokLoc, diag::warn_cxx17_hex_literal);
903  } else if (saw_period) {
904  PP.Diag(PP.AdvanceToTokenCharacter(TokLoc, s - ThisTokBegin),
905  diag::err_hex_constant_requires)
906  << PP.getLangOpts().CPlusPlus << 0;
907  hadError = true;
908  }
909  return;
910  }
911 
912  // Handle simple binary numbers 0b01010
913  if ((c1 == 'b' || c1 == 'B') && (s[1] == '0' || s[1] == '1')) {
914  // 0b101010 is a C++1y / GCC extension.
915  PP.Diag(TokLoc,
916  PP.getLangOpts().CPlusPlus14
917  ? diag::warn_cxx11_compat_binary_literal
918  : PP.getLangOpts().CPlusPlus
919  ? diag::ext_binary_literal_cxx14
920  : diag::ext_binary_literal);
921  ++s;
922  assert(s < ThisTokEnd && "didn't maximally munch?");
923  radix = 2;
924  DigitsBegin = s;
925  s = SkipBinaryDigits(s);
926  if (s == ThisTokEnd) {
927  // Done.
928  } else if (isHexDigit(*s) &&
930  StringRef(s, ThisTokEnd - s))) {
931  PP.Diag(PP.AdvanceToTokenCharacter(TokLoc, s-ThisTokBegin),
932  diag::err_invalid_digit) << StringRef(s, 1) << 2;
933  hadError = true;
934  }
935  // Other suffixes will be diagnosed by the caller.
936  return;
937  }
938 
939  // For now, the radix is set to 8. If we discover that we have a
940  // floating point constant, the radix will change to 10. Octal floating
941  // point constants are not permitted (only decimal and hexadecimal).
942  radix = 8;
943  DigitsBegin = s;
944  s = SkipOctalDigits(s);
945  if (s == ThisTokEnd)
946  return; // Done, simple octal number like 01234
947 
948  // If we have some other non-octal digit that *is* a decimal digit, see if
949  // this is part of a floating point number like 094.123 or 09e1.
950  if (isDigit(*s)) {
951  const char *EndDecimal = SkipDigits(s);
952  if (EndDecimal[0] == '.' || EndDecimal[0] == 'e' || EndDecimal[0] == 'E') {
953  s = EndDecimal;
954  radix = 10;
955  }
956  }
957 
958  ParseDecimalOrOctalCommon(TokLoc);
959 }
960 
961 static bool alwaysFitsInto64Bits(unsigned Radix, unsigned NumDigits) {
962  switch (Radix) {
963  case 2:
964  return NumDigits <= 64;
965  case 8:
966  return NumDigits <= 64 / 3; // Digits are groups of 3 bits.
967  case 10:
968  return NumDigits <= 19; // floor(log10(2^64))
969  case 16:
970  return NumDigits <= 64 / 4; // Digits are groups of 4 bits.
971  default:
972  llvm_unreachable("impossible Radix");
973  }
974 }
975 
976 /// GetIntegerValue - Convert this numeric literal value to an APInt that
977 /// matches Val's input width. If there is an overflow, set Val to the low bits
978 /// of the result and return true. Otherwise, return false.
980  // Fast path: Compute a conservative bound on the maximum number of
981  // bits per digit in this radix. If we can't possibly overflow a
982  // uint64 based on that bound then do the simple conversion to
983  // integer. This avoids the expensive overflow checking below, and
984  // handles the common cases that matter (small decimal integers and
985  // hex/octal values which don't overflow).
986  const unsigned NumDigits = SuffixBegin - DigitsBegin;
987  if (alwaysFitsInto64Bits(radix, NumDigits)) {
988  uint64_t N = 0;
989  for (const char *Ptr = DigitsBegin; Ptr != SuffixBegin; ++Ptr)
990  if (!isDigitSeparator(*Ptr))
991  N = N * radix + llvm::hexDigitValue(*Ptr);
992 
993  // This will truncate the value to Val's input width. Simply check
994  // for overflow by comparing.
995  Val = N;
996  return Val.getZExtValue() != N;
997  }
998 
999  Val = 0;
1000  const char *Ptr = DigitsBegin;
1001 
1002  llvm::APInt RadixVal(Val.getBitWidth(), radix);
1003  llvm::APInt CharVal(Val.getBitWidth(), 0);
1004  llvm::APInt OldVal = Val;
1005 
1006  bool OverflowOccurred = false;
1007  while (Ptr < SuffixBegin) {
1008  if (isDigitSeparator(*Ptr)) {
1009  ++Ptr;
1010  continue;
1011  }
1012 
1013  unsigned C = llvm::hexDigitValue(*Ptr++);
1014 
1015  // If this letter is out of bound for this radix, reject it.
1016  assert(C < radix && "NumericLiteralParser ctor should have rejected this");
1017 
1018  CharVal = C;
1019 
1020  // Add the digit to the value in the appropriate radix. If adding in digits
1021  // made the value smaller, then this overflowed.
1022  OldVal = Val;
1023 
1024  // Multiply by radix, did overflow occur on the multiply?
1025  Val *= RadixVal;
1026  OverflowOccurred |= Val.udiv(RadixVal) != OldVal;
1027 
1028  // Add value, did overflow occur on the value?
1029  // (a + b) ult b <=> overflow
1030  Val += CharVal;
1031  OverflowOccurred |= Val.ult(CharVal);
1032  }
1033  return OverflowOccurred;
1034 }
1035 
1036 llvm::APFloat::opStatus
1038  using llvm::APFloat;
1039 
1040  unsigned n = std::min(SuffixBegin - ThisTokBegin, ThisTokEnd - ThisTokBegin);
1041 
1042  llvm::SmallString<16> Buffer;
1043  StringRef Str(ThisTokBegin, n);
1044  if (Str.find('\'') != StringRef::npos) {
1045  Buffer.reserve(n);
1046  std::remove_copy_if(Str.begin(), Str.end(), std::back_inserter(Buffer),
1047  &isDigitSeparator);
1048  Str = Buffer;
1049  }
1050 
1051  return Result.convertFromString(Str, APFloat::rmNearestTiesToEven);
1052 }
1053 
1054 static inline bool IsExponentPart(char c) {
1055  return c == 'p' || c == 'P' || c == 'e' || c == 'E';
1056 }
1057 
1058 bool NumericLiteralParser::GetFixedPointValue(llvm::APInt &StoreVal, unsigned Scale) {
1059  assert(radix == 16 || radix == 10);
1060 
1061  // Find how many digits are needed to store the whole literal.
1062  unsigned NumDigits = SuffixBegin - DigitsBegin;
1063  if (saw_period) --NumDigits;
1064 
1065  // Initial scan of the exponent if it exists
1066  bool ExpOverflowOccurred = false;
1067  bool NegativeExponent = false;
1068  const char *ExponentBegin;
1069  uint64_t Exponent = 0;
1070  int64_t BaseShift = 0;
1071  if (saw_exponent) {
1072  const char *Ptr = DigitsBegin;
1073 
1074  while (!IsExponentPart(*Ptr)) ++Ptr;
1075  ExponentBegin = Ptr;
1076  ++Ptr;
1077  NegativeExponent = *Ptr == '-';
1078  if (NegativeExponent) ++Ptr;
1079 
1080  unsigned NumExpDigits = SuffixBegin - Ptr;
1081  if (alwaysFitsInto64Bits(radix, NumExpDigits)) {
1082  llvm::StringRef ExpStr(Ptr, NumExpDigits);
1083  llvm::APInt ExpInt(/*numBits=*/64, ExpStr, /*radix=*/10);
1084  Exponent = ExpInt.getZExtValue();
1085  } else {
1086  ExpOverflowOccurred = true;
1087  }
1088 
1089  if (NegativeExponent) BaseShift -= Exponent;
1090  else BaseShift += Exponent;
1091  }
1092 
1093  // Number of bits needed for decimal literal is
1094  // ceil(NumDigits * log2(10)) Integral part
1095  // + Scale Fractional part
1096  // + ceil(Exponent * log2(10)) Exponent
1097  // --------------------------------------------------
1098  // ceil((NumDigits + Exponent) * log2(10)) + Scale
1099  //
1100  // But for simplicity in handling integers, we can round up log2(10) to 4,
1101  // making:
1102  // 4 * (NumDigits + Exponent) + Scale
1103  //
1104  // Number of digits needed for hexadecimal literal is
1105  // 4 * NumDigits Integral part
1106  // + Scale Fractional part
1107  // + Exponent Exponent
1108  // --------------------------------------------------
1109  // (4 * NumDigits) + Scale + Exponent
1110  uint64_t NumBitsNeeded;
1111  if (radix == 10)
1112  NumBitsNeeded = 4 * (NumDigits + Exponent) + Scale;
1113  else
1114  NumBitsNeeded = 4 * NumDigits + Exponent + Scale;
1115 
1116  if (NumBitsNeeded > std::numeric_limits<unsigned>::max())
1117  ExpOverflowOccurred = true;
1118  llvm::APInt Val(static_cast<unsigned>(NumBitsNeeded), 0, /*isSigned=*/false);
1119 
1120  bool FoundDecimal = false;
1121 
1122  int64_t FractBaseShift = 0;
1123  const char *End = saw_exponent ? ExponentBegin : SuffixBegin;
1124  for (const char *Ptr = DigitsBegin; Ptr < End; ++Ptr) {
1125  if (*Ptr == '.') {
1126  FoundDecimal = true;
1127  continue;
1128  }
1129 
1130  // Normal reading of an integer
1131  unsigned C = llvm::hexDigitValue(*Ptr);
1132  assert(C < radix && "NumericLiteralParser ctor should have rejected this");
1133 
1134  Val *= radix;
1135  Val += C;
1136 
1137  if (FoundDecimal)
1138  // Keep track of how much we will need to adjust this value by from the
1139  // number of digits past the radix point.
1140  --FractBaseShift;
1141  }
1142 
1143  // For a radix of 16, we will be multiplying by 2 instead of 16.
1144  if (radix == 16) FractBaseShift *= 4;
1145  BaseShift += FractBaseShift;
1146 
1147  Val <<= Scale;
1148 
1149  uint64_t Base = (radix == 16) ? 2 : 10;
1150  if (BaseShift > 0) {
1151  for (int64_t i = 0; i < BaseShift; ++i) {
1152  Val *= Base;
1153  }
1154  } else if (BaseShift < 0) {
1155  for (int64_t i = BaseShift; i < 0 && !Val.isNullValue(); ++i)
1156  Val = Val.udiv(Base);
1157  }
1158 
1159  bool IntOverflowOccurred = false;
1160  auto MaxVal = llvm::APInt::getMaxValue(StoreVal.getBitWidth());
1161  if (Val.getBitWidth() > StoreVal.getBitWidth()) {
1162  IntOverflowOccurred |= Val.ugt(MaxVal.zext(Val.getBitWidth()));
1163  StoreVal = Val.trunc(StoreVal.getBitWidth());
1164  } else if (Val.getBitWidth() < StoreVal.getBitWidth()) {
1165  IntOverflowOccurred |= Val.zext(MaxVal.getBitWidth()).ugt(MaxVal);
1166  StoreVal = Val.zext(StoreVal.getBitWidth());
1167  } else {
1168  StoreVal = Val;
1169  }
1170 
1171  return IntOverflowOccurred || ExpOverflowOccurred;
1172 }
1173 
1174 /// \verbatim
1175 /// user-defined-character-literal: [C++11 lex.ext]
1176 /// character-literal ud-suffix
1177 /// ud-suffix:
1178 /// identifier
1179 /// character-literal: [C++11 lex.ccon]
1180 /// ' c-char-sequence '
1181 /// u' c-char-sequence '
1182 /// U' c-char-sequence '
1183 /// L' c-char-sequence '
1184 /// u8' c-char-sequence ' [C++1z lex.ccon]
1185 /// c-char-sequence:
1186 /// c-char
1187 /// c-char-sequence c-char
1188 /// c-char:
1189 /// any member of the source character set except the single-quote ',
1190 /// backslash \, or new-line character
1191 /// escape-sequence
1192 /// universal-character-name
1193 /// escape-sequence:
1194 /// simple-escape-sequence
1195 /// octal-escape-sequence
1196 /// hexadecimal-escape-sequence
1197 /// simple-escape-sequence:
1198 /// one of \' \" \? \\ \a \b \f \n \r \t \v
1199 /// octal-escape-sequence:
1200 /// \ octal-digit
1201 /// \ octal-digit octal-digit
1202 /// \ octal-digit octal-digit octal-digit
1203 /// hexadecimal-escape-sequence:
1204 /// \x hexadecimal-digit
1205 /// hexadecimal-escape-sequence hexadecimal-digit
1206 /// universal-character-name: [C++11 lex.charset]
1207 /// \u hex-quad
1208 /// \U hex-quad hex-quad
1209 /// hex-quad:
1210 /// hex-digit hex-digit hex-digit hex-digit
1211 /// \endverbatim
1212 ///
1213 CharLiteralParser::CharLiteralParser(const char *begin, const char *end,
1214  SourceLocation Loc, Preprocessor &PP,
1215  tok::TokenKind kind) {
1216  // At this point we know that the character matches the regex "(L|u|U)?'.*'".
1217  HadError = false;
1218 
1219  Kind = kind;
1220 
1221  const char *TokBegin = begin;
1222 
1223  // Skip over wide character determinant.
1224  if (Kind != tok::char_constant)
1225  ++begin;
1226  if (Kind == tok::utf8_char_constant)
1227  ++begin;
1228 
1229  // Skip over the entry quote.
1230  assert(begin[0] == '\'' && "Invalid token lexed");
1231  ++begin;
1232 
1233  // Remove an optional ud-suffix.
1234  if (end[-1] != '\'') {
1235  const char *UDSuffixEnd = end;
1236  do {
1237  --end;
1238  } while (end[-1] != '\'');
1239  // FIXME: Don't bother with this if !tok.hasUCN().
1240  expandUCNs(UDSuffixBuf, StringRef(end, UDSuffixEnd - end));
1241  UDSuffixOffset = end - TokBegin;
1242  }
1243 
1244  // Trim the ending quote.
1245  assert(end != begin && "Invalid token lexed");
1246  --end;
1247 
1248  // FIXME: The "Value" is an uint64_t so we can handle char literals of
1249  // up to 64-bits.
1250  // FIXME: This extensively assumes that 'char' is 8-bits.
1251  assert(PP.getTargetInfo().getCharWidth() == 8 &&
1252  "Assumes char is 8 bits");
1253  assert(PP.getTargetInfo().getIntWidth() <= 64 &&
1254  (PP.getTargetInfo().getIntWidth() & 7) == 0 &&
1255  "Assumes sizeof(int) on target is <= 64 and a multiple of char");
1256  assert(PP.getTargetInfo().getWCharWidth() <= 64 &&
1257  "Assumes sizeof(wchar) on target is <= 64");
1258 
1259  SmallVector<uint32_t, 4> codepoint_buffer;
1260  codepoint_buffer.resize(end - begin);
1261  uint32_t *buffer_begin = &codepoint_buffer.front();
1262  uint32_t *buffer_end = buffer_begin + codepoint_buffer.size();
1263 
1264  // Unicode escapes representing characters that cannot be correctly
1265  // represented in a single code unit are disallowed in character literals
1266  // by this implementation.
1267  uint32_t largest_character_for_kind;
1268  if (tok::wide_char_constant == Kind) {
1269  largest_character_for_kind =
1270  0xFFFFFFFFu >> (32-PP.getTargetInfo().getWCharWidth());
1271  } else if (tok::utf8_char_constant == Kind) {
1272  largest_character_for_kind = 0x7F;
1273  } else if (tok::utf16_char_constant == Kind) {
1274  largest_character_for_kind = 0xFFFF;
1275  } else if (tok::utf32_char_constant == Kind) {
1276  largest_character_for_kind = 0x10FFFF;
1277  } else {
1278  largest_character_for_kind = 0x7Fu;
1279  }
1280 
1281  while (begin != end) {
1282  // Is this a span of non-escape characters?
1283  if (begin[0] != '\\') {
1284  char const *start = begin;
1285  do {
1286  ++begin;
1287  } while (begin != end && *begin != '\\');
1288 
1289  char const *tmp_in_start = start;
1290  uint32_t *tmp_out_start = buffer_begin;
1291  llvm::ConversionResult res =
1292  llvm::ConvertUTF8toUTF32(reinterpret_cast<llvm::UTF8 const **>(&start),
1293  reinterpret_cast<llvm::UTF8 const *>(begin),
1294  &buffer_begin, buffer_end, llvm::strictConversion);
1295  if (res != llvm::conversionOK) {
1296  // If we see bad encoding for unprefixed character literals, warn and
1297  // simply copy the byte values, for compatibility with gcc and
1298  // older versions of clang.
1299  bool NoErrorOnBadEncoding = isAscii();
1300  unsigned Msg = diag::err_bad_character_encoding;
1301  if (NoErrorOnBadEncoding)
1302  Msg = diag::warn_bad_character_encoding;
1303  PP.Diag(Loc, Msg);
1304  if (NoErrorOnBadEncoding) {
1305  start = tmp_in_start;
1306  buffer_begin = tmp_out_start;
1307  for (; start != begin; ++start, ++buffer_begin)
1308  *buffer_begin = static_cast<uint8_t>(*start);
1309  } else {
1310  HadError = true;
1311  }
1312  } else {
1313  for (; tmp_out_start < buffer_begin; ++tmp_out_start) {
1314  if (*tmp_out_start > largest_character_for_kind) {
1315  HadError = true;
1316  PP.Diag(Loc, diag::err_character_too_large);
1317  }
1318  }
1319  }
1320 
1321  continue;
1322  }
1323  // Is this a Universal Character Name escape?
1324  if (begin[1] == 'u' || begin[1] == 'U') {
1325  unsigned short UcnLen = 0;
1326  if (!ProcessUCNEscape(TokBegin, begin, end, *buffer_begin, UcnLen,
1327  FullSourceLoc(Loc, PP.getSourceManager()),
1328  &PP.getDiagnostics(), PP.getLangOpts(), true)) {
1329  HadError = true;
1330  } else if (*buffer_begin > largest_character_for_kind) {
1331  HadError = true;
1332  PP.Diag(Loc, diag::err_character_too_large);
1333  }
1334 
1335  ++buffer_begin;
1336  continue;
1337  }
1338  unsigned CharWidth = getCharWidth(Kind, PP.getTargetInfo());
1339  uint64_t result =
1340  ProcessCharEscape(TokBegin, begin, end, HadError,
1341  FullSourceLoc(Loc,PP.getSourceManager()),
1342  CharWidth, &PP.getDiagnostics(), PP.getLangOpts());
1343  *buffer_begin++ = result;
1344  }
1345 
1346  unsigned NumCharsSoFar = buffer_begin - &codepoint_buffer.front();
1347 
1348  if (NumCharsSoFar > 1) {
1349  if (isWide())
1350  PP.Diag(Loc, diag::warn_extraneous_char_constant);
1351  else if (isAscii() && NumCharsSoFar == 4)
1352  PP.Diag(Loc, diag::ext_four_char_character_literal);
1353  else if (isAscii())
1354  PP.Diag(Loc, diag::ext_multichar_character_literal);
1355  else
1356  PP.Diag(Loc, diag::err_multichar_utf_character_literal);
1357  IsMultiChar = true;
1358  } else {
1359  IsMultiChar = false;
1360  }
1361 
1362  llvm::APInt LitVal(PP.getTargetInfo().getIntWidth(), 0);
1363 
1364  // Narrow character literals act as though their value is concatenated
1365  // in this implementation, but warn on overflow.
1366  bool multi_char_too_long = false;
1367  if (isAscii() && isMultiChar()) {
1368  LitVal = 0;
1369  for (size_t i = 0; i < NumCharsSoFar; ++i) {
1370  // check for enough leading zeros to shift into
1371  multi_char_too_long |= (LitVal.countLeadingZeros() < 8);
1372  LitVal <<= 8;
1373  LitVal = LitVal + (codepoint_buffer[i] & 0xFF);
1374  }
1375  } else if (NumCharsSoFar > 0) {
1376  // otherwise just take the last character
1377  LitVal = buffer_begin[-1];
1378  }
1379 
1380  if (!HadError && multi_char_too_long) {
1381  PP.Diag(Loc, diag::warn_char_constant_too_large);
1382  }
1383 
1384  // Transfer the value from APInt to uint64_t
1385  Value = LitVal.getZExtValue();
1386 
1387  // If this is a single narrow character, sign extend it (e.g. '\xFF' is "-1")
1388  // if 'char' is signed for this target (C99 6.4.4.4p10). Note that multiple
1389  // character constants are not sign extended in the this implementation:
1390  // '\xFF\xFF' = 65536 and '\x0\xFF' = 255, which matches GCC.
1391  if (isAscii() && NumCharsSoFar == 1 && (Value & 128) &&
1392  PP.getLangOpts().CharIsSigned)
1393  Value = (signed char)Value;
1394 }
1395 
1396 /// \verbatim
1397 /// string-literal: [C++0x lex.string]
1398 /// encoding-prefix " [s-char-sequence] "
1399 /// encoding-prefix R raw-string
1400 /// encoding-prefix:
1401 /// u8
1402 /// u
1403 /// U
1404 /// L
1405 /// s-char-sequence:
1406 /// s-char
1407 /// s-char-sequence s-char
1408 /// s-char:
1409 /// any member of the source character set except the double-quote ",
1410 /// backslash \, or new-line character
1411 /// escape-sequence
1412 /// universal-character-name
1413 /// raw-string:
1414 /// " d-char-sequence ( r-char-sequence ) d-char-sequence "
1415 /// r-char-sequence:
1416 /// r-char
1417 /// r-char-sequence r-char
1418 /// r-char:
1419 /// any member of the source character set, except a right parenthesis )
1420 /// followed by the initial d-char-sequence (which may be empty)
1421 /// followed by a double quote ".
1422 /// d-char-sequence:
1423 /// d-char
1424 /// d-char-sequence d-char
1425 /// d-char:
1426 /// any member of the basic source character set except:
1427 /// space, the left parenthesis (, the right parenthesis ),
1428 /// the backslash \, and the control characters representing horizontal
1429 /// tab, vertical tab, form feed, and newline.
1430 /// escape-sequence: [C++0x lex.ccon]
1431 /// simple-escape-sequence
1432 /// octal-escape-sequence
1433 /// hexadecimal-escape-sequence
1434 /// simple-escape-sequence:
1435 /// one of \' \" \? \\ \a \b \f \n \r \t \v
1436 /// octal-escape-sequence:
1437 /// \ octal-digit
1438 /// \ octal-digit octal-digit
1439 /// \ octal-digit octal-digit octal-digit
1440 /// hexadecimal-escape-sequence:
1441 /// \x hexadecimal-digit
1442 /// hexadecimal-escape-sequence hexadecimal-digit
1443 /// universal-character-name:
1444 /// \u hex-quad
1445 /// \U hex-quad hex-quad
1446 /// hex-quad:
1447 /// hex-digit hex-digit hex-digit hex-digit
1448 /// \endverbatim
1449 ///
1452  Preprocessor &PP, bool Complain)
1453  : SM(PP.getSourceManager()), Features(PP.getLangOpts()),
1454  Target(PP.getTargetInfo()), Diags(Complain ? &PP.getDiagnostics() :nullptr),
1455  MaxTokenLength(0), SizeBound(0), CharByteWidth(0), Kind(tok::unknown),
1456  ResultPtr(ResultBuf.data()), hadError(false), Pascal(false) {
1457  init(StringToks);
1458 }
1459 
1460 void StringLiteralParser::init(ArrayRef<Token> StringToks){
1461  // The literal token may have come from an invalid source location (e.g. due
1462  // to a PCH error), in which case the token length will be 0.
1463  if (StringToks.empty() || StringToks[0].getLength() < 2)
1464  return DiagnoseLexingError(SourceLocation());
1465 
1466  // Scan all of the string portions, remember the max individual token length,
1467  // computing a bound on the concatenated string length, and see whether any
1468  // piece is a wide-string. If any of the string portions is a wide-string
1469  // literal, the result is a wide-string literal [C99 6.4.5p4].
1470  assert(!StringToks.empty() && "expected at least one token");
1471  MaxTokenLength = StringToks[0].getLength();
1472  assert(StringToks[0].getLength() >= 2 && "literal token is invalid!");
1473  SizeBound = StringToks[0].getLength()-2; // -2 for "".
1474  Kind = StringToks[0].getKind();
1475 
1476  hadError = false;
1477 
1478  // Implement Translation Phase #6: concatenation of string literals
1479  /// (C99 5.1.1.2p1). The common case is only one string fragment.
1480  for (unsigned i = 1; i != StringToks.size(); ++i) {
1481  if (StringToks[i].getLength() < 2)
1482  return DiagnoseLexingError(StringToks[i].getLocation());
1483 
1484  // The string could be shorter than this if it needs cleaning, but this is a
1485  // reasonable bound, which is all we need.
1486  assert(StringToks[i].getLength() >= 2 && "literal token is invalid!");
1487  SizeBound += StringToks[i].getLength()-2; // -2 for "".
1488 
1489  // Remember maximum string piece length.
1490  if (StringToks[i].getLength() > MaxTokenLength)
1491  MaxTokenLength = StringToks[i].getLength();
1492 
1493  // Remember if we see any wide or utf-8/16/32 strings.
1494  // Also check for illegal concatenations.
1495  if (StringToks[i].isNot(Kind) && StringToks[i].isNot(tok::string_literal)) {
1496  if (isAscii()) {
1497  Kind = StringToks[i].getKind();
1498  } else {
1499  if (Diags)
1500  Diags->Report(StringToks[i].getLocation(),
1501  diag::err_unsupported_string_concat);
1502  hadError = true;
1503  }
1504  }
1505  }
1506 
1507  // Include space for the null terminator.
1508  ++SizeBound;
1509 
1510  // TODO: K&R warning: "traditional C rejects string constant concatenation"
1511 
1512  // Get the width in bytes of char/wchar_t/char16_t/char32_t
1513  CharByteWidth = getCharWidth(Kind, Target);
1514  assert((CharByteWidth & 7) == 0 && "Assumes character size is byte multiple");
1515  CharByteWidth /= 8;
1516 
1517  // The output buffer size needs to be large enough to hold wide characters.
1518  // This is a worst-case assumption which basically corresponds to L"" "long".
1519  SizeBound *= CharByteWidth;
1520 
1521  // Size the temporary buffer to hold the result string data.
1522  ResultBuf.resize(SizeBound);
1523 
1524  // Likewise, but for each string piece.
1525  SmallString<512> TokenBuf;
1526  TokenBuf.resize(MaxTokenLength);
1527 
1528  // Loop over all the strings, getting their spelling, and expanding them to
1529  // wide strings as appropriate.
1530  ResultPtr = &ResultBuf[0]; // Next byte to fill in.
1531 
1532  Pascal = false;
1533 
1534  SourceLocation UDSuffixTokLoc;
1535 
1536  for (unsigned i = 0, e = StringToks.size(); i != e; ++i) {
1537  const char *ThisTokBuf = &TokenBuf[0];
1538  // Get the spelling of the token, which eliminates trigraphs, etc. We know
1539  // that ThisTokBuf points to a buffer that is big enough for the whole token
1540  // and 'spelled' tokens can only shrink.
1541  bool StringInvalid = false;
1542  unsigned ThisTokLen =
1543  Lexer::getSpelling(StringToks[i], ThisTokBuf, SM, Features,
1544  &StringInvalid);
1545  if (StringInvalid)
1546  return DiagnoseLexingError(StringToks[i].getLocation());
1547 
1548  const char *ThisTokBegin = ThisTokBuf;
1549  const char *ThisTokEnd = ThisTokBuf+ThisTokLen;
1550 
1551  // Remove an optional ud-suffix.
1552  if (ThisTokEnd[-1] != '"') {
1553  const char *UDSuffixEnd = ThisTokEnd;
1554  do {
1555  --ThisTokEnd;
1556  } while (ThisTokEnd[-1] != '"');
1557 
1558  StringRef UDSuffix(ThisTokEnd, UDSuffixEnd - ThisTokEnd);
1559 
1560  if (UDSuffixBuf.empty()) {
1561  if (StringToks[i].hasUCN())
1562  expandUCNs(UDSuffixBuf, UDSuffix);
1563  else
1564  UDSuffixBuf.assign(UDSuffix);
1565  UDSuffixToken = i;
1566  UDSuffixOffset = ThisTokEnd - ThisTokBuf;
1567  UDSuffixTokLoc = StringToks[i].getLocation();
1568  } else {
1569  SmallString<32> ExpandedUDSuffix;
1570  if (StringToks[i].hasUCN()) {
1571  expandUCNs(ExpandedUDSuffix, UDSuffix);
1572  UDSuffix = ExpandedUDSuffix;
1573  }
1574 
1575  // C++11 [lex.ext]p8: At the end of phase 6, if a string literal is the
1576  // result of a concatenation involving at least one user-defined-string-
1577  // literal, all the participating user-defined-string-literals shall
1578  // have the same ud-suffix.
1579  if (UDSuffixBuf != UDSuffix) {
1580  if (Diags) {
1581  SourceLocation TokLoc = StringToks[i].getLocation();
1582  Diags->Report(TokLoc, diag::err_string_concat_mixed_suffix)
1583  << UDSuffixBuf << UDSuffix
1584  << SourceRange(UDSuffixTokLoc, UDSuffixTokLoc)
1585  << SourceRange(TokLoc, TokLoc);
1586  }
1587  hadError = true;
1588  }
1589  }
1590  }
1591 
1592  // Strip the end quote.
1593  --ThisTokEnd;
1594 
1595  // TODO: Input character set mapping support.
1596 
1597  // Skip marker for wide or unicode strings.
1598  if (ThisTokBuf[0] == 'L' || ThisTokBuf[0] == 'u' || ThisTokBuf[0] == 'U') {
1599  ++ThisTokBuf;
1600  // Skip 8 of u8 marker for utf8 strings.
1601  if (ThisTokBuf[0] == '8')
1602  ++ThisTokBuf;
1603  }
1604 
1605  // Check for raw string
1606  if (ThisTokBuf[0] == 'R') {
1607  ThisTokBuf += 2; // skip R"
1608 
1609  const char *Prefix = ThisTokBuf;
1610  while (ThisTokBuf[0] != '(')
1611  ++ThisTokBuf;
1612  ++ThisTokBuf; // skip '('
1613 
1614  // Remove same number of characters from the end
1615  ThisTokEnd -= ThisTokBuf - Prefix;
1616  assert(ThisTokEnd >= ThisTokBuf && "malformed raw string literal");
1617 
1618  // C++14 [lex.string]p4: A source-file new-line in a raw string literal
1619  // results in a new-line in the resulting execution string-literal.
1620  StringRef RemainingTokenSpan(ThisTokBuf, ThisTokEnd - ThisTokBuf);
1621  while (!RemainingTokenSpan.empty()) {
1622  // Split the string literal on \r\n boundaries.
1623  size_t CRLFPos = RemainingTokenSpan.find("\r\n");
1624  StringRef BeforeCRLF = RemainingTokenSpan.substr(0, CRLFPos);
1625  StringRef AfterCRLF = RemainingTokenSpan.substr(CRLFPos);
1626 
1627  // Copy everything before the \r\n sequence into the string literal.
1628  if (CopyStringFragment(StringToks[i], ThisTokBegin, BeforeCRLF))
1629  hadError = true;
1630 
1631  // Point into the \n inside the \r\n sequence and operate on the
1632  // remaining portion of the literal.
1633  RemainingTokenSpan = AfterCRLF.substr(1);
1634  }
1635  } else {
1636  if (ThisTokBuf[0] != '"') {
1637  // The file may have come from PCH and then changed after loading the
1638  // PCH; Fail gracefully.
1639  return DiagnoseLexingError(StringToks[i].getLocation());
1640  }
1641  ++ThisTokBuf; // skip "
1642 
1643  // Check if this is a pascal string
1644  if (Features.PascalStrings && ThisTokBuf + 1 != ThisTokEnd &&
1645  ThisTokBuf[0] == '\\' && ThisTokBuf[1] == 'p') {
1646 
1647  // If the \p sequence is found in the first token, we have a pascal string
1648  // Otherwise, if we already have a pascal string, ignore the first \p
1649  if (i == 0) {
1650  ++ThisTokBuf;
1651  Pascal = true;
1652  } else if (Pascal)
1653  ThisTokBuf += 2;
1654  }
1655 
1656  while (ThisTokBuf != ThisTokEnd) {
1657  // Is this a span of non-escape characters?
1658  if (ThisTokBuf[0] != '\\') {
1659  const char *InStart = ThisTokBuf;
1660  do {
1661  ++ThisTokBuf;
1662  } while (ThisTokBuf != ThisTokEnd && ThisTokBuf[0] != '\\');
1663 
1664  // Copy the character span over.
1665  if (CopyStringFragment(StringToks[i], ThisTokBegin,
1666  StringRef(InStart, ThisTokBuf - InStart)))
1667  hadError = true;
1668  continue;
1669  }
1670  // Is this a Universal Character Name escape?
1671  if (ThisTokBuf[1] == 'u' || ThisTokBuf[1] == 'U') {
1672  EncodeUCNEscape(ThisTokBegin, ThisTokBuf, ThisTokEnd,
1673  ResultPtr, hadError,
1674  FullSourceLoc(StringToks[i].getLocation(), SM),
1675  CharByteWidth, Diags, Features);
1676  continue;
1677  }
1678  // Otherwise, this is a non-UCN escape character. Process it.
1679  unsigned ResultChar =
1680  ProcessCharEscape(ThisTokBegin, ThisTokBuf, ThisTokEnd, hadError,
1681  FullSourceLoc(StringToks[i].getLocation(), SM),
1682  CharByteWidth*8, Diags, Features);
1683 
1684  if (CharByteWidth == 4) {
1685  // FIXME: Make the type of the result buffer correct instead of
1686  // using reinterpret_cast.
1687  llvm::UTF32 *ResultWidePtr = reinterpret_cast<llvm::UTF32*>(ResultPtr);
1688  *ResultWidePtr = ResultChar;
1689  ResultPtr += 4;
1690  } else if (CharByteWidth == 2) {
1691  // FIXME: Make the type of the result buffer correct instead of
1692  // using reinterpret_cast.
1693  llvm::UTF16 *ResultWidePtr = reinterpret_cast<llvm::UTF16*>(ResultPtr);
1694  *ResultWidePtr = ResultChar & 0xFFFF;
1695  ResultPtr += 2;
1696  } else {
1697  assert(CharByteWidth == 1 && "Unexpected char width");
1698  *ResultPtr++ = ResultChar & 0xFF;
1699  }
1700  }
1701  }
1702  }
1703 
1704  if (Pascal) {
1705  if (CharByteWidth == 4) {
1706  // FIXME: Make the type of the result buffer correct instead of
1707  // using reinterpret_cast.
1708  llvm::UTF32 *ResultWidePtr = reinterpret_cast<llvm::UTF32*>(ResultBuf.data());
1709  ResultWidePtr[0] = GetNumStringChars() - 1;
1710  } else if (CharByteWidth == 2) {
1711  // FIXME: Make the type of the result buffer correct instead of
1712  // using reinterpret_cast.
1713  llvm::UTF16 *ResultWidePtr = reinterpret_cast<llvm::UTF16*>(ResultBuf.data());
1714  ResultWidePtr[0] = GetNumStringChars() - 1;
1715  } else {
1716  assert(CharByteWidth == 1 && "Unexpected char width");
1717  ResultBuf[0] = GetNumStringChars() - 1;
1718  }
1719 
1720  // Verify that pascal strings aren't too large.
1721  if (GetStringLength() > 256) {
1722  if (Diags)
1723  Diags->Report(StringToks.front().getLocation(),
1724  diag::err_pascal_string_too_long)
1725  << SourceRange(StringToks.front().getLocation(),
1726  StringToks.back().getLocation());
1727  hadError = true;
1728  return;
1729  }
1730  } else if (Diags) {
1731  // Complain if this string literal has too many characters.
1732  unsigned MaxChars = Features.CPlusPlus? 65536 : Features.C99 ? 4095 : 509;
1733 
1734  if (GetNumStringChars() > MaxChars)
1735  Diags->Report(StringToks.front().getLocation(),
1736  diag::ext_string_too_long)
1737  << GetNumStringChars() << MaxChars
1738  << (Features.CPlusPlus ? 2 : Features.C99 ? 1 : 0)
1739  << SourceRange(StringToks.front().getLocation(),
1740  StringToks.back().getLocation());
1741  }
1742 }
1743 
1744 static const char *resyncUTF8(const char *Err, const char *End) {
1745  if (Err == End)
1746  return End;
1747  End = Err + std::min<unsigned>(llvm::getNumBytesForUTF8(*Err), End-Err);
1748  while (++Err != End && (*Err & 0xC0) == 0x80)
1749  ;
1750  return Err;
1751 }
1752 
1753 /// This function copies from Fragment, which is a sequence of bytes
1754 /// within Tok's contents (which begin at TokBegin) into ResultPtr.
1755 /// Performs widening for multi-byte characters.
1756 bool StringLiteralParser::CopyStringFragment(const Token &Tok,
1757  const char *TokBegin,
1758  StringRef Fragment) {
1759  const llvm::UTF8 *ErrorPtrTmp;
1760  if (ConvertUTF8toWide(CharByteWidth, Fragment, ResultPtr, ErrorPtrTmp))
1761  return false;
1762 
1763  // If we see bad encoding for unprefixed string literals, warn and
1764  // simply copy the byte values, for compatibility with gcc and older
1765  // versions of clang.
1766  bool NoErrorOnBadEncoding = isAscii();
1767  if (NoErrorOnBadEncoding) {
1768  memcpy(ResultPtr, Fragment.data(), Fragment.size());
1769  ResultPtr += Fragment.size();
1770  }
1771 
1772  if (Diags) {
1773  const char *ErrorPtr = reinterpret_cast<const char *>(ErrorPtrTmp);
1774 
1775  FullSourceLoc SourceLoc(Tok.getLocation(), SM);
1776  const DiagnosticBuilder &Builder =
1777  Diag(Diags, Features, SourceLoc, TokBegin,
1778  ErrorPtr, resyncUTF8(ErrorPtr, Fragment.end()),
1779  NoErrorOnBadEncoding ? diag::warn_bad_string_encoding
1780  : diag::err_bad_string_encoding);
1781 
1782  const char *NextStart = resyncUTF8(ErrorPtr, Fragment.end());
1783  StringRef NextFragment(NextStart, Fragment.end()-NextStart);
1784 
1785  // Decode into a dummy buffer.
1786  SmallString<512> Dummy;
1787  Dummy.reserve(Fragment.size() * CharByteWidth);
1788  char *Ptr = Dummy.data();
1789 
1790  while (!ConvertUTF8toWide(CharByteWidth, NextFragment, Ptr, ErrorPtrTmp)) {
1791  const char *ErrorPtr = reinterpret_cast<const char *>(ErrorPtrTmp);
1792  NextStart = resyncUTF8(ErrorPtr, Fragment.end());
1793  Builder << MakeCharSourceRange(Features, SourceLoc, TokBegin,
1794  ErrorPtr, NextStart);
1795  NextFragment = StringRef(NextStart, Fragment.end()-NextStart);
1796  }
1797  }
1798  return !NoErrorOnBadEncoding;
1799 }
1800 
1801 void StringLiteralParser::DiagnoseLexingError(SourceLocation Loc) {
1802  hadError = true;
1803  if (Diags)
1804  Diags->Report(Loc, diag::err_lexing_string);
1805 }
1806 
1807 /// getOffsetOfStringByte - This function returns the offset of the
1808 /// specified byte of the string data represented by Token. This handles
1809 /// advancing over escape sequences in the string.
1811  unsigned ByteNo) const {
1812  // Get the spelling of the token.
1813  SmallString<32> SpellingBuffer;
1814  SpellingBuffer.resize(Tok.getLength());
1815 
1816  bool StringInvalid = false;
1817  const char *SpellingPtr = &SpellingBuffer[0];
1818  unsigned TokLen = Lexer::getSpelling(Tok, SpellingPtr, SM, Features,
1819  &StringInvalid);
1820  if (StringInvalid)
1821  return 0;
1822 
1823  const char *SpellingStart = SpellingPtr;
1824  const char *SpellingEnd = SpellingPtr+TokLen;
1825 
1826  // Handle UTF-8 strings just like narrow strings.
1827  if (SpellingPtr[0] == 'u' && SpellingPtr[1] == '8')
1828  SpellingPtr += 2;
1829 
1830  assert(SpellingPtr[0] != 'L' && SpellingPtr[0] != 'u' &&
1831  SpellingPtr[0] != 'U' && "Doesn't handle wide or utf strings yet");
1832 
1833  // For raw string literals, this is easy.
1834  if (SpellingPtr[0] == 'R') {
1835  assert(SpellingPtr[1] == '"' && "Should be a raw string literal!");
1836  // Skip 'R"'.
1837  SpellingPtr += 2;
1838  while (*SpellingPtr != '(') {
1839  ++SpellingPtr;
1840  assert(SpellingPtr < SpellingEnd && "Missing ( for raw string literal");
1841  }
1842  // Skip '('.
1843  ++SpellingPtr;
1844  return SpellingPtr - SpellingStart + ByteNo;
1845  }
1846 
1847  // Skip over the leading quote
1848  assert(SpellingPtr[0] == '"' && "Should be a string literal!");
1849  ++SpellingPtr;
1850 
1851  // Skip over bytes until we find the offset we're looking for.
1852  while (ByteNo) {
1853  assert(SpellingPtr < SpellingEnd && "Didn't find byte offset!");
1854 
1855  // Step over non-escapes simply.
1856  if (*SpellingPtr != '\\') {
1857  ++SpellingPtr;
1858  --ByteNo;
1859  continue;
1860  }
1861 
1862  // Otherwise, this is an escape character. Advance over it.
1863  bool HadError = false;
1864  if (SpellingPtr[1] == 'u' || SpellingPtr[1] == 'U') {
1865  const char *EscapePtr = SpellingPtr;
1866  unsigned Len = MeasureUCNEscape(SpellingStart, SpellingPtr, SpellingEnd,
1867  1, Features, HadError);
1868  if (Len > ByteNo) {
1869  // ByteNo is somewhere within the escape sequence.
1870  SpellingPtr = EscapePtr;
1871  break;
1872  }
1873  ByteNo -= Len;
1874  } else {
1875  ProcessCharEscape(SpellingStart, SpellingPtr, SpellingEnd, HadError,
1876  FullSourceLoc(Tok.getLocation(), SM),
1877  CharByteWidth*8, Diags, Features);
1878  --ByteNo;
1879  }
1880  assert(!HadError && "This method isn't valid on erroneous strings");
1881  }
1882 
1883  return SpellingPtr-SpellingStart;
1884 }
1885 
1886 /// Determine whether a suffix is a valid ud-suffix. We avoid treating reserved
1887 /// suffixes as ud-suffixes, because the diagnostic experience is better if we
1888 /// treat it as an invalid suffix.
1890  StringRef Suffix) {
1891  return NumericLiteralParser::isValidUDSuffix(LangOpts, Suffix) ||
1892  Suffix == "sv";
1893 }
static unsigned getSpelling(const Token &Tok, const char *&Buffer, const SourceManager &SourceMgr, const LangOptions &LangOpts, bool *Invalid=nullptr)
getSpelling - This method is used to get the spelling of a token into a preallocated buffer...
Definition: Lexer.cpp:389
static DiagnosticBuilder Diag(DiagnosticsEngine *Diags, const LangOptions &Features, FullSourceLoc TokLoc, const char *TokBegin, const char *TokRangeBegin, const char *TokRangeEnd, unsigned DiagID)
Produce a diagnostic highlighting some portion of a literal.
unsigned getOffsetOfStringByte(const Token &TheTok, unsigned ByteNo) const
getOffsetOfStringByte - This function returns the offset of the specified byte of the string data rep...
StringLiteralParser(ArrayRef< Token > StringToks, Preprocessor &PP, bool Complain=true)
unsigned GetNumStringChars() const
DiagnosticBuilder Report(SourceLocation Loc, unsigned DiagID)
Issue the message to the client.
Definition: Diagnostic.h:1294
unsigned getCharWidth() const
Definition: TargetInfo.h:370
unsigned GetStringLength() const
static bool alwaysFitsInto64Bits(unsigned Radix, unsigned NumDigits)
unsigned getChar32Width() const
getChar32Width/Align - Return the size of &#39;char32_t&#39; for this target, in bits.
Definition: TargetInfo.h:553
const TargetInfo & getTargetInfo() const
Definition: Preprocessor.h:828
Token - This structure provides full information about a lexed token.
Definition: Token.h:35
Keeps track of the various options that can be enabled, which controls the dialect of C or C++ that i...
Definition: LangOptions.h:50
const LangOptions & getLangOpts() const
Definition: Preprocessor.h:827
static int MeasureUCNEscape(const char *ThisTokBegin, const char *&ThisTokBuf, const char *ThisTokEnd, unsigned CharByteWidth, const LangOptions &Features, bool &HadError)
MeasureUCNEscape - Determine the number of bytes within the resulting string which this UCN will occu...
SourceLocation AdvanceToTokenCharacter(SourceLocation TokStart, unsigned Char) const
Given a location that specifies the start of a token, return a new location that specifies a characte...
const FormatToken & Tok
Concrete class used by the front-end to report problems and issues.
Definition: Diagnostic.h:149
static bool isValidUDSuffix(const LangOptions &LangOpts, StringRef Suffix)
Determine whether a suffix is a valid ud-suffix.
NumericLiteralParser(StringRef TokSpelling, SourceLocation TokLoc, Preprocessor &PP)
integer-constant: [C99 6.4.4.1] decimal-constant integer-suffix octal-constant integer-suffix hexadec...
static SourceLocation AdvanceToTokenCharacter(SourceLocation TokStart, unsigned Characters, const SourceManager &SM, const LangOptions &LangOpts)
AdvanceToTokenCharacter - If the current SourceLocation specifies a location at the start of a token...
Definition: Lexer.h:349
static bool isValidUDSuffix(const LangOptions &LangOpts, StringRef Suffix)
Determine whether a suffix is a valid ud-suffix.
A little helper class used to produce diagnostics.
Definition: Diagnostic.h:1042
Exposes information about the current target.
Definition: TargetInfo.h:54
bool GetFixedPointValue(llvm::APInt &StoreVal, unsigned Scale)
GetFixedPointValue - Convert this numeric literal value into a scaled integer that represents this va...
CharLiteralParser(const char *begin, const char *end, SourceLocation Loc, Preprocessor &PP, tok::TokenKind kind)
Defines the clang::LangOptions interface.
SourceLocation End
Represents a character-granular source range.
unsigned getIntWidth() const
getIntWidth/Align - Return the size of &#39;signed int&#39; and &#39;unsigned int&#39; for this target, in bits.
Definition: TargetInfo.h:383
SourceLocation getLocation() const
Return a source location identifier for the specified offset in the current file. ...
Definition: Token.h:124
Defines the clang::Preprocessor interface.
const SourceManager & getManager() const
SourceLocation Begin
static const char * resyncUTF8(const char *Err, const char *End)
static void appendCodePoint(unsigned Codepoint, llvm::SmallVectorImpl< char > &Str)
The result type of a method or function.
const SourceManager & SM
Definition: Format.cpp:1490
static CharSourceRange getCharRange(SourceRange R)
SourceManager & getSourceManager() const
Definition: Preprocessor.h:831
unsigned getWCharWidth() const
getWCharWidth/Align - Return the size of &#39;wchar_t&#39; for this target, in bits.
Definition: TargetInfo.h:543
bool GetIntegerValue(llvm::APInt &Val)
GetIntegerValue - Convert this numeric literal value to an APInt that matches Val&#39;s input width...
#define false
Definition: stdbool.h:33
Kind
Encodes a location in the source.
llvm::APFloat::opStatus GetFloatValue(llvm::APFloat &Result)
GetFloatValue - Convert this numeric literal to a floating value, using the specified APFloat fltSema...
unsigned getChar16Width() const
getChar16Width/Align - Return the size of &#39;char16_t&#39; for this target, in bits.
Definition: TargetInfo.h:548
static unsigned ProcessCharEscape(const char *ThisTokBegin, const char *&ThisTokBuf, const char *ThisTokEnd, bool &HadError, FullSourceLoc Loc, unsigned CharWidth, DiagnosticsEngine *Diags, const LangOptions &Features)
ProcessCharEscape - Parse a standard C escape sequence, which can occur in either a character or a st...
TokenKind
Provides a simple uniform namespace for tokens from all C languages.
Definition: TokenKinds.h:25
void expandUCNs(SmallVectorImpl< char > &Buf, StringRef Input)
Copy characters from Input to Buf, expanding any UCNs.
__DEVICE__ void * memcpy(void *__a, const void *__b, size_t __c)
LLVM_READONLY bool isPrintable(unsigned char c)
Return true if this character is an ASCII printable character; that is, a character that should take ...
Definition: CharInfo.h:140
static void EncodeUCNEscape(const char *ThisTokBegin, const char *&ThisTokBuf, const char *ThisTokEnd, char *&ResultBuf, bool &HadError, FullSourceLoc Loc, unsigned CharByteWidth, DiagnosticsEngine *Diags, const LangOptions &Features)
EncodeUCNEscape - Read the Universal Character Name, check constraints and convert the UTF32 to UTF8 ...
Dataflow Directional Tag Classes.
unsigned getLength() const
Definition: Token.h:127
LLVM_READONLY bool isHexDigit(unsigned char c)
Return true if this character is an ASCII hex digit: [0-9a-fA-F].
Definition: CharInfo.h:124
LLVM_READONLY bool isDigit(unsigned char c)
Return true if this character is an ASCII digit: [0-9].
Definition: CharInfo.h:94
Defines the clang::SourceLocation class and associated facilities.
static bool IsExponentPart(char c)
DiagnosticsEngine & getDiagnostics() const
Definition: Preprocessor.h:824
static unsigned getCharWidth(tok::TokenKind kind, const TargetInfo &Target)
unsigned kind
All of the diagnostics that can be emitted by the frontend.
Definition: DiagnosticIDs.h:61
Defines the clang::TargetInfo interface.
A SourceLocation and its associated SourceManager.
__DEVICE__ int max(int __a, int __b)
__DEVICE__ int min(int __a, int __b)
A trivial tuple used to represent a source range.
static bool ProcessUCNEscape(const char *ThisTokBegin, const char *&ThisTokBuf, const char *ThisTokEnd, uint32_t &UcnVal, unsigned short &UcnLen, FullSourceLoc Loc, DiagnosticsEngine *Diags, const LangOptions &Features, bool in_char_string_literal=false)
ProcessUCNEscape - Read the Universal Character Name, check constraints and return the UTF32...
LLVM_READONLY bool isPreprocessingNumberBody(unsigned char c)
Return true if this is the body character of a C preprocessing number, which is [a-zA-Z0-9_.
Definition: CharInfo.h:148
DiagnosticBuilder Diag(SourceLocation Loc, unsigned DiagID) const
Forwarding function for diagnostics.
static CharSourceRange MakeCharSourceRange(const LangOptions &Features, FullSourceLoc TokLoc, const char *TokBegin, const char *TokRangeBegin, const char *TokRangeEnd)
Engages in a tight little dance with the lexer to efficiently preprocess tokens.
Definition: Preprocessor.h:127