Lines Matching refs:code
6 // * Redistributions of source code must retain the above copyright
47 void Deoptimizer::PatchCodeForDeoptimization(Isolate* isolate, Code* code) {
48 Address code_start_address = code->instruction_start();
50 // code patching below, and is not needed any more.
51 code->InvalidateRelocation();
56 DeoptimizationInputData::cast(code->deoptimization_data());
64 // We need calls to have a predictable size in the unoptimized code, but
65 // this is optimized code, so we don't have to have a predictable size.
76 ASSERT(call_address + patch_size() <= code->instruction_end());
86 // The back edge bookkeeping code matches the pattern:
94 // We patch the code to the following form:
102 void Deoptimizer::PatchInterruptCodeAt(Code* unoptimized_code,
104 Code* interrupt_code,
105 Code* replacement_code) {
126 void Deoptimizer::RevertInterruptCodeAt(Code* unoptimized_code,
128 Code* interrupt_code,
129 Code* replacement_code) {
153 bool Deoptimizer::InterruptCodeIsPatched(Code* unoptimized_code,
155 Code* interrupt_code,
156 Code* replacement_code) {
324 output_[0]->SetRegister(fp.code(), input_->GetRegister(fp.code()));
325 output_[0]->SetRegister(cp.code(), input_->GetRegister(cp.code()));
332 Code* continuation = isolate_->builtins()->builtin(Builtins::kNotifyOSR);
354 input_->SetRegister(sp.code(), reinterpret_cast<intptr_t>(frame->sp()));
355 input_->SetRegister(fp.code(), reinterpret_cast<intptr_t>(frame->fp()));
376 output_frame->SetRegister(r0.code(), params);
377 output_frame->SetRegister(r1.code(), handler);
397 // This code tries to be close to ia32 code so that any changes can be
412 ASSERT(kDoubleRegZero.code() == 14);
413 ASSERT(kScratchDoubleReg.code() == 15);
435 // Get the address of the location in the code object (r3) (return
449 // r3: code address or 0 already loaded.
549 if (i == kDoubleRegZero.code()) continue;
550 if (i == kScratchDoubleReg.code()) continue;
