Fix a problem with const initialization in the top-level code generator....

src/fast-codegen.cc

 // Copyright 2009 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 270 matching lines @@
 
 
 void FastCodeGenerator::VisitEmptyStatement(EmptyStatement* stmt) {
   Comment cmnt(masm_, "[ EmptyStatement");
   SetStatementPosition(stmt);
 }
 
 
 void FastCodeGenerator::VisitIfStatement(IfStatement* stmt) {
   Comment cmnt(masm_, "[ IfStatement");
+  SetStatementPosition(stmt);
   // Expressions cannot recursively enter statements, there are no labels in
   // the state.
   ASSERT_EQ(NULL, true_label_);
   ASSERT_EQ(NULL, false_label_);
   Label then_part, else_part, done;
 
   // Do not worry about optimizing for empty then or else bodies.
   true_label_ = &then_part;
   false_label_ = &else_part;
   ASSERT(stmt->condition()->context() == Expression::kTest);
   Visit(stmt->condition());
   true_label_ = NULL;
   false_label_ = NULL;
 
   __ bind(&then_part);
   Visit(stmt->then_statement());
   __ jmp(&done);
 
   __ bind(&else_part);
   Visit(stmt->else_statement());
 
   __ bind(&done);
 }
 
 
 void FastCodeGenerator::VisitContinueStatement(ContinueStatement* stmt) {
   Comment cmnt(masm_,  "[ ContinueStatement");
+  SetStatementPosition(stmt);
   NestedStatement* current = nesting_stack_;
   int stack_depth = 0;
   while (!current->IsContinueTarget(stmt->target())) {
     stack_depth = current->Exit(stack_depth);
     current = current->outer();
   }
   __ Drop(stack_depth);
 
   Iteration* loop = current->AsIteration();
   __ jmp(loop->continue_target());
 }
 
 
 void FastCodeGenerator::VisitBreakStatement(BreakStatement* stmt) {
   Comment cmnt(masm_,  "[ BreakStatement");
+  SetStatementPosition(stmt);
   NestedStatement* current = nesting_stack_;
   int stack_depth = 0;
   while (!current->IsBreakTarget(stmt->target())) {
     stack_depth = current->Exit(stack_depth);
     current = current->outer();
   }
   __ Drop(stack_depth);
 
   Breakable* target = current->AsBreakable();
   __ jmp(target->break_target());
 }
 
 
 void FastCodeGenerator::VisitReturnStatement(ReturnStatement* stmt) {
   Comment cmnt(masm_, "[ ReturnStatement");
+  SetStatementPosition(stmt);
   Expression* expr = stmt->expression();
   // Complete the statement based on the type of the subexpression.
   if (expr->AsLiteral() != NULL) {
     __ Move(result_register(), expr->AsLiteral()->handle());
   } else {
     ASSERT_EQ(Expression::kValue, expr->context());
     Visit(expr);
     __ pop(result_register());
   }
 
@@ skipping 41 matching lines @@
 }
 
 
 void FastCodeGenerator::VisitSwitchStatement(SwitchStatement* stmt) {
   UNREACHABLE();
 }
 
 
 void FastCodeGenerator::VisitDoWhileStatement(DoWhileStatement* stmt) {
   Comment cmnt(masm_, "[ DoWhileStatement");
+  SetStatementPosition(stmt);
   Label body, stack_limit_hit, stack_check_success;
 
   Iteration loop_statement(this, stmt);
   increment_loop_depth();
 
   __ bind(&body);
   Visit(stmt->body());
 
   // Check stack before looping.
   __ StackLimitCheck(&stack_limit_hit);
@@ skipping 17 matching lines @@
   __ jmp(&stack_check_success);
 
   __ bind(loop_statement.break_target());
 
   decrement_loop_depth();
 }
 
 
 void FastCodeGenerator::VisitWhileStatement(WhileStatement* stmt) {
   Comment cmnt(masm_, "[ WhileStatement");
+  SetStatementPosition(stmt);
   Label body, stack_limit_hit, stack_check_success;
 
   Iteration loop_statement(this, stmt);
   increment_loop_depth();
 
   // Emit the test at the bottom of the loop.
   __ jmp(loop_statement.continue_target());
 
   __ bind(&body);
   Visit(stmt->body());
@@ skipping 326 matching lines @@
   __ Drop(stack_depth);
   __ PopTryHandler();
   return 0;
 }
 
 
 #undef __
 
 
 } }  // namespace v8::internal