blob: 677f1a0bb131717954ad7488446a351565ae3186 [file] [log] [blame]
Daniel Jasper8de9ed02013-08-22 15:00:41 +00001//===--- FormatToken.cpp - Format C++ code --------------------------------===//
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/// \file
11/// \brief This file implements specific functions of \c FormatTokens and their
12/// roles.
13///
14//===----------------------------------------------------------------------===//
15
16#include "FormatToken.h"
17#include "ContinuationIndenter.h"
18#include "clang/Format/Format.h"
19#include "llvm/ADT/SmallVector.h"
20#include "llvm/Support/Debug.h"
21
22namespace clang {
23namespace format {
24
Daniel Jaspercb51cf42014-01-16 09:11:55 +000025// FIXME: This is copy&pasted from Sema. Put it in a common place and remove
26// duplication.
27bool FormatToken::isSimpleTypeSpecifier() const {
28 switch (Tok.getKind()) {
29 case tok::kw_short:
30 case tok::kw_long:
31 case tok::kw___int64:
32 case tok::kw___int128:
33 case tok::kw_signed:
34 case tok::kw_unsigned:
35 case tok::kw_void:
36 case tok::kw_char:
37 case tok::kw_int:
38 case tok::kw_half:
39 case tok::kw_float:
40 case tok::kw_double:
41 case tok::kw_wchar_t:
42 case tok::kw_bool:
43 case tok::kw___underlying_type:
44 case tok::annot_typename:
45 case tok::kw_char16_t:
46 case tok::kw_char32_t:
47 case tok::kw_typeof:
48 case tok::kw_decltype:
49 return true;
50 default:
51 return false;
52 }
53}
54
Daniel Jasper8de9ed02013-08-22 15:00:41 +000055TokenRole::~TokenRole() {}
56
57void TokenRole::precomputeFormattingInfos(const FormatToken *Token) {}
58
Daniel Jasper01603472014-01-09 13:42:56 +000059unsigned CommaSeparatedList::formatAfterToken(LineState &State,
60 ContinuationIndenter *Indenter,
61 bool DryRun) {
62 if (!State.NextToken->Previous || !State.NextToken->Previous->Previous)
Daniel Jasper8de9ed02013-08-22 15:00:41 +000063 return 0;
64
65 // Ensure that we start on the opening brace.
66 const FormatToken *LBrace = State.NextToken->Previous->Previous;
Daniel Jasperb05a81d2014-05-09 13:11:16 +000067 if (LBrace->isNot(tok::l_brace) || LBrace->BlockKind == BK_Block ||
Daniel Jasperb596fb22013-10-24 10:31:50 +000068 LBrace->Type == TT_DictLiteral ||
Daniel Jasper8de9ed02013-08-22 15:00:41 +000069 LBrace->Next->Type == TT_DesignatedInitializerPeriod)
70 return 0;
71
Daniel Jaspercb3f0ed2013-08-27 08:43:47 +000072 // Calculate the number of code points we have to format this list. As the
73 // first token is already placed, we have to subtract it.
Daniel Jasperb05a81d2014-05-09 13:11:16 +000074 unsigned RemainingCodePoints =
75 Style.ColumnLimit - State.Column + State.NextToken->Previous->ColumnWidth;
Daniel Jaspercb3f0ed2013-08-27 08:43:47 +000076
Daniel Jasper8de9ed02013-08-22 15:00:41 +000077 // Find the best ColumnFormat, i.e. the best number of columns to use.
Daniel Jaspercb3f0ed2013-08-27 08:43:47 +000078 const ColumnFormat *Format = getColumnFormat(RemainingCodePoints);
Daniel Jasper1a1a2ab2013-11-23 10:22:59 +000079 // If no ColumnFormat can be used, the braced list would generally be
80 // bin-packed. Add a severe penalty to this so that column layouts are
Alp Tokerf6a24ce2013-12-05 16:25:25 +000081 // preferred if possible.
Daniel Jasper8de9ed02013-08-22 15:00:41 +000082 if (!Format)
Daniel Jasper1a1a2ab2013-11-23 10:22:59 +000083 return 10000;
Daniel Jasper8de9ed02013-08-22 15:00:41 +000084
85 // Format the entire list.
86 unsigned Penalty = 0;
87 unsigned Column = 0;
88 unsigned Item = 0;
89 while (State.NextToken != LBrace->MatchingParen) {
90 bool NewLine = false;
91 unsigned ExtraSpaces = 0;
92
93 // If the previous token was one of our commas, we are now on the next item.
94 if (Item < Commas.size() && State.NextToken->Previous == Commas[Item]) {
95 if (!State.NextToken->isTrailingComment()) {
96 ExtraSpaces += Format->ColumnSizes[Column] - ItemLengths[Item];
97 ++Column;
98 }
99 ++Item;
100 }
101
102 if (Column == Format->Columns || State.NextToken->MustBreakBefore) {
103 Column = 0;
104 NewLine = true;
105 }
106
107 // Place token using the continuation indenter and store the penalty.
108 Penalty += Indenter->addTokenToState(State, NewLine, DryRun, ExtraSpaces);
109 }
110 return Penalty;
111}
112
Daniel Jasper01603472014-01-09 13:42:56 +0000113unsigned CommaSeparatedList::formatFromToken(LineState &State,
114 ContinuationIndenter *Indenter,
115 bool DryRun) {
116 if (HasNestedBracedList)
117 State.Stack.back().AvoidBinPacking = true;
118 return 0;
119}
120
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000121// Returns the lengths in code points between Begin and End (both included),
122// assuming that the entire sequence is put on a single line.
123static unsigned CodePointsBetween(const FormatToken *Begin,
124 const FormatToken *End) {
Daniel Jasper8863ada2013-08-26 08:10:17 +0000125 assert(End->TotalLength >= Begin->TotalLength);
Alexander Kornienko39856b72013-09-10 09:38:25 +0000126 return End->TotalLength - Begin->TotalLength + Begin->ColumnWidth;
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000127}
128
129void CommaSeparatedList::precomputeFormattingInfos(const FormatToken *Token) {
Daniel Jasper8863ada2013-08-26 08:10:17 +0000130 // FIXME: At some point we might want to do this for other lists, too.
Daniel Jasper01603472014-01-09 13:42:56 +0000131 if (!Token->MatchingParen || Token->isNot(tok::l_brace))
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000132 return;
133
Daniel Jasper839922e2014-08-13 08:46:21 +0000134 // In C++11 braced list style, we should not format in columns unless they
135 // have many items (20 or more) or we allow bin-packing of function
136 // parameters.
137 if (Style.Cpp11BracedListStyle && !Style.BinPackParameters &&
138 Commas.size() < 19)
Daniel Jasperae8e0d82014-04-17 11:32:02 +0000139 return;
140
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000141 FormatToken *ItemBegin = Token->Next;
142 SmallVector<bool, 8> MustBreakBeforeItem;
143
144 // The lengths of an item if it is put at the end of the line. This includes
145 // trailing comments which are otherwise ignored for column alignment.
146 SmallVector<unsigned, 8> EndOfLineItemLength;
147
Daniel Jasper540dbe22014-09-19 08:28:43 +0000148 unsigned MinItemLength = Style.ColumnLimit;
149 unsigned MaxItemLength = 0;
150
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000151 for (unsigned i = 0, e = Commas.size() + 1; i != e; ++i) {
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000152 // Skip comments on their own line.
153 while (ItemBegin->HasUnescapedNewline && ItemBegin->isTrailingComment())
154 ItemBegin = ItemBegin->Next;
155
156 MustBreakBeforeItem.push_back(ItemBegin->MustBreakBefore);
Daniel Jasper7c72d9f2013-10-24 14:14:49 +0000157 if (ItemBegin->is(tok::l_brace))
158 HasNestedBracedList = true;
Craig Topper2145bc02014-05-09 08:15:10 +0000159 const FormatToken *ItemEnd = nullptr;
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000160 if (i == Commas.size()) {
161 ItemEnd = Token->MatchingParen;
162 const FormatToken *NonCommentEnd = ItemEnd->getPreviousNonComment();
163 ItemLengths.push_back(CodePointsBetween(ItemBegin, NonCommentEnd));
164 if (Style.Cpp11BracedListStyle) {
165 // In Cpp11 braced list style, the } and possibly other subsequent
166 // tokens will need to stay on a line with the last element.
167 while (ItemEnd->Next && !ItemEnd->Next->CanBreakBefore)
168 ItemEnd = ItemEnd->Next;
169 } else {
170 // In other braced lists styles, the "}" can be wrapped to the new line.
171 ItemEnd = Token->MatchingParen->Previous;
172 }
173 } else {
174 ItemEnd = Commas[i];
175 // The comma is counted as part of the item when calculating the length.
Daniel Jasper8863ada2013-08-26 08:10:17 +0000176 ItemLengths.push_back(CodePointsBetween(ItemBegin, ItemEnd));
Daniel Jasper540dbe22014-09-19 08:28:43 +0000177 MinItemLength = std::min(MinItemLength, ItemLengths.back());
178 MaxItemLength = std::max(MaxItemLength, ItemLengths.back());
179
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000180 // Consume trailing comments so the are included in EndOfLineItemLength.
181 if (ItemEnd->Next && !ItemEnd->Next->HasUnescapedNewline &&
182 ItemEnd->Next->isTrailingComment())
183 ItemEnd = ItemEnd->Next;
184 }
185 EndOfLineItemLength.push_back(CodePointsBetween(ItemBegin, ItemEnd));
Daniel Jasper8863ada2013-08-26 08:10:17 +0000186 // If there is a trailing comma in the list, the next item will start at the
187 // closing brace. Don't create an extra item for this.
188 if (ItemEnd->getNextNonComment() == Token->MatchingParen)
189 break;
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000190 ItemBegin = ItemEnd->Next;
191 }
192
Daniel Jasper01603472014-01-09 13:42:56 +0000193 // If this doesn't have a nested list, we require at least 6 elements in order
194 // create a column layout. If it has a nested list, column layout ensures one
Daniel Jasper540dbe22014-09-19 08:28:43 +0000195 // list element per line. If the difference between the shortest and longest
196 // element is too large, column layout would create too much whitespace.
197 if (HasNestedBracedList || Commas.size() < 5 || Token->NestingLevel != 0 ||
198 MaxItemLength - MinItemLength > 10)
Daniel Jasper01603472014-01-09 13:42:56 +0000199 return;
200
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000201 // We can never place more than ColumnLimit / 3 items in a row (because of the
202 // spaces and the comma).
203 for (unsigned Columns = 1; Columns <= Style.ColumnLimit / 3; ++Columns) {
204 ColumnFormat Format;
205 Format.Columns = Columns;
206 Format.ColumnSizes.resize(Columns);
Daniel Jasper7c72d9f2013-10-24 14:14:49 +0000207 Format.LineCount = 1;
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000208 bool HasRowWithSufficientColumns = false;
209 unsigned Column = 0;
210 for (unsigned i = 0, e = ItemLengths.size(); i != e; ++i) {
Manuel Klimek71814b42013-10-11 21:25:45 +0000211 assert(i < MustBreakBeforeItem.size());
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000212 if (MustBreakBeforeItem[i] || Column == Columns) {
213 ++Format.LineCount;
214 Column = 0;
215 }
216 if (Column == Columns - 1)
217 HasRowWithSufficientColumns = true;
218 unsigned length =
219 (Column == Columns - 1) ? EndOfLineItemLength[i] : ItemLengths[i];
Daniel Jasperb05a81d2014-05-09 13:11:16 +0000220 Format.ColumnSizes[Column] = std::max(Format.ColumnSizes[Column], length);
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000221 ++Column;
222 }
223 // If all rows are terminated early (e.g. by trailing comments), we don't
224 // need to look further.
225 if (!HasRowWithSufficientColumns)
226 break;
227 Format.TotalWidth = Columns - 1; // Width of the N-1 spaces.
228 for (unsigned i = 0; i < Columns; ++i) {
229 Format.TotalWidth += Format.ColumnSizes[i];
230 }
231
232 // Ignore layouts that are bound to violate the column limit.
233 if (Format.TotalWidth > Style.ColumnLimit)
234 continue;
235
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000236 Formats.push_back(Format);
237 }
238}
239
240const CommaSeparatedList::ColumnFormat *
241CommaSeparatedList::getColumnFormat(unsigned RemainingCharacters) const {
Craig Topper2145bc02014-05-09 08:15:10 +0000242 const ColumnFormat *BestFormat = nullptr;
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000243 for (SmallVector<ColumnFormat, 4>::const_reverse_iterator
244 I = Formats.rbegin(),
245 E = Formats.rend();
246 I != E; ++I) {
247 if (I->TotalWidth <= RemainingCharacters) {
248 if (BestFormat && I->LineCount > BestFormat->LineCount)
249 break;
250 BestFormat = &*I;
251 }
252 }
253 return BestFormat;
254}
255
256} // namespace format
257} // namespace clang