From d3880a19bc544473a6727bcb7018f57d34e79f5f Mon Sep 17 00:00:00 2001 From: "whesse@chromium.org" Date: Mon, 22 Aug 2011 09:00:27 +0000 Subject: [PATCH] MIPS: port Clean up the nesting stack in the full code generator. Port 8972 (6a896b3) Original commit message: Remove unused methods, introduce named constants, and attempt to add some sanity to naming. BUG= TEST= Review URL: http://codereview.chromium.org/7693021 git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@8976 ce2b1a6d-e550-0410-aec6-3dcde31c8c00 --- src/mips/full-codegen-mips.cc | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/src/mips/full-codegen-mips.cc b/src/mips/full-codegen-mips.cc index d8909c9ddd..a267f0f5b8 100644 --- a/src/mips/full-codegen-mips.cc +++ b/src/mips/full-codegen-mips.cc @@ -886,7 +886,7 @@ void FullCodeGenerator::VisitSwitchStatement(SwitchStatement* stmt) { __ bind(&next_test); __ Drop(1); // Switch value is no longer needed. if (default_clause == NULL) { - __ Branch(nested_statement.break_target()); + __ Branch(nested_statement.break_label()); } else { __ Branch(default_clause->body_target()); } @@ -900,7 +900,7 @@ void FullCodeGenerator::VisitSwitchStatement(SwitchStatement* stmt) { VisitStatements(clause->statements()); } - __ bind(nested_statement.break_target()); + __ bind(nested_statement.break_label()); PrepareForBailoutForId(stmt->ExitId(), NO_REGISTERS); } @@ -1026,7 +1026,7 @@ void FullCodeGenerator::VisitForInStatement(ForInStatement* stmt) { // Load the current count to a0, load the length to a1. __ lw(a0, MemOperand(sp, 0 * kPointerSize)); __ lw(a1, MemOperand(sp, 1 * kPointerSize)); - __ Branch(loop_statement.break_target(), hs, a0, Operand(a1)); + __ Branch(loop_statement.break_label(), hs, a0, Operand(a1)); // Get the current entry of the array into register a3. __ lw(a2, MemOperand(sp, 2 * kPointerSize)); @@ -1053,7 +1053,7 @@ void FullCodeGenerator::VisitForInStatement(ForInStatement* stmt) { __ push(a3); // Current entry. __ InvokeBuiltin(Builtins::FILTER_KEY, CALL_FUNCTION); __ mov(a3, result_register()); - __ Branch(loop_statement.continue_target(), eq, a3, Operand(zero_reg)); + __ Branch(loop_statement.continue_label(), eq, a3, Operand(zero_reg)); // Update the 'each' property or variable from the possibly filtered // entry in register a3. @@ -1069,7 +1069,7 @@ void FullCodeGenerator::VisitForInStatement(ForInStatement* stmt) { // Generate code for the going to the next element by incrementing // the index (smi) stored on top of the stack. - __ bind(loop_statement.continue_target()); + __ bind(loop_statement.continue_label()); __ pop(a0); __ Addu(a0, a0, Operand(Smi::FromInt(1))); __ push(a0); @@ -1078,7 +1078,7 @@ void FullCodeGenerator::VisitForInStatement(ForInStatement* stmt) { __ Branch(&loop); // Remove the pointers stored on the stack. - __ bind(loop_statement.break_target()); + __ bind(loop_statement.break_label()); __ Drop(5); // Exit and decrement the loop depth.