[es6] implement spread calls

src/compiler/ast-loop-assignment-analyzer.cc

Index: src/compiler/ast-loop-assignment-analyzer.cc
diff --git a/src/compiler/ast-loop-assignment-analyzer.cc b/src/compiler/ast-loop-assignment-analyzer.cc
index 4028b9412ba8e3647e02a8326ae531847057849e..a20f13f529d2f67f89c6d374813c23eb54c904f9 100644
--- a/src/compiler/ast-loop-assignment-analyzer.cc
+++ b/src/compiler/ast-loop-assignment-analyzer.cc
@@ -195,6 +195,9 @@ void ALAA::VisitCompareOperation(CompareOperation* e) {
 }
 
 
+void ALAA::VisitSpread(Spread* e) { Visit(e->expression()); }

[Michael Starzinger, 2015/04/08 18:48:26]

nit: Should be UNREACHABLE as well, correct?

[arv (Not doing code reviews), 2015/04/08 18:58:59]

I don't think so. The spread expression can be anything.

[caitp (gmail), 2015/04/08 19:02:54]

Spread* nodes get completely removed from the graph, so it could just as well be
UNREACHABLE. I don't think it matters much though, since it will hit the other
ones if this line is reached

+
+
 void ALAA::VisitCaseClause(CaseClause* cc) {
   if (!cc->is_default()) Visit(cc->label());
   VisitStatements(cc->statements());