Lines Matching refs:Penalty
1030 unsigned &Penalty) { in formatChildren() argument
1045 Penalty += in formatChildren()
1080 Penalty += in formatChildren()
1117 unsigned Penalty = 0; in formatLine() local
1118 formatChildren(State, Newline, /*DryRun=*/false, Penalty); in formatLine()
1136 unsigned Penalty = 0; in formatLine() local
1140 formatChildren(State, /*NewLine=*/false, DryRun, Penalty); in formatLine()
1144 return Penalty; in formatLine()
1228 unsigned Penalty = 0; in analyzeSolutionSpace() local
1236 Penalty = Queue.top().first.first; in analyzeSolutionSpace()
1240 << "\n---\nPenalty for line: " << Penalty << "\n"); in analyzeSolutionSpace()
1257 addNextStateToQueue(Penalty, Node, /*NewLine=*/false, &Count, &Queue); in analyzeSolutionSpace()
1259 addNextStateToQueue(Penalty, Node, /*NewLine=*/true, &Count, &Queue); in analyzeSolutionSpace()
1277 return Penalty; in analyzeSolutionSpace()
1284 void addNextStateToQueue(unsigned Penalty, StateNode *PreviousNode, in addNextStateToQueue() argument
1293 if (!formatChildren(Node->State, NewLine, /*DryRun=*/true, Penalty)) in addNextStateToQueue()
1296 Penalty += Indenter->addTokenToState(Node->State, NewLine, true); in addNextStateToQueue()
1298 Queue->push(QueueItem(OrderedPenalty(Penalty, *Count), Node)); in addNextStateToQueue()
1312 unsigned Penalty = 0; in reconstructPath() local
1313 formatChildren(State, Node->NewLine, /*DryRun=*/false, Penalty); in reconstructPath()
1314 Penalty += Indenter->addTokenToState(State, Node->NewLine, false); in reconstructPath()
1321 << " on a new line: " << Penalty << "\n"; in reconstructPath()
1346 unsigned Penalty = 0; in format() local
1408 Penalty += NoLineBreakFormatter(Indenter, Whitespaces, Style, this) in format()
1412 Penalty += OptimizingLineFormatter(Indenter, Whitespaces, Style, this) in format()
1456 PenaltyCache[CacheKey] = Penalty; in format()
1457 return Penalty; in format()