gn: handle continued suffix comments

tools/gn/parser.cc

 // Copyright (c) 2013 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "tools/gn/parser.h"
 
 #include "base/logging.h"
 #include "tools/gn/functions.h"
 #include "tools/gn/operators.h"
 #include "tools/gn/token.h"
@@ skipping 532 matching lines @@
   TraverseOrder(file, &pre, &post);
 
   // Assign line comments to syntax immediately following.
   int cur_comment = 0;
   for (std::vector<const ParseNode*>::const_iterator i = pre.begin();
        i != pre.end();
        ++i) {
     const Location& start = (*i)->GetRange().begin();
     while (cur_comment < static_cast<int>(line_comment_tokens_.size())) {
       if (start.byte() >= line_comment_tokens_[cur_comment].location().byte()) {
-        const_cast<ParseNode*>((*i))->comments_mutable()->append_before(
+        const_cast<ParseNode*>(*i)->comments_mutable()->append_before(
             line_comment_tokens_[cur_comment]);
         ++cur_comment;
       } else {
         break;
       }
     }
   }
 
   // Remaining line comments go at end of file.
   for (; cur_comment < static_cast<int>(line_comment_tokens_.size());
@@ skipping 18 matching lines @@
     //
     // sources = [ "a",
     //     "b" ] # comment
     //
     // it's attached to "b", not sources = [ ... ].
     if (start.line_number() != end.line_number())
       continue;
 
     while (cur_comment >= 0) {
       if (end.byte() <= suffix_comment_tokens_[cur_comment].location().byte()) {
-        const_cast<ParseNode*>((*i))->comments_mutable()->append_suffix(
+        const_cast<ParseNode*>(*i)->comments_mutable()->append_suffix(
             suffix_comment_tokens_[cur_comment]);
         --cur_comment;
       } else {
         break;
       }
     }
+
+    // Suffix comments were assigned in reverse, so if there were multiple on
+    // the same node, they need to be reversed.
+    const_cast<ParseNode*>(*i)->comments_mutable()->ReverseSuffix();
   }
 }