Reverse the order of GN's cycle printing.

tools/gn/builder.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/builder.h"
 
 #include "tools/gn/config.h"
 #include "tools/gn/err.h"
 #include "tools/gn/loader.h"
 #include "tools/gn/scheduler.h"
@@ skipping 190 matching lines @@
     return false;
   }
 
   if (!bad_records.empty()) {
     // Our logic above found a bad node but didn't identify the problem. This
     // normally means a circular dependency.
     depstring = CheckForCircularDependencies(bad_records);
     if (depstring.empty()) {
       // Something's very wrong, just dump out the bad nodes.
       depstring = "I have no idea what went wrong, but these are unresolved, "
-          "possible due to an\ninternal error:";
+          "possibly due to an\ninternal error:";
       for (size_t i = 0; i < bad_records.size(); i++) {
         depstring += "\n\"" +
             bad_records[i]->label().GetUserVisibleName(false) + "\"";
       }
       *err = Err(Location(), "", depstring);
     } else {
       *err = Err(Location(), "Dependency cycle:", depstring);
     }
     return false;
   }
@@ skipping 297 matching lines @@
 
   return true;
 }
 
 std::string Builder::CheckForCircularDependencies(
     const std::vector<const BuilderRecord*>& bad_records) const {
   std::vector<const BuilderRecord*> cycle;
   if (!RecursiveFindCycle(bad_records[0], &cycle))
     return std::string();  // Didn't find a cycle, something else is wrong.
 
-  // Walk backwards since the dependency arrows point in the reverse direction.
   std::string ret;
-  for (int i = static_cast<int>(cycle.size()) - 1; i >= 0; i--) {
+  for (size_t i = 0; i < cycle.size(); i++) {
     ret += "  " + cycle[i]->label().GetUserVisibleName(false);
-    if (i != 0)
-      ret += " ->\n";
+    if (i != cycle.size() - 1)
+      ret += " ->";
+    ret += "\n";
   }
 
   return ret;
 }