full-codegen.cc revision 85b71799222b55eb5dd74ea26efe0c64ab655c8c
1// Copyright 2011 the V8 project authors. All rights reserved. 2// Redistribution and use in source and binary forms, with or without 3// modification, are permitted provided that the following conditions are 4// met: 5// 6// * Redistributions of source code must retain the above copyright 7// notice, this list of conditions and the following disclaimer. 8// * Redistributions in binary form must reproduce the above 9// copyright notice, this list of conditions and the following 10// disclaimer in the documentation and/or other materials provided 11// with the distribution. 12// * Neither the name of Google Inc. nor the names of its 13// contributors may be used to endorse or promote products derived 14// from this software without specific prior written permission. 15// 16// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 17// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 18// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 19// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 20// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 21// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 22// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 26// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27 28#include "v8.h" 29 30#include "codegen.h" 31#include "compiler.h" 32#include "debug.h" 33#include "full-codegen.h" 34#include "liveedit.h" 35#include "macro-assembler.h" 36#include "prettyprinter.h" 37#include "scopes.h" 38#include "scopeinfo.h" 39#include "stub-cache.h" 40 41namespace v8 { 42namespace internal { 43 44void BreakableStatementChecker::Check(Statement* stmt) { 45 Visit(stmt); 46} 47 48 49void BreakableStatementChecker::Check(Expression* expr) { 50 Visit(expr); 51} 52 53 54void BreakableStatementChecker::VisitDeclaration(Declaration* decl) { 55} 56 57 58void BreakableStatementChecker::VisitBlock(Block* stmt) { 59} 60 61 62void BreakableStatementChecker::VisitExpressionStatement( 63 ExpressionStatement* stmt) { 64 // Check if expression is breakable. 65 Visit(stmt->expression()); 66} 67 68 69void BreakableStatementChecker::VisitEmptyStatement(EmptyStatement* stmt) { 70} 71 72 73void BreakableStatementChecker::VisitIfStatement(IfStatement* stmt) { 74 // If the condition is breakable the if statement is breakable. 75 Visit(stmt->condition()); 76} 77 78 79void BreakableStatementChecker::VisitContinueStatement( 80 ContinueStatement* stmt) { 81} 82 83 84void BreakableStatementChecker::VisitBreakStatement(BreakStatement* stmt) { 85} 86 87 88void BreakableStatementChecker::VisitReturnStatement(ReturnStatement* stmt) { 89 // Return is breakable if the expression is. 90 Visit(stmt->expression()); 91} 92 93 94void BreakableStatementChecker::VisitWithStatement(WithStatement* stmt) { 95 Visit(stmt->expression()); 96} 97 98 99void BreakableStatementChecker::VisitSwitchStatement(SwitchStatement* stmt) { 100 // Switch statements breakable if the tag expression is. 101 Visit(stmt->tag()); 102} 103 104 105void BreakableStatementChecker::VisitDoWhileStatement(DoWhileStatement* stmt) { 106 // Mark do while as breakable to avoid adding a break slot in front of it. 107 is_breakable_ = true; 108} 109 110 111void BreakableStatementChecker::VisitWhileStatement(WhileStatement* stmt) { 112 // Mark while statements breakable if the condition expression is. 113 Visit(stmt->cond()); 114} 115 116 117void BreakableStatementChecker::VisitForStatement(ForStatement* stmt) { 118 // Mark for statements breakable if the condition expression is. 119 if (stmt->cond() != NULL) { 120 Visit(stmt->cond()); 121 } 122} 123 124 125void BreakableStatementChecker::VisitForInStatement(ForInStatement* stmt) { 126 // Mark for in statements breakable if the enumerable expression is. 127 Visit(stmt->enumerable()); 128} 129 130 131void BreakableStatementChecker::VisitTryCatchStatement( 132 TryCatchStatement* stmt) { 133 // Mark try catch as breakable to avoid adding a break slot in front of it. 134 is_breakable_ = true; 135} 136 137 138void BreakableStatementChecker::VisitTryFinallyStatement( 139 TryFinallyStatement* stmt) { 140 // Mark try finally as breakable to avoid adding a break slot in front of it. 141 is_breakable_ = true; 142} 143 144 145void BreakableStatementChecker::VisitDebuggerStatement( 146 DebuggerStatement* stmt) { 147 // The debugger statement is breakable. 148 is_breakable_ = true; 149} 150 151 152void BreakableStatementChecker::VisitFunctionLiteral(FunctionLiteral* expr) { 153} 154 155 156void BreakableStatementChecker::VisitSharedFunctionInfoLiteral( 157 SharedFunctionInfoLiteral* expr) { 158} 159 160 161void BreakableStatementChecker::VisitConditional(Conditional* expr) { 162} 163 164 165void BreakableStatementChecker::VisitVariableProxy(VariableProxy* expr) { 166} 167 168 169void BreakableStatementChecker::VisitLiteral(Literal* expr) { 170} 171 172 173void BreakableStatementChecker::VisitRegExpLiteral(RegExpLiteral* expr) { 174} 175 176 177void BreakableStatementChecker::VisitObjectLiteral(ObjectLiteral* expr) { 178} 179 180 181void BreakableStatementChecker::VisitArrayLiteral(ArrayLiteral* expr) { 182} 183 184 185void BreakableStatementChecker::VisitAssignment(Assignment* expr) { 186 // If assigning to a property (including a global property) the assignment is 187 // breakable. 188 VariableProxy* proxy = expr->target()->AsVariableProxy(); 189 Property* prop = expr->target()->AsProperty(); 190 if (prop != NULL || (proxy != NULL && proxy->var()->IsUnallocated())) { 191 is_breakable_ = true; 192 return; 193 } 194 195 // Otherwise the assignment is breakable if the assigned value is. 196 Visit(expr->value()); 197} 198 199 200void BreakableStatementChecker::VisitThrow(Throw* expr) { 201 // Throw is breakable if the expression is. 202 Visit(expr->exception()); 203} 204 205 206void BreakableStatementChecker::VisitProperty(Property* expr) { 207 // Property load is breakable. 208 is_breakable_ = true; 209} 210 211 212void BreakableStatementChecker::VisitCall(Call* expr) { 213 // Function calls both through IC and call stub are breakable. 214 is_breakable_ = true; 215} 216 217 218void BreakableStatementChecker::VisitCallNew(CallNew* expr) { 219 // Function calls through new are breakable. 220 is_breakable_ = true; 221} 222 223 224void BreakableStatementChecker::VisitCallRuntime(CallRuntime* expr) { 225} 226 227 228void BreakableStatementChecker::VisitUnaryOperation(UnaryOperation* expr) { 229 Visit(expr->expression()); 230} 231 232 233void BreakableStatementChecker::VisitCountOperation(CountOperation* expr) { 234 Visit(expr->expression()); 235} 236 237 238void BreakableStatementChecker::VisitBinaryOperation(BinaryOperation* expr) { 239 Visit(expr->left()); 240 if (expr->op() != Token::AND && 241 expr->op() != Token::OR) { 242 Visit(expr->right()); 243 } 244} 245 246 247void BreakableStatementChecker::VisitCompareToNull(CompareToNull* expr) { 248 Visit(expr->expression()); 249} 250 251 252void BreakableStatementChecker::VisitCompareOperation(CompareOperation* expr) { 253 Visit(expr->left()); 254 Visit(expr->right()); 255} 256 257 258void BreakableStatementChecker::VisitThisFunction(ThisFunction* expr) { 259} 260 261 262#define __ ACCESS_MASM(masm()) 263 264bool FullCodeGenerator::MakeCode(CompilationInfo* info) { 265 Isolate* isolate = info->isolate(); 266 Handle<Script> script = info->script(); 267 if (!script->IsUndefined() && !script->source()->IsUndefined()) { 268 int len = String::cast(script->source())->length(); 269 isolate->counters()->total_full_codegen_source_size()->Increment(len); 270 } 271 if (FLAG_trace_codegen) { 272 PrintF("Full Compiler - "); 273 } 274 CodeGenerator::MakeCodePrologue(info); 275 const int kInitialBufferSize = 4 * KB; 276 MacroAssembler masm(info->isolate(), NULL, kInitialBufferSize); 277#ifdef ENABLE_GDB_JIT_INTERFACE 278 masm.positions_recorder()->StartGDBJITLineInfoRecording(); 279#endif 280 281 FullCodeGenerator cgen(&masm); 282 cgen.Generate(info); 283 if (cgen.HasStackOverflow()) { 284 ASSERT(!isolate->has_pending_exception()); 285 return false; 286 } 287 unsigned table_offset = cgen.EmitStackCheckTable(); 288 289 Code::Flags flags = Code::ComputeFlags(Code::FUNCTION); 290 Handle<Code> code = CodeGenerator::MakeCodeEpilogue(&masm, flags, info); 291 code->set_optimizable(info->IsOptimizable()); 292 cgen.PopulateDeoptimizationData(code); 293 code->set_has_deoptimization_support(info->HasDeoptimizationSupport()); 294 code->set_has_debug_break_slots( 295 info->isolate()->debugger()->IsDebuggerActive()); 296 code->set_allow_osr_at_loop_nesting_level(0); 297 code->set_stack_check_table_offset(table_offset); 298 CodeGenerator::PrintCode(code, info); 299 info->SetCode(code); // may be an empty handle. 300#ifdef ENABLE_GDB_JIT_INTERFACE 301 if (FLAG_gdbjit && !code.is_null()) { 302 GDBJITLineInfo* lineinfo = 303 masm.positions_recorder()->DetachGDBJITLineInfo(); 304 305 GDBJIT(RegisterDetailedLineInfo(*code, lineinfo)); 306 } 307#endif 308 return !code.is_null(); 309} 310 311 312unsigned FullCodeGenerator::EmitStackCheckTable() { 313 // The stack check table consists of a length (in number of entries) 314 // field, and then a sequence of entries. Each entry is a pair of AST id 315 // and code-relative pc offset. 316 masm()->Align(kIntSize); 317 unsigned offset = masm()->pc_offset(); 318 unsigned length = stack_checks_.length(); 319 __ dd(length); 320 for (unsigned i = 0; i < length; ++i) { 321 __ dd(stack_checks_[i].id); 322 __ dd(stack_checks_[i].pc_and_state); 323 } 324 return offset; 325} 326 327 328void FullCodeGenerator::PopulateDeoptimizationData(Handle<Code> code) { 329 // Fill in the deoptimization information. 330 ASSERT(info_->HasDeoptimizationSupport() || bailout_entries_.is_empty()); 331 if (!info_->HasDeoptimizationSupport()) return; 332 int length = bailout_entries_.length(); 333 Handle<DeoptimizationOutputData> data = 334 isolate()->factory()-> 335 NewDeoptimizationOutputData(length, TENURED); 336 for (int i = 0; i < length; i++) { 337 data->SetAstId(i, Smi::FromInt(bailout_entries_[i].id)); 338 data->SetPcAndState(i, Smi::FromInt(bailout_entries_[i].pc_and_state)); 339 } 340 code->set_deoptimization_data(*data); 341} 342 343 344void FullCodeGenerator::PrepareForBailout(Expression* node, State state) { 345 PrepareForBailoutForId(node->id(), state); 346} 347 348 349void FullCodeGenerator::RecordJSReturnSite(Call* call) { 350 // We record the offset of the function return so we can rebuild the frame 351 // if the function was inlined, i.e., this is the return address in the 352 // inlined function's frame. 353 // 354 // The state is ignored. We defensively set it to TOS_REG, which is the 355 // real state of the unoptimized code at the return site. 356 PrepareForBailoutForId(call->ReturnId(), TOS_REG); 357#ifdef DEBUG 358 // In debug builds, mark the return so we can verify that this function 359 // was called. 360 ASSERT(!call->return_is_recorded_); 361 call->return_is_recorded_ = true; 362#endif 363} 364 365 366void FullCodeGenerator::PrepareForBailoutForId(int id, State state) { 367 // There's no need to prepare this code for bailouts from already optimized 368 // code or code that can't be optimized. 369 if (!FLAG_deopt || !info_->HasDeoptimizationSupport()) return; 370 unsigned pc_and_state = 371 StateField::encode(state) | PcField::encode(masm_->pc_offset()); 372 BailoutEntry entry = { id, pc_and_state }; 373#ifdef DEBUG 374 // Assert that we don't have multiple bailout entries for the same node. 375 for (int i = 0; i < bailout_entries_.length(); i++) { 376 if (bailout_entries_.at(i).id == entry.id) { 377 AstPrinter printer; 378 PrintF("%s", printer.PrintProgram(info_->function())); 379 UNREACHABLE(); 380 } 381 } 382#endif // DEBUG 383 bailout_entries_.Add(entry); 384} 385 386 387void FullCodeGenerator::RecordStackCheck(int ast_id) { 388 // The pc offset does not need to be encoded and packed together with a 389 // state. 390 BailoutEntry entry = { ast_id, masm_->pc_offset() }; 391 stack_checks_.Add(entry); 392} 393 394 395bool FullCodeGenerator::ShouldInlineSmiCase(Token::Value op) { 396 // Inline smi case inside loops, but not division and modulo which 397 // are too complicated and take up too much space. 398 if (op == Token::DIV ||op == Token::MOD) return false; 399 if (FLAG_always_inline_smi_code) return true; 400 return loop_depth_ > 0; 401} 402 403 404void FullCodeGenerator::EffectContext::Plug(Register reg) const { 405} 406 407 408void FullCodeGenerator::AccumulatorValueContext::Plug(Register reg) const { 409 __ Move(result_register(), reg); 410} 411 412 413void FullCodeGenerator::StackValueContext::Plug(Register reg) const { 414 __ push(reg); 415 codegen()->increment_stack_height(); 416} 417 418 419void FullCodeGenerator::TestContext::Plug(Register reg) const { 420 // For simplicity we always test the accumulator register. 421 __ Move(result_register(), reg); 422 codegen()->PrepareForBailoutBeforeSplit(TOS_REG, false, NULL, NULL); 423 codegen()->DoTest(this); 424} 425 426 427void FullCodeGenerator::EffectContext::PlugTOS() const { 428 __ Drop(1); 429 codegen()->decrement_stack_height(); 430} 431 432 433void FullCodeGenerator::AccumulatorValueContext::PlugTOS() const { 434 __ pop(result_register()); 435 codegen()->decrement_stack_height(); 436} 437 438 439void FullCodeGenerator::StackValueContext::PlugTOS() const { 440} 441 442 443void FullCodeGenerator::TestContext::PlugTOS() const { 444 // For simplicity we always test the accumulator register. 445 __ pop(result_register()); 446 codegen()->decrement_stack_height(); 447 codegen()->PrepareForBailoutBeforeSplit(TOS_REG, false, NULL, NULL); 448 codegen()->DoTest(this); 449} 450 451 452void FullCodeGenerator::EffectContext::PrepareTest( 453 Label* materialize_true, 454 Label* materialize_false, 455 Label** if_true, 456 Label** if_false, 457 Label** fall_through) const { 458 // In an effect context, the true and the false case branch to the 459 // same label. 460 *if_true = *if_false = *fall_through = materialize_true; 461} 462 463 464void FullCodeGenerator::AccumulatorValueContext::PrepareTest( 465 Label* materialize_true, 466 Label* materialize_false, 467 Label** if_true, 468 Label** if_false, 469 Label** fall_through) const { 470 *if_true = *fall_through = materialize_true; 471 *if_false = materialize_false; 472} 473 474 475void FullCodeGenerator::StackValueContext::PrepareTest( 476 Label* materialize_true, 477 Label* materialize_false, 478 Label** if_true, 479 Label** if_false, 480 Label** fall_through) const { 481 *if_true = *fall_through = materialize_true; 482 *if_false = materialize_false; 483} 484 485 486void FullCodeGenerator::TestContext::PrepareTest( 487 Label* materialize_true, 488 Label* materialize_false, 489 Label** if_true, 490 Label** if_false, 491 Label** fall_through) const { 492 *if_true = true_label_; 493 *if_false = false_label_; 494 *fall_through = fall_through_; 495} 496 497 498void FullCodeGenerator::DoTest(const TestContext* context) { 499 DoTest(context->condition(), 500 context->true_label(), 501 context->false_label(), 502 context->fall_through()); 503} 504 505 506void FullCodeGenerator::VisitDeclarations( 507 ZoneList<Declaration*>* declarations) { 508 int length = declarations->length(); 509 int global_count = 0; 510 for (int i = 0; i < length; i++) { 511 Declaration* decl = declarations->at(i); 512 EmitDeclaration(decl->proxy(), decl->mode(), decl->fun(), &global_count); 513 } 514 515 // Batch declare global functions and variables. 516 if (global_count > 0) { 517 Handle<FixedArray> array = 518 isolate()->factory()->NewFixedArray(2 * global_count, TENURED); 519 for (int j = 0, i = 0; i < length; i++) { 520 Declaration* decl = declarations->at(i); 521 Variable* var = decl->proxy()->var(); 522 523 if (var->IsUnallocated()) { 524 array->set(j++, *(var->name())); 525 if (decl->fun() == NULL) { 526 if (var->mode() == Variable::CONST) { 527 // In case this is const property use the hole. 528 array->set_the_hole(j++); 529 } else { 530 array->set_undefined(j++); 531 } 532 } else { 533 Handle<SharedFunctionInfo> function = 534 Compiler::BuildFunctionInfo(decl->fun(), script()); 535 // Check for stack-overflow exception. 536 if (function.is_null()) { 537 SetStackOverflow(); 538 return; 539 } 540 array->set(j++, *function); 541 } 542 } 543 } 544 // Invoke the platform-dependent code generator to do the actual 545 // declaration the global functions and variables. 546 DeclareGlobals(array); 547 } 548} 549 550 551int FullCodeGenerator::DeclareGlobalsFlags() { 552 int flags = 0; 553 if (is_eval()) flags |= kDeclareGlobalsEvalFlag; 554 if (is_strict_mode()) flags |= kDeclareGlobalsStrictModeFlag; 555 if (is_native()) flags |= kDeclareGlobalsNativeFlag; 556 return flags; 557} 558 559 560void FullCodeGenerator::SetFunctionPosition(FunctionLiteral* fun) { 561 CodeGenerator::RecordPositions(masm_, fun->start_position()); 562} 563 564 565void FullCodeGenerator::SetReturnPosition(FunctionLiteral* fun) { 566 CodeGenerator::RecordPositions(masm_, fun->end_position() - 1); 567} 568 569 570void FullCodeGenerator::SetStatementPosition(Statement* stmt) { 571#ifdef ENABLE_DEBUGGER_SUPPORT 572 if (!isolate()->debugger()->IsDebuggerActive()) { 573 CodeGenerator::RecordPositions(masm_, stmt->statement_pos()); 574 } else { 575 // Check if the statement will be breakable without adding a debug break 576 // slot. 577 BreakableStatementChecker checker; 578 checker.Check(stmt); 579 // Record the statement position right here if the statement is not 580 // breakable. For breakable statements the actual recording of the 581 // position will be postponed to the breakable code (typically an IC). 582 bool position_recorded = CodeGenerator::RecordPositions( 583 masm_, stmt->statement_pos(), !checker.is_breakable()); 584 // If the position recording did record a new position generate a debug 585 // break slot to make the statement breakable. 586 if (position_recorded) { 587 Debug::GenerateSlot(masm_); 588 } 589 } 590#else 591 CodeGenerator::RecordPositions(masm_, stmt->statement_pos()); 592#endif 593} 594 595 596void FullCodeGenerator::SetExpressionPosition(Expression* expr, int pos) { 597#ifdef ENABLE_DEBUGGER_SUPPORT 598 if (!isolate()->debugger()->IsDebuggerActive()) { 599 CodeGenerator::RecordPositions(masm_, pos); 600 } else { 601 // Check if the expression will be breakable without adding a debug break 602 // slot. 603 BreakableStatementChecker checker; 604 checker.Check(expr); 605 // Record a statement position right here if the expression is not 606 // breakable. For breakable expressions the actual recording of the 607 // position will be postponed to the breakable code (typically an IC). 608 // NOTE this will record a statement position for something which might 609 // not be a statement. As stepping in the debugger will only stop at 610 // statement positions this is used for e.g. the condition expression of 611 // a do while loop. 612 bool position_recorded = CodeGenerator::RecordPositions( 613 masm_, pos, !checker.is_breakable()); 614 // If the position recording did record a new position generate a debug 615 // break slot to make the statement breakable. 616 if (position_recorded) { 617 Debug::GenerateSlot(masm_); 618 } 619 } 620#else 621 CodeGenerator::RecordPositions(masm_, pos); 622#endif 623} 624 625 626void FullCodeGenerator::SetStatementPosition(int pos) { 627 CodeGenerator::RecordPositions(masm_, pos); 628} 629 630 631void FullCodeGenerator::SetSourcePosition(int pos) { 632 if (pos != RelocInfo::kNoPosition) { 633 masm_->positions_recorder()->RecordPosition(pos); 634 } 635} 636 637 638// Lookup table for code generators for special runtime calls which are 639// generated inline. 640#define INLINE_FUNCTION_GENERATOR_ADDRESS(Name, argc, ressize) \ 641 &FullCodeGenerator::Emit##Name, 642 643const FullCodeGenerator::InlineFunctionGenerator 644 FullCodeGenerator::kInlineFunctionGenerators[] = { 645 INLINE_FUNCTION_LIST(INLINE_FUNCTION_GENERATOR_ADDRESS) 646 INLINE_RUNTIME_FUNCTION_LIST(INLINE_FUNCTION_GENERATOR_ADDRESS) 647 }; 648#undef INLINE_FUNCTION_GENERATOR_ADDRESS 649 650 651FullCodeGenerator::InlineFunctionGenerator 652 FullCodeGenerator::FindInlineFunctionGenerator(Runtime::FunctionId id) { 653 int lookup_index = 654 static_cast<int>(id) - static_cast<int>(Runtime::kFirstInlineFunction); 655 ASSERT(lookup_index >= 0); 656 ASSERT(static_cast<size_t>(lookup_index) < 657 ARRAY_SIZE(kInlineFunctionGenerators)); 658 return kInlineFunctionGenerators[lookup_index]; 659} 660 661 662void FullCodeGenerator::EmitInlineRuntimeCall(CallRuntime* node) { 663 ZoneList<Expression*>* args = node->arguments(); 664 const Runtime::Function* function = node->function(); 665 ASSERT(function != NULL); 666 ASSERT(function->intrinsic_type == Runtime::INLINE); 667 InlineFunctionGenerator generator = 668 FindInlineFunctionGenerator(function->function_id); 669 ((*this).*(generator))(args); 670} 671 672 673void FullCodeGenerator::VisitBinaryOperation(BinaryOperation* expr) { 674 switch (expr->op()) { 675 case Token::COMMA: 676 return VisitComma(expr); 677 case Token::OR: 678 case Token::AND: 679 return VisitLogicalExpression(expr); 680 default: 681 return VisitArithmeticExpression(expr); 682 } 683} 684 685 686void FullCodeGenerator::VisitComma(BinaryOperation* expr) { 687 Comment cmnt(masm_, "[ Comma"); 688 VisitForEffect(expr->left()); 689 if (context()->IsTest()) ForwardBailoutToChild(expr); 690 VisitInCurrentContext(expr->right()); 691} 692 693 694void FullCodeGenerator::VisitLogicalExpression(BinaryOperation* expr) { 695 bool is_logical_and = expr->op() == Token::AND; 696 Comment cmnt(masm_, is_logical_and ? "[ Logical AND" : "[ Logical OR"); 697 Expression* left = expr->left(); 698 Expression* right = expr->right(); 699 int right_id = expr->RightId(); 700 Label done; 701 702 if (context()->IsTest()) { 703 Label eval_right; 704 const TestContext* test = TestContext::cast(context()); 705 if (is_logical_and) { 706 VisitForControl(left, &eval_right, test->false_label(), &eval_right); 707 } else { 708 VisitForControl(left, test->true_label(), &eval_right, &eval_right); 709 } 710 PrepareForBailoutForId(right_id, NO_REGISTERS); 711 __ bind(&eval_right); 712 ForwardBailoutToChild(expr); 713 714 } else if (context()->IsAccumulatorValue()) { 715 VisitForAccumulatorValue(left); 716 // We want the value in the accumulator for the test, and on the stack in 717 // case we need it. 718 __ push(result_register()); 719 Label discard, restore; 720 PrepareForBailoutBeforeSplit(TOS_REG, false, NULL, NULL); 721 if (is_logical_and) { 722 DoTest(left, &discard, &restore, &restore); 723 } else { 724 DoTest(left, &restore, &discard, &restore); 725 } 726 __ bind(&restore); 727 __ pop(result_register()); 728 __ jmp(&done); 729 __ bind(&discard); 730 __ Drop(1); 731 PrepareForBailoutForId(right_id, NO_REGISTERS); 732 733 } else if (context()->IsStackValue()) { 734 VisitForAccumulatorValue(left); 735 // We want the value in the accumulator for the test, and on the stack in 736 // case we need it. 737 __ push(result_register()); 738 Label discard; 739 PrepareForBailoutBeforeSplit(TOS_REG, false, NULL, NULL); 740 if (is_logical_and) { 741 DoTest(left, &discard, &done, &discard); 742 } else { 743 DoTest(left, &done, &discard, &discard); 744 } 745 __ bind(&discard); 746 __ Drop(1); 747 PrepareForBailoutForId(right_id, NO_REGISTERS); 748 749 } else { 750 ASSERT(context()->IsEffect()); 751 Label eval_right; 752 if (is_logical_and) { 753 VisitForControl(left, &eval_right, &done, &eval_right); 754 } else { 755 VisitForControl(left, &done, &eval_right, &eval_right); 756 } 757 PrepareForBailoutForId(right_id, NO_REGISTERS); 758 __ bind(&eval_right); 759 } 760 761 VisitInCurrentContext(right); 762 __ bind(&done); 763} 764 765 766void FullCodeGenerator::VisitArithmeticExpression(BinaryOperation* expr) { 767 Token::Value op = expr->op(); 768 Comment cmnt(masm_, "[ ArithmeticExpression"); 769 Expression* left = expr->left(); 770 Expression* right = expr->right(); 771 OverwriteMode mode = 772 left->ResultOverwriteAllowed() 773 ? OVERWRITE_LEFT 774 : (right->ResultOverwriteAllowed() ? OVERWRITE_RIGHT : NO_OVERWRITE); 775 776 VisitForStackValue(left); 777 VisitForAccumulatorValue(right); 778 779 SetSourcePosition(expr->position()); 780 if (ShouldInlineSmiCase(op)) { 781 EmitInlineSmiBinaryOp(expr, op, mode, left, right); 782 } else { 783 EmitBinaryOp(expr, op, mode); 784 } 785} 786 787 788void FullCodeGenerator::ForwardBailoutToChild(Expression* expr) { 789 if (!info_->HasDeoptimizationSupport()) return; 790 ASSERT(context()->IsTest()); 791 ASSERT(expr == forward_bailout_stack_->expr()); 792 forward_bailout_pending_ = forward_bailout_stack_; 793} 794 795 796void FullCodeGenerator::VisitInCurrentContext(Expression* expr) { 797 if (context()->IsTest()) { 798 ForwardBailoutStack stack(expr, forward_bailout_pending_); 799 ForwardBailoutStack* saved = forward_bailout_stack_; 800 forward_bailout_pending_ = NULL; 801 forward_bailout_stack_ = &stack; 802 Visit(expr); 803 forward_bailout_stack_ = saved; 804 } else { 805 ASSERT(forward_bailout_pending_ == NULL); 806 Visit(expr); 807 State state = context()->IsAccumulatorValue() ? TOS_REG : NO_REGISTERS; 808 PrepareForBailout(expr, state); 809 // Forwarding bailouts to children is a one shot operation. It should have 810 // been processed at this point. 811 ASSERT(forward_bailout_pending_ == NULL); 812 } 813} 814 815 816void FullCodeGenerator::VisitBlock(Block* stmt) { 817 Comment cmnt(masm_, "[ Block"); 818 NestedBlock nested_block(this, stmt); 819 SetStatementPosition(stmt); 820 821 Scope* saved_scope = scope(); 822 // Push a block context when entering a block with block scoped variables. 823 if (stmt->block_scope() != NULL) { 824 { Comment cmnt(masm_, "[ Extend block context"); 825 scope_ = stmt->block_scope(); 826 __ Push(scope_->GetSerializedScopeInfo()); 827 PushFunctionArgumentForContextAllocation(); 828 __ CallRuntime(Runtime::kPushBlockContext, 2); 829 StoreToFrameField(StandardFrameConstants::kContextOffset, 830 context_register()); 831 } 832 { Comment cmnt(masm_, "[ Declarations"); 833 VisitDeclarations(scope_->declarations()); 834 } 835 } 836 PrepareForBailoutForId(stmt->EntryId(), NO_REGISTERS); 837 VisitStatements(stmt->statements()); 838 scope_ = saved_scope; 839 __ bind(nested_block.break_label()); 840 PrepareForBailoutForId(stmt->ExitId(), NO_REGISTERS); 841 842 // Pop block context if necessary. 843 if (stmt->block_scope() != NULL) { 844 LoadContextField(context_register(), Context::PREVIOUS_INDEX); 845 // Update local stack frame context field. 846 StoreToFrameField(StandardFrameConstants::kContextOffset, 847 context_register()); 848 } 849} 850 851 852void FullCodeGenerator::VisitExpressionStatement(ExpressionStatement* stmt) { 853 Comment cmnt(masm_, "[ ExpressionStatement"); 854 SetStatementPosition(stmt); 855 VisitForEffect(stmt->expression()); 856} 857 858 859void FullCodeGenerator::VisitEmptyStatement(EmptyStatement* stmt) { 860 Comment cmnt(masm_, "[ EmptyStatement"); 861 SetStatementPosition(stmt); 862} 863 864 865void FullCodeGenerator::VisitIfStatement(IfStatement* stmt) { 866 Comment cmnt(masm_, "[ IfStatement"); 867 SetStatementPosition(stmt); 868 Label then_part, else_part, done; 869 870 if (stmt->HasElseStatement()) { 871 VisitForControl(stmt->condition(), &then_part, &else_part, &then_part); 872 PrepareForBailoutForId(stmt->ThenId(), NO_REGISTERS); 873 __ bind(&then_part); 874 Visit(stmt->then_statement()); 875 __ jmp(&done); 876 877 PrepareForBailoutForId(stmt->ElseId(), NO_REGISTERS); 878 __ bind(&else_part); 879 Visit(stmt->else_statement()); 880 } else { 881 VisitForControl(stmt->condition(), &then_part, &done, &then_part); 882 PrepareForBailoutForId(stmt->ThenId(), NO_REGISTERS); 883 __ bind(&then_part); 884 Visit(stmt->then_statement()); 885 886 PrepareForBailoutForId(stmt->ElseId(), NO_REGISTERS); 887 } 888 __ bind(&done); 889 PrepareForBailoutForId(stmt->IfId(), NO_REGISTERS); 890} 891 892 893void FullCodeGenerator::VisitContinueStatement(ContinueStatement* stmt) { 894 Comment cmnt(masm_, "[ ContinueStatement"); 895 SetStatementPosition(stmt); 896 NestedStatement* current = nesting_stack_; 897 int stack_depth = 0; 898 int context_length = 0; 899 // When continuing, we clobber the unpredictable value in the accumulator 900 // with one that's safe for GC. If we hit an exit from the try block of 901 // try...finally on our way out, we will unconditionally preserve the 902 // accumulator on the stack. 903 ClearAccumulator(); 904 while (!current->IsContinueTarget(stmt->target())) { 905 current = current->Exit(&stack_depth, &context_length); 906 } 907 __ Drop(stack_depth); 908 if (context_length > 0) { 909 while (context_length > 0) { 910 LoadContextField(context_register(), Context::PREVIOUS_INDEX); 911 --context_length; 912 } 913 StoreToFrameField(StandardFrameConstants::kContextOffset, 914 context_register()); 915 } 916 917 __ jmp(current->AsIteration()->continue_label()); 918} 919 920 921void FullCodeGenerator::VisitBreakStatement(BreakStatement* stmt) { 922 Comment cmnt(masm_, "[ BreakStatement"); 923 SetStatementPosition(stmt); 924 NestedStatement* current = nesting_stack_; 925 int stack_depth = 0; 926 int context_length = 0; 927 // When breaking, we clobber the unpredictable value in the accumulator 928 // with one that's safe for GC. If we hit an exit from the try block of 929 // try...finally on our way out, we will unconditionally preserve the 930 // accumulator on the stack. 931 ClearAccumulator(); 932 while (!current->IsBreakTarget(stmt->target())) { 933 current = current->Exit(&stack_depth, &context_length); 934 } 935 __ Drop(stack_depth); 936 if (context_length > 0) { 937 while (context_length > 0) { 938 LoadContextField(context_register(), Context::PREVIOUS_INDEX); 939 --context_length; 940 } 941 StoreToFrameField(StandardFrameConstants::kContextOffset, 942 context_register()); 943 } 944 945 __ jmp(current->AsBreakable()->break_label()); 946} 947 948 949void FullCodeGenerator::VisitReturnStatement(ReturnStatement* stmt) { 950 Comment cmnt(masm_, "[ ReturnStatement"); 951 SetStatementPosition(stmt); 952 Expression* expr = stmt->expression(); 953 VisitForAccumulatorValue(expr); 954 955 // Exit all nested statements. 956 NestedStatement* current = nesting_stack_; 957 int stack_depth = 0; 958 int context_length = 0; 959 while (current != NULL) { 960 current = current->Exit(&stack_depth, &context_length); 961 } 962 __ Drop(stack_depth); 963 964 EmitReturnSequence(); 965} 966 967 968void FullCodeGenerator::VisitWithStatement(WithStatement* stmt) { 969 Comment cmnt(masm_, "[ WithStatement"); 970 SetStatementPosition(stmt); 971 972 VisitForStackValue(stmt->expression()); 973 PushFunctionArgumentForContextAllocation(); 974 __ CallRuntime(Runtime::kPushWithContext, 2); 975 decrement_stack_height(); 976 StoreToFrameField(StandardFrameConstants::kContextOffset, context_register()); 977 978 { WithOrCatch body(this); 979 Visit(stmt->statement()); 980 } 981 982 // Pop context. 983 LoadContextField(context_register(), Context::PREVIOUS_INDEX); 984 // Update local stack frame context field. 985 StoreToFrameField(StandardFrameConstants::kContextOffset, context_register()); 986} 987 988 989void FullCodeGenerator::VisitDoWhileStatement(DoWhileStatement* stmt) { 990 Comment cmnt(masm_, "[ DoWhileStatement"); 991 SetStatementPosition(stmt); 992 Label body, stack_check; 993 994 Iteration loop_statement(this, stmt); 995 increment_loop_depth(); 996 997 __ bind(&body); 998 Visit(stmt->body()); 999 1000 // Record the position of the do while condition and make sure it is 1001 // possible to break on the condition. 1002 __ bind(loop_statement.continue_label()); 1003 PrepareForBailoutForId(stmt->ContinueId(), NO_REGISTERS); 1004 SetExpressionPosition(stmt->cond(), stmt->condition_position()); 1005 VisitForControl(stmt->cond(), 1006 &stack_check, 1007 loop_statement.break_label(), 1008 &stack_check); 1009 1010 // Check stack before looping. 1011 PrepareForBailoutForId(stmt->BackEdgeId(), NO_REGISTERS); 1012 __ bind(&stack_check); 1013 EmitStackCheck(stmt); 1014 __ jmp(&body); 1015 1016 PrepareForBailoutForId(stmt->ExitId(), NO_REGISTERS); 1017 __ bind(loop_statement.break_label()); 1018 decrement_loop_depth(); 1019} 1020 1021 1022void FullCodeGenerator::VisitWhileStatement(WhileStatement* stmt) { 1023 Comment cmnt(masm_, "[ WhileStatement"); 1024 Label test, body; 1025 1026 Iteration loop_statement(this, stmt); 1027 increment_loop_depth(); 1028 1029 // Emit the test at the bottom of the loop. 1030 __ jmp(&test); 1031 1032 PrepareForBailoutForId(stmt->BodyId(), NO_REGISTERS); 1033 __ bind(&body); 1034 Visit(stmt->body()); 1035 1036 // Emit the statement position here as this is where the while 1037 // statement code starts. 1038 __ bind(loop_statement.continue_label()); 1039 SetStatementPosition(stmt); 1040 1041 // Check stack before looping. 1042 EmitStackCheck(stmt); 1043 1044 __ bind(&test); 1045 VisitForControl(stmt->cond(), 1046 &body, 1047 loop_statement.break_label(), 1048 loop_statement.break_label()); 1049 1050 PrepareForBailoutForId(stmt->ExitId(), NO_REGISTERS); 1051 __ bind(loop_statement.break_label()); 1052 decrement_loop_depth(); 1053} 1054 1055 1056void FullCodeGenerator::VisitForStatement(ForStatement* stmt) { 1057 Comment cmnt(masm_, "[ ForStatement"); 1058 Label test, body; 1059 1060 Iteration loop_statement(this, stmt); 1061 if (stmt->init() != NULL) { 1062 Visit(stmt->init()); 1063 } 1064 1065 increment_loop_depth(); 1066 // Emit the test at the bottom of the loop (even if empty). 1067 __ jmp(&test); 1068 1069 PrepareForBailoutForId(stmt->BodyId(), NO_REGISTERS); 1070 __ bind(&body); 1071 Visit(stmt->body()); 1072 1073 PrepareForBailoutForId(stmt->ContinueId(), NO_REGISTERS); 1074 __ bind(loop_statement.continue_label()); 1075 SetStatementPosition(stmt); 1076 if (stmt->next() != NULL) { 1077 Visit(stmt->next()); 1078 } 1079 1080 // Emit the statement position here as this is where the for 1081 // statement code starts. 1082 SetStatementPosition(stmt); 1083 1084 // Check stack before looping. 1085 EmitStackCheck(stmt); 1086 1087 __ bind(&test); 1088 if (stmt->cond() != NULL) { 1089 VisitForControl(stmt->cond(), 1090 &body, 1091 loop_statement.break_label(), 1092 loop_statement.break_label()); 1093 } else { 1094 __ jmp(&body); 1095 } 1096 1097 PrepareForBailoutForId(stmt->ExitId(), NO_REGISTERS); 1098 __ bind(loop_statement.break_label()); 1099 decrement_loop_depth(); 1100} 1101 1102 1103void FullCodeGenerator::VisitTryCatchStatement(TryCatchStatement* stmt) { 1104 Comment cmnt(masm_, "[ TryCatchStatement"); 1105 SetStatementPosition(stmt); 1106 // The try block adds a handler to the exception handler chain 1107 // before entering, and removes it again when exiting normally. 1108 // If an exception is thrown during execution of the try block, 1109 // control is passed to the handler, which also consumes the handler. 1110 // At this point, the exception is in a register, and store it in 1111 // the temporary local variable (prints as ".catch-var") before 1112 // executing the catch block. The catch block has been rewritten 1113 // to introduce a new scope to bind the catch variable and to remove 1114 // that scope again afterwards. 1115 1116 Label try_handler_setup, done; 1117 __ Call(&try_handler_setup); 1118 // Try handler code, exception in result register. 1119 1120 // Extend the context before executing the catch block. 1121 { Comment cmnt(masm_, "[ Extend catch context"); 1122 __ Push(stmt->variable()->name()); 1123 __ push(result_register()); 1124 PushFunctionArgumentForContextAllocation(); 1125 __ CallRuntime(Runtime::kPushCatchContext, 3); 1126 StoreToFrameField(StandardFrameConstants::kContextOffset, 1127 context_register()); 1128 } 1129 1130 Scope* saved_scope = scope(); 1131 scope_ = stmt->scope(); 1132 ASSERT(scope_->declarations()->is_empty()); 1133 { WithOrCatch body(this); 1134 Visit(stmt->catch_block()); 1135 } 1136 // Restore the context. 1137 LoadContextField(context_register(), Context::PREVIOUS_INDEX); 1138 StoreToFrameField(StandardFrameConstants::kContextOffset, context_register()); 1139 scope_ = saved_scope; 1140 __ jmp(&done); 1141 1142 // Try block code. Sets up the exception handler chain. 1143 __ bind(&try_handler_setup); 1144 { 1145 const int delta = StackHandlerConstants::kSize / kPointerSize; 1146 TryCatch try_block(this); 1147 __ PushTryHandler(IN_JAVASCRIPT, TRY_CATCH_HANDLER); 1148 increment_stack_height(delta); 1149 Visit(stmt->try_block()); 1150 __ PopTryHandler(); 1151 decrement_stack_height(delta); 1152 } 1153 __ bind(&done); 1154} 1155 1156 1157void FullCodeGenerator::VisitTryFinallyStatement(TryFinallyStatement* stmt) { 1158 Comment cmnt(masm_, "[ TryFinallyStatement"); 1159 SetStatementPosition(stmt); 1160 // Try finally is compiled by setting up a try-handler on the stack while 1161 // executing the try body, and removing it again afterwards. 1162 // 1163 // The try-finally construct can enter the finally block in three ways: 1164 // 1. By exiting the try-block normally. This removes the try-handler and 1165 // calls the finally block code before continuing. 1166 // 2. By exiting the try-block with a function-local control flow transfer 1167 // (break/continue/return). The site of the, e.g., break removes the 1168 // try handler and calls the finally block code before continuing 1169 // its outward control transfer. 1170 // 3. by exiting the try-block with a thrown exception. 1171 // This can happen in nested function calls. It traverses the try-handler 1172 // chain and consumes the try-handler entry before jumping to the 1173 // handler code. The handler code then calls the finally-block before 1174 // rethrowing the exception. 1175 // 1176 // The finally block must assume a return address on top of the stack 1177 // (or in the link register on ARM chips) and a value (return value or 1178 // exception) in the result register (rax/eax/r0), both of which must 1179 // be preserved. The return address isn't GC-safe, so it should be 1180 // cooked before GC. 1181 Label finally_entry; 1182 Label try_handler_setup; 1183 const int original_stack_height = stack_height(); 1184 1185 // Setup the try-handler chain. Use a call to 1186 // Jump to try-handler setup and try-block code. Use call to put try-handler 1187 // address on stack. 1188 __ Call(&try_handler_setup); 1189 // Try handler code. Return address of call is pushed on handler stack. 1190 { 1191 // This code is only executed during stack-handler traversal when an 1192 // exception is thrown. The exception is in the result register, which 1193 // is retained by the finally block. 1194 // Call the finally block and then rethrow the exception if it returns. 1195 __ Call(&finally_entry); 1196 __ push(result_register()); 1197 __ CallRuntime(Runtime::kReThrow, 1); 1198 } 1199 1200 __ bind(&finally_entry); 1201 { 1202 // Finally block implementation. 1203 Finally finally_block(this); 1204 EnterFinallyBlock(); 1205 set_stack_height(original_stack_height + Finally::kElementCount); 1206 Visit(stmt->finally_block()); 1207 ExitFinallyBlock(); // Return to the calling code. 1208 } 1209 1210 __ bind(&try_handler_setup); 1211 { 1212 // Setup try handler (stack pointer registers). 1213 const int delta = StackHandlerConstants::kSize / kPointerSize; 1214 TryFinally try_block(this, &finally_entry); 1215 __ PushTryHandler(IN_JAVASCRIPT, TRY_FINALLY_HANDLER); 1216 set_stack_height(original_stack_height + delta); 1217 Visit(stmt->try_block()); 1218 __ PopTryHandler(); 1219 set_stack_height(original_stack_height); 1220 } 1221 // Execute the finally block on the way out. Clobber the unpredictable 1222 // value in the accumulator with one that's safe for GC. The finally 1223 // block will unconditionally preserve the accumulator on the stack. 1224 ClearAccumulator(); 1225 __ Call(&finally_entry); 1226} 1227 1228 1229void FullCodeGenerator::VisitDebuggerStatement(DebuggerStatement* stmt) { 1230#ifdef ENABLE_DEBUGGER_SUPPORT 1231 Comment cmnt(masm_, "[ DebuggerStatement"); 1232 SetStatementPosition(stmt); 1233 1234 __ DebugBreak(); 1235 // Ignore the return value. 1236#endif 1237} 1238 1239 1240void FullCodeGenerator::VisitConditional(Conditional* expr) { 1241 Comment cmnt(masm_, "[ Conditional"); 1242 Label true_case, false_case, done; 1243 VisitForControl(expr->condition(), &true_case, &false_case, &true_case); 1244 1245 PrepareForBailoutForId(expr->ThenId(), NO_REGISTERS); 1246 __ bind(&true_case); 1247 SetExpressionPosition(expr->then_expression(), 1248 expr->then_expression_position()); 1249 int start_stack_height = stack_height(); 1250 if (context()->IsTest()) { 1251 const TestContext* for_test = TestContext::cast(context()); 1252 VisitForControl(expr->then_expression(), 1253 for_test->true_label(), 1254 for_test->false_label(), 1255 NULL); 1256 } else { 1257 VisitInCurrentContext(expr->then_expression()); 1258 __ jmp(&done); 1259 } 1260 1261 PrepareForBailoutForId(expr->ElseId(), NO_REGISTERS); 1262 __ bind(&false_case); 1263 set_stack_height(start_stack_height); 1264 if (context()->IsTest()) ForwardBailoutToChild(expr); 1265 SetExpressionPosition(expr->else_expression(), 1266 expr->else_expression_position()); 1267 VisitInCurrentContext(expr->else_expression()); 1268 // If control flow falls through Visit, merge it with true case here. 1269 if (!context()->IsTest()) { 1270 __ bind(&done); 1271 } 1272} 1273 1274 1275void FullCodeGenerator::VisitLiteral(Literal* expr) { 1276 Comment cmnt(masm_, "[ Literal"); 1277 context()->Plug(expr->handle()); 1278} 1279 1280 1281void FullCodeGenerator::VisitFunctionLiteral(FunctionLiteral* expr) { 1282 Comment cmnt(masm_, "[ FunctionLiteral"); 1283 1284 // Build the function boilerplate and instantiate it. 1285 Handle<SharedFunctionInfo> function_info = 1286 Compiler::BuildFunctionInfo(expr, script()); 1287 if (function_info.is_null()) { 1288 SetStackOverflow(); 1289 return; 1290 } 1291 EmitNewClosure(function_info, expr->pretenure()); 1292} 1293 1294 1295void FullCodeGenerator::VisitSharedFunctionInfoLiteral( 1296 SharedFunctionInfoLiteral* expr) { 1297 Comment cmnt(masm_, "[ SharedFunctionInfoLiteral"); 1298 EmitNewClosure(expr->shared_function_info(), false); 1299} 1300 1301 1302void FullCodeGenerator::VisitThrow(Throw* expr) { 1303 Comment cmnt(masm_, "[ Throw"); 1304 // Throw has no effect on the stack height or the current expression context. 1305 // Usually the expression context is null, because throw is a statement. 1306 VisitForStackValue(expr->exception()); 1307 __ CallRuntime(Runtime::kThrow, 1); 1308 decrement_stack_height(); 1309 // Never returns here. 1310} 1311 1312 1313FullCodeGenerator::NestedStatement* FullCodeGenerator::TryCatch::Exit( 1314 int* stack_depth, 1315 int* context_length) { 1316 // The macros used here must preserve the result register. 1317 __ Drop(*stack_depth); 1318 __ PopTryHandler(); 1319 *stack_depth = 0; 1320 return previous_; 1321} 1322 1323 1324bool FullCodeGenerator::TryLiteralCompare(CompareOperation* compare, 1325 Label* if_true, 1326 Label* if_false, 1327 Label* fall_through) { 1328 Expression *expr; 1329 Handle<String> check; 1330 if (compare->IsLiteralCompareTypeof(&expr, &check)) { 1331 EmitLiteralCompareTypeof(expr, check, if_true, if_false, fall_through); 1332 return true; 1333 } 1334 1335 if (compare->IsLiteralCompareUndefined(&expr)) { 1336 EmitLiteralCompareUndefined(expr, if_true, if_false, fall_through); 1337 return true; 1338 } 1339 1340 return false; 1341} 1342 1343 1344#undef __ 1345 1346 1347} } // namespace v8::internal 1348