Lines Matching refs:Code
6 // * Redistributions of source code must retain the above copyright
53 // Get the optimized code.
54 Code* code = function->code();
55 Address code_start_address = code->instruction_start();
58 // code patching below, and is not needed any more.
59 code->InvalidateRelocation();
64 DeoptimizationInputData::cast(code->deoptimization_data());
81 ASSERT(call_address + patch_size() <= code->instruction_end());
87 Isolate* isolate = code->GetIsolate();
89 // Add the deoptimizing code to the list.
90 DeoptimizingCodeListNode* node = new DeoptimizingCodeListNode(code);
96 // Tell collector to treat this code object in a special way and
98 isolate->heap()->mark_compact_collector()->InvalidateCode(code);
100 // Set the code for the function to non-optimized version.
101 function->ReplaceCode(function->shared()->code());
115 void Deoptimizer::PatchStackCheckCodeAt(Code* unoptimized_code,
117 Code* check_code,
118 Code* replacement_code) {
136 // We patch the code to the following form:
149 // with the entry address of the replacement code.
163 void Deoptimizer::RevertStackCheckCodeAt(Code* unoptimized_code,
165 Code* check_code,
166 Code* replacement_code) {
185 // with the entry address of the replacement code.
340 output_[0]->SetRegister(fp.code(), input_->GetRegister(fp.code()));
341 output_[0]->SetRegister(cp.code(), input_->GetRegister(cp.code()));
348 Code* continuation = isolate_->builtins()->builtin(Builtins::kNotifyOSR);
449 Code* adaptor_trampoline =
461 Code* construct_stub = builtins->builtin(Builtins::kJSConstructStubGeneric);
539 PrintF(" 0x%08x: [top + %d] <- 0x%08x ; code object\n",
580 // This code is very similar to ia32 code, but relies on register names (fp, sp)
620 input_->GetRegister(fp.code()) - (2 * kPointerSize) - height_in_bytes;
643 // function code and AST id of the bailout.
671 ASSERT(!is_bottommost || input_->GetRegister(fp.code()) == fp_value);
674 output_frame->SetRegister(fp.code(), fp_value);
693 if (is_topmost) output_frame->SetRegister(cp.code(), value);
720 Code* non_optimized_code = function->shared()->code();
729 output_frame->SetRegister(pc.code(), pc_value);
740 Code* continuation = (bailout_type_ == EAGER)
757 input_->SetRegister(sp.code(), reinterpret_cast<intptr_t>(frame->sp()));
758 input_->SetRegister(fp.code(), reinterpret_cast<intptr_t>(frame->fp()));
772 // This code tries to be close to ia32 code so that any changes can be
794 ASSERT(last.code() > first.code());
795 ASSERT((last.code() - first.code()) ==
799 ASSERT((DwVfpRegister::FromAllocationIndex(i).code() <= last.code()) &&
800 (DwVfpRegister::FromAllocationIndex(i).code() >= first.code()));
816 // Get the address of the location in the code object if possible (r3) (return
840 // r3: code address or 0 already loaded.
