blob: ead877e1491dcce6665fd9b98ba681822a7ff60c [file] [log] [blame]
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001// 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
Emily Bernierd0a1eb72015-03-24 16:35:39 -04005#include "src/codegen.h"
6#include "src/deoptimizer.h"
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00007#include "src/full-codegen/full-codegen.h"
8#include "src/register-configuration.h"
Emily Bernierd0a1eb72015-03-24 16:35:39 -04009#include "src/safepoint-table.h"
10
11namespace v8 {
12namespace internal {
13
14const int Deoptimizer::table_entry_size_ = 8;
15
16
17int Deoptimizer::patch_size() {
18#if V8_TARGET_ARCH_PPC64
19 const int kCallInstructionSizeInWords = 7;
20#else
21 const int kCallInstructionSizeInWords = 4;
22#endif
23 return kCallInstructionSizeInWords * Assembler::kInstrSize;
24}
25
26
Ben Murdoch4a90d5f2016-03-22 12:00:34 +000027void Deoptimizer::EnsureRelocSpaceForLazyDeoptimization(Handle<Code> code) {
28 // Empty because there is no need for relocation information for the code
29 // patching in Deoptimizer::PatchCodeForDeoptimization below.
30}
31
32
Emily Bernierd0a1eb72015-03-24 16:35:39 -040033void Deoptimizer::PatchCodeForDeoptimization(Isolate* isolate, Code* code) {
34 Address code_start_address = code->instruction_start();
35
36 // Invalidate the relocation information, as it will become invalid by the
37 // code patching below, and is not needed any more.
38 code->InvalidateRelocation();
39
40 if (FLAG_zap_code_space) {
41 // Fail hard and early if we enter this code object again.
42 byte* pointer = code->FindCodeAgeSequence();
43 if (pointer != NULL) {
44 pointer += kNoCodeAgeSequenceLength;
45 } else {
46 pointer = code->instruction_start();
47 }
Ben Murdoch4a90d5f2016-03-22 12:00:34 +000048 CodePatcher patcher(isolate, pointer, 1);
Emily Bernierd0a1eb72015-03-24 16:35:39 -040049 patcher.masm()->bkpt(0);
50
51 DeoptimizationInputData* data =
52 DeoptimizationInputData::cast(code->deoptimization_data());
53 int osr_offset = data->OsrPcOffset()->value();
54 if (osr_offset > 0) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +000055 CodePatcher osr_patcher(isolate, code->instruction_start() + osr_offset,
56 1);
Emily Bernierd0a1eb72015-03-24 16:35:39 -040057 osr_patcher.masm()->bkpt(0);
58 }
59 }
60
61 DeoptimizationInputData* deopt_data =
62 DeoptimizationInputData::cast(code->deoptimization_data());
63#ifdef DEBUG
64 Address prev_call_address = NULL;
65#endif
66 // For each LLazyBailout instruction insert a call to the corresponding
67 // deoptimization entry.
68 for (int i = 0; i < deopt_data->DeoptCount(); i++) {
69 if (deopt_data->Pc(i)->value() == -1) continue;
70 Address call_address = code_start_address + deopt_data->Pc(i)->value();
71 Address deopt_entry = GetDeoptimizationEntry(isolate, i, LAZY);
72 // We need calls to have a predictable size in the unoptimized code, but
73 // this is optimized code, so we don't have to have a predictable size.
74 int call_size_in_bytes = MacroAssembler::CallSizeNotPredictableCodeSize(
75 deopt_entry, kRelocInfo_NONEPTR);
76 int call_size_in_words = call_size_in_bytes / Assembler::kInstrSize;
77 DCHECK(call_size_in_bytes % Assembler::kInstrSize == 0);
78 DCHECK(call_size_in_bytes <= patch_size());
Ben Murdoch4a90d5f2016-03-22 12:00:34 +000079 CodePatcher patcher(isolate, call_address, call_size_in_words);
Emily Bernierd0a1eb72015-03-24 16:35:39 -040080 patcher.masm()->Call(deopt_entry, kRelocInfo_NONEPTR);
81 DCHECK(prev_call_address == NULL ||
82 call_address >= prev_call_address + patch_size());
83 DCHECK(call_address + patch_size() <= code->instruction_end());
84#ifdef DEBUG
85 prev_call_address = call_address;
86#endif
87 }
88}
89
90
Emily Bernierd0a1eb72015-03-24 16:35:39 -040091void Deoptimizer::SetPlatformCompiledStubRegisters(
92 FrameDescription* output_frame, CodeStubDescriptor* descriptor) {
93 ApiFunction function(descriptor->deoptimization_handler());
94 ExternalReference xref(&function, ExternalReference::BUILTIN_CALL, isolate_);
95 intptr_t handler = reinterpret_cast<intptr_t>(xref.address());
96 int params = descriptor->GetHandlerParameterCount();
97 output_frame->SetRegister(r3.code(), params);
98 output_frame->SetRegister(r4.code(), handler);
99}
100
101
102void Deoptimizer::CopyDoubleRegisters(FrameDescription* output_frame) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000103 for (int i = 0; i < DoubleRegister::kNumRegisters; ++i) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400104 double double_value = input_->GetDoubleRegister(i);
105 output_frame->SetDoubleRegister(i, double_value);
106 }
107}
108
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400109#define __ masm()->
110
111// This code tries to be close to ia32 code so that any changes can be
112// easily ported.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000113void Deoptimizer::TableEntryGenerator::Generate() {
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400114 GeneratePrologue();
115
116 // Unlike on ARM we don't save all the registers, just the useful ones.
117 // For the rest, there are gaps on the stack, so the offsets remain the same.
118 const int kNumberOfRegisters = Register::kNumRegisters;
119
120 RegList restored_regs = kJSCallerSaved | kCalleeSaved;
121 RegList saved_regs = restored_regs | sp.bit();
122
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000123 const int kDoubleRegsSize = kDoubleSize * DoubleRegister::kNumRegisters;
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400124
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000125 // Save all double registers before messing with them.
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400126 __ subi(sp, sp, Operand(kDoubleRegsSize));
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000127 const RegisterConfiguration* config =
128 RegisterConfiguration::ArchDefault(RegisterConfiguration::CRANKSHAFT);
129 for (int i = 0; i < config->num_allocatable_double_registers(); ++i) {
130 int code = config->GetAllocatableDoubleCode(i);
131 const DoubleRegister dreg = DoubleRegister::from_code(code);
132 int offset = code * kDoubleSize;
133 __ stfd(dreg, MemOperand(sp, offset));
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400134 }
135
136 // Push saved_regs (needed to populate FrameDescription::registers_).
137 // Leave gaps for other registers.
138 __ subi(sp, sp, Operand(kNumberOfRegisters * kPointerSize));
139 for (int16_t i = kNumberOfRegisters - 1; i >= 0; i--) {
140 if ((saved_regs & (1 << i)) != 0) {
141 __ StoreP(ToRegister(i), MemOperand(sp, kPointerSize * i));
142 }
143 }
144
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000145 __ mov(ip, Operand(ExternalReference(Isolate::kCEntryFPAddress, isolate())));
146 __ StoreP(fp, MemOperand(ip));
147
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400148 const int kSavedRegistersAreaSize =
149 (kNumberOfRegisters * kPointerSize) + kDoubleRegsSize;
150
151 // Get the bailout id from the stack.
152 __ LoadP(r5, MemOperand(sp, kSavedRegistersAreaSize));
153
154 // Get the address of the location in the code object (r6) (return
155 // address for lazy deoptimization) and compute the fp-to-sp delta in
156 // register r7.
157 __ mflr(r6);
158 // Correct one word for bailout id.
159 __ addi(r7, sp, Operand(kSavedRegistersAreaSize + (1 * kPointerSize)));
160 __ sub(r7, fp, r7);
161
162 // Allocate a new deoptimizer object.
163 // Pass six arguments in r3 to r8.
164 __ PrepareCallCFunction(6, r8);
Ben Murdochda12d292016-06-02 14:46:10 +0100165 __ li(r3, Operand::Zero());
166 Label context_check;
167 __ LoadP(r4, MemOperand(fp, CommonFrameConstants::kContextOrFrameTypeOffset));
168 __ JumpIfSmi(r4, &context_check);
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400169 __ LoadP(r3, MemOperand(fp, JavaScriptFrameConstants::kFunctionOffset));
Ben Murdochda12d292016-06-02 14:46:10 +0100170 __ bind(&context_check);
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400171 __ li(r4, Operand(type())); // bailout type,
172 // r5: bailout id already loaded.
173 // r6: code address or 0 already loaded.
174 // r7: Fp-to-sp delta.
175 __ mov(r8, Operand(ExternalReference::isolate_address(isolate())));
176 // Call Deoptimizer::New().
177 {
178 AllowExternalCallThatCantCauseGC scope(masm());
179 __ CallCFunction(ExternalReference::new_deoptimizer_function(isolate()), 6);
180 }
181
182 // Preserve "deoptimizer" object in register r3 and get the input
183 // frame descriptor pointer to r4 (deoptimizer->input_);
184 __ LoadP(r4, MemOperand(r3, Deoptimizer::input_offset()));
185
186 // Copy core registers into FrameDescription::registers_[kNumRegisters].
187 DCHECK(Register::kNumRegisters == kNumberOfRegisters);
188 for (int i = 0; i < kNumberOfRegisters; i++) {
189 int offset = (i * kPointerSize) + FrameDescription::registers_offset();
190 __ LoadP(r5, MemOperand(sp, i * kPointerSize));
191 __ StoreP(r5, MemOperand(r4, offset));
192 }
193
194 int double_regs_offset = FrameDescription::double_registers_offset();
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000195 // Copy double registers to
196 // double_registers_[DoubleRegister::kNumRegisters]
197 for (int i = 0; i < config->num_allocatable_double_registers(); ++i) {
198 int code = config->GetAllocatableDoubleCode(i);
199 int dst_offset = code * kDoubleSize + double_regs_offset;
200 int src_offset = code * kDoubleSize + kNumberOfRegisters * kPointerSize;
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400201 __ lfd(d0, MemOperand(sp, src_offset));
202 __ stfd(d0, MemOperand(r4, dst_offset));
203 }
204
205 // Remove the bailout id and the saved registers from the stack.
206 __ addi(sp, sp, Operand(kSavedRegistersAreaSize + (1 * kPointerSize)));
207
208 // Compute a pointer to the unwinding limit in register r5; that is
209 // the first stack slot not part of the input frame.
210 __ LoadP(r5, MemOperand(r4, FrameDescription::frame_size_offset()));
211 __ add(r5, r5, sp);
212
213 // Unwind the stack down to - but not including - the unwinding
214 // limit and copy the contents of the activation frame to the input
215 // frame description.
216 __ addi(r6, r4, Operand(FrameDescription::frame_content_offset()));
217 Label pop_loop;
218 Label pop_loop_header;
219 __ b(&pop_loop_header);
220 __ bind(&pop_loop);
221 __ pop(r7);
222 __ StoreP(r7, MemOperand(r6, 0));
223 __ addi(r6, r6, Operand(kPointerSize));
224 __ bind(&pop_loop_header);
225 __ cmp(r5, sp);
226 __ bne(&pop_loop);
227
228 // Compute the output frame in the deoptimizer.
229 __ push(r3); // Preserve deoptimizer object across call.
230 // r3: deoptimizer object; r4: scratch.
231 __ PrepareCallCFunction(1, r4);
232 // Call Deoptimizer::ComputeOutputFrames().
233 {
234 AllowExternalCallThatCantCauseGC scope(masm());
235 __ CallCFunction(
236 ExternalReference::compute_output_frames_function(isolate()), 1);
237 }
238 __ pop(r3); // Restore deoptimizer object (class Deoptimizer).
239
Ben Murdochda12d292016-06-02 14:46:10 +0100240 __ LoadP(sp, MemOperand(r3, Deoptimizer::caller_frame_top_offset()));
241
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400242 // Replace the current (input) frame with the output frames.
243 Label outer_push_loop, inner_push_loop, outer_loop_header, inner_loop_header;
244 // Outer loop state: r7 = current "FrameDescription** output_",
245 // r4 = one past the last FrameDescription**.
246 __ lwz(r4, MemOperand(r3, Deoptimizer::output_count_offset()));
247 __ LoadP(r7, MemOperand(r3, Deoptimizer::output_offset())); // r7 is output_.
248 __ ShiftLeftImm(r4, r4, Operand(kPointerSizeLog2));
249 __ add(r4, r7, r4);
250 __ b(&outer_loop_header);
251
252 __ bind(&outer_push_loop);
253 // Inner loop state: r5 = current FrameDescription*, r6 = loop index.
254 __ LoadP(r5, MemOperand(r7, 0)); // output_[ix]
255 __ LoadP(r6, MemOperand(r5, FrameDescription::frame_size_offset()));
256 __ b(&inner_loop_header);
257
258 __ bind(&inner_push_loop);
259 __ addi(r6, r6, Operand(-sizeof(intptr_t)));
260 __ add(r9, r5, r6);
261 __ LoadP(r9, MemOperand(r9, FrameDescription::frame_content_offset()));
262 __ push(r9);
263
264 __ bind(&inner_loop_header);
265 __ cmpi(r6, Operand::Zero());
266 __ bne(&inner_push_loop); // test for gt?
267
268 __ addi(r7, r7, Operand(kPointerSize));
269 __ bind(&outer_loop_header);
270 __ cmp(r7, r4);
271 __ blt(&outer_push_loop);
272
273 __ LoadP(r4, MemOperand(r3, Deoptimizer::input_offset()));
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000274 for (int i = 0; i < config->num_allocatable_double_registers(); ++i) {
275 int code = config->GetAllocatableDoubleCode(i);
276 const DoubleRegister dreg = DoubleRegister::from_code(code);
277 int src_offset = code * kDoubleSize + double_regs_offset;
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400278 __ lfd(dreg, MemOperand(r4, src_offset));
279 }
280
281 // Push state, pc, and continuation from the last output frame.
282 __ LoadP(r9, MemOperand(r5, FrameDescription::state_offset()));
283 __ push(r9);
284 __ LoadP(r9, MemOperand(r5, FrameDescription::pc_offset()));
285 __ push(r9);
286 __ LoadP(r9, MemOperand(r5, FrameDescription::continuation_offset()));
287 __ push(r9);
288
289 // Restore the registers from the last output frame.
290 DCHECK(!(ip.bit() & restored_regs));
291 __ mr(ip, r5);
292 for (int i = kNumberOfRegisters - 1; i >= 0; i--) {
293 int offset = (i * kPointerSize) + FrameDescription::registers_offset();
294 if ((restored_regs & (1 << i)) != 0) {
295 __ LoadP(ToRegister(i), MemOperand(ip, offset));
296 }
297 }
298
299 __ InitializeRootRegister();
300
301 __ pop(ip); // get continuation, leave pc on stack
302 __ pop(r0);
303 __ mtlr(r0);
304 __ Jump(ip);
305 __ stop("Unreachable.");
306}
307
308
309void Deoptimizer::TableEntryGenerator::GeneratePrologue() {
310 Assembler::BlockTrampolinePoolScope block_trampoline_pool(masm());
311
312 // Create a sequence of deoptimization entries.
313 // Note that registers are still live when jumping to an entry.
314 Label done;
315 for (int i = 0; i < count(); i++) {
316 int start = masm()->pc_offset();
317 USE(start);
318 __ li(ip, Operand(i));
319 __ b(&done);
320 DCHECK(masm()->pc_offset() - start == table_entry_size_);
321 }
322 __ bind(&done);
323 __ push(ip);
324}
325
326
327void FrameDescription::SetCallerPc(unsigned offset, intptr_t value) {
328 SetFrameSlot(offset, value);
329}
330
331
332void FrameDescription::SetCallerFp(unsigned offset, intptr_t value) {
333 SetFrameSlot(offset, value);
334}
335
336
337void FrameDescription::SetCallerConstantPool(unsigned offset, intptr_t value) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000338 DCHECK(FLAG_enable_embedded_constant_pool);
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400339 SetFrameSlot(offset, value);
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400340}
341
342
343#undef __
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000344} // namespace internal
345} // namespace v8