[parser] Fix tail calls in for in/of loops

test/mjsunit/es6/tail-call.js

 // Copyright 2016 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 // Flags: --allow-natives-syntax --harmony-tailcalls
 // Flags: --harmony-do-expressions
 
 "use strict";
 
 Error.prepareStackTrace = (error,stack) => {
@@ skipping 277 matching lines @@
   }
   %NeverOptimizeFunction(g);
 
   function A() {
     this.x = 42;
     return g();
   }
 
   function test() {
     var o = new A();
-    %DebugPrint(o);
+    //%DebugPrint(o);

[adamk, 2016/09/15 15:48:53]

Why was this here/why is it commented?

[nickie, 2016/09/15 16:01:33]

Igor asked me to comment this out, while at this CL.
AFAIK, this just used to print more debug information when the test failed.

     assertEquals(153, o.x);
   }
 
   test();
   test();
   %OptimizeFunctionOnNextCall(test);
   test();
 })();
 
 
@@ skipping 71 matching lines @@
 
 
 // Tail calling from various statements.
 (function() {
   function g1() {
     for (var v in {a:0}) {
       return f_153([f_153, g1, test]);
     }
   }
 
+  function g1let() {
+    for (let v in {a:0}) {
+      return f_153([f_153, g1let, test]);
+    }
+  }
+
+  function g1nodecl() {
+    var v;
+    for (v in {a:0}) {
+      return f_153([f_153, g1nodecl, test]);
+    }
+  }
+
   function g2() {
     for (var v of [1, 2, 3]) {
       return f_153([f_153, g2, test]);
     }
   }
 
+  function g2let() {
+    for (let v of [1, 2, 3]) {
+      return f_153([f_153, g2let, test]);
+    }
+  }
+
+  function g2nodecl() {
+    var v;
+    for (v of [1, 2, 3]) {
+      return f_153([f_153, g2nodecl, test]);
+    }
+  }
+
   function g3() {
     for (var i = 0; i < 10; i++) {
       return f_153([f_153, test]);
     }
   }
 
+  function g3let() {
+    for (let i = 0; i < 10; i++) {
+      return f_153([f_153, test]);
+    }
+  }
+
+  function g3nodecl() {
+    var i;
+    for (i = 0; i < 10; i++) {
+      return f_153([f_153, test]);
+    }
+  }
+
   function g4() {
     while (true) {
       return f_153([f_153, test]);
     }
   }
 
   function g5() {
     do {
       return f_153([f_153, test]);
     } while (true);
   }
 
   function test() {
     assertEquals(153, g1());
+    assertEquals(153, g1let());
+    assertEquals(153, g1nodecl());
     assertEquals(153, g2());
+    assertEquals(153, g2let());
+    assertEquals(153, g2nodecl());
     assertEquals(153, g3());
+    assertEquals(153, g3let());
+    assertEquals(153, g3nodecl());
     assertEquals(153, g4());
     assertEquals(153, g5());
   }
   test();
   test();
   %OptimizeFunctionOnNextCall(test);
   test();
 })();
 
 
@@ skipping 181 matching lines @@
   }
 
   function test() {
     assertEquals(153, g1());
   }
   test();
   test();
   %OptimizeFunctionOnNextCall(test);
   test();
 })();