| OLD | NEW |
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 20 matching lines...) Expand all Loading... |
| 31 | 31 |
| 32 #include "codegen.h" | 32 #include "codegen.h" |
| 33 #include "deoptimizer.h" | 33 #include "deoptimizer.h" |
| 34 #include "full-codegen.h" | 34 #include "full-codegen.h" |
| 35 #include "safepoint-table.h" | 35 #include "safepoint-table.h" |
| 36 | 36 |
| 37 namespace v8 { | 37 namespace v8 { |
| 38 namespace internal { | 38 namespace internal { |
| 39 | 39 |
| 40 | 40 |
| 41 int Deoptimizer::table_entry_size_ = 10; | 41 const int Deoptimizer::table_entry_size_ = 10; |
| 42 | 42 |
| 43 | 43 |
| 44 int Deoptimizer::patch_size() { | 44 int Deoptimizer::patch_size() { |
| 45 return MacroAssembler::kCallInstructionLength; | 45 return MacroAssembler::kCallInstructionLength; |
| 46 } | 46 } |
| 47 | 47 |
| 48 | 48 |
| 49 #ifdef DEBUG | 49 #ifdef DEBUG |
| 50 // Overwrites code with int3 instructions. | 50 // Overwrites code with int3 instructions. |
| 51 static void ZapCodeRange(Address from, Address to) { | 51 static void ZapCodeRange(Address from, Address to) { |
| (...skipping 547 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 599 output_frame->SetState(Smi::FromInt(state)); | 599 output_frame->SetState(Smi::FromInt(state)); |
| 600 | 600 |
| 601 // Set the continuation for the topmost frame. | 601 // Set the continuation for the topmost frame. |
| 602 if (is_topmost && bailout_type_ != DEBUGGER) { | 602 if (is_topmost && bailout_type_ != DEBUGGER) { |
| 603 Code* continuation = (bailout_type_ == EAGER) | 603 Code* continuation = (bailout_type_ == EAGER) |
| 604 ? isolate_->builtins()->builtin(Builtins::kNotifyDeoptimized) | 604 ? isolate_->builtins()->builtin(Builtins::kNotifyDeoptimized) |
| 605 : isolate_->builtins()->builtin(Builtins::kNotifyLazyDeoptimized); | 605 : isolate_->builtins()->builtin(Builtins::kNotifyLazyDeoptimized); |
| 606 output_frame->SetContinuation( | 606 output_frame->SetContinuation( |
| 607 reinterpret_cast<intptr_t>(continuation->entry())); | 607 reinterpret_cast<intptr_t>(continuation->entry())); |
| 608 } | 608 } |
| 609 | |
| 610 if (output_count_ - 1 == frame_index) iterator->Done(); | |
| 611 } | 609 } |
| 612 | 610 |
| 613 | 611 |
| 614 void Deoptimizer::FillInputFrame(Address tos, JavaScriptFrame* frame) { | 612 void Deoptimizer::FillInputFrame(Address tos, JavaScriptFrame* frame) { |
| 615 // Set the register values. The values are not important as there are no | 613 // Set the register values. The values are not important as there are no |
| 616 // callee saved registers in JavaScript frames, so all registers are | 614 // callee saved registers in JavaScript frames, so all registers are |
| 617 // spilled. Registers rbp and rsp are set to the correct values though. | 615 // spilled. Registers rbp and rsp are set to the correct values though. |
| 618 for (int i = 0; i < Register::kNumRegisters; i++) { | 616 for (int i = 0; i < Register::kNumRegisters; i++) { |
| 619 input_->SetRegister(i, i * 4); | 617 input_->SetRegister(i, i * 4); |
| 620 } | 618 } |
| (...skipping 220 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 841 } | 839 } |
| 842 __ bind(&done); | 840 __ bind(&done); |
| 843 } | 841 } |
| 844 | 842 |
| 845 #undef __ | 843 #undef __ |
| 846 | 844 |
| 847 | 845 |
| 848 } } // namespace v8::internal | 846 } } // namespace v8::internal |
| 849 | 847 |
| 850 #endif // V8_TARGET_ARCH_X64 | 848 #endif // V8_TARGET_ARCH_X64 |
| OLD | NEW |