660   struct StateNode {  struct in clang::format::__anon5061c3a60111::OptimizingLineFormatter
661     StateNode(const LineState &State, bool NewLine, StateNode *Previous)  in StateNode()  function
665     StateNode *Previous;  argument
670   typedef std::pair<OrderedPenalty, StateNode *> QueueItem;
693     StateNode *Node =  in analyzeSolutionSpace()
694         new (Allocator.Allocate()) StateNode(InitialState, false, nullptr);  in analyzeSolutionSpace()
703       StateNode *Node = Queue.top().second;  in analyzeSolutionSpace()
747   void addNextStateToQueue(unsigned Penalty, StateNode *PreviousNode,  in addNextStateToQueue()
754     StateNode *Node = new (Allocator.Allocate())  in addNextStateToQueue()
755         StateNode(PreviousNode->State, NewLine, PreviousNode);  in addNextStateToQueue()
767   void reconstructPath(LineState &State, StateNode *Best) {  in reconstructPath()
768     std::deque<StateNode *> Path;  in reconstructPath()
774     for (std::deque<StateNode *>::iterator I = Path.begin(), E = Path.end();  in reconstructPath()
791   llvm::SpecificBumpPtrAllocator<StateNode> Allocator;