forked from llvm/llvm-project
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFormatTokenLexer.cpp
1459 lines (1326 loc) · 53.8 KB
/
FormatTokenLexer.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
//===--- FormatTokenLexer.cpp - Lex FormatTokens -------------*- C++ ----*-===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
///
/// \file
/// This file implements FormatTokenLexer, which tokenizes a source file
/// into a FormatToken stream suitable for ClangFormat.
///
//===----------------------------------------------------------------------===//
#include "FormatTokenLexer.h"
#include "FormatToken.h"
#include "clang/Basic/SourceLocation.h"
#include "clang/Basic/SourceManager.h"
#include "clang/Format/Format.h"
#include "llvm/Support/Regex.h"
namespace clang {
namespace format {
FormatTokenLexer::FormatTokenLexer(
const SourceManager &SourceMgr, FileID ID, unsigned Column,
const FormatStyle &Style, encoding::Encoding Encoding,
llvm::SpecificBumpPtrAllocator<FormatToken> &Allocator,
IdentifierTable &IdentTable)
: FormatTok(nullptr), IsFirstToken(true), StateStack({LexerState::NORMAL}),
Column(Column), TrailingWhitespace(0),
LangOpts(getFormattingLangOpts(Style)), SourceMgr(SourceMgr), ID(ID),
Style(Style), IdentTable(IdentTable), Keywords(IdentTable),
Encoding(Encoding), Allocator(Allocator), FirstInLineIndex(0),
FormattingDisabled(false), MacroBlockBeginRegex(Style.MacroBlockBegin),
MacroBlockEndRegex(Style.MacroBlockEnd) {
Lex.reset(new Lexer(ID, SourceMgr.getBufferOrFake(ID), SourceMgr, LangOpts));
Lex->SetKeepWhitespaceMode(true);
for (const std::string &ForEachMacro : Style.ForEachMacros) {
auto Identifier = &IdentTable.get(ForEachMacro);
Macros.insert({Identifier, TT_ForEachMacro});
}
for (const std::string &IfMacro : Style.IfMacros) {
auto Identifier = &IdentTable.get(IfMacro);
Macros.insert({Identifier, TT_IfMacro});
}
for (const std::string &AttributeMacro : Style.AttributeMacros) {
auto Identifier = &IdentTable.get(AttributeMacro);
Macros.insert({Identifier, TT_AttributeMacro});
}
for (const std::string &StatementMacro : Style.StatementMacros) {
auto Identifier = &IdentTable.get(StatementMacro);
Macros.insert({Identifier, TT_StatementMacro});
}
for (const std::string &TypenameMacro : Style.TypenameMacros) {
auto Identifier = &IdentTable.get(TypenameMacro);
Macros.insert({Identifier, TT_TypenameMacro});
}
for (const std::string &NamespaceMacro : Style.NamespaceMacros) {
auto Identifier = &IdentTable.get(NamespaceMacro);
Macros.insert({Identifier, TT_NamespaceMacro});
}
for (const std::string &WhitespaceSensitiveMacro :
Style.WhitespaceSensitiveMacros) {
auto Identifier = &IdentTable.get(WhitespaceSensitiveMacro);
Macros.insert({Identifier, TT_UntouchableMacroFunc});
}
for (const std::string &StatementAttributeLikeMacro :
Style.StatementAttributeLikeMacros) {
auto Identifier = &IdentTable.get(StatementAttributeLikeMacro);
Macros.insert({Identifier, TT_StatementAttributeLikeMacro});
}
for (const auto &TypeName : Style.TypeNames)
TypeNames.insert(&IdentTable.get(TypeName));
}
ArrayRef<FormatToken *> FormatTokenLexer::lex() {
assert(Tokens.empty());
assert(FirstInLineIndex == 0);
do {
Tokens.push_back(getNextToken());
if (Style.isJavaScript()) {
tryParseJSRegexLiteral();
handleTemplateStrings();
}
if (Style.Language == FormatStyle::LK_TextProto)
tryParsePythonComment();
tryMergePreviousTokens();
if (Style.isCSharp()) {
// This needs to come after tokens have been merged so that C#
// string literals are correctly identified.
handleCSharpVerbatimAndInterpolatedStrings();
}
if (Style.isTableGen()) {
handleTableGenMultilineString();
handleTableGenNumericLikeIdentifier();
}
if (Tokens.back()->NewlinesBefore > 0 || Tokens.back()->IsMultiline)
FirstInLineIndex = Tokens.size() - 1;
} while (Tokens.back()->isNot(tok::eof));
if (Style.InsertNewlineAtEOF) {
auto &TokEOF = *Tokens.back();
if (TokEOF.NewlinesBefore == 0) {
TokEOF.NewlinesBefore = 1;
TokEOF.OriginalColumn = 0;
}
}
return Tokens;
}
void FormatTokenLexer::tryMergePreviousTokens() {
if (tryMerge_TMacro())
return;
if (tryMergeConflictMarkers())
return;
if (tryMergeLessLess())
return;
if (tryMergeGreaterGreater())
return;
if (tryMergeForEach())
return;
if (Style.isCpp() && tryTransformTryUsageForC())
return;
if (Style.isJavaScript() || Style.isCSharp()) {
static const tok::TokenKind NullishCoalescingOperator[] = {tok::question,
tok::question};
static const tok::TokenKind NullPropagatingOperator[] = {tok::question,
tok::period};
static const tok::TokenKind FatArrow[] = {tok::equal, tok::greater};
if (tryMergeTokens(FatArrow, TT_FatArrow))
return;
if (tryMergeTokens(NullishCoalescingOperator, TT_NullCoalescingOperator)) {
// Treat like the "||" operator (as opposed to the ternary ?).
Tokens.back()->Tok.setKind(tok::pipepipe);
return;
}
if (tryMergeTokens(NullPropagatingOperator, TT_NullPropagatingOperator)) {
// Treat like a regular "." access.
Tokens.back()->Tok.setKind(tok::period);
return;
}
if (tryMergeNullishCoalescingEqual())
return;
}
if (Style.isCSharp()) {
static const tok::TokenKind CSharpNullConditionalLSquare[] = {
tok::question, tok::l_square};
if (tryMergeCSharpKeywordVariables())
return;
if (tryMergeCSharpStringLiteral())
return;
if (tryTransformCSharpForEach())
return;
if (tryMergeTokens(CSharpNullConditionalLSquare,
TT_CSharpNullConditionalLSquare)) {
// Treat like a regular "[" operator.
Tokens.back()->Tok.setKind(tok::l_square);
return;
}
}
if (tryMergeNSStringLiteral())
return;
if (Style.isJavaScript()) {
static const tok::TokenKind JSIdentity[] = {tok::equalequal, tok::equal};
static const tok::TokenKind JSNotIdentity[] = {tok::exclaimequal,
tok::equal};
static const tok::TokenKind JSShiftEqual[] = {tok::greater, tok::greater,
tok::greaterequal};
static const tok::TokenKind JSExponentiation[] = {tok::star, tok::star};
static const tok::TokenKind JSExponentiationEqual[] = {tok::star,
tok::starequal};
static const tok::TokenKind JSPipePipeEqual[] = {tok::pipepipe, tok::equal};
static const tok::TokenKind JSAndAndEqual[] = {tok::ampamp, tok::equal};
// FIXME: Investigate what token type gives the correct operator priority.
if (tryMergeTokens(JSIdentity, TT_BinaryOperator))
return;
if (tryMergeTokens(JSNotIdentity, TT_BinaryOperator))
return;
if (tryMergeTokens(JSShiftEqual, TT_BinaryOperator))
return;
if (tryMergeTokens(JSExponentiation, TT_JsExponentiation))
return;
if (tryMergeTokens(JSExponentiationEqual, TT_JsExponentiationEqual)) {
Tokens.back()->Tok.setKind(tok::starequal);
return;
}
if (tryMergeTokens(JSAndAndEqual, TT_JsAndAndEqual) ||
tryMergeTokens(JSPipePipeEqual, TT_JsPipePipeEqual)) {
// Treat like the "=" assignment operator.
Tokens.back()->Tok.setKind(tok::equal);
return;
}
if (tryMergeJSPrivateIdentifier())
return;
}
if (Style.Language == FormatStyle::LK_Java) {
static const tok::TokenKind JavaRightLogicalShiftAssign[] = {
tok::greater, tok::greater, tok::greaterequal};
if (tryMergeTokens(JavaRightLogicalShiftAssign, TT_BinaryOperator))
return;
}
if (Style.isVerilog()) {
// Merge the number following a base like `'h?a0`.
if (Tokens.size() >= 3 && Tokens.end()[-3]->is(TT_VerilogNumberBase) &&
Tokens.end()[-2]->is(tok::numeric_constant) &&
Tokens.back()->isOneOf(tok::numeric_constant, tok::identifier,
tok::question) &&
tryMergeTokens(2, TT_Unknown)) {
return;
}
// Part select.
if (tryMergeTokensAny({{tok::minus, tok::colon}, {tok::plus, tok::colon}},
TT_BitFieldColon)) {
return;
}
// Xnor. The combined token is treated as a caret which can also be either a
// unary or binary operator. The actual type is determined in
// TokenAnnotator. We also check the token length so we know it is not
// already a merged token.
if (Tokens.back()->TokenText.size() == 1 &&
tryMergeTokensAny({{tok::caret, tok::tilde}, {tok::tilde, tok::caret}},
TT_BinaryOperator)) {
Tokens.back()->Tok.setKind(tok::caret);
return;
}
// Signed shift and distribution weight.
if (tryMergeTokens({tok::less, tok::less}, TT_BinaryOperator)) {
Tokens.back()->Tok.setKind(tok::lessless);
return;
}
if (tryMergeTokens({tok::greater, tok::greater}, TT_BinaryOperator)) {
Tokens.back()->Tok.setKind(tok::greatergreater);
return;
}
if (tryMergeTokensAny({{tok::lessless, tok::equal},
{tok::lessless, tok::lessequal},
{tok::greatergreater, tok::equal},
{tok::greatergreater, tok::greaterequal},
{tok::colon, tok::equal},
{tok::colon, tok::slash}},
TT_BinaryOperator)) {
Tokens.back()->ForcedPrecedence = prec::Assignment;
return;
}
// Exponentiation, signed shift, case equality, and wildcard equality.
if (tryMergeTokensAny({{tok::star, tok::star},
{tok::lessless, tok::less},
{tok::greatergreater, tok::greater},
{tok::exclaimequal, tok::equal},
{tok::exclaimequal, tok::question},
{tok::equalequal, tok::equal},
{tok::equalequal, tok::question}},
TT_BinaryOperator)) {
return;
}
// Module paths in specify blocks and the implication and boolean equality
// operators.
if (tryMergeTokensAny({{tok::plusequal, tok::greater},
{tok::plus, tok::star, tok::greater},
{tok::minusequal, tok::greater},
{tok::minus, tok::star, tok::greater},
{tok::less, tok::arrow},
{tok::equal, tok::greater},
{tok::star, tok::greater},
{tok::pipeequal, tok::greater},
{tok::pipe, tok::arrow},
{tok::hash, tok::minus, tok::hash},
{tok::hash, tok::equal, tok::hash}},
TT_BinaryOperator) ||
Tokens.back()->is(tok::arrow)) {
Tokens.back()->ForcedPrecedence = prec::Comma;
return;
}
}
if (Style.isTableGen()) {
// TableGen's Multi line string starts with [{
if (tryMergeTokens({tok::l_square, tok::l_brace},
TT_TableGenMultiLineString)) {
// Set again with finalizing. This must never be annotated as other types.
Tokens.back()->setFinalizedType(TT_TableGenMultiLineString);
Tokens.back()->Tok.setKind(tok::string_literal);
return;
}
// TableGen's bang operator is the form !<name>.
// !cond is a special case with specific syntax.
if (tryMergeTokens({tok::exclaim, tok::identifier},
TT_TableGenBangOperator)) {
Tokens.back()->Tok.setKind(tok::identifier);
Tokens.back()->Tok.setIdentifierInfo(nullptr);
if (Tokens.back()->TokenText == "!cond")
Tokens.back()->setFinalizedType(TT_TableGenCondOperator);
else
Tokens.back()->setFinalizedType(TT_TableGenBangOperator);
return;
}
if (tryMergeTokens({tok::exclaim, tok::kw_if}, TT_TableGenBangOperator)) {
// Here, "! if" becomes "!if". That is, ! captures if even when the space
// exists. That is only one possibility in TableGen's syntax.
Tokens.back()->Tok.setKind(tok::identifier);
Tokens.back()->Tok.setIdentifierInfo(nullptr);
Tokens.back()->setFinalizedType(TT_TableGenBangOperator);
return;
}
// +, - with numbers are literals. Not unary operators.
if (tryMergeTokens({tok::plus, tok::numeric_constant}, TT_Unknown)) {
Tokens.back()->Tok.setKind(tok::numeric_constant);
return;
}
if (tryMergeTokens({tok::minus, tok::numeric_constant}, TT_Unknown)) {
Tokens.back()->Tok.setKind(tok::numeric_constant);
return;
}
}
}
bool FormatTokenLexer::tryMergeNSStringLiteral() {
if (Tokens.size() < 2)
return false;
auto &At = *(Tokens.end() - 2);
auto &String = *(Tokens.end() - 1);
if (At->isNot(tok::at) || String->isNot(tok::string_literal))
return false;
At->Tok.setKind(tok::string_literal);
At->TokenText = StringRef(At->TokenText.begin(),
String->TokenText.end() - At->TokenText.begin());
At->ColumnWidth += String->ColumnWidth;
At->setType(TT_ObjCStringLiteral);
Tokens.erase(Tokens.end() - 1);
return true;
}
bool FormatTokenLexer::tryMergeJSPrivateIdentifier() {
// Merges #idenfier into a single identifier with the text #identifier
// but the token tok::identifier.
if (Tokens.size() < 2)
return false;
auto &Hash = *(Tokens.end() - 2);
auto &Identifier = *(Tokens.end() - 1);
if (Hash->isNot(tok::hash) || Identifier->isNot(tok::identifier))
return false;
Hash->Tok.setKind(tok::identifier);
Hash->TokenText =
StringRef(Hash->TokenText.begin(),
Identifier->TokenText.end() - Hash->TokenText.begin());
Hash->ColumnWidth += Identifier->ColumnWidth;
Hash->setType(TT_JsPrivateIdentifier);
Tokens.erase(Tokens.end() - 1);
return true;
}
// Search for verbatim or interpolated string literals @"ABC" or
// $"aaaaa{abc}aaaaa" i and mark the token as TT_CSharpStringLiteral, and to
// prevent splitting of @, $ and ".
// Merging of multiline verbatim strings with embedded '"' is handled in
// handleCSharpVerbatimAndInterpolatedStrings with lower-level lexing.
bool FormatTokenLexer::tryMergeCSharpStringLiteral() {
if (Tokens.size() < 2)
return false;
// Look for @"aaaaaa" or $"aaaaaa".
const auto String = *(Tokens.end() - 1);
if (String->isNot(tok::string_literal))
return false;
auto Prefix = *(Tokens.end() - 2);
if (Prefix->isNot(tok::at) && Prefix->TokenText != "$")
return false;
if (Tokens.size() > 2) {
const auto Tok = *(Tokens.end() - 3);
if ((Tok->TokenText == "$" && Prefix->is(tok::at)) ||
(Tok->is(tok::at) && Prefix->TokenText == "$")) {
// This looks like $@"aaa" or @$"aaa" so we need to combine all 3 tokens.
Tok->ColumnWidth += Prefix->ColumnWidth;
Tokens.erase(Tokens.end() - 2);
Prefix = Tok;
}
}
// Convert back into just a string_literal.
Prefix->Tok.setKind(tok::string_literal);
Prefix->TokenText =
StringRef(Prefix->TokenText.begin(),
String->TokenText.end() - Prefix->TokenText.begin());
Prefix->ColumnWidth += String->ColumnWidth;
Prefix->setType(TT_CSharpStringLiteral);
Tokens.erase(Tokens.end() - 1);
return true;
}
// Valid C# attribute targets:
// https://docs.microsoft.com/en-us/dotnet/csharp/programming-guide/concepts/attributes/#attribute-targets
const llvm::StringSet<> FormatTokenLexer::CSharpAttributeTargets = {
"assembly", "module", "field", "event", "method",
"param", "property", "return", "type",
};
bool FormatTokenLexer::tryMergeNullishCoalescingEqual() {
if (Tokens.size() < 2)
return false;
auto &NullishCoalescing = *(Tokens.end() - 2);
auto &Equal = *(Tokens.end() - 1);
if (NullishCoalescing->isNot(TT_NullCoalescingOperator) ||
Equal->isNot(tok::equal)) {
return false;
}
NullishCoalescing->Tok.setKind(tok::equal); // no '??=' in clang tokens.
NullishCoalescing->TokenText =
StringRef(NullishCoalescing->TokenText.begin(),
Equal->TokenText.end() - NullishCoalescing->TokenText.begin());
NullishCoalescing->ColumnWidth += Equal->ColumnWidth;
NullishCoalescing->setType(TT_NullCoalescingEqual);
Tokens.erase(Tokens.end() - 1);
return true;
}
bool FormatTokenLexer::tryMergeCSharpKeywordVariables() {
if (Tokens.size() < 2)
return false;
const auto At = *(Tokens.end() - 2);
if (At->isNot(tok::at))
return false;
const auto Keyword = *(Tokens.end() - 1);
if (Keyword->TokenText == "$")
return false;
if (!Keywords.isCSharpKeyword(*Keyword))
return false;
At->Tok.setKind(tok::identifier);
At->TokenText = StringRef(At->TokenText.begin(),
Keyword->TokenText.end() - At->TokenText.begin());
At->ColumnWidth += Keyword->ColumnWidth;
At->setType(Keyword->getType());
Tokens.erase(Tokens.end() - 1);
return true;
}
// In C# transform identifier foreach into kw_foreach
bool FormatTokenLexer::tryTransformCSharpForEach() {
if (Tokens.size() < 1)
return false;
auto &Identifier = *(Tokens.end() - 1);
if (Identifier->isNot(tok::identifier))
return false;
if (Identifier->TokenText != "foreach")
return false;
Identifier->setType(TT_ForEachMacro);
Identifier->Tok.setKind(tok::kw_for);
return true;
}
bool FormatTokenLexer::tryMergeForEach() {
if (Tokens.size() < 2)
return false;
auto &For = *(Tokens.end() - 2);
auto &Each = *(Tokens.end() - 1);
if (For->isNot(tok::kw_for))
return false;
if (Each->isNot(tok::identifier))
return false;
if (Each->TokenText != "each")
return false;
For->setType(TT_ForEachMacro);
For->Tok.setKind(tok::kw_for);
For->TokenText = StringRef(For->TokenText.begin(),
Each->TokenText.end() - For->TokenText.begin());
For->ColumnWidth += Each->ColumnWidth;
Tokens.erase(Tokens.end() - 1);
return true;
}
bool FormatTokenLexer::tryTransformTryUsageForC() {
if (Tokens.size() < 2)
return false;
auto &Try = *(Tokens.end() - 2);
if (Try->isNot(tok::kw_try))
return false;
auto &Next = *(Tokens.end() - 1);
if (Next->isOneOf(tok::l_brace, tok::colon, tok::hash, tok::comment))
return false;
if (Tokens.size() > 2) {
auto &At = *(Tokens.end() - 3);
if (At->is(tok::at))
return false;
}
Try->Tok.setKind(tok::identifier);
return true;
}
bool FormatTokenLexer::tryMergeLessLess() {
// Merge X,less,less,Y into X,lessless,Y unless X or Y is less.
if (Tokens.size() < 3)
return false;
auto First = Tokens.end() - 3;
if (First[0]->isNot(tok::less) || First[1]->isNot(tok::less))
return false;
// Only merge if there currently is no whitespace between the two "<".
if (First[1]->hasWhitespaceBefore())
return false;
auto X = Tokens.size() > 3 ? First[-1] : nullptr;
if (X && X->is(tok::less))
return false;
auto Y = First[2];
if ((!X || X->isNot(tok::kw_operator)) && Y->is(tok::less))
return false;
First[0]->Tok.setKind(tok::lessless);
First[0]->TokenText = "<<";
First[0]->ColumnWidth += 1;
Tokens.erase(Tokens.end() - 2);
return true;
}
bool FormatTokenLexer::tryMergeGreaterGreater() {
// Merge kw_operator,greater,greater into kw_operator,greatergreater.
if (Tokens.size() < 2)
return false;
auto First = Tokens.end() - 2;
if (First[0]->isNot(tok::greater) || First[1]->isNot(tok::greater))
return false;
// Only merge if there currently is no whitespace between the first two ">".
if (First[1]->hasWhitespaceBefore())
return false;
auto Tok = Tokens.size() > 2 ? First[-1] : nullptr;
if (Tok && Tok->isNot(tok::kw_operator))
return false;
First[0]->Tok.setKind(tok::greatergreater);
First[0]->TokenText = ">>";
First[0]->ColumnWidth += 1;
Tokens.erase(Tokens.end() - 1);
return true;
}
bool FormatTokenLexer::tryMergeTokens(ArrayRef<tok::TokenKind> Kinds,
TokenType NewType) {
if (Tokens.size() < Kinds.size())
return false;
SmallVectorImpl<FormatToken *>::const_iterator First =
Tokens.end() - Kinds.size();
for (unsigned i = 0; i < Kinds.size(); ++i)
if (First[i]->isNot(Kinds[i]))
return false;
return tryMergeTokens(Kinds.size(), NewType);
}
bool FormatTokenLexer::tryMergeTokens(size_t Count, TokenType NewType) {
if (Tokens.size() < Count)
return false;
SmallVectorImpl<FormatToken *>::const_iterator First = Tokens.end() - Count;
unsigned AddLength = 0;
for (size_t i = 1; i < Count; ++i) {
// If there is whitespace separating the token and the previous one,
// they should not be merged.
if (First[i]->hasWhitespaceBefore())
return false;
AddLength += First[i]->TokenText.size();
}
Tokens.resize(Tokens.size() - Count + 1);
First[0]->TokenText = StringRef(First[0]->TokenText.data(),
First[0]->TokenText.size() + AddLength);
First[0]->ColumnWidth += AddLength;
First[0]->setType(NewType);
return true;
}
bool FormatTokenLexer::tryMergeTokensAny(
ArrayRef<ArrayRef<tok::TokenKind>> Kinds, TokenType NewType) {
return llvm::any_of(Kinds, [this, NewType](ArrayRef<tok::TokenKind> Kinds) {
return tryMergeTokens(Kinds, NewType);
});
}
// Returns \c true if \p Tok can only be followed by an operand in JavaScript.
bool FormatTokenLexer::precedesOperand(FormatToken *Tok) {
// NB: This is not entirely correct, as an r_paren can introduce an operand
// location in e.g. `if (foo) /bar/.exec(...);`. That is a rare enough
// corner case to not matter in practice, though.
return Tok->isOneOf(tok::period, tok::l_paren, tok::comma, tok::l_brace,
tok::r_brace, tok::l_square, tok::semi, tok::exclaim,
tok::colon, tok::question, tok::tilde) ||
Tok->isOneOf(tok::kw_return, tok::kw_do, tok::kw_case, tok::kw_throw,
tok::kw_else, tok::kw_new, tok::kw_delete, tok::kw_void,
tok::kw_typeof, Keywords.kw_instanceof, Keywords.kw_in) ||
Tok->isBinaryOperator();
}
bool FormatTokenLexer::canPrecedeRegexLiteral(FormatToken *Prev) {
if (!Prev)
return true;
// Regex literals can only follow after prefix unary operators, not after
// postfix unary operators. If the '++' is followed by a non-operand
// introducing token, the slash here is the operand and not the start of a
// regex.
// `!` is an unary prefix operator, but also a post-fix operator that casts
// away nullability, so the same check applies.
if (Prev->isOneOf(tok::plusplus, tok::minusminus, tok::exclaim))
return Tokens.size() < 3 || precedesOperand(Tokens[Tokens.size() - 3]);
// The previous token must introduce an operand location where regex
// literals can occur.
if (!precedesOperand(Prev))
return false;
return true;
}
// Tries to parse a JavaScript Regex literal starting at the current token,
// if that begins with a slash and is in a location where JavaScript allows
// regex literals. Changes the current token to a regex literal and updates
// its text if successful.
void FormatTokenLexer::tryParseJSRegexLiteral() {
FormatToken *RegexToken = Tokens.back();
if (!RegexToken->isOneOf(tok::slash, tok::slashequal))
return;
FormatToken *Prev = nullptr;
for (FormatToken *FT : llvm::drop_begin(llvm::reverse(Tokens))) {
// NB: Because previous pointers are not initialized yet, this cannot use
// Token.getPreviousNonComment.
if (FT->isNot(tok::comment)) {
Prev = FT;
break;
}
}
if (!canPrecedeRegexLiteral(Prev))
return;
// 'Manually' lex ahead in the current file buffer.
const char *Offset = Lex->getBufferLocation();
const char *RegexBegin = Offset - RegexToken->TokenText.size();
StringRef Buffer = Lex->getBuffer();
bool InCharacterClass = false;
bool HaveClosingSlash = false;
for (; !HaveClosingSlash && Offset != Buffer.end(); ++Offset) {
// Regular expressions are terminated with a '/', which can only be
// escaped using '\' or a character class between '[' and ']'.
// See http://www.ecma-international.org/ecma-262/5.1/#sec-7.8.5.
switch (*Offset) {
case '\\':
// Skip the escaped character.
++Offset;
break;
case '[':
InCharacterClass = true;
break;
case ']':
InCharacterClass = false;
break;
case '/':
if (!InCharacterClass)
HaveClosingSlash = true;
break;
}
}
RegexToken->setType(TT_RegexLiteral);
// Treat regex literals like other string_literals.
RegexToken->Tok.setKind(tok::string_literal);
RegexToken->TokenText = StringRef(RegexBegin, Offset - RegexBegin);
RegexToken->ColumnWidth = RegexToken->TokenText.size();
resetLexer(SourceMgr.getFileOffset(Lex->getSourceLocation(Offset)));
}
static auto lexCSharpString(const char *Begin, const char *End, bool Verbatim,
bool Interpolated) {
auto Repeated = [&Begin, End]() {
return Begin + 1 < End && Begin[1] == Begin[0];
};
// Look for a terminating '"' in the current file buffer.
// Make no effort to format code within an interpolated or verbatim string.
//
// Interpolated strings could contain { } with " characters inside.
// $"{x ?? "null"}"
// should not be split into $"{x ?? ", null, "}" but should be treated as a
// single string-literal.
//
// We opt not to try and format expressions inside {} within a C#
// interpolated string. Formatting expressions within an interpolated string
// would require similar work as that done for JavaScript template strings
// in `handleTemplateStrings()`.
for (int UnmatchedOpeningBraceCount = 0; Begin < End; ++Begin) {
switch (*Begin) {
case '\\':
if (!Verbatim)
++Begin;
break;
case '{':
if (Interpolated) {
// {{ inside an interpolated string is escaped, so skip it.
if (Repeated())
++Begin;
else
++UnmatchedOpeningBraceCount;
}
break;
case '}':
if (Interpolated) {
// }} inside an interpolated string is escaped, so skip it.
if (Repeated())
++Begin;
else if (UnmatchedOpeningBraceCount > 0)
--UnmatchedOpeningBraceCount;
else
return End;
}
break;
case '"':
if (UnmatchedOpeningBraceCount > 0)
break;
// "" within a verbatim string is an escaped double quote: skip it.
if (Verbatim && Repeated()) {
++Begin;
break;
}
return Begin;
}
}
return End;
}
void FormatTokenLexer::handleCSharpVerbatimAndInterpolatedStrings() {
FormatToken *CSharpStringLiteral = Tokens.back();
if (CSharpStringLiteral->isNot(TT_CSharpStringLiteral))
return;
auto &TokenText = CSharpStringLiteral->TokenText;
bool Verbatim = false;
bool Interpolated = false;
if (TokenText.starts_with(R"($@")") || TokenText.starts_with(R"(@$")")) {
Verbatim = true;
Interpolated = true;
} else if (TokenText.starts_with(R"(@")")) {
Verbatim = true;
} else if (TokenText.starts_with(R"($")")) {
Interpolated = true;
}
// Deal with multiline strings.
if (!Verbatim && !Interpolated)
return;
const char *StrBegin = Lex->getBufferLocation() - TokenText.size();
const char *Offset = StrBegin;
if (Verbatim && Interpolated)
Offset += 3;
else
Offset += 2;
const auto End = Lex->getBuffer().end();
Offset = lexCSharpString(Offset, End, Verbatim, Interpolated);
// Make no attempt to format code properly if a verbatim string is
// unterminated.
if (Offset >= End)
return;
StringRef LiteralText(StrBegin, Offset - StrBegin + 1);
TokenText = LiteralText;
// Adjust width for potentially multiline string literals.
size_t FirstBreak = LiteralText.find('\n');
StringRef FirstLineText = FirstBreak == StringRef::npos
? LiteralText
: LiteralText.substr(0, FirstBreak);
CSharpStringLiteral->ColumnWidth = encoding::columnWidthWithTabs(
FirstLineText, CSharpStringLiteral->OriginalColumn, Style.TabWidth,
Encoding);
size_t LastBreak = LiteralText.rfind('\n');
if (LastBreak != StringRef::npos) {
CSharpStringLiteral->IsMultiline = true;
unsigned StartColumn = 0;
CSharpStringLiteral->LastLineColumnWidth =
encoding::columnWidthWithTabs(LiteralText.substr(LastBreak + 1),
StartColumn, Style.TabWidth, Encoding);
}
assert(Offset < End);
resetLexer(SourceMgr.getFileOffset(Lex->getSourceLocation(Offset + 1)));
}
void FormatTokenLexer::handleTableGenMultilineString() {
FormatToken *MultiLineString = Tokens.back();
if (MultiLineString->isNot(TT_TableGenMultiLineString))
return;
auto OpenOffset = Lex->getCurrentBufferOffset() - 2 /* "[{" */;
// "}]" is the end of multi line string.
auto CloseOffset = Lex->getBuffer().find("}]", OpenOffset);
if (CloseOffset == StringRef::npos)
return;
auto Text = Lex->getBuffer().substr(OpenOffset, CloseOffset - OpenOffset + 2);
MultiLineString->TokenText = Text;
resetLexer(SourceMgr.getFileOffset(
Lex->getSourceLocation(Lex->getBufferLocation() - 2 + Text.size())));
auto FirstLineText = Text;
auto FirstBreak = Text.find('\n');
// Set ColumnWidth and LastLineColumnWidth when it has multiple lines.
if (FirstBreak != StringRef::npos) {
MultiLineString->IsMultiline = true;
FirstLineText = Text.substr(0, FirstBreak + 1);
// LastLineColumnWidth holds the width of the last line.
auto LastBreak = Text.rfind('\n');
MultiLineString->LastLineColumnWidth = encoding::columnWidthWithTabs(
Text.substr(LastBreak + 1), MultiLineString->OriginalColumn,
Style.TabWidth, Encoding);
}
// ColumnWidth holds only the width of the first line.
MultiLineString->ColumnWidth = encoding::columnWidthWithTabs(
FirstLineText, MultiLineString->OriginalColumn, Style.TabWidth, Encoding);
}
void FormatTokenLexer::handleTableGenNumericLikeIdentifier() {
FormatToken *Tok = Tokens.back();
// TableGen identifiers can begin with digits. Such tokens are lexed as
// numeric_constant now.
if (Tok->isNot(tok::numeric_constant))
return;
StringRef Text = Tok->TokenText;
// The following check is based on llvm::TGLexer::LexToken.
// That lexes the token as a number if any of the following holds:
// 1. It starts with '+', '-'.
// 2. All the characters are digits.
// 3. The first non-digit character is 'b', and the next is '0' or '1'.
// 4. The first non-digit character is 'x', and the next is a hex digit.
// Note that in the case 3 and 4, if the next character does not exists in
// this token, the token is an identifier.
if (Text.size() < 1 || Text[0] == '+' || Text[0] == '-')
return;
const auto NonDigitPos = Text.find_if([](char C) { return !isdigit(C); });
// All the characters are digits
if (NonDigitPos == StringRef::npos)
return;
char FirstNonDigit = Text[NonDigitPos];
if (NonDigitPos < Text.size() - 1) {
char TheNext = Text[NonDigitPos + 1];
// Regarded as a binary number.
if (FirstNonDigit == 'b' && (TheNext == '0' || TheNext == '1'))
return;
// Regarded as hex number.
if (FirstNonDigit == 'x' && isxdigit(TheNext))
return;
}
if (isalpha(FirstNonDigit) || FirstNonDigit == '_') {
// This is actually an identifier in TableGen.
Tok->Tok.setKind(tok::identifier);
Tok->Tok.setIdentifierInfo(nullptr);
}
}
void FormatTokenLexer::handleTemplateStrings() {
FormatToken *BacktickToken = Tokens.back();
if (BacktickToken->is(tok::l_brace)) {
StateStack.push(LexerState::NORMAL);
return;
}
if (BacktickToken->is(tok::r_brace)) {
if (StateStack.size() == 1)
return;
StateStack.pop();
if (StateStack.top() != LexerState::TEMPLATE_STRING)
return;
// If back in TEMPLATE_STRING, fallthrough and continue parsing the
} else if (BacktickToken->is(tok::unknown) &&
BacktickToken->TokenText == "`") {
StateStack.push(LexerState::TEMPLATE_STRING);
} else {
return; // Not actually a template
}
// 'Manually' lex ahead in the current file buffer.
const char *Offset = Lex->getBufferLocation();
const char *TmplBegin = Offset - BacktickToken->TokenText.size(); // at "`"
for (; Offset != Lex->getBuffer().end(); ++Offset) {
if (Offset[0] == '`') {
StateStack.pop();
++Offset;
break;
}
if (Offset[0] == '\\') {
++Offset; // Skip the escaped character.
} else if (Offset + 1 < Lex->getBuffer().end() && Offset[0] == '$' &&
Offset[1] == '{') {
// '${' introduces an expression interpolation in the template string.
StateStack.push(LexerState::NORMAL);
Offset += 2;
break;
}
}
StringRef LiteralText(TmplBegin, Offset - TmplBegin);
BacktickToken->setType(TT_TemplateString);
BacktickToken->Tok.setKind(tok::string_literal);
BacktickToken->TokenText = LiteralText;
// Adjust width for potentially multiline string literals.
size_t FirstBreak = LiteralText.find('\n');
StringRef FirstLineText = FirstBreak == StringRef::npos
? LiteralText
: LiteralText.substr(0, FirstBreak);
BacktickToken->ColumnWidth = encoding::columnWidthWithTabs(
FirstLineText, BacktickToken->OriginalColumn, Style.TabWidth, Encoding);
size_t LastBreak = LiteralText.rfind('\n');
if (LastBreak != StringRef::npos) {
BacktickToken->IsMultiline = true;
unsigned StartColumn = 0; // The template tail spans the entire line.
BacktickToken->LastLineColumnWidth =
encoding::columnWidthWithTabs(LiteralText.substr(LastBreak + 1),
StartColumn, Style.TabWidth, Encoding);
}
SourceLocation loc = Lex->getSourceLocation(Offset);
resetLexer(SourceMgr.getFileOffset(loc));
}
void FormatTokenLexer::tryParsePythonComment() {
FormatToken *HashToken = Tokens.back();
if (!HashToken->isOneOf(tok::hash, tok::hashhash))
return;
// Turn the remainder of this line into a comment.
const char *CommentBegin =
Lex->getBufferLocation() - HashToken->TokenText.size(); // at "#"
size_t From = CommentBegin - Lex->getBuffer().begin();
size_t To = Lex->getBuffer().find_first_of('\n', From);
if (To == StringRef::npos)
To = Lex->getBuffer().size();
size_t Len = To - From;
HashToken->setType(TT_LineComment);
HashToken->Tok.setKind(tok::comment);
HashToken->TokenText = Lex->getBuffer().substr(From, Len);
SourceLocation Loc = To < Lex->getBuffer().size()
? Lex->getSourceLocation(CommentBegin + Len)
: SourceMgr.getLocForEndOfFile(ID);
resetLexer(SourceMgr.getFileOffset(Loc));
}
bool FormatTokenLexer::tryMerge_TMacro() {
if (Tokens.size() < 4)
return false;
FormatToken *Last = Tokens.back();
if (Last->isNot(tok::r_paren))
return false;
FormatToken *String = Tokens[Tokens.size() - 2];
if (String->isNot(tok::string_literal) || String->IsMultiline)
return false;
if (Tokens[Tokens.size() - 3]->isNot(tok::l_paren))
return false;
FormatToken *Macro = Tokens[Tokens.size() - 4];
if (Macro->TokenText != "_T")
return false;
const char *Start = Macro->TokenText.data();
const char *End = Last->TokenText.data() + Last->TokenText.size();
String->TokenText = StringRef(Start, End - Start);
String->IsFirst = Macro->IsFirst;
String->LastNewlineOffset = Macro->LastNewlineOffset;
String->WhitespaceRange = Macro->WhitespaceRange;
String->OriginalColumn = Macro->OriginalColumn;
String->ColumnWidth = encoding::columnWidthWithTabs(
String->TokenText, String->OriginalColumn, Style.TabWidth, Encoding);
String->NewlinesBefore = Macro->NewlinesBefore;
String->HasUnescapedNewline = Macro->HasUnescapedNewline;