blob: 44062d6e79f78ca165bf2d29ba742a7c244196f5 [file] [log] [blame]
Ben Murdochda12d292016-06-02 14:46:10 +01001// Copyright 2014 the V8 project authors. All rights reserved.
2// Use of this source code is governed by a BSD-style license that can be
3// found in the LICENSE file.
4
5#include "src/deoptimizer.h"
6#include "src/codegen.h"
7#include "src/full-codegen/full-codegen.h"
8#include "src/register-configuration.h"
9#include "src/safepoint-table.h"
10
11namespace v8 {
12namespace internal {
13
14// LAY + LGHI/LHI + BRCL
15const int Deoptimizer::table_entry_size_ = 16;
16
17int Deoptimizer::patch_size() {
18#if V8_TARGET_ARCH_S390X
19 const int kCallInstructionSize = 16;
20#else
21 const int kCallInstructionSize = 10;
22#endif
23 return kCallInstructionSize;
24}
25
26void Deoptimizer::EnsureRelocSpaceForLazyDeoptimization(Handle<Code> code) {
27 // Empty because there is no need for relocation information for the code
28 // patching in Deoptimizer::PatchCodeForDeoptimization below.
29}
30
31void Deoptimizer::PatchCodeForDeoptimization(Isolate* isolate, Code* code) {
32 Address code_start_address = code->instruction_start();
33
34 // Invalidate the relocation information, as it will become invalid by the
35 // code patching below, and is not needed any more.
36 code->InvalidateRelocation();
37
38 if (FLAG_zap_code_space) {
39 // Fail hard and early if we enter this code object again.
40 byte* pointer = code->FindCodeAgeSequence();
41 if (pointer != NULL) {
42 pointer += kNoCodeAgeSequenceLength;
43 } else {
44 pointer = code->instruction_start();
45 }
46 CodePatcher patcher(isolate, pointer, 2);
47 patcher.masm()->bkpt(0);
48
49 DeoptimizationInputData* data =
50 DeoptimizationInputData::cast(code->deoptimization_data());
51 int osr_offset = data->OsrPcOffset()->value();
52 if (osr_offset > 0) {
53 CodePatcher osr_patcher(isolate, code->instruction_start() + osr_offset,
54 2);
55 osr_patcher.masm()->bkpt(0);
56 }
57 }
58
59 DeoptimizationInputData* deopt_data =
60 DeoptimizationInputData::cast(code->deoptimization_data());
61#ifdef DEBUG
62 Address prev_call_address = NULL;
63#endif
64 // For each LLazyBailout instruction insert a call to the corresponding
65 // deoptimization entry.
66 for (int i = 0; i < deopt_data->DeoptCount(); i++) {
67 if (deopt_data->Pc(i)->value() == -1) continue;
68 Address call_address = code_start_address + deopt_data->Pc(i)->value();
69 Address deopt_entry = GetDeoptimizationEntry(isolate, i, LAZY);
70 // We need calls to have a predictable size in the unoptimized code, but
71 // this is optimized code, so we don't have to have a predictable size.
72 int call_size_in_bytes = MacroAssembler::CallSizeNotPredictableCodeSize(
73 deopt_entry, kRelocInfo_NONEPTR);
74 DCHECK(call_size_in_bytes <= patch_size());
75 CodePatcher patcher(isolate, call_address, call_size_in_bytes);
76 patcher.masm()->Call(deopt_entry, kRelocInfo_NONEPTR);
77 DCHECK(prev_call_address == NULL ||
78 call_address >= prev_call_address + patch_size());
79 DCHECK(call_address + patch_size() <= code->instruction_end());
80#ifdef DEBUG
81 prev_call_address = call_address;
82#endif
83 }
84}
85
86void Deoptimizer::SetPlatformCompiledStubRegisters(
87 FrameDescription* output_frame, CodeStubDescriptor* descriptor) {
88 ApiFunction function(descriptor->deoptimization_handler());
89 ExternalReference xref(&function, ExternalReference::BUILTIN_CALL, isolate_);
90 intptr_t handler = reinterpret_cast<intptr_t>(xref.address());
91 int params = descriptor->GetHandlerParameterCount();
92 output_frame->SetRegister(r2.code(), params);
93 output_frame->SetRegister(r3.code(), handler);
94}
95
96void Deoptimizer::CopyDoubleRegisters(FrameDescription* output_frame) {
97 for (int i = 0; i < DoubleRegister::kNumRegisters; ++i) {
98 double double_value = input_->GetDoubleRegister(i);
99 output_frame->SetDoubleRegister(i, double_value);
100 }
101}
102
103#define __ masm()->
104
105// This code tries to be close to ia32 code so that any changes can be
106// easily ported.
107void Deoptimizer::TableEntryGenerator::Generate() {
108 GeneratePrologue();
109
110 // Save all the registers onto the stack
111 const int kNumberOfRegisters = Register::kNumRegisters;
112
113 RegList restored_regs = kJSCallerSaved | kCalleeSaved;
114
115 const int kDoubleRegsSize = kDoubleSize * DoubleRegister::kNumRegisters;
116
117 // Save all double registers before messing with them.
118 __ lay(sp, MemOperand(sp, -kDoubleRegsSize));
119 const RegisterConfiguration* config =
120 RegisterConfiguration::ArchDefault(RegisterConfiguration::CRANKSHAFT);
121 for (int i = 0; i < config->num_allocatable_double_registers(); ++i) {
122 int code = config->GetAllocatableDoubleCode(i);
123 const DoubleRegister dreg = DoubleRegister::from_code(code);
124 int offset = code * kDoubleSize;
125 __ StoreDouble(dreg, MemOperand(sp, offset));
126 }
127
128 // Push all GPRs onto the stack
129 __ lay(sp, MemOperand(sp, -kNumberOfRegisters * kPointerSize));
130 __ StoreMultipleP(r0, sp, MemOperand(sp)); // Save all 16 registers
131
132 __ mov(ip, Operand(ExternalReference(Isolate::kCEntryFPAddress, isolate())));
133 __ StoreP(fp, MemOperand(ip));
134
135 const int kSavedRegistersAreaSize =
136 (kNumberOfRegisters * kPointerSize) + kDoubleRegsSize;
137
138 // Get the bailout id from the stack.
139 __ LoadP(r4, MemOperand(sp, kSavedRegistersAreaSize));
140
141 // Cleanse the Return address for 31-bit
142 __ CleanseP(r14);
143
144 // Get the address of the location in the code object (r5)(return
145 // address for lazy deoptimization) and compute the fp-to-sp delta in
146 // register r6.
147 __ LoadRR(r5, r14);
148 __ la(r6, MemOperand(sp, kSavedRegistersAreaSize + (1 * kPointerSize)));
149 __ SubP(r6, fp, r6);
150
151 // Allocate a new deoptimizer object.
152 // Pass six arguments in r2 to r7.
153 __ PrepareCallCFunction(6, r7);
154 __ LoadImmP(r2, Operand::Zero());
155 Label context_check;
156 __ LoadP(r3, MemOperand(fp, CommonFrameConstants::kContextOrFrameTypeOffset));
157 __ JumpIfSmi(r3, &context_check);
158 __ LoadP(r2, MemOperand(fp, JavaScriptFrameConstants::kFunctionOffset));
159 __ bind(&context_check);
160 __ LoadImmP(r3, Operand(type())); // bailout type,
161 // r4: bailout id already loaded.
162 // r5: code address or 0 already loaded.
163 // r6: Fp-to-sp delta.
164 // Parm6: isolate is passed on the stack.
165 __ mov(r7, Operand(ExternalReference::isolate_address(isolate())));
166 __ StoreP(r7, MemOperand(sp, kStackFrameExtraParamSlot * kPointerSize));
167
168 // Call Deoptimizer::New().
169 {
170 AllowExternalCallThatCantCauseGC scope(masm());
171 __ CallCFunction(ExternalReference::new_deoptimizer_function(isolate()), 6);
172 }
173
174 // Preserve "deoptimizer" object in register r2 and get the input
175 // frame descriptor pointer to r3 (deoptimizer->input_);
176 __ LoadP(r3, MemOperand(r2, Deoptimizer::input_offset()));
177
178 // Copy core registers into FrameDescription::registers_[kNumRegisters].
179 // DCHECK(Register::kNumRegisters == kNumberOfRegisters);
180 // __ mvc(MemOperand(r3, FrameDescription::registers_offset()),
181 // MemOperand(sp), kNumberOfRegisters * kPointerSize);
182 // Copy core registers into FrameDescription::registers_[kNumRegisters].
183 // TODO(john.yan): optimize the following code by using mvc instruction
184 DCHECK(Register::kNumRegisters == kNumberOfRegisters);
185 for (int i = 0; i < kNumberOfRegisters; i++) {
186 int offset = (i * kPointerSize) + FrameDescription::registers_offset();
187 __ LoadP(r4, MemOperand(sp, i * kPointerSize));
188 __ StoreP(r4, MemOperand(r3, offset));
189 }
190
191 int double_regs_offset = FrameDescription::double_registers_offset();
192 // Copy double registers to
193 // double_registers_[DoubleRegister::kNumRegisters]
194 for (int i = 0; i < config->num_allocatable_double_registers(); ++i) {
195 int code = config->GetAllocatableDoubleCode(i);
196 int dst_offset = code * kDoubleSize + double_regs_offset;
197 int src_offset = code * kDoubleSize + kNumberOfRegisters * kPointerSize;
198 // TODO(joransiu): MVC opportunity
199 __ LoadDouble(d0, MemOperand(sp, src_offset));
200 __ StoreDouble(d0, MemOperand(r3, dst_offset));
201 }
202
203 // Remove the bailout id and the saved registers from the stack.
204 __ la(sp, MemOperand(sp, kSavedRegistersAreaSize + (1 * kPointerSize)));
205
206 // Compute a pointer to the unwinding limit in register r4; that is
207 // the first stack slot not part of the input frame.
208 __ LoadP(r4, MemOperand(r3, FrameDescription::frame_size_offset()));
209 __ AddP(r4, sp);
210
211 // Unwind the stack down to - but not including - the unwinding
212 // limit and copy the contents of the activation frame to the input
213 // frame description.
214 __ la(r5, MemOperand(r3, FrameDescription::frame_content_offset()));
215 Label pop_loop;
216 Label pop_loop_header;
217 __ b(&pop_loop_header, Label::kNear);
218 __ bind(&pop_loop);
219 __ pop(r6);
220 __ StoreP(r6, MemOperand(r5, 0));
221 __ la(r5, MemOperand(r5, kPointerSize));
222 __ bind(&pop_loop_header);
223 __ CmpP(r4, sp);
224 __ bne(&pop_loop);
225
226 // Compute the output frame in the deoptimizer.
227 __ push(r2); // Preserve deoptimizer object across call.
228 // r2: deoptimizer object; r3: scratch.
229 __ PrepareCallCFunction(1, r3);
230 // Call Deoptimizer::ComputeOutputFrames().
231 {
232 AllowExternalCallThatCantCauseGC scope(masm());
233 __ CallCFunction(
234 ExternalReference::compute_output_frames_function(isolate()), 1);
235 }
236 __ pop(r2); // Restore deoptimizer object (class Deoptimizer).
237
238 __ LoadP(sp, MemOperand(r2, Deoptimizer::caller_frame_top_offset()));
239
240 // Replace the current (input) frame with the output frames.
241 Label outer_push_loop, inner_push_loop, outer_loop_header, inner_loop_header;
242 // Outer loop state: r6 = current "FrameDescription** output_",
243 // r3 = one past the last FrameDescription**.
244 __ LoadlW(r3, MemOperand(r2, Deoptimizer::output_count_offset()));
245 __ LoadP(r6, MemOperand(r2, Deoptimizer::output_offset())); // r6 is output_.
246 __ ShiftLeftP(r3, r3, Operand(kPointerSizeLog2));
247 __ AddP(r3, r6, r3);
248 __ b(&outer_loop_header, Label::kNear);
249
250 __ bind(&outer_push_loop);
251 // Inner loop state: r4 = current FrameDescription*, r5 = loop index.
252 __ LoadP(r4, MemOperand(r6, 0)); // output_[ix]
253 __ LoadP(r5, MemOperand(r4, FrameDescription::frame_size_offset()));
254 __ b(&inner_loop_header, Label::kNear);
255
256 __ bind(&inner_push_loop);
257 __ AddP(r5, Operand(-sizeof(intptr_t)));
258 __ AddP(r8, r4, r5);
259 __ LoadP(r8, MemOperand(r8, FrameDescription::frame_content_offset()));
260 __ push(r8);
261
262 __ bind(&inner_loop_header);
263 __ CmpP(r5, Operand::Zero());
264 __ bne(&inner_push_loop); // test for gt?
265
266 __ AddP(r6, r6, Operand(kPointerSize));
267 __ bind(&outer_loop_header);
268 __ CmpP(r6, r3);
269 __ blt(&outer_push_loop);
270
271 __ LoadP(r3, MemOperand(r2, Deoptimizer::input_offset()));
272 for (int i = 0; i < config->num_allocatable_double_registers(); ++i) {
273 int code = config->GetAllocatableDoubleCode(i);
274 const DoubleRegister dreg = DoubleRegister::from_code(code);
275 int src_offset = code * kDoubleSize + double_regs_offset;
276 __ ld(dreg, MemOperand(r3, src_offset));
277 }
278
279 // Push state, pc, and continuation from the last output frame.
280 __ LoadP(r8, MemOperand(r4, FrameDescription::state_offset()));
281 __ push(r8);
282 __ LoadP(r8, MemOperand(r4, FrameDescription::pc_offset()));
283 __ push(r8);
284 __ LoadP(r8, MemOperand(r4, FrameDescription::continuation_offset()));
285 __ push(r8);
286
287 // Restore the registers from the last output frame.
288 __ LoadRR(r1, r4);
289 for (int i = kNumberOfRegisters - 1; i > 0; i--) {
290 int offset = (i * kPointerSize) + FrameDescription::registers_offset();
291 if ((restored_regs & (1 << i)) != 0) {
292 __ LoadP(ToRegister(i), MemOperand(r1, offset));
293 }
294 }
295
296 __ InitializeRootRegister();
297
298 __ pop(ip); // get continuation, leave pc on stack
299 __ pop(r14);
300 __ Jump(ip);
301 __ stop("Unreachable.");
302}
303
304void Deoptimizer::TableEntryGenerator::GeneratePrologue() {
305 // Create a sequence of deoptimization entries. Note that any
306 // registers may be still live.
307 Label done;
308 for (int i = 0; i < count(); i++) {
309 int start = masm()->pc_offset();
310 USE(start);
311 __ lay(sp, MemOperand(sp, -kPointerSize));
312 __ LoadImmP(ip, Operand(i));
313 __ b(&done);
314 int end = masm()->pc_offset();
315 USE(end);
316 DCHECK(masm()->pc_offset() - start == table_entry_size_);
317 }
318 __ bind(&done);
319 __ StoreP(ip, MemOperand(sp));
320}
321
322void FrameDescription::SetCallerPc(unsigned offset, intptr_t value) {
323 SetFrameSlot(offset, value);
324}
325
326void FrameDescription::SetCallerFp(unsigned offset, intptr_t value) {
327 SetFrameSlot(offset, value);
328}
329
330void FrameDescription::SetCallerConstantPool(unsigned offset, intptr_t value) {
331 // No out-of-line constant pool support.
332 UNREACHABLE();
333}
334
335#undef __
336
337} // namespace internal
338} // namespace v8