blob: 2f0b32971b6d63fc79d6f1234ae738eabf274886 [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"
Daniel Jasperd9ff0352015-05-11 13:52:13 +000021#include <climits>
Daniel Jasper8de9ed02013-08-22 15:00:41 +000022
23namespace clang {
24namespace format {
25
Daniel Jaspercb51cf42014-01-16 09:11:55 +000026// FIXME: This is copy&pasted from Sema. Put it in a common place and remove
27// duplication.
28bool FormatToken::isSimpleTypeSpecifier() const {
29 switch (Tok.getKind()) {
30 case tok::kw_short:
31 case tok::kw_long:
32 case tok::kw___int64:
33 case tok::kw___int128:
34 case tok::kw_signed:
35 case tok::kw_unsigned:
36 case tok::kw_void:
37 case tok::kw_char:
38 case tok::kw_int:
39 case tok::kw_half:
40 case tok::kw_float:
41 case tok::kw_double:
42 case tok::kw_wchar_t:
43 case tok::kw_bool:
44 case tok::kw___underlying_type:
45 case tok::annot_typename:
46 case tok::kw_char16_t:
47 case tok::kw_char32_t:
48 case tok::kw_typeof:
49 case tok::kw_decltype:
50 return true;
51 default:
52 return false;
53 }
54}
55
Daniel Jasper8de9ed02013-08-22 15:00:41 +000056TokenRole::~TokenRole() {}
57
58void TokenRole::precomputeFormattingInfos(const FormatToken *Token) {}
59
Daniel Jasper01603472014-01-09 13:42:56 +000060unsigned CommaSeparatedList::formatAfterToken(LineState &State,
61 ContinuationIndenter *Indenter,
62 bool DryRun) {
Daniel Jasper60c27072015-05-13 08:16:00 +000063 if (State.NextToken == nullptr || !State.NextToken->Previous)
Daniel Jasper8de9ed02013-08-22 15:00:41 +000064 return 0;
65
66 // Ensure that we start on the opening brace.
Daniel Jasper60c27072015-05-13 08:16:00 +000067 const FormatToken *LBrace =
68 State.NextToken->Previous->getPreviousNonComment();
69 if (!LBrace || LBrace->isNot(tok::l_brace) || LBrace->BlockKind == BK_Block ||
Daniel Jasperb596fb22013-10-24 10:31:50 +000070 LBrace->Type == TT_DictLiteral ||
Daniel Jasper8de9ed02013-08-22 15:00:41 +000071 LBrace->Next->Type == TT_DesignatedInitializerPeriod)
72 return 0;
73
Daniel Jaspercb3f0ed2013-08-27 08:43:47 +000074 // Calculate the number of code points we have to format this list. As the
75 // first token is already placed, we have to subtract it.
Daniel Jasperb05a81d2014-05-09 13:11:16 +000076 unsigned RemainingCodePoints =
77 Style.ColumnLimit - State.Column + State.NextToken->Previous->ColumnWidth;
Daniel Jaspercb3f0ed2013-08-27 08:43:47 +000078
Daniel Jasper8de9ed02013-08-22 15:00:41 +000079 // Find the best ColumnFormat, i.e. the best number of columns to use.
Daniel Jaspercb3f0ed2013-08-27 08:43:47 +000080 const ColumnFormat *Format = getColumnFormat(RemainingCodePoints);
Daniel Jasper1a1a2ab2013-11-23 10:22:59 +000081 // If no ColumnFormat can be used, the braced list would generally be
82 // bin-packed. Add a severe penalty to this so that column layouts are
Alp Tokerf6a24ce2013-12-05 16:25:25 +000083 // preferred if possible.
Daniel Jasper8de9ed02013-08-22 15:00:41 +000084 if (!Format)
Daniel Jasper1a1a2ab2013-11-23 10:22:59 +000085 return 10000;
Daniel Jasper8de9ed02013-08-22 15:00:41 +000086
87 // Format the entire list.
88 unsigned Penalty = 0;
89 unsigned Column = 0;
90 unsigned Item = 0;
91 while (State.NextToken != LBrace->MatchingParen) {
92 bool NewLine = false;
93 unsigned ExtraSpaces = 0;
94
95 // If the previous token was one of our commas, we are now on the next item.
96 if (Item < Commas.size() && State.NextToken->Previous == Commas[Item]) {
97 if (!State.NextToken->isTrailingComment()) {
98 ExtraSpaces += Format->ColumnSizes[Column] - ItemLengths[Item];
99 ++Column;
100 }
101 ++Item;
102 }
103
104 if (Column == Format->Columns || State.NextToken->MustBreakBefore) {
105 Column = 0;
106 NewLine = true;
107 }
108
109 // Place token using the continuation indenter and store the penalty.
110 Penalty += Indenter->addTokenToState(State, NewLine, DryRun, ExtraSpaces);
111 }
112 return Penalty;
113}
114
Daniel Jasper01603472014-01-09 13:42:56 +0000115unsigned CommaSeparatedList::formatFromToken(LineState &State,
116 ContinuationIndenter *Indenter,
117 bool DryRun) {
118 if (HasNestedBracedList)
119 State.Stack.back().AvoidBinPacking = true;
120 return 0;
121}
122
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000123// Returns the lengths in code points between Begin and End (both included),
124// assuming that the entire sequence is put on a single line.
125static unsigned CodePointsBetween(const FormatToken *Begin,
126 const FormatToken *End) {
Daniel Jasper8863ada2013-08-26 08:10:17 +0000127 assert(End->TotalLength >= Begin->TotalLength);
Alexander Kornienko39856b72013-09-10 09:38:25 +0000128 return End->TotalLength - Begin->TotalLength + Begin->ColumnWidth;
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000129}
130
131void CommaSeparatedList::precomputeFormattingInfos(const FormatToken *Token) {
Daniel Jasper8863ada2013-08-26 08:10:17 +0000132 // FIXME: At some point we might want to do this for other lists, too.
Daniel Jasper01603472014-01-09 13:42:56 +0000133 if (!Token->MatchingParen || Token->isNot(tok::l_brace))
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000134 return;
135
Daniel Jasper839922e2014-08-13 08:46:21 +0000136 // In C++11 braced list style, we should not format in columns unless they
137 // have many items (20 or more) or we allow bin-packing of function
138 // parameters.
139 if (Style.Cpp11BracedListStyle && !Style.BinPackParameters &&
140 Commas.size() < 19)
Daniel Jasperae8e0d82014-04-17 11:32:02 +0000141 return;
142
Daniel Jasper13404da2014-11-27 14:40:48 +0000143 // Column format doesn't really make sense if we don't align after brackets.
144 if (!Style.AlignAfterOpenBracket)
145 return;
146
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000147 FormatToken *ItemBegin = Token->Next;
Daniel Jasper60c27072015-05-13 08:16:00 +0000148 while (ItemBegin->isTrailingComment())
149 ItemBegin = ItemBegin->Next;
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000150 SmallVector<bool, 8> MustBreakBeforeItem;
151
152 // The lengths of an item if it is put at the end of the line. This includes
153 // trailing comments which are otherwise ignored for column alignment.
154 SmallVector<unsigned, 8> EndOfLineItemLength;
155
156 for (unsigned i = 0, e = Commas.size() + 1; i != e; ++i) {
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000157 // Skip comments on their own line.
158 while (ItemBegin->HasUnescapedNewline && ItemBegin->isTrailingComment())
159 ItemBegin = ItemBegin->Next;
160
161 MustBreakBeforeItem.push_back(ItemBegin->MustBreakBefore);
Daniel Jasper7c72d9f2013-10-24 14:14:49 +0000162 if (ItemBegin->is(tok::l_brace))
163 HasNestedBracedList = true;
Craig Topper2145bc02014-05-09 08:15:10 +0000164 const FormatToken *ItemEnd = nullptr;
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000165 if (i == Commas.size()) {
166 ItemEnd = Token->MatchingParen;
167 const FormatToken *NonCommentEnd = ItemEnd->getPreviousNonComment();
168 ItemLengths.push_back(CodePointsBetween(ItemBegin, NonCommentEnd));
169 if (Style.Cpp11BracedListStyle) {
170 // In Cpp11 braced list style, the } and possibly other subsequent
171 // tokens will need to stay on a line with the last element.
172 while (ItemEnd->Next && !ItemEnd->Next->CanBreakBefore)
173 ItemEnd = ItemEnd->Next;
174 } else {
175 // In other braced lists styles, the "}" can be wrapped to the new line.
176 ItemEnd = Token->MatchingParen->Previous;
177 }
178 } else {
179 ItemEnd = Commas[i];
180 // The comma is counted as part of the item when calculating the length.
Daniel Jasper8863ada2013-08-26 08:10:17 +0000181 ItemLengths.push_back(CodePointsBetween(ItemBegin, ItemEnd));
Daniel Jasper540dbe22014-09-19 08:28:43 +0000182
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000183 // Consume trailing comments so the are included in EndOfLineItemLength.
184 if (ItemEnd->Next && !ItemEnd->Next->HasUnescapedNewline &&
185 ItemEnd->Next->isTrailingComment())
186 ItemEnd = ItemEnd->Next;
187 }
188 EndOfLineItemLength.push_back(CodePointsBetween(ItemBegin, ItemEnd));
Daniel Jasper8863ada2013-08-26 08:10:17 +0000189 // If there is a trailing comma in the list, the next item will start at the
190 // closing brace. Don't create an extra item for this.
191 if (ItemEnd->getNextNonComment() == Token->MatchingParen)
192 break;
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000193 ItemBegin = ItemEnd->Next;
194 }
195
Daniel Jasper01603472014-01-09 13:42:56 +0000196 // If this doesn't have a nested list, we require at least 6 elements in order
197 // create a column layout. If it has a nested list, column layout ensures one
Daniel Jasperd57843d2015-05-11 13:35:40 +0000198 // list element per line.
Daniel Jaspere4c16c72015-05-08 13:51:14 +0000199 if (Commas.size() < 5 || Token->NestingLevel != 0)
Daniel Jasper01603472014-01-09 13:42:56 +0000200 return;
201
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000202 // We can never place more than ColumnLimit / 3 items in a row (because of the
203 // spaces and the comma).
Daniel Jasperd57843d2015-05-11 13:35:40 +0000204 for (unsigned Columns = 1; Columns <= Style.ColumnLimit / 3; ++Columns) {
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000205 ColumnFormat Format;
206 Format.Columns = Columns;
207 Format.ColumnSizes.resize(Columns);
Daniel Jasperd57843d2015-05-11 13:35:40 +0000208 std::vector<unsigned> MinSizeInColumn(Columns, UINT_MAX);
Daniel Jasper7c72d9f2013-10-24 14:14:49 +0000209 Format.LineCount = 1;
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000210 bool HasRowWithSufficientColumns = false;
211 unsigned Column = 0;
212 for (unsigned i = 0, e = ItemLengths.size(); i != e; ++i) {
Manuel Klimek71814b42013-10-11 21:25:45 +0000213 assert(i < MustBreakBeforeItem.size());
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000214 if (MustBreakBeforeItem[i] || Column == Columns) {
215 ++Format.LineCount;
216 Column = 0;
217 }
218 if (Column == Columns - 1)
219 HasRowWithSufficientColumns = true;
Daniel Jasperd57843d2015-05-11 13:35:40 +0000220 unsigned Length =
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000221 (Column == Columns - 1) ? EndOfLineItemLength[i] : ItemLengths[i];
Daniel Jasperd57843d2015-05-11 13:35:40 +0000222 Format.ColumnSizes[Column] = std::max(Format.ColumnSizes[Column], Length);
223 MinSizeInColumn[Column] = std::min(MinSizeInColumn[Column], Length);
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000224 ++Column;
225 }
226 // If all rows are terminated early (e.g. by trailing comments), we don't
227 // need to look further.
228 if (!HasRowWithSufficientColumns)
229 break;
230 Format.TotalWidth = Columns - 1; // Width of the N-1 spaces.
Daniel Jasperd57843d2015-05-11 13:35:40 +0000231
232 for (unsigned i = 0; i < Columns; ++i)
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000233 Format.TotalWidth += Format.ColumnSizes[i];
Daniel Jasperd57843d2015-05-11 13:35:40 +0000234
235 // Don't use this Format, if the difference between the longest and shortest
236 // element in a column exceeds a threshold to avoid excessive spaces.
237 if ([&] {
238 for (unsigned i = 0; i < Columns - 1; ++i)
239 if (Format.ColumnSizes[i] - MinSizeInColumn[i] > 10)
240 return true;
241 return false;
242 }())
243 continue;
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000244
245 // Ignore layouts that are bound to violate the column limit.
246 if (Format.TotalWidth > Style.ColumnLimit)
247 continue;
248
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000249 Formats.push_back(Format);
250 }
251}
252
253const CommaSeparatedList::ColumnFormat *
254CommaSeparatedList::getColumnFormat(unsigned RemainingCharacters) const {
Craig Topper2145bc02014-05-09 08:15:10 +0000255 const ColumnFormat *BestFormat = nullptr;
Daniel Jasper8de9ed02013-08-22 15:00:41 +0000256 for (SmallVector<ColumnFormat, 4>::const_reverse_iterator
257 I = Formats.rbegin(),
258 E = Formats.rend();
259 I != E; ++I) {
260 if (I->TotalWidth <= RemainingCharacters) {
261 if (BestFormat && I->LineCount > BestFormat->LineCount)
262 break;
263 BestFormat = &*I;
264 }
265 }
266 return BestFormat;
267}
268
269} // namespace format
270} // namespace clang