809     unsigned Penalty = 0;  in format()  local
883             formatChildren(State, /*Newline=*/false, /*DryRun=*/false, Penalty);  in format()
892           Penalty += format(TheLine, Indent, DryRun);  in format()
933     PenaltyCache[CacheKey] = Penalty;  in format()
934     return Penalty;  in format()
1087     unsigned Penalty = 0;  in analyzeSolutionSpace()  local
1091       Penalty = Queue.top().first.first;  in analyzeSolutionSpace()
1094         DEBUG(llvm::dbgs() << "\n---\nPenalty for line: " << Penalty << "\n");  in analyzeSolutionSpace()
1110         addNextStateToQueue(Penalty, Node, /*NewLine=*/false, &Count, &Queue);  in analyzeSolutionSpace()
1112         addNextStateToQueue(Penalty, Node, /*NewLine=*/true, &Count, &Queue);  in analyzeSolutionSpace()
1129     return Penalty;  in analyzeSolutionSpace()
1141       unsigned Penalty = 0;  in reconstructPath()  local
1142       formatChildren(State, (*I)->NewLine, /*DryRun=*/false, Penalty);  in reconstructPath()
1143       Penalty += Indenter->addTokenToState(State, (*I)->NewLine, false);  in reconstructPath()
1149                        << Penalty << "\n";  in reconstructPath()
1159   void addNextStateToQueue(unsigned Penalty, StateNode *PreviousNode,  in addNextStateToQueue()  argument
1168     if (!formatChildren(Node->State, NewLine, /*DryRun=*/true, Penalty))  in addNextStateToQueue()
1171     Penalty += Indenter->addTokenToState(Node->State, NewLine, true);  in addNextStateToQueue()
1173     Queue->push(QueueItem(OrderedPenalty(Penalty, *Count), Node));  in addNextStateToQueue()
1198                       unsigned &Penalty) {  in formatChildren()  argument
1216       Penalty += format(Previous.Children, DryRun, AdditionalIndent,  in formatChildren()
1246     Penalty += format(*Previous.Children[0], State.Column + 1, DryRun);  in formatChildren()