Lines Matching refs:Penalty
510 unsigned &Penalty) { in formatChildren() argument
523 Penalty += in formatChildren()
557 Penalty += formatLine(*Previous.Children[0], State.Column + 1, DryRun); in formatChildren()
591 unsigned Penalty = 0; in formatLine() local
592 formatChildren(State, Newline, /*DryRun=*/false, Penalty); in formatLine()
610 unsigned Penalty = 0; in formatLine() local
613 formatChildren(State, /*Newline=*/false, DryRun, Penalty); in formatLine()
616 return Penalty; in formatLine()
698 unsigned Penalty = 0; in analyzeSolutionSpace() local
702 Penalty = Queue.top().first.first; in analyzeSolutionSpace()
705 DEBUG(llvm::dbgs() << "\n---\nPenalty for line: " << Penalty << "\n"); in analyzeSolutionSpace()
721 addNextStateToQueue(Penalty, Node, /*NewLine=*/false, &Count, &Queue); in analyzeSolutionSpace()
723 addNextStateToQueue(Penalty, Node, /*NewLine=*/true, &Count, &Queue); in analyzeSolutionSpace()
740 return Penalty; in analyzeSolutionSpace()
747 void addNextStateToQueue(unsigned Penalty, StateNode *PreviousNode, in addNextStateToQueue() argument
756 if (!formatChildren(Node->State, NewLine, /*DryRun=*/true, Penalty)) in addNextStateToQueue()
759 Penalty += Indenter->addTokenToState(Node->State, NewLine, true); in addNextStateToQueue()
761 Queue->push(QueueItem(OrderedPenalty(Penalty, *Count), Node)); in addNextStateToQueue()
776 unsigned Penalty = 0; in reconstructPath() local
777 formatChildren(State, (*I)->NewLine, /*DryRun=*/false, Penalty); in reconstructPath()
778 Penalty += Indenter->addTokenToState(State, (*I)->NewLine, false); in reconstructPath()
785 << Penalty << "\n"; in reconstructPath()
810 unsigned Penalty = 0; in format() local
856 Penalty += NoLineBreakFormatter(Indenter, Whitespaces, Style, this) in format()
859 Penalty += OptimizingLineFormatter(Indenter, Whitespaces, Style, this) in format()
898 PenaltyCache[CacheKey] = Penalty; in format()
899 return Penalty; in format()