Lines Matching refs:Penalty

350   unsigned Penalty = 0;  in format()  local
425 formatChildren(State, /*Newline=*/false, DryRun, Penalty); in format()
434 Penalty += format(TheLine, Indent, DryRun); in format()
471 PenaltyCache[CacheKey] = Penalty; in format()
472 return Penalty; in format()
571 unsigned Penalty = 0; in analyzeSolutionSpace() local
575 Penalty = Queue.top().first.first; in analyzeSolutionSpace()
578 DEBUG(llvm::dbgs() << "\n---\nPenalty for line: " << Penalty << "\n"); in analyzeSolutionSpace()
594 addNextStateToQueue(Penalty, Node, /*NewLine=*/false, &Count, &Queue); in analyzeSolutionSpace()
596 addNextStateToQueue(Penalty, Node, /*NewLine=*/true, &Count, &Queue); in analyzeSolutionSpace()
613 return Penalty; in analyzeSolutionSpace()
637 unsigned Penalty = 0; in reconstructPath() local
638 formatChildren(State, (*I)->NewLine, /*DryRun=*/false, Penalty); in reconstructPath()
639 Penalty += Indenter->addTokenToState(State, (*I)->NewLine, false); in reconstructPath()
646 << Penalty << "\n"; in reconstructPath()
652 void UnwrappedLineFormatter::addNextStateToQueue(unsigned Penalty, in addNextStateToQueue() argument
663 if (!formatChildren(Node->State, NewLine, /*DryRun=*/true, Penalty)) in addNextStateToQueue()
666 Penalty += Indenter->addTokenToState(Node->State, NewLine, true); in addNextStateToQueue()
668 Queue->push(QueueItem(OrderedPenalty(Penalty, *Count), Node)); in addNextStateToQueue()
673 bool DryRun, unsigned &Penalty) { in formatChildren() argument
686 Penalty += format(Previous.Children, DryRun, AdditionalIndent, in formatChildren()
719 Penalty += format(*Previous.Children[0], State.Column + 1, DryRun); in formatChildren()