[clang-format] Respect BreakBeforeClosingBrace while calculating length

Summary:
This patch makes `getLengthToMatchingParen` respect the `BreakBeforeClosingBrace`
ParenState for matching scope closers. In order to distinguish between paren states
introduced by real vs. fake parens, I've added the token opening the ParensState
to that struct.

Reviewers: djasper

Reviewed By: djasper

Subscribers: klimek, cfe-commits

Differential Revision: https://reviews.llvm.org/D46519

git-svn-id: https://llvm.org/svn/llvm-project/cfe/trunk@331857 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Krasimir Georgiev 2018-05-09 09:02:11 +00:00
Родитель 473af992c6
Коммит 5d18b5a0d3
6 изменённых файлов: 135 добавлений и 20 удалений

Просмотреть файл

@ -35,12 +35,70 @@ static bool shouldIndentWrappedSelectorName(const FormatStyle &Style,
// Returns the length of everything up to the first possible line break after // Returns the length of everything up to the first possible line break after
// the ), ], } or > matching \c Tok. // the ), ], } or > matching \c Tok.
static unsigned getLengthToMatchingParen(const FormatToken &Tok) { static unsigned getLengthToMatchingParen(const FormatToken &Tok,
const std::vector<ParenState> &Stack) {
// Normally whether or not a break before T is possible is calculated and
// stored in T.CanBreakBefore. Braces, array initializers and text proto
// messages like `key: < ... >` are an exception: a break is possible
// before a closing brace R if a break was inserted after the corresponding
// opening brace. The information about whether or not a break is needed
// before a closing brace R is stored in the ParenState field
// S.BreakBeforeClosingBrace where S is the state that R closes.
//
// In order to decide whether there can be a break before encountered right
// braces, this implementation iterates over the sequence of tokens and over
// the paren stack in lockstep, keeping track of the stack level which visited
// right braces correspond to in MatchingStackIndex.
//
// For example, consider:
// L. <- line number
// 1. {
// 2. {1},
// 3. {2},
// 4. {{3}}}
// ^ where we call this method with this token.
// The paren stack at this point contains 3 brace levels:
// 0. { at line 1, BreakBeforeClosingBrace: true
// 1. first { at line 4, BreakBeforeClosingBrace: false
// 2. second { at line 4, BreakBeforeClosingBrace: false,
// where there might be fake parens levels in-between these levels.
// The algorithm will start at the first } on line 4, which is the matching
// brace of the initial left brace and at level 2 of the stack. Then,
// examining BreakBeforeClosingBrace: false at level 2, it will continue to
// the second } on line 4, and will traverse the stack downwards until it
// finds the matching { on level 1. Then, examining BreakBeforeClosingBrace:
// false at level 1, it will continue to the third } on line 4 and will
// traverse the stack downwards until it finds the matching { on level 0.
// Then, examining BreakBeforeClosingBrace: true at level 0, the algorithm
// will stop and will use the second } on line 4 to determine the length to
// return, as in this example the range will include the tokens: {3}}
//
// The algorithm will only traverse the stack if it encounters braces, array
// initializer squares or text proto angle brackets.
if (!Tok.MatchingParen) if (!Tok.MatchingParen)
return 0; return 0;
FormatToken *End = Tok.MatchingParen; FormatToken *End = Tok.MatchingParen;
while (End->Next && !End->Next->CanBreakBefore) { // Maintains a stack level corresponding to the current End token.
End = End->Next; int MatchingStackIndex = Stack.size() - 1;
// Traverses the stack downwards, looking for the level to which LBrace
// corresponds. Returns either a pointer to the matching level or nullptr if
// LParen is not found in the initial portion of the stack up to
// MatchingStackIndex.
auto FindParenState = [&](const FormatToken *LBrace) -> const ParenState * {
while (MatchingStackIndex >= 0 && Stack[MatchingStackIndex].Tok != LBrace)
--MatchingStackIndex;
return MatchingStackIndex >= 0 ? &Stack[MatchingStackIndex] : nullptr;
};
for (; End->Next; End = End->Next) {
if (End->Next->CanBreakBefore || !End->Next->closesScope())
break;
if (End->Next->MatchingParen->isOneOf(tok::l_brace,
TT_ArrayInitializerLSquare,
tok::less)) {
const ParenState *State = FindParenState(End->Next->MatchingParen);
if (State && State->BreakBeforeClosingBrace)
break;
}
} }
return End->TotalLength - Tok.TotalLength + 1; return End->TotalLength - Tok.TotalLength + 1;
} }
@ -192,7 +250,7 @@ LineState ContinuationIndenter::getInitialState(unsigned FirstIndent,
State.Column = 0; State.Column = 0;
State.Line = Line; State.Line = Line;
State.NextToken = Line->First; State.NextToken = Line->First;
State.Stack.push_back(ParenState(FirstIndent, FirstIndent, State.Stack.push_back(ParenState(/*Tok=*/nullptr, FirstIndent, FirstIndent,
/*AvoidBinPacking=*/false, /*AvoidBinPacking=*/false,
/*NoLineBreak=*/false)); /*NoLineBreak=*/false));
State.LineContainsContinuedForLoopSection = false; State.LineContainsContinuedForLoopSection = false;
@ -299,7 +357,7 @@ bool ContinuationIndenter::mustBreak(const LineState &State) {
Previous.ParameterCount > 1) || Previous.ParameterCount > 1) ||
opensProtoMessageField(Previous, Style)) && opensProtoMessageField(Previous, Style)) &&
Style.ColumnLimit > 0 && Style.ColumnLimit > 0 &&
getLengthToMatchingParen(Previous) + State.Column - 1 > getLengthToMatchingParen(Previous, State.Stack) + State.Column - 1 >
getColumnLimit(State)) getColumnLimit(State))
return true; return true;
@ -1122,6 +1180,7 @@ void ContinuationIndenter::moveStatePastFakeLParens(LineState &State,
E = Current.FakeLParens.rend(); E = Current.FakeLParens.rend();
I != E; ++I) { I != E; ++I) {
ParenState NewParenState = State.Stack.back(); ParenState NewParenState = State.Stack.back();
NewParenState.Tok = nullptr;
NewParenState.ContainsLineBreak = false; NewParenState.ContainsLineBreak = false;
NewParenState.LastOperatorWrapped = true; NewParenState.LastOperatorWrapped = true;
NewParenState.NoLineBreak = NewParenState.NoLineBreak =
@ -1265,7 +1324,7 @@ void ContinuationIndenter::moveStatePastScopeOpener(LineState &State,
if (Style.ColumnLimit) { if (Style.ColumnLimit) {
// If this '[' opens an ObjC call, determine whether all parameters fit // If this '[' opens an ObjC call, determine whether all parameters fit
// into one line and put one per line if they don't. // into one line and put one per line if they don't.
if (getLengthToMatchingParen(Current) + State.Column > if (getLengthToMatchingParen(Current, State.Stack) + State.Column >
getColumnLimit(State)) getColumnLimit(State))
BreakBeforeParameter = true; BreakBeforeParameter = true;
} else { } else {
@ -1296,7 +1355,7 @@ void ContinuationIndenter::moveStatePastScopeOpener(LineState &State,
(Current.is(TT_TemplateOpener) && (Current.is(TT_TemplateOpener) &&
State.Stack.back().ContainsUnwrappedBuilder)); State.Stack.back().ContainsUnwrappedBuilder));
State.Stack.push_back( State.Stack.push_back(
ParenState(NewIndent, LastSpace, AvoidBinPacking, NoLineBreak)); ParenState(&Current, NewIndent, LastSpace, AvoidBinPacking, NoLineBreak));
State.Stack.back().NestedBlockIndent = NestedBlockIndent; State.Stack.back().NestedBlockIndent = NestedBlockIndent;
State.Stack.back().BreakBeforeParameter = BreakBeforeParameter; State.Stack.back().BreakBeforeParameter = BreakBeforeParameter;
State.Stack.back().HasMultipleNestedBlocks = Current.BlockParameterCount > 1; State.Stack.back().HasMultipleNestedBlocks = Current.BlockParameterCount > 1;
@ -1334,7 +1393,8 @@ void ContinuationIndenter::moveStateToNewBlock(LineState &State) {
NestedBlockIndent + (State.NextToken->is(TT_ObjCBlockLBrace) NestedBlockIndent + (State.NextToken->is(TT_ObjCBlockLBrace)
? Style.ObjCBlockIndentWidth ? Style.ObjCBlockIndentWidth
: Style.IndentWidth); : Style.IndentWidth);
State.Stack.push_back(ParenState(NewIndent, State.Stack.back().LastSpace, State.Stack.push_back(ParenState(State.NextToken, NewIndent,
State.Stack.back().LastSpace,
/*AvoidBinPacking=*/true, /*AvoidBinPacking=*/true,
/*NoLineBreak=*/false)); /*NoLineBreak=*/false));
State.Stack.back().NestedBlockIndent = NestedBlockIndent; State.Stack.back().NestedBlockIndent = NestedBlockIndent;

Просмотреть файл

@ -200,16 +200,23 @@ private:
}; };
struct ParenState { struct ParenState {
ParenState(unsigned Indent, unsigned LastSpace, bool AvoidBinPacking, ParenState(const FormatToken *Tok, unsigned Indent, unsigned LastSpace,
bool NoLineBreak) bool AvoidBinPacking, bool NoLineBreak)
: Indent(Indent), LastSpace(LastSpace), NestedBlockIndent(Indent), : Tok(Tok), Indent(Indent), LastSpace(LastSpace),
BreakBeforeClosingBrace(false), AvoidBinPacking(AvoidBinPacking), NestedBlockIndent(Indent), BreakBeforeClosingBrace(false),
BreakBeforeParameter(false), NoLineBreak(NoLineBreak), AvoidBinPacking(AvoidBinPacking), BreakBeforeParameter(false),
NoLineBreakInOperand(false), LastOperatorWrapped(true), NoLineBreak(NoLineBreak), NoLineBreakInOperand(false),
ContainsLineBreak(false), ContainsUnwrappedBuilder(false), LastOperatorWrapped(true), ContainsLineBreak(false),
AlignColons(true), ObjCSelectorNameFound(false), ContainsUnwrappedBuilder(false), AlignColons(true),
HasMultipleNestedBlocks(false), NestedBlockInlined(false), ObjCSelectorNameFound(false), HasMultipleNestedBlocks(false),
IsInsideObjCArrayLiteral(false) {} NestedBlockInlined(false), IsInsideObjCArrayLiteral(false) {}
/// \brief The token opening this parenthesis level, or nullptr if this level
/// is opened by fake parenthesis.
///
/// Not considered for memoization as it will always have the same value at
/// the same token.
const FormatToken *Tok;
/// The position to which a specific parenthesis level needs to be /// The position to which a specific parenthesis level needs to be
/// indented. /// indented.

Просмотреть файл

@ -659,8 +659,8 @@ static void markFinalized(FormatToken *Tok) {
static void printLineState(const LineState &State) { static void printLineState(const LineState &State) {
llvm::dbgs() << "State: "; llvm::dbgs() << "State: ";
for (const ParenState &P : State.Stack) { for (const ParenState &P : State.Stack) {
llvm::dbgs() << P.Indent << "|" << P.LastSpace << "|" << P.NestedBlockIndent llvm::dbgs() << (P.Tok ? P.Tok->TokenText : "F") << "|" << P.Indent << "|"
<< " "; << P.LastSpace << "|" << P.NestedBlockIndent << " ";
} }
llvm::dbgs() << State.NextToken->TokenText << "\n"; llvm::dbgs() << State.NextToken->TokenText << "\n";
} }

Просмотреть файл

@ -486,6 +486,7 @@ TEST_F(FormatTestProto, AcceptsOperatorAsKeyInOptions) {
" ccccccccccccccccccccccc: <\n" " ccccccccccccccccccccccc: <\n"
" operator: 1\n" " operator: 1\n"
" operator: 2\n" " operator: 2\n"
" operator: 3\n"
" operator { key: value }\n" " operator { key: value }\n"
" >\n" " >\n"
" >\n" " >\n"

Просмотреть файл

@ -822,6 +822,41 @@ xxxxxxxaaaaax wwwwwww = _Verxrrrrrrrrr(PARSE_TEXT_PROTO(R"pb(
)test", Style)); )test", Style));
} }
TEST_F(FormatTestRawStrings, KeepsRBraceFolloedByMoreLBracesOnSameLine) {
FormatStyle Style = getRawStringPbStyleWithColumns(80);
expect_eq(
R"test(
int f() {
if (1) {
TTTTTTTTTTTTTTTTTTTTT s = PARSE_TEXT_PROTO(R"pb(
ttttttttt {
ppppppppppppp {
[cccccccccc.pppppppppppppp.TTTTTTTTTTTTTTTTTTTT] { field_1: "123_1" }
[cccccccccc.pppppppppppppp.TTTTTTTTTTTTTTTTTTTT] { field_2: "123_2" }
}
}
)pb");
}
}
)test",
format(
R"test(
int f() {
if (1) {
TTTTTTTTTTTTTTTTTTTTT s = PARSE_TEXT_PROTO(R"pb(
ttttttttt {
ppppppppppppp {
[cccccccccc.pppppppppppppp.TTTTTTTTTTTTTTTTTTTT] { field_1: "123_1" }
[cccccccccc.pppppppppppppp.TTTTTTTTTTTTTTTTTTTT] { field_2: "123_2" }}}
)pb");
}
}
)test",
Style));
}
} // end namespace } // end namespace
} // end namespace format } // end namespace format
} // end namespace clang } // end namespace clang

Просмотреть файл

@ -469,6 +469,7 @@ TEST_F(FormatTestTextProto, AcceptsOperatorAsKey) {
" ccccccccccccccccccccccc: <\n" " ccccccccccccccccccccccc: <\n"
" operator: 1\n" " operator: 1\n"
" operator: 2\n" " operator: 2\n"
" operator: 3\n"
" operator { key: value }\n" " operator { key: value }\n"
" >\n" " >\n"
" >\n" " >\n"
@ -495,5 +496,16 @@ TEST_F(FormatTestTextProto, PutsMultipleEntriesInExtensionsOnNewlines) {
"}", Style); "}", Style);
} }
TEST_F(FormatTestTextProto, BreaksAfterBraceFollowedByClosingBraceOnNextLine) {
FormatStyle Style = getGoogleStyle(FormatStyle::LK_TextProto);
Style.ColumnLimit = 60;
verifyFormat("keys: [\n"
" data: { item: 'aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa' }\n"
"]");
verifyFormat("keys: <\n"
" data: { item: 'aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa' }\n"
">");
}
} // end namespace tooling } // end namespace tooling
} // end namespace clang } // end namespace clang