Reenable the duplicated test at the bottom of for and while loops. It...

src/rewriter.cc

 // Copyright 2006-2008 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 24 matching lines @@
 
 
 class AstOptimizer: public AstVisitor {
  public:
   explicit AstOptimizer() {
   }
 
   void Optimize(ZoneList<Statement*>* statements);
 
  private:
+  // Used for loop condition analysis.  Cleared before visiting a loop
+  // condition, set when a function literal is visited.
+  bool has_function_literal_;
+
   // Helpers
   void OptimizeArguments(ZoneList<Expression*>* arguments);
 
   // Node visitors.
 #define DEF_VISIT(type) \
   virtual void Visit##type(type* node);
   NODE_LIST(DEF_VISIT)
 #undef DEF_VISIT
 
   DISALLOW_COPY_AND_ASSIGN(AstOptimizer);
@@ skipping 27 matching lines @@
 
 void AstOptimizer::VisitIfStatement(IfStatement* node) {
   Visit(node->condition());
   Visit(node->then_statement());
   if (node->HasElseStatement()) {
     Visit(node->else_statement());
   }
 }
 
 
-
-
 void AstOptimizer::VisitLoopStatement(LoopStatement* node) {
   if (node->init() != NULL) {
     Visit(node->init());
   }
   if (node->cond() != NULL) {
+    has_function_literal_ = false;
     Visit(node->cond());
+    node->has_function_literal_ = has_function_literal_;
   }
   if (node->body() != NULL) {
     Visit(node->body());
   }
   if (node->next() != NULL) {
     Visit(node->next());
   }
 }
 
 
@@ skipping 65 matching lines @@
 }
 
 
 void AstOptimizer::VisitDebuggerStatement(DebuggerStatement* node) {
   USE(node);
 }
 
 
 void AstOptimizer::VisitFunctionLiteral(FunctionLiteral* node) {
   USE(node);
+  has_function_literal_ = true;
 }
 
 
 void AstOptimizer::VisitFunctionBoilerplateLiteral(
     FunctionBoilerplateLiteral* node) {
   USE(node);
 }
 
 
 void AstOptimizer::VisitConditional(Conditional* node) {
@@ skipping 601 matching lines @@
       if (optimizer.HasStackOverflow()) {
         return false;
       }
     }
   }
   return true;
 }
 
 
 } }  // namespace v8::internal