Fix a test in the IA32 code generator for whether loop conditions...

src/codegen-ia32.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 2213 matching lines @@
           node->break_target()->Bind();
         }
       }
       break;
     }
 
     case LoopStatement::WHILE_LOOP: {
       // Do not duplicate conditions with function literal
       // subexpressions.  This can cause us to compile the function
       // literal twice.
-      bool test_at_bottom = !node->has_function_literal();
+      bool test_at_bottom =
+          !scope_->is_global_scope() && !node->has_function_literal();
 
       IncrementLoopNesting();
 
       // If the condition is always false and has no side effects, we
       // do not need to compile anything.
       if (info == ALWAYS_FALSE) break;
 
       JumpTarget body;
       if (test_at_bottom) {
         body.Initialize(this, JumpTarget::BIDIRECTIONAL);
@@ skipping 77 matching lines @@
       if (node->break_target()->is_linked()) {
         node->break_target()->Bind();
       }
       break;
     }
 
     case LoopStatement::FOR_LOOP: {
       // Do not duplicate conditions with function literal
       // subexpressions.  This can cause us to compile the function
       // literal twice.
-      bool test_at_bottom = !node->has_function_literal();
+      bool test_at_bottom =
+          !scope_->is_global_scope() && !node->has_function_literal();
 
       // Compile the init expression if present.
       if (node->init() != NULL) {
         Visit(node->init());
       }
 
       IncrementLoopNesting();
 
       // If the condition is always false and has no side effects, we
       // do not need to compile anything else.
@@ skipping 4607 matching lines @@
 
   // Slow-case: Go through the JavaScript implementation.
   __ bind(&slow);
   __ InvokeBuiltin(Builtins::INSTANCE_OF, JUMP_FUNCTION);
 }
 
 
 #undef __
 
 } }  // namespace v8::internal